[ { "path": ".gitignore", "content": ".idea/\n.DS_Store\n\nruntime/*\n!runtime/qrcode/bg.jpg\n!runtime/fonts" }, { "path": "Dockerfile", "content": "FROM golang:latest\n\nENV GOPROXY https://goproxy.cn,direct\nWORKDIR $GOPATH/src/github.com/EDDYCJY/go-gin-example\nCOPY . $GOPATH/src/github.com/EDDYCJY/go-gin-example\nRUN go build .\n\nEXPOSE 8000\nENTRYPOINT [\"./go-gin-example\"]\n" }, { "path": "LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) The go-gin-example Authors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n" }, { "path": "Makefile", "content": ".PHONY: build clean tool lint help\n\nall: build\n\nbuild:\n\t@go build -v .\n\ntool:\n\tgo vet ./...; true\n\tgofmt -w .\n\nlint:\n\tgolint ./...\n\nclean:\n\trm -rf go-gin-example\n\tgo clean -i .\n\nhelp:\n\t@echo \"make: compile packages and dependencies\"\n\t@echo \"make tool: run specified go tool\"\n\t@echo \"make lint: golint ./...\"\n\t@echo \"make clean: remove object files and cached files\"\n" }, { "path": "README.md", "content": "# Go Gin Example - Blog API[![rcard](https://goreportcard.com/badge/github.com/EDDYCJY/go-gin-example)](https://goreportcard.com/report/github.com/EDDYCJY/go-gin-example) [![GoDoc](http://img.shields.io/badge/go-documentation-blue.svg?style=flat-square)](https://godoc.org/github.com/EDDYCJY/go-gin-example) [![License](http://img.shields.io/badge/license-mit-blue.svg?style=flat-square)](https://raw.githubusercontent.com/EDDYCJY/go-gin-example/master/LICENSE)\n\nA production-ready RESTful blog API example built with Go and Gin framework, demonstrating real-world patterns and best practices.\n\n[简体中文](https://github.com/EDDYCJY/go-gin-example/blob/master/README_ZH.md)\n\n## Project Overview\n\nThis project is a comprehensive blog backend API system that provides complete article and tag management functionalities, along with features like JWT authentication, image upload, QR code generation, and Excel import/export.\n\n## Tech Stack\n\n| Category | Technology |\n|----------|------------|\n| Language | Go |\n| Web Framework | [Gin](https://github.com/gin-gonic/gin) |\n| ORM | [GORM](https://github.com/jinzhu/gorm) |\n| Database | MySQL |\n| Cache | Redis (via [Redigo](https://github.com/gomodule/redigo)) |\n| Authentication | JWT ([jwt-go](https://github.com/dgrijalva/jwt-go)) |\n| Configuration | [go-ini](https://github.com/go-ini/ini) |\n| API Documentation | [Swagger](https://github.com/swaggo/gin-swagger) |\n| Excel Processing | [excelize](https://github.com/360EntSecGroup-Skylar/excelize), [xlsx](https://github.com/tealeg/xlsx) |\n| Image Processing | [freetype](https://github.com/golang/freetype), [barcode](https://github.com/boombuler/barcode) |\n| Validation | [beego/validation](https://github.com/astaxie/beego/validation) |\n\n## Project Structure\n\n```\ngo-gin-example/\n├── conf/ # Configuration files\n│ └── app.ini # Application configuration\n├── docs/ # Documentation\n│ ├── sql/ # Database scripts\n│ │ └── blog.sql # Database schema\n│ └── swagger/ # Swagger documentation\n├── middleware/ # Middleware\n│ └── jwt/ # JWT authentication middleware\n│ └── jwt.go\n├── models/ # Data models (ORM)\n│ ├── article.go # Article model\n│ ├── auth.go # Auth model\n│ ├── models.go # Database initialization\n│ └── tag.go # Tag model\n├── pkg/ # Shared packages\n│ ├── app/ # Application utilities\n│ │ ├── form.go # Form binding\n│ │ ├── request.go # Request handling\n│ │ └── response.go # Response formatting\n│ ├── e/ # Error codes\n│ │ ├── cache.go # Cache key constants\n│ │ ├── code.go # Error code definitions\n│ │ └── msg.go # Error messages\n│ ├── export/ # Excel export utilities\n│ │ └── excel.go\n│ ├── file/ # File utilities\n│ │ └── file.go\n│ ├── gredis/ # Redis client\n│ │ └── redis.go\n│ ├── logging/ # Logging utilities\n│ │ ├── file.go\n│ │ └── log.go\n│ ├── qrcode/ # QR code generation\n│ │ └── qrcode.go\n│ ├── setting/ # Configuration management\n│ │ └── setting.go\n│ ├── upload/ # Image upload utilities\n│ │ └── image.go\n│ └── util/ # Common utilities\n│ ├── jwt.go # JWT utilities\n│ ├── md5.go # MD5 hashing\n│ ├── pagination.go # Pagination helper\n│ └── util.go\n├── routers/ # Route definitions\n│ ├── api/ # API handlers\n│ │ ├── v1/ # API v1 handlers\n│ │ │ ├── article.go # Article endpoints\n│ │ │ └── tag.go # Tag endpoints\n│ │ ├── auth.go # Authentication endpoint\n│ │ └── upload.go # Image upload endpoint\n│ └── router.go # Route initialization\n├── runtime/ # Runtime resources\n│ ├── fonts/ # Font files\n│ └── qrcode/ # QR code resources\n├── service/ # Business logic layer\n│ ├── article_service/ # Article services\n│ │ ├── article.go # Article CRUD operations\n│ │ └── article_poster.go # Poster generation\n│ ├── auth_service/ # Auth services\n│ │ └── auth.go\n│ ├── cache_service/ # Cache key generation\n│ │ ├── article.go\n│ │ └── tag.go\n│ └── tag_service/ # Tag services\n│ └── tag.go\n├── Dockerfile # Docker build file\n├── Makefile # Build automation\n├── go.mod # Go module definition\n├── go.sum # Dependency checksums\n└── main.go # Application entry point\n```\n\n## Architecture\n\nThe project follows a layered architecture pattern:\n\n```\n┌─────────────────────────────────────────────────────────────┐\n│ HTTP Requests │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ Middleware Layer │\n│ (JWT Authentication) │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ Router Layer │\n│ (routers/api/v1/*.go) │\n│ - Request validation │\n│ - Parameter binding │\n│ - Response formatting │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ Service Layer │\n│ (service/*/*.go) │\n│ - Business logic │\n│ - Cache management │\n│ - Cross-model operations │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ Model Layer │\n│ (models/*.go) │\n│ - Database operations │\n│ - CRUD methods │\n│ - Data structures │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ Storage Layer │\n│ MySQL (Primary) + Redis (Cache) │\n└─────────────────────────────────────────────────────────────┘\n```\n\n## Feature Tree\n\n```\nGo Gin Blog API\n├── Authentication\n│ └── JWT Login Validation\n│ ├── Token Generation (3-hour expiry)\n│ ├── Token Validation\n│ └── Token Refresh\n├── Article Management\n│ ├── Create Article\n│ ├── Read Article (with Redis caching)\n│ ├── Update Article\n│ ├── Delete Article (soft delete)\n│ ├── List Articles (paginated)\n│ ├── Count Articles\n│ └── Generate Article Poster\n│ ├── Embed QR Code\n│ ├── Apply Background Image\n│ ├── Render Text Overlay\n│ └── Save Merged Image\n├── Tag Management\n│ ├── CRUD Operations\n│ │ ├── Create Tag\n│ │ ├── Read Tags (paginated, cached)\n│ │ ├── Update Tag\n│ │ └── Delete Tag (soft delete)\n│ ├── Export Tags to Excel\n│ └── Import Tags from Excel\n├── File Upload\n│ └── Image Upload\n│ ├── Format validation (.jpg, .jpeg, .png)\n│ ├── Size validation (max 5MB)\n│ └── MD5-based naming\n├── API Documentation\n│ └── Swagger UI (/swagger/*any)\n└── Static File Serving\n ├── Exported Excel files (/export)\n ├── Uploaded images (/upload/images)\n └── Generated QR codes (/qrcode)\n```\n\n## API Endpoints\n\n### Public Endpoints\n\n| Method | Endpoint | Description |\n|--------|----------|-------------|\n| POST | `/auth` | User authentication, returns JWT token |\n| GET | `/swagger/*any` | Swagger API documentation |\n| POST | `/upload` | Image upload |\n| POST | `/tags/export` | Export tags to Excel |\n| POST | `/tags/import` | Import tags from Excel |\n\n### Protected Endpoints (Require JWT Token)\n\n#### Tags\n\n| Method | Endpoint | Description |\n|--------|----------|-------------|\n| GET | `/api/v1/tags` | Get tag list (paginated) |\n| POST | `/api/v1/tags` | Create new tag |\n| PUT | `/api/v1/tags/:id` | Update tag by ID |\n| DELETE | `/api/v1/tags/:id` | Delete tag by ID |\n\n#### Articles\n\n| Method | Endpoint | Description |\n|--------|----------|-------------|\n| GET | `/api/v1/articles` | Get article list (paginated) |\n| GET | `/api/v1/articles/:id` | Get article by ID |\n| POST | `/api/v1/articles` | Create new article |\n| PUT | `/api/v1/articles/:id` | Update article by ID |\n| DELETE | `/api/v1/articles/:id` | Delete article by ID |\n| POST | `/api/v1/articles/poster/generate` | Generate article poster with QR code |\n\n## Database Schema\n\n### Tables\n\n**blog_auth** - User authentication\n```sql\n- id: INT (PK, AUTO_INCREMENT)\n- username: VARCHAR(50)\n- password: VARCHAR(50)\n```\n\n**blog_tag** - Article tags\n```sql\n- id: INT (PK, AUTO_INCREMENT)\n- name: VARCHAR(100) - Tag name\n- created_on: INT - Creation timestamp\n- created_by: VARCHAR(100) - Creator\n- modified_on: INT - Modification timestamp\n- modified_by: VARCHAR(100) - Modifier\n- deleted_on: INT - Deletion timestamp (soft delete)\n- state: TINYINT - Status (0: disabled, 1: enabled)\n```\n\n**blog_article** - Articles\n```sql\n- id: INT (PK, AUTO_INCREMENT)\n- tag_id: INT (FK) - Associated tag ID\n- title: VARCHAR(100) - Article title\n- desc: VARCHAR(255) - Description\n- content: TEXT - Article content\n- cover_image_url: VARCHAR(255) - Cover image URL\n- created_on: INT - Creation timestamp\n- created_by: VARCHAR(100) - Creator\n- modified_on: INT - Modification timestamp\n- modified_by: VARCHAR(255) - Modifier\n- deleted_on: INT - Deletion timestamp (soft delete)\n- state: TINYINT - Status\n```\n\n## Configuration\n\nConfiguration is managed through `conf/app.ini`:\n\n```ini\n[app]\nPageSize = 10 # Pagination page size\nJwtSecret = 233 # JWT signing secret\nPrefixUrl = http://127.0.0.1:8000\nRuntimeRootPath = runtime/\nImageSavePath = upload/images/\nImageMaxSize = 5 # Max image size in MB\nImageAllowExts = .jpg,.jpeg,.png\nExportSavePath = export/\nQrCodeSavePath = qrcode/\nFontSavePath = fonts/\nLogSavePath = logs/\n\n[server]\nRunMode = debug # debug or release\nHttpPort = 8000\nReadTimeout = 60 # seconds\nWriteTimeout = 60 # seconds\n\n[database]\nType = mysql\nUser = root\nPassword = rootroot\nHost = 127.0.0.1:3306\nName = blog\nTablePrefix = blog_\n\n[redis]\nHost = 127.0.0.1:6379\nPassword =\nMaxIdle = 30\nMaxActive = 30\nIdleTimeout = 200\n```\n\n## Getting Started\n\n### Prerequisites\n\n- Go 1.13+\n- MySQL 5.6+\n- Redis\n\n### Database Setup\n\n1. Create a MySQL database named `blog`\n2. Execute the SQL script:\n```bash\nmysql -u root -p blog < docs/sql/blog.sql\n```\n\n### Configuration\n\n1. Edit `conf/app.ini` to match your environment\n2. Update database credentials\n3. Update Redis connection settings\n\n### Running the Application\n\n```bash\n# Build\nmake build\n\n# Run\n./go-gin-example\n\n# Or run directly\ngo run main.go\n```\n\nThe server will start at `http://localhost:8000`\n\n### Using Docker\n\n```bash\n# Build image\ndocker build -t go-gin-example .\n\n# Run container\ndocker run -p 8000:8000 go-gin-example\n```\n\n## API Usage Examples\n\n### 1. Get Authentication Token\n\n```bash\ncurl -X POST http://localhost:8000/auth \\\n -d \"username=test&password=test123\"\n```\n\nResponse:\n```json\n{\n \"code\": 200,\n \"msg\": \"ok\",\n \"data\": {\n \"token\": \"eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9...\"\n }\n}\n```\n\n### 2. Create a Tag\n\n```bash\ncurl -X POST \"http://localhost:8000/api/v1/tags?token=YOUR_TOKEN\" \\\n -d \"name=Go&created_by=admin&state=1\"\n```\n\n### 3. Get Tags List\n\n```bash\ncurl \"http://localhost:8000/api/v1/tags?token=YOUR_TOKEN\"\n```\n\n### 4. Create an Article\n\n```bash\ncurl -X POST \"http://localhost:8000/api/v1/articles?token=YOUR_TOKEN\" \\\n -d \"tag_id=1&title=Hello Gin&desc=Introduction to Gin&content=Article content...&created_by=admin&cover_image_url=http://example.com/image.jpg&state=1\"\n```\n\n### 5. Upload an Image\n\n```bash\ncurl -X POST http://localhost:8000/upload \\\n -F \"image=@/path/to/image.jpg\"\n```\n\n### 6. Export Tags to Excel\n\n```bash\ncurl -X POST http://localhost:8000/tags/export\n```\n\n## Key Design Patterns\n\n### 1. Soft Delete\nAll models use soft delete by setting `deleted_on` timestamp instead of actual deletion.\n\n### 2. Redis Caching\nArticles and tags are cached in Redis with 1-hour TTL to reduce database load.\n\n### 3. Service Layer Pattern\nBusiness logic is separated into service layer, keeping handlers thin and focused on request/response handling.\n\n### 4. Unified Response Format\nAll API responses follow consistent format:\n```json\n{\n \"code\": 200,\n \"msg\": \"ok\",\n \"data\": {}\n}\n```\n\n### 5. Custom GORM Callbacks\nCustom callbacks for automatic timestamp management:\n- `CreatedOn` set on create\n- `ModifiedOn` updated on modifications\n- `DeletedOn` set on soft delete\n\n## Error Codes\n\n| Code | Description |\n|------|-------------|\n| 200 | Success |\n| 400 | Invalid parameters |\n| 500 | Internal server error |\n| 10001 | Tag already exists |\n| 10003 | Tag not found |\n| 10011 | Article not found |\n| 20001 | Token validation failed |\n| 20002 | Token expired |\n| 20003 | Token generation error |\n| 20004 | Authentication failed |\n| 30001 | Image save failed |\n| 30002 | Image check failed |\n| 30003 | Invalid image format |\n\n## Development Commands\n\n```bash\n# Build\nmake build\n\n# Run code analysis\nmake tool\n\n# Run linter\nmake lint\n\n# Clean build artifacts\nmake clean\n```\n\n## License\n\nMIT License - See [LICENSE](LICENSE) for details.\n\n## Credits\n\nProject by [EDDYCJY](https://github.com/EDDYCJY/go-gin-example)\n" }, { "path": "README_ZH.md", "content": "# Go Gin Example - 博客 API [![rcard](https://goreportcard.com/badge/github.com/EDDYCJY/go-gin-example)](https://goreportcard.com/report/github.com/EDDYCJY/go-gin-example) [![GoDoc](http://img.shields.io/badge/go-documentation-blue.svg?style=flat-square)](https://godoc.org/github.com/EDDYCJY/go-gin-example) [![License](http://img.shields.io/badge/license-mit-blue.svg?style=flat-square)](https://raw.githubusercontent.com/EDDYCJY/go-gin-example/master/LICENSE)\n\n一个基于 Go 和 Gin 框架构建的生产级 RESTful 博客 API 示例，展示了真实项目的设计模式和最佳实践。\n\n\n## 目录\n\n本项目提供 [Gin实践](https://segmentfault.com/a/1190000013297625) 的连载示例代码\n\n1. [Gin实践 连载一 Golang介绍与环境安装](https://book.eddycjy.com/golang/gin/install.html)\n2. [Gin实践 连载二 搭建Blog API's（一）](https://book.eddycjy.com/golang/gin/api-01.html)\n3. [Gin实践 连载三 搭建Blog API's（二）](https://book.eddycjy.com/golang/gin/api-02.html)\n4. [Gin实践 连载四 搭建Blog API's（三）](https://book.eddycjy.com/golang/gin/api-03.html)\n5. [Gin实践 连载五 使用JWT进行身份校验](https://book.eddycjy.com/golang/gin/jwt.html)\n6. [Gin实践 连载六 编写一个简单的文件日志](https://book.eddycjy.com/golang/gin/log.html)\n7. [Gin实践 连载七 Golang优雅重启HTTP服务](https://book.eddycjy.com/golang/gin/reload-http.html)\n8. [Gin实践 连载八 为它加上Swagger](https://book.eddycjy.com/golang/gin/swagger.html)\n9. [Gin实践 连载九 将Golang应用部署到Docker](https://book.eddycjy.com/golang/gin/golang-docker.html)\n10. [Gin实践 连载十 定制 GORM Callbacks](https://book.eddycjy.com/golang/gin/gorm-callback.html)\n11. [Gin实践 连载十一 Cron定时任务](https://book.eddycjy.com/golang/gin/cron.html)\n12. [Gin实践 连载十二 优化配置结构及实现图片上传](https://book.eddycjy.com/golang/gin/config-upload.html)\n13. [Gin实践 连载十三 优化你的应用结构和实现Redis缓存](https://book.eddycjy.com/golang/gin/application-redis.html)\n14. [Gin实践 连载十四 实现导出、导入 Excel](https://book.eddycjy.com/golang/gin/excel.html)\n15. [Gin实践 连载十五 生成二维码、合并海报](https://book.eddycjy.com/golang/gin/image.html)\n16. [Gin实践 连载十六 在图片上绘制文字](https://book.eddycjy.com/golang/gin/font.html)\n17. [Gin实践 连载十七 用 Nginx 部署 Go 应用](https://book.eddycjy.com/golang/gin/nginx.html)\n18. [Gin实践 番外 Golang交叉编译](https://book.eddycjy.com/golang/gin/cgo.html)\n19. [Gin实践 番外 请入门 Makefile](https://book.eddycjy.com/golang/gin/makefile.html)\n\n\n## 技术栈\n\n| 分类 | 技术 |\n|------|------|\n| 编程语言 | Go |\n| Web 框架 | [Gin](https://github.com/gin-gonic/gin) |\n| ORM | [GORM](https://github.com/jinzhu/gorm) |\n| 数据库 | MySQL |\n| 缓存 | Redis (通过 [Redigo](https://github.com/gomodule/redigo)) |\n| 认证 | JWT ([jwt-go](https://github.com/dgrijalva/jwt-go)) |\n| 配置管理 | [go-ini](https://github.com/go-ini/ini) |\n| API 文档 | [Swagger](https://github.com/swaggo/gin-swagger) |\n| Excel 处理 | [excelize](https://github.com/360EntSecGroup-Skylar/excelize), [xlsx](https://github.com/tealeg/xlsx) |\n| 图片处理 | [freetype](https://github.com/golang/freetype), [barcode](https://github.com/boombuler/barcode) |\n| 参数校验 | [beego/validation](https://github.com/astaxie/beego/validation) |\n\n## 项目结构\n\n```\ngo-gin-example/\n├── conf/ # 配置文件目录\n│ └── app.ini # 应用配置文件\n├── docs/ # 文档目录\n│ ├── sql/ # 数据库脚本\n│ │ └── blog.sql # 数据库表结构\n│ └── swagger/ # Swagger 文档\n├── middleware/ # 中间件\n│ └── jwt/ # JWT 认证中间件\n│ └── jwt.go\n├── models/ # 数据模型层 (ORM)\n│ ├── article.go # 文章模型\n│ ├── auth.go # 认证模型\n│ ├── models.go # 数据库初始化\n│ └── tag.go # 标签模型\n├── pkg/ # 公共包\n│ ├── app/ # 应用工具\n│ │ ├── form.go # 表单绑定\n│ │ ├── request.go # 请求处理\n│ │ └── response.go # 响应格式化\n│ ├── e/ # 错误码\n│ │ ├── cache.go # 缓存键常量\n│ │ ├── code.go # 错误码定义\n│ │ └── msg.go # 错误信息\n│ ├── export/ # Excel 导出工具\n│ │ └── excel.go\n│ ├── file/ # 文件工具\n│ │ └── file.go\n│ ├── gredis/ # Redis 客户端\n│ │ └── redis.go\n│ ├── logging/ # 日志工具\n│ │ ├── file.go\n│ │ └── log.go\n│ ├── qrcode/ # 二维码生成\n│ │ └── qrcode.go\n│ ├── setting/ # 配置管理\n│ │ └── setting.go\n│ ├── upload/ # 图片上传工具\n│ │ └── image.go\n│ └── util/ # 通用工具\n│ ├── jwt.go # JWT 工具\n│ ├── md5.go # MD5 哈希\n│ ├── pagination.go # 分页助手\n│ └── util.go\n├── routers/ # 路由定义\n│ ├── api/ # API 处理器\n│ │ ├── v1/ # API v1 处理器\n│ │ │ ├── article.go # 文章接口\n│ │ │ └── tag.go # 标签接口\n│ │ ├── auth.go # 认证接口\n│ │ └── upload.go # 图片上传接口\n│ └── router.go # 路由初始化\n├── runtime/ # 运行时资源\n│ ├── fonts/ # 字体文件\n│ └── qrcode/ # 二维码资源\n├── service/ # 业务逻辑层\n│ ├── article_service/ # 文章服务\n│ │ ├── article.go # 文章 CRUD 操作\n│ │ └── article_poster.go # 海报生成\n│ ├── auth_service/ # 认证服务\n│ │ └── auth.go\n│ ├── cache_service/ # 缓存键生成\n│ │ ├── article.go\n│ │ └── tag.go\n│ └── tag_service/ # 标签服务\n│ └── tag.go\n├── Dockerfile # Docker 构建文件\n├── Makefile # 构建自动化\n├── go.mod # Go 模块定义\n├── go.sum # 依赖校验\n└── main.go # 应用入口\n```\n\n## 架构设计\n\n项目采用分层架构模式：\n\n```\n┌─────────────────────────────────────────────────────────────┐\n│ HTTP 请求 │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ 中间件层 │\n│ (JWT 认证) │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ 路由层 │\n│ (routers/api/v1/*.go) │\n│ - 请求校验 │\n│ - 参数绑定 │\n│ - 响应格式化 │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ 服务层 │\n│ (service/*/*.go) │\n│ - 业务逻辑 │\n│ - 缓存管理 │\n│ - 跨模型操作 │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ 模型层 │\n│ (models/*.go) │\n│ - 数据库操作 │\n│ - CRUD 方法 │\n│ - 数据结构 │\n└─────────────────────────────────────────────────────────────┘\n │\n ▼\n┌─────────────────────────────────────────────────────────────┐\n│ 存储层 │\n│ MySQL (主存储) + Redis (缓存) │\n└─────────────────────────────────────────────────────────────┘\n```\n\n## 功能树\n\n```\nGo Gin 博客 API\n├── 认证模块\n│ └── JWT 登录验证\n│ ├── Token 生成（3小时有效期）\n│ ├── Token 验证\n│ └── Token 刷新\n├── 文章管理\n│ ├── 创建文章\n│ ├── 查询文章（带 Redis 缓存）\n│ ├── 更新文章\n│ ├── 删除文章（软删除）\n│ ├── 文章列表（分页）\n│ ├── 文章统计\n│ └── 生成文章海报\n│ ├── 嵌入二维码\n│ ├── 应用背景图\n│ ├── 渲染文字叠加\n│ └── 保存合成图片\n├── 标签管理\n│ ├── CRUD 操作\n│ │ ├── 创建标签\n│ │ ├── 查询标签（分页，带缓存）\n│ │ ├── 更新标签\n│ │ └── 删除标签（软删除）\n│ ├── 导出标签到 Excel\n│ └── 从 Excel 导入标签\n├── 文件上传\n│ └── 图片上传\n│ ├── 格式校验 (.jpg, .jpeg, .png)\n│ ├── 大小校验（最大 5MB）\n│ └── MD5 命名\n├── API 文档\n│ └── Swagger UI (/swagger/*any)\n└── 静态文件服务\n ├── 导出的 Excel 文件 (/export)\n ├── 上传的图片 (/upload/images)\n └── 生成的二维码 (/qrcode)\n```\n\n## API 接口\n\n### 公开接口\n\n| 方法 | 接口 | 描述 |\n|------|------|------|\n| POST | `/auth` | 用户认证，返回 JWT Token |\n| GET | `/swagger/*any` | Swagger API 文档 |\n| POST | `/upload` | 图片上传 |\n| POST | `/tags/export` | 导出标签到 Excel |\n| POST | `/tags/import` | 从 Excel 导入标签 |\n\n### 受保护接口（需要 JWT Token）\n\n#### 标签接口\n\n| 方法 | 接口 | 描述 |\n|------|------|------|\n| GET | `/api/v1/tags` | 获取标签列表（分页） |\n| POST | `/api/v1/tags` | 创建新标签 |\n| PUT | `/api/v1/tags/:id` | 根据 ID 更新标签 |\n| DELETE | `/api/v1/tags/:id` | 根据 ID 删除标签 |\n\n#### 文章接口\n\n| 方法 | 接口 | 描述 |\n|------|------|------|\n| GET | `/api/v1/articles` | 获取文章列表（分页） |\n| GET | `/api/v1/articles/:id` | 根据 ID 获取文章 |\n| POST | `/api/v1/articles` | 创建新文章 |\n| PUT | `/api/v1/articles/:id` | 根据 ID 更新文章 |\n| DELETE | `/api/v1/articles/:id` | 根据 ID 删除文章 |\n| POST | `/api/v1/articles/poster/generate` | 生成带二维码的文章海报 |\n\n## 数据库设计\n\n### 数据表\n\n**blog_auth** - 用户认证表\n```sql\n- id: INT (主键, 自增)\n- username: VARCHAR(50) - 用户名\n- password: VARCHAR(50) - 密码\n```\n\n**blog_tag** - 文章标签表\n```sql\n- id: INT (主键, 自增)\n- name: VARCHAR(100) - 标签名称\n- created_on: INT - 创建时间戳\n- created_by: VARCHAR(100) - 创建人\n- modified_on: INT - 修改时间戳\n- modified_by: VARCHAR(100) - 修改人\n- deleted_on: INT - 删除时间戳（软删除）\n- state: TINYINT - 状态 (0: 禁用, 1: 启用)\n```\n\n**blog_article** - 文章表\n```sql\n- id: INT (主键, 自增)\n- tag_id: INT (外键) - 关联标签 ID\n- title: VARCHAR(100) - 文章标题\n- desc: VARCHAR(255) - 文章简述\n- content: TEXT - 文章内容\n- cover_image_url: VARCHAR(255) - 封面图片地址\n- created_on: INT - 创建时间戳\n- created_by: VARCHAR(100) - 创建人\n- modified_on: INT - 修改时间戳\n- modified_by: VARCHAR(255) - 修改人\n- deleted_on: INT - 删除时间戳（软删除）\n- state: TINYINT - 状态\n```\n\n## 配置说明\n\n配置文件位于 `conf/app.ini`：\n\n```ini\n[app]\nPageSize = 10 # 分页大小\nJwtSecret = 233 # JWT 签名密钥\nPrefixUrl = http://127.0.0.1:8000\nRuntimeRootPath = runtime/\nImageSavePath = upload/images/\nImageMaxSize = 5 # 图片最大大小（MB）\nImageAllowExts = .jpg,.jpeg,.png\nExportSavePath = export/\nQrCodeSavePath = qrcode/\nFontSavePath = fonts/\nLogSavePath = logs/\n\n[server]\nRunMode = debug # debug 或 release\nHttpPort = 8000\nReadTimeout = 60 # 秒\nWriteTimeout = 60 # 秒\n\n[database]\nType = mysql\nUser = root\nPassword = rootroot\nHost = 127.0.0.1:3306\nName = blog\nTablePrefix = blog_\n\n[redis]\nHost = 127.0.0.1:6379\nPassword =\nMaxIdle = 30\nMaxActive = 30\nIdleTimeout = 200\n```\n\n## 快速开始\n\n### 环境要求\n\n- Go 1.13+\n- MySQL 5.6+\n- Redis\n\n### 数据库初始化\n\n1. 创建名为 `blog` 的 MySQL 数据库\n2. 执行 SQL 脚本：\n```bash\nmysql -u root -p blog < docs/sql/blog.sql\n```\n\n### 配置修改\n\n1. 编辑 `conf/app.ini` 以匹配您的环境\n2. 更新数据库连接信息\n3. 更新 Redis 连接配置\n\n### 运行应用\n\n```bash\n# 构建\nmake build\n\n# 运行\n./go-gin-example\n\n# 或直接运行\ngo run main.go\n```\n\n服务将启动在 `http://localhost:8000`\n\n### 使用 Docker\n\n```bash\n# 构建镜像\ndocker build -t go-gin-example .\n\n# 运行容器\ndocker run -p 8000:8000 go-gin-example\n```\n\n## API 使用示例\n\n### 1. 获取认证 Token\n\n```bash\ncurl -X POST http://localhost:8000/auth \\\n -d \"username=test&password=test123\"\n```\n\n响应：\n```json\n{\n \"code\": 200,\n \"msg\": \"ok\",\n \"data\": {\n \"token\": \"eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9...\"\n }\n}\n```\n\n### 2. 创建标签\n\n```bash\ncurl -X POST \"http://localhost:8000/api/v1/tags?token=YOUR_TOKEN\" \\\n -d \"name=Go&created_by=admin&state=1\"\n```\n\n### 3. 获取标签列表\n\n```bash\ncurl \"http://localhost:8000/api/v1/tags?token=YOUR_TOKEN\"\n```\n\n### 4. 创建文章\n\n```bash\ncurl -X POST \"http://localhost:8000/api/v1/articles?token=YOUR_TOKEN\" \\\n -d \"tag_id=1&title=Hello Gin&desc=Gin 入门介绍&content=文章内容...&created_by=admin&cover_image_url=http://example.com/image.jpg&state=1\"\n```\n\n### 5. 上传图片\n\n```bash\ncurl -X POST http://localhost:8000/upload \\\n -F \"image=@/path/to/image.jpg\"\n```\n\n### 6. 导出标签到 Excel\n\n```bash\ncurl -X POST http://localhost:8000/tags/export\n```\n\n## 核心设计模式\n\n### 1. 软删除\n所有模型使用软删除，通过设置 `deleted_on` 时间戳而非实际删除数据。\n\n### 2. Redis 缓存\n文章和标签数据缓存在 Redis 中，TTL 为 1 小时，以减少数据库负载。\n\n### 3. 服务层模式\n业务逻辑分离到服务层，保持处理器精简，专注于请求/响应处理。\n\n### 4. 统一响应格式\n所有 API 响应遵循统一格式：\n```json\n{\n \"code\": 200,\n \"msg\": \"ok\",\n \"data\": {}\n}\n```\n\n### 5. 自定义 GORM 回调\n自定义回调实现自动时间戳管理：\n- `CreatedOn` 在创建时设置\n- `ModifiedOn` 在修改时更新\n- `DeletedOn` 在软删除时设置\n\n## 错误码说明\n\n| 错误码 | 描述 |\n|--------|------|\n| 200 | 成功 |\n| 400 | 请求参数无效 |\n| 500 | 服务器内部错误 |\n| 10001 | 标签已存在 |\n| 10003 | 标签不存在 |\n| 10011 | 文章不存在 |\n| 20001 | Token 验证失败 |\n| 20002 | Token 已过期 |\n| 20003 | Token 生成错误 |\n| 20004 | 认证失败 |\n| 30001 | 图片保存失败 |\n| 30002 | 图片检查失败 |\n| 30003 | 图片格式无效 |\n\n## 开发命令\n\n```bash\n# 构建\nmake build\n\n# 运行代码分析\nmake tool\n\n# 运行代码检查\nmake lint\n\n# 清理构建产物\nmake clean\n```\n\n## 许可证\n\nMIT License - 详见 [LICENSE](LICENSE) 文件。\n\n## 联系我\n\n![image](https://image.eddycjy.com/7074be90379a121746146bc4229819f8.jpg)\n" }, { "path": "conf/app.ini", "content": "[app]\r\nPageSize = 10\r\nJwtSecret = 233\r\nPrefixUrl = http://127.0.0.1:8000\r\n\r\nRuntimeRootPath = runtime/\r\n\r\nImageSavePath = upload/images/\r\n# MB\r\nImageMaxSize = 5\r\nImageAllowExts = .jpg,.jpeg,.png\r\n\r\nExportSavePath = export/\r\nQrCodeSavePath = qrcode/\r\nFontSavePath = fonts/\r\n\r\nLogSavePath = logs/\r\nLogSaveName = log\r\nLogFileExt = log\r\nTimeFormat = 20060102\r\n\r\n[server]\r\n#debug or release\r\nRunMode = debug\r\nHttpPort = 8000\r\nReadTimeout = 60\r\nWriteTimeout = 60\r\n\r\n[database]\r\nType = mysql\r\nUser = root\r\nPassword = rootroot\r\nHost = 127.0.0.1:3306\r\nName = blog\r\nTablePrefix = blog_\r\n\r\n[redis]\r\nHost = 127.0.0.1:6379\r\nPassword =\r\nMaxIdle = 30\r\nMaxActive = 30\r\nIdleTimeout = 200" }, { "path": "docs/docs.go", "content": "// GENERATED BY THE COMMAND ABOVE; DO NOT EDIT\n// This file was generated by swaggo/swag at\n// 2020-03-22 15:19:36.759704 +0800 CST m=+0.052176208\n\npackage docs\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"strings\"\n\n\t\"github.com/alecthomas/template\"\n\t\"github.com/swaggo/swag\"\n)\n\nvar doc = `{\n \"schemes\": {{ marshal .Schemes }},\n \"swagger\": \"2.0\",\n \"info\": {\n \"description\": \"{{.Description}}\",\n \"title\": \"{{.Title}}\",\n \"termsOfService\": \"https://github.com/EDDYCJY/go-gin-example\",\n \"contact\": {},\n \"license\": {\n \"name\": \"MIT\",\n \"url\": \"https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\"\n },\n \"version\": \"{{.Version}}\"\n },\n \"host\": \"{{.Host}}\",\n \"basePath\": \"{{.BasePath}}\",\n \"paths\": {\n \"/api/v1/articles\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple articles\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/articles/{id}\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get a single article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple article tags\",\n \"parameters\": [\n {\n \"type\": \"string\",\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"query\"\n },\n {\n \"type\": \"integer\",\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"query\"\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/export\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Export article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/import\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Import Image\",\n \"parameters\": [\n {\n \"type\": \"file\",\n \"description\": \"Image File\",\n \"name\": \"image\",\n \"in\": \"formData\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/{id}\": {\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/auth\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get Auth\",\n \"parameters\": [\n {\n \"type\": \"string\",\n \"description\": \"userName\",\n \"name\": \"username\",\n \"in\": \"query\",\n \"required\": true\n },\n {\n \"type\": \"string\",\n \"description\": \"password\",\n \"name\": \"password\",\n \"in\": \"query\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n }\n },\n \"definitions\": {\n \"app.Response\": {\n \"type\": \"object\",\n \"properties\": {\n \"code\": {\n \"type\": \"integer\"\n },\n \"data\": {\n \"type\": \"object\"\n },\n \"msg\": {\n \"type\": \"string\"\n }\n }\n }\n }\n}`\n\ntype swaggerInfo struct {\n\tVersion string\n\tHost string\n\tBasePath string\n\tSchemes []string\n\tTitle string\n\tDescription string\n}\n\n// SwaggerInfo holds exported Swagger Info so clients can modify it\nvar SwaggerInfo = swaggerInfo{\n\tVersion: \"1.0\",\n\tHost: \"\",\n\tBasePath: \"\",\n\tSchemes: []string{},\n\tTitle: \"Golang Gin API\",\n\tDescription: \"An example of gin\",\n}\n\ntype s struct{}\n\nfunc (s *s) ReadDoc() string {\n\tsInfo := SwaggerInfo\n\tsInfo.Description = strings.Replace(sInfo.Description, \"\\n\", \"\\\\n\", -1)\n\n\tt, err := template.New(\"swagger_info\").Funcs(template.FuncMap{\n\t\t\"marshal\": func(v interface{}) string {\n\t\t\ta, _ := json.Marshal(v)\n\t\t\treturn string(a)\n\t\t},\n\t}).Parse(doc)\n\tif err != nil {\n\t\treturn doc\n\t}\n\n\tvar tpl bytes.Buffer\n\tif err := t.Execute(&tpl, sInfo); err != nil {\n\t\treturn doc\n\t}\n\n\treturn tpl.String()\n}\n\nfunc init() {\n\tswag.Register(swag.Name, &s{})\n}\n" }, { "path": "docs/sql/blog.sql", "content": "/*\r\nNavicat MySQL Data Transfer\r\n\r\nSource Database : blog\r\n\r\nTarget Server Type : MYSQL\r\nTarget Server Version : 50639\r\nFile Encoding : 65001\r\n\r\nDate: 2018-03-18 16:52:35\r\n*/\r\n\r\nSET FOREIGN_KEY_CHECKS=0;\r\n\r\n-- ----------------------------\r\n-- Table structure for blog_article\r\n-- ----------------------------\r\nDROP TABLE IF EXISTS `blog_article`;\r\nCREATE TABLE `blog_article` (\r\n `id` int(10) unsigned NOT NULL AUTO_INCREMENT,\r\n `tag_id` int(10) unsigned DEFAULT '0' COMMENT '标签ID',\r\n `title` varchar(100) DEFAULT '' COMMENT '文章标题',\r\n `desc` varchar(255) DEFAULT '' COMMENT '简述',\r\n `content` text COMMENT '内容',\r\n `cover_image_url` varchar(255) DEFAULT '' COMMENT '封面图片地址',\r\n `created_on` int(10) unsigned DEFAULT '0' COMMENT '新建时间',\r\n `created_by` varchar(100) DEFAULT '' COMMENT '创建人',\r\n `modified_on` int(10) unsigned DEFAULT '0' COMMENT '修改时间',\r\n `modified_by` varchar(255) DEFAULT '' COMMENT '修改人',\r\n `deleted_on` int(10) unsigned DEFAULT '0',\r\n `state` tinyint(3) unsigned DEFAULT '1' COMMENT '删除时间',\r\n PRIMARY KEY (`id`)\r\n) ENGINE=InnoDB DEFAULT CHARSET=utf8 COMMENT='文章管理';\r\n\r\n-- ----------------------------\r\n-- Table structure for blog_auth\r\n-- ----------------------------\r\nDROP TABLE IF EXISTS `blog_auth`;\r\nCREATE TABLE `blog_auth` (\r\n `id` int(10) unsigned NOT NULL AUTO_INCREMENT,\r\n `username` varchar(50) DEFAULT '' COMMENT '账号',\r\n `password` varchar(50) DEFAULT '' COMMENT '密码',\r\n PRIMARY KEY (`id`)\r\n) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8;\r\n\r\nINSERT INTO `blog_auth` (`id`, `username`, `password`) VALUES ('1', 'test', 'test123');\r\n\r\n-- ----------------------------\r\n-- Table structure for blog_tag\r\n-- ----------------------------\r\nDROP TABLE IF EXISTS `blog_tag`;\r\nCREATE TABLE `blog_tag` (\r\n `id` int(10) unsigned NOT NULL AUTO_INCREMENT,\r\n `name` varchar(100) DEFAULT '' COMMENT '标签名称',\r\n `created_on` int(10) unsigned DEFAULT '0' COMMENT '创建时间',\r\n `created_by` varchar(100) DEFAULT '' COMMENT '创建人',\r\n `modified_on` int(10) unsigned DEFAULT '0' COMMENT '修改时间',\r\n `modified_by` varchar(100) DEFAULT '' COMMENT '修改人',\r\n `deleted_on` int(10) unsigned DEFAULT '0' COMMENT '删除时间',\r\n `state` tinyint(3) unsigned DEFAULT '1' COMMENT '状态 0为禁用、1为启用',\r\n PRIMARY KEY (`id`)\r\n) ENGINE=InnoDB DEFAULT CHARSET=utf8 COMMENT='文章标签管理';\r\n\r\n" }, { "path": "docs/swagger/swagger.json", "content": "{\n \"swagger\": \"2.0\",\n \"info\": {\n \"description\": \"An example of gin\",\n \"title\": \"Golang Gin API\",\n \"termsOfService\": \"https://github.com/EDDYCJY/go-gin-example\",\n \"contact\": {},\n \"license\": {\n \"name\": \"MIT\",\n \"url\": \"https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\"\n },\n \"version\": \"1.0\"\n },\n \"host\": \"{{.Host}}\",\n \"basePath\": \"{{.BasePath}}\",\n \"paths\": {\n \"/api/v1/articles\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple articles\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/articles/{id}\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get a single article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple article tags\",\n \"parameters\": [\n {\n \"type\": \"string\",\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"query\"\n },\n {\n \"type\": \"integer\",\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"query\"\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/export\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Export article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/import\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Import article tag\",\n \"parameters\": [\n {\n \"description\": \"Excel File\",\n \"name\": \"file\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/{id}\": {\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"ID\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"object\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"object\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"type\": \"object\",\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n }\n },\n \"definitions\": {\n \"app.Response\": {\n \"type\": \"object\",\n \"properties\": {\n \"code\": {\n \"type\": \"integer\"\n },\n \"data\": {\n \"type\": \"object\"\n },\n \"msg\": {\n \"type\": \"string\"\n }\n }\n }\n }\n}" }, { "path": "docs/swagger/swagger.yaml", "content": "basePath: '{{.BasePath}}'\ndefinitions:\n app.Response:\n properties:\n code:\n type: integer\n data:\n type: object\n msg:\n type: string\n type: object\nhost: '{{.Host}}'\ninfo:\n contact: {}\n description: An example of gin\n license:\n name: MIT\n url: https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\n termsOfService: https://github.com/EDDYCJY/go-gin-example\n title: Golang Gin API\n version: \"1.0\"\npaths:\n /api/v1/articles:\n get:\n parameters:\n - description: TagID\n in: body\n name: tag_id\n schema:\n type: object\n - description: State\n in: body\n name: state\n schema:\n type: object\n - description: CreatedBy\n in: body\n name: created_by\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Get multiple articles\n post:\n parameters:\n - description: TagID\n in: body\n name: tag_id\n required: true\n schema:\n type: object\n - description: Title\n in: body\n name: title\n required: true\n schema:\n type: object\n - description: Desc\n in: body\n name: desc\n required: true\n schema:\n type: object\n - description: Content\n in: body\n name: content\n required: true\n schema:\n type: object\n - description: CreatedBy\n in: body\n name: created_by\n required: true\n schema:\n type: object\n - description: State\n in: body\n name: state\n required: true\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Add article\n /api/v1/articles/{id}:\n delete:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Delete article\n get:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Get a single article\n put:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n - description: TagID\n in: body\n name: tag_id\n schema:\n type: object\n - description: Title\n in: body\n name: title\n schema:\n type: object\n - description: Desc\n in: body\n name: desc\n schema:\n type: object\n - description: Content\n in: body\n name: content\n schema:\n type: object\n - description: ModifiedBy\n in: body\n name: modified_by\n required: true\n schema:\n type: object\n - description: State\n in: body\n name: state\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Update article\n /api/v1/tags:\n get:\n parameters:\n - description: Name\n in: query\n name: name\n type: string\n - description: State\n in: query\n name: state\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Get multiple article tags\n post:\n parameters:\n - description: Name\n in: body\n name: name\n required: true\n schema:\n type: object\n - description: State\n in: body\n name: state\n schema:\n type: object\n - description: CreatedBy\n in: body\n name: created_by\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Add article tag\n /api/v1/tags/{id}:\n delete:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Delete article tag\n put:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n - description: ID\n in: body\n name: name\n required: true\n schema:\n type: object\n - description: State\n in: body\n name: state\n schema:\n type: object\n - description: ModifiedBy\n in: body\n name: modified_by\n required: true\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Update article tag\n /api/v1/tags/export:\n post:\n parameters:\n - description: Name\n in: body\n name: name\n schema:\n type: object\n - description: State\n in: body\n name: state\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Export article tag\n /api/v1/tags/import:\n post:\n parameters:\n - description: Excel File\n in: body\n name: file\n required: true\n schema:\n type: object\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n type: object\n summary: Import article tag\nswagger: \"2.0\"\n" }, { "path": "docs/swagger.json", "content": "{\n \"swagger\": \"2.0\",\n \"info\": {\n \"description\": \"An example of gin\",\n \"title\": \"Golang Gin API\",\n \"termsOfService\": \"https://github.com/EDDYCJY/go-gin-example\",\n \"contact\": {},\n \"license\": {\n \"name\": \"MIT\",\n \"url\": \"https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\"\n },\n \"version\": \"1.0\"\n },\n \"paths\": {\n \"/api/v1/articles\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple articles\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article\",\n \"parameters\": [\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/articles/{id}\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get a single article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"TagID\",\n \"name\": \"tag_id\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Title\",\n \"name\": \"title\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Desc\",\n \"name\": \"desc\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"Content\",\n \"name\": \"content\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get multiple article tags\",\n \"parameters\": [\n {\n \"type\": \"string\",\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"query\"\n },\n {\n \"type\": \"integer\",\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"query\"\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Add article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"CreatedBy\",\n \"name\": \"created_by\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/export\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Export article tag\",\n \"parameters\": [\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/import\": {\n \"post\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Import Image\",\n \"parameters\": [\n {\n \"type\": \"file\",\n \"description\": \"Image File\",\n \"name\": \"image\",\n \"in\": \"formData\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/api/v1/tags/{id}\": {\n \"put\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Update article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n },\n {\n \"description\": \"Name\",\n \"name\": \"name\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n },\n {\n \"description\": \"State\",\n \"name\": \"state\",\n \"in\": \"body\",\n \"schema\": {\n \"type\": \"integer\"\n }\n },\n {\n \"description\": \"ModifiedBy\",\n \"name\": \"modified_by\",\n \"in\": \"body\",\n \"required\": true,\n \"schema\": {\n \"type\": \"string\"\n }\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n },\n \"delete\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Delete article tag\",\n \"parameters\": [\n {\n \"type\": \"integer\",\n \"description\": \"ID\",\n \"name\": \"id\",\n \"in\": \"path\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n },\n \"/auth\": {\n \"get\": {\n \"produces\": [\n \"application/json\"\n ],\n \"summary\": \"Get Auth\",\n \"parameters\": [\n {\n \"type\": \"string\",\n \"description\": \"userName\",\n \"name\": \"username\",\n \"in\": \"query\",\n \"required\": true\n },\n {\n \"type\": \"string\",\n \"description\": \"password\",\n \"name\": \"password\",\n \"in\": \"query\",\n \"required\": true\n }\n ],\n \"responses\": {\n \"200\": {\n \"description\": \"OK\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n },\n \"500\": {\n \"description\": \"Internal Server Error\",\n \"schema\": {\n \"$ref\": \"#/definitions/app.Response\"\n }\n }\n }\n }\n }\n },\n \"definitions\": {\n \"app.Response\": {\n \"type\": \"object\",\n \"properties\": {\n \"code\": {\n \"type\": \"integer\"\n },\n \"data\": {\n \"type\": \"object\"\n },\n \"msg\": {\n \"type\": \"string\"\n }\n }\n }\n }\n}" }, { "path": "docs/swagger.yaml", "content": "definitions:\n app.Response:\n properties:\n code:\n type: integer\n data:\n type: object\n msg:\n type: string\n type: object\ninfo:\n contact: {}\n description: An example of gin\n license:\n name: MIT\n url: https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\n termsOfService: https://github.com/EDDYCJY/go-gin-example\n title: Golang Gin API\n version: \"1.0\"\npaths:\n /api/v1/articles:\n get:\n parameters:\n - description: TagID\n in: body\n name: tag_id\n schema:\n type: integer\n - description: State\n in: body\n name: state\n schema:\n type: integer\n - description: CreatedBy\n in: body\n name: created_by\n schema:\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Get multiple articles\n post:\n parameters:\n - description: TagID\n in: body\n name: tag_id\n required: true\n schema:\n type: integer\n - description: Title\n in: body\n name: title\n required: true\n schema:\n type: string\n - description: Desc\n in: body\n name: desc\n required: true\n schema:\n type: string\n - description: Content\n in: body\n name: content\n required: true\n schema:\n type: string\n - description: CreatedBy\n in: body\n name: created_by\n required: true\n schema:\n type: string\n - description: State\n in: body\n name: state\n required: true\n schema:\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Add article\n /api/v1/articles/{id}:\n delete:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Delete article\n get:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Get a single article\n put:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n - description: TagID\n in: body\n name: tag_id\n schema:\n type: string\n - description: Title\n in: body\n name: title\n schema:\n type: string\n - description: Desc\n in: body\n name: desc\n schema:\n type: string\n - description: Content\n in: body\n name: content\n schema:\n type: string\n - description: ModifiedBy\n in: body\n name: modified_by\n required: true\n schema:\n type: string\n - description: State\n in: body\n name: state\n schema:\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Update article\n /api/v1/tags:\n get:\n parameters:\n - description: Name\n in: query\n name: name\n type: string\n - description: State\n in: query\n name: state\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Get multiple article tags\n post:\n parameters:\n - description: Name\n in: body\n name: name\n required: true\n schema:\n type: string\n - description: State\n in: body\n name: state\n schema:\n type: integer\n - description: CreatedBy\n in: body\n name: created_by\n schema:\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Add article tag\n /api/v1/tags/{id}:\n delete:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Delete article tag\n put:\n parameters:\n - description: ID\n in: path\n name: id\n required: true\n type: integer\n - description: Name\n in: body\n name: name\n required: true\n schema:\n type: string\n - description: State\n in: body\n name: state\n schema:\n type: integer\n - description: ModifiedBy\n in: body\n name: modified_by\n required: true\n schema:\n type: string\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Update article tag\n /api/v1/tags/export:\n post:\n parameters:\n - description: Name\n in: body\n name: name\n schema:\n type: string\n - description: State\n in: body\n name: state\n schema:\n type: integer\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Export article tag\n /api/v1/tags/import:\n post:\n parameters:\n - description: Image File\n in: formData\n name: image\n required: true\n type: file\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Import Image\n /auth:\n get:\n parameters:\n - description: userName\n in: query\n name: username\n required: true\n type: string\n - description: password\n in: query\n name: password\n required: true\n type: string\n produces:\n - application/json\n responses:\n \"200\":\n description: OK\n schema:\n $ref: '#/definitions/app.Response'\n \"500\":\n description: Internal Server Error\n schema:\n $ref: '#/definitions/app.Response'\n summary: Get Auth\nswagger: \"2.0\"\n" }, { "path": "go.mod", "content": "module github.com/EDDYCJY/go-gin-example\n\ngo 1.13\n\nrequire (\n\tgithub.com/360EntSecGroup-Skylar/excelize v1.3.1-0.20180527032555-9e463b461434\n\tgithub.com/PuerkitoBio/purell v1.1.1-0.20180310210909-975f53781597 // indirect\n\tgithub.com/alecthomas/template v0.0.0-20190718012654-fb15b899a751\n\tgithub.com/astaxie/beego v1.9.3-0.20171218111859-f16688817aa4\n\tgithub.com/boombuler/barcode v1.0.1-0.20180315051053-3c06908149f7\n\tgithub.com/denisenkom/go-mssqldb v0.0.0-20190920000552-128d9f4ae1cd // indirect\n\tgithub.com/dgrijalva/jwt-go v3.1.0+incompatible\n\tgithub.com/erikstmartin/go-testdb v0.0.0-20160219214506-8d10e4a1bae5 // indirect\n\tgithub.com/gin-gonic/gin v1.4.0\n\tgithub.com/go-ini/ini v1.32.1-0.20180214101753-32e4be5f41bb\n\tgithub.com/go-sql-driver/mysql v1.4.1-0.20190510102335-877a9775f068 // indirect\n\tgithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0\n\tgithub.com/gomodule/redigo v2.0.1-0.20180401191855-9352ab68be13+incompatible\n\tgithub.com/jinzhu/gorm v0.0.0-20180213101209-6e1387b44c64\n\tgithub.com/jinzhu/inflection v0.0.0-20170102125226-1c35d901db3d // indirect\n\tgithub.com/jinzhu/now v1.0.1 // indirect\n\tgithub.com/json-iterator/go v1.1.7 // indirect\n\tgithub.com/lib/pq v1.2.0 // indirect\n\tgithub.com/mattn/go-sqlite3 v1.11.0 // indirect\n\tgithub.com/mohae/deepcopy v0.0.0-20170929034955-c48cc78d4826 // indirect\n\tgithub.com/smartystreets/goconvey v0.0.0-20190731233626-505e41936337 // indirect\n\tgithub.com/swaggo/gin-swagger v1.2.0\n\tgithub.com/swaggo/swag v1.5.1\n\tgithub.com/tealeg/xlsx v1.0.4-0.20180419195153-f36fa3be8893\n\tgithub.com/unknwon/com v1.0.1\n\tgolang.org/x/image v0.0.0-20180628062038-cc896f830ced // indirect\n\tgolang.org/x/sys v0.0.0-20190921204832-2dccfee4fd3e // indirect\n\tgoogle.golang.org/appengine v1.6.3 // indirect\n\tgopkg.in/ini.v1 v1.47.0 // indirect\n)\n" }, { "path": "go.sum", "content": "github.com/360EntSecGroup-Skylar/excelize v1.3.1-0.20180527032555-9e463b461434 h1:sJVNhDPQ1uL3izsJQGWFQb3lUvFloaTIgqz0ClEp6aQ=\ngithub.com/360EntSecGroup-Skylar/excelize v1.3.1-0.20180527032555-9e463b461434/go.mod h1:R8KYLmGns0vDPe6/HyphW0mzW+MFexlGDafU0ykVEnU=\ngithub.com/PuerkitoBio/purell v1.1.0/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=\ngithub.com/PuerkitoBio/purell v1.1.1-0.20180310210909-975f53781597 h1:8+pMa56PPVkN6NbWGZbNIWLVIitrF8AQZ95d4UAhqmE=\ngithub.com/PuerkitoBio/purell v1.1.1-0.20180310210909-975f53781597/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 h1:d+Bc7a5rLufV/sSk/8dngufqelfh6jnri85riMAaF/M=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578/go.mod h1:uGdkoq3SwY9Y+13GIhn11/XLaGBb4BfwItxLd5jeuXE=\ngithub.com/alecthomas/template v0.0.0-20190718012654-fb15b899a751 h1:JYp7IbQjafoB+tBA3gMyHYHrpOtNuDiK/uB5uXxq5wM=\ngithub.com/alecthomas/template v0.0.0-20190718012654-fb15b899a751/go.mod h1:LOuyumcjzFXgccqObfd/Ljyb9UuFJ6TxHnclSeseNhc=\ngithub.com/astaxie/beego v1.9.3-0.20171218111859-f16688817aa4 h1:dNIynF6ICiq1NghlpIBxljb2JbyC61/JqWB5A9cfUfo=\ngithub.com/astaxie/beego v1.9.3-0.20171218111859-f16688817aa4/go.mod h1:0R4++1tUqERR0WYFWdfkcrsyoVBCG4DgpDGokT3yb+U=\ngithub.com/boombuler/barcode v1.0.1-0.20180315051053-3c06908149f7 h1:s7NuEzhW8Z2v7X7lUwHMqXt8HKYYd5YwtEt0CCMff3Q=\ngithub.com/boombuler/barcode v1.0.1-0.20180315051053-3c06908149f7/go.mod h1:paBWMcWSl3LHKBqUq+rly7CNSldXjb2rDl3JlRe0mD8=\ngithub.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/denisenkom/go-mssqldb v0.0.0-20190920000552-128d9f4ae1cd h1:tXCgEGHPT4XELDS7nB0OBb9968yCOd+MnyNf+6m1u40=\ngithub.com/denisenkom/go-mssqldb v0.0.0-20190920000552-128d9f4ae1cd/go.mod h1:xbL0rPBG9cCiLr28tMa8zpbdarY27NDyej4t/EjAShU=\ngithub.com/dgrijalva/jwt-go v3.1.0+incompatible h1:FFziAwDQQ2dz1XClWMkwvukur3evtZx7x/wMHKM1i20=\ngithub.com/dgrijalva/jwt-go v3.1.0+incompatible/go.mod h1:E3ru+11k8xSBh+hMPgOLZmtrrCbhqsmaPHjLKYnJCaQ=\ngithub.com/erikstmartin/go-testdb v0.0.0-20160219214506-8d10e4a1bae5 h1:Yzb9+7DPaBjB8zlTR87/ElzFsnQfuHnVUVqpZZIcV5Y=\ngithub.com/erikstmartin/go-testdb v0.0.0-20160219214506-8d10e4a1bae5/go.mod h1:a2zkGnVExMxdzMo3M0Hi/3sEU+cWnZpSni0O6/Yb/P0=\ngithub.com/ghodss/yaml v1.0.0/go.mod h1:4dBDuWmgqj2HViK6kFavaiC9ZROes6MMH2rRYeMEF04=\ngithub.com/gin-contrib/gzip v0.0.1 h1:ezvKOL6jH+jlzdHNE4h9h8q8uMpDQjyl0NN0Jd7jozc=\ngithub.com/gin-contrib/gzip v0.0.1/go.mod h1:fGBJBCdt6qCZuCAOwWuFhBB4OOq9EFqlo5dEaFhhu5w=\ngithub.com/gin-contrib/sse v0.0.0-20170109093832-22d885f9ecc7 h1:AzN37oI0cOS+cougNAV9szl6CVoj2RYwzS3DpUQNtlY=\ngithub.com/gin-contrib/sse v0.0.0-20170109093832-22d885f9ecc7/go.mod h1:VJ0WA2NBN22VlZ2dKZQPAPnyWw5XTlK1KymzLKsr59s=\ngithub.com/gin-contrib/sse v0.0.0-20190301062529-5545eab6dad3/go.mod h1:VJ0WA2NBN22VlZ2dKZQPAPnyWw5XTlK1KymzLKsr59s=\ngithub.com/gin-contrib/sse v0.1.0 h1:Y/yl/+YNO8GZSjAhjMsSuLt29uWRFHdHYUb5lYOV9qE=\ngithub.com/gin-contrib/sse v0.1.0/go.mod h1:RHrZQHXnP2xjPF+u1gW/2HnVO7nvIa9PG3Gm+fLHvGI=\ngithub.com/gin-gonic/gin v1.3.0 h1:kCmZyPklC0gVdL728E6Aj20uYBJV93nj/TkwBTKhFbs=\ngithub.com/gin-gonic/gin v1.3.0/go.mod h1:7cKuhb5qV2ggCFctp2fJQ+ErvciLZrIeoOSOm6mUr7Y=\ngithub.com/gin-gonic/gin v1.4.0 h1:3tMoCCfM7ppqsR0ptz/wi1impNpT7/9wQtMZ8lr1mCQ=\ngithub.com/gin-gonic/gin v1.4.0/go.mod h1:OW2EZn3DO8Ln9oIKOvM++LBO+5UPHJJDH72/q/3rZdM=\ngithub.com/go-ini/ini v1.32.1-0.20180214101753-32e4be5f41bb h1:v+YnQ81wH+hTjaP5nFSpqASFbe9UETYm1vG65qp7Zc0=\ngithub.com/go-ini/ini v1.32.1-0.20180214101753-32e4be5f41bb/go.mod h1:ByCAeIL28uOIIG0E3PJtZPDL8WnHpFKFOtgjp+3Ies8=\ngithub.com/go-openapi/jsonpointer v0.17.0 h1:nH6xp8XdXHx8dqveo0ZuJBluCO2qGrPbDNZ0dwoRHP0=\ngithub.com/go-openapi/jsonpointer v0.17.0/go.mod h1:cOnomiV+CVVwFLk0A/MExoFMjwdsUdVpsRhURCKh+3M=\ngithub.com/go-openapi/jsonreference v0.17.0/go.mod h1:g4xxGn04lDIRh0GJb5QlpE3HfopLOL6uZrK/VgnsK9I=\ngithub.com/go-openapi/jsonreference v0.19.0 h1:BqWKpV1dFd+AuiKlgtddwVIFQsuMpxfBDBHGfM2yNpk=\ngithub.com/go-openapi/jsonreference v0.19.0/go.mod h1:g4xxGn04lDIRh0GJb5QlpE3HfopLOL6uZrK/VgnsK9I=\ngithub.com/go-openapi/spec v0.19.0 h1:A4SZ6IWh3lnjH0rG0Z5lkxazMGBECtrZcbyYQi+64k4=\ngithub.com/go-openapi/spec v0.19.0/go.mod h1:XkF/MOi14NmjsfZ8VtAKf8pIlbZzyoTvZsdfssdxcBI=\ngithub.com/go-openapi/swag v0.17.0 h1:iqrgMg7Q7SvtbWLlltPrkMs0UBJI6oTSs79JFRUi880=\ngithub.com/go-openapi/swag v0.17.0/go.mod h1:AByQ+nYG6gQg71GINrmuDXCPWdL640yX49/kXLo40Tg=\ngithub.com/go-sql-driver/mysql v1.4.1-0.20190510102335-877a9775f068 h1:q2kwd9Bcgl2QpSi/Wjcx9jzwyICt3EWTP5to43QhwaA=\ngithub.com/go-sql-driver/mysql v1.4.1-0.20190510102335-877a9775f068/go.mod h1:zAC/RDZ24gD3HViQzih4MyKcchzm+sOG5ZlKdlhCg5w=\ngithub.com/golang-sql/civil v0.0.0-20190719163853-cb61b32ac6fe h1:lXe2qZdvpiX5WZkZR4hgp4KJVfY3nMkvmwbVkpv1rVY=\ngithub.com/golang-sql/civil v0.0.0-20190719163853-cb61b32ac6fe/go.mod h1:8vg3r2VgvsThLBIFL93Qb5yWzgyZWhEmBwUJWevAkK0=\ngithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0 h1:DACJavvAHhabrF08vX0COfcOBJRhZ8lUbR+ZWIs0Y5g=\ngithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0/go.mod h1:E/TSTwGwJL78qG/PmXZO1EjYhfJinVAhrmmHX6Z8B9k=\ngithub.com/golang/protobuf v1.2.0 h1:P3YflyNX/ehuJFLhxviNdFxQPkGK5cDcApsge1SqnvM=\ngithub.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/golang/protobuf v1.3.1 h1:YF8+flBXS5eO826T4nzqPrxfhQThhXl0YzfuUPu4SBg=\ngithub.com/golang/protobuf v1.3.1/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/gomodule/redigo v2.0.1-0.20180401191855-9352ab68be13+incompatible h1:cQom4uMS2ufhGPAJgSa67FXfrHg6ytNKmWtKN/l/n+I=\ngithub.com/gomodule/redigo v2.0.1-0.20180401191855-9352ab68be13+incompatible/go.mod h1:B4C85qUVwatsJoIUNIfCRsp7qO0iAmpGFZ4EELWSbC4=\ngithub.com/google/gofuzz v1.0.0/go.mod h1:dBl0BpW6vV/+mYPU4Po3pmUjxk6FQPldtuIdl/M65Eg=\ngithub.com/gopherjs/gopherjs v0.0.0-20181017120253-0766667cb4d1 h1:EGx4pi6eqNxGaHF6qqu48+N2wcFQ5qg5FXgOdqsJ5d8=\ngithub.com/gopherjs/gopherjs v0.0.0-20181017120253-0766667cb4d1/go.mod h1:wJfORRmW1u3UXTncJ5qlYoELFm8eSnnEO6hX4iZ3EWY=\ngithub.com/gopherjs/gopherjs v0.0.0-20181103185306-d547d1d9531e h1:JKmoR8x90Iww1ks85zJ1lfDGgIiMDuIptTOhJq+zKyg=\ngithub.com/gopherjs/gopherjs v0.0.0-20181103185306-d547d1d9531e/go.mod h1:wJfORRmW1u3UXTncJ5qlYoELFm8eSnnEO6hX4iZ3EWY=\ngithub.com/jinzhu/gorm v0.0.0-20180213101209-6e1387b44c64 h1:8I4kQ5M5OjZKNsgRUs20soTdIoo1GbiGApV31kJ9e6Y=\ngithub.com/jinzhu/gorm v0.0.0-20180213101209-6e1387b44c64/go.mod h1:Vla75njaFJ8clLU1W44h34PjIkijhjHIYnZxMqCdxqo=\ngithub.com/jinzhu/inflection v0.0.0-20170102125226-1c35d901db3d h1:jRQLvyVGL+iVtDElaEIDdKwpPqUIZJfzkNLV34htpEc=\ngithub.com/jinzhu/inflection v0.0.0-20170102125226-1c35d901db3d/go.mod h1:h+uFLlag+Qp1Va5pdKtLDYj+kHp5pxUVkryuEj+Srlc=\ngithub.com/jinzhu/now v1.0.1 h1:HjfetcXq097iXP0uoPCdnM4Efp5/9MsM0/M+XOTeR3M=\ngithub.com/jinzhu/now v1.0.1/go.mod h1:d3SSVoowX0Lcu0IBviAWJpolVfI5UJVZZ7cO71lE/z8=\ngithub.com/json-iterator/go v1.1.5/go.mod h1:+SdeFBvtyEkXs7REEP0seUULqWtbJapLOCVDaaPEHmU=\ngithub.com/json-iterator/go v1.1.6/go.mod h1:+SdeFBvtyEkXs7REEP0seUULqWtbJapLOCVDaaPEHmU=\ngithub.com/json-iterator/go v1.1.7 h1:KfgG9LzI+pYjr4xvmz/5H4FXjokeP+rlHLhv3iH62Fo=\ngithub.com/json-iterator/go v1.1.7/go.mod h1:KdQUCv79m/52Kvf8AW2vK1V8akMuk1QjK/uOdHXbAo4=\ngithub.com/jtolds/gls v4.2.1+incompatible/go.mod h1:QJZ7F/aHp+rZTRtaJ1ow/lLfFfVYBRgL+9YlvaHOwJU=\ngithub.com/jtolds/gls v4.20.0+incompatible h1:xdiiI2gbIgH/gLH7ADydsJ1uDOEzR8yvV7C0MuV77Wo=\ngithub.com/jtolds/gls v4.20.0+incompatible/go.mod h1:QJZ7F/aHp+rZTRtaJ1ow/lLfFfVYBRgL+9YlvaHOwJU=\ngithub.com/kr/pretty v0.1.0 h1:L/CwN0zerZDmRFUapSPitk6f+Q3+0za1rQkzVuMiMFI=\ngithub.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo=\ngithub.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ=\ngithub.com/kr/text v0.1.0 h1:45sCR5RtlFHMR4UwH9sdQ5TC8v0qDQCHnXt+kaKSTVE=\ngithub.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI=\ngithub.com/lib/pq v1.2.0 h1:LXpIM/LZ5xGFhOpXAQUIMM1HdyqzVYM13zNdjCEEcA0=\ngithub.com/lib/pq v1.2.0/go.mod h1:5WUZQaWbwv1U+lTReE5YruASi9Al49XbQIvNi/34Woo=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 h1:2gxZ0XQIU/5z3Z3bUBu+FXuk2pFbkN6tcwi/pjyaDic=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=\ngithub.com/mattn/go-isatty v0.0.4 h1:bnP0vzxcAdeI1zdubAl5PjU6zsERjGZb7raWodagDYs=\ngithub.com/mattn/go-isatty v0.0.4/go.mod h1:M+lRXTBqGeGNdLjl/ufCoiOlB5xdOkqRJdNxMWT7Zi4=\ngithub.com/mattn/go-isatty v0.0.7/go.mod h1:Iq45c/XA43vh69/j3iqttzPXn0bhXyGjM0Hdxcsrc5s=\ngithub.com/mattn/go-isatty v0.0.8 h1:HLtExJ+uU2HOZ+wI0Tt5DtUDrx8yhUqDcp7fYERX4CE=\ngithub.com/mattn/go-isatty v0.0.8/go.mod h1:Iq45c/XA43vh69/j3iqttzPXn0bhXyGjM0Hdxcsrc5s=\ngithub.com/mattn/go-sqlite3 v1.11.0 h1:LDdKkqtYlom37fkvqs8rMPFKAMe8+SgjbwZ6ex1/A/Q=\ngithub.com/mattn/go-sqlite3 v1.11.0/go.mod h1:FPy6KqzDD04eiIsT53CuJW3U88zkxoIYsOqkbpncsNc=\ngithub.com/modern-go/concurrent v0.0.0-20180228061459-e0a39a4cb421 h1:ZqeYNhU3OHLH3mGKHDcjJRFFRrJa6eAM5H+CtDdOsPc=\ngithub.com/modern-go/concurrent v0.0.0-20180228061459-e0a39a4cb421/go.mod h1:6dJC0mAP4ikYIbvyc7fijjWJddQyLn8Ig3JB5CqoB9Q=\ngithub.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd h1:TRLaZ9cD/w8PVh93nsPXa1VrQ6jlwL5oN8l14QlcNfg=\ngithub.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd/go.mod h1:6dJC0mAP4ikYIbvyc7fijjWJddQyLn8Ig3JB5CqoB9Q=\ngithub.com/modern-go/reflect2 v0.0.0-20180701023420-4b7aa43c6742 h1:Esafd1046DLDQ0W1YjYsBW+p8U2u7vzgW2SQVmlNazg=\ngithub.com/modern-go/reflect2 v0.0.0-20180701023420-4b7aa43c6742/go.mod h1:bx2lNnkwVCuqBIxFjflWJWanXIb3RllmbCylyMrvgv0=\ngithub.com/modern-go/reflect2 v1.0.1 h1:9f412s+6RmYXLWZSEzVVgPGK7C2PphHj5RJrvfx9AWI=\ngithub.com/modern-go/reflect2 v1.0.1/go.mod h1:bx2lNnkwVCuqBIxFjflWJWanXIb3RllmbCylyMrvgv0=\ngithub.com/mohae/deepcopy v0.0.0-20170929034955-c48cc78d4826 h1:RWengNIwukTxcDr9M+97sNutRR1RKhG96O6jWumTTnw=\ngithub.com/mohae/deepcopy v0.0.0-20170929034955-c48cc78d4826/go.mod h1:TaXosZuwdSHYgviHp1DAtfrULt5eUgsSMsZf+YrPgl8=\ngithub.com/pkg/errors v0.8.1 h1:iURUrRGxPUNPdy5/HRSm+Yj6okJ6UtLINN0Q9M4+h3I=\ngithub.com/pkg/errors v0.8.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/smartystreets/assertions v0.0.0-20180927180507-b2de0cb4f26d h1:zE9ykElWQ6/NYmHa3jpm/yHnI4xSofP+UP6SpjHcSeM=\ngithub.com/smartystreets/assertions v0.0.0-20180927180507-b2de0cb4f26d/go.mod h1:OnSkiWE9lh6wB0YB77sQom3nweQdgAjqCqsofrRNTgc=\ngithub.com/smartystreets/assertions v0.0.0-20190116191733-b6c0e53d7304 h1:Jpy1PXuP99tXNrhbq2BaPz9B+jNAvH1JPQQpG/9GCXY=\ngithub.com/smartystreets/assertions v0.0.0-20190116191733-b6c0e53d7304/go.mod h1:OnSkiWE9lh6wB0YB77sQom3nweQdgAjqCqsofrRNTgc=\ngithub.com/smartystreets/goconvey v0.0.0-20181108003508-044398e4856c/go.mod h1:XDJAKZRPZ1CvBcN2aX5YOUTYGHki24fSF0Iv48Ibg0s=\ngithub.com/smartystreets/goconvey v0.0.0-20190731233626-505e41936337 h1:WN9BUFbdyOsSH/XohnWpXOlq9NBD5sGAB2FciQMUEe8=\ngithub.com/smartystreets/goconvey v0.0.0-20190731233626-505e41936337/go.mod h1:syvi0/a8iFYH4r/RixwvyeAJjdLS9QV7WQ/tjFTllLA=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=\ngithub.com/stretchr/testify v1.3.0 h1:TivCn/peBQ7UY8ooIcPgZFpTNSz0Q2U6UrFlUfqbe0Q=\ngithub.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI=\ngithub.com/swaggo/gin-swagger v1.2.0 h1:YskZXEiv51fjOMTsXrOetAjrMDfFaXD79PEoQBOe2W0=\ngithub.com/swaggo/gin-swagger v1.2.0/go.mod h1:qlH2+W7zXGZkczuL+r2nEBR2JTT+/lX05Nn6vPhc7OI=\ngithub.com/swaggo/swag v1.5.1 h1:2Agm8I4K5qb00620mHq0VJ05/KT4FtmALPIcQR9lEZM=\ngithub.com/swaggo/swag v1.5.1/go.mod h1:1Bl9F/ZBpVWh22nY0zmYyASPO1lI/zIwRDrpZU+tv8Y=\ngithub.com/tealeg/xlsx v1.0.4-0.20180419195153-f36fa3be8893 h1:x+HNL/+eUTIzieDdCKbl6QjneUXKuiiTBvC9s5USpT0=\ngithub.com/tealeg/xlsx v1.0.4-0.20180419195153-f36fa3be8893/go.mod h1:uxu5UY2ovkuRPWKQ8Q7JG0JbSivrISjdPzZQKeo74mA=\ngithub.com/ugorji/go v1.1.4/go.mod h1:uQMGLiO92mf5W77hV/PUCpI3pbzQx3CRekS0kk+RGrc=\ngithub.com/ugorji/go v1.1.5-pre h1:jyJKFOSEbdOc2HODrf2qcCkYOdq7zzXqA9bhW5oV4fM=\ngithub.com/ugorji/go v1.1.5-pre/go.mod h1:FwP/aQVg39TXzItUBMwnWp9T9gPQnXw4Poh4/oBQZ/0=\ngithub.com/ugorji/go/codec v0.0.0-20181022190402-e5e69e061d4f/go.mod h1:VFNgLljTbGfSG7qAOspJ7OScBnGdDN/yBr0sguwnwf0=\ngithub.com/ugorji/go/codec v1.1.5-pre h1:5YV9PsFAN+ndcCtTM7s60no7nY7eTG3LPtxhSwuxzCs=\ngithub.com/ugorji/go/codec v1.1.5-pre/go.mod h1:tULtS6Gy1AE1yCENaw4Vb//HLH5njI2tfCQDUqRd8fI=\ngithub.com/unknwon/com v1.0.1 h1:3d1LTxD+Lnf3soQiD4Cp/0BRB+Rsa/+RTvz8GMMzIXs=\ngithub.com/unknwon/com v1.0.1/go.mod h1:tOOxU81rwgoCLoOVVPHb6T/wt8HZygqH5id+GNnlCXM=\ngithub.com/urfave/cli v1.20.0/go.mod h1:70zkFmudgCuE/ngEzBv17Jvp/497gISqfk5gWijbERA=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/crypto v0.0.0-20190325154230-a5d413f7728c/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/crypto v0.0.0-20190605123033-f99c8df09eb5 h1:58fnuSXlxZmFdJyvtTFVmVhcMLU6v5fEb/ok4wyqtNU=\ngolang.org/x/crypto v0.0.0-20190605123033-f99c8df09eb5/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=\ngolang.org/x/image v0.0.0-20180628062038-cc896f830ced h1:2QsAEqOy4Mp+V4HL2Wr1iBNpZWaL72EvTO4oj5bmr5w=\ngolang.org/x/image v0.0.0-20180628062038-cc896f830ced/go.mod h1:ux5Hcp/YLpHSI86hEcLt0YII63i6oz57MZXIpbrjZUs=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20181220203305-927f97764cc3/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20190311183353-d8887717615a/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190503192946-f4e77d36d62c/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190603091049-60506f45cf65 h1:+rhAzEzT3f4JtomfC371qB+0Ola2caSKcY69NUBZrRQ=\ngolang.org/x/net v0.0.0-20190603091049-60506f45cf65/go.mod h1:HSz+uSET+XFnRR8LxR5pz3Of3rY3CfYBVs4xY44aLks=\ngolang.org/x/net v0.0.0-20190611141213-3f473d35a33a h1:+KkCgOMgnKSgenxTBoiwkMqTiouMIy/3o8RLdmSbGoY=\ngolang.org/x/net v0.0.0-20190611141213-3f473d35a33a/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=\ngolang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sys v0.0.0-20181228144115-9a3f9b0469bb/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190606165138-5da285871e9c/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190610200419-93c9922d18ae/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190921204832-2dccfee4fd3e h1:9ZBATxGrhPGloVV3LDg+OqDyEtcYRtQ9eIVlIjan6+M=\ngolang.org/x/sys v0.0.0-20190921204832-2dccfee4fd3e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngolang.org/x/text v0.3.2 h1:tW2bmiBqwgJj/UpqtC8EpXEZVYOwU0yG4iWbprSVAcs=\ngolang.org/x/text v0.3.2/go.mod h1:bEr9sfX3Q8Zfm5fL9x+3itogRgK3+ptLWKqgva+5dAk=\ngolang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=\ngolang.org/x/tools v0.0.0-20190328211700-ab21143f2384/go.mod h1:LCzVGOaR6xXOjkQ3onu1FJEFr0SW1gC7cKk1uF8kGRs=\ngolang.org/x/tools v0.0.0-20190606050223-4d9ae51c2468/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc=\ngolang.org/x/tools v0.0.0-20190606124116-d0a3d012864b h1:mSUCVIwDx4hfXJfWsOPfdzEHxzb2Xjl6BQ8YgPnazQA=\ngolang.org/x/tools v0.0.0-20190606124116-d0a3d012864b/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc=\ngolang.org/x/tools v0.0.0-20190611222205-d73e1c7e250b h1:/mJ+GKieZA6hFDQGdWZrjj4AXPl5ylY+5HusG80roy0=\ngolang.org/x/tools v0.0.0-20190611222205-d73e1c7e250b/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc=\ngoogle.golang.org/appengine v1.6.3 h1:hvZejVcIxAKHR8Pq2gXaDggf6CWT1QEqO+JEBeOKCG8=\ngoogle.golang.org/appengine v1.6.3/go.mod h1:i06prIuMbXzDqacNJfV5OdTW448YApPu5ww/cMBSeb0=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127 h1:qIbj1fsPNlZgppZ+VLlY7N33q108Sa+fhmuc+sWQYwY=\ngopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/go-playground/assert.v1 v1.2.1 h1:xoYuJVE7KT85PYWrN730RguIQO0ePzVRfFMXadIrXTM=\ngopkg.in/go-playground/assert.v1 v1.2.1/go.mod h1:9RXL0bg/zibRAgZUYszZSwO/z8Y/a8bDuhia5mkpMnE=\ngopkg.in/go-playground/validator.v8 v8.18.2 h1:lFB4DoMU6B626w8ny76MV7VX6W2VHct2GVOI3xgiMrQ=\ngopkg.in/go-playground/validator.v8 v8.18.2/go.mod h1:RX2a/7Ha8BgOhfk7j780h4/u/RRjR0eouCJSH80/M2Y=\ngopkg.in/ini.v1 v1.47.0 h1:XAVsOWcIxjm6JVEbCbSZgSBZIF0BrCzXs4orAQr6uc8=\ngopkg.in/ini.v1 v1.47.0/go.mod h1:pNLf8WUiyNEtQjuu5G5vTm06TEv9tsIgeAvK8hOrP4k=\ngopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.2.2 h1:ZCJp+EgiOT7lHqUV2J862kp8Qj64Jo6az82+3Td9dZw=\ngopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "main.go", "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/models\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/gredis\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"github.com/EDDYCJY/go-gin-example/routers\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n)\n\nfunc init() {\n\tsetting.Setup()\n\tmodels.Setup()\n\tlogging.Setup()\n\tgredis.Setup()\n\tutil.Setup()\n}\n\n// @title Golang Gin API\n// @version 1.0\n// @description An example of gin\n// @termsOfService https://github.com/EDDYCJY/go-gin-example\n// @license.name MIT\n// @license.url https://github.com/EDDYCJY/go-gin-example/blob/master/LICENSE\nfunc main() {\n\tgin.SetMode(setting.ServerSetting.RunMode)\n\n\troutersInit := routers.InitRouter()\n\treadTimeout := setting.ServerSetting.ReadTimeout\n\twriteTimeout := setting.ServerSetting.WriteTimeout\n\tendPoint := fmt.Sprintf(\":%d\", setting.ServerSetting.HttpPort)\n\tmaxHeaderBytes := 1 << 20\n\n\tserver := &http.Server{\n\t\tAddr: endPoint,\n\t\tHandler: routersInit,\n\t\tReadTimeout: readTimeout,\n\t\tWriteTimeout: writeTimeout,\n\t\tMaxHeaderBytes: maxHeaderBytes,\n\t}\n\n\tlog.Printf(\"[info] start http server listening %s\", endPoint)\n\n\tserver.ListenAndServe()\n\n\t// If you want Graceful Restart, you need a Unix system and download github.com/fvbock/endless\n\t//endless.DefaultReadTimeOut = readTimeout\n\t//endless.DefaultWriteTimeOut = writeTimeout\n\t//endless.DefaultMaxHeaderBytes = maxHeaderBytes\n\t//server := endless.NewServer(endPoint, routersInit)\n\t//server.BeforeBegin = func(add string) {\n\t//\tlog.Printf(\"Actual pid is %d\", syscall.Getpid())\n\t//}\n\t//\n\t//err := server.ListenAndServe()\n\t//if err != nil {\n\t//\tlog.Printf(\"Server err: %v\", err)\n\t//}\n}\n" }, { "path": "middleware/jwt/jwt.go", "content": "package jwt\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/dgrijalva/jwt-go\"\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n)\n\n// JWT is jwt middleware\nfunc JWT() gin.HandlerFunc {\n\treturn func(c *gin.Context) {\n\t\tvar code int\n\t\tvar data interface{}\n\n\t\tcode = e.SUCCESS\n\t\ttoken := c.Query(\"token\")\n\t\tif token == \"\" {\n\t\t\tcode = e.INVALID_PARAMS\n\t\t} else {\n\t\t\t_, err := util.ParseToken(token)\n\t\t\tif err != nil {\n\t\t\t\tswitch err.(*jwt.ValidationError).Errors {\n\t\t\t\tcase jwt.ValidationErrorExpired:\n\t\t\t\t\tcode = e.ERROR_AUTH_CHECK_TOKEN_TIMEOUT\n\t\t\t\tdefault:\n\t\t\t\t\tcode = e.ERROR_AUTH_CHECK_TOKEN_FAIL\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif code != e.SUCCESS {\n\t\t\tc.JSON(http.StatusUnauthorized, gin.H{\n\t\t\t\t\"code\": code,\n\t\t\t\t\"msg\": e.GetMsg(code),\n\t\t\t\t\"data\": data,\n\t\t\t})\n\n\t\t\tc.Abort()\n\t\t\treturn\n\t\t}\n\n\t\tc.Next()\n\t}\n}\n" }, { "path": "models/article.go", "content": "package models\n\nimport (\n\t\"github.com/jinzhu/gorm\"\n)\n\ntype Article struct {\n\tModel\n\n\tTagID int `json:\"tag_id\" gorm:\"index\"`\n\tTag Tag `json:\"tag\"`\n\n\tTitle string `json:\"title\"`\n\tDesc string `json:\"desc\"`\n\tContent string `json:\"content\"`\n\tCoverImageUrl string `json:\"cover_image_url\"`\n\tCreatedBy string `json:\"created_by\"`\n\tModifiedBy string `json:\"modified_by\"`\n\tState int `json:\"state\"`\n}\n\n// ExistArticleByID checks if an article exists based on ID\nfunc ExistArticleByID(id int) (bool, error) {\n\tvar article Article\n\terr := db.Select(\"id\").Where(\"id = ? AND deleted_on = ? \", id, 0).First(&article).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn false, err\n\t}\n\n\tif article.ID > 0 {\n\t\treturn true, nil\n\t}\n\n\treturn false, nil\n}\n\n// GetArticleTotal gets the total number of articles based on the constraints\nfunc GetArticleTotal(maps interface{}) (int, error) {\n\tvar count int\n\tif err := db.Model(&Article{}).Where(maps).Count(&count).Error; err != nil {\n\t\treturn 0, err\n\t}\n\n\treturn count, nil\n}\n\n// GetArticles gets a list of articles based on paging constraints\nfunc GetArticles(pageNum int, pageSize int, maps interface{}) ([]*Article, error) {\n\tvar articles []*Article\n\terr := db.Preload(\"Tag\").Where(maps).Offset(pageNum).Limit(pageSize).Find(&articles).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn nil, err\n\t}\n\n\treturn articles, nil\n}\n\n// GetArticle Get a single article based on ID\nfunc GetArticle(id int) (*Article, error) {\n\tvar article Article\n\terr := db.Where(\"id = ? AND deleted_on = ? \", id, 0).First(&article).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn nil, err\n\t}\n\n\terr = db.Model(&article).Related(&article.Tag).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn nil, err\n\t}\n\n\treturn &article, nil\n}\n\n// EditArticle modify a single article\nfunc EditArticle(id int, data interface{}) error {\n\tif err := db.Model(&Article{}).Where(\"id = ? AND deleted_on = ? \", id, 0).Updates(data).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// AddArticle add a single article\nfunc AddArticle(data map[string]interface{}) error {\n\tarticle := Article{\n\t\tTagID: data[\"tag_id\"].(int),\n\t\tTitle: data[\"title\"].(string),\n\t\tDesc: data[\"desc\"].(string),\n\t\tContent: data[\"content\"].(string),\n\t\tCreatedBy: data[\"created_by\"].(string),\n\t\tState: data[\"state\"].(int),\n\t\tCoverImageUrl: data[\"cover_image_url\"].(string),\n\t}\n\tif err := db.Create(&article).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// DeleteArticle delete a single article\nfunc DeleteArticle(id int) error {\n\tif err := db.Where(\"id = ?\", id).Delete(Article{}).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// CleanAllArticle clear all article\nfunc CleanAllArticle() error {\n\tif err := db.Unscoped().Where(\"deleted_on != ? \", 0).Delete(&Article{}).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n" }, { "path": "models/auth.go", "content": "package models\n\nimport \"github.com/jinzhu/gorm\"\n\ntype Auth struct {\n\tID int `gorm:\"primary_key\" json:\"id\"`\n\tUsername string `json:\"username\"`\n\tPassword string `json:\"password\"`\n}\n\n// CheckAuth checks if authentication information exists\nfunc CheckAuth(username, password string) (bool, error) {\n\tvar auth Auth\n\terr := db.Select(\"id\").Where(Auth{Username: username, Password: password}).First(&auth).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn false, err\n\t}\n\n\tif auth.ID > 0 {\n\t\treturn true, nil\n\t}\n\n\treturn false, nil\n}\n" }, { "path": "models/models.go", "content": "package models\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\n\t\"github.com/jinzhu/gorm\"\n\t_ \"github.com/jinzhu/gorm/dialects/mysql\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"time\"\n)\n\nvar db *gorm.DB\n\ntype Model struct {\n\tID int `gorm:\"primary_key\" json:\"id\"`\n\tCreatedOn int `json:\"created_on\"`\n\tModifiedOn int `json:\"modified_on\"`\n\tDeletedOn int `json:\"deleted_on\"`\n}\n\n// Setup initializes the database instance\nfunc Setup() {\n\tvar err error\n\tdb, err = gorm.Open(setting.DatabaseSetting.Type, fmt.Sprintf(\"%s:%s@tcp(%s)/%s?charset=utf8&parseTime=True&loc=Local\",\n\t\tsetting.DatabaseSetting.User,\n\t\tsetting.DatabaseSetting.Password,\n\t\tsetting.DatabaseSetting.Host,\n\t\tsetting.DatabaseSetting.Name))\n\n\tif err != nil {\n\t\tlog.Fatalf(\"models.Setup err: %v\", err)\n\t}\n\n\tgorm.DefaultTableNameHandler = func(db *gorm.DB, defaultTableName string) string {\n\t\treturn setting.DatabaseSetting.TablePrefix + defaultTableName\n\t}\n\n\tdb.SingularTable(true)\n\tdb.Callback().Create().Replace(\"gorm:update_time_stamp\", updateTimeStampForCreateCallback)\n\tdb.Callback().Update().Replace(\"gorm:update_time_stamp\", updateTimeStampForUpdateCallback)\n\tdb.Callback().Delete().Replace(\"gorm:delete\", deleteCallback)\n\tdb.DB().SetMaxIdleConns(10)\n\tdb.DB().SetMaxOpenConns(100)\n}\n\n// CloseDB closes database connection (unnecessary)\nfunc CloseDB() {\n\tdefer db.Close()\n}\n\n// updateTimeStampForCreateCallback will set `CreatedOn`, `ModifiedOn` when creating\nfunc updateTimeStampForCreateCallback(scope *gorm.Scope) {\n\tif !scope.HasError() {\n\t\tnowTime := time.Now().Unix()\n\t\tif createTimeField, ok := scope.FieldByName(\"CreatedOn\"); ok {\n\t\t\tif createTimeField.IsBlank {\n\t\t\t\tcreateTimeField.Set(nowTime)\n\t\t\t}\n\t\t}\n\n\t\tif modifyTimeField, ok := scope.FieldByName(\"ModifiedOn\"); ok {\n\t\t\tif modifyTimeField.IsBlank {\n\t\t\t\tmodifyTimeField.Set(nowTime)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// updateTimeStampForUpdateCallback will set `ModifiedOn` when updating\nfunc updateTimeStampForUpdateCallback(scope *gorm.Scope) {\n\tif _, ok := scope.Get(\"gorm:update_column\"); !ok {\n\t\tscope.SetColumn(\"ModifiedOn\", time.Now().Unix())\n\t}\n}\n\n// deleteCallback will set `DeletedOn` where deleting\nfunc deleteCallback(scope *gorm.Scope) {\n\tif !scope.HasError() {\n\t\tvar extraOption string\n\t\tif str, ok := scope.Get(\"gorm:delete_option\"); ok {\n\t\t\textraOption = fmt.Sprint(str)\n\t\t}\n\n\t\tdeletedOnField, hasDeletedOnField := scope.FieldByName(\"DeletedOn\")\n\n\t\tif !scope.Search.Unscoped && hasDeletedOnField {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"UPDATE %v SET %v=%v%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\tscope.Quote(deletedOnField.DBName),\n\t\t\t\tscope.AddToVars(time.Now().Unix()),\n\t\t\t\taddExtraSpaceIfExist(scope.CombinedConditionSql()),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t)).Exec()\n\t\t} else {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"DELETE FROM %v%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\taddExtraSpaceIfExist(scope.CombinedConditionSql()),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t)).Exec()\n\t\t}\n\t}\n}\n\n// addExtraSpaceIfExist adds a separator\nfunc addExtraSpaceIfExist(str string) string {\n\tif str != \"\" {\n\t\treturn \" \" + str\n\t}\n\treturn \"\"\n}\n" }, { "path": "models/tag.go", "content": "package models\n\nimport (\n\t\"github.com/jinzhu/gorm\"\n)\n\ntype Tag struct {\n\tModel\n\n\tName string `json:\"name\"`\n\tCreatedBy string `json:\"created_by\"`\n\tModifiedBy string `json:\"modified_by\"`\n\tState int `json:\"state\"`\n}\n\n// ExistTagByName checks if there is a tag with the same name\nfunc ExistTagByName(name string) (bool, error) {\n\tvar tag Tag\n\terr := db.Select(\"id\").Where(\"name = ? AND deleted_on = ? \", name, 0).First(&tag).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn false, err\n\t}\n\n\tif tag.ID > 0 {\n\t\treturn true, nil\n\t}\n\n\treturn false, nil\n}\n\n// AddTag Add a Tag\nfunc AddTag(name string, state int, createdBy string) error {\n\ttag := Tag{\n\t\tName: name,\n\t\tState: state,\n\t\tCreatedBy: createdBy,\n\t}\n\tif err := db.Create(&tag).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// GetTags gets a list of tags based on paging and constraints\nfunc GetTags(pageNum int, pageSize int, maps interface{}) ([]Tag, error) {\n\tvar (\n\t\ttags []Tag\n\t\terr error\n\t)\n\n\tif pageSize > 0 && pageNum > 0 {\n\t\terr = db.Where(maps).Find(&tags).Offset(pageNum).Limit(pageSize).Error\n\t} else {\n\t\terr = db.Where(maps).Find(&tags).Error\n\t}\n\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn nil, err\n\t}\n\n\treturn tags, nil\n}\n\n// GetTagTotal counts the total number of tags based on the constraint\nfunc GetTagTotal(maps interface{}) (int, error) {\n\tvar count int\n\tif err := db.Model(&Tag{}).Where(maps).Count(&count).Error; err != nil {\n\t\treturn 0, err\n\t}\n\n\treturn count, nil\n}\n\n// ExistTagByID determines whether a Tag exists based on the ID\nfunc ExistTagByID(id int) (bool, error) {\n\tvar tag Tag\n\terr := db.Select(\"id\").Where(\"id = ? AND deleted_on = ? \", id, 0).First(&tag).Error\n\tif err != nil && err != gorm.ErrRecordNotFound {\n\t\treturn false, err\n\t}\n\tif tag.ID > 0 {\n\t\treturn true, nil\n\t}\n\n\treturn false, nil\n}\n\n// DeleteTag delete a tag\nfunc DeleteTag(id int) error {\n\tif err := db.Where(\"id = ?\", id).Delete(&Tag{}).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// EditTag modify a single tag\nfunc EditTag(id int, data interface{}) error {\n\tif err := db.Model(&Tag{}).Where(\"id = ? AND deleted_on = ? \", id, 0).Updates(data).Error; err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// CleanAllTag clear all tag\nfunc CleanAllTag() (bool, error) {\n\tif err := db.Unscoped().Where(\"deleted_on != ? \", 0).Delete(&Tag{}).Error; err != nil {\n\t\treturn false, err\n\t}\n\n\treturn true, nil\n}\n" }, { "path": "pkg/app/form.go", "content": "package app\n\nimport (\n\t\"github.com/astaxie/beego/validation\"\n\t\"github.com/gin-gonic/gin\"\n\t\"net/http\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n)\n\n// BindAndValid binds and validates data\nfunc BindAndValid(c *gin.Context, form interface{}) (int, int) {\n\terr := c.Bind(form)\n\tif err != nil {\n\t\treturn http.StatusBadRequest, e.INVALID_PARAMS\n\t}\n\n\tvalid := validation.Validation{}\n\tcheck, err := valid.Valid(form)\n\tif err != nil {\n\t\treturn http.StatusInternalServerError, e.ERROR\n\t}\n\tif !check {\n\t\tMarkErrors(valid.Errors)\n\t\treturn http.StatusBadRequest, e.INVALID_PARAMS\n\t}\n\n\treturn http.StatusOK, e.SUCCESS\n}\n" }, { "path": "pkg/app/request.go", "content": "package app\n\nimport (\n\t\"github.com/astaxie/beego/validation\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n)\n\n// MarkErrors logs error logs\nfunc MarkErrors(errors []*validation.Error) {\n\tfor _, err := range errors {\n\t\tlogging.Info(err.Key, err.Message)\n\t}\n\n\treturn\n}\n" }, { "path": "pkg/app/response.go", "content": "package app\n\nimport (\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n)\n\ntype Gin struct {\n\tC *gin.Context\n}\n\ntype Response struct {\n\tCode int `json:\"code\"`\n\tMsg string `json:\"msg\"`\n\tData interface{} `json:\"data\"`\n}\n\n// Response setting gin.JSON\nfunc (g *Gin) Response(httpCode, errCode int, data interface{}) {\n\tg.C.JSON(httpCode, Response{\n\t\tCode: errCode,\n\t\tMsg: e.GetMsg(errCode),\n\t\tData: data,\n\t})\n\treturn\n}\n" }, { "path": "pkg/e/cache.go", "content": "package e\n\nconst (\n\tCACHE_ARTICLE = \"ARTICLE\"\n\tCACHE_TAG = \"TAG\"\n)\n" }, { "path": "pkg/e/code.go", "content": "package e\n\nconst (\n\tSUCCESS = 200\n\tERROR = 500\n\tINVALID_PARAMS = 400\n\n\tERROR_EXIST_TAG = 10001\n\tERROR_EXIST_TAG_FAIL = 10002\n\tERROR_NOT_EXIST_TAG = 10003\n\tERROR_GET_TAGS_FAIL = 10004\n\tERROR_COUNT_TAG_FAIL = 10005\n\tERROR_ADD_TAG_FAIL = 10006\n\tERROR_EDIT_TAG_FAIL = 10007\n\tERROR_DELETE_TAG_FAIL = 10008\n\tERROR_EXPORT_TAG_FAIL = 10009\n\tERROR_IMPORT_TAG_FAIL = 10010\n\n\tERROR_NOT_EXIST_ARTICLE = 10011\n\tERROR_CHECK_EXIST_ARTICLE_FAIL = 10012\n\tERROR_ADD_ARTICLE_FAIL = 10013\n\tERROR_DELETE_ARTICLE_FAIL = 10014\n\tERROR_EDIT_ARTICLE_FAIL = 10015\n\tERROR_COUNT_ARTICLE_FAIL = 10016\n\tERROR_GET_ARTICLES_FAIL = 10017\n\tERROR_GET_ARTICLE_FAIL = 10018\n\tERROR_GEN_ARTICLE_POSTER_FAIL = 10019\n\n\tERROR_AUTH_CHECK_TOKEN_FAIL = 20001\n\tERROR_AUTH_CHECK_TOKEN_TIMEOUT = 20002\n\tERROR_AUTH_TOKEN = 20003\n\tERROR_AUTH = 20004\n\n\tERROR_UPLOAD_SAVE_IMAGE_FAIL = 30001\n\tERROR_UPLOAD_CHECK_IMAGE_FAIL = 30002\n\tERROR_UPLOAD_CHECK_IMAGE_FORMAT = 30003\n)\n" }, { "path": "pkg/e/msg.go", "content": "package e\n\nvar MsgFlags = map[int]string{\n\tSUCCESS: \"ok\",\n\tERROR: \"fail\",\n\tINVALID_PARAMS: \"请求参数错误\",\n\tERROR_EXIST_TAG: \"已存在该标签名称\",\n\tERROR_EXIST_TAG_FAIL: \"获取已存在标签失败\",\n\tERROR_NOT_EXIST_TAG: \"该标签不存在\",\n\tERROR_GET_TAGS_FAIL: \"获取所有标签失败\",\n\tERROR_COUNT_TAG_FAIL: \"统计标签失败\",\n\tERROR_ADD_TAG_FAIL: \"新增标签失败\",\n\tERROR_EDIT_TAG_FAIL: \"修改标签失败\",\n\tERROR_DELETE_TAG_FAIL: \"删除标签失败\",\n\tERROR_EXPORT_TAG_FAIL: \"导出标签失败\",\n\tERROR_IMPORT_TAG_FAIL: \"导入标签失败\",\n\tERROR_NOT_EXIST_ARTICLE: \"该文章不存在\",\n\tERROR_ADD_ARTICLE_FAIL: \"新增文章失败\",\n\tERROR_DELETE_ARTICLE_FAIL: \"删除文章失败\",\n\tERROR_CHECK_EXIST_ARTICLE_FAIL: \"检查文章是否存在失败\",\n\tERROR_EDIT_ARTICLE_FAIL: \"修改文章失败\",\n\tERROR_COUNT_ARTICLE_FAIL: \"统计文章失败\",\n\tERROR_GET_ARTICLES_FAIL: \"获取多个文章失败\",\n\tERROR_GET_ARTICLE_FAIL: \"获取单个文章失败\",\n\tERROR_GEN_ARTICLE_POSTER_FAIL: \"生成文章海报失败\",\n\tERROR_AUTH_CHECK_TOKEN_FAIL: \"Token鉴权失败\",\n\tERROR_AUTH_CHECK_TOKEN_TIMEOUT: \"Token已超时\",\n\tERROR_AUTH_TOKEN: \"Token生成失败\",\n\tERROR_AUTH: \"Token错误\",\n\tERROR_UPLOAD_SAVE_IMAGE_FAIL: \"保存图片失败\",\n\tERROR_UPLOAD_CHECK_IMAGE_FAIL: \"检查图片失败\",\n\tERROR_UPLOAD_CHECK_IMAGE_FORMAT: \"校验图片错误，图片格式或大小有问题\",\n}\n\n// GetMsg get error information based on Code\nfunc GetMsg(code int) string {\n\tmsg, ok := MsgFlags[code]\n\tif ok {\n\t\treturn msg\n\t}\n\n\treturn MsgFlags[ERROR]\n}\n" }, { "path": "pkg/export/excel.go", "content": "package export\n\nimport \"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\nconst EXT = \".xlsx\"\n\n// GetExcelFullUrl get the full access path of the Excel file\nfunc GetExcelFullUrl(name string) string {\n\treturn setting.AppSetting.PrefixUrl + \"/\" + GetExcelPath() + name\n}\n\n// GetExcelPath get the relative save path of the Excel file\nfunc GetExcelPath() string {\n\treturn setting.AppSetting.ExportSavePath\n}\n\n// GetExcelFullPath Get the full save path of the Excel file\nfunc GetExcelFullPath() string {\n\treturn setting.AppSetting.RuntimeRootPath + GetExcelPath()\n}\n" }, { "path": "pkg/file/file.go", "content": "package file\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"mime/multipart\"\n\t\"os\"\n\t\"path\"\n)\n\n// GetSize get the file size\nfunc GetSize(f multipart.File) (int, error) {\n\tcontent, err := ioutil.ReadAll(f)\n\n\treturn len(content), err\n}\n\n// GetExt get the file ext\nfunc GetExt(fileName string) string {\n\treturn path.Ext(fileName)\n}\n\n// CheckNotExist check if the file exists\nfunc CheckNotExist(src string) bool {\n\t_, err := os.Stat(src)\n\n\treturn os.IsNotExist(err)\n}\n\n// CheckPermission check if the file has permission\nfunc CheckPermission(src string) bool {\n\t_, err := os.Stat(src)\n\n\treturn os.IsPermission(err)\n}\n\n// IsNotExistMkDir create a directory if it does not exist\nfunc IsNotExistMkDir(src string) error {\n\tif notExist := CheckNotExist(src); notExist == true {\n\t\tif err := MkDir(src); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// MkDir create a directory\nfunc MkDir(src string) error {\n\terr := os.MkdirAll(src, os.ModePerm)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// Open a file according to a specific mode\nfunc Open(name string, flag int, perm os.FileMode) (*os.File, error) {\n\tf, err := os.OpenFile(name, flag, perm)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn f, nil\n}\n\n// MustOpen maximize trying to open the file\nfunc MustOpen(fileName, filePath string) (*os.File, error) {\n\tdir, err := os.Getwd()\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"os.Getwd err: %v\", err)\n\t}\n\n\tsrc := dir + \"/\" + filePath\n\tperm := CheckPermission(src)\n\tif perm == true {\n\t\treturn nil, fmt.Errorf(\"file.CheckPermission Permission denied src: %s\", src)\n\t}\n\n\terr = IsNotExistMkDir(src)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"file.IsNotExistMkDir src: %s, err: %v\", src, err)\n\t}\n\n\tf, err := Open(src+fileName, os.O_APPEND|os.O_CREATE|os.O_RDWR, 0644)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"Fail to OpenFile :%v\", err)\n\t}\n\n\treturn f, nil\n}\n" }, { "path": "pkg/gredis/redis.go", "content": "package gredis\n\nimport (\n\t\"encoding/json\"\n\t\"time\"\n\n\t\"github.com/gomodule/redigo/redis\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n)\n\nvar RedisConn *redis.Pool\n\n// Setup Initialize the Redis instance\nfunc Setup() error {\n\tRedisConn = &redis.Pool{\n\t\tMaxIdle: setting.RedisSetting.MaxIdle,\n\t\tMaxActive: setting.RedisSetting.MaxActive,\n\t\tIdleTimeout: setting.RedisSetting.IdleTimeout,\n\t\tDial: func() (redis.Conn, error) {\n\t\t\tc, err := redis.Dial(\"tcp\", setting.RedisSetting.Host)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tif setting.RedisSetting.Password != \"\" {\n\t\t\t\tif _, err := c.Do(\"AUTH\", setting.RedisSetting.Password); err != nil {\n\t\t\t\t\tc.Close()\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn c, err\n\t\t},\n\t\tTestOnBorrow: func(c redis.Conn, t time.Time) error {\n\t\t\t_, err := c.Do(\"PING\")\n\t\t\treturn err\n\t\t},\n\t}\n\n\treturn nil\n}\n\n// Set a key/value\nfunc Set(key string, data interface{}, time int) error {\n\tconn := RedisConn.Get()\n\tdefer conn.Close()\n\n\tvalue, err := json.Marshal(data)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t_, err = conn.Do(\"SET\", key, value)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t_, err = conn.Do(\"EXPIRE\", key, time)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// Exists check a key\nfunc Exists(key string) bool {\n\tconn := RedisConn.Get()\n\tdefer conn.Close()\n\n\texists, err := redis.Bool(conn.Do(\"EXISTS\", key))\n\tif err != nil {\n\t\treturn false\n\t}\n\n\treturn exists\n}\n\n// Get get a key\nfunc Get(key string) ([]byte, error) {\n\tconn := RedisConn.Get()\n\tdefer conn.Close()\n\n\treply, err := redis.Bytes(conn.Do(\"GET\", key))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn reply, nil\n}\n\n// Delete delete a kye\nfunc Delete(key string) (bool, error) {\n\tconn := RedisConn.Get()\n\tdefer conn.Close()\n\n\treturn redis.Bool(conn.Do(\"DEL\", key))\n}\n\n// LikeDeletes batch delete\nfunc LikeDeletes(key string) error {\n\tconn := RedisConn.Get()\n\tdefer conn.Close()\n\n\tkeys, err := redis.Strings(conn.Do(\"KEYS\", \"*\"+key+\"*\"))\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfor _, key := range keys {\n\t\t_, err = Delete(key)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "pkg/logging/file.go", "content": "package logging\n\nimport (\n\t\"fmt\"\n\t\"time\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n)\n\n// getLogFilePath get the log file save path\nfunc getLogFilePath() string {\n\treturn fmt.Sprintf(\"%s%s\", setting.AppSetting.RuntimeRootPath, setting.AppSetting.LogSavePath)\n}\n\n// getLogFileName get the save name of the log file\nfunc getLogFileName() string {\n\treturn fmt.Sprintf(\"%s%s.%s\",\n\t\tsetting.AppSetting.LogSaveName,\n\t\ttime.Now().Format(setting.AppSetting.TimeFormat),\n\t\tsetting.AppSetting.LogFileExt,\n\t)\n}\n" }, { "path": "pkg/logging/log.go", "content": "package logging\n\nimport (\n\t\"fmt\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/file\"\n\t\"log\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"runtime\"\n)\n\ntype Level int\n\nvar (\n\tF *os.File\n\n\tDefaultPrefix = \"\"\n\tDefaultCallerDepth = 2\n\n\tlogger *log.Logger\n\tlogPrefix = \"\"\n\tlevelFlags = []string{\"DEBUG\", \"INFO\", \"WARN\", \"ERROR\", \"FATAL\"}\n)\n\nconst (\n\tDEBUG Level = iota\n\tINFO\n\tWARNING\n\tERROR\n\tFATAL\n)\n\n// Setup initialize the log instance\nfunc Setup() {\n\tvar err error\n\tfilePath := getLogFilePath()\n\tfileName := getLogFileName()\n\tF, err = file.MustOpen(fileName, filePath)\n\tif err != nil {\n\t\tlog.Fatalf(\"logging.Setup err: %v\", err)\n\t}\n\n\tlogger = log.New(F, DefaultPrefix, log.LstdFlags)\n}\n\n// Debug output logs at debug level\nfunc Debug(v ...interface{}) {\n\tsetPrefix(DEBUG)\n\tlogger.Println(v)\n}\n\n// Info output logs at info level\nfunc Info(v ...interface{}) {\n\tsetPrefix(INFO)\n\tlogger.Println(v)\n}\n\n// Warn output logs at warn level\nfunc Warn(v ...interface{}) {\n\tsetPrefix(WARNING)\n\tlogger.Println(v)\n}\n\n// Error output logs at error level\nfunc Error(v ...interface{}) {\n\tsetPrefix(ERROR)\n\tlogger.Println(v)\n}\n\n// Fatal output logs at fatal level\nfunc Fatal(v ...interface{}) {\n\tsetPrefix(FATAL)\n\tlogger.Fatalln(v)\n}\n\n// setPrefix set the prefix of the log output\nfunc setPrefix(level Level) {\n\t_, file, line, ok := runtime.Caller(DefaultCallerDepth)\n\tif ok {\n\t\tlogPrefix = fmt.Sprintf(\"[%s][%s:%d]\", levelFlags[level], filepath.Base(file), line)\n\t} else {\n\t\tlogPrefix = fmt.Sprintf(\"[%s]\", levelFlags[level])\n\t}\n\n\tlogger.SetPrefix(logPrefix)\n}\n" }, { "path": "pkg/qrcode/qrcode.go", "content": "package qrcode\n\nimport (\n\t\"image/jpeg\"\n\n\t\"github.com/boombuler/barcode\"\n\t\"github.com/boombuler/barcode/qr\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/file\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n)\n\ntype QrCode struct {\n\tURL string\n\tWidth int\n\tHeight int\n\tExt string\n\tLevel qr.ErrorCorrectionLevel\n\tMode qr.Encoding\n}\n\nconst (\n\tEXT_JPG = \".jpg\"\n)\n\n// NewQrCode initialize instance\nfunc NewQrCode(url string, width, height int, level qr.ErrorCorrectionLevel, mode qr.Encoding) *QrCode {\n\treturn &QrCode{\n\t\tURL: url,\n\t\tWidth: width,\n\t\tHeight: height,\n\t\tLevel: level,\n\t\tMode: mode,\n\t\tExt: EXT_JPG,\n\t}\n}\n\n// GetQrCodePath get save path\nfunc GetQrCodePath() string {\n\treturn setting.AppSetting.QrCodeSavePath\n}\n\n// GetQrCodeFullPath get full save path\nfunc GetQrCodeFullPath() string {\n\treturn setting.AppSetting.RuntimeRootPath + setting.AppSetting.QrCodeSavePath\n}\n\n// GetQrCodeFullUrl get the full access path\nfunc GetQrCodeFullUrl(name string) string {\n\treturn setting.AppSetting.PrefixUrl + \"/\" + GetQrCodePath() + name\n}\n\n// GetQrCodeFileName get qr file name\nfunc GetQrCodeFileName(value string) string {\n\treturn util.EncodeMD5(value)\n}\n\n// GetQrCodeExt get qr file ext\nfunc (q *QrCode) GetQrCodeExt() string {\n\treturn q.Ext\n}\n\n// Encode generate QR code\nfunc (q *QrCode) Encode(path string) (string, string, error) {\n\tname := GetQrCodeFileName(q.URL) + q.GetQrCodeExt()\n\tsrc := path + name\n\tif file.CheckNotExist(src) == true {\n\t\tcode, err := qr.Encode(q.URL, q.Level, q.Mode)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\tcode, err = barcode.Scale(code, q.Width, q.Height)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\tf, err := file.MustOpen(name, path)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t\tdefer f.Close()\n\n\t\terr = jpeg.Encode(f, code, nil)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t}\n\n\treturn name, path, nil\n}\n" }, { "path": "pkg/setting/setting.go", "content": "package setting\n\nimport (\n\t\"log\"\n\t\"time\"\n\n\t\"github.com/go-ini/ini\"\n)\n\ntype App struct {\n\tJwtSecret string\n\tPageSize int\n\tPrefixUrl string\n\n\tRuntimeRootPath string\n\n\tImageSavePath string\n\tImageMaxSize int\n\tImageAllowExts []string\n\n\tExportSavePath string\n\tQrCodeSavePath string\n\tFontSavePath string\n\n\tLogSavePath string\n\tLogSaveName string\n\tLogFileExt string\n\tTimeFormat string\n}\n\nvar AppSetting = &App{}\n\ntype Server struct {\n\tRunMode string\n\tHttpPort int\n\tReadTimeout time.Duration\n\tWriteTimeout time.Duration\n}\n\nvar ServerSetting = &Server{}\n\ntype Database struct {\n\tType string\n\tUser string\n\tPassword string\n\tHost string\n\tName string\n\tTablePrefix string\n}\n\nvar DatabaseSetting = &Database{}\n\ntype Redis struct {\n\tHost string\n\tPassword string\n\tMaxIdle int\n\tMaxActive int\n\tIdleTimeout time.Duration\n}\n\nvar RedisSetting = &Redis{}\n\nvar cfg *ini.File\n\n// Setup initialize the configuration instance\nfunc Setup() {\n\tvar err error\n\tcfg, err = ini.Load(\"conf/app.ini\")\n\tif err != nil {\n\t\tlog.Fatalf(\"setting.Setup, fail to parse 'conf/app.ini': %v\", err)\n\t}\n\n\tmapTo(\"app\", AppSetting)\n\tmapTo(\"server\", ServerSetting)\n\tmapTo(\"database\", DatabaseSetting)\n\tmapTo(\"redis\", RedisSetting)\n\n\tAppSetting.ImageMaxSize = AppSetting.ImageMaxSize * 1024 * 1024\n\tServerSetting.ReadTimeout = ServerSetting.ReadTimeout * time.Second\n\tServerSetting.WriteTimeout = ServerSetting.WriteTimeout * time.Second\n\tRedisSetting.IdleTimeout = RedisSetting.IdleTimeout * time.Second\n}\n\n// mapTo map section\nfunc mapTo(section string, v interface{}) {\n\terr := cfg.Section(section).MapTo(v)\n\tif err != nil {\n\t\tlog.Fatalf(\"Cfg.MapTo %s err: %v\", section, err)\n\t}\n}\n" }, { "path": "pkg/upload/image.go", "content": "package upload\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"mime/multipart\"\n\t\"os\"\n\t\"path\"\n\t\"strings\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/file\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n)\n\n// GetImageFullUrl get the full access path\nfunc GetImageFullUrl(name string) string {\n\treturn setting.AppSetting.PrefixUrl + \"/\" + GetImagePath() + name\n}\n\n// GetImageName get image name\nfunc GetImageName(name string) string {\n\text := path.Ext(name)\n\tfileName := strings.TrimSuffix(name, ext)\n\tfileName = util.EncodeMD5(fileName)\n\n\treturn fileName + ext\n}\n\n// GetImagePath get save path\nfunc GetImagePath() string {\n\treturn setting.AppSetting.ImageSavePath\n}\n\n// GetImageFullPath get full save path\nfunc GetImageFullPath() string {\n\treturn setting.AppSetting.RuntimeRootPath + GetImagePath()\n}\n\n// CheckImageExt check image file ext\nfunc CheckImageExt(fileName string) bool {\n\text := file.GetExt(fileName)\n\tfor _, allowExt := range setting.AppSetting.ImageAllowExts {\n\t\tif strings.ToUpper(allowExt) == strings.ToUpper(ext) {\n\t\t\treturn true\n\t\t}\n\t}\n\n\treturn false\n}\n\n// CheckImageSize check image size\nfunc CheckImageSize(f multipart.File) bool {\n\tsize, err := file.GetSize(f)\n\tif err != nil {\n\t\tlog.Println(err)\n\t\tlogging.Warn(err)\n\t\treturn false\n\t}\n\n\treturn size <= setting.AppSetting.ImageMaxSize\n}\n\n// CheckImage check if the file exists\nfunc CheckImage(src string) error {\n\tdir, err := os.Getwd()\n\tif err != nil {\n\t\treturn fmt.Errorf(\"os.Getwd err: %v\", err)\n\t}\n\n\terr = file.IsNotExistMkDir(dir + \"/\" + src)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"file.IsNotExistMkDir err: %v\", err)\n\t}\n\n\tperm := file.CheckPermission(src)\n\tif perm == true {\n\t\treturn fmt.Errorf(\"file.CheckPermission Permission denied src: %s\", src)\n\t}\n\n\treturn nil\n}\n" }, { "path": "pkg/util/jwt.go", "content": "package util\n\nimport (\n\t\"time\"\n\n\t\"github.com/dgrijalva/jwt-go\"\n)\n\nvar jwtSecret []byte\n\ntype Claims struct {\n\tUsername string `json:\"username\"`\n\tPassword string `json:\"password\"`\n\tjwt.StandardClaims\n}\n\n// GenerateToken generate tokens used for auth\nfunc GenerateToken(username, password string) (string, error) {\n\tnowTime := time.Now()\n\texpireTime := nowTime.Add(3 * time.Hour)\n\n\tclaims := Claims{\n\t\tEncodeMD5(username),\n\t\tEncodeMD5(password),\n\t\tjwt.StandardClaims{\n\t\t\tExpiresAt: expireTime.Unix(),\n\t\t\tIssuer: \"gin-blog\",\n\t\t},\n\t}\n\n\ttokenClaims := jwt.NewWithClaims(jwt.SigningMethodHS256, claims)\n\ttoken, err := tokenClaims.SignedString(jwtSecret)\n\n\treturn token, err\n}\n\n// ParseToken parsing token\nfunc ParseToken(token string) (*Claims, error) {\n\ttokenClaims, err := jwt.ParseWithClaims(token, &Claims{}, func(token *jwt.Token) (interface{}, error) {\n\t\treturn jwtSecret, nil\n\t})\n\n\tif tokenClaims != nil {\n\t\tif claims, ok := tokenClaims.Claims.(*Claims); ok && tokenClaims.Valid {\n\t\t\treturn claims, nil\n\t\t}\n\t}\n\n\treturn nil, err\n}\n" }, { "path": "pkg/util/md5.go", "content": "package util\n\nimport (\n\t\"crypto/md5\"\n\t\"encoding/hex\"\n)\n\n// EncodeMD5 md5 encryption\nfunc EncodeMD5(value string) string {\n\tm := md5.New()\n\tm.Write([]byte(value))\n\n\treturn hex.EncodeToString(m.Sum(nil))\n}\n" }, { "path": "pkg/util/pagination.go", "content": "package util\n\nimport (\n\t\"github.com/unknwon/com\"\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n)\n\n// GetPage get page parameters\nfunc GetPage(c *gin.Context) int {\n\tresult := 0\n\tpage := com.StrTo(c.Query(\"page\")).MustInt()\n\tif page > 0 {\n\t\tresult = (page - 1) * setting.AppSetting.PageSize\n\t}\n\n\treturn result\n}\n" }, { "path": "pkg/util/util.go", "content": "package util\n\nimport \"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\n// Setup Initialize the util\nfunc Setup() {\n\tjwtSecret = []byte(setting.AppSetting.JwtSecret)\n}" }, { "path": "routers/api/auth.go", "content": "package api\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/astaxie/beego/validation\"\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/app\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n\t\"github.com/EDDYCJY/go-gin-example/service/auth_service\"\n)\n\ntype auth struct {\n\tUsername string `valid:\"Required; MaxSize(50)\"`\n\tPassword string `valid:\"Required; MaxSize(50)\"`\n}\n\n// @Summary Get Auth\n// @Produce json\n// @Param username query string true \"userName\"\n// @Param password query string true \"password\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /auth [get]\nfunc GetAuth(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tvalid := validation.Validation{}\n\n\tusername := c.PostForm(\"username\")\n\tpassword := c.PostForm(\"password\")\n\n\ta := auth{Username: username, Password: password}\n\tok, _ := valid.Valid(&a)\n\n\tif !ok {\n\t\tapp.MarkErrors(valid.Errors)\n\t\tappG.Response(http.StatusBadRequest, e.INVALID_PARAMS, nil)\n\t\treturn\n\t}\n\n\tauthService := auth_service.Auth{Username: username, Password: password}\n\tisExist, err := authService.Check()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_AUTH_CHECK_TOKEN_FAIL, nil)\n\t\treturn\n\t}\n\n\tif !isExist {\n\t\tappG.Response(http.StatusUnauthorized, e.ERROR_AUTH, nil)\n\t\treturn\n\t}\n\n\ttoken, err := util.GenerateToken(username, password)\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_AUTH_TOKEN, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, map[string]string{\n\t\t\"token\": token,\n\t})\n}\n" }, { "path": "routers/api/upload.go", "content": "package api\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/app\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/upload\"\n)\n\n// @Summary Import Image\n// @Produce json\n// @Param image formData file true \"Image File\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags/import [post]\nfunc UploadImage(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tfile, image, err := c.Request.FormFile(\"image\")\n\tif err != nil {\n\t\tlogging.Warn(err)\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR, nil)\n\t\treturn\n\t}\n\n\tif image == nil {\n\t\tappG.Response(http.StatusBadRequest, e.INVALID_PARAMS, nil)\n\t\treturn\n\t}\n\n\timageName := upload.GetImageName(image.Filename)\n\tfullPath := upload.GetImageFullPath()\n\tsavePath := upload.GetImagePath()\n\tsrc := fullPath + imageName\n\n\tif !upload.CheckImageExt(imageName) || !upload.CheckImageSize(file) {\n\t\tappG.Response(http.StatusBadRequest, e.ERROR_UPLOAD_CHECK_IMAGE_FORMAT, nil)\n\t\treturn\n\t}\n\n\terr = upload.CheckImage(fullPath)\n\tif err != nil {\n\t\tlogging.Warn(err)\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_UPLOAD_CHECK_IMAGE_FAIL, nil)\n\t\treturn\n\t}\n\n\tif err := c.SaveUploadedFile(image, src); err != nil {\n\t\tlogging.Warn(err)\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_UPLOAD_SAVE_IMAGE_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, map[string]string{\n\t\t\"image_url\": upload.GetImageFullUrl(imageName),\n\t\t\"image_save_url\": savePath + imageName,\n\t})\n}\n" }, { "path": "routers/api/v1/article.go", "content": "package v1\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/unknwon/com\"\n\t\"github.com/astaxie/beego/validation\"\n\t\"github.com/boombuler/barcode/qr\"\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/app\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/qrcode\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n\t\"github.com/EDDYCJY/go-gin-example/service/article_service\"\n\t\"github.com/EDDYCJY/go-gin-example/service/tag_service\"\n)\n\n// @Summary Get a single article\n// @Produce json\n// @Param id path int true \"ID\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/articles/{id} [get]\nfunc GetArticle(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tid := com.StrTo(c.Param(\"id\")).MustInt()\n\tvalid := validation.Validation{}\n\tvalid.Min(id, 1, \"id\")\n\n\tif valid.HasErrors() {\n\t\tapp.MarkErrors(valid.Errors)\n\t\tappG.Response(http.StatusBadRequest, e.INVALID_PARAMS, nil)\n\t\treturn\n\t}\n\n\tarticleService := article_service.Article{ID: id}\n\texists, err := articleService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_CHECK_EXIST_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_ARTICLE, nil)\n\t\treturn\n\t}\n\n\tarticle, err := articleService.Get()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_GET_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, article)\n}\n\n// @Summary Get multiple articles\n// @Produce json\n// @Param tag_id body int false \"TagID\"\n// @Param state body int false \"State\"\n// @Param created_by body int false \"CreatedBy\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/articles [get]\nfunc GetArticles(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tvalid := validation.Validation{}\n\n\tstate := -1\n\tif arg := c.PostForm(\"state\"); arg != \"\" {\n\t\tstate = com.StrTo(arg).MustInt()\n\t\tvalid.Range(state, 0, 1, \"state\")\n\t}\n\n\ttagId := -1\n\tif arg := c.PostForm(\"tag_id\"); arg != \"\" {\n\t\ttagId = com.StrTo(arg).MustInt()\n\t\tvalid.Min(tagId, 1, \"tag_id\")\n\t}\n\n\tif valid.HasErrors() {\n\t\tapp.MarkErrors(valid.Errors)\n\t\tappG.Response(http.StatusBadRequest, e.INVALID_PARAMS, nil)\n\t\treturn\n\t}\n\n\tarticleService := article_service.Article{\n\t\tTagID: tagId,\n\t\tState: state,\n\t\tPageNum: util.GetPage(c),\n\t\tPageSize: setting.AppSetting.PageSize,\n\t}\n\n\ttotal, err := articleService.Count()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_COUNT_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\n\tarticles, err := articleService.GetAll()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_GET_ARTICLES_FAIL, nil)\n\t\treturn\n\t}\n\n\tdata := make(map[string]interface{})\n\tdata[\"lists\"] = articles\n\tdata[\"total\"] = total\n\n\tappG.Response(http.StatusOK, e.SUCCESS, data)\n}\n\ntype AddArticleForm struct {\n\tTagID int `form:\"tag_id\" valid:\"Required;Min(1)\"`\n\tTitle string `form:\"title\" valid:\"Required;MaxSize(100)\"`\n\tDesc string `form:\"desc\" valid:\"Required;MaxSize(255)\"`\n\tContent string `form:\"content\" valid:\"Required;MaxSize(65535)\"`\n\tCreatedBy string `form:\"created_by\" valid:\"Required;MaxSize(100)\"`\n\tCoverImageUrl string `form:\"cover_image_url\" valid:\"Required;MaxSize(255)\"`\n\tState int `form:\"state\" valid:\"Range(0,1)\"`\n}\n\n// @Summary Add article\n// @Produce json\n// @Param tag_id body int true \"TagID\"\n// @Param title body string true \"Title\"\n// @Param desc body string true \"Desc\"\n// @Param content body string true \"Content\"\n// @Param created_by body string true \"CreatedBy\"\n// @Param state body int true \"State\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/articles [post]\nfunc AddArticle(c *gin.Context) {\n\tvar (\n\t\tappG = app.Gin{C: c}\n\t\tform AddArticleForm\n\t)\n\n\thttpCode, errCode := app.BindAndValid(c, &form)\n\tif errCode != e.SUCCESS {\n\t\tappG.Response(httpCode, errCode, nil)\n\t\treturn\n\t}\n\n\ttagService := tag_service.Tag{ID: form.TagID}\n\texists, err := tagService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXIST_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_TAG, nil)\n\t\treturn\n\t}\n\n\tarticleService := article_service.Article{\n\t\tTagID: form.TagID,\n\t\tTitle: form.Title,\n\t\tDesc: form.Desc,\n\t\tContent: form.Content,\n\t\tCoverImageUrl: form.CoverImageUrl,\n\t\tState: form.State,\n\t\tCreatedBy: form.CreatedBy,\n\t}\n\tif err := articleService.Add(); err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_ADD_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\ntype EditArticleForm struct {\n\tID int `form:\"id\" valid:\"Required;Min(1)\"`\n\tTagID int `form:\"tag_id\" valid:\"Required;Min(1)\"`\n\tTitle string `form:\"title\" valid:\"Required;MaxSize(100)\"`\n\tDesc string `form:\"desc\" valid:\"Required;MaxSize(255)\"`\n\tContent string `form:\"content\" valid:\"Required;MaxSize(65535)\"`\n\tModifiedBy string `form:\"modified_by\" valid:\"Required;MaxSize(100)\"`\n\tCoverImageUrl string `form:\"cover_image_url\" valid:\"Required;MaxSize(255)\"`\n\tState int `form:\"state\" valid:\"Range(0,1)\"`\n}\n\n// @Summary Update article\n// @Produce json\n// @Param id path int true \"ID\"\n// @Param tag_id body string false \"TagID\"\n// @Param title body string false \"Title\"\n// @Param desc body string false \"Desc\"\n// @Param content body string false \"Content\"\n// @Param modified_by body string true \"ModifiedBy\"\n// @Param state body int false \"State\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/articles/{id} [put]\nfunc EditArticle(c *gin.Context) {\n\tvar (\n\t\tappG = app.Gin{C: c}\n\t\tform = EditArticleForm{ID: com.StrTo(c.Param(\"id\")).MustInt()}\n\t)\n\n\thttpCode, errCode := app.BindAndValid(c, &form)\n\tif errCode != e.SUCCESS {\n\t\tappG.Response(httpCode, errCode, nil)\n\t\treturn\n\t}\n\n\tarticleService := article_service.Article{\n\t\tID: form.ID,\n\t\tTagID: form.TagID,\n\t\tTitle: form.Title,\n\t\tDesc: form.Desc,\n\t\tContent: form.Content,\n\t\tCoverImageUrl: form.CoverImageUrl,\n\t\tModifiedBy: form.ModifiedBy,\n\t\tState: form.State,\n\t}\n\texists, err := articleService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_CHECK_EXIST_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_ARTICLE, nil)\n\t\treturn\n\t}\n\n\ttagService := tag_service.Tag{ID: form.TagID}\n\texists, err = tagService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXIST_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_TAG, nil)\n\t\treturn\n\t}\n\n\terr = articleService.Edit()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EDIT_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\n// @Summary Delete article\n// @Produce json\n// @Param id path int true \"ID\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/articles/{id} [delete]\nfunc DeleteArticle(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tvalid := validation.Validation{}\n\tid := com.StrTo(c.Param(\"id\")).MustInt()\n\tvalid.Min(id, 1, \"id\").Message(\"ID必须大于0\")\n\n\tif valid.HasErrors() {\n\t\tapp.MarkErrors(valid.Errors)\n\t\tappG.Response(http.StatusOK, e.INVALID_PARAMS, nil)\n\t\treturn\n\t}\n\n\tarticleService := article_service.Article{ID: id}\n\texists, err := articleService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_CHECK_EXIST_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_ARTICLE, nil)\n\t\treturn\n\t}\n\n\terr = articleService.Delete()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_DELETE_ARTICLE_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\nconst (\n\tQRCODE_URL = \"https://github.com/EDDYCJY/blog#gin%E7%B3%BB%E5%88%97%E7%9B%AE%E5%BD%95\"\n)\n\nfunc GenerateArticlePoster(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tarticle := &article_service.Article{}\n\tqr := qrcode.NewQrCode(QRCODE_URL, 300, 300, qr.M, qr.Auto)\n\tposterName := article_service.GetPosterFlag() + \"-\" + qrcode.GetQrCodeFileName(qr.URL) + qr.GetQrCodeExt()\n\tarticlePoster := article_service.NewArticlePoster(posterName, article, qr)\n\tarticlePosterBgService := article_service.NewArticlePosterBg(\n\t\t\"bg.jpg\",\n\t\tarticlePoster,\n\t\t&article_service.Rect{\n\t\t\tX0: 0,\n\t\t\tY0: 0,\n\t\t\tX1: 550,\n\t\t\tY1: 700,\n\t\t},\n\t\t&article_service.Pt{\n\t\t\tX: 125,\n\t\t\tY: 298,\n\t\t},\n\t)\n\n\t_, filePath, err := articlePosterBgService.Generate()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_GEN_ARTICLE_POSTER_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, map[string]string{\n\t\t\"poster_url\": qrcode.GetQrCodeFullUrl(posterName),\n\t\t\"poster_save_url\": filePath + posterName,\n\t})\n}\n" }, { "path": "routers/api/v1/tag.go", "content": "package v1\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/unknwon/com\"\n\t\"github.com/astaxie/beego/validation\"\n\t\"github.com/gin-gonic/gin\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/app\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/export\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/util\"\n\t\"github.com/EDDYCJY/go-gin-example/service/tag_service\"\n)\n\n// @Summary Get multiple article tags\n// @Produce json\n// @Param name query string false \"Name\"\n// @Param state query int false \"State\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags [get]\nfunc GetTags(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tname := c.Query(\"name\")\n\tstate := -1\n\tif arg := c.Query(\"state\"); arg != \"\" {\n\t\tstate = com.StrTo(arg).MustInt()\n\t}\n\n\ttagService := tag_service.Tag{\n\t\tName: name,\n\t\tState: state,\n\t\tPageNum: util.GetPage(c),\n\t\tPageSize: setting.AppSetting.PageSize,\n\t}\n\ttags, err := tagService.GetAll()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_GET_TAGS_FAIL, nil)\n\t\treturn\n\t}\n\n\tcount, err := tagService.Count()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_COUNT_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, map[string]interface{}{\n\t\t\"lists\": tags,\n\t\t\"total\": count,\n\t})\n}\n\ntype AddTagForm struct {\n\tName string `form:\"name\" valid:\"Required;MaxSize(100)\"`\n\tCreatedBy string `form:\"created_by\" valid:\"Required;MaxSize(100)\"`\n\tState int `form:\"state\" valid:\"Range(0,1)\"`\n}\n\n// @Summary Add article tag\n// @Produce json\n// @Param name body string true \"Name\"\n// @Param state body int false \"State\"\n// @Param created_by body int false \"CreatedBy\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags [post]\nfunc AddTag(c *gin.Context) {\n\tvar (\n\t\tappG = app.Gin{C: c}\n\t\tform AddTagForm\n\t)\n\n\thttpCode, errCode := app.BindAndValid(c, &form)\n\tif errCode != e.SUCCESS {\n\t\tappG.Response(httpCode, errCode, nil)\n\t\treturn\n\t}\n\n\ttagService := tag_service.Tag{\n\t\tName: form.Name,\n\t\tCreatedBy: form.CreatedBy,\n\t\tState: form.State,\n\t}\n\texists, err := tagService.ExistByName()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXIST_TAG_FAIL, nil)\n\t\treturn\n\t}\n\tif exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_EXIST_TAG, nil)\n\t\treturn\n\t}\n\n\terr = tagService.Add()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_ADD_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\ntype EditTagForm struct {\n\tID int `form:\"id\" valid:\"Required;Min(1)\"`\n\tName string `form:\"name\" valid:\"Required;MaxSize(100)\"`\n\tModifiedBy string `form:\"modified_by\" valid:\"Required;MaxSize(100)\"`\n\tState int `form:\"state\" valid:\"Range(0,1)\"`\n}\n\n// @Summary Update article tag\n// @Produce json\n// @Param id path int true \"ID\"\n// @Param name body string true \"Name\"\n// @Param state body int false \"State\"\n// @Param modified_by body string true \"ModifiedBy\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags/{id} [put]\nfunc EditTag(c *gin.Context) {\n\tvar (\n\t\tappG = app.Gin{C: c}\n\t\tform = EditTagForm{ID: com.StrTo(c.Param(\"id\")).MustInt()}\n\t)\n\n\thttpCode, errCode := app.BindAndValid(c, &form)\n\tif errCode != e.SUCCESS {\n\t\tappG.Response(httpCode, errCode, nil)\n\t\treturn\n\t}\n\n\ttagService := tag_service.Tag{\n\t\tID: form.ID,\n\t\tName: form.Name,\n\t\tModifiedBy: form.ModifiedBy,\n\t\tState: form.State,\n\t}\n\n\texists, err := tagService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXIST_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_TAG, nil)\n\t\treturn\n\t}\n\n\terr = tagService.Edit()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EDIT_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\n// @Summary Delete article tag\n// @Produce json\n// @Param id path int true \"ID\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags/{id} [delete]\nfunc DeleteTag(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tvalid := validation.Validation{}\n\tid := com.StrTo(c.Param(\"id\")).MustInt()\n\tvalid.Min(id, 1, \"id\").Message(\"ID必须大于0\")\n\n\tif valid.HasErrors() {\n\t\tapp.MarkErrors(valid.Errors)\n\t\tappG.Response(http.StatusBadRequest, e.INVALID_PARAMS, nil)\n\t}\n\n\ttagService := tag_service.Tag{ID: id}\n\texists, err := tagService.ExistByID()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXIST_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tif !exists {\n\t\tappG.Response(http.StatusOK, e.ERROR_NOT_EXIST_TAG, nil)\n\t\treturn\n\t}\n\n\tif err := tagService.Delete(); err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_DELETE_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n\n// @Summary Export article tag\n// @Produce json\n// @Param name body string false \"Name\"\n// @Param state body int false \"State\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags/export [post]\nfunc ExportTag(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\tname := c.PostForm(\"name\")\n\tstate := -1\n\tif arg := c.PostForm(\"state\"); arg != \"\" {\n\t\tstate = com.StrTo(arg).MustInt()\n\t}\n\n\ttagService := tag_service.Tag{\n\t\tName: name,\n\t\tState: state,\n\t}\n\n\tfilename, err := tagService.Export()\n\tif err != nil {\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_EXPORT_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, map[string]string{\n\t\t\"export_url\": export.GetExcelFullUrl(filename),\n\t\t\"export_save_url\": export.GetExcelPath() + filename,\n\t})\n}\n\n// @Summary Import article tag\n// @Produce json\n// @Param file body file true \"Excel File\"\n// @Success 200 {object} app.Response\n// @Failure 500 {object} app.Response\n// @Router /api/v1/tags/import [post]\nfunc ImportTag(c *gin.Context) {\n\tappG := app.Gin{C: c}\n\n\tfile, _, err := c.Request.FormFile(\"file\")\n\tif err != nil {\n\t\tlogging.Warn(err)\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR, nil)\n\t\treturn\n\t}\n\n\ttagService := tag_service.Tag{}\n\terr = tagService.Import(file)\n\tif err != nil {\n\t\tlogging.Warn(err)\n\t\tappG.Response(http.StatusInternalServerError, e.ERROR_IMPORT_TAG_FAIL, nil)\n\t\treturn\n\t}\n\n\tappG.Response(http.StatusOK, e.SUCCESS, nil)\n}\n" }, { "path": "routers/router.go", "content": "package routers\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin\"\n\n\t_ \"github.com/EDDYCJY/go-gin-example/docs\"\n\t\"github.com/swaggo/gin-swagger\"\n\t\"github.com/swaggo/gin-swagger/swaggerFiles\"\n\n\t\"github.com/EDDYCJY/go-gin-example/middleware/jwt\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/export\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/qrcode\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/upload\"\n\t\"github.com/EDDYCJY/go-gin-example/routers/api\"\n\t\"github.com/EDDYCJY/go-gin-example/routers/api/v1\"\n)\n\n// InitRouter initialize routing information\nfunc InitRouter() *gin.Engine {\n\tr := gin.New()\n\tr.Use(gin.Logger())\n\tr.Use(gin.Recovery())\n\n\tr.StaticFS(\"/export\", http.Dir(export.GetExcelFullPath()))\n\tr.StaticFS(\"/upload/images\", http.Dir(upload.GetImageFullPath()))\n\tr.StaticFS(\"/qrcode\", http.Dir(qrcode.GetQrCodeFullPath()))\n\n\tr.POST(\"/auth\", api.GetAuth)\n\tr.GET(\"/swagger/*any\", ginSwagger.WrapHandler(swaggerFiles.Handler))\n\tr.POST(\"/upload\", api.UploadImage)\n\n\tapiv1 := r.Group(\"/api/v1\")\n\tapiv1.Use(jwt.JWT())\n\t{\n\t\t//获取标签列表\n\t\tapiv1.GET(\"/tags\", v1.GetTags)\n\t\t//新建标签\n\t\tapiv1.POST(\"/tags\", v1.AddTag)\n\t\t//更新指定标签\n\t\tapiv1.PUT(\"/tags/:id\", v1.EditTag)\n\t\t//删除指定标签\n\t\tapiv1.DELETE(\"/tags/:id\", v1.DeleteTag)\n\t\t//导出标签\n\t\tr.POST(\"/tags/export\", v1.ExportTag)\n\t\t//导入标签\n\t\tr.POST(\"/tags/import\", v1.ImportTag)\n\n\t\t//获取文章列表\n\t\tapiv1.GET(\"/articles\", v1.GetArticles)\n\t\t//获取指定文章\n\t\tapiv1.GET(\"/articles/:id\", v1.GetArticle)\n\t\t//新建文章\n\t\tapiv1.POST(\"/articles\", v1.AddArticle)\n\t\t//更新指定文章\n\t\tapiv1.PUT(\"/articles/:id\", v1.EditArticle)\n\t\t//删除指定文章\n\t\tapiv1.DELETE(\"/articles/:id\", v1.DeleteArticle)\n\t\t//生成文章海报\n\t\tapiv1.POST(\"/articles/poster/generate\", v1.GenerateArticlePoster)\n\t}\n\n\treturn r\n}\n" }, { "path": "service/article_service/article.go", "content": "package article_service\n\nimport (\n\t\"encoding/json\"\n\n\t\"github.com/EDDYCJY/go-gin-example/models\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/gredis\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/service/cache_service\"\n)\n\ntype Article struct {\n\tID int\n\tTagID int\n\tTitle string\n\tDesc string\n\tContent string\n\tCoverImageUrl string\n\tState int\n\tCreatedBy string\n\tModifiedBy string\n\n\tPageNum int\n\tPageSize int\n}\n\nfunc (a *Article) Add() error {\n\tarticle := map[string]interface{}{\n\t\t\"tag_id\": a.TagID,\n\t\t\"title\": a.Title,\n\t\t\"desc\": a.Desc,\n\t\t\"content\": a.Content,\n\t\t\"created_by\": a.CreatedBy,\n\t\t\"cover_image_url\": a.CoverImageUrl,\n\t\t\"state\": a.State,\n\t}\n\n\tif err := models.AddArticle(article); err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\nfunc (a *Article) Edit() error {\n\treturn models.EditArticle(a.ID, map[string]interface{}{\n\t\t\"tag_id\": a.TagID,\n\t\t\"title\": a.Title,\n\t\t\"desc\": a.Desc,\n\t\t\"content\": a.Content,\n\t\t\"cover_image_url\": a.CoverImageUrl,\n\t\t\"state\": a.State,\n\t\t\"modified_by\": a.ModifiedBy,\n\t})\n}\n\nfunc (a *Article) Get() (*models.Article, error) {\n\tvar cacheArticle *models.Article\n\n\tcache := cache_service.Article{ID: a.ID}\n\tkey := cache.GetArticleKey()\n\tif gredis.Exists(key) {\n\t\tdata, err := gredis.Get(key)\n\t\tif err != nil {\n\t\t\tlogging.Info(err)\n\t\t} else {\n\t\t\tjson.Unmarshal(data, &cacheArticle)\n\t\t\treturn cacheArticle, nil\n\t\t}\n\t}\n\n\tarticle, err := models.GetArticle(a.ID)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tgredis.Set(key, article, 3600)\n\treturn article, nil\n}\n\nfunc (a *Article) GetAll() ([]*models.Article, error) {\n\tvar (\n\t\tarticles, cacheArticles []*models.Article\n\t)\n\n\tcache := cache_service.Article{\n\t\tTagID: a.TagID,\n\t\tState: a.State,\n\n\t\tPageNum: a.PageNum,\n\t\tPageSize: a.PageSize,\n\t}\n\tkey := cache.GetArticlesKey()\n\tif gredis.Exists(key) {\n\t\tdata, err := gredis.Get(key)\n\t\tif err != nil {\n\t\t\tlogging.Info(err)\n\t\t} else {\n\t\t\tjson.Unmarshal(data, &cacheArticles)\n\t\t\treturn cacheArticles, nil\n\t\t}\n\t}\n\n\tarticles, err := models.GetArticles(a.PageNum, a.PageSize, a.getMaps())\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tgredis.Set(key, articles, 3600)\n\treturn articles, nil\n}\n\nfunc (a *Article) Delete() error {\n\treturn models.DeleteArticle(a.ID)\n}\n\nfunc (a *Article) ExistByID() (bool, error) {\n\treturn models.ExistArticleByID(a.ID)\n}\n\nfunc (a *Article) Count() (int, error) {\n\treturn models.GetArticleTotal(a.getMaps())\n}\n\nfunc (a *Article) getMaps() map[string]interface{} {\n\tmaps := make(map[string]interface{})\n\tmaps[\"deleted_on\"] = 0\n\tif a.State != -1 {\n\t\tmaps[\"state\"] = a.State\n\t}\n\tif a.TagID != -1 {\n\t\tmaps[\"tag_id\"] = a.TagID\n\t}\n\n\treturn maps\n}\n" }, { "path": "service/article_service/article_poster.go", "content": "package article_service\n\nimport (\n\t\"image\"\n\t\"image/draw\"\n\t\"image/jpeg\"\n\t\"io/ioutil\"\n\t\"os\"\n\n\t\"github.com/golang/freetype\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/file\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/qrcode\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/setting\"\n)\n\ntype ArticlePoster struct {\n\tPosterName string\n\t*Article\n\tQr *qrcode.QrCode\n}\n\nfunc NewArticlePoster(posterName string, article *Article, qr *qrcode.QrCode) *ArticlePoster {\n\treturn &ArticlePoster{\n\t\tPosterName: posterName,\n\t\tArticle: article,\n\t\tQr: qr,\n\t}\n}\n\nfunc GetPosterFlag() string {\n\treturn \"poster\"\n}\n\nfunc (a *ArticlePoster) CheckMergedImage(path string) bool {\n\tif file.CheckNotExist(path+a.PosterName) == true {\n\t\treturn false\n\t}\n\n\treturn true\n}\n\nfunc (a *ArticlePoster) OpenMergedImage(path string) (*os.File, error) {\n\tf, err := file.MustOpen(a.PosterName, path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn f, nil\n}\n\ntype ArticlePosterBg struct {\n\tName string\n\t*ArticlePoster\n\t*Rect\n\t*Pt\n}\n\ntype Rect struct {\n\tName string\n\tX0 int\n\tY0 int\n\tX1 int\n\tY1 int\n}\n\ntype Pt struct {\n\tX int\n\tY int\n}\n\nfunc NewArticlePosterBg(name string, ap *ArticlePoster, rect *Rect, pt *Pt) *ArticlePosterBg {\n\treturn &ArticlePosterBg{\n\t\tName: name,\n\t\tArticlePoster: ap,\n\t\tRect: rect,\n\t\tPt: pt,\n\t}\n}\n\ntype DrawText struct {\n\tJPG draw.Image\n\tMerged *os.File\n\n\tTitle string\n\tX0 int\n\tY0 int\n\tSize0 float64\n\n\tSubTitle string\n\tX1 int\n\tY1 int\n\tSize1 float64\n}\n\nfunc (a *ArticlePosterBg) DrawPoster(d *DrawText, fontName string) error {\n\tfontSource := setting.AppSetting.RuntimeRootPath + setting.AppSetting.FontSavePath + fontName\n\tfontSourceBytes, err := ioutil.ReadFile(fontSource)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\ttrueTypeFont, err := freetype.ParseFont(fontSourceBytes)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfc := freetype.NewContext()\n\tfc.SetDPI(72)\n\tfc.SetFont(trueTypeFont)\n\tfc.SetFontSize(d.Size0)\n\tfc.SetClip(d.JPG.Bounds())\n\tfc.SetDst(d.JPG)\n\tfc.SetSrc(image.Black)\n\n\tpt := freetype.Pt(d.X0, d.Y0)\n\t_, err = fc.DrawString(d.Title, pt)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfc.SetFontSize(d.Size1)\n\t_, err = fc.DrawString(d.SubTitle, freetype.Pt(d.X1, d.Y1))\n\tif err != nil {\n\t\treturn err\n\t}\n\n\terr = jpeg.Encode(d.Merged, d.JPG, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\nfunc (a *ArticlePosterBg) Generate() (string, string, error) {\n\tfullPath := qrcode.GetQrCodeFullPath()\n\tfileName, path, err := a.Qr.Encode(fullPath)\n\tif err != nil {\n\t\treturn \"\", \"\", err\n\t}\n\n\tif !a.CheckMergedImage(path) {\n\t\tmergedF, err := a.OpenMergedImage(path)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t\tdefer mergedF.Close()\n\n\t\tbgF, err := file.MustOpen(a.Name, path)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t\tdefer bgF.Close()\n\n\t\tqrF, err := file.MustOpen(fileName, path)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t\tdefer qrF.Close()\n\n\t\tbgImage, err := jpeg.Decode(bgF)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t\tqrImage, err := jpeg.Decode(qrF)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\tjpg := image.NewRGBA(image.Rect(a.Rect.X0, a.Rect.Y0, a.Rect.X1, a.Rect.Y1))\n\n\t\tdraw.Draw(jpg, jpg.Bounds(), bgImage, bgImage.Bounds().Min, draw.Over)\n\t\tdraw.Draw(jpg, jpg.Bounds(), qrImage, qrImage.Bounds().Min.Sub(image.Pt(a.Pt.X, a.Pt.Y)), draw.Over)\n\n\t\terr = a.DrawPoster(&DrawText{\n\t\t\tJPG: jpg,\n\t\t\tMerged: mergedF,\n\n\t\t\tTitle: \"Golang Gin 系列文章\",\n\t\t\tX0: 80,\n\t\t\tY0: 160,\n\t\t\tSize0: 42,\n\n\t\t\tSubTitle: \"---煎鱼\",\n\t\t\tX1: 320,\n\t\t\tY1: 220,\n\t\t\tSize1: 36,\n\t\t}, \"msyhbd.ttc\")\n\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\t}\n\n\treturn fileName, path, nil\n}\n" }, { "path": "service/auth_service/auth.go", "content": "package auth_service\n\nimport \"github.com/EDDYCJY/go-gin-example/models\"\n\ntype Auth struct {\n\tUsername string\n\tPassword string\n}\n\nfunc (a *Auth) Check() (bool, error) {\n\treturn models.CheckAuth(a.Username, a.Password)\n}\n" }, { "path": "service/cache_service/article.go", "content": "package cache_service\n\nimport (\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n)\n\ntype Article struct {\n\tID int\n\tTagID int\n\tState int\n\n\tPageNum int\n\tPageSize int\n}\n\nfunc (a *Article) GetArticleKey() string {\n\treturn e.CACHE_ARTICLE + \"_\" + strconv.Itoa(a.ID)\n}\n\nfunc (a *Article) GetArticlesKey() string {\n\tkeys := []string{\n\t\te.CACHE_ARTICLE,\n\t\t\"LIST\",\n\t}\n\n\tif a.ID > 0 {\n\t\tkeys = append(keys, strconv.Itoa(a.ID))\n\t}\n\tif a.TagID > 0 {\n\t\tkeys = append(keys, strconv.Itoa(a.TagID))\n\t}\n\tif a.State >= 0 {\n\t\tkeys = append(keys, strconv.Itoa(a.State))\n\t}\n\tif a.PageNum > 0 {\n\t\tkeys = append(keys, strconv.Itoa(a.PageNum))\n\t}\n\tif a.PageSize > 0 {\n\t\tkeys = append(keys, strconv.Itoa(a.PageSize))\n\t}\n\n\treturn strings.Join(keys, \"_\")\n}\n" }, { "path": "service/cache_service/tag.go", "content": "package cache_service\n\nimport (\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/EDDYCJY/go-gin-example/pkg/e\"\n)\n\ntype Tag struct {\n\tID int\n\tName string\n\tState int\n\n\tPageNum int\n\tPageSize int\n}\n\nfunc (t *Tag) GetTagsKey() string {\n\tkeys := []string{\n\t\te.CACHE_TAG,\n\t\t\"LIST\",\n\t}\n\n\tif t.Name != \"\" {\n\t\tkeys = append(keys, t.Name)\n\t}\n\tif t.State >= 0 {\n\t\tkeys = append(keys, strconv.Itoa(t.State))\n\t}\n\tif t.PageNum > 0 {\n\t\tkeys = append(keys, strconv.Itoa(t.PageNum))\n\t}\n\tif t.PageSize > 0 {\n\t\tkeys = append(keys, strconv.Itoa(t.PageSize))\n\t}\n\n\treturn strings.Join(keys, \"_\")\n}\n" }, { "path": "service/tag_service/tag.go", "content": "package tag_service\n\nimport (\n\t\"encoding/json\"\n\t\"io\"\n\t\"strconv\"\n\t\"time\"\n\n\t\"github.com/360EntSecGroup-Skylar/excelize\"\n\t\"github.com/tealeg/xlsx\"\n\n\t\"github.com/EDDYCJY/go-gin-example/models\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/export\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/file\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/gredis\"\n\t\"github.com/EDDYCJY/go-gin-example/pkg/logging\"\n\t\"github.com/EDDYCJY/go-gin-example/service/cache_service\"\n)\n\ntype Tag struct {\n\tID int\n\tName string\n\tCreatedBy string\n\tModifiedBy string\n\tState int\n\n\tPageNum int\n\tPageSize int\n}\n\nfunc (t *Tag) ExistByName() (bool, error) {\n\treturn models.ExistTagByName(t.Name)\n}\n\nfunc (t *Tag) ExistByID() (bool, error) {\n\treturn models.ExistTagByID(t.ID)\n}\n\nfunc (t *Tag) Add() error {\n\treturn models.AddTag(t.Name, t.State, t.CreatedBy)\n}\n\nfunc (t *Tag) Edit() error {\n\tdata := make(map[string]interface{})\n\tdata[\"modified_by\"] = t.ModifiedBy\n\tdata[\"name\"] = t.Name\n\tif t.State >= 0 {\n\t\tdata[\"state\"] = t.State\n\t}\n\n\treturn models.EditTag(t.ID, data)\n}\n\nfunc (t *Tag) Delete() error {\n\treturn models.DeleteTag(t.ID)\n}\n\nfunc (t *Tag) Count() (int, error) {\n\treturn models.GetTagTotal(t.getMaps())\n}\n\nfunc (t *Tag) GetAll() ([]models.Tag, error) {\n\tvar (\n\t\ttags, cacheTags []models.Tag\n\t)\n\n\tcache := cache_service.Tag{\n\t\tState: t.State,\n\n\t\tPageNum: t.PageNum,\n\t\tPageSize: t.PageSize,\n\t}\n\tkey := cache.GetTagsKey()\n\tif gredis.Exists(key) {\n\t\tdata, err := gredis.Get(key)\n\t\tif err != nil {\n\t\t\tlogging.Info(err)\n\t\t} else {\n\t\t\tjson.Unmarshal(data, &cacheTags)\n\t\t\treturn cacheTags, nil\n\t\t}\n\t}\n\n\ttags, err := models.GetTags(t.PageNum, t.PageSize, t.getMaps())\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tgredis.Set(key, tags, 3600)\n\treturn tags, nil\n}\n\nfunc (t *Tag) Export() (string, error) {\n\ttags, err := t.GetAll()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\txlsFile := xlsx.NewFile()\n\tsheet, err := xlsFile.AddSheet(\"标签信息\")\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\ttitles := []string{\"ID\", \"名称\", \"创建人\", \"创建时间\", \"修改人\", \"修改时间\"}\n\trow := sheet.AddRow()\n\n\tvar cell *xlsx.Cell\n\tfor _, title := range titles {\n\t\tcell = row.AddCell()\n\t\tcell.Value = title\n\t}\n\n\tfor _, v := range tags {\n\t\tvalues := []string{\n\t\t\tstrconv.Itoa(v.ID),\n\t\t\tv.Name,\n\t\t\tv.CreatedBy,\n\t\t\tstrconv.Itoa(v.CreatedOn),\n\t\t\tv.ModifiedBy,\n\t\t\tstrconv.Itoa(v.ModifiedOn),\n\t\t}\n\n\t\trow = sheet.AddRow()\n\t\tfor _, value := range values {\n\t\t\tcell = row.AddCell()\n\t\t\tcell.Value = value\n\t\t}\n\t}\n\n\ttime := strconv.Itoa(int(time.Now().Unix()))\n\tfilename := \"tags-\" + time + export.EXT\n\n\tdirFullPath := export.GetExcelFullPath()\n\terr = file.IsNotExistMkDir(dirFullPath)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\terr = xlsFile.Save(dirFullPath + filename)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\treturn filename, nil\n}\n\nfunc (t *Tag) Import(r io.Reader) error {\n\txlsx, err := excelize.OpenReader(r)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\trows := xlsx.GetRows(\"标签信息\")\n\tfor irow, row := range rows {\n\t\tif irow > 0 {\n\t\t\tvar data []string\n\t\t\tfor _, cell := range row {\n\t\t\t\tdata = append(data, cell)\n\t\t\t}\n\n\t\t\tmodels.AddTag(data[1], 1, data[2])\n\t\t}\n\t}\n\n\treturn nil\n}\n\nfunc (t *Tag) getMaps() map[string]interface{} {\n\tmaps := make(map[string]interface{})\n\tmaps[\"deleted_on\"] = 0\n\n\tif t.Name != \"\" {\n\t\tmaps[\"name\"] = t.Name\n\t}\n\tif t.State >= 0 {\n\t\tmaps[\"state\"] = t.State\n\t}\n\n\treturn maps\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/.travis.yml", "content": "language: go\n\ninstall:\n - go get -d -t -v ./... && go build -v ./...\n\ngo:\n - 1.8.x\n - 1.9.x\n\nscript:\n - go vet ./...\n - go test ./... -v -coverprofile=coverage.txt -covermode=atomic\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment include:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or advances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at [xuri.me](https://xuri.me). The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/CONTRIBUTING.md", "content": "# Contributing to excelize\n\nWant to hack on excelize? Awesome! This page contains information about reporting issues as well as some tips and\nguidelines useful to experienced open source contributors. Finally, make sure\nyou read our [community guidelines](#community-guidelines) before you\nstart participating.\n\n## Topics\n\n* [Reporting Security Issues](#reporting-security-issues)\n* [Design and Cleanup Proposals](#design-and-cleanup-proposals)\n* [Reporting Issues](#reporting-other-issues)\n* [Quick Contribution Tips and Guidelines](#quick-contribution-tips-and-guidelines)\n* [Community Guidelines](#community-guidelines)\n\n## Reporting security issues\n\nThe excelize maintainers take security seriously. If you discover a security\nissue, please bring it to their attention right away!\n\nPlease **DO NOT** file a public issue, instead send your report privately to\n[xuri.me](https://xuri.me).\n\nSecurity reports are greatly appreciated and we will publicly thank you for it.\nWe currently do not offer a paid security bounty program, but are not\nruling it out in the future.\n\n## Reporting other issues\n\nA great way to contribute to the project is to send a detailed report when you\nencounter an issue. We always appreciate a well-written, thorough bug report,\nand will thank you for it!\n\nCheck that [our issue database](https://github.com/360EntSecGroup-Skylar/excelize/issues)\ndoesn't already include that problem or suggestion before submitting an issue.\nIf you find a match, you can use the \"subscribe\" button to get notified on\nupdates. Do *not* leave random \"+1\" or \"I have this too\" comments, as they\nonly clutter the discussion, and don't help resolving it. However, if you\nhave ways to reproduce the issue or have additional information that may help\nresolving the issue, please leave a comment.\n\nWhen reporting issues, always include the output of `go env`.\n\nAlso include the steps required to reproduce the problem if possible and\napplicable. This information will help us review and fix your issue faster.\nWhen sending lengthy log-files, consider posting them as a gist [https://gist.github.com](https://gist.github.com).\nDon't forget to remove sensitive data from your logfiles before posting (you can\nreplace those parts with \"REDACTED\").\n\n## Quick contribution tips and guidelines\n\nThis section gives the experienced contributor some tips and guidelines.\n\n### Pull requests are always welcome\n\nNot sure if that typo is worth a pull request? Found a bug and know how to fix\nit? Do it! We will appreciate it. Any significant improvement should be\ndocumented as [a GitHub issue](https://github.com/360EntSecGroup-Skylar/excelize/issues) before\nanybody starts working on it.\n\nWe are always thrilled to receive pull requests. We do our best to process them\nquickly. If your pull request is not accepted on the first try,\ndon't get discouraged!\n\n### Design and cleanup proposals\n\nYou can propose new designs for existing excelize features. You can also design\nentirely new features. We really appreciate contributors who want to refactor or\notherwise cleanup our project.\n\nWe try hard to keep excelize lean and focused. Excelize can't do everything for\neverybody. This means that we might decide against incorporating a new feature.\nHowever, there might be a way to implement that feature *on top of* excelize.\n\n### Conventions\n\nFork the repository and make changes on your fork in a feature branch:\n\n* If it's a bug fix branch, name it XXXX-something where XXXX is the number of\n the issue.\n* If it's a feature branch, create an enhancement issue to announce\n your intentions, and name it XXXX-something where XXXX is the number of the\n issue.\n\nSubmit unit tests for your changes. Go has a great test framework built in; use\nit! Take a look at existing tests for inspiration. Run the full test on your branch before\nsubmitting a pull request.\n\nUpdate the documentation when creating or modifying features. Test your\ndocumentation changes for clarity, concision, and correctness, as well as a\nclean documentation build.\n\nWrite clean code. Universally formatted code promotes ease of writing, reading,\nand maintenance. Always run `gofmt -s -w file.go` on each changed file before\ncommitting your changes. Most editors have plug-ins that do this automatically.\n\nPull request descriptions should be as clear as possible and include a reference\nto all the issues that they address.\n\n### Successful Changes\n\nBefore contributing large or high impact changes, make the effort to coordinate\nwith the maintainers of the project before submitting a pull request. This\nprevents you from doing extra work that may or may not be merged.\n\nLarge PRs that are just submitted without any prior communication are unlikely\nto be successful.\n\nWhile pull requests are the methodology for submitting changes to code, changes\nare much more likely to be accepted if they are accompanied by additional\nengineering work. While we don't define this explicitly, most of these goals\nare accomplished through communication of the design goals and subsequent\nsolutions. Often times, it helps to first state the problem before presenting\nsolutions.\n\nTypically, the best methods of accomplishing this are to submit an issue,\nstating the problem. This issue can include a problem statement and a\nchecklist with requirements. If solutions are proposed, alternatives should be\nlisted and eliminated. Even if the criteria for elimination of a solution is\nfrivolous, say so.\n\nLarger changes typically work best with design documents. These are focused on\nproviding context to the design at the time the feature was conceived and can\ninform future documentation contributions.\n\n### Commit Messages\n\nCommit messages must start with a capitalized and short summary\nwritten in the imperative, followed by an optional, more detailed explanatory\ntext which is separated from the summary by an empty line.\n\nCommit messages should follow best practices, including explaining the context\nof the problem and how it was solved, including in caveats or follow up changes\nrequired. They should tell the story of the change and provide readers\nunderstanding of what led to it.\n\nIn practice, the best approach to maintaining a nice commit message is to\nleverage a `git add -p` and `git commit --amend` to formulate a solid\nchangeset. This allows one to piece together a change, as information becomes\navailable.\n\nIf you squash a series of commits, don't just submit that. Re-write the commit\nmessage, as if the series of commits was a single stroke of brilliance.\n\nThat said, there is no requirement to have a single commit for a PR, as long as\neach commit tells the story. For example, if there is a feature that requires a\npackage, it might make sense to have the package in a separate commit then have\na subsequent commit that uses it.\n\nRemember, you're telling part of the story with the commit message. Don't make\nyour chapter weird.\n\n### Review\n\nCode review comments may be added to your pull request. Discuss, then make the\nsuggested modifications and push additional commits to your feature branch. Post\na comment after pushing. New commits show up in the pull request automatically,\nbut the reviewers are notified only when you comment.\n\nPull requests must be cleanly rebased on top of master without multiple branches\nmixed into the PR.\n\n**Git tip**: If your PR no longer merges cleanly, use `rebase master` in your\nfeature branch to update your pull request rather than `merge master`.\n\nBefore you make a pull request, squash your commits into logical units of work\nusing `git rebase -i` and `git push -f`. A logical unit of work is a consistent\nset of patches that should be reviewed together: for example, upgrading the\nversion of a vendored dependency and taking advantage of its now available new\nfeature constitute two separate units of work. Implementing a new function and\ncalling it in another file constitute a single logical unit of work. The very\nhigh majority of submissions should have a single commit, so if in doubt: squash\ndown to one.\n\nAfter every commit, make sure the test passes. Include documentation\nchanges in the same pull request so that a revert would remove all traces of\nthe feature or fix.\n\nInclude an issue reference like `Closes #XXXX` or `Fixes #XXXX` in commits that\nclose an issue. Including references automatically closes the issue on a merge.\n\nPlease see the [Coding Style](#coding-style) for further guidelines.\n\n### Merge approval\n\nThe excelize maintainers use LGTM (Looks Good To Me) in comments on the code review to\nindicate acceptance.\n\n### Sign your work\n\nThe sign-off is a simple line at the end of the explanation for the patch. Your\nsignature certifies that you wrote the patch or otherwise have the right to pass\nit on as an open-source patch. The rules are pretty simple: if you can certify\nthe below (from [developercertificate.org](http://developercertificate.org/)):\n\n```text\nDeveloper Certificate of Origin\nVersion 1.1\n\nCopyright (C) 2004, 2006 The Linux Foundation and its contributors.\n1 Letterman Drive\nSuite D4700\nSan Francisco, CA, 94129\n\nEveryone is permitted to copy and distribute verbatim copies of this\nlicense document, but changing it is not allowed.\n\nDeveloper's Certificate of Origin 1.1\n\nBy making a contribution to this project, I certify that:\n\n(a) The contribution was created in whole or in part by me and I\n have the right to submit it under the open source license\n indicated in the file; or\n\n(b) The contribution is based upon previous work that, to the best\n of my knowledge, is covered under an appropriate open source\n license and I have the right under that license to submit that\n work with modifications, whether created in whole or in part\n by me, under the same open source license (unless I am\n permitted to submit under a different license), as indicated\n in the file; or\n\n(c) The contribution was provided directly to me by some other\n person who certified (a), (b) or (c) and I have not modified\n it.\n\n(d) I understand and agree that this project and the contribution\n are public and that a record of the contribution (including all\n personal information I submit with it, including my sign-off) is\n maintained indefinitely and may be redistributed consistent with\n this project or the open source license(s) involved.\n```\n\nThen you just add a line to every git commit message:\n\n Signed-off-by: Ri Xu https://xuri.me\n\nUse your real name (sorry, no pseudonyms or anonymous contributions.)\n\nIf you set your `user.name` and `user.email` git configs, you can sign your\ncommit automatically with `git commit -s`.\n\n### How can I become a maintainer\n\nFirst, all maintainers have 3 things\n\n* They share responsibility in the project's success.\n* They have made a long-term, recurring time investment to improve the project.\n* They spend that time doing whatever needs to be done, not necessarily what\n is the most interesting or fun.\n\nMaintainers are often under-appreciated, because their work is harder to appreciate.\nIt's easy to appreciate a really cool and technically advanced feature. It's harder\nto appreciate the absence of bugs, the slow but steady improvement in stability,\nor the reliability of a release process. But those things distinguish a good\nproject from a great one.\n\nDon't forget: being a maintainer is a time investment. Make sure you\nwill have time to make yourself available. You don't have to be a\nmaintainer to make a difference on the project!\n\nIf you want to become a meintainer, contact [xuri.me](https://xuri.me) and given a introduction of you.\n\n## Community guidelines\n\nWe want to keep the community awesome, growing and collaborative. We need\nyour help to keep it that way. To help with this we've come up with some general\nguidelines for the community as a whole:\n\n* Be nice: Be courteous, respectful and polite to fellow community members:\n no regional, racial, gender, or other abuse will be tolerated. We like\n nice people way better than mean ones!\n\n* Encourage diversity and participation: Make everyone in our community feel\n welcome, regardless of their background and the extent of their\n contributions, and do everything possible to encourage participation in\n our community.\n\n* Keep it legal: Basically, don't get us in trouble. Share only content that\n you own, do not share private or sensitive information, and don't break\n the law.\n\n* Stay on topic: Make sure that you are posting to the correct channel and\n avoid off-topic discussions. Remember when you update an issue or respond\n to an email you are potentially sending to a large number of people. Please\n consider this before you update. Also remember that nobody likes spam.\n\n* Don't send email to the maintainers: There's no need to send email to the\n maintainers to ask them to investigate an issue or to take a look at a\n pull request. Instead of sending an email, GitHub mentions should be\n used to ping maintainers to review a pull request, a proposal or an\n issue.\n\n### Guideline violations — 3 strikes method\n\nThe point of this section is not to find opportunities to punish people, but we\ndo need a fair way to deal with people who are making our community suck.\n\n1. First occurrence: We'll give you a friendly, but public reminder that the\n behavior is inappropriate according to our guidelines.\n\n2. Second occurrence: We will send you a private message with a warning that\n any additional violations will result in removal from the community.\n\n3. Third occurrence: Depending on the violation, we may need to delete or ban\n your account.\n\n**Notes:**\n\n* Obvious spammers are banned on first occurrence. If we don't do this, we'll\n have spam all over the place.\n\n* Violations are forgiven after 6 months of good behavior, and we won't hold a\n grudge.\n\n* People who commit minor infractions will get some education, rather than\n hammering them in the 3 strikes process.\n\n* The rules apply equally to everyone in the community, no matter how much\n you've contributed.\n\n* Extreme violations of a threatening, abusive, destructive or illegal nature\n will be addressed immediately and are not subject to 3 strikes or forgiveness.\n\n* Contact [xuri.me](https://xuri.me) to report abuse or appeal violations. In the case of\n appeals, we know that mistakes happen, and we'll work with you to come up with a\n fair solution if there has been a misunderstanding.\n\n## Coding Style\n\nUnless explicitly stated, we follow all coding guidelines from the Go\ncommunity. While some of these standards may seem arbitrary, they somehow seem\nto result in a solid, consistent codebase.\n\nIt is possible that the code base does not currently comply with these\nguidelines. We are not looking for a massive PR that fixes this, since that\ngoes against the spirit of the guidelines. All new contributions should make a\nbest effort to clean up and make the code base better than they left it.\nObviously, apply your best judgement. Remember, the goal here is to make the\ncode base easier for humans to navigate and understand. Always keep that in\nmind when nudging others to comply.\n\nThe rules:\n\n1. All code should be formatted with `gofmt -s`.\n2. All code should pass the default levels of\n [`golint`](https://github.com/golang/lint).\n3. All code should follow the guidelines covered in [Effective\n Go](http://golang.org/doc/effective_go.html) and [Go Code Review\n Comments](https://github.com/golang/go/wiki/CodeReviewComments).\n4. Comment the code. Tell us the why, the history and the context.\n5. Document _all_ declarations and methods, even private ones. Declare\n expectations, caveats and anything else that may be important. If a type\n gets exported, having the comments already there will ensure it's ready.\n6. Variable name length should be proportional to its context and no longer.\n `noCommaALongVariableNameLikeThisIsNotMoreClearWhenASimpleCommentWouldDo`.\n In practice, short methods will have short variable names and globals will\n have longer names.\n7. No underscores in package names. If you need a compound name, step back,\n and re-examine why you need a compound name. If you still think you need a\n compound name, lose the underscore.\n8. No utils or helpers packages. If a function is not general enough to\n warrant its own package, it has not been written generally enough to be a\n part of a util package. Just leave it unexported and well-documented.\n9. All tests should run with `go test` and outside tooling should not be\n required. No, we don't need another unit testing framework. Assertion\n packages are acceptable if they provide _real_ incremental value.\n10. Even though we call these \"rules\" above, they are actually just\n guidelines. Since you've read all the rules, you now know that.\n\nIf you are having trouble getting into the mood of idiomatic Go, we recommend\nreading through [Effective Go](https://golang.org/doc/effective_go.html). The\n[Go Blog](https://blog.golang.org) is also a great resource. Drinking the\nkool-aid is a lot easier than going thirsty.\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/LICENSE", "content": "BSD 3-Clause License\n\nCopyright (c) 2016 - 2018 360 Enterprise Security Group, Endpoint Security,\ninc. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and/or other materials provided with the distribution.\n\n* Neither the name of Excelize nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/README.md", "content": "![Excelize](./excelize.png \"Excelize\")\n\n# Excelize\n\n[![Build Status](https://travis-ci.org/360EntSecGroup-Skylar/excelize.svg?branch=master)](https://travis-ci.org/360EntSecGroup-Skylar/excelize)\n[![Code Coverage](https://codecov.io/gh/360EntSecGroup-Skylar/excelize/branch/master/graph/badge.svg)](https://codecov.io/gh/360EntSecGroup-Skylar/excelize)\n[![Go Report Card](https://goreportcard.com/badge/github.com/360EntSecGroup-Skylar/excelize)](https://goreportcard.com/report/github.com/360EntSecGroup-Skylar/excelize)\n[![GoDoc](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize?status.svg)](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize)\n[![Licenses](https://img.shields.io/badge/license-bsd-orange.svg)](https://opensource.org/licenses/BSD-3-Clause)\n[![Donate](https://img.shields.io/badge/Donate-PayPal-green.svg)](https://www.paypal.me/xuri)\n\n## Introduction\n\nExcelize is a library written in pure Go and providing a set of functions that allow you to write to and read from XLSX files. Support reads and writes XLSX file generated by Microsoft Excel™ 2007 and later. Support save file without losing original charts of XLSX. This library needs Go version 1.8 or later. The full API docs can be seen using go's built-in documentation tool, or online at [godoc.org](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize) and [Chinese translation](https://xuri.me/excelize/zh_cn).\n\n## Basic Usage\n\n### Installation\n\n```go\ngo get github.com/360EntSecGroup-Skylar/excelize\n```\n\n### Create XLSX file\n\nHere is a minimal example usage that will create XLSX file.\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx := excelize.NewFile()\n // Create a new sheet.\n index := xlsx.NewSheet(\"Sheet2\")\n // Set value of a cell.\n xlsx.SetCellValue(\"Sheet2\", \"A2\", \"Hello world.\")\n xlsx.SetCellValue(\"Sheet1\", \"B2\", 100)\n // Set active sheet of the workbook.\n xlsx.SetActiveSheet(index)\n // Save xlsx file by the given path.\n err := xlsx.SaveAs(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n }\n}\n```\n\n### Reading XLSX file\n\nThe following constitutes the bare to read a XLSX document.\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n return\n }\n // Get value from cell by given worksheet name and axis.\n cell := xlsx.GetCellValue(\"Sheet1\", \"B2\")\n fmt.Println(cell)\n // Get all the rows in the Sheet1.\n rows := xlsx.GetRows(\"Sheet1\")\n for _, row := range rows {\n for _, colCell := range row {\n fmt.Print(colCell, \"\\t\")\n }\n fmt.Println()\n }\n}\n```\n\n### Add chart to XLSX file\n\nWith Excelize chart generation and management is as easy as a few lines of code. You can build charts based off data in your worksheet or generate charts without any data in your worksheet at all.\n\n![Excelize](./test/images/chart.png \"Excelize\")\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n categories := map[string]string{\"A2\": \"Small\", \"A3\": \"Normal\", \"A4\": \"Large\", \"B1\": \"Apple\", \"C1\": \"Orange\", \"D1\": \"Pear\"}\n values := map[string]int{\"B2\": 2, \"C2\": 3, \"D2\": 3, \"B3\": 5, \"C3\": 2, \"D3\": 4, \"B4\": 6, \"C4\": 7, \"D4\": 8}\n xlsx := excelize.NewFile()\n for k, v := range categories {\n xlsx.SetCellValue(\"Sheet1\", k, v)\n }\n for k, v := range values {\n xlsx.SetCellValue(\"Sheet1\", k, v)\n }\n xlsx.AddChart(\"Sheet1\", \"E1\", `{\"type\":\"col3DClustered\",\"series\":[{\"name\":\"Sheet1!$A$2\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$2:$D$2\"},{\"name\":\"Sheet1!$A$3\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$3:$D$3\"},{\"name\":\"Sheet1!$A$4\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$4:$D$4\"}],\"title\":{\"name\":\"Fruit 3D Clustered Column Chart\"}}`)\n // Save xlsx file by the given path.\n err := xlsx.SaveAs(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n }\n}\n\n```\n\n### Add picture to XLSX file\n\n```go\npackage main\n\nimport (\n \"fmt\"\n _ \"image/gif\"\n _ \"image/jpeg\"\n _ \"image/png\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n return\n }\n // Insert a picture.\n err = xlsx.AddPicture(\"Sheet1\", \"A2\", \"./image1.png\", \"\")\n if err != nil {\n fmt.Println(err)\n }\n // Insert a picture to worksheet with scaling.\n err = xlsx.AddPicture(\"Sheet1\", \"D2\", \"./image2.jpg\", `{\"x_scale\": 0.5, \"y_scale\": 0.5}`)\n if err != nil {\n fmt.Println(err)\n }\n // Insert a picture offset in the cell with printing support.\n err = xlsx.AddPicture(\"Sheet1\", \"H2\", \"./image3.gif\", `{\"x_offset\": 15, \"y_offset\": 10, \"print_obj\": true, \"lock_aspect_ratio\": false, \"locked\": false}`)\n if err != nil {\n fmt.Println(err)\n }\n // Save the xlsx file with the origin path.\n err = xlsx.Save()\n if err != nil {\n fmt.Println(err)\n }\n}\n```\n\n## Contributing\n\nContributions are welcome! Open a pull request to fix a bug, or open an issue to discuss a new feature or change. XML is compliant with [part 1 of the 5th edition of the ECMA-376 Standard for Office Open XML](http://www.ecma-international.org/publications/standards/Ecma-376.htm).\n\n## Credits\n\nSome struct of XML originally by [tealeg/xlsx](https://github.com/tealeg/xlsx).\n\n## Licenses\n\nThis program is under the terms of the BSD 3-Clause License. See [https://opensource.org/licenses/BSD-3-Clause](https://opensource.org/licenses/BSD-3-Clause).\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/README_zh.md", "content": "![Excelize](./excelize.png \"Excelize\")\n\n# Excelize\n\n[![Build Status](https://travis-ci.org/360EntSecGroup-Skylar/excelize.svg?branch=master)](https://travis-ci.org/360EntSecGroup-Skylar/excelize)\n[![Code Coverage](https://codecov.io/gh/360EntSecGroup-Skylar/excelize/branch/master/graph/badge.svg)](https://codecov.io/gh/360EntSecGroup-Skylar/excelize)\n[![Go Report Card](https://goreportcard.com/badge/github.com/360EntSecGroup-Skylar/excelize)](https://goreportcard.com/report/github.com/360EntSecGroup-Skylar/excelize)\n[![GoDoc](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize?status.svg)](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize)\n[![Licenses](https://img.shields.io/badge/license-bsd-orange.svg)](https://opensource.org/licenses/BSD-3-Clause)\n[![Donate](https://img.shields.io/badge/Donate-PayPal-green.svg)](https://www.paypal.me/xuri)\n\n## 简介\n\nExcelize 是 Go 语言编写的用于操作 Office Excel 文档类库，基于 ECMA-376 Office OpenXML 标准。可以使用它来读取、写入由 Microsoft Excel™ 2007 及以上版本创建的 XLSX 文档。相比较其他的开源类库，Excelize 支持写入原本带有图片(表)、透视表和切片器等复杂样式的文档，还支持向 Excel 文档中插入图片与图表，并且在保存后不会丢失文档原有样式，可以应用于各类报表系统中。使用本类库要求使用的 Go 语言为 1.8 或更高版本，完整的 API 使用文档请访问 [godoc.org](https://godoc.org/github.com/360EntSecGroup-Skylar/excelize) 或查看 [中文翻译](https://xuri.me/excelize/zh_cn)。\n\n## 快速上手\n\n### 安装\n\n```go\ngo get github.com/360EntSecGroup-Skylar/excelize\n```\n\n### 创建 Excel 文档\n\n下面是一个创建 Excel 文档的简单例子：\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx := excelize.NewFile()\n // 创建一个工作表\n index := xlsx.NewSheet(\"Sheet2\")\n // 设置单元格的值\n xlsx.SetCellValue(\"Sheet2\", \"A2\", \"Hello world.\")\n xlsx.SetCellValue(\"Sheet1\", \"B2\", 100)\n // 设置工作簿的默认工作表\n xlsx.SetActiveSheet(index)\n // 根据指定路径保存文件\n err := xlsx.SaveAs(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n }\n}\n```\n\n### 读取 Excel 文档\n\n下面是读取 Excel 文档的例子：\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n return\n }\n // 获取工作表中指定单元格的值\n cell := xlsx.GetCellValue(\"Sheet1\", \"B2\")\n fmt.Println(cell)\n // 获取 Sheet1 上所有单元格\n rows := xlsx.GetRows(\"Sheet1\")\n for _, row := range rows {\n for _, colCell := range row {\n fmt.Print(colCell, \"\\t\")\n }\n fmt.Println()\n }\n}\n```\n\n### 在 Excel 文档中创建图表\n\n使用 Excelize 生成图表十分简单，仅需几行代码。您可以根据工作表中的已有数据构建图表，或向工作表中添加数据并创建图表。\n\n![Excelize](./test/images/chart.png \"Excelize\")\n\n```go\npackage main\n\nimport (\n \"fmt\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n categories := map[string]string{\"A2\": \"Small\", \"A3\": \"Normal\", \"A4\": \"Large\", \"B1\": \"Apple\", \"C1\": \"Orange\", \"D1\": \"Pear\"}\n values := map[string]int{\"B2\": 2, \"C2\": 3, \"D2\": 3, \"B3\": 5, \"C3\": 2, \"D3\": 4, \"B4\": 6, \"C4\": 7, \"D4\": 8}\n xlsx := excelize.NewFile()\n for k, v := range categories {\n xlsx.SetCellValue(\"Sheet1\", k, v)\n }\n for k, v := range values {\n xlsx.SetCellValue(\"Sheet1\", k, v)\n }\n xlsx.AddChart(\"Sheet1\", \"E1\", `{\"type\":\"col3DClustered\",\"series\":[{\"name\":\"Sheet1!$A$2\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$2:$D$2\"},{\"name\":\"Sheet1!$A$3\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$3:$D$3\"},{\"name\":\"Sheet1!$A$4\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$4:$D$4\"}],\"title\":{\"name\":\"Fruit 3D Clustered Column Chart\"}}`)\n // 根据指定路径保存文件\n err := xlsx.SaveAs(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n }\n}\n\n```\n\n### 向 Excel 文档中插入图片\n\n```go\npackage main\n\nimport (\n \"fmt\"\n _ \"image/gif\"\n _ \"image/jpeg\"\n _ \"image/png\"\n\n \"github.com/360EntSecGroup-Skylar/excelize\"\n)\n\nfunc main() {\n xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n if err != nil {\n fmt.Println(err)\n return\n }\n // 插入图片\n err = xlsx.AddPicture(\"Sheet1\", \"A2\", \"./image1.png\", \"\")\n if err != nil {\n fmt.Println(err)\n }\n // 在工作表中插入图片，并设置图片的缩放比例\n err = xlsx.AddPicture(\"Sheet1\", \"D2\", \"./image2.jpg\", `{\"x_scale\": 0.5, \"y_scale\": 0.5}`)\n if err != nil {\n fmt.Println(err)\n }\n // 在工作表中插入图片，并设置图片的打印属性\n err = xlsx.AddPicture(\"Sheet1\", \"H2\", \"./image3.gif\", `{\"x_offset\": 15, \"y_offset\": 10, \"print_obj\": true, \"lock_aspect_ratio\": false, \"locked\": false}`)\n if err != nil {\n fmt.Println(err)\n }\n // 保存文件\n err = xlsx.Save()\n if err != nil {\n fmt.Println(err)\n }\n}\n```\n\n## 社区合作\n\n欢迎您为此项目贡献代码，提出建议或问题、修复 Bug 以及参与讨论对新功能的想法。 XML 符合标准： [part 1 of the 5th edition of the ECMA-376 Standard for Office Open XML](http://www.ecma-international.org/publications/standards/Ecma-376.htm)。\n\n## 致谢\n\n本类库中部分 XML 结构体的定义参考了开源项目：[tealeg/xlsx](https://github.com/tealeg/xlsx).\n\n## 开源许可\n\n本项目遵循 BSD 3-Clause 开源许可协议，访问 [https://opensource.org/licenses/BSD-3-Clause](https://opensource.org/licenses/BSD-3-Clause) 查看许可协议文件。\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/cell.go", "content": "package excelize\n\nimport (\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\nconst (\n\t// STCellFormulaTypeArray defined the formula is an array formula.\n\tSTCellFormulaTypeArray = \"array\"\n\t// STCellFormulaTypeDataTable defined the formula is a data table formula.\n\tSTCellFormulaTypeDataTable = \"dataTable\"\n\t// STCellFormulaTypeNormal defined the formula is a regular cell formula.\n\tSTCellFormulaTypeNormal = \"normal\"\n\t// STCellFormulaTypeShared defined the formula is part of a shared formula.\n\tSTCellFormulaTypeShared = \"shared\"\n)\n\n// mergeCellsParser provides function to check merged cells in worksheet by\n// given axis.\nfunc (f *File) mergeCellsParser(xlsx *xlsxWorksheet, axis string) string {\n\taxis = strings.ToUpper(axis)\n\tif xlsx.MergeCells != nil {\n\t\tfor i := 0; i < len(xlsx.MergeCells.Cells); i++ {\n\t\t\tif checkCellInArea(axis, xlsx.MergeCells.Cells[i].Ref) {\n\t\t\t\taxis = strings.Split(xlsx.MergeCells.Cells[i].Ref, \":\")[0]\n\t\t\t}\n\t\t}\n\t}\n\treturn axis\n}\n\n// SetCellValue provides function to set value of a cell. The following shows\n// the supported data types:\n//\n// int\n// int8\n// int16\n// int32\n// int64\n// uint\n// uint8\n// uint16\n// uint32\n// uint64\n// float32\n// float64\n// string\n// []byte\n// time.Duration\n// time.Time\n// bool\n// nil\n//\n// Note that default date format is m/d/yy h:mm of time.Time type value. You can\n// set numbers format by SetCellStyle() method.\nfunc (f *File) SetCellValue(sheet, axis string, value interface{}) {\n\tswitch t := value.(type) {\n\tcase float32:\n\t\tf.SetCellDefault(sheet, axis, strconv.FormatFloat(float64(value.(float32)), 'f', -1, 32))\n\tcase float64:\n\t\tf.SetCellDefault(sheet, axis, strconv.FormatFloat(float64(value.(float64)), 'f', -1, 64))\n\tcase string:\n\t\tf.SetCellStr(sheet, axis, t)\n\tcase []byte:\n\t\tf.SetCellStr(sheet, axis, string(t))\n\tcase time.Duration:\n\t\tf.SetCellDefault(sheet, axis, strconv.FormatFloat(float64(value.(time.Duration).Seconds()/86400), 'f', -1, 32))\n\t\tf.setDefaultTimeStyle(sheet, axis, 21)\n\tcase time.Time:\n\t\tf.SetCellDefault(sheet, axis, strconv.FormatFloat(float64(timeToExcelTime(timeToUTCTime(value.(time.Time)))), 'f', -1, 64))\n\t\tf.setDefaultTimeStyle(sheet, axis, 22)\n\tcase nil:\n\t\tf.SetCellStr(sheet, axis, \"\")\n\tcase bool:\n\t\tf.SetCellBool(sheet, axis, bool(value.(bool)))\n\tdefault:\n\t\tf.setCellIntValue(sheet, axis, value)\n\t}\n}\n\n// setCellIntValue provides function to set int value of a cell.\nfunc (f *File) setCellIntValue(sheet, axis string, value interface{}) {\n\tswitch value.(type) {\n\tcase int:\n\t\tf.SetCellInt(sheet, axis, value.(int))\n\tcase int8:\n\t\tf.SetCellInt(sheet, axis, int(value.(int8)))\n\tcase int16:\n\t\tf.SetCellInt(sheet, axis, int(value.(int16)))\n\tcase int32:\n\t\tf.SetCellInt(sheet, axis, int(value.(int32)))\n\tcase int64:\n\t\tf.SetCellInt(sheet, axis, int(value.(int64)))\n\tcase uint:\n\t\tf.SetCellInt(sheet, axis, int(value.(uint)))\n\tcase uint8:\n\t\tf.SetCellInt(sheet, axis, int(value.(uint8)))\n\tcase uint16:\n\t\tf.SetCellInt(sheet, axis, int(value.(uint16)))\n\tcase uint32:\n\t\tf.SetCellInt(sheet, axis, int(value.(uint32)))\n\tcase uint64:\n\t\tf.SetCellInt(sheet, axis, int(value.(uint64)))\n\tdefault:\n\t\tf.SetCellStr(sheet, axis, fmt.Sprintf(\"%v\", value))\n\t}\n}\n\n// SetCellBool provides function to set bool type value of a cell by given\n// worksheet name, cell coordinates and cell value.\nfunc (f *File) SetCellBool(sheet, axis string, value bool) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\txlsx.SheetData.Row[xAxis].C[yAxis].S = f.prepareCellStyle(xlsx, cell, xlsx.SheetData.Row[xAxis].C[yAxis].S)\n\txlsx.SheetData.Row[xAxis].C[yAxis].T = \"b\"\n\tif value {\n\t\txlsx.SheetData.Row[xAxis].C[yAxis].V = \"1\"\n\t} else {\n\t\txlsx.SheetData.Row[xAxis].C[yAxis].V = \"0\"\n\t}\n}\n\n// GetCellValue provides function to get formatted value from cell by given\n// worksheet name and axis in XLSX file. If it is possible to apply a format to\n// the cell value, it will do so, if not then an error will be returned, along\n// with the raw value of the cell.\nfunc (f *File) GetCellValue(sheet, axis string) string {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\txAxis := row - 1\n\trows := len(xlsx.SheetData.Row)\n\tif rows > 1 {\n\t\tlastRow := xlsx.SheetData.Row[rows-1].R\n\t\tif lastRow >= rows {\n\t\t\trows = lastRow\n\t\t}\n\t}\n\tif rows < xAxis {\n\t\treturn \"\"\n\t}\n\tfor k := range xlsx.SheetData.Row {\n\t\tif xlsx.SheetData.Row[k].R == row {\n\t\t\tfor i := range xlsx.SheetData.Row[k].C {\n\t\t\t\tif axis == xlsx.SheetData.Row[k].C[i].R {\n\t\t\t\t\tval, _ := xlsx.SheetData.Row[k].C[i].getValueFrom(f, f.sharedStringsReader())\n\t\t\t\t\treturn val\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// formattedValue provides function to returns a value after formatted. If it is\n// possible to apply a format to the cell value, it will do so, if not then an\n// error will be returned, along with the raw value of the cell.\nfunc (f *File) formattedValue(s int, v string) string {\n\tif s == 0 {\n\t\treturn v\n\t}\n\tstyleSheet := f.stylesReader()\n\tok := builtInNumFmtFunc[styleSheet.CellXfs.Xf[s].NumFmtID]\n\tif ok != nil {\n\t\treturn ok(styleSheet.CellXfs.Xf[s].NumFmtID, v)\n\t}\n\treturn v\n}\n\n// GetCellStyle provides function to get cell style index by given worksheet\n// name and cell coordinates.\nfunc (f *File) GetCellStyle(sheet, axis string) int {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn 0\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\treturn f.prepareCellStyle(xlsx, cell, xlsx.SheetData.Row[xAxis].C[yAxis].S)\n}\n\n// GetCellFormula provides function to get formula from cell by given worksheet\n// name and axis in XLSX file.\nfunc (f *File) GetCellFormula(sheet, axis string) string {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\txAxis := row - 1\n\trows := len(xlsx.SheetData.Row)\n\tif rows > 1 {\n\t\tlastRow := xlsx.SheetData.Row[rows-1].R\n\t\tif lastRow >= rows {\n\t\t\trows = lastRow\n\t\t}\n\t}\n\tif rows < xAxis {\n\t\treturn \"\"\n\t}\n\tfor k := range xlsx.SheetData.Row {\n\t\tif xlsx.SheetData.Row[k].R == row {\n\t\t\tfor i := range xlsx.SheetData.Row[k].C {\n\t\t\t\tif axis == xlsx.SheetData.Row[k].C[i].R {\n\t\t\t\t\tif xlsx.SheetData.Row[k].C[i].F.T == STCellFormulaTypeShared {\n\t\t\t\t\t\treturn getSharedForumula(xlsx, xlsx.SheetData.Row[k].C[i].F.Si)\n\t\t\t\t\t}\n\t\t\t\t\tif xlsx.SheetData.Row[k].C[i].F != nil {\n\t\t\t\t\t\treturn xlsx.SheetData.Row[k].C[i].F.Content\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// getSharedForumula find a cell contains the same formula as another cell,\n// the \"shared\" value can be used for the t attribute and the si attribute can\n// be used to refer to the cell containing the formula. Two formulas are\n// considered to be the same when their respective representations in\n// R1C1-reference notation, are the same.\n//\n// Note that this function not validate ref tag to check the cell if or not in\n// allow area, and always return origin shared formula.\nfunc getSharedForumula(xlsx *xlsxWorksheet, si string) string {\n\tfor k := range xlsx.SheetData.Row {\n\t\tfor i := range xlsx.SheetData.Row[k].C {\n\t\t\tif xlsx.SheetData.Row[k].C[i].F == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif xlsx.SheetData.Row[k].C[i].F.T != STCellFormulaTypeShared {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif xlsx.SheetData.Row[k].C[i].F.Si != si {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif xlsx.SheetData.Row[k].C[i].F.Ref != \"\" {\n\t\t\t\treturn xlsx.SheetData.Row[k].C[i].F.Content\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// SetCellFormula provides function to set cell formula by given string and\n// worksheet name.\nfunc (f *File) SetCellFormula(sheet, axis, formula string) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\tif xlsx.SheetData.Row[xAxis].C[yAxis].F != nil {\n\t\txlsx.SheetData.Row[xAxis].C[yAxis].F.Content = formula\n\t} else {\n\t\tf := xlsxF{\n\t\t\tContent: formula,\n\t\t}\n\t\txlsx.SheetData.Row[xAxis].C[yAxis].F = &f\n\t}\n}\n\n// SetCellHyperLink provides function to set cell hyperlink by given worksheet\n// name and link URL address. LinkType defines two types of hyperlink \"External\"\n// for web site or \"Location\" for moving to one of cell in this workbook. The\n// below is example for external link.\n//\n// xlsx.SetCellHyperLink(\"Sheet1\", \"A3\", \"https://github.com/360EntSecGroup-Skylar/excelize\", \"External\")\n// // Set underline and font color style for the cell.\n// style, _ := xlsx.NewStyle(`{\"font\":{\"color\":\"#1265BE\",\"underline\":\"single\"}}`)\n// xlsx.SetCellStyle(\"Sheet1\", \"A3\", \"A3\", style)\n//\n// A this is another example for \"Location\":\n//\n// xlsx.SetCellHyperLink(\"Sheet1\", \"A3\", \"Sheet1!A40\", \"Location\")\n//\nfunc (f *File) SetCellHyperLink(sheet, axis, link, linkType string) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tlinkTypes := map[string]xlsxHyperlink{\n\t\t\"External\": {},\n\t\t\"Location\": {Location: link},\n\t}\n\thyperlink, ok := linkTypes[linkType]\n\tif !ok || axis == \"\" {\n\t\treturn\n\t}\n\thyperlink.Ref = axis\n\tif linkType == \"External\" {\n\t\trID := f.addSheetRelationships(sheet, SourceRelationshipHyperLink, link, linkType)\n\t\thyperlink.RID = \"rId\" + strconv.Itoa(rID)\n\t}\n\tif xlsx.Hyperlinks == nil {\n\t\txlsx.Hyperlinks = &xlsxHyperlinks{}\n\t}\n\txlsx.Hyperlinks.Hyperlink = append(xlsx.Hyperlinks.Hyperlink, hyperlink)\n}\n\n// GetCellHyperLink provides function to get cell hyperlink by given worksheet\n// name and axis. Boolean type value link will be ture if the cell has a\n// hyperlink and the target is the address of the hyperlink. Otherwise, the\n// value of link will be false and the value of the target will be a blank\n// string. For example get hyperlink of Sheet1!H6:\n//\n// link, target := xlsx.GetCellHyperLink(\"Sheet1\", \"H6\")\n//\nfunc (f *File) GetCellHyperLink(sheet, axis string) (bool, string) {\n\tvar link bool\n\tvar target string\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tif xlsx.Hyperlinks == nil || axis == \"\" {\n\t\treturn link, target\n\t}\n\tfor h := range xlsx.Hyperlinks.Hyperlink {\n\t\tif xlsx.Hyperlinks.Hyperlink[h].Ref == axis {\n\t\t\tlink = true\n\t\t\ttarget = xlsx.Hyperlinks.Hyperlink[h].Location\n\t\t\tif xlsx.Hyperlinks.Hyperlink[h].RID != \"\" {\n\t\t\t\ttarget = f.getSheetRelationshipsTargetByID(sheet, xlsx.Hyperlinks.Hyperlink[h].RID)\n\t\t\t}\n\t\t}\n\t}\n\treturn link, target\n}\n\n// MergeCell provides function to merge cells by given coordinate area and sheet\n// name. For example create a merged cell of D3:E9 on Sheet1:\n//\n// xlsx.MergeCell(\"Sheet1\", \"D3\", \"E9\")\n//\n// If you create a merged cell that overlaps with another existing merged cell,\n// those merged cells that already exist will be removed.\nfunc (f *File) MergeCell(sheet, hcell, vcell string) {\n\tif hcell == vcell {\n\t\treturn\n\t}\n\n\thcell = strings.ToUpper(hcell)\n\tvcell = strings.ToUpper(vcell)\n\n\t// Coordinate conversion, convert C1:B3 to 2,0,1,2.\n\thcol := string(strings.Map(letterOnlyMapF, hcell))\n\throw, _ := strconv.Atoi(strings.Map(intOnlyMapF, hcell))\n\thyAxis := hrow - 1\n\thxAxis := TitleToNumber(hcol)\n\n\tvcol := string(strings.Map(letterOnlyMapF, vcell))\n\tvrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, vcell))\n\tvyAxis := vrow - 1\n\tvxAxis := TitleToNumber(vcol)\n\n\tif vxAxis < hxAxis {\n\t\thcell, vcell = vcell, hcell\n\t\tvxAxis, hxAxis = hxAxis, vxAxis\n\t}\n\n\tif vyAxis < hyAxis {\n\t\thcell, vcell = vcell, hcell\n\t\tvyAxis, hyAxis = hyAxis, vyAxis\n\t}\n\n\txlsx := f.workSheetReader(sheet)\n\tif xlsx.MergeCells != nil {\n\t\tmergeCell := xlsxMergeCell{}\n\t\t// Correct the coordinate area, such correct C1:B3 to B1:C3.\n\t\tmergeCell.Ref = ToAlphaString(hxAxis) + strconv.Itoa(hyAxis+1) + \":\" + ToAlphaString(vxAxis) + strconv.Itoa(vyAxis+1)\n\t\t// Delete the merged cells of the overlapping area.\n\t\tfor i := 0; i < len(xlsx.MergeCells.Cells); i++ {\n\t\t\tif checkCellInArea(hcell, xlsx.MergeCells.Cells[i].Ref) || checkCellInArea(strings.Split(xlsx.MergeCells.Cells[i].Ref, \":\")[0], mergeCell.Ref) {\n\t\t\t\txlsx.MergeCells.Cells = append(xlsx.MergeCells.Cells[:i], xlsx.MergeCells.Cells[i+1:]...)\n\t\t\t} else if checkCellInArea(vcell, xlsx.MergeCells.Cells[i].Ref) || checkCellInArea(strings.Split(xlsx.MergeCells.Cells[i].Ref, \":\")[1], mergeCell.Ref) {\n\t\t\t\txlsx.MergeCells.Cells = append(xlsx.MergeCells.Cells[:i], xlsx.MergeCells.Cells[i+1:]...)\n\t\t\t}\n\t\t}\n\t\txlsx.MergeCells.Cells = append(xlsx.MergeCells.Cells, &mergeCell)\n\t} else {\n\t\tmergeCell := xlsxMergeCell{}\n\t\t// Correct the coordinate area, such correct C1:B3 to B1:C3.\n\t\tmergeCell.Ref = ToAlphaString(hxAxis) + strconv.Itoa(hyAxis+1) + \":\" + ToAlphaString(vxAxis) + strconv.Itoa(vyAxis+1)\n\t\tmergeCells := xlsxMergeCells{}\n\t\tmergeCells.Cells = append(mergeCells.Cells, &mergeCell)\n\t\txlsx.MergeCells = &mergeCells\n\t}\n}\n\n// SetCellInt provides function to set int type value of a cell by given\n// worksheet name, cell coordinates and cell value.\nfunc (f *File) SetCellInt(sheet, axis string, value int) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\txlsx.SheetData.Row[xAxis].C[yAxis].S = f.prepareCellStyle(xlsx, cell, xlsx.SheetData.Row[xAxis].C[yAxis].S)\n\txlsx.SheetData.Row[xAxis].C[yAxis].T = \"\"\n\txlsx.SheetData.Row[xAxis].C[yAxis].V = strconv.Itoa(value)\n}\n\n// prepareCellStyle provides function to prepare style index of cell in\n// worksheet by given column index and style index.\nfunc (f *File) prepareCellStyle(xlsx *xlsxWorksheet, col, style int) int {\n\tif xlsx.Cols != nil && style == 0 {\n\t\tfor _, v := range xlsx.Cols.Col {\n\t\t\tif v.Min <= col && col <= v.Max {\n\t\t\t\tstyle = v.Style\n\t\t\t}\n\t\t}\n\t}\n\treturn style\n}\n\n// SetCellStr provides function to set string type value of a cell. Total number\n// of characters that a cell can contain 32767 characters.\nfunc (f *File) SetCellStr(sheet, axis, value string) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tif len(value) > 32767 {\n\t\tvalue = value[0:32767]\n\t}\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\t// Leading space(s) character detection.\n\tif len(value) > 0 {\n\t\tif value[0] == 32 {\n\t\t\txlsx.SheetData.Row[xAxis].C[yAxis].XMLSpace = xml.Attr{\n\t\t\t\tName: xml.Name{Space: NameSpaceXML, Local: \"space\"},\n\t\t\t\tValue: \"preserve\",\n\t\t\t}\n\t\t}\n\t}\n\txlsx.SheetData.Row[xAxis].C[yAxis].S = f.prepareCellStyle(xlsx, cell, xlsx.SheetData.Row[xAxis].C[yAxis].S)\n\txlsx.SheetData.Row[xAxis].C[yAxis].T = \"str\"\n\txlsx.SheetData.Row[xAxis].C[yAxis].V = value\n}\n\n// SetCellDefault provides function to set string type value of a cell as\n// default format without escaping the cell.\nfunc (f *File) SetCellDefault(sheet, axis, value string) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\txlsx.SheetData.Row[xAxis].C[yAxis].S = f.prepareCellStyle(xlsx, cell, xlsx.SheetData.Row[xAxis].C[yAxis].S)\n\txlsx.SheetData.Row[xAxis].C[yAxis].T = \"\"\n\txlsx.SheetData.Row[xAxis].C[yAxis].V = value\n}\n\n// SetSheetRow writes an array to row by given worksheet name, starting\n// coordinate and a pointer to array type 'slice'. For example, writes an\n// array to row 6 start with the cell B6 on Sheet1:\n//\n// xlsx.SetSheetRow(\"Sheet1\", \"B6\", &[]interface{}{\"1\", nil, 2})\n//\nfunc (f *File) SetSheetRow(sheet, axis string, slice interface{}) {\n\txlsx := f.workSheetReader(sheet)\n\taxis = f.mergeCellsParser(xlsx, axis)\n\tcol := string(strings.Map(letterOnlyMapF, axis))\n\trow, err := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\tif err != nil {\n\t\treturn\n\t}\n\t// Make sure 'slice' is a Ptr to Slice\n\tv := reflect.ValueOf(slice)\n\tif v.Kind() != reflect.Ptr {\n\t\treturn\n\t}\n\tv = v.Elem()\n\tif v.Kind() != reflect.Slice {\n\t\treturn\n\t}\n\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\n\trows := xAxis + 1\n\tcell := yAxis + 1\n\n\tcompleteRow(xlsx, rows, cell)\n\tcompleteCol(xlsx, rows, cell)\n\n\tidx := 0\n\tfor i := cell - 1; i < v.Len()+cell-1; i++ {\n\t\tc := ToAlphaString(i) + strconv.Itoa(row)\n\t\tf.SetCellValue(sheet, c, v.Index(idx).Interface())\n\t\tidx++\n\t}\n}\n\n// checkCellInArea provides function to determine if a given coordinate is\n// within an area.\nfunc checkCellInArea(cell, area string) bool {\n\tcell = strings.ToUpper(cell)\n\tarea = strings.ToUpper(area)\n\n\tref := strings.Split(area, \":\")\n\tif len(ref) < 2 {\n\t\treturn false\n\t}\n\n\tfrom := ref[0]\n\tto := ref[1]\n\n\tcol, row := getCellColRow(cell)\n\tfromCol, fromRow := getCellColRow(from)\n\ttoCol, toRow := getCellColRow(to)\n\n\treturn axisLowerOrEqualThan(fromCol, col) && axisLowerOrEqualThan(col, toCol) && axisLowerOrEqualThan(fromRow, row) && axisLowerOrEqualThan(row, toRow)\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/chart.go", "content": "package excelize\n\nimport (\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// This section defines the currently supported chart types.\nconst (\n\tBar = \"bar\"\n\tBarStacked = \"barStacked\"\n\tBarPercentStacked = \"barPercentStacked\"\n\tBar3DClustered = \"bar3DClustered\"\n\tBar3DStacked = \"bar3DStacked\"\n\tBar3DPercentStacked = \"bar3DPercentStacked\"\n\tCol = \"col\"\n\tColStacked = \"colStacked\"\n\tColPercentStacked = \"colPercentStacked\"\n\tCol3DClustered = \"col3DClustered\"\n\tCol3D = \"col3D\"\n\tCol3DStacked = \"col3DStacked\"\n\tCol3DPercentStacked = \"col3DPercentStacked\"\n\tDoughnut = \"doughnut\"\n\tLine = \"line\"\n\tPie = \"pie\"\n\tPie3D = \"pie3D\"\n\tRadar = \"radar\"\n\tScatter = \"scatter\"\n)\n\n// This section defines the default value of chart properties.\nvar (\n\tchartView3DRotX = map[string]int{\n\t\tBar: 0,\n\t\tBarStacked: 0,\n\t\tBarPercentStacked: 0,\n\t\tBar3DClustered: 15,\n\t\tBar3DStacked: 15,\n\t\tBar3DPercentStacked: 15,\n\t\tCol: 0,\n\t\tColStacked: 0,\n\t\tColPercentStacked: 0,\n\t\tCol3DClustered: 15,\n\t\tCol3D: 15,\n\t\tCol3DStacked: 15,\n\t\tCol3DPercentStacked: 15,\n\t\tDoughnut: 0,\n\t\tLine: 0,\n\t\tPie: 0,\n\t\tPie3D: 30,\n\t\tRadar: 0,\n\t\tScatter: 0,\n\t}\n\tchartView3DRotY = map[string]int{\n\t\tBar: 0,\n\t\tBarStacked: 0,\n\t\tBarPercentStacked: 0,\n\t\tBar3DClustered: 20,\n\t\tBar3DStacked: 20,\n\t\tBar3DPercentStacked: 20,\n\t\tCol: 0,\n\t\tColStacked: 0,\n\t\tColPercentStacked: 0,\n\t\tCol3DClustered: 20,\n\t\tCol3D: 20,\n\t\tCol3DStacked: 20,\n\t\tCol3DPercentStacked: 20,\n\t\tDoughnut: 0,\n\t\tLine: 0,\n\t\tPie: 0,\n\t\tPie3D: 0,\n\t\tRadar: 0,\n\t\tScatter: 0,\n\t}\n\tchartView3DDepthPercent = map[string]int{\n\t\tBar: 100,\n\t\tBarStacked: 100,\n\t\tBarPercentStacked: 100,\n\t\tBar3DClustered: 100,\n\t\tBar3DStacked: 100,\n\t\tBar3DPercentStacked: 100,\n\t\tCol: 100,\n\t\tColStacked: 100,\n\t\tColPercentStacked: 100,\n\t\tCol3DClustered: 100,\n\t\tCol3D: 100,\n\t\tCol3DStacked: 100,\n\t\tCol3DPercentStacked: 100,\n\t\tDoughnut: 100,\n\t\tLine: 100,\n\t\tPie: 100,\n\t\tPie3D: 100,\n\t\tRadar: 100,\n\t\tScatter: 100,\n\t}\n\tchartView3DRAngAx = map[string]int{\n\t\tBar: 0,\n\t\tBarStacked: 0,\n\t\tBarPercentStacked: 0,\n\t\tBar3DClustered: 1,\n\t\tBar3DStacked: 1,\n\t\tBar3DPercentStacked: 1,\n\t\tCol: 0,\n\t\tColStacked: 0,\n\t\tColPercentStacked: 0,\n\t\tCol3DClustered: 1,\n\t\tCol3D: 1,\n\t\tCol3DStacked: 1,\n\t\tCol3DPercentStacked: 1,\n\t\tDoughnut: 0,\n\t\tLine: 0,\n\t\tPie: 0,\n\t\tPie3D: 0,\n\t\tRadar: 0,\n\t\tScatter: 0,\n\t}\n\tchartLegendPosition = map[string]string{\n\t\t\"bottom\": \"b\",\n\t\t\"left\": \"l\",\n\t\t\"right\": \"r\",\n\t\t\"top\": \"t\",\n\t\t\"top_right\": \"tr\",\n\t}\n\tchartValAxNumFmtFormatCode = map[string]string{\n\t\tBar: \"General\",\n\t\tBarStacked: \"General\",\n\t\tBarPercentStacked: \"0%\",\n\t\tBar3DClustered: \"General\",\n\t\tBar3DStacked: \"General\",\n\t\tBar3DPercentStacked: \"0%\",\n\t\tCol: \"General\",\n\t\tColStacked: \"General\",\n\t\tColPercentStacked: \"0%\",\n\t\tCol3DClustered: \"General\",\n\t\tCol3D: \"General\",\n\t\tCol3DStacked: \"General\",\n\t\tCol3DPercentStacked: \"0%\",\n\t\tDoughnut: \"General\",\n\t\tLine: \"General\",\n\t\tPie: \"General\",\n\t\tPie3D: \"General\",\n\t\tRadar: \"General\",\n\t\tScatter: \"General\",\n\t}\n\tplotAreaChartGrouping = map[string]string{\n\t\tBar: \"clustered\",\n\t\tBarStacked: \"stacked\",\n\t\tBarPercentStacked: \"percentStacked\",\n\t\tBar3DClustered: \"clustered\",\n\t\tBar3DStacked: \"stacked\",\n\t\tBar3DPercentStacked: \"percentStacked\",\n\t\tCol: \"clustered\",\n\t\tColStacked: \"stacked\",\n\t\tColPercentStacked: \"percentStacked\",\n\t\tCol3DClustered: \"clustered\",\n\t\tCol3D: \"standard\",\n\t\tCol3DStacked: \"stacked\",\n\t\tCol3DPercentStacked: \"percentStacked\",\n\t\tLine: \"standard\",\n\t}\n\tplotAreaChartBarDir = map[string]string{\n\t\tBar: \"bar\",\n\t\tBarStacked: \"bar\",\n\t\tBarPercentStacked: \"bar\",\n\t\tBar3DClustered: \"bar\",\n\t\tBar3DStacked: \"bar\",\n\t\tBar3DPercentStacked: \"bar\",\n\t\tCol: \"col\",\n\t\tColStacked: \"col\",\n\t\tColPercentStacked: \"col\",\n\t\tCol3DClustered: \"col\",\n\t\tCol3D: \"col\",\n\t\tCol3DStacked: \"col\",\n\t\tCol3DPercentStacked: \"col\",\n\t\tLine: \"standard\",\n\t}\n\torientation = map[bool]string{\n\t\ttrue: \"maxMin\",\n\t\tfalse: \"minMax\",\n\t}\n\tcatAxPos = map[bool]string{\n\t\ttrue: \"t\",\n\t\tfalse: \"b\",\n\t}\n\tvalAxPos = map[bool]string{\n\t\ttrue: \"r\",\n\t\tfalse: \"l\",\n\t}\n)\n\n// parseFormatChartSet provides function to parse the format settings of the\n// chart with default value.\nfunc parseFormatChartSet(formatSet string) (*formatChart, error) {\n\tformat := formatChart{\n\t\tDimension: formatChartDimension{\n\t\t\tWidth: 480,\n\t\t\tHeight: 290,\n\t\t},\n\t\tFormat: formatPicture{\n\t\t\tFPrintsWithSheet: true,\n\t\t\tFLocksWithSheet: false,\n\t\t\tNoChangeAspect: false,\n\t\t\tOffsetX: 0,\n\t\t\tOffsetY: 0,\n\t\t\tXScale: 1.0,\n\t\t\tYScale: 1.0,\n\t\t},\n\t\tLegend: formatChartLegend{\n\t\t\tPosition: \"bottom\",\n\t\t\tShowLegendKey: false,\n\t\t},\n\t\tTitle: formatChartTitle{\n\t\t\tName: \" \",\n\t\t},\n\t\tShowBlanksAs: \"gap\",\n\t}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AddChart provides the method to add chart in a sheet by given chart format\n// set (such as offset, scale, aspect ratio setting and print settings) and\n// properties set. For example, create 3D clustered column chart with data\n// Sheet1!$A$29:$D$32:\n//\n// package main\n//\n// import (\n// \"fmt\"\n//\n// \"github.com/360EntSecGroup-Skylar/excelize\"\n// )\n//\n// func main() {\n// categories := map[string]string{\"A2\": \"Small\", \"A3\": \"Normal\", \"A4\": \"Large\", \"B1\": \"Apple\", \"C1\": \"Orange\", \"D1\": \"Pear\"}\n// values := map[string]int{\"B2\": 2, \"C2\": 3, \"D2\": 3, \"B3\": 5, \"C3\": 2, \"D3\": 4, \"B4\": 6, \"C4\": 7, \"D4\": 8}\n// xlsx := excelize.NewFile()\n// for k, v := range categories {\n// xlsx.SetCellValue(\"Sheet1\", k, v)\n// }\n// for k, v := range values {\n// xlsx.SetCellValue(\"Sheet1\", k, v)\n// }\n// xlsx.AddChart(\"Sheet1\", \"E1\", `{\"type\":\"col3DClustered\",\"dimension\":{\"width\":640,\"height\":480},\"series\":[{\"name\":\"Sheet1!$A$2\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$2:$D$2\"},{\"name\":\"Sheet1!$A$3\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$3:$D$3\"},{\"name\":\"Sheet1!$A$4\",\"categories\":\"Sheet1!$B$1:$D$1\",\"values\":\"Sheet1!$B$4:$D$4\"}],\"format\":{\"x_scale\":1.0,\"y_scale\":1.0,\"x_offset\":15,\"y_offset\":10,\"print_obj\":true,\"lock_aspect_ratio\":false,\"locked\":false},\"legend\":{\"position\":\"bottom\",\"show_legend_key\":false},\"title\":{\"name\":\"Fruit 3D Clustered Column Chart\"},\"plotarea\":{\"show_bubble_size\":true,\"show_cat_name\":false,\"show_leader_lines\":false,\"show_percent\":true,\"show_series_name\":true,\"show_val\":true},\"show_blanks_as\":\"zero\",\"x_axis\":{\"reverse_order\":true},\"y_axis\":{\"maximum\":7.5,\"minimum\":0.5}}`)\n// // Save xlsx file by the given path.\n// err := xlsx.SaveAs(\"./Book1.xlsx\")\n// if err != nil {\n// fmt.Println(err)\n// }\n// }\n//\n// The following shows the type of chart supported by excelize:\n//\n// Type | Chart\n// ---------------------+------------------------------\n// bar | 2D clustered bar chart\n// barStacked | 2D stacked bar chart\n// barPercentStacked | 2D 100% stacked bar chart\n// bar3DClustered | 3D clustered bar chart\n// bar3DStacked | 3D stacked bar chart\n// bar3DPercentStacked | 3D 100% stacked bar chart\n// col | 2D clustered column chart\n// colStacked | 2D stacked column chart\n// colPercentStacked | 2D 100% stacked column chart\n// col3DClustered | 3D clustered column chart\n// col3D | 3D column chart\n// col3DStacked | 3D stacked column chart\n// col3DPercentStacked | 3D 100% stacked column chart\n// doughnut | doughnut chart\n// line | line chart\n// pie | pie chart\n// pie3D | 3D pie chart\n// radar | radar chart\n// scatter | scatter chart\n//\n// In Excel a chart series is a collection of information that defines which data is plotted such as values, axis labels and formatting.\n//\n// The series options that can be set are:\n//\n// name\n// categories\n// values\n//\n// name: Set the name for the series. The name is displayed in the chart legend and in the formula bar. The name property is optional and if it isn't supplied it will default to Series 1..n. The name can also be a formula such as Sheet1!$A$1\n//\n// categories: This sets the chart category labels. The category is more or less the same as the X axis. In most chart types the categories property is optional and the chart will just assume a sequential series from 1..n.\n//\n// values: This is the most important property of a series and is the only mandatory option for every chart object. This option links the chart with the worksheet data that it displays.\n//\n// Set properties of the chart legend. The options that can be set are:\n//\n// position\n// show_legend_key\n//\n// position: Set the position of the chart legend. The default legend position is right. The available positions are:\n//\n// top\n// bottom\n// left\n// right\n// top_right\n//\n// show_legend_key: Set the legend keys shall be shown in data labels. The default value is false.\n//\n// Set properties of the chart title. The properties that can be set are:\n//\n// title\n//\n// name: Set the name (title) for the chart. The name is displayed above the chart. The name can also be a formula such as Sheet1!$A$1 or a list with a sheetname. The name property is optional. The default is to have no chart title.\n//\n// Specifies how blank cells are plotted on the chart by show_blanks_as. The default value is gap. The options that can be set are:\n//\n// gap\n// span\n// zero\n//\n// gap: Specifies that blank values shall be left as a gap.\n//\n// sapn: Specifies that blank values shall be spanned with a line.\n//\n// zero: Specifies that blank values shall be treated as zero.\n//\n// Set chart offset, scale, aspect ratio setting and print settings by format, same as function AddPicture.\n//\n// Set the position of the chart plot area by plotarea. The properties that can be set are:\n//\n// show_bubble_size\n// show_cat_name\n// show_leader_lines\n// show_percent\n// show_series_name\n// show_val\n//\n// show_bubble_size: Specifies the bubble size shall be shown in a data label. The show_bubble_size property is optional. The default value is false.\n//\n// show_cat_name: Specifies that the category name shall be shown in the data label. The show_cat_name property is optional. The default value is true.\n//\n// show_leader_lines: Specifies leader lines shall be shown for data labels. The show_leader_lines property is optional. The default value is false.\n//\n// show_percent: Specifies that the percentage shall be shown in a data label. The show_percent property is optional. The default value is false.\n//\n// show_series_name: Specifies that the series name shall be shown in a data label. The show_series_name property is optional. The default value is false.\n//\n// show_val: Specifies that the value shall be shown in a data label. The show_val property is optional. The default value is false.\n//\n// Set the primary horizontal and vertical axis options by x_axis and y_axis. The properties that can be set are:\n//\n// reverse_order\n// maximum\n// minimum\n//\n// reverse_order: Specifies that the categories or values on reverse order (orientation of the chart). The reverse_order property is optional. The default value is false.\n// maximum: Specifies that the fixed maximum, 0 is auto. The maximum property is optional. The default value is auto.\n// minimum: Specifies that the fixed minimum, 0 is auto. The minimum property is optional. The default value is auto.\n//\n// Set chart size by dimension property. The dimension property is optional. The default width is 480, and height is 290.\n//\nfunc (f *File) AddChart(sheet, cell, format string) error {\n\tformatSet, err := parseFormatChartSet(format)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// Read sheet data.\n\txlsx := f.workSheetReader(sheet)\n\t// Add first picture for given sheet, create xl/drawings/ and xl/drawings/_rels/ folder.\n\tdrawingID := f.countDrawings() + 1\n\tchartID := f.countCharts() + 1\n\tdrawingXML := \"xl/drawings/drawing\" + strconv.Itoa(drawingID) + \".xml\"\n\tdrawingID, drawingXML = f.prepareDrawing(xlsx, drawingID, sheet, drawingXML)\n\tdrawingRID := f.addDrawingRelationships(drawingID, SourceRelationshipChart, \"../charts/chart\"+strconv.Itoa(chartID)+\".xml\", \"\")\n\tf.addDrawingChart(sheet, drawingXML, cell, formatSet.Dimension.Width, formatSet.Dimension.Height, drawingRID, &formatSet.Format)\n\tf.addChart(formatSet)\n\tf.addContentTypePart(chartID, \"chart\")\n\tf.addContentTypePart(drawingID, \"drawings\")\n\treturn err\n}\n\n// countCharts provides function to get chart files count storage in the\n// folder xl/charts.\nfunc (f *File) countCharts() int {\n\tcount := 0\n\tfor k := range f.XLSX {\n\t\tif strings.Contains(k, \"xl/charts/chart\") {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}\n\n// prepareDrawing provides function to prepare drawing ID and XML by given\n// drawingID, worksheet name and default drawingXML.\nfunc (f *File) prepareDrawing(xlsx *xlsxWorksheet, drawingID int, sheet, drawingXML string) (int, string) {\n\tsheetRelationshipsDrawingXML := \"../drawings/drawing\" + strconv.Itoa(drawingID) + \".xml\"\n\tif xlsx.Drawing != nil {\n\t\t// The worksheet already has a picture or chart relationships, use the relationships drawing ../drawings/drawing%d.xml.\n\t\tsheetRelationshipsDrawingXML = f.getSheetRelationshipsTargetByID(sheet, xlsx.Drawing.RID)\n\t\tdrawingID, _ = strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(sheetRelationshipsDrawingXML, \"../drawings/drawing\"), \".xml\"))\n\t\tdrawingXML = strings.Replace(sheetRelationshipsDrawingXML, \"..\", \"xl\", -1)\n\t} else {\n\t\t// Add first picture for given sheet.\n\t\trID := f.addSheetRelationships(sheet, SourceRelationshipDrawingML, sheetRelationshipsDrawingXML, \"\")\n\t\tf.addSheetDrawing(sheet, rID)\n\t}\n\treturn drawingID, drawingXML\n}\n\n// addChart provides function to create chart as xl/charts/chart%d.xml by given\n// format sets.\nfunc (f *File) addChart(formatSet *formatChart) {\n\tcount := f.countCharts()\n\txlsxChartSpace := xlsxChartSpace{\n\t\tXMLNSc: NameSpaceDrawingMLChart,\n\t\tXMLNSa: NameSpaceDrawingML,\n\t\tXMLNSr: SourceRelationship,\n\t\tXMLNSc16r2: SourceRelationshipChart201506,\n\t\tDate1904: &attrValBool{Val: false},\n\t\tLang: &attrValString{Val: \"en-US\"},\n\t\tRoundedCorners: &attrValBool{Val: false},\n\t\tChart: cChart{\n\t\t\tTitle: &cTitle{\n\t\t\t\tTx: cTx{\n\t\t\t\t\tRich: &cRich{\n\t\t\t\t\t\tP: aP{\n\t\t\t\t\t\t\tPPr: &aPPr{\n\t\t\t\t\t\t\t\tDefRPr: aRPr{\n\t\t\t\t\t\t\t\t\tKern: 1200,\n\t\t\t\t\t\t\t\t\tStrike: \"noStrike\",\n\t\t\t\t\t\t\t\t\tU: \"none\",\n\t\t\t\t\t\t\t\t\tSz: 1400,\n\t\t\t\t\t\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\t\t\t\t\t\tSchemeClr: &aSchemeClr{\n\t\t\t\t\t\t\t\t\t\t\tVal: \"tx1\",\n\t\t\t\t\t\t\t\t\t\t\tLumMod: &attrValInt{\n\t\t\t\t\t\t\t\t\t\t\t\tVal: 65000,\n\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t\tLumOff: &attrValInt{\n\t\t\t\t\t\t\t\t\t\t\t\tVal: 35000,\n\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\tEa: &aEa{\n\t\t\t\t\t\t\t\t\t\tTypeface: \"+mn-ea\",\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\tCs: &aCs{\n\t\t\t\t\t\t\t\t\t\tTypeface: \"+mn-cs\",\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\tLatin: &aLatin{\n\t\t\t\t\t\t\t\t\t\tTypeface: \"+mn-lt\",\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tR: &aR{\n\t\t\t\t\t\t\t\tRPr: aRPr{\n\t\t\t\t\t\t\t\t\tLang: \"en-US\",\n\t\t\t\t\t\t\t\t\tAltLang: \"en-US\",\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tT: formatSet.Title.Name,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tTxPr: cTxPr{\n\t\t\t\t\tP: aP{\n\t\t\t\t\t\tPPr: &aPPr{\n\t\t\t\t\t\t\tDefRPr: aRPr{\n\t\t\t\t\t\t\t\tKern: 1200,\n\t\t\t\t\t\t\t\tU: \"none\",\n\t\t\t\t\t\t\t\tSz: 14000,\n\t\t\t\t\t\t\t\tStrike: \"noStrike\",\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t\tEndParaRPr: &aEndParaRPr{\n\t\t\t\t\t\t\tLang: \"en-US\",\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t},\n\t\t\tView3D: &cView3D{\n\t\t\t\tRotX: &attrValInt{Val: chartView3DRotX[formatSet.Type]},\n\t\t\t\tRotY: &attrValInt{Val: chartView3DRotY[formatSet.Type]},\n\t\t\t\tDepthPercent: &attrValInt{Val: chartView3DDepthPercent[formatSet.Type]},\n\t\t\t\tRAngAx: &attrValInt{Val: chartView3DRAngAx[formatSet.Type]},\n\t\t\t},\n\t\t\tFloor: &cThicknessSpPr{\n\t\t\t\tThickness: &attrValInt{Val: 0},\n\t\t\t},\n\t\t\tSideWall: &cThicknessSpPr{\n\t\t\t\tThickness: &attrValInt{Val: 0},\n\t\t\t},\n\t\t\tBackWall: &cThicknessSpPr{\n\t\t\t\tThickness: &attrValInt{Val: 0},\n\t\t\t},\n\t\t\tPlotArea: &cPlotArea{},\n\t\t\tLegend: &cLegend{\n\t\t\t\tLegendPos: &attrValString{Val: chartLegendPosition[formatSet.Legend.Position]},\n\t\t\t\tOverlay: &attrValBool{Val: false},\n\t\t\t},\n\n\t\t\tPlotVisOnly: &attrValBool{Val: false},\n\t\t\tDispBlanksAs: &attrValString{Val: formatSet.ShowBlanksAs},\n\t\t\tShowDLblsOverMax: &attrValBool{Val: false},\n\t\t},\n\t\tSpPr: &cSpPr{\n\t\t\tSolidFill: &aSolidFill{\n\t\t\t\tSchemeClr: &aSchemeClr{Val: \"bg1\"},\n\t\t\t},\n\t\t\tLn: &aLn{\n\t\t\t\tW: 9525,\n\t\t\t\tCap: \"flat\",\n\t\t\t\tCmpd: \"sng\",\n\t\t\t\tAlgn: \"ctr\",\n\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\tSchemeClr: &aSchemeClr{Val: \"tx1\",\n\t\t\t\t\t\tLumMod: &attrValInt{\n\t\t\t\t\t\t\tVal: 15000,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tLumOff: &attrValInt{\n\t\t\t\t\t\t\tVal: 85000,\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t\tPrintSettings: &cPrintSettings{\n\t\t\tPageMargins: &cPageMargins{\n\t\t\t\tB: 0.75,\n\t\t\t\tL: 0.7,\n\t\t\t\tR: 0.7,\n\t\t\t\tT: 0.7,\n\t\t\t\tHeader: 0.3,\n\t\t\t\tFooter: 0.3,\n\t\t\t},\n\t\t},\n\t}\n\tplotAreaFunc := map[string]func(*formatChart) *cPlotArea{\n\t\tBar: f.drawBaseChart,\n\t\tBarStacked: f.drawBaseChart,\n\t\tBarPercentStacked: f.drawBaseChart,\n\t\tBar3DClustered: f.drawBaseChart,\n\t\tBar3DStacked: f.drawBaseChart,\n\t\tBar3DPercentStacked: f.drawBaseChart,\n\t\tCol: f.drawBaseChart,\n\t\tColStacked: f.drawBaseChart,\n\t\tColPercentStacked: f.drawBaseChart,\n\t\tCol3DClustered: f.drawBaseChart,\n\t\tCol3D: f.drawBaseChart,\n\t\tCol3DStacked: f.drawBaseChart,\n\t\tCol3DPercentStacked: f.drawBaseChart,\n\t\tDoughnut: f.drawDoughnutChart,\n\t\tLine: f.drawLineChart,\n\t\tPie3D: f.drawPie3DChart,\n\t\tPie: f.drawPieChart,\n\t\tRadar: f.drawRadarChart,\n\t\tScatter: f.drawScatterChart,\n\t}\n\txlsxChartSpace.Chart.PlotArea = plotAreaFunc[formatSet.Type](formatSet)\n\n\tchart, _ := xml.Marshal(xlsxChartSpace)\n\tmedia := \"xl/charts/chart\" + strconv.Itoa(count+1) + \".xml\"\n\tf.saveFileList(media, chart)\n}\n\n// drawBaseChart provides function to draw the c:plotArea element for bar,\n// and column series charts by given format sets.\nfunc (f *File) drawBaseChart(formatSet *formatChart) *cPlotArea {\n\tc := cCharts{\n\t\tBarDir: &attrValString{\n\t\t\tVal: \"col\",\n\t\t},\n\t\tGrouping: &attrValString{\n\t\t\tVal: \"clustered\",\n\t\t},\n\t\tVaryColors: &attrValBool{\n\t\t\tVal: true,\n\t\t},\n\t\tSer: f.drawChartSeries(formatSet),\n\t\tDLbls: f.drawChartDLbls(formatSet),\n\t\tAxID: []*attrValInt{\n\t\t\t{Val: 754001152},\n\t\t\t{Val: 753999904},\n\t\t},\n\t}\n\tc.BarDir.Val = plotAreaChartBarDir[formatSet.Type]\n\tc.Grouping.Val = plotAreaChartGrouping[formatSet.Type]\n\tif formatSet.Type == \"colStacked\" || formatSet.Type == \"barStacked\" || formatSet.Type == \"barPercentStacked\" || formatSet.Type == \"colPercentStacked\" {\n\t\tc.Overlap = &attrValInt{Val: 100}\n\t}\n\tcatAx := f.drawPlotAreaCatAx(formatSet)\n\tvalAx := f.drawPlotAreaValAx(formatSet)\n\tcharts := map[string]*cPlotArea{\n\t\t\"bar\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"barStacked\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"barPercentStacked\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"bar3DClustered\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"bar3DStacked\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"bar3DPercentStacked\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"col\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"colStacked\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"colPercentStacked\": {\n\t\t\tBarChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"col3DClustered\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"col3D\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"col3DStacked\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t\t\"col3DPercentStacked\": {\n\t\t\tBar3DChart: &c,\n\t\t\tCatAx: catAx,\n\t\t\tValAx: valAx,\n\t\t},\n\t}\n\treturn charts[formatSet.Type]\n}\n\n// drawDoughnutChart provides function to draw the c:plotArea element for\n// doughnut chart by given format sets.\nfunc (f *File) drawDoughnutChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tDoughnutChart: &cCharts{\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: true,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t\tHoleSize: &attrValInt{Val: 75},\n\t\t},\n\t}\n}\n\n// drawLineChart provides function to draw the c:plotArea element for line chart\n// by given format sets.\nfunc (f *File) drawLineChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tLineChart: &cCharts{\n\t\t\tGrouping: &attrValString{\n\t\t\t\tVal: plotAreaChartGrouping[formatSet.Type],\n\t\t\t},\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: false,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t\tDLbls: f.drawChartDLbls(formatSet),\n\t\t\tSmooth: &attrValBool{\n\t\t\t\tVal: false,\n\t\t\t},\n\t\t\tAxID: []*attrValInt{\n\t\t\t\t{Val: 754001152},\n\t\t\t\t{Val: 753999904},\n\t\t\t},\n\t\t},\n\t\tCatAx: f.drawPlotAreaCatAx(formatSet),\n\t\tValAx: f.drawPlotAreaValAx(formatSet),\n\t}\n}\n\n// drawPieChart provides function to draw the c:plotArea element for pie chart\n// by given format sets.\nfunc (f *File) drawPieChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tPieChart: &cCharts{\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: true,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t},\n\t}\n}\n\n// drawPie3DChart provides function to draw the c:plotArea element for 3D pie\n// chart by given format sets.\nfunc (f *File) drawPie3DChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tPie3DChart: &cCharts{\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: true,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t},\n\t}\n}\n\n// drawRadarChart provides function to draw the c:plotArea element for radar\n// chart by given format sets.\nfunc (f *File) drawRadarChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tRadarChart: &cCharts{\n\t\t\tRadarStyle: &attrValString{\n\t\t\t\tVal: \"marker\",\n\t\t\t},\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: false,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t\tDLbls: f.drawChartDLbls(formatSet),\n\t\t\tAxID: []*attrValInt{\n\t\t\t\t{Val: 754001152},\n\t\t\t\t{Val: 753999904},\n\t\t\t},\n\t\t},\n\t\tCatAx: f.drawPlotAreaCatAx(formatSet),\n\t\tValAx: f.drawPlotAreaValAx(formatSet),\n\t}\n}\n\n// drawScatterChart provides function to draw the c:plotArea element for scatter\n// chart by given format sets.\nfunc (f *File) drawScatterChart(formatSet *formatChart) *cPlotArea {\n\treturn &cPlotArea{\n\t\tScatterChart: &cCharts{\n\t\t\tScatterStyle: &attrValString{\n\t\t\t\tVal: \"smoothMarker\", // line,lineMarker,marker,none,smooth,smoothMarker\n\t\t\t},\n\t\t\tVaryColors: &attrValBool{\n\t\t\t\tVal: false,\n\t\t\t},\n\t\t\tSer: f.drawChartSeries(formatSet),\n\t\t\tDLbls: f.drawChartDLbls(formatSet),\n\t\t\tAxID: []*attrValInt{\n\t\t\t\t{Val: 754001152},\n\t\t\t\t{Val: 753999904},\n\t\t\t},\n\t\t},\n\t\tCatAx: f.drawPlotAreaCatAx(formatSet),\n\t\tValAx: f.drawPlotAreaValAx(formatSet),\n\t}\n}\n\n// drawChartSeries provides function to draw the c:ser element by given format\n// sets.\nfunc (f *File) drawChartSeries(formatSet *formatChart) *[]cSer {\n\tser := []cSer{}\n\tfor k := range formatSet.Series {\n\t\tser = append(ser, cSer{\n\t\t\tIDx: &attrValInt{Val: k},\n\t\t\tOrder: &attrValInt{Val: k},\n\t\t\tTx: &cTx{\n\t\t\t\tStrRef: &cStrRef{\n\t\t\t\t\tF: formatSet.Series[k].Name,\n\t\t\t\t},\n\t\t\t},\n\t\t\tSpPr: f.drawChartSeriesSpPr(k, formatSet),\n\t\t\tMarker: f.drawChartSeriesMarker(k, formatSet),\n\t\t\tDPt: f.drawChartSeriesDPt(k, formatSet),\n\t\t\tDLbls: f.drawChartSeriesDLbls(formatSet),\n\t\t\tCat: f.drawChartSeriesCat(formatSet.Series[k], formatSet),\n\t\t\tVal: f.drawChartSeriesVal(formatSet.Series[k], formatSet),\n\t\t\tXVal: f.drawChartSeriesXVal(formatSet.Series[k], formatSet),\n\t\t\tYVal: f.drawChartSeriesYVal(formatSet.Series[k], formatSet),\n\t\t})\n\t}\n\treturn &ser\n}\n\n// drawChartSeriesSpPr provides function to draw the c:spPr element by given\n// format sets.\nfunc (f *File) drawChartSeriesSpPr(i int, formatSet *formatChart) *cSpPr {\n\tspPrScatter := &cSpPr{\n\t\tLn: &aLn{\n\t\t\tW: 25400,\n\t\t\tNoFill: \" \",\n\t\t},\n\t}\n\tspPrLine := &cSpPr{\n\t\tLn: &aLn{\n\t\t\tW: 25400,\n\t\t\tCap: \"rnd\", // rnd, sq, flat\n\t\t\tSolidFill: &aSolidFill{\n\t\t\t\tSchemeClr: &aSchemeClr{Val: \"accent\" + strconv.Itoa(i+1)},\n\t\t\t},\n\t\t},\n\t}\n\tchartSeriesSpPr := map[string]*cSpPr{Bar: nil, BarStacked: nil, BarPercentStacked: nil, Bar3DClustered: nil, Bar3DStacked: nil, Bar3DPercentStacked: nil, Col: nil, ColStacked: nil, ColPercentStacked: nil, Col3DClustered: nil, Col3D: nil, Col3DStacked: nil, Col3DPercentStacked: nil, Doughnut: nil, Line: spPrLine, Pie: nil, Pie3D: nil, Radar: nil, Scatter: spPrScatter}\n\treturn chartSeriesSpPr[formatSet.Type]\n}\n\n// drawChartSeriesDPt provides function to draw the c:dPt element by given data\n// index and format sets.\nfunc (f *File) drawChartSeriesDPt(i int, formatSet *formatChart) []*cDPt {\n\tdpt := []*cDPt{{\n\t\tIDx: &attrValInt{Val: i},\n\t\tBubble3D: &attrValBool{Val: false},\n\t\tSpPr: &cSpPr{\n\t\t\tSolidFill: &aSolidFill{\n\t\t\t\tSchemeClr: &aSchemeClr{Val: \"accent\" + strconv.Itoa(i+1)},\n\t\t\t},\n\t\t\tLn: &aLn{\n\t\t\t\tW: 25400,\n\t\t\t\tCap: \"rnd\",\n\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\tSchemeClr: &aSchemeClr{Val: \"lt\" + strconv.Itoa(i+1)},\n\t\t\t\t},\n\t\t\t},\n\t\t\tSp3D: &aSp3D{\n\t\t\t\tContourW: 25400,\n\t\t\t\tContourClr: &aContourClr{\n\t\t\t\t\tSchemeClr: &aSchemeClr{Val: \"lt\" + strconv.Itoa(i+1)},\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}}\n\tchartSeriesDPt := map[string][]*cDPt{Bar: nil, BarStacked: nil, BarPercentStacked: nil, Bar3DClustered: nil, Bar3DStacked: nil, Bar3DPercentStacked: nil, Col: nil, ColStacked: nil, ColPercentStacked: nil, Col3DClustered: nil, Col3D: nil, Col3DStacked: nil, Col3DPercentStacked: nil, Doughnut: nil, Line: nil, Pie: dpt, Pie3D: dpt, Radar: nil, Scatter: nil}\n\treturn chartSeriesDPt[formatSet.Type]\n}\n\n// drawChartSeriesCat provides function to draw the c:cat element by given chart\n// series and format sets.\nfunc (f *File) drawChartSeriesCat(v formatChartSeries, formatSet *formatChart) *cCat {\n\tcat := &cCat{\n\t\tStrRef: &cStrRef{\n\t\t\tF: v.Categories,\n\t\t},\n\t}\n\tchartSeriesCat := map[string]*cCat{Bar: cat, BarStacked: cat, BarPercentStacked: cat, Bar3DClustered: cat, Bar3DStacked: cat, Bar3DPercentStacked: cat, Col: cat, ColStacked: cat, ColPercentStacked: cat, Col3DClustered: cat, Col3D: cat, Col3DStacked: cat, Col3DPercentStacked: cat, Doughnut: cat, Line: cat, Pie: cat, Pie3D: cat, Radar: cat, Scatter: nil}\n\treturn chartSeriesCat[formatSet.Type]\n}\n\n// drawChartSeriesVal provides function to draw the c:val element by given chart\n// series and format sets.\nfunc (f *File) drawChartSeriesVal(v formatChartSeries, formatSet *formatChart) *cVal {\n\tval := &cVal{\n\t\tNumRef: &cNumRef{\n\t\t\tF: v.Values,\n\t\t},\n\t}\n\tchartSeriesVal := map[string]*cVal{Bar: val, BarStacked: val, BarPercentStacked: val, Bar3DClustered: val, Bar3DStacked: val, Bar3DPercentStacked: val, Col: val, ColStacked: val, ColPercentStacked: val, Col3DClustered: val, Col3D: val, Col3DStacked: val, Col3DPercentStacked: val, Doughnut: val, Line: val, Pie: val, Pie3D: val, Radar: val, Scatter: nil}\n\treturn chartSeriesVal[formatSet.Type]\n}\n\n// drawChartSeriesMarker provides function to draw the c:marker element by given\n// data index and format sets.\nfunc (f *File) drawChartSeriesMarker(i int, formatSet *formatChart) *cMarker {\n\tmarker := &cMarker{\n\t\tSymbol: &attrValString{Val: \"circle\"},\n\t\tSize: &attrValInt{Val: 5},\n\t\tSpPr: &cSpPr{\n\t\t\tSolidFill: &aSolidFill{\n\t\t\t\tSchemeClr: &aSchemeClr{\n\t\t\t\t\tVal: \"accent\" + strconv.Itoa(i+1),\n\t\t\t\t},\n\t\t\t},\n\t\t\tLn: &aLn{\n\t\t\t\tW: 9252,\n\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\tSchemeClr: &aSchemeClr{\n\t\t\t\t\t\tVal: \"accent\" + strconv.Itoa(i+1),\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}\n\tchartSeriesMarker := map[string]*cMarker{Bar: nil, BarStacked: nil, BarPercentStacked: nil, Bar3DClustered: nil, Bar3DStacked: nil, Bar3DPercentStacked: nil, Col: nil, ColStacked: nil, ColPercentStacked: nil, Col3DClustered: nil, Col3D: nil, Col3DStacked: nil, Col3DPercentStacked: nil, Doughnut: nil, Line: nil, Pie: nil, Pie3D: nil, Radar: nil, Scatter: marker}\n\treturn chartSeriesMarker[formatSet.Type]\n}\n\n// drawChartSeriesXVal provides function to draw the c:xVal element by given\n// chart series and format sets.\nfunc (f *File) drawChartSeriesXVal(v formatChartSeries, formatSet *formatChart) *cCat {\n\tcat := &cCat{\n\t\tStrRef: &cStrRef{\n\t\t\tF: v.Categories,\n\t\t},\n\t}\n\tchartSeriesXVal := map[string]*cCat{Bar: nil, BarStacked: nil, BarPercentStacked: nil, Bar3DClustered: nil, Bar3DStacked: nil, Bar3DPercentStacked: nil, Col: nil, ColStacked: nil, ColPercentStacked: nil, Col3DClustered: nil, Col3D: nil, Col3DStacked: nil, Col3DPercentStacked: nil, Doughnut: nil, Line: nil, Pie: nil, Pie3D: nil, Radar: nil, Scatter: cat}\n\treturn chartSeriesXVal[formatSet.Type]\n}\n\n// drawChartSeriesYVal provides function to draw the c:yVal element by given\n// chart series and format sets.\nfunc (f *File) drawChartSeriesYVal(v formatChartSeries, formatSet *formatChart) *cVal {\n\tval := &cVal{\n\t\tNumRef: &cNumRef{\n\t\t\tF: v.Values,\n\t\t},\n\t}\n\tchartSeriesYVal := map[string]*cVal{Bar: nil, BarStacked: nil, BarPercentStacked: nil, Bar3DClustered: nil, Bar3DStacked: nil, Bar3DPercentStacked: nil, Col: nil, ColStacked: nil, ColPercentStacked: nil, Col3DClustered: nil, Col3D: nil, Col3DStacked: nil, Col3DPercentStacked: nil, Doughnut: nil, Line: nil, Pie: nil, Pie3D: nil, Radar: nil, Scatter: val}\n\treturn chartSeriesYVal[formatSet.Type]\n}\n\n// drawChartDLbls provides function to draw the c:dLbls element by given format\n// sets.\nfunc (f *File) drawChartDLbls(formatSet *formatChart) *cDLbls {\n\treturn &cDLbls{\n\t\tShowLegendKey: &attrValBool{Val: formatSet.Legend.ShowLegendKey},\n\t\tShowVal: &attrValBool{Val: formatSet.Plotarea.ShowVal},\n\t\tShowCatName: &attrValBool{Val: formatSet.Plotarea.ShowCatName},\n\t\tShowSerName: &attrValBool{Val: formatSet.Plotarea.ShowSerName},\n\t\tShowBubbleSize: &attrValBool{Val: formatSet.Plotarea.ShowBubbleSize},\n\t\tShowPercent: &attrValBool{Val: formatSet.Plotarea.ShowPercent},\n\t\tShowLeaderLines: &attrValBool{Val: formatSet.Plotarea.ShowLeaderLines},\n\t}\n}\n\n// drawChartSeriesDLbls provides function to draw the c:dLbls element by given\n// format sets.\nfunc (f *File) drawChartSeriesDLbls(formatSet *formatChart) *cDLbls {\n\tdLbls := f.drawChartDLbls(formatSet)\n\tchartSeriesDLbls := map[string]*cDLbls{Bar: dLbls, BarStacked: dLbls, BarPercentStacked: dLbls, Bar3DClustered: dLbls, Bar3DStacked: dLbls, Bar3DPercentStacked: dLbls, Col: dLbls, ColStacked: dLbls, ColPercentStacked: dLbls, Col3DClustered: dLbls, Col3D: dLbls, Col3DStacked: dLbls, Col3DPercentStacked: dLbls, Doughnut: dLbls, Line: dLbls, Pie: dLbls, Pie3D: dLbls, Radar: dLbls, Scatter: nil}\n\treturn chartSeriesDLbls[formatSet.Type]\n}\n\n// drawPlotAreaCatAx provides function to draw the c:catAx element.\nfunc (f *File) drawPlotAreaCatAx(formatSet *formatChart) []*cAxs {\n\tmin := &attrValFloat{Val: formatSet.XAxis.Minimum}\n\tmax := &attrValFloat{Val: formatSet.XAxis.Maximum}\n\tif formatSet.XAxis.Minimum == 0 {\n\t\tmin = nil\n\t}\n\tif formatSet.XAxis.Maximum == 0 {\n\t\tmax = nil\n\t}\n\treturn []*cAxs{\n\t\t{\n\t\t\tAxID: &attrValInt{Val: 754001152},\n\t\t\tScaling: &cScaling{\n\t\t\t\tOrientation: &attrValString{Val: orientation[formatSet.XAxis.ReverseOrder]},\n\t\t\t\tMax: max,\n\t\t\t\tMin: min,\n\t\t\t},\n\t\t\tDelete: &attrValBool{Val: false},\n\t\t\tAxPos: &attrValString{Val: catAxPos[formatSet.XAxis.ReverseOrder]},\n\t\t\tNumFmt: &cNumFmt{\n\t\t\t\tFormatCode: \"General\",\n\t\t\t\tSourceLinked: true,\n\t\t\t},\n\t\t\tMajorTickMark: &attrValString{Val: \"none\"},\n\t\t\tMinorTickMark: &attrValString{Val: \"none\"},\n\t\t\tTickLblPos: &attrValString{Val: \"nextTo\"},\n\t\t\tSpPr: f.drawPlotAreaSpPr(),\n\t\t\tTxPr: f.drawPlotAreaTxPr(),\n\t\t\tCrossAx: &attrValInt{Val: 753999904},\n\t\t\tCrosses: &attrValString{Val: \"autoZero\"},\n\t\t\tAuto: &attrValBool{Val: true},\n\t\t\tLblAlgn: &attrValString{Val: \"ctr\"},\n\t\t\tLblOffset: &attrValInt{Val: 100},\n\t\t\tNoMultiLvlLbl: &attrValBool{Val: false},\n\t\t},\n\t}\n}\n\n// drawPlotAreaValAx provides function to draw the c:valAx element.\nfunc (f *File) drawPlotAreaValAx(formatSet *formatChart) []*cAxs {\n\tmin := &attrValFloat{Val: formatSet.YAxis.Minimum}\n\tmax := &attrValFloat{Val: formatSet.YAxis.Maximum}\n\tif formatSet.YAxis.Minimum == 0 {\n\t\tmin = nil\n\t}\n\tif formatSet.YAxis.Maximum == 0 {\n\t\tmax = nil\n\t}\n\treturn []*cAxs{\n\t\t{\n\t\t\tAxID: &attrValInt{Val: 753999904},\n\t\t\tScaling: &cScaling{\n\t\t\t\tOrientation: &attrValString{Val: orientation[formatSet.YAxis.ReverseOrder]},\n\t\t\t\tMax: max,\n\t\t\t\tMin: min,\n\t\t\t},\n\t\t\tDelete: &attrValBool{Val: false},\n\t\t\tAxPos: &attrValString{Val: valAxPos[formatSet.YAxis.ReverseOrder]},\n\t\t\tNumFmt: &cNumFmt{\n\t\t\t\tFormatCode: chartValAxNumFmtFormatCode[formatSet.Type],\n\t\t\t\tSourceLinked: true,\n\t\t\t},\n\t\t\tMajorTickMark: &attrValString{Val: \"none\"},\n\t\t\tMinorTickMark: &attrValString{Val: \"none\"},\n\t\t\tTickLblPos: &attrValString{Val: \"nextTo\"},\n\t\t\tSpPr: f.drawPlotAreaSpPr(),\n\t\t\tTxPr: f.drawPlotAreaTxPr(),\n\t\t\tCrossAx: &attrValInt{Val: 754001152},\n\t\t\tCrosses: &attrValString{Val: \"autoZero\"},\n\t\t\tCrossBetween: &attrValString{Val: \"between\"},\n\t\t},\n\t}\n}\n\n// drawPlotAreaSpPr provides function to draw the c:spPr element.\nfunc (f *File) drawPlotAreaSpPr() *cSpPr {\n\treturn &cSpPr{\n\t\tLn: &aLn{\n\t\t\tW: 9525,\n\t\t\tCap: \"flat\",\n\t\t\tCmpd: \"sng\",\n\t\t\tAlgn: \"ctr\",\n\t\t\tSolidFill: &aSolidFill{\n\t\t\t\tSchemeClr: &aSchemeClr{\n\t\t\t\t\tVal: \"tx1\",\n\t\t\t\t\tLumMod: &attrValInt{Val: 15000},\n\t\t\t\t\tLumOff: &attrValInt{Val: 85000},\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}\n}\n\n// drawPlotAreaTxPr provides function to draw the c:txPr element.\nfunc (f *File) drawPlotAreaTxPr() *cTxPr {\n\treturn &cTxPr{\n\t\tBodyPr: aBodyPr{\n\t\t\tRot: -60000000,\n\t\t\tSpcFirstLastPara: true,\n\t\t\tVertOverflow: \"ellipsis\",\n\t\t\tVert: \"horz\",\n\t\t\tWrap: \"square\",\n\t\t\tAnchor: \"ctr\",\n\t\t\tAnchorCtr: true,\n\t\t},\n\t\tP: aP{\n\t\t\tPPr: &aPPr{\n\t\t\t\tDefRPr: aRPr{\n\t\t\t\t\tSz: 900,\n\t\t\t\t\tB: false,\n\t\t\t\t\tI: false,\n\t\t\t\t\tU: \"none\",\n\t\t\t\t\tStrike: \"noStrike\",\n\t\t\t\t\tKern: 1200,\n\t\t\t\t\tBaseline: 0,\n\t\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\t\tSchemeClr: &aSchemeClr{\n\t\t\t\t\t\t\tVal: \"tx1\",\n\t\t\t\t\t\t\tLumMod: &attrValInt{Val: 15000},\n\t\t\t\t\t\t\tLumOff: &attrValInt{Val: 85000},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t\tLatin: &aLatin{Typeface: \"+mn-lt\"},\n\t\t\t\t\tEa: &aEa{Typeface: \"+mn-ea\"},\n\t\t\t\t\tCs: &aCs{Typeface: \"+mn-cs\"},\n\t\t\t\t},\n\t\t\t},\n\t\t\tEndParaRPr: &aEndParaRPr{Lang: \"en-US\"},\n\t\t},\n\t}\n}\n\n// drawingParser provides function to parse drawingXML. In order to solve the\n// problem that the label structure is changed after serialization and\n// deserialization, two different structures: decodeWsDr and encodeWsDr are\n// defined.\nfunc (f *File) drawingParser(drawingXML string, content *xlsxWsDr) int {\n\tcNvPrID := 1\n\t_, ok := f.XLSX[drawingXML]\n\tif ok { // Append Model\n\t\tdecodeWsDr := decodeWsDr{}\n\t\t_ = xml.Unmarshal([]byte(f.readXML(drawingXML)), &decodeWsDr)\n\t\tcontent.R = decodeWsDr.R\n\t\tcNvPrID = len(decodeWsDr.OneCellAnchor) + len(decodeWsDr.TwoCellAnchor) + 1\n\t\tfor _, v := range decodeWsDr.OneCellAnchor {\n\t\t\tcontent.OneCellAnchor = append(content.OneCellAnchor, &xdrCellAnchor{\n\t\t\t\tEditAs: v.EditAs,\n\t\t\t\tGraphicFrame: v.Content,\n\t\t\t})\n\t\t}\n\t\tfor _, v := range decodeWsDr.TwoCellAnchor {\n\t\t\tcontent.TwoCellAnchor = append(content.TwoCellAnchor, &xdrCellAnchor{\n\t\t\t\tEditAs: v.EditAs,\n\t\t\t\tGraphicFrame: v.Content,\n\t\t\t})\n\t\t}\n\t}\n\treturn cNvPrID\n}\n\n// addDrawingChart provides function to add chart graphic frame by given sheet,\n// drawingXML, cell, width, height, relationship index and format sets.\nfunc (f *File) addDrawingChart(sheet, drawingXML, cell string, width, height, rID int, formatSet *formatPicture) {\n\tcell = strings.ToUpper(cell)\n\tfromCol := string(strings.Map(letterOnlyMapF, cell))\n\tfromRow, _ := strconv.Atoi(strings.Map(intOnlyMapF, cell))\n\trow := fromRow - 1\n\tcol := TitleToNumber(fromCol)\n\twidth = int(float64(width) * formatSet.XScale)\n\theight = int(float64(height) * formatSet.YScale)\n\tcolStart, rowStart, _, _, colEnd, rowEnd, x2, y2 := f.positionObjectPixels(sheet, col, row, formatSet.OffsetX, formatSet.OffsetY, width, height)\n\tcontent := xlsxWsDr{}\n\tcontent.A = NameSpaceDrawingML\n\tcontent.Xdr = NameSpaceDrawingMLSpreadSheet\n\tcNvPrID := f.drawingParser(drawingXML, &content)\n\ttwoCellAnchor := xdrCellAnchor{}\n\ttwoCellAnchor.EditAs = formatSet.Positioning\n\tfrom := xlsxFrom{}\n\tfrom.Col = colStart\n\tfrom.ColOff = formatSet.OffsetX * EMU\n\tfrom.Row = rowStart\n\tfrom.RowOff = formatSet.OffsetY * EMU\n\tto := xlsxTo{}\n\tto.Col = colEnd\n\tto.ColOff = x2 * EMU\n\tto.Row = rowEnd\n\tto.RowOff = y2 * EMU\n\ttwoCellAnchor.From = &from\n\ttwoCellAnchor.To = &to\n\n\tgraphicFrame := xlsxGraphicFrame{\n\t\tNvGraphicFramePr: xlsxNvGraphicFramePr{\n\t\t\tCNvPr: &xlsxCNvPr{\n\t\t\t\tID: f.countCharts() + f.countMedia() + 1,\n\t\t\t\tName: \"Chart \" + strconv.Itoa(cNvPrID),\n\t\t\t},\n\t\t},\n\t\tGraphic: &xlsxGraphic{\n\t\t\tGraphicData: &xlsxGraphicData{\n\t\t\t\tURI: NameSpaceDrawingMLChart,\n\t\t\t\tChart: &xlsxChart{\n\t\t\t\t\tC: NameSpaceDrawingMLChart,\n\t\t\t\t\tR: SourceRelationship,\n\t\t\t\t\tRID: \"rId\" + strconv.Itoa(rID),\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}\n\tgraphic, _ := xml.Marshal(graphicFrame)\n\ttwoCellAnchor.GraphicFrame = string(graphic)\n\ttwoCellAnchor.ClientData = &xdrClientData{\n\t\tFLocksWithSheet: formatSet.FLocksWithSheet,\n\t\tFPrintsWithSheet: formatSet.FPrintsWithSheet,\n\t}\n\tcontent.TwoCellAnchor = append(content.TwoCellAnchor, &twoCellAnchor)\n\toutput, _ := xml.Marshal(content)\n\tf.saveFileList(drawingXML, output)\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/col.go", "content": "package excelize\n\nimport (\n\t\"bytes\"\n\t\"math\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Define the default cell size and EMU unit of measurement.\nconst (\n\tdefaultColWidthPixels float64 = 64\n\tdefaultRowHeightPixels float64 = 20\n\tEMU int = 9525\n)\n\n// GetColVisible provides a function to get visible of a single column by given\n// worksheet name and column name. For example, get visible state of column D\n// in Sheet1:\n//\n// xlsx.GetColVisible(\"Sheet1\", \"D\")\n//\nfunc (f *File) GetColVisible(sheet, column string) bool {\n\txlsx := f.workSheetReader(sheet)\n\tcol := TitleToNumber(strings.ToUpper(column)) + 1\n\tvisible := true\n\tif xlsx.Cols == nil {\n\t\treturn visible\n\t}\n\tfor c := range xlsx.Cols.Col {\n\t\tif xlsx.Cols.Col[c].Min <= col && col <= xlsx.Cols.Col[c].Max {\n\t\t\tvisible = !xlsx.Cols.Col[c].Hidden\n\t\t}\n\t}\n\treturn visible\n}\n\n// SetColVisible provides a function to set visible of a single column by given\n// worksheet name and column name. For example, hide column D in Sheet1:\n//\n// xlsx.SetColVisible(\"Sheet1\", \"D\", false)\n//\nfunc (f *File) SetColVisible(sheet, column string, visible bool) {\n\txlsx := f.workSheetReader(sheet)\n\tc := TitleToNumber(strings.ToUpper(column)) + 1\n\tcol := xlsxCol{\n\t\tMin: c,\n\t\tMax: c,\n\t\tHidden: !visible,\n\t\tCustomWidth: true,\n\t}\n\tif xlsx.Cols == nil {\n\t\tcols := xlsxCols{}\n\t\tcols.Col = append(cols.Col, col)\n\t\txlsx.Cols = &cols\n\t\treturn\n\t}\n\tfor v := range xlsx.Cols.Col {\n\t\tif xlsx.Cols.Col[v].Min <= c && c <= xlsx.Cols.Col[v].Max {\n\t\t\tcol = xlsx.Cols.Col[v]\n\t\t}\n\t}\n\tcol.Min = c\n\tcol.Max = c\n\tcol.Hidden = !visible\n\tcol.CustomWidth = true\n\txlsx.Cols.Col = append(xlsx.Cols.Col, col)\n}\n\n// GetColOutlineLevel provides a function to get outline level of a single\n// column by given worksheet name and column name. For example, get outline\n// level of column D in Sheet1:\n//\n// xlsx.GetColOutlineLevel(\"Sheet1\", \"D\")\n//\nfunc (f *File) GetColOutlineLevel(sheet, column string) uint8 {\n\txlsx := f.workSheetReader(sheet)\n\tcol := TitleToNumber(strings.ToUpper(column)) + 1\n\tlevel := uint8(0)\n\tif xlsx.Cols == nil {\n\t\treturn level\n\t}\n\tfor c := range xlsx.Cols.Col {\n\t\tif xlsx.Cols.Col[c].Min <= col && col <= xlsx.Cols.Col[c].Max {\n\t\t\tlevel = xlsx.Cols.Col[c].OutlineLevel\n\t\t}\n\t}\n\treturn level\n}\n\n// SetColOutlineLevel provides a function to set outline level of a single\n// column by given worksheet name and column name. For example, set outline\n// level of column D in Sheet1 to 2:\n//\n// xlsx.SetColOutlineLevel(\"Sheet1\", \"D\", 2)\n//\nfunc (f *File) SetColOutlineLevel(sheet, column string, level uint8) {\n\txlsx := f.workSheetReader(sheet)\n\tc := TitleToNumber(strings.ToUpper(column)) + 1\n\tcol := xlsxCol{\n\t\tMin: c,\n\t\tMax: c,\n\t\tOutlineLevel: level,\n\t\tCustomWidth: true,\n\t}\n\tif xlsx.Cols == nil {\n\t\tcols := xlsxCols{}\n\t\tcols.Col = append(cols.Col, col)\n\t\txlsx.Cols = &cols\n\t\treturn\n\t}\n\tfor v := range xlsx.Cols.Col {\n\t\tif xlsx.Cols.Col[v].Min <= c && c <= xlsx.Cols.Col[v].Max {\n\t\t\tcol = xlsx.Cols.Col[v]\n\t\t}\n\t}\n\tcol.Min = c\n\tcol.Max = c\n\tcol.OutlineLevel = level\n\tcol.CustomWidth = true\n\txlsx.Cols.Col = append(xlsx.Cols.Col, col)\n}\n\n// SetColWidth provides function to set the width of a single column or multiple\n// columns. For example:\n//\n// xlsx := excelize.NewFile()\n// xlsx.SetColWidth(\"Sheet1\", \"A\", \"H\", 20)\n// err := xlsx.Save()\n// if err != nil {\n// fmt.Println(err)\n// }\n//\nfunc (f *File) SetColWidth(sheet, startcol, endcol string, width float64) {\n\tmin := TitleToNumber(strings.ToUpper(startcol)) + 1\n\tmax := TitleToNumber(strings.ToUpper(endcol)) + 1\n\tif min > max {\n\t\tmin, max = max, min\n\t}\n\txlsx := f.workSheetReader(sheet)\n\tcol := xlsxCol{\n\t\tMin: min,\n\t\tMax: max,\n\t\tWidth: width,\n\t\tCustomWidth: true,\n\t}\n\tif xlsx.Cols != nil {\n\t\txlsx.Cols.Col = append(xlsx.Cols.Col, col)\n\t} else {\n\t\tcols := xlsxCols{}\n\t\tcols.Col = append(cols.Col, col)\n\t\txlsx.Cols = &cols\n\t}\n}\n\n// positionObjectPixels calculate the vertices that define the position of a\n// graphical object within the worksheet in pixels.\n//\n// +------------+------------+\n// | A | B |\n// +-----+------------+------------+\n// | |(x1,y1) | |\n// | 1 |(A1)._______|______ |\n// | | | | |\n// | | | | |\n// +-----+----| OBJECT |-----+\n// | | | | |\n// | 2 | |______________. |\n// | | | (B2)|\n// | | | (x2,y2)|\n// +-----+------------+------------+\n//\n// Example of an object that covers some of the area from cell A1 to B2.\n//\n// Based on the width and height of the object we need to calculate 8 vars:\n//\n// colStart, rowStart, colEnd, rowEnd, x1, y1, x2, y2.\n//\n// We also calculate the absolute x and y position of the top left vertex of\n// the object. This is required for images.\n//\n// The width and height of the cells that the object occupies can be\n// variable and have to be taken into account.\n//\n// The values of col_start and row_start are passed in from the calling\n// function. The values of col_end and row_end are calculated by\n// subtracting the width and height of the object from the width and\n// height of the underlying cells.\n//\n// colStart # Col containing upper left corner of object.\n// x1 # Distance to left side of object.\n//\n// rowStart # Row containing top left corner of object.\n// y1 # Distance to top of object.\n//\n// colEnd # Col containing lower right corner of object.\n// x2 # Distance to right side of object.\n//\n// rowEnd # Row containing bottom right corner of object.\n// y2 # Distance to bottom of object.\n//\n// width # Width of object frame.\n// height # Height of object frame.\n//\n// xAbs # Absolute distance to left side of object.\n// yAbs # Absolute distance to top side of object.\n//\nfunc (f *File) positionObjectPixels(sheet string, colStart, rowStart, x1, y1, width, height int) (int, int, int, int, int, int, int, int) {\n\txAbs := 0\n\tyAbs := 0\n\n\t// Calculate the absolute x offset of the top-left vertex.\n\tfor colID := 1; colID <= colStart; colID++ {\n\t\txAbs += f.getColWidth(sheet, colID)\n\t}\n\txAbs += x1\n\n\t// Calculate the absolute y offset of the top-left vertex.\n\t// Store the column change to allow optimisations.\n\tfor rowID := 1; rowID <= rowStart; rowID++ {\n\t\tyAbs += f.getRowHeight(sheet, rowID)\n\t}\n\tyAbs += y1\n\n\t// Adjust start column for offsets that are greater than the col width.\n\tfor x1 >= f.getColWidth(sheet, colStart) {\n\t\tx1 -= f.getColWidth(sheet, colStart)\n\t\tcolStart++\n\t}\n\n\t// Adjust start row for offsets that are greater than the row height.\n\tfor y1 >= f.getRowHeight(sheet, rowStart) {\n\t\ty1 -= f.getRowHeight(sheet, rowStart)\n\t\trowStart++\n\t}\n\n\t// Initialise end cell to the same as the start cell.\n\tcolEnd := colStart\n\trowEnd := rowStart\n\n\twidth += x1\n\theight += y1\n\n\t// Subtract the underlying cell widths to find end cell of the object.\n\tfor width >= f.getColWidth(sheet, colEnd) {\n\t\tcolEnd++\n\t\twidth -= f.getColWidth(sheet, colEnd)\n\t}\n\n\t// Subtract the underlying cell heights to find end cell of the object.\n\tfor height >= f.getRowHeight(sheet, rowEnd) {\n\t\trowEnd++\n\t\theight -= f.getRowHeight(sheet, rowEnd)\n\t}\n\n\t// The end vertices are whatever is left from the width and height.\n\tx2 := width\n\ty2 := height\n\treturn colStart, rowStart, xAbs, yAbs, colEnd, rowEnd, x2, y2\n}\n\n// getColWidth provides function to get column width in pixels by given sheet\n// name and column index.\nfunc (f *File) getColWidth(sheet string, col int) int {\n\txlsx := f.workSheetReader(sheet)\n\tif xlsx.Cols != nil {\n\t\tvar width float64\n\t\tfor _, v := range xlsx.Cols.Col {\n\t\t\tif v.Min <= col && col <= v.Max {\n\t\t\t\twidth = v.Width\n\t\t\t}\n\t\t}\n\t\tif width != 0 {\n\t\t\treturn int(convertColWidthToPixels(width))\n\t\t}\n\t}\n\t// Optimisation for when the column widths haven't changed.\n\treturn int(defaultColWidthPixels)\n}\n\n// GetColWidth provides function to get column width by given worksheet name and\n// column index.\nfunc (f *File) GetColWidth(sheet, column string) float64 {\n\tcol := TitleToNumber(strings.ToUpper(column)) + 1\n\txlsx := f.workSheetReader(sheet)\n\tif xlsx.Cols != nil {\n\t\tvar width float64\n\t\tfor _, v := range xlsx.Cols.Col {\n\t\t\tif v.Min <= col && col <= v.Max {\n\t\t\t\twidth = v.Width\n\t\t\t}\n\t\t}\n\t\tif width != 0 {\n\t\t\treturn width\n\t\t}\n\t}\n\t// Optimisation for when the column widths haven't changed.\n\treturn defaultColWidthPixels\n}\n\n// InsertCol provides function to insert a new column before given column index.\n// For example, create a new column before column C in Sheet1:\n//\n// xlsx.InsertCol(\"Sheet1\", \"C\")\n//\nfunc (f *File) InsertCol(sheet, column string) {\n\tcol := TitleToNumber(strings.ToUpper(column))\n\tf.adjustHelper(sheet, col, -1, 1)\n}\n\n// RemoveCol provides function to remove single column by given worksheet name\n// and column index. For example, remove column C in Sheet1:\n//\n// xlsx.RemoveCol(\"Sheet1\", \"C\")\n//\nfunc (f *File) RemoveCol(sheet, column string) {\n\txlsx := f.workSheetReader(sheet)\n\tfor r := range xlsx.SheetData.Row {\n\t\tfor k, v := range xlsx.SheetData.Row[r].C {\n\t\t\taxis := v.R\n\t\t\tcol := string(strings.Map(letterOnlyMapF, axis))\n\t\t\tif col == column {\n\t\t\t\txlsx.SheetData.Row[r].C = append(xlsx.SheetData.Row[r].C[:k], xlsx.SheetData.Row[r].C[k+1:]...)\n\t\t\t}\n\t\t}\n\t}\n\tcol := TitleToNumber(strings.ToUpper(column))\n\tf.adjustHelper(sheet, col, -1, -1)\n}\n\n// Completion column element tags of XML in a sheet.\nfunc completeCol(xlsx *xlsxWorksheet, row, cell int) {\n\tbuffer := bytes.Buffer{}\n\tfor r := range xlsx.SheetData.Row {\n\t\tif len(xlsx.SheetData.Row[r].C) < cell {\n\t\t\tstart := len(xlsx.SheetData.Row[r].C)\n\t\t\tfor iii := start; iii < cell; iii++ {\n\t\t\t\tbuffer.WriteString(ToAlphaString(iii))\n\t\t\t\tbuffer.WriteString(strconv.Itoa(r + 1))\n\t\t\t\txlsx.SheetData.Row[r].C = append(xlsx.SheetData.Row[r].C, xlsxC{\n\t\t\t\t\tR: buffer.String(),\n\t\t\t\t})\n\t\t\t\tbuffer.Reset()\n\t\t\t}\n\t\t}\n\t}\n}\n\n// convertColWidthToPixels provieds function to convert the width of a cell from\n// user's units to pixels. Excel rounds the column width to the nearest pixel.\n// If the width hasn't been set by the user we use the default value. If the\n// column is hidden it has a value of zero.\nfunc convertColWidthToPixels(width float64) float64 {\n\tvar padding float64 = 5\n\tvar pixels float64\n\tvar maxDigitWidth float64 = 7\n\tif width == 0 {\n\t\treturn pixels\n\t}\n\tif width < 1 {\n\t\tpixels = (width * 12) + 0.5\n\t\treturn math.Ceil(pixels)\n\t}\n\tpixels = (width*maxDigitWidth + 0.5) + padding\n\treturn math.Ceil(pixels)\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/comment.go", "content": "package excelize\n\nimport (\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// parseFormatCommentsSet provides function to parse the format settings of the\n// comment with default value.\nfunc parseFormatCommentsSet(formatSet string) (*formatComment, error) {\n\tformat := formatComment{\n\t\tAuthor: \"Author:\",\n\t\tText: \" \",\n\t}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AddComment provides the method to add comment in a sheet by given worksheet\n// index, cell and format set (such as author and text). Note that the max\n// author length is 255 and the max text length is 32512. For example, add a\n// comment in Sheet1!$A$30:\n//\n// xlsx.AddComment(\"Sheet1\", \"A30\", `{\"author\":\"Excelize: \",\"text\":\"This is a comment.\"}`)\n//\nfunc (f *File) AddComment(sheet, cell, format string) error {\n\tformatSet, err := parseFormatCommentsSet(format)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// Read sheet data.\n\txlsx := f.workSheetReader(sheet)\n\tcommentID := f.countComments() + 1\n\tdrawingVML := \"xl/drawings/vmlDrawing\" + strconv.Itoa(commentID) + \".vml\"\n\tsheetRelationshipsComments := \"../comments\" + strconv.Itoa(commentID) + \".xml\"\n\tsheetRelationshipsDrawingVML := \"../drawings/vmlDrawing\" + strconv.Itoa(commentID) + \".vml\"\n\tif xlsx.LegacyDrawing != nil {\n\t\t// The worksheet already has a comments relationships, use the relationships drawing ../drawings/vmlDrawing%d.vml.\n\t\tsheetRelationshipsDrawingVML = f.getSheetRelationshipsTargetByID(sheet, xlsx.LegacyDrawing.RID)\n\t\tcommentID, _ = strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(sheetRelationshipsDrawingVML, \"../drawings/vmlDrawing\"), \".vml\"))\n\t\tdrawingVML = strings.Replace(sheetRelationshipsDrawingVML, \"..\", \"xl\", -1)\n\t} else {\n\t\t// Add first comment for given sheet.\n\t\trID := f.addSheetRelationships(sheet, SourceRelationshipDrawingVML, sheetRelationshipsDrawingVML, \"\")\n\t\tf.addSheetRelationships(sheet, SourceRelationshipComments, sheetRelationshipsComments, \"\")\n\t\tf.addSheetLegacyDrawing(sheet, rID)\n\t}\n\tcommentsXML := \"xl/comments\" + strconv.Itoa(commentID) + \".xml\"\n\tf.addComment(commentsXML, cell, formatSet)\n\tf.addDrawingVML(commentID, drawingVML, cell)\n\tf.addContentTypePart(commentID, \"comments\")\n\treturn err\n}\n\n// addDrawingVML provides function to create comment as\n// xl/drawings/vmlDrawing%d.vml by given commit ID and cell.\nfunc (f *File) addDrawingVML(commentID int, drawingVML, cell string) {\n\tcol := string(strings.Map(letterOnlyMapF, cell))\n\trow, _ := strconv.Atoi(strings.Map(intOnlyMapF, cell))\n\txAxis := row - 1\n\tyAxis := TitleToNumber(col)\n\tvml := vmlDrawing{\n\t\tXMLNSv: \"urn:schemas-microsoft-com:vml\",\n\t\tXMLNSo: \"urn:schemas-microsoft-com:office:office\",\n\t\tXMLNSx: \"urn:schemas-microsoft-com:office:excel\",\n\t\tXMLNSmv: \"http://macVmlSchemaUri\",\n\t\tShapelayout: &xlsxShapelayout{\n\t\t\tExt: \"edit\",\n\t\t\tIDmap: &xlsxIDmap{\n\t\t\t\tExt: \"edit\",\n\t\t\t\tData: commentID,\n\t\t\t},\n\t\t},\n\t\tShapetype: &xlsxShapetype{\n\t\t\tID: \"_x0000_t202\",\n\t\t\tCoordsize: \"21600,21600\",\n\t\t\tSpt: 202,\n\t\t\tPath: \"m0,0l0,21600,21600,21600,21600,0xe\",\n\t\t\tStroke: &xlsxStroke{\n\t\t\t\tJoinstyle: \"miter\",\n\t\t\t},\n\t\t\tVPath: &vPath{\n\t\t\t\tGradientshapeok: \"t\",\n\t\t\t\tConnecttype: \"rect\",\n\t\t\t},\n\t\t},\n\t}\n\tsp := encodeShape{\n\t\tFill: &vFill{\n\t\t\tColor2: \"#fbfe82\",\n\t\t\tAngle: -180,\n\t\t\tType: \"gradient\",\n\t\t\tFill: &oFill{\n\t\t\t\tExt: \"view\",\n\t\t\t\tType: \"gradientUnscaled\",\n\t\t\t},\n\t\t},\n\t\tShadow: &vShadow{\n\t\t\tOn: \"t\",\n\t\t\tColor: \"black\",\n\t\t\tObscured: \"t\",\n\t\t},\n\t\tPath: &vPath{\n\t\t\tConnecttype: \"none\",\n\t\t},\n\t\tTextbox: &vTextbox{\n\t\t\tStyle: \"mso-direction-alt:auto\",\n\t\t\tDiv: &xlsxDiv{\n\t\t\t\tStyle: \"text-align:left\",\n\t\t\t},\n\t\t},\n\t\tClientData: &xClientData{\n\t\t\tObjectType: \"Note\",\n\t\t\tAnchor: \"3, 15, 8, 6, 4, 54, 13, 2\",\n\t\t\tAutoFill: \"False\",\n\t\t\tRow: xAxis,\n\t\t\tColumn: yAxis,\n\t\t},\n\t}\n\ts, _ := xml.Marshal(sp)\n\tshape := xlsxShape{\n\t\tID: \"_x0000_s1025\",\n\t\tType: \"#_x0000_t202\",\n\t\tStyle: \"position:absolute;73.5pt;width:108pt;height:59.25pt;z-index:1;visibility:hidden\",\n\t\tFillcolor: \"#fbf6d6\",\n\t\tStrokecolor: \"#edeaa1\",\n\t\tVal: string(s[13 : len(s)-14]),\n\t}\n\tc, ok := f.XLSX[drawingVML]\n\tif ok {\n\t\td := decodeVmlDrawing{}\n\t\t_ = xml.Unmarshal([]byte(c), &d)\n\t\tfor _, v := range d.Shape {\n\t\t\ts := xlsxShape{\n\t\t\t\tID: \"_x0000_s1025\",\n\t\t\t\tType: \"#_x0000_t202\",\n\t\t\t\tStyle: \"position:absolute;73.5pt;width:108pt;height:59.25pt;z-index:1;visibility:hidden\",\n\t\t\t\tFillcolor: \"#fbf6d6\",\n\t\t\t\tStrokecolor: \"#edeaa1\",\n\t\t\t\tVal: v.Val,\n\t\t\t}\n\t\t\tvml.Shape = append(vml.Shape, s)\n\t\t}\n\t}\n\tvml.Shape = append(vml.Shape, shape)\n\tv, _ := xml.Marshal(vml)\n\tf.XLSX[drawingVML] = v\n}\n\n// addComment provides function to create chart as xl/comments%d.xml by given\n// cell and format sets.\nfunc (f *File) addComment(commentsXML, cell string, formatSet *formatComment) {\n\ta := formatSet.Author\n\tt := formatSet.Text\n\tif len(a) > 255 {\n\t\ta = a[0:255]\n\t}\n\tif len(t) > 32512 {\n\t\tt = t[0:32512]\n\t}\n\tcomments := xlsxComments{\n\t\tAuthors: []xlsxAuthor{\n\t\t\t{\n\t\t\t\tAuthor: formatSet.Author,\n\t\t\t},\n\t\t},\n\t}\n\tcmt := xlsxComment{\n\t\tRef: cell,\n\t\tAuthorID: 0,\n\t\tText: xlsxText{\n\t\t\tR: []xlsxR{\n\t\t\t\t{\n\t\t\t\t\tRPr: &xlsxRPr{\n\t\t\t\t\t\tB: \" \",\n\t\t\t\t\t\tSz: &attrValFloat{Val: 9},\n\t\t\t\t\t\tColor: &xlsxColor{\n\t\t\t\t\t\t\tIndexed: 81,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tRFont: &attrValString{Val: \"Calibri\"},\n\t\t\t\t\t\tFamily: &attrValInt{Val: 2},\n\t\t\t\t\t},\n\t\t\t\t\tT: a,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tRPr: &xlsxRPr{\n\t\t\t\t\t\tSz: &attrValFloat{Val: 9},\n\t\t\t\t\t\tColor: &xlsxColor{\n\t\t\t\t\t\t\tIndexed: 81,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tRFont: &attrValString{Val: \"Calibri\"},\n\t\t\t\t\t\tFamily: &attrValInt{Val: 2},\n\t\t\t\t\t},\n\t\t\t\t\tT: t,\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}\n\tc, ok := f.XLSX[commentsXML]\n\tif ok {\n\t\td := xlsxComments{}\n\t\t_ = xml.Unmarshal([]byte(c), &d)\n\t\tcomments.CommentList.Comment = append(comments.CommentList.Comment, d.CommentList.Comment...)\n\t}\n\tcomments.CommentList.Comment = append(comments.CommentList.Comment, cmt)\n\tv, _ := xml.Marshal(comments)\n\tf.saveFileList(commentsXML, v)\n}\n\n// countComments provides function to get comments files count storage in the\n// folder xl.\nfunc (f *File) countComments() int {\n\tcount := 0\n\tfor k := range f.XLSX {\n\t\tif strings.Contains(k, \"xl/comments\") {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/date.go", "content": "package excelize\n\nimport (\n\t\"math\"\n\t\"time\"\n)\n\n// timeLocationUTC defined the UTC time location.\nvar timeLocationUTC, _ = time.LoadLocation(\"UTC\")\n\n// timeToUTCTime provides function to convert time to UTC time.\nfunc timeToUTCTime(t time.Time) time.Time {\n\treturn time.Date(t.Year(), t.Month(), t.Day(), t.Hour(), t.Minute(), t.Second(), t.Nanosecond(), timeLocationUTC)\n}\n\n// timeToExcelTime provides function to convert time to Excel time.\nfunc timeToExcelTime(t time.Time) float64 {\n\treturn float64(t.UnixNano())/8.64e13 + 25569.0\n}\n\n// shiftJulianToNoon provides function to process julian date to noon.\nfunc shiftJulianToNoon(julianDays, julianFraction float64) (float64, float64) {\n\tswitch {\n\tcase -0.5 < julianFraction && julianFraction < 0.5:\n\t\tjulianFraction += 0.5\n\tcase julianFraction >= 0.5:\n\t\tjulianDays++\n\t\tjulianFraction -= 0.5\n\tcase julianFraction <= -0.5:\n\t\tjulianDays--\n\t\tjulianFraction += 1.5\n\t}\n\treturn julianDays, julianFraction\n}\n\n// fractionOfADay provides function to return the integer values for hour,\n// minutes, seconds and nanoseconds that comprised a given fraction of a day.\n// values would round to 1 us.\nfunc fractionOfADay(fraction float64) (hours, minutes, seconds, nanoseconds int) {\n\n\tconst (\n\t\tc1us = 1e3\n\t\tc1s = 1e9\n\t\tc1day = 24 * 60 * 60 * c1s\n\t)\n\n\tfrac := int64(c1day*fraction + c1us/2)\n\tnanoseconds = int((frac%c1s)/c1us) * c1us\n\tfrac /= c1s\n\tseconds = int(frac % 60)\n\tfrac /= 60\n\tminutes = int(frac % 60)\n\thours = int(frac / 60)\n\treturn\n}\n\n// julianDateToGregorianTime provides function to convert julian date to\n// gregorian time.\nfunc julianDateToGregorianTime(part1, part2 float64) time.Time {\n\tpart1I, part1F := math.Modf(part1)\n\tpart2I, part2F := math.Modf(part2)\n\tjulianDays := part1I + part2I\n\tjulianFraction := part1F + part2F\n\tjulianDays, julianFraction = shiftJulianToNoon(julianDays, julianFraction)\n\tday, month, year := doTheFliegelAndVanFlandernAlgorithm(int(julianDays))\n\thours, minutes, seconds, nanoseconds := fractionOfADay(julianFraction)\n\treturn time.Date(year, time.Month(month), day, hours, minutes, seconds, nanoseconds, time.UTC)\n}\n\n// By this point generations of programmers have repeated the algorithm sent to\n// the editor of \"Communications of the ACM\" in 1968 (published in CACM, volume\n// 11, number 10, October 1968, p.657). None of those programmers seems to have\n// found it necessary to explain the constants or variable names set out by\n// Henry F. Fliegel and Thomas C. Van Flandern. Maybe one day I'll buy that\n// jounal and expand an explanation here - that day is not today.\nfunc doTheFliegelAndVanFlandernAlgorithm(jd int) (day, month, year int) {\n\tl := jd + 68569\n\tn := (4 * l) / 146097\n\tl = l - (146097*n+3)/4\n\ti := (4000 * (l + 1)) / 1461001\n\tl = l - (1461*i)/4 + 31\n\tj := (80 * l) / 2447\n\td := l - (2447*j)/80\n\tl = j / 11\n\tm := j + 2 - (12 * l)\n\ty := 100*(n-49) + i + l\n\treturn d, m, y\n}\n\n// timeFromExcelTime provides function to convert an excelTime representation\n// (stored as a floating point number) to a time.Time.\nfunc timeFromExcelTime(excelTime float64, date1904 bool) time.Time {\n\tvar date time.Time\n\tvar intPart = int64(excelTime)\n\t// Excel uses Julian dates prior to March 1st 1900, and Gregorian\n\t// thereafter.\n\tif intPart <= 61 {\n\t\tconst OFFSET1900 = 15018.0\n\t\tconst OFFSET1904 = 16480.0\n\t\tconst MJD0 float64 = 2400000.5\n\t\tvar date time.Time\n\t\tif date1904 {\n\t\t\tdate = julianDateToGregorianTime(MJD0, excelTime+OFFSET1904)\n\t\t} else {\n\t\t\tdate = julianDateToGregorianTime(MJD0, excelTime+OFFSET1900)\n\t\t}\n\t\treturn date\n\t}\n\tvar floatPart = excelTime - float64(intPart)\n\tvar dayNanoSeconds float64 = 24 * 60 * 60 * 1000 * 1000 * 1000\n\tif date1904 {\n\t\tdate = time.Date(1904, 1, 1, 0, 0, 0, 0, time.UTC)\n\t} else {\n\t\tdate = time.Date(1899, 12, 30, 0, 0, 0, 0, time.UTC)\n\t}\n\tdurationDays := time.Duration(intPart) * time.Hour * 24\n\tdurationPart := time.Duration(dayNanoSeconds * floatPart)\n\treturn date.Add(durationDays).Add(durationPart)\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/excelize.go", "content": "package excelize\n\nimport (\n\t\"archive/zip\"\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// File define a populated XLSX file struct.\ntype File struct {\n\tchecked map[string]bool\n\tsheetMap map[string]string\n\tContentTypes *xlsxTypes\n\tPath string\n\tSharedStrings *xlsxSST\n\tSheet map[string]*xlsxWorksheet\n\tSheetCount int\n\tStyles *xlsxStyleSheet\n\tWorkBook *xlsxWorkbook\n\tWorkBookRels *xlsxWorkbookRels\n\tXLSX map[string][]byte\n}\n\n// OpenFile take the name of an XLSX file and returns a populated XLSX file\n// struct for it.\nfunc OpenFile(filename string) (*File, error) {\n\tfile, err := os.Open(filename)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer file.Close()\n\tf, err := OpenReader(file)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tf.Path = filename\n\treturn f, nil\n}\n\n// OpenReader take an io.Reader and return a populated XLSX file.\nfunc OpenReader(r io.Reader) (*File, error) {\n\tb, err := ioutil.ReadAll(r)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tzr, err := zip.NewReader(bytes.NewReader(b), int64(len(b)))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfile, sheetCount, err := ReadZipReader(zr)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tf := &File{\n\t\tchecked: make(map[string]bool),\n\t\tSheet: make(map[string]*xlsxWorksheet),\n\t\tSheetCount: sheetCount,\n\t\tXLSX: file,\n\t}\n\tf.sheetMap = f.getSheetMap()\n\tf.Styles = f.stylesReader()\n\treturn f, nil\n}\n\n// setDefaultTimeStyle provides function to set default numbers format for\n// time.Time type cell value by given worksheet name, cell coordinates and\n// number format code.\nfunc (f *File) setDefaultTimeStyle(sheet, axis string, format int) {\n\tif f.GetCellStyle(sheet, axis) == 0 {\n\t\tstyle, _ := f.NewStyle(`{\"number_format\": ` + strconv.Itoa(format) + `}`)\n\t\tf.SetCellStyle(sheet, axis, axis, style)\n\t}\n}\n\n// workSheetReader provides function to get the pointer to the structure after\n// deserialization by given worksheet name.\nfunc (f *File) workSheetReader(sheet string) *xlsxWorksheet {\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\tname = \"xl/worksheets/\" + strings.ToLower(sheet) + \".xml\"\n\t}\n\tif f.Sheet[name] == nil {\n\t\tvar xlsx xlsxWorksheet\n\t\t_ = xml.Unmarshal(f.readXML(name), &xlsx)\n\t\tif f.checked == nil {\n\t\t\tf.checked = make(map[string]bool)\n\t\t}\n\t\tok := f.checked[name]\n\t\tif !ok {\n\t\t\tcheckSheet(&xlsx)\n\t\t\tcheckRow(&xlsx)\n\t\t\tf.checked[name] = true\n\t\t}\n\t\tf.Sheet[name] = &xlsx\n\t}\n\treturn f.Sheet[name]\n}\n\n// checkSheet provides function to fill each row element and make that is\n// continuous in a worksheet of XML.\nfunc checkSheet(xlsx *xlsxWorksheet) {\n\trow := len(xlsx.SheetData.Row)\n\tif row >= 1 {\n\t\tlastRow := xlsx.SheetData.Row[row-1].R\n\t\tif lastRow >= row {\n\t\t\trow = lastRow\n\t\t}\n\t}\n\tsheetData := xlsxSheetData{}\n\texistsRows := map[int]int{}\n\tfor k := range xlsx.SheetData.Row {\n\t\texistsRows[xlsx.SheetData.Row[k].R] = k\n\t}\n\tfor i := 0; i < row; i++ {\n\t\t_, ok := existsRows[i+1]\n\t\tif ok {\n\t\t\tsheetData.Row = append(sheetData.Row, xlsx.SheetData.Row[existsRows[i+1]])\n\t\t} else {\n\t\t\tsheetData.Row = append(sheetData.Row, xlsxRow{\n\t\t\t\tR: i + 1,\n\t\t\t})\n\t\t}\n\t}\n\txlsx.SheetData = sheetData\n}\n\n// replaceWorkSheetsRelationshipsNameSpaceBytes provides function to replace\n// xl/worksheets/sheet%d.xml XML tags to self-closing for compatible Microsoft\n// Office Excel 2007.\nfunc replaceWorkSheetsRelationshipsNameSpaceBytes(workbookMarshal []byte) []byte {\n\tvar oldXmlns = []byte(``)\n\tvar newXmlns = []byte(``)\n\tworkbookMarshal = bytes.Replace(workbookMarshal, oldXmlns, newXmlns, -1)\n\treturn workbookMarshal\n}\n\n// UpdateLinkedValue fix linked values within a spreadsheet are not updating in\n// Office Excel 2007 and 2010. This function will be remove value tag when met a\n// cell have a linked value. Reference\n// https://social.technet.microsoft.com/Forums/office/en-US/e16bae1f-6a2c-4325-8013-e989a3479066/excel-2010-linked-cells-not-updating?forum=excel\n//\n// Notice: after open XLSX file Excel will be update linked value and generate\n// new value and will prompt save file or not.\n//\n// For example:\n//\n// \n// \n// SUM(Sheet2!D2,Sheet2!D11)\n// 100\n// \n// \n//\n// to\n//\n// \n// \n// SUM(Sheet2!D2,Sheet2!D11)\n// \n// \n//\nfunc (f *File) UpdateLinkedValue() {\n\tfor _, name := range f.GetSheetMap() {\n\t\txlsx := f.workSheetReader(name)\n\t\tfor indexR := range xlsx.SheetData.Row {\n\t\t\tfor indexC, col := range xlsx.SheetData.Row[indexR].C {\n\t\t\t\tif col.F != nil && col.V != \"\" {\n\t\t\t\t\txlsx.SheetData.Row[indexR].C[indexC].V = \"\"\n\t\t\t\t\txlsx.SheetData.Row[indexR].C[indexC].T = \"\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// adjustHelper provides function to adjust rows and columns dimensions,\n// hyperlinks, merged cells and auto filter when inserting or deleting rows or\n// columns.\n//\n// sheet: Worksheet name that we're editing\n// column: Index number of the column we're inserting/deleting before\n// row: Index number of the row we're inserting/deleting before\n// offset: Number of rows/column to insert/delete negative values indicate deletion\n//\n// TODO: adjustPageBreaks, adjustComments, adjustDataValidations, adjustProtectedCells\n//\nfunc (f *File) adjustHelper(sheet string, column, row, offset int) {\n\txlsx := f.workSheetReader(sheet)\n\tf.adjustRowDimensions(xlsx, row, offset)\n\tf.adjustColDimensions(xlsx, column, offset)\n\tf.adjustHyperlinks(sheet, column, row, offset)\n\tf.adjustMergeCells(xlsx, column, row, offset)\n\tf.adjustAutoFilter(xlsx, column, row, offset)\n\tcheckSheet(xlsx)\n\tcheckRow(xlsx)\n}\n\n// adjustColDimensions provides function to update column dimensions when\n// inserting or deleting rows or columns.\nfunc (f *File) adjustColDimensions(xlsx *xlsxWorksheet, column, offset int) {\n\tfor i, r := range xlsx.SheetData.Row {\n\t\tfor k, v := range r.C {\n\t\t\taxis := v.R\n\t\t\tcol := string(strings.Map(letterOnlyMapF, axis))\n\t\t\trow, _ := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\t\t\tyAxis := TitleToNumber(col)\n\t\t\tif yAxis >= column && column != -1 {\n\t\t\t\txlsx.SheetData.Row[i].C[k].R = ToAlphaString(yAxis+offset) + strconv.Itoa(row)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// adjustRowDimensions provides function to update row dimensions when inserting\n// or deleting rows or columns.\nfunc (f *File) adjustRowDimensions(xlsx *xlsxWorksheet, rowIndex, offset int) {\n\tif rowIndex == -1 {\n\t\treturn\n\t}\n\tfor i, r := range xlsx.SheetData.Row {\n\t\tif r.R >= rowIndex {\n\t\t\txlsx.SheetData.Row[i].R += offset\n\t\t\tfor k, v := range xlsx.SheetData.Row[i].C {\n\t\t\t\taxis := v.R\n\t\t\t\tcol := string(strings.Map(letterOnlyMapF, axis))\n\t\t\t\trow, _ := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\t\t\t\txAxis := row + offset\n\t\t\t\txlsx.SheetData.Row[i].C[k].R = col + strconv.Itoa(xAxis)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// adjustHyperlinks provides function to update hyperlinks when inserting or\n// deleting rows or columns.\nfunc (f *File) adjustHyperlinks(sheet string, column, rowIndex, offset int) {\n\txlsx := f.workSheetReader(sheet)\n\n\t// order is important\n\tif xlsx.Hyperlinks != nil && offset < 0 {\n\t\tfor i, v := range xlsx.Hyperlinks.Hyperlink {\n\t\t\taxis := v.Ref\n\t\t\tcol := string(strings.Map(letterOnlyMapF, axis))\n\t\t\trow, _ := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\t\t\tyAxis := TitleToNumber(col)\n\t\t\tif row == rowIndex || yAxis == column {\n\t\t\t\tf.deleteSheetRelationships(sheet, v.RID)\n\t\t\t\tif len(xlsx.Hyperlinks.Hyperlink) > 1 {\n\t\t\t\t\txlsx.Hyperlinks.Hyperlink = append(xlsx.Hyperlinks.Hyperlink[:i], xlsx.Hyperlinks.Hyperlink[i+1:]...)\n\t\t\t\t} else {\n\t\t\t\t\txlsx.Hyperlinks = nil\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif xlsx.Hyperlinks != nil {\n\t\tfor i, v := range xlsx.Hyperlinks.Hyperlink {\n\t\t\taxis := v.Ref\n\t\t\tcol := string(strings.Map(letterOnlyMapF, axis))\n\t\t\trow, _ := strconv.Atoi(strings.Map(intOnlyMapF, axis))\n\t\t\txAxis := row + offset\n\t\t\tyAxis := TitleToNumber(col)\n\t\t\tif rowIndex != -1 && row >= rowIndex {\n\t\t\t\txlsx.Hyperlinks.Hyperlink[i].Ref = col + strconv.Itoa(xAxis)\n\t\t\t}\n\t\t\tif column != -1 && yAxis >= column {\n\t\t\t\txlsx.Hyperlinks.Hyperlink[i].Ref = ToAlphaString(yAxis+offset) + strconv.Itoa(row)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// adjustMergeCellsHelper provides function to update merged cells when inserting or\n// deleting rows or columns.\nfunc (f *File) adjustMergeCellsHelper(xlsx *xlsxWorksheet, column, rowIndex, offset int) {\n\tif xlsx.MergeCells != nil {\n\t\tfor k, v := range xlsx.MergeCells.Cells {\n\t\t\tbeg := strings.Split(v.Ref, \":\")[0]\n\t\t\tend := strings.Split(v.Ref, \":\")[1]\n\n\t\t\tbegcol := string(strings.Map(letterOnlyMapF, beg))\n\t\t\tbegrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, beg))\n\t\t\tbegxAxis := begrow + offset\n\t\t\tbegyAxis := TitleToNumber(begcol)\n\n\t\t\tendcol := string(strings.Map(letterOnlyMapF, end))\n\t\t\tendrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, end))\n\t\t\tendxAxis := endrow + offset\n\t\t\tendyAxis := TitleToNumber(endcol)\n\n\t\t\tif rowIndex != -1 {\n\t\t\t\tif begrow > 1 && begrow >= rowIndex {\n\t\t\t\t\tbeg = begcol + strconv.Itoa(begxAxis)\n\t\t\t\t}\n\t\t\t\tif endrow > 1 && endrow >= rowIndex {\n\t\t\t\t\tend = endcol + strconv.Itoa(endxAxis)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif column != -1 {\n\t\t\t\tif begyAxis >= column {\n\t\t\t\t\tbeg = ToAlphaString(begyAxis+offset) + strconv.Itoa(endrow)\n\t\t\t\t}\n\t\t\t\tif endyAxis >= column {\n\t\t\t\t\tend = ToAlphaString(endyAxis+offset) + strconv.Itoa(endrow)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\txlsx.MergeCells.Cells[k].Ref = beg + \":\" + end\n\t\t}\n\t}\n}\n\n// adjustMergeCells provides function to update merged cells when inserting or\n// deleting rows or columns.\nfunc (f *File) adjustMergeCells(xlsx *xlsxWorksheet, column, rowIndex, offset int) {\n\tf.adjustMergeCellsHelper(xlsx, column, rowIndex, offset)\n\n\tif xlsx.MergeCells != nil && offset < 0 {\n\t\tfor k, v := range xlsx.MergeCells.Cells {\n\t\t\tbeg := strings.Split(v.Ref, \":\")[0]\n\t\t\tend := strings.Split(v.Ref, \":\")[1]\n\t\t\tif beg == end {\n\t\t\t\txlsx.MergeCells.Count += offset\n\t\t\t\tif len(xlsx.MergeCells.Cells) > 1 {\n\t\t\t\t\txlsx.MergeCells.Cells = append(xlsx.MergeCells.Cells[:k], xlsx.MergeCells.Cells[k+1:]...)\n\t\t\t\t} else {\n\t\t\t\t\txlsx.MergeCells = nil\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// adjustAutoFilter provides function to update the auto filter when inserting\n// or deleting rows or columns.\nfunc (f *File) adjustAutoFilter(xlsx *xlsxWorksheet, column, rowIndex, offset int) {\n\tf.adjustAutoFilterHelper(xlsx, column, rowIndex, offset)\n\n\tif xlsx.AutoFilter != nil {\n\t\tbeg := strings.Split(xlsx.AutoFilter.Ref, \":\")[0]\n\t\tend := strings.Split(xlsx.AutoFilter.Ref, \":\")[1]\n\n\t\tbegcol := string(strings.Map(letterOnlyMapF, beg))\n\t\tbegrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, beg))\n\t\tbegxAxis := begrow + offset\n\n\t\tendcol := string(strings.Map(letterOnlyMapF, end))\n\t\tendrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, end))\n\t\tendxAxis := endrow + offset\n\t\tendyAxis := TitleToNumber(endcol)\n\n\t\tif rowIndex != -1 {\n\t\t\tif begrow >= rowIndex {\n\t\t\t\tbeg = begcol + strconv.Itoa(begxAxis)\n\t\t\t}\n\t\t\tif endrow >= rowIndex {\n\t\t\t\tend = endcol + strconv.Itoa(endxAxis)\n\t\t\t}\n\t\t}\n\n\t\tif column != -1 && endyAxis >= column {\n\t\t\tend = ToAlphaString(endyAxis+offset) + strconv.Itoa(endrow)\n\t\t}\n\t\txlsx.AutoFilter.Ref = beg + \":\" + end\n\t}\n}\n\n// adjustAutoFilterHelper provides function to update the auto filter when\n// inserting or deleting rows or columns.\nfunc (f *File) adjustAutoFilterHelper(xlsx *xlsxWorksheet, column, rowIndex, offset int) {\n\tif xlsx.AutoFilter != nil {\n\t\tbeg := strings.Split(xlsx.AutoFilter.Ref, \":\")[0]\n\t\tend := strings.Split(xlsx.AutoFilter.Ref, \":\")[1]\n\n\t\tbegcol := string(strings.Map(letterOnlyMapF, beg))\n\t\tbegrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, beg))\n\t\tbegyAxis := TitleToNumber(begcol)\n\n\t\tendcol := string(strings.Map(letterOnlyMapF, end))\n\t\tendyAxis := TitleToNumber(endcol)\n\t\tendrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, end))\n\n\t\tif (begrow == rowIndex && offset < 0) || (column == begyAxis && column == endyAxis) {\n\t\t\txlsx.AutoFilter = nil\n\t\t\tfor i, r := range xlsx.SheetData.Row {\n\t\t\t\tif begrow < r.R && r.R <= endrow {\n\t\t\t\t\txlsx.SheetData.Row[i].Hidden = false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/file.go", "content": "package excelize\n\nimport (\n\t\"archive/zip\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n)\n\n// NewFile provides function to create new file by default template. For\n// example:\n//\n// xlsx := NewFile()\n//\nfunc NewFile() *File {\n\tfile := make(map[string][]byte)\n\tfile[\"_rels/.rels\"] = []byte(XMLHeader + templateRels)\n\tfile[\"docProps/app.xml\"] = []byte(XMLHeader + templateDocpropsApp)\n\tfile[\"docProps/core.xml\"] = []byte(XMLHeader + templateDocpropsCore)\n\tfile[\"xl/_rels/workbook.xml.rels\"] = []byte(XMLHeader + templateWorkbookRels)\n\tfile[\"xl/theme/theme1.xml\"] = []byte(XMLHeader + templateTheme)\n\tfile[\"xl/worksheets/sheet1.xml\"] = []byte(XMLHeader + templateSheet)\n\tfile[\"xl/styles.xml\"] = []byte(XMLHeader + templateStyles)\n\tfile[\"xl/workbook.xml\"] = []byte(XMLHeader + templateWorkbook)\n\tfile[\"[Content_Types].xml\"] = []byte(XMLHeader + templateContentTypes)\n\tf := &File{\n\t\tsheetMap: make(map[string]string),\n\t\tSheet: make(map[string]*xlsxWorksheet),\n\t\tSheetCount: 1,\n\t\tXLSX: file,\n\t}\n\tf.ContentTypes = f.contentTypesReader()\n\tf.Styles = f.stylesReader()\n\tf.WorkBook = f.workbookReader()\n\tf.WorkBookRels = f.workbookRelsReader()\n\tf.Sheet[\"xl/worksheets/sheet1.xml\"] = f.workSheetReader(\"Sheet1\")\n\tf.sheetMap[\"Sheet1\"] = \"xl/worksheets/sheet1.xml\"\n\treturn f\n}\n\n// Save provides function to override the xlsx file with origin path.\nfunc (f *File) Save() error {\n\tif f.Path == \"\" {\n\t\treturn fmt.Errorf(\"No path defined for file, consider File.WriteTo or File.Write\")\n\t}\n\treturn f.SaveAs(f.Path)\n}\n\n// SaveAs provides function to create or update to an xlsx file at the provided\n// path.\nfunc (f *File) SaveAs(name string) error {\n\tfile, err := os.OpenFile(name, os.O_WRONLY|os.O_TRUNC|os.O_CREATE, 0666)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer file.Close()\n\treturn f.Write(file)\n}\n\n// Write provides function to write to an io.Writer.\nfunc (f *File) Write(w io.Writer) error {\n\tbuf := new(bytes.Buffer)\n\tzw := zip.NewWriter(buf)\n\tf.contentTypesWriter()\n\tf.workbookWriter()\n\tf.workbookRelsWriter()\n\tf.worksheetWriter()\n\tf.styleSheetWriter()\n\tfor path, content := range f.XLSX {\n\t\tfi, err := zw.Create(path)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t_, err = fi.Write(content)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\terr := zw.Close()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif _, err := buf.WriteTo(w); err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/lib.go", "content": "package excelize\n\nimport (\n\t\"archive/zip\"\n\t\"bytes\"\n\t\"encoding/gob\"\n\t\"io\"\n\t\"log\"\n\t\"math\"\n\t\"unicode\"\n)\n\n// ReadZipReader can be used to read an XLSX in memory without touching the\n// filesystem.\nfunc ReadZipReader(r *zip.Reader) (map[string][]byte, int, error) {\n\tfileList := make(map[string][]byte)\n\tworksheets := 0\n\tfor _, v := range r.File {\n\t\tfileList[v.Name] = readFile(v)\n\t\tif len(v.Name) > 18 {\n\t\t\tif v.Name[0:19] == \"xl/worksheets/sheet\" {\n\t\t\t\tworksheets++\n\t\t\t}\n\t\t}\n\t}\n\treturn fileList, worksheets, nil\n}\n\n// readXML provides function to read XML content as string.\nfunc (f *File) readXML(name string) []byte {\n\tif content, ok := f.XLSX[name]; ok {\n\t\treturn content\n\t}\n\treturn []byte{}\n}\n\n// saveFileList provides function to update given file content in file list of\n// XLSX.\nfunc (f *File) saveFileList(name string, content []byte) {\n\tnewContent := make([]byte, 0, len(XMLHeader)+len(content))\n\tnewContent = append(newContent, []byte(XMLHeader)...)\n\tnewContent = append(newContent, content...)\n\tf.XLSX[name] = newContent\n}\n\n// Read file content as string in a archive file.\nfunc readFile(file *zip.File) []byte {\n\trc, err := file.Open()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tbuff := bytes.NewBuffer(nil)\n\t_, _ = io.Copy(buff, rc)\n\trc.Close()\n\treturn buff.Bytes()\n}\n\n// ToAlphaString provides function to convert integer to Excel sheet column\n// title. For example convert 36 to column title AK:\n//\n// excelize.ToAlphaString(36)\n//\nfunc ToAlphaString(value int) string {\n\tif value < 0 {\n\t\treturn \"\"\n\t}\n\tvar ans string\n\ti := value + 1\n\tfor i > 0 {\n\t\tans = string((i-1)%26+65) + ans\n\t\ti = (i - 1) / 26\n\t}\n\treturn ans\n}\n\n// TitleToNumber provides function to convert Excel sheet column title to int\n// (this function doesn't do value check currently). For example convert AK\n// and ak to column title 36:\n//\n// excelize.TitleToNumber(\"AK\")\n// excelize.TitleToNumber(\"ak\")\n//\nfunc TitleToNumber(s string) int {\n\tweight := 0.0\n\tsum := 0\n\tfor i := len(s) - 1; i >= 0; i-- {\n\t\tch := int(s[i])\n\t\tif int(s[i]) >= int('a') && int(s[i]) <= int('z') {\n\t\t\tch = int(s[i]) - 32\n\t\t}\n\t\tsum = sum + (ch-int('A')+1)*int(math.Pow(26, weight))\n\t\tweight++\n\t}\n\treturn sum - 1\n}\n\n// letterOnlyMapF is used in conjunction with strings.Map to return only the\n// characters A-Z and a-z in a string.\nfunc letterOnlyMapF(rune rune) rune {\n\tswitch {\n\tcase 'A' <= rune && rune <= 'Z':\n\t\treturn rune\n\tcase 'a' <= rune && rune <= 'z':\n\t\treturn rune - 32\n\t}\n\treturn -1\n}\n\n// intOnlyMapF is used in conjunction with strings.Map to return only the\n// numeric portions of a string.\nfunc intOnlyMapF(rune rune) rune {\n\tif rune >= 48 && rune < 58 {\n\t\treturn rune\n\t}\n\treturn -1\n}\n\n// deepCopy provides method to creates a deep copy of whatever is passed to it\n// and returns the copy in an interface. The returned value will need to be\n// asserted to the correct type.\nfunc deepCopy(dst, src interface{}) error {\n\tvar buf bytes.Buffer\n\tif err := gob.NewEncoder(&buf).Encode(src); err != nil {\n\t\treturn err\n\t}\n\treturn gob.NewDecoder(bytes.NewBuffer(buf.Bytes())).Decode(dst)\n}\n\n// boolPtr returns a pointer to a bool with the given value.\nfunc boolPtr(b bool) *bool { return &b }\n\n// defaultTrue returns true if b is nil, or the pointed value.\nfunc defaultTrue(b *bool) bool {\n\tif b == nil {\n\t\treturn true\n\t}\n\treturn *b\n}\n\n// axisLowerOrEqualThan returns true if axis1 <= axis2\n// axis1/axis2 can be either a column or a row axis, e.g. \"A\", \"AAE\", \"42\", \"1\", etc.\n//\n// For instance, the following comparisons are all true:\n//\n// \"A\" <= \"B\"\n// \"A\" <= \"AA\"\n// \"B\" <= \"AA\"\n// \"BC\" <= \"ABCD\" (in a XLSX sheet, the BC col comes before the ABCD col)\n// \"1\" <= \"2\"\n// \"2\" <= \"11\" (in a XLSX sheet, the row 2 comes before the row 11)\n// and so on\nfunc axisLowerOrEqualThan(axis1, axis2 string) bool {\n\tif len(axis1) < len(axis2) {\n\t\treturn true\n\t} else if len(axis1) > len(axis2) {\n\t\treturn false\n\t} else {\n\t\treturn axis1 <= axis2\n\t}\n}\n\n// getCellColRow returns the two parts of a cell identifier (its col and row) as strings\n//\n// For instance:\n//\n// \"C220\" => \"C\", \"220\"\n// \"aaef42\" => \"aaef\", \"42\"\n// \"\" => \"\", \"\"\nfunc getCellColRow(cell string) (col, row string) {\n\tfor index, rune := range cell {\n\t\tif unicode.IsDigit(rune) {\n\t\t\treturn cell[:index], cell[index:]\n\t\t}\n\n\t}\n\n\treturn cell, \"\"\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/picture.go", "content": "package excelize\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"image\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// parseFormatPictureSet provides function to parse the format settings of the\n// picture with default value.\nfunc parseFormatPictureSet(formatSet string) (*formatPicture, error) {\n\tformat := formatPicture{\n\t\tFPrintsWithSheet: true,\n\t\tFLocksWithSheet: false,\n\t\tNoChangeAspect: false,\n\t\tOffsetX: 0,\n\t\tOffsetY: 0,\n\t\tXScale: 1.0,\n\t\tYScale: 1.0,\n\t}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AddPicture provides the method to add picture in a sheet by given picture\n// format set (such as offset, scale, aspect ratio setting and print settings)\n// and file path. For example:\n//\n// package main\n//\n// import (\n// \"fmt\"\n// _ \"image/gif\"\n// _ \"image/jpeg\"\n// _ \"image/png\"\n//\n// \"github.com/360EntSecGroup-Skylar/excelize\"\n// )\n//\n// func main() {\n// xlsx := excelize.NewFile()\n// // Insert a picture.\n// err := xlsx.AddPicture(\"Sheet1\", \"A2\", \"./image1.jpg\", \"\")\n// if err != nil {\n// fmt.Println(err)\n// }\n// // Insert a picture scaling in the cell with location hyperlink.\n// err = xlsx.AddPicture(\"Sheet1\", \"D2\", \"./image1.png\", `{\"x_scale\": 0.5, \"y_scale\": 0.5, \"hyperlink\": \"#Sheet2!D8\", \"hyperlink_type\": \"Location\"}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// // Insert a picture offset in the cell with external hyperlink, printing and positioning support.\n// err = xlsx.AddPicture(\"Sheet1\", \"H2\", \"./image3.gif\", `{\"x_offset\": 15, \"y_offset\": 10, \"hyperlink\": \"https://github.com/360EntSecGroup-Skylar/excelize\", \"hyperlink_type\": \"External\", \"print_obj\": true, \"lock_aspect_ratio\": false, \"locked\": false, \"positioning\": \"oneCell\"}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// err = xlsx.SaveAs(\"./Book1.xlsx\")\n// if err != nil {\n// fmt.Println(err)\n// }\n// }\n//\n// LinkType defines two types of hyperlink \"External\" for web site or\n// \"Location\" for moving to one of cell in this workbook. When the\n// \"hyperlink_type\" is \"Location\", coordinates need to start with \"#\".\n//\n// Positioning defines two types of the position of a picture in an Excel\n// spreadsheet, \"oneCell\" (Move but don't size with cells) or \"absolute\"\n// (Don't move or size with cells). If you don't set this parameter, default\n// positioning is move and size with cells.\nfunc (f *File) AddPicture(sheet, cell, picture, format string) error {\n\tvar err error\n\tvar drawingHyperlinkRID int\n\tvar hyperlinkType string\n\t// Check picture exists first.\n\tif _, err = os.Stat(picture); os.IsNotExist(err) {\n\t\treturn err\n\t}\n\text, ok := supportImageTypes[path.Ext(picture)]\n\tif !ok {\n\t\treturn errors.New(\"Unsupported image extension\")\n\t}\n\treadFile, _ := os.Open(picture)\n\timage, _, _ := image.DecodeConfig(readFile)\n\t_, file := filepath.Split(picture)\n\tformatSet, err := parseFormatPictureSet(format)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// Read sheet data.\n\txlsx := f.workSheetReader(sheet)\n\t// Add first picture for given sheet, create xl/drawings/ and xl/drawings/_rels/ folder.\n\tdrawingID := f.countDrawings() + 1\n\tpictureID := f.countMedia() + 1\n\tdrawingXML := \"xl/drawings/drawing\" + strconv.Itoa(drawingID) + \".xml\"\n\tdrawingID, drawingXML = f.prepareDrawing(xlsx, drawingID, sheet, drawingXML)\n\tdrawingRID := f.addDrawingRelationships(drawingID, SourceRelationshipImage, \"../media/image\"+strconv.Itoa(pictureID)+ext, hyperlinkType)\n\t// Add picture with hyperlink.\n\tif formatSet.Hyperlink != \"\" && formatSet.HyperlinkType != \"\" {\n\t\tif formatSet.HyperlinkType == \"External\" {\n\t\t\thyperlinkType = formatSet.HyperlinkType\n\t\t}\n\t\tdrawingHyperlinkRID = f.addDrawingRelationships(drawingID, SourceRelationshipHyperLink, formatSet.Hyperlink, hyperlinkType)\n\t}\n\tf.addDrawingPicture(sheet, drawingXML, cell, file, image.Width, image.Height, drawingRID, drawingHyperlinkRID, formatSet)\n\tf.addMedia(picture, ext)\n\tf.addContentTypePart(drawingID, \"drawings\")\n\treturn err\n}\n\n// addSheetRelationships provides function to add\n// xl/worksheets/_rels/sheet%d.xml.rels by given worksheet name, relationship\n// type and target.\nfunc (f *File) addSheetRelationships(sheet, relType, target, targetMode string) int {\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\tname = strings.ToLower(sheet) + \".xml\"\n\t}\n\tvar rels = \"xl/worksheets/_rels/\" + strings.TrimPrefix(name, \"xl/worksheets/\") + \".rels\"\n\tvar sheetRels xlsxWorkbookRels\n\tvar rID = 1\n\tvar ID bytes.Buffer\n\tID.WriteString(\"rId\")\n\tID.WriteString(strconv.Itoa(rID))\n\t_, ok = f.XLSX[rels]\n\tif ok {\n\t\tID.Reset()\n\t\t_ = xml.Unmarshal([]byte(f.readXML(rels)), &sheetRels)\n\t\trID = len(sheetRels.Relationships) + 1\n\t\tID.WriteString(\"rId\")\n\t\tID.WriteString(strconv.Itoa(rID))\n\t}\n\tsheetRels.Relationships = append(sheetRels.Relationships, xlsxWorkbookRelation{\n\t\tID: ID.String(),\n\t\tType: relType,\n\t\tTarget: target,\n\t\tTargetMode: targetMode,\n\t})\n\toutput, _ := xml.Marshal(sheetRels)\n\tf.saveFileList(rels, output)\n\treturn rID\n}\n\n// deleteSheetRelationships provides function to delete relationships in\n// xl/worksheets/_rels/sheet%d.xml.rels by given worksheet name and relationship\n// index.\nfunc (f *File) deleteSheetRelationships(sheet, rID string) {\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\tname = strings.ToLower(sheet) + \".xml\"\n\t}\n\tvar rels = \"xl/worksheets/_rels/\" + strings.TrimPrefix(name, \"xl/worksheets/\") + \".rels\"\n\tvar sheetRels xlsxWorkbookRels\n\t_ = xml.Unmarshal([]byte(f.readXML(rels)), &sheetRels)\n\tfor k, v := range sheetRels.Relationships {\n\t\tif v.ID == rID {\n\t\t\tsheetRels.Relationships = append(sheetRels.Relationships[:k], sheetRels.Relationships[k+1:]...)\n\t\t}\n\t}\n\toutput, _ := xml.Marshal(sheetRels)\n\tf.saveFileList(rels, output)\n}\n\n// addSheetLegacyDrawing provides function to add legacy drawing element to\n// xl/worksheets/sheet%d.xml by given worksheet name and relationship index.\nfunc (f *File) addSheetLegacyDrawing(sheet string, rID int) {\n\txlsx := f.workSheetReader(sheet)\n\txlsx.LegacyDrawing = &xlsxLegacyDrawing{\n\t\tRID: \"rId\" + strconv.Itoa(rID),\n\t}\n}\n\n// addSheetDrawing provides function to add drawing element to\n// xl/worksheets/sheet%d.xml by given worksheet name and relationship index.\nfunc (f *File) addSheetDrawing(sheet string, rID int) {\n\txlsx := f.workSheetReader(sheet)\n\txlsx.Drawing = &xlsxDrawing{\n\t\tRID: \"rId\" + strconv.Itoa(rID),\n\t}\n}\n\n// addSheetPicture provides function to add picture element to\n// xl/worksheets/sheet%d.xml by given worksheet name and relationship index.\nfunc (f *File) addSheetPicture(sheet string, rID int) {\n\txlsx := f.workSheetReader(sheet)\n\txlsx.Picture = &xlsxPicture{\n\t\tRID: \"rId\" + strconv.Itoa(rID),\n\t}\n}\n\n// countDrawings provides function to get drawing files count storage in the\n// folder xl/drawings.\nfunc (f *File) countDrawings() int {\n\tcount := 0\n\tfor k := range f.XLSX {\n\t\tif strings.Contains(k, \"xl/drawings/drawing\") {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}\n\n// addDrawingPicture provides function to add picture by given sheet,\n// drawingXML, cell, file name, width, height relationship index and format\n// sets.\nfunc (f *File) addDrawingPicture(sheet, drawingXML, cell, file string, width, height, rID, hyperlinkRID int, formatSet *formatPicture) {\n\tcell = strings.ToUpper(cell)\n\tfromCol := string(strings.Map(letterOnlyMapF, cell))\n\tfromRow, _ := strconv.Atoi(strings.Map(intOnlyMapF, cell))\n\trow := fromRow - 1\n\tcol := TitleToNumber(fromCol)\n\twidth = int(float64(width) * formatSet.XScale)\n\theight = int(float64(height) * formatSet.YScale)\n\tcolStart, rowStart, _, _, colEnd, rowEnd, x2, y2 := f.positionObjectPixels(sheet, col, row, formatSet.OffsetX, formatSet.OffsetY, width, height)\n\tcontent := xlsxWsDr{}\n\tcontent.A = NameSpaceDrawingML\n\tcontent.Xdr = NameSpaceDrawingMLSpreadSheet\n\tcNvPrID := f.drawingParser(drawingXML, &content)\n\ttwoCellAnchor := xdrCellAnchor{}\n\ttwoCellAnchor.EditAs = formatSet.Positioning\n\tfrom := xlsxFrom{}\n\tfrom.Col = colStart\n\tfrom.ColOff = formatSet.OffsetX * EMU\n\tfrom.Row = rowStart\n\tfrom.RowOff = formatSet.OffsetY * EMU\n\tto := xlsxTo{}\n\tto.Col = colEnd\n\tto.ColOff = x2 * EMU\n\tto.Row = rowEnd\n\tto.RowOff = y2 * EMU\n\ttwoCellAnchor.From = &from\n\ttwoCellAnchor.To = &to\n\tpic := xlsxPic{}\n\tpic.NvPicPr.CNvPicPr.PicLocks.NoChangeAspect = formatSet.NoChangeAspect\n\tpic.NvPicPr.CNvPr.ID = f.countCharts() + f.countMedia() + 1\n\tpic.NvPicPr.CNvPr.Descr = file\n\tpic.NvPicPr.CNvPr.Name = \"Picture \" + strconv.Itoa(cNvPrID)\n\tif hyperlinkRID != 0 {\n\t\tpic.NvPicPr.CNvPr.HlinkClick = &xlsxHlinkClick{\n\t\t\tR: SourceRelationship,\n\t\t\tRID: \"rId\" + strconv.Itoa(hyperlinkRID),\n\t\t}\n\t}\n\tpic.BlipFill.Blip.R = SourceRelationship\n\tpic.BlipFill.Blip.Embed = \"rId\" + strconv.Itoa(rID)\n\tpic.SpPr.PrstGeom.Prst = \"rect\"\n\n\ttwoCellAnchor.Pic = &pic\n\ttwoCellAnchor.ClientData = &xdrClientData{\n\t\tFLocksWithSheet: formatSet.FLocksWithSheet,\n\t\tFPrintsWithSheet: formatSet.FPrintsWithSheet,\n\t}\n\tcontent.TwoCellAnchor = append(content.TwoCellAnchor, &twoCellAnchor)\n\toutput, _ := xml.Marshal(content)\n\tf.saveFileList(drawingXML, output)\n}\n\n// addDrawingRelationships provides function to add image part relationships in\n// the file xl/drawings/_rels/drawing%d.xml.rels by given drawing index,\n// relationship type and target.\nfunc (f *File) addDrawingRelationships(index int, relType, target, targetMode string) int {\n\tvar rels = \"xl/drawings/_rels/drawing\" + strconv.Itoa(index) + \".xml.rels\"\n\tvar drawingRels xlsxWorkbookRels\n\tvar rID = 1\n\tvar ID bytes.Buffer\n\tID.WriteString(\"rId\")\n\tID.WriteString(strconv.Itoa(rID))\n\t_, ok := f.XLSX[rels]\n\tif ok {\n\t\tID.Reset()\n\t\t_ = xml.Unmarshal([]byte(f.readXML(rels)), &drawingRels)\n\t\trID = len(drawingRels.Relationships) + 1\n\t\tID.WriteString(\"rId\")\n\t\tID.WriteString(strconv.Itoa(rID))\n\t}\n\tdrawingRels.Relationships = append(drawingRels.Relationships, xlsxWorkbookRelation{\n\t\tID: ID.String(),\n\t\tType: relType,\n\t\tTarget: target,\n\t\tTargetMode: targetMode,\n\t})\n\toutput, _ := xml.Marshal(drawingRels)\n\tf.saveFileList(rels, output)\n\treturn rID\n}\n\n// countMedia provides function to get media files count storage in the folder\n// xl/media/image.\nfunc (f *File) countMedia() int {\n\tcount := 0\n\tfor k := range f.XLSX {\n\t\tif strings.Contains(k, \"xl/media/image\") {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}\n\n// addMedia provides function to add picture into folder xl/media/image by given\n// file name and extension name.\nfunc (f *File) addMedia(file, ext string) {\n\tcount := f.countMedia()\n\tdat, _ := ioutil.ReadFile(file)\n\tmedia := \"xl/media/image\" + strconv.Itoa(count+1) + ext\n\tf.XLSX[media] = dat\n}\n\n// setContentTypePartImageExtensions provides function to set the content type\n// for relationship parts and the Main Document part.\nfunc (f *File) setContentTypePartImageExtensions() {\n\tvar imageTypes = map[string]bool{\"jpeg\": false, \"png\": false, \"gif\": false}\n\tcontent := f.contentTypesReader()\n\tfor _, v := range content.Defaults {\n\t\t_, ok := imageTypes[v.Extension]\n\t\tif ok {\n\t\t\timageTypes[v.Extension] = true\n\t\t}\n\t}\n\tfor k, v := range imageTypes {\n\t\tif !v {\n\t\t\tcontent.Defaults = append(content.Defaults, xlsxDefault{\n\t\t\t\tExtension: k,\n\t\t\t\tContentType: \"image/\" + k,\n\t\t\t})\n\t\t}\n\t}\n}\n\n// setContentTypePartVMLExtensions provides function to set the content type\n// for relationship parts and the Main Document part.\nfunc (f *File) setContentTypePartVMLExtensions() {\n\tvml := false\n\tcontent := f.contentTypesReader()\n\tfor _, v := range content.Defaults {\n\t\tif v.Extension == \"vml\" {\n\t\t\tvml = true\n\t\t}\n\t}\n\tif !vml {\n\t\tcontent.Defaults = append(content.Defaults, xlsxDefault{\n\t\t\tExtension: \"vml\",\n\t\t\tContentType: \"application/vnd.openxmlformats-officedocument.vmlDrawing\",\n\t\t})\n\t}\n}\n\n// addContentTypePart provides function to add content type part relationships\n// in the file [Content_Types].xml by given index.\nfunc (f *File) addContentTypePart(index int, contentType string) {\n\tsetContentType := map[string]func(){\n\t\t\"comments\": f.setContentTypePartVMLExtensions,\n\t\t\"drawings\": f.setContentTypePartImageExtensions,\n\t}\n\tpartNames := map[string]string{\n\t\t\"chart\": \"/xl/charts/chart\" + strconv.Itoa(index) + \".xml\",\n\t\t\"comments\": \"/xl/comments\" + strconv.Itoa(index) + \".xml\",\n\t\t\"drawings\": \"/xl/drawings/drawing\" + strconv.Itoa(index) + \".xml\",\n\t\t\"table\": \"/xl/tables/table\" + strconv.Itoa(index) + \".xml\",\n\t}\n\tcontentTypes := map[string]string{\n\t\t\"chart\": \"application/vnd.openxmlformats-officedocument.drawingml.chart+xml\",\n\t\t\"comments\": \"application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml\",\n\t\t\"drawings\": \"application/vnd.openxmlformats-officedocument.drawing+xml\",\n\t\t\"table\": \"application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml\",\n\t}\n\ts, ok := setContentType[contentType]\n\tif ok {\n\t\ts()\n\t}\n\tcontent := f.contentTypesReader()\n\tfor _, v := range content.Overrides {\n\t\tif v.PartName == partNames[contentType] {\n\t\t\treturn\n\t\t}\n\t}\n\tcontent.Overrides = append(content.Overrides, xlsxOverride{\n\t\tPartName: partNames[contentType],\n\t\tContentType: contentTypes[contentType],\n\t})\n}\n\n// getSheetRelationshipsTargetByID provides function to get Target attribute\n// value in xl/worksheets/_rels/sheet%d.xml.rels by given worksheet name and\n// relationship index.\nfunc (f *File) getSheetRelationshipsTargetByID(sheet, rID string) string {\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\tname = strings.ToLower(sheet) + \".xml\"\n\t}\n\tvar rels = \"xl/worksheets/_rels/\" + strings.TrimPrefix(name, \"xl/worksheets/\") + \".rels\"\n\tvar sheetRels xlsxWorkbookRels\n\t_ = xml.Unmarshal([]byte(f.readXML(rels)), &sheetRels)\n\tfor _, v := range sheetRels.Relationships {\n\t\tif v.ID == rID {\n\t\t\treturn v.Target\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// GetPicture provides function to get picture base name and raw content embed\n// in XLSX by given worksheet and cell name. This function returns the file name\n// in XLSX and file contents as []byte data types. For example:\n//\n// xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n// if err != nil {\n// fmt.Println(err)\n// return\n// }\n// file, raw := xlsx.GetPicture(\"Sheet1\", \"A2\")\n// if file == \"\" {\n// return\n// }\n// err := ioutil.WriteFile(file, raw, 0644)\n// if err != nil {\n// fmt.Println(err)\n// }\n//\nfunc (f *File) GetPicture(sheet, cell string) (string, []byte) {\n\txlsx := f.workSheetReader(sheet)\n\tif xlsx.Drawing == nil {\n\t\treturn \"\", []byte{}\n\t}\n\ttarget := f.getSheetRelationshipsTargetByID(sheet, xlsx.Drawing.RID)\n\tdrawingXML := strings.Replace(target, \"..\", \"xl\", -1)\n\n\t_, ok := f.XLSX[drawingXML]\n\tif !ok {\n\t\treturn \"\", nil\n\t}\n\tdecodeWsDr := decodeWsDr{}\n\t_ = xml.Unmarshal([]byte(f.readXML(drawingXML)), &decodeWsDr)\n\n\tcell = strings.ToUpper(cell)\n\tfromCol := string(strings.Map(letterOnlyMapF, cell))\n\tfromRow, _ := strconv.Atoi(strings.Map(intOnlyMapF, cell))\n\trow := fromRow - 1\n\tcol := TitleToNumber(fromCol)\n\n\tdrawingRelationships := strings.Replace(strings.Replace(target, \"../drawings\", \"xl/drawings/_rels\", -1), \".xml\", \".xml.rels\", -1)\n\n\tfor _, anchor := range decodeWsDr.TwoCellAnchor {\n\t\tdecodeTwoCellAnchor := decodeTwoCellAnchor{}\n\t\t_ = xml.Unmarshal([]byte(\"\"+anchor.Content+\"\"), &decodeTwoCellAnchor)\n\t\tif decodeTwoCellAnchor.From != nil && decodeTwoCellAnchor.Pic != nil {\n\t\t\tif decodeTwoCellAnchor.From.Col == col && decodeTwoCellAnchor.From.Row == row {\n\t\t\t\txlsxWorkbookRelation := f.getDrawingRelationships(drawingRelationships, decodeTwoCellAnchor.Pic.BlipFill.Blip.Embed)\n\t\t\t\t_, ok := supportImageTypes[filepath.Ext(xlsxWorkbookRelation.Target)]\n\t\t\t\tif ok {\n\t\t\t\t\treturn filepath.Base(xlsxWorkbookRelation.Target), []byte(f.XLSX[strings.Replace(xlsxWorkbookRelation.Target, \"..\", \"xl\", -1)])\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\", []byte{}\n}\n\n// getDrawingRelationships provides function to get drawing relationships from\n// xl/drawings/_rels/drawing%s.xml.rels by given file name and relationship ID.\nfunc (f *File) getDrawingRelationships(rels, rID string) *xlsxWorkbookRelation {\n\t_, ok := f.XLSX[rels]\n\tif !ok {\n\t\treturn nil\n\t}\n\tvar drawingRels xlsxWorkbookRels\n\t_ = xml.Unmarshal([]byte(f.readXML(rels)), &drawingRels)\n\tfor _, v := range drawingRels.Relationships {\n\t\tif v.ID == rID {\n\t\t\treturn &v\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/rows.go", "content": "package excelize\n\nimport (\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// GetRows return all the rows in a sheet by given worksheet name (case\n// sensitive). For example:\n//\n// for _, row := range xlsx.GetRows(\"Sheet1\") {\n// for _, colCell := range row {\n// fmt.Print(colCell, \"\\t\")\n// }\n// fmt.Println()\n// }\n//\nfunc (f *File) GetRows(sheet string) [][]string {\n\txlsx := f.workSheetReader(sheet)\n\trows := [][]string{}\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\treturn rows\n\t}\n\tif xlsx != nil {\n\t\toutput, _ := xml.Marshal(f.Sheet[name])\n\t\tf.saveFileList(name, replaceWorkSheetsRelationshipsNameSpaceBytes(output))\n\t}\n\txml.NewDecoder(bytes.NewReader(f.readXML(name)))\n\td := f.sharedStringsReader()\n\tvar inElement string\n\tvar r xlsxRow\n\tvar row []string\n\ttr, tc := f.getTotalRowsCols(name)\n\tfor i := 0; i < tr; i++ {\n\t\trow = []string{}\n\t\tfor j := 0; j <= tc; j++ {\n\t\t\trow = append(row, \"\")\n\t\t}\n\t\trows = append(rows, row)\n\t}\n\tdecoder := xml.NewDecoder(bytes.NewReader(f.readXML(name)))\n\tfor {\n\t\ttoken, _ := decoder.Token()\n\t\tif token == nil {\n\t\t\tbreak\n\t\t}\n\t\tswitch startElement := token.(type) {\n\t\tcase xml.StartElement:\n\t\t\tinElement = startElement.Name.Local\n\t\t\tif inElement == \"row\" {\n\t\t\t\tr = xlsxRow{}\n\t\t\t\t_ = decoder.DecodeElement(&r, &startElement)\n\t\t\t\tcr := r.R - 1\n\t\t\t\tfor _, colCell := range r.C {\n\t\t\t\t\tc := TitleToNumber(strings.Map(letterOnlyMapF, colCell.R))\n\t\t\t\t\tval, _ := colCell.getValueFrom(f, d)\n\t\t\t\t\trows[cr][c] = val\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t}\n\t}\n\treturn rows\n}\n\n// Rows defines an iterator to a sheet\ntype Rows struct {\n\tdecoder *xml.Decoder\n\ttoken xml.Token\n\terr error\n\tf *File\n}\n\n// Next will return true if find the next row element.\nfunc (rows *Rows) Next() bool {\n\tfor {\n\t\trows.token, rows.err = rows.decoder.Token()\n\t\tif rows.err == io.EOF {\n\t\t\trows.err = nil\n\t\t}\n\t\tif rows.token == nil {\n\t\t\treturn false\n\t\t}\n\n\t\tswitch startElement := rows.token.(type) {\n\t\tcase xml.StartElement:\n\t\t\tinElement := startElement.Name.Local\n\t\t\tif inElement == \"row\" {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t}\n}\n\n// Error will return the error when the find next row element\nfunc (rows *Rows) Error() error {\n\treturn rows.err\n}\n\n// Columns return the current row's column values\nfunc (rows *Rows) Columns() []string {\n\tif rows.token == nil {\n\t\treturn []string{}\n\t}\n\tstartElement := rows.token.(xml.StartElement)\n\tr := xlsxRow{}\n\t_ = rows.decoder.DecodeElement(&r, &startElement)\n\td := rows.f.sharedStringsReader()\n\trow := make([]string, len(r.C))\n\tfor _, colCell := range r.C {\n\t\tc := TitleToNumber(strings.Map(letterOnlyMapF, colCell.R))\n\t\tval, _ := colCell.getValueFrom(rows.f, d)\n\t\trow[c] = val\n\t}\n\treturn row\n}\n\n// ErrSheetNotExist defines an error of sheet is not exist\ntype ErrSheetNotExist struct {\n\tSheetName string\n}\n\nfunc (err ErrSheetNotExist) Error() string {\n\treturn fmt.Sprintf(\"Sheet %s is not exist\", string(err.SheetName))\n}\n\n// Rows return a rows iterator. For example:\n//\n// rows, err := xlsx.GetRows(\"Sheet1\")\n// for rows.Next() {\n// for _, colCell := range rows.Columns() {\n// fmt.Print(colCell, \"\\t\")\n// }\n// fmt.Println()\n// }\n//\nfunc (f *File) Rows(sheet string) (*Rows, error) {\n\txlsx := f.workSheetReader(sheet)\n\tname, ok := f.sheetMap[trimSheetName(sheet)]\n\tif !ok {\n\t\treturn nil, ErrSheetNotExist{sheet}\n\t}\n\tif xlsx != nil {\n\t\toutput, _ := xml.Marshal(f.Sheet[name])\n\t\tf.saveFileList(name, replaceWorkSheetsRelationshipsNameSpaceBytes(output))\n\t}\n\treturn &Rows{\n\t\tf: f,\n\t\tdecoder: xml.NewDecoder(bytes.NewReader(f.readXML(name))),\n\t}, nil\n}\n\n// getTotalRowsCols provides a function to get total columns and rows in a\n// worksheet.\nfunc (f *File) getTotalRowsCols(name string) (int, int) {\n\tdecoder := xml.NewDecoder(bytes.NewReader(f.readXML(name)))\n\tvar inElement string\n\tvar r xlsxRow\n\tvar tr, tc int\n\tfor {\n\t\ttoken, _ := decoder.Token()\n\t\tif token == nil {\n\t\t\tbreak\n\t\t}\n\t\tswitch startElement := token.(type) {\n\t\tcase xml.StartElement:\n\t\t\tinElement = startElement.Name.Local\n\t\t\tif inElement == \"row\" {\n\t\t\t\tr = xlsxRow{}\n\t\t\t\t_ = decoder.DecodeElement(&r, &startElement)\n\t\t\t\ttr = r.R\n\t\t\t\tfor _, colCell := range r.C {\n\t\t\t\t\tcol := TitleToNumber(strings.Map(letterOnlyMapF, colCell.R))\n\t\t\t\t\tif col > tc {\n\t\t\t\t\t\ttc = col\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t}\n\t}\n\treturn tr, tc\n}\n\n// SetRowHeight provides a function to set the height of a single row. For\n// example, set the height of the first row in Sheet1:\n//\n// xlsx.SetRowHeight(\"Sheet1\", 1, 50)\n//\nfunc (f *File) SetRowHeight(sheet string, row int, height float64) {\n\txlsx := f.workSheetReader(sheet)\n\tcells := 0\n\trowIdx := row - 1\n\tcompleteRow(xlsx, row, cells)\n\txlsx.SheetData.Row[rowIdx].Ht = height\n\txlsx.SheetData.Row[rowIdx].CustomHeight = true\n}\n\n// getRowHeight provides function to get row height in pixels by given sheet\n// name and row index.\nfunc (f *File) getRowHeight(sheet string, row int) int {\n\txlsx := f.workSheetReader(sheet)\n\tfor _, v := range xlsx.SheetData.Row {\n\t\tif v.R == row+1 && v.Ht != 0 {\n\t\t\treturn int(convertRowHeightToPixels(v.Ht))\n\t\t}\n\t}\n\t// Optimisation for when the row heights haven't changed.\n\treturn int(defaultRowHeightPixels)\n}\n\n// GetRowHeight provides function to get row height by given worksheet name\n// and row index. For example, get the height of the first row in Sheet1:\n//\n// xlsx.GetRowHeight(\"Sheet1\", 1)\n//\nfunc (f *File) GetRowHeight(sheet string, row int) float64 {\n\txlsx := f.workSheetReader(sheet)\n\tfor _, v := range xlsx.SheetData.Row {\n\t\tif v.R == row && v.Ht != 0 {\n\t\t\treturn v.Ht\n\t\t}\n\t}\n\t// Optimisation for when the row heights haven't changed.\n\treturn defaultRowHeightPixels\n}\n\n// sharedStringsReader provides function to get the pointer to the structure\n// after deserialization of xl/sharedStrings.xml.\nfunc (f *File) sharedStringsReader() *xlsxSST {\n\tif f.SharedStrings == nil {\n\t\tvar sharedStrings xlsxSST\n\t\tss := f.readXML(\"xl/sharedStrings.xml\")\n\t\tif len(ss) == 0 {\n\t\t\tss = f.readXML(\"xl/SharedStrings.xml\")\n\t\t}\n\t\t_ = xml.Unmarshal([]byte(ss), &sharedStrings)\n\t\tf.SharedStrings = &sharedStrings\n\t}\n\treturn f.SharedStrings\n}\n\n// getValueFrom return a value from a column/row cell, this function is inteded\n// to be used with for range on rows an argument with the xlsx opened file.\nfunc (xlsx *xlsxC) getValueFrom(f *File, d *xlsxSST) (string, error) {\n\tswitch xlsx.T {\n\tcase \"s\":\n\t\txlsxSI := 0\n\t\txlsxSI, _ = strconv.Atoi(xlsx.V)\n\t\tif len(d.SI[xlsxSI].R) > 0 {\n\t\t\tvalue := \"\"\n\t\t\tfor _, v := range d.SI[xlsxSI].R {\n\t\t\t\tvalue += v.T\n\t\t\t}\n\t\t\treturn value, nil\n\t\t}\n\t\treturn f.formattedValue(xlsx.S, d.SI[xlsxSI].T), nil\n\tcase \"str\":\n\t\treturn f.formattedValue(xlsx.S, xlsx.V), nil\n\tcase \"inlineStr\":\n\t\treturn f.formattedValue(xlsx.S, xlsx.IS.T), nil\n\tdefault:\n\t\treturn f.formattedValue(xlsx.S, xlsx.V), nil\n\t}\n}\n\n// SetRowVisible provides a function to set visible of a single row by given\n// worksheet name and row index. For example, hide row 2 in Sheet1:\n//\n// xlsx.SetRowVisible(\"Sheet1\", 2, false)\n//\nfunc (f *File) SetRowVisible(sheet string, rowIndex int, visible bool) {\n\txlsx := f.workSheetReader(sheet)\n\trows := rowIndex + 1\n\tcells := 0\n\tcompleteRow(xlsx, rows, cells)\n\tif visible {\n\t\txlsx.SheetData.Row[rowIndex].Hidden = false\n\t\treturn\n\t}\n\txlsx.SheetData.Row[rowIndex].Hidden = true\n}\n\n// GetRowVisible provides a function to get visible of a single row by given\n// worksheet name and row index. For example, get visible state of row 2 in\n// Sheet1:\n//\n// xlsx.GetRowVisible(\"Sheet1\", 2)\n//\nfunc (f *File) GetRowVisible(sheet string, rowIndex int) bool {\n\txlsx := f.workSheetReader(sheet)\n\trows := rowIndex + 1\n\tcells := 0\n\tcompleteRow(xlsx, rows, cells)\n\treturn !xlsx.SheetData.Row[rowIndex].Hidden\n}\n\n// SetRowOutlineLevel provides a function to set outline level number of a\n// single row by given worksheet name and row index. For example, outline row\n// 2 in Sheet1 to level 1:\n//\n// xlsx.SetRowOutlineLevel(\"Sheet1\", 2, 1)\n//\nfunc (f *File) SetRowOutlineLevel(sheet string, rowIndex int, level uint8) {\n\txlsx := f.workSheetReader(sheet)\n\trows := rowIndex + 1\n\tcells := 0\n\tcompleteRow(xlsx, rows, cells)\n\txlsx.SheetData.Row[rowIndex].OutlineLevel = level\n}\n\n// GetRowOutlineLevel provides a function to get outline level number of a single row by given\n// worksheet name and row index. For example, get outline number of row 2 in\n// Sheet1:\n//\n// xlsx.GetRowOutlineLevel(\"Sheet1\", 2)\n//\nfunc (f *File) GetRowOutlineLevel(sheet string, rowIndex int) uint8 {\n\txlsx := f.workSheetReader(sheet)\n\trows := rowIndex + 1\n\tcells := 0\n\tcompleteRow(xlsx, rows, cells)\n\treturn xlsx.SheetData.Row[rowIndex].OutlineLevel\n}\n\n// RemoveRow provides function to remove single row by given worksheet name and\n// row index. For example, remove row 3 in Sheet1:\n//\n// xlsx.RemoveRow(\"Sheet1\", 2)\n//\nfunc (f *File) RemoveRow(sheet string, row int) {\n\tif row < 0 {\n\t\treturn\n\t}\n\txlsx := f.workSheetReader(sheet)\n\trow++\n\tfor i, r := range xlsx.SheetData.Row {\n\t\tif r.R == row {\n\t\t\txlsx.SheetData.Row = append(xlsx.SheetData.Row[:i], xlsx.SheetData.Row[i+1:]...)\n\t\t\tf.adjustHelper(sheet, -1, row, -1)\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// InsertRow provides function to insert a new row before given row index. For\n// example, create a new row before row 3 in Sheet1:\n//\n// xlsx.InsertRow(\"Sheet1\", 2)\n//\nfunc (f *File) InsertRow(sheet string, row int) {\n\tif row < 0 {\n\t\treturn\n\t}\n\trow++\n\tf.adjustHelper(sheet, -1, row, 1)\n}\n\n// checkRow provides function to check and fill each column element for all rows\n// and make that is continuous in a worksheet of XML. For example:\n//\n// \n// \n// \n// \n// \n// \n//\n// in this case, we should to change it to\n//\n// \n// \n// \n// \n// \n// \n// \n// \n// \n//\n// Noteice: this method could be very slow for large spreadsheets (more than\n// 3000 rows one sheet).\nfunc checkRow(xlsx *xlsxWorksheet) {\n\tbuffer := bytes.Buffer{}\n\tfor k := range xlsx.SheetData.Row {\n\t\tlenCol := len(xlsx.SheetData.Row[k].C)\n\t\tif lenCol > 0 {\n\t\t\tendR := string(strings.Map(letterOnlyMapF, xlsx.SheetData.Row[k].C[lenCol-1].R))\n\t\t\tendRow, _ := strconv.Atoi(strings.Map(intOnlyMapF, xlsx.SheetData.Row[k].C[lenCol-1].R))\n\t\t\tendCol := TitleToNumber(endR) + 1\n\t\t\tif lenCol < endCol {\n\t\t\t\toldRow := xlsx.SheetData.Row[k].C\n\t\t\t\txlsx.SheetData.Row[k].C = xlsx.SheetData.Row[k].C[:0]\n\t\t\t\ttmp := []xlsxC{}\n\t\t\t\tfor i := 0; i < endCol; i++ {\n\t\t\t\t\tbuffer.WriteString(ToAlphaString(i))\n\t\t\t\t\tbuffer.WriteString(strconv.Itoa(endRow))\n\t\t\t\t\ttmp = append(tmp, xlsxC{\n\t\t\t\t\t\tR: buffer.String(),\n\t\t\t\t\t})\n\t\t\t\t\tbuffer.Reset()\n\t\t\t\t}\n\t\t\t\txlsx.SheetData.Row[k].C = tmp\n\t\t\t\tfor _, y := range oldRow {\n\t\t\t\t\tcolAxis := TitleToNumber(string(strings.Map(letterOnlyMapF, y.R)))\n\t\t\t\t\txlsx.SheetData.Row[k].C[colAxis] = y\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// completeRow provides function to check and fill each column element for a\n// single row and make that is continuous in a worksheet of XML by given row\n// index and axis.\nfunc completeRow(xlsx *xlsxWorksheet, row, cell int) {\n\tcurrentRows := len(xlsx.SheetData.Row)\n\tif currentRows > 1 {\n\t\tlastRow := xlsx.SheetData.Row[currentRows-1].R\n\t\tif lastRow >= row {\n\t\t\trow = lastRow\n\t\t}\n\t}\n\tfor i := currentRows; i < row; i++ {\n\t\txlsx.SheetData.Row = append(xlsx.SheetData.Row, xlsxRow{\n\t\t\tR: i + 1,\n\t\t})\n\t}\n\tbuffer := bytes.Buffer{}\n\tfor ii := currentRows; ii < row; ii++ {\n\t\tstart := len(xlsx.SheetData.Row[ii].C)\n\t\tif start == 0 {\n\t\t\tfor iii := start; iii < cell; iii++ {\n\t\t\t\tbuffer.WriteString(ToAlphaString(iii))\n\t\t\t\tbuffer.WriteString(strconv.Itoa(ii + 1))\n\t\t\t\txlsx.SheetData.Row[ii].C = append(xlsx.SheetData.Row[ii].C, xlsxC{\n\t\t\t\t\tR: buffer.String(),\n\t\t\t\t})\n\t\t\t\tbuffer.Reset()\n\t\t\t}\n\t\t}\n\t}\n}\n\n// convertRowHeightToPixels provides function to convert the height of a cell\n// from user's units to pixels. If the height hasn't been set by the user we use\n// the default value. If the row is hidden it has a value of zero.\nfunc convertRowHeightToPixels(height float64) float64 {\n\tvar pixels float64\n\tif height == 0 {\n\t\treturn pixels\n\t}\n\tpixels = math.Ceil(4.0 / 3.0 * height)\n\treturn pixels\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/shape.go", "content": "package excelize\n\nimport (\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// parseFormatShapeSet provides function to parse the format settings of the\n// shape with default value.\nfunc parseFormatShapeSet(formatSet string) (*formatShape, error) {\n\tformat := formatShape{\n\t\tWidth: 160,\n\t\tHeight: 160,\n\t\tFormat: formatPicture{\n\t\t\tFPrintsWithSheet: true,\n\t\t\tFLocksWithSheet: false,\n\t\t\tNoChangeAspect: false,\n\t\t\tOffsetX: 0,\n\t\t\tOffsetY: 0,\n\t\t\tXScale: 1.0,\n\t\t\tYScale: 1.0,\n\t\t},\n\t}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AddShape provides the method to add shape in a sheet by given worksheet\n// index, shape format set (such as offset, scale, aspect ratio setting and\n// print settings) and properties set. For example, add text box (rect shape) in\n// Sheet1:\n//\n// xlsx.AddShape(\"Sheet1\", \"G6\", `{\"type\":\"rect\",\"color\":{\"line\":\"#4286F4\",\"fill\":\"#8eb9ff\"},\"paragraph\":[{\"text\":\"Rectangle Shape\",\"font\":{\"bold\":true,\"italic\":true,\"family\":\"Berlin Sans FB Demi\",\"size\":36,\"color\":\"#777777\",\"underline\":\"sng\"}}],\"width\":180,\"height\": 90}`)\n//\n// The following shows the type of shape supported by excelize:\n//\n// accentBorderCallout1 (Callout 1 with Border and Accent Shape)\n// accentBorderCallout2 (Callout 2 with Border and Accent Shape)\n// accentBorderCallout3 (Callout 3 with Border and Accent Shape)\n// accentCallout1 (Callout 1 Shape)\n// accentCallout2 (Callout 2 Shape)\n// accentCallout3 (Callout 3 Shape)\n// actionButtonBackPrevious (Back or Previous Button Shape)\n// actionButtonBeginning (Beginning Button Shape)\n// actionButtonBlank (Blank Button Shape)\n// actionButtonDocument (Document Button Shape)\n// actionButtonEnd (End Button Shape)\n// actionButtonForwardNext (Forward or Next Button Shape)\n// actionButtonHelp (Help Button Shape)\n// actionButtonHome (Home Button Shape)\n// actionButtonInformation (Information Button Shape)\n// actionButtonMovie (Movie Button Shape)\n// actionButtonReturn (Return Button Shape)\n// actionButtonSound (Sound Button Shape)\n// arc (Curved Arc Shape)\n// bentArrow (Bent Arrow Shape)\n// bentConnector2 (Bent Connector 2 Shape)\n// bentConnector3 (Bent Connector 3 Shape)\n// bentConnector4 (Bent Connector 4 Shape)\n// bentConnector5 (Bent Connector 5 Shape)\n// bentUpArrow (Bent Up Arrow Shape)\n// bevel (Bevel Shape)\n// blockArc (Block Arc Shape)\n// borderCallout1 (Callout 1 with Border Shape)\n// borderCallout2 (Callout 2 with Border Shape)\n// borderCallout3 (Callout 3 with Border Shape)\n// bracePair (Brace Pair Shape)\n// bracketPair (Bracket Pair Shape)\n// callout1 (Callout 1 Shape)\n// callout2 (Callout 2 Shape)\n// callout3 (Callout 3 Shape)\n// can (Can Shape)\n// chartPlus (Chart Plus Shape)\n// chartStar (Chart Star Shape)\n// chartX (Chart X Shape)\n// chevron (Chevron Shape)\n// chord (Chord Shape)\n// circularArrow (Circular Arrow Shape)\n// cloud (Cloud Shape)\n// cloudCallout (Callout Cloud Shape)\n// corner (Corner Shape)\n// cornerTabs (Corner Tabs Shape)\n// cube (Cube Shape)\n// curvedConnector2 (Curved Connector 2 Shape)\n// curvedConnector3 (Curved Connector 3 Shape)\n// curvedConnector4 (Curved Connector 4 Shape)\n// curvedConnector5 (Curved Connector 5 Shape)\n// curvedDownArrow (Curved Down Arrow Shape)\n// curvedLeftArrow (Curved Left Arrow Shape)\n// curvedRightArrow (Curved Right Arrow Shape)\n// curvedUpArrow (Curved Up Arrow Shape)\n// decagon (Decagon Shape)\n// diagStripe (Diagonal Stripe Shape)\n// diamond (Diamond Shape)\n// dodecagon (Dodecagon Shape)\n// donut (Donut Shape)\n// doubleWave (Double Wave Shape)\n// downArrow (Down Arrow Shape)\n// downArrowCallout (Callout Down Arrow Shape)\n// ellipse (Ellipse Shape)\n// ellipseRibbon (Ellipse Ribbon Shape)\n// ellipseRibbon2 (Ellipse Ribbon 2 Shape)\n// flowChartAlternateProcess (Alternate Process Flow Shape)\n// flowChartCollate (Collate Flow Shape)\n// flowChartConnector (Connector Flow Shape)\n// flowChartDecision (Decision Flow Shape)\n// flowChartDelay (Delay Flow Shape)\n// flowChartDisplay (Display Flow Shape)\n// flowChartDocument (Document Flow Shape)\n// flowChartExtract (Extract Flow Shape)\n// flowChartInputOutput (Input Output Flow Shape)\n// flowChartInternalStorage (Internal Storage Flow Shape)\n// flowChartMagneticDisk (Magnetic Disk Flow Shape)\n// flowChartMagneticDrum (Magnetic Drum Flow Shape)\n// flowChartMagneticTape (Magnetic Tape Flow Shape)\n// flowChartManualInput (Manual Input Flow Shape)\n// flowChartManualOperation (Manual Operation Flow Shape)\n// flowChartMerge (Merge Flow Shape)\n// flowChartMultidocument (Multi-Document Flow Shape)\n// flowChartOfflineStorage (Offline Storage Flow Shape)\n// flowChartOffpageConnector (Off-Page Connector Flow Shape)\n// flowChartOnlineStorage (Online Storage Flow Shape)\n// flowChartOr (Or Flow Shape)\n// flowChartPredefinedProcess (Predefined Process Flow Shape)\n// flowChartPreparation (Preparation Flow Shape)\n// flowChartProcess (Process Flow Shape)\n// flowChartPunchedCard (Punched Card Flow Shape)\n// flowChartPunchedTape (Punched Tape Flow Shape)\n// flowChartSort (Sort Flow Shape)\n// flowChartSummingJunction (Summing Junction Flow Shape)\n// flowChartTerminator (Terminator Flow Shape)\n// foldedCorner (Folded Corner Shape)\n// frame (Frame Shape)\n// funnel (Funnel Shape)\n// gear6 (Gear 6 Shape)\n// gear9 (Gear 9 Shape)\n// halfFrame (Half Frame Shape)\n// heart (Heart Shape)\n// heptagon (Heptagon Shape)\n// hexagon (Hexagon Shape)\n// homePlate (Home Plate Shape)\n// horizontalScroll (Horizontal Scroll Shape)\n// irregularSeal1 (Irregular Seal 1 Shape)\n// irregularSeal2 (Irregular Seal 2 Shape)\n// leftArrow (Left Arrow Shape)\n// leftArrowCallout (Callout Left Arrow Shape)\n// leftBrace (Left Brace Shape)\n// leftBracket (Left Bracket Shape)\n// leftCircularArrow (Left Circular Arrow Shape)\n// leftRightArrow (Left Right Arrow Shape)\n// leftRightArrowCallout (Callout Left Right Arrow Shape)\n// leftRightCircularArrow (Left Right Circular Arrow Shape)\n// leftRightRibbon (Left Right Ribbon Shape)\n// leftRightUpArrow (Left Right Up Arrow Shape)\n// leftUpArrow (Left Up Arrow Shape)\n// lightningBolt (Lightning Bolt Shape)\n// line (Line Shape)\n// lineInv (Line Inverse Shape)\n// mathDivide (Divide Math Shape)\n// mathEqual (Equal Math Shape)\n// mathMinus (Minus Math Shape)\n// mathMultiply (Multiply Math Shape)\n// mathNotEqual (Not Equal Math Shape)\n// mathPlus (Plus Math Shape)\n// moon (Moon Shape)\n// nonIsoscelesTrapezoid (Non-Isosceles Trapezoid Shape)\n// noSmoking (No Smoking Shape)\n// notchedRightArrow (Notched Right Arrow Shape)\n// octagon (Octagon Shape)\n// parallelogram (Parallelogram Shape)\n// pentagon (Pentagon Shape)\n// pie (Pie Shape)\n// pieWedge (Pie Wedge Shape)\n// plaque (Plaque Shape)\n// plaqueTabs (Plaque Tabs Shape)\n// plus (Plus Shape)\n// quadArrow (Quad-Arrow Shape)\n// quadArrowCallout (Callout Quad-Arrow Shape)\n// rect (Rectangle Shape)\n// ribbon (Ribbon Shape)\n// ribbon2 (Ribbon 2 Shape)\n// rightArrow (Right Arrow Shape)\n// rightArrowCallout (Callout Right Arrow Shape)\n// rightBrace (Right Brace Shape)\n// rightBracket (Right Bracket Shape)\n// round1Rect (One Round Corner Rectangle Shape)\n// round2DiagRect (Two Diagonal Round Corner Rectangle Shape)\n// round2SameRect (Two Same-side Round Corner Rectangle Shape)\n// roundRect (Round Corner Rectangle Shape)\n// rtTriangle (Right Triangle Shape)\n// smileyFace (Smiley Face Shape)\n// snip1Rect (One Snip Corner Rectangle Shape)\n// snip2DiagRect (Two Diagonal Snip Corner Rectangle Shape)\n// snip2SameRect (Two Same-side Snip Corner Rectangle Shape)\n// snipRoundRect (One Snip One Round Corner Rectangle Shape)\n// squareTabs (Square Tabs Shape)\n// star10 (Ten Pointed Star Shape)\n// star12 (Twelve Pointed Star Shape)\n// star16 (Sixteen Pointed Star Shape)\n// star24 (Twenty Four Pointed Star Shape)\n// star32 (Thirty Two Pointed Star Shape)\n// star4 (Four Pointed Star Shape)\n// star5 (Five Pointed Star Shape)\n// star6 (Six Pointed Star Shape)\n// star7 (Seven Pointed Star Shape)\n// star8 (Eight Pointed Star Shape)\n// straightConnector1 (Straight Connector 1 Shape)\n// stripedRightArrow (Striped Right Arrow Shape)\n// sun (Sun Shape)\n// swooshArrow (Swoosh Arrow Shape)\n// teardrop (Teardrop Shape)\n// trapezoid (Trapezoid Shape)\n// triangle (Triangle Shape)\n// upArrow (Up Arrow Shape)\n// upArrowCallout (Callout Up Arrow Shape)\n// upDownArrow (Up Down Arrow Shape)\n// upDownArrowCallout (Callout Up Down Arrow Shape)\n// uturnArrow (U-Turn Arrow Shape)\n// verticalScroll (Vertical Scroll Shape)\n// wave (Wave Shape)\n// wedgeEllipseCallout (Callout Wedge Ellipse Shape)\n// wedgeRectCallout (Callout Wedge Rectangle Shape)\n// wedgeRoundRectCallout (Callout Wedge Round Rectangle Shape)\n//\n// The following shows the type of text underline supported by excelize:\n//\n// none\n// words\n// sng\n// dbl\n// heavy\n// dotted\n// dottedHeavy\n// dash\n// dashHeavy\n// dashLong\n// dashLongHeavy\n// dotDash\n// dotDashHeavy\n// dotDotDash\n// dotDotDashHeavy\n// wavy\n// wavyHeavy\n// wavyDbl\n//\nfunc (f *File) AddShape(sheet, cell, format string) error {\n\tformatSet, err := parseFormatShapeSet(format)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// Read sheet data.\n\txlsx := f.workSheetReader(sheet)\n\t// Add first shape for given sheet, create xl/drawings/ and xl/drawings/_rels/ folder.\n\tdrawingID := f.countDrawings() + 1\n\tdrawingXML := \"xl/drawings/drawing\" + strconv.Itoa(drawingID) + \".xml\"\n\tsheetRelationshipsDrawingXML := \"../drawings/drawing\" + strconv.Itoa(drawingID) + \".xml\"\n\n\tif xlsx.Drawing != nil {\n\t\t// The worksheet already has a shape or chart relationships, use the relationships drawing ../drawings/drawing%d.xml.\n\t\tsheetRelationshipsDrawingXML = f.getSheetRelationshipsTargetByID(sheet, xlsx.Drawing.RID)\n\t\tdrawingID, _ = strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(sheetRelationshipsDrawingXML, \"../drawings/drawing\"), \".xml\"))\n\t\tdrawingXML = strings.Replace(sheetRelationshipsDrawingXML, \"..\", \"xl\", -1)\n\t} else {\n\t\t// Add first shape for given sheet.\n\t\trID := f.addSheetRelationships(sheet, SourceRelationshipDrawingML, sheetRelationshipsDrawingXML, \"\")\n\t\tf.addSheetDrawing(sheet, rID)\n\t}\n\tf.addDrawingShape(sheet, drawingXML, cell, formatSet)\n\tf.addContentTypePart(drawingID, \"drawings\")\n\treturn err\n}\n\n// addDrawingShape provides function to add preset geometry by given sheet,\n// drawingXMLand format sets.\nfunc (f *File) addDrawingShape(sheet, drawingXML, cell string, formatSet *formatShape) {\n\ttextUnderlineType := map[string]bool{\"none\": true, \"words\": true, \"sng\": true, \"dbl\": true, \"heavy\": true, \"dotted\": true, \"dottedHeavy\": true, \"dash\": true, \"dashHeavy\": true, \"dashLong\": true, \"dashLongHeavy\": true, \"dotDash\": true, \"dotDashHeavy\": true, \"dotDotDash\": true, \"dotDotDashHeavy\": true, \"wavy\": true, \"wavyHeavy\": true, \"wavyDbl\": true}\n\tcell = strings.ToUpper(cell)\n\tfromCol := string(strings.Map(letterOnlyMapF, cell))\n\tfromRow, _ := strconv.Atoi(strings.Map(intOnlyMapF, cell))\n\trow := fromRow - 1\n\tcol := TitleToNumber(fromCol)\n\twidth := int(float64(formatSet.Width) * formatSet.Format.XScale)\n\theight := int(float64(formatSet.Height) * formatSet.Format.YScale)\n\tcolStart, rowStart, _, _, colEnd, rowEnd, x2, y2 := f.positionObjectPixels(sheet, col, row, formatSet.Format.OffsetX, formatSet.Format.OffsetY, width, height)\n\tcontent := xlsxWsDr{}\n\tcontent.A = NameSpaceDrawingML\n\tcontent.Xdr = NameSpaceDrawingMLSpreadSheet\n\tcNvPrID := f.drawingParser(drawingXML, &content)\n\ttwoCellAnchor := xdrCellAnchor{}\n\ttwoCellAnchor.EditAs = formatSet.Format.Positioning\n\tfrom := xlsxFrom{}\n\tfrom.Col = colStart\n\tfrom.ColOff = formatSet.Format.OffsetX * EMU\n\tfrom.Row = rowStart\n\tfrom.RowOff = formatSet.Format.OffsetY * EMU\n\tto := xlsxTo{}\n\tto.Col = colEnd\n\tto.ColOff = x2 * EMU\n\tto.Row = rowEnd\n\tto.RowOff = y2 * EMU\n\ttwoCellAnchor.From = &from\n\ttwoCellAnchor.To = &to\n\tshape := xdrSp{\n\t\tNvSpPr: &xdrNvSpPr{\n\t\t\tCNvPr: &xlsxCNvPr{\n\t\t\t\tID: cNvPrID,\n\t\t\t\tName: \"Shape \" + strconv.Itoa(cNvPrID),\n\t\t\t},\n\t\t\tCNvSpPr: &xdrCNvSpPr{\n\t\t\t\tTxBox: true,\n\t\t\t},\n\t\t},\n\t\tSpPr: &xlsxSpPr{\n\t\t\tPrstGeom: xlsxPrstGeom{\n\t\t\t\tPrst: formatSet.Type,\n\t\t\t},\n\t\t},\n\t\tStyle: &xdrStyle{\n\t\t\tLnRef: setShapeRef(formatSet.Color.Line, 2),\n\t\t\tFillRef: setShapeRef(formatSet.Color.Fill, 1),\n\t\t\tEffectRef: setShapeRef(formatSet.Color.Effect, 0),\n\t\t\tFontRef: &aFontRef{\n\t\t\t\tIdx: \"minor\",\n\t\t\t\tSchemeClr: &attrValString{\n\t\t\t\t\tVal: \"tx1\",\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t\tTxBody: &xdrTxBody{\n\t\t\tBodyPr: &aBodyPr{\n\t\t\t\tVertOverflow: \"clip\",\n\t\t\t\tHorzOverflow: \"clip\",\n\t\t\t\tWrap: \"none\",\n\t\t\t\tRtlCol: false,\n\t\t\t\tAnchor: \"t\",\n\t\t\t},\n\t\t},\n\t}\n\tif len(formatSet.Paragraph) < 1 {\n\t\tformatSet.Paragraph = []formatShapeParagraph{\n\t\t\t{\n\t\t\t\tFont: formatFont{\n\t\t\t\t\tBold: false,\n\t\t\t\t\tItalic: false,\n\t\t\t\t\tUnderline: \"none\",\n\t\t\t\t\tFamily: \"Calibri\",\n\t\t\t\t\tSize: 11,\n\t\t\t\t\tColor: \"#000000\",\n\t\t\t\t},\n\t\t\t\tText: \" \",\n\t\t\t},\n\t\t}\n\t}\n\tfor _, p := range formatSet.Paragraph {\n\t\tu := p.Font.Underline\n\t\t_, ok := textUnderlineType[u]\n\t\tif !ok {\n\t\t\tu = \"none\"\n\t\t}\n\t\ttext := p.Text\n\t\tif text == \"\" {\n\t\t\ttext = \" \"\n\t\t}\n\t\tparagraph := &aP{\n\t\t\tR: &aR{\n\t\t\t\tRPr: aRPr{\n\t\t\t\t\tI: p.Font.Italic,\n\t\t\t\t\tB: p.Font.Bold,\n\t\t\t\t\tLang: \"en-US\",\n\t\t\t\t\tAltLang: \"en-US\",\n\t\t\t\t\tU: u,\n\t\t\t\t\tSz: p.Font.Size * 100,\n\t\t\t\t\tLatin: &aLatin{Typeface: p.Font.Family},\n\t\t\t\t\tSolidFill: &aSolidFill{\n\t\t\t\t\t\tSrgbClr: &attrValString{\n\t\t\t\t\t\t\tVal: strings.Replace(strings.ToUpper(p.Font.Color), \"#\", \"\", -1),\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tT: text,\n\t\t\t},\n\t\t\tEndParaRPr: &aEndParaRPr{\n\t\t\t\tLang: \"en-US\",\n\t\t\t},\n\t\t}\n\t\tshape.TxBody.P = append(shape.TxBody.P, paragraph)\n\t}\n\ttwoCellAnchor.Sp = &shape\n\ttwoCellAnchor.ClientData = &xdrClientData{\n\t\tFLocksWithSheet: formatSet.Format.FLocksWithSheet,\n\t\tFPrintsWithSheet: formatSet.Format.FPrintsWithSheet,\n\t}\n\tcontent.TwoCellAnchor = append(content.TwoCellAnchor, &twoCellAnchor)\n\toutput, _ := xml.Marshal(content)\n\tf.saveFileList(drawingXML, output)\n}\n\n// setShapeRef provides function to set color with hex model by given actual\n// color value.\nfunc setShapeRef(color string, i int) *aRef {\n\tif color == \"\" {\n\t\treturn &aRef{\n\t\t\tIdx: 0,\n\t\t\tScrgbClr: &aScrgbClr{\n\t\t\t\tR: 0,\n\t\t\t\tG: 0,\n\t\t\t\tB: 0,\n\t\t\t},\n\t\t}\n\t}\n\treturn &aRef{\n\t\tIdx: i,\n\t\tSrgbClr: &attrValString{\n\t\t\tVal: strings.Replace(strings.ToUpper(color), \"#\", \"\", -1),\n\t\t},\n\t}\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/sheet.go", "content": "package excelize\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"os\"\n\t\"path\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\n// NewSheet provides function to create a new sheet by given worksheet name,\n// when creating a new XLSX file, the default sheet will be create, when you\n// create a new file.\nfunc (f *File) NewSheet(name string) int {\n\t// Check if the worksheet already exists\n\tif f.GetSheetIndex(name) != 0 {\n\t\treturn f.SheetCount\n\t}\n\tf.SheetCount++\n\t// Update docProps/app.xml\n\tf.setAppXML()\n\t// Update [Content_Types].xml\n\tf.setContentTypes(f.SheetCount)\n\t// Create new sheet /xl/worksheets/sheet%d.xml\n\tf.setSheet(f.SheetCount, name)\n\t// Update xl/_rels/workbook.xml.rels\n\trID := f.addXlsxWorkbookRels(f.SheetCount)\n\t// Update xl/workbook.xml\n\tf.setWorkbook(name, rID)\n\treturn f.SheetCount\n}\n\n// contentTypesReader provides function to get the pointer to the\n// [Content_Types].xml structure after deserialization.\nfunc (f *File) contentTypesReader() *xlsxTypes {\n\tif f.ContentTypes == nil {\n\t\tvar content xlsxTypes\n\t\t_ = xml.Unmarshal([]byte(f.readXML(\"[Content_Types].xml\")), &content)\n\t\tf.ContentTypes = &content\n\t}\n\treturn f.ContentTypes\n}\n\n// contentTypesWriter provides function to save [Content_Types].xml after\n// serialize structure.\nfunc (f *File) contentTypesWriter() {\n\tif f.ContentTypes != nil {\n\t\toutput, _ := xml.Marshal(f.ContentTypes)\n\t\tf.saveFileList(\"[Content_Types].xml\", output)\n\t}\n}\n\n// workbookReader provides function to get the pointer to the xl/workbook.xml\n// structure after deserialization.\nfunc (f *File) workbookReader() *xlsxWorkbook {\n\tif f.WorkBook == nil {\n\t\tvar content xlsxWorkbook\n\t\t_ = xml.Unmarshal([]byte(f.readXML(\"xl/workbook.xml\")), &content)\n\t\tf.WorkBook = &content\n\t}\n\treturn f.WorkBook\n}\n\n// workbookWriter provides function to save xl/workbook.xml after serialize\n// structure.\nfunc (f *File) workbookWriter() {\n\tif f.WorkBook != nil {\n\t\toutput, _ := xml.Marshal(f.WorkBook)\n\t\tf.saveFileList(\"xl/workbook.xml\", replaceRelationshipsNameSpaceBytes(output))\n\t}\n}\n\n// worksheetWriter provides function to save xl/worksheets/sheet%d.xml after\n// serialize structure.\nfunc (f *File) worksheetWriter() {\n\tfor path, sheet := range f.Sheet {\n\t\tif sheet != nil {\n\t\t\tfor k, v := range sheet.SheetData.Row {\n\t\t\t\tf.Sheet[path].SheetData.Row[k].C = trimCell(v.C)\n\t\t\t}\n\t\t\toutput, _ := xml.Marshal(sheet)\n\t\t\tf.saveFileList(path, replaceWorkSheetsRelationshipsNameSpaceBytes(output))\n\t\t\tok := f.checked[path]\n\t\t\tif ok {\n\t\t\t\tf.checked[path] = false\n\t\t\t}\n\t\t}\n\t}\n}\n\n// trimCell provides function to trim blank cells which created by completeCol.\nfunc trimCell(column []xlsxC) []xlsxC {\n\tcol := make([]xlsxC, len(column))\n\ti := 0\n\tfor _, c := range column {\n\t\tif c.S != 0 || c.V != \"\" || c.F != nil || c.T != \"\" {\n\t\t\tcol[i] = c\n\t\t\ti++\n\t\t}\n\t}\n\treturn col[0:i]\n}\n\n// Read and update property of contents type of XLSX.\nfunc (f *File) setContentTypes(index int) {\n\tcontent := f.contentTypesReader()\n\tcontent.Overrides = append(content.Overrides, xlsxOverride{\n\t\tPartName: \"/xl/worksheets/sheet\" + strconv.Itoa(index) + \".xml\",\n\t\tContentType: \"application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml\",\n\t})\n}\n\n// Update sheet property by given index.\nfunc (f *File) setSheet(index int, name string) {\n\tvar xlsx xlsxWorksheet\n\txlsx.Dimension.Ref = \"A1\"\n\txlsx.SheetViews.SheetView = append(xlsx.SheetViews.SheetView, xlsxSheetView{\n\t\tWorkbookViewID: 0,\n\t})\n\tpath := \"xl/worksheets/sheet\" + strconv.Itoa(index) + \".xml\"\n\tf.sheetMap[trimSheetName(name)] = path\n\tf.Sheet[path] = &xlsx\n}\n\n// setWorkbook update workbook property of XLSX. Maximum 31 characters are\n// allowed in sheet title.\nfunc (f *File) setWorkbook(name string, rid int) {\n\tcontent := f.workbookReader()\n\tcontent.Sheets.Sheet = append(content.Sheets.Sheet, xlsxSheet{\n\t\tName: trimSheetName(name),\n\t\tSheetID: strconv.Itoa(rid),\n\t\tID: \"rId\" + strconv.Itoa(rid),\n\t})\n}\n\n// workbookRelsReader provides function to read and unmarshal workbook\n// relationships of XLSX file.\nfunc (f *File) workbookRelsReader() *xlsxWorkbookRels {\n\tif f.WorkBookRels == nil {\n\t\tvar content xlsxWorkbookRels\n\t\t_ = xml.Unmarshal([]byte(f.readXML(\"xl/_rels/workbook.xml.rels\")), &content)\n\t\tf.WorkBookRels = &content\n\t}\n\treturn f.WorkBookRels\n}\n\n// workbookRelsWriter provides function to save xl/_rels/workbook.xml.rels after\n// serialize structure.\nfunc (f *File) workbookRelsWriter() {\n\tif f.WorkBookRels != nil {\n\t\toutput, _ := xml.Marshal(f.WorkBookRels)\n\t\tf.saveFileList(\"xl/_rels/workbook.xml.rels\", output)\n\t}\n}\n\n// addXlsxWorkbookRels update workbook relationships property of XLSX.\nfunc (f *File) addXlsxWorkbookRels(sheet int) int {\n\tcontent := f.workbookRelsReader()\n\trID := 0\n\tfor _, v := range content.Relationships {\n\t\tt, _ := strconv.Atoi(strings.TrimPrefix(v.ID, \"rId\"))\n\t\tif t > rID {\n\t\t\trID = t\n\t\t}\n\t}\n\trID++\n\tID := bytes.Buffer{}\n\tID.WriteString(\"rId\")\n\tID.WriteString(strconv.Itoa(rID))\n\ttarget := bytes.Buffer{}\n\ttarget.WriteString(\"worksheets/sheet\")\n\ttarget.WriteString(strconv.Itoa(sheet))\n\ttarget.WriteString(\".xml\")\n\tcontent.Relationships = append(content.Relationships, xlsxWorkbookRelation{\n\t\tID: ID.String(),\n\t\tTarget: target.String(),\n\t\tType: SourceRelationshipWorkSheet,\n\t})\n\treturn rID\n}\n\n// setAppXML update docProps/app.xml file of XML.\nfunc (f *File) setAppXML() {\n\tf.saveFileList(\"docProps/app.xml\", []byte(templateDocpropsApp))\n}\n\n// Some tools that read XLSX files have very strict requirements about the\n// structure of the input XML. In particular both Numbers on the Mac and SAS\n// dislike inline XML namespace declarations, or namespace prefixes that don't\n// match the ones that Excel itself uses. This is a problem because the Go XML\n// library doesn't multiple namespace declarations in a single element of a\n// document. This function is a horrible hack to fix that after the XML\n// marshalling is completed.\nfunc replaceRelationshipsNameSpaceBytes(workbookMarshal []byte) []byte {\n\toldXmlns := []byte(``)\n\tnewXmlns := []byte(``)\n\treturn bytes.Replace(workbookMarshal, oldXmlns, newXmlns, -1)\n}\n\n// SetActiveSheet provides function to set default active worksheet of XLSX by\n// given index. Note that active index is different with the index that got by\n// function GetSheetMap, and it should be greater than 0 and less than total\n// worksheet numbers.\nfunc (f *File) SetActiveSheet(index int) {\n\tif index < 1 {\n\t\tindex = 1\n\t}\n\tindex--\n\tcontent := f.workbookReader()\n\tif len(content.BookViews.WorkBookView) > 0 {\n\t\tcontent.BookViews.WorkBookView[0].ActiveTab = index\n\t} else {\n\t\tcontent.BookViews.WorkBookView = append(content.BookViews.WorkBookView, xlsxWorkBookView{\n\t\t\tActiveTab: index,\n\t\t})\n\t}\n\tindex++\n\tfor idx, name := range f.GetSheetMap() {\n\t\txlsx := f.workSheetReader(name)\n\t\tif index == idx {\n\t\t\tif len(xlsx.SheetViews.SheetView) > 0 {\n\t\t\t\txlsx.SheetViews.SheetView[0].TabSelected = true\n\t\t\t} else {\n\t\t\t\txlsx.SheetViews.SheetView = append(xlsx.SheetViews.SheetView, xlsxSheetView{\n\t\t\t\t\tTabSelected: true,\n\t\t\t\t})\n\t\t\t}\n\t\t} else {\n\t\t\tif len(xlsx.SheetViews.SheetView) > 0 {\n\t\t\t\txlsx.SheetViews.SheetView[0].TabSelected = false\n\t\t\t}\n\t\t}\n\t}\n}\n\n// GetActiveSheetIndex provides function to get active sheet of XLSX. If not\n// found the active sheet will be return integer 0.\nfunc (f *File) GetActiveSheetIndex() int {\n\tbuffer := bytes.Buffer{}\n\tcontent := f.workbookReader()\n\tfor _, v := range content.Sheets.Sheet {\n\t\txlsx := xlsxWorksheet{}\n\t\tbuffer.WriteString(\"xl/worksheets/sheet\")\n\t\tbuffer.WriteString(strings.TrimPrefix(v.ID, \"rId\"))\n\t\tbuffer.WriteString(\".xml\")\n\t\t_ = xml.Unmarshal([]byte(f.readXML(buffer.String())), &xlsx)\n\t\tfor _, sheetView := range xlsx.SheetViews.SheetView {\n\t\t\tif sheetView.TabSelected {\n\t\t\t\tID, _ := strconv.Atoi(strings.TrimPrefix(v.ID, \"rId\"))\n\t\t\t\treturn ID\n\t\t\t}\n\t\t}\n\t\tbuffer.Reset()\n\t}\n\treturn 0\n}\n\n// SetSheetName provides function to set the worksheet name be given old and new\n// worksheet name. Maximum 31 characters are allowed in sheet title and this\n// function only changes the name of the sheet and will not update the sheet\n// name in the formula or reference associated with the cell. So there may be\n// problem formula error or reference missing.\nfunc (f *File) SetSheetName(oldName, newName string) {\n\toldName = trimSheetName(oldName)\n\tnewName = trimSheetName(newName)\n\tcontent := f.workbookReader()\n\tfor k, v := range content.Sheets.Sheet {\n\t\tif v.Name == oldName {\n\t\t\tcontent.Sheets.Sheet[k].Name = newName\n\t\t\tf.sheetMap[newName] = f.sheetMap[oldName]\n\t\t\tdelete(f.sheetMap, oldName)\n\t\t}\n\t}\n}\n\n// GetSheetName provides function to get worksheet name of XLSX by given\n// worksheet index. If given sheet index is invalid, will return an empty\n// string.\nfunc (f *File) GetSheetName(index int) string {\n\tcontent := f.workbookReader()\n\trels := f.workbookRelsReader()\n\tfor _, rel := range rels.Relationships {\n\t\trID, _ := strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(rel.Target, \"worksheets/sheet\"), \".xml\"))\n\t\tif rID == index {\n\t\t\tfor _, v := range content.Sheets.Sheet {\n\t\t\t\tif v.ID == rel.ID {\n\t\t\t\t\treturn v.Name\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// GetSheetIndex provides function to get worksheet index of XLSX by given sheet\n// name. If given worksheet name is invalid, will return an integer type value\n// 0.\nfunc (f *File) GetSheetIndex(name string) int {\n\tcontent := f.workbookReader()\n\trels := f.workbookRelsReader()\n\tfor _, v := range content.Sheets.Sheet {\n\t\tif v.Name == name {\n\t\t\tfor _, rel := range rels.Relationships {\n\t\t\t\tif v.ID == rel.ID {\n\t\t\t\t\trID, _ := strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(rel.Target, \"worksheets/sheet\"), \".xml\"))\n\t\t\t\t\treturn rID\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0\n}\n\n// GetSheetMap provides function to get worksheet name and index map of XLSX.\n// For example:\n//\n// xlsx, err := excelize.OpenFile(\"./Book1.xlsx\")\n// if err != nil {\n// return\n// }\n// for index, name := range xlsx.GetSheetMap() {\n// fmt.Println(index, name)\n// }\n//\nfunc (f *File) GetSheetMap() map[int]string {\n\tcontent := f.workbookReader()\n\trels := f.workbookRelsReader()\n\tsheetMap := map[int]string{}\n\tfor _, v := range content.Sheets.Sheet {\n\t\tfor _, rel := range rels.Relationships {\n\t\t\tif rel.ID == v.ID {\n\t\t\t\trID, _ := strconv.Atoi(strings.TrimSuffix(strings.TrimPrefix(rel.Target, \"worksheets/sheet\"), \".xml\"))\n\t\t\t\tsheetMap[rID] = v.Name\n\t\t\t}\n\t\t}\n\t}\n\treturn sheetMap\n}\n\n// getSheetMap provides function to get worksheet name and XML file path map of\n// XLSX.\nfunc (f *File) getSheetMap() map[string]string {\n\tmaps := make(map[string]string)\n\tfor idx, name := range f.GetSheetMap() {\n\t\tmaps[name] = \"xl/worksheets/sheet\" + strconv.Itoa(idx) + \".xml\"\n\t}\n\treturn maps\n}\n\n// SetSheetBackground provides function to set background picture by given\n// worksheet name.\nfunc (f *File) SetSheetBackground(sheet, picture string) error {\n\tvar err error\n\t// Check picture exists first.\n\tif _, err = os.Stat(picture); os.IsNotExist(err) {\n\t\treturn err\n\t}\n\text, ok := supportImageTypes[path.Ext(picture)]\n\tif !ok {\n\t\treturn errors.New(\"Unsupported image extension\")\n\t}\n\tpictureID := f.countMedia() + 1\n\trID := f.addSheetRelationships(sheet, SourceRelationshipImage, \"../media/image\"+strconv.Itoa(pictureID)+ext, \"\")\n\tf.addSheetPicture(sheet, rID)\n\tf.addMedia(picture, ext)\n\tf.setContentTypePartImageExtensions()\n\treturn err\n}\n\n// DeleteSheet provides function to delete worksheet in a workbook by given\n// worksheet name. Use this method with caution, which will affect changes in\n// references such as formulas, charts, and so on. If there is any referenced\n// value of the deleted worksheet, it will cause a file error when you open it.\n// This function will be invalid when only the one worksheet is left.\nfunc (f *File) DeleteSheet(name string) {\n\tcontent := f.workbookReader()\n\tfor k, v := range content.Sheets.Sheet {\n\t\tif v.Name == trimSheetName(name) && len(content.Sheets.Sheet) > 1 {\n\t\t\tcontent.Sheets.Sheet = append(content.Sheets.Sheet[:k], content.Sheets.Sheet[k+1:]...)\n\t\t\tsheet := \"xl/worksheets/sheet\" + strings.TrimPrefix(v.ID, \"rId\") + \".xml\"\n\t\t\trels := \"xl/worksheets/_rels/sheet\" + strings.TrimPrefix(v.ID, \"rId\") + \".xml.rels\"\n\t\t\ttarget := f.deleteSheetFromWorkbookRels(v.ID)\n\t\t\tf.deleteSheetFromContentTypes(target)\n\t\t\tdelete(f.sheetMap, name)\n\t\t\tdelete(f.XLSX, sheet)\n\t\t\tdelete(f.XLSX, rels)\n\t\t\tdelete(f.Sheet, sheet)\n\t\t\tf.SheetCount--\n\t\t}\n\t}\n\tf.SetActiveSheet(len(f.GetSheetMap()))\n}\n\n// deleteSheetFromWorkbookRels provides function to remove worksheet\n// relationships by given relationships ID in the file\n// xl/_rels/workbook.xml.rels.\nfunc (f *File) deleteSheetFromWorkbookRels(rID string) string {\n\tcontent := f.workbookRelsReader()\n\tfor k, v := range content.Relationships {\n\t\tif v.ID == rID {\n\t\t\tcontent.Relationships = append(content.Relationships[:k], content.Relationships[k+1:]...)\n\t\t\treturn v.Target\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// deleteSheetFromContentTypes provides function to remove worksheet\n// relationships by given target name in the file [Content_Types].xml.\nfunc (f *File) deleteSheetFromContentTypes(target string) {\n\tcontent := f.contentTypesReader()\n\tfor k, v := range content.Overrides {\n\t\tif v.PartName == \"/xl/\"+target {\n\t\t\tcontent.Overrides = append(content.Overrides[:k], content.Overrides[k+1:]...)\n\t\t}\n\t}\n}\n\n// CopySheet provides function to duplicate a worksheet by gave source and\n// target worksheet index. Note that currently doesn't support duplicate\n// workbooks that contain tables, charts or pictures. For Example:\n//\n// // Sheet1 already exists...\n// index := xlsx.NewSheet(\"Sheet2\")\n// err := xlsx.CopySheet(1, index)\n// return err\n//\nfunc (f *File) CopySheet(from, to int) error {\n\tif from < 1 || to < 1 || from == to || f.GetSheetName(from) == \"\" || f.GetSheetName(to) == \"\" {\n\t\treturn errors.New(\"Invalid worksheet index\")\n\t}\n\treturn f.copySheet(from, to)\n}\n\n// copySheet provides function to duplicate a worksheet by gave source and\n// target worksheet name.\nfunc (f *File) copySheet(from, to int) error {\n\tsheet := f.workSheetReader(\"sheet\" + strconv.Itoa(from))\n\tworksheet := xlsxWorksheet{}\n\terr := deepCopy(&worksheet, &sheet)\n\tif err != nil {\n\t\treturn err\n\t}\n\tpath := \"xl/worksheets/sheet\" + strconv.Itoa(to) + \".xml\"\n\tif len(worksheet.SheetViews.SheetView) > 0 {\n\t\tworksheet.SheetViews.SheetView[0].TabSelected = false\n\t}\n\tworksheet.Drawing = nil\n\tworksheet.TableParts = nil\n\tworksheet.PageSetUp = nil\n\tf.Sheet[path] = &worksheet\n\ttoRels := \"xl/worksheets/_rels/sheet\" + strconv.Itoa(to) + \".xml.rels\"\n\tfromRels := \"xl/worksheets/_rels/sheet\" + strconv.Itoa(from) + \".xml.rels\"\n\t_, ok := f.XLSX[fromRels]\n\tif ok {\n\t\tf.XLSX[toRels] = f.XLSX[fromRels]\n\t}\n\treturn err\n}\n\n// SetSheetVisible provides function to set worksheet visible by given worksheet\n// name. A workbook must contain at least one visible worksheet. If the given\n// worksheet has been activated, this setting will be invalidated. Sheet state\n// values as defined by http://msdn.microsoft.com/en-us/library/office/documentformat.openxml.spreadsheet.sheetstatevalues.aspx\n//\n// visible\n// hidden\n// veryHidden\n//\n// For example, hide Sheet1:\n//\n// xlsx.SetSheetVisible(\"Sheet1\", false)\n//\nfunc (f *File) SetSheetVisible(name string, visible bool) {\n\tname = trimSheetName(name)\n\tcontent := f.workbookReader()\n\tif visible {\n\t\tfor k, v := range content.Sheets.Sheet {\n\t\t\tif v.Name == name {\n\t\t\t\tcontent.Sheets.Sheet[k].State = \"\"\n\t\t\t}\n\t\t}\n\t\treturn\n\t}\n\tcount := 0\n\tfor _, v := range content.Sheets.Sheet {\n\t\tif v.State != \"hidden\" {\n\t\t\tcount++\n\t\t}\n\t}\n\tfor k, v := range content.Sheets.Sheet {\n\t\txlsx := f.workSheetReader(f.GetSheetMap()[k])\n\t\ttabSelected := false\n\t\tif len(xlsx.SheetViews.SheetView) > 0 {\n\t\t\ttabSelected = xlsx.SheetViews.SheetView[0].TabSelected\n\t\t}\n\t\tif v.Name == name && count > 1 && !tabSelected {\n\t\t\tcontent.Sheets.Sheet[k].State = \"hidden\"\n\t\t}\n\t}\n}\n\n// parseFormatPanesSet provides function to parse the panes settings.\nfunc parseFormatPanesSet(formatSet string) (*formatPanes, error) {\n\tformat := formatPanes{}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// SetPanes provides function to create and remove freeze panes and split panes\n// by given worksheet name and panes format set.\n//\n// activePane defines the pane that is active. The possible values for this\n// attribute are defined in the following table:\n//\n// Enumeration Value | Description\n// --------------------------------+-------------------------------------------------------------\n// bottomLeft (Bottom Left Pane) | Bottom left pane, when both vertical and horizontal\n// | splits are applied.\n// |\n// | This value is also used when only a horizontal split has\n// | been applied, dividing the pane into upper and lower\n// | regions. In that case, this value specifies the bottom\n// | pane.\n// |\n// bottomRight (Bottom Right Pane) | Bottom right pane, when both vertical and horizontal\n// | splits are applied.\n// |\n// topLeft (Top Left Pane) | Top left pane, when both vertical and horizontal splits\n// | are applied.\n// |\n// | This value is also used when only a horizontal split has\n// | been applied, dividing the pane into upper and lower\n// | regions. In that case, this value specifies the top pane.\n// |\n// | This value is also used when only a vertical split has\n// | been applied, dividing the pane into right and left\n// | regions. In that case, this value specifies the left pane\n// |\n// topRight (Top Right Pane) | Top right pane, when both vertical and horizontal\n// | splits are applied.\n// |\n// | This value is also used when only a vertical split has\n// | been applied, dividing the pane into right and left\n// | regions. In that case, this value specifies the right\n// | pane.\n//\n// Pane state type is restricted to the values supported currently listed in the following table:\n//\n// Enumeration Value | Description\n// --------------------------------+-------------------------------------------------------------\n// frozen (Frozen) | Panes are frozen, but were not split being frozen. In\n// | this state, when the panes are unfrozen again, a single\n// | pane results, with no split.\n// |\n// | In this state, the split bars are not adjustable.\n// |\n// split (Split) | Panes are split, but not frozen. In this state, the split\n// | bars are adjustable by the user.\n//\n// x_split (Horizontal Split Position): Horizontal position of the split, in\n// 1/20th of a point; 0 (zero) if none. If the pane is frozen, this value\n// indicates the number of columns visible in the top pane.\n//\n// y_split (Vertical Split Position): Vertical position of the split, in 1/20th\n// of a point; 0 (zero) if none. If the pane is frozen, this value indicates the\n// number of rows visible in the left pane. The possible values for this\n// attribute are defined by the W3C XML Schema double datatype.\n//\n// top_left_cell: Location of the top left visible cell in the bottom right pane\n// (when in Left-To-Right mode).\n//\n// sqref (Sequence of References): Range of the selection. Can be non-contiguous\n// set of ranges.\n//\n// An example of how to freeze column A in the Sheet1 and set the active cell on\n// Sheet1!K16:\n//\n// xlsx.SetPanes(\"Sheet1\", `{\"freeze\":true,\"split\":false,\"x_split\":1,\"y_split\":0,\"top_left_cell\":\"B1\",\"active_pane\":\"topRight\",\"panes\":[{\"sqref\":\"K16\",\"active_cell\":\"K16\",\"pane\":\"topRight\"}]}`)\n//\n// An example of how to freeze rows 1 to 9 in the Sheet1 and set the active cell\n// ranges on Sheet1!A11:XFD11:\n//\n// xlsx.SetPanes(\"Sheet1\", `{\"freeze\":true,\"split\":false,\"x_split\":0,\"y_split\":9,\"top_left_cell\":\"A34\",\"active_pane\":\"bottomLeft\",\"panes\":[{\"sqref\":\"A11:XFD11\",\"active_cell\":\"A11\",\"pane\":\"bottomLeft\"}]}`)\n//\n// An example of how to create split panes in the Sheet1 and set the active cell\n// on Sheet1!J60:\n//\n// xlsx.SetPanes(\"Sheet1\", `{\"freeze\":false,\"split\":true,\"x_split\":3270,\"y_split\":1800,\"top_left_cell\":\"N57\",\"active_pane\":\"bottomLeft\",\"panes\":[{\"sqref\":\"I36\",\"active_cell\":\"I36\"},{\"sqref\":\"G33\",\"active_cell\":\"G33\",\"pane\":\"topRight\"},{\"sqref\":\"J60\",\"active_cell\":\"J60\",\"pane\":\"bottomLeft\"},{\"sqref\":\"O60\",\"active_cell\":\"O60\",\"pane\":\"bottomRight\"}]}`)\n//\n// An example of how to unfreeze and remove all panes on Sheet1:\n//\n// xlsx.SetPanes(\"Sheet1\", `{\"freeze\":false,\"split\":false}`)\n//\nfunc (f *File) SetPanes(sheet, panes string) {\n\tfs, _ := parseFormatPanesSet(panes)\n\txlsx := f.workSheetReader(sheet)\n\tp := &xlsxPane{\n\t\tActivePane: fs.ActivePane,\n\t\tTopLeftCell: fs.TopLeftCell,\n\t\tXSplit: float64(fs.XSplit),\n\t\tYSplit: float64(fs.YSplit),\n\t}\n\tif fs.Freeze {\n\t\tp.State = \"frozen\"\n\t}\n\txlsx.SheetViews.SheetView[len(xlsx.SheetViews.SheetView)-1].Pane = p\n\tif !(fs.Freeze) && !(fs.Split) {\n\t\tif len(xlsx.SheetViews.SheetView) > 0 {\n\t\t\txlsx.SheetViews.SheetView[len(xlsx.SheetViews.SheetView)-1].Pane = nil\n\t\t}\n\t}\n\ts := []*xlsxSelection{}\n\tfor _, p := range fs.Panes {\n\t\ts = append(s, &xlsxSelection{\n\t\t\tActiveCell: p.ActiveCell,\n\t\t\tPane: p.Pane,\n\t\t\tSQRef: p.SQRef,\n\t\t})\n\t}\n\txlsx.SheetViews.SheetView[len(xlsx.SheetViews.SheetView)-1].Selection = s\n}\n\n// GetSheetVisible provides function to get worksheet visible by given worksheet\n// name. For example, get visible state of Sheet1:\n//\n// xlsx.GetSheetVisible(\"Sheet1\")\n//\nfunc (f *File) GetSheetVisible(name string) bool {\n\tcontent := f.workbookReader()\n\tvisible := false\n\tfor k, v := range content.Sheets.Sheet {\n\t\tif v.Name == trimSheetName(name) {\n\t\t\tif content.Sheets.Sheet[k].State == \"\" || content.Sheets.Sheet[k].State == \"visible\" {\n\t\t\t\tvisible = true\n\t\t\t}\n\t\t}\n\t}\n\treturn visible\n}\n\n// trimSheetName provides function to trim invaild characters by given worksheet\n// name.\nfunc trimSheetName(name string) string {\n\tr := []rune{}\n\tfor _, v := range name {\n\t\tswitch v {\n\t\tcase 58, 92, 47, 63, 42, 91, 93: // replace :\\/?*[]\n\t\t\tcontinue\n\t\tdefault:\n\t\t\tr = append(r, v)\n\t\t}\n\t}\n\tname = string(r)\n\tif utf8.RuneCountInString(name) > 31 {\n\t\tname = string([]rune(name)[0:31])\n\t}\n\treturn name\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/sheetpr.go", "content": "package excelize\n\n// SheetPrOption is an option of a view of a worksheet. See SetSheetPrOptions().\ntype SheetPrOption interface {\n\tsetSheetPrOption(view *xlsxSheetPr)\n}\n\n// SheetPrOptionPtr is a writable SheetPrOption. See GetSheetPrOptions().\ntype SheetPrOptionPtr interface {\n\tSheetPrOption\n\tgetSheetPrOption(view *xlsxSheetPr)\n}\n\ntype (\n\t// CodeName is a SheetPrOption\n\tCodeName string\n\t// EnableFormatConditionsCalculation is a SheetPrOption\n\tEnableFormatConditionsCalculation bool\n\t// Published is a SheetPrOption\n\tPublished bool\n\t// FitToPage is a SheetPrOption\n\tFitToPage bool\n\t// AutoPageBreaks is a SheetPrOption\n\tAutoPageBreaks bool\n)\n\nfunc (o CodeName) setSheetPrOption(pr *xlsxSheetPr) {\n\tpr.CodeName = string(o)\n}\n\nfunc (o *CodeName) getSheetPrOption(pr *xlsxSheetPr) {\n\tif pr == nil {\n\t\t*o = \"\"\n\t\treturn\n\t}\n\t*o = CodeName(pr.CodeName)\n}\n\nfunc (o EnableFormatConditionsCalculation) setSheetPrOption(pr *xlsxSheetPr) {\n\tpr.EnableFormatConditionsCalculation = boolPtr(bool(o))\n}\n\nfunc (o *EnableFormatConditionsCalculation) getSheetPrOption(pr *xlsxSheetPr) {\n\tif pr == nil {\n\t\t*o = true\n\t\treturn\n\t}\n\t*o = EnableFormatConditionsCalculation(defaultTrue(pr.EnableFormatConditionsCalculation))\n}\n\nfunc (o Published) setSheetPrOption(pr *xlsxSheetPr) {\n\tpr.Published = boolPtr(bool(o))\n}\n\nfunc (o *Published) getSheetPrOption(pr *xlsxSheetPr) {\n\tif pr == nil {\n\t\t*o = true\n\t\treturn\n\t}\n\t*o = Published(defaultTrue(pr.Published))\n}\n\nfunc (o FitToPage) setSheetPrOption(pr *xlsxSheetPr) {\n\tif pr.PageSetUpPr == nil {\n\t\tif !o {\n\t\t\treturn\n\t\t}\n\t\tpr.PageSetUpPr = new(xlsxPageSetUpPr)\n\t}\n\tpr.PageSetUpPr.FitToPage = bool(o)\n}\n\nfunc (o *FitToPage) getSheetPrOption(pr *xlsxSheetPr) {\n\t// Excel default: false\n\tif pr == nil || pr.PageSetUpPr == nil {\n\t\t*o = false\n\t\treturn\n\t}\n\t*o = FitToPage(pr.PageSetUpPr.FitToPage)\n}\n\nfunc (o AutoPageBreaks) setSheetPrOption(pr *xlsxSheetPr) {\n\tif pr.PageSetUpPr == nil {\n\t\tif !o {\n\t\t\treturn\n\t\t}\n\t\tpr.PageSetUpPr = new(xlsxPageSetUpPr)\n\t}\n\tpr.PageSetUpPr.AutoPageBreaks = bool(o)\n}\n\nfunc (o *AutoPageBreaks) getSheetPrOption(pr *xlsxSheetPr) {\n\t// Excel default: false\n\tif pr == nil || pr.PageSetUpPr == nil {\n\t\t*o = false\n\t\treturn\n\t}\n\t*o = AutoPageBreaks(pr.PageSetUpPr.AutoPageBreaks)\n}\n\n// SetSheetPrOptions provides function to sets worksheet properties.\n//\n// Available options:\n// CodeName(string)\n// EnableFormatConditionsCalculation(bool)\n// Published(bool)\n// FitToPage(bool)\n// AutoPageBreaks(bool)\nfunc (f *File) SetSheetPrOptions(name string, opts ...SheetPrOption) error {\n\tsheet := f.workSheetReader(name)\n\tpr := sheet.SheetPr\n\tif pr == nil {\n\t\tpr = new(xlsxSheetPr)\n\t\tsheet.SheetPr = pr\n\t}\n\n\tfor _, opt := range opts {\n\t\topt.setSheetPrOption(pr)\n\t}\n\treturn nil\n}\n\n// GetSheetPrOptions provides function to gets worksheet properties.\n//\n// Available options:\n// CodeName(string)\n// EnableFormatConditionsCalculation(bool)\n// Published(bool)\n// FitToPage(bool)\n// AutoPageBreaks(bool)\nfunc (f *File) GetSheetPrOptions(name string, opts ...SheetPrOptionPtr) error {\n\tsheet := f.workSheetReader(name)\n\tpr := sheet.SheetPr\n\n\tfor _, opt := range opts {\n\t\topt.getSheetPrOption(pr)\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/sheetview.go", "content": "package excelize\n\nimport \"fmt\"\n\n// SheetViewOption is an option of a view of a worksheet. See SetSheetViewOptions().\ntype SheetViewOption interface {\n\tsetSheetViewOption(view *xlsxSheetView)\n}\n\n// SheetViewOptionPtr is a writable SheetViewOption. See GetSheetViewOptions().\ntype SheetViewOptionPtr interface {\n\tSheetViewOption\n\tgetSheetViewOption(view *xlsxSheetView)\n}\n\ntype (\n\t// DefaultGridColor is a SheetViewOption.\n\tDefaultGridColor bool\n\t// RightToLeft is a SheetViewOption.\n\tRightToLeft bool\n\t// ShowFormulas is a SheetViewOption.\n\tShowFormulas bool\n\t// ShowGridLines is a SheetViewOption.\n\tShowGridLines bool\n\t// ShowRowColHeaders is a SheetViewOption.\n\tShowRowColHeaders bool\n\t// ZoomScale is a SheetViewOption.\n\tZoomScale float64\n\t/* TODO\n\t// ShowWhiteSpace is a SheetViewOption.\n\tShowWhiteSpace bool\n\t// ShowZeros is a SheetViewOption.\n\tShowZeros bool\n\t// WindowProtection is a SheetViewOption.\n\tWindowProtection bool\n\t*/\n)\n\n// Defaults for each option are described in XML schema for CT_SheetView\n\nfunc (o DefaultGridColor) setSheetViewOption(view *xlsxSheetView) {\n\tview.DefaultGridColor = boolPtr(bool(o))\n}\n\nfunc (o *DefaultGridColor) getSheetViewOption(view *xlsxSheetView) {\n\t*o = DefaultGridColor(defaultTrue(view.DefaultGridColor)) // Excel default: true\n}\n\nfunc (o RightToLeft) setSheetViewOption(view *xlsxSheetView) {\n\tview.RightToLeft = bool(o) // Excel default: false\n}\n\nfunc (o *RightToLeft) getSheetViewOption(view *xlsxSheetView) {\n\t*o = RightToLeft(view.RightToLeft)\n}\n\nfunc (o ShowFormulas) setSheetViewOption(view *xlsxSheetView) {\n\tview.ShowFormulas = bool(o) // Excel default: false\n}\n\nfunc (o *ShowFormulas) getSheetViewOption(view *xlsxSheetView) {\n\t*o = ShowFormulas(view.ShowFormulas) // Excel default: false\n}\n\nfunc (o ShowGridLines) setSheetViewOption(view *xlsxSheetView) {\n\tview.ShowGridLines = boolPtr(bool(o))\n}\n\nfunc (o *ShowGridLines) getSheetViewOption(view *xlsxSheetView) {\n\t*o = ShowGridLines(defaultTrue(view.ShowGridLines)) // Excel default: true\n}\n\nfunc (o ShowRowColHeaders) setSheetViewOption(view *xlsxSheetView) {\n\tview.ShowRowColHeaders = boolPtr(bool(o))\n}\n\nfunc (o *ShowRowColHeaders) getSheetViewOption(view *xlsxSheetView) {\n\t*o = ShowRowColHeaders(defaultTrue(view.ShowRowColHeaders)) // Excel default: true\n}\n\nfunc (o ZoomScale) setSheetViewOption(view *xlsxSheetView) {\n\t//This attribute is restricted to values ranging from 10 to 400.\n\tif float64(o) >= 10 && float64(o) <= 400 {\n\t\tview.ZoomScale = float64(o)\n\t}\n}\n\nfunc (o *ZoomScale) getSheetViewOption(view *xlsxSheetView) {\n\t*o = ZoomScale(view.ZoomScale)\n}\n\n// getSheetView returns the SheetView object\nfunc (f *File) getSheetView(sheetName string, viewIndex int) (*xlsxSheetView, error) {\n\txlsx := f.workSheetReader(sheetName)\n\tif viewIndex < 0 {\n\t\tif viewIndex < -len(xlsx.SheetViews.SheetView) {\n\t\t\treturn nil, fmt.Errorf(\"view index %d out of range\", viewIndex)\n\t\t}\n\t\tviewIndex = len(xlsx.SheetViews.SheetView) + viewIndex\n\t} else if viewIndex >= len(xlsx.SheetViews.SheetView) {\n\t\treturn nil, fmt.Errorf(\"view index %d out of range\", viewIndex)\n\t}\n\n\treturn &(xlsx.SheetViews.SheetView[viewIndex]), nil\n}\n\n// SetSheetViewOptions sets sheet view options.\n// The viewIndex may be negative and if so is counted backward (-1 is the last view).\n//\n// Available options:\n// DefaultGridColor(bool)\n// RightToLeft(bool)\n// ShowFormulas(bool)\n// ShowGridLines(bool)\n// ShowRowColHeaders(bool)\n// Example:\n// err = f.SetSheetViewOptions(\"Sheet1\", -1, ShowGridLines(false))\nfunc (f *File) SetSheetViewOptions(name string, viewIndex int, opts ...SheetViewOption) error {\n\tview, err := f.getSheetView(name, viewIndex)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfor _, opt := range opts {\n\t\topt.setSheetViewOption(view)\n\t}\n\treturn nil\n}\n\n// GetSheetViewOptions gets the value of sheet view options.\n// The viewIndex may be negative and if so is counted backward (-1 is the last view).\n//\n// Available options:\n// DefaultGridColor(bool)\n// RightToLeft(bool)\n// ShowFormulas(bool)\n// ShowGridLines(bool)\n// ShowRowColHeaders(bool)\n// Example:\n// var showGridLines excelize.ShowGridLines\n// err = f.GetSheetViewOptions(\"Sheet1\", -1, &showGridLines)\nfunc (f *File) GetSheetViewOptions(name string, viewIndex int, opts ...SheetViewOptionPtr) error {\n\tview, err := f.getSheetView(name, viewIndex)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfor _, opt := range opts {\n\t\topt.getSheetViewOption(view)\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/styles.go", "content": "package excelize\n\nimport (\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"math\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Excel styles can reference number formats that are built-in, all of which\n// have an id less than 164. This is a possibly incomplete list comprised of as\n// many of them as I could find.\nvar builtInNumFmt = map[int]string{\n\t0: \"general\",\n\t1: \"0\",\n\t2: \"0.00\",\n\t3: \"#,##0\",\n\t4: \"#,##0.00\",\n\t9: \"0%\",\n\t10: \"0.00%\",\n\t11: \"0.00e+00\",\n\t12: \"# ?/?\",\n\t13: \"# ??/??\",\n\t14: \"mm-dd-yy\",\n\t15: \"d-mmm-yy\",\n\t16: \"d-mmm\",\n\t17: \"mmm-yy\",\n\t18: \"h:mm am/pm\",\n\t19: \"h:mm:ss am/pm\",\n\t20: \"h:mm\",\n\t21: \"h:mm:ss\",\n\t22: \"m/d/yy h:mm\",\n\t37: \"#,##0 ;(#,##0)\",\n\t38: \"#,##0 ;[red](#,##0)\",\n\t39: \"#,##0.00;(#,##0.00)\",\n\t40: \"#,##0.00;[red](#,##0.00)\",\n\t41: `_(* #,##0_);_(* \\(#,##0\\);_(* \"-\"_);_(@_)`,\n\t42: `_(\"$\"* #,##0_);_(\"$* \\(#,##0\\);_(\"$\"* \"-\"_);_(@_)`,\n\t43: `_(* #,##0.00_);_(* \\(#,##0.00\\);_(* \"-\"??_);_(@_)`,\n\t44: `_(\"$\"* #,##0.00_);_(\"$\"* \\(#,##0.00\\);_(\"$\"* \"-\"??_);_(@_)`,\n\t45: \"mm:ss\",\n\t46: \"[h]:mm:ss\",\n\t47: \"mmss.0\",\n\t48: \"##0.0e+0\",\n\t49: \"@\",\n}\n\n// langNumFmt defined number format code (with unicode values provided for\n// language glyphs where they occur) in different language.\nvar langNumFmt = map[string]map[int]string{\n\t\"zh-tw\": {\n\t\t27: \"[$-404]e/m/d\",\n\t\t28: `[$-404]e\"年\"m\"月\"d\"日\"`,\n\t\t29: `[$-404]e\"年\"m\"月\"d\"日\"`,\n\t\t30: \"m/d/yy\",\n\t\t31: `yyyy\"年\"m\"月\"d\"日\"`,\n\t\t32: `hh\"時\"mm\"分\"`,\n\t\t33: `hh\"時\"mm\"分\"ss\"秒\"`,\n\t\t34: `上午/下午 hh\"時\"mm\"分\"`,\n\t\t35: `上午/下午 hh\"時\"mm\"分\"ss\"秒\"`,\n\t\t36: \"[$-404]e/m/d\",\n\t\t50: \"[$-404]e/m/d\",\n\t\t51: `[$-404]e\"年\"m\"月\"d\"日\"`,\n\t\t52: `上午/下午 hh\"時\"mm\"分\"`,\n\t\t53: `上午/下午 hh\"時\"mm\"分\"ss\"秒\"`,\n\t\t54: `[$-404]e\"年\"m\"月\"d\"日\"`,\n\t\t55: `上午/下午 hh\"時\"mm\"分\"`,\n\t\t56: `上午/下午 hh\"時\"mm\"分\"ss\"秒\"`,\n\t\t57: \"[$-404]e/m/d\",\n\t\t58: `[$-404]e\"年\"m\"月\"d\"日\"`,\n\t},\n\t\"zh-cn\": {\n\t\t27: `yyyy\"年\"m\"月\"`,\n\t\t28: `m\"月\"d\"日\"`,\n\t\t29: `m\"月\"d\"日\"`,\n\t\t30: \"m-d-yy\",\n\t\t31: `yyyy\"年\"m\"月\"d\"日\"`,\n\t\t32: `h\"时\"mm\"分\"`,\n\t\t33: `h\"时\"mm\"分\"ss\"秒\"`,\n\t\t34: `上午/下午 h\"时\"mm\"分\"`,\n\t\t35: `上午/下午 h\"时\"mm\"分\"ss\"秒\"`,\n\t\t36: `yyyy\"年\"m\"月\"`,\n\t\t50: `yyyy\"年\"m\"月\"`,\n\t\t51: `m\"月\"d\"日\"`,\n\t\t52: `yyyy\"年\"m\"月\"`,\n\t\t53: `m\"月\"d\"日\"`,\n\t\t54: `m\"月\"d\"日\"`,\n\t\t55: `上午/下午 h\"时\"mm\"分\"`,\n\t\t56: `上午/下午 h\"时\"mm\"分\"ss\"秒\"`,\n\t\t57: `yyyy\"年\"m\"月\"`,\n\t\t58: `m\"月\"d\"日\"`,\n\t},\n\t\"zh-tw_unicode\": {\n\t\t27: \"[$-404]e/m/d\",\n\t\t28: `[$-404]e\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t29: `[$-404]e\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t30: \"m/d/yy\",\n\t\t31: `yyyy\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t32: `hh\"6642\"mm\"5206\"`,\n\t\t33: `hh\"6642\"mm\"5206\"ss\"79D2\"`,\n\t\t34: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"`,\n\t\t35: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\"`,\n\t\t36: \"[$-404]e/m/d\",\n\t\t50: \"[$-404]e/m/d\",\n\t\t51: `[$-404]e\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t52: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"`,\n\t\t53: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\"`,\n\t\t54: `[$-404]e\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t55: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"`,\n\t\t56: `4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\"`,\n\t\t57: \"[$-404]e/m/d\",\n\t\t58: `[$-404]e\"5E74\"m\"6708\"d\"65E5\"`,\n\t},\n\t\"zh-cn_unicode\": {\n\t\t27: `yyyy\"5E74\"m\"6708\"`,\n\t\t28: `m\"6708\"d\"65E5\"`,\n\t\t29: `m\"6708\"d\"65E5\"`,\n\t\t30: \"m-d-yy\",\n\t\t31: `yyyy\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t32: `h\"65F6\"mm\"5206\"`,\n\t\t33: `h\"65F6\"mm\"5206\"ss\"79D2\"`,\n\t\t34: `4E0A5348/4E0B5348h\"65F6\"mm\"5206\"`,\n\t\t35: `4E0A5348/4E0B5348h\"65F6\"mm\"5206\"ss\"79D2\"`,\n\t\t36: `yyyy\"5E74\"m\"6708\"`,\n\t\t50: `yyyy\"5E74\"m\"6708\"`,\n\t\t51: `m\"6708\"d\"65E5\"`,\n\t\t52: `yyyy\"5E74\"m\"6708\"`,\n\t\t53: `m\"6708\"d\"65E5\"`,\n\t\t54: `m\"6708\"d\"65E5\"`,\n\t\t55: `4E0A5348/4E0B5348h\"65F6\"mm\"5206\"`,\n\t\t56: `4E0A5348/4E0B5348h\"65F6\"mm\"5206\"ss\"79D2\"`,\n\t\t57: `yyyy\"5E74\"m\"6708\"`,\n\t\t58: `m\"6708\"d\"65E5\"`,\n\t},\n\t\"ja-jp\": {\n\t\t27: \"[$-411]ge.m.d\",\n\t\t28: `[$-411]ggge\"年\"m\"月\"d\"日\"`,\n\t\t29: `[$-411]ggge\"年\"m\"月\"d\"日\"`,\n\t\t30: \"m/d/yy\",\n\t\t31: `yyyy\"年\"m\"月\"d\"日\"`,\n\t\t32: `h\"時\"mm\"分\"`,\n\t\t33: `h\"時\"mm\"分\"ss\"秒\"`,\n\t\t34: `yyyy\"年\"m\"月\"`,\n\t\t35: `m\"月\"d\"日\"`,\n\t\t36: \"[$-411]ge.m.d\",\n\t\t50: \"[$-411]ge.m.d\",\n\t\t51: `[$-411]ggge\"年\"m\"月\"d\"日\"`,\n\t\t52: `yyyy\"年\"m\"月\"`,\n\t\t53: `m\"月\"d\"日\"`,\n\t\t54: `[$-411]ggge\"年\"m\"月\"d\"日\"`,\n\t\t55: `yyyy\"年\"m\"月\"`,\n\t\t56: `m\"月\"d\"日\"`,\n\t\t57: \"[$-411]ge.m.d\",\n\t\t58: `[$-411]ggge\"年\"m\"月\"d\"日\"`,\n\t},\n\t\"ko-kr\": {\n\t\t27: `yyyy\"年\" mm\"月\" dd\"日\"`,\n\t\t28: \"mm-dd\",\n\t\t29: \"mm-dd\",\n\t\t30: \"mm-dd-yy\",\n\t\t31: `yyyy\"년\" mm\"월\" dd\"일\"`,\n\t\t32: `h\"시\" mm\"분\"`,\n\t\t33: `h\"시\" mm\"분\" ss\"초\"`,\n\t\t34: `yyyy-mm-dd`,\n\t\t35: `yyyy-mm-dd`,\n\t\t36: `yyyy\"年\" mm\"月\" dd\"日\"`,\n\t\t50: `yyyy\"年\" mm\"月\" dd\"日\"`,\n\t\t51: \"mm-dd\",\n\t\t52: \"yyyy-mm-dd\",\n\t\t53: \"yyyy-mm-dd\",\n\t\t54: \"mm-dd\",\n\t\t55: \"yyyy-mm-dd\",\n\t\t56: \"yyyy-mm-dd\",\n\t\t57: `yyyy\"年\" mm\"月\" dd\"日\"`,\n\t\t58: \"mm-dd\",\n\t},\n\t\"ja-jp_unicode\": {\n\t\t27: \"[$-411]ge.m.d\",\n\t\t28: `[$-411]ggge\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t29: `[$-411]ggge\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t30: \"m/d/yy\",\n\t\t31: `yyyy\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t32: `h\"6642\"mm\"5206\"`,\n\t\t33: `h\"6642\"mm\"5206\"ss\"79D2\"`,\n\t\t34: `yyyy\"5E74\"m\"6708\"`,\n\t\t35: `m\"6708\"d\"65E5\"`,\n\t\t36: \"[$-411]ge.m.d\",\n\t\t50: \"[$-411]ge.m.d\",\n\t\t51: `[$-411]ggge\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t52: `yyyy\"5E74\"m\"6708\"`,\n\t\t53: `m\"6708\"d\"65E5\"`,\n\t\t54: `[$-411]ggge\"5E74\"m\"6708\"d\"65E5\"`,\n\t\t55: `yyyy\"5E74\"m\"6708\"`,\n\t\t56: `m\"6708\"d\"65E5\"`,\n\t\t57: \"[$-411]ge.m.d\",\n\t\t58: `[$-411]ggge\"5E74\"m\"6708\"d\"65E5\"`,\n\t},\n\t\"ko-kr_unicode\": {\n\t\t27: `yyyy\"5E74\" mm\"6708\" dd\"65E5\"`,\n\t\t28: \"mm-dd\",\n\t\t29: \"mm-dd\",\n\t\t30: \"mm-dd-yy\",\n\t\t31: `yyyy\"B144\" mm\"C6D4\" dd\"C77C\"`,\n\t\t32: `h\"C2DC\" mm\"BD84\"`,\n\t\t33: `h\"C2DC\" mm\"BD84\" ss\"CD08\"`,\n\t\t34: \"yyyy-mm-dd\",\n\t\t35: \"yyyy-mm-dd\",\n\t\t36: `yyyy\"5E74\" mm\"6708\" dd\"65E5\"`,\n\t\t50: `yyyy\"5E74\" mm\"6708\" dd\"65E5\"`,\n\t\t51: \"mm-dd\",\n\t\t52: \"yyyy-mm-dd\",\n\t\t53: \"yyyy-mm-dd\",\n\t\t54: \"mm-dd\",\n\t\t55: \"yyyy-mm-dd\",\n\t\t56: \"yyyy-mm-dd\",\n\t\t57: `yyyy\"5E74\" mm\"6708\" dd\"65E5\"`,\n\t\t58: \"mm-dd\",\n\t},\n\t\"th-th\": {\n\t\t59: \"t0\",\n\t\t60: \"t0.00\",\n\t\t61: \"t#,##0\",\n\t\t62: \"t#,##0.00\",\n\t\t67: \"t0%\",\n\t\t68: \"t0.00%\",\n\t\t69: \"t# ?/?\",\n\t\t70: \"t# ??/??\",\n\t\t71: \"ว/ด/ปปปป\",\n\t\t72: \"ว-ดดด-ปป\",\n\t\t73: \"ว-ดดด\",\n\t\t74: \"ดดด-ปป\",\n\t\t75: \"ช:นน\",\n\t\t76: \"ช:นน:ทท\",\n\t\t77: \"ว/ด/ปปปป ช:นน\",\n\t\t78: \"นน:ทท\",\n\t\t79: \"[ช]:นน:ทท\",\n\t\t80: \"นน:ทท.0\",\n\t\t81: \"d/m/bb\",\n\t},\n\t\"th-th_unicode\": {\n\t\t59: \"t0\",\n\t\t60: \"t0.00\",\n\t\t61: \"t#,##0\",\n\t\t62: \"t#,##0.00\",\n\t\t67: \"t0%\",\n\t\t68: \"t0.00%\",\n\t\t69: \"t# ?/?\",\n\t\t70: \"t# ??/??\",\n\t\t71: \"0E27/0E14/0E1B0E1B0E1B0E1B\",\n\t\t72: \"0E27-0E140E140E14-0E1B0E1B\",\n\t\t73: \"0E27-0E140E140E14\",\n\t\t74: \"0E140E140E14-0E1B0E1B\",\n\t\t75: \"0E0A:0E190E19\",\n\t\t76: \"0E0A:0E190E19:0E170E17\",\n\t\t77: \"0E27/0E14/0E1B0E1B0E1B0E1B 0E0A:0E190E19\",\n\t\t78: \"0E190E19:0E170E17\",\n\t\t79: \"[0E0A]:0E190E19:0E170E17\",\n\t\t80: \"0E190E19:0E170E17.0\",\n\t\t81: \"d/m/bb\",\n\t},\n}\n\n// currencyNumFmt defined the currency number format map.\nvar currencyNumFmt = map[int]string{\n\t164: `\"CN¥\",##0.00`,\n\t165: \"[$$-409]#,##0.00\",\n\t166: \"[$$-45C]#,##0.00\",\n\t167: \"[$$-1004]#,##0.00\",\n\t168: \"[$$-404]#,##0.00\",\n\t169: \"[$$-C09]#,##0.00\",\n\t170: \"[$$-2809]#,##0.00\",\n\t171: \"[$$-1009]#,##0.00\",\n\t172: \"[$$-2009]#,##0.00\",\n\t173: \"[$$-1409]#,##0.00\",\n\t174: \"[$$-4809]#,##0.00\",\n\t175: \"[$$-2C09]#,##0.00\",\n\t176: \"[$$-2409]#,##0.00\",\n\t177: \"[$$-1000]#,##0.00\",\n\t178: `#,##0.00\\ [$$-C0C]`,\n\t179: \"[$$-475]#,##0.00\",\n\t180: \"[$$-83E]#,##0.00\",\n\t181: `[$$-86B]\\ #,##0.00`,\n\t182: `[$$-340A]\\ #,##0.00`,\n\t183: \"[$$-240A]#,##0.00\",\n\t184: `[$$-300A]\\ #,##0.00`,\n\t185: \"[$$-440A]#,##0.00\",\n\t186: \"[$$-80A]#,##0.00\",\n\t187: \"[$$-500A]#,##0.00\",\n\t188: \"[$$-540A]#,##0.00\",\n\t189: `[$$-380A]\\ #,##0.00`,\n\t190: \"[$£-809]#,##0.00\",\n\t191: \"[$£-491]#,##0.00\",\n\t192: \"[$£-452]#,##0.00\",\n\t193: \"[$¥-804]#,##0.00\",\n\t194: \"[$¥-411]#,##0.00\",\n\t195: \"[$¥-478]#,##0.00\",\n\t196: \"[$¥-451]#,##0.00\",\n\t197: \"[$¥-480]#,##0.00\",\n\t198: \"#,##0.00\\\\ [$\\u058F-42B]\",\n\t199: \"[$\\u060B-463]#,##0.00\",\n\t200: \"[$\\u060B-48C]#,##0.00\",\n\t201: \"[$\\u09F3-845]\\\\ #,##0.00\",\n\t202: \"#,##0.00[$\\u17DB-453]\",\n\t203: \"[$\\u20A1-140A]#,##0.00\",\n\t204: \"[$\\u20A6-468]\\\\ #,##0.00\",\n\t205: \"[$\\u20A6-470]\\\\ #,##0.00\",\n\t206: \"[$\\u20A9-412]#,##0.00\",\n\t207: \"[$\\u20AA-40D]\\\\ #,##0.00\",\n\t208: \"#,##0.00\\\\ [$\\u20AB-42A]\",\n\t209: \"#,##0.00\\\\ [$\\u20AC-42D]\",\n\t210: \"#,##0.00\\\\ [$\\u20AC-47E]\",\n\t211: \"#,##0.00\\\\ [$\\u20AC-403]\",\n\t212: \"#,##0.00\\\\ [$\\u20AC-483]\",\n\t213: \"[$\\u20AC-813]\\\\ #,##0.00\",\n\t214: \"[$\\u20AC-413]\\\\ #,##0.00\",\n\t215: \"[$\\u20AC-1809]#,##0.00\",\n\t216: \"#,##0.00\\\\ [$\\u20AC-425]\",\n\t217: \"[$\\u20AC-2]\\\\ #,##0.00\",\n\t218: \"#,##0.00\\\\ [$\\u20AC-1]\",\n\t219: \"#,##0.00\\\\ [$\\u20AC-40B]\",\n\t220: \"#,##0.00\\\\ [$\\u20AC-80C]\",\n\t221: \"#,##0.00\\\\ [$\\u20AC-40C]\",\n\t222: \"#,##0.00\\\\ [$\\u20AC-140C]\",\n\t223: \"#,##0.00\\\\ [$\\u20AC-180C]\",\n\t224: \"[$\\u20AC-200C]#,##0.00\",\n\t225: \"#,##0.00\\\\ [$\\u20AC-456]\",\n\t226: \"#,##0.00\\\\ [$\\u20AC-C07]\",\n\t227: \"#,##0.00\\\\ [$\\u20AC-407]\",\n\t228: \"#,##0.00\\\\ [$\\u20AC-1007]\",\n\t229: \"#,##0.00\\\\ [$\\u20AC-408]\",\n\t230: \"#,##0.00\\\\ [$\\u20AC-243B]\",\n\t231: \"[$\\u20AC-83C]#,##0.00\",\n\t232: \"[$\\u20AC-410]\\\\ #,##0.00\",\n\t233: \"[$\\u20AC-476]#,##0.00\",\n\t234: \"#,##0.00\\\\ [$\\u20AC-2C1A]\",\n\t235: \"[$\\u20AC-426]\\\\ #,##0.00\",\n\t236: \"#,##0.00\\\\ [$\\u20AC-427]\",\n\t237: \"#,##0.00\\\\ [$\\u20AC-82E]\",\n\t238: \"#,##0.00\\\\ [$\\u20AC-46E]\",\n\t239: \"[$\\u20AC-43A]#,##0.00\",\n\t240: \"#,##0.00\\\\ [$\\u20AC-C3B]\",\n\t241: \"#,##0.00\\\\ [$\\u20AC-482]\",\n\t242: \"#,##0.00\\\\ [$\\u20AC-816]\",\n\t243: \"#,##0.00\\\\ [$\\u20AC-301A]\",\n\t244: \"#,##0.00\\\\ [$\\u20AC-203B]\",\n\t245: \"#,##0.00\\\\ [$\\u20AC-41B]\",\n\t246: \"#,##0.00\\\\ [$\\u20AC-424]\",\n\t247: \"#,##0.00\\\\ [$\\u20AC-C0A]\",\n\t248: \"#,##0.00\\\\ [$\\u20AC-81D]\",\n\t249: \"#,##0.00\\\\ [$\\u20AC-484]\",\n\t250: \"#,##0.00\\\\ [$\\u20AC-42E]\",\n\t251: \"[$\\u20AC-462]\\\\ #,##0.00\",\n\t252: \"#,##0.00\\\\ [$₭-454]\",\n\t253: \"#,##0.00\\\\ [$₮-450]\",\n\t254: \"[$\\u20AE-C50]#,##0.00\",\n\t255: \"[$\\u20B1-3409]#,##0.00\",\n\t256: \"[$\\u20B1-464]#,##0.00\",\n\t257: \"#,##0.00[$\\u20B4-422]\",\n\t258: \"[$\\u20B8-43F]#,##0.00\",\n\t259: \"[$\\u20B9-460]#,##0.00\",\n\t260: \"[$\\u20B9-4009]\\\\ #,##0.00\",\n\t261: \"[$\\u20B9-447]\\\\ #,##0.00\",\n\t262: \"[$\\u20B9-439]\\\\ #,##0.00\",\n\t263: \"[$\\u20B9-44B]\\\\ #,##0.00\",\n\t264: \"[$\\u20B9-860]#,##0.00\",\n\t265: \"[$\\u20B9-457]\\\\ #,##0.00\",\n\t266: \"[$\\u20B9-458]#,##0.00\",\n\t267: \"[$\\u20B9-44E]\\\\ #,##0.00\",\n\t268: \"[$\\u20B9-861]#,##0.00\",\n\t269: \"[$\\u20B9-448]\\\\ #,##0.00\",\n\t270: \"[$\\u20B9-446]\\\\ #,##0.00\",\n\t271: \"[$\\u20B9-44F]\\\\ #,##0.00\",\n\t272: \"[$\\u20B9-459]#,##0.00\",\n\t273: \"[$\\u20B9-449]\\\\ #,##0.00\",\n\t274: \"[$\\u20B9-820]#,##0.00\",\n\t275: \"#,##0.00\\\\ [$\\u20BA-41F]\",\n\t276: \"#,##0.00\\\\ [$\\u20BC-42C]\",\n\t277: \"#,##0.00\\\\ [$\\u20BC-82C]\",\n\t278: \"#,##0.00\\\\ [$\\u20BD-419]\",\n\t279: \"#,##0.00[$\\u20BD-485]\",\n\t280: \"#,##0.00\\\\ [$\\u20BE-437]\",\n\t281: \"[$B/.-180A]\\\\ #,##0.00\",\n\t282: \"[$Br-472]#,##0.00\",\n\t283: \"[$Br-477]#,##0.00\",\n\t284: \"#,##0.00[$Br-473]\",\n\t285: \"[$Bs-46B]\\\\ #,##0.00\",\n\t286: \"[$Bs-400A]\\\\ #,##0.00\",\n\t287: \"[$Bs.-200A]\\\\ #,##0.00\",\n\t288: \"[$BWP-832]\\\\ #,##0.00\",\n\t289: \"[$C$-4C0A]#,##0.00\",\n\t290: \"[$CA$-85D]#,##0.00\",\n\t291: \"[$CA$-47C]#,##0.00\",\n\t292: \"[$CA$-45D]#,##0.00\",\n\t293: \"[$CFA-340C]#,##0.00\",\n\t294: \"[$CFA-280C]#,##0.00\",\n\t295: \"#,##0.00\\\\ [$CFA-867]\",\n\t296: \"#,##0.00\\\\ [$CFA-488]\",\n\t297: \"#,##0.00\\\\ [$CHF-100C]\",\n\t298: \"[$CHF-1407]\\\\ #,##0.00\",\n\t299: \"[$CHF-807]\\\\ #,##0.00\",\n\t300: \"[$CHF-810]\\\\ #,##0.00\",\n\t301: \"[$CHF-417]\\\\ #,##0.00\",\n\t302: \"[$CLP-47A]\\\\ #,##0.00\",\n\t303: \"[$CN¥-850]#,##0.00\",\n\t304: \"#,##0.00\\\\ [$DZD-85F]\",\n\t305: \"[$FCFA-2C0C]#,##0.00\",\n\t306: \"#,##0.00\\\\ [$Ft-40E]\",\n\t307: \"[$G-3C0C]#,##0.00\",\n\t308: \"[$Gs.-3C0A]\\\\ #,##0.00\",\n\t309: \"[$GTQ-486]#,##0.00\",\n\t310: \"[$HK$-C04]#,##0.00\",\n\t311: \"[$HK$-3C09]#,##0.00\",\n\t312: \"#,##0.00\\\\ [$HRK-41A]\",\n\t313: \"[$IDR-3809]#,##0.00\",\n\t314: \"[$IQD-492]#,##0.00\",\n\t315: \"#,##0.00\\\\ [$ISK-40F]\",\n\t316: \"[$K-455]#,##0.00\",\n\t317: \"#,##0.00\\\\ [$K\\u010D-405]\",\n\t318: \"#,##0.00\\\\ [$KM-141A]\",\n\t319: \"#,##0.00\\\\ [$KM-101A]\",\n\t320: \"#,##0.00\\\\ [$KM-181A]\",\n\t321: \"[$kr-438]\\\\ #,##0.00\",\n\t322: \"[$kr-43B]\\\\ #,##0.00\",\n\t323: \"#,##0.00\\\\ [$kr-83B]\",\n\t324: \"[$kr-414]\\\\ #,##0.00\",\n\t325: \"[$kr-814]\\\\ #,##0.00\",\n\t326: \"#,##0.00\\\\ [$kr-41D]\",\n\t327: \"[$kr.-406]\\\\ #,##0.00\",\n\t328: \"[$kr.-46F]\\\\ #,##0.00\",\n\t329: \"[$Ksh-441]#,##0.00\",\n\t330: \"[$L-818]#,##0.00\",\n\t331: \"[$L-819]#,##0.00\",\n\t332: \"[$L-480A]\\\\ #,##0.00\",\n\t333: \"#,##0.00\\\\ [$Lek\\u00EB-41C]\",\n\t334: \"[$MAD-45F]#,##0.00\",\n\t335: \"[$MAD-380C]#,##0.00\",\n\t336: \"#,##0.00\\\\ [$MAD-105F]\",\n\t337: \"[$MOP$-1404]#,##0.00\",\n\t338: \"#,##0.00\\\\ [$MVR-465]_-\",\n\t339: \"#,##0.00[$Nfk-873]\",\n\t340: \"[$NGN-466]#,##0.00\",\n\t341: \"[$NGN-467]#,##0.00\",\n\t342: \"[$NGN-469]#,##0.00\",\n\t343: \"[$NGN-471]#,##0.00\",\n\t344: \"[$NOK-103B]\\\\ #,##0.00\",\n\t345: \"[$NOK-183B]\\\\ #,##0.00\",\n\t346: \"[$NZ$-481]#,##0.00\",\n\t347: \"[$PKR-859]\\\\ #,##0.00\",\n\t348: \"[$PYG-474]#,##0.00\",\n\t349: \"[$Q-100A]#,##0.00\",\n\t350: \"[$R-436]\\\\ #,##0.00\",\n\t351: \"[$R-1C09]\\\\ #,##0.00\",\n\t352: \"[$R-435]\\\\ #,##0.00\",\n\t353: \"[$R$-416]\\\\ #,##0.00\",\n\t354: \"[$RD$-1C0A]#,##0.00\",\n\t355: \"#,##0.00\\\\ [$RF-487]\",\n\t356: \"[$RM-4409]#,##0.00\",\n\t357: \"[$RM-43E]#,##0.00\",\n\t358: \"#,##0.00\\\\ [$RON-418]\",\n\t359: \"[$Rp-421]#,##0.00\",\n\t360: \"[$Rs-420]#,##0.00_-\",\n\t361: \"[$Rs.-849]\\\\ #,##0.00\",\n\t362: \"#,##0.00\\\\ [$RSD-81A]\",\n\t363: \"#,##0.00\\\\ [$RSD-C1A]\",\n\t364: \"#,##0.00\\\\ [$RUB-46D]\",\n\t365: \"#,##0.00\\\\ [$RUB-444]\",\n\t366: \"[$S/.-C6B]\\\\ #,##0.00\",\n\t367: \"[$S/.-280A]\\\\ #,##0.00\",\n\t368: \"#,##0.00\\\\ [$SEK-143B]\",\n\t369: \"#,##0.00\\\\ [$SEK-1C3B]\",\n\t370: \"#,##0.00\\\\ [$so\\u02BBm-443]\",\n\t371: \"#,##0.00\\\\ [$so\\u02BBm-843]\",\n\t372: \"#,##0.00\\\\ [$SYP-45A]\",\n\t373: \"[$THB-41E]#,##0.00\",\n\t374: \"#,##0.00[$TMT-442]\",\n\t375: \"[$US$-3009]#,##0.00\",\n\t376: \"[$ZAR-46C]\\\\ #,##0.00\",\n\t377: \"[$ZAR-430]#,##0.00\",\n\t378: \"[$ZAR-431]#,##0.00\",\n\t379: \"[$ZAR-432]\\\\ #,##0.00\",\n\t380: \"[$ZAR-433]#,##0.00\",\n\t381: \"[$ZAR-434]\\\\ #,##0.00\",\n\t382: \"#,##0.00\\\\ [$z\\u0142-415]\",\n\t383: \"#,##0.00\\\\ [$\\u0434\\u0435\\u043D-42F]\",\n\t384: \"#,##0.00\\\\ [$КМ-201A]\",\n\t385: \"#,##0.00\\\\ [$КМ-1C1A]\",\n\t386: \"#,##0.00\\\\ [$\\u043B\\u0432.-402]\",\n\t387: \"#,##0.00\\\\ [$р.-423]\",\n\t388: \"#,##0.00\\\\ [$\\u0441\\u043E\\u043C-440]\",\n\t389: \"#,##0.00\\\\ [$\\u0441\\u043E\\u043C-428]\",\n\t390: \"[$\\u062C.\\u0645.-C01]\\\\ #,##0.00_-\",\n\t391: \"[$\\u062F.\\u0623.-2C01]\\\\ #,##0.00_-\",\n\t392: \"[$\\u062F.\\u0625.-3801]\\\\ #,##0.00_-\",\n\t393: \"[$\\u062F.\\u0628.-3C01]\\\\ #,##0.00_-\",\n\t394: \"[$\\u062F.\\u062A.-1C01]\\\\ #,##0.00_-\",\n\t395: \"[$\\u062F.\\u062C.-1401]\\\\ #,##0.00_-\",\n\t396: \"[$\\u062F.\\u0639.-801]\\\\ #,##0.00_-\",\n\t397: \"[$\\u062F.\\u0643.-3401]\\\\ #,##0.00_-\",\n\t398: \"[$\\u062F.\\u0644.-1001]#,##0.00_-\",\n\t399: \"[$\\u062F.\\u0645.-1801]\\\\ #,##0.00_-\",\n\t400: \"[$\\u0631-846]\\\\ #,##0.00\",\n\t401: \"[$\\u0631.\\u0633.-401]\\\\ #,##0.00_-\",\n\t402: \"[$\\u0631.\\u0639.-2001]\\\\ #,##0.00_-\",\n\t403: \"[$\\u0631.\\u0642.-4001]\\\\ #,##0.00_-\",\n\t404: \"[$\\u0631.\\u064A.-2401]\\\\ #,##0.00_-\",\n\t405: \"[$\\u0631\\u06CC\\u0627\\u0644-429]#,##0.00_-\",\n\t406: \"[$\\u0644.\\u0633.-2801]\\\\ #,##0.00_-\",\n\t407: \"[$\\u0644.\\u0644.-3001]\\\\ #,##0.00_-\",\n\t408: \"[$\\u1265\\u122D-45E]#,##0.00\",\n\t409: \"[$\\u0930\\u0942-461]#,##0.00\",\n\t410: \"[$\\u0DBB\\u0DD4.-45B]\\\\ #,##0.00\",\n\t411: \"[$ADP]\\\\ #,##0.00\",\n\t412: \"[$AED]\\\\ #,##0.00\",\n\t413: \"[$AFA]\\\\ #,##0.00\",\n\t414: \"[$AFN]\\\\ #,##0.00\",\n\t415: \"[$ALL]\\\\ #,##0.00\",\n\t416: \"[$AMD]\\\\ #,##0.00\",\n\t417: \"[$ANG]\\\\ #,##0.00\",\n\t418: \"[$AOA]\\\\ #,##0.00\",\n\t419: \"[$ARS]\\\\ #,##0.00\",\n\t420: \"[$ATS]\\\\ #,##0.00\",\n\t421: \"[$AUD]\\\\ #,##0.00\",\n\t422: \"[$AWG]\\\\ #,##0.00\",\n\t423: \"[$AZM]\\\\ #,##0.00\",\n\t424: \"[$AZN]\\\\ #,##0.00\",\n\t425: \"[$BAM]\\\\ #,##0.00\",\n\t426: \"[$BBD]\\\\ #,##0.00\",\n\t427: \"[$BDT]\\\\ #,##0.00\",\n\t428: \"[$BEF]\\\\ #,##0.00\",\n\t429: \"[$BGL]\\\\ #,##0.00\",\n\t430: \"[$BGN]\\\\ #,##0.00\",\n\t431: \"[$BHD]\\\\ #,##0.00\",\n\t432: \"[$BIF]\\\\ #,##0.00\",\n\t433: \"[$BMD]\\\\ #,##0.00\",\n\t434: \"[$BND]\\\\ #,##0.00\",\n\t435: \"[$BOB]\\\\ #,##0.00\",\n\t436: \"[$BOV]\\\\ #,##0.00\",\n\t437: \"[$BRL]\\\\ #,##0.00\",\n\t438: \"[$BSD]\\\\ #,##0.00\",\n\t439: \"[$BTN]\\\\ #,##0.00\",\n\t440: \"[$BWP]\\\\ #,##0.00\",\n\t441: \"[$BYR]\\\\ #,##0.00\",\n\t442: \"[$BZD]\\\\ #,##0.00\",\n\t443: \"[$CAD]\\\\ #,##0.00\",\n\t444: \"[$CDF]\\\\ #,##0.00\",\n\t445: \"[$CHE]\\\\ #,##0.00\",\n\t446: \"[$CHF]\\\\ #,##0.00\",\n\t447: \"[$CHW]\\\\ #,##0.00\",\n\t448: \"[$CLF]\\\\ #,##0.00\",\n\t449: \"[$CLP]\\\\ #,##0.00\",\n\t450: \"[$CNY]\\\\ #,##0.00\",\n\t451: \"[$COP]\\\\ #,##0.00\",\n\t452: \"[$COU]\\\\ #,##0.00\",\n\t453: \"[$CRC]\\\\ #,##0.00\",\n\t454: \"[$CSD]\\\\ #,##0.00\",\n\t455: \"[$CUC]\\\\ #,##0.00\",\n\t456: \"[$CVE]\\\\ #,##0.00\",\n\t457: \"[$CYP]\\\\ #,##0.00\",\n\t458: \"[$CZK]\\\\ #,##0.00\",\n\t459: \"[$DEM]\\\\ #,##0.00\",\n\t460: \"[$DJF]\\\\ #,##0.00\",\n\t461: \"[$DKK]\\\\ #,##0.00\",\n\t462: \"[$DOP]\\\\ #,##0.00\",\n\t463: \"[$DZD]\\\\ #,##0.00\",\n\t464: \"[$ECS]\\\\ #,##0.00\",\n\t465: \"[$ECV]\\\\ #,##0.00\",\n\t466: \"[$EEK]\\\\ #,##0.00\",\n\t467: \"[$EGP]\\\\ #,##0.00\",\n\t468: \"[$ERN]\\\\ #,##0.00\",\n\t469: \"[$ESP]\\\\ #,##0.00\",\n\t470: \"[$ETB]\\\\ #,##0.00\",\n\t471: \"[$EUR]\\\\ #,##0.00\",\n\t472: \"[$FIM]\\\\ #,##0.00\",\n\t473: \"[$FJD]\\\\ #,##0.00\",\n\t474: \"[$FKP]\\\\ #,##0.00\",\n\t475: \"[$FRF]\\\\ #,##0.00\",\n\t476: \"[$GBP]\\\\ #,##0.00\",\n\t477: \"[$GEL]\\\\ #,##0.00\",\n\t478: \"[$GHC]\\\\ #,##0.00\",\n\t479: \"[$GHS]\\\\ #,##0.00\",\n\t480: \"[$GIP]\\\\ #,##0.00\",\n\t481: \"[$GMD]\\\\ #,##0.00\",\n\t482: \"[$GNF]\\\\ #,##0.00\",\n\t483: \"[$GRD]\\\\ #,##0.00\",\n\t484: \"[$GTQ]\\\\ #,##0.00\",\n\t485: \"[$GYD]\\\\ #,##0.00\",\n\t486: \"[$HKD]\\\\ #,##0.00\",\n\t487: \"[$HNL]\\\\ #,##0.00\",\n\t488: \"[$HRK]\\\\ #,##0.00\",\n\t489: \"[$HTG]\\\\ #,##0.00\",\n\t490: \"[$HUF]\\\\ #,##0.00\",\n\t491: \"[$IDR]\\\\ #,##0.00\",\n\t492: \"[$IEP]\\\\ #,##0.00\",\n\t493: \"[$ILS]\\\\ #,##0.00\",\n\t494: \"[$INR]\\\\ #,##0.00\",\n\t495: \"[$IQD]\\\\ #,##0.00\",\n\t496: \"[$IRR]\\\\ #,##0.00\",\n\t497: \"[$ISK]\\\\ #,##0.00\",\n\t498: \"[$ITL]\\\\ #,##0.00\",\n\t499: \"[$JMD]\\\\ #,##0.00\",\n\t500: \"[$JOD]\\\\ #,##0.00\",\n\t501: \"[$JPY]\\\\ #,##0.00\",\n\t502: \"[$KAF]\\\\ #,##0.00\",\n\t503: \"[$KES]\\\\ #,##0.00\",\n\t504: \"[$KGS]\\\\ #,##0.00\",\n\t505: \"[$KHR]\\\\ #,##0.00\",\n\t506: \"[$KMF]\\\\ #,##0.00\",\n\t507: \"[$KPW]\\\\ #,##0.00\",\n\t508: \"[$KRW]\\\\ #,##0.00\",\n\t509: \"[$KWD]\\\\ #,##0.00\",\n\t510: \"[$KYD]\\\\ #,##0.00\",\n\t511: \"[$KZT]\\\\ #,##0.00\",\n\t512: \"[$LAK]\\\\ #,##0.00\",\n\t513: \"[$LBP]\\\\ #,##0.00\",\n\t514: \"[$LKR]\\\\ #,##0.00\",\n\t515: \"[$LRD]\\\\ #,##0.00\",\n\t516: \"[$LSL]\\\\ #,##0.00\",\n\t517: \"[$LTL]\\\\ #,##0.00\",\n\t518: \"[$LUF]\\\\ #,##0.00\",\n\t519: \"[$LVL]\\\\ #,##0.00\",\n\t520: \"[$LYD]\\\\ #,##0.00\",\n\t521: \"[$MAD]\\\\ #,##0.00\",\n\t522: \"[$MDL]\\\\ #,##0.00\",\n\t523: \"[$MGA]\\\\ #,##0.00\",\n\t524: \"[$MGF]\\\\ #,##0.00\",\n\t525: \"[$MKD]\\\\ #,##0.00\",\n\t526: \"[$MMK]\\\\ #,##0.00\",\n\t527: \"[$MNT]\\\\ #,##0.00\",\n\t528: \"[$MOP]\\\\ #,##0.00\",\n\t529: \"[$MRO]\\\\ #,##0.00\",\n\t530: \"[$MTL]\\\\ #,##0.00\",\n\t531: \"[$MUR]\\\\ #,##0.00\",\n\t532: \"[$MVR]\\\\ #,##0.00\",\n\t533: \"[$MWK]\\\\ #,##0.00\",\n\t534: \"[$MXN]\\\\ #,##0.00\",\n\t535: \"[$MXV]\\\\ #,##0.00\",\n\t536: \"[$MYR]\\\\ #,##0.00\",\n\t537: \"[$MZM]\\\\ #,##0.00\",\n\t538: \"[$MZN]\\\\ #,##0.00\",\n\t539: \"[$NAD]\\\\ #,##0.00\",\n\t540: \"[$NGN]\\\\ #,##0.00\",\n\t541: \"[$NIO]\\\\ #,##0.00\",\n\t542: \"[$NLG]\\\\ #,##0.00\",\n\t543: \"[$NOK]\\\\ #,##0.00\",\n\t544: \"[$NPR]\\\\ #,##0.00\",\n\t545: \"[$NTD]\\\\ #,##0.00\",\n\t546: \"[$NZD]\\\\ #,##0.00\",\n\t547: \"[$OMR]\\\\ #,##0.00\",\n\t548: \"[$PAB]\\\\ #,##0.00\",\n\t549: \"[$PEN]\\\\ #,##0.00\",\n\t550: \"[$PGK]\\\\ #,##0.00\",\n\t551: \"[$PHP]\\\\ #,##0.00\",\n\t552: \"[$PKR]\\\\ #,##0.00\",\n\t553: \"[$PLN]\\\\ #,##0.00\",\n\t554: \"[$PTE]\\\\ #,##0.00\",\n\t555: \"[$PYG]\\\\ #,##0.00\",\n\t556: \"[$QAR]\\\\ #,##0.00\",\n\t557: \"[$ROL]\\\\ #,##0.00\",\n\t558: \"[$RON]\\\\ #,##0.00\",\n\t559: \"[$RSD]\\\\ #,##0.00\",\n\t560: \"[$RUB]\\\\ #,##0.00\",\n\t561: \"[$RUR]\\\\ #,##0.00\",\n\t562: \"[$RWF]\\\\ #,##0.00\",\n\t563: \"[$SAR]\\\\ #,##0.00\",\n\t564: \"[$SBD]\\\\ #,##0.00\",\n\t565: \"[$SCR]\\\\ #,##0.00\",\n\t566: \"[$SDD]\\\\ #,##0.00\",\n\t567: \"[$SDG]\\\\ #,##0.00\",\n\t568: \"[$SDP]\\\\ #,##0.00\",\n\t569: \"[$SEK]\\\\ #,##0.00\",\n\t570: \"[$SGD]\\\\ #,##0.00\",\n\t571: \"[$SHP]\\\\ #,##0.00\",\n\t572: \"[$SIT]\\\\ #,##0.00\",\n\t573: \"[$SKK]\\\\ #,##0.00\",\n\t574: \"[$SLL]\\\\ #,##0.00\",\n\t575: \"[$SOS]\\\\ #,##0.00\",\n\t576: \"[$SPL]\\\\ #,##0.00\",\n\t577: \"[$SRD]\\\\ #,##0.00\",\n\t578: \"[$SRG]\\\\ #,##0.00\",\n\t579: \"[$STD]\\\\ #,##0.00\",\n\t580: \"[$SVC]\\\\ #,##0.00\",\n\t581: \"[$SYP]\\\\ #,##0.00\",\n\t582: \"[$SZL]\\\\ #,##0.00\",\n\t583: \"[$THB]\\\\ #,##0.00\",\n\t584: \"[$TJR]\\\\ #,##0.00\",\n\t585: \"[$TJS]\\\\ #,##0.00\",\n\t586: \"[$TMM]\\\\ #,##0.00\",\n\t587: \"[$TMT]\\\\ #,##0.00\",\n\t588: \"[$TND]\\\\ #,##0.00\",\n\t589: \"[$TOP]\\\\ #,##0.00\",\n\t590: \"[$TRL]\\\\ #,##0.00\",\n\t591: \"[$TRY]\\\\ #,##0.00\",\n\t592: \"[$TTD]\\\\ #,##0.00\",\n\t593: \"[$TWD]\\\\ #,##0.00\",\n\t594: \"[$TZS]\\\\ #,##0.00\",\n\t595: \"[$UAH]\\\\ #,##0.00\",\n\t596: \"[$UGX]\\\\ #,##0.00\",\n\t597: \"[$USD]\\\\ #,##0.00\",\n\t598: \"[$USN]\\\\ #,##0.00\",\n\t599: \"[$USS]\\\\ #,##0.00\",\n\t600: \"[$UYI]\\\\ #,##0.00\",\n\t601: \"[$UYU]\\\\ #,##0.00\",\n\t602: \"[$UZS]\\\\ #,##0.00\",\n\t603: \"[$VEB]\\\\ #,##0.00\",\n\t604: \"[$VEF]\\\\ #,##0.00\",\n\t605: \"[$VND]\\\\ #,##0.00\",\n\t606: \"[$VUV]\\\\ #,##0.00\",\n\t607: \"[$WST]\\\\ #,##0.00\",\n\t608: \"[$XAF]\\\\ #,##0.00\",\n\t609: \"[$XAG]\\\\ #,##0.00\",\n\t610: \"[$XAU]\\\\ #,##0.00\",\n\t611: \"[$XB5]\\\\ #,##0.00\",\n\t612: \"[$XBA]\\\\ #,##0.00\",\n\t613: \"[$XBB]\\\\ #,##0.00\",\n\t614: \"[$XBC]\\\\ #,##0.00\",\n\t615: \"[$XBD]\\\\ #,##0.00\",\n\t616: \"[$XCD]\\\\ #,##0.00\",\n\t617: \"[$XDR]\\\\ #,##0.00\",\n\t618: \"[$XFO]\\\\ #,##0.00\",\n\t619: \"[$XFU]\\\\ #,##0.00\",\n\t620: \"[$XOF]\\\\ #,##0.00\",\n\t621: \"[$XPD]\\\\ #,##0.00\",\n\t622: \"[$XPF]\\\\ #,##0.00\",\n\t623: \"[$XPT]\\\\ #,##0.00\",\n\t624: \"[$XTS]\\\\ #,##0.00\",\n\t625: \"[$XXX]\\\\ #,##0.00\",\n\t626: \"[$YER]\\\\ #,##0.00\",\n\t627: \"[$YUM]\\\\ #,##0.00\",\n\t628: \"[$ZAR]\\\\ #,##0.00\",\n\t629: \"[$ZMK]\\\\ #,##0.00\",\n\t630: \"[$ZMW]\\\\ #,##0.00\",\n\t631: \"[$ZWD]\\\\ #,##0.00\",\n\t632: \"[$ZWL]\\\\ #,##0.00\",\n\t633: \"[$ZWN]\\\\ #,##0.00\",\n\t634: \"[$ZWR]\\\\ #,##0.00\",\n}\n\n// builtInNumFmtFunc defined the format conversion functions map. Partial format\n// code doesn't support currently and will return original string.\nvar builtInNumFmtFunc = map[int]func(i int, v string) string{\n\t0: formatToString,\n\t1: formatToInt,\n\t2: formatToFloat,\n\t3: formatToInt,\n\t4: formatToFloat,\n\t9: formatToC,\n\t10: formatToD,\n\t11: formatToE,\n\t12: formatToString, // Doesn't support currently\n\t13: formatToString, // Doesn't support currently\n\t14: parseTime,\n\t15: parseTime,\n\t16: parseTime,\n\t17: parseTime,\n\t18: parseTime,\n\t19: parseTime,\n\t20: parseTime,\n\t21: parseTime,\n\t22: parseTime,\n\t37: formatToA,\n\t38: formatToA,\n\t39: formatToB,\n\t40: formatToB,\n\t41: formatToString, // Doesn't support currently\n\t42: formatToString, // Doesn't support currently\n\t43: formatToString, // Doesn't support currently\n\t44: formatToString, // Doesn't support currently\n\t45: parseTime,\n\t46: parseTime,\n\t47: parseTime,\n\t48: formatToE,\n\t49: formatToString,\n}\n\n// validType defined the list of valid validation types.\nvar validType = map[string]string{\n\t\"cell\": \"cellIs\",\n\t\"date\": \"date\", // Doesn't support currently\n\t\"time\": \"time\", // Doesn't support currently\n\t\"average\": \"aboveAverage\",\n\t\"duplicate\": \"duplicateValues\",\n\t\"unique\": \"uniqueValues\",\n\t\"top\": \"top10\",\n\t\"bottom\": \"top10\",\n\t\"text\": \"text\", // Doesn't support currently\n\t\"time_period\": \"timePeriod\", // Doesn't support currently\n\t\"blanks\": \"containsBlanks\", // Doesn't support currently\n\t\"no_blanks\": \"notContainsBlanks\", // Doesn't support currently\n\t\"errors\": \"containsErrors\", // Doesn't support currently\n\t\"no_errors\": \"notContainsErrors\", // Doesn't support currently\n\t\"2_color_scale\": \"2_color_scale\",\n\t\"3_color_scale\": \"3_color_scale\",\n\t\"data_bar\": \"dataBar\",\n\t\"formula\": \"expression\",\n}\n\n// criteriaType defined the list of valid criteria types.\nvar criteriaType = map[string]string{\n\t\"between\": \"between\",\n\t\"not between\": \"notBetween\",\n\t\"equal to\": \"equal\",\n\t\"=\": \"equal\",\n\t\"==\": \"equal\",\n\t\"not equal to\": \"notEqual\",\n\t\"!=\": \"notEqual\",\n\t\"<>\": \"notEqual\",\n\t\"greater than\": \"greaterThan\",\n\t\">\": \"greaterThan\",\n\t\"less than\": \"lessThan\",\n\t\"<\": \"lessThan\",\n\t\"greater than or equal to\": \"greaterThanOrEqual\",\n\t\">=\": \"greaterThanOrEqual\",\n\t\"less than or equal to\": \"lessThanOrEqual\",\n\t\"<=\": \"lessThanOrEqual\",\n\t\"containing\": \"containsText\",\n\t\"not containing\": \"notContains\",\n\t\"begins with\": \"beginsWith\",\n\t\"ends with\": \"endsWith\",\n\t\"yesterday\": \"yesterday\",\n\t\"today\": \"today\",\n\t\"last 7 days\": \"last7Days\",\n\t\"last week\": \"lastWeek\",\n\t\"this week\": \"thisWeek\",\n\t\"continue week\": \"continueWeek\",\n\t\"last month\": \"lastMonth\",\n\t\"this month\": \"thisMonth\",\n\t\"continue month\": \"continueMonth\",\n}\n\n// formatToString provides function to return original string by given built-in\n// number formats code and cell string.\nfunc formatToString(i int, v string) string {\n\treturn v\n}\n\n// formatToInt provides function to convert original string to integer format as\n// string type by given built-in number formats code and cell string.\nfunc formatToInt(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\treturn fmt.Sprintf(\"%d\", int(f))\n}\n\n// formatToFloat provides function to convert original string to float format as\n// string type by given built-in number formats code and cell string.\nfunc formatToFloat(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\treturn fmt.Sprintf(\"%.2f\", f)\n}\n\n// formatToA provides function to convert original string to special format as\n// string type by given built-in number formats code and cell string.\nfunc formatToA(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\tif f < 0 {\n\t\tt := int(math.Abs(f))\n\t\treturn fmt.Sprintf(\"(%d)\", t)\n\t}\n\tt := int(f)\n\treturn fmt.Sprintf(\"%d\", t)\n}\n\n// formatToB provides function to convert original string to special format as\n// string type by given built-in number formats code and cell string.\nfunc formatToB(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\tif f < 0 {\n\t\treturn fmt.Sprintf(\"(%.2f)\", f)\n\t}\n\treturn fmt.Sprintf(\"%.2f\", f)\n}\n\n// formatToC provides function to convert original string to special format as\n// string type by given built-in number formats code and cell string.\nfunc formatToC(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\tf = f * 100\n\treturn fmt.Sprintf(\"%d%%\", int(f))\n}\n\n// formatToD provides function to convert original string to special format as\n// string type by given built-in number formats code and cell string.\nfunc formatToD(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\tf = f * 100\n\treturn fmt.Sprintf(\"%.2f%%\", f)\n}\n\n// formatToE provides function to convert original string to special format as\n// string type by given built-in number formats code and cell string.\nfunc formatToE(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\treturn fmt.Sprintf(\"%.e\", f)\n}\n\n// parseTime provides function to returns a string parsed using time.Time.\n// Replace Excel placeholders with Go time placeholders. For example, replace\n// yyyy with 2006. These are in a specific order, due to the fact that m is used\n// in month, minute, and am/pm. It would be easier to fix that with regular\n// expressions, but if it's possible to keep this simple it would be easier to\n// maintain. Full-length month and days (e.g. March, Tuesday) have letters in\n// them that would be replaced by other characters below (such as the 'h' in\n// March, or the 'd' in Tuesday) below. First we convert them to arbitrary\n// characters unused in Excel Date formats, and then at the end, turn them to\n// what they should actually be.\n// Based off: http://www.ozgrid.com/Excel/CustomFormats.htm\nfunc parseTime(i int, v string) string {\n\tf, err := strconv.ParseFloat(v, 64)\n\tif err != nil {\n\t\treturn v\n\t}\n\tval := timeFromExcelTime(f, false)\n\tformat := builtInNumFmt[i]\n\n\treplacements := []struct{ xltime, gotime string }{\n\t\t{\"yyyy\", \"2006\"},\n\t\t{\"yy\", \"06\"},\n\t\t{\"mmmm\", \"%%%%\"},\n\t\t{\"dddd\", \"&&&&\"},\n\t\t{\"dd\", \"02\"},\n\t\t{\"d\", \"2\"},\n\t\t{\"mmm\", \"Jan\"},\n\t\t{\"mmss\", \"0405\"},\n\t\t{\"ss\", \"05\"},\n\t\t{\"mm:\", \"04:\"},\n\t\t{\":mm\", \":04\"},\n\t\t{\"mm\", \"01\"},\n\t\t{\"am/pm\", \"pm\"},\n\t\t{\"m/\", \"1/\"},\n\t\t{\"%%%%\", \"January\"},\n\t\t{\"&&&&\", \"Monday\"},\n\t}\n\t// It is the presence of the \"am/pm\" indicator that determines if this is\n\t// a 12 hour or 24 hours time format, not the number of 'h' characters.\n\tif is12HourTime(format) {\n\t\tformat = strings.Replace(format, \"hh\", \"03\", 1)\n\t\tformat = strings.Replace(format, \"h\", \"3\", 1)\n\t} else {\n\t\tformat = strings.Replace(format, \"hh\", \"15\", 1)\n\t\tformat = strings.Replace(format, \"h\", \"15\", 1)\n\t}\n\tfor _, repl := range replacements {\n\t\tformat = strings.Replace(format, repl.xltime, repl.gotime, 1)\n\t}\n\t// If the hour is optional, strip it out, along with the possible dangling\n\t// colon that would remain.\n\tif val.Hour() < 1 {\n\t\tformat = strings.Replace(format, \"]:\", \"]\", 1)\n\t\tformat = strings.Replace(format, \"[03]\", \"\", 1)\n\t\tformat = strings.Replace(format, \"[3]\", \"\", 1)\n\t\tformat = strings.Replace(format, \"[15]\", \"\", 1)\n\t} else {\n\t\tformat = strings.Replace(format, \"[3]\", \"3\", 1)\n\t\tformat = strings.Replace(format, \"[15]\", \"15\", 1)\n\t}\n\treturn val.Format(format)\n}\n\n// is12HourTime checks whether an Excel time format string is a 12 hours form.\nfunc is12HourTime(format string) bool {\n\treturn strings.Contains(format, \"am/pm\") || strings.Contains(format, \"AM/PM\") || strings.Contains(format, \"a/p\") || strings.Contains(format, \"A/P\")\n}\n\n// stylesReader provides function to get the pointer to the structure after\n// deserialization of xl/styles.xml.\nfunc (f *File) stylesReader() *xlsxStyleSheet {\n\tif f.Styles == nil {\n\t\tvar styleSheet xlsxStyleSheet\n\t\t_ = xml.Unmarshal([]byte(f.readXML(\"xl/styles.xml\")), &styleSheet)\n\t\tf.Styles = &styleSheet\n\t}\n\treturn f.Styles\n}\n\n// styleSheetWriter provides function to save xl/styles.xml after serialize\n// structure.\nfunc (f *File) styleSheetWriter() {\n\tif f.Styles != nil {\n\t\toutput, _ := xml.Marshal(f.Styles)\n\t\tf.saveFileList(\"xl/styles.xml\", replaceWorkSheetsRelationshipsNameSpaceBytes(output))\n\t}\n}\n\n// parseFormatStyleSet provides function to parse the format settings of the\n// cells and conditional formats.\nfunc parseFormatStyleSet(style string) (*formatStyle, error) {\n\tformat := formatStyle{\n\t\tDecimalPlaces: 2,\n\t}\n\terr := json.Unmarshal([]byte(style), &format)\n\treturn &format, err\n}\n\n// NewStyle provides function to create style for cells by given style format.\n// Note that the color field uses RGB color code.\n//\n// The following shows the border styles sorted by excelize index number:\n//\n// Index | Name | Weight | Style\n// -------+---------------+--------+-------------\n// 0 | None | 0 |\n// 1 | Continuous | 1 | -----------\n// 2 | Continuous | 2 | -----------\n// 3 | Dash | 1 | - - - - - -\n// 4 | Dot | 1 | . . . . . .\n// 5 | Continuous | 3 | -----------\n// 6 | Double | 3 | ===========\n// 7 | Continuous | 0 | -----------\n// 8 | Dash | 2 | - - - - - -\n// 9 | Dash Dot | 1 | - . - . - .\n// 10 | Dash Dot | 2 | - . - . - .\n// 11 | Dash Dot Dot | 1 | - . . - . .\n// 12 | Dash Dot Dot | 2 | - . . - . .\n// 13 | SlantDash Dot | 2 | / - . / - .\n//\n// The following shows the borders in the order shown in the Excel dialog:\n//\n// Index | Style | Index | Style\n// -------+-------------+-------+-------------\n// 0 | None | 12 | - . . - . .\n// 7 | ----------- | 13 | / - . / - .\n// 4 | . . . . . . | 10 | - . - . - .\n// 11 | - . . - . . | 8 | - - - - - -\n// 9 | - . - . - . | 2 | -----------\n// 3 | - - - - - - | 5 | -----------\n// 1 | ----------- | 6 | ===========\n//\n// The following shows the shading styles sorted by excelize index number:\n//\n// Index | Style | Index | Style\n// -------+-----------------+-------+-----------------\n// 0 | Horizontal | 3 | Diagonal down\n// 1 | Vertical | 4 | From corner\n// 2 | Diagonal Up | 5 | From center\n//\n// The following shows the patterns styles sorted by excelize index number:\n//\n// Index | Style | Index | Style\n// -------+-----------------+-------+-----------------\n// 0 | None | 10 | darkTrellis\n// 1 | solid | 11 | lightHorizontal\n// 2 | mediumGray | 12 | lightVertical\n// 3 | darkGray | 13 | lightDown\n// 4 | lightGray | 14 | lightUp\n// 5 | darkHorizontal | 15 | lightGrid\n// 6 | darkVertical | 16 | lightTrellis\n// 7 | darkDown | 17 | gray125\n// 8 | darkUp | 18 | gray0625\n// 9 | darkGrid | |\n//\n// The following the type of horizontal alignment in cells:\n//\n// Style\n// ------------------\n// left\n// center\n// right\n// fill\n// justify\n// centerContinuous\n// distributed\n//\n// The following the type of vertical alignment in cells:\n//\n// Style\n// ------------------\n// top\n// center\n// justify\n// distributed\n//\n// The following the type of font underline style:\n//\n// Style\n// ------------------\n// single\n// double\n//\n// Excel's built-in all languages formats are shown in the following table:\n//\n// Index | Format String\n// -------+----------------------------------------------------\n// 0 | General\n// 1 | 0\n// 2 | 0.00\n// 3 | #,##0\n// 4 | #,##0.00\n// 5 | ($#,##0_);($#,##0)\n// 6 | ($#,##0_);[Red]($#,##0)\n// 7 | ($#,##0.00_);($#,##0.00)\n// 8 | ($#,##0.00_);[Red]($#,##0.00)\n// 9 | 0%\n// 10 | 0.00%\n// 11 | 0.00E+00\n// 12 | # ?/?\n// 13 | # ??/??\n// 14 | m/d/yy\n// 15 | d-mmm-yy\n// 16 | d-mmm\n// 17 | mmm-yy\n// 18 | h:mm AM/PM\n// 19 | h:mm:ss AM/PM\n// 20 | h:mm\n// 21 | h:mm:ss\n// 22 | m/d/yy h:mm\n// ... | ...\n// 37 | (#,##0_);(#,##0)\n// 38 | (#,##0_);[Red](#,##0)\n// 39 | (#,##0.00_);(#,##0.00)\n// 40 | (#,##0.00_);[Red](#,##0.00)\n// 41 | _(* #,##0_);_(* (#,##0);_(* \"-\"_);_(@_)\n// 42 | _($* #,##0_);_($* (#,##0);_($* \"-\"_);_(@_)\n// 43 | _(* #,##0.00_);_(* (#,##0.00);_(* \"-\"??_);_(@_)\n// 44 | _($* #,##0.00_);_($* (#,##0.00);_($* \"-\"??_);_(@_)\n// 45 | mm:ss\n// 46 | [h]:mm:ss\n// 47 | mm:ss.0\n// 48 | ##0.0E+0\n// 49 | @\n//\n// Number format code in zh-tw language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | [$-404]e/m/d\n// 28 | [$-404]e\"年\"m\"月\"d\"日\"\n// 29 | [$-404]e\"年\"m\"月\"d\"日\"\n// 30 | m/d/yy\n// 31 | yyyy\"年\"m\"月\"d\"日\"\n// 32 | hh\"時\"mm\"分\"\n// 33 | hh\"時\"mm\"分\"ss\"秒\"\n// 34 | 上午/下午 hh\"時\"mm\"分\"\n// 35 | 上午/下午 hh\"時\"mm\"分\"ss\"秒\"\n// 36 | [$-404]e/m/d\n// 50 | [$-404]e/m/d\n// 51 | [$-404]e\"年\"m\"月\"d\"日\"\n// 52 | 上午/下午 hh\"時\"mm\"分\"\n// 53 | 上午/下午 hh\"時\"mm\"分\"ss\"秒\"\n// 54 | [$-404]e\"年\"m\"月\"d\"日\"\n// 55 | 上午/下午 hh\"時\"mm\"分\"\n// 56 | 上午/下午 hh\"時\"mm\"分\"ss\"秒\"\n// 57 | [$-404]e/m/d\n// 58 | [$-404]e\"年\"m\"月\"d\"日\"\n//\n// Number format code in zh-cn language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | yyyy\"年\"m\"月\"\n// 28 | m\"月\"d\"日\"\n// 29 | m\"月\"d\"日\"\n// 30 | m-d-yy\n// 31 | yyyy\"年\"m\"月\"d\"日\"\n// 32 | h\"时\"mm\"分\"\n// 33 | h\"时\"mm\"分\"ss\"秒\"\n// 34 | 上午/下午 h\"时\"mm\"分\"\n// 35 | 上午/下午 h\"时\"mm\"分\"ss\"秒\n// 36 | yyyy\"年\"m\"月\n// 50 | yyyy\"年\"m\"月\n// 51 | m\"月\"d\"日\n// 52 | yyyy\"年\"m\"月\n// 53 | m\"月\"d\"日\n// 54 | m\"月\"d\"日\n// 55 | 上午/下午 h\"时\"mm\"分\n// 56 | 上午/下午 h\"时\"mm\"分\"ss\"秒\n// 57 | yyyy\"年\"m\"月\n// 58 | m\"月\"d\"日\"\n//\n// Number format code with unicode values provided for language glyphs where\n// they occur in zh-tw language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | [$-404]e/m/\n// 28 | [$-404]e\"5E74\"m\"6708\"d\"65E5\n// 29 | [$-404]e\"5E74\"m\"6708\"d\"65E5\n// 30 | m/d/y\n// 31 | yyyy\"5E74\"m\"6708\"d\"65E5\n// 32 | hh\"6642\"mm\"5206\n// 33 | hh\"6642\"mm\"5206\"ss\"79D2\n// 34 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\n// 35 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\n// 36 | [$-404]e/m/\n// 50 | [$-404]e/m/\n// 51 | [$-404]e\"5E74\"m\"6708\"d\"65E5\n// 52 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\n// 53 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\n// 54 | [$-404]e\"5E74\"m\"6708\"d\"65E5\n// 55 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\n// 56 | 4E0A5348/4E0B5348hh\"6642\"mm\"5206\"ss\"79D2\n// 57 | [$-404]e/m/\n// 58 | [$-404]e\"5E74\"m\"6708\"d\"65E5\"\n//\n// Number format code with unicode values provided for language glyphs where\n// they occur in zh-cn language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | yyyy\"5E74\"m\"6708\n// 28 | m\"6708\"d\"65E5\n// 29 | m\"6708\"d\"65E5\n// 30 | m-d-y\n// 31 | yyyy\"5E74\"m\"6708\"d\"65E5\n// 32 | h\"65F6\"mm\"5206\n// 33 | h\"65F6\"mm\"5206\"ss\"79D2\n// 34 | 4E0A5348/4E0B5348h\"65F6\"mm\"5206\n// 35 | 4E0A5348/4E0B5348h\"65F6\"mm\"5206\"ss\"79D2\n// 36 | yyyy\"5E74\"m\"6708\n// 50 | yyyy\"5E74\"m\"6708\n// 51 | m\"6708\"d\"65E5\n// 52 | yyyy\"5E74\"m\"6708\n// 53 | m\"6708\"d\"65E5\n// 54 | m\"6708\"d\"65E5\n// 55 | 4E0A5348/4E0B5348h\"65F6\"mm\"5206\n// 56 | 4E0A5348/4E0B5348h\"65F6\"mm\"5206\"ss\"79D2\n// 57 | yyyy\"5E74\"m\"6708\n// 58 | m\"6708\"d\"65E5\"\n//\n// Number format code in ja-jp language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | [$-411]ge.m.d\n// 28 | [$-411]ggge\"年\"m\"月\"d\"日\n// 29 | [$-411]ggge\"年\"m\"月\"d\"日\n// 30 | m/d/y\n// 31 | yyyy\"年\"m\"月\"d\"日\n// 32 | h\"時\"mm\"分\n// 33 | h\"時\"mm\"分\"ss\"秒\n// 34 | yyyy\"年\"m\"月\n// 35 | m\"月\"d\"日\n// 36 | [$-411]ge.m.d\n// 50 | [$-411]ge.m.d\n// 51 | [$-411]ggge\"年\"m\"月\"d\"日\n// 52 | yyyy\"年\"m\"月\n// 53 | m\"月\"d\"日\n// 54 | [$-411]ggge\"年\"m\"月\"d\"日\n// 55 | yyyy\"年\"m\"月\n// 56 | m\"月\"d\"日\n// 57 | [$-411]ge.m.d\n// 58 | [$-411]ggge\"年\"m\"月\"d\"日\"\n//\n// Number format code in ko-kr language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | yyyy\"年\" mm\"月\" dd\"日\n// 28 | mm-d\n// 29 | mm-d\n// 30 | mm-dd-y\n// 31 | yyyy\"년\" mm\"월\" dd\"일\n// 32 | h\"시\" mm\"분\n// 33 | h\"시\" mm\"분\" ss\"초\n// 34 | yyyy-mm-d\n// 35 | yyyy-mm-d\n// 36 | yyyy\"年\" mm\"月\" dd\"日\n// 50 | yyyy\"年\" mm\"月\" dd\"日\n// 51 | mm-d\n// 52 | yyyy-mm-d\n// 53 | yyyy-mm-d\n// 54 | mm-d\n// 55 | yyyy-mm-d\n// 56 | yyyy-mm-d\n// 57 | yyyy\"年\" mm\"月\" dd\"日\n// 58 | mm-dd\n//\n// Number format code with unicode values provided for language glyphs where\n// they occur in ja-jp language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | [$-411]ge.m.d\n// 28 | [$-411]ggge\"5E74\"m\"6708\"d\"65E5\n// 29 | [$-411]ggge\"5E74\"m\"6708\"d\"65E5\n// 30 | m/d/y\n// 31 | yyyy\"5E74\"m\"6708\"d\"65E5\n// 32 | h\"6642\"mm\"5206\n// 33 | h\"6642\"mm\"5206\"ss\"79D2\n// 34 | yyyy\"5E74\"m\"6708\n// 35 | m\"6708\"d\"65E5\n// 36 | [$-411]ge.m.d\n// 50 | [$-411]ge.m.d\n// 51 | [$-411]ggge\"5E74\"m\"6708\"d\"65E5\n// 52 | yyyy\"5E74\"m\"6708\n// 53 | m\"6708\"d\"65E5\n// 54 | [$-411]ggge\"5E74\"m\"6708\"d\"65E5\n// 55 | yyyy\"5E74\"m\"6708\n// 56 | m\"6708\"d\"65E5\n// 57 | [$-411]ge.m.d\n// 58 | [$-411]ggge\"5E74\"m\"6708\"d\"65E5\"\n//\n// Number format code with unicode values provided for language glyphs where\n// they occur in ko-kr language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 27 | yyyy\"5E74\" mm\"6708\" dd\"65E5\n// 28 | mm-d\n// 29 | mm-d\n// 30 | mm-dd-y\n// 31 | yyyy\"B144\" mm\"C6D4\" dd\"C77C\n// 32 | h\"C2DC\" mm\"BD84\n// 33 | h\"C2DC\" mm\"BD84\" ss\"CD08\n// 34 | yyyy-mm-d\n// 35 | yyyy-mm-d\n// 36 | yyyy\"5E74\" mm\"6708\" dd\"65E5\n// 50 | yyyy\"5E74\" mm\"6708\" dd\"65E5\n// 51 | mm-d\n// 52 | yyyy-mm-d\n// 53 | yyyy-mm-d\n// 54 | mm-d\n// 55 | yyyy-mm-d\n// 56 | yyyy-mm-d\n// 57 | yyyy\"5E74\" mm\"6708\" dd\"65E5\n// 58 | mm-dd\n//\n// Number format code in th-th language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 59 | t\n// 60 | t0.0\n// 61 | t#,##\n// 62 | t#,##0.0\n// 67 | t0\n// 68 | t0.00\n// 69 | t# ?/\n// 70 | t# ??/?\n// 71 | ว/ด/ปปป\n// 72 | ว-ดดด-ป\n// 73 | ว-ดด\n// 74 | ดดด-ป\n// 75 | ช:น\n// 76 | ช:นน:ท\n// 77 | ว/ด/ปปปป ช:น\n// 78 | นน:ท\n// 79 | [ช]:นน:ท\n// 80 | นน:ทท.\n// 81 | d/m/bb\n//\n// Number format code with unicode values provided for language glyphs where\n// they occur in th-th language:\n//\n// Index | Symbol\n// -------+-------------------------------------------\n// 59 | t\n// 60 | t0.0\n// 61 | t#,##\n// 62 | t#,##0.0\n// 67 | t0\n// 68 | t0.00\n// 69 | t# ?/\n// 70 | t# ??/?\n// 71 | 0E27/0E14/0E1B0E1B0E1B0E1\n// 72 | 0E27-0E140E140E14-0E1B0E1\n// 73 | 0E27-0E140E140E1\n// 74 | 0E140E140E14-0E1B0E1\n// 75 | 0E0A:0E190E1\n// 76 | 0E0A:0E190E19:0E170E1\n// 77 | 0E27/0E14/0E1B0E1B0E1B0E1B 0E0A:0E190E1\n// 78 | 0E190E19:0E170E1\n// 79 | [0E0A]:0E190E19:0E170E1\n// 80 | 0E190E19:0E170E17.\n// 81 | d/m/bb\n//\n// Excelize built-in currency formats are shown in the following table, only\n// support these types in the following table (Index number is used only for\n// markup and is not used inside an Excel file and you can't get formatted value\n// by the function GetCellValue) currently:\n//\n// Index | Symbol\n// -------+---------------------------------------------------------------\n// 164 | CN¥\n// 165 | $ English (China)\n// 166 | $ Cherokee (United States)\n// 167 | $ Chinese (Singapore)\n// 168 | $ Chinese (Taiwan)\n// 169 | $ English (Australia)\n// 170 | $ English (Belize)\n// 171 | $ English (Canada)\n// 172 | $ English (Jamaica)\n// 173 | $ English (New Zealand)\n// 174 | $ English (Singapore)\n// 175 | $ English (Trinidad & Tobago)\n// 176 | $ English (U.S. Vigin Islands)\n// 177 | $ English (United States)\n// 178 | $ French (Canada)\n// 179 | $ Hawaiian (United States)\n// 180 | $ Malay (Brunei)\n// 181 | $ Quechua (Ecuador)\n// 182 | $ Spanish (Chile)\n// 183 | $ Spanish (Colombia)\n// 184 | $ Spanish (Ecuador)\n// 185 | $ Spanish (El Salvador)\n// 186 | $ Spanish (Mexico)\n// 187 | $ Spanish (Puerto Rico)\n// 188 | $ Spanish (United States)\n// 189 | $ Spanish (Uruguay)\n// 190 | £ English (United Kingdom)\n// 191 | £ Scottish Gaelic (United Kingdom)\n// 192 | £ Welsh (United Kindom)\n// 193 | ¥ Chinese (China)\n// 194 | ¥ Japanese (Japan)\n// 195 | ¥ Sichuan Yi (China)\n// 196 | ¥ Tibetan (China)\n// 197 | ¥ Uyghur (China)\n// 198 | ֏ Armenian (Armenia)\n// 199 | ؋ Pashto (Afghanistan)\n// 200 | ؋ Persian (Afghanistan)\n// 201 | ৳ Bengali (Bangladesh)\n// 202 | ៛ Khmer (Cambodia)\n// 203 | ₡ Spanish (Costa Rica)\n// 204 | ₦ Hausa (Nigeria)\n// 205 | ₦ Igbo (Nigeria)\n// 206 | ₦ Yoruba (Nigeria)\n// 207 | ₩ Korean (South Korea)\n// 208 | ₪ Hebrew (Israel)\n// 209 | ₫ Vietnamese (Vietnam)\n// 210 | € Basque (Spain)\n// 211 | € Breton (France)\n// 212 | € Catalan (Spain)\n// 213 | € Corsican (France)\n// 214 | € Dutch (Belgium)\n// 215 | € Dutch (Netherlands)\n// 216 | € English (Ireland)\n// 217 | € Estonian (Estonia)\n// 218 | € Euro (€ 123)\n// 219 | € Euro (123 €)\n// 220 | € Finnish (Finland)\n// 221 | € French (Belgium)\n// 222 | € French (France)\n// 223 | € French (Luxembourg)\n// 224 | € French (Monaco)\n// 225 | € French (Réunion)\n// 226 | € Galician (Spain)\n// 227 | € German (Austria)\n// 228 | € German (Luxembourg)\n// 229 | € Greek (Greece)\n// 230 | € Inari Sami (Finland)\n// 231 | € Irish (Ireland)\n// 232 | € Italian (Italy)\n// 233 | € Latin (Italy)\n// 234 | € Latin, Serbian (Montenegro)\n// 235 | € Larvian (Latvia)\n// 236 | € Lithuanian (Lithuania)\n// 237 | € Lower Sorbian (Germany)\n// 238 | € Luxembourgish (Luxembourg)\n// 239 | € Maltese (Malta)\n// 240 | € Northern Sami (Finland)\n// 241 | € Occitan (France)\n// 242 | € Portuguese (Portugal)\n// 243 | € Serbian (Montenegro)\n// 244 | € Skolt Sami (Finland)\n// 245 | € Slovak (Slovakia)\n// 246 | € Slovenian (Slovenia)\n// 247 | € Spanish (Spain)\n// 248 | € Swedish (Finland)\n// 249 | € Swiss German (France)\n// 250 | € Upper Sorbian (Germany)\n// 251 | € Western Frisian (Netherlands)\n// 252 | ₭ Lao (Laos)\n// 253 | ₮ Mongolian (Mongolia)\n// 254 | ₮ Mongolian, Mongolian (Mongolia)\n// 255 | ₱ English (Philippines)\n// 256 | ₱ Filipino (Philippines)\n// 257 | ₴ Ukrainian (Ukraine)\n// 258 | ₸ Kazakh (Kazakhstan)\n// 259 | ₹ Arabic, Kashmiri (India)\n// 260 | ₹ English (India)\n// 261 | ₹ Gujarati (India)\n// 262 | ₹ Hindi (India)\n// 263 | ₹ Kannada (India)\n// 264 | ₹ Kashmiri (India)\n// 265 | ₹ Konkani (India)\n// 266 | ₹ Manipuri (India)\n// 267 | ₹ Marathi (India)\n// 268 | ₹ Nepali (India)\n// 269 | ₹ Oriya (India)\n// 270 | ₹ Punjabi (India)\n// 271 | ₹ Sanskrit (India)\n// 272 | ₹ Sindhi (India)\n// 273 | ₹ Tamil (India)\n// 274 | ₹ Urdu (India)\n// 275 | ₺ Turkish (Turkey)\n// 276 | ₼ Azerbaijani (Azerbaijan)\n// 277 | ₼ Cyrillic, Azerbaijani (Azerbaijan)\n// 278 | ₽ Russian (Russia)\n// 279 | ₽ Sakha (Russia)\n// 280 | ₾ Georgian (Georgia)\n// 281 | B/. Spanish (Panama)\n// 282 | Br Oromo (Ethiopia)\n// 283 | Br Somali (Ethiopia)\n// 284 | Br Tigrinya (Ethiopia)\n// 285 | Bs Quechua (Bolivia)\n// 286 | Bs Spanish (Bolivia)\n// 287 | BS. Spanish (Venezuela)\n// 288 | BWP Tswana (Botswana)\n// 289 | C$ Spanish (Nicaragua)\n// 290 | CA$ Latin, Inuktitut (Canada)\n// 291 | CA$ Mohawk (Canada)\n// 292 | CA$ Unified Canadian Aboriginal Syllabics, Inuktitut (Canada)\n// 293 | CFA French (Mali)\n// 294 | CFA French (Senegal)\n// 295 | CFA Fulah (Senegal)\n// 296 | CFA Wolof (Senegal)\n// 297 | CHF French (Switzerland)\n// 298 | CHF German (Liechtenstein)\n// 299 | CHF German (Switzerland)\n// 300 | CHF Italian (Switzerland)\n// 301 | CHF Romansh (Switzerland)\n// 302 | CLP Mapuche (Chile)\n// 303 | CN¥ Mongolian, Mongolian (China)\n// 304 | DZD Central Atlas Tamazight (Algeria)\n// 305 | FCFA French (Cameroon)\n// 306 | Ft Hungarian (Hungary)\n// 307 | G French (Haiti)\n// 308 | Gs. Spanish (Paraguay)\n// 309 | GTQ K'iche' (Guatemala)\n// 310 | HK$ Chinese (Hong Kong (China))\n// 311 | HK$ English (Hong Kong (China))\n// 312 | HRK Croatian (Croatia)\n// 313 | IDR English (Indonesia)\n// 314 | IQD Arbic, Central Kurdish (Iraq)\n// 315 | ISK Icelandic (Iceland)\n// 316 | K Burmese (Myanmar (Burma))\n// 317 | Kč Czech (Czech Republic)\n// 318 | KM Bosnian (Bosnia & Herzegovina)\n// 319 | KM Croatian (Bosnia & Herzegovina)\n// 320 | KM Latin, Serbian (Bosnia & Herzegovina)\n// 321 | kr Faroese (Faroe Islands)\n// 322 | kr Northern Sami (Norway)\n// 323 | kr Northern Sami (Sweden)\n// 324 | kr Norwegian Bokmål (Norway)\n// 325 | kr Norwegian Nynorsk (Norway)\n// 326 | kr Swedish (Sweden)\n// 327 | kr. Danish (Denmark)\n// 328 | kr. Kalaallisut (Greenland)\n// 329 | Ksh Swahili (kenya)\n// 330 | L Romanian (Moldova)\n// 331 | L Russian (Moldova)\n// 332 | L Spanish (Honduras)\n// 333 | Lekë Albanian (Albania)\n// 334 | MAD Arabic, Central Atlas Tamazight (Morocco)\n// 335 | MAD French (Morocco)\n// 336 | MAD Tifinagh, Central Atlas Tamazight (Morocco)\n// 337 | MOP$ Chinese (Macau (China))\n// 338 | MVR Divehi (Maldives)\n// 339 | Nfk Tigrinya (Eritrea)\n// 340 | NGN Bini (Nigeria)\n// 341 | NGN Fulah (Nigeria)\n// 342 | NGN Ibibio (Nigeria)\n// 343 | NGN Kanuri (Nigeria)\n// 344 | NOK Lule Sami (Norway)\n// 345 | NOK Southern Sami (Norway)\n// 346 | NZ$ Maori (New Zealand)\n// 347 | PKR Sindhi (Pakistan)\n// 348 | PYG Guarani (Paraguay)\n// 349 | Q Spanish (Guatemala)\n// 350 | R Afrikaans (South Africa)\n// 351 | R English (South Africa)\n// 352 | R Zulu (South Africa)\n// 353 | R$ Portuguese (Brazil)\n// 354 | RD$ Spanish (Dominican Republic)\n// 355 | RF Kinyarwanda (Rwanda)\n// 356 | RM English (Malaysia)\n// 357 | RM Malay (Malaysia)\n// 358 | RON Romanian (Romania)\n// 359 | Rp Indonesoan (Indonesia)\n// 360 | Rs Urdu (Pakistan)\n// 361 | Rs. Tamil (Sri Lanka)\n// 362 | RSD Latin, Serbian (Serbia)\n// 363 | RSD Serbian (Serbia)\n// 364 | RUB Bashkir (Russia)\n// 365 | RUB Tatar (Russia)\n// 366 | S/. Quechua (Peru)\n// 367 | S/. Spanish (Peru)\n// 368 | SEK Lule Sami (Sweden)\n// 369 | SEK Southern Sami (Sweden)\n// 370 | soʻm Latin, Uzbek (Uzbekistan)\n// 371 | soʻm Uzbek (Uzbekistan)\n// 372 | SYP Syriac (Syria)\n// 373 | THB Thai (Thailand)\n// 374 | TMT Turkmen (Turkmenistan)\n// 375 | US$ English (Zimbabwe)\n// 376 | ZAR Northern Sotho (South Africa)\n// 377 | ZAR Southern Sotho (South Africa)\n// 378 | ZAR Tsonga (South Africa)\n// 379 | ZAR Tswana (south Africa)\n// 380 | ZAR Venda (South Africa)\n// 381 | ZAR Xhosa (South Africa)\n// 382 | zł Polish (Poland)\n// 383 | ден Macedonian (Macedonia)\n// 384 | KM Cyrillic, Bosnian (Bosnia & Herzegovina)\n// 385 | KM Serbian (Bosnia & Herzegovina)\n// 386 | лв. Bulgarian (Bulgaria)\n// 387 | p. Belarusian (Belarus)\n// 388 | сом Kyrgyz (Kyrgyzstan)\n// 389 | сом Tajik (Tajikistan)\n// 390 | ج.م. Arabic (Egypt)\n// 391 | د.أ. Arabic (Jordan)\n// 392 | د.أ. Arabic (United Arab Emirates)\n// 393 | د.ب. Arabic (Bahrain)\n// 394 | د.ت. Arabic (Tunisia)\n// 395 | د.ج. Arabic (Algeria)\n// 396 | د.ع. Arabic (Iraq)\n// 397 | د.ك. Arabic (Kuwait)\n// 398 | د.ل. Arabic (Libya)\n// 399 | د.م. Arabic (Morocco)\n// 400 | ر Punjabi (Pakistan)\n// 401 | ر.س. Arabic (Saudi Arabia)\n// 402 | ر.ع. Arabic (Oman)\n// 403 | ر.ق. Arabic (Qatar)\n// 404 | ر.ي. Arabic (Yemen)\n// 405 | ریال Persian (Iran)\n// 406 | ل.س. Arabic (Syria)\n// 407 | ل.ل. Arabic (Lebanon)\n// 408 | ብር Amharic (Ethiopia)\n// 409 | रू Nepaol (Nepal)\n// 410 | රු. Sinhala (Sri Lanka)\n// 411 | ADP\n// 412 | AED\n// 413 | AFA\n// 414 | AFN\n// 415 | ALL\n// 416 | AMD\n// 417 | ANG\n// 418 | AOA\n// 419 | ARS\n// 420 | ATS\n// 421 | AUD\n// 422 | AWG\n// 423 | AZM\n// 424 | AZN\n// 425 | BAM\n// 426 | BBD\n// 427 | BDT\n// 428 | BEF\n// 429 | BGL\n// 430 | BGN\n// 431 | BHD\n// 432 | BIF\n// 433 | BMD\n// 434 | BND\n// 435 | BOB\n// 436 | BOV\n// 437 | BRL\n// 438 | BSD\n// 439 | BTN\n// 440 | BWP\n// 441 | BYR\n// 442 | BZD\n// 443 | CAD\n// 444 | CDF\n// 445 | CHE\n// 446 | CHF\n// 447 | CHW\n// 448 | CLF\n// 449 | CLP\n// 450 | CNY\n// 451 | COP\n// 452 | COU\n// 453 | CRC\n// 454 | CSD\n// 455 | CUC\n// 456 | CVE\n// 457 | CYP\n// 458 | CZK\n// 459 | DEM\n// 460 | DJF\n// 461 | DKK\n// 462 | DOP\n// 463 | DZD\n// 464 | ECS\n// 465 | ECV\n// 466 | EEK\n// 467 | EGP\n// 468 | ERN\n// 469 | ESP\n// 470 | ETB\n// 471 | EUR\n// 472 | FIM\n// 473 | FJD\n// 474 | FKP\n// 475 | FRF\n// 476 | GBP\n// 477 | GEL\n// 478 | GHC\n// 479 | GHS\n// 480 | GIP\n// 481 | GMD\n// 482 | GNF\n// 483 | GRD\n// 484 | GTQ\n// 485 | GYD\n// 486 | HKD\n// 487 | HNL\n// 488 | HRK\n// 489 | HTG\n// 490 | HUF\n// 491 | IDR\n// 492 | IEP\n// 493 | ILS\n// 494 | INR\n// 495 | IQD\n// 496 | IRR\n// 497 | ISK\n// 498 | ITL\n// 499 | JMD\n// 500 | JOD\n// 501 | JPY\n// 502 | KAF\n// 503 | KES\n// 504 | KGS\n// 505 | KHR\n// 506 | KMF\n// 507 | KPW\n// 508 | KRW\n// 509 | KWD\n// 510 | KYD\n// 511 | KZT\n// 512 | LAK\n// 513 | LBP\n// 514 | LKR\n// 515 | LRD\n// 516 | LSL\n// 517 | LTL\n// 518 | LUF\n// 519 | LVL\n// 520 | LYD\n// 521 | MAD\n// 522 | MDL\n// 523 | MGA\n// 524 | MGF\n// 525 | MKD\n// 526 | MMK\n// 527 | MNT\n// 528 | MOP\n// 529 | MRO\n// 530 | MTL\n// 531 | MUR\n// 532 | MVR\n// 533 | MWK\n// 534 | MXN\n// 535 | MXV\n// 536 | MYR\n// 537 | MZM\n// 538 | MZN\n// 539 | NAD\n// 540 | NGN\n// 541 | NIO\n// 542 | NLG\n// 543 | NOK\n// 544 | NPR\n// 545 | NTD\n// 546 | NZD\n// 547 | OMR\n// 548 | PAB\n// 549 | PEN\n// 550 | PGK\n// 551 | PHP\n// 552 | PKR\n// 553 | PLN\n// 554 | PTE\n// 555 | PYG\n// 556 | QAR\n// 557 | ROL\n// 558 | RON\n// 559 | RSD\n// 560 | RUB\n// 561 | RUR\n// 562 | RWF\n// 563 | SAR\n// 564 | SBD\n// 565 | SCR\n// 566 | SDD\n// 567 | SDG\n// 568 | SDP\n// 569 | SEK\n// 570 | SGD\n// 571 | SHP\n// 572 | SIT\n// 573 | SKK\n// 574 | SLL\n// 575 | SOS\n// 576 | SPL\n// 577 | SRD\n// 578 | SRG\n// 579 | STD\n// 580 | SVC\n// 581 | SYP\n// 582 | SZL\n// 583 | THB\n// 584 | TJR\n// 585 | TJS\n// 586 | TMM\n// 587 | TMT\n// 588 | TND\n// 589 | TOP\n// 590 | TRL\n// 591 | TRY\n// 592 | TTD\n// 593 | TWD\n// 594 | TZS\n// 595 | UAH\n// 596 | UGX\n// 597 | USD\n// 598 | USN\n// 599 | USS\n// 600 | UYI\n// 601 | UYU\n// 602 | UZS\n// 603 | VEB\n// 604 | VEF\n// 605 | VND\n// 606 | VUV\n// 607 | WST\n// 608 | XAF\n// 609 | XAG\n// 610 | XAU\n// 611 | XB5\n// 612 | XBA\n// 613 | XBB\n// 614 | XBC\n// 615 | XBD\n// 616 | XCD\n// 617 | XDR\n// 618 | XFO\n// 619 | XFU\n// 620 | XOF\n// 621 | XPD\n// 622 | XPF\n// 623 | XPT\n// 624 | XTS\n// 625 | XXX\n// 626 | YER\n// 627 | YUM\n// 628 | ZAR\n// 629 | ZMK\n// 630 | ZMW\n// 631 | ZWD\n// 632 | ZWL\n// 633 | ZWN\n// 634 | ZWR\n//\n// Excelize support set custom number format for cell. For example, set number\n// as date type in Uruguay (Spanish) format for Sheet1!A6:\n//\n// xlsx := excelize.NewFile()\n// xlsx.SetCellValue(\"Sheet1\", \"A6\", 42920.5)\n// style, _ := xlsx.NewStyle(`{\"custom_number_format\": \"[$-380A]dddd\\\\,\\\\ dd\\\" de \\\"mmmm\\\" de \\\"yyyy;@\"}`)\n// xlsx.SetCellStyle(\"Sheet1\", \"A6\", \"A6\", style)\n//\n// Cell Sheet1!A6 in the Excel Application: martes, 04 de Julio de 2017\n//\nfunc (f *File) NewStyle(style string) (int, error) {\n\tvar cellXfsID, fontID, borderID, fillID int\n\ts := f.stylesReader()\n\tfs, err := parseFormatStyleSet(style)\n\tif err != nil {\n\t\treturn cellXfsID, err\n\t}\n\tnumFmtID := setNumFmt(s, fs)\n\n\tif fs.Font != nil {\n\t\tfont, _ := xml.Marshal(setFont(fs))\n\t\ts.Fonts.Count++\n\t\ts.Fonts.Font = append(s.Fonts.Font, &xlsxFont{\n\t\t\tFont: string(font[6 : len(font)-7]),\n\t\t})\n\t\tfontID = s.Fonts.Count - 1\n\t}\n\n\ts.Borders.Count++\n\ts.Borders.Border = append(s.Borders.Border, setBorders(fs))\n\tborderID = s.Borders.Count - 1\n\n\ts.Fills.Count++\n\ts.Fills.Fill = append(s.Fills.Fill, setFills(fs, true))\n\tfillID = s.Fills.Count - 1\n\n\tapplyAlignment, alignment := fs.Alignment != nil, setAlignment(fs)\n\tapplyProtection, protection := fs.Protection != nil, setProtection(fs)\n\tcellXfsID = setCellXfs(s, fontID, numFmtID, fillID, borderID, applyAlignment, applyProtection, alignment, protection)\n\treturn cellXfsID, nil\n}\n\n// NewConditionalStyle provides function to create style for conditional format\n// by given style format. The parameters are the same as function NewStyle().\n// Note that the color field uses RGB color code and only support to set font,\n// fills, alignment and borders currently.\nfunc (f *File) NewConditionalStyle(style string) (int, error) {\n\ts := f.stylesReader()\n\tfs, err := parseFormatStyleSet(style)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tdxf := dxf{\n\t\tFill: setFills(fs, false),\n\t\tAlignment: setAlignment(fs),\n\t\tBorder: setBorders(fs),\n\t}\n\tif fs.Font != nil {\n\t\tdxf.Font = setFont(fs)\n\t}\n\tdxfStr, _ := xml.Marshal(dxf)\n\tif s.Dxfs == nil {\n\t\ts.Dxfs = &xlsxDxfs{}\n\t}\n\ts.Dxfs.Count++\n\ts.Dxfs.Dxfs = append(s.Dxfs.Dxfs, &xlsxDxf{\n\t\tDxf: string(dxfStr[5 : len(dxfStr)-6]),\n\t})\n\treturn s.Dxfs.Count - 1, nil\n}\n\n// setFont provides function to add font style by given cell format settings.\nfunc setFont(formatStyle *formatStyle) *font {\n\tfontUnderlineType := map[string]string{\"single\": \"single\", \"double\": \"double\"}\n\tif formatStyle.Font.Size < 1 {\n\t\tformatStyle.Font.Size = 11\n\t}\n\tif formatStyle.Font.Color == \"\" {\n\t\tformatStyle.Font.Color = \"#000000\"\n\t}\n\tf := font{\n\t\tB: formatStyle.Font.Bold,\n\t\tI: formatStyle.Font.Italic,\n\t\tSz: &attrValInt{Val: formatStyle.Font.Size},\n\t\tColor: &xlsxColor{RGB: getPaletteColor(formatStyle.Font.Color)},\n\t\tName: &attrValString{Val: formatStyle.Font.Family},\n\t\tFamily: &attrValInt{Val: 2},\n\t}\n\tif f.Name.Val == \"\" {\n\t\tf.Name.Val = \"Calibri\"\n\t\tf.Scheme = &attrValString{Val: \"minor\"}\n\t}\n\tval, ok := fontUnderlineType[formatStyle.Font.Underline]\n\tif ok {\n\t\tf.U = &attrValString{Val: val}\n\t}\n\treturn &f\n}\n\n// setNumFmt provides function to check if number format code in the range of\n// built-in values.\nfunc setNumFmt(style *xlsxStyleSheet, formatStyle *formatStyle) int {\n\tdp := \"0.\"\n\tnumFmtID := 164 // Default custom number format code from 164.\n\tif formatStyle.DecimalPlaces < 0 || formatStyle.DecimalPlaces > 30 {\n\t\tformatStyle.DecimalPlaces = 2\n\t}\n\tfor i := 0; i < formatStyle.DecimalPlaces; i++ {\n\t\tdp += \"0\"\n\t}\n\tif formatStyle.CustomNumFmt != nil {\n\t\treturn setCustomNumFmt(style, formatStyle)\n\t}\n\t_, ok := builtInNumFmt[formatStyle.NumFmt]\n\tif !ok {\n\t\tfc, currency := currencyNumFmt[formatStyle.NumFmt]\n\t\tif !currency {\n\t\t\treturn setLangNumFmt(style, formatStyle)\n\t\t}\n\t\tfc = strings.Replace(fc, \"0.00\", dp, -1)\n\t\tif formatStyle.NegRed {\n\t\t\tfc = fc + \";[Red]\" + fc\n\t\t}\n\t\tif style.NumFmts != nil {\n\t\t\tnumFmtID = style.NumFmts.NumFmt[len(style.NumFmts.NumFmt)-1].NumFmtID + 1\n\t\t\tnf := xlsxNumFmt{\n\t\t\t\tFormatCode: fc,\n\t\t\t\tNumFmtID: numFmtID,\n\t\t\t}\n\t\t\tstyle.NumFmts.NumFmt = append(style.NumFmts.NumFmt, &nf)\n\t\t\tstyle.NumFmts.Count++\n\t\t} else {\n\t\t\tnf := xlsxNumFmt{\n\t\t\t\tFormatCode: fc,\n\t\t\t\tNumFmtID: numFmtID,\n\t\t\t}\n\t\t\tnumFmts := xlsxNumFmts{\n\t\t\t\tNumFmt: []*xlsxNumFmt{&nf},\n\t\t\t\tCount: 1,\n\t\t\t}\n\t\t\tstyle.NumFmts = &numFmts\n\t\t}\n\t\treturn numFmtID\n\t}\n\treturn formatStyle.NumFmt\n}\n\n// setCustomNumFmt provides function to set custom number format code.\nfunc setCustomNumFmt(style *xlsxStyleSheet, formatStyle *formatStyle) int {\n\tnf := xlsxNumFmt{FormatCode: *formatStyle.CustomNumFmt}\n\tif style.NumFmts != nil {\n\t\tnf.NumFmtID = style.NumFmts.NumFmt[len(style.NumFmts.NumFmt)-1].NumFmtID + 1\n\t\tstyle.NumFmts.NumFmt = append(style.NumFmts.NumFmt, &nf)\n\t\tstyle.NumFmts.Count++\n\t} else {\n\t\tnf.NumFmtID = 164\n\t\tnumFmts := xlsxNumFmts{\n\t\t\tNumFmt: []*xlsxNumFmt{&nf},\n\t\t\tCount: 1,\n\t\t}\n\t\tstyle.NumFmts = &numFmts\n\t}\n\treturn nf.NumFmtID\n}\n\n// setLangNumFmt provides function to set number format code with language.\nfunc setLangNumFmt(style *xlsxStyleSheet, formatStyle *formatStyle) int {\n\tnumFmts, ok := langNumFmt[formatStyle.Lang]\n\tif !ok {\n\t\treturn 0\n\t}\n\tvar fc string\n\tfc, ok = numFmts[formatStyle.NumFmt]\n\tif !ok {\n\t\treturn 0\n\t}\n\tnf := xlsxNumFmt{FormatCode: fc}\n\tif style.NumFmts != nil {\n\t\tnf.NumFmtID = style.NumFmts.NumFmt[len(style.NumFmts.NumFmt)-1].NumFmtID + 1\n\t\tstyle.NumFmts.NumFmt = append(style.NumFmts.NumFmt, &nf)\n\t\tstyle.NumFmts.Count++\n\t} else {\n\t\tnf.NumFmtID = formatStyle.NumFmt\n\t\tnumFmts := xlsxNumFmts{\n\t\t\tNumFmt: []*xlsxNumFmt{&nf},\n\t\t\tCount: 1,\n\t\t}\n\t\tstyle.NumFmts = &numFmts\n\t}\n\treturn nf.NumFmtID\n}\n\n// setFills provides function to add fill elements in the styles.xml by given\n// cell format settings.\nfunc setFills(formatStyle *formatStyle, fg bool) *xlsxFill {\n\tvar patterns = []string{\n\t\t\"none\",\n\t\t\"solid\",\n\t\t\"mediumGray\",\n\t\t\"darkGray\",\n\t\t\"lightGray\",\n\t\t\"darkHorizontal\",\n\t\t\"darkVertical\",\n\t\t\"darkDown\",\n\t\t\"darkUp\",\n\t\t\"darkGrid\",\n\t\t\"darkTrellis\",\n\t\t\"lightHorizontal\",\n\t\t\"lightVertical\",\n\t\t\"lightDown\",\n\t\t\"lightUp\",\n\t\t\"lightGrid\",\n\t\t\"lightTrellis\",\n\t\t\"gray125\",\n\t\t\"gray0625\",\n\t}\n\n\tvar variants = []float64{\n\t\t90,\n\t\t0,\n\t\t45,\n\t\t135,\n\t}\n\n\tvar fill xlsxFill\n\tswitch formatStyle.Fill.Type {\n\tcase \"gradient\":\n\t\tif len(formatStyle.Fill.Color) != 2 {\n\t\t\tbreak\n\t\t}\n\t\tvar gradient xlsxGradientFill\n\t\tswitch formatStyle.Fill.Shading {\n\t\tcase 0, 1, 2, 3:\n\t\t\tgradient.Degree = variants[formatStyle.Fill.Shading]\n\t\tcase 4:\n\t\t\tgradient.Type = \"path\"\n\t\tcase 5:\n\t\t\tgradient.Type = \"path\"\n\t\t\tgradient.Bottom = 0.5\n\t\t\tgradient.Left = 0.5\n\t\t\tgradient.Right = 0.5\n\t\t\tgradient.Top = 0.5\n\t\tdefault:\n\t\t\tbreak\n\t\t}\n\t\tvar stops []*xlsxGradientFillStop\n\t\tfor index, color := range formatStyle.Fill.Color {\n\t\t\tvar stop xlsxGradientFillStop\n\t\t\tstop.Position = float64(index)\n\t\t\tstop.Color.RGB = getPaletteColor(color)\n\t\t\tstops = append(stops, &stop)\n\t\t}\n\t\tgradient.Stop = stops\n\t\tfill.GradientFill = &gradient\n\tcase \"pattern\":\n\t\tif formatStyle.Fill.Pattern > 18 || formatStyle.Fill.Pattern < 0 {\n\t\t\tbreak\n\t\t}\n\t\tif len(formatStyle.Fill.Color) < 1 {\n\t\t\tbreak\n\t\t}\n\t\tvar pattern xlsxPatternFill\n\t\tpattern.PatternType = patterns[formatStyle.Fill.Pattern]\n\t\tif fg {\n\t\t\tpattern.FgColor.RGB = getPaletteColor(formatStyle.Fill.Color[0])\n\t\t} else {\n\t\t\tpattern.BgColor.RGB = getPaletteColor(formatStyle.Fill.Color[0])\n\t\t}\n\t\tfill.PatternFill = &pattern\n\t}\n\treturn &fill\n}\n\n// setAlignment provides function to formatting information pertaining to text\n// alignment in cells. There are a variety of choices for how text is aligned\n// both horizontally and vertically, as well as indentation settings, and so on.\nfunc setAlignment(formatStyle *formatStyle) *xlsxAlignment {\n\tvar alignment xlsxAlignment\n\tif formatStyle.Alignment != nil {\n\t\talignment.Horizontal = formatStyle.Alignment.Horizontal\n\t\talignment.Indent = formatStyle.Alignment.Indent\n\t\talignment.JustifyLastLine = formatStyle.Alignment.JustifyLastLine\n\t\talignment.ReadingOrder = formatStyle.Alignment.ReadingOrder\n\t\talignment.RelativeIndent = formatStyle.Alignment.RelativeIndent\n\t\talignment.ShrinkToFit = formatStyle.Alignment.ShrinkToFit\n\t\talignment.TextRotation = formatStyle.Alignment.TextRotation\n\t\talignment.Vertical = formatStyle.Alignment.Vertical\n\t\talignment.WrapText = formatStyle.Alignment.WrapText\n\t}\n\treturn &alignment\n}\n\n// setProtection provides function to set protection properties associated\n// with the cell.\nfunc setProtection(formatStyle *formatStyle) *xlsxProtection {\n\tvar protection xlsxProtection\n\tif formatStyle.Protection != nil {\n\t\tprotection.Hidden = formatStyle.Protection.Hidden\n\t\tprotection.Locked = formatStyle.Protection.Locked\n\t}\n\treturn &protection\n}\n\n// setBorders provides function to add border elements in the styles.xml by\n// given borders format settings.\nfunc setBorders(formatStyle *formatStyle) *xlsxBorder {\n\tvar styles = []string{\n\t\t\"none\",\n\t\t\"thin\",\n\t\t\"medium\",\n\t\t\"dashed\",\n\t\t\"dotted\",\n\t\t\"thick\",\n\t\t\"double\",\n\t\t\"hair\",\n\t\t\"mediumDashed\",\n\t\t\"dashDot\",\n\t\t\"mediumDashDot\",\n\t\t\"dashDotDot\",\n\t\t\"mediumDashDotDot\",\n\t\t\"slantDashDot\",\n\t}\n\n\tvar border xlsxBorder\n\tfor _, v := range formatStyle.Border {\n\t\tif 0 <= v.Style && v.Style < 14 {\n\t\t\tvar color xlsxColor\n\t\t\tcolor.RGB = getPaletteColor(v.Color)\n\t\t\tswitch v.Type {\n\t\t\tcase \"left\":\n\t\t\t\tborder.Left.Style = styles[v.Style]\n\t\t\t\tborder.Left.Color = &color\n\t\t\tcase \"right\":\n\t\t\t\tborder.Right.Style = styles[v.Style]\n\t\t\t\tborder.Right.Color = &color\n\t\t\tcase \"top\":\n\t\t\t\tborder.Top.Style = styles[v.Style]\n\t\t\t\tborder.Top.Color = &color\n\t\t\tcase \"bottom\":\n\t\t\t\tborder.Bottom.Style = styles[v.Style]\n\t\t\t\tborder.Bottom.Color = &color\n\t\t\tcase \"diagonalUp\":\n\t\t\t\tborder.Diagonal.Style = styles[v.Style]\n\t\t\t\tborder.Diagonal.Color = &color\n\t\t\t\tborder.DiagonalUp = true\n\t\t\tcase \"diagonalDown\":\n\t\t\t\tborder.Diagonal.Style = styles[v.Style]\n\t\t\t\tborder.Diagonal.Color = &color\n\t\t\t\tborder.DiagonalDown = true\n\t\t\t}\n\t\t}\n\t}\n\treturn &border\n}\n\n// setCellXfs provides function to set describes all of the formatting for a\n// cell.\nfunc setCellXfs(style *xlsxStyleSheet, fontID, numFmtID, fillID, borderID int, applyAlignment, applyProtection bool, alignment *xlsxAlignment, protection *xlsxProtection) int {\n\tvar xf xlsxXf\n\txf.FontID = fontID\n\tif fontID != 0 {\n\t\txf.ApplyFont = true\n\t}\n\txf.NumFmtID = numFmtID\n\tif numFmtID != 0 {\n\t\txf.ApplyNumberFormat = true\n\t}\n\txf.FillID = fillID\n\txf.BorderID = borderID\n\tstyle.CellXfs.Count++\n\txf.Alignment = alignment\n\txf.ApplyAlignment = applyAlignment\n\tif applyProtection {\n\t\txf.ApplyProtection = applyProtection\n\t\txf.Protection = protection\n\t}\n\txfID := 0\n\txf.XfID = &xfID\n\tstyle.CellXfs.Xf = append(style.CellXfs.Xf, xf)\n\treturn style.CellXfs.Count - 1\n}\n\n// SetCellStyle provides function to add style attribute for cells by given\n// worksheet name, coordinate area and style ID. Note that diagonalDown and\n// diagonalUp type border should be use same color in the same coordinate area.\n//\n// For example create a borders of cell H9 on Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"border\":[{\"type\":\"left\",\"color\":\"0000FF\",\"style\":3},{\"type\":\"top\",\"color\":\"00FF00\",\"style\":4},{\"type\":\"bottom\",\"color\":\"FFFF00\",\"style\":5},{\"type\":\"right\",\"color\":\"FF0000\",\"style\":6},{\"type\":\"diagonalDown\",\"color\":\"A020F0\",\"style\":7},{\"type\":\"diagonalUp\",\"color\":\"A020F0\",\"style\":8}]}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Set gradient fill with vertical variants shading styles for cell H9 on\n// Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"fill\":{\"type\":\"gradient\",\"color\":[\"#FFFFFF\",\"#E0EBF5\"],\"shading\":1}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Set solid style pattern fill for cell H9 on Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"fill\":{\"type\":\"pattern\",\"color\":[\"#E0EBF5\"],\"pattern\":1}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Set alignment style for cell H9 on Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"alignment\":{\"horizontal\":\"center\",\"ident\":1,\"justify_last_line\":true,\"reading_order\":0,\"relative_indent\":1,\"shrink_to_fit\":true,\"text_rotation\":45,\"vertical\":\"\",\"wrap_text\":true}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Dates and times in Excel are represented by real numbers, for example \"Apr 7\n// 2017 12:00 PM\" is represented by the number 42920.5. Set date and time format\n// for cell H9 on Sheet1:\n//\n// xlsx.SetCellValue(\"Sheet1\", \"H9\", 42920.5)\n// style, err := xlsx.NewStyle(`{\"number_format\": 22}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Set font style for cell H9 on Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"font\":{\"bold\":true,\"italic\":true,\"family\":\"Berlin Sans FB Demi\",\"size\":36,\"color\":\"#777777\"}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\n// Hide and lock for cell H9 on Sheet1:\n//\n// style, err := xlsx.NewStyle(`{\"protection\":{\"hidden\":true, \"locked\":true}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetCellStyle(\"Sheet1\", \"H9\", \"H9\", style)\n//\nfunc (f *File) SetCellStyle(sheet, hcell, vcell string, styleID int) {\n\thcell = strings.ToUpper(hcell)\n\tvcell = strings.ToUpper(vcell)\n\n\t// Coordinate conversion, convert C1:B3 to 2,0,1,2.\n\thcol := string(strings.Map(letterOnlyMapF, hcell))\n\throw, err := strconv.Atoi(strings.Map(intOnlyMapF, hcell))\n\tif err != nil {\n\t\treturn\n\t}\n\thyAxis := hrow - 1\n\thxAxis := TitleToNumber(hcol)\n\n\tvcol := string(strings.Map(letterOnlyMapF, vcell))\n\tvrow, err := strconv.Atoi(strings.Map(intOnlyMapF, vcell))\n\tif err != nil {\n\t\treturn\n\t}\n\tvyAxis := vrow - 1\n\tvxAxis := TitleToNumber(vcol)\n\n\t// Correct the coordinate area, such correct C1:B3 to B1:C3.\n\tif vxAxis < hxAxis {\n\t\tvxAxis, hxAxis = hxAxis, vxAxis\n\t}\n\n\tif vyAxis < hyAxis {\n\t\tvyAxis, hyAxis = hyAxis, vyAxis\n\t}\n\n\txlsx := f.workSheetReader(sheet)\n\n\tcompleteRow(xlsx, vyAxis+1, vxAxis+1)\n\tcompleteCol(xlsx, vyAxis+1, vxAxis+1)\n\n\tfor r := hyAxis; r <= vyAxis; r++ {\n\t\tfor k := hxAxis; k <= vxAxis; k++ {\n\t\t\txlsx.SheetData.Row[r].C[k].S = styleID\n\t\t}\n\t}\n}\n\n// SetConditionalFormat provides function to create conditional formatting rule\n// for cell value. Conditional formatting is a feature of Excel which allows you\n// to apply a format to a cell or a range of cells based on certain criteria.\n//\n// The type option is a required parameter and it has no default value.\n// Allowable type values and their associated parameters are:\n//\n// Type | Parameters\n// ---------------+------------------------------------\n// cell | criteria\n// | value\n// | minimum\n// | maximum\n// date | criteria\n// | value\n// | minimum\n// | maximum\n// time_period | criteria\n// text | criteria\n// | value\n// average | criteria\n// duplicate | (none)\n// unique | (none)\n// top | criteria\n// | value\n// bottom | criteria\n// | value\n// blanks | (none)\n// no_blanks | (none)\n// errors | (none)\n// no_errors | (none)\n// 2_color_scale | min_type\n// | max_type\n// | min_value\n// | max_value\n// | min_color\n// | max_color\n// 3_color_scale | min_type\n// | mid_type\n// | max_type\n// | min_value\n// | mid_value\n// | max_value\n// | min_color\n// | mid_color\n// | max_color\n// data_bar | min_type\n// | max_type\n// | min_value\n// | max_value\n// | bar_color\n// formula | criteria\n//\n// The criteria parameter is used to set the criteria by which the cell data\n// will be evaluated. It has no default value. The most common criteria as\n// applied to {'type': 'cell'} are:\n//\n// between |\n// not between |\n// equal to | ==\n// not equal to | !=\n// greater than | >\n// less than | <\n// greater than or equal to | >=\n// less than or equal to | <=\n//\n// You can either use Excel's textual description strings, in the first column\n// above, or the more common symbolic alternatives.\n//\n// Additional criteria which are specific to other conditional format types are\n// shown in the relevant sections below.\n//\n// value: The value is generally used along with the criteria parameter to set\n// the rule by which the cell data will be evaluated:\n//\n// xlsx.SetConditionalFormat(\"Sheet1\", \"D1:D10\", fmt.Sprintf(`[{\"type\":\"cell\",\"criteria\":\">\",\"format\":%d,\"value\":\"6\"}]`, format))\n//\n// The value property can also be an cell reference:\n//\n// xlsx.SetConditionalFormat(\"Sheet1\", \"D1:D10\", fmt.Sprintf(`[{\"type\":\"cell\",\"criteria\":\">\",\"format\":%d,\"value\":\"$C$1\"}]`, format))\n//\n// type: format - The format parameter is used to specify the format that will\n// be applied to the cell when the conditional formatting criterion is met. The\n// format is created using the NewConditionalStyle() method in the same way as\n// cell formats:\n//\n// format, err = xlsx.NewConditionalStyle(`{\"font\":{\"color\":\"#9A0511\"},\"fill\":{\"type\":\"pattern\",\"color\":[\"#FEC7CE\"],\"pattern\":1}}`)\n// if err != nil {\n// fmt.Println(err)\n// }\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"cell\",\"criteria\":\">\",\"format\":%d,\"value\":\"6\"}]`, format))\n//\n// Note: In Excel, a conditional format is superimposed over the existing cell\n// format and not all cell format properties can be modified. Properties that\n// cannot be modified in a conditional format are font name, font size,\n// superscript and subscript, diagonal borders, all alignment properties and all\n// protection properties.\n//\n// Excel specifies some default formats to be used with conditional formatting.\n// These can be replicated using the following excelize formats:\n//\n// // Rose format for bad conditional.\n// format1, err = xlsx.NewConditionalStyle(`{\"font\":{\"color\":\"#9A0511\"},\"fill\":{\"type\":\"pattern\",\"color\":[\"#FEC7CE\"],\"pattern\":1}}`)\n//\n// // Light yellow format for neutral conditional.\n// format2, err = xlsx.NewConditionalStyle(`{\"font\":{\"color\":\"#9B5713\"},\"fill\":{\"type\":\"pattern\",\"color\":[\"#FEEAA0\"],\"pattern\":1}}`)\n//\n// // Light green format for good conditional.\n// format3, err = xlsx.NewConditionalStyle(`{\"font\":{\"color\":\"#09600B\"},\"fill\":{\"type\":\"pattern\",\"color\":[\"#C7EECF\"],\"pattern\":1}}`)\n//\n// type: minimum - The minimum parameter is used to set the lower limiting value\n// when the criteria is either \"between\" or \"not between\".\n//\n// // Hightlight cells rules: between...\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"cell\",\"criteria\":\"between\",\"format\":%d,\"minimum\":\"6\",\"maximum\":\"8\"}]`, format))\n//\n// type: maximum - The maximum parameter is used to set the upper limiting value\n// when the criteria is either \"between\" or \"not between\". See the previous\n// example.\n//\n// type: average - The average type is used to specify Excel's \"Average\" style\n// conditional format:\n//\n// // Top/Bottom rules: Above Average...\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"average\",\"criteria\":\"=\",\"format\":%d, \"above_average\": true}]`, format1))\n//\n// // Top/Bottom rules: Below Average...\n// xlsx.SetConditionalFormat(\"Sheet1\", \"B1:B10\", fmt.Sprintf(`[{\"type\":\"average\",\"criteria\":\"=\",\"format\":%d, \"above_average\": false}]`, format2))\n//\n// type: duplicate - The duplicate type is used to highlight duplicate cells in a range:\n//\n// // Hightlight cells rules: Duplicate Values...\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"duplicate\",\"criteria\":\"=\",\"format\":%d}]`, format))\n//\n// type: unique - The unique type is used to highlight unique cells in a range:\n//\n// // Hightlight cells rules: Not Equal To...\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"unique\",\"criteria\":\"=\",\"format\":%d}]`, format))\n//\n// type: top - The top type is used to specify the top n values by number or percentage in a range:\n//\n// // Top/Bottom rules: Top 10.\n// xlsx.SetConditionalFormat(\"Sheet1\", \"H1:H10\", fmt.Sprintf(`[{\"type\":\"top\",\"criteria\":\"=\",\"format\":%d,\"value\":\"6\"}]`, format))\n//\n// The criteria can be used to indicate that a percentage condition is required:\n//\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", fmt.Sprintf(`[{\"type\":\"top\",\"criteria\":\"=\",\"format\":%d,\"value\":\"6\",\"percent\":true}]`, format))\n//\n// type: 2_color_scale - The 2_color_scale type is used to specify Excel's \"2\n// Color Scale\" style conditional format:\n//\n// // Color scales: 2 color.\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", `[{\"type\":\"2_color_scale\",\"criteria\":\"=\",\"min_type\":\"min\",\"max_type\":\"max\",\"min_color\":\"#F8696B\",\"max_color\":\"#63BE7B\"}]`)\n//\n// This conditional type can be modified with min_type, max_type, min_value,\n// max_value, min_color and max_color, see below.\n//\n// type: 3_color_scale - The 3_color_scale type is used to specify Excel's \"3\n// Color Scale\" style conditional format:\n//\n// // Color scales: 3 color.\n// xlsx.SetConditionalFormat(\"Sheet1\", \"A1:A10\", `[{\"type\":\"3_color_scale\",\"criteria\":\"=\",\"min_type\":\"min\",\"mid_type\":\"percentile\",\"max_type\":\"max\",\"min_color\":\"#F8696B\",\"mid_color\":\"#FFEB84\",\"max_color\":\"#63BE7B\"}]`)\n//\n// This conditional type can be modified with min_type, mid_type, max_type,\n// min_value, mid_value, max_value, min_color, mid_color and max_color, see\n// below.\n//\n// type: data_bar - The data_bar type is used to specify Excel's \"Data Bar\"\n// style conditional format.\n//\n// min_type - The min_type and max_type properties are available when the conditional formatting type is 2_color_scale, 3_color_scale or data_bar. The mid_type is available for 3_color_scale. The properties are used as follows:\n//\n// // Data Bars: Gradient Fill.\n// xlsx.SetConditionalFormat(\"Sheet1\", \"K1:K10\", `[{\"type\":\"data_bar\", \"criteria\":\"=\", \"min_type\":\"min\",\"max_type\":\"max\",\"bar_color\":\"#638EC6\"}]`)\n//\n// The available min/mid/max types are:\n//\n// min (for min_type only)\n// num\n// percent\n// percentile\n// formula\n// max (for max_type only)\n//\n// mid_type - Used for 3_color_scale. Same as min_type, see above.\n//\n// max_type - Same as min_type, see above.\n//\n// min_value - The min_value and max_value properties are available when the\n// conditional formatting type is 2_color_scale, 3_color_scale or data_bar. The\n// mid_value is available for 3_color_scale.\n//\n// mid_value - Used for 3_color_scale. Same as min_value, see above.\n//\n// max_value - Same as min_value, see above.\n//\n// min_color - The min_color and max_color properties are available when the\n// conditional formatting type is 2_color_scale, 3_color_scale or data_bar.\n// The mid_color is available for 3_color_scale. The properties are used as\n// follows:\n//\n// // Color scales: 3 color.\n// xlsx.SetConditionalFormat(\"Sheet1\", \"B1:B10\", `[{\"type\":\"3_color_scale\",\"criteria\":\"=\",\"min_type\":\"min\",\"mid_type\":\"percentile\",\"max_type\":\"max\",\"min_color\":\"#F8696B\",\"mid_color\":\"#FFEB84\",\"max_color\":\"#63BE7B\"}]`)\n//\n// mid_color - Used for 3_color_scale. Same as min_color, see above.\n//\n// max_color - Same as min_color, see above.\n//\n// bar_color - Used for data_bar. Same as min_color, see above.\n//\nfunc (f *File) SetConditionalFormat(sheet, area, formatSet string) error {\n\tvar format []*formatConditional\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdrawContFmtFunc := map[string]func(p int, ct string, fmtCond *formatConditional) *xlsxCfRule{\n\t\t\"cellIs\": drawCondFmtCellIs,\n\t\t\"top10\": drawCondFmtTop10,\n\t\t\"aboveAverage\": drawCondFmtAboveAverage,\n\t\t\"duplicateValues\": drawCondFmtDuplicateUniqueValues,\n\t\t\"uniqueValues\": drawCondFmtDuplicateUniqueValues,\n\t\t\"2_color_scale\": drawCondFmtColorScale,\n\t\t\"3_color_scale\": drawCondFmtColorScale,\n\t\t\"dataBar\": drawCondFmtDataBar,\n\t\t\"expression\": drawConfFmtExp,\n\t}\n\n\txlsx := f.workSheetReader(sheet)\n\tcfRule := []*xlsxCfRule{}\n\tfor p, v := range format {\n\t\tvar vt, ct string\n\t\tvar ok bool\n\t\t// \"type\" is a required parameter, check for valid validation types.\n\t\tvt, ok = validType[v.Type]\n\t\tif ok {\n\t\t\t// Check for valid criteria types.\n\t\t\tct, ok = criteriaType[v.Criteria]\n\t\t\tif ok || vt == \"expression\" {\n\t\t\t\tdrawfunc, ok := drawContFmtFunc[vt]\n\t\t\t\tif ok {\n\t\t\t\t\tcfRule = append(cfRule, drawfunc(p, ct, v))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\txlsx.ConditionalFormatting = append(xlsx.ConditionalFormatting, &xlsxConditionalFormatting{\n\t\tSQRef: area,\n\t\tCfRule: cfRule,\n\t})\n\treturn err\n}\n\n// drawCondFmtCellIs provides function to create conditional formatting rule for\n// cell value (include between, not between, equal, not equal, greater than and\n// less than) by given priority, criteria type and format settings.\nfunc drawCondFmtCellIs(p int, ct string, format *formatConditional) *xlsxCfRule {\n\tc := &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tOperator: ct,\n\t\tDxfID: &format.Format,\n\t}\n\t// \"between\" and \"not between\" criteria require 2 values.\n\t_, ok := map[string]bool{\"between\": true, \"notBetween\": true}[ct]\n\tif ok {\n\t\tc.Formula = append(c.Formula, format.Minimum)\n\t\tc.Formula = append(c.Formula, format.Maximum)\n\t}\n\t_, ok = map[string]bool{\"equal\": true, \"notEqual\": true, \"greaterThan\": true, \"lessThan\": true}[ct]\n\tif ok {\n\t\tc.Formula = append(c.Formula, format.Value)\n\t}\n\treturn c\n}\n\n// drawCondFmtTop10 provides function to create conditional formatting rule for\n// top N (default is top 10) by given priority, criteria type and format\n// settings.\nfunc drawCondFmtTop10(p int, ct string, format *formatConditional) *xlsxCfRule {\n\tc := &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tRank: 10,\n\t\tDxfID: &format.Format,\n\t\tPercent: format.Percent,\n\t}\n\trank, err := strconv.Atoi(format.Value)\n\tif err == nil {\n\t\tc.Rank = rank\n\t}\n\treturn c\n}\n\n// drawCondFmtAboveAverage provides function to create conditional formatting\n// rule for above average and below average by given priority, criteria type and\n// format settings.\nfunc drawCondFmtAboveAverage(p int, ct string, format *formatConditional) *xlsxCfRule {\n\treturn &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tAboveAverage: &format.AboveAverage,\n\t\tDxfID: &format.Format,\n\t}\n}\n\n// drawCondFmtDuplicateUniqueValues provides function to create conditional\n// formatting rule for duplicate and unique values by given priority, criteria\n// type and format settings.\nfunc drawCondFmtDuplicateUniqueValues(p int, ct string, format *formatConditional) *xlsxCfRule {\n\treturn &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tDxfID: &format.Format,\n\t}\n}\n\n// drawCondFmtColorScale provides function to create conditional formatting rule\n// for color scale (include 2 color scale and 3 color scale) by given priority,\n// criteria type and format settings.\nfunc drawCondFmtColorScale(p int, ct string, format *formatConditional) *xlsxCfRule {\n\tc := &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: \"colorScale\",\n\t\tColorScale: &xlsxColorScale{\n\t\t\tCfvo: []*xlsxCfvo{\n\t\t\t\t{Type: format.MinType},\n\t\t\t},\n\t\t\tColor: []*xlsxColor{\n\t\t\t\t{RGB: getPaletteColor(format.MinColor)},\n\t\t\t},\n\t\t},\n\t}\n\tif validType[format.Type] == \"3_color_scale\" {\n\t\tc.ColorScale.Cfvo = append(c.ColorScale.Cfvo, &xlsxCfvo{Type: format.MidType, Val: 50})\n\t\tc.ColorScale.Color = append(c.ColorScale.Color, &xlsxColor{RGB: getPaletteColor(format.MidColor)})\n\t}\n\tc.ColorScale.Cfvo = append(c.ColorScale.Cfvo, &xlsxCfvo{Type: format.MaxType})\n\tc.ColorScale.Color = append(c.ColorScale.Color, &xlsxColor{RGB: getPaletteColor(format.MaxColor)})\n\treturn c\n}\n\n// drawCondFmtDataBar provides function to create conditional formatting rule\n// for data bar by given priority, criteria type and format settings.\nfunc drawCondFmtDataBar(p int, ct string, format *formatConditional) *xlsxCfRule {\n\treturn &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tDataBar: &xlsxDataBar{\n\t\t\tCfvo: []*xlsxCfvo{{Type: format.MinType}, {Type: format.MaxType}},\n\t\t\tColor: []*xlsxColor{{RGB: getPaletteColor(format.BarColor)}},\n\t\t},\n\t}\n}\n\n// drawConfFmtExp provides function to create conditional formatting rule for\n// expression by given priority, criteria type and format settings.\nfunc drawConfFmtExp(p int, ct string, format *formatConditional) *xlsxCfRule {\n\treturn &xlsxCfRule{\n\t\tPriority: p + 1,\n\t\tType: validType[format.Type],\n\t\tFormula: []string{format.Criteria},\n\t\tDxfID: &format.Format,\n\t}\n}\n\n// getPaletteColor provides function to convert the RBG color by given string.\nfunc getPaletteColor(color string) string {\n\treturn \"FF\" + strings.Replace(strings.ToUpper(color), \"#\", \"\", -1)\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/table.go", "content": "package excelize\n\nimport (\n\t\"encoding/json\"\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// parseFormatTableSet provides function to parse the format settings of the\n// table with default value.\nfunc parseFormatTableSet(formatSet string) (*formatTable, error) {\n\tformat := formatTable{\n\t\tTableStyle: \"\",\n\t\tShowRowStripes: true,\n\t}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AddTable provides the method to add table in a worksheet by given worksheet\n// name, coordinate area and format set. For example, create a table of A1:D5\n// on Sheet1:\n//\n// xlsx.AddTable(\"Sheet1\", \"A1\", \"D5\", ``)\n//\n// Create a table of F2:H6 on Sheet2 with format set:\n//\n// xlsx.AddTable(\"Sheet2\", \"F2\", \"H6\", `{\"table_name\":\"table\",\"table_style\":\"TableStyleMedium2\", \"show_first_column\":true,\"show_last_column\":true,\"show_row_stripes\":false,\"show_column_stripes\":true}`)\n//\n// Note that the table at least two lines include string type header. Multiple\n// tables coordinate areas can't have an intersection.\n//\n// table_name: The name of the table, in the same worksheet name of the table should be unique\n//\n// table_style: The built-in table style names\n//\n// TableStyleLight1 - TableStyleLight21\n// TableStyleMedium1 - TableStyleMedium28\n// TableStyleDark1 - TableStyleDark11\n//\nfunc (f *File) AddTable(sheet, hcell, vcell, format string) error {\n\tformatSet, err := parseFormatTableSet(format)\n\tif err != nil {\n\t\treturn err\n\t}\n\thcell = strings.ToUpper(hcell)\n\tvcell = strings.ToUpper(vcell)\n\t// Coordinate conversion, convert C1:B3 to 2,0,1,2.\n\thcol := string(strings.Map(letterOnlyMapF, hcell))\n\throw, _ := strconv.Atoi(strings.Map(intOnlyMapF, hcell))\n\thyAxis := hrow - 1\n\thxAxis := TitleToNumber(hcol)\n\n\tvcol := string(strings.Map(letterOnlyMapF, vcell))\n\tvrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, vcell))\n\tvyAxis := vrow - 1\n\tvxAxis := TitleToNumber(vcol)\n\tif vxAxis < hxAxis {\n\t\tvxAxis, hxAxis = hxAxis, vxAxis\n\t}\n\tif vyAxis < hyAxis {\n\t\tvyAxis, hyAxis = hyAxis, vyAxis\n\t}\n\ttableID := f.countTables() + 1\n\tsheetRelationshipsTableXML := \"../tables/table\" + strconv.Itoa(tableID) + \".xml\"\n\ttableXML := strings.Replace(sheetRelationshipsTableXML, \"..\", \"xl\", -1)\n\t// Add first table for given sheet.\n\trID := f.addSheetRelationships(sheet, SourceRelationshipTable, sheetRelationshipsTableXML, \"\")\n\tf.addSheetTable(sheet, rID)\n\tf.addTable(sheet, tableXML, hxAxis, hyAxis, vxAxis, vyAxis, tableID, formatSet)\n\tf.addContentTypePart(tableID, \"table\")\n\treturn err\n}\n\n// countTables provides function to get table files count storage in the folder\n// xl/tables.\nfunc (f *File) countTables() int {\n\tcount := 0\n\tfor k := range f.XLSX {\n\t\tif strings.Contains(k, \"xl/tables/table\") {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}\n\n// addSheetTable provides function to add tablePart element to\n// xl/worksheets/sheet%d.xml by given worksheet name and relationship index.\nfunc (f *File) addSheetTable(sheet string, rID int) {\n\txlsx := f.workSheetReader(sheet)\n\ttable := &xlsxTablePart{\n\t\tRID: \"rId\" + strconv.Itoa(rID),\n\t}\n\tif xlsx.TableParts == nil {\n\t\txlsx.TableParts = &xlsxTableParts{}\n\t}\n\txlsx.TableParts.Count++\n\txlsx.TableParts.TableParts = append(xlsx.TableParts.TableParts, table)\n}\n\n// addTable provides function to add table by given worksheet name, coordinate\n// area and format set.\nfunc (f *File) addTable(sheet, tableXML string, hxAxis, hyAxis, vxAxis, vyAxis, i int, formatSet *formatTable) {\n\t// Correct the minimum number of rows, the table at least two lines.\n\tif hyAxis == vyAxis {\n\t\tvyAxis++\n\t}\n\t// Correct table reference coordinate area, such correct C1:B3 to B1:C3.\n\tref := ToAlphaString(hxAxis) + strconv.Itoa(hyAxis+1) + \":\" + ToAlphaString(vxAxis) + strconv.Itoa(vyAxis+1)\n\ttableColumn := []*xlsxTableColumn{}\n\tidx := 0\n\tfor i := hxAxis; i <= vxAxis; i++ {\n\t\tidx++\n\t\tcell := ToAlphaString(i) + strconv.Itoa(hyAxis+1)\n\t\tname := f.GetCellValue(sheet, cell)\n\t\tif _, err := strconv.Atoi(name); err == nil {\n\t\t\tf.SetCellStr(sheet, cell, name)\n\t\t}\n\t\tif name == \"\" {\n\t\t\tname = \"Column\" + strconv.Itoa(idx)\n\t\t\tf.SetCellStr(sheet, cell, name)\n\t\t}\n\t\ttableColumn = append(tableColumn, &xlsxTableColumn{\n\t\t\tID: idx,\n\t\t\tName: name,\n\t\t})\n\t}\n\tname := formatSet.TableName\n\tif name == \"\" {\n\t\tname = \"Table\" + strconv.Itoa(i)\n\t}\n\tt := xlsxTable{\n\t\tXMLNS: NameSpaceSpreadSheet,\n\t\tID: i,\n\t\tName: name,\n\t\tDisplayName: name,\n\t\tRef: ref,\n\t\tAutoFilter: &xlsxAutoFilter{\n\t\t\tRef: ref,\n\t\t},\n\t\tTableColumns: &xlsxTableColumns{\n\t\t\tCount: idx,\n\t\t\tTableColumn: tableColumn,\n\t\t},\n\t\tTableStyleInfo: &xlsxTableStyleInfo{\n\t\t\tName: formatSet.TableStyle,\n\t\t\tShowFirstColumn: formatSet.ShowFirstColumn,\n\t\t\tShowLastColumn: formatSet.ShowLastColumn,\n\t\t\tShowRowStripes: formatSet.ShowRowStripes,\n\t\t\tShowColumnStripes: formatSet.ShowColumnStripes,\n\t\t},\n\t}\n\ttable, _ := xml.Marshal(t)\n\tf.saveFileList(tableXML, table)\n}\n\n// parseAutoFilterSet provides function to parse the settings of the auto\n// filter.\nfunc parseAutoFilterSet(formatSet string) (*formatAutoFilter, error) {\n\tformat := formatAutoFilter{}\n\terr := json.Unmarshal([]byte(formatSet), &format)\n\treturn &format, err\n}\n\n// AutoFilter provides the method to add auto filter in a worksheet by given\n// worksheet name, coordinate area and settings. An autofilter in Excel is a\n// way of filtering a 2D range of data based on some simple criteria. For\n// example applying an autofilter to a cell range A1:D4 in the Sheet1:\n//\n// err = xlsx.AutoFilter(\"Sheet1\", \"A1\", \"D4\", \"\")\n//\n// Filter data in an autofilter:\n//\n// err = xlsx.AutoFilter(\"Sheet1\", \"A1\", \"D4\", `{\"column\":\"B\",\"expression\":\"x != blanks\"}`)\n//\n// column defines the filter columns in a autofilter range based on simple\n// criteria\n//\n// It isn't sufficient to just specify the filter condition. You must also\n// hide any rows that don't match the filter condition. Rows are hidden using\n// the SetRowVisible() method. Excelize can't filter rows automatically since\n// this isn't part of the file format.\n//\n// Setting a filter criteria for a column:\n//\n// expression defines the conditions, the following operators are available\n// for setting the filter criteria:\n//\n// ==\n// !=\n// >\n// <\n// >=\n// <=\n// and\n// or\n//\n// An expression can comprise a single statement or two statements separated\n// by the 'and' and 'or' operators. For example:\n//\n// x < 2000\n// x > 2000\n// x == 2000\n// x > 2000 and x < 5000\n// x == 2000 or x == 5000\n//\n// Filtering of blank or non-blank data can be achieved by using a value of\n// Blanks or NonBlanks in the expression:\n//\n// x == Blanks\n// x == NonBlanks\n//\n// Excel also allows some simple string matching operations:\n//\n// x == b* // begins with b\n// x != b* // doesnt begin with b\n// x == *b // ends with b\n// x != *b // doesnt end with b\n// x == *b* // contains b\n// x != *b* // doesn't contains b\n//\n// You can also use '*' to match any character or number and '?' to match any\n// single character or number. No other regular expression quantifier is\n// supported by Excel's filters. Excel's regular expression characters can be\n// escaped using '~'.\n//\n// The placeholder variable x in the above examples can be replaced by any\n// simple string. The actual placeholder name is ignored internally so the\n// following are all equivalent:\n//\n// x < 2000\n// col < 2000\n// Price < 2000\n//\nfunc (f *File) AutoFilter(sheet, hcell, vcell, format string) error {\n\tformatSet, _ := parseAutoFilterSet(format)\n\n\thcell = strings.ToUpper(hcell)\n\tvcell = strings.ToUpper(vcell)\n\n\t// Coordinate conversion, convert C1:B3 to 2,0,1,2.\n\thcol := string(strings.Map(letterOnlyMapF, hcell))\n\throw, _ := strconv.Atoi(strings.Map(intOnlyMapF, hcell))\n\thyAxis := hrow - 1\n\thxAxis := TitleToNumber(hcol)\n\n\tvcol := string(strings.Map(letterOnlyMapF, vcell))\n\tvrow, _ := strconv.Atoi(strings.Map(intOnlyMapF, vcell))\n\tvyAxis := vrow - 1\n\tvxAxis := TitleToNumber(vcol)\n\n\tif vxAxis < hxAxis {\n\t\tvxAxis, hxAxis = hxAxis, vxAxis\n\t}\n\n\tif vyAxis < hyAxis {\n\t\tvyAxis, hyAxis = hyAxis, vyAxis\n\t}\n\tref := ToAlphaString(hxAxis) + strconv.Itoa(hyAxis+1) + \":\" + ToAlphaString(vxAxis) + strconv.Itoa(vyAxis+1)\n\trefRange := vxAxis - hxAxis\n\treturn f.autoFilter(sheet, ref, refRange, hxAxis, formatSet)\n}\n\n// autoFilter provides function to extract the tokens from the filter\n// expression. The tokens are mainly non-whitespace groups.\nfunc (f *File) autoFilter(sheet, ref string, refRange, hxAxis int, formatSet *formatAutoFilter) error {\n\txlsx := f.workSheetReader(sheet)\n\tif xlsx.SheetPr != nil {\n\t\txlsx.SheetPr.FilterMode = true\n\t}\n\txlsx.SheetPr = &xlsxSheetPr{FilterMode: true}\n\tfilter := &xlsxAutoFilter{\n\t\tRef: ref,\n\t}\n\txlsx.AutoFilter = filter\n\tif formatSet.Column == \"\" || formatSet.Expression == \"\" {\n\t\treturn nil\n\t}\n\tcol := TitleToNumber(formatSet.Column)\n\toffset := col - hxAxis\n\tif offset < 0 || offset > refRange {\n\t\treturn fmt.Errorf(\"Incorrect index of column '%s'\", formatSet.Column)\n\t}\n\tfilter.FilterColumn = &xlsxFilterColumn{\n\t\tColID: offset,\n\t}\n\tre := regexp.MustCompile(`\"(?:[^\"]|\"\")*\"|\\S+`)\n\ttoken := re.FindAllString(formatSet.Expression, -1)\n\tif len(token) != 3 && len(token) != 7 {\n\t\treturn fmt.Errorf(\"Incorrect number of tokens in criteria '%s'\", formatSet.Expression)\n\t}\n\texpressions, tokens, err := f.parseFilterExpression(formatSet.Expression, token)\n\tif err != nil {\n\t\treturn err\n\t}\n\tf.writeAutoFilter(filter, expressions, tokens)\n\txlsx.AutoFilter = filter\n\treturn nil\n}\n\n// writeAutoFilter provides function to check for single or double custom filters\n// as default filters and handle them accordingly.\nfunc (f *File) writeAutoFilter(filter *xlsxAutoFilter, exp []int, tokens []string) {\n\tif len(exp) == 1 && exp[0] == 2 {\n\t\t// Single equality.\n\t\tfilters := []*xlsxFilter{}\n\t\tfilters = append(filters, &xlsxFilter{Val: tokens[0]})\n\t\tfilter.FilterColumn.Filters = &xlsxFilters{Filter: filters}\n\t} else if len(exp) == 3 && exp[0] == 2 && exp[1] == 1 && exp[2] == 2 {\n\t\t// Double equality with \"or\" operator.\n\t\tfilters := []*xlsxFilter{}\n\t\tfor _, v := range tokens {\n\t\t\tfilters = append(filters, &xlsxFilter{Val: v})\n\t\t}\n\t\tfilter.FilterColumn.Filters = &xlsxFilters{Filter: filters}\n\t} else {\n\t\t// Non default custom filter.\n\t\texpRel := map[int]int{0: 0, 1: 2}\n\t\tandRel := map[int]bool{0: true, 1: false}\n\t\tfor k, v := range tokens {\n\t\t\tf.writeCustomFilter(filter, exp[expRel[k]], v)\n\t\t\tif k == 1 {\n\t\t\t\tfilter.FilterColumn.CustomFilters.And = andRel[exp[k]]\n\t\t\t}\n\t\t}\n\t}\n}\n\n// writeCustomFilter provides function to write the element.\nfunc (f *File) writeCustomFilter(filter *xlsxAutoFilter, operator int, val string) {\n\toperators := map[int]string{\n\t\t1: \"lessThan\",\n\t\t2: \"equal\",\n\t\t3: \"lessThanOrEqual\",\n\t\t4: \"greaterThan\",\n\t\t5: \"notEqual\",\n\t\t6: \"greaterThanOrEqual\",\n\t\t22: \"equal\",\n\t}\n\tcustomFilter := xlsxCustomFilter{\n\t\tOperator: operators[operator],\n\t\tVal: val,\n\t}\n\tif filter.FilterColumn.CustomFilters != nil {\n\t\tfilter.FilterColumn.CustomFilters.CustomFilter = append(filter.FilterColumn.CustomFilters.CustomFilter, &customFilter)\n\t} else {\n\t\tcustomFilters := []*xlsxCustomFilter{}\n\t\tcustomFilters = append(customFilters, &customFilter)\n\t\tfilter.FilterColumn.CustomFilters = &xlsxCustomFilters{CustomFilter: customFilters}\n\t}\n}\n\n// parseFilterExpression provides function to converts the tokens of a possibly\n// conditional expression into 1 or 2 sub expressions for further parsing.\n//\n// Examples:\n//\n// ('x', '==', 2000) -> exp1\n// ('x', '>', 2000, 'and', 'x', '<', 5000) -> exp1 and exp2\n//\nfunc (f *File) parseFilterExpression(expression string, tokens []string) ([]int, []string, error) {\n\texpressions := []int{}\n\tt := []string{}\n\tif len(tokens) == 7 {\n\t\t// The number of tokens will be either 3 (for 1 expression) or 7 (for 2\n\t\t// expressions).\n\t\tconditional := 0\n\t\tc := tokens[3]\n\t\tre, _ := regexp.Match(`(or|\\|\\|)`, []byte(c))\n\t\tif re {\n\t\t\tconditional = 1\n\t\t}\n\t\texpression1, token1, err := f.parseFilterTokens(expression, tokens[0:3])\n\t\tif err != nil {\n\t\t\treturn expressions, t, err\n\t\t}\n\t\texpression2, token2, err := f.parseFilterTokens(expression, tokens[4:7])\n\t\tif err != nil {\n\t\t\treturn expressions, t, err\n\t\t}\n\t\texpressions = []int{expression1[0], conditional, expression2[0]}\n\t\tt = []string{token1, token2}\n\t} else {\n\t\texp, token, err := f.parseFilterTokens(expression, tokens)\n\t\tif err != nil {\n\t\t\treturn expressions, t, err\n\t\t}\n\t\texpressions = exp\n\t\tt = []string{token}\n\t}\n\treturn expressions, t, nil\n}\n\n// parseFilterTokens provides function to parse the 3 tokens of a filter\n// expression and return the operator and token.\nfunc (f *File) parseFilterTokens(expression string, tokens []string) ([]int, string, error) {\n\toperators := map[string]int{\n\t\t\"==\": 2,\n\t\t\"=\": 2,\n\t\t\"=~\": 2,\n\t\t\"eq\": 2,\n\t\t\"!=\": 5,\n\t\t\"!~\": 5,\n\t\t\"ne\": 5,\n\t\t\"<>\": 5,\n\t\t\"<\": 1,\n\t\t\"<=\": 3,\n\t\t\">\": 4,\n\t\t\">=\": 6,\n\t}\n\toperator, ok := operators[strings.ToLower(tokens[1])]\n\tif !ok {\n\t\t// Convert the operator from a number to a descriptive string.\n\t\treturn []int{}, \"\", fmt.Errorf(\"Unknown operator: %s\", tokens[1])\n\t}\n\ttoken := tokens[2]\n\t// Special handling for Blanks/NonBlanks.\n\tre, _ := regexp.Match(\"blanks|nonblanks\", []byte(strings.ToLower(token)))\n\tif re {\n\t\t// Only allow Equals or NotEqual in this context.\n\t\tif operator != 2 && operator != 5 {\n\t\t\treturn []int{operator}, token, fmt.Errorf(\"The operator '%s' in expression '%s' is not valid in relation to Blanks/NonBlanks'\", tokens[1], expression)\n\t\t}\n\t\ttoken = strings.ToLower(token)\n\t\t// The operator should always be 2 (=) to flag a \"simple\" equality in\n\t\t// the binary record. Therefore we convert <> to =.\n\t\tif token == \"blanks\" {\n\t\t\tif operator == 5 {\n\t\t\t\ttoken = \" \"\n\t\t\t}\n\t\t} else {\n\t\t\tif operator == 5 {\n\t\t\t\toperator = 2\n\t\t\t\ttoken = \"blanks\"\n\t\t\t} else {\n\t\t\t\toperator = 5\n\t\t\t\ttoken = \" \"\n\t\t\t}\n\t\t}\n\t}\n\t// if the string token contains an Excel match character then change the\n\t// operator type to indicate a non \"simple\" equality.\n\tre, _ = regexp.Match(\"[*?]\", []byte(token))\n\tif operator == 2 && re {\n\t\toperator = 22\n\t}\n\treturn []int{operator}, token, nil\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/templates.go", "content": "// This file contains default templates for XML files we don't yet populated\n// based on content.\n\npackage excelize\n\n// XMLHeader define an XML declaration can also contain a standalone declaration.\nconst XMLHeader = \"\\n\"\n\nvar (\n\t// XMLHeaderByte define an XML declaration can also contain a standalone\n\t// declaration.\n\tXMLHeaderByte = []byte(XMLHeader)\n)\n\nconst templateDocpropsApp = `0Go Excelize`\n\nconst templateContentTypes = ``\n\nconst templateWorkbook = ``\n\nconst templateStyles = ``\n\nconst templateSheet = ``\n\nconst templateWorkbookRels = ``\n\nconst templateDocpropsCore = `xuri2006-09-16T00:00:00Z2006-09-16T00:00:00Z`\n\nconst templateRels = ``\n\nconst templateTheme = ``\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/vmlDrawing.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// vmlDrawing directly maps the root element in the file\n// xl/drawings/vmlDrawing%d.vml.\ntype vmlDrawing struct {\n\tXMLName xml.Name `xml:\"xml\"`\n\tXMLNSv string `xml:\"xmlns:v,attr\"`\n\tXMLNSo string `xml:\"xmlns:o,attr\"`\n\tXMLNSx string `xml:\"xmlns:x,attr\"`\n\tXMLNSmv string `xml:\"xmlns:mv,attr\"`\n\tShapelayout *xlsxShapelayout `xml:\"o:shapelayout\"`\n\tShapetype *xlsxShapetype `xml:\"v:shapetype\"`\n\tShape []xlsxShape `xml:\"v:shape\"`\n}\n\n// xlsxShapelayout directly maps the shapelayout element. This element contains\n// child elements that store information used in the editing and layout of\n// shapes.\ntype xlsxShapelayout struct {\n\tExt string `xml:\"v:ext,attr\"`\n\tIDmap *xlsxIDmap `xml:\"o:idmap\"`\n}\n\n// xlsxIDmap directly maps the idmap element.\ntype xlsxIDmap struct {\n\tExt string `xml:\"v:ext,attr\"`\n\tData int `xml:\"data,attr\"`\n}\n\n// xlsxShape directly maps the shape element.\ntype xlsxShape struct {\n\tXMLName xml.Name `xml:\"v:shape\"`\n\tID string `xml:\"id,attr\"`\n\tType string `xml:\"type,attr\"`\n\tStyle string `xml:\"style,attr\"`\n\tFillcolor string `xml:\"fillcolor,attr\"`\n\tInsetmode string `xml:\"urn:schemas-microsoft-com:office:office insetmode,attr,omitempty\"`\n\tStrokecolor string `xml:\"strokecolor,attr,omitempty\"`\n\tVal string `xml:\",innerxml\"`\n}\n\n// xlsxShapetype directly maps the shapetype element.\ntype xlsxShapetype struct {\n\tID string `xml:\"id,attr\"`\n\tCoordsize string `xml:\"coordsize,attr\"`\n\tSpt int `xml:\"o:spt,attr\"`\n\tPath string `xml:\"path,attr\"`\n\tStroke *xlsxStroke `xml:\"v:stroke\"`\n\tVPath *vPath `xml:\"v:path\"`\n}\n\n// xlsxStroke directly maps the stroke element.\ntype xlsxStroke struct {\n\tJoinstyle string `xml:\"joinstyle,attr\"`\n}\n\n// vPath directly maps the v:path element.\ntype vPath struct {\n\tGradientshapeok string `xml:\"gradientshapeok,attr,omitempty\"`\n\tConnecttype string `xml:\"o:connecttype,attr\"`\n}\n\n// vFill directly maps the v:fill element. This element must be defined within a\n// Shape element.\ntype vFill struct {\n\tAngle int `xml:\"angle,attr,omitempty\"`\n\tColor2 string `xml:\"color2,attr\"`\n\tType string `xml:\"type,attr,omitempty\"`\n\tFill *oFill `xml:\"o:fill\"`\n}\n\n// oFill directly maps the o:fill element.\ntype oFill struct {\n\tExt string `xml:\"v:ext,attr\"`\n\tType string `xml:\"type,attr,omitempty\"`\n}\n\n// vShadow directly maps the v:shadow element. This element must be defined\n// within a Shape element. In addition, the On attribute must be set to True.\ntype vShadow struct {\n\tOn string `xml:\"on,attr\"`\n\tColor string `xml:\"color,attr,omitempty\"`\n\tObscured string `xml:\"obscured,attr\"`\n}\n\n// vTextbox directly maps the v:textbox element. This element must be defined\n// within a Shape element.\ntype vTextbox struct {\n\tStyle string `xml:\"style,attr\"`\n\tDiv *xlsxDiv `xml:\"div\"`\n}\n\n// xlsxDiv directly maps the div element.\ntype xlsxDiv struct {\n\tStyle string `xml:\"style,attr\"`\n}\n\n// xClientData (Attached Object Data) directly maps the x:ClientData element.\n// This element specifies data associated with objects attached to a\n// spreadsheet. While this element might contain any of the child elements\n// below, only certain combinations are meaningful. The ObjectType attribute\n// determines the kind of object the element represents and which subset of\n// child elements is appropriate. Relevant groups are identified for each child\n// element.\ntype xClientData struct {\n\tObjectType string `xml:\"ObjectType,attr\"`\n\tMoveWithCells string `xml:\"x:MoveWithCells,omitempty\"`\n\tSizeWithCells string `xml:\"x:SizeWithCells,omitempty\"`\n\tAnchor string `xml:\"x:Anchor\"`\n\tAutoFill string `xml:\"x:AutoFill\"`\n\tRow int `xml:\"x:Row\"`\n\tColumn int `xml:\"x:Column\"`\n}\n\n// decodeVmlDrawing defines the structure used to parse the file\n// xl/drawings/vmlDrawing%d.vml.\ntype decodeVmlDrawing struct {\n\tShape []decodeShape `xml:\"urn:schemas-microsoft-com:vml shape\"`\n}\n\n// decodeShape defines the structure used to parse the particular shape element.\ntype decodeShape struct {\n\tVal string `xml:\",innerxml\"`\n}\n\n// encodeShape defines the structure used to re-serialization shape element.\ntype encodeShape struct {\n\tFill *vFill `xml:\"v:fill\"`\n\tShadow *vShadow `xml:\"v:shadow\"`\n\tPath *vPath `xml:\"v:path\"`\n\tTextbox *vTextbox `xml:\"v:textbox\"`\n\tClientData *xClientData `xml:\"x:ClientData\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlChart.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxChartSpace directly maps the c:chartSpace element. The chart namespace in\n// DrawingML is for representing visualizations of numeric data with column\n// charts, pie charts, scatter charts, or other types of charts.\ntype xlsxChartSpace struct {\n\tXMLName xml.Name `xml:\"c:chartSpace\"`\n\tXMLNSc string `xml:\"xmlns:c,attr\"`\n\tXMLNSa string `xml:\"xmlns:a,attr\"`\n\tXMLNSr string `xml:\"xmlns:r,attr\"`\n\tXMLNSc16r2 string `xml:\"xmlns:c16r2,attr\"`\n\tDate1904 *attrValBool `xml:\"c:date1904\"`\n\tLang *attrValString `xml:\"c:lang\"`\n\tRoundedCorners *attrValBool `xml:\"c:roundedCorners\"`\n\tChart cChart `xml:\"c:chart\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n\tTxPr *cTxPr `xml:\"c:txPr\"`\n\tPrintSettings *cPrintSettings `xml:\"c:printSettings\"`\n}\n\n// cThicknessSpPr directly maps the element that specifies the thickness of the\n// walls or floor as a percentage of the largest dimension of the plot volume\n// and SpPr element.\ntype cThicknessSpPr struct {\n\tThickness *attrValInt `xml:\"c:thickness\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n}\n\n// cChart (Chart) directly maps the c:chart element. This element specifies a\n// title.\ntype cChart struct {\n\tTitle *cTitle `xml:\"c:title\"`\n\tAutoTitleDeleted *cAutoTitleDeleted `xml:\"c:autoTitleDeleted\"`\n\tView3D *cView3D `xml:\"c:view3D\"`\n\tFloor *cThicknessSpPr `xml:\"c:floor\"`\n\tSideWall *cThicknessSpPr `xml:\"c:sideWall\"`\n\tBackWall *cThicknessSpPr `xml:\"c:backWall\"`\n\tPlotArea *cPlotArea `xml:\"c:plotArea\"`\n\tLegend *cLegend `xml:\"c:legend\"`\n\tPlotVisOnly *attrValBool `xml:\"c:plotVisOnly\"`\n\tDispBlanksAs *attrValString `xml:\"c:dispBlanksAs\"`\n\tShowDLblsOverMax *attrValBool `xml:\"c:showDLblsOverMax\"`\n}\n\n// cTitle (Title) directly maps the c:title element. This element specifies a\n// title.\ntype cTitle struct {\n\tTx cTx `xml:\"c:tx,omitempty\"`\n\tLayout string `xml:\"c:layout,omitempty\"`\n\tOverlay attrValBool `xml:\"c:overlay,omitempty\"`\n\tSpPr cSpPr `xml:\"c:spPr,omitempty\"`\n\tTxPr cTxPr `xml:\"c:txPr,omitempty\"`\n}\n\n// cTx (Chart Text) directly maps the c:tx element. This element specifies text\n// to use on a chart, including rich text formatting.\ntype cTx struct {\n\tStrRef *cStrRef `xml:\"c:strRef\"`\n\tRich *cRich `xml:\"c:rich,omitempty\"`\n}\n\n// cRich (Rich Text) directly maps the c:rich element. This element contains a\n// string with rich text formatting.\ntype cRich struct {\n\tBodyPr aBodyPr `xml:\"a:bodyPr,omitempty\"`\n\tLstStyle string `xml:\"a:lstStyle,omitempty\"`\n\tP aP `xml:\"a:p\"`\n}\n\n// aBodyPr (Body Properties) directly maps the a:bodyPr element. This element\n// defines the body properties for the text body within a shape.\ntype aBodyPr struct {\n\tAnchor string `xml:\"anchor,attr,omitempty\"`\n\tAnchorCtr bool `xml:\"anchorCtr,attr\"`\n\tRot int `xml:\"rot,attr\"`\n\tBIns float64 `xml:\"bIns,attr,omitempty\"`\n\tCompatLnSpc bool `xml:\"compatLnSpc,attr,omitempty\"`\n\tForceAA bool `xml:\"forceAA,attr,omitempty\"`\n\tFromWordArt bool `xml:\"fromWordArt,attr,omitempty\"`\n\tHorzOverflow string `xml:\"horzOverflow,attr,omitempty\"`\n\tLIns float64 `xml:\"lIns,attr,omitempty\"`\n\tNumCol int `xml:\"numCol,attr,omitempty\"`\n\tRIns float64 `xml:\"rIns,attr,omitempty\"`\n\tRtlCol bool `xml:\"rtlCol,attr,omitempty\"`\n\tSpcCol int `xml:\"spcCol,attr,omitempty\"`\n\tSpcFirstLastPara bool `xml:\"spcFirstLastPara,attr\"`\n\tTIns float64 `xml:\"tIns,attr,omitempty\"`\n\tUpright bool `xml:\"upright,attr,omitempty\"`\n\tVert string `xml:\"vert,attr,omitempty\"`\n\tVertOverflow string `xml:\"vertOverflow,attr,omitempty\"`\n\tWrap string `xml:\"wrap,attr,omitempty\"`\n}\n\n// aP (Paragraph) directly maps the a:p element. This element specifies a\n// paragraph of content in the document.\ntype aP struct {\n\tPPr *aPPr `xml:\"a:pPr\"`\n\tR *aR `xml:\"a:r\"`\n\tEndParaRPr *aEndParaRPr `xml:\"a:endParaRPr\"`\n}\n\n// aPPr (Paragraph Properties) directly maps the a:pPr element. This element\n// specifies a set of paragraph properties which shall be applied to the\n// contents of the parent paragraph after all style/numbering/table properties\n// have been applied to the text. These properties are defined as direct\n// formatting, since they are directly applied to the paragraph and supersede\n// any formatting from styles.\ntype aPPr struct {\n\tDefRPr aRPr `xml:\"a:defRPr\"`\n}\n\n// aSolidFill (Solid Fill) directly maps the solidFill element. This element\n// specifies a solid color fill. The shape is filled entirely with the specified\n// color.\ntype aSolidFill struct {\n\tSchemeClr *aSchemeClr `xml:\"a:schemeClr\"`\n\tSrgbClr *attrValString `xml:\"a:srgbClr\"`\n}\n\n// aSchemeClr (Scheme Color) directly maps the a:schemeClr element. This\n// element specifies a color bound to a user's theme. As with all elements which\n// define a color, it is possible to apply a list of color transforms to the\n// base color defined.\ntype aSchemeClr struct {\n\tVal string `xml:\"val,attr,omitempty\"`\n\tLumMod *attrValInt `xml:\"a:lumMod\"`\n\tLumOff *attrValInt `xml:\"a:lumOff\"`\n}\n\n// attrValInt directly maps the val element with integer data type as an\n// attribute。\ntype attrValInt struct {\n\tVal int `xml:\"val,attr\"`\n}\n\n// attrValFloat directly maps the val element with float64 data type as an\n// attribute。\ntype attrValFloat struct {\n\tVal float64 `xml:\"val,attr\"`\n}\n\n// attrValBool directly maps the val element with boolean data type as an\n// attribute。\ntype attrValBool struct {\n\tVal bool `xml:\"val,attr\"`\n}\n\n// attrValString directly maps the val element with string data type as an\n// attribute。\ntype attrValString struct {\n\tVal string `xml:\"val,attr\"`\n}\n\n// aCs directly maps the a:cs element.\ntype aCs struct {\n\tTypeface string `xml:\"typeface,attr\"`\n}\n\n// aEa directly maps the a:ea element.\ntype aEa struct {\n\tTypeface string `xml:\"typeface,attr\"`\n}\n\n// aLatin (Latin Font) directly maps the a:latin element. This element\n// specifies that a Latin font be used for a specific run of text. This font is\n// specified with a typeface attribute much like the others but is specifically\n// classified as a Latin font.\ntype aLatin struct {\n\tTypeface string `xml:\"typeface,attr\"`\n}\n\n// aR directly maps the a:r element.\ntype aR struct {\n\tRPr aRPr `xml:\"a:rPr,omitempty\"`\n\tT string `xml:\"a:t,omitempty\"`\n}\n\n// aRPr (Run Properties) directly maps the c:rPr element. This element\n// specifies a set of run properties which shall be applied to the contents of\n// the parent run after all style formatting has been applied to the text. These\n// properties are defined as direct formatting, since they are directly applied\n// to the run and supersede any formatting from styles.\ntype aRPr struct {\n\tAltLang string `xml:\"altLang,attr,omitempty\"`\n\tB bool `xml:\"b,attr\"`\n\tBaseline int `xml:\"baseline,attr\"`\n\tBmk string `xml:\"bmk,attr,omitempty\"`\n\tCap string `xml:\"cap,attr,omitempty\"`\n\tDirty bool `xml:\"dirty,attr,omitempty\"`\n\tErr bool `xml:\"err,attr,omitempty\"`\n\tI bool `xml:\"i,attr\"`\n\tKern int `xml:\"kern,attr\"`\n\tKumimoji bool `xml:\"kumimoji,attr,omitempty\"`\n\tLang string `xml:\"lang,attr,omitempty\"`\n\tNoProof bool `xml:\"noProof,attr,omitempty\"`\n\tNormalizeH bool `xml:\"normalizeH,attr,omitempty\"`\n\tSmtClean bool `xml:\"smtClean,attr,omitempty\"`\n\tSmtID uint64 `xml:\"smtId,attr,omitempty\"`\n\tSpc int `xml:\"spc,attr\"`\n\tStrike string `xml:\"strike,attr,omitempty\"`\n\tSz int `xml:\"sz,attr,omitempty\"`\n\tU string `xml:\"u,attr,omitempty\"`\n\tSolidFill *aSolidFill `xml:\"a:solidFill\"`\n\tLatin *aLatin `xml:\"a:latin\"`\n\tEa *aEa `xml:\"a:ea\"`\n\tCs *aCs `xml:\"a:cs\"`\n}\n\n// cSpPr (Shape Properties) directly maps the c:spPr element. This element\n// specifies the visual shape properties that can be applied to a shape. These\n// properties include the shape fill, outline, geometry, effects, and 3D\n// orientation.\ntype cSpPr struct {\n\tNoFill *string `xml:\"a:noFill\"`\n\tSolidFill *aSolidFill `xml:\"a:solidFill\"`\n\tLn *aLn `xml:\"a:ln\"`\n\tSp3D *aSp3D `xml:\"a:sp3d\"`\n\tEffectLst *string `xml:\"a:effectLst\"`\n}\n\n// aSp3D (3-D Shape Properties) directly maps the a:sp3d element. This element\n// defines the 3D properties associated with a particular shape in DrawingML.\n// The 3D properties which can be applied to a shape are top and bottom bevels,\n// a contour and an extrusion.\ntype aSp3D struct {\n\tContourW int `xml:\"contourW,attr\"`\n\tContourClr *aContourClr `xml:\"a:contourClr\"`\n}\n\n// aContourClr (Contour Color) directly maps the a:contourClr element. This\n// element defines the color for the contour on a shape. The contour of a shape\n// is a solid filled line which surrounds the outer edges of the shape.\ntype aContourClr struct {\n\tSchemeClr *aSchemeClr `xml:\"a:schemeClr\"`\n}\n\n// aLn (Outline) directly maps the a:ln element. This element specifies an\n// outline style that can be applied to a number of different objects such as\n// shapes and text. The line allows for the specifying of many different types\n// of outlines including even line dashes and bevels.\ntype aLn struct {\n\tAlgn string `xml:\"algn,attr,omitempty\"`\n\tCap string `xml:\"cap,attr,omitempty\"`\n\tCmpd string `xml:\"cmpd,attr,omitempty\"`\n\tW int `xml:\"w,attr,omitempty\" `\n\tNoFill string `xml:\"a:noFill,omitempty\"`\n\tRound string `xml:\"a:round,omitempty\"`\n\tSolidFill *aSolidFill `xml:\"a:solidFill\"`\n}\n\n// cTxPr (Text Properties) directly maps the c:txPr element. This element\n// specifies text formatting. The lstStyle element is not supported.\ntype cTxPr struct {\n\tBodyPr aBodyPr `xml:\"a:bodyPr,omitempty\"`\n\tLstStyle string `xml:\"a:lstStyle,omitempty\"`\n\tP aP `xml:\"a:p,omitempty\"`\n}\n\n// aEndParaRPr (End Paragraph Run Properties) directly maps the a:endParaRPr\n// element. This element specifies the text run properties that are to be used\n// if another run is inserted after the last run specified. This effectively\n// saves the run property state so that it can be applied when the user enters\n// additional text. If this element is omitted, then the application can\n// determine which default properties to apply. It is recommended that this\n// element be specified at the end of the list of text runs within the paragraph\n// so that an orderly list is maintained.\ntype aEndParaRPr struct {\n\tLang string `xml:\"lang,attr\"`\n\tAltLang string `xml:\"altLang,attr,omitempty\"`\n\tSz int `xml:\"sz,attr,omitempty\"`\n}\n\n// cAutoTitleDeleted (Auto Title Is Deleted) directly maps the\n// c:autoTitleDeleted element. This element specifies the title shall not be\n// shown for this chart.\ntype cAutoTitleDeleted struct {\n\tVal bool `xml:\"val,attr\"`\n}\n\n// cView3D (View In 3D) directly maps the c:view3D element. This element\n// specifies the 3-D view of the chart.\ntype cView3D struct {\n\tRotX *attrValInt `xml:\"c:rotX\"`\n\tRotY *attrValInt `xml:\"c:rotY\"`\n\tDepthPercent *attrValInt `xml:\"c:depthPercent\"`\n\tRAngAx *attrValInt `xml:\"c:rAngAx\"`\n}\n\n// cPlotArea directly maps the c:plotArea element. This element specifies the\n// plot area of the chart.\ntype cPlotArea struct {\n\tLayout *string `xml:\"c:layout\"`\n\tBarChart *cCharts `xml:\"c:barChart\"`\n\tBar3DChart *cCharts `xml:\"c:bar3DChart\"`\n\tDoughnutChart *cCharts `xml:\"c:doughnutChart\"`\n\tLineChart *cCharts `xml:\"c:lineChart\"`\n\tPieChart *cCharts `xml:\"c:pieChart\"`\n\tPie3DChart *cCharts `xml:\"c:pie3DChart\"`\n\tRadarChart *cCharts `xml:\"c:radarChart\"`\n\tScatterChart *cCharts `xml:\"c:scatterChart\"`\n\tCatAx []*cAxs `xml:\"c:catAx\"`\n\tValAx []*cAxs `xml:\"c:valAx\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n}\n\n// cCharts specifies the common element of the chart.\ntype cCharts struct {\n\tBarDir *attrValString `xml:\"c:barDir\"`\n\tGrouping *attrValString `xml:\"c:grouping\"`\n\tRadarStyle *attrValString `xml:\"c:radarStyle\"`\n\tScatterStyle *attrValString `xml:\"c:scatterStyle\"`\n\tVaryColors *attrValBool `xml:\"c:varyColors\"`\n\tSer *[]cSer `xml:\"c:ser\"`\n\tDLbls *cDLbls `xml:\"c:dLbls\"`\n\tHoleSize *attrValInt `xml:\"c:holeSize\"`\n\tSmooth *attrValBool `xml:\"c:smooth\"`\n\tOverlap *attrValInt `xml:\"c:overlap\"`\n\tAxID []*attrValInt `xml:\"c:axId\"`\n}\n\n// cAxs directly maps the c:catAx and c:valAx element.\ntype cAxs struct {\n\tAxID *attrValInt `xml:\"c:axId\"`\n\tScaling *cScaling `xml:\"c:scaling\"`\n\tDelete *attrValBool `xml:\"c:delete\"`\n\tAxPos *attrValString `xml:\"c:axPos\"`\n\tNumFmt *cNumFmt `xml:\"c:numFmt\"`\n\tMajorTickMark *attrValString `xml:\"c:majorTickMark\"`\n\tMinorTickMark *attrValString `xml:\"c:minorTickMark\"`\n\tTickLblPos *attrValString `xml:\"c:tickLblPos\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n\tTxPr *cTxPr `xml:\"c:txPr\"`\n\tCrossAx *attrValInt `xml:\"c:crossAx\"`\n\tCrosses *attrValString `xml:\"c:crosses\"`\n\tCrossBetween *attrValString `xml:\"c:crossBetween\"`\n\tAuto *attrValBool `xml:\"c:auto\"`\n\tLblAlgn *attrValString `xml:\"c:lblAlgn\"`\n\tLblOffset *attrValInt `xml:\"c:lblOffset\"`\n\tNoMultiLvlLbl *attrValBool `xml:\"c:noMultiLvlLbl\"`\n}\n\n// cScaling directly maps the c:scaling element. This element contains\n// additional axis settings.\ntype cScaling struct {\n\tOrientation *attrValString `xml:\"c:orientation\"`\n\tMax *attrValFloat `xml:\"c:max\"`\n\tMin *attrValFloat `xml:\"c:min\"`\n}\n\n// cNumFmt (Numbering Format) directly maps the c:numFmt element. This element\n// specifies number formatting for the parent element.\ntype cNumFmt struct {\n\tFormatCode string `xml:\"formatCode,attr\"`\n\tSourceLinked bool `xml:\"sourceLinked,attr\"`\n}\n\n// cSer directly maps the c:ser element. This element specifies a series on a\n// chart.\ntype cSer struct {\n\tIDx *attrValInt `xml:\"c:idx\"`\n\tOrder *attrValInt `xml:\"c:order\"`\n\tTx *cTx `xml:\"c:tx\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n\tDPt []*cDPt `xml:\"c:dPt\"`\n\tDLbls *cDLbls `xml:\"c:dLbls\"`\n\tMarker *cMarker `xml:\"c:marker\"`\n\tInvertIfNegative *attrValBool `xml:\"c:invertIfNegative\"`\n\tCat *cCat `xml:\"c:cat\"`\n\tVal *cVal `xml:\"c:val\"`\n\tXVal *cCat `xml:\"c:xVal\"`\n\tYVal *cVal `xml:\"c:yVal\"`\n\tSmooth *attrValBool `xml:\"c:smooth\"`\n}\n\n// cMarker (Marker) directly maps the c:marker element. This element specifies a\n// data marker.\ntype cMarker struct {\n\tSymbol *attrValString `xml:\"c:symbol\"`\n\tSize *attrValInt `xml:\"c:size\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n}\n\n// cDPt (Data Point) directly maps the c:dPt element. This element specifies a\n// single data point.\ntype cDPt struct {\n\tIDx *attrValInt `xml:\"c:idx\"`\n\tBubble3D *attrValBool `xml:\"c:bubble3D\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n}\n\n// cCat (Category Axis Data) directly maps the c:cat element. This element\n// specifies the data used for the category axis.\ntype cCat struct {\n\tStrRef *cStrRef `xml:\"c:strRef\"`\n}\n\n// cStrRef (String Reference) directly maps the c:strRef element. This element\n// specifies a reference to data for a single data label or title with a cache\n// of the last values used.\ntype cStrRef struct {\n\tF string `xml:\"c:f\"`\n\tStrCache *cStrCache `xml:\"c:strCache\"`\n}\n\n// cStrCache (String Cache) directly maps the c:strCache element. This element\n// specifies the last string data used for a chart.\ntype cStrCache struct {\n\tPt []*cPt `xml:\"c:pt\"`\n\tPtCount *attrValInt `xml:\"c:ptCount\"`\n}\n\n// cPt directly maps the c:pt element. This element specifies data for a\n// particular data point.\ntype cPt struct {\n\tIDx int `xml:\"idx,attr\"`\n\tV *string `xml:\"c:v\"`\n}\n\n// cVal directly maps the c:val element. This element specifies the data values\n// which shall be used to define the location of data markers on a chart.\ntype cVal struct {\n\tNumRef *cNumRef `xml:\"c:numRef\"`\n}\n\n// cNumRef directly maps the c:numRef element. This element specifies a\n// reference to numeric data with a cache of the last values used.\ntype cNumRef struct {\n\tF string `xml:\"c:f\"`\n\tNumCache *cNumCache `xml:\"c:numCache\"`\n}\n\n// cNumCache directly maps the c:numCache element. This element specifies the\n// last data shown on the chart for a series.\ntype cNumCache struct {\n\tFormatCode string `xml:\"c:formatCode\"`\n\tPt []*cPt `xml:\"c:pt\"`\n\tPtCount *attrValInt `xml:\"c:ptCount\"`\n}\n\n// cDLbls (Data Lables) directly maps the c:dLbls element. This element serves\n// as a root element that specifies the settings for the data labels for an\n// entire series or the entire chart. It contains child elements that specify\n// the specific formatting and positioning settings.\ntype cDLbls struct {\n\tShowLegendKey *attrValBool `xml:\"c:showLegendKey\"`\n\tShowVal *attrValBool `xml:\"c:showVal\"`\n\tShowCatName *attrValBool `xml:\"c:showCatName\"`\n\tShowSerName *attrValBool `xml:\"c:showSerName\"`\n\tShowPercent *attrValBool `xml:\"c:showPercent\"`\n\tShowBubbleSize *attrValBool `xml:\"c:showBubbleSize\"`\n\tShowLeaderLines *attrValBool `xml:\"c:showLeaderLines\"`\n}\n\n// cLegend (Legend) directly maps the c:legend element. This element specifies\n// the legend.\ntype cLegend struct {\n\tLayout *string `xml:\"c:layout\"`\n\tLegendPos *attrValString `xml:\"c:legendPos\"`\n\tOverlay *attrValBool `xml:\"c:overlay\"`\n\tSpPr *cSpPr `xml:\"c:spPr\"`\n\tTxPr *cTxPr `xml:\"c:txPr\"`\n}\n\n// cPrintSettings directly maps the c:printSettings element. This element\n// specifies the print settings for the chart.\ntype cPrintSettings struct {\n\tHeaderFooter *string `xml:\"c:headerFooter\"`\n\tPageMargins *cPageMargins `xml:\"c:pageMargins\"`\n\tPageSetup *string `xml:\"c:pageSetup\"`\n}\n\n// cPageMargins directly maps the c:pageMargins element. This element specifies\n// the page margins for a chart.\ntype cPageMargins struct {\n\tB float64 `xml:\"b,attr\"`\n\tFooter float64 `xml:\"footer,attr\"`\n\tHeader float64 `xml:\"header,attr\"`\n\tL float64 `xml:\"l,attr\"`\n\tR float64 `xml:\"r,attr\"`\n\tT float64 `xml:\"t,attr\"`\n}\n\n// formatChartAxis directly maps the format settings of the chart axis.\ntype formatChartAxis struct {\n\tCrossing string `json:\"crossing\"`\n\tMajorTickMark string `json:\"major_tick_mark\"`\n\tMinorTickMark string `json:\"minor_tick_mark\"`\n\tMinorUnitType string `json:\"minor_unit_type\"`\n\tMajorUnit int `json:\"major_unit\"`\n\tMajorUnitType string `json:\"major_unit_type\"`\n\tDisplayUnits string `json:\"display_units\"`\n\tDisplayUnitsVisible bool `json:\"display_units_visible\"`\n\tDateAxis bool `json:\"date_axis\"`\n\tReverseOrder bool `json:\"reverse_order\"`\n\tMaximum float64 `json:\"maximum\"`\n\tMinimum float64 `json:\"minimum\"`\n\tNumFormat string `json:\"num_format\"`\n\tNumFont struct {\n\t\tColor string `json:\"color\"`\n\t\tBold bool `json:\"bold\"`\n\t\tItalic bool `json:\"italic\"`\n\t\tUnderline bool `json:\"underline\"`\n\t} `json:\"num_font\"`\n\tNameLayout formatLayout `json:\"name_layout\"`\n}\n\ntype formatChartDimension struct {\n\tWidth int `json:\"width\"`\n\tHeight int `json:\"height\"`\n}\n\n// formatChart directly maps the format settings of the chart.\ntype formatChart struct {\n\tType string `json:\"type\"`\n\tSeries []formatChartSeries `json:\"series\"`\n\tFormat formatPicture `json:\"format\"`\n\tDimension formatChartDimension `json:\"dimension\"`\n\tLegend formatChartLegend `json:\"legend\"`\n\tTitle formatChartTitle `json:\"title\"`\n\tXAxis formatChartAxis `json:\"x_axis\"`\n\tYAxis formatChartAxis `json:\"y_axis\"`\n\tChartarea struct {\n\t\tBorder struct {\n\t\t\tNone bool `json:\"none\"`\n\t\t} `json:\"border\"`\n\t\tFill struct {\n\t\t\tColor string `json:\"color\"`\n\t\t} `json:\"fill\"`\n\t\tPattern struct {\n\t\t\tPattern string `json:\"pattern\"`\n\t\t\tFgColor string `json:\"fg_color\"`\n\t\t\tBgColor string `json:\"bg_color\"`\n\t\t} `json:\"pattern\"`\n\t} `json:\"chartarea\"`\n\tPlotarea struct {\n\t\tShowBubbleSize bool `json:\"show_bubble_size\"`\n\t\tShowCatName bool `json:\"show_cat_name\"`\n\t\tShowLeaderLines bool `json:\"show_leader_lines\"`\n\t\tShowPercent bool `json:\"show_percent\"`\n\t\tShowSerName bool `json:\"show_series_name\"`\n\t\tShowVal bool `json:\"show_val\"`\n\t\tGradient struct {\n\t\t\tColors []string `json:\"colors\"`\n\t\t} `json:\"gradient\"`\n\t\tBorder struct {\n\t\t\tColor string `json:\"color\"`\n\t\t\tWidth int `json:\"width\"`\n\t\t\tDashType string `json:\"dash_type\"`\n\t\t} `json:\"border\"`\n\t\tFill struct {\n\t\t\tColor string `json:\"color\"`\n\t\t} `json:\"fill\"`\n\t\tLayout formatLayout `json:\"layout\"`\n\t} `json:\"plotarea\"`\n\tShowBlanksAs string `json:\"show_blanks_as\"`\n\tShowHiddenData bool `json:\"show_hidden_data\"`\n\tSetRotation int `json:\"set_rotation\"`\n\tSetHoleSize int `json:\"set_hole_size\"`\n}\n\n// formatChartLegend directly maps the format settings of the chart legend.\ntype formatChartLegend struct {\n\tNone bool `json:\"none\"`\n\tDeleteSeries []int `json:\"delete_series\"`\n\tFont formatFont `json:\"font\"`\n\tLayout formatLayout `json:\"layout\"`\n\tPosition string `json:\"position\"`\n\tShowLegendEntry bool `json:\"show_legend_entry\"`\n\tShowLegendKey bool `json:\"show_legend_key\"`\n}\n\n// formatChartSeries directly maps the format settings of the chart series.\ntype formatChartSeries struct {\n\tName string `json:\"name\"`\n\tCategories string `json:\"categories\"`\n\tValues string `json:\"values\"`\n\tLine struct {\n\t\tNone bool `json:\"none\"`\n\t\tColor string `json:\"color\"`\n\t} `json:\"line\"`\n\tMarker struct {\n\t\tType string `json:\"type\"`\n\t\tSize int `json:\"size,\"`\n\t\tWidth float64 `json:\"width\"`\n\t\tBorder struct {\n\t\t\tColor string `json:\"color\"`\n\t\t\tNone bool `json:\"none\"`\n\t\t} `json:\"border\"`\n\t\tFill struct {\n\t\t\tColor string `json:\"color\"`\n\t\t\tNone bool `json:\"none\"`\n\t\t} `json:\"fill\"`\n\t} `json:\"marker\"`\n}\n\n// formatChartTitle directly maps the format settings of the chart title.\ntype formatChartTitle struct {\n\tNone bool `json:\"none\"`\n\tName string `json:\"name\"`\n\tOverlay bool `json:\"overlay\"`\n\tLayout formatLayout `json:\"layout\"`\n}\n\n// formatLayout directly maps the format settings of the element layout.\ntype formatLayout struct {\n\tX float64 `json:\"x\"`\n\tY float64 `json:\"y\"`\n\tWidth float64 `json:\"width\"`\n\tHeight float64 `json:\"height\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlComments.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxComments directly maps the comments element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main. A comment is a\n// rich text note that is attached to and associated with a cell, separate from\n// other cell content. Comment content is stored separate from the cell, and is\n// displayed in a drawing object (like a text box) that is separate from, but\n// associated with, a cell. Comments are used as reminders, such as noting how a\n// complex formula works, or to provide feedback to other users. Comments can\n// also be used to explain assumptions made in a formula or to call out\n// something special about the cell.\ntype xlsxComments struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main comments\"`\n\tAuthors []xlsxAuthor `xml:\"authors\"`\n\tCommentList xlsxCommentList `xml:\"commentList\"`\n}\n\n// xlsxAuthor directly maps the author element. This element holds a string\n// representing the name of a single author of comments. Every comment shall\n// have an author. The maximum length of the author string is an implementation\n// detail, but a good guideline is 255 chars.\ntype xlsxAuthor struct {\n\tAuthor string `xml:\"author\"`\n}\n\n// xlsxCommentList (List of Comments) directly maps the xlsxCommentList element.\n// This element is a container that holds a list of comments for the sheet.\ntype xlsxCommentList struct {\n\tComment []xlsxComment `xml:\"comment\"`\n}\n\n// xlsxComment directly maps the comment element. This element represents a\n// single user entered comment. Each comment shall have an author and can\n// optionally contain richly formatted text.\ntype xlsxComment struct {\n\tRef string `xml:\"ref,attr\"`\n\tAuthorID int `xml:\"authorId,attr\"`\n\tText xlsxText `xml:\"text\"`\n}\n\n// xlsxText directly maps the text element. This element contains rich text\n// which represents the text of a comment. The maximum length for this text is a\n// spreadsheet application implementation detail. A recommended guideline is\n// 32767 chars.\ntype xlsxText struct {\n\tR []xlsxR `xml:\"r\"`\n}\n\n// formatComment directly maps the format settings of the comment.\ntype formatComment struct {\n\tAuthor string `json:\"author\"`\n\tText string `json:\"text\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlContentTypes.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxTypes directly maps the types element of content types for relationship\n// parts, it takes a Multipurpose Internet Mail Extension (MIME) media type as a\n// value.\ntype xlsxTypes struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/package/2006/content-types Types\"`\n\tOverrides []xlsxOverride `xml:\"Override\"`\n\tDefaults []xlsxDefault `xml:\"Default\"`\n}\n\n// xlsxOverride directly maps the override element in the namespace\n// http://schemas.openxmlformats.org/package/2006/content-types\ntype xlsxOverride struct {\n\tPartName string `xml:\",attr\"`\n\tContentType string `xml:\",attr\"`\n}\n\n// xlsxDefault directly maps the default element in the namespace\n// http://schemas.openxmlformats.org/package/2006/content-types\ntype xlsxDefault struct {\n\tExtension string `xml:\",attr\"`\n\tContentType string `xml:\",attr\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlDecodeDrawing.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// decodeCellAnchor directly maps the oneCellAnchor (One Cell Anchor Shape Size)\n// and twoCellAnchor (Two Cell Anchor Shape Size). This element specifies a two\n// cell anchor placeholder for a group, a shape, or a drawing element. It moves\n// with cells and its extents are in EMU units.\ntype decodeCellAnchor struct {\n\tEditAs string `xml:\"editAs,attr,omitempty\"`\n\tContent string `xml:\",innerxml\"`\n}\n\n// decodeWsDr directly maps the root element for a part of this content type\n// shall wsDr. In order to solve the problem that the label structure is changed\n// after serialization and deserialization, two different structures are\n// defined. decodeWsDr just for deserialization.\ntype decodeWsDr struct {\n\tA string `xml:\"xmlns a,attr\"`\n\tXdr string `xml:\"xmlns xdr,attr\"`\n\tR string `xml:\"xmlns r,attr\"`\n\tOneCellAnchor []*decodeCellAnchor `xml:\"oneCellAnchor,omitempty\"`\n\tTwoCellAnchor []*decodeCellAnchor `xml:\"twoCellAnchor,omitempty\"`\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/drawingml/2006/spreadsheetDrawing wsDr,omitempty\"`\n}\n\n// decodeTwoCellAnchor directly maps the oneCellAnchor (One Cell Anchor Shape\n// Size) and twoCellAnchor (Two Cell Anchor Shape Size). This element specifies\n// a two cell anchor placeholder for a group, a shape, or a drawing element. It\n// moves with cells and its extents are in EMU units.\ntype decodeTwoCellAnchor struct {\n\tFrom *decodeFrom `xml:\"from\"`\n\tTo *decodeTo `xml:\"to\"`\n\tPic *decodePic `xml:\"pic,omitempty\"`\n\tClientData *decodeClientData `xml:\"clientData\"`\n}\n\n// decodeCNvPr directly maps the cNvPr (Non-Visual Drawing Properties). This\n// element specifies non-visual canvas properties. This allows for additional\n// information that does not affect the appearance of the picture to be stored.\ntype decodeCNvPr struct {\n\tID int `xml:\"id,attr\"`\n\tName string `xml:\"name,attr\"`\n\tDescr string `xml:\"descr,attr\"`\n\tTitle string `xml:\"title,attr,omitempty\"`\n}\n\n// decodePicLocks directly maps the picLocks (Picture Locks). This element\n// specifies all locking properties for a graphic frame. These properties inform\n// the generating application about specific properties that have been\n// previously locked and thus should not be changed.\ntype decodePicLocks struct {\n\tNoAdjustHandles bool `xml:\"noAdjustHandles,attr,omitempty\"`\n\tNoChangeArrowheads bool `xml:\"noChangeArrowheads,attr,omitempty\"`\n\tNoChangeAspect bool `xml:\"noChangeAspect,attr\"`\n\tNoChangeShapeType bool `xml:\"noChangeShapeType,attr,omitempty\"`\n\tNoCrop bool `xml:\"noCrop,attr,omitempty\"`\n\tNoEditPoints bool `xml:\"noEditPoints,attr,omitempty\"`\n\tNoGrp bool `xml:\"noGrp,attr,omitempty\"`\n\tNoMove bool `xml:\"noMove,attr,omitempty\"`\n\tNoResize bool `xml:\"noResize,attr,omitempty\"`\n\tNoRot bool `xml:\"noRot,attr,omitempty\"`\n\tNoSelect bool `xml:\"noSelect,attr,omitempty\"`\n}\n\n// decodeBlip directly maps the blip element in the namespace\n// http://purl.oclc.org/ooxml/officeDoc ument/relationships - This element\n// specifies the existence of an image (binary large image or picture) and\n// contains a reference to the image data.\ntype decodeBlip struct {\n\tEmbed string `xml:\"embed,attr\"`\n\tCstate string `xml:\"cstate,attr,omitempty\"`\n\tR string `xml:\"r,attr\"`\n}\n\n// decodeStretch directly maps the stretch element. This element specifies that\n// a BLIP should be stretched to fill the target rectangle. The other option is\n// a tile where a BLIP is tiled to fill the available area.\ntype decodeStretch struct {\n\tFillRect string `xml:\"fillRect\"`\n}\n\n// decodeOff directly maps the colOff and rowOff element. This element is used\n// to specify the column offset within a cell.\ntype decodeOff struct {\n\tX int `xml:\"x,attr\"`\n\tY int `xml:\"y,attr\"`\n}\n\n// decodeExt directly maps the ext element.\ntype decodeExt struct {\n\tCx int `xml:\"cx,attr\"`\n\tCy int `xml:\"cy,attr\"`\n}\n\n// decodePrstGeom directly maps the prstGeom (Preset geometry). This element\n// specifies when a preset geometric shape should be used instead of a custom\n// geometric shape. The generating application should be able to render all\n// preset geometries enumerated in the ST_ShapeType list.\ntype decodePrstGeom struct {\n\tPrst string `xml:\"prst,attr\"`\n}\n\n// decodeXfrm directly maps the xfrm (2D Transform for Graphic Frame). This\n// element specifies the transform to be applied to the corresponding graphic\n// frame. This transformation is applied to the graphic frame just as it would\n// be for a shape or group shape.\ntype decodeXfrm struct {\n\tOff decodeOff `xml:\"off\"`\n\tExt decodeExt `xml:\"ext\"`\n}\n\n// decodeCNvPicPr directly maps the cNvPicPr (Non-Visual Picture Drawing\n// Properties). This element specifies the non-visual properties for the picture\n// canvas. These properties are to be used by the generating application to\n// determine how certain properties are to be changed for the picture object in\n// question.\ntype decodeCNvPicPr struct {\n\tPicLocks decodePicLocks `xml:\"picLocks\"`\n}\n\n// directly maps the nvPicPr (Non-Visual Properties for a Picture). This element\n// specifies all non-visual properties for a picture. This element is a\n// container for the non-visual identification properties, shape properties and\n// application properties that are to be associated with a picture. This allows\n// for additional information that does not affect the appearance of the picture\n// to be stored.\ntype decodeNvPicPr struct {\n\tCNvPr decodeCNvPr `xml:\"cNvPr\"`\n\tCNvPicPr decodeCNvPicPr `xml:\"cNvPicPr\"`\n}\n\n// decodeBlipFill directly maps the blipFill (Picture Fill). This element\n// specifies the kind of picture fill that the picture object has. Because a\n// picture has a picture fill already by default, it is possible to have two\n// fills specified for a picture object.\ntype decodeBlipFill struct {\n\tBlip decodeBlip `xml:\"blip\"`\n\tStretch decodeStretch `xml:\"stretch\"`\n}\n\n// decodeSpPr directly maps the spPr (Shape Properties). This element specifies\n// the visual shape properties that can be applied to a picture. These are the\n// same properties that are allowed to describe the visual properties of a shape\n// but are used here to describe the visual appearance of a picture within a\n// document.\ntype decodeSpPr struct {\n\tXfrm decodeXfrm `xml:\"a:xfrm\"`\n\tPrstGeom decodePrstGeom `xml:\"a:prstGeom\"`\n}\n\n// decodePic elements encompass the definition of pictures within the DrawingML\n// framework. While pictures are in many ways very similar to shapes they have\n// specific properties that are unique in order to optimize for picture-\n// specific scenarios.\ntype decodePic struct {\n\tNvPicPr decodeNvPicPr `xml:\"nvPicPr\"`\n\tBlipFill decodeBlipFill `xml:\"blipFill\"`\n\tSpPr decodeSpPr `xml:\"spPr\"`\n}\n\n// decodeFrom specifies the starting anchor.\ntype decodeFrom struct {\n\tCol int `xml:\"col\"`\n\tColOff int `xml:\"colOff\"`\n\tRow int `xml:\"row\"`\n\tRowOff int `xml:\"rowOff\"`\n}\n\n// decodeTo directly specifies the ending anchor.\ntype decodeTo struct {\n\tCol int `xml:\"col\"`\n\tColOff int `xml:\"colOff\"`\n\tRow int `xml:\"row\"`\n\tRowOff int `xml:\"rowOff\"`\n}\n\n// decodeClientData directly maps the clientData element. An empty element which\n// specifies (via attributes) certain properties related to printing and\n// selection of the drawing object. The fLocksWithSheet attribute (either true\n// or false) determines whether to disable selection when the sheet is\n// protected, and fPrintsWithSheet attribute (either true or false) determines\n// whether the object is printed when the sheet is printed.\ntype decodeClientData struct {\n\tFLocksWithSheet bool `xml:\"fLocksWithSheet,attr\"`\n\tFPrintsWithSheet bool `xml:\"fPrintsWithSheet,attr\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlDrawing.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// Source relationship and namespace.\nconst (\n\tSourceRelationship = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships\"\n\tSourceRelationshipChart = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/chart\"\n\tSourceRelationshipComments = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/comments\"\n\tSourceRelationshipImage = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/image\"\n\tSourceRelationshipTable = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/table\"\n\tSourceRelationshipDrawingML = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/drawing\"\n\tSourceRelationshipDrawingVML = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/vmlDrawing\"\n\tSourceRelationshipHyperLink = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/hyperlink\"\n\tSourceRelationshipWorkSheet = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\"\n\tSourceRelationshipChart201506 = \"http://schemas.microsoft.com/office/drawing/2015/06/chart\"\n\tSourceRelationshipChart20070802 = \"http://schemas.microsoft.com/office/drawing/2007/8/2/chart\"\n\tSourceRelationshipChart2014 = \"http://schemas.microsoft.com/office/drawing/2014/chart\"\n\tSourceRelationshipCompatibility = \"http://schemas.openxmlformats.org/markup-compatibility/2006\"\n\tNameSpaceDrawingML = \"http://schemas.openxmlformats.org/drawingml/2006/main\"\n\tNameSpaceDrawingMLChart = \"http://schemas.openxmlformats.org/drawingml/2006/chart\"\n\tNameSpaceDrawingMLSpreadSheet = \"http://schemas.openxmlformats.org/drawingml/2006/spreadsheetDrawing\"\n\tNameSpaceSpreadSheet = \"http://schemas.openxmlformats.org/spreadsheetml/2006/main\"\n\tNameSpaceXML = \"http://www.w3.org/XML/1998/namespace\"\n)\n\nvar supportImageTypes = map[string]string{\".gif\": \".gif\", \".jpg\": \".jpeg\", \".jpeg\": \".jpeg\", \".png\": \".png\"}\n\n// xlsxCNvPr directly maps the cNvPr (Non-Visual Drawing Properties). This\n// element specifies non-visual canvas properties. This allows for additional\n// information that does not affect the appearance of the picture to be stored.\ntype xlsxCNvPr struct {\n\tID int `xml:\"id,attr\"`\n\tName string `xml:\"name,attr\"`\n\tDescr string `xml:\"descr,attr\"`\n\tTitle string `xml:\"title,attr,omitempty\"`\n\tHlinkClick *xlsxHlinkClick `xml:\"a:hlinkClick\"`\n}\n\n// xlsxHlinkClick (Click Hyperlink) Specifies the on-click hyperlink\n// information to be applied to a run of text. When the hyperlink text is\n// clicked the link is fetched.\ntype xlsxHlinkClick struct {\n\tR string `xml:\"xmlns:r,attr,omitempty\"`\n\tRID string `xml:\"r:id,attr,omitempty\"`\n\tInvalidURL string `xml:\"invalidUrl,attr,omitempty\"`\n\tAction string `xml:\"action,attr,omitempty\"`\n\tTgtFrame string `xml:\"tgtFrame,attr,omitempty\"`\n\tTooltip string `xml:\"tooltip,attr,omitempty\"`\n\tHistory bool `xml:\"history,attr,omitempty\"`\n\tHighlightClick bool `xml:\"highlightClick,attr,omitempty\"`\n\tEndSnd bool `xml:\"endSnd,attr,omitempty\"`\n}\n\n// xlsxPicLocks directly maps the picLocks (Picture Locks). This element\n// specifies all locking properties for a graphic frame. These properties inform\n// the generating application about specific properties that have been\n// previously locked and thus should not be changed.\ntype xlsxPicLocks struct {\n\tNoAdjustHandles bool `xml:\"noAdjustHandles,attr,omitempty\"`\n\tNoChangeArrowheads bool `xml:\"noChangeArrowheads,attr,omitempty\"`\n\tNoChangeAspect bool `xml:\"noChangeAspect,attr\"`\n\tNoChangeShapeType bool `xml:\"noChangeShapeType,attr,omitempty\"`\n\tNoCrop bool `xml:\"noCrop,attr,omitempty\"`\n\tNoEditPoints bool `xml:\"noEditPoints,attr,omitempty\"`\n\tNoGrp bool `xml:\"noGrp,attr,omitempty\"`\n\tNoMove bool `xml:\"noMove,attr,omitempty\"`\n\tNoResize bool `xml:\"noResize,attr,omitempty\"`\n\tNoRot bool `xml:\"noRot,attr,omitempty\"`\n\tNoSelect bool `xml:\"noSelect,attr,omitempty\"`\n}\n\n// xlsxBlip directly maps the blip element in the namespace\n// http://purl.oclc.org/ooxml/officeDoc ument/relationships - This element\n// specifies the existence of an image (binary large image or picture) and\n// contains a reference to the image data.\ntype xlsxBlip struct {\n\tEmbed string `xml:\"r:embed,attr\"`\n\tCstate string `xml:\"cstate,attr,omitempty\"`\n\tR string `xml:\"xmlns:r,attr\"`\n}\n\n// xlsxStretch directly maps the stretch element. This element specifies that a\n// BLIP should be stretched to fill the target rectangle. The other option is a\n// tile where a BLIP is tiled to fill the available area.\ntype xlsxStretch struct {\n\tFillRect string `xml:\"a:fillRect\"`\n}\n\n// xlsxOff directly maps the colOff and rowOff element. This element is used to\n// specify the column offset within a cell.\ntype xlsxOff struct {\n\tX int `xml:\"x,attr\"`\n\tY int `xml:\"y,attr\"`\n}\n\n// xlsxExt directly maps the ext element.\ntype xlsxExt struct {\n\tCx int `xml:\"cx,attr\"`\n\tCy int `xml:\"cy,attr\"`\n}\n\n// xlsxPrstGeom directly maps the prstGeom (Preset geometry). This element\n// specifies when a preset geometric shape should be used instead of a custom\n// geometric shape. The generating application should be able to render all\n// preset geometries enumerated in the ST_ShapeType list.\ntype xlsxPrstGeom struct {\n\tPrst string `xml:\"prst,attr\"`\n}\n\n// xlsxXfrm directly maps the xfrm (2D Transform for Graphic Frame). This\n// element specifies the transform to be applied to the corresponding graphic\n// frame. This transformation is applied to the graphic frame just as it would\n// be for a shape or group shape.\ntype xlsxXfrm struct {\n\tOff xlsxOff `xml:\"a:off\"`\n\tExt xlsxExt `xml:\"a:ext\"`\n}\n\n// xlsxCNvPicPr directly maps the cNvPicPr (Non-Visual Picture Drawing\n// Properties). This element specifies the non-visual properties for the picture\n// canvas. These properties are to be used by the generating application to\n// determine how certain properties are to be changed for the picture object in\n// question.\ntype xlsxCNvPicPr struct {\n\tPicLocks xlsxPicLocks `xml:\"a:picLocks\"`\n}\n\n// directly maps the nvPicPr (Non-Visual Properties for a Picture). This element\n// specifies all non-visual properties for a picture. This element is a\n// container for the non-visual identification properties, shape properties and\n// application properties that are to be associated with a picture. This allows\n// for additional information that does not affect the appearance of the picture\n// to be stored.\ntype xlsxNvPicPr struct {\n\tCNvPr xlsxCNvPr `xml:\"xdr:cNvPr\"`\n\tCNvPicPr xlsxCNvPicPr `xml:\"xdr:cNvPicPr\"`\n}\n\n// xlsxBlipFill directly maps the blipFill (Picture Fill). This element\n// specifies the kind of picture fill that the picture object has. Because a\n// picture has a picture fill already by default, it is possible to have two\n// fills specified for a picture object.\ntype xlsxBlipFill struct {\n\tBlip xlsxBlip `xml:\"a:blip\"`\n\tStretch xlsxStretch `xml:\"a:stretch\"`\n}\n\n// xlsxSpPr directly maps the spPr (Shape Properties). This element specifies\n// the visual shape properties that can be applied to a picture. These are the\n// same properties that are allowed to describe the visual properties of a shape\n// but are used here to describe the visual appearance of a picture within a\n// document.\ntype xlsxSpPr struct {\n\tXfrm xlsxXfrm `xml:\"a:xfrm\"`\n\tPrstGeom xlsxPrstGeom `xml:\"a:prstGeom\"`\n}\n\n// xlsxPic elements encompass the definition of pictures within the DrawingML\n// framework. While pictures are in many ways very similar to shapes they have\n// specific properties that are unique in order to optimize for picture-\n// specific scenarios.\ntype xlsxPic struct {\n\tNvPicPr xlsxNvPicPr `xml:\"xdr:nvPicPr\"`\n\tBlipFill xlsxBlipFill `xml:\"xdr:blipFill\"`\n\tSpPr xlsxSpPr `xml:\"xdr:spPr\"`\n}\n\n// xlsxFrom specifies the starting anchor.\ntype xlsxFrom struct {\n\tCol int `xml:\"xdr:col\"`\n\tColOff int `xml:\"xdr:colOff\"`\n\tRow int `xml:\"xdr:row\"`\n\tRowOff int `xml:\"xdr:rowOff\"`\n}\n\n// xlsxTo directly specifies the ending anchor.\ntype xlsxTo struct {\n\tCol int `xml:\"xdr:col\"`\n\tColOff int `xml:\"xdr:colOff\"`\n\tRow int `xml:\"xdr:row\"`\n\tRowOff int `xml:\"xdr:rowOff\"`\n}\n\n// xdrClientData directly maps the clientData element. An empty element which\n// specifies (via attributes) certain properties related to printing and\n// selection of the drawing object. The fLocksWithSheet attribute (either true\n// or false) determines whether to disable selection when the sheet is\n// protected, and fPrintsWithSheet attribute (either true or false) determines\n// whether the object is printed when the sheet is printed.\ntype xdrClientData struct {\n\tFLocksWithSheet bool `xml:\"fLocksWithSheet,attr\"`\n\tFPrintsWithSheet bool `xml:\"fPrintsWithSheet,attr\"`\n}\n\n// xdrCellAnchor directly maps the oneCellAnchor (One Cell Anchor Shape Size)\n// and twoCellAnchor (Two Cell Anchor Shape Size). This element specifies a two\n// cell anchor placeholder for a group, a shape, or a drawing element. It moves\n// with cells and its extents are in EMU units.\ntype xdrCellAnchor struct {\n\tEditAs string `xml:\"editAs,attr,omitempty\"`\n\tFrom *xlsxFrom `xml:\"xdr:from\"`\n\tTo *xlsxTo `xml:\"xdr:to\"`\n\tExt *xlsxExt `xml:\"xdr:ext\"`\n\tSp *xdrSp `xml:\"xdr:sp\"`\n\tPic *xlsxPic `xml:\"xdr:pic,omitempty\"`\n\tGraphicFrame string `xml:\",innerxml\"`\n\tClientData *xdrClientData `xml:\"xdr:clientData\"`\n}\n\n// xlsxWsDr directly maps the root element for a part of this content type shall\n// wsDr.\ntype xlsxWsDr struct {\n\tXMLName xml.Name `xml:\"xdr:wsDr\"`\n\tOneCellAnchor []*xdrCellAnchor `xml:\"xdr:oneCellAnchor\"`\n\tTwoCellAnchor []*xdrCellAnchor `xml:\"xdr:twoCellAnchor\"`\n\tA string `xml:\"xmlns:a,attr,omitempty\"`\n\tXdr string `xml:\"xmlns:xdr,attr,omitempty\"`\n\tR string `xml:\"xmlns:r,attr,omitempty\"`\n}\n\n// xlsxGraphicFrame (Graphic Frame) directly maps the xdr:graphicFrame element.\n// This element specifies the existence of a graphics frame. This frame contains\n// a graphic that was generated by an external source and needs a container in\n// which to be displayed on the slide surface.\ntype xlsxGraphicFrame struct {\n\tXMLName xml.Name `xml:\"xdr:graphicFrame\"`\n\tMacro string `xml:\"macro,attr\"`\n\tNvGraphicFramePr xlsxNvGraphicFramePr `xml:\"xdr:nvGraphicFramePr\"`\n\tXfrm xlsxXfrm `xml:\"xdr:xfrm\"`\n\tGraphic *xlsxGraphic `xml:\"a:graphic\"`\n}\n\n// xlsxNvGraphicFramePr (Non-Visual Properties for a Graphic Frame) directly\n// maps the xdr:nvGraphicFramePr element. This element specifies all non-visual\n// properties for a graphic frame. This element is a container for the non-\n// visual identification properties, shape properties and application properties\n// that are to be associated with a graphic frame. This allows for additional\n// information that does not affect the appearance of the graphic frame to be\n// stored.\ntype xlsxNvGraphicFramePr struct {\n\tCNvPr *xlsxCNvPr `xml:\"xdr:cNvPr\"`\n\tChicNvGraphicFramePr string `xml:\"xdr:cNvGraphicFramePr\"`\n}\n\n// xlsxGraphic (Graphic Object) directly maps the a:graphic element. This\n// element specifies the existence of a single graphic object. Document authors\n// should refer to this element when they wish to persist a graphical object of\n// some kind. The specification for this graphical object is provided entirely\n// by the document author and referenced within the graphicData child element.\ntype xlsxGraphic struct {\n\tGraphicData *xlsxGraphicData `xml:\"a:graphicData\"`\n}\n\n// xlsxGraphicData (Graphic Object Data) directly maps the a:graphicData\n// element. This element specifies the reference to a graphic object within the\n// document. This graphic object is provided entirely by the document authors\n// who choose to persist this data within the document.\ntype xlsxGraphicData struct {\n\tURI string `xml:\"uri,attr\"`\n\tChart *xlsxChart `xml:\"c:chart,omitempty\"`\n}\n\n// xlsxChart (Chart) directly maps the c:chart element.\ntype xlsxChart struct {\n\tC string `xml:\"xmlns:c,attr\"`\n\tRID string `xml:\"r:id,attr\"`\n\tR string `xml:\"xmlns:r,attr\"`\n}\n\n// xdrSp (Shape) directly maps the xdr:sp element. This element specifies the\n// existence of a single shape. A shape can either be a preset or a custom\n// geometry, defined using the SpreadsheetDrawingML framework. In addition to a\n// geometry each shape can have both visual and non-visual properties attached.\n// Text and corresponding styling information can also be attached to a shape.\n// This shape is specified along with all other shapes within either the shape\n// tree or group shape elements.\ntype xdrSp struct {\n\tMacro string `xml:\"macro,attr\"`\n\tTextlink string `xml:\"textlink,attr\"`\n\tNvSpPr *xdrNvSpPr `xml:\"xdr:nvSpPr\"`\n\tSpPr *xlsxSpPr `xml:\"xdr:spPr\"`\n\tStyle *xdrStyle `xml:\"xdr:style\"`\n\tTxBody *xdrTxBody `xml:\"xdr:txBody\"`\n}\n\n// xdrNvSpPr (Non-Visual Properties for a Shape) directly maps the xdr:nvSpPr\n// element. This element specifies all non-visual properties for a shape. This\n// element is a container for the non-visual identification properties, shape\n// properties and application properties that are to be associated with a shape.\n// This allows for additional information that does not affect the appearance of\n// the shape to be stored.\ntype xdrNvSpPr struct {\n\tCNvPr *xlsxCNvPr `xml:\"xdr:cNvPr\"`\n\tCNvSpPr *xdrCNvSpPr `xml:\"xdr:cNvSpPr\"`\n}\n\n// xdrCNvSpPr (Connection Non-Visual Shape Properties) directly maps the\n// xdr:cNvSpPr element. This element specifies the set of non-visual properties\n// for a connection shape. These properties specify all data about the\n// connection shape which do not affect its display within a spreadsheet.\ntype xdrCNvSpPr struct {\n\tTxBox bool `xml:\"txBox,attr\"`\n}\n\n// xdrStyle (Shape Style) directly maps the xdr:style element. The element\n// specifies the style that is applied to a shape and the corresponding\n// references for each of the style components such as lines and fills.\ntype xdrStyle struct {\n\tLnRef *aRef `xml:\"a:lnRef\"`\n\tFillRef *aRef `xml:\"a:fillRef\"`\n\tEffectRef *aRef `xml:\"a:effectRef\"`\n\tFontRef *aFontRef `xml:\"a:fontRef\"`\n}\n\n// aRef directly maps the a:lnRef, a:fillRef and a:effectRef element.\ntype aRef struct {\n\tIdx int `xml:\"idx,attr\"`\n\tScrgbClr *aScrgbClr `xml:\"a:scrgbClr\"`\n\tSchemeClr *attrValString `xml:\"a:schemeClr\"`\n\tSrgbClr *attrValString `xml:\"a:srgbClr\"`\n}\n\n// aScrgbClr (RGB Color Model - Percentage Variant) directly maps the a:scrgbClr\n// element. This element specifies a color using the red, green, blue RGB color\n// model. Each component, red, green, and blue is expressed as a percentage from\n// 0% to 100%. A linear gamma of 1.0 is assumed.\ntype aScrgbClr struct {\n\tR float64 `xml:\"r,attr\"`\n\tG float64 `xml:\"g,attr\"`\n\tB float64 `xml:\"b,attr\"`\n}\n\n// aFontRef (Font Reference) directly maps the a:fontRef element. This element\n// represents a reference to a themed font. When used it specifies which themed\n// font to use along with a choice of color.\ntype aFontRef struct {\n\tIdx string `xml:\"idx,attr\"`\n\tSchemeClr *attrValString `xml:\"a:schemeClr\"`\n}\n\n// xdrTxBody (Shape Text Body) directly maps the xdr:txBody element. This\n// element specifies the existence of text to be contained within the\n// corresponding shape. All visible text and visible text related properties are\n// contained within this element. There can be multiple paragraphs and within\n// paragraphs multiple runs of text.\ntype xdrTxBody struct {\n\tBodyPr *aBodyPr `xml:\"a:bodyPr\"`\n\tP []*aP `xml:\"a:p\"`\n}\n\n// formatPicture directly maps the format settings of the picture.\ntype formatPicture struct {\n\tFPrintsWithSheet bool `json:\"print_obj\"`\n\tFLocksWithSheet bool `json:\"locked\"`\n\tNoChangeAspect bool `json:\"lock_aspect_ratio\"`\n\tOffsetX int `json:\"x_offset\"`\n\tOffsetY int `json:\"y_offset\"`\n\tXScale float64 `json:\"x_scale\"`\n\tYScale float64 `json:\"y_scale\"`\n\tHyperlink string `json:\"hyperlink\"`\n\tHyperlinkType string `json:\"hyperlink_type\"`\n\tPositioning string `json:\"positioning\"`\n}\n\n// formatShape directly maps the format settings of the shape.\ntype formatShape struct {\n\tType string `json:\"type\"`\n\tWidth int `json:\"width\"`\n\tHeight int `json:\"height\"`\n\tFormat formatPicture `json:\"format\"`\n\tColor formatShapeColor `json:\"color\"`\n\tParagraph []formatShapeParagraph `json:\"paragraph\"`\n}\n\n// formatShapeParagraph directly maps the format settings of the paragraph in\n// the shape.\ntype formatShapeParagraph struct {\n\tFont formatFont `json:\"font\"`\n\tText string `json:\"text\"`\n}\n\n// formatShapeColor directly maps the color settings of the shape.\ntype formatShapeColor struct {\n\tLine string `json:\"line\"`\n\tFill string `json:\"fill\"`\n\tEffect string `json:\"effect\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlSharedStrings.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxSST directly maps the sst element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main. String values may\n// be stored directly inside spreadsheet cell elements; however, storing the\n// same value inside multiple cell elements can result in very large worksheet\n// Parts, possibly resulting in performance degradation. The Shared String Table\n// is an indexed list of string values, shared across the workbook, which allows\n// implementations to store values only once.\ntype xlsxSST struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main sst\"`\n\tCount int `xml:\"count,attr\"`\n\tUniqueCount int `xml:\"uniqueCount,attr\"`\n\tSI []xlsxSI `xml:\"si\"`\n}\n\n// xlsxSI directly maps the si element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked this for completeness - it does as much as I need.\ntype xlsxSI struct {\n\tT string `xml:\"t\"`\n\tR []xlsxR `xml:\"r\"`\n}\n\n// xlsxR directly maps the r element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked this for completeness - it does as much as I need.\ntype xlsxR struct {\n\tRPr *xlsxRPr `xml:\"rPr\"`\n\tT string `xml:\"t\"`\n}\n\n// xlsxRPr (Run Properties) specifies a set of run properties which shall be\n// applied to the contents of the parent run after all style formatting has been\n// applied to the text. These properties are defined as direct formatting, since\n// they are directly applied to the run and supersede any formatting from\n// styles.\ntype xlsxRPr struct {\n\tB string `xml:\"b,omitempty\"`\n\tSz *attrValFloat `xml:\"sz\"`\n\tColor *xlsxColor `xml:\"color\"`\n\tRFont *attrValString `xml:\"rFont\"`\n\tFamily *attrValInt `xml:\"family\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlStyles.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxStyleSheet directly maps the stylesheet element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxStyleSheet struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main styleSheet\"`\n\tNumFmts *xlsxNumFmts `xml:\"numFmts,omitempty\"`\n\tFonts *xlsxFonts `xml:\"fonts,omitempty\"`\n\tFills *xlsxFills `xml:\"fills,omitempty\"`\n\tBorders *xlsxBorders `xml:\"borders,omitempty\"`\n\tCellStyleXfs *xlsxCellStyleXfs `xml:\"cellStyleXfs,omitempty\"`\n\tCellXfs *xlsxCellXfs `xml:\"cellXfs,omitempty\"`\n\tCellStyles *xlsxCellStyles `xml:\"cellStyles,omitempty\"`\n\tDxfs *xlsxDxfs `xml:\"dxfs,omitempty\"`\n\tTableStyles *xlsxTableStyles `xml:\"tableStyles,omitempty\"`\n\tColors *xlsxStyleColors `xml:\"colors,omitempty\"`\n\tExtLst *xlsxExtLst `xml:\"extLst\"`\n}\n\n// xlsxAlignment formatting information pertaining to text alignment in cells.\n// There are a variety of choices for how text is aligned both horizontally and\n// vertically, as well as indentation settings, and so on.\ntype xlsxAlignment struct {\n\tHorizontal string `xml:\"horizontal,attr,omitempty\"`\n\tIndent int `xml:\"indent,attr,omitempty\"`\n\tJustifyLastLine bool `xml:\"justifyLastLine,attr,omitempty\"`\n\tReadingOrder uint64 `xml:\"readingOrder,attr,omitempty\"`\n\tRelativeIndent int `xml:\"relativeIndent,attr,omitempty\"`\n\tShrinkToFit bool `xml:\"shrinkToFit,attr,omitempty\"`\n\tTextRotation int `xml:\"textRotation,attr,omitempty\"`\n\tVertical string `xml:\"vertical,attr,omitempty\"`\n\tWrapText bool `xml:\"wrapText,attr,omitempty\"`\n}\n\n// xlsxProtection (Protection Properties) contains protection properties\n// associated with the cell. Each cell has protection properties that can be\n// set. The cell protection properties do not take effect unless the sheet has\n// been protected.\ntype xlsxProtection struct {\n\tHidden bool `xml:\"hidden,attr\"`\n\tLocked bool `xml:\"locked,attr\"`\n}\n\n// xlsxLine directly maps the line style element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxLine struct {\n\tStyle string `xml:\"style,attr,omitempty\"`\n\tColor *xlsxColor `xml:\"color,omitempty\"`\n}\n\n// xlsxColor is a common mapping used for both the fgColor and bgColor elements.\n// Foreground color of the cell fill pattern. Cell fill patterns operate with\n// two colors: a background color and a foreground color. These combine together\n// to make a patterned cell fill. Background color of the cell fill pattern.\n// Cell fill patterns operate with two colors: a background color and a\n// foreground color. These combine together to make a patterned cell fill.\ntype xlsxColor struct {\n\tAuto bool `xml:\"auto,attr,omitempty\"`\n\tRGB string `xml:\"rgb,attr,omitempty\"`\n\tIndexed int `xml:\"indexed,attr,omitempty\"`\n\tTheme *int `xml:\"theme,attr\"`\n\tTint float64 `xml:\"tint,attr,omitempty\"`\n}\n\n// xlsxFonts directly maps the font element. This element contains all font\n// definitions for this workbook.\ntype xlsxFonts struct {\n\tCount int `xml:\"count,attr\"`\n\tFont []*xlsxFont `xml:\"font\"`\n}\n\n// font directly maps the font element.\ntype font struct {\n\tName *attrValString `xml:\"name\"`\n\tCharset *attrValInt `xml:\"charset\"`\n\tFamily *attrValInt `xml:\"family\"`\n\tB bool `xml:\"b,omitempty\"`\n\tI bool `xml:\"i,omitempty\"`\n\tStrike bool `xml:\"strike,omitempty\"`\n\tOutline bool `xml:\"outline,omitempty\"`\n\tShadow bool `xml:\"shadow,omitempty\"`\n\tCondense bool `xml:\"condense,omitempty\"`\n\tExtend bool `xml:\"extend,omitempty\"`\n\tColor *xlsxColor `xml:\"color\"`\n\tSz *attrValInt `xml:\"sz\"`\n\tU *attrValString `xml:\"u\"`\n\tScheme *attrValString `xml:\"scheme\"`\n}\n\n// xlsxFont directly maps the font element. This element defines the properties\n// for one of the fonts used in this workbook.\ntype xlsxFont struct {\n\tFont string `xml:\",innerxml\"`\n}\n\n// xlsxFills directly maps the fills element. This element defines the cell\n// fills portion of the Styles part, consisting of a sequence of fill records. A\n// cell fill consists of a background color, foreground color, and pattern to be\n// applied across the cell.\ntype xlsxFills struct {\n\tCount int `xml:\"count,attr\"`\n\tFill []*xlsxFill `xml:\"fill,omitempty\"`\n}\n\n// xlsxFill directly maps the fill element. This element specifies fill\n// formatting.\ntype xlsxFill struct {\n\tPatternFill *xlsxPatternFill `xml:\"patternFill,omitempty\"`\n\tGradientFill *xlsxGradientFill `xml:\"gradientFill,omitempty\"`\n}\n\n// xlsxPatternFill directly maps the patternFill element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need. This element is\n// used to specify cell fill information for pattern and solid color cell fills.\n// For solid cell fills (no pattern), fgColor is used. For cell fills with\n// patterns specified, then the cell fill color is specified by the bgColor\n// element.\ntype xlsxPatternFill struct {\n\tPatternType string `xml:\"patternType,attr,omitempty\"`\n\tFgColor xlsxColor `xml:\"fgColor,omitempty\"`\n\tBgColor xlsxColor `xml:\"bgColor,omitempty\"`\n}\n\n// xlsxGradientFill defines a gradient-style cell fill. Gradient cell fills can\n// use one or two colors as the end points of color interpolation.\ntype xlsxGradientFill struct {\n\tBottom float64 `xml:\"bottom,attr,omitempty\"`\n\tDegree float64 `xml:\"degree,attr,omitempty\"`\n\tLeft float64 `xml:\"left,attr,omitempty\"`\n\tRight float64 `xml:\"right,attr,omitempty\"`\n\tTop float64 `xml:\"top,attr,omitempty\"`\n\tType string `xml:\"type,attr,omitempty\"`\n\tStop []*xlsxGradientFillStop `xml:\"stop,omitempty\"`\n}\n\n// xlsxGradientFillStop directly maps the stop element.\ntype xlsxGradientFillStop struct {\n\tPosition float64 `xml:\"position,attr\"`\n\tColor xlsxColor `xml:\"color,omitempty\"`\n}\n\n// xlsxBorders directly maps the borders element. This element contains borders\n// formatting information, specifying all border definitions for all cells in\n// the workbook.\ntype xlsxBorders struct {\n\tCount int `xml:\"count,attr\"`\n\tBorder []*xlsxBorder `xml:\"border,omitempty\"`\n}\n\n// xlsxBorder directly maps the border element. Expresses a single set of cell\n// border formats (left, right, top, bottom, diagonal). Color is optional. When\n// missing, 'automatic' is implied.\ntype xlsxBorder struct {\n\tDiagonalDown bool `xml:\"diagonalDown,attr,omitempty\"`\n\tDiagonalUp bool `xml:\"diagonalUp,attr,omitempty\"`\n\tOutline bool `xml:\"outline,attr,omitempty\"`\n\tLeft xlsxLine `xml:\"left,omitempty\"`\n\tRight xlsxLine `xml:\"right,omitempty\"`\n\tTop xlsxLine `xml:\"top,omitempty\"`\n\tBottom xlsxLine `xml:\"bottom,omitempty\"`\n\tDiagonal xlsxLine `xml:\"diagonal,omitempty\"`\n}\n\n// xlsxCellStyles directly maps the cellStyles element. This element contains\n// the named cell styles, consisting of a sequence of named style records. A\n// named cell style is a collection of direct or themed formatting (e.g., cell\n// border, cell fill, and font type/size/style) grouped together into a single\n// named style, and can be applied to a cell.\ntype xlsxCellStyles struct {\n\tXMLName xml.Name `xml:\"cellStyles\"`\n\tCount int `xml:\"count,attr\"`\n\tCellStyle []*xlsxCellStyle `xml:\"cellStyle,omitempty\"`\n}\n\n// xlsxCellStyle directly maps the cellStyle element. This element represents\n// the name and related formatting records for a named cell style in this\n// workbook.\ntype xlsxCellStyle struct {\n\tXMLName xml.Name `xml:\"cellStyle\"`\n\tBuiltInID *int `xml:\"builtinId,attr,omitempty\"`\n\tCustomBuiltIn *bool `xml:\"customBuiltin,attr,omitempty\"`\n\tHidden *bool `xml:\"hidden,attr,omitempty\"`\n\tILevel *bool `xml:\"iLevel,attr,omitempty\"`\n\tName string `xml:\"name,attr\"`\n\tXfID int `xml:\"xfId,attr\"`\n}\n\n// xlsxCellStyleXfs directly maps the cellStyleXfs element. This element\n// contains the master formatting records (xf's) which define the formatting for\n// all named cell styles in this workbook. Master formatting records reference\n// individual elements of formatting (e.g., number format, font definitions,\n// cell fills, etc) by specifying a zero-based index into those collections.\n// Master formatting records also specify whether to apply or ignore particular\n// aspects of formatting.\ntype xlsxCellStyleXfs struct {\n\tCount int `xml:\"count,attr\"`\n\tXf []xlsxXf `xml:\"xf,omitempty\"`\n}\n\n// xlsxXf directly maps the xf element. A single xf element describes all of the\n// formatting for a cell.\ntype xlsxXf struct {\n\tApplyAlignment bool `xml:\"applyAlignment,attr\"`\n\tApplyBorder bool `xml:\"applyBorder,attr\"`\n\tApplyFill bool `xml:\"applyFill,attr\"`\n\tApplyFont bool `xml:\"applyFont,attr\"`\n\tApplyNumberFormat bool `xml:\"applyNumberFormat,attr\"`\n\tApplyProtection bool `xml:\"applyProtection,attr\"`\n\tBorderID int `xml:\"borderId,attr\"`\n\tFillID int `xml:\"fillId,attr\"`\n\tFontID int `xml:\"fontId,attr\"`\n\tNumFmtID int `xml:\"numFmtId,attr\"`\n\tPivotButton bool `xml:\"pivotButton,attr,omitempty\"`\n\tQuotePrefix bool `xml:\"quotePrefix,attr,omitempty\"`\n\tXfID *int `xml:\"xfId,attr\"`\n\tAlignment *xlsxAlignment `xml:\"alignment\"`\n\tProtection *xlsxProtection `xml:\"protection\"`\n}\n\n// xlsxCellXfs directly maps the cellXfs element. This element contains the\n// master formatting records (xf) which define the formatting applied to cells\n// in this workbook. These records are the starting point for determining the\n// formatting for a cell. Cells in the Sheet Part reference the xf records by\n// zero-based index.\ntype xlsxCellXfs struct {\n\tCount int `xml:\"count,attr\"`\n\tXf []xlsxXf `xml:\"xf,omitempty\"`\n}\n\n// xlsxDxfs directly maps the dxfs element. This element contains the master\n// differential formatting records (dxf's) which define formatting for all non-\n// cell formatting in this workbook. Whereas xf records fully specify a\n// particular aspect of formatting (e.g., cell borders) by referencing those\n// formatting definitions elsewhere in the Styles part, dxf records specify\n// incremental (or differential) aspects of formatting directly inline within\n// the dxf element. The dxf formatting is to be applied on top of or in addition\n// to any formatting already present on the object using the dxf record.\ntype xlsxDxfs struct {\n\tCount int `xml:\"count,attr\"`\n\tDxfs []*xlsxDxf `xml:\"dxf,omitempty\"`\n}\n\n// xlsxDxf directly maps the dxf element. A single dxf record, expressing\n// incremental formatting to be applied.\ntype xlsxDxf struct {\n\tDxf string `xml:\",innerxml\"`\n}\n\n// dxf directly maps the dxf element.\ntype dxf struct {\n\tFont *font `xml:\"font\"`\n\tNumFmt *xlsxNumFmt `xml:\"numFmt\"`\n\tFill *xlsxFill `xml:\"fill\"`\n\tAlignment *xlsxAlignment `xml:\"alignment\"`\n\tBorder *xlsxBorder `xml:\"border\"`\n\tProtection *xlsxProtection `xml:\"protection\"`\n\tExtLst *xlsxExt `xml:\"extLst\"`\n}\n\n// xlsxTableStyles directly maps the tableStyles element. This element\n// represents a collection of Table style definitions for Table styles and\n// PivotTable styles used in this workbook. It consists of a sequence of\n// tableStyle records, each defining a single Table style.\ntype xlsxTableStyles struct {\n\tCount int `xml:\"count,attr\"`\n\tDefaultPivotStyle string `xml:\"defaultPivotStyle,attr\"`\n\tDefaultTableStyle string `xml:\"defaultTableStyle,attr\"`\n\tTableStyles []*xlsxTableStyle `xml:\"tableStyle,omitempty\"`\n}\n\n// xlsxTableStyle directly maps the tableStyle element. This element represents\n// a single table style definition that indicates how a spreadsheet application\n// should format and display a table.\ntype xlsxTableStyle struct {\n\tName string `xml:\"name,attr,omitempty\"`\n\tPivot int `xml:\"pivot,attr\"`\n\tCount int `xml:\"count,attr,omitempty\"`\n\tTable bool `xml:\"table,attr,omitempty\"`\n\tTableStyleElement string `xml:\",innerxml\"`\n}\n\n// xlsxNumFmts directly maps the numFmts element. This element defines the\n// number formats in this workbook, consisting of a sequence of numFmt records,\n// where each numFmt record defines a particular number format, indicating how\n// to format and render the numeric value of a cell.\ntype xlsxNumFmts struct {\n\tCount int `xml:\"count,attr\"`\n\tNumFmt []*xlsxNumFmt `xml:\"numFmt,omitempty\"`\n}\n\n// xlsxNumFmt directly maps the numFmt element. This element specifies number\n// format properties which indicate how to format and render the numeric value\n// of a cell.\ntype xlsxNumFmt struct {\n\tNumFmtID int `xml:\"numFmtId,attr,omitempty\"`\n\tFormatCode string `xml:\"formatCode,attr,omitempty\"`\n}\n\n// xlsxStyleColors directly maps the colors element. Color information\n// associated with this stylesheet. This collection is written whenever the\n// legacy color palette has been modified (backwards compatibility settings) or\n// a custom color has been selected while using this workbook.\ntype xlsxStyleColors struct {\n\tColor string `xml:\",innerxml\"`\n}\n\n// formatFont directly maps the styles settings of the fonts.\ntype formatFont struct {\n\tBold bool `json:\"bold\"`\n\tItalic bool `json:\"italic\"`\n\tUnderline string `json:\"underline\"`\n\tFamily string `json:\"family\"`\n\tSize int `json:\"size\"`\n\tColor string `json:\"color\"`\n}\n\n// formatStyle directly maps the styles settings of the cells.\ntype formatStyle struct {\n\tBorder []struct {\n\t\tType string `json:\"type\"`\n\t\tColor string `json:\"color\"`\n\t\tStyle int `json:\"style\"`\n\t} `json:\"border\"`\n\tFill struct {\n\t\tType string `json:\"type\"`\n\t\tPattern int `json:\"pattern\"`\n\t\tColor []string `json:\"color\"`\n\t\tShading int `json:\"shading\"`\n\t} `json:\"fill\"`\n\tFont *formatFont `json:\"font\"`\n\tAlignment *struct {\n\t\tHorizontal string `json:\"horizontal\"`\n\t\tIndent int `json:\"indent\"`\n\t\tJustifyLastLine bool `json:\"justify_last_line\"`\n\t\tReadingOrder uint64 `json:\"reading_order\"`\n\t\tRelativeIndent int `json:\"relative_indent\"`\n\t\tShrinkToFit bool `json:\"shrink_to_fit\"`\n\t\tTextRotation int `json:\"text_rotation\"`\n\t\tVertical string `json:\"vertical\"`\n\t\tWrapText bool `json:\"wrap_text\"`\n\t} `json:\"alignment\"`\n\tProtection *struct {\n\t\tHidden bool `json:\"hidden\"`\n\t\tLocked bool `json:\"locked\"`\n\t} `json:\"protection\"`\n\tNumFmt int `json:\"number_format\"`\n\tDecimalPlaces int `json:\"decimal_places\"`\n\tCustomNumFmt *string `json:\"custom_number_format\"`\n\tLang string `json:\"lang\"`\n\tNegRed bool `json:\"negred\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlTable.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxTable directly maps the table element. A table helps organize and provide\n// structure to lists of information in a worksheet. Tables have clearly labeled\n// columns, rows, and data regions. Tables make it easier for users to sort,\n// analyze, format, manage, add, and delete information. This element is the\n// root element for a table that is not a single cell XML table.\ntype xlsxTable struct {\n\tXMLName xml.Name `xml:\"table\"`\n\tXMLNS string `xml:\"xmlns,attr\"`\n\tDataCellStyle string `xml:\"dataCellStyle,attr,omitempty\"`\n\tDataDxfID int `xml:\"dataDxfId,attr,omitempty\"`\n\tDisplayName string `xml:\"displayName,attr,omitempty\"`\n\tHeaderRowBorderDxfID int `xml:\"headerRowBorderDxfId,attr,omitempty\"`\n\tHeaderRowCellStyle string `xml:\"headerRowCellStyle,attr,omitempty\"`\n\tHeaderRowCount int `xml:\"headerRowCount,attr,omitempty\"`\n\tHeaderRowDxfID int `xml:\"headerRowDxfId,attr,omitempty\"`\n\tID int `xml:\"id,attr\"`\n\tInsertRow bool `xml:\"insertRow,attr,omitempty\"`\n\tInsertRowShift bool `xml:\"insertRowShift,attr,omitempty\"`\n\tName string `xml:\"name,attr\"`\n\tPublished bool `xml:\"published,attr,omitempty\"`\n\tRef string `xml:\"ref,attr\"`\n\tTotalsRowCount int `xml:\"totalsRowCount,attr,omitempty\"`\n\tTotalsRowDxfID int `xml:\"totalsRowDxfId,attr,omitempty\"`\n\tTotalsRowShown bool `xml:\"totalsRowShown,attr\"`\n\tAutoFilter *xlsxAutoFilter `xml:\"autoFilter\"`\n\tTableColumns *xlsxTableColumns `xml:\"tableColumns\"`\n\tTableStyleInfo *xlsxTableStyleInfo `xml:\"tableStyleInfo\"`\n}\n\n// xlsxAutoFilter temporarily hides rows based on a filter criteria, which is\n// applied column by column to a table of data in the worksheet. This collection\n// expresses AutoFilter settings.\ntype xlsxAutoFilter struct {\n\tRef string `xml:\"ref,attr\"`\n\tFilterColumn *xlsxFilterColumn `xml:\"filterColumn\"`\n}\n\n// xlsxFilterColumn directly maps the filterColumn element. The filterColumn\n// collection identifies a particular column in the AutoFilter range and\n// specifies filter information that has been applied to this column. If a\n// column in the AutoFilter range has no criteria specified, then there is no\n// corresponding filterColumn collection expressed for that column.\ntype xlsxFilterColumn struct {\n\tColID int `xml:\"colId,attr\"`\n\tHiddenButton bool `xml:\"hiddenButton,attr,omitempty\"`\n\tShowButton bool `xml:\"showButton,attr,omitempty\"`\n\tCustomFilters *xlsxCustomFilters `xml:\"customFilters\"`\n\tFilters *xlsxFilters `xml:\"filters\"`\n\tColorFilter *xlsxColorFilter `xml:\"colorFilter\"`\n\tDynamicFilter *xlsxDynamicFilter `xml:\"dynamicFilter\"`\n\tIconFilter *xlsxIconFilter `xml:\"iconFilter\"`\n\tTop10 *xlsxTop10 `xml:\"top10\"`\n}\n\n// xlsxCustomFilters directly maps the customFilters element. When there is more\n// than one custom filter criteria to apply (an 'and' or 'or' joining two\n// criteria), then this element groups the customFilter elements together.\ntype xlsxCustomFilters struct {\n\tAnd bool `xml:\"and,attr,omitempty\"`\n\tCustomFilter []*xlsxCustomFilter `xml:\"customFilter\"`\n}\n\n// xlsxCustomFilter directly maps the customFilter element. A custom AutoFilter\n// specifies an operator and a value. There can be at most two customFilters\n// specified, and in that case the parent element specifies whether the two\n// conditions are joined by 'and' or 'or'. For any cells whose values do not\n// meet the specified criteria, the corresponding rows shall be hidden from view\n// when the filter is applied.\ntype xlsxCustomFilter struct {\n\tOperator string `xml:\"operator,attr,omitempty\"`\n\tVal string `xml:\"val,attr,omitempty\"`\n}\n\n// xlsxFilters directly maps the filters (Filter Criteria) element. When\n// multiple values are chosen to filter by, or when a group of date values are\n// chosen to filter by, this element groups those criteria together.\ntype xlsxFilters struct {\n\tBlank bool `xml:\"blank,attr,omitempty\"`\n\tCalendarType string `xml:\"calendarType,attr,omitempty\"`\n\tFilter []*xlsxFilter `xml:\"filter\"`\n\tDateGroupItem []*xlsxDateGroupItem `xml:\"dateGroupItem\"`\n}\n\n// xlsxFilter directly maps the filter element. This element expresses a filter\n// criteria value.\ntype xlsxFilter struct {\n\tVal string `xml:\"val,attr,omitempty\"`\n}\n\n// xlsxColorFilter directly maps the colorFilter element. This element specifies\n// the color to filter by and whether to use the cell's fill or font color in\n// the filter criteria. If the cell's font or fill color does not match the\n// color specified in the criteria, the rows corresponding to those cells are\n// hidden from view.\ntype xlsxColorFilter struct {\n\tCellColor bool `xml:\"cellColor,attr\"`\n\tDxfID int `xml:\"dxfId,attr\"`\n}\n\n// xlsxDynamicFilter directly maps the dynamicFilter element. This collection\n// specifies dynamic filter criteria. These criteria are considered dynamic\n// because they can change, either with the data itself (e.g., \"above average\")\n// or with the current system date (e.g., show values for \"today\"). For any\n// cells whose values do not meet the specified criteria, the corresponding rows\n// shall be hidden from view when the filter is applied.\ntype xlsxDynamicFilter struct {\n\tMaxValISO string `xml:\"maxValIso,attr,omitempty\"`\n\tType string `xml:\"type,attr,omitempty\"`\n\tVal float64 `xml:\"val,attr,omitempty\"`\n\tValISO string `xml:\"valIso,attr,omitempty\"`\n}\n\n// xlsxIconFilter directly maps the iconFilter element. This element specifies\n// the icon set and particular icon within that set to filter by. For any cells\n// whose icon does not match the specified criteria, the corresponding rows\n// shall be hidden from view when the filter is applied.\ntype xlsxIconFilter struct {\n\tIconID int `xml:\"iconId,attr\"`\n\tIconSet string `xml:\"iconSet,attr,omitempty\"`\n}\n\n// xlsxTop10 directly maps the top10 element. This element specifies the top N\n// (percent or number of items) to filter by.\ntype xlsxTop10 struct {\n\tFilterVal float64 `xml:\"filterVal,attr,omitempty\"`\n\tPercent bool `xml:\"percent,attr,omitempty\"`\n\tTop bool `xml:\"top,attr\"`\n\tVal float64 `xml:\"val,attr,omitempty\"`\n}\n\n// xlsxDateGroupItem directly maps the dateGroupItem element. This collection is\n// used to express a group of dates or times which are used in an AutoFilter\n// criteria. [Note: See parent element for an example. end note] Values are\n// always written in the calendar type of the first date encountered in the\n// filter range, so that all subsequent dates, even when formatted or\n// represented by other calendar types, can be correctly compared for the\n// purposes of filtering.\ntype xlsxDateGroupItem struct {\n\tDateTimeGrouping string `xml:\"dateTimeGrouping,attr,omitempty\"`\n\tDay int `xml:\"day,attr,omitempty\"`\n\tHour int `xml:\"hour,attr,omitempty\"`\n\tMinute int `xml:\"minute,attr,omitempty\"`\n\tMonth int `xml:\"month,attr,omitempty\"`\n\tSecond int `xml:\"second,attr,omitempty\"`\n\tYear int `xml:\"year,attr,omitempty\"`\n}\n\n// xlsxTableColumns directly maps the element representing the collection of all\n// table columns for this table.\ntype xlsxTableColumns struct {\n\tCount int `xml:\"count,attr\"`\n\tTableColumn []*xlsxTableColumn `xml:\"tableColumn\"`\n}\n\n// xlsxTableColumn directly maps the element representing a single column for\n// this table.\ntype xlsxTableColumn struct {\n\tDataCellStyle string `xml:\"dataCellStyle,attr,omitempty\"`\n\tDataDxfID int `xml:\"dataDxfId,attr,omitempty\"`\n\tHeaderRowCellStyle string `xml:\"headerRowCellStyle,attr,omitempty\"`\n\tHeaderRowDxfID int `xml:\"headerRowDxfId,attr,omitempty\"`\n\tID int `xml:\"id,attr\"`\n\tName string `xml:\"name,attr\"`\n\tQueryTableFieldID int `xml:\"queryTableFieldId,attr,omitempty\"`\n\tTotalsRowCellStyle string `xml:\"totalsRowCellStyle,attr,omitempty\"`\n\tTotalsRowDxfID int `xml:\"totalsRowDxfId,attr,omitempty\"`\n\tTotalsRowFunction string `xml:\"totalsRowFunction,attr,omitempty\"`\n\tTotalsRowLabel string `xml:\"totalsRowLabel,attr,omitempty\"`\n\tUniqueName string `xml:\"uniqueName,attr,omitempty\"`\n}\n\n// xlsxTableStyleInfo directly maps the tableStyleInfo element. This element\n// describes which style is used to display this table, and specifies which\n// portions of the table have the style applied.\ntype xlsxTableStyleInfo struct {\n\tName string `xml:\"name,attr,omitempty\"`\n\tShowFirstColumn bool `xml:\"showFirstColumn,attr\"`\n\tShowLastColumn bool `xml:\"showLastColumn,attr\"`\n\tShowRowStripes bool `xml:\"showRowStripes,attr\"`\n\tShowColumnStripes bool `xml:\"showColumnStripes,attr\"`\n}\n\n// formatTable directly maps the format settings of the table.\ntype formatTable struct {\n\tTableName string `json:\"table_name\"`\n\tTableStyle string `json:\"table_style\"`\n\tShowFirstColumn bool `json:\"show_first_column\"`\n\tShowLastColumn bool `json:\"show_last_column\"`\n\tShowRowStripes bool `json:\"show_row_stripes\"`\n\tShowColumnStripes bool `json:\"show_column_stripes\"`\n}\n\n// formatAutoFilter directly maps the auto filter settings.\ntype formatAutoFilter struct {\n\tColumn string `json:\"column\"`\n\tExpression string `json:\"expression\"`\n\tFilterList []struct {\n\t\tColumn string `json:\"column\"`\n\t\tValue []int `json:\"value\"`\n\t} `json:\"filter_list\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlWorkbook.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xmlxWorkbookRels contains xmlxWorkbookRelations which maps sheet id and sheet XML.\ntype xlsxWorkbookRels struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/package/2006/relationships Relationships\"`\n\tRelationships []xlsxWorkbookRelation `xml:\"Relationship\"`\n}\n\n// xmlxWorkbookRelation maps sheet id and xl/worksheets/_rels/sheet%d.xml.rels\ntype xlsxWorkbookRelation struct {\n\tID string `xml:\"Id,attr\"`\n\tTarget string `xml:\",attr\"`\n\tType string `xml:\",attr\"`\n\tTargetMode string `xml:\",attr,omitempty\"`\n}\n\n// xlsxWorkbook directly maps the workbook element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxWorkbook struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main workbook\"`\n\tFileVersion *xlsxFileVersion `xml:\"fileVersion\"`\n\tWorkbookPr *xlsxWorkbookPr `xml:\"workbookPr\"`\n\tWorkbookProtection *xlsxWorkbookProtection `xml:\"workbookProtection\"`\n\tBookViews xlsxBookViews `xml:\"bookViews\"`\n\tSheets xlsxSheets `xml:\"sheets\"`\n\tExternalReferences *xlsxExternalReferences `xml:\"externalReferences\"`\n\tDefinedNames *xlsxDefinedNames `xml:\"definedNames\"`\n\tCalcPr *xlsxCalcPr `xml:\"calcPr\"`\n\tCustomWorkbookViews *xlsxCustomWorkbookViews `xml:\"customWorkbookViews\"`\n\tPivotCaches *xlsxPivotCaches `xml:\"pivotCaches\"`\n\tExtLst *xlsxExtLst `xml:\"extLst\"`\n\tFileRecoveryPr *xlsxFileRecoveryPr `xml:\"fileRecoveryPr\"`\n}\n\n// xlsxFileRecoveryPr maps sheet recovery information. This element defines\n// properties that track the state of the workbook file, such as whether the\n// file was saved during a crash, or whether it should be opened in auto-recover\n// mode.\ntype xlsxFileRecoveryPr struct {\n\tAutoRecover bool `xml:\"autoRecover,attr,omitempty\"`\n\tCrashSave bool `xml:\"crashSave,attr,omitempty\"`\n\tDataExtractLoad bool `xml:\"dataExtractLoad,attr,omitempty\"`\n\tRepairLoad bool `xml:\"repairLoad,attr,omitempty\"`\n}\n\n// xlsxWorkbookProtection directly maps the workbookProtection element. This\n// element specifies options for protecting data in the workbook. Applications\n// might use workbook protection to prevent anyone from accidentally changing,\n// moving, or deleting important data. This protection can be ignored by\n// applications which choose not to support this optional protection mechanism.\n// When a password is to be hashed and stored in this element, it shall be\n// hashed as defined below, starting from a UTF-16LE encoded string value. If\n// there is a leading BOM character (U+FEFF) in the encoded password it is\n// removed before hash calculation.\ntype xlsxWorkbookProtection struct {\n\tLockRevision bool `xml:\"lockRevision,attr,omitempty\"`\n\tLockStructure bool `xml:\"lockStructure,attr,omitempty\"`\n\tLockWindows bool `xml:\"lockWindows,attr,omitempty\"`\n\tRevisionsAlgorithmName string `xml:\"revisionsAlgorithmName,attr,omitempty\"`\n\tRevisionsHashValue string `xml:\"revisionsHashValue,attr,omitempty\"`\n\tRevisionsSaltValue string `xml:\"revisionsSaltValue,attr,omitempty\"`\n\tRevisionsSpinCount int `xml:\"revisionsSpinCount,attr,omitempty\"`\n\tWorkbookAlgorithmName string `xml:\"workbookAlgorithmName,attr,omitempty\"`\n\tWorkbookHashValue string `xml:\"workbookHashValue,attr,omitempty\"`\n\tWorkbookSaltValue string `xml:\"workbookSaltValue,attr,omitempty\"`\n\tWorkbookSpinCount int `xml:\"workbookSpinCount,attr,omitempty\"`\n}\n\n// xlsxFileVersion directly maps the fileVersion element. This element defines\n// properties that track which version of the application accessed the data and\n// source code contained in the file.\ntype xlsxFileVersion struct {\n\tAppName string `xml:\"appName,attr,omitempty\"`\n\tCodeName string `xml:\"codeName,attr,omitempty\"`\n\tLastEdited string `xml:\"lastEdited,attr,omitempty\"`\n\tLowestEdited string `xml:\"lowestEdited,attr,omitempty\"`\n\tRupBuild string `xml:\"rupBuild,attr,omitempty\"`\n}\n\n// xlsxWorkbookPr directly maps the workbookPr element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main This element\n// defines a collection of workbook properties.\ntype xlsxWorkbookPr struct {\n\tAllowRefreshQuery bool `xml:\"allowRefreshQuery,attr,omitempty\"`\n\tAutoCompressPictures bool `xml:\"autoCompressPictures,attr,omitempty\"`\n\tBackupFile bool `xml:\"backupFile,attr,omitempty\"`\n\tCheckCompatibility bool `xml:\"checkCompatibility,attr,omitempty\"`\n\tCodeName string `xml:\"codeName,attr,omitempty\"`\n\tDate1904 bool `xml:\"date1904,attr,omitempty\"`\n\tDefaultThemeVersion string `xml:\"defaultThemeVersion,attr,omitempty\"`\n\tFilterPrivacy bool `xml:\"filterPrivacy,attr,omitempty\"`\n\tHidePivotFieldList bool `xml:\"hidePivotFieldList,attr,omitempty\"`\n\tPromptedSolutions bool `xml:\"promptedSolutions,attr,omitempty\"`\n\tPublishItems bool `xml:\"publishItems,attr,omitempty\"`\n\tRefreshAllConnections bool `xml:\"refreshAllConnections,attr,omitempty\"`\n\tSaveExternalLinkValues bool `xml:\"saveExternalLinkValues,attr,omitempty\"`\n\tShowBorderUnselectedTables bool `xml:\"showBorderUnselectedTables,attr,omitempty\"`\n\tShowInkAnnotation bool `xml:\"showInkAnnotation,attr,omitempty\"`\n\tShowObjects string `xml:\"showObjects,attr,omitempty\"`\n\tShowPivotChartFilter bool `xml:\"showPivotChartFilter,attr,omitempty\"`\n\tUpdateLinks string `xml:\"updateLinks,attr,omitempty\"`\n}\n\n// xlsxBookViews directly maps the bookViews element. This element specifies the\n// collection of workbook views of the enclosing workbook. Each view can specify\n// a window position, filter options, and other configurations. There is no\n// limit on the number of workbook views that can be defined for a workbook.\ntype xlsxBookViews struct {\n\tWorkBookView []xlsxWorkBookView `xml:\"workbookView\"`\n}\n\n// xlsxWorkBookView directly maps the workbookView element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main This element\n// specifies a single Workbook view.\ntype xlsxWorkBookView struct {\n\tActiveTab int `xml:\"activeTab,attr,omitempty\"`\n\tAutoFilterDateGrouping bool `xml:\"autoFilterDateGrouping,attr,omitempty\"`\n\tFirstSheet int `xml:\"firstSheet,attr,omitempty\"`\n\tMinimized bool `xml:\"minimized,attr,omitempty\"`\n\tShowHorizontalScroll bool `xml:\"showHorizontalScroll,attr,omitempty\"`\n\tShowSheetTabs bool `xml:\"showSheetTabs,attr,omitempty\"`\n\tShowVerticalScroll bool `xml:\"showVerticalScroll,attr,omitempty\"`\n\tTabRatio int `xml:\"tabRatio,attr,omitempty\"`\n\tVisibility string `xml:\"visibility,attr,omitempty\"`\n\tWindowHeight int `xml:\"windowHeight,attr,omitempty\"`\n\tWindowWidth int `xml:\"windowWidth,attr,omitempty\"`\n\tXWindow string `xml:\"xWindow,attr,omitempty\"`\n\tYWindow string `xml:\"yWindow,attr,omitempty\"`\n}\n\n// xlsxSheets directly maps the sheets element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main.\ntype xlsxSheets struct {\n\tSheet []xlsxSheet `xml:\"sheet\"`\n}\n\n// xlsxSheet directly maps the sheet element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxSheet struct {\n\tName string `xml:\"name,attr,omitempty\"`\n\tSheetID string `xml:\"sheetId,attr,omitempty\"`\n\tID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n\tState string `xml:\"state,attr,omitempty\"`\n}\n\n// xlsxExternalReferences directly maps the externalReferences element of the\n// external workbook references part.\ntype xlsxExternalReferences struct {\n\tExternalReference []xlsxExternalReference `xml:\"externalReference\"`\n}\n\n// xlsxExternalReference directly maps the externalReference element of the\n// external workbook references part.\ntype xlsxExternalReference struct {\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// xlsxPivotCaches element enumerates pivot cache definition parts used by pivot\n// tables and formulas in this workbook.\ntype xlsxPivotCaches struct {\n\tPivotCache []xlsxPivotCache `xml:\"pivotCache\"`\n}\n\n// xlsxPivotCache directly maps the pivotCache element.\ntype xlsxPivotCache struct {\n\tCacheID int `xml:\"cacheId,attr,omitempty\"`\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// extLst element provides a convention for extending spreadsheetML in\n// predefined locations. The locations shall be denoted with the extLst element,\n// and are called extension lists. Extension list locations within the markup\n// document are specified in the markup specification and can be used to store\n// extensions to the markup specification, whether those are future version\n// extensions of the markup specification or are private extensions implemented\n// independently from the markup specification. Markup within an extension might\n// not be understood by a consumer.\ntype xlsxExtLst struct {\n\tExt string `xml:\",innerxml\"`\n}\n\n// xlsxDefinedNames directly maps the definedNames element. This element defines\n// the collection of defined names for this workbook. Defined names are\n// descriptive names to represent cells, ranges of cells, formulas, or constant\n// values. Defined names can be used to represent a range on any worksheet.\ntype xlsxDefinedNames struct {\n\tDefinedName []xlsxDefinedName `xml:\"definedName\"`\n}\n\n// xlsxDefinedName directly maps the definedName element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main This element\n// defines a defined name within this workbook. A defined name is descriptive\n// text that is used to represents a cell, range of cells, formula, or constant\n// value. For a descriptions of the attributes see https://msdn.microsoft.com/en-us/library/office/documentformat.openxml.spreadsheet.definedname.aspx\ntype xlsxDefinedName struct {\n\tComment string `xml:\"comment,attr,omitempty\"`\n\tCustomMenu string `xml:\"customMenu,attr,omitempty\"`\n\tDescription string `xml:\"description,attr,omitempty\"`\n\tFunction bool `xml:\"function,attr,omitempty\"`\n\tFunctionGroupID int `xml:\"functionGroupId,attr,omitempty\"`\n\tHelp string `xml:\"help,attr,omitempty\"`\n\tHidden bool `xml:\"hidden,attr,omitempty\"`\n\tLocalSheetID *int `xml:\"localSheetId,attr\"`\n\tName string `xml:\"name,attr,omitempty\"`\n\tPublishToServer bool `xml:\"publishToServer,attr,omitempty\"`\n\tShortcutKey string `xml:\"shortcutKey,attr,omitempty\"`\n\tStatusBar string `xml:\"statusBar,attr,omitempty\"`\n\tVbProcedure bool `xml:\"vbProcedure,attr,omitempty\"`\n\tWorkbookParameter bool `xml:\"workbookParameter,attr,omitempty\"`\n\tXlm bool `xml:\"xml,attr,omitempty\"`\n\tData string `xml:\",chardata\"`\n}\n\n// xlsxCalcPr directly maps the calcPr element. This element defines the\n// collection of properties the application uses to record calculation status\n// and details. Calculation is the process of computing formulas and then\n// displaying the results as values in the cells that contain the formulas.\ntype xlsxCalcPr struct {\n\tCalcCompleted bool `xml:\"calcCompleted,attr,omitempty\"`\n\tCalcID string `xml:\"calcId,attr,omitempty\"`\n\tCalcMode string `xml:\"calcMode,attr,omitempty\"`\n\tCalcOnSave bool `xml:\"calcOnSave,attr,omitempty\"`\n\tConcurrentCalc *bool `xml:\"concurrentCalc,attr\"`\n\tConcurrentManualCount int `xml:\"concurrentManualCount,attr,omitempty\"`\n\tForceFullCalc bool `xml:\"forceFullCalc,attr,omitempty\"`\n\tFullCalcOnLoad bool `xml:\"fullCalcOnLoad,attr,omitempty\"`\n\tFullPrecision bool `xml:\"fullPrecision,attr,omitempty\"`\n\tIterate bool `xml:\"iterate,attr,omitempty\"`\n\tIterateCount int `xml:\"iterateCount,attr,omitempty\"`\n\tIterateDelta float64 `xml:\"iterateDelta,attr,omitempty\"`\n\tRefMode string `xml:\"refMode,attr,omitempty\"`\n}\n\n// xlsxCustomWorkbookViews defines the collection of custom workbook views that\n// are defined for this workbook. A customWorkbookView is similar in concept to\n// a workbookView in that its attributes contain settings related to the way\n// that the workbook should be displayed on a screen by a spreadsheet\n// application.\ntype xlsxCustomWorkbookViews struct {\n\tCustomWorkbookView []xlsxCustomWorkbookView `xml:\"customWorkbookView\"`\n}\n\n// xlsxCustomWorkbookView directly maps the customWorkbookView element. This\n// element specifies a single custom workbook view. A custom workbook view\n// consists of a set of display and print settings that you can name and apply\n// to a workbook. You can create more than one custom workbook view of the same\n// workbook. Custom Workbook Views are not required in order to construct a\n// valid SpreadsheetML document, and are not necessary if the document is never\n// displayed by a spreadsheet application, or if the spreadsheet application has\n// a fixed display for workbooks. However, if a spreadsheet application chooses\n// to implement configurable display modes, the customWorkbookView element\n// should be used to persist the settings for those display modes.\ntype xlsxCustomWorkbookView struct {\n\tActiveSheetID *int `xml:\"activeSheetId,attr\"`\n\tAutoUpdate *bool `xml:\"autoUpdate,attr\"`\n\tChangesSavedWin *bool `xml:\"changesSavedWin,attr\"`\n\tGUID *string `xml:\"guid,attr\"`\n\tIncludeHiddenRowCol *bool `xml:\"includeHiddenRowCol,attr\"`\n\tIncludePrintSettings *bool `xml:\"includePrintSettings,attr\"`\n\tMaximized *bool `xml:\"maximized,attr\"`\n\tMergeInterval int `xml:\"mergeInterval,attr\"`\n\tMinimized *bool `xml:\"minimized,attr\"`\n\tName *string `xml:\"name,attr\"`\n\tOnlySync *bool `xml:\"onlySync,attr\"`\n\tPersonalView *bool `xml:\"personalView,attr\"`\n\tShowComments *string `xml:\"showComments,attr\"`\n\tShowFormulaBar *bool `xml:\"showFormulaBar,attr\"`\n\tShowHorizontalScroll *bool `xml:\"showHorizontalScroll,attr\"`\n\tShowObjects *string `xml:\"showObjects,attr\"`\n\tShowSheetTabs *bool `xml:\"showSheetTabs,attr\"`\n\tShowStatusbar *bool `xml:\"showStatusbar,attr\"`\n\tShowVerticalScroll *bool `xml:\"showVerticalScroll,attr\"`\n\tTabRatio *int `xml:\"tabRatio,attr\"`\n\tWindowHeight *int `xml:\"windowHeight,attr\"`\n\tWindowWidth *int `xml:\"windowWidth,attr\"`\n\tXWindow *int `xml:\"xWindow,attr\"`\n\tYWindow *int `xml:\"yWindow,attr\"`\n}\n" }, { "path": "vendor/github.com/360EntSecGroup-Skylar/excelize/xmlWorksheet.go", "content": "package excelize\n\nimport \"encoding/xml\"\n\n// xlsxWorksheet directly maps the worksheet element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxWorksheet struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main worksheet\"`\n\tSheetPr *xlsxSheetPr `xml:\"sheetPr\"`\n\tDimension xlsxDimension `xml:\"dimension\"`\n\tSheetViews xlsxSheetViews `xml:\"sheetViews,omitempty\"`\n\tSheetFormatPr *xlsxSheetFormatPr `xml:\"sheetFormatPr\"`\n\tCols *xlsxCols `xml:\"cols,omitempty\"`\n\tSheetData xlsxSheetData `xml:\"sheetData\"`\n\tSheetProtection *xlsxSheetProtection `xml:\"sheetProtection\"`\n\tAutoFilter *xlsxAutoFilter `xml:\"autoFilter\"`\n\tMergeCells *xlsxMergeCells `xml:\"mergeCells\"`\n\tPhoneticPr *xlsxPhoneticPr `xml:\"phoneticPr\"`\n\tConditionalFormatting []*xlsxConditionalFormatting `xml:\"conditionalFormatting\"`\n\tDataValidations *xlsxDataValidations `xml:\"dataValidations\"`\n\tHyperlinks *xlsxHyperlinks `xml:\"hyperlinks\"`\n\tPrintOptions *xlsxPrintOptions `xml:\"printOptions\"`\n\tPageMargins *xlsxPageMargins `xml:\"pageMargins\"`\n\tPageSetUp *xlsxPageSetUp `xml:\"pageSetup\"`\n\tHeaderFooter *xlsxHeaderFooter `xml:\"headerFooter\"`\n\tDrawing *xlsxDrawing `xml:\"drawing\"`\n\tLegacyDrawing *xlsxLegacyDrawing `xml:\"legacyDrawing\"`\n\tPicture *xlsxPicture `xml:\"picture\"`\n\tTableParts *xlsxTableParts `xml:\"tableParts\"`\n\tExtLst *xlsxExtLst `xml:\"extLst\"`\n}\n\n// xlsxDrawing change r:id to rid in the namespace.\ntype xlsxDrawing struct {\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// xlsxHeaderFooter directly maps the headerFooter element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - When printed or\n// viewed in page layout view (§18.18.69), each page of a worksheet can have a\n// page header, a page footer, or both. The headers and footers on odd-numbered\n// pages can differ from those on even-numbered pages, and the headers and\n// footers on the first page can differ from those on odd- and even-numbered\n// pages. In the latter case, the first page is not considered an odd page.\ntype xlsxHeaderFooter struct {\n\tDifferentFirst bool `xml:\"differentFirst,attr,omitempty\"`\n\tDifferentOddEven bool `xml:\"differentOddEven,attr,omitempty\"`\n\tOddHeader []*xlsxOddHeader `xml:\"oddHeader\"`\n\tOddFooter []*xlsxOddFooter `xml:\"oddFooter\"`\n}\n\n// xlsxOddHeader directly maps the oddHeader element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxOddHeader struct {\n\tContent string `xml:\",chardata\"`\n}\n\n// xlsxOddFooter directly maps the oddFooter element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxOddFooter struct {\n\tContent string `xml:\",chardata\"`\n}\n\n// xlsxPageSetUp directly maps the pageSetup element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Page setup\n// settings for the worksheet.\ntype xlsxPageSetUp struct {\n\tBlackAndWhite bool `xml:\"blackAndWhite,attr,omitempty\"`\n\tCellComments string `xml:\"cellComments,attr,omitempty\"`\n\tCopies int `xml:\"copies,attr,omitempty\"`\n\tDraft bool `xml:\"draft,attr,omitempty\"`\n\tErrors string `xml:\"errors,attr,omitempty\"`\n\tFirstPageNumber int `xml:\"firstPageNumber,attr,omitempty\"`\n\tFitToHeight *int `xml:\"fitToHeight,attr\"`\n\tFitToWidth int `xml:\"fitToWidth,attr,omitempty\"`\n\tHorizontalDPI float32 `xml:\"horizontalDpi,attr,omitempty\"`\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n\tOrientation string `xml:\"orientation,attr,omitempty\"`\n\tPageOrder string `xml:\"pageOrder,attr,omitempty\"`\n\tPaperHeight string `xml:\"paperHeight,attr,omitempty\"`\n\tPaperSize string `xml:\"paperSize,attr,omitempty\"`\n\tPaperWidth string `xml:\"paperWidth,attr,omitempty\"`\n\tScale int `xml:\"scale,attr,omitempty\"`\n\tUseFirstPageNumber bool `xml:\"useFirstPageNumber,attr,omitempty\"`\n\tUsePrinterDefaults bool `xml:\"usePrinterDefaults,attr,omitempty\"`\n\tVerticalDPI float32 `xml:\"verticalDpi,attr,omitempty\"`\n}\n\n// xlsxPrintOptions directly maps the printOptions element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Print options for\n// the sheet. Printer-specific settings are stored separately in the Printer\n// Settings part.\ntype xlsxPrintOptions struct {\n\tGridLines bool `xml:\"gridLines,attr,omitempty\"`\n\tGridLinesSet bool `xml:\"gridLinesSet,attr,omitempty\"`\n\tHeadings bool `xml:\"headings,attr,omitempty\"`\n\tHorizontalCentered bool `xml:\"horizontalCentered,attr,omitempty\"`\n\tVerticalCentered bool `xml:\"verticalCentered,attr,omitempty\"`\n}\n\n// xlsxPageMargins directly maps the pageMargins element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Page margins for\n// a sheet or a custom sheet view.\ntype xlsxPageMargins struct {\n\tBottom float64 `xml:\"bottom,attr\"`\n\tFooter float64 `xml:\"footer,attr\"`\n\tHeader float64 `xml:\"header,attr\"`\n\tLeft float64 `xml:\"left,attr\"`\n\tRight float64 `xml:\"right,attr\"`\n\tTop float64 `xml:\"top,attr\"`\n}\n\n// xlsxSheetFormatPr directly maps the sheetFormatPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main. This element\n// specifies the sheet formatting properties.\ntype xlsxSheetFormatPr struct {\n\tBaseColWidth uint8 `xml:\"baseColWidth,attr,omitempty\"`\n\tDefaultColWidth float64 `xml:\"defaultColWidth,attr,omitempty\"`\n\tDefaultRowHeight float64 `xml:\"defaultRowHeight,attr\"`\n\tCustomHeight bool `xml:\"customHeight,attr,omitempty\"`\n\tZeroHeight bool `xml:\"zeroHeight,attr,omitempty\"`\n\tThickTop bool `xml:\"thickTop,attr,omitempty\"`\n\tThickBottom bool `xml:\"thickBottom,attr,omitempty\"`\n\tOutlineLevelRow uint8 `xml:\"outlineLevelRow,attr,omitempty\"`\n\tOutlineLevelCol uint8 `xml:\"outlineLevelCol,attr,omitempty\"`\n}\n\n// xlsxSheetViews directly maps the sheetViews element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Worksheet views\n// collection.\ntype xlsxSheetViews struct {\n\tSheetView []xlsxSheetView `xml:\"sheetView\"`\n}\n\n// xlsxSheetView directly maps the sheetView element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need. A single sheet\n// view definition. When more than one sheet view is defined in the file, it\n// means that when opening the workbook, each sheet view corresponds to a\n// separate window within the spreadsheet application, where each window is\n// showing the particular sheet containing the same workbookViewId value, the\n// last sheetView definition is loaded, and the others are discarded. When\n// multiple windows are viewing the same sheet, multiple sheetView elements\n// (with corresponding workbookView entries) are saved.\n// See https://msdn.microsoft.com/en-us/library/office/documentformat.openxml.spreadsheet.sheetview.aspx\ntype xlsxSheetView struct {\n\tWindowProtection bool `xml:\"windowProtection,attr,omitempty\"`\n\tShowFormulas bool `xml:\"showFormulas,attr,omitempty\"`\n\tShowGridLines *bool `xml:\"showGridLines,attr\"`\n\tShowRowColHeaders *bool `xml:\"showRowColHeaders,attr\"`\n\tShowZeros bool `xml:\"showZeros,attr,omitempty\"`\n\tRightToLeft bool `xml:\"rightToLeft,attr,omitempty\"`\n\tTabSelected bool `xml:\"tabSelected,attr,omitempty\"`\n\tShowWhiteSpace *bool `xml:\"showWhiteSpace,attr\"`\n\tShowOutlineSymbols bool `xml:\"showOutlineSymbols,attr,omitempty\"`\n\tDefaultGridColor *bool `xml:\"defaultGridColor,attr\"`\n\tView string `xml:\"view,attr,omitempty\"`\n\tTopLeftCell string `xml:\"topLeftCell,attr,omitempty\"`\n\tColorID int `xml:\"colorId,attr,omitempty\"`\n\tZoomScale float64 `xml:\"zoomScale,attr,omitempty\"`\n\tZoomScaleNormal float64 `xml:\"zoomScaleNormal,attr,omitempty\"`\n\tZoomScalePageLayoutView float64 `xml:\"zoomScalePageLayoutView,attr,omitempty\"`\n\tZoomScaleSheetLayoutView float64 `xml:\"zoomScaleSheetLayoutView,attr,omitempty\"`\n\tWorkbookViewID int `xml:\"workbookViewId,attr\"`\n\tPane *xlsxPane `xml:\"pane,omitempty\"`\n\tSelection []*xlsxSelection `xml:\"selection\"`\n}\n\n// xlsxSelection directly maps the selection element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Worksheet view\n// selection.\ntype xlsxSelection struct {\n\tActiveCell string `xml:\"activeCell,attr,omitempty\"`\n\tActiveCellID *int `xml:\"activeCellId,attr\"`\n\tPane string `xml:\"pane,attr,omitempty\"`\n\tSQRef string `xml:\"sqref,attr,omitempty\"`\n}\n\n// xlsxSelection directly maps the selection element. Worksheet view pane.\ntype xlsxPane struct {\n\tActivePane string `xml:\"activePane,attr,omitempty\"`\n\tState string `xml:\"state,attr,omitempty\"` // Either \"split\" or \"frozen\"\n\tTopLeftCell string `xml:\"topLeftCell,attr,omitempty\"`\n\tXSplit float64 `xml:\"xSplit,attr,omitempty\"`\n\tYSplit float64 `xml:\"ySplit,attr,omitempty\"`\n}\n\n// xlsxSheetPr directly maps the sheetPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Sheet-level\n// properties.\ntype xlsxSheetPr struct {\n\tXMLName xml.Name `xml:\"sheetPr\"`\n\tCodeName string `xml:\"codeName,attr,omitempty\"`\n\tEnableFormatConditionsCalculation *bool `xml:\"enableFormatConditionsCalculation,attr\"`\n\tFilterMode bool `xml:\"filterMode,attr,omitempty\"`\n\tPublished *bool `xml:\"published,attr\"`\n\tSyncHorizontal bool `xml:\"syncHorizontal,attr,omitempty\"`\n\tSyncVertical bool `xml:\"syncVertical,attr,omitempty\"`\n\tTransitionEntry bool `xml:\"transitionEntry,attr,omitempty\"`\n\tTabColor *xlsxTabColor `xml:\"tabColor,omitempty\"`\n\tPageSetUpPr *xlsxPageSetUpPr `xml:\"pageSetUpPr,omitempty\"`\n}\n\n// xlsxPageSetUpPr directly maps the pageSetupPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Page setup\n// properties of the worksheet.\ntype xlsxPageSetUpPr struct {\n\tAutoPageBreaks bool `xml:\"autoPageBreaks,attr,omitempty\"`\n\tFitToPage bool `xml:\"fitToPage,attr,omitempty\"` // Flag indicating whether the Fit to Page print option is enabled.\n}\n\n// xlsxTabColor directly maps the tabColor element in the namespace currently I\n// have not checked it for completeness - it does as much as I need.\ntype xlsxTabColor struct {\n\tTheme int `xml:\"theme,attr,omitempty\"`\n\tTint float64 `xml:\"tint,attr,omitempty\"`\n}\n\n// xlsxCols directly maps the cols element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxCols struct {\n\tCol []xlsxCol `xml:\"col\"`\n}\n\n// xlsxCol directly maps the col (Column Width & Formatting). Defines column\n// width and column formatting for one or more columns of the worksheet.\ntype xlsxCol struct {\n\tBestFit bool `xml:\"bestFit,attr,omitempty\"`\n\tCollapsed bool `xml:\"collapsed,attr\"`\n\tCustomWidth bool `xml:\"customWidth,attr,omitempty\"`\n\tHidden bool `xml:\"hidden,attr\"`\n\tMax int `xml:\"max,attr\"`\n\tMin int `xml:\"min,attr\"`\n\tOutlineLevel uint8 `xml:\"outlineLevel,attr,omitempty\"`\n\tPhonetic bool `xml:\"phonetic,attr,omitempty\"`\n\tStyle int `xml:\"style,attr\"`\n\tWidth float64 `xml:\"width,attr\"`\n}\n\n// xlsxDimension directly maps the dimension element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - This element\n// specifies the used range of the worksheet. It specifies the row and column\n// bounds of used cells in the worksheet. This is optional and is not required.\n// Used cells include cells with formulas, text content, and cell formatting.\n// When an entire column is formatted, only the first cell in that column is\n// considered used.\ntype xlsxDimension struct {\n\tRef string `xml:\"ref,attr\"`\n}\n\n// xlsxSheetData directly maps the sheetData element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxSheetData struct {\n\tXMLName xml.Name `xml:\"sheetData\"`\n\tRow []xlsxRow `xml:\"row\"`\n}\n\n// xlsxRow directly maps the row element. The element expresses information\n// about an entire row of a worksheet, and contains all cell definitions for a\n// particular row in the worksheet.\ntype xlsxRow struct {\n\tCollapsed bool `xml:\"collapsed,attr,omitempty\"`\n\tCustomFormat bool `xml:\"customFormat,attr,omitempty\"`\n\tCustomHeight bool `xml:\"customHeight,attr,omitempty\"`\n\tHidden bool `xml:\"hidden,attr,omitempty\"`\n\tHt float64 `xml:\"ht,attr,omitempty\"`\n\tOutlineLevel uint8 `xml:\"outlineLevel,attr,omitempty\"`\n\tPh bool `xml:\"ph,attr,omitempty\"`\n\tR int `xml:\"r,attr,omitempty\"`\n\tS int `xml:\"s,attr,omitempty\"`\n\tSpans string `xml:\"spans,attr,omitempty\"`\n\tThickBot bool `xml:\"thickBot,attr,omitempty\"`\n\tThickTop bool `xml:\"thickTop,attr,omitempty\"`\n\tC []xlsxC `xml:\"c\"`\n}\n\n// xlsxMergeCell directly maps the mergeCell element. A single merged cell.\ntype xlsxMergeCell struct {\n\tRef string `xml:\"ref,attr,omitempty\"`\n}\n\n// xlsxMergeCells directly maps the mergeCells element. This collection\n// expresses all the merged cells in the sheet.\ntype xlsxMergeCells struct {\n\tCount int `xml:\"count,attr,omitempty\"`\n\tCells []*xlsxMergeCell `xml:\"mergeCell,omitempty\"`\n}\n\n// xlsxDataValidations expresses all data validation information for cells in a\n// sheet which have data validation features applied.\ntype xlsxDataValidations struct {\n\tCount int `xml:\"count,attr,omitempty\"`\n\tDisablePrompts bool `xml:\"disablePrompts,attr,omitempty\"`\n\tXWindow int `xml:\"xWindow,attr,omitempty\"`\n\tYWindow int `xml:\"yWindow,attr,omitempty\"`\n\tDataValidation string `xml:\",innerxml\"`\n}\n\n// xlsxC directly maps the c element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\n//\n// This simple type is restricted to the values listed in the following table:\n//\n// Enumeration Value | Description\n// ---------------------------+---------------------------------\n// b (Boolean) | Cell containing a boolean.\n// d (Date) | Cell contains a date in the ISO 8601 format.\n// e (Error) | Cell containing an error.\n// inlineStr (Inline String) | Cell containing an (inline) rich string, i.e., one not in the shared string table. If this cell type is used, then the cell value is in the is element rather than the v element in the cell (c element).\n// n (Number) | Cell containing a number.\n// s (Shared String) | Cell containing a shared string.\n// str (String) | Cell containing a formula string.\n//\ntype xlsxC struct {\n\tR string `xml:\"r,attr\"` // Cell ID, e.g. A1\n\tS int `xml:\"s,attr,omitempty\"` // Style reference.\n\t// Str string `xml:\"str,attr,omitempty\"` // Style reference.\n\tT string `xml:\"t,attr,omitempty\"` // Type.\n\tF *xlsxF `xml:\"f,omitempty\"` // Formula\n\tV string `xml:\"v,omitempty\"` // Value\n\tIS *xlsxIS `xml:\"is\"`\n\tXMLSpace xml.Attr `xml:\"space,attr,omitempty\"`\n}\n\n// xlsxIS directly maps the t element. Cell containing an (inline) rich\n// string, i.e., one not in the shared string table. If this cell type is\n// used, then the cell value is in the is element rather than the v element in\n// the cell (c element).\ntype xlsxIS struct {\n\tT string `xml:\"t\"`\n}\n\n// xlsxF directly maps the f element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - currently I have\n// not checked it for completeness - it does as much as I need.\ntype xlsxF struct {\n\tContent string `xml:\",chardata\"`\n\tT string `xml:\"t,attr,omitempty\"` // Formula type\n\tRef string `xml:\"ref,attr,omitempty\"` // Shared formula ref\n\tSi string `xml:\"si,attr,omitempty\"` // Shared formula index\n}\n\n// xlsxSheetProtection collection expresses the sheet protection options to\n// enforce when the sheet is protected.\ntype xlsxSheetProtection struct {\n\tAlgorithmName string `xml:\"algorithmName,attr,omitempty\"`\n\tAutoFilter int `xml:\"autoFilter,attr,omitempty\"`\n\tDeleteColumns int `xml:\"deleteColumns,attr,omitempty\"`\n\tDeleteRows int `xml:\"deleteRows,attr,omitempty\"`\n\tFormatCells int `xml:\"formatCells,attr,omitempty\"`\n\tFormatColumns int `xml:\"formatColumns,attr,omitempty\"`\n\tFormatRows int `xml:\"formatRows,attr,omitempty\"`\n\tHashValue string `xml:\"hashValue,attr,omitempty\"`\n\tInsertColumns int `xml:\"insertColumns,attr,omitempty\"`\n\tInsertHyperlinks int `xml:\"insertHyperlinks,attr,omitempty\"`\n\tInsertRows int `xml:\"insertRows,attr,omitempty\"`\n\tObjects int `xml:\"objects,attr,omitempty\"`\n\tPivotTables int `xml:\"pivotTables,attr,omitempty\"`\n\tSaltValue string `xml:\"saltValue,attr,omitempty\"`\n\tScenarios int `xml:\"scenarios,attr,omitempty\"`\n\tSelectLockedCells int `xml:\"selectLockedCells,attr,omitempty\"`\n\tSelectUnlockedCell int `xml:\"selectUnlockedCell,attr,omitempty\"`\n\tSheet int `xml:\"sheet,attr,omitempty\"`\n\tSort int `xml:\"sort,attr,omitempty\"`\n\tSpinCount int `xml:\"spinCount,attr,omitempty\"`\n}\n\n// xlsxPhoneticPr (Phonetic Properties) represents a collection of phonetic\n// properties that affect the display of phonetic text for this String Item\n// (si). Phonetic text is used to give hints as to the pronunciation of an East\n// Asian language, and the hints are displayed as text within the spreadsheet\n// cells across the top portion of the cell. Since the phonetic hints are text,\n// every phonetic hint is expressed as a phonetic run (rPh), and these\n// properties specify how to display that phonetic run.\ntype xlsxPhoneticPr struct {\n\tAlignment string `xml:\"alignment,attr,omitempty\"`\n\tFontID *int `xml:\"fontId,attr\"`\n\tType string `xml:\"type,attr,omitempty\"`\n}\n\n// A Conditional Format is a format, such as cell shading or font color, that a\n// spreadsheet application can automatically apply to cells if a specified\n// condition is true. This collection expresses conditional formatting rules\n// applied to a particular cell or range.\ntype xlsxConditionalFormatting struct {\n\tSQRef string `xml:\"sqref,attr,omitempty\"`\n\tCfRule []*xlsxCfRule `xml:\"cfRule\"`\n}\n\n// xlsxCfRule (Conditional Formatting Rule) represents a description of a\n// conditional formatting rule.\ntype xlsxCfRule struct {\n\tAboveAverage *bool `xml:\"aboveAverage,attr\"`\n\tBottom bool `xml:\"bottom,attr,omitempty\"`\n\tDxfID *int `xml:\"dxfId,attr\"`\n\tEqualAverage bool `xml:\"equalAverage,attr,omitempty\"`\n\tOperator string `xml:\"operator,attr,omitempty\"`\n\tPercent bool `xml:\"percent,attr,omitempty\"`\n\tPriority int `xml:\"priority,attr,omitempty\"`\n\tRank int `xml:\"rank,attr,omitempty\"`\n\tStdDev int `xml:\"stdDev,attr,omitempty\"`\n\tStopIfTrue bool `xml:\"stopIfTrue,attr,omitempty\"`\n\tText string `xml:\"text,attr,omitempty\"`\n\tTimePeriod string `xml:\"timePeriod,attr,omitempty\"`\n\tType string `xml:\"type,attr,omitempty\"`\n\tFormula []string `xml:\"formula,omitempty\"`\n\tColorScale *xlsxColorScale `xml:\"colorScale\"`\n\tDataBar *xlsxDataBar `xml:\"dataBar\"`\n\tIconSet *xlsxIconSet `xml:\"iconSet\"`\n\tExtLst *xlsxExtLst `xml:\"extLst\"`\n}\n\n// xlsxColorScale (Color Scale) describes a gradated color scale in this\n// conditional formatting rule.\ntype xlsxColorScale struct {\n\tCfvo []*xlsxCfvo `xml:\"cfvo\"`\n\tColor []*xlsxColor `xml:\"color\"`\n}\n\n// dataBar (Data Bar) describes a data bar conditional formatting rule.\ntype xlsxDataBar struct {\n\tMaxLength int `xml:\"maxLength,attr,omitempty\"`\n\tMinLength int `xml:\"minLength,attr,omitempty\"`\n\tShowValue bool `xml:\"showValue,attr,omitempty\"`\n\tCfvo []*xlsxCfvo `xml:\"cfvo\"`\n\tColor []*xlsxColor `xml:\"color\"`\n}\n\n// xlsxIconSet (Icon Set) describes an icon set conditional formatting rule.\ntype xlsxIconSet struct {\n\tCfvo []*xlsxCfvo `xml:\"cfvo\"`\n\tIconSet string `xml:\"iconSet,attr,omitempty\"`\n\tShowValue bool `xml:\"showValue,attr,omitempty\"`\n\tPercent bool `xml:\"percent,attr,omitempty\"`\n\tReverse bool `xml:\"reverse,attr,omitempty\"`\n}\n\n// cfvo (Conditional Format Value Object) describes the values of the\n// interpolation points in a gradient scale.\ntype xlsxCfvo struct {\n\tGte bool `xml:\"gte,attr,omitempty\"`\n\tType string `xml:\"type,attr,omitempty\"`\n\tVal int `xml:\"val,attr\"`\n\tExtLst *xlsxExtLst `xml:\"extLst\"`\n}\n\n// xlsxHyperlinks directly maps the hyperlinks element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - A hyperlink can\n// be stored in a package as a relationship. Hyperlinks shall be identified by\n// containing a target which specifies the destination of the given hyperlink.\ntype xlsxHyperlinks struct {\n\tHyperlink []xlsxHyperlink `xml:\"hyperlink\"`\n}\n\n// xlsxHyperlink directly maps the hyperlink element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main\ntype xlsxHyperlink struct {\n\tRef string `xml:\"ref,attr\"`\n\tLocation string `xml:\"location,attr,omitempty\"`\n\tDisplay string `xml:\"display,attr,omitempty\"`\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// xlsxTableParts directly maps the tableParts element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - The table element\n// has several attributes applied to identify the table and the data range it\n// covers. The table id attribute needs to be unique across all table parts, the\n// same goes for the name and displayName. The displayName has the further\n// restriction that it must be unique across all defined names in the workbook.\n// Later on we will see that you can define names for many elements, such as\n// cells or formulas. The name value is used for the object model in Microsoft\n// Office Excel. The displayName is used for references in formulas. The ref\n// attribute is used to identify the cell range that the table covers. This\n// includes not only the table data, but also the table header containing column\n// names.\n// To add columns to your table you add new tableColumn elements to the\n// tableColumns container. Similar to the shared string table the collection\n// keeps a count attribute identifying the number of columns. Besides the table\n// definition in the table part there is also the need to identify which tables\n// are displayed in the worksheet. The worksheet part has a separate element\n// tableParts to store this information. Each table part is referenced through\n// the relationship ID and again a count of the number of table parts is\n// maintained. The following markup sample is taken from the documents\n// accompanying this book. The sheet data element has been removed to reduce the\n// size of the sample. To reference the table, just add the tableParts element,\n// of course after having created and stored the table part. For example:\n//\n// \n// ...\n// \n// \t\t \n// \n// \n//\ntype xlsxTableParts struct {\n\tCount int `xml:\"count,attr,omitempty\"`\n\tTableParts []*xlsxTablePart `xml:\"tablePart\"`\n}\n\n// xlsxTablePart directly maps the tablePart element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main\ntype xlsxTablePart struct {\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// xlsxPicture directly maps the picture element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - Background sheet\n// image. For example:\n//\n// \n//\ntype xlsxPicture struct {\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// xlsxLegacyDrawing directly maps the legacyDrawing element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main - A comment is a\n// rich text note that is attached to, and associated with, a cell, separate\n// from other cell content. Comment content is stored separate from the cell,\n// and is displayed in a drawing object (like a text box) that is separate from,\n// but associated with, a cell. Comments are used as reminders, such as noting\n// how a complex formula works, or to provide feedback to other users. Comments\n// can also be used to explain assumptions made in a formula or to call out\n// something special about the cell.\ntype xlsxLegacyDrawing struct {\n\tRID string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n}\n\n// formatPanes directly maps the settings of the panes.\ntype formatPanes struct {\n\tFreeze bool `json:\"freeze\"`\n\tSplit bool `json:\"split\"`\n\tXSplit int `json:\"x_split\"`\n\tYSplit int `json:\"y_split\"`\n\tTopLeftCell string `json:\"top_left_cell\"`\n\tActivePane string `json:\"active_pane\"`\n\tPanes []struct {\n\t\tSQRef string `json:\"sqref\"`\n\t\tActiveCell string `json:\"active_cell\"`\n\t\tPane string `json:\"pane\"`\n\t} `json:\"panes\"`\n}\n\n// formatConditional directly maps the conditional format settings of the cells.\ntype formatConditional struct {\n\tType string `json:\"type\"`\n\tAboveAverage bool `json:\"above_average\"`\n\tPercent bool `json:\"percent\"`\n\tFormat int `json:\"format\"`\n\tCriteria string `json:\"criteria\"`\n\tValue string `json:\"value,omitempty\"`\n\tMinimum string `json:\"minimum,omitempty\"`\n\tMaximum string `json:\"maximum,omitempty\"`\n\tMinType string `json:\"min_type,omitempty\"`\n\tMidType string `json:\"mid_type,omitempty\"`\n\tMaxType string `json:\"max_type,omitempty\"`\n\tMinValue string `json:\"min_value,omitempty\"`\n\tMidValue string `json:\"mid_value,omitempty\"`\n\tMaxValue string `json:\"max_value,omitempty\"`\n\tMinColor string `json:\"min_color,omitempty\"`\n\tMidColor string `json:\"mid_color,omitempty\"`\n\tMaxColor string `json:\"max_color,omitempty\"`\n\tMinLength string `json:\"min_length,omitempty\"`\n\tMaxLength string `json:\"max_length,omitempty\"`\n\tMultiRange string `json:\"multi_range,omitempty\"`\n\tBarColor string `json:\"bar_color,omitempty\"`\n}\n" }, { "path": "vendor/github.com/PuerkitoBio/purell/.gitignore", "content": "*.sublime-*\n.DS_Store\n*.swp\n*.swo\ntags\n" }, { "path": "vendor/github.com/PuerkitoBio/purell/.travis.yml", "content": "language: go\n\ngo:\n - 1.4.x\n - 1.5.x\n - 1.6.x\n - 1.7.x\n - 1.8.x\n - 1.9.x\n - \"1.10.x\"\n - tip\n" }, { "path": "vendor/github.com/PuerkitoBio/purell/LICENSE", "content": "Copyright (c) 2012, Martin Angers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n\n* Neither the name of the author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/PuerkitoBio/purell/README.md", "content": "# Purell\n\nPurell is a tiny Go library to normalize URLs. It returns a pure URL. Pure-ell. Sanitizer and all. Yeah, I know...\n\nBased on the [wikipedia paper][wiki] and the [RFC 3986 document][rfc].\n\n[![build status](https://travis-ci.org/PuerkitoBio/purell.svg?branch=master)](http://travis-ci.org/PuerkitoBio/purell)\n\n## Install\n\n`go get github.com/PuerkitoBio/purell`\n\n## Changelog\n\n* **2016-11-14 (v1.1.0)** : IDN: Conform to RFC 5895: Fold character width (thanks to @beeker1121).\n* **2016-07-27 (v1.0.0)** : Normalize IDN to ASCII (thanks to @zenovich).\n* **2015-02-08** : Add fix for relative paths issue ([PR #5][pr5]) and add fix for unnecessary encoding of reserved characters ([see issue #7][iss7]).\n* **v0.2.0** : Add benchmarks, Attempt IDN support.\n* **v0.1.0** : Initial release.\n\n## Examples\n\nFrom `example_test.go` (note that in your code, you would import \"github.com/PuerkitoBio/purell\", and would prefix references to its methods and constants with \"purell.\"):\n\n```go\npackage purell\n\nimport (\n \"fmt\"\n \"net/url\"\n)\n\nfunc ExampleNormalizeURLString() {\n if normalized, err := NormalizeURLString(\"hTTp://someWEBsite.com:80/Amazing%3f/url/\",\n FlagLowercaseScheme|FlagLowercaseHost|FlagUppercaseEscapes); err != nil {\n panic(err)\n } else {\n fmt.Print(normalized)\n }\n // Output: http://somewebsite.com:80/Amazing%3F/url/\n}\n\nfunc ExampleMustNormalizeURLString() {\n normalized := MustNormalizeURLString(\"hTTpS://someWEBsite.com:443/Amazing%fa/url/\",\n FlagsUnsafeGreedy)\n fmt.Print(normalized)\n\n // Output: http://somewebsite.com/Amazing%FA/url\n}\n\nfunc ExampleNormalizeURL() {\n if u, err := url.Parse(\"Http://SomeUrl.com:8080/a/b/.././c///g?c=3&a=1&b=9&c=0#target\"); err != nil {\n panic(err)\n } else {\n normalized := NormalizeURL(u, FlagsUsuallySafeGreedy|FlagRemoveDuplicateSlashes|FlagRemoveFragment)\n fmt.Print(normalized)\n }\n\n // Output: http://someurl.com:8080/a/c/g?c=3&a=1&b=9&c=0\n}\n```\n\n## API\n\nAs seen in the examples above, purell offers three methods, `NormalizeURLString(string, NormalizationFlags) (string, error)`, `MustNormalizeURLString(string, NormalizationFlags) (string)` and `NormalizeURL(*url.URL, NormalizationFlags) (string)`. They all normalize the provided URL based on the specified flags. Here are the available flags:\n\n```go\nconst (\n\t// Safe normalizations\n\tFlagLowercaseScheme NormalizationFlags = 1 << iota // HTTP://host -> http://host, applied by default in Go1.1\n\tFlagLowercaseHost // http://HOST -> http://host\n\tFlagUppercaseEscapes // http://host/t%ef -> http://host/t%EF\n\tFlagDecodeUnnecessaryEscapes // http://host/t%41 -> http://host/tA\n\tFlagEncodeNecessaryEscapes // http://host/!\"#$ -> http://host/%21%22#$\n\tFlagRemoveDefaultPort // http://host:80 -> http://host\n\tFlagRemoveEmptyQuerySeparator // http://host/path? -> http://host/path\n\n\t// Usually safe normalizations\n\tFlagRemoveTrailingSlash // http://host/path/ -> http://host/path\n\tFlagAddTrailingSlash // http://host/path -> http://host/path/ (should choose only one of these add/remove trailing slash flags)\n\tFlagRemoveDotSegments // http://host/path/./a/b/../c -> http://host/path/a/c\n\n\t// Unsafe normalizations\n\tFlagRemoveDirectoryIndex // http://host/path/index.html -> http://host/path/\n\tFlagRemoveFragment // http://host/path#fragment -> http://host/path\n\tFlagForceHTTP // https://host -> http://host\n\tFlagRemoveDuplicateSlashes // http://host/path//a///b -> http://host/path/a/b\n\tFlagRemoveWWW // http://www.host/ -> http://host/\n\tFlagAddWWW // http://host/ -> http://www.host/ (should choose only one of these add/remove WWW flags)\n\tFlagSortQuery // http://host/path?c=3&b=2&a=1&b=1 -> http://host/path?a=1&b=1&b=2&c=3\n\n\t// Normalizations not in the wikipedia article, required to cover tests cases\n\t// submitted by jehiah\n\tFlagDecodeDWORDHost // http://1113982867 -> http://66.102.7.147\n\tFlagDecodeOctalHost // http://0102.0146.07.0223 -> http://66.102.7.147\n\tFlagDecodeHexHost // http://0x42660793 -> http://66.102.7.147\n\tFlagRemoveUnnecessaryHostDots // http://.host../path -> http://host/path\n\tFlagRemoveEmptyPortSeparator // http://host:/path -> http://host/path\n\n\t// Convenience set of safe normalizations\n\tFlagsSafe NormalizationFlags = FlagLowercaseHost | FlagLowercaseScheme | FlagUppercaseEscapes | FlagDecodeUnnecessaryEscapes | FlagEncodeNecessaryEscapes | FlagRemoveDefaultPort | FlagRemoveEmptyQuerySeparator\n\n\t// For convenience sets, \"greedy\" uses the \"remove trailing slash\" and \"remove www. prefix\" flags,\n\t// while \"non-greedy\" uses the \"add (or keep) the trailing slash\" and \"add www. prefix\".\n\n\t// Convenience set of usually safe normalizations (includes FlagsSafe)\n\tFlagsUsuallySafeGreedy NormalizationFlags = FlagsSafe | FlagRemoveTrailingSlash | FlagRemoveDotSegments\n\tFlagsUsuallySafeNonGreedy NormalizationFlags = FlagsSafe | FlagAddTrailingSlash | FlagRemoveDotSegments\n\n\t// Convenience set of unsafe normalizations (includes FlagsUsuallySafe)\n\tFlagsUnsafeGreedy NormalizationFlags = FlagsUsuallySafeGreedy | FlagRemoveDirectoryIndex | FlagRemoveFragment | FlagForceHTTP | FlagRemoveDuplicateSlashes | FlagRemoveWWW | FlagSortQuery\n\tFlagsUnsafeNonGreedy NormalizationFlags = FlagsUsuallySafeNonGreedy | FlagRemoveDirectoryIndex | FlagRemoveFragment | FlagForceHTTP | FlagRemoveDuplicateSlashes | FlagAddWWW | FlagSortQuery\n\n\t// Convenience set of all available flags\n\tFlagsAllGreedy = FlagsUnsafeGreedy | FlagDecodeDWORDHost | FlagDecodeOctalHost | FlagDecodeHexHost | FlagRemoveUnnecessaryHostDots | FlagRemoveEmptyPortSeparator\n\tFlagsAllNonGreedy = FlagsUnsafeNonGreedy | FlagDecodeDWORDHost | FlagDecodeOctalHost | FlagDecodeHexHost | FlagRemoveUnnecessaryHostDots | FlagRemoveEmptyPortSeparator\n)\n```\n\nFor convenience, the set of flags `FlagsSafe`, `FlagsUsuallySafe[Greedy|NonGreedy]`, `FlagsUnsafe[Greedy|NonGreedy]` and `FlagsAll[Greedy|NonGreedy]` are provided for the similarly grouped normalizations on [wikipedia's URL normalization page][wiki]. You can add (using the bitwise OR `|` operator) or remove (using the bitwise AND NOT `&^` operator) individual flags from the sets if required, to build your own custom set.\n\nThe [full godoc reference is available on gopkgdoc][godoc].\n\nSome things to note:\n\n* `FlagDecodeUnnecessaryEscapes`, `FlagEncodeNecessaryEscapes`, `FlagUppercaseEscapes` and `FlagRemoveEmptyQuerySeparator` are always implicitly set, because internally, the URL string is parsed as an URL object, which automatically decodes unnecessary escapes, uppercases and encodes necessary ones, and removes empty query separators (an unnecessary `?` at the end of the url). So this operation cannot **not** be done. For this reason, `FlagRemoveEmptyQuerySeparator` (as well as the other three) has been included in the `FlagsSafe` convenience set, instead of `FlagsUnsafe`, where Wikipedia puts it.\n\n* The `FlagDecodeUnnecessaryEscapes` decodes the following escapes (*from -> to*):\n - %24 -> $\n - %26 -> &\n - %2B-%3B -> +,-./0123456789:;\n - %3D -> =\n - %40-%5A -> @ABCDEFGHIJKLMNOPQRSTUVWXYZ\n - %5F -> _\n - %61-%7A -> abcdefghijklmnopqrstuvwxyz\n - %7E -> ~\n\n\n* When the `NormalizeURL` function is used (passing an URL object), this source URL object is modified (that is, after the call, the URL object will be modified to reflect the normalization).\n\n* The *replace IP with domain name* normalization (`http://208.77.188.166/ → http://www.example.com/`) is obviously not possible for a library without making some network requests. This is not implemented in purell.\n\n* The *remove unused query string parameters* and *remove default query parameters* are also not implemented, since this is a very case-specific normalization, and it is quite trivial to do with an URL object.\n\n### Safe vs Usually Safe vs Unsafe\n\nPurell allows you to control the level of risk you take while normalizing an URL. You can aggressively normalize, play it totally safe, or anything in between.\n\nConsider the following URL:\n\n`HTTPS://www.RooT.com/toto/t%45%1f///a/./b/../c/?z=3&w=2&a=4&w=1#invalid`\n\nNormalizing with the `FlagsSafe` gives:\n\n`https://www.root.com/toto/tE%1F///a/./b/../c/?z=3&w=2&a=4&w=1#invalid`\n\nWith the `FlagsUsuallySafeGreedy`:\n\n`https://www.root.com/toto/tE%1F///a/c?z=3&w=2&a=4&w=1#invalid`\n\nAnd with `FlagsUnsafeGreedy`:\n\n`http://root.com/toto/tE%1F/a/c?a=4&w=1&w=2&z=3`\n\n## TODOs\n\n* Add a class/default instance to allow specifying custom directory index names? At the moment, removing directory index removes `(^|/)((?:default|index)\\.\\w{1,4})$`.\n\n## Thanks / Contributions\n\n@rogpeppe\n@jehiah\n@opennota\n@pchristopher1275\n@zenovich\n@beeker1121\n\n## License\n\nThe [BSD 3-Clause license][bsd].\n\n[bsd]: http://opensource.org/licenses/BSD-3-Clause\n[wiki]: http://en.wikipedia.org/wiki/URL_normalization\n[rfc]: http://tools.ietf.org/html/rfc3986#section-6\n[godoc]: http://go.pkgdoc.org/github.com/PuerkitoBio/purell\n[pr5]: https://github.com/PuerkitoBio/purell/pull/5\n[iss7]: https://github.com/PuerkitoBio/purell/issues/7\n" }, { "path": "vendor/github.com/PuerkitoBio/purell/purell.go", "content": "/*\nPackage purell offers URL normalization as described on the wikipedia page:\nhttp://en.wikipedia.org/wiki/URL_normalization\n*/\npackage purell\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"net/url\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/PuerkitoBio/urlesc\"\n\t\"golang.org/x/net/idna\"\n\t\"golang.org/x/text/unicode/norm\"\n\t\"golang.org/x/text/width\"\n)\n\n// A set of normalization flags determines how a URL will\n// be normalized.\ntype NormalizationFlags uint\n\nconst (\n\t// Safe normalizations\n\tFlagLowercaseScheme NormalizationFlags = 1 << iota // HTTP://host -> http://host, applied by default in Go1.1\n\tFlagLowercaseHost // http://HOST -> http://host\n\tFlagUppercaseEscapes // http://host/t%ef -> http://host/t%EF\n\tFlagDecodeUnnecessaryEscapes // http://host/t%41 -> http://host/tA\n\tFlagEncodeNecessaryEscapes // http://host/!\"#$ -> http://host/%21%22#$\n\tFlagRemoveDefaultPort // http://host:80 -> http://host\n\tFlagRemoveEmptyQuerySeparator // http://host/path? -> http://host/path\n\n\t// Usually safe normalizations\n\tFlagRemoveTrailingSlash // http://host/path/ -> http://host/path\n\tFlagAddTrailingSlash // http://host/path -> http://host/path/ (should choose only one of these add/remove trailing slash flags)\n\tFlagRemoveDotSegments // http://host/path/./a/b/../c -> http://host/path/a/c\n\n\t// Unsafe normalizations\n\tFlagRemoveDirectoryIndex // http://host/path/index.html -> http://host/path/\n\tFlagRemoveFragment // http://host/path#fragment -> http://host/path\n\tFlagForceHTTP // https://host -> http://host\n\tFlagRemoveDuplicateSlashes // http://host/path//a///b -> http://host/path/a/b\n\tFlagRemoveWWW // http://www.host/ -> http://host/\n\tFlagAddWWW // http://host/ -> http://www.host/ (should choose only one of these add/remove WWW flags)\n\tFlagSortQuery // http://host/path?c=3&b=2&a=1&b=1 -> http://host/path?a=1&b=1&b=2&c=3\n\n\t// Normalizations not in the wikipedia article, required to cover tests cases\n\t// submitted by jehiah\n\tFlagDecodeDWORDHost // http://1113982867 -> http://66.102.7.147\n\tFlagDecodeOctalHost // http://0102.0146.07.0223 -> http://66.102.7.147\n\tFlagDecodeHexHost // http://0x42660793 -> http://66.102.7.147\n\tFlagRemoveUnnecessaryHostDots // http://.host../path -> http://host/path\n\tFlagRemoveEmptyPortSeparator // http://host:/path -> http://host/path\n\n\t// Convenience set of safe normalizations\n\tFlagsSafe NormalizationFlags = FlagLowercaseHost | FlagLowercaseScheme | FlagUppercaseEscapes | FlagDecodeUnnecessaryEscapes | FlagEncodeNecessaryEscapes | FlagRemoveDefaultPort | FlagRemoveEmptyQuerySeparator\n\n\t// For convenience sets, \"greedy\" uses the \"remove trailing slash\" and \"remove www. prefix\" flags,\n\t// while \"non-greedy\" uses the \"add (or keep) the trailing slash\" and \"add www. prefix\".\n\n\t// Convenience set of usually safe normalizations (includes FlagsSafe)\n\tFlagsUsuallySafeGreedy NormalizationFlags = FlagsSafe | FlagRemoveTrailingSlash | FlagRemoveDotSegments\n\tFlagsUsuallySafeNonGreedy NormalizationFlags = FlagsSafe | FlagAddTrailingSlash | FlagRemoveDotSegments\n\n\t// Convenience set of unsafe normalizations (includes FlagsUsuallySafe)\n\tFlagsUnsafeGreedy NormalizationFlags = FlagsUsuallySafeGreedy | FlagRemoveDirectoryIndex | FlagRemoveFragment | FlagForceHTTP | FlagRemoveDuplicateSlashes | FlagRemoveWWW | FlagSortQuery\n\tFlagsUnsafeNonGreedy NormalizationFlags = FlagsUsuallySafeNonGreedy | FlagRemoveDirectoryIndex | FlagRemoveFragment | FlagForceHTTP | FlagRemoveDuplicateSlashes | FlagAddWWW | FlagSortQuery\n\n\t// Convenience set of all available flags\n\tFlagsAllGreedy = FlagsUnsafeGreedy | FlagDecodeDWORDHost | FlagDecodeOctalHost | FlagDecodeHexHost | FlagRemoveUnnecessaryHostDots | FlagRemoveEmptyPortSeparator\n\tFlagsAllNonGreedy = FlagsUnsafeNonGreedy | FlagDecodeDWORDHost | FlagDecodeOctalHost | FlagDecodeHexHost | FlagRemoveUnnecessaryHostDots | FlagRemoveEmptyPortSeparator\n)\n\nconst (\n\tdefaultHttpPort = \":80\"\n\tdefaultHttpsPort = \":443\"\n)\n\n// Regular expressions used by the normalizations\nvar rxPort = regexp.MustCompile(`(:\\d+)/?$`)\nvar rxDirIndex = regexp.MustCompile(`(^|/)((?:default|index)\\.\\w{1,4})$`)\nvar rxDupSlashes = regexp.MustCompile(`/{2,}`)\nvar rxDWORDHost = regexp.MustCompile(`^(\\d+)((?:\\.+)?(?:\\:\\d*)?)$`)\nvar rxOctalHost = regexp.MustCompile(`^(0\\d*)\\.(0\\d*)\\.(0\\d*)\\.(0\\d*)((?:\\.+)?(?:\\:\\d*)?)$`)\nvar rxHexHost = regexp.MustCompile(`^0x([0-9A-Fa-f]+)((?:\\.+)?(?:\\:\\d*)?)$`)\nvar rxHostDots = regexp.MustCompile(`^(.+?)(:\\d+)?$`)\nvar rxEmptyPort = regexp.MustCompile(`:+$`)\n\n// Map of flags to implementation function.\n// FlagDecodeUnnecessaryEscapes has no action, since it is done automatically\n// by parsing the string as an URL. Same for FlagUppercaseEscapes and FlagRemoveEmptyQuerySeparator.\n\n// Since maps have undefined traversing order, make a slice of ordered keys\nvar flagsOrder = []NormalizationFlags{\n\tFlagLowercaseScheme,\n\tFlagLowercaseHost,\n\tFlagRemoveDefaultPort,\n\tFlagRemoveDirectoryIndex,\n\tFlagRemoveDotSegments,\n\tFlagRemoveFragment,\n\tFlagForceHTTP, // Must be after remove default port (because https=443/http=80)\n\tFlagRemoveDuplicateSlashes,\n\tFlagRemoveWWW,\n\tFlagAddWWW,\n\tFlagSortQuery,\n\tFlagDecodeDWORDHost,\n\tFlagDecodeOctalHost,\n\tFlagDecodeHexHost,\n\tFlagRemoveUnnecessaryHostDots,\n\tFlagRemoveEmptyPortSeparator,\n\tFlagRemoveTrailingSlash, // These two (add/remove trailing slash) must be last\n\tFlagAddTrailingSlash,\n}\n\n// ... and then the map, where order is unimportant\nvar flags = map[NormalizationFlags]func(*url.URL){\n\tFlagLowercaseScheme: lowercaseScheme,\n\tFlagLowercaseHost: lowercaseHost,\n\tFlagRemoveDefaultPort: removeDefaultPort,\n\tFlagRemoveDirectoryIndex: removeDirectoryIndex,\n\tFlagRemoveDotSegments: removeDotSegments,\n\tFlagRemoveFragment: removeFragment,\n\tFlagForceHTTP: forceHTTP,\n\tFlagRemoveDuplicateSlashes: removeDuplicateSlashes,\n\tFlagRemoveWWW: removeWWW,\n\tFlagAddWWW: addWWW,\n\tFlagSortQuery: sortQuery,\n\tFlagDecodeDWORDHost: decodeDWORDHost,\n\tFlagDecodeOctalHost: decodeOctalHost,\n\tFlagDecodeHexHost: decodeHexHost,\n\tFlagRemoveUnnecessaryHostDots: removeUnncessaryHostDots,\n\tFlagRemoveEmptyPortSeparator: removeEmptyPortSeparator,\n\tFlagRemoveTrailingSlash: removeTrailingSlash,\n\tFlagAddTrailingSlash: addTrailingSlash,\n}\n\n// MustNormalizeURLString returns the normalized string, and panics if an error occurs.\n// It takes an URL string as input, as well as the normalization flags.\nfunc MustNormalizeURLString(u string, f NormalizationFlags) string {\n\tresult, e := NormalizeURLString(u, f)\n\tif e != nil {\n\t\tpanic(e)\n\t}\n\treturn result\n}\n\n// NormalizeURLString returns the normalized string, or an error if it can't be parsed into an URL object.\n// It takes an URL string as input, as well as the normalization flags.\nfunc NormalizeURLString(u string, f NormalizationFlags) (string, error) {\n\tparsed, err := url.Parse(u)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\tif f&FlagLowercaseHost == FlagLowercaseHost {\n\t\tparsed.Host = strings.ToLower(parsed.Host)\n\t}\n\n\t// The idna package doesn't fully conform to RFC 5895\n\t// (https://tools.ietf.org/html/rfc5895), so we do it here.\n\t// Taken from Go 1.8 cycle source, courtesy of bradfitz.\n\t// TODO: Remove when (if?) idna package conforms to RFC 5895.\n\tparsed.Host = width.Fold.String(parsed.Host)\n\tparsed.Host = norm.NFC.String(parsed.Host)\n\tif parsed.Host, err = idna.ToASCII(parsed.Host); err != nil {\n\t\treturn \"\", err\n\t}\n\n\treturn NormalizeURL(parsed, f), nil\n}\n\n// NormalizeURL returns the normalized string.\n// It takes a parsed URL object as input, as well as the normalization flags.\nfunc NormalizeURL(u *url.URL, f NormalizationFlags) string {\n\tfor _, k := range flagsOrder {\n\t\tif f&k == k {\n\t\t\tflags[k](u)\n\t\t}\n\t}\n\treturn urlesc.Escape(u)\n}\n\nfunc lowercaseScheme(u *url.URL) {\n\tif len(u.Scheme) > 0 {\n\t\tu.Scheme = strings.ToLower(u.Scheme)\n\t}\n}\n\nfunc lowercaseHost(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tu.Host = strings.ToLower(u.Host)\n\t}\n}\n\nfunc removeDefaultPort(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tscheme := strings.ToLower(u.Scheme)\n\t\tu.Host = rxPort.ReplaceAllStringFunc(u.Host, func(val string) string {\n\t\t\tif (scheme == \"http\" && val == defaultHttpPort) || (scheme == \"https\" && val == defaultHttpsPort) {\n\t\t\t\treturn \"\"\n\t\t\t}\n\t\t\treturn val\n\t\t})\n\t}\n}\n\nfunc removeTrailingSlash(u *url.URL) {\n\tif l := len(u.Path); l > 0 {\n\t\tif strings.HasSuffix(u.Path, \"/\") {\n\t\t\tu.Path = u.Path[:l-1]\n\t\t}\n\t} else if l = len(u.Host); l > 0 {\n\t\tif strings.HasSuffix(u.Host, \"/\") {\n\t\t\tu.Host = u.Host[:l-1]\n\t\t}\n\t}\n}\n\nfunc addTrailingSlash(u *url.URL) {\n\tif l := len(u.Path); l > 0 {\n\t\tif !strings.HasSuffix(u.Path, \"/\") {\n\t\t\tu.Path += \"/\"\n\t\t}\n\t} else if l = len(u.Host); l > 0 {\n\t\tif !strings.HasSuffix(u.Host, \"/\") {\n\t\t\tu.Host += \"/\"\n\t\t}\n\t}\n}\n\nfunc removeDotSegments(u *url.URL) {\n\tif len(u.Path) > 0 {\n\t\tvar dotFree []string\n\t\tvar lastIsDot bool\n\n\t\tsections := strings.Split(u.Path, \"/\")\n\t\tfor _, s := range sections {\n\t\t\tif s == \"..\" {\n\t\t\t\tif len(dotFree) > 0 {\n\t\t\t\t\tdotFree = dotFree[:len(dotFree)-1]\n\t\t\t\t}\n\t\t\t} else if s != \".\" {\n\t\t\t\tdotFree = append(dotFree, s)\n\t\t\t}\n\t\t\tlastIsDot = (s == \".\" || s == \"..\")\n\t\t}\n\t\t// Special case if host does not end with / and new path does not begin with /\n\t\tu.Path = strings.Join(dotFree, \"/\")\n\t\tif u.Host != \"\" && !strings.HasSuffix(u.Host, \"/\") && !strings.HasPrefix(u.Path, \"/\") {\n\t\t\tu.Path = \"/\" + u.Path\n\t\t}\n\t\t// Special case if the last segment was a dot, make sure the path ends with a slash\n\t\tif lastIsDot && !strings.HasSuffix(u.Path, \"/\") {\n\t\t\tu.Path += \"/\"\n\t\t}\n\t}\n}\n\nfunc removeDirectoryIndex(u *url.URL) {\n\tif len(u.Path) > 0 {\n\t\tu.Path = rxDirIndex.ReplaceAllString(u.Path, \"$1\")\n\t}\n}\n\nfunc removeFragment(u *url.URL) {\n\tu.Fragment = \"\"\n}\n\nfunc forceHTTP(u *url.URL) {\n\tif strings.ToLower(u.Scheme) == \"https\" {\n\t\tu.Scheme = \"http\"\n\t}\n}\n\nfunc removeDuplicateSlashes(u *url.URL) {\n\tif len(u.Path) > 0 {\n\t\tu.Path = rxDupSlashes.ReplaceAllString(u.Path, \"/\")\n\t}\n}\n\nfunc removeWWW(u *url.URL) {\n\tif len(u.Host) > 0 && strings.HasPrefix(strings.ToLower(u.Host), \"www.\") {\n\t\tu.Host = u.Host[4:]\n\t}\n}\n\nfunc addWWW(u *url.URL) {\n\tif len(u.Host) > 0 && !strings.HasPrefix(strings.ToLower(u.Host), \"www.\") {\n\t\tu.Host = \"www.\" + u.Host\n\t}\n}\n\nfunc sortQuery(u *url.URL) {\n\tq := u.Query()\n\n\tif len(q) > 0 {\n\t\tarKeys := make([]string, len(q))\n\t\ti := 0\n\t\tfor k := range q {\n\t\t\tarKeys[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Strings(arKeys)\n\t\tbuf := new(bytes.Buffer)\n\t\tfor _, k := range arKeys {\n\t\t\tsort.Strings(q[k])\n\t\t\tfor _, v := range q[k] {\n\t\t\t\tif buf.Len() > 0 {\n\t\t\t\t\tbuf.WriteRune('&')\n\t\t\t\t}\n\t\t\t\tbuf.WriteString(fmt.Sprintf(\"%s=%s\", k, urlesc.QueryEscape(v)))\n\t\t\t}\n\t\t}\n\n\t\t// Rebuild the raw query string\n\t\tu.RawQuery = buf.String()\n\t}\n}\n\nfunc decodeDWORDHost(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tif matches := rxDWORDHost.FindStringSubmatch(u.Host); len(matches) > 2 {\n\t\t\tvar parts [4]int64\n\n\t\t\tdword, _ := strconv.ParseInt(matches[1], 10, 0)\n\t\t\tfor i, shift := range []uint{24, 16, 8, 0} {\n\t\t\t\tparts[i] = dword >> shift & 0xFF\n\t\t\t}\n\t\t\tu.Host = fmt.Sprintf(\"%d.%d.%d.%d%s\", parts[0], parts[1], parts[2], parts[3], matches[2])\n\t\t}\n\t}\n}\n\nfunc decodeOctalHost(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tif matches := rxOctalHost.FindStringSubmatch(u.Host); len(matches) > 5 {\n\t\t\tvar parts [4]int64\n\n\t\t\tfor i := 1; i <= 4; i++ {\n\t\t\t\tparts[i-1], _ = strconv.ParseInt(matches[i], 8, 0)\n\t\t\t}\n\t\t\tu.Host = fmt.Sprintf(\"%d.%d.%d.%d%s\", parts[0], parts[1], parts[2], parts[3], matches[5])\n\t\t}\n\t}\n}\n\nfunc decodeHexHost(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tif matches := rxHexHost.FindStringSubmatch(u.Host); len(matches) > 2 {\n\t\t\t// Conversion is safe because of regex validation\n\t\t\tparsed, _ := strconv.ParseInt(matches[1], 16, 0)\n\t\t\t// Set host as DWORD (base 10) encoded host\n\t\t\tu.Host = fmt.Sprintf(\"%d%s\", parsed, matches[2])\n\t\t\t// The rest is the same as decoding a DWORD host\n\t\t\tdecodeDWORDHost(u)\n\t\t}\n\t}\n}\n\nfunc removeUnncessaryHostDots(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tif matches := rxHostDots.FindStringSubmatch(u.Host); len(matches) > 1 {\n\t\t\t// Trim the leading and trailing dots\n\t\t\tu.Host = strings.Trim(matches[1], \".\")\n\t\t\tif len(matches) > 2 {\n\t\t\t\tu.Host += matches[2]\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc removeEmptyPortSeparator(u *url.URL) {\n\tif len(u.Host) > 0 {\n\t\tu.Host = rxEmptyPort.ReplaceAllString(u.Host, \"\")\n\t}\n}\n" }, { "path": "vendor/github.com/PuerkitoBio/urlesc/.travis.yml", "content": "language: go\n\ngo:\n - 1.4.x\n - 1.5.x\n - 1.6.x\n - 1.7.x\n - 1.8.x\n - tip\n\ninstall:\n - go build .\n\nscript:\n - go test -v\n" }, { "path": "vendor/github.com/PuerkitoBio/urlesc/LICENSE", "content": "Copyright (c) 2012 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/PuerkitoBio/urlesc/README.md", "content": "urlesc [![Build Status](https://travis-ci.org/PuerkitoBio/urlesc.svg?branch=master)](https://travis-ci.org/PuerkitoBio/urlesc) [![GoDoc](http://godoc.org/github.com/PuerkitoBio/urlesc?status.svg)](http://godoc.org/github.com/PuerkitoBio/urlesc)\n======\n\nPackage urlesc implements query escaping as per RFC 3986.\n\nIt contains some parts of the net/url package, modified so as to allow\nsome reserved characters incorrectly escaped by net/url (see [issue 5684](https://github.com/golang/go/issues/5684)).\n\n## Install\n\n go get github.com/PuerkitoBio/urlesc\n\n## License\n\nGo license (BSD-3-Clause)\n\n" }, { "path": "vendor/github.com/PuerkitoBio/urlesc/urlesc.go", "content": "// Copyright 2009 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package urlesc implements query escaping as per RFC 3986.\n// It contains some parts of the net/url package, modified so as to allow\n// some reserved characters incorrectly escaped by net/url.\n// See https://github.com/golang/go/issues/5684\npackage urlesc\n\nimport (\n\t\"bytes\"\n\t\"net/url\"\n\t\"strings\"\n)\n\ntype encoding int\n\nconst (\n\tencodePath encoding = 1 + iota\n\tencodeUserPassword\n\tencodeQueryComponent\n\tencodeFragment\n)\n\n// Return true if the specified character should be escaped when\n// appearing in a URL string, according to RFC 3986.\nfunc shouldEscape(c byte, mode encoding) bool {\n\t// §2.3 Unreserved characters (alphanum)\n\tif 'A' <= c && c <= 'Z' || 'a' <= c && c <= 'z' || '0' <= c && c <= '9' {\n\t\treturn false\n\t}\n\n\tswitch c {\n\tcase '-', '.', '_', '~': // §2.3 Unreserved characters (mark)\n\t\treturn false\n\n\t// §2.2 Reserved characters (reserved)\n\tcase ':', '/', '?', '#', '[', ']', '@', // gen-delims\n\t\t'!', '$', '&', '\\'', '(', ')', '*', '+', ',', ';', '=': // sub-delims\n\t\t// Different sections of the URL allow a few of\n\t\t// the reserved characters to appear unescaped.\n\t\tswitch mode {\n\t\tcase encodePath: // §3.3\n\t\t\t// The RFC allows sub-delims and : @.\n\t\t\t// '/', '[' and ']' can be used to assign meaning to individual path\n\t\t\t// segments. This package only manipulates the path as a whole,\n\t\t\t// so we allow those as well. That leaves only ? and # to escape.\n\t\t\treturn c == '?' || c == '#'\n\n\t\tcase encodeUserPassword: // §3.2.1\n\t\t\t// The RFC allows : and sub-delims in\n\t\t\t// userinfo. The parsing of userinfo treats ':' as special so we must escape\n\t\t\t// all the gen-delims.\n\t\t\treturn c == ':' || c == '/' || c == '?' || c == '#' || c == '[' || c == ']' || c == '@'\n\n\t\tcase encodeQueryComponent: // §3.4\n\t\t\t// The RFC allows / and ?.\n\t\t\treturn c != '/' && c != '?'\n\n\t\tcase encodeFragment: // §4.1\n\t\t\t// The RFC text is silent but the grammar allows\n\t\t\t// everything, so escape nothing but #\n\t\t\treturn c == '#'\n\t\t}\n\t}\n\n\t// Everything else must be escaped.\n\treturn true\n}\n\n// QueryEscape escapes the string so it can be safely placed\n// inside a URL query.\nfunc QueryEscape(s string) string {\n\treturn escape(s, encodeQueryComponent)\n}\n\nfunc escape(s string, mode encoding) string {\n\tspaceCount, hexCount := 0, 0\n\tfor i := 0; i < len(s); i++ {\n\t\tc := s[i]\n\t\tif shouldEscape(c, mode) {\n\t\t\tif c == ' ' && mode == encodeQueryComponent {\n\t\t\t\tspaceCount++\n\t\t\t} else {\n\t\t\t\thexCount++\n\t\t\t}\n\t\t}\n\t}\n\n\tif spaceCount == 0 && hexCount == 0 {\n\t\treturn s\n\t}\n\n\tt := make([]byte, len(s)+2*hexCount)\n\tj := 0\n\tfor i := 0; i < len(s); i++ {\n\t\tswitch c := s[i]; {\n\t\tcase c == ' ' && mode == encodeQueryComponent:\n\t\t\tt[j] = '+'\n\t\t\tj++\n\t\tcase shouldEscape(c, mode):\n\t\t\tt[j] = '%'\n\t\t\tt[j+1] = \"0123456789ABCDEF\"[c>>4]\n\t\t\tt[j+2] = \"0123456789ABCDEF\"[c&15]\n\t\t\tj += 3\n\t\tdefault:\n\t\t\tt[j] = s[i]\n\t\t\tj++\n\t\t}\n\t}\n\treturn string(t)\n}\n\nvar uiReplacer = strings.NewReplacer(\n\t\"%21\", \"!\",\n\t\"%27\", \"'\",\n\t\"%28\", \"(\",\n\t\"%29\", \")\",\n\t\"%2A\", \"*\",\n)\n\n// unescapeUserinfo unescapes some characters that need not to be escaped as per RFC3986.\nfunc unescapeUserinfo(s string) string {\n\treturn uiReplacer.Replace(s)\n}\n\n// Escape reassembles the URL into a valid URL string.\n// The general form of the result is one of:\n//\n//\tscheme:opaque\n//\tscheme://userinfo@host/path?query#fragment\n//\n// If u.Opaque is non-empty, String uses the first form;\n// otherwise it uses the second form.\n//\n// In the second form, the following rules apply:\n//\t- if u.Scheme is empty, scheme: is omitted.\n//\t- if u.User is nil, userinfo@ is omitted.\n//\t- if u.Host is empty, host/ is omitted.\n//\t- if u.Scheme and u.Host are empty and u.User is nil,\n//\t the entire scheme://userinfo@host/ is omitted.\n//\t- if u.Host is non-empty and u.Path begins with a /,\n//\t the form host/path does not add its own /.\n//\t- if u.RawQuery is empty, ?query is omitted.\n//\t- if u.Fragment is empty, #fragment is omitted.\nfunc Escape(u *url.URL) string {\n\tvar buf bytes.Buffer\n\tif u.Scheme != \"\" {\n\t\tbuf.WriteString(u.Scheme)\n\t\tbuf.WriteByte(':')\n\t}\n\tif u.Opaque != \"\" {\n\t\tbuf.WriteString(u.Opaque)\n\t} else {\n\t\tif u.Scheme != \"\" || u.Host != \"\" || u.User != nil {\n\t\t\tbuf.WriteString(\"//\")\n\t\t\tif ui := u.User; ui != nil {\n\t\t\t\tbuf.WriteString(unescapeUserinfo(ui.String()))\n\t\t\t\tbuf.WriteByte('@')\n\t\t\t}\n\t\t\tif h := u.Host; h != \"\" {\n\t\t\t\tbuf.WriteString(h)\n\t\t\t}\n\t\t}\n\t\tif u.Path != \"\" && u.Path[0] != '/' && u.Host != \"\" {\n\t\t\tbuf.WriteByte('/')\n\t\t}\n\t\tbuf.WriteString(escape(u.Path, encodePath))\n\t}\n\tif u.RawQuery != \"\" {\n\t\tbuf.WriteByte('?')\n\t\tbuf.WriteString(u.RawQuery)\n\t}\n\tif u.Fragment != \"\" {\n\t\tbuf.WriteByte('#')\n\t\tbuf.WriteString(escape(u.Fragment, encodeFragment))\n\t}\n\treturn buf.String()\n}\n" }, { "path": "vendor/github.com/Unknwon/com/.gitignore", "content": "# Compiled Object files, Static and Dynamic libs (Shared Objects)\n*.o\n*.a\n*.so\n\n# Folders\n_obj\n_test\n.idea\n\n# Architecture specific extensions/prefixes\n*.[568vq]\n[568vq].out\n\n*.cgo1.go\n*.cgo2.c\n_cgo_defun.c\n_cgo_gotypes.go\n_cgo_export.*\n\n_testmain.go\n\n*.exe\n*.iml\n" }, { "path": "vendor/github.com/Unknwon/com/.travis.yml", "content": "language: go\n\ngo:\n - 1.3.x\n - 1.4.x\n - 1.5.x\n - 1.6.x\n - 1.7.x\n - 1.8.x\n - 1.9.x\n - 1.10.x\n - 1.11.x\n - 1.12.x\n\ninstall: go get -v -t\n" }, { "path": "vendor/github.com/Unknwon/com/LICENSE", "content": "Apache License\nVersion 2.0, January 2004\nhttp://www.apache.org/licenses/\n\nTERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n1. Definitions.\n\n\"License\" shall mean the terms and conditions for use, reproduction, and\ndistribution as defined by Sections 1 through 9 of this document.\n\n\"Licensor\" shall mean the copyright owner or entity authorized by the copyright\nowner that is granting the License.\n\n\"Legal Entity\" shall mean the union of the acting entity and all other entities\nthat control, are controlled by, or are under common control with that entity.\nFor the purposes of this definition, \"control\" means (i) the power, direct or\nindirect, to cause the direction or management of such entity, whether by\ncontract or otherwise, or (ii) ownership of fifty percent (50%) or more of the\noutstanding shares, or (iii) beneficial ownership of such entity.\n\n\"You\" (or \"Your\") shall mean an individual or Legal Entity exercising\npermissions granted by this License.\n\n\"Source\" form shall mean the preferred form for making modifications, including\nbut not limited to software source code, documentation source, and configuration\nfiles.\n\n\"Object\" form shall mean any form resulting from mechanical transformation or\ntranslation of a Source form, including but not limited to compiled object code,\ngenerated documentation, and conversions to other media types.\n\n\"Work\" shall mean the work of authorship, whether in Source or Object form, made\navailable under the License, as indicated by a copyright notice that is included\nin or attached to the work (an example is provided in the Appendix below).\n\n\"Derivative Works\" shall mean any work, whether in Source or Object form, that\nis based on (or derived from) the Work and for which the editorial revisions,\nannotations, elaborations, or other modifications represent, as a whole, an\noriginal work of authorship. For the purposes of this License, Derivative Works\nshall not include works that remain separable from, or merely link (or bind by\nname) to the interfaces of, the Work and Derivative Works thereof.\n\n\"Contribution\" shall mean any work of authorship, including the original version\nof the Work and any modifications or additions to that Work or Derivative Works\nthereof, that is intentionally submitted to Licensor for inclusion in the Work\nby the copyright owner or by an individual or Legal Entity authorized to submit\non behalf of the copyright owner. For the purposes of this definition,\n\"submitted\" means any form of electronic, verbal, or written communication sent\nto the Licensor or its representatives, including but not limited to\ncommunication on electronic mailing lists, source code control systems, and\nissue tracking systems that are managed by, or on behalf of, the Licensor for\nthe purpose of discussing and improving the Work, but excluding communication\nthat is conspicuously marked or otherwise designated in writing by the copyright\nowner as \"Not a Contribution.\"\n\n\"Contributor\" shall mean Licensor and any individual or Legal Entity on behalf\nof whom a Contribution has been received by Licensor and subsequently\nincorporated within the Work.\n\n2. Grant of Copyright License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable copyright license to reproduce, prepare Derivative Works of,\npublicly display, publicly perform, sublicense, and distribute the Work and such\nDerivative Works in Source or Object form.\n\n3. Grant of Patent License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable (except as stated in this section) patent license to make, have\nmade, use, offer to sell, sell, import, and otherwise transfer the Work, where\nsuch license applies only to those patent claims licensable by such Contributor\nthat are necessarily infringed by their Contribution(s) alone or by combination\nof their Contribution(s) with the Work to which such Contribution(s) was\nsubmitted. If You institute patent litigation against any entity (including a\ncross-claim or counterclaim in a lawsuit) alleging that the Work or a\nContribution incorporated within the Work constitutes direct or contributory\npatent infringement, then any patent licenses granted to You under this License\nfor that Work shall terminate as of the date such litigation is filed.\n\n4. Redistribution.\n\nYou may reproduce and distribute copies of the Work or Derivative Works thereof\nin any medium, with or without modifications, and in Source or Object form,\nprovided that You meet the following conditions:\n\nYou must give any other recipients of the Work or Derivative Works a copy of\nthis License; and\nYou must cause any modified files to carry prominent notices stating that You\nchanged the files; and\nYou must retain, in the Source form of any Derivative Works that You distribute,\nall copyright, patent, trademark, and attribution notices from the Source form\nof the Work, excluding those notices that do not pertain to any part of the\nDerivative Works; and\nIf the Work includes a \"NOTICE\" text file as part of its distribution, then any\nDerivative Works that You distribute must include a readable copy of the\nattribution notices contained within such NOTICE file, excluding those notices\nthat do not pertain to any part of the Derivative Works, in at least one of the\nfollowing places: within a NOTICE text file distributed as part of the\nDerivative Works; within the Source form or documentation, if provided along\nwith the Derivative Works; or, within a display generated by the Derivative\nWorks, if and wherever such third-party notices normally appear. The contents of\nthe NOTICE file are for informational purposes only and do not modify the\nLicense. You may add Your own attribution notices within Derivative Works that\nYou distribute, alongside or as an addendum to the NOTICE text from the Work,\nprovided that such additional attribution notices cannot be construed as\nmodifying the License.\nYou may add Your own copyright statement to Your modifications and may provide\nadditional or different license terms and conditions for use, reproduction, or\ndistribution of Your modifications, or for any such Derivative Works as a whole,\nprovided Your use, reproduction, and distribution of the Work otherwise complies\nwith the conditions stated in this License.\n\n5. Submission of Contributions.\n\nUnless You explicitly state otherwise, any Contribution intentionally submitted\nfor inclusion in the Work by You to the Licensor shall be under the terms and\nconditions of this License, without any additional terms or conditions.\nNotwithstanding the above, nothing herein shall supersede or modify the terms of\nany separate license agreement you may have executed with Licensor regarding\nsuch Contributions.\n\n6. Trademarks.\n\nThis License does not grant permission to use the trade names, trademarks,\nservice marks, or product names of the Licensor, except as required for\nreasonable and customary use in describing the origin of the Work and\nreproducing the content of the NOTICE file.\n\n7. Disclaimer of Warranty.\n\nUnless required by applicable law or agreed to in writing, Licensor provides the\nWork (and each Contributor provides its Contributions) on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,\nincluding, without limitation, any warranties or conditions of TITLE,\nNON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are\nsolely responsible for determining the appropriateness of using or\nredistributing the Work and assume any risks associated with Your exercise of\npermissions under this License.\n\n8. Limitation of Liability.\n\nIn no event and under no legal theory, whether in tort (including negligence),\ncontract, or otherwise, unless required by applicable law (such as deliberate\nand grossly negligent acts) or agreed to in writing, shall any Contributor be\nliable to You for damages, including any direct, indirect, special, incidental,\nor consequential damages of any character arising as a result of this License or\nout of the use or inability to use the Work (including but not limited to\ndamages for loss of goodwill, work stoppage, computer failure or malfunction, or\nany and all other commercial damages or losses), even if such Contributor has\nbeen advised of the possibility of such damages.\n\n9. Accepting Warranty or Additional Liability.\n\nWhile redistributing the Work or Derivative Works thereof, You may choose to\noffer, and charge a fee for, acceptance of support, warranty, indemnity, or\nother liability obligations and/or rights consistent with this License. However,\nin accepting such obligations, You may act only on Your own behalf and on Your\nsole responsibility, not on behalf of any other Contributor, and only if You\nagree to indemnify, defend, and hold each Contributor harmless for any liability\nincurred by, or claims asserted against, such Contributor by reason of your\naccepting any such warranty or additional liability.\n\nEND OF TERMS AND CONDITIONS\n\nAPPENDIX: How to apply the Apache License to your work\n\nTo apply the Apache License to your work, attach the following boilerplate\nnotice, with the fields enclosed by brackets \"[]\" replaced with your own\nidentifying information. (Don't include the brackets!) The text should be\nenclosed in the appropriate comment syntax for the file format. We also\nrecommend that a file or class name and description of purpose be included on\nthe same \"printed page\" as the copyright notice for easier identification within\nthird-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License." }, { "path": "vendor/github.com/Unknwon/com/README.md", "content": "Common Functions\n================\n\n[![Build Status](https://travis-ci.org/unknwon/com.svg)](https://travis-ci.org/unknwon/com) [![Go Walker](http://gowalker.org/api/v1/badge)](http://gowalker.org/github.com/unknwon/com)\n\nThis is an open source project for commonly used functions for the Go programming language.\n\nThis package need >= **go 1.3**\n\nCode Convention: based on [Go Code Convention](https://github.com/unknwon/go-code-convention).\n\n## Contribute\n\nYour contribute is welcome, but you have to check following steps after you added some functions and commit them:\n\n1. Make sure you wrote user-friendly comments for **all functions** .\n2. Make sure you wrote test cases with any possible condition for **all functions** in file `*_test.go`.\n3. Make sure you wrote benchmarks for **all functions** in file `*_test.go`.\n4. Make sure you wrote useful examples for **all functions** in file `example_test.go`.\n5. Make sure you ran `go test` and got **PASS** .\n" }, { "path": "vendor/github.com/Unknwon/com/cmd.go", "content": "// +build go1.3\n\n// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\n// Package com is an open source project for commonly used functions for the Go programming language.\npackage com\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"os/exec\"\n\t\"runtime\"\n\t\"strings\"\n)\n\n// ExecCmdDirBytes executes system command in given directory\n// and return stdout, stderr in bytes type, along with possible error.\nfunc ExecCmdDirBytes(dir, cmdName string, args ...string) ([]byte, []byte, error) {\n\tbufOut := new(bytes.Buffer)\n\tbufErr := new(bytes.Buffer)\n\n\tcmd := exec.Command(cmdName, args...)\n\tcmd.Dir = dir\n\tcmd.Stdout = bufOut\n\tcmd.Stderr = bufErr\n\n\terr := cmd.Run()\n\treturn bufOut.Bytes(), bufErr.Bytes(), err\n}\n\n// ExecCmdBytes executes system command\n// and return stdout, stderr in bytes type, along with possible error.\nfunc ExecCmdBytes(cmdName string, args ...string) ([]byte, []byte, error) {\n\treturn ExecCmdDirBytes(\"\", cmdName, args...)\n}\n\n// ExecCmdDir executes system command in given directory\n// and return stdout, stderr in string type, along with possible error.\nfunc ExecCmdDir(dir, cmdName string, args ...string) (string, string, error) {\n\tbufOut, bufErr, err := ExecCmdDirBytes(dir, cmdName, args...)\n\treturn string(bufOut), string(bufErr), err\n}\n\n// ExecCmd executes system command\n// and return stdout, stderr in string type, along with possible error.\nfunc ExecCmd(cmdName string, args ...string) (string, string, error) {\n\treturn ExecCmdDir(\"\", cmdName, args...)\n}\n\n// _________ .__ .____\n// \\_ ___ \\ ____ | | ___________ | | ____ ____\n// / \\ \\/ / _ \\| | / _ \\_ __ \\ | | / _ \\ / ___\\\n// \\ \\___( <_> ) |_( <_> ) | \\/ | |__( <_> ) /_/ >\n// \\______ /\\____/|____/\\____/|__| |_______ \\____/\\___ /\n// \\/ \\/ /_____/\n\n// Color number constants.\nconst (\n\tGray = uint8(iota + 90)\n\tRed\n\tGreen\n\tYellow\n\tBlue\n\tMagenta\n\t//NRed = uint8(31) // Normal\n\tEndColor = \"\\033[0m\"\n)\n\n// getColorLevel returns colored level string by given level.\nfunc getColorLevel(level string) string {\n\tlevel = strings.ToUpper(level)\n\tswitch level {\n\tcase \"TRAC\":\n\t\treturn fmt.Sprintf(\"\\033[%dm%s\\033[0m\", Blue, level)\n\tcase \"ERRO\":\n\t\treturn fmt.Sprintf(\"\\033[%dm%s\\033[0m\", Red, level)\n\tcase \"WARN\":\n\t\treturn fmt.Sprintf(\"\\033[%dm%s\\033[0m\", Magenta, level)\n\tcase \"SUCC\":\n\t\treturn fmt.Sprintf(\"\\033[%dm%s\\033[0m\", Green, level)\n\tdefault:\n\t\treturn level\n\t}\n}\n\n// ColorLogS colors log and return colored content.\n// Log format: [ error ].\n// Level: TRAC -> blue; ERRO -> red; WARN -> Magenta; SUCC -> green; others -> default.\n// Content: default; path: yellow; error -> red.\n// Level has to be surrounded by \"[\" and \"]\".\n// Highlights have to be surrounded by \"# \" and \" #\"(space), \"#\" will be deleted.\n// Paths have to be surrounded by \"( \" and \" )\"(space).\n// Errors have to be surrounded by \"[ \" and \" ]\"(space).\n// Note: it hasn't support windows yet, contribute is welcome.\nfunc ColorLogS(format string, a ...interface{}) string {\n\tlog := fmt.Sprintf(format, a...)\n\n\tvar clog string\n\n\tif runtime.GOOS != \"windows\" {\n\t\t// Level.\n\t\ti := strings.Index(log, \"]\")\n\t\tif log[0] == '[' && i > -1 {\n\t\t\tclog += \"[\" + getColorLevel(log[1:i]) + \"]\"\n\t\t}\n\n\t\tlog = log[i+1:]\n\n\t\t// Error.\n\t\tlog = strings.Replace(log, \"[ \", fmt.Sprintf(\"[\\033[%dm\", Red), -1)\n\t\tlog = strings.Replace(log, \" ]\", EndColor+\"]\", -1)\n\n\t\t// Path.\n\t\tlog = strings.Replace(log, \"( \", fmt.Sprintf(\"(\\033[%dm\", Yellow), -1)\n\t\tlog = strings.Replace(log, \" )\", EndColor+\")\", -1)\n\n\t\t// Highlights.\n\t\tlog = strings.Replace(log, \"# \", fmt.Sprintf(\"\\033[%dm\", Gray), -1)\n\t\tlog = strings.Replace(log, \" #\", EndColor, -1)\n\n\t} else {\n\t\t// Level.\n\t\ti := strings.Index(log, \"]\")\n\t\tif log[0] == '[' && i > -1 {\n\t\t\tclog += \"[\" + log[1:i] + \"]\"\n\t\t}\n\n\t\tlog = log[i+1:]\n\n\t\t// Error.\n\t\tlog = strings.Replace(log, \"[ \", \"[\", -1)\n\t\tlog = strings.Replace(log, \" ]\", \"]\", -1)\n\n\t\t// Path.\n\t\tlog = strings.Replace(log, \"( \", \"(\", -1)\n\t\tlog = strings.Replace(log, \" )\", \")\", -1)\n\n\t\t// Highlights.\n\t\tlog = strings.Replace(log, \"# \", \"\", -1)\n\t\tlog = strings.Replace(log, \" #\", \"\", -1)\n\t}\n\treturn clog + log\n}\n\n// ColorLog prints colored log to stdout.\n// See color rules in function 'ColorLogS'.\nfunc ColorLog(format string, a ...interface{}) {\n\tfmt.Print(ColorLogS(format, a...))\n}\n" }, { "path": "vendor/github.com/Unknwon/com/convert.go", "content": "// Copyright 2014 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"fmt\"\n\t\"strconv\"\n)\n\n// Convert string to specify type.\ntype StrTo string\n\nfunc (f StrTo) Exist() bool {\n\treturn string(f) != string(0x1E)\n}\n\nfunc (f StrTo) Uint8() (uint8, error) {\n\tv, err := strconv.ParseUint(f.String(), 10, 8)\n\treturn uint8(v), err\n}\n\nfunc (f StrTo) Int() (int, error) {\n\tv, err := strconv.ParseInt(f.String(), 10, 0)\n\treturn int(v), err\n}\n\nfunc (f StrTo) Int64() (int64, error) {\n\tv, err := strconv.ParseInt(f.String(), 10, 64)\n\treturn int64(v), err\n}\n\nfunc (f StrTo) Float64() (float64, error) {\n\tv, err := strconv.ParseFloat(f.String(), 64)\n\treturn float64(v), err\n}\n\nfunc (f StrTo) MustUint8() uint8 {\n\tv, _ := f.Uint8()\n\treturn v\n}\n\nfunc (f StrTo) MustInt() int {\n\tv, _ := f.Int()\n\treturn v\n}\n\nfunc (f StrTo) MustInt64() int64 {\n\tv, _ := f.Int64()\n\treturn v\n}\n\nfunc (f StrTo) MustFloat64() float64 {\n\tv, _ := f.Float64()\n\treturn v\n}\n\nfunc (f StrTo) String() string {\n\tif f.Exist() {\n\t\treturn string(f)\n\t}\n\treturn \"\"\n}\n\n// Convert any type to string.\nfunc ToStr(value interface{}, args ...int) (s string) {\n\tswitch v := value.(type) {\n\tcase bool:\n\t\ts = strconv.FormatBool(v)\n\tcase float32:\n\t\ts = strconv.FormatFloat(float64(v), 'f', argInt(args).Get(0, -1), argInt(args).Get(1, 32))\n\tcase float64:\n\t\ts = strconv.FormatFloat(v, 'f', argInt(args).Get(0, -1), argInt(args).Get(1, 64))\n\tcase int:\n\t\ts = strconv.FormatInt(int64(v), argInt(args).Get(0, 10))\n\tcase int8:\n\t\ts = strconv.FormatInt(int64(v), argInt(args).Get(0, 10))\n\tcase int16:\n\t\ts = strconv.FormatInt(int64(v), argInt(args).Get(0, 10))\n\tcase int32:\n\t\ts = strconv.FormatInt(int64(v), argInt(args).Get(0, 10))\n\tcase int64:\n\t\ts = strconv.FormatInt(v, argInt(args).Get(0, 10))\n\tcase uint:\n\t\ts = strconv.FormatUint(uint64(v), argInt(args).Get(0, 10))\n\tcase uint8:\n\t\ts = strconv.FormatUint(uint64(v), argInt(args).Get(0, 10))\n\tcase uint16:\n\t\ts = strconv.FormatUint(uint64(v), argInt(args).Get(0, 10))\n\tcase uint32:\n\t\ts = strconv.FormatUint(uint64(v), argInt(args).Get(0, 10))\n\tcase uint64:\n\t\ts = strconv.FormatUint(v, argInt(args).Get(0, 10))\n\tcase string:\n\t\ts = v\n\tcase []byte:\n\t\ts = string(v)\n\tdefault:\n\t\ts = fmt.Sprintf(\"%v\", v)\n\t}\n\treturn s\n}\n\ntype argInt []int\n\nfunc (a argInt) Get(i int, args ...int) (r int) {\n\tif i >= 0 && i < len(a) {\n\t\tr = a[i]\n\t} else if len(args) > 0 {\n\t\tr = args[0]\n\t}\n\treturn\n}\n\n// HexStr2int converts hex format string to decimal number.\nfunc HexStr2int(hexStr string) (int, error) {\n\tnum := 0\n\tlength := len(hexStr)\n\tfor i := 0; i < length; i++ {\n\t\tchar := hexStr[length-i-1]\n\t\tfactor := -1\n\n\t\tswitch {\n\t\tcase char >= '0' && char <= '9':\n\t\t\tfactor = int(char) - '0'\n\t\tcase char >= 'a' && char <= 'f':\n\t\t\tfactor = int(char) - 'a' + 10\n\t\tdefault:\n\t\t\treturn -1, fmt.Errorf(\"invalid hex: %s\", string(char))\n\t\t}\n\n\t\tnum += factor * PowInt(16, i)\n\t}\n\treturn num, nil\n}\n\n// Int2HexStr converts decimal number to hex format string.\nfunc Int2HexStr(num int) (hex string) {\n\tif num == 0 {\n\t\treturn \"0\"\n\t}\n\n\tfor num > 0 {\n\t\tr := num % 16\n\n\t\tc := \"?\"\n\t\tif r >= 0 && r <= 9 {\n\t\t\tc = string(r + '0')\n\t\t} else {\n\t\t\tc = string(r + 'a' - 10)\n\t\t}\n\t\thex = c + hex\n\t\tnum = num / 16\n\t}\n\treturn hex\n}\n" }, { "path": "vendor/github.com/Unknwon/com/dir.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"os\"\n\t\"path\"\n\t\"strings\"\n)\n\n// IsDir returns true if given path is a directory,\n// or returns false when it's a file or does not exist.\nfunc IsDir(dir string) bool {\n\tf, e := os.Stat(dir)\n\tif e != nil {\n\t\treturn false\n\t}\n\treturn f.IsDir()\n}\n\nfunc statDir(dirPath, recPath string, includeDir, isDirOnly, followSymlinks bool) ([]string, error) {\n\tdir, err := os.Open(dirPath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer dir.Close()\n\n\tfis, err := dir.Readdir(0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tstatList := make([]string, 0)\n\tfor _, fi := range fis {\n\t\tif strings.Contains(fi.Name(), \".DS_Store\") {\n\t\t\tcontinue\n\t\t}\n\n\t\trelPath := path.Join(recPath, fi.Name())\n\t\tcurPath := path.Join(dirPath, fi.Name())\n\t\tif fi.IsDir() {\n\t\t\tif includeDir {\n\t\t\t\tstatList = append(statList, relPath+\"/\")\n\t\t\t}\n\t\t\ts, err := statDir(curPath, relPath, includeDir, isDirOnly, followSymlinks)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tstatList = append(statList, s...)\n\t\t} else if !isDirOnly {\n\t\t\tstatList = append(statList, relPath)\n\t\t} else if followSymlinks && fi.Mode()&os.ModeSymlink != 0 {\n\t\t\tlink, err := os.Readlink(curPath)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tif IsDir(link) {\n\t\t\t\tif includeDir {\n\t\t\t\t\tstatList = append(statList, relPath+\"/\")\n\t\t\t\t}\n\t\t\t\ts, err := statDir(curPath, relPath, includeDir, isDirOnly, followSymlinks)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tstatList = append(statList, s...)\n\t\t\t}\n\t\t}\n\t}\n\treturn statList, nil\n}\n\n// StatDir gathers information of given directory by depth-first.\n// It returns slice of file list and includes subdirectories if enabled;\n// it returns error and nil slice when error occurs in underlying functions,\n// or given path is not a directory or does not exist.\n//\n// Slice does not include given path itself.\n// If subdirectories is enabled, they will have suffix '/'.\nfunc StatDir(rootPath string, includeDir ...bool) ([]string, error) {\n\tif !IsDir(rootPath) {\n\t\treturn nil, errors.New(\"not a directory or does not exist: \" + rootPath)\n\t}\n\n\tisIncludeDir := false\n\tif len(includeDir) >= 1 {\n\t\tisIncludeDir = includeDir[0]\n\t}\n\treturn statDir(rootPath, \"\", isIncludeDir, false, false)\n}\n\n// LstatDir gathers information of given directory by depth-first.\n// It returns slice of file list, follows symbolic links and includes subdirectories if enabled;\n// it returns error and nil slice when error occurs in underlying functions,\n// or given path is not a directory or does not exist.\n//\n// Slice does not include given path itself.\n// If subdirectories is enabled, they will have suffix '/'.\nfunc LstatDir(rootPath string, includeDir ...bool) ([]string, error) {\n\tif !IsDir(rootPath) {\n\t\treturn nil, errors.New(\"not a directory or does not exist: \" + rootPath)\n\t}\n\n\tisIncludeDir := false\n\tif len(includeDir) >= 1 {\n\t\tisIncludeDir = includeDir[0]\n\t}\n\treturn statDir(rootPath, \"\", isIncludeDir, false, true)\n}\n\n// GetAllSubDirs returns all subdirectories of given root path.\n// Slice does not include given path itself.\nfunc GetAllSubDirs(rootPath string) ([]string, error) {\n\tif !IsDir(rootPath) {\n\t\treturn nil, errors.New(\"not a directory or does not exist: \" + rootPath)\n\t}\n\treturn statDir(rootPath, \"\", true, true, false)\n}\n\n// LgetAllSubDirs returns all subdirectories of given root path, including\n// following symbolic links, if any.\n// Slice does not include given path itself.\nfunc LgetAllSubDirs(rootPath string) ([]string, error) {\n\tif !IsDir(rootPath) {\n\t\treturn nil, errors.New(\"not a directory or does not exist: \" + rootPath)\n\t}\n\treturn statDir(rootPath, \"\", true, true, true)\n}\n\n// GetFileListBySuffix returns an ordered list of file paths.\n// It recognize if given path is a file, and don't do recursive find.\nfunc GetFileListBySuffix(dirPath, suffix string) ([]string, error) {\n\tif !IsExist(dirPath) {\n\t\treturn nil, fmt.Errorf(\"given path does not exist: %s\", dirPath)\n\t} else if IsFile(dirPath) {\n\t\treturn []string{dirPath}, nil\n\t}\n\n\t// Given path is a directory.\n\tdir, err := os.Open(dirPath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfis, err := dir.Readdir(0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfiles := make([]string, 0, len(fis))\n\tfor _, fi := range fis {\n\t\tif strings.HasSuffix(fi.Name(), suffix) {\n\t\t\tfiles = append(files, path.Join(dirPath, fi.Name()))\n\t\t}\n\t}\n\n\treturn files, nil\n}\n\n// CopyDir copy files recursively from source to target directory.\n//\n// The filter accepts a function that process the path info.\n// and should return true for need to filter.\n//\n// It returns error when error occurs in underlying functions.\nfunc CopyDir(srcPath, destPath string, filters ...func(filePath string) bool) error {\n\t// Check if target directory exists.\n\tif IsExist(destPath) {\n\t\treturn errors.New(\"file or directory alreay exists: \" + destPath)\n\t}\n\n\terr := os.MkdirAll(destPath, os.ModePerm)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Gather directory info.\n\tinfos, err := StatDir(srcPath, true)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tvar filter func(filePath string) bool\n\tif len(filters) > 0 {\n\t\tfilter = filters[0]\n\t}\n\n\tfor _, info := range infos {\n\t\tif filter != nil && filter(info) {\n\t\t\tcontinue\n\t\t}\n\n\t\tcurPath := path.Join(destPath, info)\n\t\tif strings.HasSuffix(info, \"/\") {\n\t\t\terr = os.MkdirAll(curPath, os.ModePerm)\n\t\t} else {\n\t\t\terr = Copy(path.Join(srcPath, info), curPath)\n\t\t}\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/Unknwon/com/file.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"math\"\n\t\"os\"\n\t\"path\"\n)\n\n// Storage unit constants.\nconst (\n\tByte = 1\n\tKByte = Byte * 1024\n\tMByte = KByte * 1024\n\tGByte = MByte * 1024\n\tTByte = GByte * 1024\n\tPByte = TByte * 1024\n\tEByte = PByte * 1024\n)\n\nfunc logn(n, b float64) float64 {\n\treturn math.Log(n) / math.Log(b)\n}\n\nfunc humanateBytes(s uint64, base float64, sizes []string) string {\n\tif s < 10 {\n\t\treturn fmt.Sprintf(\"%dB\", s)\n\t}\n\te := math.Floor(logn(float64(s), base))\n\tsuffix := sizes[int(e)]\n\tval := float64(s) / math.Pow(base, math.Floor(e))\n\tf := \"%.0f\"\n\tif val < 10 {\n\t\tf = \"%.1f\"\n\t}\n\n\treturn fmt.Sprintf(f+\"%s\", val, suffix)\n}\n\n// HumaneFileSize calculates the file size and generate user-friendly string.\nfunc HumaneFileSize(s uint64) string {\n\tsizes := []string{\"B\", \"KB\", \"MB\", \"GB\", \"TB\", \"PB\", \"EB\"}\n\treturn humanateBytes(s, 1024, sizes)\n}\n\n// FileMTime returns file modified time and possible error.\nfunc FileMTime(file string) (int64, error) {\n\tf, err := os.Stat(file)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\treturn f.ModTime().Unix(), nil\n}\n\n// FileSize returns file size in bytes and possible error.\nfunc FileSize(file string) (int64, error) {\n\tf, err := os.Stat(file)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\treturn f.Size(), nil\n}\n\n// Copy copies file from source to target path.\nfunc Copy(src, dest string) error {\n\t// Gather file information to set back later.\n\tsi, err := os.Lstat(src)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Handle symbolic link.\n\tif si.Mode()&os.ModeSymlink != 0 {\n\t\ttarget, err := os.Readlink(src)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t// NOTE: os.Chmod and os.Chtimes don't recoganize symbolic link,\n\t\t// which will lead \"no such file or directory\" error.\n\t\treturn os.Symlink(target, dest)\n\t}\n\n\tsr, err := os.Open(src)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer sr.Close()\n\n\tdw, err := os.Create(dest)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer dw.Close()\n\n\tif _, err = io.Copy(dw, sr); err != nil {\n\t\treturn err\n\t}\n\n\t// Set back file information.\n\tif err = os.Chtimes(dest, si.ModTime(), si.ModTime()); err != nil {\n\t\treturn err\n\t}\n\treturn os.Chmod(dest, si.Mode())\n}\n\n// WriteFile writes data to a file named by filename.\n// If the file does not exist, WriteFile creates it\n// and its upper level paths.\nfunc WriteFile(filename string, data []byte) error {\n\tos.MkdirAll(path.Dir(filename), os.ModePerm)\n\treturn ioutil.WriteFile(filename, data, 0655)\n}\n\n// IsFile returns true if given path is a file,\n// or returns false when it's a directory or does not exist.\nfunc IsFile(filePath string) bool {\n\tf, e := os.Stat(filePath)\n\tif e != nil {\n\t\treturn false\n\t}\n\treturn !f.IsDir()\n}\n\n// IsExist checks whether a file or directory exists.\n// It returns false when the file or directory does not exist.\nfunc IsExist(path string) bool {\n\t_, err := os.Stat(path)\n\treturn err == nil || os.IsExist(err)\n}\n" }, { "path": "vendor/github.com/Unknwon/com/html.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"html\"\n\t\"regexp\"\n\t\"strings\"\n)\n\n// Html2JS converts []byte type of HTML content into JS format.\nfunc Html2JS(data []byte) []byte {\n\ts := string(data)\n\ts = strings.Replace(s, `\\`, `\\\\`, -1)\n\ts = strings.Replace(s, \"\\n\", `\\n`, -1)\n\ts = strings.Replace(s, \"\\r\", \"\", -1)\n\ts = strings.Replace(s, \"\\\"\", `\\\"`, -1)\n\ts = strings.Replace(s, \"\", \"<table>\", -1)\n\treturn []byte(s)\n}\n\n// encode html chars to string\nfunc HtmlEncode(str string) string {\n\treturn html.EscapeString(str)\n}\n\n// HtmlDecode decodes string to html chars\nfunc HtmlDecode(str string) string {\n\treturn html.UnescapeString(str)\n}\n\n// strip tags in html string\nfunc StripTags(src string) string {\n\t//去除style,script,html tag\n\tre := regexp.MustCompile(`(?s)<(?:style|script)[^<>]*>.*?|]*>|`)\n\tsrc = re.ReplaceAllString(src, \"\")\n\n\t//trim all spaces(2+) into \\n\n\tre = regexp.MustCompile(`\\s{2,}`)\n\tsrc = re.ReplaceAllString(src, \"\\n\")\n\n\treturn strings.TrimSpace(src)\n}\n\n// change \\n to
\nfunc Nl2br(str string) string {\n\treturn strings.Replace(str, \"\\n\", \"
\", -1)\n}\n" }, { "path": "vendor/github.com/Unknwon/com/http.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"net/http\"\n\t\"os\"\n\t\"path\"\n)\n\ntype NotFoundError struct {\n\tMessage string\n}\n\nfunc (e NotFoundError) Error() string {\n\treturn e.Message\n}\n\ntype RemoteError struct {\n\tHost string\n\tErr error\n}\n\nfunc (e *RemoteError) Error() string {\n\treturn e.Err.Error()\n}\n\nvar UserAgent = \"Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/29.0.1541.0 Safari/537.36\"\n\n// HttpCall makes HTTP method call.\nfunc HttpCall(client *http.Client, method, url string, header http.Header, body io.Reader) (io.ReadCloser, error) {\n\treq, err := http.NewRequest(method, url, body)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treq.Header.Set(\"User-Agent\", UserAgent)\n\tfor k, vs := range header {\n\t\treq.Header[k] = vs\n\t}\n\tresp, err := client.Do(req)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif resp.StatusCode == 200 {\n\t\treturn resp.Body, nil\n\t}\n\tresp.Body.Close()\n\tif resp.StatusCode == 404 { // 403 can be rate limit error. || resp.StatusCode == 403 {\n\t\terr = fmt.Errorf(\"resource not found: %s\", url)\n\t} else {\n\t\terr = fmt.Errorf(\"%s %s -> %d\", method, url, resp.StatusCode)\n\t}\n\treturn nil, err\n}\n\n// HttpGet gets the specified resource.\n// ErrNotFound is returned if the server responds with status 404.\nfunc HttpGet(client *http.Client, url string, header http.Header) (io.ReadCloser, error) {\n\treturn HttpCall(client, \"GET\", url, header, nil)\n}\n\n// HttpPost posts the specified resource.\n// ErrNotFound is returned if the server responds with status 404.\nfunc HttpPost(client *http.Client, url string, header http.Header, body []byte) (io.ReadCloser, error) {\n\treturn HttpCall(client, \"POST\", url, header, bytes.NewBuffer(body))\n}\n\n// HttpGetToFile gets the specified resource and writes to file.\n// ErrNotFound is returned if the server responds with status 404.\nfunc HttpGetToFile(client *http.Client, url string, header http.Header, fileName string) error {\n\trc, err := HttpGet(client, url, header)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer rc.Close()\n\n\tos.MkdirAll(path.Dir(fileName), os.ModePerm)\n\tf, err := os.Create(fileName)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer f.Close()\n\t_, err = io.Copy(f, rc)\n\treturn err\n}\n\n// HttpGetBytes gets the specified resource. ErrNotFound is returned if the server\n// responds with status 404.\nfunc HttpGetBytes(client *http.Client, url string, header http.Header) ([]byte, error) {\n\trc, err := HttpGet(client, url, header)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer rc.Close()\n\treturn ioutil.ReadAll(rc)\n}\n\n// HttpGetJSON gets the specified resource and mapping to struct.\n// ErrNotFound is returned if the server responds with status 404.\nfunc HttpGetJSON(client *http.Client, url string, v interface{}) error {\n\trc, err := HttpGet(client, url, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer rc.Close()\n\terr = json.NewDecoder(rc).Decode(v)\n\tif _, ok := err.(*json.SyntaxError); ok {\n\t\treturn fmt.Errorf(\"JSON syntax error at %s\", url)\n\t}\n\treturn nil\n}\n\n// HttpPostJSON posts the specified resource with struct values,\n// and maps results to struct.\n// ErrNotFound is returned if the server responds with status 404.\nfunc HttpPostJSON(client *http.Client, url string, body, v interface{}) error {\n\tdata, err := json.Marshal(body)\n\tif err != nil {\n\t\treturn err\n\t}\n\trc, err := HttpPost(client, url, http.Header{\"content-type\": []string{\"application/json\"}}, data)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer rc.Close()\n\terr = json.NewDecoder(rc).Decode(v)\n\tif _, ok := err.(*json.SyntaxError); ok {\n\t\treturn fmt.Errorf(\"JSON syntax error at %s\", url)\n\t}\n\treturn nil\n}\n\n// A RawFile describes a file that can be downloaded.\ntype RawFile interface {\n\tName() string\n\tRawUrl() string\n\tData() []byte\n\tSetData([]byte)\n}\n\n// FetchFiles fetches files specified by the rawURL field in parallel.\nfunc FetchFiles(client *http.Client, files []RawFile, header http.Header) error {\n\tch := make(chan error, len(files))\n\tfor i := range files {\n\t\tgo func(i int) {\n\t\t\tp, err := HttpGetBytes(client, files[i].RawUrl(), nil)\n\t\t\tif err != nil {\n\t\t\t\tch <- err\n\t\t\t\treturn\n\t\t\t}\n\t\t\tfiles[i].SetData(p)\n\t\t\tch <- nil\n\t\t}(i)\n\t}\n\tfor _ = range files {\n\t\tif err := <-ch; err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// FetchFilesCurl uses command `curl` to fetch files specified by the rawURL field in parallel.\nfunc FetchFilesCurl(files []RawFile, curlOptions ...string) error {\n\tch := make(chan error, len(files))\n\tfor i := range files {\n\t\tgo func(i int) {\n\t\t\tstdout, _, err := ExecCmd(\"curl\", append(curlOptions, files[i].RawUrl())...)\n\t\t\tif err != nil {\n\t\t\t\tch <- err\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tfiles[i].SetData([]byte(stdout))\n\t\t\tch <- nil\n\t\t}(i)\n\t}\n\tfor _ = range files {\n\t\tif err := <-ch; err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/Unknwon/com/math.go", "content": "// Copyright 2014 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\n// PowInt is int type of math.Pow function.\nfunc PowInt(x int, y int) int {\n\tif y <= 0 {\n\t\treturn 1\n\t} else {\n\t\tif y%2 == 0 {\n\t\t\tsqrt := PowInt(x, y/2)\n\t\t\treturn sqrt * sqrt\n\t\t} else {\n\t\t\treturn PowInt(x, y-1) * x\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/Unknwon/com/path.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"errors\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"runtime\"\n\t\"strings\"\n)\n\n// GetGOPATHs returns all paths in GOPATH variable.\nfunc GetGOPATHs() []string {\n\tgopath := os.Getenv(\"GOPATH\")\n\tvar paths []string\n\tif runtime.GOOS == \"windows\" {\n\t\tgopath = strings.Replace(gopath, \"\\\\\", \"/\", -1)\n\t\tpaths = strings.Split(gopath, \";\")\n\t} else {\n\t\tpaths = strings.Split(gopath, \":\")\n\t}\n\treturn paths\n}\n\n// GetSrcPath returns app. source code path.\n// It only works when you have src. folder in GOPATH,\n// it returns error not able to locate source folder path.\nfunc GetSrcPath(importPath string) (appPath string, err error) {\n\tpaths := GetGOPATHs()\n\tfor _, p := range paths {\n\t\tif IsExist(p + \"/src/\" + importPath + \"/\") {\n\t\t\tappPath = p + \"/src/\" + importPath + \"/\"\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif len(appPath) == 0 {\n\t\treturn \"\", errors.New(\"Unable to locate source folder path\")\n\t}\n\n\tappPath = filepath.Dir(appPath) + \"/\"\n\tif runtime.GOOS == \"windows\" {\n\t\t// Replace all '\\' to '/'.\n\t\tappPath = strings.Replace(appPath, \"\\\\\", \"/\", -1)\n\t}\n\n\treturn appPath, nil\n}\n\n// HomeDir returns path of '~'(in Linux) on Windows,\n// it returns error when the variable does not exist.\nfunc HomeDir() (home string, err error) {\n\tif runtime.GOOS == \"windows\" {\n\t\thome = os.Getenv(\"USERPROFILE\")\n\t\tif len(home) == 0 {\n\t\t\thome = os.Getenv(\"HOMEDRIVE\") + os.Getenv(\"HOMEPATH\")\n\t\t}\n\t} else {\n\t\thome = os.Getenv(\"HOME\")\n\t}\n\n\tif len(home) == 0 {\n\t\treturn \"\", errors.New(\"Cannot specify home directory because it's empty\")\n\t}\n\n\treturn home, nil\n}\n" }, { "path": "vendor/github.com/Unknwon/com/regex.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport \"regexp\"\n\nconst (\n\tregex_email_pattern = `(?i)[A-Z0-9._%+-]+@(?:[A-Z0-9-]+\\.)+[A-Z]{2,6}`\n\tregex_strict_email_pattern = `(?i)[A-Z0-9!#$%&'*+/=?^_{|}~-]+` +\n\t\t`(?:\\.[A-Z0-9!#$%&'*+/=?^_{|}~-]+)*` +\n\t\t`@(?:[A-Z0-9](?:[A-Z0-9-]*[A-Z0-9])?\\.)+` +\n\t\t`[A-Z0-9](?:[A-Z0-9-]*[A-Z0-9])?`\n\tregex_url_pattern = `(ftp|http|https):\\/\\/(\\w+:{0,1}\\w*@)?(\\S+)(:[0-9]+)?(\\/|\\/([\\w#!:.?+=&%@!\\-\\/]))?`\n)\n\nvar (\n\tregex_email *regexp.Regexp\n\tregex_strict_email *regexp.Regexp\n\tregex_url *regexp.Regexp\n)\n\nfunc init() {\n\tregex_email = regexp.MustCompile(regex_email_pattern)\n\tregex_strict_email = regexp.MustCompile(regex_strict_email_pattern)\n\tregex_url = regexp.MustCompile(regex_url_pattern)\n}\n\n// IsEmail validates string is an email address, if not return false\n// basically validation can match 99% cases\nfunc IsEmail(email string) bool {\n\treturn regex_email.MatchString(email)\n}\n\n// IsEmailRFC validates string is an email address, if not return false\n// this validation omits RFC 2822\nfunc IsEmailRFC(email string) bool {\n\treturn regex_strict_email.MatchString(email)\n}\n\n// IsUrl validates string is a url link, if not return false\n// simple validation can match 99% cases\nfunc IsUrl(url string) bool {\n\treturn regex_url.MatchString(url)\n}\n" }, { "path": "vendor/github.com/Unknwon/com/slice.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"strings\"\n)\n\n// AppendStr appends string to slice with no duplicates.\nfunc AppendStr(strs []string, str string) []string {\n\tfor _, s := range strs {\n\t\tif s == str {\n\t\t\treturn strs\n\t\t}\n\t}\n\treturn append(strs, str)\n}\n\n// CompareSliceStr compares two 'string' type slices.\n// It returns true if elements and order are both the same.\nfunc CompareSliceStr(s1, s2 []string) bool {\n\tif len(s1) != len(s2) {\n\t\treturn false\n\t}\n\n\tfor i := range s1 {\n\t\tif s1[i] != s2[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\n// CompareSliceStrU compares two 'string' type slices.\n// It returns true if elements are the same, and ignores the order.\nfunc CompareSliceStrU(s1, s2 []string) bool {\n\tif len(s1) != len(s2) {\n\t\treturn false\n\t}\n\n\tfor i := range s1 {\n\t\tfor j := len(s2) - 1; j >= 0; j-- {\n\t\t\tif s1[i] == s2[j] {\n\t\t\t\ts2 = append(s2[:j], s2[j+1:]...)\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tif len(s2) > 0 {\n\t\treturn false\n\t}\n\treturn true\n}\n\n// IsSliceContainsStr returns true if the string exists in given slice, ignore case.\nfunc IsSliceContainsStr(sl []string, str string) bool {\n\tstr = strings.ToLower(str)\n\tfor _, s := range sl {\n\t\tif strings.ToLower(s) == str {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// IsSliceContainsInt64 returns true if the int64 exists in given slice.\nfunc IsSliceContainsInt64(sl []int64, i int64) bool {\n\tfor _, s := range sl {\n\t\tif s == i {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n" }, { "path": "vendor/github.com/Unknwon/com/string.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"bytes\"\n\t\"crypto/aes\"\n\t\"crypto/cipher\"\n\t\"crypto/rand\"\n\t\"errors\"\n\tr \"math/rand\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode\"\n\t\"unicode/utf8\"\n)\n\n// AESGCMEncrypt encrypts plaintext with the given key using AES in GCM mode.\nfunc AESGCMEncrypt(key, plaintext []byte) ([]byte, error) {\n\tblock, err := aes.NewCipher(key)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tgcm, err := cipher.NewGCM(block)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tnonce := make([]byte, gcm.NonceSize())\n\tif _, err := rand.Read(nonce); err != nil {\n\t\treturn nil, err\n\t}\n\n\tciphertext := gcm.Seal(nil, nonce, plaintext, nil)\n\treturn append(nonce, ciphertext...), nil\n}\n\n// AESGCMDecrypt decrypts ciphertext with the given key using AES in GCM mode.\nfunc AESGCMDecrypt(key, ciphertext []byte) ([]byte, error) {\n\tblock, err := aes.NewCipher(key)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tgcm, err := cipher.NewGCM(block)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tsize := gcm.NonceSize()\n\tif len(ciphertext)-size <= 0 {\n\t\treturn nil, errors.New(\"Ciphertext is empty\")\n\t}\n\n\tnonce := ciphertext[:size]\n\tciphertext = ciphertext[size:]\n\n\tplainText, err := gcm.Open(nil, nonce, ciphertext, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn plainText, nil\n}\n\n// IsLetter returns true if the 'l' is an English letter.\nfunc IsLetter(l uint8) bool {\n\tn := (l | 0x20) - 'a'\n\tif n >= 0 && n < 26 {\n\t\treturn true\n\t}\n\treturn false\n}\n\n// Expand replaces {k} in template with match[k] or subs[atoi(k)] if k is not in match.\nfunc Expand(template string, match map[string]string, subs ...string) string {\n\tvar p []byte\n\tvar i int\n\tfor {\n\t\ti = strings.Index(template, \"{\")\n\t\tif i < 0 {\n\t\t\tbreak\n\t\t}\n\t\tp = append(p, template[:i]...)\n\t\ttemplate = template[i+1:]\n\t\ti = strings.Index(template, \"}\")\n\t\tif s, ok := match[template[:i]]; ok {\n\t\t\tp = append(p, s...)\n\t\t} else {\n\t\t\tj, _ := strconv.Atoi(template[:i])\n\t\t\tif j >= len(subs) {\n\t\t\t\tp = append(p, []byte(\"Missing\")...)\n\t\t\t} else {\n\t\t\t\tp = append(p, subs[j]...)\n\t\t\t}\n\t\t}\n\t\ttemplate = template[i+1:]\n\t}\n\tp = append(p, template...)\n\treturn string(p)\n}\n\n// Reverse s string, support unicode\nfunc Reverse(s string) string {\n\tn := len(s)\n\trunes := make([]rune, n)\n\tfor _, rune := range s {\n\t\tn--\n\t\trunes[n] = rune\n\t}\n\treturn string(runes[n:])\n}\n\n// RandomCreateBytes generate random []byte by specify chars.\nfunc RandomCreateBytes(n int, alphabets ...byte) []byte {\n\tconst alphanum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\tvar bytes = make([]byte, n)\n\tvar randby bool\n\tif num, err := rand.Read(bytes); num != n || err != nil {\n\t\tr.Seed(time.Now().UnixNano())\n\t\trandby = true\n\t}\n\tfor i, b := range bytes {\n\t\tif len(alphabets) == 0 {\n\t\t\tif randby {\n\t\t\t\tbytes[i] = alphanum[r.Intn(len(alphanum))]\n\t\t\t} else {\n\t\t\t\tbytes[i] = alphanum[b%byte(len(alphanum))]\n\t\t\t}\n\t\t} else {\n\t\t\tif randby {\n\t\t\t\tbytes[i] = alphabets[r.Intn(len(alphabets))]\n\t\t\t} else {\n\t\t\t\tbytes[i] = alphabets[b%byte(len(alphabets))]\n\t\t\t}\n\t\t}\n\t}\n\treturn bytes\n}\n\n// ToSnakeCase can convert all upper case characters in a string to\n// underscore format.\n//\n// Some samples.\n// \"FirstName\" => \"first_name\"\n// \"HTTPServer\" => \"http_server\"\n// \"NoHTTPS\" => \"no_https\"\n// \"GO_PATH\" => \"go_path\"\n// \"GO PATH\" => \"go_path\" // space is converted to underscore.\n// \"GO-PATH\" => \"go_path\" // hyphen is converted to underscore.\n//\n// From https://github.com/huandu/xstrings\nfunc ToSnakeCase(str string) string {\n\tif len(str) == 0 {\n\t\treturn \"\"\n\t}\n\n\tbuf := &bytes.Buffer{}\n\tvar prev, r0, r1 rune\n\tvar size int\n\n\tr0 = '_'\n\n\tfor len(str) > 0 {\n\t\tprev = r0\n\t\tr0, size = utf8.DecodeRuneInString(str)\n\t\tstr = str[size:]\n\n\t\tswitch {\n\t\tcase r0 == utf8.RuneError:\n\t\t\tbuf.WriteByte(byte(str[0]))\n\n\t\tcase unicode.IsUpper(r0):\n\t\t\tif prev != '_' {\n\t\t\t\tbuf.WriteRune('_')\n\t\t\t}\n\n\t\t\tbuf.WriteRune(unicode.ToLower(r0))\n\n\t\t\tif len(str) == 0 {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tr0, size = utf8.DecodeRuneInString(str)\n\t\t\tstr = str[size:]\n\n\t\t\tif !unicode.IsUpper(r0) {\n\t\t\t\tbuf.WriteRune(r0)\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\t// find next non-upper-case character and insert `_` properly.\n\t\t\t// it's designed to convert `HTTPServer` to `http_server`.\n\t\t\t// if there are more than 2 adjacent upper case characters in a word,\n\t\t\t// treat them as an abbreviation plus a normal word.\n\t\t\tfor len(str) > 0 {\n\t\t\t\tr1 = r0\n\t\t\t\tr0, size = utf8.DecodeRuneInString(str)\n\t\t\t\tstr = str[size:]\n\n\t\t\t\tif r0 == utf8.RuneError {\n\t\t\t\t\tbuf.WriteRune(unicode.ToLower(r1))\n\t\t\t\t\tbuf.WriteByte(byte(str[0]))\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\tif !unicode.IsUpper(r0) {\n\t\t\t\t\tif r0 == '_' || r0 == ' ' || r0 == '-' {\n\t\t\t\t\t\tr0 = '_'\n\n\t\t\t\t\t\tbuf.WriteRune(unicode.ToLower(r1))\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbuf.WriteRune('_')\n\t\t\t\t\t\tbuf.WriteRune(unicode.ToLower(r1))\n\t\t\t\t\t\tbuf.WriteRune(r0)\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\tbuf.WriteRune(unicode.ToLower(r1))\n\t\t\t}\n\n\t\t\tif len(str) == 0 || r0 == '_' {\n\t\t\t\tbuf.WriteRune(unicode.ToLower(r0))\n\t\t\t\tbreak\n\t\t\t}\n\n\t\tdefault:\n\t\t\tif r0 == ' ' || r0 == '-' {\n\t\t\t\tr0 = '_'\n\t\t\t}\n\n\t\t\tbuf.WriteRune(r0)\n\t\t}\n\t}\n\n\treturn buf.String()\n}\n" }, { "path": "vendor/github.com/Unknwon/com/time.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"fmt\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\n// Format unix time int64 to string\nfunc Date(ti int64, format string) string {\n\tt := time.Unix(int64(ti), 0)\n\treturn DateT(t, format)\n}\n\n// Format unix time string to string\nfunc DateS(ts string, format string) string {\n\ti, _ := strconv.ParseInt(ts, 10, 64)\n\treturn Date(i, format)\n}\n\n// Format time.Time struct to string\n// MM - month - 01\n// M - month - 1, single bit\n// DD - day - 02\n// D - day 2\n// YYYY - year - 2006\n// YY - year - 06\n// HH - 24 hours - 03\n// H - 24 hours - 3\n// hh - 12 hours - 03\n// h - 12 hours - 3\n// mm - minute - 04\n// m - minute - 4\n// ss - second - 05\n// s - second = 5\nfunc DateT(t time.Time, format string) string {\n\tres := strings.Replace(format, \"MM\", t.Format(\"01\"), -1)\n\tres = strings.Replace(res, \"M\", t.Format(\"1\"), -1)\n\tres = strings.Replace(res, \"DD\", t.Format(\"02\"), -1)\n\tres = strings.Replace(res, \"D\", t.Format(\"2\"), -1)\n\tres = strings.Replace(res, \"YYYY\", t.Format(\"2006\"), -1)\n\tres = strings.Replace(res, \"YY\", t.Format(\"06\"), -1)\n\tres = strings.Replace(res, \"HH\", fmt.Sprintf(\"%02d\", t.Hour()), -1)\n\tres = strings.Replace(res, \"H\", fmt.Sprintf(\"%d\", t.Hour()), -1)\n\tres = strings.Replace(res, \"hh\", t.Format(\"03\"), -1)\n\tres = strings.Replace(res, \"h\", t.Format(\"3\"), -1)\n\tres = strings.Replace(res, \"mm\", t.Format(\"04\"), -1)\n\tres = strings.Replace(res, \"m\", t.Format(\"4\"), -1)\n\tres = strings.Replace(res, \"ss\", t.Format(\"05\"), -1)\n\tres = strings.Replace(res, \"s\", t.Format(\"5\"), -1)\n\treturn res\n}\n\n// DateFormat pattern rules.\nvar datePatterns = []string{\n\t// year\n\t\"Y\", \"2006\", // A full numeric representation of a year, 4 digits Examples: 1999 or 2003\n\t\"y\", \"06\", //A two digit representation of a year Examples: 99 or 03\n\n\t// month\n\t\"m\", \"01\", // Numeric representation of a month, with leading zeros 01 through 12\n\t\"n\", \"1\", // Numeric representation of a month, without leading zeros 1 through 12\n\t\"M\", \"Jan\", // A short textual representation of a month, three letters Jan through Dec\n\t\"F\", \"January\", // A full textual representation of a month, such as January or March January through December\n\n\t// day\n\t\"d\", \"02\", // Day of the month, 2 digits with leading zeros 01 to 31\n\t\"j\", \"2\", // Day of the month without leading zeros 1 to 31\n\n\t// week\n\t\"D\", \"Mon\", // A textual representation of a day, three letters Mon through Sun\n\t\"l\", \"Monday\", // A full textual representation of the day of the week Sunday through Saturday\n\n\t// time\n\t\"g\", \"3\", // 12-hour format of an hour without leading zeros 1 through 12\n\t\"G\", \"15\", // 24-hour format of an hour without leading zeros 0 through 23\n\t\"h\", \"03\", // 12-hour format of an hour with leading zeros 01 through 12\n\t\"H\", \"15\", // 24-hour format of an hour with leading zeros 00 through 23\n\n\t\"a\", \"pm\", // Lowercase Ante meridiem and Post meridiem am or pm\n\t\"A\", \"PM\", // Uppercase Ante meridiem and Post meridiem AM or PM\n\n\t\"i\", \"04\", // Minutes with leading zeros 00 to 59\n\t\"s\", \"05\", // Seconds, with leading zeros 00 through 59\n\n\t// time zone\n\t\"T\", \"MST\",\n\t\"P\", \"-07:00\",\n\t\"O\", \"-0700\",\n\n\t// RFC 2822\n\t\"r\", time.RFC1123Z,\n}\n\n// Parse Date use PHP time format.\nfunc DateParse(dateString, format string) (time.Time, error) {\n\treplacer := strings.NewReplacer(datePatterns...)\n\tformat = replacer.Replace(format)\n\treturn time.ParseInLocation(format, dateString, time.Local)\n}\n" }, { "path": "vendor/github.com/Unknwon/com/url.go", "content": "// Copyright 2013 com authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage com\n\nimport (\n\t\"encoding/base64\"\n\t\"net/url\"\n)\n\n// url encode string, is + not %20\nfunc UrlEncode(str string) string {\n\treturn url.QueryEscape(str)\n}\n\n// url decode string\nfunc UrlDecode(str string) (string, error) {\n\treturn url.QueryUnescape(str)\n}\n\n// base64 encode\nfunc Base64Encode(str string) string {\n\treturn base64.StdEncoding.EncodeToString([]byte(str))\n}\n\n// base64 decode\nfunc Base64Decode(str string) (string, error) {\n\ts, e := base64.StdEncoding.DecodeString(str)\n\treturn string(s), e\n}\n" }, { "path": "vendor/github.com/alecthomas/template/LICENSE", "content": "Copyright (c) 2012 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/alecthomas/template/README.md", "content": "# Go's `text/template` package with newline elision\n\nThis is a fork of Go 1.4's [text/template](http://golang.org/pkg/text/template/) package with one addition: a backslash immediately after a closing delimiter will delete all subsequent newlines until a non-newline.\n\neg.\n\n```\n{{if true}}\\\nhello\n{{end}}\\\n```\n\nWill result in:\n\n```\nhello\\n\n```\n\nRather than:\n\n```\n\\n\nhello\\n\n\\n\n```\n" }, { "path": "vendor/github.com/alecthomas/template/doc.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n/*\nPackage template implements data-driven templates for generating textual output.\n\nTo generate HTML output, see package html/template, which has the same interface\nas this package but automatically secures HTML output against certain attacks.\n\nTemplates are executed by applying them to a data structure. Annotations in the\ntemplate refer to elements of the data structure (typically a field of a struct\nor a key in a map) to control execution and derive values to be displayed.\nExecution of the template walks the structure and sets the cursor, represented\nby a period '.' and called \"dot\", to the value at the current location in the\nstructure as execution proceeds.\n\nThe input text for a template is UTF-8-encoded text in any format.\n\"Actions\"--data evaluations or control structures--are delimited by\n\"{{\" and \"}}\"; all text outside actions is copied to the output unchanged.\nActions may not span newlines, although comments can.\n\nOnce parsed, a template may be executed safely in parallel.\n\nHere is a trivial example that prints \"17 items are made of wool\".\n\n\ttype Inventory struct {\n\t\tMaterial string\n\t\tCount uint\n\t}\n\tsweaters := Inventory{\"wool\", 17}\n\ttmpl, err := template.New(\"test\").Parse(\"{{.Count}} items are made of {{.Material}}\")\n\tif err != nil { panic(err) }\n\terr = tmpl.Execute(os.Stdout, sweaters)\n\tif err != nil { panic(err) }\n\nMore intricate examples appear below.\n\nActions\n\nHere is the list of actions. \"Arguments\" and \"pipelines\" are evaluations of\ndata, defined in detail below.\n\n*/\n//\t{{/* a comment */}}\n//\t\tA comment; discarded. May contain newlines.\n//\t\tComments do not nest and must start and end at the\n//\t\tdelimiters, as shown here.\n/*\n\n\t{{pipeline}}\n\t\tThe default textual representation of the value of the pipeline\n\t\tis copied to the output.\n\n\t{{if pipeline}} T1 {{end}}\n\t\tIf the value of the pipeline is empty, no output is generated;\n\t\totherwise, T1 is executed. The empty values are false, 0, any\n\t\tnil pointer or interface value, and any array, slice, map, or\n\t\tstring of length zero.\n\t\tDot is unaffected.\n\n\t{{if pipeline}} T1 {{else}} T0 {{end}}\n\t\tIf the value of the pipeline is empty, T0 is executed;\n\t\totherwise, T1 is executed. Dot is unaffected.\n\n\t{{if pipeline}} T1 {{else if pipeline}} T0 {{end}}\n\t\tTo simplify the appearance of if-else chains, the else action\n\t\tof an if may include another if directly; the effect is exactly\n\t\tthe same as writing\n\t\t\t{{if pipeline}} T1 {{else}}{{if pipeline}} T0 {{end}}{{end}}\n\n\t{{range pipeline}} T1 {{end}}\n\t\tThe value of the pipeline must be an array, slice, map, or channel.\n\t\tIf the value of the pipeline has length zero, nothing is output;\n\t\totherwise, dot is set to the successive elements of the array,\n\t\tslice, or map and T1 is executed. If the value is a map and the\n\t\tkeys are of basic type with a defined order (\"comparable\"), the\n\t\telements will be visited in sorted key order.\n\n\t{{range pipeline}} T1 {{else}} T0 {{end}}\n\t\tThe value of the pipeline must be an array, slice, map, or channel.\n\t\tIf the value of the pipeline has length zero, dot is unaffected and\n\t\tT0 is executed; otherwise, dot is set to the successive elements\n\t\tof the array, slice, or map and T1 is executed.\n\n\t{{template \"name\"}}\n\t\tThe template with the specified name is executed with nil data.\n\n\t{{template \"name\" pipeline}}\n\t\tThe template with the specified name is executed with dot set\n\t\tto the value of the pipeline.\n\n\t{{with pipeline}} T1 {{end}}\n\t\tIf the value of the pipeline is empty, no output is generated;\n\t\totherwise, dot is set to the value of the pipeline and T1 is\n\t\texecuted.\n\n\t{{with pipeline}} T1 {{else}} T0 {{end}}\n\t\tIf the value of the pipeline is empty, dot is unaffected and T0\n\t\tis executed; otherwise, dot is set to the value of the pipeline\n\t\tand T1 is executed.\n\nArguments\n\nAn argument is a simple value, denoted by one of the following.\n\n\t- A boolean, string, character, integer, floating-point, imaginary\n\t or complex constant in Go syntax. These behave like Go's untyped\n\t constants, although raw strings may not span newlines.\n\t- The keyword nil, representing an untyped Go nil.\n\t- The character '.' (period):\n\t\t.\n\t The result is the value of dot.\n\t- A variable name, which is a (possibly empty) alphanumeric string\n\t preceded by a dollar sign, such as\n\t\t$piOver2\n\t or\n\t\t$\n\t The result is the value of the variable.\n\t Variables are described below.\n\t- The name of a field of the data, which must be a struct, preceded\n\t by a period, such as\n\t\t.Field\n\t The result is the value of the field. Field invocations may be\n\t chained:\n\t .Field1.Field2\n\t Fields can also be evaluated on variables, including chaining:\n\t $x.Field1.Field2\n\t- The name of a key of the data, which must be a map, preceded\n\t by a period, such as\n\t\t.Key\n\t The result is the map element value indexed by the key.\n\t Key invocations may be chained and combined with fields to any\n\t depth:\n\t .Field1.Key1.Field2.Key2\n\t Although the key must be an alphanumeric identifier, unlike with\n\t field names they do not need to start with an upper case letter.\n\t Keys can also be evaluated on variables, including chaining:\n\t $x.key1.key2\n\t- The name of a niladic method of the data, preceded by a period,\n\t such as\n\t\t.Method\n\t The result is the value of invoking the method with dot as the\n\t receiver, dot.Method(). Such a method must have one return value (of\n\t any type) or two return values, the second of which is an error.\n\t If it has two and the returned error is non-nil, execution terminates\n\t and an error is returned to the caller as the value of Execute.\n\t Method invocations may be chained and combined with fields and keys\n\t to any depth:\n\t .Field1.Key1.Method1.Field2.Key2.Method2\n\t Methods can also be evaluated on variables, including chaining:\n\t $x.Method1.Field\n\t- The name of a niladic function, such as\n\t\tfun\n\t The result is the value of invoking the function, fun(). The return\n\t types and values behave as in methods. Functions and function\n\t names are described below.\n\t- A parenthesized instance of one the above, for grouping. The result\n\t may be accessed by a field or map key invocation.\n\t\tprint (.F1 arg1) (.F2 arg2)\n\t\t(.StructValuedMethod \"arg\").Field\n\nArguments may evaluate to any type; if they are pointers the implementation\nautomatically indirects to the base type when required.\nIf an evaluation yields a function value, such as a function-valued\nfield of a struct, the function is not invoked automatically, but it\ncan be used as a truth value for an if action and the like. To invoke\nit, use the call function, defined below.\n\nA pipeline is a possibly chained sequence of \"commands\". A command is a simple\nvalue (argument) or a function or method call, possibly with multiple arguments:\n\n\tArgument\n\t\tThe result is the value of evaluating the argument.\n\t.Method [Argument...]\n\t\tThe method can be alone or the last element of a chain but,\n\t\tunlike methods in the middle of a chain, it can take arguments.\n\t\tThe result is the value of calling the method with the\n\t\targuments:\n\t\t\tdot.Method(Argument1, etc.)\n\tfunctionName [Argument...]\n\t\tThe result is the value of calling the function associated\n\t\twith the name:\n\t\t\tfunction(Argument1, etc.)\n\t\tFunctions and function names are described below.\n\nPipelines\n\nA pipeline may be \"chained\" by separating a sequence of commands with pipeline\ncharacters '|'. In a chained pipeline, the result of the each command is\npassed as the last argument of the following command. The output of the final\ncommand in the pipeline is the value of the pipeline.\n\nThe output of a command will be either one value or two values, the second of\nwhich has type error. If that second value is present and evaluates to\nnon-nil, execution terminates and the error is returned to the caller of\nExecute.\n\nVariables\n\nA pipeline inside an action may initialize a variable to capture the result.\nThe initialization has syntax\n\n\t$variable := pipeline\n\nwhere $variable is the name of the variable. An action that declares a\nvariable produces no output.\n\nIf a \"range\" action initializes a variable, the variable is set to the\nsuccessive elements of the iteration. Also, a \"range\" may declare two\nvariables, separated by a comma:\n\n\trange $index, $element := pipeline\n\nin which case $index and $element are set to the successive values of the\narray/slice index or map key and element, respectively. Note that if there is\nonly one variable, it is assigned the element; this is opposite to the\nconvention in Go range clauses.\n\nA variable's scope extends to the \"end\" action of the control structure (\"if\",\n\"with\", or \"range\") in which it is declared, or to the end of the template if\nthere is no such control structure. A template invocation does not inherit\nvariables from the point of its invocation.\n\nWhen execution begins, $ is set to the data argument passed to Execute, that is,\nto the starting value of dot.\n\nExamples\n\nHere are some example one-line templates demonstrating pipelines and variables.\nAll produce the quoted word \"output\":\n\n\t{{\"\\\"output\\\"\"}}\n\t\tA string constant.\n\t{{`\"output\"`}}\n\t\tA raw string constant.\n\t{{printf \"%q\" \"output\"}}\n\t\tA function call.\n\t{{\"output\" | printf \"%q\"}}\n\t\tA function call whose final argument comes from the previous\n\t\tcommand.\n\t{{printf \"%q\" (print \"out\" \"put\")}}\n\t\tA parenthesized argument.\n\t{{\"put\" | printf \"%s%s\" \"out\" | printf \"%q\"}}\n\t\tA more elaborate call.\n\t{{\"output\" | printf \"%s\" | printf \"%q\"}}\n\t\tA longer chain.\n\t{{with \"output\"}}{{printf \"%q\" .}}{{end}}\n\t\tA with action using dot.\n\t{{with $x := \"output\" | printf \"%q\"}}{{$x}}{{end}}\n\t\tA with action that creates and uses a variable.\n\t{{with $x := \"output\"}}{{printf \"%q\" $x}}{{end}}\n\t\tA with action that uses the variable in another action.\n\t{{with $x := \"output\"}}{{$x | printf \"%q\"}}{{end}}\n\t\tThe same, but pipelined.\n\nFunctions\n\nDuring execution functions are found in two function maps: first in the\ntemplate, then in the global function map. By default, no functions are defined\nin the template but the Funcs method can be used to add them.\n\nPredefined global functions are named as follows.\n\n\tand\n\t\tReturns the boolean AND of its arguments by returning the\n\t\tfirst empty argument or the last argument, that is,\n\t\t\"and x y\" behaves as \"if x then y else x\". All the\n\t\targuments are evaluated.\n\tcall\n\t\tReturns the result of calling the first argument, which\n\t\tmust be a function, with the remaining arguments as parameters.\n\t\tThus \"call .X.Y 1 2\" is, in Go notation, dot.X.Y(1, 2) where\n\t\tY is a func-valued field, map entry, or the like.\n\t\tThe first argument must be the result of an evaluation\n\t\tthat yields a value of function type (as distinct from\n\t\ta predefined function such as print). The function must\n\t\treturn either one or two result values, the second of which\n\t\tis of type error. If the arguments don't match the function\n\t\tor the returned error value is non-nil, execution stops.\n\thtml\n\t\tReturns the escaped HTML equivalent of the textual\n\t\trepresentation of its arguments.\n\tindex\n\t\tReturns the result of indexing its first argument by the\n\t\tfollowing arguments. Thus \"index x 1 2 3\" is, in Go syntax,\n\t\tx[1][2][3]. Each indexed item must be a map, slice, or array.\n\tjs\n\t\tReturns the escaped JavaScript equivalent of the textual\n\t\trepresentation of its arguments.\n\tlen\n\t\tReturns the integer length of its argument.\n\tnot\n\t\tReturns the boolean negation of its single argument.\n\tor\n\t\tReturns the boolean OR of its arguments by returning the\n\t\tfirst non-empty argument or the last argument, that is,\n\t\t\"or x y\" behaves as \"if x then x else y\". All the\n\t\targuments are evaluated.\n\tprint\n\t\tAn alias for fmt.Sprint\n\tprintf\n\t\tAn alias for fmt.Sprintf\n\tprintln\n\t\tAn alias for fmt.Sprintln\n\turlquery\n\t\tReturns the escaped value of the textual representation of\n\t\tits arguments in a form suitable for embedding in a URL query.\n\nThe boolean functions take any zero value to be false and a non-zero\nvalue to be true.\n\nThere is also a set of binary comparison operators defined as\nfunctions:\n\n\teq\n\t\tReturns the boolean truth of arg1 == arg2\n\tne\n\t\tReturns the boolean truth of arg1 != arg2\n\tlt\n\t\tReturns the boolean truth of arg1 < arg2\n\tle\n\t\tReturns the boolean truth of arg1 <= arg2\n\tgt\n\t\tReturns the boolean truth of arg1 > arg2\n\tge\n\t\tReturns the boolean truth of arg1 >= arg2\n\nFor simpler multi-way equality tests, eq (only) accepts two or more\narguments and compares the second and subsequent to the first,\nreturning in effect\n\n\targ1==arg2 || arg1==arg3 || arg1==arg4 ...\n\n(Unlike with || in Go, however, eq is a function call and all the\narguments will be evaluated.)\n\nThe comparison functions work on basic types only (or named basic\ntypes, such as \"type Celsius float32\"). They implement the Go rules\nfor comparison of values, except that size and exact type are\nignored, so any integer value, signed or unsigned, may be compared\nwith any other integer value. (The arithmetic value is compared,\nnot the bit pattern, so all negative integers are less than all\nunsigned integers.) However, as usual, one may not compare an int\nwith a float32 and so on.\n\nAssociated templates\n\nEach template is named by a string specified when it is created. Also, each\ntemplate is associated with zero or more other templates that it may invoke by\nname; such associations are transitive and form a name space of templates.\n\nA template may use a template invocation to instantiate another associated\ntemplate; see the explanation of the \"template\" action above. The name must be\nthat of a template associated with the template that contains the invocation.\n\nNested template definitions\n\nWhen parsing a template, another template may be defined and associated with the\ntemplate being parsed. Template definitions must appear at the top level of the\ntemplate, much like global variables in a Go program.\n\nThe syntax of such definitions is to surround each template declaration with a\n\"define\" and \"end\" action.\n\nThe define action names the template being created by providing a string\nconstant. Here is a simple example:\n\n\t`{{define \"T1\"}}ONE{{end}}\n\t{{define \"T2\"}}TWO{{end}}\n\t{{define \"T3\"}}{{template \"T1\"}} {{template \"T2\"}}{{end}}\n\t{{template \"T3\"}}`\n\nThis defines two templates, T1 and T2, and a third T3 that invokes the other two\nwhen it is executed. Finally it invokes T3. If executed this template will\nproduce the text\n\n\tONE TWO\n\nBy construction, a template may reside in only one association. If it's\nnecessary to have a template addressable from multiple associations, the\ntemplate definition must be parsed multiple times to create distinct *Template\nvalues, or must be copied with the Clone or AddParseTree method.\n\nParse may be called multiple times to assemble the various associated templates;\nsee the ParseFiles and ParseGlob functions and methods for simple ways to parse\nrelated templates stored in files.\n\nA template may be executed directly or through ExecuteTemplate, which executes\nan associated template identified by name. To invoke our example above, we\nmight write,\n\n\terr := tmpl.Execute(os.Stdout, \"no data needed\")\n\tif err != nil {\n\t\tlog.Fatalf(\"execution failed: %s\", err)\n\t}\n\nor to invoke a particular template explicitly by name,\n\n\terr := tmpl.ExecuteTemplate(os.Stdout, \"T2\", \"no data needed\")\n\tif err != nil {\n\t\tlog.Fatalf(\"execution failed: %s\", err)\n\t}\n\n*/\npackage template\n" }, { "path": "vendor/github.com/alecthomas/template/exec.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage template\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"runtime\"\n\t\"sort\"\n\t\"strings\"\n\n\t\"github.com/alecthomas/template/parse\"\n)\n\n// state represents the state of an execution. It's not part of the\n// template so that multiple executions of the same template\n// can execute in parallel.\ntype state struct {\n\ttmpl *Template\n\twr io.Writer\n\tnode parse.Node // current node, for errors\n\tvars []variable // push-down stack of variable values.\n}\n\n// variable holds the dynamic value of a variable such as $, $x etc.\ntype variable struct {\n\tname string\n\tvalue reflect.Value\n}\n\n// push pushes a new variable on the stack.\nfunc (s *state) push(name string, value reflect.Value) {\n\ts.vars = append(s.vars, variable{name, value})\n}\n\n// mark returns the length of the variable stack.\nfunc (s *state) mark() int {\n\treturn len(s.vars)\n}\n\n// pop pops the variable stack up to the mark.\nfunc (s *state) pop(mark int) {\n\ts.vars = s.vars[0:mark]\n}\n\n// setVar overwrites the top-nth variable on the stack. Used by range iterations.\nfunc (s *state) setVar(n int, value reflect.Value) {\n\ts.vars[len(s.vars)-n].value = value\n}\n\n// varValue returns the value of the named variable.\nfunc (s *state) varValue(name string) reflect.Value {\n\tfor i := s.mark() - 1; i >= 0; i-- {\n\t\tif s.vars[i].name == name {\n\t\t\treturn s.vars[i].value\n\t\t}\n\t}\n\ts.errorf(\"undefined variable: %s\", name)\n\treturn zero\n}\n\nvar zero reflect.Value\n\n// at marks the state to be on node n, for error reporting.\nfunc (s *state) at(node parse.Node) {\n\ts.node = node\n}\n\n// doublePercent returns the string with %'s replaced by %%, if necessary,\n// so it can be used safely inside a Printf format string.\nfunc doublePercent(str string) string {\n\tif strings.Contains(str, \"%\") {\n\t\tstr = strings.Replace(str, \"%\", \"%%\", -1)\n\t}\n\treturn str\n}\n\n// errorf formats the error and terminates processing.\nfunc (s *state) errorf(format string, args ...interface{}) {\n\tname := doublePercent(s.tmpl.Name())\n\tif s.node == nil {\n\t\tformat = fmt.Sprintf(\"template: %s: %s\", name, format)\n\t} else {\n\t\tlocation, context := s.tmpl.ErrorContext(s.node)\n\t\tformat = fmt.Sprintf(\"template: %s: executing %q at <%s>: %s\", location, name, doublePercent(context), format)\n\t}\n\tpanic(fmt.Errorf(format, args...))\n}\n\n// errRecover is the handler that turns panics into returns from the top\n// level of Parse.\nfunc errRecover(errp *error) {\n\te := recover()\n\tif e != nil {\n\t\tswitch err := e.(type) {\n\t\tcase runtime.Error:\n\t\t\tpanic(e)\n\t\tcase error:\n\t\t\t*errp = err\n\t\tdefault:\n\t\t\tpanic(e)\n\t\t}\n\t}\n}\n\n// ExecuteTemplate applies the template associated with t that has the given name\n// to the specified data object and writes the output to wr.\n// If an error occurs executing the template or writing its output,\n// execution stops, but partial results may already have been written to\n// the output writer.\n// A template may be executed safely in parallel.\nfunc (t *Template) ExecuteTemplate(wr io.Writer, name string, data interface{}) error {\n\ttmpl := t.tmpl[name]\n\tif tmpl == nil {\n\t\treturn fmt.Errorf(\"template: no template %q associated with template %q\", name, t.name)\n\t}\n\treturn tmpl.Execute(wr, data)\n}\n\n// Execute applies a parsed template to the specified data object,\n// and writes the output to wr.\n// If an error occurs executing the template or writing its output,\n// execution stops, but partial results may already have been written to\n// the output writer.\n// A template may be executed safely in parallel.\nfunc (t *Template) Execute(wr io.Writer, data interface{}) (err error) {\n\tdefer errRecover(&err)\n\tvalue := reflect.ValueOf(data)\n\tstate := &state{\n\t\ttmpl: t,\n\t\twr: wr,\n\t\tvars: []variable{{\"$\", value}},\n\t}\n\tt.init()\n\tif t.Tree == nil || t.Root == nil {\n\t\tvar b bytes.Buffer\n\t\tfor name, tmpl := range t.tmpl {\n\t\t\tif tmpl.Tree == nil || tmpl.Root == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif b.Len() > 0 {\n\t\t\t\tb.WriteString(\", \")\n\t\t\t}\n\t\t\tfmt.Fprintf(&b, \"%q\", name)\n\t\t}\n\t\tvar s string\n\t\tif b.Len() > 0 {\n\t\t\ts = \"; defined templates are: \" + b.String()\n\t\t}\n\t\tstate.errorf(\"%q is an incomplete or empty template%s\", t.Name(), s)\n\t}\n\tstate.walk(value, t.Root)\n\treturn\n}\n\n// Walk functions step through the major pieces of the template structure,\n// generating output as they go.\nfunc (s *state) walk(dot reflect.Value, node parse.Node) {\n\ts.at(node)\n\tswitch node := node.(type) {\n\tcase *parse.ActionNode:\n\t\t// Do not pop variables so they persist until next end.\n\t\t// Also, if the action declares variables, don't print the result.\n\t\tval := s.evalPipeline(dot, node.Pipe)\n\t\tif len(node.Pipe.Decl) == 0 {\n\t\t\ts.printValue(node, val)\n\t\t}\n\tcase *parse.IfNode:\n\t\ts.walkIfOrWith(parse.NodeIf, dot, node.Pipe, node.List, node.ElseList)\n\tcase *parse.ListNode:\n\t\tfor _, node := range node.Nodes {\n\t\t\ts.walk(dot, node)\n\t\t}\n\tcase *parse.RangeNode:\n\t\ts.walkRange(dot, node)\n\tcase *parse.TemplateNode:\n\t\ts.walkTemplate(dot, node)\n\tcase *parse.TextNode:\n\t\tif _, err := s.wr.Write(node.Text); err != nil {\n\t\t\ts.errorf(\"%s\", err)\n\t\t}\n\tcase *parse.WithNode:\n\t\ts.walkIfOrWith(parse.NodeWith, dot, node.Pipe, node.List, node.ElseList)\n\tdefault:\n\t\ts.errorf(\"unknown node: %s\", node)\n\t}\n}\n\n// walkIfOrWith walks an 'if' or 'with' node. The two control structures\n// are identical in behavior except that 'with' sets dot.\nfunc (s *state) walkIfOrWith(typ parse.NodeType, dot reflect.Value, pipe *parse.PipeNode, list, elseList *parse.ListNode) {\n\tdefer s.pop(s.mark())\n\tval := s.evalPipeline(dot, pipe)\n\ttruth, ok := isTrue(val)\n\tif !ok {\n\t\ts.errorf(\"if/with can't use %v\", val)\n\t}\n\tif truth {\n\t\tif typ == parse.NodeWith {\n\t\t\ts.walk(val, list)\n\t\t} else {\n\t\t\ts.walk(dot, list)\n\t\t}\n\t} else if elseList != nil {\n\t\ts.walk(dot, elseList)\n\t}\n}\n\n// isTrue reports whether the value is 'true', in the sense of not the zero of its type,\n// and whether the value has a meaningful truth value.\nfunc isTrue(val reflect.Value) (truth, ok bool) {\n\tif !val.IsValid() {\n\t\t// Something like var x interface{}, never set. It's a form of nil.\n\t\treturn false, true\n\t}\n\tswitch val.Kind() {\n\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\ttruth = val.Len() > 0\n\tcase reflect.Bool:\n\t\ttruth = val.Bool()\n\tcase reflect.Complex64, reflect.Complex128:\n\t\ttruth = val.Complex() != 0\n\tcase reflect.Chan, reflect.Func, reflect.Ptr, reflect.Interface:\n\t\ttruth = !val.IsNil()\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\ttruth = val.Int() != 0\n\tcase reflect.Float32, reflect.Float64:\n\t\ttruth = val.Float() != 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\ttruth = val.Uint() != 0\n\tcase reflect.Struct:\n\t\ttruth = true // Struct values are always true.\n\tdefault:\n\t\treturn\n\t}\n\treturn truth, true\n}\n\nfunc (s *state) walkRange(dot reflect.Value, r *parse.RangeNode) {\n\ts.at(r)\n\tdefer s.pop(s.mark())\n\tval, _ := indirect(s.evalPipeline(dot, r.Pipe))\n\t// mark top of stack before any variables in the body are pushed.\n\tmark := s.mark()\n\toneIteration := func(index, elem reflect.Value) {\n\t\t// Set top var (lexically the second if there are two) to the element.\n\t\tif len(r.Pipe.Decl) > 0 {\n\t\t\ts.setVar(1, elem)\n\t\t}\n\t\t// Set next var (lexically the first if there are two) to the index.\n\t\tif len(r.Pipe.Decl) > 1 {\n\t\t\ts.setVar(2, index)\n\t\t}\n\t\ts.walk(elem, r.List)\n\t\ts.pop(mark)\n\t}\n\tswitch val.Kind() {\n\tcase reflect.Array, reflect.Slice:\n\t\tif val.Len() == 0 {\n\t\t\tbreak\n\t\t}\n\t\tfor i := 0; i < val.Len(); i++ {\n\t\t\toneIteration(reflect.ValueOf(i), val.Index(i))\n\t\t}\n\t\treturn\n\tcase reflect.Map:\n\t\tif val.Len() == 0 {\n\t\t\tbreak\n\t\t}\n\t\tfor _, key := range sortKeys(val.MapKeys()) {\n\t\t\toneIteration(key, val.MapIndex(key))\n\t\t}\n\t\treturn\n\tcase reflect.Chan:\n\t\tif val.IsNil() {\n\t\t\tbreak\n\t\t}\n\t\ti := 0\n\t\tfor ; ; i++ {\n\t\t\telem, ok := val.Recv()\n\t\t\tif !ok {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\toneIteration(reflect.ValueOf(i), elem)\n\t\t}\n\t\tif i == 0 {\n\t\t\tbreak\n\t\t}\n\t\treturn\n\tcase reflect.Invalid:\n\t\tbreak // An invalid value is likely a nil map, etc. and acts like an empty map.\n\tdefault:\n\t\ts.errorf(\"range can't iterate over %v\", val)\n\t}\n\tif r.ElseList != nil {\n\t\ts.walk(dot, r.ElseList)\n\t}\n}\n\nfunc (s *state) walkTemplate(dot reflect.Value, t *parse.TemplateNode) {\n\ts.at(t)\n\ttmpl := s.tmpl.tmpl[t.Name]\n\tif tmpl == nil {\n\t\ts.errorf(\"template %q not defined\", t.Name)\n\t}\n\t// Variables declared by the pipeline persist.\n\tdot = s.evalPipeline(dot, t.Pipe)\n\tnewState := *s\n\tnewState.tmpl = tmpl\n\t// No dynamic scoping: template invocations inherit no variables.\n\tnewState.vars = []variable{{\"$\", dot}}\n\tnewState.walk(dot, tmpl.Root)\n}\n\n// Eval functions evaluate pipelines, commands, and their elements and extract\n// values from the data structure by examining fields, calling methods, and so on.\n// The printing of those values happens only through walk functions.\n\n// evalPipeline returns the value acquired by evaluating a pipeline. If the\n// pipeline has a variable declaration, the variable will be pushed on the\n// stack. Callers should therefore pop the stack after they are finished\n// executing commands depending on the pipeline value.\nfunc (s *state) evalPipeline(dot reflect.Value, pipe *parse.PipeNode) (value reflect.Value) {\n\tif pipe == nil {\n\t\treturn\n\t}\n\ts.at(pipe)\n\tfor _, cmd := range pipe.Cmds {\n\t\tvalue = s.evalCommand(dot, cmd, value) // previous value is this one's final arg.\n\t\t// If the object has type interface{}, dig down one level to the thing inside.\n\t\tif value.Kind() == reflect.Interface && value.Type().NumMethod() == 0 {\n\t\t\tvalue = reflect.ValueOf(value.Interface()) // lovely!\n\t\t}\n\t}\n\tfor _, variable := range pipe.Decl {\n\t\ts.push(variable.Ident[0], value)\n\t}\n\treturn value\n}\n\nfunc (s *state) notAFunction(args []parse.Node, final reflect.Value) {\n\tif len(args) > 1 || final.IsValid() {\n\t\ts.errorf(\"can't give argument to non-function %s\", args[0])\n\t}\n}\n\nfunc (s *state) evalCommand(dot reflect.Value, cmd *parse.CommandNode, final reflect.Value) reflect.Value {\n\tfirstWord := cmd.Args[0]\n\tswitch n := firstWord.(type) {\n\tcase *parse.FieldNode:\n\t\treturn s.evalFieldNode(dot, n, cmd.Args, final)\n\tcase *parse.ChainNode:\n\t\treturn s.evalChainNode(dot, n, cmd.Args, final)\n\tcase *parse.IdentifierNode:\n\t\t// Must be a function.\n\t\treturn s.evalFunction(dot, n, cmd, cmd.Args, final)\n\tcase *parse.PipeNode:\n\t\t// Parenthesized pipeline. The arguments are all inside the pipeline; final is ignored.\n\t\treturn s.evalPipeline(dot, n)\n\tcase *parse.VariableNode:\n\t\treturn s.evalVariableNode(dot, n, cmd.Args, final)\n\t}\n\ts.at(firstWord)\n\ts.notAFunction(cmd.Args, final)\n\tswitch word := firstWord.(type) {\n\tcase *parse.BoolNode:\n\t\treturn reflect.ValueOf(word.True)\n\tcase *parse.DotNode:\n\t\treturn dot\n\tcase *parse.NilNode:\n\t\ts.errorf(\"nil is not a command\")\n\tcase *parse.NumberNode:\n\t\treturn s.idealConstant(word)\n\tcase *parse.StringNode:\n\t\treturn reflect.ValueOf(word.Text)\n\t}\n\ts.errorf(\"can't evaluate command %q\", firstWord)\n\tpanic(\"not reached\")\n}\n\n// idealConstant is called to return the value of a number in a context where\n// we don't know the type. In that case, the syntax of the number tells us\n// its type, and we use Go rules to resolve. Note there is no such thing as\n// a uint ideal constant in this situation - the value must be of int type.\nfunc (s *state) idealConstant(constant *parse.NumberNode) reflect.Value {\n\t// These are ideal constants but we don't know the type\n\t// and we have no context. (If it was a method argument,\n\t// we'd know what we need.) The syntax guides us to some extent.\n\ts.at(constant)\n\tswitch {\n\tcase constant.IsComplex:\n\t\treturn reflect.ValueOf(constant.Complex128) // incontrovertible.\n\tcase constant.IsFloat && !isHexConstant(constant.Text) && strings.IndexAny(constant.Text, \".eE\") >= 0:\n\t\treturn reflect.ValueOf(constant.Float64)\n\tcase constant.IsInt:\n\t\tn := int(constant.Int64)\n\t\tif int64(n) != constant.Int64 {\n\t\t\ts.errorf(\"%s overflows int\", constant.Text)\n\t\t}\n\t\treturn reflect.ValueOf(n)\n\tcase constant.IsUint:\n\t\ts.errorf(\"%s overflows int\", constant.Text)\n\t}\n\treturn zero\n}\n\nfunc isHexConstant(s string) bool {\n\treturn len(s) > 2 && s[0] == '0' && (s[1] == 'x' || s[1] == 'X')\n}\n\nfunc (s *state) evalFieldNode(dot reflect.Value, field *parse.FieldNode, args []parse.Node, final reflect.Value) reflect.Value {\n\ts.at(field)\n\treturn s.evalFieldChain(dot, dot, field, field.Ident, args, final)\n}\n\nfunc (s *state) evalChainNode(dot reflect.Value, chain *parse.ChainNode, args []parse.Node, final reflect.Value) reflect.Value {\n\ts.at(chain)\n\t// (pipe).Field1.Field2 has pipe as .Node, fields as .Field. Eval the pipeline, then the fields.\n\tpipe := s.evalArg(dot, nil, chain.Node)\n\tif len(chain.Field) == 0 {\n\t\ts.errorf(\"internal error: no fields in evalChainNode\")\n\t}\n\treturn s.evalFieldChain(dot, pipe, chain, chain.Field, args, final)\n}\n\nfunc (s *state) evalVariableNode(dot reflect.Value, variable *parse.VariableNode, args []parse.Node, final reflect.Value) reflect.Value {\n\t// $x.Field has $x as the first ident, Field as the second. Eval the var, then the fields.\n\ts.at(variable)\n\tvalue := s.varValue(variable.Ident[0])\n\tif len(variable.Ident) == 1 {\n\t\ts.notAFunction(args, final)\n\t\treturn value\n\t}\n\treturn s.evalFieldChain(dot, value, variable, variable.Ident[1:], args, final)\n}\n\n// evalFieldChain evaluates .X.Y.Z possibly followed by arguments.\n// dot is the environment in which to evaluate arguments, while\n// receiver is the value being walked along the chain.\nfunc (s *state) evalFieldChain(dot, receiver reflect.Value, node parse.Node, ident []string, args []parse.Node, final reflect.Value) reflect.Value {\n\tn := len(ident)\n\tfor i := 0; i < n-1; i++ {\n\t\treceiver = s.evalField(dot, ident[i], node, nil, zero, receiver)\n\t}\n\t// Now if it's a method, it gets the arguments.\n\treturn s.evalField(dot, ident[n-1], node, args, final, receiver)\n}\n\nfunc (s *state) evalFunction(dot reflect.Value, node *parse.IdentifierNode, cmd parse.Node, args []parse.Node, final reflect.Value) reflect.Value {\n\ts.at(node)\n\tname := node.Ident\n\tfunction, ok := findFunction(name, s.tmpl)\n\tif !ok {\n\t\ts.errorf(\"%q is not a defined function\", name)\n\t}\n\treturn s.evalCall(dot, function, cmd, name, args, final)\n}\n\n// evalField evaluates an expression like (.Field) or (.Field arg1 arg2).\n// The 'final' argument represents the return value from the preceding\n// value of the pipeline, if any.\nfunc (s *state) evalField(dot reflect.Value, fieldName string, node parse.Node, args []parse.Node, final, receiver reflect.Value) reflect.Value {\n\tif !receiver.IsValid() {\n\t\treturn zero\n\t}\n\ttyp := receiver.Type()\n\treceiver, _ = indirect(receiver)\n\t// Unless it's an interface, need to get to a value of type *T to guarantee\n\t// we see all methods of T and *T.\n\tptr := receiver\n\tif ptr.Kind() != reflect.Interface && ptr.CanAddr() {\n\t\tptr = ptr.Addr()\n\t}\n\tif method := ptr.MethodByName(fieldName); method.IsValid() {\n\t\treturn s.evalCall(dot, method, node, fieldName, args, final)\n\t}\n\thasArgs := len(args) > 1 || final.IsValid()\n\t// It's not a method; must be a field of a struct or an element of a map. The receiver must not be nil.\n\treceiver, isNil := indirect(receiver)\n\tif isNil {\n\t\ts.errorf(\"nil pointer evaluating %s.%s\", typ, fieldName)\n\t}\n\tswitch receiver.Kind() {\n\tcase reflect.Struct:\n\t\ttField, ok := receiver.Type().FieldByName(fieldName)\n\t\tif ok {\n\t\t\tfield := receiver.FieldByIndex(tField.Index)\n\t\t\tif tField.PkgPath != \"\" { // field is unexported\n\t\t\t\ts.errorf(\"%s is an unexported field of struct type %s\", fieldName, typ)\n\t\t\t}\n\t\t\t// If it's a function, we must call it.\n\t\t\tif hasArgs {\n\t\t\t\ts.errorf(\"%s has arguments but cannot be invoked as function\", fieldName)\n\t\t\t}\n\t\t\treturn field\n\t\t}\n\t\ts.errorf(\"%s is not a field of struct type %s\", fieldName, typ)\n\tcase reflect.Map:\n\t\t// If it's a map, attempt to use the field name as a key.\n\t\tnameVal := reflect.ValueOf(fieldName)\n\t\tif nameVal.Type().AssignableTo(receiver.Type().Key()) {\n\t\t\tif hasArgs {\n\t\t\t\ts.errorf(\"%s is not a method but has arguments\", fieldName)\n\t\t\t}\n\t\t\treturn receiver.MapIndex(nameVal)\n\t\t}\n\t}\n\ts.errorf(\"can't evaluate field %s in type %s\", fieldName, typ)\n\tpanic(\"not reached\")\n}\n\nvar (\n\terrorType = reflect.TypeOf((*error)(nil)).Elem()\n\tfmtStringerType = reflect.TypeOf((*fmt.Stringer)(nil)).Elem()\n)\n\n// evalCall executes a function or method call. If it's a method, fun already has the receiver bound, so\n// it looks just like a function call. The arg list, if non-nil, includes (in the manner of the shell), arg[0]\n// as the function itself.\nfunc (s *state) evalCall(dot, fun reflect.Value, node parse.Node, name string, args []parse.Node, final reflect.Value) reflect.Value {\n\tif args != nil {\n\t\targs = args[1:] // Zeroth arg is function name/node; not passed to function.\n\t}\n\ttyp := fun.Type()\n\tnumIn := len(args)\n\tif final.IsValid() {\n\t\tnumIn++\n\t}\n\tnumFixed := len(args)\n\tif typ.IsVariadic() {\n\t\tnumFixed = typ.NumIn() - 1 // last arg is the variadic one.\n\t\tif numIn < numFixed {\n\t\t\ts.errorf(\"wrong number of args for %s: want at least %d got %d\", name, typ.NumIn()-1, len(args))\n\t\t}\n\t} else if numIn < typ.NumIn()-1 || !typ.IsVariadic() && numIn != typ.NumIn() {\n\t\ts.errorf(\"wrong number of args for %s: want %d got %d\", name, typ.NumIn(), len(args))\n\t}\n\tif !goodFunc(typ) {\n\t\t// TODO: This could still be a confusing error; maybe goodFunc should provide info.\n\t\ts.errorf(\"can't call method/function %q with %d results\", name, typ.NumOut())\n\t}\n\t// Build the arg list.\n\targv := make([]reflect.Value, numIn)\n\t// Args must be evaluated. Fixed args first.\n\ti := 0\n\tfor ; i < numFixed && i < len(args); i++ {\n\t\targv[i] = s.evalArg(dot, typ.In(i), args[i])\n\t}\n\t// Now the ... args.\n\tif typ.IsVariadic() {\n\t\targType := typ.In(typ.NumIn() - 1).Elem() // Argument is a slice.\n\t\tfor ; i < len(args); i++ {\n\t\t\targv[i] = s.evalArg(dot, argType, args[i])\n\t\t}\n\t}\n\t// Add final value if necessary.\n\tif final.IsValid() {\n\t\tt := typ.In(typ.NumIn() - 1)\n\t\tif typ.IsVariadic() {\n\t\t\tt = t.Elem()\n\t\t}\n\t\targv[i] = s.validateType(final, t)\n\t}\n\tresult := fun.Call(argv)\n\t// If we have an error that is not nil, stop execution and return that error to the caller.\n\tif len(result) == 2 && !result[1].IsNil() {\n\t\ts.at(node)\n\t\ts.errorf(\"error calling %s: %s\", name, result[1].Interface().(error))\n\t}\n\treturn result[0]\n}\n\n// canBeNil reports whether an untyped nil can be assigned to the type. See reflect.Zero.\nfunc canBeNil(typ reflect.Type) bool {\n\tswitch typ.Kind() {\n\tcase reflect.Chan, reflect.Func, reflect.Interface, reflect.Map, reflect.Ptr, reflect.Slice:\n\t\treturn true\n\t}\n\treturn false\n}\n\n// validateType guarantees that the value is valid and assignable to the type.\nfunc (s *state) validateType(value reflect.Value, typ reflect.Type) reflect.Value {\n\tif !value.IsValid() {\n\t\tif typ == nil || canBeNil(typ) {\n\t\t\t// An untyped nil interface{}. Accept as a proper nil value.\n\t\t\treturn reflect.Zero(typ)\n\t\t}\n\t\ts.errorf(\"invalid value; expected %s\", typ)\n\t}\n\tif typ != nil && !value.Type().AssignableTo(typ) {\n\t\tif value.Kind() == reflect.Interface && !value.IsNil() {\n\t\t\tvalue = value.Elem()\n\t\t\tif value.Type().AssignableTo(typ) {\n\t\t\t\treturn value\n\t\t\t}\n\t\t\t// fallthrough\n\t\t}\n\t\t// Does one dereference or indirection work? We could do more, as we\n\t\t// do with method receivers, but that gets messy and method receivers\n\t\t// are much more constrained, so it makes more sense there than here.\n\t\t// Besides, one is almost always all you need.\n\t\tswitch {\n\t\tcase value.Kind() == reflect.Ptr && value.Type().Elem().AssignableTo(typ):\n\t\t\tvalue = value.Elem()\n\t\t\tif !value.IsValid() {\n\t\t\t\ts.errorf(\"dereference of nil pointer of type %s\", typ)\n\t\t\t}\n\t\tcase reflect.PtrTo(value.Type()).AssignableTo(typ) && value.CanAddr():\n\t\t\tvalue = value.Addr()\n\t\tdefault:\n\t\t\ts.errorf(\"wrong type for value; expected %s; got %s\", typ, value.Type())\n\t\t}\n\t}\n\treturn value\n}\n\nfunc (s *state) evalArg(dot reflect.Value, typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tswitch arg := n.(type) {\n\tcase *parse.DotNode:\n\t\treturn s.validateType(dot, typ)\n\tcase *parse.NilNode:\n\t\tif canBeNil(typ) {\n\t\t\treturn reflect.Zero(typ)\n\t\t}\n\t\ts.errorf(\"cannot assign nil to %s\", typ)\n\tcase *parse.FieldNode:\n\t\treturn s.validateType(s.evalFieldNode(dot, arg, []parse.Node{n}, zero), typ)\n\tcase *parse.VariableNode:\n\t\treturn s.validateType(s.evalVariableNode(dot, arg, nil, zero), typ)\n\tcase *parse.PipeNode:\n\t\treturn s.validateType(s.evalPipeline(dot, arg), typ)\n\tcase *parse.IdentifierNode:\n\t\treturn s.evalFunction(dot, arg, arg, nil, zero)\n\tcase *parse.ChainNode:\n\t\treturn s.validateType(s.evalChainNode(dot, arg, nil, zero), typ)\n\t}\n\tswitch typ.Kind() {\n\tcase reflect.Bool:\n\t\treturn s.evalBool(typ, n)\n\tcase reflect.Complex64, reflect.Complex128:\n\t\treturn s.evalComplex(typ, n)\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn s.evalFloat(typ, n)\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn s.evalInteger(typ, n)\n\tcase reflect.Interface:\n\t\tif typ.NumMethod() == 0 {\n\t\t\treturn s.evalEmptyInterface(dot, n)\n\t\t}\n\tcase reflect.String:\n\t\treturn s.evalString(typ, n)\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn s.evalUnsignedInteger(typ, n)\n\t}\n\ts.errorf(\"can't handle %s for arg of type %s\", n, typ)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalBool(typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tif n, ok := n.(*parse.BoolNode); ok {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetBool(n.True)\n\t\treturn value\n\t}\n\ts.errorf(\"expected bool; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalString(typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tif n, ok := n.(*parse.StringNode); ok {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetString(n.Text)\n\t\treturn value\n\t}\n\ts.errorf(\"expected string; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalInteger(typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tif n, ok := n.(*parse.NumberNode); ok && n.IsInt {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetInt(n.Int64)\n\t\treturn value\n\t}\n\ts.errorf(\"expected integer; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalUnsignedInteger(typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tif n, ok := n.(*parse.NumberNode); ok && n.IsUint {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetUint(n.Uint64)\n\t\treturn value\n\t}\n\ts.errorf(\"expected unsigned integer; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalFloat(typ reflect.Type, n parse.Node) reflect.Value {\n\ts.at(n)\n\tif n, ok := n.(*parse.NumberNode); ok && n.IsFloat {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetFloat(n.Float64)\n\t\treturn value\n\t}\n\ts.errorf(\"expected float; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalComplex(typ reflect.Type, n parse.Node) reflect.Value {\n\tif n, ok := n.(*parse.NumberNode); ok && n.IsComplex {\n\t\tvalue := reflect.New(typ).Elem()\n\t\tvalue.SetComplex(n.Complex128)\n\t\treturn value\n\t}\n\ts.errorf(\"expected complex; found %s\", n)\n\tpanic(\"not reached\")\n}\n\nfunc (s *state) evalEmptyInterface(dot reflect.Value, n parse.Node) reflect.Value {\n\ts.at(n)\n\tswitch n := n.(type) {\n\tcase *parse.BoolNode:\n\t\treturn reflect.ValueOf(n.True)\n\tcase *parse.DotNode:\n\t\treturn dot\n\tcase *parse.FieldNode:\n\t\treturn s.evalFieldNode(dot, n, nil, zero)\n\tcase *parse.IdentifierNode:\n\t\treturn s.evalFunction(dot, n, n, nil, zero)\n\tcase *parse.NilNode:\n\t\t// NilNode is handled in evalArg, the only place that calls here.\n\t\ts.errorf(\"evalEmptyInterface: nil (can't happen)\")\n\tcase *parse.NumberNode:\n\t\treturn s.idealConstant(n)\n\tcase *parse.StringNode:\n\t\treturn reflect.ValueOf(n.Text)\n\tcase *parse.VariableNode:\n\t\treturn s.evalVariableNode(dot, n, nil, zero)\n\tcase *parse.PipeNode:\n\t\treturn s.evalPipeline(dot, n)\n\t}\n\ts.errorf(\"can't handle assignment of %s to empty interface argument\", n)\n\tpanic(\"not reached\")\n}\n\n// indirect returns the item at the end of indirection, and a bool to indicate if it's nil.\n// We indirect through pointers and empty interfaces (only) because\n// non-empty interfaces have methods we might need.\nfunc indirect(v reflect.Value) (rv reflect.Value, isNil bool) {\n\tfor ; v.Kind() == reflect.Ptr || v.Kind() == reflect.Interface; v = v.Elem() {\n\t\tif v.IsNil() {\n\t\t\treturn v, true\n\t\t}\n\t\tif v.Kind() == reflect.Interface && v.NumMethod() > 0 {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn v, false\n}\n\n// printValue writes the textual representation of the value to the output of\n// the template.\nfunc (s *state) printValue(n parse.Node, v reflect.Value) {\n\ts.at(n)\n\tiface, ok := printableValue(v)\n\tif !ok {\n\t\ts.errorf(\"can't print %s of type %s\", n, v.Type())\n\t}\n\tfmt.Fprint(s.wr, iface)\n}\n\n// printableValue returns the, possibly indirected, interface value inside v that\n// is best for a call to formatted printer.\nfunc printableValue(v reflect.Value) (interface{}, bool) {\n\tif v.Kind() == reflect.Ptr {\n\t\tv, _ = indirect(v) // fmt.Fprint handles nil.\n\t}\n\tif !v.IsValid() {\n\t\treturn \"\", true\n\t}\n\n\tif !v.Type().Implements(errorType) && !v.Type().Implements(fmtStringerType) {\n\t\tif v.CanAddr() && (reflect.PtrTo(v.Type()).Implements(errorType) || reflect.PtrTo(v.Type()).Implements(fmtStringerType)) {\n\t\t\tv = v.Addr()\n\t\t} else {\n\t\t\tswitch v.Kind() {\n\t\t\tcase reflect.Chan, reflect.Func:\n\t\t\t\treturn nil, false\n\t\t\t}\n\t\t}\n\t}\n\treturn v.Interface(), true\n}\n\n// Types to help sort the keys in a map for reproducible output.\n\ntype rvs []reflect.Value\n\nfunc (x rvs) Len() int { return len(x) }\nfunc (x rvs) Swap(i, j int) { x[i], x[j] = x[j], x[i] }\n\ntype rvInts struct{ rvs }\n\nfunc (x rvInts) Less(i, j int) bool { return x.rvs[i].Int() < x.rvs[j].Int() }\n\ntype rvUints struct{ rvs }\n\nfunc (x rvUints) Less(i, j int) bool { return x.rvs[i].Uint() < x.rvs[j].Uint() }\n\ntype rvFloats struct{ rvs }\n\nfunc (x rvFloats) Less(i, j int) bool { return x.rvs[i].Float() < x.rvs[j].Float() }\n\ntype rvStrings struct{ rvs }\n\nfunc (x rvStrings) Less(i, j int) bool { return x.rvs[i].String() < x.rvs[j].String() }\n\n// sortKeys sorts (if it can) the slice of reflect.Values, which is a slice of map keys.\nfunc sortKeys(v []reflect.Value) []reflect.Value {\n\tif len(v) <= 1 {\n\t\treturn v\n\t}\n\tswitch v[0].Kind() {\n\tcase reflect.Float32, reflect.Float64:\n\t\tsort.Sort(rvFloats{v})\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tsort.Sort(rvInts{v})\n\tcase reflect.String:\n\t\tsort.Sort(rvStrings{v})\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tsort.Sort(rvUints{v})\n\t}\n\treturn v\n}\n" }, { "path": "vendor/github.com/alecthomas/template/funcs.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage template\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/url\"\n\t\"reflect\"\n\t\"strings\"\n\t\"unicode\"\n\t\"unicode/utf8\"\n)\n\n// FuncMap is the type of the map defining the mapping from names to functions.\n// Each function must have either a single return value, or two return values of\n// which the second has type error. In that case, if the second (error)\n// return value evaluates to non-nil during execution, execution terminates and\n// Execute returns that error.\ntype FuncMap map[string]interface{}\n\nvar builtins = FuncMap{\n\t\"and\": and,\n\t\"call\": call,\n\t\"html\": HTMLEscaper,\n\t\"index\": index,\n\t\"js\": JSEscaper,\n\t\"len\": length,\n\t\"not\": not,\n\t\"or\": or,\n\t\"print\": fmt.Sprint,\n\t\"printf\": fmt.Sprintf,\n\t\"println\": fmt.Sprintln,\n\t\"urlquery\": URLQueryEscaper,\n\n\t// Comparisons\n\t\"eq\": eq, // ==\n\t\"ge\": ge, // >=\n\t\"gt\": gt, // >\n\t\"le\": le, // <=\n\t\"lt\": lt, // <\n\t\"ne\": ne, // !=\n}\n\nvar builtinFuncs = createValueFuncs(builtins)\n\n// createValueFuncs turns a FuncMap into a map[string]reflect.Value\nfunc createValueFuncs(funcMap FuncMap) map[string]reflect.Value {\n\tm := make(map[string]reflect.Value)\n\taddValueFuncs(m, funcMap)\n\treturn m\n}\n\n// addValueFuncs adds to values the functions in funcs, converting them to reflect.Values.\nfunc addValueFuncs(out map[string]reflect.Value, in FuncMap) {\n\tfor name, fn := range in {\n\t\tv := reflect.ValueOf(fn)\n\t\tif v.Kind() != reflect.Func {\n\t\t\tpanic(\"value for \" + name + \" not a function\")\n\t\t}\n\t\tif !goodFunc(v.Type()) {\n\t\t\tpanic(fmt.Errorf(\"can't install method/function %q with %d results\", name, v.Type().NumOut()))\n\t\t}\n\t\tout[name] = v\n\t}\n}\n\n// addFuncs adds to values the functions in funcs. It does no checking of the input -\n// call addValueFuncs first.\nfunc addFuncs(out, in FuncMap) {\n\tfor name, fn := range in {\n\t\tout[name] = fn\n\t}\n}\n\n// goodFunc checks that the function or method has the right result signature.\nfunc goodFunc(typ reflect.Type) bool {\n\t// We allow functions with 1 result or 2 results where the second is an error.\n\tswitch {\n\tcase typ.NumOut() == 1:\n\t\treturn true\n\tcase typ.NumOut() == 2 && typ.Out(1) == errorType:\n\t\treturn true\n\t}\n\treturn false\n}\n\n// findFunction looks for a function in the template, and global map.\nfunc findFunction(name string, tmpl *Template) (reflect.Value, bool) {\n\tif tmpl != nil && tmpl.common != nil {\n\t\tif fn := tmpl.execFuncs[name]; fn.IsValid() {\n\t\t\treturn fn, true\n\t\t}\n\t}\n\tif fn := builtinFuncs[name]; fn.IsValid() {\n\t\treturn fn, true\n\t}\n\treturn reflect.Value{}, false\n}\n\n// Indexing.\n\n// index returns the result of indexing its first argument by the following\n// arguments. Thus \"index x 1 2 3\" is, in Go syntax, x[1][2][3]. Each\n// indexed item must be a map, slice, or array.\nfunc index(item interface{}, indices ...interface{}) (interface{}, error) {\n\tv := reflect.ValueOf(item)\n\tfor _, i := range indices {\n\t\tindex := reflect.ValueOf(i)\n\t\tvar isNil bool\n\t\tif v, isNil = indirect(v); isNil {\n\t\t\treturn nil, fmt.Errorf(\"index of nil pointer\")\n\t\t}\n\t\tswitch v.Kind() {\n\t\tcase reflect.Array, reflect.Slice, reflect.String:\n\t\t\tvar x int64\n\t\t\tswitch index.Kind() {\n\t\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\t\t\tx = index.Int()\n\t\t\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\t\t\tx = int64(index.Uint())\n\t\t\tdefault:\n\t\t\t\treturn nil, fmt.Errorf(\"cannot index slice/array with type %s\", index.Type())\n\t\t\t}\n\t\t\tif x < 0 || x >= int64(v.Len()) {\n\t\t\t\treturn nil, fmt.Errorf(\"index out of range: %d\", x)\n\t\t\t}\n\t\t\tv = v.Index(int(x))\n\t\tcase reflect.Map:\n\t\t\tif !index.IsValid() {\n\t\t\t\tindex = reflect.Zero(v.Type().Key())\n\t\t\t}\n\t\t\tif !index.Type().AssignableTo(v.Type().Key()) {\n\t\t\t\treturn nil, fmt.Errorf(\"%s is not index type for %s\", index.Type(), v.Type())\n\t\t\t}\n\t\t\tif x := v.MapIndex(index); x.IsValid() {\n\t\t\t\tv = x\n\t\t\t} else {\n\t\t\t\tv = reflect.Zero(v.Type().Elem())\n\t\t\t}\n\t\tdefault:\n\t\t\treturn nil, fmt.Errorf(\"can't index item of type %s\", v.Type())\n\t\t}\n\t}\n\treturn v.Interface(), nil\n}\n\n// Length\n\n// length returns the length of the item, with an error if it has no defined length.\nfunc length(item interface{}) (int, error) {\n\tv, isNil := indirect(reflect.ValueOf(item))\n\tif isNil {\n\t\treturn 0, fmt.Errorf(\"len of nil pointer\")\n\t}\n\tswitch v.Kind() {\n\tcase reflect.Array, reflect.Chan, reflect.Map, reflect.Slice, reflect.String:\n\t\treturn v.Len(), nil\n\t}\n\treturn 0, fmt.Errorf(\"len of type %s\", v.Type())\n}\n\n// Function invocation\n\n// call returns the result of evaluating the first argument as a function.\n// The function must return 1 result, or 2 results, the second of which is an error.\nfunc call(fn interface{}, args ...interface{}) (interface{}, error) {\n\tv := reflect.ValueOf(fn)\n\ttyp := v.Type()\n\tif typ.Kind() != reflect.Func {\n\t\treturn nil, fmt.Errorf(\"non-function of type %s\", typ)\n\t}\n\tif !goodFunc(typ) {\n\t\treturn nil, fmt.Errorf(\"function called with %d args; should be 1 or 2\", typ.NumOut())\n\t}\n\tnumIn := typ.NumIn()\n\tvar dddType reflect.Type\n\tif typ.IsVariadic() {\n\t\tif len(args) < numIn-1 {\n\t\t\treturn nil, fmt.Errorf(\"wrong number of args: got %d want at least %d\", len(args), numIn-1)\n\t\t}\n\t\tdddType = typ.In(numIn - 1).Elem()\n\t} else {\n\t\tif len(args) != numIn {\n\t\t\treturn nil, fmt.Errorf(\"wrong number of args: got %d want %d\", len(args), numIn)\n\t\t}\n\t}\n\targv := make([]reflect.Value, len(args))\n\tfor i, arg := range args {\n\t\tvalue := reflect.ValueOf(arg)\n\t\t// Compute the expected type. Clumsy because of variadics.\n\t\tvar argType reflect.Type\n\t\tif !typ.IsVariadic() || i < numIn-1 {\n\t\t\targType = typ.In(i)\n\t\t} else {\n\t\t\targType = dddType\n\t\t}\n\t\tif !value.IsValid() && canBeNil(argType) {\n\t\t\tvalue = reflect.Zero(argType)\n\t\t}\n\t\tif !value.Type().AssignableTo(argType) {\n\t\t\treturn nil, fmt.Errorf(\"arg %d has type %s; should be %s\", i, value.Type(), argType)\n\t\t}\n\t\targv[i] = value\n\t}\n\tresult := v.Call(argv)\n\tif len(result) == 2 && !result[1].IsNil() {\n\t\treturn result[0].Interface(), result[1].Interface().(error)\n\t}\n\treturn result[0].Interface(), nil\n}\n\n// Boolean logic.\n\nfunc truth(a interface{}) bool {\n\tt, _ := isTrue(reflect.ValueOf(a))\n\treturn t\n}\n\n// and computes the Boolean AND of its arguments, returning\n// the first false argument it encounters, or the last argument.\nfunc and(arg0 interface{}, args ...interface{}) interface{} {\n\tif !truth(arg0) {\n\t\treturn arg0\n\t}\n\tfor i := range args {\n\t\targ0 = args[i]\n\t\tif !truth(arg0) {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn arg0\n}\n\n// or computes the Boolean OR of its arguments, returning\n// the first true argument it encounters, or the last argument.\nfunc or(arg0 interface{}, args ...interface{}) interface{} {\n\tif truth(arg0) {\n\t\treturn arg0\n\t}\n\tfor i := range args {\n\t\targ0 = args[i]\n\t\tif truth(arg0) {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn arg0\n}\n\n// not returns the Boolean negation of its argument.\nfunc not(arg interface{}) (truth bool) {\n\ttruth, _ = isTrue(reflect.ValueOf(arg))\n\treturn !truth\n}\n\n// Comparison.\n\n// TODO: Perhaps allow comparison between signed and unsigned integers.\n\nvar (\n\terrBadComparisonType = errors.New(\"invalid type for comparison\")\n\terrBadComparison = errors.New(\"incompatible types for comparison\")\n\terrNoComparison = errors.New(\"missing argument for comparison\")\n)\n\ntype kind int\n\nconst (\n\tinvalidKind kind = iota\n\tboolKind\n\tcomplexKind\n\tintKind\n\tfloatKind\n\tintegerKind\n\tstringKind\n\tuintKind\n)\n\nfunc basicKind(v reflect.Value) (kind, error) {\n\tswitch v.Kind() {\n\tcase reflect.Bool:\n\t\treturn boolKind, nil\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn intKind, nil\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn uintKind, nil\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn floatKind, nil\n\tcase reflect.Complex64, reflect.Complex128:\n\t\treturn complexKind, nil\n\tcase reflect.String:\n\t\treturn stringKind, nil\n\t}\n\treturn invalidKind, errBadComparisonType\n}\n\n// eq evaluates the comparison a == b || a == c || ...\nfunc eq(arg1 interface{}, arg2 ...interface{}) (bool, error) {\n\tv1 := reflect.ValueOf(arg1)\n\tk1, err := basicKind(v1)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\tif len(arg2) == 0 {\n\t\treturn false, errNoComparison\n\t}\n\tfor _, arg := range arg2 {\n\t\tv2 := reflect.ValueOf(arg)\n\t\tk2, err := basicKind(v2)\n\t\tif err != nil {\n\t\t\treturn false, err\n\t\t}\n\t\ttruth := false\n\t\tif k1 != k2 {\n\t\t\t// Special case: Can compare integer values regardless of type's sign.\n\t\t\tswitch {\n\t\t\tcase k1 == intKind && k2 == uintKind:\n\t\t\t\ttruth = v1.Int() >= 0 && uint64(v1.Int()) == v2.Uint()\n\t\t\tcase k1 == uintKind && k2 == intKind:\n\t\t\t\ttruth = v2.Int() >= 0 && v1.Uint() == uint64(v2.Int())\n\t\t\tdefault:\n\t\t\t\treturn false, errBadComparison\n\t\t\t}\n\t\t} else {\n\t\t\tswitch k1 {\n\t\t\tcase boolKind:\n\t\t\t\ttruth = v1.Bool() == v2.Bool()\n\t\t\tcase complexKind:\n\t\t\t\ttruth = v1.Complex() == v2.Complex()\n\t\t\tcase floatKind:\n\t\t\t\ttruth = v1.Float() == v2.Float()\n\t\t\tcase intKind:\n\t\t\t\ttruth = v1.Int() == v2.Int()\n\t\t\tcase stringKind:\n\t\t\t\ttruth = v1.String() == v2.String()\n\t\t\tcase uintKind:\n\t\t\t\ttruth = v1.Uint() == v2.Uint()\n\t\t\tdefault:\n\t\t\t\tpanic(\"invalid kind\")\n\t\t\t}\n\t\t}\n\t\tif truth {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\treturn false, nil\n}\n\n// ne evaluates the comparison a != b.\nfunc ne(arg1, arg2 interface{}) (bool, error) {\n\t// != is the inverse of ==.\n\tequal, err := eq(arg1, arg2)\n\treturn !equal, err\n}\n\n// lt evaluates the comparison a < b.\nfunc lt(arg1, arg2 interface{}) (bool, error) {\n\tv1 := reflect.ValueOf(arg1)\n\tk1, err := basicKind(v1)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\tv2 := reflect.ValueOf(arg2)\n\tk2, err := basicKind(v2)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\ttruth := false\n\tif k1 != k2 {\n\t\t// Special case: Can compare integer values regardless of type's sign.\n\t\tswitch {\n\t\tcase k1 == intKind && k2 == uintKind:\n\t\t\ttruth = v1.Int() < 0 || uint64(v1.Int()) < v2.Uint()\n\t\tcase k1 == uintKind && k2 == intKind:\n\t\t\ttruth = v2.Int() >= 0 && v1.Uint() < uint64(v2.Int())\n\t\tdefault:\n\t\t\treturn false, errBadComparison\n\t\t}\n\t} else {\n\t\tswitch k1 {\n\t\tcase boolKind, complexKind:\n\t\t\treturn false, errBadComparisonType\n\t\tcase floatKind:\n\t\t\ttruth = v1.Float() < v2.Float()\n\t\tcase intKind:\n\t\t\ttruth = v1.Int() < v2.Int()\n\t\tcase stringKind:\n\t\t\ttruth = v1.String() < v2.String()\n\t\tcase uintKind:\n\t\t\ttruth = v1.Uint() < v2.Uint()\n\t\tdefault:\n\t\t\tpanic(\"invalid kind\")\n\t\t}\n\t}\n\treturn truth, nil\n}\n\n// le evaluates the comparison <= b.\nfunc le(arg1, arg2 interface{}) (bool, error) {\n\t// <= is < or ==.\n\tlessThan, err := lt(arg1, arg2)\n\tif lessThan || err != nil {\n\t\treturn lessThan, err\n\t}\n\treturn eq(arg1, arg2)\n}\n\n// gt evaluates the comparison a > b.\nfunc gt(arg1, arg2 interface{}) (bool, error) {\n\t// > is the inverse of <=.\n\tlessOrEqual, err := le(arg1, arg2)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\treturn !lessOrEqual, nil\n}\n\n// ge evaluates the comparison a >= b.\nfunc ge(arg1, arg2 interface{}) (bool, error) {\n\t// >= is the inverse of <.\n\tlessThan, err := lt(arg1, arg2)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\treturn !lessThan, nil\n}\n\n// HTML escaping.\n\nvar (\n\thtmlQuot = []byte(\""\") // shorter than \""\"\n\thtmlApos = []byte(\"'\") // shorter than \"'\" and apos was not in HTML until HTML5\n\thtmlAmp = []byte(\"&\")\n\thtmlLt = []byte(\"<\")\n\thtmlGt = []byte(\">\")\n)\n\n// HTMLEscape writes to w the escaped HTML equivalent of the plain text data b.\nfunc HTMLEscape(w io.Writer, b []byte) {\n\tlast := 0\n\tfor i, c := range b {\n\t\tvar html []byte\n\t\tswitch c {\n\t\tcase '\"':\n\t\t\thtml = htmlQuot\n\t\tcase '\\'':\n\t\t\thtml = htmlApos\n\t\tcase '&':\n\t\t\thtml = htmlAmp\n\t\tcase '<':\n\t\t\thtml = htmlLt\n\t\tcase '>':\n\t\t\thtml = htmlGt\n\t\tdefault:\n\t\t\tcontinue\n\t\t}\n\t\tw.Write(b[last:i])\n\t\tw.Write(html)\n\t\tlast = i + 1\n\t}\n\tw.Write(b[last:])\n}\n\n// HTMLEscapeString returns the escaped HTML equivalent of the plain text data s.\nfunc HTMLEscapeString(s string) string {\n\t// Avoid allocation if we can.\n\tif strings.IndexAny(s, `'\"&<>`) < 0 {\n\t\treturn s\n\t}\n\tvar b bytes.Buffer\n\tHTMLEscape(&b, []byte(s))\n\treturn b.String()\n}\n\n// HTMLEscaper returns the escaped HTML equivalent of the textual\n// representation of its arguments.\nfunc HTMLEscaper(args ...interface{}) string {\n\treturn HTMLEscapeString(evalArgs(args))\n}\n\n// JavaScript escaping.\n\nvar (\n\tjsLowUni = []byte(`\\u00`)\n\thex = []byte(\"0123456789ABCDEF\")\n\n\tjsBackslash = []byte(`\\\\`)\n\tjsApos = []byte(`\\'`)\n\tjsQuot = []byte(`\\\"`)\n\tjsLt = []byte(`\\x3C`)\n\tjsGt = []byte(`\\x3E`)\n)\n\n// JSEscape writes to w the escaped JavaScript equivalent of the plain text data b.\nfunc JSEscape(w io.Writer, b []byte) {\n\tlast := 0\n\tfor i := 0; i < len(b); i++ {\n\t\tc := b[i]\n\n\t\tif !jsIsSpecial(rune(c)) {\n\t\t\t// fast path: nothing to do\n\t\t\tcontinue\n\t\t}\n\t\tw.Write(b[last:i])\n\n\t\tif c < utf8.RuneSelf {\n\t\t\t// Quotes, slashes and angle brackets get quoted.\n\t\t\t// Control characters get written as \\u00XX.\n\t\t\tswitch c {\n\t\t\tcase '\\\\':\n\t\t\t\tw.Write(jsBackslash)\n\t\t\tcase '\\'':\n\t\t\t\tw.Write(jsApos)\n\t\t\tcase '\"':\n\t\t\t\tw.Write(jsQuot)\n\t\t\tcase '<':\n\t\t\t\tw.Write(jsLt)\n\t\t\tcase '>':\n\t\t\t\tw.Write(jsGt)\n\t\t\tdefault:\n\t\t\t\tw.Write(jsLowUni)\n\t\t\t\tt, b := c>>4, c&0x0f\n\t\t\t\tw.Write(hex[t : t+1])\n\t\t\t\tw.Write(hex[b : b+1])\n\t\t\t}\n\t\t} else {\n\t\t\t// Unicode rune.\n\t\t\tr, size := utf8.DecodeRune(b[i:])\n\t\t\tif unicode.IsPrint(r) {\n\t\t\t\tw.Write(b[i : i+size])\n\t\t\t} else {\n\t\t\t\tfmt.Fprintf(w, \"\\\\u%04X\", r)\n\t\t\t}\n\t\t\ti += size - 1\n\t\t}\n\t\tlast = i + 1\n\t}\n\tw.Write(b[last:])\n}\n\n// JSEscapeString returns the escaped JavaScript equivalent of the plain text data s.\nfunc JSEscapeString(s string) string {\n\t// Avoid allocation if we can.\n\tif strings.IndexFunc(s, jsIsSpecial) < 0 {\n\t\treturn s\n\t}\n\tvar b bytes.Buffer\n\tJSEscape(&b, []byte(s))\n\treturn b.String()\n}\n\nfunc jsIsSpecial(r rune) bool {\n\tswitch r {\n\tcase '\\\\', '\\'', '\"', '<', '>':\n\t\treturn true\n\t}\n\treturn r < ' ' || utf8.RuneSelf <= r\n}\n\n// JSEscaper returns the escaped JavaScript equivalent of the textual\n// representation of its arguments.\nfunc JSEscaper(args ...interface{}) string {\n\treturn JSEscapeString(evalArgs(args))\n}\n\n// URLQueryEscaper returns the escaped value of the textual representation of\n// its arguments in a form suitable for embedding in a URL query.\nfunc URLQueryEscaper(args ...interface{}) string {\n\treturn url.QueryEscape(evalArgs(args))\n}\n\n// evalArgs formats the list of arguments into a string. It is therefore equivalent to\n//\tfmt.Sprint(args...)\n// except that each argument is indirected (if a pointer), as required,\n// using the same rules as the default string evaluation during template\n// execution.\nfunc evalArgs(args []interface{}) string {\n\tok := false\n\tvar s string\n\t// Fast path for simple common case.\n\tif len(args) == 1 {\n\t\ts, ok = args[0].(string)\n\t}\n\tif !ok {\n\t\tfor i, arg := range args {\n\t\t\ta, ok := printableValue(reflect.ValueOf(arg))\n\t\t\tif ok {\n\t\t\t\targs[i] = a\n\t\t\t} // else left fmt do its thing\n\t\t}\n\t\ts = fmt.Sprint(args...)\n\t}\n\treturn s\n}\n" }, { "path": "vendor/github.com/alecthomas/template/go.mod", "content": "module github.com/alecthomas/template\n" }, { "path": "vendor/github.com/alecthomas/template/helper.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Helper functions to make constructing templates easier.\n\npackage template\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"path/filepath\"\n)\n\n// Functions and methods to parse templates.\n\n// Must is a helper that wraps a call to a function returning (*Template, error)\n// and panics if the error is non-nil. It is intended for use in variable\n// initializations such as\n//\tvar t = template.Must(template.New(\"name\").Parse(\"text\"))\nfunc Must(t *Template, err error) *Template {\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn t\n}\n\n// ParseFiles creates a new Template and parses the template definitions from\n// the named files. The returned template's name will have the (base) name and\n// (parsed) contents of the first file. There must be at least one file.\n// If an error occurs, parsing stops and the returned *Template is nil.\nfunc ParseFiles(filenames ...string) (*Template, error) {\n\treturn parseFiles(nil, filenames...)\n}\n\n// ParseFiles parses the named files and associates the resulting templates with\n// t. If an error occurs, parsing stops and the returned template is nil;\n// otherwise it is t. There must be at least one file.\nfunc (t *Template) ParseFiles(filenames ...string) (*Template, error) {\n\treturn parseFiles(t, filenames...)\n}\n\n// parseFiles is the helper for the method and function. If the argument\n// template is nil, it is created from the first file.\nfunc parseFiles(t *Template, filenames ...string) (*Template, error) {\n\tif len(filenames) == 0 {\n\t\t// Not really a problem, but be consistent.\n\t\treturn nil, fmt.Errorf(\"template: no files named in call to ParseFiles\")\n\t}\n\tfor _, filename := range filenames {\n\t\tb, err := ioutil.ReadFile(filename)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\ts := string(b)\n\t\tname := filepath.Base(filename)\n\t\t// First template becomes return value if not already defined,\n\t\t// and we use that one for subsequent New calls to associate\n\t\t// all the templates together. Also, if this file has the same name\n\t\t// as t, this file becomes the contents of t, so\n\t\t// t, err := New(name).Funcs(xxx).ParseFiles(name)\n\t\t// works. Otherwise we create a new template associated with t.\n\t\tvar tmpl *Template\n\t\tif t == nil {\n\t\t\tt = New(name)\n\t\t}\n\t\tif name == t.Name() {\n\t\t\ttmpl = t\n\t\t} else {\n\t\t\ttmpl = t.New(name)\n\t\t}\n\t\t_, err = tmpl.Parse(s)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn t, nil\n}\n\n// ParseGlob creates a new Template and parses the template definitions from the\n// files identified by the pattern, which must match at least one file. The\n// returned template will have the (base) name and (parsed) contents of the\n// first file matched by the pattern. ParseGlob is equivalent to calling\n// ParseFiles with the list of files matched by the pattern.\nfunc ParseGlob(pattern string) (*Template, error) {\n\treturn parseGlob(nil, pattern)\n}\n\n// ParseGlob parses the template definitions in the files identified by the\n// pattern and associates the resulting templates with t. The pattern is\n// processed by filepath.Glob and must match at least one file. ParseGlob is\n// equivalent to calling t.ParseFiles with the list of files matched by the\n// pattern.\nfunc (t *Template) ParseGlob(pattern string) (*Template, error) {\n\treturn parseGlob(t, pattern)\n}\n\n// parseGlob is the implementation of the function and method ParseGlob.\nfunc parseGlob(t *Template, pattern string) (*Template, error) {\n\tfilenames, err := filepath.Glob(pattern)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(filenames) == 0 {\n\t\treturn nil, fmt.Errorf(\"template: pattern matches no files: %#q\", pattern)\n\t}\n\treturn parseFiles(t, filenames...)\n}\n" }, { "path": "vendor/github.com/alecthomas/template/parse/lex.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage parse\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\t\"unicode\"\n\t\"unicode/utf8\"\n)\n\n// item represents a token or text string returned from the scanner.\ntype item struct {\n\ttyp itemType // The type of this item.\n\tpos Pos // The starting position, in bytes, of this item in the input string.\n\tval string // The value of this item.\n}\n\nfunc (i item) String() string {\n\tswitch {\n\tcase i.typ == itemEOF:\n\t\treturn \"EOF\"\n\tcase i.typ == itemError:\n\t\treturn i.val\n\tcase i.typ > itemKeyword:\n\t\treturn fmt.Sprintf(\"<%s>\", i.val)\n\tcase len(i.val) > 10:\n\t\treturn fmt.Sprintf(\"%.10q...\", i.val)\n\t}\n\treturn fmt.Sprintf(\"%q\", i.val)\n}\n\n// itemType identifies the type of lex items.\ntype itemType int\n\nconst (\n\titemError itemType = iota // error occurred; value is text of error\n\titemBool // boolean constant\n\titemChar // printable ASCII character; grab bag for comma etc.\n\titemCharConstant // character constant\n\titemComplex // complex constant (1+2i); imaginary is just a number\n\titemColonEquals // colon-equals (':=') introducing a declaration\n\titemEOF\n\titemField // alphanumeric identifier starting with '.'\n\titemIdentifier // alphanumeric identifier not starting with '.'\n\titemLeftDelim // left action delimiter\n\titemLeftParen // '(' inside action\n\titemNumber // simple number, including imaginary\n\titemPipe // pipe symbol\n\titemRawString // raw quoted string (includes quotes)\n\titemRightDelim // right action delimiter\n\titemElideNewline // elide newline after right delim\n\titemRightParen // ')' inside action\n\titemSpace // run of spaces separating arguments\n\titemString // quoted string (includes quotes)\n\titemText // plain text\n\titemVariable // variable starting with '$', such as '$' or '$1' or '$hello'\n\t// Keywords appear after all the rest.\n\titemKeyword // used only to delimit the keywords\n\titemDot // the cursor, spelled '.'\n\titemDefine // define keyword\n\titemElse // else keyword\n\titemEnd // end keyword\n\titemIf // if keyword\n\titemNil // the untyped nil constant, easiest to treat as a keyword\n\titemRange // range keyword\n\titemTemplate // template keyword\n\titemWith // with keyword\n)\n\nvar key = map[string]itemType{\n\t\".\": itemDot,\n\t\"define\": itemDefine,\n\t\"else\": itemElse,\n\t\"end\": itemEnd,\n\t\"if\": itemIf,\n\t\"range\": itemRange,\n\t\"nil\": itemNil,\n\t\"template\": itemTemplate,\n\t\"with\": itemWith,\n}\n\nconst eof = -1\n\n// stateFn represents the state of the scanner as a function that returns the next state.\ntype stateFn func(*lexer) stateFn\n\n// lexer holds the state of the scanner.\ntype lexer struct {\n\tname string // the name of the input; used only for error reports\n\tinput string // the string being scanned\n\tleftDelim string // start of action\n\trightDelim string // end of action\n\tstate stateFn // the next lexing function to enter\n\tpos Pos // current position in the input\n\tstart Pos // start position of this item\n\twidth Pos // width of last rune read from input\n\tlastPos Pos // position of most recent item returned by nextItem\n\titems chan item // channel of scanned items\n\tparenDepth int // nesting depth of ( ) exprs\n}\n\n// next returns the next rune in the input.\nfunc (l *lexer) next() rune {\n\tif int(l.pos) >= len(l.input) {\n\t\tl.width = 0\n\t\treturn eof\n\t}\n\tr, w := utf8.DecodeRuneInString(l.input[l.pos:])\n\tl.width = Pos(w)\n\tl.pos += l.width\n\treturn r\n}\n\n// peek returns but does not consume the next rune in the input.\nfunc (l *lexer) peek() rune {\n\tr := l.next()\n\tl.backup()\n\treturn r\n}\n\n// backup steps back one rune. Can only be called once per call of next.\nfunc (l *lexer) backup() {\n\tl.pos -= l.width\n}\n\n// emit passes an item back to the client.\nfunc (l *lexer) emit(t itemType) {\n\tl.items <- item{t, l.start, l.input[l.start:l.pos]}\n\tl.start = l.pos\n}\n\n// ignore skips over the pending input before this point.\nfunc (l *lexer) ignore() {\n\tl.start = l.pos\n}\n\n// accept consumes the next rune if it's from the valid set.\nfunc (l *lexer) accept(valid string) bool {\n\tif strings.IndexRune(valid, l.next()) >= 0 {\n\t\treturn true\n\t}\n\tl.backup()\n\treturn false\n}\n\n// acceptRun consumes a run of runes from the valid set.\nfunc (l *lexer) acceptRun(valid string) {\n\tfor strings.IndexRune(valid, l.next()) >= 0 {\n\t}\n\tl.backup()\n}\n\n// lineNumber reports which line we're on, based on the position of\n// the previous item returned by nextItem. Doing it this way\n// means we don't have to worry about peek double counting.\nfunc (l *lexer) lineNumber() int {\n\treturn 1 + strings.Count(l.input[:l.lastPos], \"\\n\")\n}\n\n// errorf returns an error token and terminates the scan by passing\n// back a nil pointer that will be the next state, terminating l.nextItem.\nfunc (l *lexer) errorf(format string, args ...interface{}) stateFn {\n\tl.items <- item{itemError, l.start, fmt.Sprintf(format, args...)}\n\treturn nil\n}\n\n// nextItem returns the next item from the input.\nfunc (l *lexer) nextItem() item {\n\titem := <-l.items\n\tl.lastPos = item.pos\n\treturn item\n}\n\n// lex creates a new scanner for the input string.\nfunc lex(name, input, left, right string) *lexer {\n\tif left == \"\" {\n\t\tleft = leftDelim\n\t}\n\tif right == \"\" {\n\t\tright = rightDelim\n\t}\n\tl := &lexer{\n\t\tname: name,\n\t\tinput: input,\n\t\tleftDelim: left,\n\t\trightDelim: right,\n\t\titems: make(chan item),\n\t}\n\tgo l.run()\n\treturn l\n}\n\n// run runs the state machine for the lexer.\nfunc (l *lexer) run() {\n\tfor l.state = lexText; l.state != nil; {\n\t\tl.state = l.state(l)\n\t}\n}\n\n// state functions\n\nconst (\n\tleftDelim = \"{{\"\n\trightDelim = \"}}\"\n\tleftComment = \"/*\"\n\trightComment = \"*/\"\n)\n\n// lexText scans until an opening action delimiter, \"{{\".\nfunc lexText(l *lexer) stateFn {\n\tfor {\n\t\tif strings.HasPrefix(l.input[l.pos:], l.leftDelim) {\n\t\t\tif l.pos > l.start {\n\t\t\t\tl.emit(itemText)\n\t\t\t}\n\t\t\treturn lexLeftDelim\n\t\t}\n\t\tif l.next() == eof {\n\t\t\tbreak\n\t\t}\n\t}\n\t// Correctly reached EOF.\n\tif l.pos > l.start {\n\t\tl.emit(itemText)\n\t}\n\tl.emit(itemEOF)\n\treturn nil\n}\n\n// lexLeftDelim scans the left delimiter, which is known to be present.\nfunc lexLeftDelim(l *lexer) stateFn {\n\tl.pos += Pos(len(l.leftDelim))\n\tif strings.HasPrefix(l.input[l.pos:], leftComment) {\n\t\treturn lexComment\n\t}\n\tl.emit(itemLeftDelim)\n\tl.parenDepth = 0\n\treturn lexInsideAction\n}\n\n// lexComment scans a comment. The left comment marker is known to be present.\nfunc lexComment(l *lexer) stateFn {\n\tl.pos += Pos(len(leftComment))\n\ti := strings.Index(l.input[l.pos:], rightComment)\n\tif i < 0 {\n\t\treturn l.errorf(\"unclosed comment\")\n\t}\n\tl.pos += Pos(i + len(rightComment))\n\tif !strings.HasPrefix(l.input[l.pos:], l.rightDelim) {\n\t\treturn l.errorf(\"comment ends before closing delimiter\")\n\n\t}\n\tl.pos += Pos(len(l.rightDelim))\n\tl.ignore()\n\treturn lexText\n}\n\n// lexRightDelim scans the right delimiter, which is known to be present.\nfunc lexRightDelim(l *lexer) stateFn {\n\tl.pos += Pos(len(l.rightDelim))\n\tl.emit(itemRightDelim)\n\tif l.peek() == '\\\\' {\n\t\tl.pos++\n\t\tl.emit(itemElideNewline)\n\t}\n\treturn lexText\n}\n\n// lexInsideAction scans the elements inside action delimiters.\nfunc lexInsideAction(l *lexer) stateFn {\n\t// Either number, quoted string, or identifier.\n\t// Spaces separate arguments; runs of spaces turn into itemSpace.\n\t// Pipe symbols separate and are emitted.\n\tif strings.HasPrefix(l.input[l.pos:], l.rightDelim+\"\\\\\") || strings.HasPrefix(l.input[l.pos:], l.rightDelim) {\n\t\tif l.parenDepth == 0 {\n\t\t\treturn lexRightDelim\n\t\t}\n\t\treturn l.errorf(\"unclosed left paren\")\n\t}\n\tswitch r := l.next(); {\n\tcase r == eof || isEndOfLine(r):\n\t\treturn l.errorf(\"unclosed action\")\n\tcase isSpace(r):\n\t\treturn lexSpace\n\tcase r == ':':\n\t\tif l.next() != '=' {\n\t\t\treturn l.errorf(\"expected :=\")\n\t\t}\n\t\tl.emit(itemColonEquals)\n\tcase r == '|':\n\t\tl.emit(itemPipe)\n\tcase r == '\"':\n\t\treturn lexQuote\n\tcase r == '`':\n\t\treturn lexRawQuote\n\tcase r == '$':\n\t\treturn lexVariable\n\tcase r == '\\'':\n\t\treturn lexChar\n\tcase r == '.':\n\t\t// special look-ahead for \".field\" so we don't break l.backup().\n\t\tif l.pos < Pos(len(l.input)) {\n\t\t\tr := l.input[l.pos]\n\t\t\tif r < '0' || '9' < r {\n\t\t\t\treturn lexField\n\t\t\t}\n\t\t}\n\t\tfallthrough // '.' can start a number.\n\tcase r == '+' || r == '-' || ('0' <= r && r <= '9'):\n\t\tl.backup()\n\t\treturn lexNumber\n\tcase isAlphaNumeric(r):\n\t\tl.backup()\n\t\treturn lexIdentifier\n\tcase r == '(':\n\t\tl.emit(itemLeftParen)\n\t\tl.parenDepth++\n\t\treturn lexInsideAction\n\tcase r == ')':\n\t\tl.emit(itemRightParen)\n\t\tl.parenDepth--\n\t\tif l.parenDepth < 0 {\n\t\t\treturn l.errorf(\"unexpected right paren %#U\", r)\n\t\t}\n\t\treturn lexInsideAction\n\tcase r <= unicode.MaxASCII && unicode.IsPrint(r):\n\t\tl.emit(itemChar)\n\t\treturn lexInsideAction\n\tdefault:\n\t\treturn l.errorf(\"unrecognized character in action: %#U\", r)\n\t}\n\treturn lexInsideAction\n}\n\n// lexSpace scans a run of space characters.\n// One space has already been seen.\nfunc lexSpace(l *lexer) stateFn {\n\tfor isSpace(l.peek()) {\n\t\tl.next()\n\t}\n\tl.emit(itemSpace)\n\treturn lexInsideAction\n}\n\n// lexIdentifier scans an alphanumeric.\nfunc lexIdentifier(l *lexer) stateFn {\nLoop:\n\tfor {\n\t\tswitch r := l.next(); {\n\t\tcase isAlphaNumeric(r):\n\t\t\t// absorb.\n\t\tdefault:\n\t\t\tl.backup()\n\t\t\tword := l.input[l.start:l.pos]\n\t\t\tif !l.atTerminator() {\n\t\t\t\treturn l.errorf(\"bad character %#U\", r)\n\t\t\t}\n\t\t\tswitch {\n\t\t\tcase key[word] > itemKeyword:\n\t\t\t\tl.emit(key[word])\n\t\t\tcase word[0] == '.':\n\t\t\t\tl.emit(itemField)\n\t\t\tcase word == \"true\", word == \"false\":\n\t\t\t\tl.emit(itemBool)\n\t\t\tdefault:\n\t\t\t\tl.emit(itemIdentifier)\n\t\t\t}\n\t\t\tbreak Loop\n\t\t}\n\t}\n\treturn lexInsideAction\n}\n\n// lexField scans a field: .Alphanumeric.\n// The . has been scanned.\nfunc lexField(l *lexer) stateFn {\n\treturn lexFieldOrVariable(l, itemField)\n}\n\n// lexVariable scans a Variable: $Alphanumeric.\n// The $ has been scanned.\nfunc lexVariable(l *lexer) stateFn {\n\tif l.atTerminator() { // Nothing interesting follows -> \"$\".\n\t\tl.emit(itemVariable)\n\t\treturn lexInsideAction\n\t}\n\treturn lexFieldOrVariable(l, itemVariable)\n}\n\n// lexVariable scans a field or variable: [.$]Alphanumeric.\n// The . or $ has been scanned.\nfunc lexFieldOrVariable(l *lexer, typ itemType) stateFn {\n\tif l.atTerminator() { // Nothing interesting follows -> \".\" or \"$\".\n\t\tif typ == itemVariable {\n\t\t\tl.emit(itemVariable)\n\t\t} else {\n\t\t\tl.emit(itemDot)\n\t\t}\n\t\treturn lexInsideAction\n\t}\n\tvar r rune\n\tfor {\n\t\tr = l.next()\n\t\tif !isAlphaNumeric(r) {\n\t\t\tl.backup()\n\t\t\tbreak\n\t\t}\n\t}\n\tif !l.atTerminator() {\n\t\treturn l.errorf(\"bad character %#U\", r)\n\t}\n\tl.emit(typ)\n\treturn lexInsideAction\n}\n\n// atTerminator reports whether the input is at valid termination character to\n// appear after an identifier. Breaks .X.Y into two pieces. Also catches cases\n// like \"$x+2\" not being acceptable without a space, in case we decide one\n// day to implement arithmetic.\nfunc (l *lexer) atTerminator() bool {\n\tr := l.peek()\n\tif isSpace(r) || isEndOfLine(r) {\n\t\treturn true\n\t}\n\tswitch r {\n\tcase eof, '.', ',', '|', ':', ')', '(':\n\t\treturn true\n\t}\n\t// Does r start the delimiter? This can be ambiguous (with delim==\"//\", $x/2 will\n\t// succeed but should fail) but only in extremely rare cases caused by willfully\n\t// bad choice of delimiter.\n\tif rd, _ := utf8.DecodeRuneInString(l.rightDelim); rd == r {\n\t\treturn true\n\t}\n\treturn false\n}\n\n// lexChar scans a character constant. The initial quote is already\n// scanned. Syntax checking is done by the parser.\nfunc lexChar(l *lexer) stateFn {\nLoop:\n\tfor {\n\t\tswitch l.next() {\n\t\tcase '\\\\':\n\t\t\tif r := l.next(); r != eof && r != '\\n' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tfallthrough\n\t\tcase eof, '\\n':\n\t\t\treturn l.errorf(\"unterminated character constant\")\n\t\tcase '\\'':\n\t\t\tbreak Loop\n\t\t}\n\t}\n\tl.emit(itemCharConstant)\n\treturn lexInsideAction\n}\n\n// lexNumber scans a number: decimal, octal, hex, float, or imaginary. This\n// isn't a perfect number scanner - for instance it accepts \".\" and \"0x0.2\"\n// and \"089\" - but when it's wrong the input is invalid and the parser (via\n// strconv) will notice.\nfunc lexNumber(l *lexer) stateFn {\n\tif !l.scanNumber() {\n\t\treturn l.errorf(\"bad number syntax: %q\", l.input[l.start:l.pos])\n\t}\n\tif sign := l.peek(); sign == '+' || sign == '-' {\n\t\t// Complex: 1+2i. No spaces, must end in 'i'.\n\t\tif !l.scanNumber() || l.input[l.pos-1] != 'i' {\n\t\t\treturn l.errorf(\"bad number syntax: %q\", l.input[l.start:l.pos])\n\t\t}\n\t\tl.emit(itemComplex)\n\t} else {\n\t\tl.emit(itemNumber)\n\t}\n\treturn lexInsideAction\n}\n\nfunc (l *lexer) scanNumber() bool {\n\t// Optional leading sign.\n\tl.accept(\"+-\")\n\t// Is it hex?\n\tdigits := \"0123456789\"\n\tif l.accept(\"0\") && l.accept(\"xX\") {\n\t\tdigits = \"0123456789abcdefABCDEF\"\n\t}\n\tl.acceptRun(digits)\n\tif l.accept(\".\") {\n\t\tl.acceptRun(digits)\n\t}\n\tif l.accept(\"eE\") {\n\t\tl.accept(\"+-\")\n\t\tl.acceptRun(\"0123456789\")\n\t}\n\t// Is it imaginary?\n\tl.accept(\"i\")\n\t// Next thing mustn't be alphanumeric.\n\tif isAlphaNumeric(l.peek()) {\n\t\tl.next()\n\t\treturn false\n\t}\n\treturn true\n}\n\n// lexQuote scans a quoted string.\nfunc lexQuote(l *lexer) stateFn {\nLoop:\n\tfor {\n\t\tswitch l.next() {\n\t\tcase '\\\\':\n\t\t\tif r := l.next(); r != eof && r != '\\n' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tfallthrough\n\t\tcase eof, '\\n':\n\t\t\treturn l.errorf(\"unterminated quoted string\")\n\t\tcase '\"':\n\t\t\tbreak Loop\n\t\t}\n\t}\n\tl.emit(itemString)\n\treturn lexInsideAction\n}\n\n// lexRawQuote scans a raw quoted string.\nfunc lexRawQuote(l *lexer) stateFn {\nLoop:\n\tfor {\n\t\tswitch l.next() {\n\t\tcase eof, '\\n':\n\t\t\treturn l.errorf(\"unterminated raw quoted string\")\n\t\tcase '`':\n\t\t\tbreak Loop\n\t\t}\n\t}\n\tl.emit(itemRawString)\n\treturn lexInsideAction\n}\n\n// isSpace reports whether r is a space character.\nfunc isSpace(r rune) bool {\n\treturn r == ' ' || r == '\\t'\n}\n\n// isEndOfLine reports whether r is an end-of-line character.\nfunc isEndOfLine(r rune) bool {\n\treturn r == '\\r' || r == '\\n'\n}\n\n// isAlphaNumeric reports whether r is an alphabetic, digit, or underscore.\nfunc isAlphaNumeric(r rune) bool {\n\treturn r == '_' || unicode.IsLetter(r) || unicode.IsDigit(r)\n}\n" }, { "path": "vendor/github.com/alecthomas/template/parse/node.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Parse nodes.\n\npackage parse\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nvar textFormat = \"%s\" // Changed to \"%q\" in tests for better error messages.\n\n// A Node is an element in the parse tree. The interface is trivial.\n// The interface contains an unexported method so that only\n// types local to this package can satisfy it.\ntype Node interface {\n\tType() NodeType\n\tString() string\n\t// Copy does a deep copy of the Node and all its components.\n\t// To avoid type assertions, some XxxNodes also have specialized\n\t// CopyXxx methods that return *XxxNode.\n\tCopy() Node\n\tPosition() Pos // byte position of start of node in full original input string\n\t// tree returns the containing *Tree.\n\t// It is unexported so all implementations of Node are in this package.\n\ttree() *Tree\n}\n\n// NodeType identifies the type of a parse tree node.\ntype NodeType int\n\n// Pos represents a byte position in the original input text from which\n// this template was parsed.\ntype Pos int\n\nfunc (p Pos) Position() Pos {\n\treturn p\n}\n\n// Type returns itself and provides an easy default implementation\n// for embedding in a Node. Embedded in all non-trivial Nodes.\nfunc (t NodeType) Type() NodeType {\n\treturn t\n}\n\nconst (\n\tNodeText NodeType = iota // Plain text.\n\tNodeAction // A non-control action such as a field evaluation.\n\tNodeBool // A boolean constant.\n\tNodeChain // A sequence of field accesses.\n\tNodeCommand // An element of a pipeline.\n\tNodeDot // The cursor, dot.\n\tnodeElse // An else action. Not added to tree.\n\tnodeEnd // An end action. Not added to tree.\n\tNodeField // A field or method name.\n\tNodeIdentifier // An identifier; always a function name.\n\tNodeIf // An if action.\n\tNodeList // A list of Nodes.\n\tNodeNil // An untyped nil constant.\n\tNodeNumber // A numerical constant.\n\tNodePipe // A pipeline of commands.\n\tNodeRange // A range action.\n\tNodeString // A string constant.\n\tNodeTemplate // A template invocation action.\n\tNodeVariable // A $ variable.\n\tNodeWith // A with action.\n)\n\n// Nodes.\n\n// ListNode holds a sequence of nodes.\ntype ListNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tNodes []Node // The element nodes in lexical order.\n}\n\nfunc (t *Tree) newList(pos Pos) *ListNode {\n\treturn &ListNode{tr: t, NodeType: NodeList, Pos: pos}\n}\n\nfunc (l *ListNode) append(n Node) {\n\tl.Nodes = append(l.Nodes, n)\n}\n\nfunc (l *ListNode) tree() *Tree {\n\treturn l.tr\n}\n\nfunc (l *ListNode) String() string {\n\tb := new(bytes.Buffer)\n\tfor _, n := range l.Nodes {\n\t\tfmt.Fprint(b, n)\n\t}\n\treturn b.String()\n}\n\nfunc (l *ListNode) CopyList() *ListNode {\n\tif l == nil {\n\t\treturn l\n\t}\n\tn := l.tr.newList(l.Pos)\n\tfor _, elem := range l.Nodes {\n\t\tn.append(elem.Copy())\n\t}\n\treturn n\n}\n\nfunc (l *ListNode) Copy() Node {\n\treturn l.CopyList()\n}\n\n// TextNode holds plain text.\ntype TextNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tText []byte // The text; may span newlines.\n}\n\nfunc (t *Tree) newText(pos Pos, text string) *TextNode {\n\treturn &TextNode{tr: t, NodeType: NodeText, Pos: pos, Text: []byte(text)}\n}\n\nfunc (t *TextNode) String() string {\n\treturn fmt.Sprintf(textFormat, t.Text)\n}\n\nfunc (t *TextNode) tree() *Tree {\n\treturn t.tr\n}\n\nfunc (t *TextNode) Copy() Node {\n\treturn &TextNode{tr: t.tr, NodeType: NodeText, Pos: t.Pos, Text: append([]byte{}, t.Text...)}\n}\n\n// PipeNode holds a pipeline with optional declaration\ntype PipeNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tLine int // The line number in the input (deprecated; kept for compatibility)\n\tDecl []*VariableNode // Variable declarations in lexical order.\n\tCmds []*CommandNode // The commands in lexical order.\n}\n\nfunc (t *Tree) newPipeline(pos Pos, line int, decl []*VariableNode) *PipeNode {\n\treturn &PipeNode{tr: t, NodeType: NodePipe, Pos: pos, Line: line, Decl: decl}\n}\n\nfunc (p *PipeNode) append(command *CommandNode) {\n\tp.Cmds = append(p.Cmds, command)\n}\n\nfunc (p *PipeNode) String() string {\n\ts := \"\"\n\tif len(p.Decl) > 0 {\n\t\tfor i, v := range p.Decl {\n\t\t\tif i > 0 {\n\t\t\t\ts += \", \"\n\t\t\t}\n\t\t\ts += v.String()\n\t\t}\n\t\ts += \" := \"\n\t}\n\tfor i, c := range p.Cmds {\n\t\tif i > 0 {\n\t\t\ts += \" | \"\n\t\t}\n\t\ts += c.String()\n\t}\n\treturn s\n}\n\nfunc (p *PipeNode) tree() *Tree {\n\treturn p.tr\n}\n\nfunc (p *PipeNode) CopyPipe() *PipeNode {\n\tif p == nil {\n\t\treturn p\n\t}\n\tvar decl []*VariableNode\n\tfor _, d := range p.Decl {\n\t\tdecl = append(decl, d.Copy().(*VariableNode))\n\t}\n\tn := p.tr.newPipeline(p.Pos, p.Line, decl)\n\tfor _, c := range p.Cmds {\n\t\tn.append(c.Copy().(*CommandNode))\n\t}\n\treturn n\n}\n\nfunc (p *PipeNode) Copy() Node {\n\treturn p.CopyPipe()\n}\n\n// ActionNode holds an action (something bounded by delimiters).\n// Control actions have their own nodes; ActionNode represents simple\n// ones such as field evaluations and parenthesized pipelines.\ntype ActionNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tLine int // The line number in the input (deprecated; kept for compatibility)\n\tPipe *PipeNode // The pipeline in the action.\n}\n\nfunc (t *Tree) newAction(pos Pos, line int, pipe *PipeNode) *ActionNode {\n\treturn &ActionNode{tr: t, NodeType: NodeAction, Pos: pos, Line: line, Pipe: pipe}\n}\n\nfunc (a *ActionNode) String() string {\n\treturn fmt.Sprintf(\"{{%s}}\", a.Pipe)\n\n}\n\nfunc (a *ActionNode) tree() *Tree {\n\treturn a.tr\n}\n\nfunc (a *ActionNode) Copy() Node {\n\treturn a.tr.newAction(a.Pos, a.Line, a.Pipe.CopyPipe())\n\n}\n\n// CommandNode holds a command (a pipeline inside an evaluating action).\ntype CommandNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tArgs []Node // Arguments in lexical order: Identifier, field, or constant.\n}\n\nfunc (t *Tree) newCommand(pos Pos) *CommandNode {\n\treturn &CommandNode{tr: t, NodeType: NodeCommand, Pos: pos}\n}\n\nfunc (c *CommandNode) append(arg Node) {\n\tc.Args = append(c.Args, arg)\n}\n\nfunc (c *CommandNode) String() string {\n\ts := \"\"\n\tfor i, arg := range c.Args {\n\t\tif i > 0 {\n\t\t\ts += \" \"\n\t\t}\n\t\tif arg, ok := arg.(*PipeNode); ok {\n\t\t\ts += \"(\" + arg.String() + \")\"\n\t\t\tcontinue\n\t\t}\n\t\ts += arg.String()\n\t}\n\treturn s\n}\n\nfunc (c *CommandNode) tree() *Tree {\n\treturn c.tr\n}\n\nfunc (c *CommandNode) Copy() Node {\n\tif c == nil {\n\t\treturn c\n\t}\n\tn := c.tr.newCommand(c.Pos)\n\tfor _, c := range c.Args {\n\t\tn.append(c.Copy())\n\t}\n\treturn n\n}\n\n// IdentifierNode holds an identifier.\ntype IdentifierNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tIdent string // The identifier's name.\n}\n\n// NewIdentifier returns a new IdentifierNode with the given identifier name.\nfunc NewIdentifier(ident string) *IdentifierNode {\n\treturn &IdentifierNode{NodeType: NodeIdentifier, Ident: ident}\n}\n\n// SetPos sets the position. NewIdentifier is a public method so we can't modify its signature.\n// Chained for convenience.\n// TODO: fix one day?\nfunc (i *IdentifierNode) SetPos(pos Pos) *IdentifierNode {\n\ti.Pos = pos\n\treturn i\n}\n\n// SetTree sets the parent tree for the node. NewIdentifier is a public method so we can't modify its signature.\n// Chained for convenience.\n// TODO: fix one day?\nfunc (i *IdentifierNode) SetTree(t *Tree) *IdentifierNode {\n\ti.tr = t\n\treturn i\n}\n\nfunc (i *IdentifierNode) String() string {\n\treturn i.Ident\n}\n\nfunc (i *IdentifierNode) tree() *Tree {\n\treturn i.tr\n}\n\nfunc (i *IdentifierNode) Copy() Node {\n\treturn NewIdentifier(i.Ident).SetTree(i.tr).SetPos(i.Pos)\n}\n\n// VariableNode holds a list of variable names, possibly with chained field\n// accesses. The dollar sign is part of the (first) name.\ntype VariableNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tIdent []string // Variable name and fields in lexical order.\n}\n\nfunc (t *Tree) newVariable(pos Pos, ident string) *VariableNode {\n\treturn &VariableNode{tr: t, NodeType: NodeVariable, Pos: pos, Ident: strings.Split(ident, \".\")}\n}\n\nfunc (v *VariableNode) String() string {\n\ts := \"\"\n\tfor i, id := range v.Ident {\n\t\tif i > 0 {\n\t\t\ts += \".\"\n\t\t}\n\t\ts += id\n\t}\n\treturn s\n}\n\nfunc (v *VariableNode) tree() *Tree {\n\treturn v.tr\n}\n\nfunc (v *VariableNode) Copy() Node {\n\treturn &VariableNode{tr: v.tr, NodeType: NodeVariable, Pos: v.Pos, Ident: append([]string{}, v.Ident...)}\n}\n\n// DotNode holds the special identifier '.'.\ntype DotNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n}\n\nfunc (t *Tree) newDot(pos Pos) *DotNode {\n\treturn &DotNode{tr: t, NodeType: NodeDot, Pos: pos}\n}\n\nfunc (d *DotNode) Type() NodeType {\n\t// Override method on embedded NodeType for API compatibility.\n\t// TODO: Not really a problem; could change API without effect but\n\t// api tool complains.\n\treturn NodeDot\n}\n\nfunc (d *DotNode) String() string {\n\treturn \".\"\n}\n\nfunc (d *DotNode) tree() *Tree {\n\treturn d.tr\n}\n\nfunc (d *DotNode) Copy() Node {\n\treturn d.tr.newDot(d.Pos)\n}\n\n// NilNode holds the special identifier 'nil' representing an untyped nil constant.\ntype NilNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n}\n\nfunc (t *Tree) newNil(pos Pos) *NilNode {\n\treturn &NilNode{tr: t, NodeType: NodeNil, Pos: pos}\n}\n\nfunc (n *NilNode) Type() NodeType {\n\t// Override method on embedded NodeType for API compatibility.\n\t// TODO: Not really a problem; could change API without effect but\n\t// api tool complains.\n\treturn NodeNil\n}\n\nfunc (n *NilNode) String() string {\n\treturn \"nil\"\n}\n\nfunc (n *NilNode) tree() *Tree {\n\treturn n.tr\n}\n\nfunc (n *NilNode) Copy() Node {\n\treturn n.tr.newNil(n.Pos)\n}\n\n// FieldNode holds a field (identifier starting with '.').\n// The names may be chained ('.x.y').\n// The period is dropped from each ident.\ntype FieldNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tIdent []string // The identifiers in lexical order.\n}\n\nfunc (t *Tree) newField(pos Pos, ident string) *FieldNode {\n\treturn &FieldNode{tr: t, NodeType: NodeField, Pos: pos, Ident: strings.Split(ident[1:], \".\")} // [1:] to drop leading period\n}\n\nfunc (f *FieldNode) String() string {\n\ts := \"\"\n\tfor _, id := range f.Ident {\n\t\ts += \".\" + id\n\t}\n\treturn s\n}\n\nfunc (f *FieldNode) tree() *Tree {\n\treturn f.tr\n}\n\nfunc (f *FieldNode) Copy() Node {\n\treturn &FieldNode{tr: f.tr, NodeType: NodeField, Pos: f.Pos, Ident: append([]string{}, f.Ident...)}\n}\n\n// ChainNode holds a term followed by a chain of field accesses (identifier starting with '.').\n// The names may be chained ('.x.y').\n// The periods are dropped from each ident.\ntype ChainNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tNode Node\n\tField []string // The identifiers in lexical order.\n}\n\nfunc (t *Tree) newChain(pos Pos, node Node) *ChainNode {\n\treturn &ChainNode{tr: t, NodeType: NodeChain, Pos: pos, Node: node}\n}\n\n// Add adds the named field (which should start with a period) to the end of the chain.\nfunc (c *ChainNode) Add(field string) {\n\tif len(field) == 0 || field[0] != '.' {\n\t\tpanic(\"no dot in field\")\n\t}\n\tfield = field[1:] // Remove leading dot.\n\tif field == \"\" {\n\t\tpanic(\"empty field\")\n\t}\n\tc.Field = append(c.Field, field)\n}\n\nfunc (c *ChainNode) String() string {\n\ts := c.Node.String()\n\tif _, ok := c.Node.(*PipeNode); ok {\n\t\ts = \"(\" + s + \")\"\n\t}\n\tfor _, field := range c.Field {\n\t\ts += \".\" + field\n\t}\n\treturn s\n}\n\nfunc (c *ChainNode) tree() *Tree {\n\treturn c.tr\n}\n\nfunc (c *ChainNode) Copy() Node {\n\treturn &ChainNode{tr: c.tr, NodeType: NodeChain, Pos: c.Pos, Node: c.Node, Field: append([]string{}, c.Field...)}\n}\n\n// BoolNode holds a boolean constant.\ntype BoolNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tTrue bool // The value of the boolean constant.\n}\n\nfunc (t *Tree) newBool(pos Pos, true bool) *BoolNode {\n\treturn &BoolNode{tr: t, NodeType: NodeBool, Pos: pos, True: true}\n}\n\nfunc (b *BoolNode) String() string {\n\tif b.True {\n\t\treturn \"true\"\n\t}\n\treturn \"false\"\n}\n\nfunc (b *BoolNode) tree() *Tree {\n\treturn b.tr\n}\n\nfunc (b *BoolNode) Copy() Node {\n\treturn b.tr.newBool(b.Pos, b.True)\n}\n\n// NumberNode holds a number: signed or unsigned integer, float, or complex.\n// The value is parsed and stored under all the types that can represent the value.\n// This simulates in a small amount of code the behavior of Go's ideal constants.\ntype NumberNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tIsInt bool // Number has an integral value.\n\tIsUint bool // Number has an unsigned integral value.\n\tIsFloat bool // Number has a floating-point value.\n\tIsComplex bool // Number is complex.\n\tInt64 int64 // The signed integer value.\n\tUint64 uint64 // The unsigned integer value.\n\tFloat64 float64 // The floating-point value.\n\tComplex128 complex128 // The complex value.\n\tText string // The original textual representation from the input.\n}\n\nfunc (t *Tree) newNumber(pos Pos, text string, typ itemType) (*NumberNode, error) {\n\tn := &NumberNode{tr: t, NodeType: NodeNumber, Pos: pos, Text: text}\n\tswitch typ {\n\tcase itemCharConstant:\n\t\trune, _, tail, err := strconv.UnquoteChar(text[1:], text[0])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif tail != \"'\" {\n\t\t\treturn nil, fmt.Errorf(\"malformed character constant: %s\", text)\n\t\t}\n\t\tn.Int64 = int64(rune)\n\t\tn.IsInt = true\n\t\tn.Uint64 = uint64(rune)\n\t\tn.IsUint = true\n\t\tn.Float64 = float64(rune) // odd but those are the rules.\n\t\tn.IsFloat = true\n\t\treturn n, nil\n\tcase itemComplex:\n\t\t// fmt.Sscan can parse the pair, so let it do the work.\n\t\tif _, err := fmt.Sscan(text, &n.Complex128); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tn.IsComplex = true\n\t\tn.simplifyComplex()\n\t\treturn n, nil\n\t}\n\t// Imaginary constants can only be complex unless they are zero.\n\tif len(text) > 0 && text[len(text)-1] == 'i' {\n\t\tf, err := strconv.ParseFloat(text[:len(text)-1], 64)\n\t\tif err == nil {\n\t\t\tn.IsComplex = true\n\t\t\tn.Complex128 = complex(0, f)\n\t\t\tn.simplifyComplex()\n\t\t\treturn n, nil\n\t\t}\n\t}\n\t// Do integer test first so we get 0x123 etc.\n\tu, err := strconv.ParseUint(text, 0, 64) // will fail for -0; fixed below.\n\tif err == nil {\n\t\tn.IsUint = true\n\t\tn.Uint64 = u\n\t}\n\ti, err := strconv.ParseInt(text, 0, 64)\n\tif err == nil {\n\t\tn.IsInt = true\n\t\tn.Int64 = i\n\t\tif i == 0 {\n\t\t\tn.IsUint = true // in case of -0.\n\t\t\tn.Uint64 = u\n\t\t}\n\t}\n\t// If an integer extraction succeeded, promote the float.\n\tif n.IsInt {\n\t\tn.IsFloat = true\n\t\tn.Float64 = float64(n.Int64)\n\t} else if n.IsUint {\n\t\tn.IsFloat = true\n\t\tn.Float64 = float64(n.Uint64)\n\t} else {\n\t\tf, err := strconv.ParseFloat(text, 64)\n\t\tif err == nil {\n\t\t\tn.IsFloat = true\n\t\t\tn.Float64 = f\n\t\t\t// If a floating-point extraction succeeded, extract the int if needed.\n\t\t\tif !n.IsInt && float64(int64(f)) == f {\n\t\t\t\tn.IsInt = true\n\t\t\t\tn.Int64 = int64(f)\n\t\t\t}\n\t\t\tif !n.IsUint && float64(uint64(f)) == f {\n\t\t\t\tn.IsUint = true\n\t\t\t\tn.Uint64 = uint64(f)\n\t\t\t}\n\t\t}\n\t}\n\tif !n.IsInt && !n.IsUint && !n.IsFloat {\n\t\treturn nil, fmt.Errorf(\"illegal number syntax: %q\", text)\n\t}\n\treturn n, nil\n}\n\n// simplifyComplex pulls out any other types that are represented by the complex number.\n// These all require that the imaginary part be zero.\nfunc (n *NumberNode) simplifyComplex() {\n\tn.IsFloat = imag(n.Complex128) == 0\n\tif n.IsFloat {\n\t\tn.Float64 = real(n.Complex128)\n\t\tn.IsInt = float64(int64(n.Float64)) == n.Float64\n\t\tif n.IsInt {\n\t\t\tn.Int64 = int64(n.Float64)\n\t\t}\n\t\tn.IsUint = float64(uint64(n.Float64)) == n.Float64\n\t\tif n.IsUint {\n\t\t\tn.Uint64 = uint64(n.Float64)\n\t\t}\n\t}\n}\n\nfunc (n *NumberNode) String() string {\n\treturn n.Text\n}\n\nfunc (n *NumberNode) tree() *Tree {\n\treturn n.tr\n}\n\nfunc (n *NumberNode) Copy() Node {\n\tnn := new(NumberNode)\n\t*nn = *n // Easy, fast, correct.\n\treturn nn\n}\n\n// StringNode holds a string constant. The value has been \"unquoted\".\ntype StringNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tQuoted string // The original text of the string, with quotes.\n\tText string // The string, after quote processing.\n}\n\nfunc (t *Tree) newString(pos Pos, orig, text string) *StringNode {\n\treturn &StringNode{tr: t, NodeType: NodeString, Pos: pos, Quoted: orig, Text: text}\n}\n\nfunc (s *StringNode) String() string {\n\treturn s.Quoted\n}\n\nfunc (s *StringNode) tree() *Tree {\n\treturn s.tr\n}\n\nfunc (s *StringNode) Copy() Node {\n\treturn s.tr.newString(s.Pos, s.Quoted, s.Text)\n}\n\n// endNode represents an {{end}} action.\n// It does not appear in the final parse tree.\ntype endNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n}\n\nfunc (t *Tree) newEnd(pos Pos) *endNode {\n\treturn &endNode{tr: t, NodeType: nodeEnd, Pos: pos}\n}\n\nfunc (e *endNode) String() string {\n\treturn \"{{end}}\"\n}\n\nfunc (e *endNode) tree() *Tree {\n\treturn e.tr\n}\n\nfunc (e *endNode) Copy() Node {\n\treturn e.tr.newEnd(e.Pos)\n}\n\n// elseNode represents an {{else}} action. Does not appear in the final tree.\ntype elseNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tLine int // The line number in the input (deprecated; kept for compatibility)\n}\n\nfunc (t *Tree) newElse(pos Pos, line int) *elseNode {\n\treturn &elseNode{tr: t, NodeType: nodeElse, Pos: pos, Line: line}\n}\n\nfunc (e *elseNode) Type() NodeType {\n\treturn nodeElse\n}\n\nfunc (e *elseNode) String() string {\n\treturn \"{{else}}\"\n}\n\nfunc (e *elseNode) tree() *Tree {\n\treturn e.tr\n}\n\nfunc (e *elseNode) Copy() Node {\n\treturn e.tr.newElse(e.Pos, e.Line)\n}\n\n// BranchNode is the common representation of if, range, and with.\ntype BranchNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tLine int // The line number in the input (deprecated; kept for compatibility)\n\tPipe *PipeNode // The pipeline to be evaluated.\n\tList *ListNode // What to execute if the value is non-empty.\n\tElseList *ListNode // What to execute if the value is empty (nil if absent).\n}\n\nfunc (b *BranchNode) String() string {\n\tname := \"\"\n\tswitch b.NodeType {\n\tcase NodeIf:\n\t\tname = \"if\"\n\tcase NodeRange:\n\t\tname = \"range\"\n\tcase NodeWith:\n\t\tname = \"with\"\n\tdefault:\n\t\tpanic(\"unknown branch type\")\n\t}\n\tif b.ElseList != nil {\n\t\treturn fmt.Sprintf(\"{{%s %s}}%s{{else}}%s{{end}}\", name, b.Pipe, b.List, b.ElseList)\n\t}\n\treturn fmt.Sprintf(\"{{%s %s}}%s{{end}}\", name, b.Pipe, b.List)\n}\n\nfunc (b *BranchNode) tree() *Tree {\n\treturn b.tr\n}\n\nfunc (b *BranchNode) Copy() Node {\n\tswitch b.NodeType {\n\tcase NodeIf:\n\t\treturn b.tr.newIf(b.Pos, b.Line, b.Pipe, b.List, b.ElseList)\n\tcase NodeRange:\n\t\treturn b.tr.newRange(b.Pos, b.Line, b.Pipe, b.List, b.ElseList)\n\tcase NodeWith:\n\t\treturn b.tr.newWith(b.Pos, b.Line, b.Pipe, b.List, b.ElseList)\n\tdefault:\n\t\tpanic(\"unknown branch type\")\n\t}\n}\n\n// IfNode represents an {{if}} action and its commands.\ntype IfNode struct {\n\tBranchNode\n}\n\nfunc (t *Tree) newIf(pos Pos, line int, pipe *PipeNode, list, elseList *ListNode) *IfNode {\n\treturn &IfNode{BranchNode{tr: t, NodeType: NodeIf, Pos: pos, Line: line, Pipe: pipe, List: list, ElseList: elseList}}\n}\n\nfunc (i *IfNode) Copy() Node {\n\treturn i.tr.newIf(i.Pos, i.Line, i.Pipe.CopyPipe(), i.List.CopyList(), i.ElseList.CopyList())\n}\n\n// RangeNode represents a {{range}} action and its commands.\ntype RangeNode struct {\n\tBranchNode\n}\n\nfunc (t *Tree) newRange(pos Pos, line int, pipe *PipeNode, list, elseList *ListNode) *RangeNode {\n\treturn &RangeNode{BranchNode{tr: t, NodeType: NodeRange, Pos: pos, Line: line, Pipe: pipe, List: list, ElseList: elseList}}\n}\n\nfunc (r *RangeNode) Copy() Node {\n\treturn r.tr.newRange(r.Pos, r.Line, r.Pipe.CopyPipe(), r.List.CopyList(), r.ElseList.CopyList())\n}\n\n// WithNode represents a {{with}} action and its commands.\ntype WithNode struct {\n\tBranchNode\n}\n\nfunc (t *Tree) newWith(pos Pos, line int, pipe *PipeNode, list, elseList *ListNode) *WithNode {\n\treturn &WithNode{BranchNode{tr: t, NodeType: NodeWith, Pos: pos, Line: line, Pipe: pipe, List: list, ElseList: elseList}}\n}\n\nfunc (w *WithNode) Copy() Node {\n\treturn w.tr.newWith(w.Pos, w.Line, w.Pipe.CopyPipe(), w.List.CopyList(), w.ElseList.CopyList())\n}\n\n// TemplateNode represents a {{template}} action.\ntype TemplateNode struct {\n\tNodeType\n\tPos\n\ttr *Tree\n\tLine int // The line number in the input (deprecated; kept for compatibility)\n\tName string // The name of the template (unquoted).\n\tPipe *PipeNode // The command to evaluate as dot for the template.\n}\n\nfunc (t *Tree) newTemplate(pos Pos, line int, name string, pipe *PipeNode) *TemplateNode {\n\treturn &TemplateNode{tr: t, NodeType: NodeTemplate, Pos: pos, Line: line, Name: name, Pipe: pipe}\n}\n\nfunc (t *TemplateNode) String() string {\n\tif t.Pipe == nil {\n\t\treturn fmt.Sprintf(\"{{template %q}}\", t.Name)\n\t}\n\treturn fmt.Sprintf(\"{{template %q %s}}\", t.Name, t.Pipe)\n}\n\nfunc (t *TemplateNode) tree() *Tree {\n\treturn t.tr\n}\n\nfunc (t *TemplateNode) Copy() Node {\n\treturn t.tr.newTemplate(t.Pos, t.Line, t.Name, t.Pipe.CopyPipe())\n}\n" }, { "path": "vendor/github.com/alecthomas/template/parse/parse.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package parse builds parse trees for templates as defined by text/template\n// and html/template. Clients should use those packages to construct templates\n// rather than this one, which provides shared internal data structures not\n// intended for general use.\npackage parse\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"runtime\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Tree is the representation of a single parsed template.\ntype Tree struct {\n\tName string // name of the template represented by the tree.\n\tParseName string // name of the top-level template during parsing, for error messages.\n\tRoot *ListNode // top-level root of the tree.\n\ttext string // text parsed to create the template (or its parent)\n\t// Parsing only; cleared after parse.\n\tfuncs []map[string]interface{}\n\tlex *lexer\n\ttoken [3]item // three-token lookahead for parser.\n\tpeekCount int\n\tvars []string // variables defined at the moment.\n}\n\n// Copy returns a copy of the Tree. Any parsing state is discarded.\nfunc (t *Tree) Copy() *Tree {\n\tif t == nil {\n\t\treturn nil\n\t}\n\treturn &Tree{\n\t\tName: t.Name,\n\t\tParseName: t.ParseName,\n\t\tRoot: t.Root.CopyList(),\n\t\ttext: t.text,\n\t}\n}\n\n// Parse returns a map from template name to parse.Tree, created by parsing the\n// templates described in the argument string. The top-level template will be\n// given the specified name. If an error is encountered, parsing stops and an\n// empty map is returned with the error.\nfunc Parse(name, text, leftDelim, rightDelim string, funcs ...map[string]interface{}) (treeSet map[string]*Tree, err error) {\n\ttreeSet = make(map[string]*Tree)\n\tt := New(name)\n\tt.text = text\n\t_, err = t.Parse(text, leftDelim, rightDelim, treeSet, funcs...)\n\treturn\n}\n\n// next returns the next token.\nfunc (t *Tree) next() item {\n\tif t.peekCount > 0 {\n\t\tt.peekCount--\n\t} else {\n\t\tt.token[0] = t.lex.nextItem()\n\t}\n\treturn t.token[t.peekCount]\n}\n\n// backup backs the input stream up one token.\nfunc (t *Tree) backup() {\n\tt.peekCount++\n}\n\n// backup2 backs the input stream up two tokens.\n// The zeroth token is already there.\nfunc (t *Tree) backup2(t1 item) {\n\tt.token[1] = t1\n\tt.peekCount = 2\n}\n\n// backup3 backs the input stream up three tokens\n// The zeroth token is already there.\nfunc (t *Tree) backup3(t2, t1 item) { // Reverse order: we're pushing back.\n\tt.token[1] = t1\n\tt.token[2] = t2\n\tt.peekCount = 3\n}\n\n// peek returns but does not consume the next token.\nfunc (t *Tree) peek() item {\n\tif t.peekCount > 0 {\n\t\treturn t.token[t.peekCount-1]\n\t}\n\tt.peekCount = 1\n\tt.token[0] = t.lex.nextItem()\n\treturn t.token[0]\n}\n\n// nextNonSpace returns the next non-space token.\nfunc (t *Tree) nextNonSpace() (token item) {\n\tfor {\n\t\ttoken = t.next()\n\t\tif token.typ != itemSpace {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn token\n}\n\n// peekNonSpace returns but does not consume the next non-space token.\nfunc (t *Tree) peekNonSpace() (token item) {\n\tfor {\n\t\ttoken = t.next()\n\t\tif token.typ != itemSpace {\n\t\t\tbreak\n\t\t}\n\t}\n\tt.backup()\n\treturn token\n}\n\n// Parsing.\n\n// New allocates a new parse tree with the given name.\nfunc New(name string, funcs ...map[string]interface{}) *Tree {\n\treturn &Tree{\n\t\tName: name,\n\t\tfuncs: funcs,\n\t}\n}\n\n// ErrorContext returns a textual representation of the location of the node in the input text.\n// The receiver is only used when the node does not have a pointer to the tree inside,\n// which can occur in old code.\nfunc (t *Tree) ErrorContext(n Node) (location, context string) {\n\tpos := int(n.Position())\n\ttree := n.tree()\n\tif tree == nil {\n\t\ttree = t\n\t}\n\ttext := tree.text[:pos]\n\tbyteNum := strings.LastIndex(text, \"\\n\")\n\tif byteNum == -1 {\n\t\tbyteNum = pos // On first line.\n\t} else {\n\t\tbyteNum++ // After the newline.\n\t\tbyteNum = pos - byteNum\n\t}\n\tlineNum := 1 + strings.Count(text, \"\\n\")\n\tcontext = n.String()\n\tif len(context) > 20 {\n\t\tcontext = fmt.Sprintf(\"%.20s...\", context)\n\t}\n\treturn fmt.Sprintf(\"%s:%d:%d\", tree.ParseName, lineNum, byteNum), context\n}\n\n// errorf formats the error and terminates processing.\nfunc (t *Tree) errorf(format string, args ...interface{}) {\n\tt.Root = nil\n\tformat = fmt.Sprintf(\"template: %s:%d: %s\", t.ParseName, t.lex.lineNumber(), format)\n\tpanic(fmt.Errorf(format, args...))\n}\n\n// error terminates processing.\nfunc (t *Tree) error(err error) {\n\tt.errorf(\"%s\", err)\n}\n\n// expect consumes the next token and guarantees it has the required type.\nfunc (t *Tree) expect(expected itemType, context string) item {\n\ttoken := t.nextNonSpace()\n\tif token.typ != expected {\n\t\tt.unexpected(token, context)\n\t}\n\treturn token\n}\n\n// expectOneOf consumes the next token and guarantees it has one of the required types.\nfunc (t *Tree) expectOneOf(expected1, expected2 itemType, context string) item {\n\ttoken := t.nextNonSpace()\n\tif token.typ != expected1 && token.typ != expected2 {\n\t\tt.unexpected(token, context)\n\t}\n\treturn token\n}\n\n// unexpected complains about the token and terminates processing.\nfunc (t *Tree) unexpected(token item, context string) {\n\tt.errorf(\"unexpected %s in %s\", token, context)\n}\n\n// recover is the handler that turns panics into returns from the top level of Parse.\nfunc (t *Tree) recover(errp *error) {\n\te := recover()\n\tif e != nil {\n\t\tif _, ok := e.(runtime.Error); ok {\n\t\t\tpanic(e)\n\t\t}\n\t\tif t != nil {\n\t\t\tt.stopParse()\n\t\t}\n\t\t*errp = e.(error)\n\t}\n\treturn\n}\n\n// startParse initializes the parser, using the lexer.\nfunc (t *Tree) startParse(funcs []map[string]interface{}, lex *lexer) {\n\tt.Root = nil\n\tt.lex = lex\n\tt.vars = []string{\"$\"}\n\tt.funcs = funcs\n}\n\n// stopParse terminates parsing.\nfunc (t *Tree) stopParse() {\n\tt.lex = nil\n\tt.vars = nil\n\tt.funcs = nil\n}\n\n// Parse parses the template definition string to construct a representation of\n// the template for execution. If either action delimiter string is empty, the\n// default (\"{{\" or \"}}\") is used. Embedded template definitions are added to\n// the treeSet map.\nfunc (t *Tree) Parse(text, leftDelim, rightDelim string, treeSet map[string]*Tree, funcs ...map[string]interface{}) (tree *Tree, err error) {\n\tdefer t.recover(&err)\n\tt.ParseName = t.Name\n\tt.startParse(funcs, lex(t.Name, text, leftDelim, rightDelim))\n\tt.text = text\n\tt.parse(treeSet)\n\tt.add(treeSet)\n\tt.stopParse()\n\treturn t, nil\n}\n\n// add adds tree to the treeSet.\nfunc (t *Tree) add(treeSet map[string]*Tree) {\n\ttree := treeSet[t.Name]\n\tif tree == nil || IsEmptyTree(tree.Root) {\n\t\ttreeSet[t.Name] = t\n\t\treturn\n\t}\n\tif !IsEmptyTree(t.Root) {\n\t\tt.errorf(\"template: multiple definition of template %q\", t.Name)\n\t}\n}\n\n// IsEmptyTree reports whether this tree (node) is empty of everything but space.\nfunc IsEmptyTree(n Node) bool {\n\tswitch n := n.(type) {\n\tcase nil:\n\t\treturn true\n\tcase *ActionNode:\n\tcase *IfNode:\n\tcase *ListNode:\n\t\tfor _, node := range n.Nodes {\n\t\t\tif !IsEmptyTree(node) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\tcase *RangeNode:\n\tcase *TemplateNode:\n\tcase *TextNode:\n\t\treturn len(bytes.TrimSpace(n.Text)) == 0\n\tcase *WithNode:\n\tdefault:\n\t\tpanic(\"unknown node: \" + n.String())\n\t}\n\treturn false\n}\n\n// parse is the top-level parser for a template, essentially the same\n// as itemList except it also parses {{define}} actions.\n// It runs to EOF.\nfunc (t *Tree) parse(treeSet map[string]*Tree) (next Node) {\n\tt.Root = t.newList(t.peek().pos)\n\tfor t.peek().typ != itemEOF {\n\t\tif t.peek().typ == itemLeftDelim {\n\t\t\tdelim := t.next()\n\t\t\tif t.nextNonSpace().typ == itemDefine {\n\t\t\t\tnewT := New(\"definition\") // name will be updated once we know it.\n\t\t\t\tnewT.text = t.text\n\t\t\t\tnewT.ParseName = t.ParseName\n\t\t\t\tnewT.startParse(t.funcs, t.lex)\n\t\t\t\tnewT.parseDefinition(treeSet)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tt.backup2(delim)\n\t\t}\n\t\tn := t.textOrAction()\n\t\tif n.Type() == nodeEnd {\n\t\t\tt.errorf(\"unexpected %s\", n)\n\t\t}\n\t\tt.Root.append(n)\n\t}\n\treturn nil\n}\n\n// parseDefinition parses a {{define}} ... {{end}} template definition and\n// installs the definition in the treeSet map. The \"define\" keyword has already\n// been scanned.\nfunc (t *Tree) parseDefinition(treeSet map[string]*Tree) {\n\tconst context = \"define clause\"\n\tname := t.expectOneOf(itemString, itemRawString, context)\n\tvar err error\n\tt.Name, err = strconv.Unquote(name.val)\n\tif err != nil {\n\t\tt.error(err)\n\t}\n\tt.expect(itemRightDelim, context)\n\tvar end Node\n\tt.Root, end = t.itemList()\n\tif end.Type() != nodeEnd {\n\t\tt.errorf(\"unexpected %s in %s\", end, context)\n\t}\n\tt.add(treeSet)\n\tt.stopParse()\n}\n\n// itemList:\n//\ttextOrAction*\n// Terminates at {{end}} or {{else}}, returned separately.\nfunc (t *Tree) itemList() (list *ListNode, next Node) {\n\tlist = t.newList(t.peekNonSpace().pos)\n\tfor t.peekNonSpace().typ != itemEOF {\n\t\tn := t.textOrAction()\n\t\tswitch n.Type() {\n\t\tcase nodeEnd, nodeElse:\n\t\t\treturn list, n\n\t\t}\n\t\tlist.append(n)\n\t}\n\tt.errorf(\"unexpected EOF\")\n\treturn\n}\n\n// textOrAction:\n//\ttext | action\nfunc (t *Tree) textOrAction() Node {\n\tswitch token := t.nextNonSpace(); token.typ {\n\tcase itemElideNewline:\n\t\treturn t.elideNewline()\n\tcase itemText:\n\t\treturn t.newText(token.pos, token.val)\n\tcase itemLeftDelim:\n\t\treturn t.action()\n\tdefault:\n\t\tt.unexpected(token, \"input\")\n\t}\n\treturn nil\n}\n\n// elideNewline:\n// Remove newlines trailing rightDelim if \\\\ is present.\nfunc (t *Tree) elideNewline() Node {\n\ttoken := t.peek()\n\tif token.typ != itemText {\n\t\tt.unexpected(token, \"input\")\n\t\treturn nil\n\t}\n\n\tt.next()\n\tstripped := strings.TrimLeft(token.val, \"\\n\\r\")\n\tdiff := len(token.val) - len(stripped)\n\tif diff > 0 {\n\t\t// This is a bit nasty. We mutate the token in-place to remove\n\t\t// preceding newlines.\n\t\ttoken.pos += Pos(diff)\n\t\ttoken.val = stripped\n\t}\n\treturn t.newText(token.pos, token.val)\n}\n\n// Action:\n//\tcontrol\n//\tcommand (\"|\" command)*\n// Left delim is past. Now get actions.\n// First word could be a keyword such as range.\nfunc (t *Tree) action() (n Node) {\n\tswitch token := t.nextNonSpace(); token.typ {\n\tcase itemElse:\n\t\treturn t.elseControl()\n\tcase itemEnd:\n\t\treturn t.endControl()\n\tcase itemIf:\n\t\treturn t.ifControl()\n\tcase itemRange:\n\t\treturn t.rangeControl()\n\tcase itemTemplate:\n\t\treturn t.templateControl()\n\tcase itemWith:\n\t\treturn t.withControl()\n\t}\n\tt.backup()\n\t// Do not pop variables; they persist until \"end\".\n\treturn t.newAction(t.peek().pos, t.lex.lineNumber(), t.pipeline(\"command\"))\n}\n\n// Pipeline:\n//\tdeclarations? command ('|' command)*\nfunc (t *Tree) pipeline(context string) (pipe *PipeNode) {\n\tvar decl []*VariableNode\n\tpos := t.peekNonSpace().pos\n\t// Are there declarations?\n\tfor {\n\t\tif v := t.peekNonSpace(); v.typ == itemVariable {\n\t\t\tt.next()\n\t\t\t// Since space is a token, we need 3-token look-ahead here in the worst case:\n\t\t\t// in \"$x foo\" we need to read \"foo\" (as opposed to \":=\") to know that $x is an\n\t\t\t// argument variable rather than a declaration. So remember the token\n\t\t\t// adjacent to the variable so we can push it back if necessary.\n\t\t\ttokenAfterVariable := t.peek()\n\t\t\tif next := t.peekNonSpace(); next.typ == itemColonEquals || (next.typ == itemChar && next.val == \",\") {\n\t\t\t\tt.nextNonSpace()\n\t\t\t\tvariable := t.newVariable(v.pos, v.val)\n\t\t\t\tdecl = append(decl, variable)\n\t\t\t\tt.vars = append(t.vars, v.val)\n\t\t\t\tif next.typ == itemChar && next.val == \",\" {\n\t\t\t\t\tif context == \"range\" && len(decl) < 2 {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tt.errorf(\"too many declarations in %s\", context)\n\t\t\t\t}\n\t\t\t} else if tokenAfterVariable.typ == itemSpace {\n\t\t\t\tt.backup3(v, tokenAfterVariable)\n\t\t\t} else {\n\t\t\t\tt.backup2(v)\n\t\t\t}\n\t\t}\n\t\tbreak\n\t}\n\tpipe = t.newPipeline(pos, t.lex.lineNumber(), decl)\n\tfor {\n\t\tswitch token := t.nextNonSpace(); token.typ {\n\t\tcase itemRightDelim, itemRightParen:\n\t\t\tif len(pipe.Cmds) == 0 {\n\t\t\t\tt.errorf(\"missing value for %s\", context)\n\t\t\t}\n\t\t\tif token.typ == itemRightParen {\n\t\t\t\tt.backup()\n\t\t\t}\n\t\t\treturn\n\t\tcase itemBool, itemCharConstant, itemComplex, itemDot, itemField, itemIdentifier,\n\t\t\titemNumber, itemNil, itemRawString, itemString, itemVariable, itemLeftParen:\n\t\t\tt.backup()\n\t\t\tpipe.append(t.command())\n\t\tdefault:\n\t\t\tt.unexpected(token, context)\n\t\t}\n\t}\n}\n\nfunc (t *Tree) parseControl(allowElseIf bool, context string) (pos Pos, line int, pipe *PipeNode, list, elseList *ListNode) {\n\tdefer t.popVars(len(t.vars))\n\tline = t.lex.lineNumber()\n\tpipe = t.pipeline(context)\n\tvar next Node\n\tlist, next = t.itemList()\n\tswitch next.Type() {\n\tcase nodeEnd: //done\n\tcase nodeElse:\n\t\tif allowElseIf {\n\t\t\t// Special case for \"else if\". If the \"else\" is followed immediately by an \"if\",\n\t\t\t// the elseControl will have left the \"if\" token pending. Treat\n\t\t\t//\t{{if a}}_{{else if b}}_{{end}}\n\t\t\t// as\n\t\t\t//\t{{if a}}_{{else}}{{if b}}_{{end}}{{end}}.\n\t\t\t// To do this, parse the if as usual and stop at it {{end}}; the subsequent{{end}}\n\t\t\t// is assumed. This technique works even for long if-else-if chains.\n\t\t\t// TODO: Should we allow else-if in with and range?\n\t\t\tif t.peek().typ == itemIf {\n\t\t\t\tt.next() // Consume the \"if\" token.\n\t\t\t\telseList = t.newList(next.Position())\n\t\t\t\telseList.append(t.ifControl())\n\t\t\t\t// Do not consume the next item - only one {{end}} required.\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\telseList, next = t.itemList()\n\t\tif next.Type() != nodeEnd {\n\t\t\tt.errorf(\"expected end; found %s\", next)\n\t\t}\n\t}\n\treturn pipe.Position(), line, pipe, list, elseList\n}\n\n// If:\n//\t{{if pipeline}} itemList {{end}}\n//\t{{if pipeline}} itemList {{else}} itemList {{end}}\n// If keyword is past.\nfunc (t *Tree) ifControl() Node {\n\treturn t.newIf(t.parseControl(true, \"if\"))\n}\n\n// Range:\n//\t{{range pipeline}} itemList {{end}}\n//\t{{range pipeline}} itemList {{else}} itemList {{end}}\n// Range keyword is past.\nfunc (t *Tree) rangeControl() Node {\n\treturn t.newRange(t.parseControl(false, \"range\"))\n}\n\n// With:\n//\t{{with pipeline}} itemList {{end}}\n//\t{{with pipeline}} itemList {{else}} itemList {{end}}\n// If keyword is past.\nfunc (t *Tree) withControl() Node {\n\treturn t.newWith(t.parseControl(false, \"with\"))\n}\n\n// End:\n//\t{{end}}\n// End keyword is past.\nfunc (t *Tree) endControl() Node {\n\treturn t.newEnd(t.expect(itemRightDelim, \"end\").pos)\n}\n\n// Else:\n//\t{{else}}\n// Else keyword is past.\nfunc (t *Tree) elseControl() Node {\n\t// Special case for \"else if\".\n\tpeek := t.peekNonSpace()\n\tif peek.typ == itemIf {\n\t\t// We see \"{{else if ... \" but in effect rewrite it to {{else}}{{if ... \".\n\t\treturn t.newElse(peek.pos, t.lex.lineNumber())\n\t}\n\treturn t.newElse(t.expect(itemRightDelim, \"else\").pos, t.lex.lineNumber())\n}\n\n// Template:\n//\t{{template stringValue pipeline}}\n// Template keyword is past. The name must be something that can evaluate\n// to a string.\nfunc (t *Tree) templateControl() Node {\n\tvar name string\n\ttoken := t.nextNonSpace()\n\tswitch token.typ {\n\tcase itemString, itemRawString:\n\t\ts, err := strconv.Unquote(token.val)\n\t\tif err != nil {\n\t\t\tt.error(err)\n\t\t}\n\t\tname = s\n\tdefault:\n\t\tt.unexpected(token, \"template invocation\")\n\t}\n\tvar pipe *PipeNode\n\tif t.nextNonSpace().typ != itemRightDelim {\n\t\tt.backup()\n\t\t// Do not pop variables; they persist until \"end\".\n\t\tpipe = t.pipeline(\"template\")\n\t}\n\treturn t.newTemplate(token.pos, t.lex.lineNumber(), name, pipe)\n}\n\n// command:\n//\toperand (space operand)*\n// space-separated arguments up to a pipeline character or right delimiter.\n// we consume the pipe character but leave the right delim to terminate the action.\nfunc (t *Tree) command() *CommandNode {\n\tcmd := t.newCommand(t.peekNonSpace().pos)\n\tfor {\n\t\tt.peekNonSpace() // skip leading spaces.\n\t\toperand := t.operand()\n\t\tif operand != nil {\n\t\t\tcmd.append(operand)\n\t\t}\n\t\tswitch token := t.next(); token.typ {\n\t\tcase itemSpace:\n\t\t\tcontinue\n\t\tcase itemError:\n\t\t\tt.errorf(\"%s\", token.val)\n\t\tcase itemRightDelim, itemRightParen:\n\t\t\tt.backup()\n\t\tcase itemPipe:\n\t\tdefault:\n\t\t\tt.errorf(\"unexpected %s in operand; missing space?\", token)\n\t\t}\n\t\tbreak\n\t}\n\tif len(cmd.Args) == 0 {\n\t\tt.errorf(\"empty command\")\n\t}\n\treturn cmd\n}\n\n// operand:\n//\tterm .Field*\n// An operand is a space-separated component of a command,\n// a term possibly followed by field accesses.\n// A nil return means the next item is not an operand.\nfunc (t *Tree) operand() Node {\n\tnode := t.term()\n\tif node == nil {\n\t\treturn nil\n\t}\n\tif t.peek().typ == itemField {\n\t\tchain := t.newChain(t.peek().pos, node)\n\t\tfor t.peek().typ == itemField {\n\t\t\tchain.Add(t.next().val)\n\t\t}\n\t\t// Compatibility with original API: If the term is of type NodeField\n\t\t// or NodeVariable, just put more fields on the original.\n\t\t// Otherwise, keep the Chain node.\n\t\t// TODO: Switch to Chains always when we can.\n\t\tswitch node.Type() {\n\t\tcase NodeField:\n\t\t\tnode = t.newField(chain.Position(), chain.String())\n\t\tcase NodeVariable:\n\t\t\tnode = t.newVariable(chain.Position(), chain.String())\n\t\tdefault:\n\t\t\tnode = chain\n\t\t}\n\t}\n\treturn node\n}\n\n// term:\n//\tliteral (number, string, nil, boolean)\n//\tfunction (identifier)\n//\t.\n//\t.Field\n//\t$\n//\t'(' pipeline ')'\n// A term is a simple \"expression\".\n// A nil return means the next item is not a term.\nfunc (t *Tree) term() Node {\n\tswitch token := t.nextNonSpace(); token.typ {\n\tcase itemError:\n\t\tt.errorf(\"%s\", token.val)\n\tcase itemIdentifier:\n\t\tif !t.hasFunction(token.val) {\n\t\t\tt.errorf(\"function %q not defined\", token.val)\n\t\t}\n\t\treturn NewIdentifier(token.val).SetTree(t).SetPos(token.pos)\n\tcase itemDot:\n\t\treturn t.newDot(token.pos)\n\tcase itemNil:\n\t\treturn t.newNil(token.pos)\n\tcase itemVariable:\n\t\treturn t.useVar(token.pos, token.val)\n\tcase itemField:\n\t\treturn t.newField(token.pos, token.val)\n\tcase itemBool:\n\t\treturn t.newBool(token.pos, token.val == \"true\")\n\tcase itemCharConstant, itemComplex, itemNumber:\n\t\tnumber, err := t.newNumber(token.pos, token.val, token.typ)\n\t\tif err != nil {\n\t\t\tt.error(err)\n\t\t}\n\t\treturn number\n\tcase itemLeftParen:\n\t\tpipe := t.pipeline(\"parenthesized pipeline\")\n\t\tif token := t.next(); token.typ != itemRightParen {\n\t\t\tt.errorf(\"unclosed right paren: unexpected %s\", token)\n\t\t}\n\t\treturn pipe\n\tcase itemString, itemRawString:\n\t\ts, err := strconv.Unquote(token.val)\n\t\tif err != nil {\n\t\t\tt.error(err)\n\t\t}\n\t\treturn t.newString(token.pos, token.val, s)\n\t}\n\tt.backup()\n\treturn nil\n}\n\n// hasFunction reports if a function name exists in the Tree's maps.\nfunc (t *Tree) hasFunction(name string) bool {\n\tfor _, funcMap := range t.funcs {\n\t\tif funcMap == nil {\n\t\t\tcontinue\n\t\t}\n\t\tif funcMap[name] != nil {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// popVars trims the variable list to the specified length\nfunc (t *Tree) popVars(n int) {\n\tt.vars = t.vars[:n]\n}\n\n// useVar returns a node for a variable reference. It errors if the\n// variable is not defined.\nfunc (t *Tree) useVar(pos Pos, name string) Node {\n\tv := t.newVariable(pos, name)\n\tfor _, varName := range t.vars {\n\t\tif varName == v.Ident[0] {\n\t\t\treturn v\n\t\t}\n\t}\n\tt.errorf(\"undefined variable %q\", v.Ident[0])\n\treturn nil\n}\n" }, { "path": "vendor/github.com/alecthomas/template/template.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage template\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/alecthomas/template/parse\"\n)\n\n// common holds the information shared by related templates.\ntype common struct {\n\ttmpl map[string]*Template\n\t// We use two maps, one for parsing and one for execution.\n\t// This separation makes the API cleaner since it doesn't\n\t// expose reflection to the client.\n\tparseFuncs FuncMap\n\texecFuncs map[string]reflect.Value\n}\n\n// Template is the representation of a parsed template. The *parse.Tree\n// field is exported only for use by html/template and should be treated\n// as unexported by all other clients.\ntype Template struct {\n\tname string\n\t*parse.Tree\n\t*common\n\tleftDelim string\n\trightDelim string\n}\n\n// New allocates a new template with the given name.\nfunc New(name string) *Template {\n\treturn &Template{\n\t\tname: name,\n\t}\n}\n\n// Name returns the name of the template.\nfunc (t *Template) Name() string {\n\treturn t.name\n}\n\n// New allocates a new template associated with the given one and with the same\n// delimiters. The association, which is transitive, allows one template to\n// invoke another with a {{template}} action.\nfunc (t *Template) New(name string) *Template {\n\tt.init()\n\treturn &Template{\n\t\tname: name,\n\t\tcommon: t.common,\n\t\tleftDelim: t.leftDelim,\n\t\trightDelim: t.rightDelim,\n\t}\n}\n\nfunc (t *Template) init() {\n\tif t.common == nil {\n\t\tt.common = new(common)\n\t\tt.tmpl = make(map[string]*Template)\n\t\tt.parseFuncs = make(FuncMap)\n\t\tt.execFuncs = make(map[string]reflect.Value)\n\t}\n}\n\n// Clone returns a duplicate of the template, including all associated\n// templates. The actual representation is not copied, but the name space of\n// associated templates is, so further calls to Parse in the copy will add\n// templates to the copy but not to the original. Clone can be used to prepare\n// common templates and use them with variant definitions for other templates\n// by adding the variants after the clone is made.\nfunc (t *Template) Clone() (*Template, error) {\n\tnt := t.copy(nil)\n\tnt.init()\n\tnt.tmpl[t.name] = nt\n\tfor k, v := range t.tmpl {\n\t\tif k == t.name { // Already installed.\n\t\t\tcontinue\n\t\t}\n\t\t// The associated templates share nt's common structure.\n\t\ttmpl := v.copy(nt.common)\n\t\tnt.tmpl[k] = tmpl\n\t}\n\tfor k, v := range t.parseFuncs {\n\t\tnt.parseFuncs[k] = v\n\t}\n\tfor k, v := range t.execFuncs {\n\t\tnt.execFuncs[k] = v\n\t}\n\treturn nt, nil\n}\n\n// copy returns a shallow copy of t, with common set to the argument.\nfunc (t *Template) copy(c *common) *Template {\n\tnt := New(t.name)\n\tnt.Tree = t.Tree\n\tnt.common = c\n\tnt.leftDelim = t.leftDelim\n\tnt.rightDelim = t.rightDelim\n\treturn nt\n}\n\n// AddParseTree creates a new template with the name and parse tree\n// and associates it with t.\nfunc (t *Template) AddParseTree(name string, tree *parse.Tree) (*Template, error) {\n\tif t.common != nil && t.tmpl[name] != nil {\n\t\treturn nil, fmt.Errorf(\"template: redefinition of template %q\", name)\n\t}\n\tnt := t.New(name)\n\tnt.Tree = tree\n\tt.tmpl[name] = nt\n\treturn nt, nil\n}\n\n// Templates returns a slice of the templates associated with t, including t\n// itself.\nfunc (t *Template) Templates() []*Template {\n\tif t.common == nil {\n\t\treturn nil\n\t}\n\t// Return a slice so we don't expose the map.\n\tm := make([]*Template, 0, len(t.tmpl))\n\tfor _, v := range t.tmpl {\n\t\tm = append(m, v)\n\t}\n\treturn m\n}\n\n// Delims sets the action delimiters to the specified strings, to be used in\n// subsequent calls to Parse, ParseFiles, or ParseGlob. Nested template\n// definitions will inherit the settings. An empty delimiter stands for the\n// corresponding default: {{ or }}.\n// The return value is the template, so calls can be chained.\nfunc (t *Template) Delims(left, right string) *Template {\n\tt.leftDelim = left\n\tt.rightDelim = right\n\treturn t\n}\n\n// Funcs adds the elements of the argument map to the template's function map.\n// It panics if a value in the map is not a function with appropriate return\n// type. However, it is legal to overwrite elements of the map. The return\n// value is the template, so calls can be chained.\nfunc (t *Template) Funcs(funcMap FuncMap) *Template {\n\tt.init()\n\taddValueFuncs(t.execFuncs, funcMap)\n\taddFuncs(t.parseFuncs, funcMap)\n\treturn t\n}\n\n// Lookup returns the template with the given name that is associated with t,\n// or nil if there is no such template.\nfunc (t *Template) Lookup(name string) *Template {\n\tif t.common == nil {\n\t\treturn nil\n\t}\n\treturn t.tmpl[name]\n}\n\n// Parse parses a string into a template. Nested template definitions will be\n// associated with the top-level template t. Parse may be called multiple times\n// to parse definitions of templates to associate with t. It is an error if a\n// resulting template is non-empty (contains content other than template\n// definitions) and would replace a non-empty template with the same name.\n// (In multiple calls to Parse with the same receiver template, only one call\n// can contain text other than space, comments, and template definitions.)\nfunc (t *Template) Parse(text string) (*Template, error) {\n\tt.init()\n\ttrees, err := parse.Parse(t.name, text, t.leftDelim, t.rightDelim, t.parseFuncs, builtins)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\t// Add the newly parsed trees, including the one for t, into our common structure.\n\tfor name, tree := range trees {\n\t\t// If the name we parsed is the name of this template, overwrite this template.\n\t\t// The associate method checks it's not a redefinition.\n\t\ttmpl := t\n\t\tif name != t.name {\n\t\t\ttmpl = t.New(name)\n\t\t}\n\t\t// Even if t == tmpl, we need to install it in the common.tmpl map.\n\t\tif replace, err := t.associate(tmpl, tree); err != nil {\n\t\t\treturn nil, err\n\t\t} else if replace {\n\t\t\ttmpl.Tree = tree\n\t\t}\n\t\ttmpl.leftDelim = t.leftDelim\n\t\ttmpl.rightDelim = t.rightDelim\n\t}\n\treturn t, nil\n}\n\n// associate installs the new template into the group of templates associated\n// with t. It is an error to reuse a name except to overwrite an empty\n// template. The two are already known to share the common structure.\n// The boolean return value reports wither to store this tree as t.Tree.\nfunc (t *Template) associate(new *Template, tree *parse.Tree) (bool, error) {\n\tif new.common != t.common {\n\t\tpanic(\"internal error: associate not common\")\n\t}\n\tname := new.name\n\tif old := t.tmpl[name]; old != nil {\n\t\toldIsEmpty := parse.IsEmptyTree(old.Root)\n\t\tnewIsEmpty := parse.IsEmptyTree(tree.Root)\n\t\tif newIsEmpty {\n\t\t\t// Whether old is empty or not, new is empty; no reason to replace old.\n\t\t\treturn false, nil\n\t\t}\n\t\tif !oldIsEmpty {\n\t\t\treturn false, fmt.Errorf(\"template: redefinition of template %q\", name)\n\t\t}\n\t}\n\tt.tmpl[name] = new\n\treturn true, nil\n}\n" }, { "path": "vendor/github.com/astaxie/beego/LICENSE", "content": "Copyright 2014 astaxie\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License." }, { "path": "vendor/github.com/astaxie/beego/validation/README.md", "content": "validation\n==============\n\nvalidation is a form validation for a data validation and error collecting using Go.\n\n## Installation and tests\n\nInstall:\n\n\tgo get github.com/astaxie/beego/validation\n\nTest:\n\n\tgo test github.com/astaxie/beego/validation\n\n## Example\n\nDirect Use:\n\n\timport (\n\t\t\"github.com/astaxie/beego/validation\"\n\t\t\"log\"\n\t)\n\n\ttype User struct {\n\t\tName string\n\t\tAge int\n\t}\n\n\tfunc main() {\n\t\tu := User{\"man\", 40}\n\t\tvalid := validation.Validation{}\n\t\tvalid.Required(u.Name, \"name\")\n\t\tvalid.MaxSize(u.Name, 15, \"nameMax\")\n\t\tvalid.Range(u.Age, 0, 140, \"age\")\n\t\tif valid.HasErrors() {\n\t\t\t// validation does not pass\n\t\t\t// print invalid message\n\t\t\tfor _, err := range valid.Errors {\n\t\t\t\tlog.Println(err.Key, err.Message)\n\t\t\t}\n\t\t}\n\t\t// or use like this\n\t\tif v := valid.Max(u.Age, 140, \"ageMax\"); !v.Ok {\n\t\t\tlog.Println(v.Error.Key, v.Error.Message)\n\t\t}\n\t}\n\nStruct Tag Use:\n\n\timport (\n\t\t\"github.com/astaxie/beego/validation\"\n\t)\n\n\t// validation function follow with \"valid\" tag\n\t// functions divide with \";\"\n\t// parameters in parentheses \"()\" and divide with \",\"\n\t// Match function's pattern string must in \"//\"\n\ttype user struct {\n\t\tId int\n\t\tName string `valid:\"Required;Match(/^(test)?\\\\w*@;com$/)\"`\n\t\tAge int `valid:\"Required;Range(1, 140)\"`\n\t}\n\n\tfunc main() {\n\t\tvalid := validation.Validation{}\n\t\t// ignore empty field valid\n\t\t// see CanSkipFuncs\n\t\t// valid := validation.Validation{RequiredFirst:true}\n\t\tu := user{Name: \"test\", Age: 40}\n\t\tb, err := valid.Valid(u)\n\t\tif err != nil {\n\t\t\t// handle error\n\t\t}\n\t\tif !b {\n\t\t\t// validation does not pass\n\t\t\t// blabla...\n\t\t}\n\t}\n\nUse custom function:\n\n\timport (\n\t\t\"github.com/astaxie/beego/validation\"\n\t)\n\n\ttype user struct {\n\t\tId int\n\t\tName string `valid:\"Required;IsMe\"`\n\t\tAge int `valid:\"Required;Range(1, 140)\"`\n\t}\n\n\tfunc IsMe(v *validation.Validation, obj interface{}, key string) {\n\t\tname, ok:= obj.(string)\n\t\tif !ok {\n\t\t\t// wrong use case?\n\t\t\treturn\n\t\t}\n\n\t\tif name != \"me\" {\n\t\t\t// valid false\n\t\t\tv.SetError(\"Name\", \"is not me!\")\n\t\t}\n\t}\n\n\tfunc main() {\n\t\tvalid := validation.Validation{}\n\t\tif err := validation.AddCustomFunc(\"IsMe\", IsMe); err != nil {\n\t\t\t// hadle error\n\t\t}\n\t\tu := user{Name: \"test\", Age: 40}\n\t\tb, err := valid.Valid(u)\n\t\tif err != nil {\n\t\t\t// handle error\n\t\t}\n\t\tif !b {\n\t\t\t// validation does not pass\n\t\t\t// blabla...\n\t\t}\n\t}\n\nStruct Tag Functions:\n\n\tRequired\n\tMin(min int)\n\tMax(max int)\n\tRange(min, max int)\n\tMinSize(min int)\n\tMaxSize(max int)\n\tLength(length int)\n\tAlpha\n\tNumeric\n\tAlphaNumeric\n\tMatch(pattern string)\n\tAlphaDash\n\tEmail\n\tIP\n\tBase64\n\tMobile\n\tTel\n\tPhone\n\tZipCode\n\n\n## LICENSE\n\nBSD License http://creativecommons.org/licenses/BSD/\n" }, { "path": "vendor/github.com/astaxie/beego/validation/util.go", "content": "// Copyright 2014 beego Author. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage validation\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nconst (\n\t// ValidTag struct tag\n\tValidTag = \"valid\"\n\n\twordsize = 32 << (^uint(0) >> 32 & 1)\n)\n\nvar (\n\t// key: function name\n\t// value: the number of parameters\n\tfuncs = make(Funcs)\n\n\t// doesn't belong to validation functions\n\tunFuncs = map[string]bool{\n\t\t\"Clear\": true,\n\t\t\"HasErrors\": true,\n\t\t\"ErrorMap\": true,\n\t\t\"Error\": true,\n\t\t\"apply\": true,\n\t\t\"Check\": true,\n\t\t\"Valid\": true,\n\t\t\"NoMatch\": true,\n\t}\n\t// ErrInt64On32 show 32 bit platform not support int64\n\tErrInt64On32 = fmt.Errorf(\"not support int64 on 32-bit platform\")\n)\n\nfunc init() {\n\tv := &Validation{}\n\tt := reflect.TypeOf(v)\n\tfor i := 0; i < t.NumMethod(); i++ {\n\t\tm := t.Method(i)\n\t\tif !unFuncs[m.Name] {\n\t\t\tfuncs[m.Name] = m.Func\n\t\t}\n\t}\n}\n\n// CustomFunc is for custom validate function\ntype CustomFunc func(v *Validation, obj interface{}, key string)\n\n// AddCustomFunc Add a custom function to validation\n// The name can not be:\n// Clear\n// HasErrors\n// ErrorMap\n// Error\n// Check\n// Valid\n// NoMatch\n// If the name is same with exists function, it will replace the origin valid function\nfunc AddCustomFunc(name string, f CustomFunc) error {\n\tif unFuncs[name] {\n\t\treturn fmt.Errorf(\"invalid function name: %s\", name)\n\t}\n\n\tfuncs[name] = reflect.ValueOf(f)\n\treturn nil\n}\n\n// ValidFunc Valid function type\ntype ValidFunc struct {\n\tName string\n\tParams []interface{}\n}\n\n// Funcs Validate function map\ntype Funcs map[string]reflect.Value\n\n// Call validate values with named type string\nfunc (f Funcs) Call(name string, params ...interface{}) (result []reflect.Value, err error) {\n\tdefer func() {\n\t\tif r := recover(); r != nil {\n\t\t\terr = fmt.Errorf(\"%v\", r)\n\t\t}\n\t}()\n\tif _, ok := f[name]; !ok {\n\t\terr = fmt.Errorf(\"%s does not exist\", name)\n\t\treturn\n\t}\n\tif len(params) != f[name].Type().NumIn() {\n\t\terr = fmt.Errorf(\"The number of params is not adapted\")\n\t\treturn\n\t}\n\tin := make([]reflect.Value, len(params))\n\tfor k, param := range params {\n\t\tin[k] = reflect.ValueOf(param)\n\t}\n\tresult = f[name].Call(in)\n\treturn\n}\n\nfunc isStruct(t reflect.Type) bool {\n\treturn t.Kind() == reflect.Struct\n}\n\nfunc isStructPtr(t reflect.Type) bool {\n\treturn t.Kind() == reflect.Ptr && t.Elem().Kind() == reflect.Struct\n}\n\nfunc getValidFuncs(f reflect.StructField) (vfs []ValidFunc, err error) {\n\ttag := f.Tag.Get(ValidTag)\n\tif len(tag) == 0 {\n\t\treturn\n\t}\n\tif vfs, tag, err = getRegFuncs(tag, f.Name); err != nil {\n\t\treturn\n\t}\n\tfs := strings.Split(tag, \";\")\n\tfor _, vfunc := range fs {\n\t\tvar vf ValidFunc\n\t\tif len(vfunc) == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tvf, err = parseFunc(vfunc, f.Name)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tvfs = append(vfs, vf)\n\t}\n\treturn\n}\n\n// Get Match function\n// May be get NoMatch function in the future\nfunc getRegFuncs(tag, key string) (vfs []ValidFunc, str string, err error) {\n\ttag = strings.TrimSpace(tag)\n\tindex := strings.Index(tag, \"Match(/\")\n\tif index == -1 {\n\t\tstr = tag\n\t\treturn\n\t}\n\tend := strings.LastIndex(tag, \"/)\")\n\tif end < index {\n\t\terr = fmt.Errorf(\"invalid Match function\")\n\t\treturn\n\t}\n\treg, err := regexp.Compile(tag[index+len(\"Match(/\") : end])\n\tif err != nil {\n\t\treturn\n\t}\n\tvfs = []ValidFunc{{\"Match\", []interface{}{reg, key + \".Match\"}}}\n\tstr = strings.TrimSpace(tag[:index]) + strings.TrimSpace(tag[end+len(\"/)\"):])\n\treturn\n}\n\nfunc parseFunc(vfunc, key string) (v ValidFunc, err error) {\n\tdefer func() {\n\t\tif r := recover(); r != nil {\n\t\t\terr = fmt.Errorf(\"%v\", r)\n\t\t}\n\t}()\n\n\tvfunc = strings.TrimSpace(vfunc)\n\tstart := strings.Index(vfunc, \"(\")\n\tvar num int\n\n\t// doesn't need parameter valid function\n\tif start == -1 {\n\t\tif num, err = numIn(vfunc); err != nil {\n\t\t\treturn\n\t\t}\n\t\tif num != 0 {\n\t\t\terr = fmt.Errorf(\"%s require %d parameters\", vfunc, num)\n\t\t\treturn\n\t\t}\n\t\tv = ValidFunc{vfunc, []interface{}{key + \".\" + vfunc}}\n\t\treturn\n\t}\n\n\tend := strings.Index(vfunc, \")\")\n\tif end == -1 {\n\t\terr = fmt.Errorf(\"invalid valid function\")\n\t\treturn\n\t}\n\n\tname := strings.TrimSpace(vfunc[:start])\n\tif num, err = numIn(name); err != nil {\n\t\treturn\n\t}\n\n\tparams := strings.Split(vfunc[start+1:end], \",\")\n\t// the num of param must be equal\n\tif num != len(params) {\n\t\terr = fmt.Errorf(\"%s require %d parameters\", name, num)\n\t\treturn\n\t}\n\n\ttParams, err := trim(name, key+\".\"+name, params)\n\tif err != nil {\n\t\treturn\n\t}\n\tv = ValidFunc{name, tParams}\n\treturn\n}\n\nfunc numIn(name string) (num int, err error) {\n\tfn, ok := funcs[name]\n\tif !ok {\n\t\terr = fmt.Errorf(\"doesn't exsits %s valid function\", name)\n\t\treturn\n\t}\n\t// sub *Validation obj and key\n\tnum = fn.Type().NumIn() - 3\n\treturn\n}\n\nfunc trim(name, key string, s []string) (ts []interface{}, err error) {\n\tts = make([]interface{}, len(s), len(s)+1)\n\tfn, ok := funcs[name]\n\tif !ok {\n\t\terr = fmt.Errorf(\"doesn't exsits %s valid function\", name)\n\t\treturn\n\t}\n\tfor i := 0; i < len(s); i++ {\n\t\tvar param interface{}\n\t\t// skip *Validation and obj params\n\t\tif param, err = parseParam(fn.Type().In(i+2), strings.TrimSpace(s[i])); err != nil {\n\t\t\treturn\n\t\t}\n\t\tts[i] = param\n\t}\n\tts = append(ts, key)\n\treturn\n}\n\n// modify the parameters's type to adapt the function input parameters' type\nfunc parseParam(t reflect.Type, s string) (i interface{}, err error) {\n\tswitch t.Kind() {\n\tcase reflect.Int:\n\t\ti, err = strconv.Atoi(s)\n\tcase reflect.Int64:\n\t\tif wordsize == 32 {\n\t\t\treturn nil, ErrInt64On32\n\t\t}\n\t\ti, err = strconv.ParseInt(s, 10, 64)\n\tcase reflect.Int32:\n\t\tvar v int64\n\t\tv, err = strconv.ParseInt(s, 10, 32)\n\t\tif err == nil {\n\t\t\ti = int32(v)\n\t\t}\n\tcase reflect.Int16:\n\t\tvar v int64\n\t\tv, err = strconv.ParseInt(s, 10, 16)\n\t\tif err == nil {\n\t\t\ti = int16(v)\n\t\t}\n\tcase reflect.Int8:\n\t\tvar v int64\n\t\tv, err = strconv.ParseInt(s, 10, 8)\n\t\tif err == nil {\n\t\t\ti = int8(v)\n\t\t}\n\tcase reflect.String:\n\t\ti = s\n\tcase reflect.Ptr:\n\t\tif t.Elem().String() != \"regexp.Regexp\" {\n\t\t\terr = fmt.Errorf(\"not support %s\", t.Elem().String())\n\t\t\treturn\n\t\t}\n\t\ti, err = regexp.Compile(s)\n\tdefault:\n\t\terr = fmt.Errorf(\"not support %s\", t.Kind().String())\n\t}\n\treturn\n}\n\nfunc mergeParam(v *Validation, obj interface{}, params []interface{}) []interface{} {\n\treturn append([]interface{}{v, obj}, params...)\n}\n" }, { "path": "vendor/github.com/astaxie/beego/validation/validation.go", "content": "// Copyright 2014 beego Author. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package validation for validations\n//\n//\timport (\n//\t\t\"github.com/astaxie/beego/validation\"\n//\t\t\"log\"\n//\t)\n//\n//\ttype User struct {\n//\t\tName string\n//\t\tAge int\n//\t}\n//\n//\tfunc main() {\n//\t\tu := User{\"man\", 40}\n//\t\tvalid := validation.Validation{}\n//\t\tvalid.Required(u.Name, \"name\")\n//\t\tvalid.MaxSize(u.Name, 15, \"nameMax\")\n//\t\tvalid.Range(u.Age, 0, 140, \"age\")\n//\t\tif valid.HasErrors() {\n//\t\t\t// validation does not pass\n//\t\t\t// print invalid message\n//\t\t\tfor _, err := range valid.Errors {\n//\t\t\t\tlog.Println(err.Key, err.Message)\n//\t\t\t}\n//\t\t}\n//\t\t// or use like this\n//\t\tif v := valid.Max(u.Age, 140, \"ageMax\"); !v.Ok {\n//\t\t\tlog.Println(v.Error.Key, v.Error.Message)\n//\t\t}\n//\t}\n//\n// more info: http://beego.me/docs/mvc/controller/validation.md\npackage validation\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strings\"\n)\n\n// ValidFormer valid interface\ntype ValidFormer interface {\n\tValid(*Validation)\n}\n\n// Error show the error\ntype Error struct {\n\tMessage, Key, Name, Field, Tmpl string\n\tValue interface{}\n\tLimitValue interface{}\n}\n\n// String Returns the Message.\nfunc (e *Error) String() string {\n\tif e == nil {\n\t\treturn \"\"\n\t}\n\treturn e.Message\n}\n\n// Implement Error interface.\n// Return e.String()\nfunc (e *Error) Error() string { return e.String() }\n\n// Result is returned from every validation method.\n// It provides an indication of success, and a pointer to the Error (if any).\ntype Result struct {\n\tError *Error\n\tOk bool\n}\n\n// Key Get Result by given key string.\nfunc (r *Result) Key(key string) *Result {\n\tif r.Error != nil {\n\t\tr.Error.Key = key\n\t}\n\treturn r\n}\n\n// Message Set Result message by string or format string with args\nfunc (r *Result) Message(message string, args ...interface{}) *Result {\n\tif r.Error != nil {\n\t\tif len(args) == 0 {\n\t\t\tr.Error.Message = message\n\t\t} else {\n\t\t\tr.Error.Message = fmt.Sprintf(message, args...)\n\t\t}\n\t}\n\treturn r\n}\n\n// A Validation context manages data validation and error messages.\ntype Validation struct {\n\t// if this field set true, in struct tag valid\n\t// if the struct field vale is empty\n\t// it will skip those valid functions, see CanSkipFuncs\n\tRequiredFirst bool\n\n\tErrors []*Error\n\tErrorsMap map[string][]*Error\n}\n\n// Clear Clean all ValidationError.\nfunc (v *Validation) Clear() {\n\tv.Errors = []*Error{}\n\tv.ErrorsMap = nil\n}\n\n// HasErrors Has ValidationError nor not.\nfunc (v *Validation) HasErrors() bool {\n\treturn len(v.Errors) > 0\n}\n\n// ErrorMap Return the errors mapped by key.\n// If there are multiple validation errors associated with a single key, the\n// first one \"wins\". (Typically the first validation will be the more basic).\nfunc (v *Validation) ErrorMap() map[string][]*Error {\n\treturn v.ErrorsMap\n}\n\n// Error Add an error to the validation context.\nfunc (v *Validation) Error(message string, args ...interface{}) *Result {\n\tresult := (&Result{\n\t\tOk: false,\n\t\tError: &Error{},\n\t}).Message(message, args...)\n\tv.Errors = append(v.Errors, result.Error)\n\treturn result\n}\n\n// Required Test that the argument is non-nil and non-empty (if string or list)\nfunc (v *Validation) Required(obj interface{}, key string) *Result {\n\treturn v.apply(Required{key}, obj)\n}\n\n// Min Test that the obj is greater than min if obj's type is int\nfunc (v *Validation) Min(obj interface{}, min int, key string) *Result {\n\treturn v.apply(Min{min, key}, obj)\n}\n\n// Max Test that the obj is less than max if obj's type is int\nfunc (v *Validation) Max(obj interface{}, max int, key string) *Result {\n\treturn v.apply(Max{max, key}, obj)\n}\n\n// Range Test that the obj is between mni and max if obj's type is int\nfunc (v *Validation) Range(obj interface{}, min, max int, key string) *Result {\n\treturn v.apply(Range{Min{Min: min}, Max{Max: max}, key}, obj)\n}\n\n// MinSize Test that the obj is longer than min size if type is string or slice\nfunc (v *Validation) MinSize(obj interface{}, min int, key string) *Result {\n\treturn v.apply(MinSize{min, key}, obj)\n}\n\n// MaxSize Test that the obj is shorter than max size if type is string or slice\nfunc (v *Validation) MaxSize(obj interface{}, max int, key string) *Result {\n\treturn v.apply(MaxSize{max, key}, obj)\n}\n\n// Length Test that the obj is same length to n if type is string or slice\nfunc (v *Validation) Length(obj interface{}, n int, key string) *Result {\n\treturn v.apply(Length{n, key}, obj)\n}\n\n// Alpha Test that the obj is [a-zA-Z] if type is string\nfunc (v *Validation) Alpha(obj interface{}, key string) *Result {\n\treturn v.apply(Alpha{key}, obj)\n}\n\n// Numeric Test that the obj is [0-9] if type is string\nfunc (v *Validation) Numeric(obj interface{}, key string) *Result {\n\treturn v.apply(Numeric{key}, obj)\n}\n\n// AlphaNumeric Test that the obj is [0-9a-zA-Z] if type is string\nfunc (v *Validation) AlphaNumeric(obj interface{}, key string) *Result {\n\treturn v.apply(AlphaNumeric{key}, obj)\n}\n\n// Match Test that the obj matches regexp if type is string\nfunc (v *Validation) Match(obj interface{}, regex *regexp.Regexp, key string) *Result {\n\treturn v.apply(Match{regex, key}, obj)\n}\n\n// NoMatch Test that the obj doesn't match regexp if type is string\nfunc (v *Validation) NoMatch(obj interface{}, regex *regexp.Regexp, key string) *Result {\n\treturn v.apply(NoMatch{Match{Regexp: regex}, key}, obj)\n}\n\n// AlphaDash Test that the obj is [0-9a-zA-Z_-] if type is string\nfunc (v *Validation) AlphaDash(obj interface{}, key string) *Result {\n\treturn v.apply(AlphaDash{NoMatch{Match: Match{Regexp: alphaDashPattern}}, key}, obj)\n}\n\n// Email Test that the obj is email address if type is string\nfunc (v *Validation) Email(obj interface{}, key string) *Result {\n\treturn v.apply(Email{Match{Regexp: emailPattern}, key}, obj)\n}\n\n// IP Test that the obj is IP address if type is string\nfunc (v *Validation) IP(obj interface{}, key string) *Result {\n\treturn v.apply(IP{Match{Regexp: ipPattern}, key}, obj)\n}\n\n// Base64 Test that the obj is base64 encoded if type is string\nfunc (v *Validation) Base64(obj interface{}, key string) *Result {\n\treturn v.apply(Base64{Match{Regexp: base64Pattern}, key}, obj)\n}\n\n// Mobile Test that the obj is chinese mobile number if type is string\nfunc (v *Validation) Mobile(obj interface{}, key string) *Result {\n\treturn v.apply(Mobile{Match{Regexp: mobilePattern}, key}, obj)\n}\n\n// Tel Test that the obj is chinese telephone number if type is string\nfunc (v *Validation) Tel(obj interface{}, key string) *Result {\n\treturn v.apply(Tel{Match{Regexp: telPattern}, key}, obj)\n}\n\n// Phone Test that the obj is chinese mobile or telephone number if type is string\nfunc (v *Validation) Phone(obj interface{}, key string) *Result {\n\treturn v.apply(Phone{Mobile{Match: Match{Regexp: mobilePattern}},\n\t\tTel{Match: Match{Regexp: telPattern}}, key}, obj)\n}\n\n// ZipCode Test that the obj is chinese zip code if type is string\nfunc (v *Validation) ZipCode(obj interface{}, key string) *Result {\n\treturn v.apply(ZipCode{Match{Regexp: zipCodePattern}, key}, obj)\n}\n\nfunc (v *Validation) apply(chk Validator, obj interface{}) *Result {\n\tif chk.IsSatisfied(obj) {\n\t\treturn &Result{Ok: true}\n\t}\n\n\t// Add the error to the validation context.\n\tkey := chk.GetKey()\n\tName := key\n\tField := \"\"\n\n\tparts := strings.Split(key, \".\")\n\tif len(parts) == 2 {\n\t\tField = parts[0]\n\t\tName = parts[1]\n\t}\n\n\terr := &Error{\n\t\tMessage: chk.DefaultMessage(),\n\t\tKey: key,\n\t\tName: Name,\n\t\tField: Field,\n\t\tValue: obj,\n\t\tTmpl: MessageTmpls[Name],\n\t\tLimitValue: chk.GetLimitValue(),\n\t}\n\tv.setError(err)\n\n\t// Also return it in the result.\n\treturn &Result{\n\t\tOk: false,\n\t\tError: err,\n\t}\n}\n\n// AddError adds independent error message for the provided key\nfunc (v *Validation) AddError(key, message string) {\n\tName := key\n\tField := \"\"\n\n\tparts := strings.Split(key, \".\")\n\tif len(parts) == 2 {\n\t\tField = parts[0]\n\t\tName = parts[1]\n\t}\n\n\terr := &Error{\n\t\tMessage: message,\n\t\tKey: key,\n\t\tName: Name,\n\t\tField: Field,\n\t}\n\tv.setError(err)\n}\n\nfunc (v *Validation) setError(err *Error) {\n\tv.Errors = append(v.Errors, err)\n\tif v.ErrorsMap == nil {\n\t\tv.ErrorsMap = make(map[string][]*Error)\n\t}\n\tif _, ok := v.ErrorsMap[err.Field]; !ok {\n\t\tv.ErrorsMap[err.Field] = []*Error{}\n\t}\n\tv.ErrorsMap[err.Field] = append(v.ErrorsMap[err.Field], err)\n}\n\n// SetError Set error message for one field in ValidationError\nfunc (v *Validation) SetError(fieldName string, errMsg string) *Error {\n\terr := &Error{Key: fieldName, Field: fieldName, Tmpl: errMsg, Message: errMsg}\n\tv.setError(err)\n\treturn err\n}\n\n// Check Apply a group of validators to a field, in order, and return the\n// ValidationResult from the first one that fails, or the last one that\n// succeeds.\nfunc (v *Validation) Check(obj interface{}, checks ...Validator) *Result {\n\tvar result *Result\n\tfor _, check := range checks {\n\t\tresult = v.apply(check, obj)\n\t\tif !result.Ok {\n\t\t\treturn result\n\t\t}\n\t}\n\treturn result\n}\n\n// Valid Validate a struct.\n// the obj parameter must be a struct or a struct pointer\nfunc (v *Validation) Valid(obj interface{}) (b bool, err error) {\n\tobjT := reflect.TypeOf(obj)\n\tobjV := reflect.ValueOf(obj)\n\tswitch {\n\tcase isStruct(objT):\n\tcase isStructPtr(objT):\n\t\tobjT = objT.Elem()\n\t\tobjV = objV.Elem()\n\tdefault:\n\t\terr = fmt.Errorf(\"%v must be a struct or a struct pointer\", obj)\n\t\treturn\n\t}\n\n\tfor i := 0; i < objT.NumField(); i++ {\n\t\tvar vfs []ValidFunc\n\t\tif vfs, err = getValidFuncs(objT.Field(i)); err != nil {\n\t\t\treturn\n\t\t}\n\n\t\tvar hasReuired bool\n\t\tfor _, vf := range vfs {\n\t\t\tif vf.Name == \"Required\" {\n\t\t\t\thasReuired = true\n\t\t\t}\n\n\t\t\tif !hasReuired && v.RequiredFirst && len(objV.Field(i).String()) == 0 {\n\t\t\t\tif _, ok := CanSkipFuncs[vf.Name]; ok {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif _, err = funcs.Call(vf.Name,\n\t\t\t\tmergeParam(v, objV.Field(i).Interface(), vf.Params)...); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\tif !v.HasErrors() {\n\t\tif form, ok := obj.(ValidFormer); ok {\n\t\t\tform.Valid(v)\n\t\t}\n\t}\n\n\treturn !v.HasErrors(), nil\n}\n\n// RecursiveValid Recursively validate a struct.\n// Step1: Validate by v.Valid\n// Step2: If pass on step1, then reflect obj's fields\n// Step3: Do the Recursively validation to all struct or struct pointer fields\nfunc (v *Validation) RecursiveValid(objc interface{}) (bool, error) {\n\t//Step 1: validate obj itself firstly\n\t// fails if objc is not struct\n\tpass, err := v.Valid(objc)\n\tif err != nil || !pass {\n\t\treturn pass, err // Stop recursive validation\n\t}\n\t// Step 2: Validate struct's struct fields\n\tobjT := reflect.TypeOf(objc)\n\tobjV := reflect.ValueOf(objc)\n\n\tif isStructPtr(objT) {\n\t\tobjT = objT.Elem()\n\t\tobjV = objV.Elem()\n\t}\n\n\tfor i := 0; i < objT.NumField(); i++ {\n\n\t\tt := objT.Field(i).Type\n\n\t\t// Recursive applies to struct or pointer to structs fields\n\t\tif isStruct(t) || isStructPtr(t) {\n\t\t\t// Step 3: do the recursive validation\n\t\t\t// Only valid the Public field recursively\n\t\t\tif objV.Field(i).CanInterface() {\n\t\t\t\tpass, err = v.RecursiveValid(objV.Field(i).Interface())\n\t\t\t}\n\t\t}\n\t}\n\treturn pass, err\n}\n" }, { "path": "vendor/github.com/astaxie/beego/validation/validators.go", "content": "// Copyright 2014 beego Author. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage validation\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode/utf8\"\n)\n\n// CanSkipFuncs will skip valid if RequiredFirst is true and the struct field's value is empty\nvar CanSkipFuncs = map[string]struct{}{\n\t\"Email\": {},\n\t\"IP\": {},\n\t\"Mobile\": {},\n\t\"Tel\": {},\n\t\"Phone\": {},\n\t\"ZipCode\": {},\n}\n\n// MessageTmpls store commond validate template\nvar MessageTmpls = map[string]string{\n\t\"Required\": \"Can not be empty\",\n\t\"Min\": \"Minimum is %d\",\n\t\"Max\": \"Maximum is %d\",\n\t\"Range\": \"Range is %d to %d\",\n\t\"MinSize\": \"Minimum size is %d\",\n\t\"MaxSize\": \"Maximum size is %d\",\n\t\"Length\": \"Required length is %d\",\n\t\"Alpha\": \"Must be valid alpha characters\",\n\t\"Numeric\": \"Must be valid numeric characters\",\n\t\"AlphaNumeric\": \"Must be valid alpha or numeric characters\",\n\t\"Match\": \"Must match %s\",\n\t\"NoMatch\": \"Must not match %s\",\n\t\"AlphaDash\": \"Must be valid alpha or numeric or dash(-_) characters\",\n\t\"Email\": \"Must be a valid email address\",\n\t\"IP\": \"Must be a valid ip address\",\n\t\"Base64\": \"Must be valid base64 characters\",\n\t\"Mobile\": \"Must be valid mobile number\",\n\t\"Tel\": \"Must be valid telephone number\",\n\t\"Phone\": \"Must be valid telephone or mobile phone number\",\n\t\"ZipCode\": \"Must be valid zipcode\",\n}\n\n// SetDefaultMessage set default messages\n// if not set, the default messages are\n// \"Required\": \"Can not be empty\",\n// \"Min\": \"Minimum is %d\",\n// \"Max\": \"Maximum is %d\",\n// \"Range\": \"Range is %d to %d\",\n// \"MinSize\": \"Minimum size is %d\",\n// \"MaxSize\": \"Maximum size is %d\",\n// \"Length\": \"Required length is %d\",\n// \"Alpha\": \"Must be valid alpha characters\",\n// \"Numeric\": \"Must be valid numeric characters\",\n// \"AlphaNumeric\": \"Must be valid alpha or numeric characters\",\n// \"Match\": \"Must match %s\",\n// \"NoMatch\": \"Must not match %s\",\n// \"AlphaDash\": \"Must be valid alpha or numeric or dash(-_) characters\",\n// \"Email\": \"Must be a valid email address\",\n// \"IP\": \"Must be a valid ip address\",\n// \"Base64\": \"Must be valid base64 characters\",\n// \"Mobile\": \"Must be valid mobile number\",\n// \"Tel\": \"Must be valid telephone number\",\n// \"Phone\": \"Must be valid telephone or mobile phone number\",\n// \"ZipCode\": \"Must be valid zipcode\",\nfunc SetDefaultMessage(msg map[string]string) {\n\tif len(msg) == 0 {\n\t\treturn\n\t}\n\n\tfor name := range msg {\n\t\tMessageTmpls[name] = msg[name]\n\t}\n}\n\n// Validator interface\ntype Validator interface {\n\tIsSatisfied(interface{}) bool\n\tDefaultMessage() string\n\tGetKey() string\n\tGetLimitValue() interface{}\n}\n\n// Required struct\ntype Required struct {\n\tKey string\n}\n\n// IsSatisfied judge whether obj has value\nfunc (r Required) IsSatisfied(obj interface{}) bool {\n\tif obj == nil {\n\t\treturn false\n\t}\n\n\tif str, ok := obj.(string); ok {\n\t\treturn len(strings.TrimSpace(str)) > 0\n\t}\n\tif _, ok := obj.(bool); ok {\n\t\treturn true\n\t}\n\tif i, ok := obj.(int); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(uint); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(int8); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(uint8); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(int16); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(uint16); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(uint32); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(int32); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(int64); ok {\n\t\treturn i != 0\n\t}\n\tif i, ok := obj.(uint64); ok {\n\t\treturn i != 0\n\t}\n\tif t, ok := obj.(time.Time); ok {\n\t\treturn !t.IsZero()\n\t}\n\tv := reflect.ValueOf(obj)\n\tif v.Kind() == reflect.Slice {\n\t\treturn v.Len() > 0\n\t}\n\treturn true\n}\n\n// DefaultMessage return the default error message\nfunc (r Required) DefaultMessage() string {\n\treturn MessageTmpls[\"Required\"]\n}\n\n// GetKey return the r.Key\nfunc (r Required) GetKey() string {\n\treturn r.Key\n}\n\n// GetLimitValue return nil now\nfunc (r Required) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// Min check struct\ntype Min struct {\n\tMin int\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\n// not support int64 on 32-bit platform\nfunc (m Min) IsSatisfied(obj interface{}) bool {\n\tvar v int\n\tswitch obj.(type) {\n\tcase int64:\n\t\tif wordsize == 32 {\n\t\t\treturn false\n\t\t}\n\t\tv = int(obj.(int64))\n\tcase int:\n\t\tv = obj.(int)\n\tcase int32:\n\t\tv = int(obj.(int32))\n\tcase int16:\n\t\tv = int(obj.(int16))\n\tcase int8:\n\t\tv = int(obj.(int8))\n\tdefault:\n\t\treturn false\n\t}\n\n\treturn v >= m.Min\n}\n\n// DefaultMessage return the default min error message\nfunc (m Min) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"Min\"], m.Min)\n}\n\n// GetKey return the m.Key\nfunc (m Min) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value, Min\nfunc (m Min) GetLimitValue() interface{} {\n\treturn m.Min\n}\n\n// Max validate struct\ntype Max struct {\n\tMax int\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\n// not support int64 on 32-bit platform\nfunc (m Max) IsSatisfied(obj interface{}) bool {\n\tvar v int\n\tswitch obj.(type) {\n\tcase int64:\n\t\tif wordsize == 32 {\n\t\t\treturn false\n\t\t}\n\t\tv = int(obj.(int64))\n\tcase int:\n\t\tv = obj.(int)\n\tcase int32:\n\t\tv = int(obj.(int32))\n\tcase int16:\n\t\tv = int(obj.(int16))\n\tcase int8:\n\t\tv = int(obj.(int8))\n\tdefault:\n\t\treturn false\n\t}\n\n\treturn v <= m.Max\n}\n\n// DefaultMessage return the default max error message\nfunc (m Max) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"Max\"], m.Max)\n}\n\n// GetKey return the m.Key\nfunc (m Max) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value, Max\nfunc (m Max) GetLimitValue() interface{} {\n\treturn m.Max\n}\n\n// Range Requires an integer to be within Min, Max inclusive.\ntype Range struct {\n\tMin\n\tMax\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\n// not support int64 on 32-bit platform\nfunc (r Range) IsSatisfied(obj interface{}) bool {\n\treturn r.Min.IsSatisfied(obj) && r.Max.IsSatisfied(obj)\n}\n\n// DefaultMessage return the default Range error message\nfunc (r Range) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"Range\"], r.Min.Min, r.Max.Max)\n}\n\n// GetKey return the m.Key\nfunc (r Range) GetKey() string {\n\treturn r.Key\n}\n\n// GetLimitValue return the limit value, Max\nfunc (r Range) GetLimitValue() interface{} {\n\treturn []int{r.Min.Min, r.Max.Max}\n}\n\n// MinSize Requires an array or string to be at least a given length.\ntype MinSize struct {\n\tMin int\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (m MinSize) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\treturn utf8.RuneCountInString(str) >= m.Min\n\t}\n\tv := reflect.ValueOf(obj)\n\tif v.Kind() == reflect.Slice {\n\t\treturn v.Len() >= m.Min\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default MinSize error message\nfunc (m MinSize) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"MinSize\"], m.Min)\n}\n\n// GetKey return the m.Key\nfunc (m MinSize) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value\nfunc (m MinSize) GetLimitValue() interface{} {\n\treturn m.Min\n}\n\n// MaxSize Requires an array or string to be at most a given length.\ntype MaxSize struct {\n\tMax int\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (m MaxSize) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\treturn utf8.RuneCountInString(str) <= m.Max\n\t}\n\tv := reflect.ValueOf(obj)\n\tif v.Kind() == reflect.Slice {\n\t\treturn v.Len() <= m.Max\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default MaxSize error message\nfunc (m MaxSize) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"MaxSize\"], m.Max)\n}\n\n// GetKey return the m.Key\nfunc (m MaxSize) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value\nfunc (m MaxSize) GetLimitValue() interface{} {\n\treturn m.Max\n}\n\n// Length Requires an array or string to be exactly a given length.\ntype Length struct {\n\tN int\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (l Length) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\treturn utf8.RuneCountInString(str) == l.N\n\t}\n\tv := reflect.ValueOf(obj)\n\tif v.Kind() == reflect.Slice {\n\t\treturn v.Len() == l.N\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default Length error message\nfunc (l Length) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"Length\"], l.N)\n}\n\n// GetKey return the m.Key\nfunc (l Length) GetKey() string {\n\treturn l.Key\n}\n\n// GetLimitValue return the limit value\nfunc (l Length) GetLimitValue() interface{} {\n\treturn l.N\n}\n\n// Alpha check the alpha\ntype Alpha struct {\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (a Alpha) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\tfor _, v := range str {\n\t\t\tif ('Z' < v || v < 'A') && ('z' < v || v < 'a') {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default Length error message\nfunc (a Alpha) DefaultMessage() string {\n\treturn MessageTmpls[\"Alpha\"]\n}\n\n// GetKey return the m.Key\nfunc (a Alpha) GetKey() string {\n\treturn a.Key\n}\n\n// GetLimitValue return the limit value\nfunc (a Alpha) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// Numeric check number\ntype Numeric struct {\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (n Numeric) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\tfor _, v := range str {\n\t\t\tif '9' < v || v < '0' {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default Length error message\nfunc (n Numeric) DefaultMessage() string {\n\treturn MessageTmpls[\"Numeric\"]\n}\n\n// GetKey return the n.Key\nfunc (n Numeric) GetKey() string {\n\treturn n.Key\n}\n\n// GetLimitValue return the limit value\nfunc (n Numeric) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// AlphaNumeric check alpha and number\ntype AlphaNumeric struct {\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (a AlphaNumeric) IsSatisfied(obj interface{}) bool {\n\tif str, ok := obj.(string); ok {\n\t\tfor _, v := range str {\n\t\t\tif ('Z' < v || v < 'A') && ('z' < v || v < 'a') && ('9' < v || v < '0') {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\treturn false\n}\n\n// DefaultMessage return the default Length error message\nfunc (a AlphaNumeric) DefaultMessage() string {\n\treturn MessageTmpls[\"AlphaNumeric\"]\n}\n\n// GetKey return the a.Key\nfunc (a AlphaNumeric) GetKey() string {\n\treturn a.Key\n}\n\n// GetLimitValue return the limit value\nfunc (a AlphaNumeric) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// Match Requires a string to match a given regex.\ntype Match struct {\n\tRegexp *regexp.Regexp\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (m Match) IsSatisfied(obj interface{}) bool {\n\treturn m.Regexp.MatchString(fmt.Sprintf(\"%v\", obj))\n}\n\n// DefaultMessage return the default Match error message\nfunc (m Match) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"Match\"], m.Regexp.String())\n}\n\n// GetKey return the m.Key\nfunc (m Match) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value\nfunc (m Match) GetLimitValue() interface{} {\n\treturn m.Regexp.String()\n}\n\n// NoMatch Requires a string to not match a given regex.\ntype NoMatch struct {\n\tMatch\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (n NoMatch) IsSatisfied(obj interface{}) bool {\n\treturn !n.Match.IsSatisfied(obj)\n}\n\n// DefaultMessage return the default NoMatch error message\nfunc (n NoMatch) DefaultMessage() string {\n\treturn fmt.Sprintf(MessageTmpls[\"NoMatch\"], n.Regexp.String())\n}\n\n// GetKey return the n.Key\nfunc (n NoMatch) GetKey() string {\n\treturn n.Key\n}\n\n// GetLimitValue return the limit value\nfunc (n NoMatch) GetLimitValue() interface{} {\n\treturn n.Regexp.String()\n}\n\nvar alphaDashPattern = regexp.MustCompile(`[^\\d\\w-_]`)\n\n// AlphaDash check not Alpha\ntype AlphaDash struct {\n\tNoMatch\n\tKey string\n}\n\n// DefaultMessage return the default AlphaDash error message\nfunc (a AlphaDash) DefaultMessage() string {\n\treturn MessageTmpls[\"AlphaDash\"]\n}\n\n// GetKey return the n.Key\nfunc (a AlphaDash) GetKey() string {\n\treturn a.Key\n}\n\n// GetLimitValue return the limit value\nfunc (a AlphaDash) GetLimitValue() interface{} {\n\treturn nil\n}\n\nvar emailPattern = regexp.MustCompile(`^[\\w!#$%&'*+/=?^_` + \"`\" + `{|}~-]+(?:\\.[\\w!#$%&'*+/=?^_` + \"`\" + `{|}~-]+)*@(?:[\\w](?:[\\w-]*[\\w])?\\.)+[a-zA-Z0-9](?:[\\w-]*[\\w])?$`)\n\n// Email check struct\ntype Email struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default Email error message\nfunc (e Email) DefaultMessage() string {\n\treturn MessageTmpls[\"Email\"]\n}\n\n// GetKey return the n.Key\nfunc (e Email) GetKey() string {\n\treturn e.Key\n}\n\n// GetLimitValue return the limit value\nfunc (e Email) GetLimitValue() interface{} {\n\treturn nil\n}\n\nvar ipPattern = regexp.MustCompile(`^((2[0-4]\\d|25[0-5]|[01]?\\d\\d?)\\.){3}(2[0-4]\\d|25[0-5]|[01]?\\d\\d?)$`)\n\n// IP check struct\ntype IP struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default IP error message\nfunc (i IP) DefaultMessage() string {\n\treturn MessageTmpls[\"IP\"]\n}\n\n// GetKey return the i.Key\nfunc (i IP) GetKey() string {\n\treturn i.Key\n}\n\n// GetLimitValue return the limit value\nfunc (i IP) GetLimitValue() interface{} {\n\treturn nil\n}\n\nvar base64Pattern = regexp.MustCompile(`^(?:[A-Za-z0-99+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$`)\n\n// Base64 check struct\ntype Base64 struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default Base64 error message\nfunc (b Base64) DefaultMessage() string {\n\treturn MessageTmpls[\"Base64\"]\n}\n\n// GetKey return the b.Key\nfunc (b Base64) GetKey() string {\n\treturn b.Key\n}\n\n// GetLimitValue return the limit value\nfunc (b Base64) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// just for chinese mobile phone number\nvar mobilePattern = regexp.MustCompile(`^((\\+86)|(86))?(1(([35][0-9])|[8][0-9]|[7][06789]|[4][579]))\\d{8}$`)\n\n// Mobile check struct\ntype Mobile struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default Mobile error message\nfunc (m Mobile) DefaultMessage() string {\n\treturn MessageTmpls[\"Mobile\"]\n}\n\n// GetKey return the m.Key\nfunc (m Mobile) GetKey() string {\n\treturn m.Key\n}\n\n// GetLimitValue return the limit value\nfunc (m Mobile) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// just for chinese telephone number\nvar telPattern = regexp.MustCompile(`^(0\\d{2,3}(\\-)?)?\\d{7,8}$`)\n\n// Tel check telephone struct\ntype Tel struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default Tel error message\nfunc (t Tel) DefaultMessage() string {\n\treturn MessageTmpls[\"Tel\"]\n}\n\n// GetKey return the t.Key\nfunc (t Tel) GetKey() string {\n\treturn t.Key\n}\n\n// GetLimitValue return the limit value\nfunc (t Tel) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// Phone just for chinese telephone or mobile phone number\ntype Phone struct {\n\tMobile\n\tTel\n\tKey string\n}\n\n// IsSatisfied judge whether obj is valid\nfunc (p Phone) IsSatisfied(obj interface{}) bool {\n\treturn p.Mobile.IsSatisfied(obj) || p.Tel.IsSatisfied(obj)\n}\n\n// DefaultMessage return the default Phone error message\nfunc (p Phone) DefaultMessage() string {\n\treturn MessageTmpls[\"Phone\"]\n}\n\n// GetKey return the p.Key\nfunc (p Phone) GetKey() string {\n\treturn p.Key\n}\n\n// GetLimitValue return the limit value\nfunc (p Phone) GetLimitValue() interface{} {\n\treturn nil\n}\n\n// just for chinese zipcode\nvar zipCodePattern = regexp.MustCompile(`^[1-9]\\d{5}$`)\n\n// ZipCode check the zip struct\ntype ZipCode struct {\n\tMatch\n\tKey string\n}\n\n// DefaultMessage return the default Zip error message\nfunc (z ZipCode) DefaultMessage() string {\n\treturn MessageTmpls[\"ZipCode\"]\n}\n\n// GetKey return the z.Key\nfunc (z ZipCode) GetKey() string {\n\treturn z.Key\n}\n\n// GetLimitValue return the limit value\nfunc (z ZipCode) GetLimitValue() interface{} {\n\treturn nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/.gitignore", "content": ".vscode/\n" }, { "path": "vendor/github.com/boombuler/barcode/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2014 Florian Sundermann\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/boombuler/barcode/README.md", "content": "[![Join the chat at https://gitter.im/golang-barcode/Lobby](https://badges.gitter.im/golang-barcode/Lobby.svg)](https://gitter.im/golang-barcode/Lobby?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n\n## Introduction ##\n\nThis is a package for GO which can be used to create different types of barcodes.\n\n## Supported Barcode Types ##\n* 2 of 5\n* Aztec Code\n* Codabar\n* Code 128\n* Code 39\n* Code 93\n* Datamatrix\n* EAN 13\n* EAN 8\n* PDF 417\n* QR Code\n\n## Example ##\n\nThis is a simple example on how to create a QR-Code and write it to a png-file\n```go\npackage main\n\nimport (\n\t\"image/png\"\n\t\"os\"\n\n\t\"github.com/boombuler/barcode\"\n\t\"github.com/boombuler/barcode/qr\"\n)\n\nfunc main() {\n\t// Create the barcode\n\tqrCode, _ := qr.Encode(\"Hello World\", qr.M, qr.Auto)\n\n\t// Scale the barcode to 200x200 pixels\n\tqrCode, _ = barcode.Scale(qrCode, 200, 200)\n\n\t// create the output file\n\tfile, _ := os.Create(\"qrcode.png\")\n\tdefer file.Close()\n\n\t// encode the barcode as png\n\tpng.Encode(file, qrCode)\n}\n```\n\n## Documentation ##\nSee [GoDoc](https://godoc.org/github.com/boombuler/barcode)\n\nTo create a barcode use the Encode function from one of the subpackages.\n" }, { "path": "vendor/github.com/boombuler/barcode/barcode.go", "content": "package barcode\n\nimport \"image\"\n\nconst (\n\tTypeAztec = \"Aztec\"\n\tTypeCodabar = \"Codabar\"\n\tTypeCode128 = \"Code 128\"\n\tTypeCode39 = \"Code 39\"\n\tTypeCode93 = \"Code 93\"\n\tTypeDataMatrix = \"DataMatrix\"\n\tTypeEAN8 = \"EAN 8\"\n\tTypeEAN13 = \"EAN 13\"\n\tTypePDF = \"PDF417\"\n\tTypeQR = \"QR Code\"\n\tType2of5 = \"2 of 5\"\n\tType2of5Interleaved = \"2 of 5 (interleaved)\"\n)\n\n// Contains some meta information about a barcode\ntype Metadata struct {\n\t// the name of the barcode kind\n\tCodeKind string\n\t// contains 1 for 1D barcodes or 2 for 2D barcodes\n\tDimensions byte\n}\n\n// a rendered and encoded barcode\ntype Barcode interface {\n\timage.Image\n\t// returns some meta information about the barcode\n\tMetadata() Metadata\n\t// the data that was encoded in this barcode\n\tContent() string\n}\n\n// Additional interface that some barcodes might implement to provide\n// the value of its checksum.\ntype BarcodeIntCS interface {\n\tBarcode\n\tCheckSum() int\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/alphanumeric.go", "content": "package qr\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"strings\"\n\n\t\"github.com/boombuler/barcode/utils\"\n)\n\nconst charSet string = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\"\n\nfunc stringToAlphaIdx(content string) <-chan int {\n\tresult := make(chan int)\n\tgo func() {\n\t\tfor _, r := range content {\n\t\t\tidx := strings.IndexRune(charSet, r)\n\t\t\tresult <- idx\n\t\t\tif idx < 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tclose(result)\n\t}()\n\n\treturn result\n}\n\nfunc encodeAlphaNumeric(content string, ecl ErrorCorrectionLevel) (*utils.BitList, *versionInfo, error) {\n\n\tcontentLenIsOdd := len(content)%2 == 1\n\tcontentBitCount := (len(content) / 2) * 11\n\tif contentLenIsOdd {\n\t\tcontentBitCount += 6\n\t}\n\tvi := findSmallestVersionInfo(ecl, alphaNumericMode, contentBitCount)\n\tif vi == nil {\n\t\treturn nil, nil, errors.New(\"To much data to encode\")\n\t}\n\n\tres := new(utils.BitList)\n\tres.AddBits(int(alphaNumericMode), 4)\n\tres.AddBits(len(content), vi.charCountBits(alphaNumericMode))\n\n\tencoder := stringToAlphaIdx(content)\n\n\tfor idx := 0; idx < len(content)/2; idx++ {\n\t\tc1 := <-encoder\n\t\tc2 := <-encoder\n\t\tif c1 < 0 || c2 < 0 {\n\t\t\treturn nil, nil, fmt.Errorf(\"\\\"%s\\\" can not be encoded as %s\", content, AlphaNumeric)\n\t\t}\n\t\tres.AddBits(c1*45+c2, 11)\n\t}\n\tif contentLenIsOdd {\n\t\tc := <-encoder\n\t\tif c < 0 {\n\t\t\treturn nil, nil, fmt.Errorf(\"\\\"%s\\\" can not be encoded as %s\", content, AlphaNumeric)\n\t\t}\n\t\tres.AddBits(c, 6)\n\t}\n\n\taddPaddingAndTerminator(res, vi)\n\n\treturn res, vi, nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/automatic.go", "content": "package qr\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/boombuler/barcode/utils\"\n)\n\nfunc encodeAuto(content string, ecl ErrorCorrectionLevel) (*utils.BitList, *versionInfo, error) {\n\tbits, vi, _ := Numeric.getEncoder()(content, ecl)\n\tif bits != nil && vi != nil {\n\t\treturn bits, vi, nil\n\t}\n\tbits, vi, _ = AlphaNumeric.getEncoder()(content, ecl)\n\tif bits != nil && vi != nil {\n\t\treturn bits, vi, nil\n\t}\n\tbits, vi, _ = Unicode.getEncoder()(content, ecl)\n\tif bits != nil && vi != nil {\n\t\treturn bits, vi, nil\n\t}\n\treturn nil, nil, fmt.Errorf(\"No encoding found to encode \\\"%s\\\"\", content)\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/blocks.go", "content": "package qr\n\ntype block struct {\n\tdata []byte\n\tecc []byte\n}\ntype blockList []*block\n\nfunc splitToBlocks(data <-chan byte, vi *versionInfo) blockList {\n\tresult := make(blockList, vi.NumberOfBlocksInGroup1+vi.NumberOfBlocksInGroup2)\n\n\tfor b := 0; b < int(vi.NumberOfBlocksInGroup1); b++ {\n\t\tblk := new(block)\n\t\tblk.data = make([]byte, vi.DataCodeWordsPerBlockInGroup1)\n\t\tfor cw := 0; cw < int(vi.DataCodeWordsPerBlockInGroup1); cw++ {\n\t\t\tblk.data[cw] = <-data\n\t\t}\n\t\tblk.ecc = ec.calcECC(blk.data, vi.ErrorCorrectionCodewordsPerBlock)\n\t\tresult[b] = blk\n\t}\n\n\tfor b := 0; b < int(vi.NumberOfBlocksInGroup2); b++ {\n\t\tblk := new(block)\n\t\tblk.data = make([]byte, vi.DataCodeWordsPerBlockInGroup2)\n\t\tfor cw := 0; cw < int(vi.DataCodeWordsPerBlockInGroup2); cw++ {\n\t\t\tblk.data[cw] = <-data\n\t\t}\n\t\tblk.ecc = ec.calcECC(blk.data, vi.ErrorCorrectionCodewordsPerBlock)\n\t\tresult[int(vi.NumberOfBlocksInGroup1)+b] = blk\n\t}\n\n\treturn result\n}\n\nfunc (bl blockList) interleave(vi *versionInfo) []byte {\n\tvar maxCodewordCount int\n\tif vi.DataCodeWordsPerBlockInGroup1 > vi.DataCodeWordsPerBlockInGroup2 {\n\t\tmaxCodewordCount = int(vi.DataCodeWordsPerBlockInGroup1)\n\t} else {\n\t\tmaxCodewordCount = int(vi.DataCodeWordsPerBlockInGroup2)\n\t}\n\tresultLen := (vi.DataCodeWordsPerBlockInGroup1+vi.ErrorCorrectionCodewordsPerBlock)*vi.NumberOfBlocksInGroup1 +\n\t\t(vi.DataCodeWordsPerBlockInGroup2+vi.ErrorCorrectionCodewordsPerBlock)*vi.NumberOfBlocksInGroup2\n\n\tresult := make([]byte, 0, resultLen)\n\tfor i := 0; i < maxCodewordCount; i++ {\n\t\tfor b := 0; b < len(bl); b++ {\n\t\t\tif len(bl[b].data) > i {\n\t\t\t\tresult = append(result, bl[b].data[i])\n\t\t\t}\n\t\t}\n\t}\n\tfor i := 0; i < int(vi.ErrorCorrectionCodewordsPerBlock); i++ {\n\t\tfor b := 0; b < len(bl); b++ {\n\t\t\tresult = append(result, bl[b].ecc[i])\n\t\t}\n\t}\n\treturn result\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/encoder.go", "content": "// Package qr can be used to create QR barcodes.\npackage qr\n\nimport (\n\t\"image\"\n\n\t\"github.com/boombuler/barcode\"\n\t\"github.com/boombuler/barcode/utils\"\n)\n\ntype encodeFn func(content string, eccLevel ErrorCorrectionLevel) (*utils.BitList, *versionInfo, error)\n\n// Encoding mode for QR Codes.\ntype Encoding byte\n\nconst (\n\t// Auto will choose ths best matching encoding\n\tAuto Encoding = iota\n\t// Numeric encoding only encodes numbers [0-9]\n\tNumeric\n\t// AlphaNumeric encoding only encodes uppercase letters, numbers and [Space], $, %, *, +, -, ., /, :\n\tAlphaNumeric\n\t// Unicode encoding encodes the string as utf-8\n\tUnicode\n\t// only for testing purpose\n\tunknownEncoding\n)\n\nfunc (e Encoding) getEncoder() encodeFn {\n\tswitch e {\n\tcase Auto:\n\t\treturn encodeAuto\n\tcase Numeric:\n\t\treturn encodeNumeric\n\tcase AlphaNumeric:\n\t\treturn encodeAlphaNumeric\n\tcase Unicode:\n\t\treturn encodeUnicode\n\t}\n\treturn nil\n}\n\nfunc (e Encoding) String() string {\n\tswitch e {\n\tcase Auto:\n\t\treturn \"Auto\"\n\tcase Numeric:\n\t\treturn \"Numeric\"\n\tcase AlphaNumeric:\n\t\treturn \"AlphaNumeric\"\n\tcase Unicode:\n\t\treturn \"Unicode\"\n\t}\n\treturn \"\"\n}\n\n// Encode returns a QR barcode with the given content, error correction level and uses the given encoding\nfunc Encode(content string, level ErrorCorrectionLevel, mode Encoding) (barcode.Barcode, error) {\n\tbits, vi, err := mode.getEncoder()(content, level)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tblocks := splitToBlocks(bits.IterateBytes(), vi)\n\tdata := blocks.interleave(vi)\n\tresult := render(data, vi)\n\tresult.content = content\n\treturn result, nil\n}\n\nfunc render(data []byte, vi *versionInfo) *qrcode {\n\tdim := vi.modulWidth()\n\tresults := make([]*qrcode, 8)\n\tfor i := 0; i < 8; i++ {\n\t\tresults[i] = newBarcode(dim)\n\t}\n\n\toccupied := newBarcode(dim)\n\n\tsetAll := func(x int, y int, val bool) {\n\t\toccupied.Set(x, y, true)\n\t\tfor i := 0; i < 8; i++ {\n\t\t\tresults[i].Set(x, y, val)\n\t\t}\n\t}\n\n\tdrawFinderPatterns(vi, setAll)\n\tdrawAlignmentPatterns(occupied, vi, setAll)\n\n\t//Timing Pattern:\n\tvar i int\n\tfor i = 0; i < dim; i++ {\n\t\tif !occupied.Get(i, 6) {\n\t\t\tsetAll(i, 6, i%2 == 0)\n\t\t}\n\t\tif !occupied.Get(6, i) {\n\t\t\tsetAll(6, i, i%2 == 0)\n\t\t}\n\t}\n\t// Dark Module\n\tsetAll(8, dim-8, true)\n\n\tdrawVersionInfo(vi, setAll)\n\tdrawFormatInfo(vi, -1, occupied.Set)\n\tfor i := 0; i < 8; i++ {\n\t\tdrawFormatInfo(vi, i, results[i].Set)\n\t}\n\n\t// Write the data\n\tvar curBitNo int\n\n\tfor pos := range iterateModules(occupied) {\n\t\tvar curBit bool\n\t\tif curBitNo < len(data)*8 {\n\t\t\tcurBit = ((data[curBitNo/8] >> uint(7-(curBitNo%8))) & 1) == 1\n\t\t} else {\n\t\t\tcurBit = false\n\t\t}\n\n\t\tfor i := 0; i < 8; i++ {\n\t\t\tsetMasked(pos.X, pos.Y, curBit, i, results[i].Set)\n\t\t}\n\t\tcurBitNo++\n\t}\n\n\tlowestPenalty := ^uint(0)\n\tlowestPenaltyIdx := -1\n\tfor i := 0; i < 8; i++ {\n\t\tp := results[i].calcPenalty()\n\t\tif p < lowestPenalty {\n\t\t\tlowestPenalty = p\n\t\t\tlowestPenaltyIdx = i\n\t\t}\n\t}\n\treturn results[lowestPenaltyIdx]\n}\n\nfunc setMasked(x, y int, val bool, mask int, set func(int, int, bool)) {\n\tswitch mask {\n\tcase 0:\n\t\tval = val != (((y + x) % 2) == 0)\n\t\tbreak\n\tcase 1:\n\t\tval = val != ((y % 2) == 0)\n\t\tbreak\n\tcase 2:\n\t\tval = val != ((x % 3) == 0)\n\t\tbreak\n\tcase 3:\n\t\tval = val != (((y + x) % 3) == 0)\n\t\tbreak\n\tcase 4:\n\t\tval = val != (((y/2 + x/3) % 2) == 0)\n\t\tbreak\n\tcase 5:\n\t\tval = val != (((y*x)%2)+((y*x)%3) == 0)\n\t\tbreak\n\tcase 6:\n\t\tval = val != ((((y*x)%2)+((y*x)%3))%2 == 0)\n\t\tbreak\n\tcase 7:\n\t\tval = val != ((((y+x)%2)+((y*x)%3))%2 == 0)\n\t}\n\tset(x, y, val)\n}\n\nfunc iterateModules(occupied *qrcode) <-chan image.Point {\n\tresult := make(chan image.Point)\n\tallPoints := make(chan image.Point)\n\tgo func() {\n\t\tcurX := occupied.dimension - 1\n\t\tcurY := occupied.dimension - 1\n\t\tisUpward := true\n\n\t\tfor true {\n\t\t\tif isUpward {\n\t\t\t\tallPoints <- image.Pt(curX, curY)\n\t\t\t\tallPoints <- image.Pt(curX-1, curY)\n\t\t\t\tcurY--\n\t\t\t\tif curY < 0 {\n\t\t\t\t\tcurY = 0\n\t\t\t\t\tcurX -= 2\n\t\t\t\t\tif curX == 6 {\n\t\t\t\t\t\tcurX--\n\t\t\t\t\t}\n\t\t\t\t\tif curX < 0 {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t\tisUpward = false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tallPoints <- image.Pt(curX, curY)\n\t\t\t\tallPoints <- image.Pt(curX-1, curY)\n\t\t\t\tcurY++\n\t\t\t\tif curY >= occupied.dimension {\n\t\t\t\t\tcurY = occupied.dimension - 1\n\t\t\t\t\tcurX -= 2\n\t\t\t\t\tif curX == 6 {\n\t\t\t\t\t\tcurX--\n\t\t\t\t\t}\n\t\t\t\t\tisUpward = true\n\t\t\t\t\tif curX < 0 {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tclose(allPoints)\n\t}()\n\tgo func() {\n\t\tfor pt := range allPoints {\n\t\t\tif !occupied.Get(pt.X, pt.Y) {\n\t\t\t\tresult <- pt\n\t\t\t}\n\t\t}\n\t\tclose(result)\n\t}()\n\treturn result\n}\n\nfunc drawFinderPatterns(vi *versionInfo, set func(int, int, bool)) {\n\tdim := vi.modulWidth()\n\tdrawPattern := func(xoff int, yoff int) {\n\t\tfor x := -1; x < 8; x++ {\n\t\t\tfor y := -1; y < 8; y++ {\n\t\t\t\tval := (x == 0 || x == 6 || y == 0 || y == 6 || (x > 1 && x < 5 && y > 1 && y < 5)) && (x <= 6 && y <= 6 && x >= 0 && y >= 0)\n\n\t\t\t\tif x+xoff >= 0 && x+xoff < dim && y+yoff >= 0 && y+yoff < dim {\n\t\t\t\t\tset(x+xoff, y+yoff, val)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tdrawPattern(0, 0)\n\tdrawPattern(0, dim-7)\n\tdrawPattern(dim-7, 0)\n}\n\nfunc drawAlignmentPatterns(occupied *qrcode, vi *versionInfo, set func(int, int, bool)) {\n\tdrawPattern := func(xoff int, yoff int) {\n\t\tfor x := -2; x <= 2; x++ {\n\t\t\tfor y := -2; y <= 2; y++ {\n\t\t\t\tval := x == -2 || x == 2 || y == -2 || y == 2 || (x == 0 && y == 0)\n\t\t\t\tset(x+xoff, y+yoff, val)\n\t\t\t}\n\t\t}\n\t}\n\tpositions := vi.alignmentPatternPlacements()\n\n\tfor _, x := range positions {\n\t\tfor _, y := range positions {\n\t\t\tif occupied.Get(x, y) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tdrawPattern(x, y)\n\t\t}\n\t}\n}\n\nvar formatInfos = map[ErrorCorrectionLevel]map[int][]bool{\n\tL: {\n\t\t0: []bool{true, true, true, false, true, true, true, true, true, false, false, false, true, false, false},\n\t\t1: []bool{true, true, true, false, false, true, false, true, true, true, true, false, false, true, true},\n\t\t2: []bool{true, true, true, true, true, false, true, true, false, true, false, true, false, true, false},\n\t\t3: []bool{true, true, true, true, false, false, false, true, false, false, true, true, true, false, true},\n\t\t4: []bool{true, true, false, false, true, true, false, false, false, true, false, true, true, true, true},\n\t\t5: []bool{true, true, false, false, false, true, true, false, false, false, true, true, false, false, false},\n\t\t6: []bool{true, true, false, true, true, false, false, false, true, false, false, false, false, false, true},\n\t\t7: []bool{true, true, false, true, false, false, true, false, true, true, true, false, true, true, false},\n\t},\n\tM: {\n\t\t0: []bool{true, false, true, false, true, false, false, false, false, false, true, false, false, true, false},\n\t\t1: []bool{true, false, true, false, false, false, true, false, false, true, false, false, true, false, true},\n\t\t2: []bool{true, false, true, true, true, true, false, false, true, true, true, true, true, false, false},\n\t\t3: []bool{true, false, true, true, false, true, true, false, true, false, false, true, false, true, true},\n\t\t4: []bool{true, false, false, false, true, false, true, true, true, true, true, true, false, false, true},\n\t\t5: []bool{true, false, false, false, false, false, false, true, true, false, false, true, true, true, false},\n\t\t6: []bool{true, false, false, true, true, true, true, true, false, false, true, false, true, true, true},\n\t\t7: []bool{true, false, false, true, false, true, false, true, false, true, false, false, false, false, false},\n\t},\n\tQ: {\n\t\t0: []bool{false, true, true, false, true, false, true, false, true, false, true, true, true, true, true},\n\t\t1: []bool{false, true, true, false, false, false, false, false, true, true, false, true, false, false, false},\n\t\t2: []bool{false, true, true, true, true, true, true, false, false, true, true, false, false, false, true},\n\t\t3: []bool{false, true, true, true, false, true, false, false, false, false, false, false, true, true, false},\n\t\t4: []bool{false, true, false, false, true, false, false, true, false, true, true, false, true, false, false},\n\t\t5: []bool{false, true, false, false, false, false, true, true, false, false, false, false, false, true, true},\n\t\t6: []bool{false, true, false, true, true, true, false, true, true, false, true, true, false, true, false},\n\t\t7: []bool{false, true, false, true, false, true, true, true, true, true, false, true, true, false, true},\n\t},\n\tH: {\n\t\t0: []bool{false, false, true, false, true, true, false, true, false, false, false, true, false, false, true},\n\t\t1: []bool{false, false, true, false, false, true, true, true, false, true, true, true, true, true, false},\n\t\t2: []bool{false, false, true, true, true, false, false, true, true, true, false, false, true, true, true},\n\t\t3: []bool{false, false, true, true, false, false, true, true, true, false, true, false, false, false, false},\n\t\t4: []bool{false, false, false, false, true, true, true, false, true, true, false, false, false, true, false},\n\t\t5: []bool{false, false, false, false, false, true, false, false, true, false, true, false, true, false, true},\n\t\t6: []bool{false, false, false, true, true, false, true, false, false, false, false, true, true, false, false},\n\t\t7: []bool{false, false, false, true, false, false, false, false, false, true, true, true, false, true, true},\n\t},\n}\n\nfunc drawFormatInfo(vi *versionInfo, usedMask int, set func(int, int, bool)) {\n\tvar formatInfo []bool\n\n\tif usedMask == -1 {\n\t\tformatInfo = []bool{true, true, true, true, true, true, true, true, true, true, true, true, true, true, true} // Set all to true cause -1 --> occupied mask.\n\t} else {\n\t\tformatInfo = formatInfos[vi.Level][usedMask]\n\t}\n\n\tif len(formatInfo) == 15 {\n\t\tdim := vi.modulWidth()\n\t\tset(0, 8, formatInfo[0])\n\t\tset(1, 8, formatInfo[1])\n\t\tset(2, 8, formatInfo[2])\n\t\tset(3, 8, formatInfo[3])\n\t\tset(4, 8, formatInfo[4])\n\t\tset(5, 8, formatInfo[5])\n\t\tset(7, 8, formatInfo[6])\n\t\tset(8, 8, formatInfo[7])\n\t\tset(8, 7, formatInfo[8])\n\t\tset(8, 5, formatInfo[9])\n\t\tset(8, 4, formatInfo[10])\n\t\tset(8, 3, formatInfo[11])\n\t\tset(8, 2, formatInfo[12])\n\t\tset(8, 1, formatInfo[13])\n\t\tset(8, 0, formatInfo[14])\n\n\t\tset(8, dim-1, formatInfo[0])\n\t\tset(8, dim-2, formatInfo[1])\n\t\tset(8, dim-3, formatInfo[2])\n\t\tset(8, dim-4, formatInfo[3])\n\t\tset(8, dim-5, formatInfo[4])\n\t\tset(8, dim-6, formatInfo[5])\n\t\tset(8, dim-7, formatInfo[6])\n\t\tset(dim-8, 8, formatInfo[7])\n\t\tset(dim-7, 8, formatInfo[8])\n\t\tset(dim-6, 8, formatInfo[9])\n\t\tset(dim-5, 8, formatInfo[10])\n\t\tset(dim-4, 8, formatInfo[11])\n\t\tset(dim-3, 8, formatInfo[12])\n\t\tset(dim-2, 8, formatInfo[13])\n\t\tset(dim-1, 8, formatInfo[14])\n\t}\n}\n\nvar versionInfoBitsByVersion = map[byte][]bool{\n\t7: []bool{false, false, false, true, true, true, true, true, false, false, true, false, false, true, false, true, false, false},\n\t8: []bool{false, false, true, false, false, false, false, true, false, true, true, false, true, true, true, true, false, false},\n\t9: []bool{false, false, true, false, false, true, true, false, true, false, true, false, false, true, true, false, false, true},\n\t10: []bool{false, false, true, false, true, false, false, true, false, false, true, true, false, true, false, false, true, true},\n\t11: []bool{false, false, true, false, true, true, true, false, true, true, true, true, true, true, false, true, true, false},\n\t12: []bool{false, false, true, true, false, false, false, true, true, true, false, true, true, false, false, false, true, false},\n\t13: []bool{false, false, true, true, false, true, true, false, false, false, false, true, false, false, false, true, true, true},\n\t14: []bool{false, false, true, true, true, false, false, true, true, false, false, false, false, false, true, true, false, true},\n\t15: []bool{false, false, true, true, true, true, true, false, false, true, false, false, true, false, true, false, false, false},\n\t16: []bool{false, true, false, false, false, false, true, false, true, true, false, true, true, true, true, false, false, false},\n\t17: []bool{false, true, false, false, false, true, false, true, false, false, false, true, false, true, true, true, false, true},\n\t18: []bool{false, true, false, false, true, false, true, false, true, false, false, false, false, true, false, true, true, true},\n\t19: []bool{false, true, false, false, true, true, false, true, false, true, false, false, true, true, false, false, true, false},\n\t20: []bool{false, true, false, true, false, false, true, false, false, true, true, false, true, false, false, true, true, false},\n\t21: []bool{false, true, false, true, false, true, false, true, true, false, true, false, false, false, false, false, true, true},\n\t22: []bool{false, true, false, true, true, false, true, false, false, false, true, true, false, false, true, false, false, true},\n\t23: []bool{false, true, false, true, true, true, false, true, true, true, true, true, true, false, true, true, false, false},\n\t24: []bool{false, true, true, false, false, false, true, true, true, false, true, true, false, false, false, true, false, false},\n\t25: []bool{false, true, true, false, false, true, false, false, false, true, true, true, true, false, false, false, false, true},\n\t26: []bool{false, true, true, false, true, false, true, true, true, true, true, false, true, false, true, false, true, true},\n\t27: []bool{false, true, true, false, true, true, false, false, false, false, true, false, false, false, true, true, true, false},\n\t28: []bool{false, true, true, true, false, false, true, true, false, false, false, false, false, true, true, false, true, false},\n\t29: []bool{false, true, true, true, false, true, false, false, true, true, false, false, true, true, true, true, true, true},\n\t30: []bool{false, true, true, true, true, false, true, true, false, true, false, true, true, true, false, true, false, true},\n\t31: []bool{false, true, true, true, true, true, false, false, true, false, false, true, false, true, false, false, false, false},\n\t32: []bool{true, false, false, false, false, false, true, false, false, true, true, true, false, true, false, true, false, true},\n\t33: []bool{true, false, false, false, false, true, false, true, true, false, true, true, true, true, false, false, false, false},\n\t34: []bool{true, false, false, false, true, false, true, false, false, false, true, false, true, true, true, false, true, false},\n\t35: []bool{true, false, false, false, true, true, false, true, true, true, true, false, false, true, true, true, true, true},\n\t36: []bool{true, false, false, true, false, false, true, false, true, true, false, false, false, false, true, false, true, true},\n\t37: []bool{true, false, false, true, false, true, false, true, false, false, false, false, true, false, true, true, true, false},\n\t38: []bool{true, false, false, true, true, false, true, false, true, false, false, true, true, false, false, true, false, false},\n\t39: []bool{true, false, false, true, true, true, false, true, false, true, false, true, false, false, false, false, false, true},\n\t40: []bool{true, false, true, false, false, false, true, true, false, false, false, true, true, false, true, false, false, true},\n}\n\nfunc drawVersionInfo(vi *versionInfo, set func(int, int, bool)) {\n\tversionInfoBits, ok := versionInfoBitsByVersion[vi.Version]\n\n\tif ok && len(versionInfoBits) > 0 {\n\t\tfor i := 0; i < len(versionInfoBits); i++ {\n\t\t\tx := (vi.modulWidth() - 11) + i%3\n\t\t\ty := i / 3\n\t\t\tset(x, y, versionInfoBits[len(versionInfoBits)-i-1])\n\t\t\tset(y, x, versionInfoBits[len(versionInfoBits)-i-1])\n\t\t}\n\t}\n\n}\n\nfunc addPaddingAndTerminator(bl *utils.BitList, vi *versionInfo) {\n\tfor i := 0; i < 4 && bl.Len() < vi.totalDataBytes()*8; i++ {\n\t\tbl.AddBit(false)\n\t}\n\n\tfor bl.Len()%8 != 0 {\n\t\tbl.AddBit(false)\n\t}\n\n\tfor i := 0; bl.Len() < vi.totalDataBytes()*8; i++ {\n\t\tif i%2 == 0 {\n\t\t\tbl.AddByte(236)\n\t\t} else {\n\t\t\tbl.AddByte(17)\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/errorcorrection.go", "content": "package qr\n\nimport (\n\t\"github.com/boombuler/barcode/utils\"\n)\n\ntype errorCorrection struct {\n\trs *utils.ReedSolomonEncoder\n}\n\nvar ec = newErrorCorrection()\n\nfunc newErrorCorrection() *errorCorrection {\n\tfld := utils.NewGaloisField(285, 256, 0)\n\treturn &errorCorrection{utils.NewReedSolomonEncoder(fld)}\n}\n\nfunc (ec *errorCorrection) calcECC(data []byte, eccCount byte) []byte {\n\tdataInts := make([]int, len(data))\n\tfor i := 0; i < len(data); i++ {\n\t\tdataInts[i] = int(data[i])\n\t}\n\tres := ec.rs.Encode(dataInts, int(eccCount))\n\tresult := make([]byte, len(res))\n\tfor i := 0; i < len(res); i++ {\n\t\tresult[i] = byte(res[i])\n\t}\n\treturn result\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/numeric.go", "content": "package qr\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"strconv\"\n\n\t\"github.com/boombuler/barcode/utils\"\n)\n\nfunc encodeNumeric(content string, ecl ErrorCorrectionLevel) (*utils.BitList, *versionInfo, error) {\n\tcontentBitCount := (len(content) / 3) * 10\n\tswitch len(content) % 3 {\n\tcase 1:\n\t\tcontentBitCount += 4\n\tcase 2:\n\t\tcontentBitCount += 7\n\t}\n\tvi := findSmallestVersionInfo(ecl, numericMode, contentBitCount)\n\tif vi == nil {\n\t\treturn nil, nil, errors.New(\"To much data to encode\")\n\t}\n\tres := new(utils.BitList)\n\tres.AddBits(int(numericMode), 4)\n\tres.AddBits(len(content), vi.charCountBits(numericMode))\n\n\tfor pos := 0; pos < len(content); pos += 3 {\n\t\tvar curStr string\n\t\tif pos+3 <= len(content) {\n\t\t\tcurStr = content[pos : pos+3]\n\t\t} else {\n\t\t\tcurStr = content[pos:]\n\t\t}\n\n\t\ti, err := strconv.Atoi(curStr)\n\t\tif err != nil || i < 0 {\n\t\t\treturn nil, nil, fmt.Errorf(\"\\\"%s\\\" can not be encoded as %s\", content, Numeric)\n\t\t}\n\t\tvar bitCnt byte\n\t\tswitch len(curStr) % 3 {\n\t\tcase 0:\n\t\t\tbitCnt = 10\n\t\tcase 1:\n\t\t\tbitCnt = 4\n\t\t\tbreak\n\t\tcase 2:\n\t\t\tbitCnt = 7\n\t\t\tbreak\n\t\t}\n\n\t\tres.AddBits(i, bitCnt)\n\t}\n\n\taddPaddingAndTerminator(res, vi)\n\treturn res, vi, nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/qrcode.go", "content": "package qr\n\nimport (\n\t\"image\"\n\t\"image/color\"\n\t\"math\"\n\n\t\"github.com/boombuler/barcode\"\n\t\"github.com/boombuler/barcode/utils\"\n)\n\ntype qrcode struct {\n\tdimension int\n\tdata *utils.BitList\n\tcontent string\n}\n\nfunc (qr *qrcode) Content() string {\n\treturn qr.content\n}\n\nfunc (qr *qrcode) Metadata() barcode.Metadata {\n\treturn barcode.Metadata{barcode.TypeQR, 2}\n}\n\nfunc (qr *qrcode) ColorModel() color.Model {\n\treturn color.Gray16Model\n}\n\nfunc (qr *qrcode) Bounds() image.Rectangle {\n\treturn image.Rect(0, 0, qr.dimension, qr.dimension)\n}\n\nfunc (qr *qrcode) At(x, y int) color.Color {\n\tif qr.Get(x, y) {\n\t\treturn color.Black\n\t}\n\treturn color.White\n}\n\nfunc (qr *qrcode) Get(x, y int) bool {\n\treturn qr.data.GetBit(x*qr.dimension + y)\n}\n\nfunc (qr *qrcode) Set(x, y int, val bool) {\n\tqr.data.SetBit(x*qr.dimension+y, val)\n}\n\nfunc (qr *qrcode) calcPenalty() uint {\n\treturn qr.calcPenaltyRule1() + qr.calcPenaltyRule2() + qr.calcPenaltyRule3() + qr.calcPenaltyRule4()\n}\n\nfunc (qr *qrcode) calcPenaltyRule1() uint {\n\tvar result uint\n\tfor x := 0; x < qr.dimension; x++ {\n\t\tcheckForX := false\n\t\tvar cntX uint\n\t\tcheckForY := false\n\t\tvar cntY uint\n\n\t\tfor y := 0; y < qr.dimension; y++ {\n\t\t\tif qr.Get(x, y) == checkForX {\n\t\t\t\tcntX++\n\t\t\t} else {\n\t\t\t\tcheckForX = !checkForX\n\t\t\t\tif cntX >= 5 {\n\t\t\t\t\tresult += cntX - 2\n\t\t\t\t}\n\t\t\t\tcntX = 1\n\t\t\t}\n\n\t\t\tif qr.Get(y, x) == checkForY {\n\t\t\t\tcntY++\n\t\t\t} else {\n\t\t\t\tcheckForY = !checkForY\n\t\t\t\tif cntY >= 5 {\n\t\t\t\t\tresult += cntY - 2\n\t\t\t\t}\n\t\t\t\tcntY = 1\n\t\t\t}\n\t\t}\n\n\t\tif cntX >= 5 {\n\t\t\tresult += cntX - 2\n\t\t}\n\t\tif cntY >= 5 {\n\t\t\tresult += cntY - 2\n\t\t}\n\t}\n\n\treturn result\n}\n\nfunc (qr *qrcode) calcPenaltyRule2() uint {\n\tvar result uint\n\tfor x := 0; x < qr.dimension-1; x++ {\n\t\tfor y := 0; y < qr.dimension-1; y++ {\n\t\t\tcheck := qr.Get(x, y)\n\t\t\tif qr.Get(x, y+1) == check && qr.Get(x+1, y) == check && qr.Get(x+1, y+1) == check {\n\t\t\t\tresult += 3\n\t\t\t}\n\t\t}\n\t}\n\treturn result\n}\n\nfunc (qr *qrcode) calcPenaltyRule3() uint {\n\tpattern1 := []bool{true, false, true, true, true, false, true, false, false, false, false}\n\tpattern2 := []bool{false, false, false, false, true, false, true, true, true, false, true}\n\n\tvar result uint\n\tfor x := 0; x <= qr.dimension-len(pattern1); x++ {\n\t\tfor y := 0; y < qr.dimension; y++ {\n\t\t\tpattern1XFound := true\n\t\t\tpattern2XFound := true\n\t\t\tpattern1YFound := true\n\t\t\tpattern2YFound := true\n\n\t\t\tfor i := 0; i < len(pattern1); i++ {\n\t\t\t\tiv := qr.Get(x+i, y)\n\t\t\t\tif iv != pattern1[i] {\n\t\t\t\t\tpattern1XFound = false\n\t\t\t\t}\n\t\t\t\tif iv != pattern2[i] {\n\t\t\t\t\tpattern2XFound = false\n\t\t\t\t}\n\t\t\t\tiv = qr.Get(y, x+i)\n\t\t\t\tif iv != pattern1[i] {\n\t\t\t\t\tpattern1YFound = false\n\t\t\t\t}\n\t\t\t\tif iv != pattern2[i] {\n\t\t\t\t\tpattern2YFound = false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif pattern1XFound || pattern2XFound {\n\t\t\t\tresult += 40\n\t\t\t}\n\t\t\tif pattern1YFound || pattern2YFound {\n\t\t\t\tresult += 40\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result\n}\n\nfunc (qr *qrcode) calcPenaltyRule4() uint {\n\ttotalNum := qr.data.Len()\n\ttrueCnt := 0\n\tfor i := 0; i < totalNum; i++ {\n\t\tif qr.data.GetBit(i) {\n\t\t\ttrueCnt++\n\t\t}\n\t}\n\tpercDark := float64(trueCnt) * 100 / float64(totalNum)\n\tfloor := math.Abs(math.Floor(percDark/5) - 10)\n\tceil := math.Abs(math.Ceil(percDark/5) - 10)\n\treturn uint(math.Min(floor, ceil) * 10)\n}\n\nfunc newBarcode(dim int) *qrcode {\n\tres := new(qrcode)\n\tres.dimension = dim\n\tres.data = utils.NewBitList(dim * dim)\n\treturn res\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/unicode.go", "content": "package qr\n\nimport (\n\t\"errors\"\n\n\t\"github.com/boombuler/barcode/utils\"\n)\n\nfunc encodeUnicode(content string, ecl ErrorCorrectionLevel) (*utils.BitList, *versionInfo, error) {\n\tdata := []byte(content)\n\n\tvi := findSmallestVersionInfo(ecl, byteMode, len(data)*8)\n\tif vi == nil {\n\t\treturn nil, nil, errors.New(\"To much data to encode\")\n\t}\n\n\t// It's not correct to add the unicode bytes to the result directly but most readers can't handle the\n\t// required ECI header...\n\tres := new(utils.BitList)\n\tres.AddBits(int(byteMode), 4)\n\tres.AddBits(len(content), vi.charCountBits(byteMode))\n\tfor _, b := range data {\n\t\tres.AddByte(b)\n\t}\n\taddPaddingAndTerminator(res, vi)\n\treturn res, vi, nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/qr/versioninfo.go", "content": "package qr\n\nimport \"math\"\n\n// ErrorCorrectionLevel indicates the amount of \"backup data\" stored in the QR code\ntype ErrorCorrectionLevel byte\n\nconst (\n\t// L recovers 7% of data\n\tL ErrorCorrectionLevel = iota\n\t// M recovers 15% of data\n\tM\n\t// Q recovers 25% of data\n\tQ\n\t// H recovers 30% of data\n\tH\n)\n\nfunc (ecl ErrorCorrectionLevel) String() string {\n\tswitch ecl {\n\tcase L:\n\t\treturn \"L\"\n\tcase M:\n\t\treturn \"M\"\n\tcase Q:\n\t\treturn \"Q\"\n\tcase H:\n\t\treturn \"H\"\n\t}\n\treturn \"unknown\"\n}\n\ntype encodingMode byte\n\nconst (\n\tnumericMode encodingMode = 1\n\talphaNumericMode encodingMode = 2\n\tbyteMode encodingMode = 4\n\tkanjiMode encodingMode = 8\n)\n\ntype versionInfo struct {\n\tVersion byte\n\tLevel ErrorCorrectionLevel\n\tErrorCorrectionCodewordsPerBlock byte\n\tNumberOfBlocksInGroup1 byte\n\tDataCodeWordsPerBlockInGroup1 byte\n\tNumberOfBlocksInGroup2 byte\n\tDataCodeWordsPerBlockInGroup2 byte\n}\n\nvar versionInfos = []*versionInfo{\n\t&versionInfo{1, L, 7, 1, 19, 0, 0},\n\t&versionInfo{1, M, 10, 1, 16, 0, 0},\n\t&versionInfo{1, Q, 13, 1, 13, 0, 0},\n\t&versionInfo{1, H, 17, 1, 9, 0, 0},\n\t&versionInfo{2, L, 10, 1, 34, 0, 0},\n\t&versionInfo{2, M, 16, 1, 28, 0, 0},\n\t&versionInfo{2, Q, 22, 1, 22, 0, 0},\n\t&versionInfo{2, H, 28, 1, 16, 0, 0},\n\t&versionInfo{3, L, 15, 1, 55, 0, 0},\n\t&versionInfo{3, M, 26, 1, 44, 0, 0},\n\t&versionInfo{3, Q, 18, 2, 17, 0, 0},\n\t&versionInfo{3, H, 22, 2, 13, 0, 0},\n\t&versionInfo{4, L, 20, 1, 80, 0, 0},\n\t&versionInfo{4, M, 18, 2, 32, 0, 0},\n\t&versionInfo{4, Q, 26, 2, 24, 0, 0},\n\t&versionInfo{4, H, 16, 4, 9, 0, 0},\n\t&versionInfo{5, L, 26, 1, 108, 0, 0},\n\t&versionInfo{5, M, 24, 2, 43, 0, 0},\n\t&versionInfo{5, Q, 18, 2, 15, 2, 16},\n\t&versionInfo{5, H, 22, 2, 11, 2, 12},\n\t&versionInfo{6, L, 18, 2, 68, 0, 0},\n\t&versionInfo{6, M, 16, 4, 27, 0, 0},\n\t&versionInfo{6, Q, 24, 4, 19, 0, 0},\n\t&versionInfo{6, H, 28, 4, 15, 0, 0},\n\t&versionInfo{7, L, 20, 2, 78, 0, 0},\n\t&versionInfo{7, M, 18, 4, 31, 0, 0},\n\t&versionInfo{7, Q, 18, 2, 14, 4, 15},\n\t&versionInfo{7, H, 26, 4, 13, 1, 14},\n\t&versionInfo{8, L, 24, 2, 97, 0, 0},\n\t&versionInfo{8, M, 22, 2, 38, 2, 39},\n\t&versionInfo{8, Q, 22, 4, 18, 2, 19},\n\t&versionInfo{8, H, 26, 4, 14, 2, 15},\n\t&versionInfo{9, L, 30, 2, 116, 0, 0},\n\t&versionInfo{9, M, 22, 3, 36, 2, 37},\n\t&versionInfo{9, Q, 20, 4, 16, 4, 17},\n\t&versionInfo{9, H, 24, 4, 12, 4, 13},\n\t&versionInfo{10, L, 18, 2, 68, 2, 69},\n\t&versionInfo{10, M, 26, 4, 43, 1, 44},\n\t&versionInfo{10, Q, 24, 6, 19, 2, 20},\n\t&versionInfo{10, H, 28, 6, 15, 2, 16},\n\t&versionInfo{11, L, 20, 4, 81, 0, 0},\n\t&versionInfo{11, M, 30, 1, 50, 4, 51},\n\t&versionInfo{11, Q, 28, 4, 22, 4, 23},\n\t&versionInfo{11, H, 24, 3, 12, 8, 13},\n\t&versionInfo{12, L, 24, 2, 92, 2, 93},\n\t&versionInfo{12, M, 22, 6, 36, 2, 37},\n\t&versionInfo{12, Q, 26, 4, 20, 6, 21},\n\t&versionInfo{12, H, 28, 7, 14, 4, 15},\n\t&versionInfo{13, L, 26, 4, 107, 0, 0},\n\t&versionInfo{13, M, 22, 8, 37, 1, 38},\n\t&versionInfo{13, Q, 24, 8, 20, 4, 21},\n\t&versionInfo{13, H, 22, 12, 11, 4, 12},\n\t&versionInfo{14, L, 30, 3, 115, 1, 116},\n\t&versionInfo{14, M, 24, 4, 40, 5, 41},\n\t&versionInfo{14, Q, 20, 11, 16, 5, 17},\n\t&versionInfo{14, H, 24, 11, 12, 5, 13},\n\t&versionInfo{15, L, 22, 5, 87, 1, 88},\n\t&versionInfo{15, M, 24, 5, 41, 5, 42},\n\t&versionInfo{15, Q, 30, 5, 24, 7, 25},\n\t&versionInfo{15, H, 24, 11, 12, 7, 13},\n\t&versionInfo{16, L, 24, 5, 98, 1, 99},\n\t&versionInfo{16, M, 28, 7, 45, 3, 46},\n\t&versionInfo{16, Q, 24, 15, 19, 2, 20},\n\t&versionInfo{16, H, 30, 3, 15, 13, 16},\n\t&versionInfo{17, L, 28, 1, 107, 5, 108},\n\t&versionInfo{17, M, 28, 10, 46, 1, 47},\n\t&versionInfo{17, Q, 28, 1, 22, 15, 23},\n\t&versionInfo{17, H, 28, 2, 14, 17, 15},\n\t&versionInfo{18, L, 30, 5, 120, 1, 121},\n\t&versionInfo{18, M, 26, 9, 43, 4, 44},\n\t&versionInfo{18, Q, 28, 17, 22, 1, 23},\n\t&versionInfo{18, H, 28, 2, 14, 19, 15},\n\t&versionInfo{19, L, 28, 3, 113, 4, 114},\n\t&versionInfo{19, M, 26, 3, 44, 11, 45},\n\t&versionInfo{19, Q, 26, 17, 21, 4, 22},\n\t&versionInfo{19, H, 26, 9, 13, 16, 14},\n\t&versionInfo{20, L, 28, 3, 107, 5, 108},\n\t&versionInfo{20, M, 26, 3, 41, 13, 42},\n\t&versionInfo{20, Q, 30, 15, 24, 5, 25},\n\t&versionInfo{20, H, 28, 15, 15, 10, 16},\n\t&versionInfo{21, L, 28, 4, 116, 4, 117},\n\t&versionInfo{21, M, 26, 17, 42, 0, 0},\n\t&versionInfo{21, Q, 28, 17, 22, 6, 23},\n\t&versionInfo{21, H, 30, 19, 16, 6, 17},\n\t&versionInfo{22, L, 28, 2, 111, 7, 112},\n\t&versionInfo{22, M, 28, 17, 46, 0, 0},\n\t&versionInfo{22, Q, 30, 7, 24, 16, 25},\n\t&versionInfo{22, H, 24, 34, 13, 0, 0},\n\t&versionInfo{23, L, 30, 4, 121, 5, 122},\n\t&versionInfo{23, M, 28, 4, 47, 14, 48},\n\t&versionInfo{23, Q, 30, 11, 24, 14, 25},\n\t&versionInfo{23, H, 30, 16, 15, 14, 16},\n\t&versionInfo{24, L, 30, 6, 117, 4, 118},\n\t&versionInfo{24, M, 28, 6, 45, 14, 46},\n\t&versionInfo{24, Q, 30, 11, 24, 16, 25},\n\t&versionInfo{24, H, 30, 30, 16, 2, 17},\n\t&versionInfo{25, L, 26, 8, 106, 4, 107},\n\t&versionInfo{25, M, 28, 8, 47, 13, 48},\n\t&versionInfo{25, Q, 30, 7, 24, 22, 25},\n\t&versionInfo{25, H, 30, 22, 15, 13, 16},\n\t&versionInfo{26, L, 28, 10, 114, 2, 115},\n\t&versionInfo{26, M, 28, 19, 46, 4, 47},\n\t&versionInfo{26, Q, 28, 28, 22, 6, 23},\n\t&versionInfo{26, H, 30, 33, 16, 4, 17},\n\t&versionInfo{27, L, 30, 8, 122, 4, 123},\n\t&versionInfo{27, M, 28, 22, 45, 3, 46},\n\t&versionInfo{27, Q, 30, 8, 23, 26, 24},\n\t&versionInfo{27, H, 30, 12, 15, 28, 16},\n\t&versionInfo{28, L, 30, 3, 117, 10, 118},\n\t&versionInfo{28, M, 28, 3, 45, 23, 46},\n\t&versionInfo{28, Q, 30, 4, 24, 31, 25},\n\t&versionInfo{28, H, 30, 11, 15, 31, 16},\n\t&versionInfo{29, L, 30, 7, 116, 7, 117},\n\t&versionInfo{29, M, 28, 21, 45, 7, 46},\n\t&versionInfo{29, Q, 30, 1, 23, 37, 24},\n\t&versionInfo{29, H, 30, 19, 15, 26, 16},\n\t&versionInfo{30, L, 30, 5, 115, 10, 116},\n\t&versionInfo{30, M, 28, 19, 47, 10, 48},\n\t&versionInfo{30, Q, 30, 15, 24, 25, 25},\n\t&versionInfo{30, H, 30, 23, 15, 25, 16},\n\t&versionInfo{31, L, 30, 13, 115, 3, 116},\n\t&versionInfo{31, M, 28, 2, 46, 29, 47},\n\t&versionInfo{31, Q, 30, 42, 24, 1, 25},\n\t&versionInfo{31, H, 30, 23, 15, 28, 16},\n\t&versionInfo{32, L, 30, 17, 115, 0, 0},\n\t&versionInfo{32, M, 28, 10, 46, 23, 47},\n\t&versionInfo{32, Q, 30, 10, 24, 35, 25},\n\t&versionInfo{32, H, 30, 19, 15, 35, 16},\n\t&versionInfo{33, L, 30, 17, 115, 1, 116},\n\t&versionInfo{33, M, 28, 14, 46, 21, 47},\n\t&versionInfo{33, Q, 30, 29, 24, 19, 25},\n\t&versionInfo{33, H, 30, 11, 15, 46, 16},\n\t&versionInfo{34, L, 30, 13, 115, 6, 116},\n\t&versionInfo{34, M, 28, 14, 46, 23, 47},\n\t&versionInfo{34, Q, 30, 44, 24, 7, 25},\n\t&versionInfo{34, H, 30, 59, 16, 1, 17},\n\t&versionInfo{35, L, 30, 12, 121, 7, 122},\n\t&versionInfo{35, M, 28, 12, 47, 26, 48},\n\t&versionInfo{35, Q, 30, 39, 24, 14, 25},\n\t&versionInfo{35, H, 30, 22, 15, 41, 16},\n\t&versionInfo{36, L, 30, 6, 121, 14, 122},\n\t&versionInfo{36, M, 28, 6, 47, 34, 48},\n\t&versionInfo{36, Q, 30, 46, 24, 10, 25},\n\t&versionInfo{36, H, 30, 2, 15, 64, 16},\n\t&versionInfo{37, L, 30, 17, 122, 4, 123},\n\t&versionInfo{37, M, 28, 29, 46, 14, 47},\n\t&versionInfo{37, Q, 30, 49, 24, 10, 25},\n\t&versionInfo{37, H, 30, 24, 15, 46, 16},\n\t&versionInfo{38, L, 30, 4, 122, 18, 123},\n\t&versionInfo{38, M, 28, 13, 46, 32, 47},\n\t&versionInfo{38, Q, 30, 48, 24, 14, 25},\n\t&versionInfo{38, H, 30, 42, 15, 32, 16},\n\t&versionInfo{39, L, 30, 20, 117, 4, 118},\n\t&versionInfo{39, M, 28, 40, 47, 7, 48},\n\t&versionInfo{39, Q, 30, 43, 24, 22, 25},\n\t&versionInfo{39, H, 30, 10, 15, 67, 16},\n\t&versionInfo{40, L, 30, 19, 118, 6, 119},\n\t&versionInfo{40, M, 28, 18, 47, 31, 48},\n\t&versionInfo{40, Q, 30, 34, 24, 34, 25},\n\t&versionInfo{40, H, 30, 20, 15, 61, 16},\n}\n\nfunc (vi *versionInfo) totalDataBytes() int {\n\tg1Data := int(vi.NumberOfBlocksInGroup1) * int(vi.DataCodeWordsPerBlockInGroup1)\n\tg2Data := int(vi.NumberOfBlocksInGroup2) * int(vi.DataCodeWordsPerBlockInGroup2)\n\treturn (g1Data + g2Data)\n}\n\nfunc (vi *versionInfo) charCountBits(m encodingMode) byte {\n\tswitch m {\n\tcase numericMode:\n\t\tif vi.Version < 10 {\n\t\t\treturn 10\n\t\t} else if vi.Version < 27 {\n\t\t\treturn 12\n\t\t}\n\t\treturn 14\n\n\tcase alphaNumericMode:\n\t\tif vi.Version < 10 {\n\t\t\treturn 9\n\t\t} else if vi.Version < 27 {\n\t\t\treturn 11\n\t\t}\n\t\treturn 13\n\n\tcase byteMode:\n\t\tif vi.Version < 10 {\n\t\t\treturn 8\n\t\t}\n\t\treturn 16\n\n\tcase kanjiMode:\n\t\tif vi.Version < 10 {\n\t\t\treturn 8\n\t\t} else if vi.Version < 27 {\n\t\t\treturn 10\n\t\t}\n\t\treturn 12\n\tdefault:\n\t\treturn 0\n\t}\n}\n\nfunc (vi *versionInfo) modulWidth() int {\n\treturn ((int(vi.Version) - 1) * 4) + 21\n}\n\nfunc (vi *versionInfo) alignmentPatternPlacements() []int {\n\tif vi.Version == 1 {\n\t\treturn make([]int, 0)\n\t}\n\n\tfirst := 6\n\tlast := vi.modulWidth() - 7\n\tspace := float64(last - first)\n\tcount := int(math.Ceil(space/28)) + 1\n\n\tresult := make([]int, count)\n\tresult[0] = first\n\tresult[len(result)-1] = last\n\tif count > 2 {\n\t\tstep := int(math.Ceil(float64(last-first) / float64(count-1)))\n\t\tif step%2 == 1 {\n\t\t\tfrac := float64(last-first) / float64(count-1)\n\t\t\t_, x := math.Modf(frac)\n\t\t\tif x >= 0.5 {\n\t\t\t\tfrac = math.Ceil(frac)\n\t\t\t} else {\n\t\t\t\tfrac = math.Floor(frac)\n\t\t\t}\n\n\t\t\tif int(frac)%2 == 0 {\n\t\t\t\tstep--\n\t\t\t} else {\n\t\t\t\tstep++\n\t\t\t}\n\t\t}\n\n\t\tfor i := 1; i <= count-2; i++ {\n\t\t\tresult[i] = last - (step * (count - 1 - i))\n\t\t}\n\t}\n\n\treturn result\n}\n\nfunc findSmallestVersionInfo(ecl ErrorCorrectionLevel, mode encodingMode, dataBits int) *versionInfo {\n\tdataBits = dataBits + 4 // mode indicator\n\tfor _, vi := range versionInfos {\n\t\tif vi.Level == ecl {\n\t\t\tif (vi.totalDataBytes() * 8) >= (dataBits + int(vi.charCountBits(mode))) {\n\t\t\t\treturn vi\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/scaledbarcode.go", "content": "package barcode\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"image\"\n\t\"image/color\"\n\t\"math\"\n)\n\ntype wrapFunc func(x, y int) color.Color\n\ntype scaledBarcode struct {\n\twrapped Barcode\n\twrapperFunc wrapFunc\n\trect image.Rectangle\n}\n\ntype intCSscaledBC struct {\n\tscaledBarcode\n}\n\nfunc (bc *scaledBarcode) Content() string {\n\treturn bc.wrapped.Content()\n}\n\nfunc (bc *scaledBarcode) Metadata() Metadata {\n\treturn bc.wrapped.Metadata()\n}\n\nfunc (bc *scaledBarcode) ColorModel() color.Model {\n\treturn bc.wrapped.ColorModel()\n}\n\nfunc (bc *scaledBarcode) Bounds() image.Rectangle {\n\treturn bc.rect\n}\n\nfunc (bc *scaledBarcode) At(x, y int) color.Color {\n\treturn bc.wrapperFunc(x, y)\n}\n\nfunc (bc *intCSscaledBC) CheckSum() int {\n\tif cs, ok := bc.wrapped.(BarcodeIntCS); ok {\n\t\treturn cs.CheckSum()\n\t}\n\treturn 0\n}\n\n// Scale returns a resized barcode with the given width and height.\nfunc Scale(bc Barcode, width, height int) (Barcode, error) {\n\tswitch bc.Metadata().Dimensions {\n\tcase 1:\n\t\treturn scale1DCode(bc, width, height)\n\tcase 2:\n\t\treturn scale2DCode(bc, width, height)\n\t}\n\n\treturn nil, errors.New(\"unsupported barcode format\")\n}\n\nfunc newScaledBC(wrapped Barcode, wrapperFunc wrapFunc, rect image.Rectangle) Barcode {\n\tresult := &scaledBarcode{\n\t\twrapped: wrapped,\n\t\twrapperFunc: wrapperFunc,\n\t\trect: rect,\n\t}\n\n\tif _, ok := wrapped.(BarcodeIntCS); ok {\n\t\treturn &intCSscaledBC{*result}\n\t}\n\treturn result\n}\n\nfunc scale2DCode(bc Barcode, width, height int) (Barcode, error) {\n\torgBounds := bc.Bounds()\n\torgWidth := orgBounds.Max.X - orgBounds.Min.X\n\torgHeight := orgBounds.Max.Y - orgBounds.Min.Y\n\n\tfactor := int(math.Min(float64(width)/float64(orgWidth), float64(height)/float64(orgHeight)))\n\tif factor <= 0 {\n\t\treturn nil, fmt.Errorf(\"can not scale barcode to an image smaller than %dx%d\", orgWidth, orgHeight)\n\t}\n\n\toffsetX := (width - (orgWidth * factor)) / 2\n\toffsetY := (height - (orgHeight * factor)) / 2\n\n\twrap := func(x, y int) color.Color {\n\t\tif x < offsetX || y < offsetY {\n\t\t\treturn color.White\n\t\t}\n\t\tx = (x - offsetX) / factor\n\t\ty = (y - offsetY) / factor\n\t\tif x >= orgWidth || y >= orgHeight {\n\t\t\treturn color.White\n\t\t}\n\t\treturn bc.At(x, y)\n\t}\n\n\treturn newScaledBC(\n\t\tbc,\n\t\twrap,\n\t\timage.Rect(0, 0, width, height),\n\t), nil\n}\n\nfunc scale1DCode(bc Barcode, width, height int) (Barcode, error) {\n\torgBounds := bc.Bounds()\n\torgWidth := orgBounds.Max.X - orgBounds.Min.X\n\tfactor := int(float64(width) / float64(orgWidth))\n\n\tif factor <= 0 {\n\t\treturn nil, fmt.Errorf(\"can not scale barcode to an image smaller than %dx1\", orgWidth)\n\t}\n\toffsetX := (width - (orgWidth * factor)) / 2\n\n\twrap := func(x, y int) color.Color {\n\t\tif x < offsetX {\n\t\t\treturn color.White\n\t\t}\n\t\tx = (x - offsetX) / factor\n\n\t\tif x >= orgWidth {\n\t\t\treturn color.White\n\t\t}\n\t\treturn bc.At(x, 0)\n\t}\n\n\treturn newScaledBC(\n\t\tbc,\n\t\twrap,\n\t\timage.Rect(0, 0, width, height),\n\t), nil\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/base1dcode.go", "content": "// Package utils contain some utilities which are needed to create barcodes\npackage utils\n\nimport (\n\t\"image\"\n\t\"image/color\"\n\n\t\"github.com/boombuler/barcode\"\n)\n\ntype base1DCode struct {\n\t*BitList\n\tkind string\n\tcontent string\n}\n\ntype base1DCodeIntCS struct {\n\tbase1DCode\n\tchecksum int\n}\n\nfunc (c *base1DCode) Content() string {\n\treturn c.content\n}\n\nfunc (c *base1DCode) Metadata() barcode.Metadata {\n\treturn barcode.Metadata{c.kind, 1}\n}\n\nfunc (c *base1DCode) ColorModel() color.Model {\n\treturn color.Gray16Model\n}\n\nfunc (c *base1DCode) Bounds() image.Rectangle {\n\treturn image.Rect(0, 0, c.Len(), 1)\n}\n\nfunc (c *base1DCode) At(x, y int) color.Color {\n\tif c.GetBit(x) {\n\t\treturn color.Black\n\t}\n\treturn color.White\n}\n\nfunc (c *base1DCodeIntCS) CheckSum() int {\n\treturn c.checksum\n}\n\n// New1DCode creates a new 1D barcode where the bars are represented by the bits in the bars BitList\nfunc New1DCodeIntCheckSum(codeKind, content string, bars *BitList, checksum int) barcode.BarcodeIntCS {\n\treturn &base1DCodeIntCS{base1DCode{bars, codeKind, content}, checksum}\n}\n\n// New1DCode creates a new 1D barcode where the bars are represented by the bits in the bars BitList\nfunc New1DCode(codeKind, content string, bars *BitList) barcode.Barcode {\n\treturn &base1DCode{bars, codeKind, content}\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/bitlist.go", "content": "package utils\n\n// BitList is a list that contains bits\ntype BitList struct {\n\tcount int\n\tdata []int32\n}\n\n// NewBitList returns a new BitList with the given length\n// all bits are initialize with false\nfunc NewBitList(capacity int) *BitList {\n\tbl := new(BitList)\n\tbl.count = capacity\n\tx := 0\n\tif capacity%32 != 0 {\n\t\tx = 1\n\t}\n\tbl.data = make([]int32, capacity/32+x)\n\treturn bl\n}\n\n// Len returns the number of contained bits\nfunc (bl *BitList) Len() int {\n\treturn bl.count\n}\n\nfunc (bl *BitList) grow() {\n\tgrowBy := len(bl.data)\n\tif growBy < 128 {\n\t\tgrowBy = 128\n\t} else if growBy >= 1024 {\n\t\tgrowBy = 1024\n\t}\n\n\tnd := make([]int32, len(bl.data)+growBy)\n\tcopy(nd, bl.data)\n\tbl.data = nd\n}\n\n// AddBit appends the given bits to the end of the list\nfunc (bl *BitList) AddBit(bits ...bool) {\n\tfor _, bit := range bits {\n\t\titmIndex := bl.count / 32\n\t\tfor itmIndex >= len(bl.data) {\n\t\t\tbl.grow()\n\t\t}\n\t\tbl.SetBit(bl.count, bit)\n\t\tbl.count++\n\t}\n}\n\n// SetBit sets the bit at the given index to the given value\nfunc (bl *BitList) SetBit(index int, value bool) {\n\titmIndex := index / 32\n\titmBitShift := 31 - (index % 32)\n\tif value {\n\t\tbl.data[itmIndex] = bl.data[itmIndex] | 1<> uint(itmBitShift)) & 1) == 1\n}\n\n// AddByte appends all 8 bits of the given byte to the end of the list\nfunc (bl *BitList) AddByte(b byte) {\n\tfor i := 7; i >= 0; i-- {\n\t\tbl.AddBit(((b >> uint(i)) & 1) == 1)\n\t}\n}\n\n// AddBits appends the last (LSB) 'count' bits of 'b' the the end of the list\nfunc (bl *BitList) AddBits(b int, count byte) {\n\tfor i := int(count) - 1; i >= 0; i-- {\n\t\tbl.AddBit(((b >> uint(i)) & 1) == 1)\n\t}\n}\n\n// GetBytes returns all bits of the BitList as a []byte\nfunc (bl *BitList) GetBytes() []byte {\n\tlen := bl.count >> 3\n\tif (bl.count % 8) != 0 {\n\t\tlen++\n\t}\n\tresult := make([]byte, len)\n\tfor i := 0; i < len; i++ {\n\t\tshift := (3 - (i % 4)) * 8\n\t\tresult[i] = (byte)((bl.data[i/4] >> uint(shift)) & 0xFF)\n\t}\n\treturn result\n}\n\n// IterateBytes iterates through all bytes contained in the BitList\nfunc (bl *BitList) IterateBytes() <-chan byte {\n\tres := make(chan byte)\n\n\tgo func() {\n\t\tc := bl.count\n\t\tshift := 24\n\t\ti := 0\n\t\tfor c > 0 {\n\t\t\tres <- byte((bl.data[i] >> uint(shift)) & 0xFF)\n\t\t\tshift -= 8\n\t\t\tif shift < 0 {\n\t\t\t\tshift = 24\n\t\t\t\ti++\n\t\t\t}\n\t\t\tc -= 8\n\t\t}\n\t\tclose(res)\n\t}()\n\n\treturn res\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/galoisfield.go", "content": "package utils\n\n// GaloisField encapsulates galois field arithmetics\ntype GaloisField struct {\n\tSize int\n\tBase int\n\tALogTbl []int\n\tLogTbl []int\n}\n\n// NewGaloisField creates a new galois field\nfunc NewGaloisField(pp, fieldSize, b int) *GaloisField {\n\tresult := new(GaloisField)\n\n\tresult.Size = fieldSize\n\tresult.Base = b\n\tresult.ALogTbl = make([]int, fieldSize)\n\tresult.LogTbl = make([]int, fieldSize)\n\n\tx := 1\n\tfor i := 0; i < fieldSize; i++ {\n\t\tresult.ALogTbl[i] = x\n\t\tx = x * 2\n\t\tif x >= fieldSize {\n\t\t\tx = (x ^ pp) & (fieldSize - 1)\n\t\t}\n\t}\n\n\tfor i := 0; i < fieldSize; i++ {\n\t\tresult.LogTbl[result.ALogTbl[i]] = int(i)\n\t}\n\n\treturn result\n}\n\nfunc (gf *GaloisField) Zero() *GFPoly {\n\treturn NewGFPoly(gf, []int{0})\n}\n\n// AddOrSub add or substract two numbers\nfunc (gf *GaloisField) AddOrSub(a, b int) int {\n\treturn a ^ b\n}\n\n// Multiply multiplys two numbers\nfunc (gf *GaloisField) Multiply(a, b int) int {\n\tif a == 0 || b == 0 {\n\t\treturn 0\n\t}\n\treturn gf.ALogTbl[(gf.LogTbl[a]+gf.LogTbl[b])%(gf.Size-1)]\n}\n\n// Divide divides two numbers\nfunc (gf *GaloisField) Divide(a, b int) int {\n\tif b == 0 {\n\t\tpanic(\"divide by zero\")\n\t} else if a == 0 {\n\t\treturn 0\n\t}\n\treturn gf.ALogTbl[(gf.LogTbl[a]-gf.LogTbl[b])%(gf.Size-1)]\n}\n\nfunc (gf *GaloisField) Invers(num int) int {\n\treturn gf.ALogTbl[(gf.Size-1)-gf.LogTbl[num]]\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/gfpoly.go", "content": "package utils\n\ntype GFPoly struct {\n\tgf *GaloisField\n\tCoefficients []int\n}\n\nfunc (gp *GFPoly) Degree() int {\n\treturn len(gp.Coefficients) - 1\n}\n\nfunc (gp *GFPoly) Zero() bool {\n\treturn gp.Coefficients[0] == 0\n}\n\n// GetCoefficient returns the coefficient of x ^ degree\nfunc (gp *GFPoly) GetCoefficient(degree int) int {\n\treturn gp.Coefficients[gp.Degree()-degree]\n}\n\nfunc (gp *GFPoly) AddOrSubstract(other *GFPoly) *GFPoly {\n\tif gp.Zero() {\n\t\treturn other\n\t} else if other.Zero() {\n\t\treturn gp\n\t}\n\tsmallCoeff := gp.Coefficients\n\tlargeCoeff := other.Coefficients\n\tif len(smallCoeff) > len(largeCoeff) {\n\t\tlargeCoeff, smallCoeff = smallCoeff, largeCoeff\n\t}\n\tsumDiff := make([]int, len(largeCoeff))\n\tlenDiff := len(largeCoeff) - len(smallCoeff)\n\tcopy(sumDiff, largeCoeff[:lenDiff])\n\tfor i := lenDiff; i < len(largeCoeff); i++ {\n\t\tsumDiff[i] = int(gp.gf.AddOrSub(int(smallCoeff[i-lenDiff]), int(largeCoeff[i])))\n\t}\n\treturn NewGFPoly(gp.gf, sumDiff)\n}\n\nfunc (gp *GFPoly) MultByMonominal(degree int, coeff int) *GFPoly {\n\tif coeff == 0 {\n\t\treturn gp.gf.Zero()\n\t}\n\tsize := len(gp.Coefficients)\n\tresult := make([]int, size+degree)\n\tfor i := 0; i < size; i++ {\n\t\tresult[i] = int(gp.gf.Multiply(int(gp.Coefficients[i]), int(coeff)))\n\t}\n\treturn NewGFPoly(gp.gf, result)\n}\n\nfunc (gp *GFPoly) Multiply(other *GFPoly) *GFPoly {\n\tif gp.Zero() || other.Zero() {\n\t\treturn gp.gf.Zero()\n\t}\n\taCoeff := gp.Coefficients\n\taLen := len(aCoeff)\n\tbCoeff := other.Coefficients\n\tbLen := len(bCoeff)\n\tproduct := make([]int, aLen+bLen-1)\n\tfor i := 0; i < aLen; i++ {\n\t\tac := int(aCoeff[i])\n\t\tfor j := 0; j < bLen; j++ {\n\t\t\tbc := int(bCoeff[j])\n\t\t\tproduct[i+j] = int(gp.gf.AddOrSub(int(product[i+j]), gp.gf.Multiply(ac, bc)))\n\t\t}\n\t}\n\treturn NewGFPoly(gp.gf, product)\n}\n\nfunc (gp *GFPoly) Divide(other *GFPoly) (quotient *GFPoly, remainder *GFPoly) {\n\tquotient = gp.gf.Zero()\n\tremainder = gp\n\tfld := gp.gf\n\tdenomLeadTerm := other.GetCoefficient(other.Degree())\n\tinversDenomLeadTerm := fld.Invers(int(denomLeadTerm))\n\tfor remainder.Degree() >= other.Degree() && !remainder.Zero() {\n\t\tdegreeDiff := remainder.Degree() - other.Degree()\n\t\tscale := int(fld.Multiply(int(remainder.GetCoefficient(remainder.Degree())), inversDenomLeadTerm))\n\t\tterm := other.MultByMonominal(degreeDiff, scale)\n\t\titQuot := NewMonominalPoly(fld, degreeDiff, scale)\n\t\tquotient = quotient.AddOrSubstract(itQuot)\n\t\tremainder = remainder.AddOrSubstract(term)\n\t}\n\treturn\n}\n\nfunc NewMonominalPoly(field *GaloisField, degree int, coeff int) *GFPoly {\n\tif coeff == 0 {\n\t\treturn field.Zero()\n\t}\n\tresult := make([]int, degree+1)\n\tresult[0] = coeff\n\treturn NewGFPoly(field, result)\n}\n\nfunc NewGFPoly(field *GaloisField, coefficients []int) *GFPoly {\n\tfor len(coefficients) > 1 && coefficients[0] == 0 {\n\t\tcoefficients = coefficients[1:]\n\t}\n\treturn &GFPoly{field, coefficients}\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/reedsolomon.go", "content": "package utils\n\nimport (\n\t\"sync\"\n)\n\ntype ReedSolomonEncoder struct {\n\tgf *GaloisField\n\tpolynomes []*GFPoly\n\tm *sync.Mutex\n}\n\nfunc NewReedSolomonEncoder(gf *GaloisField) *ReedSolomonEncoder {\n\treturn &ReedSolomonEncoder{\n\t\tgf, []*GFPoly{NewGFPoly(gf, []int{1})}, new(sync.Mutex),\n\t}\n}\n\nfunc (rs *ReedSolomonEncoder) getPolynomial(degree int) *GFPoly {\n\trs.m.Lock()\n\tdefer rs.m.Unlock()\n\n\tif degree >= len(rs.polynomes) {\n\t\tlast := rs.polynomes[len(rs.polynomes)-1]\n\t\tfor d := len(rs.polynomes); d <= degree; d++ {\n\t\t\tnext := last.Multiply(NewGFPoly(rs.gf, []int{1, rs.gf.ALogTbl[d-1+rs.gf.Base]}))\n\t\t\trs.polynomes = append(rs.polynomes, next)\n\t\t\tlast = next\n\t\t}\n\t}\n\treturn rs.polynomes[degree]\n}\n\nfunc (rs *ReedSolomonEncoder) Encode(data []int, eccCount int) []int {\n\tgenerator := rs.getPolynomial(eccCount)\n\tinfo := NewGFPoly(rs.gf, data)\n\tinfo = info.MultByMonominal(eccCount, 1)\n\t_, remainder := info.Divide(generator)\n\n\tresult := make([]int, eccCount)\n\tnumZero := int(eccCount) - len(remainder.Coefficients)\n\tcopy(result[numZero:], remainder.Coefficients)\n\treturn result\n}\n" }, { "path": "vendor/github.com/boombuler/barcode/utils/runeint.go", "content": "package utils\n\n// RuneToInt converts a rune between '0' and '9' to an integer between 0 and 9\n// If the rune is outside of this range -1 is returned.\nfunc RuneToInt(r rune) int {\n\tif r >= '0' && r <= '9' {\n\t\treturn int(r - '0')\n\t}\n\treturn -1\n}\n\n// IntToRune converts a digit 0 - 9 to the rune '0' - '9'. If the given int is outside\n// of this range 'F' is returned!\nfunc IntToRune(i int) rune {\n\tif i >= 0 && i <= 9 {\n\t\treturn rune(i + '0')\n\t}\n\treturn 'F'\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/.gitignore", "content": ".DS_Store\nbin\n\n\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/.travis.yml", "content": "language: go\n\nscript:\n - go vet ./...\n - go test -v ./...\n\ngo:\n - 1.3\n - 1.4\n - 1.5\n - 1.6\n - 1.7\n - tip\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/LICENSE", "content": "Copyright (c) 2012 Dave Grijalva\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/MIGRATION_GUIDE.md", "content": "## Migration Guide from v2 -> v3\n\nVersion 3 adds several new, frequently requested features. To do so, it introduces a few breaking changes. We've worked to keep these as minimal as possible. This guide explains the breaking changes and how you can quickly update your code.\n\n### `Token.Claims` is now an interface type\n\nThe most requested feature from the 2.0 verison of this library was the ability to provide a custom type to the JSON parser for claims. This was implemented by introducing a new interface, `Claims`, to replace `map[string]interface{}`. We also included two concrete implementations of `Claims`: `MapClaims` and `StandardClaims`.\n\n`MapClaims` is an alias for `map[string]interface{}` with built in validation behavior. It is the default claims type when using `Parse`. The usage is unchanged except you must type cast the claims property.\n\nThe old example for parsing a token looked like this..\n\n```go\n\tif token, err := jwt.Parse(tokenString, keyLookupFunc); err == nil {\n\t\tfmt.Printf(\"Token for user %v expires %v\", token.Claims[\"user\"], token.Claims[\"exp\"])\n\t}\n```\n\nis now directly mapped to...\n\n```go\n\tif token, err := jwt.Parse(tokenString, keyLookupFunc); err == nil {\n\t\tclaims := token.Claims.(jwt.MapClaims)\n\t\tfmt.Printf(\"Token for user %v expires %v\", claims[\"user\"], claims[\"exp\"])\n\t}\n```\n\n`StandardClaims` is designed to be embedded in your custom type. You can supply a custom claims type with the new `ParseWithClaims` function. Here's an example of using a custom claims type.\n\n```go\n\ttype MyCustomClaims struct {\n\t\tUser string\n\t\t*StandardClaims\n\t}\n\t\n\tif token, err := jwt.ParseWithClaims(tokenString, &MyCustomClaims{}, keyLookupFunc); err == nil {\n\t\tclaims := token.Claims.(*MyCustomClaims)\n\t\tfmt.Printf(\"Token for user %v expires %v\", claims.User, claims.StandardClaims.ExpiresAt)\n\t}\n```\n\n### `ParseFromRequest` has been moved\n\nTo keep this library focused on the tokens without becoming overburdened with complex request processing logic, `ParseFromRequest` and its new companion `ParseFromRequestWithClaims` have been moved to a subpackage, `request`. The method signatues have also been augmented to receive a new argument: `Extractor`.\n\n`Extractors` do the work of picking the token string out of a request. The interface is simple and composable.\n\nThis simple parsing example:\n\n```go\n\tif token, err := jwt.ParseFromRequest(tokenString, req, keyLookupFunc); err == nil {\n\t\tfmt.Printf(\"Token for user %v expires %v\", token.Claims[\"user\"], token.Claims[\"exp\"])\n\t}\n```\n\nis directly mapped to:\n\n```go\n\tif token, err := request.ParseFromRequest(req, request.OAuth2Extractor, keyLookupFunc); err == nil {\n\t\tclaims := token.Claims.(jwt.MapClaims)\n\t\tfmt.Printf(\"Token for user %v expires %v\", claims[\"user\"], claims[\"exp\"])\n\t}\n```\n\nThere are several concrete `Extractor` types provided for your convenience:\n\n* `HeaderExtractor` will search a list of headers until one contains content.\n* `ArgumentExtractor` will search a list of keys in request query and form arguments until one contains content.\n* `MultiExtractor` will try a list of `Extractors` in order until one returns content.\n* `AuthorizationHeaderExtractor` will look in the `Authorization` header for a `Bearer` token.\n* `OAuth2Extractor` searches the places an OAuth2 token would be specified (per the spec): `Authorization` header and `access_token` argument\n* `PostExtractionFilter` wraps an `Extractor`, allowing you to process the content before it's parsed. A simple example is stripping the `Bearer ` text from a header\n\n\n### RSA signing methods no longer accept `[]byte` keys\n\nDue to a [critical vulnerability](https://auth0.com/blog/2015/03/31/critical-vulnerabilities-in-json-web-token-libraries/), we've decided the convenience of accepting `[]byte` instead of `rsa.PublicKey` or `rsa.PrivateKey` isn't worth the risk of misuse.\n\nTo replace this behavior, we've added two helper methods: `ParseRSAPrivateKeyFromPEM(key []byte) (*rsa.PrivateKey, error)` and `ParseRSAPublicKeyFromPEM(key []byte) (*rsa.PublicKey, error)`. These are just simple helpers for unpacking PEM encoded PKCS1 and PKCS8 keys. If your keys are encoded any other way, all you need to do is convert them to the `crypto/rsa` package's types.\n\n```go \n\tfunc keyLookupFunc(*Token) (interface{}, error) {\n\t\t// Don't forget to validate the alg is what you expect:\n\t\tif _, ok := token.Method.(*jwt.SigningMethodRSA); !ok {\n\t\t\treturn nil, fmt.Errorf(\"Unexpected signing method: %v\", token.Header[\"alg\"])\n\t\t}\n\t\t\n\t\t// Look up key \n\t\tkey, err := lookupPublicKey(token.Header[\"kid\"])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\t\n\t\t// Unpack key from PEM encoded PKCS8\n\t\treturn jwt.ParseRSAPublicKeyFromPEM(key)\n\t}\n```\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/README.md", "content": "A [go](http://www.golang.org) (or 'golang' for search engine friendliness) implementation of [JSON Web Tokens](http://self-issued.info/docs/draft-ietf-oauth-json-web-token.html)\n\n[![Build Status](https://travis-ci.org/dgrijalva/jwt-go.svg?branch=master)](https://travis-ci.org/dgrijalva/jwt-go)\n\n**BREAKING CHANGES:*** Version 3.0.0 is here. It includes _a lot_ of changes including a few that break the API. We've tried to break as few things as possible, so there should just be a few type signature changes. A full list of breaking changes is available in `VERSION_HISTORY.md`. See `MIGRATION_GUIDE.md` for more information on updating your code.\n\n**NOTICE:** It's important that you [validate the `alg` presented is what you expect](https://auth0.com/blog/2015/03/31/critical-vulnerabilities-in-json-web-token-libraries/). This library attempts to make it easy to do the right thing by requiring key types match the expected alg, but you should take the extra step to verify it in your usage. See the examples provided.\n\n\n## What the heck is a JWT?\n\nJWT.io has [a great introduction](https://jwt.io/introduction) to JSON Web Tokens.\n\nIn short, it's a signed JSON object that does something useful (for example, authentication). It's commonly used for `Bearer` tokens in Oauth 2. A token is made of three parts, separated by `.`'s. The first two parts are JSON objects, that have been [base64url](http://tools.ietf.org/html/rfc4648) encoded. The last part is the signature, encoded the same way.\n\nThe first part is called the header. It contains the necessary information for verifying the last part, the signature. For example, which encryption method was used for signing and what key was used.\n\nThe part in the middle is the interesting bit. It's called the Claims and contains the actual stuff you care about. Refer to [the RFC](http://self-issued.info/docs/draft-jones-json-web-token.html) for information about reserved keys and the proper way to add your own.\n\n## What's in the box?\n\nThis library supports the parsing and verification as well as the generation and signing of JWTs. Current supported signing algorithms are HMAC SHA, RSA, RSA-PSS, and ECDSA, though hooks are present for adding your own.\n\n## Examples\n\nSee [the project documentation](https://godoc.org/github.com/dgrijalva/jwt-go) for examples of usage:\n\n* [Simple example of parsing and validating a token](https://godoc.org/github.com/dgrijalva/jwt-go#example-Parse--Hmac)\n* [Simple example of building and signing a token](https://godoc.org/github.com/dgrijalva/jwt-go#example-New--Hmac)\n* [Directory of Examples](https://godoc.org/github.com/dgrijalva/jwt-go#pkg-examples)\n\n## Extensions\n\nThis library publishes all the necessary components for adding your own signing methods. Simply implement the `SigningMethod` interface and register a factory method using `RegisterSigningMethod`. \n\nHere's an example of an extension that integrates with the Google App Engine signing tools: https://github.com/someone1/gcp-jwt-go\n\n## Compliance\n\nThis library was last reviewed to comply with [RTF 7519](http://www.rfc-editor.org/info/rfc7519) dated May 2015 with a few notable differences: \n\n* In order to protect against accidental use of [Unsecured JWTs](http://self-issued.info/docs/draft-ietf-oauth-json-web-token.html#UnsecuredJWT), tokens using `alg=none` will only be accepted if the constant `jwt.UnsafeAllowNoneSignatureType` is provided as the key.\n\n## Project Status & Versioning\n\nThis library is considered production ready. Feedback and feature requests are appreciated. The API should be considered stable. There should be very few backwards-incompatible changes outside of major version updates (and only with good reason).\n\nThis project uses [Semantic Versioning 2.0.0](http://semver.org). Accepted pull requests will land on `master`. Periodically, versions will be tagged from `master`. You can find all the releases on [the project releases page](https://github.com/dgrijalva/jwt-go/releases).\n\nWhile we try to make it obvious when we make breaking changes, there isn't a great mechanism for pushing announcements out to users. You may want to use this alternative package include: `gopkg.in/dgrijalva/jwt-go.v2`. It will do the right thing WRT semantic versioning.\n\n## Usage Tips\n\n### Signing vs Encryption\n\nA token is simply a JSON object that is signed by its author. this tells you exactly two things about the data:\n\n* The author of the token was in the possession of the signing secret\n* The data has not been modified since it was signed\n\nIt's important to know that JWT does not provide encryption, which means anyone who has access to the token can read its contents. If you need to protect (encrypt) the data, there is a companion spec, `JWE`, that provides this functionality. JWE is currently outside the scope of this library.\n\n### Choosing a Signing Method\n\nThere are several signing methods available, and you should probably take the time to learn about the various options before choosing one. The principal design decision is most likely going to be symmetric vs asymmetric.\n\nSymmetric signing methods, such as HSA, use only a single secret. This is probably the simplest signing method to use since any `[]byte` can be used as a valid secret. They are also slightly computationally faster to use, though this rarely is enough to matter. Symmetric signing methods work the best when both producers and consumers of tokens are trusted, or even the same system. Since the same secret is used to both sign and validate tokens, you can't easily distribute the key for validation.\n\nAsymmetric signing methods, such as RSA, use different keys for signing and verifying tokens. This makes it possible to produce tokens with a private key, and allow any consumer to access the public key for verification.\n\n### JWT and OAuth\n\nIt's worth mentioning that OAuth and JWT are not the same thing. A JWT token is simply a signed JSON object. It can be used anywhere such a thing is useful. There is some confusion, though, as JWT is the most common type of bearer token used in OAuth2 authentication.\n\nWithout going too far down the rabbit hole, here's a description of the interaction of these technologies:\n\n* OAuth is a protocol for allowing an identity provider to be separate from the service a user is logging in to. For example, whenever you use Facebook to log into a different service (Yelp, Spotify, etc), you are using OAuth.\n* OAuth defines several options for passing around authentication data. One popular method is called a \"bearer token\". A bearer token is simply a string that _should_ only be held by an authenticated user. Thus, simply presenting this token proves your identity. You can probably derive from here why a JWT might make a good bearer token.\n* Because bearer tokens are used for authentication, it's important they're kept secret. This is why transactions that use bearer tokens typically happen over SSL.\n \n## More\n\nDocumentation can be found [on godoc.org](http://godoc.org/github.com/dgrijalva/jwt-go).\n\nThe command line utility included in this project (cmd/jwt) provides a straightforward example of token creation and parsing as well as a useful tool for debugging your own integration. You'll also find several implementation examples in the documentation.\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/VERSION_HISTORY.md", "content": "## `jwt-go` Version History\n\n#### 3.1.0\n\n* Improvements to `jwt` command line tool\n* Added `SkipClaimsValidation` option to `Parser`\n* Documentation updates\n\n#### 3.0.0\n\n* **Compatibility Breaking Changes**: See MIGRATION_GUIDE.md for tips on updating your code\n\t* Dropped support for `[]byte` keys when using RSA signing methods. This convenience feature could contribute to security vulnerabilities involving mismatched key types with signing methods.\n\t* `ParseFromRequest` has been moved to `request` subpackage and usage has changed\n\t* The `Claims` property on `Token` is now type `Claims` instead of `map[string]interface{}`. The default value is type `MapClaims`, which is an alias to `map[string]interface{}`. This makes it possible to use a custom type when decoding claims.\n* Other Additions and Changes\n\t* Added `Claims` interface type to allow users to decode the claims into a custom type\n\t* Added `ParseWithClaims`, which takes a third argument of type `Claims`. Use this function instead of `Parse` if you have a custom type you'd like to decode into.\n\t* Dramatically improved the functionality and flexibility of `ParseFromRequest`, which is now in the `request` subpackage\n\t* Added `ParseFromRequestWithClaims` which is the `FromRequest` equivalent of `ParseWithClaims`\n\t* Added new interface type `Extractor`, which is used for extracting JWT strings from http requests. Used with `ParseFromRequest` and `ParseFromRequestWithClaims`.\n\t* Added several new, more specific, validation errors to error type bitmask\n\t* Moved examples from README to executable example files\n\t* Signing method registry is now thread safe\n\t* Added new property to `ValidationError`, which contains the raw error returned by calls made by parse/verify (such as those returned by keyfunc or json parser)\n\n#### 2.7.0\n\nThis will likely be the last backwards compatible release before 3.0.0, excluding essential bug fixes.\n\n* Added new option `-show` to the `jwt` command that will just output the decoded token without verifying\n* Error text for expired tokens includes how long it's been expired\n* Fixed incorrect error returned from `ParseRSAPublicKeyFromPEM`\n* Documentation updates\n\n#### 2.6.0\n\n* Exposed inner error within ValidationError\n* Fixed validation errors when using UseJSONNumber flag\n* Added several unit tests\n\n#### 2.5.0\n\n* Added support for signing method none. You shouldn't use this. The API tries to make this clear.\n* Updated/fixed some documentation\n* Added more helpful error message when trying to parse tokens that begin with `BEARER `\n\n#### 2.4.0\n\n* Added new type, Parser, to allow for configuration of various parsing parameters\n\t* You can now specify a list of valid signing methods. Anything outside this set will be rejected.\n\t* You can now opt to use the `json.Number` type instead of `float64` when parsing token JSON\n* Added support for [Travis CI](https://travis-ci.org/dgrijalva/jwt-go)\n* Fixed some bugs with ECDSA parsing\n\n#### 2.3.0\n\n* Added support for ECDSA signing methods\n* Added support for RSA PSS signing methods (requires go v1.4)\n\n#### 2.2.0\n\n* Gracefully handle a `nil` `Keyfunc` being passed to `Parse`. Result will now be the parsed token and an error, instead of a panic.\n\n#### 2.1.0\n\nBackwards compatible API change that was missed in 2.0.0.\n\n* The `SignedString` method on `Token` now takes `interface{}` instead of `[]byte`\n\n#### 2.0.0\n\nThere were two major reasons for breaking backwards compatibility with this update. The first was a refactor required to expand the width of the RSA and HMAC-SHA signing implementations. There will likely be no required code changes to support this change.\n\nThe second update, while unfortunately requiring a small change in integration, is required to open up this library to other signing methods. Not all keys used for all signing methods have a single standard on-disk representation. Requiring `[]byte` as the type for all keys proved too limiting. Additionally, this implementation allows for pre-parsed tokens to be reused, which might matter in an application that parses a high volume of tokens with a small set of keys. Backwards compatibilty has been maintained for passing `[]byte` to the RSA signing methods, but they will also accept `*rsa.PublicKey` and `*rsa.PrivateKey`.\n\nIt is likely the only integration change required here will be to change `func(t *jwt.Token) ([]byte, error)` to `func(t *jwt.Token) (interface{}, error)` when calling `Parse`.\n\n* **Compatibility Breaking Changes**\n\t* `SigningMethodHS256` is now `*SigningMethodHMAC` instead of `type struct`\n\t* `SigningMethodRS256` is now `*SigningMethodRSA` instead of `type struct`\n\t* `KeyFunc` now returns `interface{}` instead of `[]byte`\n\t* `SigningMethod.Sign` now takes `interface{}` instead of `[]byte` for the key\n\t* `SigningMethod.Verify` now takes `interface{}` instead of `[]byte` for the key\n* Renamed type `SigningMethodHS256` to `SigningMethodHMAC`. Specific sizes are now just instances of this type.\n * Added public package global `SigningMethodHS256`\n * Added public package global `SigningMethodHS384`\n * Added public package global `SigningMethodHS512`\n* Renamed type `SigningMethodRS256` to `SigningMethodRSA`. Specific sizes are now just instances of this type.\n * Added public package global `SigningMethodRS256`\n * Added public package global `SigningMethodRS384`\n * Added public package global `SigningMethodRS512`\n* Moved sample private key for HMAC tests from an inline value to a file on disk. Value is unchanged.\n* Refactored the RSA implementation to be easier to read\n* Exposed helper methods `ParseRSAPrivateKeyFromPEM` and `ParseRSAPublicKeyFromPEM`\n\n#### 1.0.2\n\n* Fixed bug in parsing public keys from certificates\n* Added more tests around the parsing of keys for RS256\n* Code refactoring in RS256 implementation. No functional changes\n\n#### 1.0.1\n\n* Fixed panic if RS256 signing method was passed an invalid key\n\n#### 1.0.0\n\n* First versioned release\n* API stabilized\n* Supports creating, signing, parsing, and validating JWT tokens\n* Supports RS256 and HS256 signing methods" }, { "path": "vendor/github.com/dgrijalva/jwt-go/claims.go", "content": "package jwt\n\nimport (\n\t\"crypto/subtle\"\n\t\"fmt\"\n\t\"time\"\n)\n\n// For a type to be a Claims object, it must just have a Valid method that determines\n// if the token is invalid for any supported reason\ntype Claims interface {\n\tValid() error\n}\n\n// Structured version of Claims Section, as referenced at\n// https://tools.ietf.org/html/rfc7519#section-4.1\n// See examples for how to use this with your own claim types\ntype StandardClaims struct {\n\tAudience string `json:\"aud,omitempty\"`\n\tExpiresAt int64 `json:\"exp,omitempty\"`\n\tId string `json:\"jti,omitempty\"`\n\tIssuedAt int64 `json:\"iat,omitempty\"`\n\tIssuer string `json:\"iss,omitempty\"`\n\tNotBefore int64 `json:\"nbf,omitempty\"`\n\tSubject string `json:\"sub,omitempty\"`\n}\n\n// Validates time based claims \"exp, iat, nbf\".\n// There is no accounting for clock skew.\n// As well, if any of the above claims are not in the token, it will still\n// be considered a valid claim.\nfunc (c StandardClaims) Valid() error {\n\tvErr := new(ValidationError)\n\tnow := TimeFunc().Unix()\n\n\t// The claims below are optional, by default, so if they are set to the\n\t// default value in Go, let's not fail the verification for them.\n\tif c.VerifyExpiresAt(now, false) == false {\n\t\tdelta := time.Unix(now, 0).Sub(time.Unix(c.ExpiresAt, 0))\n\t\tvErr.Inner = fmt.Errorf(\"token is expired by %v\", delta)\n\t\tvErr.Errors |= ValidationErrorExpired\n\t}\n\n\tif c.VerifyIssuedAt(now, false) == false {\n\t\tvErr.Inner = fmt.Errorf(\"Token used before issued\")\n\t\tvErr.Errors |= ValidationErrorIssuedAt\n\t}\n\n\tif c.VerifyNotBefore(now, false) == false {\n\t\tvErr.Inner = fmt.Errorf(\"token is not valid yet\")\n\t\tvErr.Errors |= ValidationErrorNotValidYet\n\t}\n\n\tif vErr.valid() {\n\t\treturn nil\n\t}\n\n\treturn vErr\n}\n\n// Compares the aud claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (c *StandardClaims) VerifyAudience(cmp string, req bool) bool {\n\treturn verifyAud(c.Audience, cmp, req)\n}\n\n// Compares the exp claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (c *StandardClaims) VerifyExpiresAt(cmp int64, req bool) bool {\n\treturn verifyExp(c.ExpiresAt, cmp, req)\n}\n\n// Compares the iat claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (c *StandardClaims) VerifyIssuedAt(cmp int64, req bool) bool {\n\treturn verifyIat(c.IssuedAt, cmp, req)\n}\n\n// Compares the iss claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (c *StandardClaims) VerifyIssuer(cmp string, req bool) bool {\n\treturn verifyIss(c.Issuer, cmp, req)\n}\n\n// Compares the nbf claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (c *StandardClaims) VerifyNotBefore(cmp int64, req bool) bool {\n\treturn verifyNbf(c.NotBefore, cmp, req)\n}\n\n// ----- helpers\n\nfunc verifyAud(aud string, cmp string, required bool) bool {\n\tif aud == \"\" {\n\t\treturn !required\n\t}\n\tif subtle.ConstantTimeCompare([]byte(aud), []byte(cmp)) != 0 {\n\t\treturn true\n\t} else {\n\t\treturn false\n\t}\n}\n\nfunc verifyExp(exp int64, now int64, required bool) bool {\n\tif exp == 0 {\n\t\treturn !required\n\t}\n\treturn now <= exp\n}\n\nfunc verifyIat(iat int64, now int64, required bool) bool {\n\tif iat == 0 {\n\t\treturn !required\n\t}\n\treturn now >= iat\n}\n\nfunc verifyIss(iss string, cmp string, required bool) bool {\n\tif iss == \"\" {\n\t\treturn !required\n\t}\n\tif subtle.ConstantTimeCompare([]byte(iss), []byte(cmp)) != 0 {\n\t\treturn true\n\t} else {\n\t\treturn false\n\t}\n}\n\nfunc verifyNbf(nbf int64, now int64, required bool) bool {\n\tif nbf == 0 {\n\t\treturn !required\n\t}\n\treturn now >= nbf\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/doc.go", "content": "// Package jwt is a Go implementation of JSON Web Tokens: http://self-issued.info/docs/draft-jones-json-web-token.html\n//\n// See README.md for more info.\npackage jwt\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/ecdsa.go", "content": "package jwt\n\nimport (\n\t\"crypto\"\n\t\"crypto/ecdsa\"\n\t\"crypto/rand\"\n\t\"errors\"\n\t\"math/big\"\n)\n\nvar (\n\t// Sadly this is missing from crypto/ecdsa compared to crypto/rsa\n\tErrECDSAVerification = errors.New(\"crypto/ecdsa: verification error\")\n)\n\n// Implements the ECDSA family of signing methods signing methods\ntype SigningMethodECDSA struct {\n\tName string\n\tHash crypto.Hash\n\tKeySize int\n\tCurveBits int\n}\n\n// Specific instances for EC256 and company\nvar (\n\tSigningMethodES256 *SigningMethodECDSA\n\tSigningMethodES384 *SigningMethodECDSA\n\tSigningMethodES512 *SigningMethodECDSA\n)\n\nfunc init() {\n\t// ES256\n\tSigningMethodES256 = &SigningMethodECDSA{\"ES256\", crypto.SHA256, 32, 256}\n\tRegisterSigningMethod(SigningMethodES256.Alg(), func() SigningMethod {\n\t\treturn SigningMethodES256\n\t})\n\n\t// ES384\n\tSigningMethodES384 = &SigningMethodECDSA{\"ES384\", crypto.SHA384, 48, 384}\n\tRegisterSigningMethod(SigningMethodES384.Alg(), func() SigningMethod {\n\t\treturn SigningMethodES384\n\t})\n\n\t// ES512\n\tSigningMethodES512 = &SigningMethodECDSA{\"ES512\", crypto.SHA512, 66, 521}\n\tRegisterSigningMethod(SigningMethodES512.Alg(), func() SigningMethod {\n\t\treturn SigningMethodES512\n\t})\n}\n\nfunc (m *SigningMethodECDSA) Alg() string {\n\treturn m.Name\n}\n\n// Implements the Verify method from SigningMethod\n// For this verify method, key must be an ecdsa.PublicKey struct\nfunc (m *SigningMethodECDSA) Verify(signingString, signature string, key interface{}) error {\n\tvar err error\n\n\t// Decode the signature\n\tvar sig []byte\n\tif sig, err = DecodeSegment(signature); err != nil {\n\t\treturn err\n\t}\n\n\t// Get the key\n\tvar ecdsaKey *ecdsa.PublicKey\n\tswitch k := key.(type) {\n\tcase *ecdsa.PublicKey:\n\t\tecdsaKey = k\n\tdefault:\n\t\treturn ErrInvalidKeyType\n\t}\n\n\tif len(sig) != 2*m.KeySize {\n\t\treturn ErrECDSAVerification\n\t}\n\n\tr := big.NewInt(0).SetBytes(sig[:m.KeySize])\n\ts := big.NewInt(0).SetBytes(sig[m.KeySize:])\n\n\t// Create hasher\n\tif !m.Hash.Available() {\n\t\treturn ErrHashUnavailable\n\t}\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\t// Verify the signature\n\tif verifystatus := ecdsa.Verify(ecdsaKey, hasher.Sum(nil), r, s); verifystatus == true {\n\t\treturn nil\n\t} else {\n\t\treturn ErrECDSAVerification\n\t}\n}\n\n// Implements the Sign method from SigningMethod\n// For this signing method, key must be an ecdsa.PrivateKey struct\nfunc (m *SigningMethodECDSA) Sign(signingString string, key interface{}) (string, error) {\n\t// Get the key\n\tvar ecdsaKey *ecdsa.PrivateKey\n\tswitch k := key.(type) {\n\tcase *ecdsa.PrivateKey:\n\t\tecdsaKey = k\n\tdefault:\n\t\treturn \"\", ErrInvalidKeyType\n\t}\n\n\t// Create the hasher\n\tif !m.Hash.Available() {\n\t\treturn \"\", ErrHashUnavailable\n\t}\n\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\t// Sign the string and return r, s\n\tif r, s, err := ecdsa.Sign(rand.Reader, ecdsaKey, hasher.Sum(nil)); err == nil {\n\t\tcurveBits := ecdsaKey.Curve.Params().BitSize\n\n\t\tif m.CurveBits != curveBits {\n\t\t\treturn \"\", ErrInvalidKey\n\t\t}\n\n\t\tkeyBytes := curveBits / 8\n\t\tif curveBits%8 > 0 {\n\t\t\tkeyBytes += 1\n\t\t}\n\n\t\t// We serialize the outpus (r and s) into big-endian byte arrays and pad\n\t\t// them with zeros on the left to make sure the sizes work out. Both arrays\n\t\t// must be keyBytes long, and the output must be 2*keyBytes long.\n\t\trBytes := r.Bytes()\n\t\trBytesPadded := make([]byte, keyBytes)\n\t\tcopy(rBytesPadded[keyBytes-len(rBytes):], rBytes)\n\n\t\tsBytes := s.Bytes()\n\t\tsBytesPadded := make([]byte, keyBytes)\n\t\tcopy(sBytesPadded[keyBytes-len(sBytes):], sBytes)\n\n\t\tout := append(rBytesPadded, sBytesPadded...)\n\n\t\treturn EncodeSegment(out), nil\n\t} else {\n\t\treturn \"\", err\n\t}\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/ecdsa_utils.go", "content": "package jwt\n\nimport (\n\t\"crypto/ecdsa\"\n\t\"crypto/x509\"\n\t\"encoding/pem\"\n\t\"errors\"\n)\n\nvar (\n\tErrNotECPublicKey = errors.New(\"Key is not a valid ECDSA public key\")\n\tErrNotECPrivateKey = errors.New(\"Key is not a valid ECDSA private key\")\n)\n\n// Parse PEM encoded Elliptic Curve Private Key Structure\nfunc ParseECPrivateKeyFromPEM(key []byte) (*ecdsa.PrivateKey, error) {\n\tvar err error\n\n\t// Parse PEM block\n\tvar block *pem.Block\n\tif block, _ = pem.Decode(key); block == nil {\n\t\treturn nil, ErrKeyMustBePEMEncoded\n\t}\n\n\t// Parse the key\n\tvar parsedKey interface{}\n\tif parsedKey, err = x509.ParseECPrivateKey(block.Bytes); err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar pkey *ecdsa.PrivateKey\n\tvar ok bool\n\tif pkey, ok = parsedKey.(*ecdsa.PrivateKey); !ok {\n\t\treturn nil, ErrNotECPrivateKey\n\t}\n\n\treturn pkey, nil\n}\n\n// Parse PEM encoded PKCS1 or PKCS8 public key\nfunc ParseECPublicKeyFromPEM(key []byte) (*ecdsa.PublicKey, error) {\n\tvar err error\n\n\t// Parse PEM block\n\tvar block *pem.Block\n\tif block, _ = pem.Decode(key); block == nil {\n\t\treturn nil, ErrKeyMustBePEMEncoded\n\t}\n\n\t// Parse the key\n\tvar parsedKey interface{}\n\tif parsedKey, err = x509.ParsePKIXPublicKey(block.Bytes); err != nil {\n\t\tif cert, err := x509.ParseCertificate(block.Bytes); err == nil {\n\t\t\tparsedKey = cert.PublicKey\n\t\t} else {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tvar pkey *ecdsa.PublicKey\n\tvar ok bool\n\tif pkey, ok = parsedKey.(*ecdsa.PublicKey); !ok {\n\t\treturn nil, ErrNotECPublicKey\n\t}\n\n\treturn pkey, nil\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/errors.go", "content": "package jwt\n\nimport (\n\t\"errors\"\n)\n\n// Error constants\nvar (\n\tErrInvalidKey = errors.New(\"key is invalid\")\n\tErrInvalidKeyType = errors.New(\"key is of invalid type\")\n\tErrHashUnavailable = errors.New(\"the requested hash function is unavailable\")\n)\n\n// The errors that might occur when parsing and validating a token\nconst (\n\tValidationErrorMalformed uint32 = 1 << iota // Token is malformed\n\tValidationErrorUnverifiable // Token could not be verified because of signing problems\n\tValidationErrorSignatureInvalid // Signature validation failed\n\n\t// Standard Claim validation errors\n\tValidationErrorAudience // AUD validation failed\n\tValidationErrorExpired // EXP validation failed\n\tValidationErrorIssuedAt // IAT validation failed\n\tValidationErrorIssuer // ISS validation failed\n\tValidationErrorNotValidYet // NBF validation failed\n\tValidationErrorId // JTI validation failed\n\tValidationErrorClaimsInvalid // Generic claims validation error\n)\n\n// Helper for constructing a ValidationError with a string error message\nfunc NewValidationError(errorText string, errorFlags uint32) *ValidationError {\n\treturn &ValidationError{\n\t\ttext: errorText,\n\t\tErrors: errorFlags,\n\t}\n}\n\n// The error from Parse if token is not valid\ntype ValidationError struct {\n\tInner error // stores the error returned by external dependencies, i.e.: KeyFunc\n\tErrors uint32 // bitfield. see ValidationError... constants\n\ttext string // errors that do not have a valid error just have text\n}\n\n// Validation error is an error type\nfunc (e ValidationError) Error() string {\n\tif e.Inner != nil {\n\t\treturn e.Inner.Error()\n\t} else if e.text != \"\" {\n\t\treturn e.text\n\t} else {\n\t\treturn \"token is invalid\"\n\t}\n}\n\n// No errors\nfunc (e *ValidationError) valid() bool {\n\treturn e.Errors == 0\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/hmac.go", "content": "package jwt\n\nimport (\n\t\"crypto\"\n\t\"crypto/hmac\"\n\t\"errors\"\n)\n\n// Implements the HMAC-SHA family of signing methods signing methods\ntype SigningMethodHMAC struct {\n\tName string\n\tHash crypto.Hash\n}\n\n// Specific instances for HS256 and company\nvar (\n\tSigningMethodHS256 *SigningMethodHMAC\n\tSigningMethodHS384 *SigningMethodHMAC\n\tSigningMethodHS512 *SigningMethodHMAC\n\tErrSignatureInvalid = errors.New(\"signature is invalid\")\n)\n\nfunc init() {\n\t// HS256\n\tSigningMethodHS256 = &SigningMethodHMAC{\"HS256\", crypto.SHA256}\n\tRegisterSigningMethod(SigningMethodHS256.Alg(), func() SigningMethod {\n\t\treturn SigningMethodHS256\n\t})\n\n\t// HS384\n\tSigningMethodHS384 = &SigningMethodHMAC{\"HS384\", crypto.SHA384}\n\tRegisterSigningMethod(SigningMethodHS384.Alg(), func() SigningMethod {\n\t\treturn SigningMethodHS384\n\t})\n\n\t// HS512\n\tSigningMethodHS512 = &SigningMethodHMAC{\"HS512\", crypto.SHA512}\n\tRegisterSigningMethod(SigningMethodHS512.Alg(), func() SigningMethod {\n\t\treturn SigningMethodHS512\n\t})\n}\n\nfunc (m *SigningMethodHMAC) Alg() string {\n\treturn m.Name\n}\n\n// Verify the signature of HSXXX tokens. Returns nil if the signature is valid.\nfunc (m *SigningMethodHMAC) Verify(signingString, signature string, key interface{}) error {\n\t// Verify the key is the right type\n\tkeyBytes, ok := key.([]byte)\n\tif !ok {\n\t\treturn ErrInvalidKeyType\n\t}\n\n\t// Decode signature, for comparison\n\tsig, err := DecodeSegment(signature)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Can we use the specified hashing method?\n\tif !m.Hash.Available() {\n\t\treturn ErrHashUnavailable\n\t}\n\n\t// This signing method is symmetric, so we validate the signature\n\t// by reproducing the signature from the signing string and key, then\n\t// comparing that against the provided signature.\n\thasher := hmac.New(m.Hash.New, keyBytes)\n\thasher.Write([]byte(signingString))\n\tif !hmac.Equal(sig, hasher.Sum(nil)) {\n\t\treturn ErrSignatureInvalid\n\t}\n\n\t// No validation errors. Signature is good.\n\treturn nil\n}\n\n// Implements the Sign method from SigningMethod for this signing method.\n// Key must be []byte\nfunc (m *SigningMethodHMAC) Sign(signingString string, key interface{}) (string, error) {\n\tif keyBytes, ok := key.([]byte); ok {\n\t\tif !m.Hash.Available() {\n\t\t\treturn \"\", ErrHashUnavailable\n\t\t}\n\n\t\thasher := hmac.New(m.Hash.New, keyBytes)\n\t\thasher.Write([]byte(signingString))\n\n\t\treturn EncodeSegment(hasher.Sum(nil)), nil\n\t}\n\n\treturn \"\", ErrInvalidKey\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/map_claims.go", "content": "package jwt\n\nimport (\n\t\"encoding/json\"\n\t\"errors\"\n\t// \"fmt\"\n)\n\n// Claims type that uses the map[string]interface{} for JSON decoding\n// This is the default claims type if you don't supply one\ntype MapClaims map[string]interface{}\n\n// Compares the aud claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (m MapClaims) VerifyAudience(cmp string, req bool) bool {\n\taud, _ := m[\"aud\"].(string)\n\treturn verifyAud(aud, cmp, req)\n}\n\n// Compares the exp claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (m MapClaims) VerifyExpiresAt(cmp int64, req bool) bool {\n\tswitch exp := m[\"exp\"].(type) {\n\tcase float64:\n\t\treturn verifyExp(int64(exp), cmp, req)\n\tcase json.Number:\n\t\tv, _ := exp.Int64()\n\t\treturn verifyExp(v, cmp, req)\n\t}\n\treturn req == false\n}\n\n// Compares the iat claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (m MapClaims) VerifyIssuedAt(cmp int64, req bool) bool {\n\tswitch iat := m[\"iat\"].(type) {\n\tcase float64:\n\t\treturn verifyIat(int64(iat), cmp, req)\n\tcase json.Number:\n\t\tv, _ := iat.Int64()\n\t\treturn verifyIat(v, cmp, req)\n\t}\n\treturn req == false\n}\n\n// Compares the iss claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (m MapClaims) VerifyIssuer(cmp string, req bool) bool {\n\tiss, _ := m[\"iss\"].(string)\n\treturn verifyIss(iss, cmp, req)\n}\n\n// Compares the nbf claim against cmp.\n// If required is false, this method will return true if the value matches or is unset\nfunc (m MapClaims) VerifyNotBefore(cmp int64, req bool) bool {\n\tswitch nbf := m[\"nbf\"].(type) {\n\tcase float64:\n\t\treturn verifyNbf(int64(nbf), cmp, req)\n\tcase json.Number:\n\t\tv, _ := nbf.Int64()\n\t\treturn verifyNbf(v, cmp, req)\n\t}\n\treturn req == false\n}\n\n// Validates time based claims \"exp, iat, nbf\".\n// There is no accounting for clock skew.\n// As well, if any of the above claims are not in the token, it will still\n// be considered a valid claim.\nfunc (m MapClaims) Valid() error {\n\tvErr := new(ValidationError)\n\tnow := TimeFunc().Unix()\n\n\tif m.VerifyExpiresAt(now, false) == false {\n\t\tvErr.Inner = errors.New(\"Token is expired\")\n\t\tvErr.Errors |= ValidationErrorExpired\n\t}\n\n\tif m.VerifyIssuedAt(now, false) == false {\n\t\tvErr.Inner = errors.New(\"Token used before issued\")\n\t\tvErr.Errors |= ValidationErrorIssuedAt\n\t}\n\n\tif m.VerifyNotBefore(now, false) == false {\n\t\tvErr.Inner = errors.New(\"Token is not valid yet\")\n\t\tvErr.Errors |= ValidationErrorNotValidYet\n\t}\n\n\tif vErr.valid() {\n\t\treturn nil\n\t}\n\n\treturn vErr\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/none.go", "content": "package jwt\n\n// Implements the none signing method. This is required by the spec\n// but you probably should never use it.\nvar SigningMethodNone *signingMethodNone\n\nconst UnsafeAllowNoneSignatureType unsafeNoneMagicConstant = \"none signing method allowed\"\n\nvar NoneSignatureTypeDisallowedError error\n\ntype signingMethodNone struct{}\ntype unsafeNoneMagicConstant string\n\nfunc init() {\n\tSigningMethodNone = &signingMethodNone{}\n\tNoneSignatureTypeDisallowedError = NewValidationError(\"'none' signature type is not allowed\", ValidationErrorSignatureInvalid)\n\n\tRegisterSigningMethod(SigningMethodNone.Alg(), func() SigningMethod {\n\t\treturn SigningMethodNone\n\t})\n}\n\nfunc (m *signingMethodNone) Alg() string {\n\treturn \"none\"\n}\n\n// Only allow 'none' alg type if UnsafeAllowNoneSignatureType is specified as the key\nfunc (m *signingMethodNone) Verify(signingString, signature string, key interface{}) (err error) {\n\t// Key must be UnsafeAllowNoneSignatureType to prevent accidentally\n\t// accepting 'none' signing method\n\tif _, ok := key.(unsafeNoneMagicConstant); !ok {\n\t\treturn NoneSignatureTypeDisallowedError\n\t}\n\t// If signing method is none, signature must be an empty string\n\tif signature != \"\" {\n\t\treturn NewValidationError(\n\t\t\t\"'none' signing method with non-empty signature\",\n\t\t\tValidationErrorSignatureInvalid,\n\t\t)\n\t}\n\n\t// Accept 'none' signing method.\n\treturn nil\n}\n\n// Only allow 'none' signing if UnsafeAllowNoneSignatureType is specified as the key\nfunc (m *signingMethodNone) Sign(signingString string, key interface{}) (string, error) {\n\tif _, ok := key.(unsafeNoneMagicConstant); ok {\n\t\treturn \"\", nil\n\t}\n\treturn \"\", NoneSignatureTypeDisallowedError\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/parser.go", "content": "package jwt\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"strings\"\n)\n\ntype Parser struct {\n\tValidMethods []string // If populated, only these methods will be considered valid\n\tUseJSONNumber bool // Use JSON Number format in JSON decoder\n\tSkipClaimsValidation bool // Skip claims validation during token parsing\n}\n\n// Parse, validate, and return a token.\n// keyFunc will receive the parsed token and should return the key for validating.\n// If everything is kosher, err will be nil\nfunc (p *Parser) Parse(tokenString string, keyFunc Keyfunc) (*Token, error) {\n\treturn p.ParseWithClaims(tokenString, MapClaims{}, keyFunc)\n}\n\nfunc (p *Parser) ParseWithClaims(tokenString string, claims Claims, keyFunc Keyfunc) (*Token, error) {\n\tparts := strings.Split(tokenString, \".\")\n\tif len(parts) != 3 {\n\t\treturn nil, NewValidationError(\"token contains an invalid number of segments\", ValidationErrorMalformed)\n\t}\n\n\tvar err error\n\ttoken := &Token{Raw: tokenString}\n\n\t// parse Header\n\tvar headerBytes []byte\n\tif headerBytes, err = DecodeSegment(parts[0]); err != nil {\n\t\tif strings.HasPrefix(strings.ToLower(tokenString), \"bearer \") {\n\t\t\treturn token, NewValidationError(\"tokenstring should not contain 'bearer '\", ValidationErrorMalformed)\n\t\t}\n\t\treturn token, &ValidationError{Inner: err, Errors: ValidationErrorMalformed}\n\t}\n\tif err = json.Unmarshal(headerBytes, &token.Header); err != nil {\n\t\treturn token, &ValidationError{Inner: err, Errors: ValidationErrorMalformed}\n\t}\n\n\t// parse Claims\n\tvar claimBytes []byte\n\ttoken.Claims = claims\n\n\tif claimBytes, err = DecodeSegment(parts[1]); err != nil {\n\t\treturn token, &ValidationError{Inner: err, Errors: ValidationErrorMalformed}\n\t}\n\tdec := json.NewDecoder(bytes.NewBuffer(claimBytes))\n\tif p.UseJSONNumber {\n\t\tdec.UseNumber()\n\t}\n\t// JSON Decode. Special case for map type to avoid weird pointer behavior\n\tif c, ok := token.Claims.(MapClaims); ok {\n\t\terr = dec.Decode(&c)\n\t} else {\n\t\terr = dec.Decode(&claims)\n\t}\n\t// Handle decode error\n\tif err != nil {\n\t\treturn token, &ValidationError{Inner: err, Errors: ValidationErrorMalformed}\n\t}\n\n\t// Lookup signature method\n\tif method, ok := token.Header[\"alg\"].(string); ok {\n\t\tif token.Method = GetSigningMethod(method); token.Method == nil {\n\t\t\treturn token, NewValidationError(\"signing method (alg) is unavailable.\", ValidationErrorUnverifiable)\n\t\t}\n\t} else {\n\t\treturn token, NewValidationError(\"signing method (alg) is unspecified.\", ValidationErrorUnverifiable)\n\t}\n\n\t// Verify signing method is in the required set\n\tif p.ValidMethods != nil {\n\t\tvar signingMethodValid = false\n\t\tvar alg = token.Method.Alg()\n\t\tfor _, m := range p.ValidMethods {\n\t\t\tif m == alg {\n\t\t\t\tsigningMethodValid = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif !signingMethodValid {\n\t\t\t// signing method is not in the listed set\n\t\t\treturn token, NewValidationError(fmt.Sprintf(\"signing method %v is invalid\", alg), ValidationErrorSignatureInvalid)\n\t\t}\n\t}\n\n\t// Lookup key\n\tvar key interface{}\n\tif keyFunc == nil {\n\t\t// keyFunc was not provided. short circuiting validation\n\t\treturn token, NewValidationError(\"no Keyfunc was provided.\", ValidationErrorUnverifiable)\n\t}\n\tif key, err = keyFunc(token); err != nil {\n\t\t// keyFunc returned an error\n\t\treturn token, &ValidationError{Inner: err, Errors: ValidationErrorUnverifiable}\n\t}\n\n\tvErr := &ValidationError{}\n\n\t// Validate Claims\n\tif !p.SkipClaimsValidation {\n\t\tif err := token.Claims.Valid(); err != nil {\n\n\t\t\t// If the Claims Valid returned an error, check if it is a validation error,\n\t\t\t// If it was another error type, create a ValidationError with a generic ClaimsInvalid flag set\n\t\t\tif e, ok := err.(*ValidationError); !ok {\n\t\t\t\tvErr = &ValidationError{Inner: err, Errors: ValidationErrorClaimsInvalid}\n\t\t\t} else {\n\t\t\t\tvErr = e\n\t\t\t}\n\t\t}\n\t}\n\n\t// Perform validation\n\ttoken.Signature = parts[2]\n\tif err = token.Method.Verify(strings.Join(parts[0:2], \".\"), token.Signature, key); err != nil {\n\t\tvErr.Inner = err\n\t\tvErr.Errors |= ValidationErrorSignatureInvalid\n\t}\n\n\tif vErr.valid() {\n\t\ttoken.Valid = true\n\t\treturn token, nil\n\t}\n\n\treturn token, vErr\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/rsa.go", "content": "package jwt\n\nimport (\n\t\"crypto\"\n\t\"crypto/rand\"\n\t\"crypto/rsa\"\n)\n\n// Implements the RSA family of signing methods signing methods\ntype SigningMethodRSA struct {\n\tName string\n\tHash crypto.Hash\n}\n\n// Specific instances for RS256 and company\nvar (\n\tSigningMethodRS256 *SigningMethodRSA\n\tSigningMethodRS384 *SigningMethodRSA\n\tSigningMethodRS512 *SigningMethodRSA\n)\n\nfunc init() {\n\t// RS256\n\tSigningMethodRS256 = &SigningMethodRSA{\"RS256\", crypto.SHA256}\n\tRegisterSigningMethod(SigningMethodRS256.Alg(), func() SigningMethod {\n\t\treturn SigningMethodRS256\n\t})\n\n\t// RS384\n\tSigningMethodRS384 = &SigningMethodRSA{\"RS384\", crypto.SHA384}\n\tRegisterSigningMethod(SigningMethodRS384.Alg(), func() SigningMethod {\n\t\treturn SigningMethodRS384\n\t})\n\n\t// RS512\n\tSigningMethodRS512 = &SigningMethodRSA{\"RS512\", crypto.SHA512}\n\tRegisterSigningMethod(SigningMethodRS512.Alg(), func() SigningMethod {\n\t\treturn SigningMethodRS512\n\t})\n}\n\nfunc (m *SigningMethodRSA) Alg() string {\n\treturn m.Name\n}\n\n// Implements the Verify method from SigningMethod\n// For this signing method, must be an rsa.PublicKey structure.\nfunc (m *SigningMethodRSA) Verify(signingString, signature string, key interface{}) error {\n\tvar err error\n\n\t// Decode the signature\n\tvar sig []byte\n\tif sig, err = DecodeSegment(signature); err != nil {\n\t\treturn err\n\t}\n\n\tvar rsaKey *rsa.PublicKey\n\tvar ok bool\n\n\tif rsaKey, ok = key.(*rsa.PublicKey); !ok {\n\t\treturn ErrInvalidKeyType\n\t}\n\n\t// Create hasher\n\tif !m.Hash.Available() {\n\t\treturn ErrHashUnavailable\n\t}\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\t// Verify the signature\n\treturn rsa.VerifyPKCS1v15(rsaKey, m.Hash, hasher.Sum(nil), sig)\n}\n\n// Implements the Sign method from SigningMethod\n// For this signing method, must be an rsa.PrivateKey structure.\nfunc (m *SigningMethodRSA) Sign(signingString string, key interface{}) (string, error) {\n\tvar rsaKey *rsa.PrivateKey\n\tvar ok bool\n\n\t// Validate type of key\n\tif rsaKey, ok = key.(*rsa.PrivateKey); !ok {\n\t\treturn \"\", ErrInvalidKey\n\t}\n\n\t// Create the hasher\n\tif !m.Hash.Available() {\n\t\treturn \"\", ErrHashUnavailable\n\t}\n\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\t// Sign the string and return the encoded bytes\n\tif sigBytes, err := rsa.SignPKCS1v15(rand.Reader, rsaKey, m.Hash, hasher.Sum(nil)); err == nil {\n\t\treturn EncodeSegment(sigBytes), nil\n\t} else {\n\t\treturn \"\", err\n\t}\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/rsa_pss.go", "content": "// +build go1.4\n\npackage jwt\n\nimport (\n\t\"crypto\"\n\t\"crypto/rand\"\n\t\"crypto/rsa\"\n)\n\n// Implements the RSAPSS family of signing methods signing methods\ntype SigningMethodRSAPSS struct {\n\t*SigningMethodRSA\n\tOptions *rsa.PSSOptions\n}\n\n// Specific instances for RS/PS and company\nvar (\n\tSigningMethodPS256 *SigningMethodRSAPSS\n\tSigningMethodPS384 *SigningMethodRSAPSS\n\tSigningMethodPS512 *SigningMethodRSAPSS\n)\n\nfunc init() {\n\t// PS256\n\tSigningMethodPS256 = &SigningMethodRSAPSS{\n\t\t&SigningMethodRSA{\n\t\t\tName: \"PS256\",\n\t\t\tHash: crypto.SHA256,\n\t\t},\n\t\t&rsa.PSSOptions{\n\t\t\tSaltLength: rsa.PSSSaltLengthAuto,\n\t\t\tHash: crypto.SHA256,\n\t\t},\n\t}\n\tRegisterSigningMethod(SigningMethodPS256.Alg(), func() SigningMethod {\n\t\treturn SigningMethodPS256\n\t})\n\n\t// PS384\n\tSigningMethodPS384 = &SigningMethodRSAPSS{\n\t\t&SigningMethodRSA{\n\t\t\tName: \"PS384\",\n\t\t\tHash: crypto.SHA384,\n\t\t},\n\t\t&rsa.PSSOptions{\n\t\t\tSaltLength: rsa.PSSSaltLengthAuto,\n\t\t\tHash: crypto.SHA384,\n\t\t},\n\t}\n\tRegisterSigningMethod(SigningMethodPS384.Alg(), func() SigningMethod {\n\t\treturn SigningMethodPS384\n\t})\n\n\t// PS512\n\tSigningMethodPS512 = &SigningMethodRSAPSS{\n\t\t&SigningMethodRSA{\n\t\t\tName: \"PS512\",\n\t\t\tHash: crypto.SHA512,\n\t\t},\n\t\t&rsa.PSSOptions{\n\t\t\tSaltLength: rsa.PSSSaltLengthAuto,\n\t\t\tHash: crypto.SHA512,\n\t\t},\n\t}\n\tRegisterSigningMethod(SigningMethodPS512.Alg(), func() SigningMethod {\n\t\treturn SigningMethodPS512\n\t})\n}\n\n// Implements the Verify method from SigningMethod\n// For this verify method, key must be an rsa.PublicKey struct\nfunc (m *SigningMethodRSAPSS) Verify(signingString, signature string, key interface{}) error {\n\tvar err error\n\n\t// Decode the signature\n\tvar sig []byte\n\tif sig, err = DecodeSegment(signature); err != nil {\n\t\treturn err\n\t}\n\n\tvar rsaKey *rsa.PublicKey\n\tswitch k := key.(type) {\n\tcase *rsa.PublicKey:\n\t\trsaKey = k\n\tdefault:\n\t\treturn ErrInvalidKey\n\t}\n\n\t// Create hasher\n\tif !m.Hash.Available() {\n\t\treturn ErrHashUnavailable\n\t}\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\treturn rsa.VerifyPSS(rsaKey, m.Hash, hasher.Sum(nil), sig, m.Options)\n}\n\n// Implements the Sign method from SigningMethod\n// For this signing method, key must be an rsa.PrivateKey struct\nfunc (m *SigningMethodRSAPSS) Sign(signingString string, key interface{}) (string, error) {\n\tvar rsaKey *rsa.PrivateKey\n\n\tswitch k := key.(type) {\n\tcase *rsa.PrivateKey:\n\t\trsaKey = k\n\tdefault:\n\t\treturn \"\", ErrInvalidKeyType\n\t}\n\n\t// Create the hasher\n\tif !m.Hash.Available() {\n\t\treturn \"\", ErrHashUnavailable\n\t}\n\n\thasher := m.Hash.New()\n\thasher.Write([]byte(signingString))\n\n\t// Sign the string and return the encoded bytes\n\tif sigBytes, err := rsa.SignPSS(rand.Reader, rsaKey, m.Hash, hasher.Sum(nil), m.Options); err == nil {\n\t\treturn EncodeSegment(sigBytes), nil\n\t} else {\n\t\treturn \"\", err\n\t}\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/rsa_utils.go", "content": "package jwt\n\nimport (\n\t\"crypto/rsa\"\n\t\"crypto/x509\"\n\t\"encoding/pem\"\n\t\"errors\"\n)\n\nvar (\n\tErrKeyMustBePEMEncoded = errors.New(\"Invalid Key: Key must be PEM encoded PKCS1 or PKCS8 private key\")\n\tErrNotRSAPrivateKey = errors.New(\"Key is not a valid RSA private key\")\n\tErrNotRSAPublicKey = errors.New(\"Key is not a valid RSA public key\")\n)\n\n// Parse PEM encoded PKCS1 or PKCS8 private key\nfunc ParseRSAPrivateKeyFromPEM(key []byte) (*rsa.PrivateKey, error) {\n\tvar err error\n\n\t// Parse PEM block\n\tvar block *pem.Block\n\tif block, _ = pem.Decode(key); block == nil {\n\t\treturn nil, ErrKeyMustBePEMEncoded\n\t}\n\n\tvar parsedKey interface{}\n\tif parsedKey, err = x509.ParsePKCS1PrivateKey(block.Bytes); err != nil {\n\t\tif parsedKey, err = x509.ParsePKCS8PrivateKey(block.Bytes); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tvar pkey *rsa.PrivateKey\n\tvar ok bool\n\tif pkey, ok = parsedKey.(*rsa.PrivateKey); !ok {\n\t\treturn nil, ErrNotRSAPrivateKey\n\t}\n\n\treturn pkey, nil\n}\n\n// Parse PEM encoded PKCS1 or PKCS8 public key\nfunc ParseRSAPublicKeyFromPEM(key []byte) (*rsa.PublicKey, error) {\n\tvar err error\n\n\t// Parse PEM block\n\tvar block *pem.Block\n\tif block, _ = pem.Decode(key); block == nil {\n\t\treturn nil, ErrKeyMustBePEMEncoded\n\t}\n\n\t// Parse the key\n\tvar parsedKey interface{}\n\tif parsedKey, err = x509.ParsePKIXPublicKey(block.Bytes); err != nil {\n\t\tif cert, err := x509.ParseCertificate(block.Bytes); err == nil {\n\t\t\tparsedKey = cert.PublicKey\n\t\t} else {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tvar pkey *rsa.PublicKey\n\tvar ok bool\n\tif pkey, ok = parsedKey.(*rsa.PublicKey); !ok {\n\t\treturn nil, ErrNotRSAPublicKey\n\t}\n\n\treturn pkey, nil\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/signing_method.go", "content": "package jwt\n\nimport (\n\t\"sync\"\n)\n\nvar signingMethods = map[string]func() SigningMethod{}\nvar signingMethodLock = new(sync.RWMutex)\n\n// Implement SigningMethod to add new methods for signing or verifying tokens.\ntype SigningMethod interface {\n\tVerify(signingString, signature string, key interface{}) error // Returns nil if signature is valid\n\tSign(signingString string, key interface{}) (string, error) // Returns encoded signature or error\n\tAlg() string // returns the alg identifier for this method (example: 'HS256')\n}\n\n// Register the \"alg\" name and a factory function for signing method.\n// This is typically done during init() in the method's implementation\nfunc RegisterSigningMethod(alg string, f func() SigningMethod) {\n\tsigningMethodLock.Lock()\n\tdefer signingMethodLock.Unlock()\n\n\tsigningMethods[alg] = f\n}\n\n// Get a signing method from an \"alg\" string\nfunc GetSigningMethod(alg string) (method SigningMethod) {\n\tsigningMethodLock.RLock()\n\tdefer signingMethodLock.RUnlock()\n\n\tif methodF, ok := signingMethods[alg]; ok {\n\t\tmethod = methodF()\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/dgrijalva/jwt-go/token.go", "content": "package jwt\n\nimport (\n\t\"encoding/base64\"\n\t\"encoding/json\"\n\t\"strings\"\n\t\"time\"\n)\n\n// TimeFunc provides the current time when parsing token to validate \"exp\" claim (expiration time).\n// You can override it to use another time value. This is useful for testing or if your\n// server uses a different time zone than your tokens.\nvar TimeFunc = time.Now\n\n// Parse methods use this callback function to supply\n// the key for verification. The function receives the parsed,\n// but unverified Token. This allows you to use properties in the\n// Header of the token (such as `kid`) to identify which key to use.\ntype Keyfunc func(*Token) (interface{}, error)\n\n// A JWT Token. Different fields will be used depending on whether you're\n// creating or parsing/verifying a token.\ntype Token struct {\n\tRaw string // The raw token. Populated when you Parse a token\n\tMethod SigningMethod // The signing method used or to be used\n\tHeader map[string]interface{} // The first segment of the token\n\tClaims Claims // The second segment of the token\n\tSignature string // The third segment of the token. Populated when you Parse a token\n\tValid bool // Is the token valid? Populated when you Parse/Verify a token\n}\n\n// Create a new Token. Takes a signing method\nfunc New(method SigningMethod) *Token {\n\treturn NewWithClaims(method, MapClaims{})\n}\n\nfunc NewWithClaims(method SigningMethod, claims Claims) *Token {\n\treturn &Token{\n\t\tHeader: map[string]interface{}{\n\t\t\t\"typ\": \"JWT\",\n\t\t\t\"alg\": method.Alg(),\n\t\t},\n\t\tClaims: claims,\n\t\tMethod: method,\n\t}\n}\n\n// Get the complete, signed token\nfunc (t *Token) SignedString(key interface{}) (string, error) {\n\tvar sig, sstr string\n\tvar err error\n\tif sstr, err = t.SigningString(); err != nil {\n\t\treturn \"\", err\n\t}\n\tif sig, err = t.Method.Sign(sstr, key); err != nil {\n\t\treturn \"\", err\n\t}\n\treturn strings.Join([]string{sstr, sig}, \".\"), nil\n}\n\n// Generate the signing string. This is the\n// most expensive part of the whole deal. Unless you\n// need this for something special, just go straight for\n// the SignedString.\nfunc (t *Token) SigningString() (string, error) {\n\tvar err error\n\tparts := make([]string, 2)\n\tfor i, _ := range parts {\n\t\tvar jsonValue []byte\n\t\tif i == 0 {\n\t\t\tif jsonValue, err = json.Marshal(t.Header); err != nil {\n\t\t\t\treturn \"\", err\n\t\t\t}\n\t\t} else {\n\t\t\tif jsonValue, err = json.Marshal(t.Claims); err != nil {\n\t\t\t\treturn \"\", err\n\t\t\t}\n\t\t}\n\n\t\tparts[i] = EncodeSegment(jsonValue)\n\t}\n\treturn strings.Join(parts, \".\"), nil\n}\n\n// Parse, validate, and return a token.\n// keyFunc will receive the parsed token and should return the key for validating.\n// If everything is kosher, err will be nil\nfunc Parse(tokenString string, keyFunc Keyfunc) (*Token, error) {\n\treturn new(Parser).Parse(tokenString, keyFunc)\n}\n\nfunc ParseWithClaims(tokenString string, claims Claims, keyFunc Keyfunc) (*Token, error) {\n\treturn new(Parser).ParseWithClaims(tokenString, claims, keyFunc)\n}\n\n// Encode JWT specific base64url encoding with padding stripped\nfunc EncodeSegment(seg []byte) string {\n\treturn strings.TrimRight(base64.URLEncoding.EncodeToString(seg), \"=\")\n}\n\n// Decode JWT specific base64url encoding with padding stripped\nfunc DecodeSegment(seg string) ([]byte, error) {\n\tif l := len(seg) % 4; l > 0 {\n\t\tseg += strings.Repeat(\"=\", 4-l)\n\t}\n\n\treturn base64.URLEncoding.DecodeString(seg)\n}\n" }, { "path": "vendor/github.com/gin-contrib/sse/.travis.yml", "content": "language: go\nsudo: false\ngo:\n - 1.8.x\n - 1.9.x\n - 1.10.x\n - 1.11.x\n - 1.12.x\n - master\n\ngit:\n depth: 10\n\nmatrix:\n fast_finish: true\n include:\n - go: 1.11.x\n env: GO111MODULE=on\n - go: 1.12.x\n env: GO111MODULE=on\n\nscript:\n - go test -v -covermode=count -coverprofile=coverage.out\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n" }, { "path": "vendor/github.com/gin-contrib/sse/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2014 Manuel Martínez-Almeida\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n" }, { "path": "vendor/github.com/gin-contrib/sse/README.md", "content": "# Server-Sent Events\n\n[![GoDoc](https://godoc.org/github.com/gin-contrib/sse?status.svg)](https://godoc.org/github.com/gin-contrib/sse)\n[![Build Status](https://travis-ci.org/gin-contrib/sse.svg)](https://travis-ci.org/gin-contrib/sse)\n[![codecov](https://codecov.io/gh/gin-contrib/sse/branch/master/graph/badge.svg)](https://codecov.io/gh/gin-contrib/sse)\n[![Go Report Card](https://goreportcard.com/badge/github.com/gin-contrib/sse)](https://goreportcard.com/report/github.com/gin-contrib/sse)\n\nServer-sent events (SSE) is a technology where a browser receives automatic updates from a server via HTTP connection. The Server-Sent Events EventSource API is [standardized as part of HTML5[1] by the W3C](http://www.w3.org/TR/2009/WD-eventsource-20091029/).\n\n- [Read this great SSE introduction by the HTML5Rocks guys](http://www.html5rocks.com/en/tutorials/eventsource/basics/)\n- [Browser support](http://caniuse.com/#feat=eventsource)\n\n## Sample code\n\n```go\nimport \"github.com/gin-contrib/sse\"\n\nfunc httpHandler(w http.ResponseWriter, req *http.Request) {\n\t// data can be a primitive like a string, an integer or a float\n\tsse.Encode(w, sse.Event{\n\t\tEvent: \"message\",\n\t\tData: \"some data\\nmore data\",\n\t})\n\n\t// also a complex type, like a map, a struct or a slice\n\tsse.Encode(w, sse.Event{\n\t\tId: \"124\",\n\t\tEvent: \"message\",\n\t\tData: map[string]interface{}{\n\t\t\t\"user\": \"manu\",\n\t\t\t\"date\": time.Now().Unix(),\n\t\t\t\"content\": \"hi!\",\n\t\t},\n\t})\n}\n```\n```\nevent: message\ndata: some data\\\\nmore data\n\nid: 124\nevent: message\ndata: {\"content\":\"hi!\",\"date\":1431540810,\"user\":\"manu\"}\n \n```\n\n## Content-Type\n\n```go\nfmt.Println(sse.ContentType)\n```\n```\ntext/event-stream\n```\n\n## Decoding support\n\nThere is a client-side implementation of SSE coming soon.\n" }, { "path": "vendor/github.com/gin-contrib/sse/go.mod", "content": "module github.com/gin-contrib/sse\n\ngo 1.12\n\nrequire github.com/stretchr/testify v1.3.0\n" }, { "path": "vendor/github.com/gin-contrib/sse/go.sum", "content": "github.com/davecgh/go-spew v1.1.0 h1:ZDRjVQ15GmhC3fiQ8ni8+OwkZQO4DARzQgrnXU1Liz8=\ngithub.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.3.0 h1:TivCn/peBQ7UY8ooIcPgZFpTNSz0Q2U6UrFlUfqbe0Q=\ngithub.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI=\n" }, { "path": "vendor/github.com/gin-contrib/sse/sse-decoder.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage sse\n\nimport (\n\t\"bytes\"\n\t\"io\"\n\t\"io/ioutil\"\n)\n\ntype decoder struct {\n\tevents []Event\n}\n\nfunc Decode(r io.Reader) ([]Event, error) {\n\tvar dec decoder\n\treturn dec.decode(r)\n}\n\nfunc (d *decoder) dispatchEvent(event Event, data string) {\n\tdataLength := len(data)\n\tif dataLength > 0 {\n\t\t//If the data buffer's last character is a U+000A LINE FEED (LF) character, then remove the last character from the data buffer.\n\t\tdata = data[:dataLength-1]\n\t\tdataLength--\n\t}\n\tif dataLength == 0 && event.Event == \"\" {\n\t\treturn\n\t}\n\tif event.Event == \"\" {\n\t\tevent.Event = \"message\"\n\t}\n\tevent.Data = data\n\td.events = append(d.events, event)\n}\n\nfunc (d *decoder) decode(r io.Reader) ([]Event, error) {\n\tbuf, err := ioutil.ReadAll(r)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar currentEvent Event\n\tvar dataBuffer *bytes.Buffer = new(bytes.Buffer)\n\t// TODO (and unit tests)\n\t// Lines must be separated by either a U+000D CARRIAGE RETURN U+000A LINE FEED (CRLF) character pair,\n\t// a single U+000A LINE FEED (LF) character,\n\t// or a single U+000D CARRIAGE RETURN (CR) character.\n\tlines := bytes.Split(buf, []byte{'\\n'})\n\tfor _, line := range lines {\n\t\tif len(line) == 0 {\n\t\t\t// If the line is empty (a blank line). Dispatch the event.\n\t\t\td.dispatchEvent(currentEvent, dataBuffer.String())\n\n\t\t\t// reset current event and data buffer\n\t\t\tcurrentEvent = Event{}\n\t\t\tdataBuffer.Reset()\n\t\t\tcontinue\n\t\t}\n\t\tif line[0] == byte(':') {\n\t\t\t// If the line starts with a U+003A COLON character (:), ignore the line.\n\t\t\tcontinue\n\t\t}\n\n\t\tvar field, value []byte\n\t\tcolonIndex := bytes.IndexRune(line, ':')\n\t\tif colonIndex != -1 {\n\t\t\t// If the line contains a U+003A COLON character character (:)\n\t\t\t// Collect the characters on the line before the first U+003A COLON character (:),\n\t\t\t// and let field be that string.\n\t\t\tfield = line[:colonIndex]\n\t\t\t// Collect the characters on the line after the first U+003A COLON character (:),\n\t\t\t// and let value be that string.\n\t\t\tvalue = line[colonIndex+1:]\n\t\t\t// If value starts with a single U+0020 SPACE character, remove it from value.\n\t\t\tif len(value) > 0 && value[0] == ' ' {\n\t\t\t\tvalue = value[1:]\n\t\t\t}\n\t\t} else {\n\t\t\t// Otherwise, the string is not empty but does not contain a U+003A COLON character character (:)\n\t\t\t// Use the whole line as the field name, and the empty string as the field value.\n\t\t\tfield = line\n\t\t\tvalue = []byte{}\n\t\t}\n\t\t// The steps to process the field given a field name and a field value depend on the field name,\n\t\t// as given in the following list. Field names must be compared literally,\n\t\t// with no case folding performed.\n\t\tswitch string(field) {\n\t\tcase \"event\":\n\t\t\t// Set the event name buffer to field value.\n\t\t\tcurrentEvent.Event = string(value)\n\t\tcase \"id\":\n\t\t\t// Set the event stream's last event ID to the field value.\n\t\t\tcurrentEvent.Id = string(value)\n\t\tcase \"retry\":\n\t\t\t// If the field value consists of only characters in the range U+0030 DIGIT ZERO (0) to U+0039 DIGIT NINE (9),\n\t\t\t// then interpret the field value as an integer in base ten, and set the event stream's reconnection time to that integer.\n\t\t\t// Otherwise, ignore the field.\n\t\t\tcurrentEvent.Id = string(value)\n\t\tcase \"data\":\n\t\t\t// Append the field value to the data buffer,\n\t\t\tdataBuffer.Write(value)\n\t\t\t// then append a single U+000A LINE FEED (LF) character to the data buffer.\n\t\t\tdataBuffer.WriteString(\"\\n\")\n\t\tdefault:\n\t\t\t//Otherwise. The field is ignored.\n\t\t\tcontinue\n\t\t}\n\t}\n\t// Once the end of the file is reached, the user agent must dispatch the event one final time.\n\td.dispatchEvent(currentEvent, dataBuffer.String())\n\n\treturn d.events, nil\n}\n" }, { "path": "vendor/github.com/gin-contrib/sse/sse-encoder.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage sse\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Server-Sent Events\n// W3C Working Draft 29 October 2009\n// http://www.w3.org/TR/2009/WD-eventsource-20091029/\n\nconst ContentType = \"text/event-stream\"\n\nvar contentType = []string{ContentType}\nvar noCache = []string{\"no-cache\"}\n\nvar fieldReplacer = strings.NewReplacer(\n\t\"\\n\", \"\\\\n\",\n\t\"\\r\", \"\\\\r\")\n\nvar dataReplacer = strings.NewReplacer(\n\t\"\\n\", \"\\ndata:\",\n\t\"\\r\", \"\\\\r\")\n\ntype Event struct {\n\tEvent string\n\tId string\n\tRetry uint\n\tData interface{}\n}\n\nfunc Encode(writer io.Writer, event Event) error {\n\tw := checkWriter(writer)\n\twriteId(w, event.Id)\n\twriteEvent(w, event.Event)\n\twriteRetry(w, event.Retry)\n\treturn writeData(w, event.Data)\n}\n\nfunc writeId(w stringWriter, id string) {\n\tif len(id) > 0 {\n\t\tw.WriteString(\"id:\")\n\t\tfieldReplacer.WriteString(w, id)\n\t\tw.WriteString(\"\\n\")\n\t}\n}\n\nfunc writeEvent(w stringWriter, event string) {\n\tif len(event) > 0 {\n\t\tw.WriteString(\"event:\")\n\t\tfieldReplacer.WriteString(w, event)\n\t\tw.WriteString(\"\\n\")\n\t}\n}\n\nfunc writeRetry(w stringWriter, retry uint) {\n\tif retry > 0 {\n\t\tw.WriteString(\"retry:\")\n\t\tw.WriteString(strconv.FormatUint(uint64(retry), 10))\n\t\tw.WriteString(\"\\n\")\n\t}\n}\n\nfunc writeData(w stringWriter, data interface{}) error {\n\tw.WriteString(\"data:\")\n\tswitch kindOfData(data) {\n\tcase reflect.Struct, reflect.Slice, reflect.Map:\n\t\terr := json.NewEncoder(w).Encode(data)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tw.WriteString(\"\\n\")\n\tdefault:\n\t\tdataReplacer.WriteString(w, fmt.Sprint(data))\n\t\tw.WriteString(\"\\n\\n\")\n\t}\n\treturn nil\n}\n\nfunc (r Event) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\treturn Encode(w, r)\n}\n\nfunc (r Event) WriteContentType(w http.ResponseWriter) {\n\theader := w.Header()\n\theader[\"Content-Type\"] = contentType\n\n\tif _, exist := header[\"Cache-Control\"]; !exist {\n\t\theader[\"Cache-Control\"] = noCache\n\t}\n}\n\nfunc kindOfData(data interface{}) reflect.Kind {\n\tvalue := reflect.ValueOf(data)\n\tvalueType := value.Kind()\n\tif valueType == reflect.Ptr {\n\t\tvalueType = value.Elem().Kind()\n\t}\n\treturn valueType\n}\n" }, { "path": "vendor/github.com/gin-contrib/sse/writer.go", "content": "package sse\n\nimport \"io\"\n\ntype stringWriter interface {\n\tio.Writer\n\tWriteString(string) (int, error)\n}\n\ntype stringWrapper struct {\n\tio.Writer\n}\n\nfunc (w stringWrapper) WriteString(str string) (int, error) {\n\treturn w.Writer.Write([]byte(str))\n}\n\nfunc checkWriter(writer io.Writer) stringWriter {\n\tif w, ok := writer.(stringWriter); ok {\n\t\treturn w\n\t} else {\n\t\treturn stringWrapper{writer}\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/.gitignore", "content": "vendor/*\n!vendor/vendor.json\ncoverage.out\ncount.out\ntest\nprofile.out\ntmp.out\n" }, { "path": "vendor/github.com/gin-gonic/gin/.travis.yml", "content": "language: go\n\nmatrix:\n fast_finish: true\n include:\n - go: 1.8.x\n - go: 1.9.x\n - go: 1.10.x\n - go: 1.11.x\n env: GO111MODULE=on\n - go: 1.12.x\n env: GO111MODULE=on\n - go: master\n env: GO111MODULE=on\n\ngit:\n depth: 10\n\nbefore_install:\n - if [[ \"${GO111MODULE}\" = \"on\" ]]; then mkdir \"${HOME}/go\"; export GOPATH=\"${HOME}/go\"; fi\n\ninstall:\n - if [[ \"${GO111MODULE}\" = \"on\" ]]; then go mod download; else make install; fi\n - if [[ \"${GO111MODULE}\" = \"on\" ]]; then export PATH=\"${GOPATH}/bin:${GOROOT}/bin:${PATH}\"; fi\n - if [[ \"${GO111MODULE}\" = \"on\" ]]; then make tools; fi\n\ngo_import_path: github.com/gin-gonic/gin\n\nscript:\n - make vet\n - make fmt-check\n - make misspell-check\n - make test\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n\nnotifications:\n webhooks:\n urls:\n - https://webhooks.gitter.im/e/7f95bf605c4d356372f4\n on_success: change # options: [always|never|change] default: always\n on_failure: always # options: [always|never|change] default: always\n on_start: false # default: false\n" }, { "path": "vendor/github.com/gin-gonic/gin/AUTHORS.md", "content": "List of all the awesome people working to make Gin the best Web Framework in Go.\n\n## gin 1.x series authors\n\n**Gin Core Team:** Bo-Yi Wu (@appleboy), 田欧 (@thinkerou), Javier Provecho (@javierprovecho)\n\n## gin 0.x series authors\n\n**Maintainers:** Manu Martinez-Almeida (@manucorporat), Javier Provecho (@javierprovecho)\n\nPeople and companies, who have contributed, in alphabetical order.\n\n**@858806258 (杰哥)**\n- Fix typo in example\n\n\n**@achedeuzot (Klemen Sever)**\n- Fix newline debug printing\n\n\n**@adammck (Adam Mckaig)**\n- Add MIT license\n\n\n**@AlexanderChen1989 (Alexander)**\n- Typos in README\n\n\n**@alexanderdidenko (Aleksandr Didenko)**\n- Add support multipart/form-data\n\n\n**@alexandernyquist (Alexander Nyquist)**\n- Using template.Must to fix multiple return issue\n- ★ Added support for OPTIONS verb\n- ★ Setting response headers before calling WriteHeader\n- Improved documentation for model binding\n- ★ Added Content.Redirect()\n- ★ Added tons of Unit tests\n\n\n**@austinheap (Austin Heap)**\n- Added travis CI integration\n\n\n**@andredublin (Andre Dublin)**\n- Fix typo in comment\n\n\n**@bredov (Ludwig Valda Vasquez)**\n- Fix html templating in debug mode\n\n\n**@bluele (Jun Kimura)**\n- Fixes code examples in README\n\n\n**@chad-russell**\n- ★ Support for serializing gin.H into XML\n\n\n**@dickeyxxx (Jeff Dickey)**\n- Typos in README\n- Add example about serving static files\n\n\n**@donileo (Adonis)**\n- Add NoMethod handler\n\n\n**@dutchcoders (DutchCoders)**\n- ★ Fix security bug that allows client to spoof ip\n- Fix typo. r.HTMLTemplates -> SetHTMLTemplate\n\n\n**@el3ctro- (Joshua Loper)**\n- Fix typo in example\n\n\n**@ethankan (Ethan Kan)**\n- Unsigned integers in binding\n\n\n**(Evgeny Persienko)**\n- Validate sub structures\n\n\n**@frankbille (Frank Bille)**\n- Add support for HTTP Realm Auth\n\n\n**@fmd (Fareed Dudhia)**\n- Fix typo. SetHTTPTemplate -> SetHTMLTemplate\n\n\n**@ironiridis (Christopher Harrington)**\n- Remove old reference\n\n\n**@jammie-stackhouse (Jamie Stackhouse)**\n- Add more shortcuts for router methods\n\n\n**@jasonrhansen**\n- Fix spelling and grammar errors in documentation\n\n\n**@JasonSoft (Jason Lee)**\n- Fix typo in comment\n\n\n**@joiggama (Ignacio Galindo)**\n- Add utf-8 charset header on renders\n\n\n**@julienschmidt (Julien Schmidt)**\n- gofmt the code examples\n\n\n**@kelcecil (Kel Cecil)**\n- Fix readme typo\n\n\n**@kyledinh (Kyle Dinh)**\n- Adds RunTLS()\n\n\n**@LinusU (Linus Unnebäck)**\n- Small fixes in README\n\n\n**@loongmxbt (Saint Asky)**\n- Fix typo in example\n\n\n**@lucas-clemente (Lucas Clemente)**\n- ★ work around path.Join removing trailing slashes from routes\n\n\n**@mattn (Yasuhiro Matsumoto)**\n- Improve color logger\n\n\n**@mdigger (Dmitry Sedykh)**\n- Fixes Form binding when content-type is x-www-form-urlencoded\n- No repeat call c.Writer.Status() in gin.Logger\n- Fixes Content-Type for json render\n\n\n**@mirzac (Mirza Ceric)**\n- Fix debug printing\n\n\n**@mopemope (Yutaka Matsubara)**\n- ★ Adds Godep support (Dependencies Manager)\n- Fix variadic parameter in the flexible render API\n- Fix Corrupted plain render\n- Add Pluggable View Renderer Example\n \n\n**@msemenistyi (Mykyta Semenistyi)**\n- update Readme.md. Add code to String method\n\n\n**@msoedov (Sasha Myasoedov)**\n- ★ Adds tons of unit tests.\n\n\n**@ngerakines (Nick Gerakines)**\n- ★ Improves API, c.GET() doesn't panic\n- Adds MustGet() method\n\n\n**@r8k (Rajiv Kilaparti)**\n- Fix Port usage in README.\n\n\n**@rayrod2030 (Ray Rodriguez)**\n- Fix typo in example\n\n\n**@rns**\n- Fix typo in example\n\n\n**@RobAWilkinson (Robert Wilkinson)**\n- Add example of forms and params\n\n\n**@rogierlommers (Rogier Lommers)**\n- Add updated static serve example\n\n\n**@se77en (Damon Zhao)**\n- Improve color logging\n\n\n**@silasb (Silas Baronda)**\n- Fixing quotes in README\n\n\n**@SkuliOskarsson (Skuli Oskarsson)**\n- Fixes some texts in README II\n\n\n**@slimmy (Jimmy Pettersson)**\n- Added messages for required bindings\n\n\n**@smira (Andrey Smirnov)**\n- Add support for ignored/unexported fields in binding\n\n\n**@superalsrk (SRK.Lyu)**\n- Update httprouter godeps\n\n\n**@tebeka (Miki Tebeka)**\n- Use net/http constants instead of numeric values\n\n\n**@techjanitor**\n- Update context.go reserved IPs\n\n\n**@yosssi (Keiji Yoshida)**\n- Fix link in README\n\n\n**@yuyabee**\n- Fixed README\n" }, { "path": "vendor/github.com/gin-gonic/gin/BENCHMARKS.md", "content": "\n## Benchmark System\n\n**VM HOST:** DigitalOcean \n**Machine:** 4 CPU, 8 GB RAM. Ubuntu 16.04.2 x64 \n**Date:** July 19th, 2017 \n**Go Version:** 1.8.3 linux/amd64 \n**Source:** [Go HTTP Router Benchmark](https://github.com/julienschmidt/go-http-routing-benchmark) \n\n## Static Routes: 157\n\n```\nGin: 30512 Bytes\n\nHttpServeMux: 17344 Bytes\nAce: 30080 Bytes\nBear: 30472 Bytes\nBeego: 96408 Bytes\nBone: 37904 Bytes\nDenco: 10464 Bytes\nEcho: 73680 Bytes\nGocraftWeb: 55720 Bytes\nGoji: 27200 Bytes\nGojiv2: 104464 Bytes\nGoJsonRest: 136472 Bytes\nGoRestful: 914904 Bytes\nGorillaMux: 675568 Bytes\nHttpRouter: 21128 Bytes\nHttpTreeMux: 73448 Bytes\nKocha: 115072 Bytes\nLARS: 30120 Bytes\nMacaron: 37984 Bytes\nMartini: 310832 Bytes\nPat: 20464 Bytes\nPossum: 91328 Bytes\nR2router: 23712 Bytes\nRivet: 23880 Bytes\nTango: 28008 Bytes\nTigerTonic: 80368 Bytes\nTraffic: 626480 Bytes\nVulcan: 369064 Bytes\n```\n\n## GithubAPI Routes: 203\n\n```\nGin: 52672 Bytes\n\nAce: 48992 Bytes\nBear: 161592 Bytes\nBeego: 147992 Bytes\nBone: 97728 Bytes\nDenco: 36440 Bytes\nEcho: 95672 Bytes\nGocraftWeb: 95640 Bytes\nGoji: 86088 Bytes\nGojiv2: 144392 Bytes\nGoJsonRest: 134648 Bytes\nGoRestful: 1410760 Bytes\nGorillaMux: 1509488 Bytes\nHttpRouter: 37464 Bytes\nHttpTreeMux: 78800 Bytes\nKocha: 785408 Bytes\nLARS: 49032 Bytes\nMacaron: 132712 Bytes\nMartini: 564352 Bytes\nPat: 21200 Bytes\nPossum: 83888 Bytes\nR2router: 47104 Bytes\nRivet: 42840 Bytes\nTango: 54584 Bytes\nTigerTonic: 96384 Bytes\nTraffic: 1061920 Bytes\nVulcan: 465296 Bytes\n```\n\n## GPlusAPI Routes: 13\n\n```\nGin: 3968 Bytes\n\nAce: 3600 Bytes\nBear: 7112 Bytes\nBeego: 10048 Bytes\nBone: 6480 Bytes\nDenco: 3256 Bytes\nEcho: 9000 Bytes\nGocraftWeb: 7496 Bytes\nGoji: 2912 Bytes\nGojiv2: 7376 Bytes\nGoJsonRest: 11544 Bytes\nGoRestful: 88776 Bytes\nGorillaMux: 71488 Bytes\nHttpRouter: 2712 Bytes\nHttpTreeMux: 7440 Bytes\nKocha: 128880 Bytes\nLARS: 3640 Bytes\nMacaron: 8656 Bytes\nMartini: 23936 Bytes\nPat: 1856 Bytes\nPossum: 7248 Bytes\nR2router: 3928 Bytes\nRivet: 3064 Bytes\nTango: 4912 Bytes\nTigerTonic: 9408 Bytes\nTraffic: 49472 Bytes\nVulcan: 25496 Bytes\n```\n\n## ParseAPI Routes: 26\n\n```\nGin: 6928 Bytes\n\nAce: 6592 Bytes\nBear: 12320 Bytes\nBeego: 18960 Bytes\nBone: 11024 Bytes\nDenco: 4184 Bytes\nEcho: 11168 Bytes\nGocraftWeb: 12800 Bytes\nGoji: 5232 Bytes\nGojiv2: 14464 Bytes\nGoJsonRest: 14216 Bytes\nGoRestful: 127368 Bytes\nGorillaMux: 123016 Bytes\nHttpRouter: 4976 Bytes\nHttpTreeMux: 7848 Bytes\nKocha: 181712 Bytes\nLARS: 6632 Bytes\nMacaron: 13648 Bytes\nMartini: 45952 Bytes\nPat: 2560 Bytes\nPossum: 9200 Bytes\nR2router: 7056 Bytes\nRivet: 5680 Bytes\nTango: 8664 Bytes\nTigerTonic: 9840 Bytes\nTraffic: 93480 Bytes\nVulcan: 44504 Bytes\n```\n\n## Static Routes\n\n```\nBenchmarkGin_StaticAll 50000 34506 ns/op 0 B/op 0 allocs/op\n\nBenchmarkAce_StaticAll 30000 49657 ns/op 0 B/op 0 allocs/op\nBenchmarkHttpServeMux_StaticAll 2000 1183737 ns/op 96 B/op 8 allocs/op\nBenchmarkBeego_StaticAll 5000 412621 ns/op 57776 B/op 628 allocs/op\nBenchmarkBear_StaticAll 10000 149242 ns/op 20336 B/op 461 allocs/op\nBenchmarkBone_StaticAll 10000 118583 ns/op 0 B/op 0 allocs/op\nBenchmarkDenco_StaticAll 100000 13247 ns/op 0 B/op 0 allocs/op\nBenchmarkEcho_StaticAll 20000 79914 ns/op 5024 B/op 157 allocs/op\nBenchmarkGocraftWeb_StaticAll 10000 211823 ns/op 46440 B/op 785 allocs/op\nBenchmarkGoji_StaticAll 10000 109390 ns/op 0 B/op 0 allocs/op\nBenchmarkGojiv2_StaticAll 3000 415533 ns/op 145696 B/op 1099 allocs/op\nBenchmarkGoJsonRest_StaticAll 5000 364403 ns/op 51653 B/op 1727 allocs/op\nBenchmarkGoRestful_StaticAll 500 2578579 ns/op 314936 B/op 3144 allocs/op\nBenchmarkGorillaMux_StaticAll 500 2704856 ns/op 115648 B/op 1578 allocs/op\nBenchmarkHttpRouter_StaticAll 100000 18541 ns/op 0 B/op 0 allocs/op\nBenchmarkHttpTreeMux_StaticAll 100000 22332 ns/op 0 B/op 0 allocs/op\nBenchmarkKocha_StaticAll 50000 31176 ns/op 0 B/op 0 allocs/op\nBenchmarkLARS_StaticAll 50000 40840 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_StaticAll 5000 517656 ns/op 120576 B/op 1413 allocs/op\nBenchmarkMartini_StaticAll 300 4462289 ns/op 125442 B/op 1717 allocs/op\nBenchmarkPat_StaticAll 500 2157275 ns/op 533904 B/op 11123 allocs/op\nBenchmarkPossum_StaticAll 10000 254701 ns/op 65312 B/op 471 allocs/op\nBenchmarkR2router_StaticAll 10000 133956 ns/op 22608 B/op 628 allocs/op\nBenchmarkRivet_StaticAll 30000 46812 ns/op 0 B/op 0 allocs/op\nBenchmarkTango_StaticAll 5000 390613 ns/op 39225 B/op 1256 allocs/op\nBenchmarkTigerTonic_StaticAll 20000 88060 ns/op 7504 B/op 157 allocs/op\nBenchmarkTraffic_StaticAll 500 2910236 ns/op 729736 B/op 14287 allocs/op\nBenchmarkVulcan_StaticAll 5000 277366 ns/op 15386 B/op 471 allocs/op\n```\n\n## Micro Benchmarks\n\n```\nBenchmarkGin_Param 20000000 113 ns/op 0 B/op 0 allocs/op\n\nBenchmarkAce_Param 5000000 375 ns/op 32 B/op 1 allocs/op\nBenchmarkBear_Param 1000000 1709 ns/op 456 B/op 5 allocs/op\nBenchmarkBeego_Param 1000000 2484 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_Param 1000000 2391 ns/op 688 B/op 5 allocs/op\nBenchmarkDenco_Param 10000000 240 ns/op 32 B/op 1 allocs/op\nBenchmarkEcho_Param 5000000 366 ns/op 32 B/op 1 allocs/op\nBenchmarkGocraftWeb_Param 1000000 2343 ns/op 648 B/op 8 allocs/op\nBenchmarkGoji_Param 1000000 1197 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_Param 1000000 2771 ns/op 944 B/op 8 allocs/op\nBenchmarkGoJsonRest_Param 1000000 2993 ns/op 649 B/op 13 allocs/op\nBenchmarkGoRestful_Param 200000 8860 ns/op 2296 B/op 21 allocs/op\nBenchmarkGorillaMux_Param 500000 4461 ns/op 1056 B/op 11 allocs/op\nBenchmarkHttpRouter_Param 10000000 175 ns/op 32 B/op 1 allocs/op\nBenchmarkHttpTreeMux_Param 1000000 1167 ns/op 352 B/op 3 allocs/op\nBenchmarkKocha_Param 3000000 429 ns/op 56 B/op 3 allocs/op\nBenchmarkLARS_Param 10000000 134 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_Param 500000 4635 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_Param 200000 9933 ns/op 1072 B/op 10 allocs/op\nBenchmarkPat_Param 1000000 2929 ns/op 648 B/op 12 allocs/op\nBenchmarkPossum_Param 1000000 2503 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_Param 1000000 1507 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_Param 5000000 297 ns/op 48 B/op 1 allocs/op\nBenchmarkTango_Param 1000000 1862 ns/op 248 B/op 8 allocs/op\nBenchmarkTigerTonic_Param 500000 5660 ns/op 992 B/op 17 allocs/op\nBenchmarkTraffic_Param 200000 8408 ns/op 1960 B/op 21 allocs/op\nBenchmarkVulcan_Param 2000000 963 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_Param5 2000000 740 ns/op 160 B/op 1 allocs/op\nBenchmarkBear_Param5 1000000 2777 ns/op 501 B/op 5 allocs/op\nBenchmarkBeego_Param5 1000000 3740 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_Param5 1000000 2950 ns/op 736 B/op 5 allocs/op\nBenchmarkDenco_Param5 2000000 644 ns/op 160 B/op 1 allocs/op\nBenchmarkEcho_Param5 3000000 558 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_Param5 10000000 198 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_Param5 500000 3870 ns/op 920 B/op 11 allocs/op\nBenchmarkGoji_Param5 1000000 1746 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_Param5 1000000 3214 ns/op 1008 B/op 8 allocs/op\nBenchmarkGoJsonRest_Param5 500000 5509 ns/op 1097 B/op 16 allocs/op\nBenchmarkGoRestful_Param5 200000 11232 ns/op 2392 B/op 21 allocs/op\nBenchmarkGorillaMux_Param5 300000 7777 ns/op 1184 B/op 11 allocs/op\nBenchmarkHttpRouter_Param5 3000000 631 ns/op 160 B/op 1 allocs/op\nBenchmarkHttpTreeMux_Param5 1000000 2800 ns/op 576 B/op 6 allocs/op\nBenchmarkKocha_Param5 1000000 2053 ns/op 440 B/op 10 allocs/op\nBenchmarkLARS_Param5 10000000 232 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_Param5 500000 5888 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_Param5 200000 12807 ns/op 1232 B/op 11 allocs/op\nBenchmarkPat_Param5 300000 7320 ns/op 964 B/op 32 allocs/op\nBenchmarkPossum_Param5 1000000 2495 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_Param5 1000000 1844 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_Param5 2000000 935 ns/op 240 B/op 1 allocs/op\nBenchmarkTango_Param5 1000000 2327 ns/op 360 B/op 8 allocs/op\nBenchmarkTigerTonic_Param5 100000 18514 ns/op 2551 B/op 43 allocs/op\nBenchmarkTraffic_Param5 200000 11997 ns/op 2248 B/op 25 allocs/op\nBenchmarkVulcan_Param5 1000000 1333 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_Param20 1000000 2031 ns/op 640 B/op 1 allocs/op\nBenchmarkBear_Param20 200000 7285 ns/op 1664 B/op 5 allocs/op\nBenchmarkBeego_Param20 300000 6224 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_Param20 200000 8023 ns/op 1903 B/op 5 allocs/op\nBenchmarkDenco_Param20 1000000 2262 ns/op 640 B/op 1 allocs/op\nBenchmarkEcho_Param20 1000000 1387 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_Param20 3000000 503 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_Param20 100000 14408 ns/op 3795 B/op 15 allocs/op\nBenchmarkGoji_Param20 500000 5272 ns/op 1247 B/op 2 allocs/op\nBenchmarkGojiv2_Param20 1000000 4163 ns/op 1248 B/op 8 allocs/op\nBenchmarkGoJsonRest_Param20 100000 17866 ns/op 4485 B/op 20 allocs/op\nBenchmarkGoRestful_Param20 100000 21022 ns/op 4724 B/op 23 allocs/op\nBenchmarkGorillaMux_Param20 100000 17055 ns/op 3547 B/op 13 allocs/op\nBenchmarkHttpRouter_Param20 1000000 1748 ns/op 640 B/op 1 allocs/op\nBenchmarkHttpTreeMux_Param20 200000 12246 ns/op 3196 B/op 10 allocs/op\nBenchmarkKocha_Param20 300000 6861 ns/op 1808 B/op 27 allocs/op\nBenchmarkLARS_Param20 3000000 526 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_Param20 100000 13069 ns/op 2906 B/op 12 allocs/op\nBenchmarkMartini_Param20 100000 23602 ns/op 3597 B/op 13 allocs/op\nBenchmarkPat_Param20 50000 32143 ns/op 4688 B/op 111 allocs/op\nBenchmarkPossum_Param20 1000000 2396 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_Param20 200000 8907 ns/op 2283 B/op 7 allocs/op\nBenchmarkRivet_Param20 1000000 3280 ns/op 1024 B/op 1 allocs/op\nBenchmarkTango_Param20 500000 4640 ns/op 856 B/op 8 allocs/op\nBenchmarkTigerTonic_Param20 20000 67581 ns/op 10532 B/op 138 allocs/op\nBenchmarkTraffic_Param20 50000 40313 ns/op 7941 B/op 45 allocs/op\nBenchmarkVulcan_Param20 1000000 2264 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_ParamWrite 3000000 532 ns/op 40 B/op 2 allocs/op\nBenchmarkBear_ParamWrite 1000000 1778 ns/op 456 B/op 5 allocs/op\nBenchmarkBeego_ParamWrite 1000000 2596 ns/op 376 B/op 5 allocs/op\nBenchmarkBone_ParamWrite 1000000 2519 ns/op 688 B/op 5 allocs/op\nBenchmarkDenco_ParamWrite 5000000 411 ns/op 32 B/op 1 allocs/op\nBenchmarkEcho_ParamWrite 2000000 718 ns/op 40 B/op 2 allocs/op\nBenchmarkGin_ParamWrite 5000000 283 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_ParamWrite 1000000 2561 ns/op 656 B/op 9 allocs/op\nBenchmarkGoji_ParamWrite 1000000 1378 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_ParamWrite 1000000 3128 ns/op 976 B/op 10 allocs/op\nBenchmarkGoJsonRest_ParamWrite 500000 4446 ns/op 1128 B/op 18 allocs/op\nBenchmarkGoRestful_ParamWrite 200000 10291 ns/op 2304 B/op 22 allocs/op\nBenchmarkGorillaMux_ParamWrite 500000 5153 ns/op 1064 B/op 12 allocs/op\nBenchmarkHttpRouter_ParamWrite 5000000 263 ns/op 32 B/op 1 allocs/op\nBenchmarkHttpTreeMux_ParamWrite 1000000 1351 ns/op 352 B/op 3 allocs/op\nBenchmarkKocha_ParamWrite 3000000 538 ns/op 56 B/op 3 allocs/op\nBenchmarkLARS_ParamWrite 5000000 316 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_ParamWrite 500000 5756 ns/op 1160 B/op 14 allocs/op\nBenchmarkMartini_ParamWrite 200000 13097 ns/op 1176 B/op 14 allocs/op\nBenchmarkPat_ParamWrite 500000 4954 ns/op 1072 B/op 17 allocs/op\nBenchmarkPossum_ParamWrite 1000000 2499 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_ParamWrite 1000000 1531 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_ParamWrite 3000000 570 ns/op 112 B/op 2 allocs/op\nBenchmarkTango_ParamWrite 2000000 957 ns/op 136 B/op 4 allocs/op\nBenchmarkTigerTonic_ParamWrite 200000 7025 ns/op 1424 B/op 23 allocs/op\nBenchmarkTraffic_ParamWrite 200000 10112 ns/op 2384 B/op 25 allocs/op\nBenchmarkVulcan_ParamWrite 1000000 1006 ns/op 98 B/op 3 allocs/op\n```\n\n## GitHub\n\n```\nBenchmarkGin_GithubStatic 10000000 156 ns/op 0 B/op 0 allocs/op\n\nBenchmarkAce_GithubStatic 5000000 294 ns/op 0 B/op 0 allocs/op\nBenchmarkBear_GithubStatic 2000000 893 ns/op 120 B/op 3 allocs/op\nBenchmarkBeego_GithubStatic 1000000 2491 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_GithubStatic 50000 25300 ns/op 2880 B/op 60 allocs/op\nBenchmarkDenco_GithubStatic 20000000 76.0 ns/op 0 B/op 0 allocs/op\nBenchmarkEcho_GithubStatic 2000000 516 ns/op 32 B/op 1 allocs/op\nBenchmarkGocraftWeb_GithubStatic 1000000 1448 ns/op 296 B/op 5 allocs/op\nBenchmarkGoji_GithubStatic 3000000 496 ns/op 0 B/op 0 allocs/op\nBenchmarkGojiv2_GithubStatic 1000000 2941 ns/op 928 B/op 7 allocs/op\nBenchmarkGoRestful_GithubStatic 100000 27256 ns/op 3224 B/op 22 allocs/op\nBenchmarkGoJsonRest_GithubStatic 1000000 2196 ns/op 329 B/op 11 allocs/op\nBenchmarkGorillaMux_GithubStatic 50000 31617 ns/op 736 B/op 10 allocs/op\nBenchmarkHttpRouter_GithubStatic 20000000 88.4 ns/op 0 B/op 0 allocs/op\nBenchmarkHttpTreeMux_GithubStatic 10000000 134 ns/op 0 B/op 0 allocs/op\nBenchmarkKocha_GithubStatic 20000000 113 ns/op 0 B/op 0 allocs/op\nBenchmarkLARS_GithubStatic 10000000 195 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GithubStatic 500000 3740 ns/op 768 B/op 9 allocs/op\nBenchmarkMartini_GithubStatic 50000 27673 ns/op 768 B/op 9 allocs/op\nBenchmarkPat_GithubStatic 100000 19470 ns/op 3648 B/op 76 allocs/op\nBenchmarkPossum_GithubStatic 1000000 1729 ns/op 416 B/op 3 allocs/op\nBenchmarkR2router_GithubStatic 2000000 879 ns/op 144 B/op 4 allocs/op\nBenchmarkRivet_GithubStatic 10000000 231 ns/op 0 B/op 0 allocs/op\nBenchmarkTango_GithubStatic 1000000 2325 ns/op 248 B/op 8 allocs/op\nBenchmarkTigerTonic_GithubStatic 3000000 610 ns/op 48 B/op 1 allocs/op\nBenchmarkTraffic_GithubStatic 20000 62973 ns/op 18904 B/op 148 allocs/op\nBenchmarkVulcan_GithubStatic 1000000 1447 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_GithubParam 2000000 686 ns/op 96 B/op 1 allocs/op\nBenchmarkBear_GithubParam 1000000 2155 ns/op 496 B/op 5 allocs/op\nBenchmarkBeego_GithubParam 1000000 2713 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_GithubParam 100000 15088 ns/op 1760 B/op 18 allocs/op\nBenchmarkDenco_GithubParam 2000000 629 ns/op 128 B/op 1 allocs/op\nBenchmarkEcho_GithubParam 2000000 653 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_GithubParam 5000000 255 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_GithubParam 1000000 3145 ns/op 712 B/op 9 allocs/op\nBenchmarkGoji_GithubParam 1000000 1916 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_GithubParam 1000000 3975 ns/op 1024 B/op 10 allocs/op\nBenchmarkGoJsonRest_GithubParam 300000 4134 ns/op 713 B/op 14 allocs/op\nBenchmarkGoRestful_GithubParam 50000 30782 ns/op 2360 B/op 21 allocs/op\nBenchmarkGorillaMux_GithubParam 100000 17148 ns/op 1088 B/op 11 allocs/op\nBenchmarkHttpRouter_GithubParam 3000000 523 ns/op 96 B/op 1 allocs/op\nBenchmarkHttpTreeMux_GithubParam 1000000 1671 ns/op 384 B/op 4 allocs/op\nBenchmarkKocha_GithubParam 1000000 1021 ns/op 128 B/op 5 allocs/op\nBenchmarkLARS_GithubParam 5000000 283 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GithubParam 500000 4270 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_GithubParam 100000 21728 ns/op 1152 B/op 11 allocs/op\nBenchmarkPat_GithubParam 200000 11208 ns/op 2464 B/op 48 allocs/op\nBenchmarkPossum_GithubParam 1000000 2334 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_GithubParam 1000000 1487 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_GithubParam 2000000 782 ns/op 96 B/op 1 allocs/op\nBenchmarkTango_GithubParam 1000000 2653 ns/op 344 B/op 8 allocs/op\nBenchmarkTigerTonic_GithubParam 300000 14073 ns/op 1440 B/op 24 allocs/op\nBenchmarkTraffic_GithubParam 50000 29164 ns/op 5992 B/op 52 allocs/op\nBenchmarkVulcan_GithubParam 1000000 2529 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_GithubAll 10000 134059 ns/op 13792 B/op 167 allocs/op\nBenchmarkBear_GithubAll 5000 534445 ns/op 86448 B/op 943 allocs/op\nBenchmarkBeego_GithubAll 3000 592444 ns/op 74705 B/op 812 allocs/op\nBenchmarkBone_GithubAll 200 6957308 ns/op 698784 B/op 8453 allocs/op\nBenchmarkDenco_GithubAll 10000 158819 ns/op 20224 B/op 167 allocs/op\nBenchmarkEcho_GithubAll 10000 154700 ns/op 6496 B/op 203 allocs/op\nBenchmarkGin_GithubAll 30000 48375 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_GithubAll 3000 570806 ns/op 131656 B/op 1686 allocs/op\nBenchmarkGoji_GithubAll 2000 818034 ns/op 56112 B/op 334 allocs/op\nBenchmarkGojiv2_GithubAll 2000 1213973 ns/op 274768 B/op 3712 allocs/op\nBenchmarkGoJsonRest_GithubAll 2000 785796 ns/op 134371 B/op 2737 allocs/op\nBenchmarkGoRestful_GithubAll 300 5238188 ns/op 689672 B/op 4519 allocs/op\nBenchmarkGorillaMux_GithubAll 100 10257726 ns/op 211840 B/op 2272 allocs/op\nBenchmarkHttpRouter_GithubAll 20000 105414 ns/op 13792 B/op 167 allocs/op\nBenchmarkHttpTreeMux_GithubAll 10000 319934 ns/op 65856 B/op 671 allocs/op\nBenchmarkKocha_GithubAll 10000 209442 ns/op 23304 B/op 843 allocs/op\nBenchmarkLARS_GithubAll 20000 62565 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GithubAll 2000 1161270 ns/op 204194 B/op 2000 allocs/op\nBenchmarkMartini_GithubAll 200 9991713 ns/op 226549 B/op 2325 allocs/op\nBenchmarkPat_GithubAll 200 5590793 ns/op 1499568 B/op 27435 allocs/op\nBenchmarkPossum_GithubAll 10000 319768 ns/op 84448 B/op 609 allocs/op\nBenchmarkR2router_GithubAll 10000 305134 ns/op 77328 B/op 979 allocs/op\nBenchmarkRivet_GithubAll 10000 132134 ns/op 16272 B/op 167 allocs/op\nBenchmarkTango_GithubAll 3000 552754 ns/op 63826 B/op 1618 allocs/op\nBenchmarkTigerTonic_GithubAll 1000 1439483 ns/op 239104 B/op 5374 allocs/op\nBenchmarkTraffic_GithubAll 100 11383067 ns/op 2659329 B/op 21848 allocs/op\nBenchmarkVulcan_GithubAll 5000 394253 ns/op 19894 B/op 609 allocs/op\n```\n\n## Google+\n\n```\nBenchmarkGin_GPlusStatic 10000000 183 ns/op 0 B/op 0 allocs/op\n\nBenchmarkAce_GPlusStatic 5000000 276 ns/op 0 B/op 0 allocs/op\nBenchmarkBear_GPlusStatic 2000000 652 ns/op 104 B/op 3 allocs/op\nBenchmarkBeego_GPlusStatic 1000000 2239 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_GPlusStatic 5000000 380 ns/op 32 B/op 1 allocs/op\nBenchmarkDenco_GPlusStatic 30000000 45.8 ns/op 0 B/op 0 allocs/op\nBenchmarkEcho_GPlusStatic 5000000 338 ns/op 32 B/op 1 allocs/op\nBenchmarkGocraftWeb_GPlusStatic 1000000 1158 ns/op 280 B/op 5 allocs/op\nBenchmarkGoji_GPlusStatic 5000000 331 ns/op 0 B/op 0 allocs/op\nBenchmarkGojiv2_GPlusStatic 1000000 2106 ns/op 928 B/op 7 allocs/op\nBenchmarkGoJsonRest_GPlusStatic 1000000 1626 ns/op 329 B/op 11 allocs/op\nBenchmarkGoRestful_GPlusStatic 300000 7598 ns/op 1976 B/op 20 allocs/op\nBenchmarkGorillaMux_GPlusStatic 1000000 2629 ns/op 736 B/op 10 allocs/op\nBenchmarkHttpRouter_GPlusStatic 30000000 52.5 ns/op 0 B/op 0 allocs/op\nBenchmarkHttpTreeMux_GPlusStatic 20000000 85.8 ns/op 0 B/op 0 allocs/op\nBenchmarkKocha_GPlusStatic 20000000 89.2 ns/op 0 B/op 0 allocs/op\nBenchmarkLARS_GPlusStatic 10000000 162 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GPlusStatic 500000 3479 ns/op 768 B/op 9 allocs/op\nBenchmarkMartini_GPlusStatic 200000 9092 ns/op 768 B/op 9 allocs/op\nBenchmarkPat_GPlusStatic 3000000 493 ns/op 96 B/op 2 allocs/op\nBenchmarkPossum_GPlusStatic 1000000 1467 ns/op 416 B/op 3 allocs/op\nBenchmarkR2router_GPlusStatic 2000000 788 ns/op 144 B/op 4 allocs/op\nBenchmarkRivet_GPlusStatic 20000000 114 ns/op 0 B/op 0 allocs/op\nBenchmarkTango_GPlusStatic 1000000 1534 ns/op 200 B/op 8 allocs/op\nBenchmarkTigerTonic_GPlusStatic 5000000 282 ns/op 32 B/op 1 allocs/op\nBenchmarkTraffic_GPlusStatic 500000 3798 ns/op 1192 B/op 15 allocs/op\nBenchmarkVulcan_GPlusStatic 2000000 1125 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_GPlusParam 3000000 528 ns/op 64 B/op 1 allocs/op\nBenchmarkBear_GPlusParam 1000000 1570 ns/op 480 B/op 5 allocs/op\nBenchmarkBeego_GPlusParam 1000000 2369 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_GPlusParam 1000000 2028 ns/op 688 B/op 5 allocs/op\nBenchmarkDenco_GPlusParam 5000000 385 ns/op 64 B/op 1 allocs/op\nBenchmarkEcho_GPlusParam 3000000 441 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_GPlusParam 10000000 174 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_GPlusParam 1000000 2033 ns/op 648 B/op 8 allocs/op\nBenchmarkGoji_GPlusParam 1000000 1399 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_GPlusParam 1000000 2641 ns/op 944 B/op 8 allocs/op\nBenchmarkGoJsonRest_GPlusParam 1000000 2824 ns/op 649 B/op 13 allocs/op\nBenchmarkGoRestful_GPlusParam 200000 8875 ns/op 2296 B/op 21 allocs/op\nBenchmarkGorillaMux_GPlusParam 200000 6291 ns/op 1056 B/op 11 allocs/op\nBenchmarkHttpRouter_GPlusParam 5000000 316 ns/op 64 B/op 1 allocs/op\nBenchmarkHttpTreeMux_GPlusParam 1000000 1129 ns/op 352 B/op 3 allocs/op\nBenchmarkKocha_GPlusParam 3000000 538 ns/op 56 B/op 3 allocs/op\nBenchmarkLARS_GPlusParam 10000000 198 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GPlusParam 500000 3554 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_GPlusParam 200000 9831 ns/op 1072 B/op 10 allocs/op\nBenchmarkPat_GPlusParam 1000000 2706 ns/op 688 B/op 12 allocs/op\nBenchmarkPossum_GPlusParam 1000000 2297 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_GPlusParam 1000000 1318 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_GPlusParam 5000000 399 ns/op 48 B/op 1 allocs/op\nBenchmarkTango_GPlusParam 1000000 2070 ns/op 264 B/op 8 allocs/op\nBenchmarkTigerTonic_GPlusParam 500000 4853 ns/op 1056 B/op 17 allocs/op\nBenchmarkTraffic_GPlusParam 200000 8278 ns/op 1976 B/op 21 allocs/op\nBenchmarkVulcan_GPlusParam 1000000 1243 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_GPlus2Params 3000000 549 ns/op 64 B/op 1 allocs/op\nBenchmarkBear_GPlus2Params 1000000 2112 ns/op 496 B/op 5 allocs/op\nBenchmarkBeego_GPlus2Params 500000 2750 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_GPlus2Params 300000 7032 ns/op 1040 B/op 9 allocs/op\nBenchmarkDenco_GPlus2Params 3000000 502 ns/op 64 B/op 1 allocs/op\nBenchmarkEcho_GPlus2Params 3000000 641 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_GPlus2Params 5000000 250 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_GPlus2Params 1000000 2681 ns/op 712 B/op 9 allocs/op\nBenchmarkGoji_GPlus2Params 1000000 1926 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_GPlus2Params 500000 3996 ns/op 1024 B/op 11 allocs/op\nBenchmarkGoJsonRest_GPlus2Params 500000 3886 ns/op 713 B/op 14 allocs/op\nBenchmarkGoRestful_GPlus2Params 200000 10376 ns/op 2360 B/op 21 allocs/op\nBenchmarkGorillaMux_GPlus2Params 100000 14162 ns/op 1088 B/op 11 allocs/op\nBenchmarkHttpRouter_GPlus2Params 5000000 336 ns/op 64 B/op 1 allocs/op\nBenchmarkHttpTreeMux_GPlus2Params 1000000 1523 ns/op 384 B/op 4 allocs/op\nBenchmarkKocha_GPlus2Params 2000000 970 ns/op 128 B/op 5 allocs/op\nBenchmarkLARS_GPlus2Params 5000000 238 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GPlus2Params 500000 4016 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_GPlus2Params 100000 21253 ns/op 1200 B/op 13 allocs/op\nBenchmarkPat_GPlus2Params 200000 8632 ns/op 2256 B/op 34 allocs/op\nBenchmarkPossum_GPlus2Params 1000000 2171 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_GPlus2Params 1000000 1340 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_GPlus2Params 3000000 557 ns/op 96 B/op 1 allocs/op\nBenchmarkTango_GPlus2Params 1000000 2186 ns/op 344 B/op 8 allocs/op\nBenchmarkTigerTonic_GPlus2Params 200000 9060 ns/op 1488 B/op 24 allocs/op\nBenchmarkTraffic_GPlus2Params 100000 20324 ns/op 3272 B/op 31 allocs/op\nBenchmarkVulcan_GPlus2Params 1000000 2039 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_GPlusAll 300000 6603 ns/op 640 B/op 11 allocs/op\nBenchmarkBear_GPlusAll 100000 22363 ns/op 5488 B/op 61 allocs/op\nBenchmarkBeego_GPlusAll 50000 38757 ns/op 4784 B/op 52 allocs/op\nBenchmarkBone_GPlusAll 20000 54916 ns/op 10336 B/op 98 allocs/op\nBenchmarkDenco_GPlusAll 300000 4959 ns/op 672 B/op 11 allocs/op\nBenchmarkEcho_GPlusAll 200000 6558 ns/op 416 B/op 13 allocs/op\nBenchmarkGin_GPlusAll 500000 2757 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_GPlusAll 50000 34615 ns/op 8040 B/op 103 allocs/op\nBenchmarkGoji_GPlusAll 100000 16002 ns/op 3696 B/op 22 allocs/op\nBenchmarkGojiv2_GPlusAll 50000 35060 ns/op 12624 B/op 115 allocs/op\nBenchmarkGoJsonRest_GPlusAll 50000 41479 ns/op 8117 B/op 170 allocs/op\nBenchmarkGoRestful_GPlusAll 10000 131653 ns/op 32024 B/op 275 allocs/op\nBenchmarkGorillaMux_GPlusAll 10000 101380 ns/op 13296 B/op 142 allocs/op\nBenchmarkHttpRouter_GPlusAll 500000 3711 ns/op 640 B/op 11 allocs/op\nBenchmarkHttpTreeMux_GPlusAll 100000 14438 ns/op 4032 B/op 38 allocs/op\nBenchmarkKocha_GPlusAll 200000 8039 ns/op 976 B/op 43 allocs/op\nBenchmarkLARS_GPlusAll 500000 2630 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_GPlusAll 30000 51123 ns/op 13152 B/op 128 allocs/op\nBenchmarkMartini_GPlusAll 10000 176157 ns/op 14016 B/op 145 allocs/op\nBenchmarkPat_GPlusAll 20000 69911 ns/op 16576 B/op 298 allocs/op\nBenchmarkPossum_GPlusAll 100000 20716 ns/op 5408 B/op 39 allocs/op\nBenchmarkR2router_GPlusAll 100000 17463 ns/op 5040 B/op 63 allocs/op\nBenchmarkRivet_GPlusAll 300000 5142 ns/op 768 B/op 11 allocs/op\nBenchmarkTango_GPlusAll 50000 27321 ns/op 3656 B/op 104 allocs/op\nBenchmarkTigerTonic_GPlusAll 20000 77597 ns/op 14512 B/op 288 allocs/op\nBenchmarkTraffic_GPlusAll 10000 151406 ns/op 37360 B/op 392 allocs/op\nBenchmarkVulcan_GPlusAll 100000 18555 ns/op 1274 B/op 39 allocs/op\n```\n\n## Parse.com\n\n```\nBenchmarkGin_ParseStatic 10000000 133 ns/op 0 B/op 0 allocs/op\n\nBenchmarkAce_ParseStatic 5000000 241 ns/op 0 B/op 0 allocs/op\nBenchmarkBear_ParseStatic 2000000 728 ns/op 120 B/op 3 allocs/op\nBenchmarkBeego_ParseStatic 1000000 2623 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_ParseStatic 1000000 1285 ns/op 144 B/op 3 allocs/op\nBenchmarkDenco_ParseStatic 30000000 57.8 ns/op 0 B/op 0 allocs/op\nBenchmarkEcho_ParseStatic 5000000 342 ns/op 32 B/op 1 allocs/op\nBenchmarkGocraftWeb_ParseStatic 1000000 1478 ns/op 296 B/op 5 allocs/op\nBenchmarkGoji_ParseStatic 3000000 415 ns/op 0 B/op 0 allocs/op\nBenchmarkGojiv2_ParseStatic 1000000 2087 ns/op 928 B/op 7 allocs/op\nBenchmarkGoJsonRest_ParseStatic 1000000 1712 ns/op 329 B/op 11 allocs/op\nBenchmarkGoRestful_ParseStatic 200000 11072 ns/op 3224 B/op 22 allocs/op\nBenchmarkGorillaMux_ParseStatic 500000 4129 ns/op 752 B/op 11 allocs/op\nBenchmarkHttpRouter_ParseStatic 30000000 52.4 ns/op 0 B/op 0 allocs/op\nBenchmarkHttpTreeMux_ParseStatic 20000000 109 ns/op 0 B/op 0 allocs/op\nBenchmarkKocha_ParseStatic 20000000 81.8 ns/op 0 B/op 0 allocs/op\nBenchmarkLARS_ParseStatic 10000000 150 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_ParseStatic 1000000 3288 ns/op 768 B/op 9 allocs/op\nBenchmarkMartini_ParseStatic 200000 9110 ns/op 768 B/op 9 allocs/op\nBenchmarkPat_ParseStatic 1000000 1135 ns/op 240 B/op 5 allocs/op\nBenchmarkPossum_ParseStatic 1000000 1557 ns/op 416 B/op 3 allocs/op\nBenchmarkR2router_ParseStatic 2000000 730 ns/op 144 B/op 4 allocs/op\nBenchmarkRivet_ParseStatic 10000000 121 ns/op 0 B/op 0 allocs/op\nBenchmarkTango_ParseStatic 1000000 1688 ns/op 248 B/op 8 allocs/op\nBenchmarkTigerTonic_ParseStatic 3000000 427 ns/op 48 B/op 1 allocs/op\nBenchmarkTraffic_ParseStatic 500000 5962 ns/op 1816 B/op 20 allocs/op\nBenchmarkVulcan_ParseStatic 2000000 969 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_ParseParam 3000000 497 ns/op 64 B/op 1 allocs/op\nBenchmarkBear_ParseParam 1000000 1473 ns/op 467 B/op 5 allocs/op\nBenchmarkBeego_ParseParam 1000000 2384 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_ParseParam 1000000 2513 ns/op 768 B/op 6 allocs/op\nBenchmarkDenco_ParseParam 5000000 364 ns/op 64 B/op 1 allocs/op\nBenchmarkEcho_ParseParam 5000000 418 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_ParseParam 10000000 163 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_ParseParam 1000000 2361 ns/op 664 B/op 8 allocs/op\nBenchmarkGoji_ParseParam 1000000 1590 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_ParseParam 1000000 2851 ns/op 976 B/op 9 allocs/op\nBenchmarkGoJsonRest_ParseParam 1000000 2965 ns/op 649 B/op 13 allocs/op\nBenchmarkGoRestful_ParseParam 200000 12207 ns/op 3544 B/op 23 allocs/op\nBenchmarkGorillaMux_ParseParam 500000 5187 ns/op 1088 B/op 12 allocs/op\nBenchmarkHttpRouter_ParseParam 5000000 275 ns/op 64 B/op 1 allocs/op\nBenchmarkHttpTreeMux_ParseParam 1000000 1108 ns/op 352 B/op 3 allocs/op\nBenchmarkKocha_ParseParam 3000000 495 ns/op 56 B/op 3 allocs/op\nBenchmarkLARS_ParseParam 10000000 192 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_ParseParam 500000 4103 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_ParseParam 200000 9878 ns/op 1072 B/op 10 allocs/op\nBenchmarkPat_ParseParam 500000 3657 ns/op 1120 B/op 17 allocs/op\nBenchmarkPossum_ParseParam 1000000 2084 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_ParseParam 1000000 1251 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_ParseParam 5000000 335 ns/op 48 B/op 1 allocs/op\nBenchmarkTango_ParseParam 1000000 1854 ns/op 280 B/op 8 allocs/op\nBenchmarkTigerTonic_ParseParam 500000 4582 ns/op 1008 B/op 17 allocs/op\nBenchmarkTraffic_ParseParam 200000 8125 ns/op 2248 B/op 23 allocs/op\nBenchmarkVulcan_ParseParam 1000000 1148 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_Parse2Params 3000000 539 ns/op 64 B/op 1 allocs/op\nBenchmarkBear_Parse2Params 1000000 1778 ns/op 496 B/op 5 allocs/op\nBenchmarkBeego_Parse2Params 1000000 2519 ns/op 368 B/op 4 allocs/op\nBenchmarkBone_Parse2Params 1000000 2596 ns/op 720 B/op 5 allocs/op\nBenchmarkDenco_Parse2Params 3000000 492 ns/op 64 B/op 1 allocs/op\nBenchmarkEcho_Parse2Params 3000000 484 ns/op 32 B/op 1 allocs/op\nBenchmarkGin_Parse2Params 10000000 193 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_Parse2Params 1000000 2575 ns/op 712 B/op 9 allocs/op\nBenchmarkGoji_Parse2Params 1000000 1373 ns/op 336 B/op 2 allocs/op\nBenchmarkGojiv2_Parse2Params 500000 2416 ns/op 960 B/op 8 allocs/op\nBenchmarkGoJsonRest_Parse2Params 300000 3452 ns/op 713 B/op 14 allocs/op\nBenchmarkGoRestful_Parse2Params 100000 17719 ns/op 6008 B/op 25 allocs/op\nBenchmarkGorillaMux_Parse2Params 300000 5102 ns/op 1088 B/op 11 allocs/op\nBenchmarkHttpRouter_Parse2Params 5000000 303 ns/op 64 B/op 1 allocs/op\nBenchmarkHttpTreeMux_Parse2Params 1000000 1372 ns/op 384 B/op 4 allocs/op\nBenchmarkKocha_Parse2Params 2000000 874 ns/op 128 B/op 5 allocs/op\nBenchmarkLARS_Parse2Params 10000000 192 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_Parse2Params 500000 3871 ns/op 1056 B/op 10 allocs/op\nBenchmarkMartini_Parse2Params 200000 9954 ns/op 1152 B/op 11 allocs/op\nBenchmarkPat_Parse2Params 500000 4194 ns/op 832 B/op 17 allocs/op\nBenchmarkPossum_Parse2Params 1000000 2121 ns/op 560 B/op 6 allocs/op\nBenchmarkR2router_Parse2Params 1000000 1415 ns/op 432 B/op 5 allocs/op\nBenchmarkRivet_Parse2Params 3000000 457 ns/op 96 B/op 1 allocs/op\nBenchmarkTango_Parse2Params 1000000 1914 ns/op 312 B/op 8 allocs/op\nBenchmarkTigerTonic_Parse2Params 300000 6895 ns/op 1408 B/op 24 allocs/op\nBenchmarkTraffic_Parse2Params 200000 8317 ns/op 2040 B/op 22 allocs/op\nBenchmarkVulcan_Parse2Params 1000000 1274 ns/op 98 B/op 3 allocs/op\nBenchmarkAce_ParseAll 200000 10401 ns/op 640 B/op 16 allocs/op\nBenchmarkBear_ParseAll 50000 37743 ns/op 8928 B/op 110 allocs/op\nBenchmarkBeego_ParseAll 20000 63193 ns/op 9568 B/op 104 allocs/op\nBenchmarkBone_ParseAll 20000 61767 ns/op 14160 B/op 131 allocs/op\nBenchmarkDenco_ParseAll 300000 7036 ns/op 928 B/op 16 allocs/op\nBenchmarkEcho_ParseAll 200000 11824 ns/op 832 B/op 26 allocs/op\nBenchmarkGin_ParseAll 300000 4199 ns/op 0 B/op 0 allocs/op\nBenchmarkGocraftWeb_ParseAll 30000 51758 ns/op 13728 B/op 181 allocs/op\nBenchmarkGoji_ParseAll 50000 29614 ns/op 5376 B/op 32 allocs/op\nBenchmarkGojiv2_ParseAll 20000 68676 ns/op 24464 B/op 199 allocs/op\nBenchmarkGoJsonRest_ParseAll 20000 76135 ns/op 13866 B/op 321 allocs/op\nBenchmarkGoRestful_ParseAll 5000 389487 ns/op 110928 B/op 600 allocs/op\nBenchmarkGorillaMux_ParseAll 10000 221250 ns/op 24864 B/op 292 allocs/op\nBenchmarkHttpRouter_ParseAll 200000 6444 ns/op 640 B/op 16 allocs/op\nBenchmarkHttpTreeMux_ParseAll 50000 30702 ns/op 5728 B/op 51 allocs/op\nBenchmarkKocha_ParseAll 200000 13712 ns/op 1112 B/op 54 allocs/op\nBenchmarkLARS_ParseAll 300000 6925 ns/op 0 B/op 0 allocs/op\nBenchmarkMacaron_ParseAll 20000 96278 ns/op 24576 B/op 250 allocs/op\nBenchmarkMartini_ParseAll 5000 271352 ns/op 25072 B/op 253 allocs/op\nBenchmarkPat_ParseAll 20000 74941 ns/op 17264 B/op 343 allocs/op\nBenchmarkPossum_ParseAll 50000 39947 ns/op 10816 B/op 78 allocs/op\nBenchmarkR2router_ParseAll 50000 42479 ns/op 8352 B/op 120 allocs/op\nBenchmarkRivet_ParseAll 200000 7726 ns/op 912 B/op 16 allocs/op\nBenchmarkTango_ParseAll 30000 50014 ns/op 7168 B/op 208 allocs/op\nBenchmarkTigerTonic_ParseAll 10000 106550 ns/op 19728 B/op 379 allocs/op\nBenchmarkTraffic_ParseAll 10000 216037 ns/op 57776 B/op 642 allocs/op\nBenchmarkVulcan_ParseAll 50000 34379 ns/op 2548 B/op 78 allocs/op\n```\n" }, { "path": "vendor/github.com/gin-gonic/gin/CHANGELOG.md", "content": "\n### Gin 1.4.0\n\n- [NEW] Support for [Go Modules](https://github.com/golang/go/wiki/Modules) [#1569](https://github.com/gin-gonic/gin/pull/1569)\n- [NEW] Refactor of form mapping multipart requesta [#1829](https://github.com/gin-gonic/gin/pull/1829)\n- [FIX] Truncate Latency precision in long running request [#1830](https://github.com/gin-gonic/gin/pull/1830)\n- [FIX] IsTerm flag should not be affected by DisableConsoleColor method. [#1802](https://github.com/gin-gonic/gin/pull/1802)\n- [NEW] Supporting file binding [#1264](https://github.com/gin-gonic/gin/pull/1264)\n- [NEW] Add support for mapping arrays [#1797](https://github.com/gin-gonic/gin/pull/1797)\n- [FIX] Readme updates [#1793](https://github.com/gin-gonic/gin/pull/1793) [#1788](https://github.com/gin-gonic/gin/pull/1788) [1789](https://github.com/gin-gonic/gin/pull/1789)\n- [FIX] StaticFS: Fixed Logging two log lines on 404. [#1805](https://github.com/gin-gonic/gin/pull/1805), [#1804](https://github.com/gin-gonic/gin/pull/1804)\n- [NEW] Make context.Keys available as LogFormatterParams [#1779](https://github.com/gin-gonic/gin/pull/1779)\n- [NEW] Use internal/json for Marshal/Unmarshal [#1791](https://github.com/gin-gonic/gin/pull/1791)\n- [NEW] Support mapping time.Duration [#1794](https://github.com/gin-gonic/gin/pull/1794)\n- [NEW] Refactor form mappings [#1749](https://github.com/gin-gonic/gin/pull/1749)\n- [NEW] Added flag to context.Stream indicates if client disconnected in middle of stream [#1252](https://github.com/gin-gonic/gin/pull/1252)\n- [FIX] Moved [examples](https://github.com/gin-gonic/examples) to stand alone Repo [#1775](https://github.com/gin-gonic/gin/pull/1775)\n- [NEW] Extend context.File to allow for the content-dispositon attachments via a new method context.Attachment [#1260](https://github.com/gin-gonic/gin/pull/1260)\n- [FIX] Support HTTP content negotiation wildcards [#1112](https://github.com/gin-gonic/gin/pull/1112)\n- [NEW] Add prefix from X-Forwarded-Prefix in redirectTrailingSlash [#1238](https://github.com/gin-gonic/gin/pull/1238)\n- [FIX] context.Copy() race condition [#1020](https://github.com/gin-gonic/gin/pull/1020)\n- [NEW] Add context.HandlerNames() [#1729](https://github.com/gin-gonic/gin/pull/1729)\n- [FIX] Change color methods to public in the defaultLogger. [#1771](https://github.com/gin-gonic/gin/pull/1771)\n- [FIX] Update writeHeaders method to use http.Header.Set [#1722](https://github.com/gin-gonic/gin/pull/1722)\n- [NEW] Add response size to LogFormatterParams [#1752](https://github.com/gin-gonic/gin/pull/1752)\n- [NEW] Allow ignoring field on form mapping [#1733](https://github.com/gin-gonic/gin/pull/1733)\n- [NEW] Add a function to force color in console output. [#1724](https://github.com/gin-gonic/gin/pull/1724)\n- [FIX] Context.Next() - recheck len of handlers on every iteration. [#1745](https://github.com/gin-gonic/gin/pull/1745)\n- [FIX] Fix all errcheck warnings [#1739](https://github.com/gin-gonic/gin/pull/1739) [#1653](https://github.com/gin-gonic/gin/pull/1653)\n- [NEW] context: inherits context cancellation and deadline from http.Request context for Go>=1.7 [#1690](https://github.com/gin-gonic/gin/pull/1690)\n- [NEW] Binding for URL Params [#1694](https://github.com/gin-gonic/gin/pull/1694)\n- [NEW] Add LoggerWithFormatter method [#1677](https://github.com/gin-gonic/gin/pull/1677)\n- [FIX] CI testing updates [#1671](https://github.com/gin-gonic/gin/pull/1671) [#1670](https://github.com/gin-gonic/gin/pull/1670) [#1682](https://github.com/gin-gonic/gin/pull/1682) [#1669](https://github.com/gin-gonic/gin/pull/1669)\n- [FIX] StaticFS(): Send 404 when path does not exist [#1663](https://github.com/gin-gonic/gin/pull/1663)\n- [FIX] Handle nil body for JSON binding [#1638](https://github.com/gin-gonic/gin/pull/1638)\n- [FIX] Support bind uri param [#1612](https://github.com/gin-gonic/gin/pull/1612)\n- [FIX] recovery: fix issue with syscall import on google app engine [#1640](https://github.com/gin-gonic/gin/pull/1640)\n- [FIX] Make sure the debug log contains line breaks [#1650](https://github.com/gin-gonic/gin/pull/1650)\n- [FIX] Panic stack trace being printed during recovery of broken pipe [#1089](https://github.com/gin-gonic/gin/pull/1089) [#1259](https://github.com/gin-gonic/gin/pull/1259)\n- [NEW] RunFd method to run http.Server through a file descriptor [#1609](https://github.com/gin-gonic/gin/pull/1609)\n- [NEW] Yaml binding support [#1618](https://github.com/gin-gonic/gin/pull/1618)\n- [FIX] Pass MaxMultipartMemory when FormFile is called [#1600](https://github.com/gin-gonic/gin/pull/1600)\n- [FIX] LoadHTML* tests [#1559](https://github.com/gin-gonic/gin/pull/1559)\n- [FIX] Removed use of sync.pool from HandleContext [#1565](https://github.com/gin-gonic/gin/pull/1565)\n- [FIX] Format output log to os.Stderr [#1571](https://github.com/gin-gonic/gin/pull/1571)\n- [FIX] Make logger use a yellow background and a darkgray text for legibility [#1570](https://github.com/gin-gonic/gin/pull/1570)\n- [FIX] Remove sensitive request information from panic log. [#1370](https://github.com/gin-gonic/gin/pull/1370)\n- [FIX] log.Println() does not print timestamp [#829](https://github.com/gin-gonic/gin/pull/829) [#1560](https://github.com/gin-gonic/gin/pull/1560)\n- [NEW] Add PureJSON renderer [#694](https://github.com/gin-gonic/gin/pull/694)\n- [FIX] Add missing copyright and update if/else [#1497](https://github.com/gin-gonic/gin/pull/1497)\n- [FIX] Update msgpack usage [#1498](https://github.com/gin-gonic/gin/pull/1498)\n- [FIX] Use protobuf on render [#1496](https://github.com/gin-gonic/gin/pull/1496)\n- [FIX] Add support for Protobuf format response [#1479](https://github.com/gin-gonic/gin/pull/1479)\n- [NEW] Set default time format in form binding [#1487](https://github.com/gin-gonic/gin/pull/1487)\n- [FIX] Add BindXML and ShouldBindXML [#1485](https://github.com/gin-gonic/gin/pull/1485)\n- [NEW] Upgrade dependency libraries [#1491](https://github.com/gin-gonic/gin/pull/1491)\n\n\n### Gin 1.3.0\n\n- [NEW] Add [`func (*Context) QueryMap`](https://godoc.org/github.com/gin-gonic/gin#Context.QueryMap), [`func (*Context) GetQueryMap`](https://godoc.org/github.com/gin-gonic/gin#Context.GetQueryMap), [`func (*Context) PostFormMap`](https://godoc.org/github.com/gin-gonic/gin#Context.PostFormMap) and [`func (*Context) GetPostFormMap`](https://godoc.org/github.com/gin-gonic/gin#Context.GetPostFormMap) to support `type map[string]string` as query string or form parameters, see [#1383](https://github.com/gin-gonic/gin/pull/1383)\n- [NEW] Add [`func (*Context) AsciiJSON`](https://godoc.org/github.com/gin-gonic/gin#Context.AsciiJSON), see [#1358](https://github.com/gin-gonic/gin/pull/1358)\n- [NEW] Add `Pusher()` in [`type ResponseWriter`](https://godoc.org/github.com/gin-gonic/gin#ResponseWriter) for supporting http2 push, see [#1273](https://github.com/gin-gonic/gin/pull/1273)\n- [NEW] Add [`func (*Context) DataFromReader`](https://godoc.org/github.com/gin-gonic/gin#Context.DataFromReader) for serving dynamic data, see [#1304](https://github.com/gin-gonic/gin/pull/1304)\n- [NEW] Add [`func (*Context) ShouldBindBodyWith`](https://godoc.org/github.com/gin-gonic/gin#Context.ShouldBindBodyWith) allowing to call binding multiple times, see [#1341](https://github.com/gin-gonic/gin/pull/1341)\n- [NEW] Support pointers in form binding, see [#1336](https://github.com/gin-gonic/gin/pull/1336)\n- [NEW] Add [`func (*Context) JSONP`](https://godoc.org/github.com/gin-gonic/gin#Context.JSONP), see [#1333](https://github.com/gin-gonic/gin/pull/1333)\n- [NEW] Support default value in form binding, see [#1138](https://github.com/gin-gonic/gin/pull/1138)\n- [NEW] Expose validator engine in [`type StructValidator`](https://godoc.org/github.com/gin-gonic/gin/binding#StructValidator), see [#1277](https://github.com/gin-gonic/gin/pull/1277)\n- [NEW] Add [`func (*Context) ShouldBind`](https://godoc.org/github.com/gin-gonic/gin#Context.ShouldBind), [`func (*Context) ShouldBindQuery`](https://godoc.org/github.com/gin-gonic/gin#Context.ShouldBindQuery) and [`func (*Context) ShouldBindJSON`](https://godoc.org/github.com/gin-gonic/gin#Context.ShouldBindJSON), see [#1047](https://github.com/gin-gonic/gin/pull/1047)\n- [NEW] Add support for `time.Time` location in form binding, see [#1117](https://github.com/gin-gonic/gin/pull/1117)\n- [NEW] Add [`func (*Context) BindQuery`](https://godoc.org/github.com/gin-gonic/gin#Context.BindQuery), see [#1029](https://github.com/gin-gonic/gin/pull/1029)\n- [NEW] Make [jsonite](https://github.com/json-iterator/go) optional with build tags, see [#1026](https://github.com/gin-gonic/gin/pull/1026)\n- [NEW] Show query string in logger, see [#999](https://github.com/gin-gonic/gin/pull/999)\n- [NEW] Add [`func (*Context) SecureJSON`](https://godoc.org/github.com/gin-gonic/gin#Context.SecureJSON), see [#987](https://github.com/gin-gonic/gin/pull/987) and [#993](https://github.com/gin-gonic/gin/pull/993)\n- [DEPRECATE] `func (*Context) GetCookie` for [`func (*Context) Cookie`](https://godoc.org/github.com/gin-gonic/gin#Context.Cookie)\n- [FIX] Don't display color tags if [`func DisableConsoleColor`](https://godoc.org/github.com/gin-gonic/gin#DisableConsoleColor) called, see [#1072](https://github.com/gin-gonic/gin/pull/1072)\n- [FIX] Gin Mode `\"\"` when calling [`func Mode`](https://godoc.org/github.com/gin-gonic/gin#Mode) now returns `const DebugMode`, see [#1250](https://github.com/gin-gonic/gin/pull/1250)\n- [FIX] `Flush()` now doesn't overwrite `responseWriter` status code, see [#1460](https://github.com/gin-gonic/gin/pull/1460)\n\n### Gin 1.2.0\n\n- [NEW] Switch from godeps to govendor\n- [NEW] Add support for Let's Encrypt via gin-gonic/autotls\n- [NEW] Improve README examples and add extra at examples folder\n- [NEW] Improved support with App Engine\n- [NEW] Add custom template delimiters, see #860\n- [NEW] Add Template Func Maps, see #962\n- [NEW] Add \\*context.Handler(), see #928\n- [NEW] Add \\*context.GetRawData()\n- [NEW] Add \\*context.GetHeader() (request)\n- [NEW] Add \\*context.AbortWithStatusJSON() (JSON content type)\n- [NEW] Add \\*context.Keys type cast helpers\n- [NEW] Add \\*context.ShouldBindWith()\n- [NEW] Add \\*context.MustBindWith()\n- [NEW] Add \\*engine.SetFuncMap()\n- [DEPRECATE] On next release: \\*context.BindWith(), see #855\n- [FIX] Refactor render\n- [FIX] Reworked tests\n- [FIX] logger now supports cygwin\n- [FIX] Use X-Forwarded-For before X-Real-Ip\n- [FIX] time.Time binding (#904)\n\n### Gin 1.1.4\n\n- [NEW] Support google appengine for IsTerminal func\n\n### Gin 1.1.3\n\n- [FIX] Reverted Logger: skip ANSI color commands\n\n### Gin 1.1\n\n- [NEW] Implement QueryArray and PostArray methods \n- [NEW] Refactor GetQuery and GetPostForm \n- [NEW] Add contribution guide \n- [FIX] Corrected typos in README\n- [FIX] Removed additional Iota \n- [FIX] Changed imports to gopkg instead of github in README (#733) \n- [FIX] Logger: skip ANSI color commands if output is not a tty\n\n### Gin 1.0rc2 (...)\n\n- [PERFORMANCE] Fast path for writing Content-Type.\n- [PERFORMANCE] Much faster 404 routing\n- [PERFORMANCE] Allocation optimizations\n- [PERFORMANCE] Faster root tree lookup\n- [PERFORMANCE] Zero overhead, String() and JSON() rendering.\n- [PERFORMANCE] Faster ClientIP parsing\n- [PERFORMANCE] Much faster SSE implementation\n- [NEW] Benchmarks suite\n- [NEW] Bind validation can be disabled and replaced with custom validators.\n- [NEW] More flexible HTML render\n- [NEW] Multipart and PostForm bindings\n- [NEW] Adds method to return all the registered routes\n- [NEW] Context.HandlerName() returns the main handler's name\n- [NEW] Adds Error.IsType() helper\n- [FIX] Binding multipart form\n- [FIX] Integration tests\n- [FIX] Crash when binding non struct object in Context.\n- [FIX] RunTLS() implementation\n- [FIX] Logger() unit tests\n- [FIX] Adds SetHTMLTemplate() warning\n- [FIX] Context.IsAborted()\n- [FIX] More unit tests\n- [FIX] JSON, XML, HTML renders accept custom content-types\n- [FIX] gin.AbortIndex is unexported\n- [FIX] Better approach to avoid directory listing in StaticFS()\n- [FIX] Context.ClientIP() always returns the IP with trimmed spaces.\n- [FIX] Better warning when running in debug mode.\n- [FIX] Google App Engine integration. debugPrint does not use os.Stdout\n- [FIX] Fixes integer overflow in error type\n- [FIX] Error implements the json.Marshaller interface\n- [FIX] MIT license in every file\n\n\n### Gin 1.0rc1 (May 22, 2015)\n\n- [PERFORMANCE] Zero allocation router\n- [PERFORMANCE] Faster JSON, XML and text rendering\n- [PERFORMANCE] Custom hand optimized HttpRouter for Gin\n- [PERFORMANCE] Misc code optimizations. Inlining, tail call optimizations\n- [NEW] Built-in support for golang.org/x/net/context\n- [NEW] Any(path, handler). Create a route that matches any path\n- [NEW] Refactored rendering pipeline (faster and static typeded)\n- [NEW] Refactored errors API\n- [NEW] IndentedJSON() prints pretty JSON\n- [NEW] Added gin.DefaultWriter\n- [NEW] UNIX socket support\n- [NEW] RouterGroup.BasePath is exposed\n- [NEW] JSON validation using go-validate-yourself (very powerful options)\n- [NEW] Completed suite of unit tests\n- [NEW] HTTP streaming with c.Stream()\n- [NEW] StaticFile() creates a router for serving just one file.\n- [NEW] StaticFS() has an option to disable directory listing.\n- [NEW] StaticFS() for serving static files through virtual filesystems\n- [NEW] Server-Sent Events native support\n- [NEW] WrapF() and WrapH() helpers for wrapping http.HandlerFunc and http.Handler\n- [NEW] Added LoggerWithWriter() middleware\n- [NEW] Added RecoveryWithWriter() middleware\n- [NEW] Added DefaultPostFormValue()\n- [NEW] Added DefaultFormValue()\n- [NEW] Added DefaultParamValue()\n- [FIX] BasicAuth() when using custom realm\n- [FIX] Bug when serving static files in nested routing group\n- [FIX] Redirect using built-in http.Redirect()\n- [FIX] Logger when printing the requested path\n- [FIX] Documentation typos\n- [FIX] Context.Engine renamed to Context.engine\n- [FIX] Better debugging messages\n- [FIX] ErrorLogger\n- [FIX] Debug HTTP render\n- [FIX] Refactored binding and render modules\n- [FIX] Refactored Context initialization\n- [FIX] Refactored BasicAuth()\n- [FIX] NoMethod/NoRoute handlers\n- [FIX] Hijacking http\n- [FIX] Better support for Google App Engine (using log instead of fmt)\n\n\n### Gin 0.6 (Mar 9, 2015)\n\n- [NEW] Support multipart/form-data\n- [NEW] NoMethod handler\n- [NEW] Validate sub structures\n- [NEW] Support for HTTP Realm Auth\n- [FIX] Unsigned integers in binding\n- [FIX] Improve color logger\n\n\n### Gin 0.5 (Feb 7, 2015)\n\n- [NEW] Content Negotiation\n- [FIX] Solved security bug that allow a client to spoof ip\n- [FIX] Fix unexported/ignored fields in binding\n\n\n### Gin 0.4 (Aug 21, 2014)\n\n- [NEW] Development mode\n- [NEW] Unit tests\n- [NEW] Add Content.Redirect()\n- [FIX] Deferring WriteHeader()\n- [FIX] Improved documentation for model binding\n\n\n### Gin 0.3 (Jul 18, 2014)\n\n- [PERFORMANCE] Normal log and error log are printed in the same call.\n- [PERFORMANCE] Improve performance of NoRouter()\n- [PERFORMANCE] Improve context's memory locality, reduce CPU cache faults.\n- [NEW] Flexible rendering API\n- [NEW] Add Context.File()\n- [NEW] Add shorcut RunTLS() for http.ListenAndServeTLS\n- [FIX] Rename NotFound404() to NoRoute()\n- [FIX] Errors in context are purged\n- [FIX] Adds HEAD method in Static file serving\n- [FIX] Refactors Static() file serving\n- [FIX] Using keyed initialization to fix app-engine integration\n- [FIX] Can't unmarshal JSON array, #63\n- [FIX] Renaming Context.Req to Context.Request\n- [FIX] Check application/x-www-form-urlencoded when parsing form\n\n\n### Gin 0.2b (Jul 08, 2014)\n- [PERFORMANCE] Using sync.Pool to allocatio/gc overhead\n- [NEW] Travis CI integration\n- [NEW] Completely new logger\n- [NEW] New API for serving static files. gin.Static()\n- [NEW] gin.H() can be serialized into XML\n- [NEW] Typed errors. Errors can be typed. Internet/external/custom.\n- [NEW] Support for Godeps\n- [NEW] Travis/Godocs badges in README\n- [NEW] New Bind() and BindWith() methods for parsing request body.\n- [NEW] Add Content.Copy()\n- [NEW] Add context.LastError()\n- [NEW] Add shorcut for OPTIONS HTTP method\n- [FIX] Tons of README fixes\n- [FIX] Header is written before body\n- [FIX] BasicAuth() and changes API a little bit\n- [FIX] Recovery() middleware only prints panics\n- [FIX] Context.Get() does not panic anymore. Use MustGet() instead.\n- [FIX] Multiple http.WriteHeader() in NotFound handlers\n- [FIX] Engine.Run() panics if http server can't be setted up\n- [FIX] Crash when route path doesn't start with '/'\n- [FIX] Do not update header when status code is negative\n- [FIX] Setting response headers before calling WriteHeader in context.String()\n- [FIX] Add MIT license\n- [FIX] Changes behaviour of ErrorLogger() and Logger()\n" }, { "path": "vendor/github.com/gin-gonic/gin/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment include:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or advances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at teamgingonic@gmail.com. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/gin-gonic/gin/CONTRIBUTING.md", "content": "## Contributing \n\n- With issues:\n - Use the search tool before opening a new issue.\n - Please provide source code and commit sha if you found a bug.\n - Review existing issues and provide feedback or react to them.\n\n- With pull requests:\n - Open your pull request against `master`\n - Your pull request should have no more than two commits, if not you should squash them.\n - It should pass all tests in the available continuous integrations systems such as TravisCI.\n - You should add/modify tests to cover your proposed code changes.\n - If your pull request contains a new feature, please document it on the README.\n" }, { "path": "vendor/github.com/gin-gonic/gin/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2014 Manuel Martínez-Almeida\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n" }, { "path": "vendor/github.com/gin-gonic/gin/Makefile", "content": "GO ?= go\nGOFMT ?= gofmt \"-s\"\nPACKAGES ?= $(shell $(GO) list ./... | grep -v /vendor/)\nVETPACKAGES ?= $(shell $(GO) list ./... | grep -v /vendor/ | grep -v /examples/)\nGOFILES := $(shell find . -name \"*.go\" -type f -not -path \"./vendor/*\")\nTESTFOLDER := $(shell $(GO) list ./... | grep -E 'gin$$|binding$$|render$$' | grep -v examples)\n\nall: install\n\ninstall: deps\n\tgovendor sync\n\n.PHONY: test\ntest:\n\techo \"mode: count\" > coverage.out\n\tfor d in $(TESTFOLDER); do \\\n\t\t$(GO) test -v -covermode=count -coverprofile=profile.out $$d > tmp.out; \\\n\t\tcat tmp.out; \\\n\t\tif grep -q \"^--- FAIL\" tmp.out; then \\\n\t\t\trm tmp.out; \\\n\t\t\texit 1; \\\n\t\telif grep -q \"build failed\" tmp.out; then \\\n\t\t\trm tmp.out; \\\n\t\t\texit 1; \\\n\t\telif grep -q \"setup failed\" tmp.out; then \\\n\t\t\trm tmp.out; \\\n\t\t\texit 1; \\\n\t\tfi; \\\n\t\tif [ -f profile.out ]; then \\\n\t\t\tcat profile.out | grep -v \"mode:\" >> coverage.out; \\\n\t\t\trm profile.out; \\\n\t\tfi; \\\n\tdone\n\n.PHONY: fmt\nfmt:\n\t$(GOFMT) -w $(GOFILES)\n\n.PHONY: fmt-check\nfmt-check:\n\t@diff=$$($(GOFMT) -d $(GOFILES)); \\\n\tif [ -n \"$$diff\" ]; then \\\n\t\techo \"Please run 'make fmt' and commit the result:\"; \\\n\t\techo \"$${diff}\"; \\\n\t\texit 1; \\\n\tfi;\n\nvet:\n\t$(GO) vet $(VETPACKAGES)\n\ndeps:\n\t@hash govendor > /dev/null 2>&1; if [ $$? -ne 0 ]; then \\\n\t\t$(GO) get -u github.com/kardianos/govendor; \\\n\tfi\n\n.PHONY: lint\nlint:\n\t@hash golint > /dev/null 2>&1; if [ $$? -ne 0 ]; then \\\n\t\t$(GO) get -u golang.org/x/lint/golint; \\\n\tfi\n\tfor PKG in $(PACKAGES); do golint -set_exit_status $$PKG || exit 1; done;\n\n.PHONY: misspell-check\nmisspell-check:\n\t@hash misspell > /dev/null 2>&1; if [ $$? -ne 0 ]; then \\\n\t\t$(GO) get -u github.com/client9/misspell/cmd/misspell; \\\n\tfi\n\tmisspell -error $(GOFILES)\n\n.PHONY: misspell\nmisspell:\n\t@hash misspell > /dev/null 2>&1; if [ $$? -ne 0 ]; then \\\n\t\t$(GO) get -u github.com/client9/misspell/cmd/misspell; \\\n\tfi\n\tmisspell -w $(GOFILES)\n\n.PHONY: tools\ntools:\n\tgo install golang.org/x/lint/golint; \\\n\tgo install github.com/client9/misspell/cmd/misspell;\n" }, { "path": "vendor/github.com/gin-gonic/gin/README.md", "content": "# Gin Web Framework\n\n\n\n[![Build Status](https://travis-ci.org/gin-gonic/gin.svg)](https://travis-ci.org/gin-gonic/gin)\n[![codecov](https://codecov.io/gh/gin-gonic/gin/branch/master/graph/badge.svg)](https://codecov.io/gh/gin-gonic/gin)\n[![Go Report Card](https://goreportcard.com/badge/github.com/gin-gonic/gin)](https://goreportcard.com/report/github.com/gin-gonic/gin)\n[![GoDoc](https://godoc.org/github.com/gin-gonic/gin?status.svg)](https://godoc.org/github.com/gin-gonic/gin)\n[![Join the chat at https://gitter.im/gin-gonic/gin](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/gin-gonic/gin?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n[![Sourcegraph](https://sourcegraph.com/github.com/gin-gonic/gin/-/badge.svg)](https://sourcegraph.com/github.com/gin-gonic/gin?badge)\n[![Open Source Helpers](https://www.codetriage.com/gin-gonic/gin/badges/users.svg)](https://www.codetriage.com/gin-gonic/gin)\n[![Release](https://img.shields.io/github/release/gin-gonic/gin.svg?style=flat-square)](https://github.com/gin-gonic/gin/releases)\n\nGin is a web framework written in Go (Golang). It features a martini-like API with much better performance, up to 40 times faster thanks to [httprouter](https://github.com/julienschmidt/httprouter). If you need performance and good productivity, you will love Gin.\n\n\n## Contents\n\n- [Installation](#installation)\n- [Prerequisite](#prerequisite)\n- [Quick start](#quick-start)\n- [Benchmarks](#benchmarks)\n- [Gin v1.stable](#gin-v1-stable)\n- [Build with jsoniter](#build-with-jsoniter)\n- [API Examples](#api-examples)\n - [Using GET,POST,PUT,PATCH,DELETE and OPTIONS](#using-get-post-put-patch-delete-and-options)\n - [Parameters in path](#parameters-in-path)\n - [Querystring parameters](#querystring-parameters)\n - [Multipart/Urlencoded Form](#multiparturlencoded-form)\n - [Another example: query + post form](#another-example-query--post-form)\n - [Map as querystring or postform parameters](#map-as-querystring-or-postform-parameters)\n - [Upload files](#upload-files)\n - [Grouping routes](#grouping-routes)\n - [Blank Gin without middleware by default](#blank-gin-without-middleware-by-default)\n - [Using middleware](#using-middleware)\n - [How to write log file](#how-to-write-log-file)\n - [Custom Log Format](#custom-log-format)\n - [Model binding and validation](#model-binding-and-validation)\n - [Custom Validators](#custom-validators)\n - [Only Bind Query String](#only-bind-query-string)\n - [Bind Query String or Post Data](#bind-query-string-or-post-data)\n - [Bind Uri](#bind-uri)\n - [Bind HTML checkboxes](#bind-html-checkboxes)\n - [Multipart/Urlencoded binding](#multiparturlencoded-binding)\n - [XML, JSON, YAML and ProtoBuf rendering](#xml-json-yaml-and-protobuf-rendering)\n - [JSONP rendering](#jsonp)\n - [Serving static files](#serving-static-files)\n - [Serving data from reader](#serving-data-from-reader)\n - [HTML rendering](#html-rendering)\n - [Multitemplate](#multitemplate)\n - [Redirects](#redirects)\n - [Custom Middleware](#custom-middleware)\n - [Using BasicAuth() middleware](#using-basicauth-middleware)\n - [Goroutines inside a middleware](#goroutines-inside-a-middleware)\n - [Custom HTTP configuration](#custom-http-configuration)\n - [Support Let's Encrypt](#support-lets-encrypt)\n - [Run multiple service using Gin](#run-multiple-service-using-gin)\n - [Graceful restart or stop](#graceful-restart-or-stop)\n - [Build a single binary with templates](#build-a-single-binary-with-templates)\n - [Bind form-data request with custom struct](#bind-form-data-request-with-custom-struct)\n - [Try to bind body into different structs](#try-to-bind-body-into-different-structs)\n - [http2 server push](#http2-server-push)\n - [Define format for the log of routes](#define-format-for-the-log-of-routes)\n - [Set and get a cookie](#set-and-get-a-cookie)\n- [Testing](#testing)\n- [Users](#users)\n\n## Installation\n\nTo install Gin package, you need to install Go and set your Go workspace first.\n\n1. The first need [Go](https://golang.org/) installed (**version 1.8+ is required**), then you can use the below Go command to install Gin.\n\n```sh\n$ go get -u github.com/gin-gonic/gin\n```\n\n2. Import it in your code:\n\n```go\nimport \"github.com/gin-gonic/gin\"\n```\n\n3. (Optional) Import `net/http`. This is required for example if using constants such as `http.StatusOK`.\n\n```go\nimport \"net/http\"\n```\n\n### Use a vendor tool like [Govendor](https://github.com/kardianos/govendor)\n\n1. `go get` govendor\n\n```sh\n$ go get github.com/kardianos/govendor\n```\n2. Create your project folder and `cd` inside\n\n```sh\n$ mkdir -p $GOPATH/src/github.com/myusername/project && cd \"$_\"\n```\n\n3. Vendor init your project and add gin\n\n```sh\n$ govendor init\n$ govendor fetch github.com/gin-gonic/gin@v1.3\n```\n\n4. Copy a starting template inside your project\n\n```sh\n$ curl https://raw.githubusercontent.com/gin-gonic/examples/master/basic/main.go > main.go\n```\n\n5. Run your project\n\n```sh\n$ go run main.go\n```\n\n## Prerequisite\n\nNow Gin requires Go 1.6 or later and Go 1.7 will be required soon.\n\n## Quick start\n \n```sh\n# assume the following codes in example.go file\n$ cat example.go\n```\n\n```go\npackage main\n\nimport \"github.com/gin-gonic/gin\"\n\nfunc main() {\n\tr := gin.Default()\n\tr.GET(\"/ping\", func(c *gin.Context) {\n\t\tc.JSON(200, gin.H{\n\t\t\t\"message\": \"pong\",\n\t\t})\n\t})\n\tr.Run() // listen and serve on 0.0.0.0:8080\n}\n```\n\n```\n# run example.go and visit 0.0.0.0:8080/ping on browser\n$ go run example.go\n```\n\n## Benchmarks\n\nGin uses a custom version of [HttpRouter](https://github.com/julienschmidt/httprouter)\n\n[See all benchmarks](/BENCHMARKS.md)\n\nBenchmark name | (1) | (2) | (3) \t\t | (4)\n--------------------------------------------|-----------:|------------:|-----------:|---------:\n**BenchmarkGin_GithubAll** | **30000** | **48375** | **0** | **0**\nBenchmarkAce_GithubAll | 10000 | 134059 | 13792 | 167\nBenchmarkBear_GithubAll | 5000 | 534445 | 86448 | 943\nBenchmarkBeego_GithubAll | 3000 | 592444 | 74705 | 812\nBenchmarkBone_GithubAll | 200 | 6957308 | 698784 | 8453\nBenchmarkDenco_GithubAll | 10000 | 158819 | 20224 | 167\nBenchmarkEcho_GithubAll | 10000 | 154700 | 6496 | 203\nBenchmarkGocraftWeb_GithubAll | 3000 | 570806 | 131656 | 1686\nBenchmarkGoji_GithubAll | 2000 | 818034 | 56112 | 334\nBenchmarkGojiv2_GithubAll | 2000 | 1213973 | 274768 | 3712\nBenchmarkGoJsonRest_GithubAll | 2000 | 785796 | 134371 | 2737\nBenchmarkGoRestful_GithubAll | 300 | 5238188 | 689672 | 4519\nBenchmarkGorillaMux_GithubAll | 100 | 10257726 | 211840 | 2272\nBenchmarkHttpRouter_GithubAll | 20000 | 105414 | 13792 | 167\nBenchmarkHttpTreeMux_GithubAll | 10000 | 319934 | 65856 | 671\nBenchmarkKocha_GithubAll | 10000 | 209442 | 23304 | 843\nBenchmarkLARS_GithubAll | 20000 | 62565 | 0 | 0\nBenchmarkMacaron_GithubAll | 2000 | 1161270 | 204194 | 2000\nBenchmarkMartini_GithubAll | 200 | 9991713 | 226549 | 2325\nBenchmarkPat_GithubAll | 200 | 5590793 | 1499568 | 27435\nBenchmarkPossum_GithubAll | 10000 | 319768 | 84448 | 609\nBenchmarkR2router_GithubAll | 10000 | 305134 | 77328 | 979\nBenchmarkRivet_GithubAll | 10000 | 132134 | 16272 | 167\nBenchmarkTango_GithubAll | 3000 | 552754 | 63826 | 1618\nBenchmarkTigerTonic_GithubAll | 1000 | 1439483 | 239104 | 5374\nBenchmarkTraffic_GithubAll | 100 | 11383067 | 2659329 | 21848\nBenchmarkVulcan_GithubAll | 5000 | 394253 | 19894 | 609\n\n- (1): Total Repetitions achieved in constant time, higher means more confident result\n- (2): Single Repetition Duration (ns/op), lower is better\n- (3): Heap Memory (B/op), lower is better\n- (4): Average Allocations per Repetition (allocs/op), lower is better\n\n## Gin v1. stable\n\n- [x] Zero allocation router.\n- [x] Still the fastest http router and framework. From routing to writing.\n- [x] Complete suite of unit tests\n- [x] Battle tested\n- [x] API frozen, new releases will not break your code.\n\n## Build with [jsoniter](https://github.com/json-iterator/go)\n\nGin uses `encoding/json` as default json package but you can change to [jsoniter](https://github.com/json-iterator/go) by build from other tags.\n\n```sh\n$ go build -tags=jsoniter .\n```\n\n## API Examples\n\nYou can find a number of ready-to-run examples at [Gin examples repository](https://github.com/gin-gonic/examples).\n\n### Using GET, POST, PUT, PATCH, DELETE and OPTIONS\n\n```go\nfunc main() {\n\t// Creates a gin router with default middleware:\n\t// logger and recovery (crash-free) middleware\n\trouter := gin.Default()\n\n\trouter.GET(\"/someGet\", getting)\n\trouter.POST(\"/somePost\", posting)\n\trouter.PUT(\"/somePut\", putting)\n\trouter.DELETE(\"/someDelete\", deleting)\n\trouter.PATCH(\"/somePatch\", patching)\n\trouter.HEAD(\"/someHead\", head)\n\trouter.OPTIONS(\"/someOptions\", options)\n\n\t// By default it serves on :8080 unless a\n\t// PORT environment variable was defined.\n\trouter.Run()\n\t// router.Run(\":3000\") for a hard coded port\n}\n```\n\n### Parameters in path\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\t// This handler will match /user/john but will not match /user/ or /user\n\trouter.GET(\"/user/:name\", func(c *gin.Context) {\n\t\tname := c.Param(\"name\")\n\t\tc.String(http.StatusOK, \"Hello %s\", name)\n\t})\n\n\t// However, this one will match /user/john/ and also /user/john/send\n\t// If no other routers match /user/john, it will redirect to /user/john/\n\trouter.GET(\"/user/:name/*action\", func(c *gin.Context) {\n\t\tname := c.Param(\"name\")\n\t\taction := c.Param(\"action\")\n\t\tmessage := name + \" is \" + action\n\t\tc.String(http.StatusOK, message)\n\t})\n\n\trouter.Run(\":8080\")\n}\n```\n\n### Querystring parameters\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\t// Query string parameters are parsed using the existing underlying request object.\n\t// The request responds to a url matching: /welcome?firstname=Jane&lastname=Doe\n\trouter.GET(\"/welcome\", func(c *gin.Context) {\n\t\tfirstname := c.DefaultQuery(\"firstname\", \"Guest\")\n\t\tlastname := c.Query(\"lastname\") // shortcut for c.Request.URL.Query().Get(\"lastname\")\n\n\t\tc.String(http.StatusOK, \"Hello %s %s\", firstname, lastname)\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\n### Multipart/Urlencoded Form\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\trouter.POST(\"/form_post\", func(c *gin.Context) {\n\t\tmessage := c.PostForm(\"message\")\n\t\tnick := c.DefaultPostForm(\"nick\", \"anonymous\")\n\n\t\tc.JSON(200, gin.H{\n\t\t\t\"status\": \"posted\",\n\t\t\t\"message\": message,\n\t\t\t\"nick\": nick,\n\t\t})\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\n### Another example: query + post form\n\n```\nPOST /post?id=1234&page=1 HTTP/1.1\nContent-Type: application/x-www-form-urlencoded\n\nname=manu&message=this_is_great\n```\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\trouter.POST(\"/post\", func(c *gin.Context) {\n\n\t\tid := c.Query(\"id\")\n\t\tpage := c.DefaultQuery(\"page\", \"0\")\n\t\tname := c.PostForm(\"name\")\n\t\tmessage := c.PostForm(\"message\")\n\n\t\tfmt.Printf(\"id: %s; page: %s; name: %s; message: %s\", id, page, name, message)\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\n```\nid: 1234; page: 1; name: manu; message: this_is_great\n```\n\n### Map as querystring or postform parameters\n\n```\nPOST /post?ids[a]=1234&ids[b]=hello HTTP/1.1\nContent-Type: application/x-www-form-urlencoded\n\nnames[first]=thinkerou&names[second]=tianou\n```\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\trouter.POST(\"/post\", func(c *gin.Context) {\n\n\t\tids := c.QueryMap(\"ids\")\n\t\tnames := c.PostFormMap(\"names\")\n\n\t\tfmt.Printf(\"ids: %v; names: %v\", ids, names)\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\n```\nids: map[b:hello a:1234], names: map[second:tianou first:thinkerou]\n```\n\n### Upload files\n\n#### Single file\n\nReferences issue [#774](https://github.com/gin-gonic/gin/issues/774) and detail [example code](https://github.com/gin-gonic/examples/tree/master/upload-file/single).\n\n`file.Filename` **SHOULD NOT** be trusted. See [`Content-Disposition` on MDN](https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Content-Disposition#Directives) and [#1693](https://github.com/gin-gonic/gin/issues/1693)\n\n> The filename is always optional and must not be used blindly by the application: path information should be stripped, and conversion to the server file system rules should be done.\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\t// Set a lower memory limit for multipart forms (default is 32 MiB)\n\t// router.MaxMultipartMemory = 8 << 20 // 8 MiB\n\trouter.POST(\"/upload\", func(c *gin.Context) {\n\t\t// single file\n\t\tfile, _ := c.FormFile(\"file\")\n\t\tlog.Println(file.Filename)\n\n\t\t// Upload the file to specific dst.\n\t\t// c.SaveUploadedFile(file, dst)\n\n\t\tc.String(http.StatusOK, fmt.Sprintf(\"'%s' uploaded!\", file.Filename))\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\nHow to `curl`:\n\n```bash\ncurl -X POST http://localhost:8080/upload \\\n -F \"file=@/Users/appleboy/test.zip\" \\\n -H \"Content-Type: multipart/form-data\"\n```\n\n#### Multiple files\n\nSee the detail [example code](https://github.com/gin-gonic/examples/tree/master/upload-file/multiple).\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\t// Set a lower memory limit for multipart forms (default is 32 MiB)\n\t// router.MaxMultipartMemory = 8 << 20 // 8 MiB\n\trouter.POST(\"/upload\", func(c *gin.Context) {\n\t\t// Multipart form\n\t\tform, _ := c.MultipartForm()\n\t\tfiles := form.File[\"upload[]\"]\n\n\t\tfor _, file := range files {\n\t\t\tlog.Println(file.Filename)\n\n\t\t\t// Upload the file to specific dst.\n\t\t\t// c.SaveUploadedFile(file, dst)\n\t\t}\n\t\tc.String(http.StatusOK, fmt.Sprintf(\"%d files uploaded!\", len(files)))\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\nHow to `curl`:\n\n```bash\ncurl -X POST http://localhost:8080/upload \\\n -F \"upload[]=@/Users/appleboy/test1.zip\" \\\n -F \"upload[]=@/Users/appleboy/test2.zip\" \\\n -H \"Content-Type: multipart/form-data\"\n```\n\n### Grouping routes\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\t// Simple group: v1\n\tv1 := router.Group(\"/v1\")\n\t{\n\t\tv1.POST(\"/login\", loginEndpoint)\n\t\tv1.POST(\"/submit\", submitEndpoint)\n\t\tv1.POST(\"/read\", readEndpoint)\n\t}\n\n\t// Simple group: v2\n\tv2 := router.Group(\"/v2\")\n\t{\n\t\tv2.POST(\"/login\", loginEndpoint)\n\t\tv2.POST(\"/submit\", submitEndpoint)\n\t\tv2.POST(\"/read\", readEndpoint)\n\t}\n\n\trouter.Run(\":8080\")\n}\n```\n\n### Blank Gin without middleware by default\n\nUse\n\n```go\nr := gin.New()\n```\n\ninstead of\n\n```go\n// Default With the Logger and Recovery middleware already attached\nr := gin.Default()\n```\n\n\n### Using middleware\n```go\nfunc main() {\n\t// Creates a router without any middleware by default\n\tr := gin.New()\n\n\t// Global middleware\n\t// Logger middleware will write the logs to gin.DefaultWriter even if you set with GIN_MODE=release.\n\t// By default gin.DefaultWriter = os.Stdout\n\tr.Use(gin.Logger())\n\n\t// Recovery middleware recovers from any panics and writes a 500 if there was one.\n\tr.Use(gin.Recovery())\n\n\t// Per route middleware, you can add as many as you desire.\n\tr.GET(\"/benchmark\", MyBenchLogger(), benchEndpoint)\n\n\t// Authorization group\n\t// authorized := r.Group(\"/\", AuthRequired())\n\t// exactly the same as:\n\tauthorized := r.Group(\"/\")\n\t// per group middleware! in this case we use the custom created\n\t// AuthRequired() middleware just in the \"authorized\" group.\n\tauthorized.Use(AuthRequired())\n\t{\n\t\tauthorized.POST(\"/login\", loginEndpoint)\n\t\tauthorized.POST(\"/submit\", submitEndpoint)\n\t\tauthorized.POST(\"/read\", readEndpoint)\n\n\t\t// nested group\n\t\ttesting := authorized.Group(\"testing\")\n\t\ttesting.GET(\"/analytics\", analyticsEndpoint)\n\t}\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n### How to write log file\n```go\nfunc main() {\n // Disable Console Color, you don't need console color when writing the logs to file.\n gin.DisableConsoleColor()\n\n // Logging to a file.\n f, _ := os.Create(\"gin.log\")\n gin.DefaultWriter = io.MultiWriter(f)\n\n // Use the following code if you need to write the logs to file and console at the same time.\n // gin.DefaultWriter = io.MultiWriter(f, os.Stdout)\n\n router := gin.Default()\n router.GET(\"/ping\", func(c *gin.Context) {\n c.String(200, \"pong\")\n })\n\n    router.Run(\":8080\")\n}\n```\n\n### Custom Log Format\n```go\nfunc main() {\n\trouter := gin.New()\n\n\t// LoggerWithFormatter middleware will write the logs to gin.DefaultWriter\n\t// By default gin.DefaultWriter = os.Stdout\n\trouter.Use(gin.LoggerWithFormatter(func(param gin.LogFormatterParams) string {\n\n\t\t// your custom format\n\t\treturn fmt.Sprintf(\"%s - [%s] \\\"%s %s %s %d %s \\\"%s\\\" %s\\\"\\n\",\n\t\t\t\tparam.ClientIP,\n\t\t\t\tparam.TimeStamp.Format(time.RFC1123),\n\t\t\t\tparam.Method,\n\t\t\t\tparam.Path,\n\t\t\t\tparam.Request.Proto,\n\t\t\t\tparam.StatusCode,\n\t\t\t\tparam.Latency,\n\t\t\t\tparam.Request.UserAgent(),\n\t\t\t\tparam.ErrorMessage,\n\t\t)\n\t}))\n\trouter.Use(gin.Recovery())\n\n\trouter.GET(\"/ping\", func(c *gin.Context) {\n\t\tc.String(200, \"pong\")\n\t})\n\n\trouter.Run(\":8080\")\n}\n```\n\n**Sample Output**\n```\n::1 - [Fri, 07 Dec 2018 17:04:38 JST] \"GET /ping HTTP/1.1 200 122.767µs \"Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/71.0.3578.80 Safari/537.36\" \"\n```\n\n### Controlling Log output coloring \n\nBy default, logs output on console should be colorized depending on the detected TTY.\n\nNever colorize logs: \n\n```go\nfunc main() {\n // Disable log's color\n gin.DisableConsoleColor()\n \n // Creates a gin router with default middleware:\n // logger and recovery (crash-free) middleware\n router := gin.Default()\n \n router.GET(\"/ping\", func(c *gin.Context) {\n c.String(200, \"pong\")\n })\n \n router.Run(\":8080\")\n}\n```\n\nAlways colorize logs: \n\n```go\nfunc main() {\n // Force log's color\n gin.ForceConsoleColor()\n \n // Creates a gin router with default middleware:\n // logger and recovery (crash-free) middleware\n router := gin.Default()\n \n router.GET(\"/ping\", func(c *gin.Context) {\n c.String(200, \"pong\")\n })\n \n router.Run(\":8080\")\n}\n```\n\n### Model binding and validation\n\nTo bind a request body into a type, use model binding. We currently support binding of JSON, XML, YAML and standard form values (foo=bar&boo=baz).\n\nGin uses [**go-playground/validator.v8**](https://github.com/go-playground/validator) for validation. Check the full docs on tags usage [here](http://godoc.org/gopkg.in/go-playground/validator.v8#hdr-Baked_In_Validators_and_Tags).\n\nNote that you need to set the corresponding binding tag on all fields you want to bind. For example, when binding from JSON, set `json:\"fieldname\"`.\n\nAlso, Gin provides two sets of methods for binding:\n- **Type** - Must bind\n - **Methods** - `Bind`, `BindJSON`, `BindXML`, `BindQuery`, `BindYAML`\n - **Behavior** - These methods use `MustBindWith` under the hood. If there is a binding error, the request is aborted with `c.AbortWithError(400, err).SetType(ErrorTypeBind)`. This sets the response status code to 400 and the `Content-Type` header is set to `text/plain; charset=utf-8`. Note that if you try to set the response code after this, it will result in a warning `[GIN-debug] [WARNING] Headers were already written. Wanted to override status code 400 with 422`. If you wish to have greater control over the behavior, consider using the `ShouldBind` equivalent method.\n- **Type** - Should bind\n - **Methods** - `ShouldBind`, `ShouldBindJSON`, `ShouldBindXML`, `ShouldBindQuery`, `ShouldBindYAML`\n - **Behavior** - These methods use `ShouldBindWith` under the hood. If there is a binding error, the error is returned and it is the developer's responsibility to handle the request and error appropriately.\n\nWhen using the Bind-method, Gin tries to infer the binder depending on the Content-Type header. If you are sure what you are binding, you can use `MustBindWith` or `ShouldBindWith`.\n\nYou can also specify that specific fields are required. If a field is decorated with `binding:\"required\"` and has a empty value when binding, an error will be returned.\n\n```go\n// Binding from JSON\ntype Login struct {\n\tUser string `form:\"user\" json:\"user\" xml:\"user\" binding:\"required\"`\n\tPassword string `form:\"password\" json:\"password\" xml:\"password\" binding:\"required\"`\n}\n\nfunc main() {\n\trouter := gin.Default()\n\n\t// Example for binding JSON ({\"user\": \"manu\", \"password\": \"123\"})\n\trouter.POST(\"/loginJSON\", func(c *gin.Context) {\n\t\tvar json Login\n\t\tif err := c.ShouldBindJSON(&json); err != nil {\n\t\t\tc.JSON(http.StatusBadRequest, gin.H{\"error\": err.Error()})\n\t\t\treturn\n\t\t}\n\t\t\n\t\tif json.User != \"manu\" || json.Password != \"123\" {\n\t\t\tc.JSON(http.StatusUnauthorized, gin.H{\"status\": \"unauthorized\"})\n\t\t\treturn\n\t\t} \n\t\t\n\t\tc.JSON(http.StatusOK, gin.H{\"status\": \"you are logged in\"})\n\t})\n\n\t// Example for binding XML (\n\t//\t\n\t//\t\n\t//\t\tuser\n\t//\t\t123\n\t//\t)\n\trouter.POST(\"/loginXML\", func(c *gin.Context) {\n\t\tvar xml Login\n\t\tif err := c.ShouldBindXML(&xml); err != nil {\n\t\t\tc.JSON(http.StatusBadRequest, gin.H{\"error\": err.Error()})\n\t\t\treturn\n\t\t}\n\t\t\n\t\tif xml.User != \"manu\" || xml.Password != \"123\" {\n\t\t\tc.JSON(http.StatusUnauthorized, gin.H{\"status\": \"unauthorized\"})\n\t\t\treturn\n\t\t} \n\t\t\n\t\tc.JSON(http.StatusOK, gin.H{\"status\": \"you are logged in\"})\n\t})\n\n\t// Example for binding a HTML form (user=manu&password=123)\n\trouter.POST(\"/loginForm\", func(c *gin.Context) {\n\t\tvar form Login\n\t\t// This will infer what binder to use depending on the content-type header.\n\t\tif err := c.ShouldBind(&form); err != nil {\n\t\t\tc.JSON(http.StatusBadRequest, gin.H{\"error\": err.Error()})\n\t\t\treturn\n\t\t}\n\t\t\n\t\tif form.User != \"manu\" || form.Password != \"123\" {\n\t\t\tc.JSON(http.StatusUnauthorized, gin.H{\"status\": \"unauthorized\"})\n\t\t\treturn\n\t\t} \n\t\t\n\t\tc.JSON(http.StatusOK, gin.H{\"status\": \"you are logged in\"})\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\trouter.Run(\":8080\")\n}\n```\n\n**Sample request**\n```shell\n$ curl -v -X POST \\\n http://localhost:8080/loginJSON \\\n -H 'content-type: application/json' \\\n -d '{ \"user\": \"manu\" }'\n> POST /loginJSON HTTP/1.1\n> Host: localhost:8080\n> User-Agent: curl/7.51.0\n> Accept: */*\n> content-type: application/json\n> Content-Length: 18\n>\n* upload completely sent off: 18 out of 18 bytes\n< HTTP/1.1 400 Bad Request\n< Content-Type: application/json; charset=utf-8\n< Date: Fri, 04 Aug 2017 03:51:31 GMT\n< Content-Length: 100\n<\n{\"error\":\"Key: 'Login.Password' Error:Field validation for 'Password' failed on the 'required' tag\"}\n```\n\n**Skip validate**\n\nWhen running the above example using the above the `curl` command, it returns error. Because the example use `binding:\"required\"` for `Password`. If use `binding:\"-\"` for `Password`, then it will not return error when running the above example again.\n\n### Custom Validators\n\nIt is also possible to register custom validators. See the [example code](https://github.com/gin-gonic/examples/tree/master/custom-validation/server.go).\n\n```go\npackage main\n\nimport (\n\t\"net/http\"\n\t\"reflect\"\n\t\"time\"\n\n\t\"github.com/gin-gonic/gin\"\n\t\"github.com/gin-gonic/gin/binding\"\n\t\"gopkg.in/go-playground/validator.v8\"\n)\n\n// Booking contains binded and validated data.\ntype Booking struct {\n\tCheckIn time.Time `form:\"check_in\" binding:\"required,bookabledate\" time_format:\"2006-01-02\"`\n\tCheckOut time.Time `form:\"check_out\" binding:\"required,gtfield=CheckIn\" time_format:\"2006-01-02\"`\n}\n\nfunc bookableDate(\n\tv *validator.Validate, topStruct reflect.Value, currentStructOrField reflect.Value,\n\tfield reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string,\n) bool {\n\tif date, ok := field.Interface().(time.Time); ok {\n\t\ttoday := time.Now()\n\t\tif today.Year() > date.Year() || today.YearDay() > date.YearDay() {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfunc main() {\n\troute := gin.Default()\n\n\tif v, ok := binding.Validator.Engine().(*validator.Validate); ok {\n\t\tv.RegisterValidation(\"bookabledate\", bookableDate)\n\t}\n\n\troute.GET(\"/bookable\", getBookable)\n\troute.Run(\":8085\")\n}\n\nfunc getBookable(c *gin.Context) {\n\tvar b Booking\n\tif err := c.ShouldBindWith(&b, binding.Query); err == nil {\n\t\tc.JSON(http.StatusOK, gin.H{\"message\": \"Booking dates are valid!\"})\n\t} else {\n\t\tc.JSON(http.StatusBadRequest, gin.H{\"error\": err.Error()})\n\t}\n}\n```\n\n```console\n$ curl \"localhost:8085/bookable?check_in=2018-04-16&check_out=2018-04-17\"\n{\"message\":\"Booking dates are valid!\"}\n\n$ curl \"localhost:8085/bookable?check_in=2018-03-08&check_out=2018-03-09\"\n{\"error\":\"Key: 'Booking.CheckIn' Error:Field validation for 'CheckIn' failed on the 'bookabledate' tag\"}\n```\n\n[Struct level validations](https://github.com/go-playground/validator/releases/tag/v8.7) can also be registered this way.\nSee the [struct-lvl-validation example](https://github.com/gin-gonic/examples/tree/master/struct-lvl-validations) to learn more.\n\n### Only Bind Query String\n\n`ShouldBindQuery` function only binds the query params and not the post data. See the [detail information](https://github.com/gin-gonic/gin/issues/742#issuecomment-315953017).\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\n\t\"github.com/gin-gonic/gin\"\n)\n\ntype Person struct {\n\tName string `form:\"name\"`\n\tAddress string `form:\"address\"`\n}\n\nfunc main() {\n\troute := gin.Default()\n\troute.Any(\"/testing\", startPage)\n\troute.Run(\":8085\")\n}\n\nfunc startPage(c *gin.Context) {\n\tvar person Person\n\tif c.ShouldBindQuery(&person) == nil {\n\t\tlog.Println(\"====== Only Bind By Query String ======\")\n\t\tlog.Println(person.Name)\n\t\tlog.Println(person.Address)\n\t}\n\tc.String(200, \"Success\")\n}\n\n```\n\n### Bind Query String or Post Data\n\nSee the [detail information](https://github.com/gin-gonic/gin/issues/742#issuecomment-264681292).\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\t\"time\"\n\n\t\"github.com/gin-gonic/gin\"\n)\n\ntype Person struct {\n\tName string `form:\"name\"`\n\tAddress string `form:\"address\"`\n\tBirthday time.Time `form:\"birthday\" time_format:\"2006-01-02\" time_utc:\"1\"`\n}\n\nfunc main() {\n\troute := gin.Default()\n\troute.GET(\"/testing\", startPage)\n\troute.Run(\":8085\")\n}\n\nfunc startPage(c *gin.Context) {\n\tvar person Person\n\t// If `GET`, only `Form` binding engine (`query`) used.\n\t// If `POST`, first checks the `content-type` for `JSON` or `XML`, then uses `Form` (`form-data`).\n\t// See more at https://github.com/gin-gonic/gin/blob/master/binding/binding.go#L48\n\tif c.ShouldBind(&person) == nil {\n\t\tlog.Println(person.Name)\n\t\tlog.Println(person.Address)\n\t\tlog.Println(person.Birthday)\n\t}\n\n\tc.String(200, \"Success\")\n}\n```\n\nTest it with:\n```sh\n$ curl -X GET \"localhost:8085/testing?name=appleboy&address=xyz&birthday=1992-03-15\"\n```\n\n### Bind Uri\n\nSee the [detail information](https://github.com/gin-gonic/gin/issues/846).\n\n```go\npackage main\n\nimport \"github.com/gin-gonic/gin\"\n\ntype Person struct {\n\tID string `uri:\"id\" binding:\"required,uuid\"`\n\tName string `uri:\"name\" binding:\"required\"`\n}\n\nfunc main() {\n\troute := gin.Default()\n\troute.GET(\"/:name/:id\", func(c *gin.Context) {\n\t\tvar person Person\n\t\tif err := c.ShouldBindUri(&person); err != nil {\n\t\t\tc.JSON(400, gin.H{\"msg\": err})\n\t\t\treturn\n\t\t}\n\t\tc.JSON(200, gin.H{\"name\": person.Name, \"uuid\": person.ID})\n\t})\n\troute.Run(\":8088\")\n}\n```\n\nTest it with:\n```sh\n$ curl -v localhost:8088/thinkerou/987fbc97-4bed-5078-9f07-9141ba07c9f3\n$ curl -v localhost:8088/thinkerou/not-uuid\n```\n\n### Bind HTML checkboxes\n\nSee the [detail information](https://github.com/gin-gonic/gin/issues/129#issuecomment-124260092)\n\nmain.go\n\n```go\n...\n\ntype myForm struct {\n Colors []string `form:\"colors[]\"`\n}\n\n...\n\nfunc formHandler(c *gin.Context) {\n var fakeForm myForm\n c.ShouldBind(&fakeForm)\n c.JSON(200, gin.H{\"color\": fakeForm.Colors})\n}\n\n...\n\n```\n\nform.html\n\n```html\n
\n

Check some colors

\n \n \n \n \n \n \n \n\n```\n\nresult:\n\n```\n{\"color\":[\"red\",\"green\",\"blue\"]}\n```\n\n### Multipart/Urlencoded binding\n\n```go\npackage main\n\nimport (\n\t\"github.com/gin-gonic/gin\"\n)\n\ntype LoginForm struct {\n\tUser string `form:\"user\" binding:\"required\"`\n\tPassword string `form:\"password\" binding:\"required\"`\n}\n\nfunc main() {\n\trouter := gin.Default()\n\trouter.POST(\"/login\", func(c *gin.Context) {\n\t\t// you can bind multipart form with explicit binding declaration:\n\t\t// c.ShouldBindWith(&form, binding.Form)\n\t\t// or you can simply use autobinding with ShouldBind method:\n\t\tvar form LoginForm\n\t\t// in this case proper binding will be automatically selected\n\t\tif c.ShouldBind(&form) == nil {\n\t\t\tif form.User == \"user\" && form.Password == \"password\" {\n\t\t\t\tc.JSON(200, gin.H{\"status\": \"you are logged in\"})\n\t\t\t} else {\n\t\t\t\tc.JSON(401, gin.H{\"status\": \"unauthorized\"})\n\t\t\t}\n\t\t}\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\nTest it with:\n```sh\n$ curl -v --form user=user --form password=password http://localhost:8080/login\n```\n\n### XML, JSON, YAML and ProtoBuf rendering\n\n```go\nfunc main() {\n\tr := gin.Default()\n\n\t// gin.H is a shortcut for map[string]interface{}\n\tr.GET(\"/someJSON\", func(c *gin.Context) {\n\t\tc.JSON(http.StatusOK, gin.H{\"message\": \"hey\", \"status\": http.StatusOK})\n\t})\n\n\tr.GET(\"/moreJSON\", func(c *gin.Context) {\n\t\t// You also can use a struct\n\t\tvar msg struct {\n\t\t\tName string `json:\"user\"`\n\t\t\tMessage string\n\t\t\tNumber int\n\t\t}\n\t\tmsg.Name = \"Lena\"\n\t\tmsg.Message = \"hey\"\n\t\tmsg.Number = 123\n\t\t// Note that msg.Name becomes \"user\" in the JSON\n\t\t// Will output : {\"user\": \"Lena\", \"Message\": \"hey\", \"Number\": 123}\n\t\tc.JSON(http.StatusOK, msg)\n\t})\n\n\tr.GET(\"/someXML\", func(c *gin.Context) {\n\t\tc.XML(http.StatusOK, gin.H{\"message\": \"hey\", \"status\": http.StatusOK})\n\t})\n\n\tr.GET(\"/someYAML\", func(c *gin.Context) {\n\t\tc.YAML(http.StatusOK, gin.H{\"message\": \"hey\", \"status\": http.StatusOK})\n\t})\n\n\tr.GET(\"/someProtoBuf\", func(c *gin.Context) {\n\t\treps := []int64{int64(1), int64(2)}\n\t\tlabel := \"test\"\n\t\t// The specific definition of protobuf is written in the testdata/protoexample file.\n\t\tdata := &protoexample.Test{\n\t\t\tLabel: &label,\n\t\t\tReps: reps,\n\t\t}\n\t\t// Note that data becomes binary data in the response\n\t\t// Will output protoexample.Test protobuf serialized data\n\t\tc.ProtoBuf(http.StatusOK, data)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n#### SecureJSON\n\nUsing SecureJSON to prevent json hijacking. Default prepends `\"while(1),\"` to response body if the given struct is array values.\n\n```go\nfunc main() {\n\tr := gin.Default()\n\n\t// You can also use your own secure json prefix\n\t// r.SecureJsonPrefix(\")]}',\\n\")\n\n\tr.GET(\"/someJSON\", func(c *gin.Context) {\n\t\tnames := []string{\"lena\", \"austin\", \"foo\"}\n\n\t\t// Will output : while(1);[\"lena\",\"austin\",\"foo\"]\n\t\tc.SecureJSON(http.StatusOK, names)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n#### JSONP\n\nUsing JSONP to request data from a server in a different domain. Add callback to response body if the query parameter callback exists.\n\n```go\nfunc main() {\n\tr := gin.Default()\n\n\tr.GET(\"/JSONP?callback=x\", func(c *gin.Context) {\n\t\tdata := map[string]interface{}{\n\t\t\t\"foo\": \"bar\",\n\t\t}\n\t\t\n\t\t//callback is x\n\t\t// Will output : x({\\\"foo\\\":\\\"bar\\\"})\n\t\tc.JSONP(http.StatusOK, data)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n#### AsciiJSON\n\nUsing AsciiJSON to Generates ASCII-only JSON with escaped non-ASCII chracters.\n\n```go\nfunc main() {\n\tr := gin.Default()\n\n\tr.GET(\"/someJSON\", func(c *gin.Context) {\n\t\tdata := map[string]interface{}{\n\t\t\t\"lang\": \"GO语言\",\n\t\t\t\"tag\": \"
\",\n\t\t}\n\n\t\t// will output : {\"lang\":\"GO\\u8bed\\u8a00\",\"tag\":\"\\u003cbr\\u003e\"}\n\t\tc.AsciiJSON(http.StatusOK, data)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n#### PureJSON\n\nNormally, JSON replaces special HTML characters with their unicode entities, e.g. `<` becomes `\\u003c`. If you want to encode such characters literally, you can use PureJSON instead.\nThis feature is unavailable in Go 1.6 and lower.\n\n```go\nfunc main() {\n\tr := gin.Default()\n\t\n\t// Serves unicode entities\n\tr.GET(\"/json\", func(c *gin.Context) {\n\t\tc.JSON(200, gin.H{\n\t\t\t\"html\": \"Hello, world!\",\n\t\t})\n\t})\n\t\n\t// Serves literal characters\n\tr.GET(\"/purejson\", func(c *gin.Context) {\n\t\tc.PureJSON(200, gin.H{\n\t\t\t\"html\": \"Hello, world!\",\n\t\t})\n\t})\n\t\n\t// listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n### Serving static files\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\trouter.Static(\"/assets\", \"./assets\")\n\trouter.StaticFS(\"/more_static\", http.Dir(\"my_file_system\"))\n\trouter.StaticFile(\"/favicon.ico\", \"./resources/favicon.ico\")\n\n\t// Listen and serve on 0.0.0.0:8080\n\trouter.Run(\":8080\")\n}\n```\n\n### Serving data from reader\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\trouter.GET(\"/someDataFromReader\", func(c *gin.Context) {\n\t\tresponse, err := http.Get(\"https://raw.githubusercontent.com/gin-gonic/logo/master/color.png\")\n\t\tif err != nil || response.StatusCode != http.StatusOK {\n\t\t\tc.Status(http.StatusServiceUnavailable)\n\t\t\treturn\n\t\t}\n\n\t\treader := response.Body\n\t\tcontentLength := response.ContentLength\n\t\tcontentType := response.Header.Get(\"Content-Type\")\n\n\t\textraHeaders := map[string]string{\n\t\t\t\"Content-Disposition\": `attachment; filename=\"gopher.png\"`,\n\t\t}\n\n\t\tc.DataFromReader(http.StatusOK, contentLength, contentType, reader, extraHeaders)\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\n### HTML rendering\n\nUsing LoadHTMLGlob() or LoadHTMLFiles()\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\trouter.LoadHTMLGlob(\"templates/*\")\n\t//router.LoadHTMLFiles(\"templates/template1.html\", \"templates/template2.html\")\n\trouter.GET(\"/index\", func(c *gin.Context) {\n\t\tc.HTML(http.StatusOK, \"index.tmpl\", gin.H{\n\t\t\t\"title\": \"Main website\",\n\t\t})\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\ntemplates/index.tmpl\n\n```html\n\n\t

\n\t\t{{ .title }}\n\t

\n\n```\n\nUsing templates with same name in different directories\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\trouter.LoadHTMLGlob(\"templates/**/*\")\n\trouter.GET(\"/posts/index\", func(c *gin.Context) {\n\t\tc.HTML(http.StatusOK, \"posts/index.tmpl\", gin.H{\n\t\t\t\"title\": \"Posts\",\n\t\t})\n\t})\n\trouter.GET(\"/users/index\", func(c *gin.Context) {\n\t\tc.HTML(http.StatusOK, \"users/index.tmpl\", gin.H{\n\t\t\t\"title\": \"Users\",\n\t\t})\n\t})\n\trouter.Run(\":8080\")\n}\n```\n\ntemplates/posts/index.tmpl\n\n```html\n{{ define \"posts/index.tmpl\" }}\n

\n\t{{ .title }}\n

\n

Using posts/index.tmpl

\n\n{{ end }}\n```\n\ntemplates/users/index.tmpl\n\n```html\n{{ define \"users/index.tmpl\" }}\n

\n\t{{ .title }}\n

\n

Using users/index.tmpl

\n\n{{ end }}\n```\n\n#### Custom Template renderer\n\nYou can also use your own html template render\n\n```go\nimport \"html/template\"\n\nfunc main() {\n\trouter := gin.Default()\n\thtml := template.Must(template.ParseFiles(\"file1\", \"file2\"))\n\trouter.SetHTMLTemplate(html)\n\trouter.Run(\":8080\")\n}\n```\n\n#### Custom Delimiters\n\nYou may use custom delims\n\n```go\n\tr := gin.Default()\n\tr.Delims(\"{[{\", \"}]}\")\n\tr.LoadHTMLGlob(\"/path/to/templates\")\n```\n\n#### Custom Template Funcs\n\nSee the detail [example code](https://github.com/gin-gonic/examples/tree/master/template).\n\nmain.go\n\n```go\nimport (\n \"fmt\"\n \"html/template\"\n \"net/http\"\n \"time\"\n\n \"github.com/gin-gonic/gin\"\n)\n\nfunc formatAsDate(t time.Time) string {\n year, month, day := t.Date()\n return fmt.Sprintf(\"%d%02d/%02d\", year, month, day)\n}\n\nfunc main() {\n router := gin.Default()\n router.Delims(\"{[{\", \"}]}\")\n router.SetFuncMap(template.FuncMap{\n \"formatAsDate\": formatAsDate,\n })\n router.LoadHTMLFiles(\"./testdata/template/raw.tmpl\")\n\n router.GET(\"/raw\", func(c *gin.Context) {\n c.HTML(http.StatusOK, \"raw.tmpl\", map[string]interface{}{\n \"now\": time.Date(2017, 07, 01, 0, 0, 0, 0, time.UTC),\n })\n })\n\n router.Run(\":8080\")\n}\n\n```\n\nraw.tmpl\n\n```html\nDate: {[{.now | formatAsDate}]}\n```\n\nResult:\n```\nDate: 2017/07/01\n```\n\n### Multitemplate\n\nGin allow by default use only one html.Template. Check [a multitemplate render](https://github.com/gin-contrib/multitemplate) for using features like go 1.6 `block template`.\n\n### Redirects\n\nIssuing a HTTP redirect is easy. Both internal and external locations are supported.\n\n```go\nr.GET(\"/test\", func(c *gin.Context) {\n\tc.Redirect(http.StatusMovedPermanently, \"http://www.google.com/\")\n})\n```\n\n\nIssuing a Router redirect, use `HandleContext` like below.\n\n``` go\nr.GET(\"/test\", func(c *gin.Context) {\n c.Request.URL.Path = \"/test2\"\n r.HandleContext(c)\n})\nr.GET(\"/test2\", func(c *gin.Context) {\n c.JSON(200, gin.H{\"hello\": \"world\"})\n})\n```\n\n\n### Custom Middleware\n\n```go\nfunc Logger() gin.HandlerFunc {\n\treturn func(c *gin.Context) {\n\t\tt := time.Now()\n\n\t\t// Set example variable\n\t\tc.Set(\"example\", \"12345\")\n\n\t\t// before request\n\n\t\tc.Next()\n\n\t\t// after request\n\t\tlatency := time.Since(t)\n\t\tlog.Print(latency)\n\n\t\t// access the status we are sending\n\t\tstatus := c.Writer.Status()\n\t\tlog.Println(status)\n\t}\n}\n\nfunc main() {\n\tr := gin.New()\n\tr.Use(Logger())\n\n\tr.GET(\"/test\", func(c *gin.Context) {\n\t\texample := c.MustGet(\"example\").(string)\n\n\t\t// it would print: \"12345\"\n\t\tlog.Println(example)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n### Using BasicAuth() middleware\n\n```go\n// simulate some private data\nvar secrets = gin.H{\n\t\"foo\": gin.H{\"email\": \"foo@bar.com\", \"phone\": \"123433\"},\n\t\"austin\": gin.H{\"email\": \"austin@example.com\", \"phone\": \"666\"},\n\t\"lena\": gin.H{\"email\": \"lena@guapa.com\", \"phone\": \"523443\"},\n}\n\nfunc main() {\n\tr := gin.Default()\n\n\t// Group using gin.BasicAuth() middleware\n\t// gin.Accounts is a shortcut for map[string]string\n\tauthorized := r.Group(\"/admin\", gin.BasicAuth(gin.Accounts{\n\t\t\"foo\": \"bar\",\n\t\t\"austin\": \"1234\",\n\t\t\"lena\": \"hello2\",\n\t\t\"manu\": \"4321\",\n\t}))\n\n\t// /admin/secrets endpoint\n\t// hit \"localhost:8080/admin/secrets\n\tauthorized.GET(\"/secrets\", func(c *gin.Context) {\n\t\t// get user, it was set by the BasicAuth middleware\n\t\tuser := c.MustGet(gin.AuthUserKey).(string)\n\t\tif secret, ok := secrets[user]; ok {\n\t\t\tc.JSON(http.StatusOK, gin.H{\"user\": user, \"secret\": secret})\n\t\t} else {\n\t\t\tc.JSON(http.StatusOK, gin.H{\"user\": user, \"secret\": \"NO SECRET :(\"})\n\t\t}\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n### Goroutines inside a middleware\n\nWhen starting new Goroutines inside a middleware or handler, you **SHOULD NOT** use the original context inside it, you have to use a read-only copy.\n\n```go\nfunc main() {\n\tr := gin.Default()\n\n\tr.GET(\"/long_async\", func(c *gin.Context) {\n\t\t// create copy to be used inside the goroutine\n\t\tcCp := c.Copy()\n\t\tgo func() {\n\t\t\t// simulate a long task with time.Sleep(). 5 seconds\n\t\t\ttime.Sleep(5 * time.Second)\n\n\t\t\t// note that you are using the copied context \"cCp\", IMPORTANT\n\t\t\tlog.Println(\"Done! in path \" + cCp.Request.URL.Path)\n\t\t}()\n\t})\n\n\tr.GET(\"/long_sync\", func(c *gin.Context) {\n\t\t// simulate a long task with time.Sleep(). 5 seconds\n\t\ttime.Sleep(5 * time.Second)\n\n\t\t// since we are NOT using a goroutine, we do not have to copy the context\n\t\tlog.Println(\"Done! in path \" + c.Request.URL.Path)\n\t})\n\n\t// Listen and serve on 0.0.0.0:8080\n\tr.Run(\":8080\")\n}\n```\n\n### Custom HTTP configuration\n\nUse `http.ListenAndServe()` directly, like this:\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\thttp.ListenAndServe(\":8080\", router)\n}\n```\nor\n\n```go\nfunc main() {\n\trouter := gin.Default()\n\n\ts := &http.Server{\n\t\tAddr: \":8080\",\n\t\tHandler: router,\n\t\tReadTimeout: 10 * time.Second,\n\t\tWriteTimeout: 10 * time.Second,\n\t\tMaxHeaderBytes: 1 << 20,\n\t}\n\ts.ListenAndServe()\n}\n```\n\n### Support Let's Encrypt\n\nexample for 1-line LetsEncrypt HTTPS servers.\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\n\t\"github.com/gin-gonic/autotls\"\n\t\"github.com/gin-gonic/gin\"\n)\n\nfunc main() {\n\tr := gin.Default()\n\n\t// Ping handler\n\tr.GET(\"/ping\", func(c *gin.Context) {\n\t\tc.String(200, \"pong\")\n\t})\n\n\tlog.Fatal(autotls.Run(r, \"example1.com\", \"example2.com\"))\n}\n```\n\nexample for custom autocert manager.\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\n\t\"github.com/gin-gonic/autotls\"\n\t\"github.com/gin-gonic/gin\"\n\t\"golang.org/x/crypto/acme/autocert\"\n)\n\nfunc main() {\n\tr := gin.Default()\n\n\t// Ping handler\n\tr.GET(\"/ping\", func(c *gin.Context) {\n\t\tc.String(200, \"pong\")\n\t})\n\n\tm := autocert.Manager{\n\t\tPrompt: autocert.AcceptTOS,\n\t\tHostPolicy: autocert.HostWhitelist(\"example1.com\", \"example2.com\"),\n\t\tCache: autocert.DirCache(\"/var/www/.cache\"),\n\t}\n\n\tlog.Fatal(autotls.RunWithManager(r, &m))\n}\n```\n\n### Run multiple service using Gin\n\nSee the [question](https://github.com/gin-gonic/gin/issues/346) and try the following example:\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\t\"net/http\"\n\t\"time\"\n\n\t\"github.com/gin-gonic/gin\"\n\t\"golang.org/x/sync/errgroup\"\n)\n\nvar (\n\tg errgroup.Group\n)\n\nfunc router01() http.Handler {\n\te := gin.New()\n\te.Use(gin.Recovery())\n\te.GET(\"/\", func(c *gin.Context) {\n\t\tc.JSON(\n\t\t\thttp.StatusOK,\n\t\t\tgin.H{\n\t\t\t\t\"code\": http.StatusOK,\n\t\t\t\t\"error\": \"Welcome server 01\",\n\t\t\t},\n\t\t)\n\t})\n\n\treturn e\n}\n\nfunc router02() http.Handler {\n\te := gin.New()\n\te.Use(gin.Recovery())\n\te.GET(\"/\", func(c *gin.Context) {\n\t\tc.JSON(\n\t\t\thttp.StatusOK,\n\t\t\tgin.H{\n\t\t\t\t\"code\": http.StatusOK,\n\t\t\t\t\"error\": \"Welcome server 02\",\n\t\t\t},\n\t\t)\n\t})\n\n\treturn e\n}\n\nfunc main() {\n\tserver01 := &http.Server{\n\t\tAddr: \":8080\",\n\t\tHandler: router01(),\n\t\tReadTimeout: 5 * time.Second,\n\t\tWriteTimeout: 10 * time.Second,\n\t}\n\n\tserver02 := &http.Server{\n\t\tAddr: \":8081\",\n\t\tHandler: router02(),\n\t\tReadTimeout: 5 * time.Second,\n\t\tWriteTimeout: 10 * time.Second,\n\t}\n\n\tg.Go(func() error {\n\t\treturn server01.ListenAndServe()\n\t})\n\n\tg.Go(func() error {\n\t\treturn server02.ListenAndServe()\n\t})\n\n\tif err := g.Wait(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n```\n\n### Graceful restart or stop\n\nDo you want to graceful restart or stop your web server?\nThere are some ways this can be done.\n\nWe can use [fvbock/endless](https://github.com/fvbock/endless) to replace the default `ListenAndServe`. Refer issue [#296](https://github.com/gin-gonic/gin/issues/296) for more details.\n\n```go\nrouter := gin.Default()\nrouter.GET(\"/\", handler)\n// [...]\nendless.ListenAndServe(\":4242\", router)\n```\n\nAn alternative to endless:\n\n* [manners](https://github.com/braintree/manners): A polite Go HTTP server that shuts down gracefully.\n* [graceful](https://github.com/tylerb/graceful): Graceful is a Go package enabling graceful shutdown of an http.Handler server.\n* [grace](https://github.com/facebookgo/grace): Graceful restart & zero downtime deploy for Go servers.\n\nIf you are using Go 1.8, you may not need to use this library! Consider using http.Server's built-in [Shutdown()](https://golang.org/pkg/net/http/#Server.Shutdown) method for graceful shutdowns. See the full [graceful-shutdown](https://github.com/gin-gonic/examples/tree/master/graceful-shutdown) example with gin.\n\n```go\n// +build go1.8\n\npackage main\n\nimport (\n\t\"context\"\n\t\"log\"\n\t\"net/http\"\n\t\"os\"\n\t\"os/signal\"\n\t\"syscall\"\n\t\"time\"\n\n\t\"github.com/gin-gonic/gin\"\n)\n\nfunc main() {\n\trouter := gin.Default()\n\trouter.GET(\"/\", func(c *gin.Context) {\n\t\ttime.Sleep(5 * time.Second)\n\t\tc.String(http.StatusOK, \"Welcome Gin Server\")\n\t})\n\n\tsrv := &http.Server{\n\t\tAddr: \":8080\",\n\t\tHandler: router,\n\t}\n\n\tgo func() {\n\t\t// service connections\n\t\tif err := srv.ListenAndServe(); err != nil && err != http.ErrServerClosed {\n\t\t\tlog.Fatalf(\"listen: %s\\n\", err)\n\t\t}\n\t}()\n\n\t// Wait for interrupt signal to gracefully shutdown the server with\n\t// a timeout of 5 seconds.\n\tquit := make(chan os.Signal)\n\t// kill (no param) default send syscall.SIGTERM\n\t// kill -2 is syscall.SIGINT\n\t// kill -9 is syscall.SIGKILL but can\"t be catch, so don't need add it\n\tsignal.Notify(quit, syscall.SIGINT, syscall.SIGTERM)\n\t<-quit\n\tlog.Println(\"Shutdown Server ...\")\n\n\tctx, cancel := context.WithTimeout(context.Background(), 5*time.Second)\n\tdefer cancel()\n\tif err := srv.Shutdown(ctx); err != nil {\n\t\tlog.Fatal(\"Server Shutdown:\", err)\n\t}\n\t// catching ctx.Done(). timeout of 5 seconds.\n\tselect {\n\tcase <-ctx.Done():\n\t\tlog.Println(\"timeout of 5 seconds.\")\n\t}\n\tlog.Println(\"Server exiting\")\n}\n```\n\n### Build a single binary with templates\n\nYou can build a server into a single binary containing templates by using [go-assets][].\n\n[go-assets]: https://github.com/jessevdk/go-assets\n\n```go\nfunc main() {\n\tr := gin.New()\n\n\tt, err := loadTemplate()\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tr.SetHTMLTemplate(t)\n\n\tr.GET(\"/\", func(c *gin.Context) {\n\t\tc.HTML(http.StatusOK, \"/html/index.tmpl\",nil)\n\t})\n\tr.Run(\":8080\")\n}\n\n// loadTemplate loads templates embedded by go-assets-builder\nfunc loadTemplate() (*template.Template, error) {\n\tt := template.New(\"\")\n\tfor name, file := range Assets.Files {\n\t\tif file.IsDir() || !strings.HasSuffix(name, \".tmpl\") {\n\t\t\tcontinue\n\t\t}\n\t\th, err := ioutil.ReadAll(file)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tt, err = t.New(name).Parse(string(h))\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn t, nil\n}\n```\n\nSee a complete example in the `https://github.com/gin-gonic/examples/tree/master/assets-in-binary` directory.\n\n### Bind form-data request with custom struct\n\nThe follow example using custom struct:\n\n```go\ntype StructA struct {\n FieldA string `form:\"field_a\"`\n}\n\ntype StructB struct {\n NestedStruct StructA\n FieldB string `form:\"field_b\"`\n}\n\ntype StructC struct {\n NestedStructPointer *StructA\n FieldC string `form:\"field_c\"`\n}\n\ntype StructD struct {\n NestedAnonyStruct struct {\n FieldX string `form:\"field_x\"`\n }\n FieldD string `form:\"field_d\"`\n}\n\nfunc GetDataB(c *gin.Context) {\n var b StructB\n c.Bind(&b)\n c.JSON(200, gin.H{\n \"a\": b.NestedStruct,\n \"b\": b.FieldB,\n })\n}\n\nfunc GetDataC(c *gin.Context) {\n var b StructC\n c.Bind(&b)\n c.JSON(200, gin.H{\n \"a\": b.NestedStructPointer,\n \"c\": b.FieldC,\n })\n}\n\nfunc GetDataD(c *gin.Context) {\n var b StructD\n c.Bind(&b)\n c.JSON(200, gin.H{\n \"x\": b.NestedAnonyStruct,\n \"d\": b.FieldD,\n })\n}\n\nfunc main() {\n r := gin.Default()\n r.GET(\"/getb\", GetDataB)\n r.GET(\"/getc\", GetDataC)\n r.GET(\"/getd\", GetDataD)\n\n r.Run()\n}\n```\n\nUsing the command `curl` command result:\n\n```\n$ curl \"http://localhost:8080/getb?field_a=hello&field_b=world\"\n{\"a\":{\"FieldA\":\"hello\"},\"b\":\"world\"}\n$ curl \"http://localhost:8080/getc?field_a=hello&field_c=world\"\n{\"a\":{\"FieldA\":\"hello\"},\"c\":\"world\"}\n$ curl \"http://localhost:8080/getd?field_x=hello&field_d=world\"\n{\"d\":\"world\",\"x\":{\"FieldX\":\"hello\"}}\n```\n\n### Try to bind body into different structs\n\nThe normal methods for binding request body consumes `c.Request.Body` and they\ncannot be called multiple times.\n\n```go\ntype formA struct {\n Foo string `json:\"foo\" xml:\"foo\" binding:\"required\"`\n}\n\ntype formB struct {\n Bar string `json:\"bar\" xml:\"bar\" binding:\"required\"`\n}\n\nfunc SomeHandler(c *gin.Context) {\n objA := formA{}\n objB := formB{}\n // This c.ShouldBind consumes c.Request.Body and it cannot be reused.\n if errA := c.ShouldBind(&objA); errA == nil {\n c.String(http.StatusOK, `the body should be formA`)\n // Always an error is occurred by this because c.Request.Body is EOF now.\n } else if errB := c.ShouldBind(&objB); errB == nil {\n c.String(http.StatusOK, `the body should be formB`)\n } else {\n ...\n }\n}\n```\n\nFor this, you can use `c.ShouldBindBodyWith`.\n\n```go\nfunc SomeHandler(c *gin.Context) {\n objA := formA{}\n objB := formB{}\n // This reads c.Request.Body and stores the result into the context.\n if errA := c.ShouldBindBodyWith(&objA, binding.JSON); errA == nil {\n c.String(http.StatusOK, `the body should be formA`)\n // At this time, it reuses body stored in the context.\n } else if errB := c.ShouldBindBodyWith(&objB, binding.JSON); errB == nil {\n c.String(http.StatusOK, `the body should be formB JSON`)\n // And it can accepts other formats\n } else if errB2 := c.ShouldBindBodyWith(&objB, binding.XML); errB2 == nil {\n c.String(http.StatusOK, `the body should be formB XML`)\n } else {\n ...\n }\n}\n```\n\n* `c.ShouldBindBodyWith` stores body into the context before binding. This has\na slight impact to performance, so you should not use this method if you are\nenough to call binding at once.\n* This feature is only needed for some formats -- `JSON`, `XML`, `MsgPack`,\n`ProtoBuf`. For other formats, `Query`, `Form`, `FormPost`, `FormMultipart`,\ncan be called by `c.ShouldBind()` multiple times without any damage to\nperformance (See [#1341](https://github.com/gin-gonic/gin/pull/1341)).\n\n### http2 server push\n\nhttp.Pusher is supported only **go1.8+**. See the [golang blog](https://blog.golang.org/h2push) for detail information.\n\n```go\npackage main\n\nimport (\n\t\"html/template\"\n\t\"log\"\n\n\t\"github.com/gin-gonic/gin\"\n)\n\nvar html = template.Must(template.New(\"https\").Parse(`\n\n\n Https Test\n \n\n\n

Welcome, Ginner!

\n\n\n`))\n\nfunc main() {\n\tr := gin.Default()\n\tr.Static(\"/assets\", \"./assets\")\n\tr.SetHTMLTemplate(html)\n\n\tr.GET(\"/\", func(c *gin.Context) {\n\t\tif pusher := c.Writer.Pusher(); pusher != nil {\n\t\t\t// use pusher.Push() to do server push\n\t\t\tif err := pusher.Push(\"/assets/app.js\", nil); err != nil {\n\t\t\t\tlog.Printf(\"Failed to push: %v\", err)\n\t\t\t}\n\t\t}\n\t\tc.HTML(200, \"https\", gin.H{\n\t\t\t\"status\": \"success\",\n\t\t})\n\t})\n\n\t// Listen and Server in https://127.0.0.1:8080\n\tr.RunTLS(\":8080\", \"./testdata/server.pem\", \"./testdata/server.key\")\n}\n```\n\n### Define format for the log of routes\n\nThe default log of routes is:\n```\n[GIN-debug] POST /foo --> main.main.func1 (3 handlers)\n[GIN-debug] GET /bar --> main.main.func2 (3 handlers)\n[GIN-debug] GET /status --> main.main.func3 (3 handlers)\n```\n\nIf you want to log this information in given format (e.g. JSON, key values or something else), then you can define this format with `gin.DebugPrintRouteFunc`.\nIn the example below, we log all routes with standard log package but you can use another log tools that suits of your needs.\n```go\nimport (\n\t\"log\"\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin\"\n)\n\nfunc main() {\n\tr := gin.Default()\n\tgin.DebugPrintRouteFunc = func(httpMethod, absolutePath, handlerName string, nuHandlers int) {\n\t\tlog.Printf(\"endpoint %v %v %v %v\\n\", httpMethod, absolutePath, handlerName, nuHandlers)\n\t}\n\n\tr.POST(\"/foo\", func(c *gin.Context) {\n\t\tc.JSON(http.StatusOK, \"foo\")\n\t})\n\n\tr.GET(\"/bar\", func(c *gin.Context) {\n\t\tc.JSON(http.StatusOK, \"bar\")\n\t})\n\n\tr.GET(\"/status\", func(c *gin.Context) {\n\t\tc.JSON(http.StatusOK, \"ok\")\n\t})\n\n\t// Listen and Server in http://0.0.0.0:8080\n\tr.Run()\n}\n```\n\n### Set and get a cookie\n\n```go\nimport (\n \"fmt\"\n\n \"github.com/gin-gonic/gin\"\n)\n\nfunc main() {\n\n router := gin.Default()\n\n router.GET(\"/cookie\", func(c *gin.Context) {\n\n cookie, err := c.Cookie(\"gin_cookie\")\n\n if err != nil {\n cookie = \"NotSet\"\n c.SetCookie(\"gin_cookie\", \"test\", 3600, \"/\", \"localhost\", false, true)\n }\n\n fmt.Printf(\"Cookie value: %s \\n\", cookie)\n })\n\n router.Run()\n}\n```\n\n\n## Testing\n\nThe `net/http/httptest` package is preferable way for HTTP testing.\n\n```go\npackage main\n\nfunc setupRouter() *gin.Engine {\n\tr := gin.Default()\n\tr.GET(\"/ping\", func(c *gin.Context) {\n\t\tc.String(200, \"pong\")\n\t})\n\treturn r\n}\n\nfunc main() {\n\tr := setupRouter()\n\tr.Run(\":8080\")\n}\n```\n\nTest for code example above:\n\n```go\npackage main\n\nimport (\n\t\"net/http\"\n\t\"net/http/httptest\"\n\t\"testing\"\n\n\t\"github.com/stretchr/testify/assert\"\n)\n\nfunc TestPingRoute(t *testing.T) {\n\trouter := setupRouter()\n\n\tw := httptest.NewRecorder()\n\treq, _ := http.NewRequest(\"GET\", \"/ping\", nil)\n\trouter.ServeHTTP(w, req)\n\n\tassert.Equal(t, 200, w.Code)\n\tassert.Equal(t, \"pong\", w.Body.String())\n}\n```\n\n## Users\n\nAwesome project lists using [Gin](https://github.com/gin-gonic/gin) web framework.\n\n* [gorush](https://github.com/appleboy/gorush): A push notification server written in Go.\n* [fnproject](https://github.com/fnproject/fn): The container native, cloud agnostic serverless platform.\n* [photoprism](https://github.com/photoprism/photoprism): Personal photo management powered by Go and Google TensorFlow.\n* [krakend](https://github.com/devopsfaith/krakend): Ultra performant API Gateway with middlewares.\n* [picfit](https://github.com/thoas/picfit): An image resizing server written in Go.\n" }, { "path": "vendor/github.com/gin-gonic/gin/auth.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"crypto/subtle\"\n\t\"encoding/base64\"\n\t\"net/http\"\n\t\"strconv\"\n)\n\n// AuthUserKey is the cookie name for user credential in basic auth.\nconst AuthUserKey = \"user\"\n\n// Accounts defines a key/value for user/pass list of authorized logins.\ntype Accounts map[string]string\n\ntype authPair struct {\n\tvalue string\n\tuser string\n}\n\ntype authPairs []authPair\n\nfunc (a authPairs) searchCredential(authValue string) (string, bool) {\n\tif authValue == \"\" {\n\t\treturn \"\", false\n\t}\n\tfor _, pair := range a {\n\t\tif pair.value == authValue {\n\t\t\treturn pair.user, true\n\t\t}\n\t}\n\treturn \"\", false\n}\n\n// BasicAuthForRealm returns a Basic HTTP Authorization middleware. It takes as arguments a map[string]string where\n// the key is the user name and the value is the password, as well as the name of the Realm.\n// If the realm is empty, \"Authorization Required\" will be used by default.\n// (see http://tools.ietf.org/html/rfc2617#section-1.2)\nfunc BasicAuthForRealm(accounts Accounts, realm string) HandlerFunc {\n\tif realm == \"\" {\n\t\trealm = \"Authorization Required\"\n\t}\n\trealm = \"Basic realm=\" + strconv.Quote(realm)\n\tpairs := processAccounts(accounts)\n\treturn func(c *Context) {\n\t\t// Search user in the slice of allowed credentials\n\t\tuser, found := pairs.searchCredential(c.requestHeader(\"Authorization\"))\n\t\tif !found {\n\t\t\t// Credentials doesn't match, we return 401 and abort handlers chain.\n\t\t\tc.Header(\"WWW-Authenticate\", realm)\n\t\t\tc.AbortWithStatus(http.StatusUnauthorized)\n\t\t\treturn\n\t\t}\n\n\t\t// The user credentials was found, set user's id to key AuthUserKey in this context, the user's id can be read later using\n\t\t// c.MustGet(gin.AuthUserKey).\n\t\tc.Set(AuthUserKey, user)\n\t}\n}\n\n// BasicAuth returns a Basic HTTP Authorization middleware. It takes as argument a map[string]string where\n// the key is the user name and the value is the password.\nfunc BasicAuth(accounts Accounts) HandlerFunc {\n\treturn BasicAuthForRealm(accounts, \"\")\n}\n\nfunc processAccounts(accounts Accounts) authPairs {\n\tassert1(len(accounts) > 0, \"Empty list of authorized credentials\")\n\tpairs := make(authPairs, 0, len(accounts))\n\tfor user, password := range accounts {\n\t\tassert1(user != \"\", \"User can not be empty\")\n\t\tvalue := authorizationHeader(user, password)\n\t\tpairs = append(pairs, authPair{\n\t\t\tvalue: value,\n\t\t\tuser: user,\n\t\t})\n\t}\n\treturn pairs\n}\n\nfunc authorizationHeader(user, password string) string {\n\tbase := user + \":\" + password\n\treturn \"Basic \" + base64.StdEncoding.EncodeToString([]byte(base))\n}\n\nfunc secureCompare(given, actual string) bool {\n\tif subtle.ConstantTimeEq(int32(len(given)), int32(len(actual))) == 1 {\n\t\treturn subtle.ConstantTimeCompare([]byte(given), []byte(actual)) == 1\n\t}\n\t// Securely compare actual to itself to keep constant time, but always return false.\n\treturn subtle.ConstantTimeCompare([]byte(actual), []byte(actual)) == 1 && false\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/binding.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport \"net/http\"\n\n// Content-Type MIME of the most common data formats.\nconst (\n\tMIMEJSON = \"application/json\"\n\tMIMEHTML = \"text/html\"\n\tMIMEXML = \"application/xml\"\n\tMIMEXML2 = \"text/xml\"\n\tMIMEPlain = \"text/plain\"\n\tMIMEPOSTForm = \"application/x-www-form-urlencoded\"\n\tMIMEMultipartPOSTForm = \"multipart/form-data\"\n\tMIMEPROTOBUF = \"application/x-protobuf\"\n\tMIMEMSGPACK = \"application/x-msgpack\"\n\tMIMEMSGPACK2 = \"application/msgpack\"\n\tMIMEYAML = \"application/x-yaml\"\n)\n\n// Binding describes the interface which needs to be implemented for binding the\n// data present in the request such as JSON request body, query parameters or\n// the form POST.\ntype Binding interface {\n\tName() string\n\tBind(*http.Request, interface{}) error\n}\n\n// BindingBody adds BindBody method to Binding. BindBody is similar with Bind,\n// but it reads the body from supplied bytes instead of req.Body.\ntype BindingBody interface {\n\tBinding\n\tBindBody([]byte, interface{}) error\n}\n\n// BindingUri adds BindUri method to Binding. BindUri is similar with Bind,\n// but it read the Params.\ntype BindingUri interface {\n\tName() string\n\tBindUri(map[string][]string, interface{}) error\n}\n\n// StructValidator is the minimal interface which needs to be implemented in\n// order for it to be used as the validator engine for ensuring the correctness\n// of the request. Gin provides a default implementation for this using\n// https://github.com/go-playground/validator/tree/v8.18.2.\ntype StructValidator interface {\n\t// ValidateStruct can receive any kind of type and it should never panic, even if the configuration is not right.\n\t// If the received type is not a struct, any validation should be skipped and nil must be returned.\n\t// If the received type is a struct or pointer to a struct, the validation should be performed.\n\t// If the struct is not valid or the validation itself fails, a descriptive error should be returned.\n\t// Otherwise nil must be returned.\n\tValidateStruct(interface{}) error\n\n\t// Engine returns the underlying validator engine which powers the\n\t// StructValidator implementation.\n\tEngine() interface{}\n}\n\n// Validator is the default validator which implements the StructValidator\n// interface. It uses https://github.com/go-playground/validator/tree/v8.18.2\n// under the hood.\nvar Validator StructValidator = &defaultValidator{}\n\n// These implement the Binding interface and can be used to bind the data\n// present in the request to struct instances.\nvar (\n\tJSON = jsonBinding{}\n\tXML = xmlBinding{}\n\tForm = formBinding{}\n\tQuery = queryBinding{}\n\tFormPost = formPostBinding{}\n\tFormMultipart = formMultipartBinding{}\n\tProtoBuf = protobufBinding{}\n\tMsgPack = msgpackBinding{}\n\tYAML = yamlBinding{}\n\tUri = uriBinding{}\n)\n\n// Default returns the appropriate Binding instance based on the HTTP method\n// and the content type.\nfunc Default(method, contentType string) Binding {\n\tif method == \"GET\" {\n\t\treturn Form\n\t}\n\n\tswitch contentType {\n\tcase MIMEJSON:\n\t\treturn JSON\n\tcase MIMEXML, MIMEXML2:\n\t\treturn XML\n\tcase MIMEPROTOBUF:\n\t\treturn ProtoBuf\n\tcase MIMEMSGPACK, MIMEMSGPACK2:\n\t\treturn MsgPack\n\tcase MIMEYAML:\n\t\treturn YAML\n\tcase MIMEMultipartPOSTForm:\n\t\treturn FormMultipart\n\tdefault: // case MIMEPOSTForm:\n\t\treturn Form\n\t}\n}\n\nfunc validate(obj interface{}) error {\n\tif Validator == nil {\n\t\treturn nil\n\t}\n\treturn Validator.ValidateStruct(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/default_validator.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"reflect\"\n\t\"sync\"\n\n\t\"gopkg.in/go-playground/validator.v8\"\n)\n\ntype defaultValidator struct {\n\tonce sync.Once\n\tvalidate *validator.Validate\n}\n\nvar _ StructValidator = &defaultValidator{}\n\n// ValidateStruct receives any kind of type, but only performed struct or pointer to struct type.\nfunc (v *defaultValidator) ValidateStruct(obj interface{}) error {\n\tvalue := reflect.ValueOf(obj)\n\tvalueType := value.Kind()\n\tif valueType == reflect.Ptr {\n\t\tvalueType = value.Elem().Kind()\n\t}\n\tif valueType == reflect.Struct {\n\t\tv.lazyinit()\n\t\tif err := v.validate.Struct(obj); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// Engine returns the underlying validator engine which powers the default\n// Validator instance. This is useful if you want to register custom validations\n// or struct level validations. See validator GoDoc for more info -\n// https://godoc.org/gopkg.in/go-playground/validator.v8\nfunc (v *defaultValidator) Engine() interface{} {\n\tv.lazyinit()\n\treturn v.validate\n}\n\nfunc (v *defaultValidator) lazyinit() {\n\tv.once.Do(func() {\n\t\tconfig := &validator.Config{TagName: \"binding\"}\n\t\tv.validate = validator.New(config)\n\t})\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/form.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"mime/multipart\"\n\t\"net/http\"\n\t\"reflect\"\n)\n\nconst defaultMemory = 32 * 1024 * 1024\n\ntype formBinding struct{}\ntype formPostBinding struct{}\ntype formMultipartBinding struct{}\n\nfunc (formBinding) Name() string {\n\treturn \"form\"\n}\n\nfunc (formBinding) Bind(req *http.Request, obj interface{}) error {\n\tif err := req.ParseForm(); err != nil {\n\t\treturn err\n\t}\n\tif err := req.ParseMultipartForm(defaultMemory); err != nil {\n\t\tif err != http.ErrNotMultipart {\n\t\t\treturn err\n\t\t}\n\t}\n\tif err := mapForm(obj, req.Form); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n\nfunc (formPostBinding) Name() string {\n\treturn \"form-urlencoded\"\n}\n\nfunc (formPostBinding) Bind(req *http.Request, obj interface{}) error {\n\tif err := req.ParseForm(); err != nil {\n\t\treturn err\n\t}\n\tif err := mapForm(obj, req.PostForm); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n\nfunc (formMultipartBinding) Name() string {\n\treturn \"multipart/form-data\"\n}\n\nfunc (formMultipartBinding) Bind(req *http.Request, obj interface{}) error {\n\tif err := req.ParseMultipartForm(defaultMemory); err != nil {\n\t\treturn err\n\t}\n\tif err := mappingByPtr(obj, (*multipartRequest)(req), \"form\"); err != nil {\n\t\treturn err\n\t}\n\n\treturn validate(obj)\n}\n\ntype multipartRequest http.Request\n\nvar _ setter = (*multipartRequest)(nil)\n\nvar (\n\tmultipartFileHeaderStructType = reflect.TypeOf(multipart.FileHeader{})\n)\n\n// TrySet tries to set a value by the multipart request with the binding a form file\nfunc (r *multipartRequest) TrySet(value reflect.Value, field reflect.StructField, key string, opt setOptions) (isSetted bool, err error) {\n\tif value.Type() == multipartFileHeaderStructType {\n\t\t_, file, err := (*http.Request)(r).FormFile(key)\n\t\tif err != nil {\n\t\t\treturn false, err\n\t\t}\n\t\tif file != nil {\n\t\t\tvalue.Set(reflect.ValueOf(*file))\n\t\t\treturn true, nil\n\t\t}\n\t}\n\n\treturn setByForm(value, field, r.MultipartForm.Value, key, opt)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/form_mapping.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n\n\t\"github.com/gin-gonic/gin/internal/json\"\n)\n\nvar errUnknownType = errors.New(\"Unknown type\")\n\nfunc mapUri(ptr interface{}, m map[string][]string) error {\n\treturn mapFormByTag(ptr, m, \"uri\")\n}\n\nfunc mapForm(ptr interface{}, form map[string][]string) error {\n\treturn mapFormByTag(ptr, form, \"form\")\n}\n\nvar emptyField = reflect.StructField{}\n\nfunc mapFormByTag(ptr interface{}, form map[string][]string, tag string) error {\n\treturn mappingByPtr(ptr, formSource(form), tag)\n}\n\n// setter tries to set value on a walking by fields of a struct\ntype setter interface {\n\tTrySet(value reflect.Value, field reflect.StructField, key string, opt setOptions) (isSetted bool, err error)\n}\n\ntype formSource map[string][]string\n\nvar _ setter = formSource(nil)\n\n// TrySet tries to set a value by request's form source (like map[string][]string)\nfunc (form formSource) TrySet(value reflect.Value, field reflect.StructField, tagValue string, opt setOptions) (isSetted bool, err error) {\n\treturn setByForm(value, field, form, tagValue, opt)\n}\n\nfunc mappingByPtr(ptr interface{}, setter setter, tag string) error {\n\t_, err := mapping(reflect.ValueOf(ptr), emptyField, setter, tag)\n\treturn err\n}\n\nfunc mapping(value reflect.Value, field reflect.StructField, setter setter, tag string) (bool, error) {\n\tvar vKind = value.Kind()\n\n\tif vKind == reflect.Ptr {\n\t\tvar isNew bool\n\t\tvPtr := value\n\t\tif value.IsNil() {\n\t\t\tisNew = true\n\t\t\tvPtr = reflect.New(value.Type().Elem())\n\t\t}\n\t\tisSetted, err := mapping(vPtr.Elem(), field, setter, tag)\n\t\tif err != nil {\n\t\t\treturn false, err\n\t\t}\n\t\tif isNew && isSetted {\n\t\t\tvalue.Set(vPtr)\n\t\t}\n\t\treturn isSetted, nil\n\t}\n\n\tok, err := tryToSetValue(value, field, setter, tag)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\tif ok {\n\t\treturn true, nil\n\t}\n\n\tif vKind == reflect.Struct {\n\t\ttValue := value.Type()\n\n\t\tvar isSetted bool\n\t\tfor i := 0; i < value.NumField(); i++ {\n\t\t\tif !value.Field(i).CanSet() {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tok, err := mapping(value.Field(i), tValue.Field(i), setter, tag)\n\t\t\tif err != nil {\n\t\t\t\treturn false, err\n\t\t\t}\n\t\t\tisSetted = isSetted || ok\n\t\t}\n\t\treturn isSetted, nil\n\t}\n\treturn false, nil\n}\n\ntype setOptions struct {\n\tisDefaultExists bool\n\tdefaultValue string\n}\n\nfunc tryToSetValue(value reflect.Value, field reflect.StructField, setter setter, tag string) (bool, error) {\n\tvar tagValue string\n\tvar setOpt setOptions\n\n\ttagValue = field.Tag.Get(tag)\n\ttagValue, opts := head(tagValue, \",\")\n\n\tif tagValue == \"-\" { // just ignoring this field\n\t\treturn false, nil\n\t}\n\tif tagValue == \"\" { // default value is FieldName\n\t\ttagValue = field.Name\n\t}\n\tif tagValue == \"\" { // when field is \"emptyField\" variable\n\t\treturn false, nil\n\t}\n\n\tvar opt string\n\tfor len(opts) > 0 {\n\t\topt, opts = head(opts, \",\")\n\n\t\tk, v := head(opt, \"=\")\n\t\tswitch k {\n\t\tcase \"default\":\n\t\t\tsetOpt.isDefaultExists = true\n\t\t\tsetOpt.defaultValue = v\n\t\t}\n\t}\n\n\treturn setter.TrySet(value, field, tagValue, setOpt)\n}\n\nfunc setByForm(value reflect.Value, field reflect.StructField, form map[string][]string, tagValue string, opt setOptions) (isSetted bool, err error) {\n\tvs, ok := form[tagValue]\n\tif !ok && !opt.isDefaultExists {\n\t\treturn false, nil\n\t}\n\n\tswitch value.Kind() {\n\tcase reflect.Slice:\n\t\tif !ok {\n\t\t\tvs = []string{opt.defaultValue}\n\t\t}\n\t\treturn true, setSlice(vs, value, field)\n\tcase reflect.Array:\n\t\tif !ok {\n\t\t\tvs = []string{opt.defaultValue}\n\t\t}\n\t\tif len(vs) != value.Len() {\n\t\t\treturn false, fmt.Errorf(\"%q is not valid value for %s\", vs, value.Type().String())\n\t\t}\n\t\treturn true, setArray(vs, value, field)\n\tdefault:\n\t\tvar val string\n\t\tif !ok {\n\t\t\tval = opt.defaultValue\n\t\t}\n\n\t\tif len(vs) > 0 {\n\t\t\tval = vs[0]\n\t\t}\n\t\treturn true, setWithProperType(val, value, field)\n\t}\n}\n\nfunc setWithProperType(val string, value reflect.Value, field reflect.StructField) error {\n\tswitch value.Kind() {\n\tcase reflect.Int:\n\t\treturn setIntField(val, 0, value)\n\tcase reflect.Int8:\n\t\treturn setIntField(val, 8, value)\n\tcase reflect.Int16:\n\t\treturn setIntField(val, 16, value)\n\tcase reflect.Int32:\n\t\treturn setIntField(val, 32, value)\n\tcase reflect.Int64:\n\t\tswitch value.Interface().(type) {\n\t\tcase time.Duration:\n\t\t\treturn setTimeDuration(val, value, field)\n\t\t}\n\t\treturn setIntField(val, 64, value)\n\tcase reflect.Uint:\n\t\treturn setUintField(val, 0, value)\n\tcase reflect.Uint8:\n\t\treturn setUintField(val, 8, value)\n\tcase reflect.Uint16:\n\t\treturn setUintField(val, 16, value)\n\tcase reflect.Uint32:\n\t\treturn setUintField(val, 32, value)\n\tcase reflect.Uint64:\n\t\treturn setUintField(val, 64, value)\n\tcase reflect.Bool:\n\t\treturn setBoolField(val, value)\n\tcase reflect.Float32:\n\t\treturn setFloatField(val, 32, value)\n\tcase reflect.Float64:\n\t\treturn setFloatField(val, 64, value)\n\tcase reflect.String:\n\t\tvalue.SetString(val)\n\tcase reflect.Struct:\n\t\tswitch value.Interface().(type) {\n\t\tcase time.Time:\n\t\t\treturn setTimeField(val, field, value)\n\t\t}\n\t\treturn json.Unmarshal([]byte(val), value.Addr().Interface())\n\tcase reflect.Map:\n\t\treturn json.Unmarshal([]byte(val), value.Addr().Interface())\n\tdefault:\n\t\treturn errUnknownType\n\t}\n\treturn nil\n}\n\nfunc setIntField(val string, bitSize int, field reflect.Value) error {\n\tif val == \"\" {\n\t\tval = \"0\"\n\t}\n\tintVal, err := strconv.ParseInt(val, 10, bitSize)\n\tif err == nil {\n\t\tfield.SetInt(intVal)\n\t}\n\treturn err\n}\n\nfunc setUintField(val string, bitSize int, field reflect.Value) error {\n\tif val == \"\" {\n\t\tval = \"0\"\n\t}\n\tuintVal, err := strconv.ParseUint(val, 10, bitSize)\n\tif err == nil {\n\t\tfield.SetUint(uintVal)\n\t}\n\treturn err\n}\n\nfunc setBoolField(val string, field reflect.Value) error {\n\tif val == \"\" {\n\t\tval = \"false\"\n\t}\n\tboolVal, err := strconv.ParseBool(val)\n\tif err == nil {\n\t\tfield.SetBool(boolVal)\n\t}\n\treturn err\n}\n\nfunc setFloatField(val string, bitSize int, field reflect.Value) error {\n\tif val == \"\" {\n\t\tval = \"0.0\"\n\t}\n\tfloatVal, err := strconv.ParseFloat(val, bitSize)\n\tif err == nil {\n\t\tfield.SetFloat(floatVal)\n\t}\n\treturn err\n}\n\nfunc setTimeField(val string, structField reflect.StructField, value reflect.Value) error {\n\ttimeFormat := structField.Tag.Get(\"time_format\")\n\tif timeFormat == \"\" {\n\t\ttimeFormat = time.RFC3339\n\t}\n\n\tif val == \"\" {\n\t\tvalue.Set(reflect.ValueOf(time.Time{}))\n\t\treturn nil\n\t}\n\n\tl := time.Local\n\tif isUTC, _ := strconv.ParseBool(structField.Tag.Get(\"time_utc\")); isUTC {\n\t\tl = time.UTC\n\t}\n\n\tif locTag := structField.Tag.Get(\"time_location\"); locTag != \"\" {\n\t\tloc, err := time.LoadLocation(locTag)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tl = loc\n\t}\n\n\tt, err := time.ParseInLocation(timeFormat, val, l)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tvalue.Set(reflect.ValueOf(t))\n\treturn nil\n}\n\nfunc setArray(vals []string, value reflect.Value, field reflect.StructField) error {\n\tfor i, s := range vals {\n\t\terr := setWithProperType(s, value.Index(i), field)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc setSlice(vals []string, value reflect.Value, field reflect.StructField) error {\n\tslice := reflect.MakeSlice(value.Type(), len(vals), len(vals))\n\terr := setArray(vals, slice, field)\n\tif err != nil {\n\t\treturn err\n\t}\n\tvalue.Set(slice)\n\treturn nil\n}\n\nfunc setTimeDuration(val string, value reflect.Value, field reflect.StructField) error {\n\td, err := time.ParseDuration(val)\n\tif err != nil {\n\t\treturn err\n\t}\n\tvalue.Set(reflect.ValueOf(d))\n\treturn nil\n}\n\nfunc head(str, sep string) (head string, tail string) {\n\tidx := strings.Index(str, sep)\n\tif idx < 0 {\n\t\treturn str, \"\"\n\t}\n\treturn str[:idx], str[idx+len(sep):]\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/json.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin/internal/json\"\n)\n\n// EnableDecoderUseNumber is used to call the UseNumber method on the JSON\n// Decoder instance. UseNumber causes the Decoder to unmarshal a number into an\n// interface{} as a Number instead of as a float64.\nvar EnableDecoderUseNumber = false\n\ntype jsonBinding struct{}\n\nfunc (jsonBinding) Name() string {\n\treturn \"json\"\n}\n\nfunc (jsonBinding) Bind(req *http.Request, obj interface{}) error {\n\tif req == nil || req.Body == nil {\n\t\treturn fmt.Errorf(\"invalid request\")\n\t}\n\treturn decodeJSON(req.Body, obj)\n}\n\nfunc (jsonBinding) BindBody(body []byte, obj interface{}) error {\n\treturn decodeJSON(bytes.NewReader(body), obj)\n}\n\nfunc decodeJSON(r io.Reader, obj interface{}) error {\n\tdecoder := json.NewDecoder(r)\n\tif EnableDecoderUseNumber {\n\t\tdecoder.UseNumber()\n\t}\n\tif err := decoder.Decode(obj); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/msgpack.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"bytes\"\n\t\"io\"\n\t\"net/http\"\n\n\t\"github.com/ugorji/go/codec\"\n)\n\ntype msgpackBinding struct{}\n\nfunc (msgpackBinding) Name() string {\n\treturn \"msgpack\"\n}\n\nfunc (msgpackBinding) Bind(req *http.Request, obj interface{}) error {\n\treturn decodeMsgPack(req.Body, obj)\n}\n\nfunc (msgpackBinding) BindBody(body []byte, obj interface{}) error {\n\treturn decodeMsgPack(bytes.NewReader(body), obj)\n}\n\nfunc decodeMsgPack(r io.Reader, obj interface{}) error {\n\tcdc := new(codec.MsgpackHandle)\n\tif err := codec.NewDecoder(r, cdc).Decode(&obj); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/protobuf.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"io/ioutil\"\n\t\"net/http\"\n\n\t\"github.com/golang/protobuf/proto\"\n)\n\ntype protobufBinding struct{}\n\nfunc (protobufBinding) Name() string {\n\treturn \"protobuf\"\n}\n\nfunc (b protobufBinding) Bind(req *http.Request, obj interface{}) error {\n\tbuf, err := ioutil.ReadAll(req.Body)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn b.BindBody(buf, obj)\n}\n\nfunc (protobufBinding) BindBody(body []byte, obj interface{}) error {\n\tif err := proto.Unmarshal(body, obj.(proto.Message)); err != nil {\n\t\treturn err\n\t}\n\t// Here it's same to return validate(obj), but util now we can't add\n\t// `binding:\"\"` to the struct which automatically generate by gen-proto\n\treturn nil\n\t// return validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/query.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport \"net/http\"\n\ntype queryBinding struct{}\n\nfunc (queryBinding) Name() string {\n\treturn \"query\"\n}\n\nfunc (queryBinding) Bind(req *http.Request, obj interface{}) error {\n\tvalues := req.URL.Query()\n\tif err := mapForm(obj, values); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/uri.go", "content": "// Copyright 2018 Gin Core Team. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\ntype uriBinding struct{}\n\nfunc (uriBinding) Name() string {\n\treturn \"uri\"\n}\n\nfunc (uriBinding) BindUri(m map[string][]string, obj interface{}) error {\n\tif err := mapUri(obj, m); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/xml.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"io\"\n\t\"net/http\"\n)\n\ntype xmlBinding struct{}\n\nfunc (xmlBinding) Name() string {\n\treturn \"xml\"\n}\n\nfunc (xmlBinding) Bind(req *http.Request, obj interface{}) error {\n\treturn decodeXML(req.Body, obj)\n}\n\nfunc (xmlBinding) BindBody(body []byte, obj interface{}) error {\n\treturn decodeXML(bytes.NewReader(body), obj)\n}\nfunc decodeXML(r io.Reader, obj interface{}) error {\n\tdecoder := xml.NewDecoder(r)\n\tif err := decoder.Decode(obj); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/binding/yaml.go", "content": "// Copyright 2018 Gin Core Team. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage binding\n\nimport (\n\t\"bytes\"\n\t\"io\"\n\t\"net/http\"\n\n\t\"gopkg.in/yaml.v2\"\n)\n\ntype yamlBinding struct{}\n\nfunc (yamlBinding) Name() string {\n\treturn \"yaml\"\n}\n\nfunc (yamlBinding) Bind(req *http.Request, obj interface{}) error {\n\treturn decodeYAML(req.Body, obj)\n}\n\nfunc (yamlBinding) BindBody(body []byte, obj interface{}) error {\n\treturn decodeYAML(bytes.NewReader(body), obj)\n}\n\nfunc decodeYAML(r io.Reader, obj interface{}) error {\n\tdecoder := yaml.NewDecoder(r)\n\tif err := decoder.Decode(obj); err != nil {\n\t\treturn err\n\t}\n\treturn validate(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/codecov.yml", "content": "coverage:\n notify:\n gitter:\n default:\n url: https://webhooks.gitter.im/e/d90dcdeeab2f1e357165\n" }, { "path": "vendor/github.com/gin-gonic/gin/context.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"math\"\n\t\"mime/multipart\"\n\t\"net\"\n\t\"net/http\"\n\t\"net/url\"\n\t\"os\"\n\t\"strings\"\n\t\"time\"\n\n\t\"github.com/gin-contrib/sse\"\n\t\"github.com/gin-gonic/gin/binding\"\n\t\"github.com/gin-gonic/gin/render\"\n)\n\n// Content-Type MIME of the most common data formats.\nconst (\n\tMIMEJSON = binding.MIMEJSON\n\tMIMEHTML = binding.MIMEHTML\n\tMIMEXML = binding.MIMEXML\n\tMIMEXML2 = binding.MIMEXML2\n\tMIMEPlain = binding.MIMEPlain\n\tMIMEPOSTForm = binding.MIMEPOSTForm\n\tMIMEMultipartPOSTForm = binding.MIMEMultipartPOSTForm\n\tMIMEYAML = binding.MIMEYAML\n\tBodyBytesKey = \"_gin-gonic/gin/bodybyteskey\"\n)\n\nconst abortIndex int8 = math.MaxInt8 / 2\n\n// Context is the most important part of gin. It allows us to pass variables between middleware,\n// manage the flow, validate the JSON of a request and render a JSON response for example.\ntype Context struct {\n\twritermem responseWriter\n\tRequest *http.Request\n\tWriter ResponseWriter\n\n\tParams Params\n\thandlers HandlersChain\n\tindex int8\n\n\tengine *Engine\n\n\t// Keys is a key/value pair exclusively for the context of each request.\n\tKeys map[string]interface{}\n\n\t// Errors is a list of errors attached to all the handlers/middlewares who used this context.\n\tErrors errorMsgs\n\n\t// Accepted defines a list of manually accepted formats for content negotiation.\n\tAccepted []string\n}\n\n/************************************/\n/********** CONTEXT CREATION ********/\n/************************************/\n\nfunc (c *Context) reset() {\n\tc.Writer = &c.writermem\n\tc.Params = c.Params[0:0]\n\tc.handlers = nil\n\tc.index = -1\n\tc.Keys = nil\n\tc.Errors = c.Errors[0:0]\n\tc.Accepted = nil\n}\n\n// Copy returns a copy of the current context that can be safely used outside the request's scope.\n// This has to be used when the context has to be passed to a goroutine.\nfunc (c *Context) Copy() *Context {\n\tvar cp = *c\n\tcp.writermem.ResponseWriter = nil\n\tcp.Writer = &cp.writermem\n\tcp.index = abortIndex\n\tcp.handlers = nil\n\tcp.Keys = map[string]interface{}{}\n\tfor k, v := range c.Keys {\n\t\tcp.Keys[k] = v\n\t}\n\treturn &cp\n}\n\n// HandlerName returns the main handler's name. For example if the handler is \"handleGetUsers()\",\n// this function will return \"main.handleGetUsers\".\nfunc (c *Context) HandlerName() string {\n\treturn nameOfFunction(c.handlers.Last())\n}\n\n// HandlerNames returns a list of all registered handlers for this context in descending order,\n// following the semantics of HandlerName()\nfunc (c *Context) HandlerNames() []string {\n\thn := make([]string, 0, len(c.handlers))\n\tfor _, val := range c.handlers {\n\t\thn = append(hn, nameOfFunction(val))\n\t}\n\treturn hn\n}\n\n// Handler returns the main handler.\nfunc (c *Context) Handler() HandlerFunc {\n\treturn c.handlers.Last()\n}\n\n/************************************/\n/*********** FLOW CONTROL ***********/\n/************************************/\n\n// Next should be used only inside middleware.\n// It executes the pending handlers in the chain inside the calling handler.\n// See example in GitHub.\nfunc (c *Context) Next() {\n\tc.index++\n\tfor c.index < int8(len(c.handlers)) {\n\t\tc.handlers[c.index](c)\n\t\tc.index++\n\t}\n}\n\n// IsAborted returns true if the current context was aborted.\nfunc (c *Context) IsAborted() bool {\n\treturn c.index >= abortIndex\n}\n\n// Abort prevents pending handlers from being called. Note that this will not stop the current handler.\n// Let's say you have an authorization middleware that validates that the current request is authorized.\n// If the authorization fails (ex: the password does not match), call Abort to ensure the remaining handlers\n// for this request are not called.\nfunc (c *Context) Abort() {\n\tc.index = abortIndex\n}\n\n// AbortWithStatus calls `Abort()` and writes the headers with the specified status code.\n// For example, a failed attempt to authenticate a request could use: context.AbortWithStatus(401).\nfunc (c *Context) AbortWithStatus(code int) {\n\tc.Status(code)\n\tc.Writer.WriteHeaderNow()\n\tc.Abort()\n}\n\n// AbortWithStatusJSON calls `Abort()` and then `JSON` internally.\n// This method stops the chain, writes the status code and return a JSON body.\n// It also sets the Content-Type as \"application/json\".\nfunc (c *Context) AbortWithStatusJSON(code int, jsonObj interface{}) {\n\tc.Abort()\n\tc.JSON(code, jsonObj)\n}\n\n// AbortWithError calls `AbortWithStatus()` and `Error()` internally.\n// This method stops the chain, writes the status code and pushes the specified error to `c.Errors`.\n// See Context.Error() for more details.\nfunc (c *Context) AbortWithError(code int, err error) *Error {\n\tc.AbortWithStatus(code)\n\treturn c.Error(err)\n}\n\n/************************************/\n/********* ERROR MANAGEMENT *********/\n/************************************/\n\n// Error attaches an error to the current context. The error is pushed to a list of errors.\n// It's a good idea to call Error for each error that occurred during the resolution of a request.\n// A middleware can be used to collect all the errors and push them to a database together,\n// print a log, or append it in the HTTP response.\n// Error will panic if err is nil.\nfunc (c *Context) Error(err error) *Error {\n\tif err == nil {\n\t\tpanic(\"err is nil\")\n\t}\n\n\tparsedError, ok := err.(*Error)\n\tif !ok {\n\t\tparsedError = &Error{\n\t\t\tErr: err,\n\t\t\tType: ErrorTypePrivate,\n\t\t}\n\t}\n\n\tc.Errors = append(c.Errors, parsedError)\n\treturn parsedError\n}\n\n/************************************/\n/******** METADATA MANAGEMENT********/\n/************************************/\n\n// Set is used to store a new key/value pair exclusively for this context.\n// It also lazy initializes c.Keys if it was not used previously.\nfunc (c *Context) Set(key string, value interface{}) {\n\tif c.Keys == nil {\n\t\tc.Keys = make(map[string]interface{})\n\t}\n\tc.Keys[key] = value\n}\n\n// Get returns the value for the given key, ie: (value, true).\n// If the value does not exists it returns (nil, false)\nfunc (c *Context) Get(key string) (value interface{}, exists bool) {\n\tvalue, exists = c.Keys[key]\n\treturn\n}\n\n// MustGet returns the value for the given key if it exists, otherwise it panics.\nfunc (c *Context) MustGet(key string) interface{} {\n\tif value, exists := c.Get(key); exists {\n\t\treturn value\n\t}\n\tpanic(\"Key \\\"\" + key + \"\\\" does not exist\")\n}\n\n// GetString returns the value associated with the key as a string.\nfunc (c *Context) GetString(key string) (s string) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\ts, _ = val.(string)\n\t}\n\treturn\n}\n\n// GetBool returns the value associated with the key as a boolean.\nfunc (c *Context) GetBool(key string) (b bool) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tb, _ = val.(bool)\n\t}\n\treturn\n}\n\n// GetInt returns the value associated with the key as an integer.\nfunc (c *Context) GetInt(key string) (i int) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\ti, _ = val.(int)\n\t}\n\treturn\n}\n\n// GetInt64 returns the value associated with the key as an integer.\nfunc (c *Context) GetInt64(key string) (i64 int64) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\ti64, _ = val.(int64)\n\t}\n\treturn\n}\n\n// GetFloat64 returns the value associated with the key as a float64.\nfunc (c *Context) GetFloat64(key string) (f64 float64) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tf64, _ = val.(float64)\n\t}\n\treturn\n}\n\n// GetTime returns the value associated with the key as time.\nfunc (c *Context) GetTime(key string) (t time.Time) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tt, _ = val.(time.Time)\n\t}\n\treturn\n}\n\n// GetDuration returns the value associated with the key as a duration.\nfunc (c *Context) GetDuration(key string) (d time.Duration) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\td, _ = val.(time.Duration)\n\t}\n\treturn\n}\n\n// GetStringSlice returns the value associated with the key as a slice of strings.\nfunc (c *Context) GetStringSlice(key string) (ss []string) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tss, _ = val.([]string)\n\t}\n\treturn\n}\n\n// GetStringMap returns the value associated with the key as a map of interfaces.\nfunc (c *Context) GetStringMap(key string) (sm map[string]interface{}) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tsm, _ = val.(map[string]interface{})\n\t}\n\treturn\n}\n\n// GetStringMapString returns the value associated with the key as a map of strings.\nfunc (c *Context) GetStringMapString(key string) (sms map[string]string) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tsms, _ = val.(map[string]string)\n\t}\n\treturn\n}\n\n// GetStringMapStringSlice returns the value associated with the key as a map to a slice of strings.\nfunc (c *Context) GetStringMapStringSlice(key string) (smss map[string][]string) {\n\tif val, ok := c.Get(key); ok && val != nil {\n\t\tsmss, _ = val.(map[string][]string)\n\t}\n\treturn\n}\n\n/************************************/\n/************ INPUT DATA ************/\n/************************************/\n\n// Param returns the value of the URL param.\n// It is a shortcut for c.Params.ByName(key)\n// router.GET(\"/user/:id\", func(c *gin.Context) {\n// // a GET request to /user/john\n// id := c.Param(\"id\") // id == \"john\"\n// })\nfunc (c *Context) Param(key string) string {\n\treturn c.Params.ByName(key)\n}\n\n// Query returns the keyed url query value if it exists,\n// otherwise it returns an empty string `(\"\")`.\n// It is shortcut for `c.Request.URL.Query().Get(key)`\n// GET /path?id=1234&name=Manu&value=\n// \t c.Query(\"id\") == \"1234\"\n// \t c.Query(\"name\") == \"Manu\"\n// \t c.Query(\"value\") == \"\"\n// \t c.Query(\"wtf\") == \"\"\nfunc (c *Context) Query(key string) string {\n\tvalue, _ := c.GetQuery(key)\n\treturn value\n}\n\n// DefaultQuery returns the keyed url query value if it exists,\n// otherwise it returns the specified defaultValue string.\n// See: Query() and GetQuery() for further information.\n// GET /?name=Manu&lastname=\n// c.DefaultQuery(\"name\", \"unknown\") == \"Manu\"\n// c.DefaultQuery(\"id\", \"none\") == \"none\"\n// c.DefaultQuery(\"lastname\", \"none\") == \"\"\nfunc (c *Context) DefaultQuery(key, defaultValue string) string {\n\tif value, ok := c.GetQuery(key); ok {\n\t\treturn value\n\t}\n\treturn defaultValue\n}\n\n// GetQuery is like Query(), it returns the keyed url query value\n// if it exists `(value, true)` (even when the value is an empty string),\n// otherwise it returns `(\"\", false)`.\n// It is shortcut for `c.Request.URL.Query().Get(key)`\n// GET /?name=Manu&lastname=\n// (\"Manu\", true) == c.GetQuery(\"name\")\n// (\"\", false) == c.GetQuery(\"id\")\n// (\"\", true) == c.GetQuery(\"lastname\")\nfunc (c *Context) GetQuery(key string) (string, bool) {\n\tif values, ok := c.GetQueryArray(key); ok {\n\t\treturn values[0], ok\n\t}\n\treturn \"\", false\n}\n\n// QueryArray returns a slice of strings for a given query key.\n// The length of the slice depends on the number of params with the given key.\nfunc (c *Context) QueryArray(key string) []string {\n\tvalues, _ := c.GetQueryArray(key)\n\treturn values\n}\n\n// GetQueryArray returns a slice of strings for a given query key, plus\n// a boolean value whether at least one value exists for the given key.\nfunc (c *Context) GetQueryArray(key string) ([]string, bool) {\n\tif values, ok := c.Request.URL.Query()[key]; ok && len(values) > 0 {\n\t\treturn values, true\n\t}\n\treturn []string{}, false\n}\n\n// QueryMap returns a map for a given query key.\nfunc (c *Context) QueryMap(key string) map[string]string {\n\tdicts, _ := c.GetQueryMap(key)\n\treturn dicts\n}\n\n// GetQueryMap returns a map for a given query key, plus a boolean value\n// whether at least one value exists for the given key.\nfunc (c *Context) GetQueryMap(key string) (map[string]string, bool) {\n\treturn c.get(c.Request.URL.Query(), key)\n}\n\n// PostForm returns the specified key from a POST urlencoded form or multipart form\n// when it exists, otherwise it returns an empty string `(\"\")`.\nfunc (c *Context) PostForm(key string) string {\n\tvalue, _ := c.GetPostForm(key)\n\treturn value\n}\n\n// DefaultPostForm returns the specified key from a POST urlencoded form or multipart form\n// when it exists, otherwise it returns the specified defaultValue string.\n// See: PostForm() and GetPostForm() for further information.\nfunc (c *Context) DefaultPostForm(key, defaultValue string) string {\n\tif value, ok := c.GetPostForm(key); ok {\n\t\treturn value\n\t}\n\treturn defaultValue\n}\n\n// GetPostForm is like PostForm(key). It returns the specified key from a POST urlencoded\n// form or multipart form when it exists `(value, true)` (even when the value is an empty string),\n// otherwise it returns (\"\", false).\n// For example, during a PATCH request to update the user's email:\n// email=mail@example.com --> (\"mail@example.com\", true) := GetPostForm(\"email\") // set email to \"mail@example.com\"\n// \t email= --> (\"\", true) := GetPostForm(\"email\") // set email to \"\"\n// --> (\"\", false) := GetPostForm(\"email\") // do nothing with email\nfunc (c *Context) GetPostForm(key string) (string, bool) {\n\tif values, ok := c.GetPostFormArray(key); ok {\n\t\treturn values[0], ok\n\t}\n\treturn \"\", false\n}\n\n// PostFormArray returns a slice of strings for a given form key.\n// The length of the slice depends on the number of params with the given key.\nfunc (c *Context) PostFormArray(key string) []string {\n\tvalues, _ := c.GetPostFormArray(key)\n\treturn values\n}\n\n// GetPostFormArray returns a slice of strings for a given form key, plus\n// a boolean value whether at least one value exists for the given key.\nfunc (c *Context) GetPostFormArray(key string) ([]string, bool) {\n\treq := c.Request\n\tif err := req.ParseMultipartForm(c.engine.MaxMultipartMemory); err != nil {\n\t\tif err != http.ErrNotMultipart {\n\t\t\tdebugPrint(\"error on parse multipart form array: %v\", err)\n\t\t}\n\t}\n\tif values := req.PostForm[key]; len(values) > 0 {\n\t\treturn values, true\n\t}\n\treturn []string{}, false\n}\n\n// PostFormMap returns a map for a given form key.\nfunc (c *Context) PostFormMap(key string) map[string]string {\n\tdicts, _ := c.GetPostFormMap(key)\n\treturn dicts\n}\n\n// GetPostFormMap returns a map for a given form key, plus a boolean value\n// whether at least one value exists for the given key.\nfunc (c *Context) GetPostFormMap(key string) (map[string]string, bool) {\n\treq := c.Request\n\tif err := req.ParseMultipartForm(c.engine.MaxMultipartMemory); err != nil {\n\t\tif err != http.ErrNotMultipart {\n\t\t\tdebugPrint(\"error on parse multipart form map: %v\", err)\n\t\t}\n\t}\n\treturn c.get(req.PostForm, key)\n}\n\n// get is an internal method and returns a map which satisfy conditions.\nfunc (c *Context) get(m map[string][]string, key string) (map[string]string, bool) {\n\tdicts := make(map[string]string)\n\texist := false\n\tfor k, v := range m {\n\t\tif i := strings.IndexByte(k, '['); i >= 1 && k[0:i] == key {\n\t\t\tif j := strings.IndexByte(k[i+1:], ']'); j >= 1 {\n\t\t\t\texist = true\n\t\t\t\tdicts[k[i+1:][:j]] = v[0]\n\t\t\t}\n\t\t}\n\t}\n\treturn dicts, exist\n}\n\n// FormFile returns the first file for the provided form key.\nfunc (c *Context) FormFile(name string) (*multipart.FileHeader, error) {\n\tif c.Request.MultipartForm == nil {\n\t\tif err := c.Request.ParseMultipartForm(c.engine.MaxMultipartMemory); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\t_, fh, err := c.Request.FormFile(name)\n\treturn fh, err\n}\n\n// MultipartForm is the parsed multipart form, including file uploads.\nfunc (c *Context) MultipartForm() (*multipart.Form, error) {\n\terr := c.Request.ParseMultipartForm(c.engine.MaxMultipartMemory)\n\treturn c.Request.MultipartForm, err\n}\n\n// SaveUploadedFile uploads the form file to specific dst.\nfunc (c *Context) SaveUploadedFile(file *multipart.FileHeader, dst string) error {\n\tsrc, err := file.Open()\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer src.Close()\n\n\tout, err := os.Create(dst)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer out.Close()\n\n\t_, err = io.Copy(out, src)\n\treturn err\n}\n\n// Bind checks the Content-Type to select a binding engine automatically,\n// Depending the \"Content-Type\" header different bindings are used:\n// \"application/json\" --> JSON binding\n// \"application/xml\" --> XML binding\n// otherwise --> returns an error.\n// It parses the request's body as JSON if Content-Type == \"application/json\" using JSON or XML as a JSON input.\n// It decodes the json payload into the struct specified as a pointer.\n// It writes a 400 error and sets Content-Type header \"text/plain\" in the response if input is not valid.\nfunc (c *Context) Bind(obj interface{}) error {\n\tb := binding.Default(c.Request.Method, c.ContentType())\n\treturn c.MustBindWith(obj, b)\n}\n\n// BindJSON is a shortcut for c.MustBindWith(obj, binding.JSON).\nfunc (c *Context) BindJSON(obj interface{}) error {\n\treturn c.MustBindWith(obj, binding.JSON)\n}\n\n// BindXML is a shortcut for c.MustBindWith(obj, binding.BindXML).\nfunc (c *Context) BindXML(obj interface{}) error {\n\treturn c.MustBindWith(obj, binding.XML)\n}\n\n// BindQuery is a shortcut for c.MustBindWith(obj, binding.Query).\nfunc (c *Context) BindQuery(obj interface{}) error {\n\treturn c.MustBindWith(obj, binding.Query)\n}\n\n// BindYAML is a shortcut for c.MustBindWith(obj, binding.YAML).\nfunc (c *Context) BindYAML(obj interface{}) error {\n\treturn c.MustBindWith(obj, binding.YAML)\n}\n\n// BindUri binds the passed struct pointer using binding.Uri.\n// It will abort the request with HTTP 400 if any error occurs.\nfunc (c *Context) BindUri(obj interface{}) error {\n\tif err := c.ShouldBindUri(obj); err != nil {\n\t\tc.AbortWithError(http.StatusBadRequest, err).SetType(ErrorTypeBind) // nolint: errcheck\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// MustBindWith binds the passed struct pointer using the specified binding engine.\n// It will abort the request with HTTP 400 if any error occurs.\n// See the binding package.\nfunc (c *Context) MustBindWith(obj interface{}, b binding.Binding) error {\n\tif err := c.ShouldBindWith(obj, b); err != nil {\n\t\tc.AbortWithError(http.StatusBadRequest, err).SetType(ErrorTypeBind) // nolint: errcheck\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// ShouldBind checks the Content-Type to select a binding engine automatically,\n// Depending the \"Content-Type\" header different bindings are used:\n// \"application/json\" --> JSON binding\n// \"application/xml\" --> XML binding\n// otherwise --> returns an error\n// It parses the request's body as JSON if Content-Type == \"application/json\" using JSON or XML as a JSON input.\n// It decodes the json payload into the struct specified as a pointer.\n// Like c.Bind() but this method does not set the response status code to 400 and abort if the json is not valid.\nfunc (c *Context) ShouldBind(obj interface{}) error {\n\tb := binding.Default(c.Request.Method, c.ContentType())\n\treturn c.ShouldBindWith(obj, b)\n}\n\n// ShouldBindJSON is a shortcut for c.ShouldBindWith(obj, binding.JSON).\nfunc (c *Context) ShouldBindJSON(obj interface{}) error {\n\treturn c.ShouldBindWith(obj, binding.JSON)\n}\n\n// ShouldBindXML is a shortcut for c.ShouldBindWith(obj, binding.XML).\nfunc (c *Context) ShouldBindXML(obj interface{}) error {\n\treturn c.ShouldBindWith(obj, binding.XML)\n}\n\n// ShouldBindQuery is a shortcut for c.ShouldBindWith(obj, binding.Query).\nfunc (c *Context) ShouldBindQuery(obj interface{}) error {\n\treturn c.ShouldBindWith(obj, binding.Query)\n}\n\n// ShouldBindYAML is a shortcut for c.ShouldBindWith(obj, binding.YAML).\nfunc (c *Context) ShouldBindYAML(obj interface{}) error {\n\treturn c.ShouldBindWith(obj, binding.YAML)\n}\n\n// ShouldBindUri binds the passed struct pointer using the specified binding engine.\nfunc (c *Context) ShouldBindUri(obj interface{}) error {\n\tm := make(map[string][]string)\n\tfor _, v := range c.Params {\n\t\tm[v.Key] = []string{v.Value}\n\t}\n\treturn binding.Uri.BindUri(m, obj)\n}\n\n// ShouldBindWith binds the passed struct pointer using the specified binding engine.\n// See the binding package.\nfunc (c *Context) ShouldBindWith(obj interface{}, b binding.Binding) error {\n\treturn b.Bind(c.Request, obj)\n}\n\n// ShouldBindBodyWith is similar with ShouldBindWith, but it stores the request\n// body into the context, and reuse when it is called again.\n//\n// NOTE: This method reads the body before binding. So you should use\n// ShouldBindWith for better performance if you need to call only once.\nfunc (c *Context) ShouldBindBodyWith(obj interface{}, bb binding.BindingBody) (err error) {\n\tvar body []byte\n\tif cb, ok := c.Get(BodyBytesKey); ok {\n\t\tif cbb, ok := cb.([]byte); ok {\n\t\t\tbody = cbb\n\t\t}\n\t}\n\tif body == nil {\n\t\tbody, err = ioutil.ReadAll(c.Request.Body)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tc.Set(BodyBytesKey, body)\n\t}\n\treturn bb.BindBody(body, obj)\n}\n\n// ClientIP implements a best effort algorithm to return the real client IP, it parses\n// X-Real-IP and X-Forwarded-For in order to work properly with reverse-proxies such us: nginx or haproxy.\n// Use X-Forwarded-For before X-Real-Ip as nginx uses X-Real-Ip with the proxy's IP.\nfunc (c *Context) ClientIP() string {\n\tif c.engine.ForwardedByClientIP {\n\t\tclientIP := c.requestHeader(\"X-Forwarded-For\")\n\t\tclientIP = strings.TrimSpace(strings.Split(clientIP, \",\")[0])\n\t\tif clientIP == \"\" {\n\t\t\tclientIP = strings.TrimSpace(c.requestHeader(\"X-Real-Ip\"))\n\t\t}\n\t\tif clientIP != \"\" {\n\t\t\treturn clientIP\n\t\t}\n\t}\n\n\tif c.engine.AppEngine {\n\t\tif addr := c.requestHeader(\"X-Appengine-Remote-Addr\"); addr != \"\" {\n\t\t\treturn addr\n\t\t}\n\t}\n\n\tif ip, _, err := net.SplitHostPort(strings.TrimSpace(c.Request.RemoteAddr)); err == nil {\n\t\treturn ip\n\t}\n\n\treturn \"\"\n}\n\n// ContentType returns the Content-Type header of the request.\nfunc (c *Context) ContentType() string {\n\treturn filterFlags(c.requestHeader(\"Content-Type\"))\n}\n\n// IsWebsocket returns true if the request headers indicate that a websocket\n// handshake is being initiated by the client.\nfunc (c *Context) IsWebsocket() bool {\n\tif strings.Contains(strings.ToLower(c.requestHeader(\"Connection\")), \"upgrade\") &&\n\t\tstrings.ToLower(c.requestHeader(\"Upgrade\")) == \"websocket\" {\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (c *Context) requestHeader(key string) string {\n\treturn c.Request.Header.Get(key)\n}\n\n/************************************/\n/******** RESPONSE RENDERING ********/\n/************************************/\n\n// bodyAllowedForStatus is a copy of http.bodyAllowedForStatus non-exported function.\nfunc bodyAllowedForStatus(status int) bool {\n\tswitch {\n\tcase status >= 100 && status <= 199:\n\t\treturn false\n\tcase status == http.StatusNoContent:\n\t\treturn false\n\tcase status == http.StatusNotModified:\n\t\treturn false\n\t}\n\treturn true\n}\n\n// Status sets the HTTP response code.\nfunc (c *Context) Status(code int) {\n\tc.writermem.WriteHeader(code)\n}\n\n// Header is a intelligent shortcut for c.Writer.Header().Set(key, value).\n// It writes a header in the response.\n// If value == \"\", this method removes the header `c.Writer.Header().Del(key)`\nfunc (c *Context) Header(key, value string) {\n\tif value == \"\" {\n\t\tc.Writer.Header().Del(key)\n\t\treturn\n\t}\n\tc.Writer.Header().Set(key, value)\n}\n\n// GetHeader returns value from request headers.\nfunc (c *Context) GetHeader(key string) string {\n\treturn c.requestHeader(key)\n}\n\n// GetRawData return stream data.\nfunc (c *Context) GetRawData() ([]byte, error) {\n\treturn ioutil.ReadAll(c.Request.Body)\n}\n\n// SetCookie adds a Set-Cookie header to the ResponseWriter's headers.\n// The provided cookie must have a valid Name. Invalid cookies may be\n// silently dropped.\nfunc (c *Context) SetCookie(name, value string, maxAge int, path, domain string, secure, httpOnly bool) {\n\tif path == \"\" {\n\t\tpath = \"/\"\n\t}\n\thttp.SetCookie(c.Writer, &http.Cookie{\n\t\tName: name,\n\t\tValue: url.QueryEscape(value),\n\t\tMaxAge: maxAge,\n\t\tPath: path,\n\t\tDomain: domain,\n\t\tSecure: secure,\n\t\tHttpOnly: httpOnly,\n\t})\n}\n\n// Cookie returns the named cookie provided in the request or\n// ErrNoCookie if not found. And return the named cookie is unescaped.\n// If multiple cookies match the given name, only one cookie will\n// be returned.\nfunc (c *Context) Cookie(name string) (string, error) {\n\tcookie, err := c.Request.Cookie(name)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tval, _ := url.QueryUnescape(cookie.Value)\n\treturn val, nil\n}\n\n// Render writes the response headers and calls render.Render to render data.\nfunc (c *Context) Render(code int, r render.Render) {\n\tc.Status(code)\n\n\tif !bodyAllowedForStatus(code) {\n\t\tr.WriteContentType(c.Writer)\n\t\tc.Writer.WriteHeaderNow()\n\t\treturn\n\t}\n\n\tif err := r.Render(c.Writer); err != nil {\n\t\tpanic(err)\n\t}\n}\n\n// HTML renders the HTTP template specified by its file name.\n// It also updates the HTTP code and sets the Content-Type as \"text/html\".\n// See http://golang.org/doc/articles/wiki/\nfunc (c *Context) HTML(code int, name string, obj interface{}) {\n\tinstance := c.engine.HTMLRender.Instance(name, obj)\n\tc.Render(code, instance)\n}\n\n// IndentedJSON serializes the given struct as pretty JSON (indented + endlines) into the response body.\n// It also sets the Content-Type as \"application/json\".\n// WARNING: we recommend to use this only for development purposes since printing pretty JSON is\n// more CPU and bandwidth consuming. Use Context.JSON() instead.\nfunc (c *Context) IndentedJSON(code int, obj interface{}) {\n\tc.Render(code, render.IndentedJSON{Data: obj})\n}\n\n// SecureJSON serializes the given struct as Secure JSON into the response body.\n// Default prepends \"while(1),\" to response body if the given struct is array values.\n// It also sets the Content-Type as \"application/json\".\nfunc (c *Context) SecureJSON(code int, obj interface{}) {\n\tc.Render(code, render.SecureJSON{Prefix: c.engine.secureJsonPrefix, Data: obj})\n}\n\n// JSONP serializes the given struct as JSON into the response body.\n// It add padding to response body to request data from a server residing in a different domain than the client.\n// It also sets the Content-Type as \"application/javascript\".\nfunc (c *Context) JSONP(code int, obj interface{}) {\n\tcallback := c.DefaultQuery(\"callback\", \"\")\n\tif callback == \"\" {\n\t\tc.Render(code, render.JSON{Data: obj})\n\t\treturn\n\t}\n\tc.Render(code, render.JsonpJSON{Callback: callback, Data: obj})\n}\n\n// JSON serializes the given struct as JSON into the response body.\n// It also sets the Content-Type as \"application/json\".\nfunc (c *Context) JSON(code int, obj interface{}) {\n\tc.Render(code, render.JSON{Data: obj})\n}\n\n// AsciiJSON serializes the given struct as JSON into the response body with unicode to ASCII string.\n// It also sets the Content-Type as \"application/json\".\nfunc (c *Context) AsciiJSON(code int, obj interface{}) {\n\tc.Render(code, render.AsciiJSON{Data: obj})\n}\n\n// PureJSON serializes the given struct as JSON into the response body.\n// PureJSON, unlike JSON, does not replace special html characters with their unicode entities.\nfunc (c *Context) PureJSON(code int, obj interface{}) {\n\tc.Render(code, render.PureJSON{Data: obj})\n}\n\n// XML serializes the given struct as XML into the response body.\n// It also sets the Content-Type as \"application/xml\".\nfunc (c *Context) XML(code int, obj interface{}) {\n\tc.Render(code, render.XML{Data: obj})\n}\n\n// YAML serializes the given struct as YAML into the response body.\nfunc (c *Context) YAML(code int, obj interface{}) {\n\tc.Render(code, render.YAML{Data: obj})\n}\n\n// ProtoBuf serializes the given struct as ProtoBuf into the response body.\nfunc (c *Context) ProtoBuf(code int, obj interface{}) {\n\tc.Render(code, render.ProtoBuf{Data: obj})\n}\n\n// String writes the given string into the response body.\nfunc (c *Context) String(code int, format string, values ...interface{}) {\n\tc.Render(code, render.String{Format: format, Data: values})\n}\n\n// Redirect returns a HTTP redirect to the specific location.\nfunc (c *Context) Redirect(code int, location string) {\n\tc.Render(-1, render.Redirect{\n\t\tCode: code,\n\t\tLocation: location,\n\t\tRequest: c.Request,\n\t})\n}\n\n// Data writes some data into the body stream and updates the HTTP code.\nfunc (c *Context) Data(code int, contentType string, data []byte) {\n\tc.Render(code, render.Data{\n\t\tContentType: contentType,\n\t\tData: data,\n\t})\n}\n\n// DataFromReader writes the specified reader into the body stream and updates the HTTP code.\nfunc (c *Context) DataFromReader(code int, contentLength int64, contentType string, reader io.Reader, extraHeaders map[string]string) {\n\tc.Render(code, render.Reader{\n\t\tHeaders: extraHeaders,\n\t\tContentType: contentType,\n\t\tContentLength: contentLength,\n\t\tReader: reader,\n\t})\n}\n\n// File writes the specified file into the body stream in a efficient way.\nfunc (c *Context) File(filepath string) {\n\thttp.ServeFile(c.Writer, c.Request, filepath)\n}\n\n// FileAttachment writes the specified file into the body stream in an efficient way\n// On the client side, the file will typically be downloaded with the given filename\nfunc (c *Context) FileAttachment(filepath, filename string) {\n\tc.Writer.Header().Set(\"content-disposition\", fmt.Sprintf(\"attachment; filename=\\\"%s\\\"\", filename))\n\thttp.ServeFile(c.Writer, c.Request, filepath)\n}\n\n// SSEvent writes a Server-Sent Event into the body stream.\nfunc (c *Context) SSEvent(name string, message interface{}) {\n\tc.Render(-1, sse.Event{\n\t\tEvent: name,\n\t\tData: message,\n\t})\n}\n\n// Stream sends a streaming response and returns a boolean\n// indicates \"Is client disconnected in middle of stream\"\nfunc (c *Context) Stream(step func(w io.Writer) bool) bool {\n\tw := c.Writer\n\tclientGone := w.CloseNotify()\n\tfor {\n\t\tselect {\n\t\tcase <-clientGone:\n\t\t\treturn true\n\t\tdefault:\n\t\t\tkeepOpen := step(w)\n\t\t\tw.Flush()\n\t\t\tif !keepOpen {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n}\n\n/************************************/\n/******** CONTENT NEGOTIATION *******/\n/************************************/\n\n// Negotiate contains all negotiations data.\ntype Negotiate struct {\n\tOffered []string\n\tHTMLName string\n\tHTMLData interface{}\n\tJSONData interface{}\n\tXMLData interface{}\n\tData interface{}\n}\n\n// Negotiate calls different Render according acceptable Accept format.\nfunc (c *Context) Negotiate(code int, config Negotiate) {\n\tswitch c.NegotiateFormat(config.Offered...) {\n\tcase binding.MIMEJSON:\n\t\tdata := chooseData(config.JSONData, config.Data)\n\t\tc.JSON(code, data)\n\n\tcase binding.MIMEHTML:\n\t\tdata := chooseData(config.HTMLData, config.Data)\n\t\tc.HTML(code, config.HTMLName, data)\n\n\tcase binding.MIMEXML:\n\t\tdata := chooseData(config.XMLData, config.Data)\n\t\tc.XML(code, data)\n\n\tdefault:\n\t\tc.AbortWithError(http.StatusNotAcceptable, errors.New(\"the accepted formats are not offered by the server\")) // nolint: errcheck\n\t}\n}\n\n// NegotiateFormat returns an acceptable Accept format.\nfunc (c *Context) NegotiateFormat(offered ...string) string {\n\tassert1(len(offered) > 0, \"you must provide at least one offer\")\n\n\tif c.Accepted == nil {\n\t\tc.Accepted = parseAccept(c.requestHeader(\"Accept\"))\n\t}\n\tif len(c.Accepted) == 0 {\n\t\treturn offered[0]\n\t}\n\tfor _, accepted := range c.Accepted {\n\t\tfor _, offert := range offered {\n\t\t\t// According to RFC 2616 and RFC 2396, non-ASCII characters are not allowed in headers,\n\t\t\t// therefore we can just iterate over the string without casting it into []rune\n\t\t\ti := 0\n\t\t\tfor ; i < len(accepted); i++ {\n\t\t\t\tif accepted[i] == '*' || offert[i] == '*' {\n\t\t\t\t\treturn offert\n\t\t\t\t}\n\t\t\t\tif accepted[i] != offert[i] {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif i == len(accepted) {\n\t\t\t\treturn offert\n\t\t\t}\n\t\t}\n\t}\n\treturn \"\"\n}\n\n// SetAccepted sets Accept header data.\nfunc (c *Context) SetAccepted(formats ...string) {\n\tc.Accepted = formats\n}\n\n/************************************/\n/***** GOLANG.ORG/X/NET/CONTEXT *****/\n/************************************/\n\n// Deadline returns the time when work done on behalf of this context\n// should be canceled. Deadline returns ok==false when no deadline is\n// set. Successive calls to Deadline return the same results.\nfunc (c *Context) Deadline() (deadline time.Time, ok bool) {\n\treturn\n}\n\n// Done returns a channel that's closed when work done on behalf of this\n// context should be canceled. Done may return nil if this context can\n// never be canceled. Successive calls to Done return the same value.\nfunc (c *Context) Done() <-chan struct{} {\n\treturn nil\n}\n\n// Err returns a non-nil error value after Done is closed,\n// successive calls to Err return the same error.\n// If Done is not yet closed, Err returns nil.\n// If Done is closed, Err returns a non-nil error explaining why:\n// Canceled if the context was canceled\n// or DeadlineExceeded if the context's deadline passed.\nfunc (c *Context) Err() error {\n\treturn nil\n}\n\n// Value returns the value associated with this context for key, or nil\n// if no value is associated with key. Successive calls to Value with\n// the same key returns the same result.\nfunc (c *Context) Value(key interface{}) interface{} {\n\tif key == 0 {\n\t\treturn c.Request\n\t}\n\tif keyAsString, ok := key.(string); ok {\n\t\tval, _ := c.Get(keyAsString)\n\t\treturn val\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/context_appengine.go", "content": "// +build appengine\n\n// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nfunc init() {\n\tdefaultAppEngine = true\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/debug.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"html/template\"\n\t\"os\"\n\t\"runtime\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nconst ginSupportMinGoVer = 8\n\n// IsDebugging returns true if the framework is running in debug mode.\n// Use SetMode(gin.ReleaseMode) to disable debug mode.\nfunc IsDebugging() bool {\n\treturn ginMode == debugCode\n}\n\n// DebugPrintRouteFunc indicates debug log output format.\nvar DebugPrintRouteFunc func(httpMethod, absolutePath, handlerName string, nuHandlers int)\n\nfunc debugPrintRoute(httpMethod, absolutePath string, handlers HandlersChain) {\n\tif IsDebugging() {\n\t\tnuHandlers := len(handlers)\n\t\thandlerName := nameOfFunction(handlers.Last())\n\t\tif DebugPrintRouteFunc == nil {\n\t\t\tdebugPrint(\"%-6s %-25s --> %s (%d handlers)\\n\", httpMethod, absolutePath, handlerName, nuHandlers)\n\t\t} else {\n\t\t\tDebugPrintRouteFunc(httpMethod, absolutePath, handlerName, nuHandlers)\n\t\t}\n\t}\n}\n\nfunc debugPrintLoadTemplate(tmpl *template.Template) {\n\tif IsDebugging() {\n\t\tvar buf bytes.Buffer\n\t\tfor _, tmpl := range tmpl.Templates() {\n\t\t\tbuf.WriteString(\"\\t- \")\n\t\t\tbuf.WriteString(tmpl.Name())\n\t\t\tbuf.WriteString(\"\\n\")\n\t\t}\n\t\tdebugPrint(\"Loaded HTML Templates (%d): \\n%s\\n\", len(tmpl.Templates()), buf.String())\n\t}\n}\n\nfunc debugPrint(format string, values ...interface{}) {\n\tif IsDebugging() {\n\t\tif !strings.HasSuffix(format, \"\\n\") {\n\t\t\tformat += \"\\n\"\n\t\t}\n\t\tfmt.Fprintf(os.Stderr, \"[GIN-debug] \"+format, values...)\n\t}\n}\n\nfunc getMinVer(v string) (uint64, error) {\n\tfirst := strings.IndexByte(v, '.')\n\tlast := strings.LastIndexByte(v, '.')\n\tif first == last {\n\t\treturn strconv.ParseUint(v[first+1:], 10, 64)\n\t}\n\treturn strconv.ParseUint(v[first+1:last], 10, 64)\n}\n\nfunc debugPrintWARNINGDefault() {\n\tif v, e := getMinVer(runtime.Version()); e == nil && v <= ginSupportMinGoVer {\n\t\tdebugPrint(`[WARNING] Now Gin requires Go 1.8 or later and Go 1.9 will be required soon.\n\n`)\n\t}\n\tdebugPrint(`[WARNING] Creating an Engine instance with the Logger and Recovery middleware already attached.\n\n`)\n}\n\nfunc debugPrintWARNINGNew() {\n\tdebugPrint(`[WARNING] Running in \"debug\" mode. Switch to \"release\" mode in production.\n - using env:\texport GIN_MODE=release\n - using code:\tgin.SetMode(gin.ReleaseMode)\n\n`)\n}\n\nfunc debugPrintWARNINGSetHTMLTemplate() {\n\tdebugPrint(`[WARNING] Since SetHTMLTemplate() is NOT thread-safe. It should only be called\nat initialization. ie. before any route is registered or the router is listening in a socket:\n\n\trouter := gin.Default()\n\trouter.SetHTMLTemplate(template) // << good place\n\n`)\n}\n\nfunc debugPrintError(err error) {\n\tif err != nil {\n\t\tdebugPrint(\"[ERROR] %v\\n\", err)\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/deprecated.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"log\"\n\n\t\"github.com/gin-gonic/gin/binding\"\n)\n\n// BindWith binds the passed struct pointer using the specified binding engine.\n// See the binding package.\nfunc (c *Context) BindWith(obj interface{}, b binding.Binding) error {\n\tlog.Println(`BindWith(\\\"interface{}, binding.Binding\\\") error is going to\n\tbe deprecated, please check issue #662 and either use MustBindWith() if you\n\twant HTTP 400 to be automatically returned if any error occur, or use\n\tShouldBindWith() if you need to manage the error.`)\n\treturn c.MustBindWith(obj, b)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/doc.go", "content": "/*\nPackage gin implements a HTTP web framework called gin.\n\nSee https://gin-gonic.com/ for more information about gin.\n*/\npackage gin // import \"github.com/gin-gonic/gin\"\n" }, { "path": "vendor/github.com/gin-gonic/gin/errors.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/gin-gonic/gin/internal/json\"\n)\n\n// ErrorType is an unsigned 64-bit error code as defined in the gin spec.\ntype ErrorType uint64\n\nconst (\n\t// ErrorTypeBind is used when Context.Bind() fails.\n\tErrorTypeBind ErrorType = 1 << 63\n\t// ErrorTypeRender is used when Context.Render() fails.\n\tErrorTypeRender ErrorType = 1 << 62\n\t// ErrorTypePrivate indicates a private error.\n\tErrorTypePrivate ErrorType = 1 << 0\n\t// ErrorTypePublic indicates a public error.\n\tErrorTypePublic ErrorType = 1 << 1\n\t// ErrorTypeAny indicates any other error.\n\tErrorTypeAny ErrorType = 1<<64 - 1\n\t// ErrorTypeNu indicates any other error.\n\tErrorTypeNu = 2\n)\n\n// Error represents a error's specification.\ntype Error struct {\n\tErr error\n\tType ErrorType\n\tMeta interface{}\n}\n\ntype errorMsgs []*Error\n\nvar _ error = &Error{}\n\n// SetType sets the error's type.\nfunc (msg *Error) SetType(flags ErrorType) *Error {\n\tmsg.Type = flags\n\treturn msg\n}\n\n// SetMeta sets the error's meta data.\nfunc (msg *Error) SetMeta(data interface{}) *Error {\n\tmsg.Meta = data\n\treturn msg\n}\n\n// JSON creates a properly formatted JSON\nfunc (msg *Error) JSON() interface{} {\n\tjson := H{}\n\tif msg.Meta != nil {\n\t\tvalue := reflect.ValueOf(msg.Meta)\n\t\tswitch value.Kind() {\n\t\tcase reflect.Struct:\n\t\t\treturn msg.Meta\n\t\tcase reflect.Map:\n\t\t\tfor _, key := range value.MapKeys() {\n\t\t\t\tjson[key.String()] = value.MapIndex(key).Interface()\n\t\t\t}\n\t\tdefault:\n\t\t\tjson[\"meta\"] = msg.Meta\n\t\t}\n\t}\n\tif _, ok := json[\"error\"]; !ok {\n\t\tjson[\"error\"] = msg.Error()\n\t}\n\treturn json\n}\n\n// MarshalJSON implements the json.Marshaller interface.\nfunc (msg *Error) MarshalJSON() ([]byte, error) {\n\treturn json.Marshal(msg.JSON())\n}\n\n// Error implements the error interface.\nfunc (msg Error) Error() string {\n\treturn msg.Err.Error()\n}\n\n// IsType judges one error.\nfunc (msg *Error) IsType(flags ErrorType) bool {\n\treturn (msg.Type & flags) > 0\n}\n\n// ByType returns a readonly copy filtered the byte.\n// ie ByType(gin.ErrorTypePublic) returns a slice of errors with type=ErrorTypePublic.\nfunc (a errorMsgs) ByType(typ ErrorType) errorMsgs {\n\tif len(a) == 0 {\n\t\treturn nil\n\t}\n\tif typ == ErrorTypeAny {\n\t\treturn a\n\t}\n\tvar result errorMsgs\n\tfor _, msg := range a {\n\t\tif msg.IsType(typ) {\n\t\t\tresult = append(result, msg)\n\t\t}\n\t}\n\treturn result\n}\n\n// Last returns the last error in the slice. It returns nil if the array is empty.\n// Shortcut for errors[len(errors)-1].\nfunc (a errorMsgs) Last() *Error {\n\tif length := len(a); length > 0 {\n\t\treturn a[length-1]\n\t}\n\treturn nil\n}\n\n// Errors returns an array will all the error messages.\n// Example:\n// \t\tc.Error(errors.New(\"first\"))\n// \t\tc.Error(errors.New(\"second\"))\n// \t\tc.Error(errors.New(\"third\"))\n// \t\tc.Errors.Errors() // == []string{\"first\", \"second\", \"third\"}\nfunc (a errorMsgs) Errors() []string {\n\tif len(a) == 0 {\n\t\treturn nil\n\t}\n\terrorStrings := make([]string, len(a))\n\tfor i, err := range a {\n\t\terrorStrings[i] = err.Error()\n\t}\n\treturn errorStrings\n}\n\nfunc (a errorMsgs) JSON() interface{} {\n\tswitch len(a) {\n\tcase 0:\n\t\treturn nil\n\tcase 1:\n\t\treturn a.Last().JSON()\n\tdefault:\n\t\tjson := make([]interface{}, len(a))\n\t\tfor i, err := range a {\n\t\t\tjson[i] = err.JSON()\n\t\t}\n\t\treturn json\n\t}\n}\n\n// MarshalJSON implements the json.Marshaller interface.\nfunc (a errorMsgs) MarshalJSON() ([]byte, error) {\n\treturn json.Marshal(a.JSON())\n}\n\nfunc (a errorMsgs) String() string {\n\tif len(a) == 0 {\n\t\treturn \"\"\n\t}\n\tvar buffer bytes.Buffer\n\tfor i, msg := range a {\n\t\tfmt.Fprintf(&buffer, \"Error #%02d: %s\\n\", i+1, msg.Err)\n\t\tif msg.Meta != nil {\n\t\t\tfmt.Fprintf(&buffer, \" Meta: %v\\n\", msg.Meta)\n\t\t}\n\t}\n\treturn buffer.String()\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/fs.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"net/http\"\n\t\"os\"\n)\n\ntype onlyfilesFS struct {\n\tfs http.FileSystem\n}\n\ntype neuteredReaddirFile struct {\n\thttp.File\n}\n\n// Dir returns a http.Filesystem that can be used by http.FileServer(). It is used internally\n// in router.Static().\n// if listDirectory == true, then it works the same as http.Dir() otherwise it returns\n// a filesystem that prevents http.FileServer() to list the directory files.\nfunc Dir(root string, listDirectory bool) http.FileSystem {\n\tfs := http.Dir(root)\n\tif listDirectory {\n\t\treturn fs\n\t}\n\treturn &onlyfilesFS{fs}\n}\n\n// Open conforms to http.Filesystem.\nfunc (fs onlyfilesFS) Open(name string) (http.File, error) {\n\tf, err := fs.fs.Open(name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn neuteredReaddirFile{f}, nil\n}\n\n// Readdir overrides the http.File default implementation.\nfunc (f neuteredReaddirFile) Readdir(count int) ([]os.FileInfo, error) {\n\t// this disables directory listing\n\treturn nil, nil\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/gin.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"fmt\"\n\t\"html/template\"\n\t\"net\"\n\t\"net/http\"\n\t\"os\"\n\t\"path\"\n\t\"sync\"\n\n\t\"github.com/gin-gonic/gin/render\"\n)\n\nconst defaultMultipartMemory = 32 << 20 // 32 MB\n\nvar (\n\tdefault404Body = []byte(\"404 page not found\")\n\tdefault405Body = []byte(\"405 method not allowed\")\n\tdefaultAppEngine bool\n)\n\n// HandlerFunc defines the handler used by gin middleware as return value.\ntype HandlerFunc func(*Context)\n\n// HandlersChain defines a HandlerFunc array.\ntype HandlersChain []HandlerFunc\n\n// Last returns the last handler in the chain. ie. the last handler is the main own.\nfunc (c HandlersChain) Last() HandlerFunc {\n\tif length := len(c); length > 0 {\n\t\treturn c[length-1]\n\t}\n\treturn nil\n}\n\n// RouteInfo represents a request route's specification which contains method and path and its handler.\ntype RouteInfo struct {\n\tMethod string\n\tPath string\n\tHandler string\n\tHandlerFunc HandlerFunc\n}\n\n// RoutesInfo defines a RouteInfo array.\ntype RoutesInfo []RouteInfo\n\n// Engine is the framework's instance, it contains the muxer, middleware and configuration settings.\n// Create an instance of Engine, by using New() or Default()\ntype Engine struct {\n\tRouterGroup\n\n\t// Enables automatic redirection if the current route can't be matched but a\n\t// handler for the path with (without) the trailing slash exists.\n\t// For example if /foo/ is requested but a route only exists for /foo, the\n\t// client is redirected to /foo with http status code 301 for GET requests\n\t// and 307 for all other request methods.\n\tRedirectTrailingSlash bool\n\n\t// If enabled, the router tries to fix the current request path, if no\n\t// handle is registered for it.\n\t// First superfluous path elements like ../ or // are removed.\n\t// Afterwards the router does a case-insensitive lookup of the cleaned path.\n\t// If a handle can be found for this route, the router makes a redirection\n\t// to the corrected path with status code 301 for GET requests and 307 for\n\t// all other request methods.\n\t// For example /FOO and /..//Foo could be redirected to /foo.\n\t// RedirectTrailingSlash is independent of this option.\n\tRedirectFixedPath bool\n\n\t// If enabled, the router checks if another method is allowed for the\n\t// current route, if the current request can not be routed.\n\t// If this is the case, the request is answered with 'Method Not Allowed'\n\t// and HTTP status code 405.\n\t// If no other Method is allowed, the request is delegated to the NotFound\n\t// handler.\n\tHandleMethodNotAllowed bool\n\tForwardedByClientIP bool\n\n\t// #726 #755 If enabled, it will thrust some headers starting with\n\t// 'X-AppEngine...' for better integration with that PaaS.\n\tAppEngine bool\n\n\t// If enabled, the url.RawPath will be used to find parameters.\n\tUseRawPath bool\n\n\t// If true, the path value will be unescaped.\n\t// If UseRawPath is false (by default), the UnescapePathValues effectively is true,\n\t// as url.Path gonna be used, which is already unescaped.\n\tUnescapePathValues bool\n\n\t// Value of 'maxMemory' param that is given to http.Request's ParseMultipartForm\n\t// method call.\n\tMaxMultipartMemory int64\n\n\tdelims render.Delims\n\tsecureJsonPrefix string\n\tHTMLRender render.HTMLRender\n\tFuncMap template.FuncMap\n\tallNoRoute HandlersChain\n\tallNoMethod HandlersChain\n\tnoRoute HandlersChain\n\tnoMethod HandlersChain\n\tpool sync.Pool\n\ttrees methodTrees\n}\n\nvar _ IRouter = &Engine{}\n\n// New returns a new blank Engine instance without any middleware attached.\n// By default the configuration is:\n// - RedirectTrailingSlash: true\n// - RedirectFixedPath: false\n// - HandleMethodNotAllowed: false\n// - ForwardedByClientIP: true\n// - UseRawPath: false\n// - UnescapePathValues: true\nfunc New() *Engine {\n\tdebugPrintWARNINGNew()\n\tengine := &Engine{\n\t\tRouterGroup: RouterGroup{\n\t\t\tHandlers: nil,\n\t\t\tbasePath: \"/\",\n\t\t\troot: true,\n\t\t},\n\t\tFuncMap: template.FuncMap{},\n\t\tRedirectTrailingSlash: true,\n\t\tRedirectFixedPath: false,\n\t\tHandleMethodNotAllowed: false,\n\t\tForwardedByClientIP: true,\n\t\tAppEngine: defaultAppEngine,\n\t\tUseRawPath: false,\n\t\tUnescapePathValues: true,\n\t\tMaxMultipartMemory: defaultMultipartMemory,\n\t\ttrees: make(methodTrees, 0, 9),\n\t\tdelims: render.Delims{Left: \"{{\", Right: \"}}\"},\n\t\tsecureJsonPrefix: \"while(1);\",\n\t}\n\tengine.RouterGroup.engine = engine\n\tengine.pool.New = func() interface{} {\n\t\treturn engine.allocateContext()\n\t}\n\treturn engine\n}\n\n// Default returns an Engine instance with the Logger and Recovery middleware already attached.\nfunc Default() *Engine {\n\tdebugPrintWARNINGDefault()\n\tengine := New()\n\tengine.Use(Logger(), Recovery())\n\treturn engine\n}\n\nfunc (engine *Engine) allocateContext() *Context {\n\treturn &Context{engine: engine}\n}\n\n// Delims sets template left and right delims and returns a Engine instance.\nfunc (engine *Engine) Delims(left, right string) *Engine {\n\tengine.delims = render.Delims{Left: left, Right: right}\n\treturn engine\n}\n\n// SecureJsonPrefix sets the secureJsonPrefix used in Context.SecureJSON.\nfunc (engine *Engine) SecureJsonPrefix(prefix string) *Engine {\n\tengine.secureJsonPrefix = prefix\n\treturn engine\n}\n\n// LoadHTMLGlob loads HTML files identified by glob pattern\n// and associates the result with HTML renderer.\nfunc (engine *Engine) LoadHTMLGlob(pattern string) {\n\tleft := engine.delims.Left\n\tright := engine.delims.Right\n\ttempl := template.Must(template.New(\"\").Delims(left, right).Funcs(engine.FuncMap).ParseGlob(pattern))\n\n\tif IsDebugging() {\n\t\tdebugPrintLoadTemplate(templ)\n\t\tengine.HTMLRender = render.HTMLDebug{Glob: pattern, FuncMap: engine.FuncMap, Delims: engine.delims}\n\t\treturn\n\t}\n\n\tengine.SetHTMLTemplate(templ)\n}\n\n// LoadHTMLFiles loads a slice of HTML files\n// and associates the result with HTML renderer.\nfunc (engine *Engine) LoadHTMLFiles(files ...string) {\n\tif IsDebugging() {\n\t\tengine.HTMLRender = render.HTMLDebug{Files: files, FuncMap: engine.FuncMap, Delims: engine.delims}\n\t\treturn\n\t}\n\n\ttempl := template.Must(template.New(\"\").Delims(engine.delims.Left, engine.delims.Right).Funcs(engine.FuncMap).ParseFiles(files...))\n\tengine.SetHTMLTemplate(templ)\n}\n\n// SetHTMLTemplate associate a template with HTML renderer.\nfunc (engine *Engine) SetHTMLTemplate(templ *template.Template) {\n\tif len(engine.trees) > 0 {\n\t\tdebugPrintWARNINGSetHTMLTemplate()\n\t}\n\n\tengine.HTMLRender = render.HTMLProduction{Template: templ.Funcs(engine.FuncMap)}\n}\n\n// SetFuncMap sets the FuncMap used for template.FuncMap.\nfunc (engine *Engine) SetFuncMap(funcMap template.FuncMap) {\n\tengine.FuncMap = funcMap\n}\n\n// NoRoute adds handlers for NoRoute. It return a 404 code by default.\nfunc (engine *Engine) NoRoute(handlers ...HandlerFunc) {\n\tengine.noRoute = handlers\n\tengine.rebuild404Handlers()\n}\n\n// NoMethod sets the handlers called when... TODO.\nfunc (engine *Engine) NoMethod(handlers ...HandlerFunc) {\n\tengine.noMethod = handlers\n\tengine.rebuild405Handlers()\n}\n\n// Use attaches a global middleware to the router. ie. the middleware attached though Use() will be\n// included in the handlers chain for every single request. Even 404, 405, static files...\n// For example, this is the right place for a logger or error management middleware.\nfunc (engine *Engine) Use(middleware ...HandlerFunc) IRoutes {\n\tengine.RouterGroup.Use(middleware...)\n\tengine.rebuild404Handlers()\n\tengine.rebuild405Handlers()\n\treturn engine\n}\n\nfunc (engine *Engine) rebuild404Handlers() {\n\tengine.allNoRoute = engine.combineHandlers(engine.noRoute)\n}\n\nfunc (engine *Engine) rebuild405Handlers() {\n\tengine.allNoMethod = engine.combineHandlers(engine.noMethod)\n}\n\nfunc (engine *Engine) addRoute(method, path string, handlers HandlersChain) {\n\tassert1(path[0] == '/', \"path must begin with '/'\")\n\tassert1(method != \"\", \"HTTP method can not be empty\")\n\tassert1(len(handlers) > 0, \"there must be at least one handler\")\n\n\tdebugPrintRoute(method, path, handlers)\n\troot := engine.trees.get(method)\n\tif root == nil {\n\t\troot = new(node)\n\t\tengine.trees = append(engine.trees, methodTree{method: method, root: root})\n\t}\n\troot.addRoute(path, handlers)\n}\n\n// Routes returns a slice of registered routes, including some useful information, such as:\n// the http method, path and the handler name.\nfunc (engine *Engine) Routes() (routes RoutesInfo) {\n\tfor _, tree := range engine.trees {\n\t\troutes = iterate(\"\", tree.method, routes, tree.root)\n\t}\n\treturn routes\n}\n\nfunc iterate(path, method string, routes RoutesInfo, root *node) RoutesInfo {\n\tpath += root.path\n\tif len(root.handlers) > 0 {\n\t\thandlerFunc := root.handlers.Last()\n\t\troutes = append(routes, RouteInfo{\n\t\t\tMethod: method,\n\t\t\tPath: path,\n\t\t\tHandler: nameOfFunction(handlerFunc),\n\t\t\tHandlerFunc: handlerFunc,\n\t\t})\n\t}\n\tfor _, child := range root.children {\n\t\troutes = iterate(path, method, routes, child)\n\t}\n\treturn routes\n}\n\n// Run attaches the router to a http.Server and starts listening and serving HTTP requests.\n// It is a shortcut for http.ListenAndServe(addr, router)\n// Note: this method will block the calling goroutine indefinitely unless an error happens.\nfunc (engine *Engine) Run(addr ...string) (err error) {\n\tdefer func() { debugPrintError(err) }()\n\n\taddress := resolveAddress(addr)\n\tdebugPrint(\"Listening and serving HTTP on %s\\n\", address)\n\terr = http.ListenAndServe(address, engine)\n\treturn\n}\n\n// RunTLS attaches the router to a http.Server and starts listening and serving HTTPS (secure) requests.\n// It is a shortcut for http.ListenAndServeTLS(addr, certFile, keyFile, router)\n// Note: this method will block the calling goroutine indefinitely unless an error happens.\nfunc (engine *Engine) RunTLS(addr, certFile, keyFile string) (err error) {\n\tdebugPrint(\"Listening and serving HTTPS on %s\\n\", addr)\n\tdefer func() { debugPrintError(err) }()\n\n\terr = http.ListenAndServeTLS(addr, certFile, keyFile, engine)\n\treturn\n}\n\n// RunUnix attaches the router to a http.Server and starts listening and serving HTTP requests\n// through the specified unix socket (ie. a file).\n// Note: this method will block the calling goroutine indefinitely unless an error happens.\nfunc (engine *Engine) RunUnix(file string) (err error) {\n\tdebugPrint(\"Listening and serving HTTP on unix:/%s\", file)\n\tdefer func() { debugPrintError(err) }()\n\n\tos.Remove(file)\n\tlistener, err := net.Listen(\"unix\", file)\n\tif err != nil {\n\t\treturn\n\t}\n\tdefer listener.Close()\n\tos.Chmod(file, 0777)\n\terr = http.Serve(listener, engine)\n\treturn\n}\n\n// RunFd attaches the router to a http.Server and starts listening and serving HTTP requests\n// through the specified file descriptor.\n// Note: this method will block the calling goroutine indefinitely unless an error happens.\nfunc (engine *Engine) RunFd(fd int) (err error) {\n\tdebugPrint(\"Listening and serving HTTP on fd@%d\", fd)\n\tdefer func() { debugPrintError(err) }()\n\n\tf := os.NewFile(uintptr(fd), fmt.Sprintf(\"fd@%d\", fd))\n\tlistener, err := net.FileListener(f)\n\tif err != nil {\n\t\treturn\n\t}\n\tdefer listener.Close()\n\terr = http.Serve(listener, engine)\n\treturn\n}\n\n// ServeHTTP conforms to the http.Handler interface.\nfunc (engine *Engine) ServeHTTP(w http.ResponseWriter, req *http.Request) {\n\tc := engine.pool.Get().(*Context)\n\tc.writermem.reset(w)\n\tc.Request = req\n\tc.reset()\n\n\tengine.handleHTTPRequest(c)\n\n\tengine.pool.Put(c)\n}\n\n// HandleContext re-enter a context that has been rewritten.\n// This can be done by setting c.Request.URL.Path to your new target.\n// Disclaimer: You can loop yourself to death with this, use wisely.\nfunc (engine *Engine) HandleContext(c *Context) {\n\toldIndexValue := c.index\n\tc.reset()\n\tengine.handleHTTPRequest(c)\n\n\tc.index = oldIndexValue\n}\n\nfunc (engine *Engine) handleHTTPRequest(c *Context) {\n\thttpMethod := c.Request.Method\n\trPath := c.Request.URL.Path\n\tunescape := false\n\tif engine.UseRawPath && len(c.Request.URL.RawPath) > 0 {\n\t\trPath = c.Request.URL.RawPath\n\t\tunescape = engine.UnescapePathValues\n\t}\n\trPath = cleanPath(rPath)\n\n\t// Find root of the tree for the given HTTP method\n\tt := engine.trees\n\tfor i, tl := 0, len(t); i < tl; i++ {\n\t\tif t[i].method != httpMethod {\n\t\t\tcontinue\n\t\t}\n\t\troot := t[i].root\n\t\t// Find route in tree\n\t\thandlers, params, tsr := root.getValue(rPath, c.Params, unescape)\n\t\tif handlers != nil {\n\t\t\tc.handlers = handlers\n\t\t\tc.Params = params\n\t\t\tc.Next()\n\t\t\tc.writermem.WriteHeaderNow()\n\t\t\treturn\n\t\t}\n\t\tif httpMethod != \"CONNECT\" && rPath != \"/\" {\n\t\t\tif tsr && engine.RedirectTrailingSlash {\n\t\t\t\tredirectTrailingSlash(c)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif engine.RedirectFixedPath && redirectFixedPath(c, root, engine.RedirectFixedPath) {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t\tbreak\n\t}\n\n\tif engine.HandleMethodNotAllowed {\n\t\tfor _, tree := range engine.trees {\n\t\t\tif tree.method == httpMethod {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif handlers, _, _ := tree.root.getValue(rPath, nil, unescape); handlers != nil {\n\t\t\t\tc.handlers = engine.allNoMethod\n\t\t\t\tserveError(c, http.StatusMethodNotAllowed, default405Body)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\tc.handlers = engine.allNoRoute\n\tserveError(c, http.StatusNotFound, default404Body)\n}\n\nvar mimePlain = []string{MIMEPlain}\n\nfunc serveError(c *Context, code int, defaultMessage []byte) {\n\tc.writermem.status = code\n\tc.Next()\n\tif c.writermem.Written() {\n\t\treturn\n\t}\n\tif c.writermem.Status() == code {\n\t\tc.writermem.Header()[\"Content-Type\"] = mimePlain\n\t\t_, err := c.Writer.Write(defaultMessage)\n\t\tif err != nil {\n\t\t\tdebugPrint(\"cannot write message to writer during serve error: %v\", err)\n\t\t}\n\t\treturn\n\t}\n\tc.writermem.WriteHeaderNow()\n\treturn\n}\n\nfunc redirectTrailingSlash(c *Context) {\n\treq := c.Request\n\tp := req.URL.Path\n\tif prefix := path.Clean(c.Request.Header.Get(\"X-Forwarded-Prefix\")); prefix != \".\" {\n\t\tp = prefix + \"/\" + req.URL.Path\n\t}\n\tcode := http.StatusMovedPermanently // Permanent redirect, request with GET method\n\tif req.Method != \"GET\" {\n\t\tcode = http.StatusTemporaryRedirect\n\t}\n\n\treq.URL.Path = p + \"/\"\n\tif length := len(p); length > 1 && p[length-1] == '/' {\n\t\treq.URL.Path = p[:length-1]\n\t}\n\tdebugPrint(\"redirecting request %d: %s --> %s\", code, p, req.URL.String())\n\thttp.Redirect(c.Writer, req, req.URL.String(), code)\n\tc.writermem.WriteHeaderNow()\n}\n\nfunc redirectFixedPath(c *Context, root *node, trailingSlash bool) bool {\n\treq := c.Request\n\trPath := req.URL.Path\n\n\tif fixedPath, ok := root.findCaseInsensitivePath(cleanPath(rPath), trailingSlash); ok {\n\t\tcode := http.StatusMovedPermanently // Permanent redirect, request with GET method\n\t\tif req.Method != \"GET\" {\n\t\t\tcode = http.StatusTemporaryRedirect\n\t\t}\n\t\treq.URL.Path = string(fixedPath)\n\t\tdebugPrint(\"redirecting request %d: %s --> %s\", code, rPath, req.URL.String())\n\t\thttp.Redirect(c.Writer, req, req.URL.String(), code)\n\t\tc.writermem.WriteHeaderNow()\n\t\treturn true\n\t}\n\treturn false\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/go.mod", "content": "module github.com/gin-gonic/gin\n\ngo 1.12\n\nrequire (\n\tgithub.com/gin-contrib/sse v0.0.0-20190301062529-5545eab6dad3\n\tgithub.com/golang/protobuf v1.3.1\n\tgithub.com/json-iterator/go v1.1.6\n\tgithub.com/mattn/go-isatty v0.0.7\n\tgithub.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd // indirect\n\tgithub.com/modern-go/reflect2 v1.0.1 // indirect\n\tgithub.com/stretchr/testify v1.3.0\n\tgithub.com/ugorji/go v1.1.4\n\tgolang.org/x/net v0.0.0-20190503192946-f4e77d36d62c\n\tgopkg.in/go-playground/assert.v1 v1.2.1 // indirect\n\tgopkg.in/go-playground/validator.v8 v8.18.2\n\tgopkg.in/yaml.v2 v2.2.2\n)\n" }, { "path": "vendor/github.com/gin-gonic/gin/go.sum", "content": "github.com/davecgh/go-spew v1.1.0 h1:ZDRjVQ15GmhC3fiQ8ni8+OwkZQO4DARzQgrnXU1Liz8=\ngithub.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/gin-contrib/sse v0.0.0-20190301062529-5545eab6dad3 h1:t8FVkw33L+wilf2QiWkw0UV77qRpcH/JHPKGpKa2E8g=\ngithub.com/gin-contrib/sse v0.0.0-20190301062529-5545eab6dad3/go.mod h1:VJ0WA2NBN22VlZ2dKZQPAPnyWw5XTlK1KymzLKsr59s=\ngithub.com/golang/protobuf v1.3.1 h1:YF8+flBXS5eO826T4nzqPrxfhQThhXl0YzfuUPu4SBg=\ngithub.com/golang/protobuf v1.3.1/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/json-iterator/go v1.1.6 h1:MrUvLMLTMxbqFJ9kzlvat/rYZqZnW3u4wkLzWTaFwKs=\ngithub.com/json-iterator/go v1.1.6/go.mod h1:+SdeFBvtyEkXs7REEP0seUULqWtbJapLOCVDaaPEHmU=\ngithub.com/mattn/go-isatty v0.0.7 h1:UvyT9uN+3r7yLEYSlJsbQGdsaB/a0DlgWP3pql6iwOc=\ngithub.com/mattn/go-isatty v0.0.7/go.mod h1:Iq45c/XA43vh69/j3iqttzPXn0bhXyGjM0Hdxcsrc5s=\ngithub.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd h1:TRLaZ9cD/w8PVh93nsPXa1VrQ6jlwL5oN8l14QlcNfg=\ngithub.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd/go.mod h1:6dJC0mAP4ikYIbvyc7fijjWJddQyLn8Ig3JB5CqoB9Q=\ngithub.com/modern-go/reflect2 v1.0.1 h1:9f412s+6RmYXLWZSEzVVgPGK7C2PphHj5RJrvfx9AWI=\ngithub.com/modern-go/reflect2 v1.0.1/go.mod h1:bx2lNnkwVCuqBIxFjflWJWanXIb3RllmbCylyMrvgv0=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.3.0 h1:TivCn/peBQ7UY8ooIcPgZFpTNSz0Q2U6UrFlUfqbe0Q=\ngithub.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI=\ngithub.com/ugorji/go v1.1.4 h1:j4s+tAvLfL3bZyefP2SEWmhBzmuIlH/eqNuPdFPgngw=\ngithub.com/ugorji/go v1.1.4/go.mod h1:uQMGLiO92mf5W77hV/PUCpI3pbzQx3CRekS0kk+RGrc=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/net v0.0.0-20190503192946-f4e77d36d62c h1:uOCk1iQW6Vc18bnC13MfzScl+wdKBmM9Y9kU7Z83/lw=\ngolang.org/x/net v0.0.0-20190503192946-f4e77d36d62c/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223 h1:DH4skfRX4EBpamg7iV4ZlCpblAHI6s6TDM39bFZumv8=\ngolang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/go-playground/assert.v1 v1.2.1 h1:xoYuJVE7KT85PYWrN730RguIQO0ePzVRfFMXadIrXTM=\ngopkg.in/go-playground/assert.v1 v1.2.1/go.mod h1:9RXL0bg/zibRAgZUYszZSwO/z8Y/a8bDuhia5mkpMnE=\ngopkg.in/go-playground/validator.v8 v8.18.2 h1:lFB4DoMU6B626w8ny76MV7VX6W2VHct2GVOI3xgiMrQ=\ngopkg.in/go-playground/validator.v8 v8.18.2/go.mod h1:RX2a/7Ha8BgOhfk7j780h4/u/RRjR0eouCJSH80/M2Y=\ngopkg.in/yaml.v2 v2.2.2 h1:ZCJp+EgiOT7lHqUV2J862kp8Qj64Jo6az82+3Td9dZw=\ngopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/gin-gonic/gin/internal/json/json.go", "content": "// Copyright 2017 Bo-Yi Wu. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\n// +build !jsoniter\n\npackage json\n\nimport \"encoding/json\"\n\nvar (\n\t// Marshal is exported by gin/json package.\n\tMarshal = json.Marshal\n\t// Unmarshal is exported by gin/json package.\n\tUnmarshal = json.Unmarshal\n\t// MarshalIndent is exported by gin/json package.\n\tMarshalIndent = json.MarshalIndent\n\t// NewDecoder is exported by gin/json package.\n\tNewDecoder = json.NewDecoder\n\t// NewEncoder is exported by gin/json package.\n\tNewEncoder = json.NewEncoder\n)\n" }, { "path": "vendor/github.com/gin-gonic/gin/internal/json/jsoniter.go", "content": "// Copyright 2017 Bo-Yi Wu. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\n// +build jsoniter\n\npackage json\n\nimport \"github.com/json-iterator/go\"\n\nvar (\n\tjson = jsoniter.ConfigCompatibleWithStandardLibrary\n\t// Marshal is exported by gin/json package.\n\tMarshal = json.Marshal\n\t// Unmarshal is exported by gin/json package.\n\tUnmarshal = json.Unmarshal\n\t// MarshalIndent is exported by gin/json package.\n\tMarshalIndent = json.MarshalIndent\n\t// NewDecoder is exported by gin/json package.\n\tNewDecoder = json.NewDecoder\n\t// NewEncoder is exported by gin/json package.\n\tNewEncoder = json.NewEncoder\n)\n" }, { "path": "vendor/github.com/gin-gonic/gin/logger.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"os\"\n\t\"time\"\n\n\t\"github.com/mattn/go-isatty\"\n)\n\ntype consoleColorModeValue int\n\nconst (\n\tautoColor consoleColorModeValue = iota\n\tdisableColor\n\tforceColor\n)\n\nvar (\n\tgreen = string([]byte{27, 91, 57, 55, 59, 52, 50, 109})\n\twhite = string([]byte{27, 91, 57, 48, 59, 52, 55, 109})\n\tyellow = string([]byte{27, 91, 57, 48, 59, 52, 51, 109})\n\tred = string([]byte{27, 91, 57, 55, 59, 52, 49, 109})\n\tblue = string([]byte{27, 91, 57, 55, 59, 52, 52, 109})\n\tmagenta = string([]byte{27, 91, 57, 55, 59, 52, 53, 109})\n\tcyan = string([]byte{27, 91, 57, 55, 59, 52, 54, 109})\n\treset = string([]byte{27, 91, 48, 109})\n\tconsoleColorMode = autoColor\n)\n\n// LoggerConfig defines the config for Logger middleware.\ntype LoggerConfig struct {\n\t// Optional. Default value is gin.defaultLogFormatter\n\tFormatter LogFormatter\n\n\t// Output is a writer where logs are written.\n\t// Optional. Default value is gin.DefaultWriter.\n\tOutput io.Writer\n\n\t// SkipPaths is a url path array which logs are not written.\n\t// Optional.\n\tSkipPaths []string\n}\n\n// LogFormatter gives the signature of the formatter function passed to LoggerWithFormatter\ntype LogFormatter func(params LogFormatterParams) string\n\n// LogFormatterParams is the structure any formatter will be handed when time to log comes\ntype LogFormatterParams struct {\n\tRequest *http.Request\n\n\t// TimeStamp shows the time after the server returns a response.\n\tTimeStamp time.Time\n\t// StatusCode is HTTP response code.\n\tStatusCode int\n\t// Latency is how much time the server cost to process a certain request.\n\tLatency time.Duration\n\t// ClientIP equals Context's ClientIP method.\n\tClientIP string\n\t// Method is the HTTP method given to the request.\n\tMethod string\n\t// Path is a path the client requests.\n\tPath string\n\t// ErrorMessage is set if error has occurred in processing the request.\n\tErrorMessage string\n\t// isTerm shows whether does gin's output descriptor refers to a terminal.\n\tisTerm bool\n\t// BodySize is the size of the Response Body\n\tBodySize int\n\t// Keys are the keys set on the request's context.\n\tKeys map[string]interface{}\n}\n\n// StatusCodeColor is the ANSI color for appropriately logging http status code to a terminal.\nfunc (p *LogFormatterParams) StatusCodeColor() string {\n\tcode := p.StatusCode\n\n\tswitch {\n\tcase code >= http.StatusOK && code < http.StatusMultipleChoices:\n\t\treturn green\n\tcase code >= http.StatusMultipleChoices && code < http.StatusBadRequest:\n\t\treturn white\n\tcase code >= http.StatusBadRequest && code < http.StatusInternalServerError:\n\t\treturn yellow\n\tdefault:\n\t\treturn red\n\t}\n}\n\n// MethodColor is the ANSI color for appropriately logging http method to a terminal.\nfunc (p *LogFormatterParams) MethodColor() string {\n\tmethod := p.Method\n\n\tswitch method {\n\tcase \"GET\":\n\t\treturn blue\n\tcase \"POST\":\n\t\treturn cyan\n\tcase \"PUT\":\n\t\treturn yellow\n\tcase \"DELETE\":\n\t\treturn red\n\tcase \"PATCH\":\n\t\treturn green\n\tcase \"HEAD\":\n\t\treturn magenta\n\tcase \"OPTIONS\":\n\t\treturn white\n\tdefault:\n\t\treturn reset\n\t}\n}\n\n// ResetColor resets all escape attributes.\nfunc (p *LogFormatterParams) ResetColor() string {\n\treturn reset\n}\n\n// IsOutputColor indicates whether can colors be outputted to the log.\nfunc (p *LogFormatterParams) IsOutputColor() bool {\n\treturn consoleColorMode == forceColor || (consoleColorMode == autoColor && p.isTerm)\n}\n\n// defaultLogFormatter is the default log format function Logger middleware uses.\nvar defaultLogFormatter = func(param LogFormatterParams) string {\n\tvar statusColor, methodColor, resetColor string\n\tif param.IsOutputColor() {\n\t\tstatusColor = param.StatusCodeColor()\n\t\tmethodColor = param.MethodColor()\n\t\tresetColor = param.ResetColor()\n\t}\n\n\tif param.Latency > time.Minute {\n\t\t// Truncate in a golang < 1.8 safe way\n\t\tparam.Latency = param.Latency - param.Latency%time.Second\n\t}\n\treturn fmt.Sprintf(\"[GIN] %v |%s %3d %s| %13v | %15s |%s %-7s %s %s\\n%s\",\n\t\tparam.TimeStamp.Format(\"2006/01/02 - 15:04:05\"),\n\t\tstatusColor, param.StatusCode, resetColor,\n\t\tparam.Latency,\n\t\tparam.ClientIP,\n\t\tmethodColor, param.Method, resetColor,\n\t\tparam.Path,\n\t\tparam.ErrorMessage,\n\t)\n}\n\n// DisableConsoleColor disables color output in the console.\nfunc DisableConsoleColor() {\n\tconsoleColorMode = disableColor\n}\n\n// ForceConsoleColor force color output in the console.\nfunc ForceConsoleColor() {\n\tconsoleColorMode = forceColor\n}\n\n// ErrorLogger returns a handlerfunc for any error type.\nfunc ErrorLogger() HandlerFunc {\n\treturn ErrorLoggerT(ErrorTypeAny)\n}\n\n// ErrorLoggerT returns a handlerfunc for a given error type.\nfunc ErrorLoggerT(typ ErrorType) HandlerFunc {\n\treturn func(c *Context) {\n\t\tc.Next()\n\t\terrors := c.Errors.ByType(typ)\n\t\tif len(errors) > 0 {\n\t\t\tc.JSON(-1, errors)\n\t\t}\n\t}\n}\n\n// Logger instances a Logger middleware that will write the logs to gin.DefaultWriter.\n// By default gin.DefaultWriter = os.Stdout.\nfunc Logger() HandlerFunc {\n\treturn LoggerWithConfig(LoggerConfig{})\n}\n\n// LoggerWithFormatter instance a Logger middleware with the specified log format function.\nfunc LoggerWithFormatter(f LogFormatter) HandlerFunc {\n\treturn LoggerWithConfig(LoggerConfig{\n\t\tFormatter: f,\n\t})\n}\n\n// LoggerWithWriter instance a Logger middleware with the specified writer buffer.\n// Example: os.Stdout, a file opened in write mode, a socket...\nfunc LoggerWithWriter(out io.Writer, notlogged ...string) HandlerFunc {\n\treturn LoggerWithConfig(LoggerConfig{\n\t\tOutput: out,\n\t\tSkipPaths: notlogged,\n\t})\n}\n\n// LoggerWithConfig instance a Logger middleware with config.\nfunc LoggerWithConfig(conf LoggerConfig) HandlerFunc {\n\tformatter := conf.Formatter\n\tif formatter == nil {\n\t\tformatter = defaultLogFormatter\n\t}\n\n\tout := conf.Output\n\tif out == nil {\n\t\tout = DefaultWriter\n\t}\n\n\tnotlogged := conf.SkipPaths\n\n\tisTerm := true\n\n\tif w, ok := out.(*os.File); !ok || os.Getenv(\"TERM\") == \"dumb\" ||\n\t\t(!isatty.IsTerminal(w.Fd()) && !isatty.IsCygwinTerminal(w.Fd())) {\n\t\tisTerm = false\n\t}\n\n\tvar skip map[string]struct{}\n\n\tif length := len(notlogged); length > 0 {\n\t\tskip = make(map[string]struct{}, length)\n\n\t\tfor _, path := range notlogged {\n\t\t\tskip[path] = struct{}{}\n\t\t}\n\t}\n\n\treturn func(c *Context) {\n\t\t// Start timer\n\t\tstart := time.Now()\n\t\tpath := c.Request.URL.Path\n\t\traw := c.Request.URL.RawQuery\n\n\t\t// Process request\n\t\tc.Next()\n\n\t\t// Log only when path is not being skipped\n\t\tif _, ok := skip[path]; !ok {\n\t\t\tparam := LogFormatterParams{\n\t\t\t\tRequest: c.Request,\n\t\t\t\tisTerm: isTerm,\n\t\t\t\tKeys: c.Keys,\n\t\t\t}\n\n\t\t\t// Stop timer\n\t\t\tparam.TimeStamp = time.Now()\n\t\t\tparam.Latency = param.TimeStamp.Sub(start)\n\n\t\t\tparam.ClientIP = c.ClientIP()\n\t\t\tparam.Method = c.Request.Method\n\t\t\tparam.StatusCode = c.Writer.Status()\n\t\t\tparam.ErrorMessage = c.Errors.ByType(ErrorTypePrivate).String()\n\n\t\t\tparam.BodySize = c.Writer.Size()\n\n\t\t\tif raw != \"\" {\n\t\t\t\tpath = path + \"?\" + raw\n\t\t\t}\n\n\t\t\tparam.Path = path\n\n\t\t\tfmt.Fprint(out, formatter(param))\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/mode.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"io\"\n\t\"os\"\n\n\t\"github.com/gin-gonic/gin/binding\"\n)\n\n// EnvGinMode indicates environment name for gin mode.\nconst EnvGinMode = \"GIN_MODE\"\n\nconst (\n\t// DebugMode indicates gin mode is debug.\n\tDebugMode = \"debug\"\n\t// ReleaseMode indicates gin mode is release.\n\tReleaseMode = \"release\"\n\t// TestMode indicates gin mode is test.\n\tTestMode = \"test\"\n)\nconst (\n\tdebugCode = iota\n\treleaseCode\n\ttestCode\n)\n\n// DefaultWriter is the default io.Writer used by Gin for debug output and\n// middleware output like Logger() or Recovery().\n// Note that both Logger and Recovery provides custom ways to configure their\n// output io.Writer.\n// To support coloring in Windows use:\n// \t\timport \"github.com/mattn/go-colorable\"\n// \t\tgin.DefaultWriter = colorable.NewColorableStdout()\nvar DefaultWriter io.Writer = os.Stdout\n\n// DefaultErrorWriter is the default io.Writer used by Gin to debug errors\nvar DefaultErrorWriter io.Writer = os.Stderr\n\nvar ginMode = debugCode\nvar modeName = DebugMode\n\nfunc init() {\n\tmode := os.Getenv(EnvGinMode)\n\tSetMode(mode)\n}\n\n// SetMode sets gin mode according to input string.\nfunc SetMode(value string) {\n\tswitch value {\n\tcase DebugMode, \"\":\n\t\tginMode = debugCode\n\tcase ReleaseMode:\n\t\tginMode = releaseCode\n\tcase TestMode:\n\t\tginMode = testCode\n\tdefault:\n\t\tpanic(\"gin mode unknown: \" + value)\n\t}\n\tif value == \"\" {\n\t\tvalue = DebugMode\n\t}\n\tmodeName = value\n}\n\n// DisableBindValidation closes the default validator.\nfunc DisableBindValidation() {\n\tbinding.Validator = nil\n}\n\n// EnableJsonDecoderUseNumber sets true for binding.EnableDecoderUseNumberto to\n// call the UseNumber method on the JSON Decoder instance.\nfunc EnableJsonDecoderUseNumber() {\n\tbinding.EnableDecoderUseNumber = true\n}\n\n// Mode returns currently gin mode.\nfunc Mode() string {\n\treturn modeName\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/path.go", "content": "// Copyright 2013 Julien Schmidt. All rights reserved.\n// Based on the path package, Copyright 2009 The Go Authors.\n// Use of this source code is governed by a BSD-style license that can be found\n// at https://github.com/julienschmidt/httprouter/blob/master/LICENSE.\n\npackage gin\n\n// cleanPath is the URL version of path.Clean, it returns a canonical URL path\n// for p, eliminating . and .. elements.\n//\n// The following rules are applied iteratively until no further processing can\n// be done:\n//\t1. Replace multiple slashes with a single slash.\n//\t2. Eliminate each . path name element (the current directory).\n//\t3. Eliminate each inner .. path name element (the parent directory)\n//\t along with the non-.. element that precedes it.\n//\t4. Eliminate .. elements that begin a rooted path:\n//\t that is, replace \"/..\" by \"/\" at the beginning of a path.\n//\n// If the result of this process is an empty string, \"/\" is returned.\nfunc cleanPath(p string) string {\n\t// Turn empty string into \"/\"\n\tif p == \"\" {\n\t\treturn \"/\"\n\t}\n\n\tn := len(p)\n\tvar buf []byte\n\n\t// Invariants:\n\t// reading from path; r is index of next byte to process.\n\t// writing to buf; w is index of next byte to write.\n\n\t// path must start with '/'\n\tr := 1\n\tw := 1\n\n\tif p[0] != '/' {\n\t\tr = 0\n\t\tbuf = make([]byte, n+1)\n\t\tbuf[0] = '/'\n\t}\n\n\ttrailing := n > 1 && p[n-1] == '/'\n\n\t// A bit more clunky without a 'lazybuf' like the path package, but the loop\n\t// gets completely inlined (bufApp). So in contrast to the path package this\n\t// loop has no expensive function calls (except 1x make)\n\n\tfor r < n {\n\t\tswitch {\n\t\tcase p[r] == '/':\n\t\t\t// empty path element, trailing slash is added after the end\n\t\t\tr++\n\n\t\tcase p[r] == '.' && r+1 == n:\n\t\t\ttrailing = true\n\t\t\tr++\n\n\t\tcase p[r] == '.' && p[r+1] == '/':\n\t\t\t// . element\n\t\t\tr += 2\n\n\t\tcase p[r] == '.' && p[r+1] == '.' && (r+2 == n || p[r+2] == '/'):\n\t\t\t// .. element: remove to last /\n\t\t\tr += 3\n\n\t\t\tif w > 1 {\n\t\t\t\t// can backtrack\n\t\t\t\tw--\n\n\t\t\t\tif buf == nil {\n\t\t\t\t\tfor w > 1 && p[w] != '/' {\n\t\t\t\t\t\tw--\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tfor w > 1 && buf[w] != '/' {\n\t\t\t\t\t\tw--\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\tdefault:\n\t\t\t// real path element.\n\t\t\t// add slash if needed\n\t\t\tif w > 1 {\n\t\t\t\tbufApp(&buf, p, w, '/')\n\t\t\t\tw++\n\t\t\t}\n\n\t\t\t// copy element\n\t\t\tfor r < n && p[r] != '/' {\n\t\t\t\tbufApp(&buf, p, w, p[r])\n\t\t\t\tw++\n\t\t\t\tr++\n\t\t\t}\n\t\t}\n\t}\n\n\t// re-append trailing slash\n\tif trailing && w > 1 {\n\t\tbufApp(&buf, p, w, '/')\n\t\tw++\n\t}\n\n\tif buf == nil {\n\t\treturn p[:w]\n\t}\n\treturn string(buf[:w])\n}\n\n// internal helper to lazily create a buffer if necessary.\nfunc bufApp(buf *[]byte, s string, w int, c byte) {\n\tif *buf == nil {\n\t\tif s[w] == c {\n\t\t\treturn\n\t\t}\n\n\t\t*buf = make([]byte, len(s))\n\t\tcopy(*buf, s[:w])\n\t}\n\t(*buf)[w] = c\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/recovery.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"net\"\n\t\"net/http\"\n\t\"net/http/httputil\"\n\t\"os\"\n\t\"runtime\"\n\t\"strings\"\n\t\"time\"\n)\n\nvar (\n\tdunno = []byte(\"???\")\n\tcenterDot = []byte(\"·\")\n\tdot = []byte(\".\")\n\tslash = []byte(\"/\")\n)\n\n// Recovery returns a middleware that recovers from any panics and writes a 500 if there was one.\nfunc Recovery() HandlerFunc {\n\treturn RecoveryWithWriter(DefaultErrorWriter)\n}\n\n// RecoveryWithWriter returns a middleware for a given writer that recovers from any panics and writes a 500 if there was one.\nfunc RecoveryWithWriter(out io.Writer) HandlerFunc {\n\tvar logger *log.Logger\n\tif out != nil {\n\t\tlogger = log.New(out, \"\\n\\n\\x1b[31m\", log.LstdFlags)\n\t}\n\treturn func(c *Context) {\n\t\tdefer func() {\n\t\t\tif err := recover(); err != nil {\n\t\t\t\t// Check for a broken connection, as it is not really a\n\t\t\t\t// condition that warrants a panic stack trace.\n\t\t\t\tvar brokenPipe bool\n\t\t\t\tif ne, ok := err.(*net.OpError); ok {\n\t\t\t\t\tif se, ok := ne.Err.(*os.SyscallError); ok {\n\t\t\t\t\t\tif strings.Contains(strings.ToLower(se.Error()), \"broken pipe\") || strings.Contains(strings.ToLower(se.Error()), \"connection reset by peer\") {\n\t\t\t\t\t\t\tbrokenPipe = true\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif logger != nil {\n\t\t\t\t\tstack := stack(3)\n\t\t\t\t\thttpRequest, _ := httputil.DumpRequest(c.Request, false)\n\t\t\t\t\theaders := strings.Split(string(httpRequest), \"\\r\\n\")\n\t\t\t\t\tfor idx, header := range headers {\n\t\t\t\t\t\tcurrent := strings.Split(header, \":\")\n\t\t\t\t\t\tif current[0] == \"Authorization\" {\n\t\t\t\t\t\t\theaders[idx] = current[0] + \": *\"\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif brokenPipe {\n\t\t\t\t\t\tlogger.Printf(\"%s\\n%s%s\", err, string(httpRequest), reset)\n\t\t\t\t\t} else if IsDebugging() {\n\t\t\t\t\t\tlogger.Printf(\"[Recovery] %s panic recovered:\\n%s\\n%s\\n%s%s\",\n\t\t\t\t\t\t\ttimeFormat(time.Now()), strings.Join(headers, \"\\r\\n\"), err, stack, reset)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tlogger.Printf(\"[Recovery] %s panic recovered:\\n%s\\n%s%s\",\n\t\t\t\t\t\t\ttimeFormat(time.Now()), err, stack, reset)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// If the connection is dead, we can't write a status to it.\n\t\t\t\tif brokenPipe {\n\t\t\t\t\tc.Error(err.(error)) // nolint: errcheck\n\t\t\t\t\tc.Abort()\n\t\t\t\t} else {\n\t\t\t\t\tc.AbortWithStatus(http.StatusInternalServerError)\n\t\t\t\t}\n\t\t\t}\n\t\t}()\n\t\tc.Next()\n\t}\n}\n\n// stack returns a nicely formatted stack frame, skipping skip frames.\nfunc stack(skip int) []byte {\n\tbuf := new(bytes.Buffer) // the returned data\n\t// As we loop, we open files and read them. These variables record the currently\n\t// loaded file.\n\tvar lines [][]byte\n\tvar lastFile string\n\tfor i := skip; ; i++ { // Skip the expected number of frames\n\t\tpc, file, line, ok := runtime.Caller(i)\n\t\tif !ok {\n\t\t\tbreak\n\t\t}\n\t\t// Print this much at least. If we can't find the source, it won't show.\n\t\tfmt.Fprintf(buf, \"%s:%d (0x%x)\\n\", file, line, pc)\n\t\tif file != lastFile {\n\t\t\tdata, err := ioutil.ReadFile(file)\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tlines = bytes.Split(data, []byte{'\\n'})\n\t\t\tlastFile = file\n\t\t}\n\t\tfmt.Fprintf(buf, \"\\t%s: %s\\n\", function(pc), source(lines, line))\n\t}\n\treturn buf.Bytes()\n}\n\n// source returns a space-trimmed slice of the n'th line.\nfunc source(lines [][]byte, n int) []byte {\n\tn-- // in stack trace, lines are 1-indexed but our array is 0-indexed\n\tif n < 0 || n >= len(lines) {\n\t\treturn dunno\n\t}\n\treturn bytes.TrimSpace(lines[n])\n}\n\n// function returns, if possible, the name of the function containing the PC.\nfunc function(pc uintptr) []byte {\n\tfn := runtime.FuncForPC(pc)\n\tif fn == nil {\n\t\treturn dunno\n\t}\n\tname := []byte(fn.Name())\n\t// The name includes the path name to the package, which is unnecessary\n\t// since the file name is already included. Plus, it has center dots.\n\t// That is, we see\n\t//\truntime/debug.*T·ptrmethod\n\t// and want\n\t//\t*T.ptrmethod\n\t// Also the package path might contains dot (e.g. code.google.com/...),\n\t// so first eliminate the path prefix\n\tif lastSlash := bytes.LastIndex(name, slash); lastSlash >= 0 {\n\t\tname = name[lastSlash+1:]\n\t}\n\tif period := bytes.Index(name, dot); period >= 0 {\n\t\tname = name[period+1:]\n\t}\n\tname = bytes.Replace(name, centerDot, dot, -1)\n\treturn name\n}\n\nfunc timeFormat(t time.Time) string {\n\tvar timeString = t.Format(\"2006/01/02 - 15:04:05\")\n\treturn timeString\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/data.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport \"net/http\"\n\n// Data contains ContentType and bytes data.\ntype Data struct {\n\tContentType string\n\tData []byte\n}\n\n// Render (Data) writes data with custom ContentType.\nfunc (r Data) Render(w http.ResponseWriter) (err error) {\n\tr.WriteContentType(w)\n\t_, err = w.Write(r.Data)\n\treturn\n}\n\n// WriteContentType (Data) writes custom ContentType.\nfunc (r Data) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, []string{r.ContentType})\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/html.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"html/template\"\n\t\"net/http\"\n)\n\n// Delims represents a set of Left and Right delimiters for HTML template rendering.\ntype Delims struct {\n\t// Left delimiter, defaults to {{.\n\tLeft string\n\t// Right delimiter, defaults to }}.\n\tRight string\n}\n\n// HTMLRender interface is to be implemented by HTMLProduction and HTMLDebug.\ntype HTMLRender interface {\n\t// Instance returns an HTML instance.\n\tInstance(string, interface{}) Render\n}\n\n// HTMLProduction contains template reference and its delims.\ntype HTMLProduction struct {\n\tTemplate *template.Template\n\tDelims Delims\n}\n\n// HTMLDebug contains template delims and pattern and function with file list.\ntype HTMLDebug struct {\n\tFiles []string\n\tGlob string\n\tDelims Delims\n\tFuncMap template.FuncMap\n}\n\n// HTML contains template reference and its name with given interface object.\ntype HTML struct {\n\tTemplate *template.Template\n\tName string\n\tData interface{}\n}\n\nvar htmlContentType = []string{\"text/html; charset=utf-8\"}\n\n// Instance (HTMLProduction) returns an HTML instance which it realizes Render interface.\nfunc (r HTMLProduction) Instance(name string, data interface{}) Render {\n\treturn HTML{\n\t\tTemplate: r.Template,\n\t\tName: name,\n\t\tData: data,\n\t}\n}\n\n// Instance (HTMLDebug) returns an HTML instance which it realizes Render interface.\nfunc (r HTMLDebug) Instance(name string, data interface{}) Render {\n\treturn HTML{\n\t\tTemplate: r.loadTemplate(),\n\t\tName: name,\n\t\tData: data,\n\t}\n}\nfunc (r HTMLDebug) loadTemplate() *template.Template {\n\tif r.FuncMap == nil {\n\t\tr.FuncMap = template.FuncMap{}\n\t}\n\tif len(r.Files) > 0 {\n\t\treturn template.Must(template.New(\"\").Delims(r.Delims.Left, r.Delims.Right).Funcs(r.FuncMap).ParseFiles(r.Files...))\n\t}\n\tif r.Glob != \"\" {\n\t\treturn template.Must(template.New(\"\").Delims(r.Delims.Left, r.Delims.Right).Funcs(r.FuncMap).ParseGlob(r.Glob))\n\t}\n\tpanic(\"the HTML debug render was created without files or glob pattern\")\n}\n\n// Render (HTML) executes template and writes its result with custom ContentType for response.\nfunc (r HTML) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\n\tif r.Name == \"\" {\n\t\treturn r.Template.Execute(w, r.Data)\n\t}\n\treturn r.Template.ExecuteTemplate(w, r.Name, r.Data)\n}\n\n// WriteContentType (HTML) writes HTML ContentType.\nfunc (r HTML) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, htmlContentType)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/json.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"html/template\"\n\t\"net/http\"\n\n\t\"github.com/gin-gonic/gin/internal/json\"\n)\n\n// JSON contains the given interface object.\ntype JSON struct {\n\tData interface{}\n}\n\n// IndentedJSON contains the given interface object.\ntype IndentedJSON struct {\n\tData interface{}\n}\n\n// SecureJSON contains the given interface object and its prefix.\ntype SecureJSON struct {\n\tPrefix string\n\tData interface{}\n}\n\n// JsonpJSON contains the given interface object its callback.\ntype JsonpJSON struct {\n\tCallback string\n\tData interface{}\n}\n\n// AsciiJSON contains the given interface object.\ntype AsciiJSON struct {\n\tData interface{}\n}\n\n// SecureJSONPrefix is a string which represents SecureJSON prefix.\ntype SecureJSONPrefix string\n\n// PureJSON contains the given interface object.\ntype PureJSON struct {\n\tData interface{}\n}\n\nvar jsonContentType = []string{\"application/json; charset=utf-8\"}\nvar jsonpContentType = []string{\"application/javascript; charset=utf-8\"}\nvar jsonAsciiContentType = []string{\"application/json\"}\n\n// Render (JSON) writes data with custom ContentType.\nfunc (r JSON) Render(w http.ResponseWriter) (err error) {\n\tif err = WriteJSON(w, r.Data); err != nil {\n\t\tpanic(err)\n\t}\n\treturn\n}\n\n// WriteContentType (JSON) writes JSON ContentType.\nfunc (r JSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonContentType)\n}\n\n// WriteJSON marshals the given interface object and writes it with custom ContentType.\nfunc WriteJSON(w http.ResponseWriter, obj interface{}) error {\n\twriteContentType(w, jsonContentType)\n\tjsonBytes, err := json.Marshal(obj)\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = w.Write(jsonBytes)\n\treturn err\n}\n\n// Render (IndentedJSON) marshals the given interface object and writes it with custom ContentType.\nfunc (r IndentedJSON) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\tjsonBytes, err := json.MarshalIndent(r.Data, \"\", \" \")\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = w.Write(jsonBytes)\n\treturn err\n}\n\n// WriteContentType (IndentedJSON) writes JSON ContentType.\nfunc (r IndentedJSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonContentType)\n}\n\n// Render (SecureJSON) marshals the given interface object and writes it with custom ContentType.\nfunc (r SecureJSON) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\tjsonBytes, err := json.Marshal(r.Data)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// if the jsonBytes is array values\n\tif bytes.HasPrefix(jsonBytes, []byte(\"[\")) && bytes.HasSuffix(jsonBytes, []byte(\"]\")) {\n\t\t_, err = w.Write([]byte(r.Prefix))\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t_, err = w.Write(jsonBytes)\n\treturn err\n}\n\n// WriteContentType (SecureJSON) writes JSON ContentType.\nfunc (r SecureJSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonContentType)\n}\n\n// Render (JsonpJSON) marshals the given interface object and writes it and its callback with custom ContentType.\nfunc (r JsonpJSON) Render(w http.ResponseWriter) (err error) {\n\tr.WriteContentType(w)\n\tret, err := json.Marshal(r.Data)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif r.Callback == \"\" {\n\t\t_, err = w.Write(ret)\n\t\treturn err\n\t}\n\n\tcallback := template.JSEscapeString(r.Callback)\n\t_, err = w.Write([]byte(callback))\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = w.Write([]byte(\"(\"))\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = w.Write(ret)\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = w.Write([]byte(\")\"))\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}\n\n// WriteContentType (JsonpJSON) writes Javascript ContentType.\nfunc (r JsonpJSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonpContentType)\n}\n\n// Render (AsciiJSON) marshals the given interface object and writes it with custom ContentType.\nfunc (r AsciiJSON) Render(w http.ResponseWriter) (err error) {\n\tr.WriteContentType(w)\n\tret, err := json.Marshal(r.Data)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tvar buffer bytes.Buffer\n\tfor _, r := range string(ret) {\n\t\tcvt := string(r)\n\t\tif r >= 128 {\n\t\t\tcvt = fmt.Sprintf(\"\\\\u%04x\", int64(r))\n\t\t}\n\t\tbuffer.WriteString(cvt)\n\t}\n\n\t_, err = w.Write(buffer.Bytes())\n\treturn err\n}\n\n// WriteContentType (AsciiJSON) writes JSON ContentType.\nfunc (r AsciiJSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonAsciiContentType)\n}\n\n// Render (PureJSON) writes custom ContentType and encodes the given interface object.\nfunc (r PureJSON) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\tencoder := json.NewEncoder(w)\n\tencoder.SetEscapeHTML(false)\n\treturn encoder.Encode(r.Data)\n}\n\n// WriteContentType (PureJSON) writes custom ContentType.\nfunc (r PureJSON) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, jsonContentType)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/msgpack.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/ugorji/go/codec\"\n)\n\n// MsgPack contains the given interface object.\ntype MsgPack struct {\n\tData interface{}\n}\n\nvar msgpackContentType = []string{\"application/msgpack; charset=utf-8\"}\n\n// WriteContentType (MsgPack) writes MsgPack ContentType.\nfunc (r MsgPack) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, msgpackContentType)\n}\n\n// Render (MsgPack) encodes the given interface object and writes data with custom ContentType.\nfunc (r MsgPack) Render(w http.ResponseWriter) error {\n\treturn WriteMsgPack(w, r.Data)\n}\n\n// WriteMsgPack writes MsgPack ContentType and encodes the given interface object.\nfunc WriteMsgPack(w http.ResponseWriter, obj interface{}) error {\n\twriteContentType(w, msgpackContentType)\n\tvar mh codec.MsgpackHandle\n\treturn codec.NewEncoder(w, &mh).Encode(obj)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/protobuf.go", "content": "// Copyright 2018 Gin Core Team. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"net/http\"\n\n\t\"github.com/golang/protobuf/proto\"\n)\n\n// ProtoBuf contains the given interface object.\ntype ProtoBuf struct {\n\tData interface{}\n}\n\nvar protobufContentType = []string{\"application/x-protobuf\"}\n\n// Render (ProtoBuf) marshals the given interface object and writes data with custom ContentType.\nfunc (r ProtoBuf) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\n\tbytes, err := proto.Marshal(r.Data.(proto.Message))\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t_, err = w.Write(bytes)\n\treturn err\n}\n\n// WriteContentType (ProtoBuf) writes ProtoBuf ContentType.\nfunc (r ProtoBuf) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, protobufContentType)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/reader.go", "content": "// Copyright 2018 Gin Core Team. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"io\"\n\t\"net/http\"\n\t\"strconv\"\n)\n\n// Reader contains the IO reader and its length, and custom ContentType and other headers.\ntype Reader struct {\n\tContentType string\n\tContentLength int64\n\tReader io.Reader\n\tHeaders map[string]string\n}\n\n// Render (Reader) writes data with custom ContentType and headers.\nfunc (r Reader) Render(w http.ResponseWriter) (err error) {\n\tr.WriteContentType(w)\n\tr.Headers[\"Content-Length\"] = strconv.FormatInt(r.ContentLength, 10)\n\tr.writeHeaders(w, r.Headers)\n\t_, err = io.Copy(w, r.Reader)\n\treturn\n}\n\n// WriteContentType (Reader) writes custom ContentType.\nfunc (r Reader) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, []string{r.ContentType})\n}\n\n// writeHeaders writes custom Header.\nfunc (r Reader) writeHeaders(w http.ResponseWriter, headers map[string]string) {\n\theader := w.Header()\n\tfor k, v := range headers {\n\t\tif header.Get(k) == \"\" {\n\t\t\theader.Set(k, v)\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/redirect.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n)\n\n// Redirect contains the http request reference and redirects status code and location.\ntype Redirect struct {\n\tCode int\n\tRequest *http.Request\n\tLocation string\n}\n\n// Render (Redirect) redirects the http request to new location and writes redirect response.\nfunc (r Redirect) Render(w http.ResponseWriter) error {\n\tif (r.Code < http.StatusMultipleChoices || r.Code > http.StatusPermanentRedirect) && r.Code != http.StatusCreated {\n\t\tpanic(fmt.Sprintf(\"Cannot redirect with status code %d\", r.Code))\n\t}\n\thttp.Redirect(w, r.Request, r.Location, r.Code)\n\treturn nil\n}\n\n// WriteContentType (Redirect) don't write any ContentType.\nfunc (r Redirect) WriteContentType(http.ResponseWriter) {}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/render.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport \"net/http\"\n\n// Render interface is to be implemented by JSON, XML, HTML, YAML and so on.\ntype Render interface {\n\t// Render writes data with custom ContentType.\n\tRender(http.ResponseWriter) error\n\t// WriteContentType writes custom ContentType.\n\tWriteContentType(w http.ResponseWriter)\n}\n\nvar (\n\t_ Render = JSON{}\n\t_ Render = IndentedJSON{}\n\t_ Render = SecureJSON{}\n\t_ Render = JsonpJSON{}\n\t_ Render = XML{}\n\t_ Render = String{}\n\t_ Render = Redirect{}\n\t_ Render = Data{}\n\t_ Render = HTML{}\n\t_ HTMLRender = HTMLDebug{}\n\t_ HTMLRender = HTMLProduction{}\n\t_ Render = YAML{}\n\t_ Render = MsgPack{}\n\t_ Render = Reader{}\n\t_ Render = AsciiJSON{}\n\t_ Render = ProtoBuf{}\n)\n\nfunc writeContentType(w http.ResponseWriter, value []string) {\n\theader := w.Header()\n\tif val := header[\"Content-Type\"]; len(val) == 0 {\n\t\theader[\"Content-Type\"] = value\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/text.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n)\n\n// String contains the given interface object slice and its format.\ntype String struct {\n\tFormat string\n\tData []interface{}\n}\n\nvar plainContentType = []string{\"text/plain; charset=utf-8\"}\n\n// Render (String) writes data with custom ContentType.\nfunc (r String) Render(w http.ResponseWriter) error {\n\treturn WriteString(w, r.Format, r.Data)\n}\n\n// WriteContentType (String) writes Plain ContentType.\nfunc (r String) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, plainContentType)\n}\n\n// WriteString writes data according to its format and write custom ContentType.\nfunc WriteString(w http.ResponseWriter, format string, data []interface{}) (err error) {\n\twriteContentType(w, plainContentType)\n\tif len(data) > 0 {\n\t\t_, err = fmt.Fprintf(w, format, data...)\n\t\treturn\n\t}\n\t_, err = io.WriteString(w, format)\n\treturn\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/xml.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"encoding/xml\"\n\t\"net/http\"\n)\n\n// XML contains the given interface object.\ntype XML struct {\n\tData interface{}\n}\n\nvar xmlContentType = []string{\"application/xml; charset=utf-8\"}\n\n// Render (XML) encodes the given interface object and writes data with custom ContentType.\nfunc (r XML) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\treturn xml.NewEncoder(w).Encode(r.Data)\n}\n\n// WriteContentType (XML) writes XML ContentType for response.\nfunc (r XML) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, xmlContentType)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/render/yaml.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage render\n\nimport (\n\t\"net/http\"\n\n\t\"gopkg.in/yaml.v2\"\n)\n\n// YAML contains the given interface object.\ntype YAML struct {\n\tData interface{}\n}\n\nvar yamlContentType = []string{\"application/x-yaml; charset=utf-8\"}\n\n// Render (YAML) marshals the given interface object and writes data with custom ContentType.\nfunc (r YAML) Render(w http.ResponseWriter) error {\n\tr.WriteContentType(w)\n\n\tbytes, err := yaml.Marshal(r.Data)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t_, err = w.Write(bytes)\n\treturn err\n}\n\n// WriteContentType (YAML) writes YAML ContentType for response.\nfunc (r YAML) WriteContentType(w http.ResponseWriter) {\n\twriteContentType(w, yamlContentType)\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/response_writer.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"bufio\"\n\t\"io\"\n\t\"net\"\n\t\"net/http\"\n)\n\nconst (\n\tnoWritten = -1\n\tdefaultStatus = http.StatusOK\n)\n\n// ResponseWriter ...\ntype ResponseWriter interface {\n\thttp.ResponseWriter\n\thttp.Hijacker\n\thttp.Flusher\n\thttp.CloseNotifier\n\n\t// Returns the HTTP response status code of the current request.\n\tStatus() int\n\n\t// Returns the number of bytes already written into the response http body.\n\t// See Written()\n\tSize() int\n\n\t// Writes the string into the response body.\n\tWriteString(string) (int, error)\n\n\t// Returns true if the response body was already written.\n\tWritten() bool\n\n\t// Forces to write the http header (status code + headers).\n\tWriteHeaderNow()\n\n\t// get the http.Pusher for server push\n\tPusher() http.Pusher\n}\n\ntype responseWriter struct {\n\thttp.ResponseWriter\n\tsize int\n\tstatus int\n}\n\nvar _ ResponseWriter = &responseWriter{}\n\nfunc (w *responseWriter) reset(writer http.ResponseWriter) {\n\tw.ResponseWriter = writer\n\tw.size = noWritten\n\tw.status = defaultStatus\n}\n\nfunc (w *responseWriter) WriteHeader(code int) {\n\tif code > 0 && w.status != code {\n\t\tif w.Written() {\n\t\t\tdebugPrint(\"[WARNING] Headers were already written. Wanted to override status code %d with %d\", w.status, code)\n\t\t}\n\t\tw.status = code\n\t}\n}\n\nfunc (w *responseWriter) WriteHeaderNow() {\n\tif !w.Written() {\n\t\tw.size = 0\n\t\tw.ResponseWriter.WriteHeader(w.status)\n\t}\n}\n\nfunc (w *responseWriter) Write(data []byte) (n int, err error) {\n\tw.WriteHeaderNow()\n\tn, err = w.ResponseWriter.Write(data)\n\tw.size += n\n\treturn\n}\n\nfunc (w *responseWriter) WriteString(s string) (n int, err error) {\n\tw.WriteHeaderNow()\n\tn, err = io.WriteString(w.ResponseWriter, s)\n\tw.size += n\n\treturn\n}\n\nfunc (w *responseWriter) Status() int {\n\treturn w.status\n}\n\nfunc (w *responseWriter) Size() int {\n\treturn w.size\n}\n\nfunc (w *responseWriter) Written() bool {\n\treturn w.size != noWritten\n}\n\n// Hijack implements the http.Hijacker interface.\nfunc (w *responseWriter) Hijack() (net.Conn, *bufio.ReadWriter, error) {\n\tif w.size < 0 {\n\t\tw.size = 0\n\t}\n\treturn w.ResponseWriter.(http.Hijacker).Hijack()\n}\n\n// CloseNotify implements the http.CloseNotify interface.\nfunc (w *responseWriter) CloseNotify() <-chan bool {\n\treturn w.ResponseWriter.(http.CloseNotifier).CloseNotify()\n}\n\n// Flush implements the http.Flush interface.\nfunc (w *responseWriter) Flush() {\n\tw.WriteHeaderNow()\n\tw.ResponseWriter.(http.Flusher).Flush()\n}\n\nfunc (w *responseWriter) Pusher() (pusher http.Pusher) {\n\tif pusher, ok := w.ResponseWriter.(http.Pusher); ok {\n\t\treturn pusher\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/routergroup.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"net/http\"\n\t\"path\"\n\t\"regexp\"\n\t\"strings\"\n)\n\n// IRouter defines all router handle interface includes single and group router.\ntype IRouter interface {\n\tIRoutes\n\tGroup(string, ...HandlerFunc) *RouterGroup\n}\n\n// IRoutes defines all router handle interface.\ntype IRoutes interface {\n\tUse(...HandlerFunc) IRoutes\n\n\tHandle(string, string, ...HandlerFunc) IRoutes\n\tAny(string, ...HandlerFunc) IRoutes\n\tGET(string, ...HandlerFunc) IRoutes\n\tPOST(string, ...HandlerFunc) IRoutes\n\tDELETE(string, ...HandlerFunc) IRoutes\n\tPATCH(string, ...HandlerFunc) IRoutes\n\tPUT(string, ...HandlerFunc) IRoutes\n\tOPTIONS(string, ...HandlerFunc) IRoutes\n\tHEAD(string, ...HandlerFunc) IRoutes\n\n\tStaticFile(string, string) IRoutes\n\tStatic(string, string) IRoutes\n\tStaticFS(string, http.FileSystem) IRoutes\n}\n\n// RouterGroup is used internally to configure router, a RouterGroup is associated with\n// a prefix and an array of handlers (middleware).\ntype RouterGroup struct {\n\tHandlers HandlersChain\n\tbasePath string\n\tengine *Engine\n\troot bool\n}\n\nvar _ IRouter = &RouterGroup{}\n\n// Use adds middleware to the group, see example code in GitHub.\nfunc (group *RouterGroup) Use(middleware ...HandlerFunc) IRoutes {\n\tgroup.Handlers = append(group.Handlers, middleware...)\n\treturn group.returnObj()\n}\n\n// Group creates a new router group. You should add all the routes that have common middlewares or the same path prefix.\n// For example, all the routes that use a common middleware for authorization could be grouped.\nfunc (group *RouterGroup) Group(relativePath string, handlers ...HandlerFunc) *RouterGroup {\n\treturn &RouterGroup{\n\t\tHandlers: group.combineHandlers(handlers),\n\t\tbasePath: group.calculateAbsolutePath(relativePath),\n\t\tengine: group.engine,\n\t}\n}\n\n// BasePath returns the base path of router group.\n// For example, if v := router.Group(\"/rest/n/v1/api\"), v.BasePath() is \"/rest/n/v1/api\".\nfunc (group *RouterGroup) BasePath() string {\n\treturn group.basePath\n}\n\nfunc (group *RouterGroup) handle(httpMethod, relativePath string, handlers HandlersChain) IRoutes {\n\tabsolutePath := group.calculateAbsolutePath(relativePath)\n\thandlers = group.combineHandlers(handlers)\n\tgroup.engine.addRoute(httpMethod, absolutePath, handlers)\n\treturn group.returnObj()\n}\n\n// Handle registers a new request handle and middleware with the given path and method.\n// The last handler should be the real handler, the other ones should be middleware that can and should be shared among different routes.\n// See the example code in GitHub.\n//\n// For GET, POST, PUT, PATCH and DELETE requests the respective shortcut\n// functions can be used.\n//\n// This function is intended for bulk loading and to allow the usage of less\n// frequently used, non-standardized or custom methods (e.g. for internal\n// communication with a proxy).\nfunc (group *RouterGroup) Handle(httpMethod, relativePath string, handlers ...HandlerFunc) IRoutes {\n\tif matches, err := regexp.MatchString(\"^[A-Z]+$\", httpMethod); !matches || err != nil {\n\t\tpanic(\"http method \" + httpMethod + \" is not valid\")\n\t}\n\treturn group.handle(httpMethod, relativePath, handlers)\n}\n\n// POST is a shortcut for router.Handle(\"POST\", path, handle).\nfunc (group *RouterGroup) POST(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"POST\", relativePath, handlers)\n}\n\n// GET is a shortcut for router.Handle(\"GET\", path, handle).\nfunc (group *RouterGroup) GET(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"GET\", relativePath, handlers)\n}\n\n// DELETE is a shortcut for router.Handle(\"DELETE\", path, handle).\nfunc (group *RouterGroup) DELETE(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"DELETE\", relativePath, handlers)\n}\n\n// PATCH is a shortcut for router.Handle(\"PATCH\", path, handle).\nfunc (group *RouterGroup) PATCH(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"PATCH\", relativePath, handlers)\n}\n\n// PUT is a shortcut for router.Handle(\"PUT\", path, handle).\nfunc (group *RouterGroup) PUT(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"PUT\", relativePath, handlers)\n}\n\n// OPTIONS is a shortcut for router.Handle(\"OPTIONS\", path, handle).\nfunc (group *RouterGroup) OPTIONS(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"OPTIONS\", relativePath, handlers)\n}\n\n// HEAD is a shortcut for router.Handle(\"HEAD\", path, handle).\nfunc (group *RouterGroup) HEAD(relativePath string, handlers ...HandlerFunc) IRoutes {\n\treturn group.handle(\"HEAD\", relativePath, handlers)\n}\n\n// Any registers a route that matches all the HTTP methods.\n// GET, POST, PUT, PATCH, HEAD, OPTIONS, DELETE, CONNECT, TRACE.\nfunc (group *RouterGroup) Any(relativePath string, handlers ...HandlerFunc) IRoutes {\n\tgroup.handle(\"GET\", relativePath, handlers)\n\tgroup.handle(\"POST\", relativePath, handlers)\n\tgroup.handle(\"PUT\", relativePath, handlers)\n\tgroup.handle(\"PATCH\", relativePath, handlers)\n\tgroup.handle(\"HEAD\", relativePath, handlers)\n\tgroup.handle(\"OPTIONS\", relativePath, handlers)\n\tgroup.handle(\"DELETE\", relativePath, handlers)\n\tgroup.handle(\"CONNECT\", relativePath, handlers)\n\tgroup.handle(\"TRACE\", relativePath, handlers)\n\treturn group.returnObj()\n}\n\n// StaticFile registers a single route in order to serve a single file of the local filesystem.\n// router.StaticFile(\"favicon.ico\", \"./resources/favicon.ico\")\nfunc (group *RouterGroup) StaticFile(relativePath, filepath string) IRoutes {\n\tif strings.Contains(relativePath, \":\") || strings.Contains(relativePath, \"*\") {\n\t\tpanic(\"URL parameters can not be used when serving a static file\")\n\t}\n\thandler := func(c *Context) {\n\t\tc.File(filepath)\n\t}\n\tgroup.GET(relativePath, handler)\n\tgroup.HEAD(relativePath, handler)\n\treturn group.returnObj()\n}\n\n// Static serves files from the given file system root.\n// Internally a http.FileServer is used, therefore http.NotFound is used instead\n// of the Router's NotFound handler.\n// To use the operating system's file system implementation,\n// use :\n// router.Static(\"/static\", \"/var/www\")\nfunc (group *RouterGroup) Static(relativePath, root string) IRoutes {\n\treturn group.StaticFS(relativePath, Dir(root, false))\n}\n\n// StaticFS works just like `Static()` but a custom `http.FileSystem` can be used instead.\n// Gin by default user: gin.Dir()\nfunc (group *RouterGroup) StaticFS(relativePath string, fs http.FileSystem) IRoutes {\n\tif strings.Contains(relativePath, \":\") || strings.Contains(relativePath, \"*\") {\n\t\tpanic(\"URL parameters can not be used when serving a static folder\")\n\t}\n\thandler := group.createStaticHandler(relativePath, fs)\n\turlPattern := path.Join(relativePath, \"/*filepath\")\n\n\t// Register GET and HEAD handlers\n\tgroup.GET(urlPattern, handler)\n\tgroup.HEAD(urlPattern, handler)\n\treturn group.returnObj()\n}\n\nfunc (group *RouterGroup) createStaticHandler(relativePath string, fs http.FileSystem) HandlerFunc {\n\tabsolutePath := group.calculateAbsolutePath(relativePath)\n\tfileServer := http.StripPrefix(absolutePath, http.FileServer(fs))\n\n\treturn func(c *Context) {\n\t\tif _, nolisting := fs.(*onlyfilesFS); nolisting {\n\t\t\tc.Writer.WriteHeader(http.StatusNotFound)\n\t\t}\n\n\t\tfile := c.Param(\"filepath\")\n\t\t// Check if file exists and/or if we have permission to access it\n\t\tif _, err := fs.Open(file); err != nil {\n\t\t\tc.Writer.WriteHeader(http.StatusNotFound)\n\t\t\tc.handlers = group.engine.noRoute\n\t\t\t// Reset index\n\t\t\tc.index = -1\n\t\t\treturn\n\t\t}\n\n\t\tfileServer.ServeHTTP(c.Writer, c.Request)\n\t}\n}\n\nfunc (group *RouterGroup) combineHandlers(handlers HandlersChain) HandlersChain {\n\tfinalSize := len(group.Handlers) + len(handlers)\n\tif finalSize >= int(abortIndex) {\n\t\tpanic(\"too many handlers\")\n\t}\n\tmergedHandlers := make(HandlersChain, finalSize)\n\tcopy(mergedHandlers, group.Handlers)\n\tcopy(mergedHandlers[len(group.Handlers):], handlers)\n\treturn mergedHandlers\n}\n\nfunc (group *RouterGroup) calculateAbsolutePath(relativePath string) string {\n\treturn joinPaths(group.basePath, relativePath)\n}\n\nfunc (group *RouterGroup) returnObj() IRoutes {\n\tif group.root {\n\t\treturn group.engine\n\t}\n\treturn group\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/test_helpers.go", "content": "// Copyright 2017 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport \"net/http\"\n\n// CreateTestContext returns a fresh engine and context for testing purposes\nfunc CreateTestContext(w http.ResponseWriter) (c *Context, r *Engine) {\n\tr = New()\n\tc = r.allocateContext()\n\tc.reset()\n\tc.writermem.reset(w)\n\treturn\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/tree.go", "content": "// Copyright 2013 Julien Schmidt. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be found\n// at https://github.com/julienschmidt/httprouter/blob/master/LICENSE\n\npackage gin\n\nimport (\n\t\"net/url\"\n\t\"strings\"\n\t\"unicode\"\n)\n\n// Param is a single URL parameter, consisting of a key and a value.\ntype Param struct {\n\tKey string\n\tValue string\n}\n\n// Params is a Param-slice, as returned by the router.\n// The slice is ordered, the first URL parameter is also the first slice value.\n// It is therefore safe to read values by the index.\ntype Params []Param\n\n// Get returns the value of the first Param which key matches the given name.\n// If no matching Param is found, an empty string is returned.\nfunc (ps Params) Get(name string) (string, bool) {\n\tfor _, entry := range ps {\n\t\tif entry.Key == name {\n\t\t\treturn entry.Value, true\n\t\t}\n\t}\n\treturn \"\", false\n}\n\n// ByName returns the value of the first Param which key matches the given name.\n// If no matching Param is found, an empty string is returned.\nfunc (ps Params) ByName(name string) (va string) {\n\tva, _ = ps.Get(name)\n\treturn\n}\n\ntype methodTree struct {\n\tmethod string\n\troot *node\n}\n\ntype methodTrees []methodTree\n\nfunc (trees methodTrees) get(method string) *node {\n\tfor _, tree := range trees {\n\t\tif tree.method == method {\n\t\t\treturn tree.root\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc min(a, b int) int {\n\tif a <= b {\n\t\treturn a\n\t}\n\treturn b\n}\n\nfunc countParams(path string) uint8 {\n\tvar n uint\n\tfor i := 0; i < len(path); i++ {\n\t\tif path[i] != ':' && path[i] != '*' {\n\t\t\tcontinue\n\t\t}\n\t\tn++\n\t}\n\tif n >= 255 {\n\t\treturn 255\n\t}\n\treturn uint8(n)\n}\n\ntype nodeType uint8\n\nconst (\n\tstatic nodeType = iota // default\n\troot\n\tparam\n\tcatchAll\n)\n\ntype node struct {\n\tpath string\n\tindices string\n\tchildren []*node\n\thandlers HandlersChain\n\tpriority uint32\n\tnType nodeType\n\tmaxParams uint8\n\twildChild bool\n}\n\n// increments priority of the given child and reorders if necessary.\nfunc (n *node) incrementChildPrio(pos int) int {\n\tn.children[pos].priority++\n\tprio := n.children[pos].priority\n\n\t// adjust position (move to front)\n\tnewPos := pos\n\tfor newPos > 0 && n.children[newPos-1].priority < prio {\n\t\t// swap node positions\n\t\tn.children[newPos-1], n.children[newPos] = n.children[newPos], n.children[newPos-1]\n\n\t\tnewPos--\n\t}\n\n\t// build new index char string\n\tif newPos != pos {\n\t\tn.indices = n.indices[:newPos] + // unchanged prefix, might be empty\n\t\t\tn.indices[pos:pos+1] + // the index char we move\n\t\t\tn.indices[newPos:pos] + n.indices[pos+1:] // rest without char at 'pos'\n\t}\n\n\treturn newPos\n}\n\n// addRoute adds a node with the given handle to the path.\n// Not concurrency-safe!\nfunc (n *node) addRoute(path string, handlers HandlersChain) {\n\tfullPath := path\n\tn.priority++\n\tnumParams := countParams(path)\n\n\t// non-empty tree\n\tif len(n.path) > 0 || len(n.children) > 0 {\n\twalk:\n\t\tfor {\n\t\t\t// Update maxParams of the current node\n\t\t\tif numParams > n.maxParams {\n\t\t\t\tn.maxParams = numParams\n\t\t\t}\n\n\t\t\t// Find the longest common prefix.\n\t\t\t// This also implies that the common prefix contains no ':' or '*'\n\t\t\t// since the existing key can't contain those chars.\n\t\t\ti := 0\n\t\t\tmax := min(len(path), len(n.path))\n\t\t\tfor i < max && path[i] == n.path[i] {\n\t\t\t\ti++\n\t\t\t}\n\n\t\t\t// Split edge\n\t\t\tif i < len(n.path) {\n\t\t\t\tchild := node{\n\t\t\t\t\tpath: n.path[i:],\n\t\t\t\t\twildChild: n.wildChild,\n\t\t\t\t\tindices: n.indices,\n\t\t\t\t\tchildren: n.children,\n\t\t\t\t\thandlers: n.handlers,\n\t\t\t\t\tpriority: n.priority - 1,\n\t\t\t\t}\n\n\t\t\t\t// Update maxParams (max of all children)\n\t\t\t\tfor i := range child.children {\n\t\t\t\t\tif child.children[i].maxParams > child.maxParams {\n\t\t\t\t\t\tchild.maxParams = child.children[i].maxParams\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tn.children = []*node{&child}\n\t\t\t\t// []byte for proper unicode char conversion, see #65\n\t\t\t\tn.indices = string([]byte{n.path[i]})\n\t\t\t\tn.path = path[:i]\n\t\t\t\tn.handlers = nil\n\t\t\t\tn.wildChild = false\n\t\t\t}\n\n\t\t\t// Make new node a child of this node\n\t\t\tif i < len(path) {\n\t\t\t\tpath = path[i:]\n\n\t\t\t\tif n.wildChild {\n\t\t\t\t\tn = n.children[0]\n\t\t\t\t\tn.priority++\n\n\t\t\t\t\t// Update maxParams of the child node\n\t\t\t\t\tif numParams > n.maxParams {\n\t\t\t\t\t\tn.maxParams = numParams\n\t\t\t\t\t}\n\t\t\t\t\tnumParams--\n\n\t\t\t\t\t// Check if the wildcard matches\n\t\t\t\t\tif len(path) >= len(n.path) && n.path == path[:len(n.path)] {\n\t\t\t\t\t\t// check for longer wildcard, e.g. :name and :names\n\t\t\t\t\t\tif len(n.path) >= len(path) || path[len(n.path)] == '/' {\n\t\t\t\t\t\t\tcontinue walk\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tpathSeg := path\n\t\t\t\t\tif n.nType != catchAll {\n\t\t\t\t\t\tpathSeg = strings.SplitN(path, \"/\", 2)[0]\n\t\t\t\t\t}\n\t\t\t\t\tprefix := fullPath[:strings.Index(fullPath, pathSeg)] + n.path\n\t\t\t\t\tpanic(\"'\" + pathSeg +\n\t\t\t\t\t\t\"' in new path '\" + fullPath +\n\t\t\t\t\t\t\"' conflicts with existing wildcard '\" + n.path +\n\t\t\t\t\t\t\"' in existing prefix '\" + prefix +\n\t\t\t\t\t\t\"'\")\n\t\t\t\t}\n\n\t\t\t\tc := path[0]\n\n\t\t\t\t// slash after param\n\t\t\t\tif n.nType == param && c == '/' && len(n.children) == 1 {\n\t\t\t\t\tn = n.children[0]\n\t\t\t\t\tn.priority++\n\t\t\t\t\tcontinue walk\n\t\t\t\t}\n\n\t\t\t\t// Check if a child with the next path byte exists\n\t\t\t\tfor i := 0; i < len(n.indices); i++ {\n\t\t\t\t\tif c == n.indices[i] {\n\t\t\t\t\t\ti = n.incrementChildPrio(i)\n\t\t\t\t\t\tn = n.children[i]\n\t\t\t\t\t\tcontinue walk\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Otherwise insert it\n\t\t\t\tif c != ':' && c != '*' {\n\t\t\t\t\t// []byte for proper unicode char conversion, see #65\n\t\t\t\t\tn.indices += string([]byte{c})\n\t\t\t\t\tchild := &node{\n\t\t\t\t\t\tmaxParams: numParams,\n\t\t\t\t\t}\n\t\t\t\t\tn.children = append(n.children, child)\n\t\t\t\t\tn.incrementChildPrio(len(n.indices) - 1)\n\t\t\t\t\tn = child\n\t\t\t\t}\n\t\t\t\tn.insertChild(numParams, path, fullPath, handlers)\n\t\t\t\treturn\n\n\t\t\t} else if i == len(path) { // Make node a (in-path) leaf\n\t\t\t\tif n.handlers != nil {\n\t\t\t\t\tpanic(\"handlers are already registered for path '\" + fullPath + \"'\")\n\t\t\t\t}\n\t\t\t\tn.handlers = handlers\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t} else { // Empty tree\n\t\tn.insertChild(numParams, path, fullPath, handlers)\n\t\tn.nType = root\n\t}\n}\n\nfunc (n *node) insertChild(numParams uint8, path string, fullPath string, handlers HandlersChain) {\n\tvar offset int // already handled bytes of the path\n\n\t// find prefix until first wildcard (beginning with ':' or '*')\n\tfor i, max := 0, len(path); numParams > 0; i++ {\n\t\tc := path[i]\n\t\tif c != ':' && c != '*' {\n\t\t\tcontinue\n\t\t}\n\n\t\t// find wildcard end (either '/' or path end)\n\t\tend := i + 1\n\t\tfor end < max && path[end] != '/' {\n\t\t\tswitch path[end] {\n\t\t\t// the wildcard name must not contain ':' and '*'\n\t\t\tcase ':', '*':\n\t\t\t\tpanic(\"only one wildcard per path segment is allowed, has: '\" +\n\t\t\t\t\tpath[i:] + \"' in path '\" + fullPath + \"'\")\n\t\t\tdefault:\n\t\t\t\tend++\n\t\t\t}\n\t\t}\n\n\t\t// check if this Node existing children which would be\n\t\t// unreachable if we insert the wildcard here\n\t\tif len(n.children) > 0 {\n\t\t\tpanic(\"wildcard route '\" + path[i:end] +\n\t\t\t\t\"' conflicts with existing children in path '\" + fullPath + \"'\")\n\t\t}\n\n\t\t// check if the wildcard has a name\n\t\tif end-i < 2 {\n\t\t\tpanic(\"wildcards must be named with a non-empty name in path '\" + fullPath + \"'\")\n\t\t}\n\n\t\tif c == ':' { // param\n\t\t\t// split path at the beginning of the wildcard\n\t\t\tif i > 0 {\n\t\t\t\tn.path = path[offset:i]\n\t\t\t\toffset = i\n\t\t\t}\n\n\t\t\tchild := &node{\n\t\t\t\tnType: param,\n\t\t\t\tmaxParams: numParams,\n\t\t\t}\n\t\t\tn.children = []*node{child}\n\t\t\tn.wildChild = true\n\t\t\tn = child\n\t\t\tn.priority++\n\t\t\tnumParams--\n\n\t\t\t// if the path doesn't end with the wildcard, then there\n\t\t\t// will be another non-wildcard subpath starting with '/'\n\t\t\tif end < max {\n\t\t\t\tn.path = path[offset:end]\n\t\t\t\toffset = end\n\n\t\t\t\tchild := &node{\n\t\t\t\t\tmaxParams: numParams,\n\t\t\t\t\tpriority: 1,\n\t\t\t\t}\n\t\t\t\tn.children = []*node{child}\n\t\t\t\tn = child\n\t\t\t}\n\n\t\t} else { // catchAll\n\t\t\tif end != max || numParams > 1 {\n\t\t\t\tpanic(\"catch-all routes are only allowed at the end of the path in path '\" + fullPath + \"'\")\n\t\t\t}\n\n\t\t\tif len(n.path) > 0 && n.path[len(n.path)-1] == '/' {\n\t\t\t\tpanic(\"catch-all conflicts with existing handle for the path segment root in path '\" + fullPath + \"'\")\n\t\t\t}\n\n\t\t\t// currently fixed width 1 for '/'\n\t\t\ti--\n\t\t\tif path[i] != '/' {\n\t\t\t\tpanic(\"no / before catch-all in path '\" + fullPath + \"'\")\n\t\t\t}\n\n\t\t\tn.path = path[offset:i]\n\n\t\t\t// first node: catchAll node with empty path\n\t\t\tchild := &node{\n\t\t\t\twildChild: true,\n\t\t\t\tnType: catchAll,\n\t\t\t\tmaxParams: 1,\n\t\t\t}\n\t\t\tn.children = []*node{child}\n\t\t\tn.indices = string(path[i])\n\t\t\tn = child\n\t\t\tn.priority++\n\n\t\t\t// second node: node holding the variable\n\t\t\tchild = &node{\n\t\t\t\tpath: path[i:],\n\t\t\t\tnType: catchAll,\n\t\t\t\tmaxParams: 1,\n\t\t\t\thandlers: handlers,\n\t\t\t\tpriority: 1,\n\t\t\t}\n\t\t\tn.children = []*node{child}\n\n\t\t\treturn\n\t\t}\n\t}\n\n\t// insert remaining path part and handle to the leaf\n\tn.path = path[offset:]\n\tn.handlers = handlers\n}\n\n// getValue returns the handle registered with the given path (key). The values of\n// wildcards are saved to a map.\n// If no handle can be found, a TSR (trailing slash redirect) recommendation is\n// made if a handle exists with an extra (without the) trailing slash for the\n// given path.\nfunc (n *node) getValue(path string, po Params, unescape bool) (handlers HandlersChain, p Params, tsr bool) {\n\tp = po\nwalk: // Outer loop for walking the tree\n\tfor {\n\t\tif len(path) > len(n.path) {\n\t\t\tif path[:len(n.path)] == n.path {\n\t\t\t\tpath = path[len(n.path):]\n\t\t\t\t// If this node does not have a wildcard (param or catchAll)\n\t\t\t\t// child, we can just look up the next child node and continue\n\t\t\t\t// to walk down the tree\n\t\t\t\tif !n.wildChild {\n\t\t\t\t\tc := path[0]\n\t\t\t\t\tfor i := 0; i < len(n.indices); i++ {\n\t\t\t\t\t\tif c == n.indices[i] {\n\t\t\t\t\t\t\tn = n.children[i]\n\t\t\t\t\t\t\tcontinue walk\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Nothing found.\n\t\t\t\t\t// We can recommend to redirect to the same URL without a\n\t\t\t\t\t// trailing slash if a leaf exists for that path.\n\t\t\t\t\ttsr = path == \"/\" && n.handlers != nil\n\t\t\t\t\treturn\n\t\t\t\t}\n\n\t\t\t\t// handle wildcard child\n\t\t\t\tn = n.children[0]\n\t\t\t\tswitch n.nType {\n\t\t\t\tcase param:\n\t\t\t\t\t// find param end (either '/' or path end)\n\t\t\t\t\tend := 0\n\t\t\t\t\tfor end < len(path) && path[end] != '/' {\n\t\t\t\t\t\tend++\n\t\t\t\t\t}\n\n\t\t\t\t\t// save param value\n\t\t\t\t\tif cap(p) < int(n.maxParams) {\n\t\t\t\t\t\tp = make(Params, 0, n.maxParams)\n\t\t\t\t\t}\n\t\t\t\t\ti := len(p)\n\t\t\t\t\tp = p[:i+1] // expand slice within preallocated capacity\n\t\t\t\t\tp[i].Key = n.path[1:]\n\t\t\t\t\tval := path[:end]\n\t\t\t\t\tif unescape {\n\t\t\t\t\t\tvar err error\n\t\t\t\t\t\tif p[i].Value, err = url.QueryUnescape(val); err != nil {\n\t\t\t\t\t\t\tp[i].Value = val // fallback, in case of error\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tp[i].Value = val\n\t\t\t\t\t}\n\n\t\t\t\t\t// we need to go deeper!\n\t\t\t\t\tif end < len(path) {\n\t\t\t\t\t\tif len(n.children) > 0 {\n\t\t\t\t\t\t\tpath = path[end:]\n\t\t\t\t\t\t\tn = n.children[0]\n\t\t\t\t\t\t\tcontinue walk\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// ... but we can't\n\t\t\t\t\t\ttsr = len(path) == end+1\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\n\t\t\t\t\tif handlers = n.handlers; handlers != nil {\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\tif len(n.children) == 1 {\n\t\t\t\t\t\t// No handle found. Check if a handle for this path + a\n\t\t\t\t\t\t// trailing slash exists for TSR recommendation\n\t\t\t\t\t\tn = n.children[0]\n\t\t\t\t\t\ttsr = n.path == \"/\" && n.handlers != nil\n\t\t\t\t\t}\n\n\t\t\t\t\treturn\n\n\t\t\t\tcase catchAll:\n\t\t\t\t\t// save param value\n\t\t\t\t\tif cap(p) < int(n.maxParams) {\n\t\t\t\t\t\tp = make(Params, 0, n.maxParams)\n\t\t\t\t\t}\n\t\t\t\t\ti := len(p)\n\t\t\t\t\tp = p[:i+1] // expand slice within preallocated capacity\n\t\t\t\t\tp[i].Key = n.path[2:]\n\t\t\t\t\tif unescape {\n\t\t\t\t\t\tvar err error\n\t\t\t\t\t\tif p[i].Value, err = url.QueryUnescape(path); err != nil {\n\t\t\t\t\t\t\tp[i].Value = path // fallback, in case of error\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tp[i].Value = path\n\t\t\t\t\t}\n\n\t\t\t\t\thandlers = n.handlers\n\t\t\t\t\treturn\n\n\t\t\t\tdefault:\n\t\t\t\t\tpanic(\"invalid node type\")\n\t\t\t\t}\n\t\t\t}\n\t\t} else if path == n.path {\n\t\t\t// We should have reached the node containing the handle.\n\t\t\t// Check if this node has a handle registered.\n\t\t\tif handlers = n.handlers; handlers != nil {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tif path == \"/\" && n.wildChild && n.nType != root {\n\t\t\t\ttsr = true\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// No handle found. Check if a handle for this path + a\n\t\t\t// trailing slash exists for trailing slash recommendation\n\t\t\tfor i := 0; i < len(n.indices); i++ {\n\t\t\t\tif n.indices[i] == '/' {\n\t\t\t\t\tn = n.children[i]\n\t\t\t\t\ttsr = (len(n.path) == 1 && n.handlers != nil) ||\n\t\t\t\t\t\t(n.nType == catchAll && n.children[0].handlers != nil)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn\n\t\t}\n\n\t\t// Nothing found. We can recommend to redirect to the same URL with an\n\t\t// extra trailing slash if a leaf exists for that path\n\t\ttsr = (path == \"/\") ||\n\t\t\t(len(n.path) == len(path)+1 && n.path[len(path)] == '/' &&\n\t\t\t\tpath == n.path[:len(n.path)-1] && n.handlers != nil)\n\t\treturn\n\t}\n}\n\n// findCaseInsensitivePath makes a case-insensitive lookup of the given path and tries to find a handler.\n// It can optionally also fix trailing slashes.\n// It returns the case-corrected path and a bool indicating whether the lookup\n// was successful.\nfunc (n *node) findCaseInsensitivePath(path string, fixTrailingSlash bool) (ciPath []byte, found bool) {\n\tciPath = make([]byte, 0, len(path)+1) // preallocate enough memory\n\n\t// Outer loop for walking the tree\n\tfor len(path) >= len(n.path) && strings.ToLower(path[:len(n.path)]) == strings.ToLower(n.path) {\n\t\tpath = path[len(n.path):]\n\t\tciPath = append(ciPath, n.path...)\n\n\t\tif len(path) > 0 {\n\t\t\t// If this node does not have a wildcard (param or catchAll) child,\n\t\t\t// we can just look up the next child node and continue to walk down\n\t\t\t// the tree\n\t\t\tif !n.wildChild {\n\t\t\t\tr := unicode.ToLower(rune(path[0]))\n\t\t\t\tfor i, index := range n.indices {\n\t\t\t\t\t// must use recursive approach since both index and\n\t\t\t\t\t// ToLower(index) could exist. We must check both.\n\t\t\t\t\tif r == unicode.ToLower(index) {\n\t\t\t\t\t\tout, found := n.children[i].findCaseInsensitivePath(path, fixTrailingSlash)\n\t\t\t\t\t\tif found {\n\t\t\t\t\t\t\treturn append(ciPath, out...), true\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Nothing found. We can recommend to redirect to the same URL\n\t\t\t\t// without a trailing slash if a leaf exists for that path\n\t\t\t\tfound = fixTrailingSlash && path == \"/\" && n.handlers != nil\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tn = n.children[0]\n\t\t\tswitch n.nType {\n\t\t\tcase param:\n\t\t\t\t// find param end (either '/' or path end)\n\t\t\t\tk := 0\n\t\t\t\tfor k < len(path) && path[k] != '/' {\n\t\t\t\t\tk++\n\t\t\t\t}\n\n\t\t\t\t// add param value to case insensitive path\n\t\t\t\tciPath = append(ciPath, path[:k]...)\n\n\t\t\t\t// we need to go deeper!\n\t\t\t\tif k < len(path) {\n\t\t\t\t\tif len(n.children) > 0 {\n\t\t\t\t\t\tpath = path[k:]\n\t\t\t\t\t\tn = n.children[0]\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\t// ... but we can't\n\t\t\t\t\tif fixTrailingSlash && len(path) == k+1 {\n\t\t\t\t\t\treturn ciPath, true\n\t\t\t\t\t}\n\t\t\t\t\treturn\n\t\t\t\t}\n\n\t\t\t\tif n.handlers != nil {\n\t\t\t\t\treturn ciPath, true\n\t\t\t\t} else if fixTrailingSlash && len(n.children) == 1 {\n\t\t\t\t\t// No handle found. Check if a handle for this path + a\n\t\t\t\t\t// trailing slash exists\n\t\t\t\t\tn = n.children[0]\n\t\t\t\t\tif n.path == \"/\" && n.handlers != nil {\n\t\t\t\t\t\treturn append(ciPath, '/'), true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn\n\n\t\t\tcase catchAll:\n\t\t\t\treturn append(ciPath, path...), true\n\n\t\t\tdefault:\n\t\t\t\tpanic(\"invalid node type\")\n\t\t\t}\n\t\t} else {\n\t\t\t// We should have reached the node containing the handle.\n\t\t\t// Check if this node has a handle registered.\n\t\t\tif n.handlers != nil {\n\t\t\t\treturn ciPath, true\n\t\t\t}\n\n\t\t\t// No handle found.\n\t\t\t// Try to fix the path by adding a trailing slash\n\t\t\tif fixTrailingSlash {\n\t\t\t\tfor i := 0; i < len(n.indices); i++ {\n\t\t\t\t\tif n.indices[i] == '/' {\n\t\t\t\t\t\tn = n.children[i]\n\t\t\t\t\t\tif (len(n.path) == 1 && n.handlers != nil) ||\n\t\t\t\t\t\t\t(n.nType == catchAll && n.children[0].handlers != nil) {\n\t\t\t\t\t\t\treturn append(ciPath, '/'), true\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t}\n\n\t// Nothing found.\n\t// Try to fix the path by adding / removing a trailing slash\n\tif fixTrailingSlash {\n\t\tif path == \"/\" {\n\t\t\treturn ciPath, true\n\t\t}\n\t\tif len(path)+1 == len(n.path) && n.path[len(path)] == '/' &&\n\t\t\tstrings.ToLower(path) == strings.ToLower(n.path[:len(path)]) &&\n\t\t\tn.handlers != nil {\n\t\t\treturn append(ciPath, n.path...), true\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/utils.go", "content": "// Copyright 2014 Manu Martinez-Almeida. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\nimport (\n\t\"encoding/xml\"\n\t\"net/http\"\n\t\"os\"\n\t\"path\"\n\t\"reflect\"\n\t\"runtime\"\n\t\"strings\"\n)\n\n// BindKey indicates a default bind key.\nconst BindKey = \"_gin-gonic/gin/bindkey\"\n\n// Bind is a helper function for given interface object and returns a Gin middleware.\nfunc Bind(val interface{}) HandlerFunc {\n\tvalue := reflect.ValueOf(val)\n\tif value.Kind() == reflect.Ptr {\n\t\tpanic(`Bind struct can not be a pointer. Example:\n\tUse: gin.Bind(Struct{}) instead of gin.Bind(&Struct{})\n`)\n\t}\n\ttyp := value.Type()\n\n\treturn func(c *Context) {\n\t\tobj := reflect.New(typ).Interface()\n\t\tif c.Bind(obj) == nil {\n\t\t\tc.Set(BindKey, obj)\n\t\t}\n\t}\n}\n\n// WrapF is a helper function for wrapping http.HandlerFunc and returns a Gin middleware.\nfunc WrapF(f http.HandlerFunc) HandlerFunc {\n\treturn func(c *Context) {\n\t\tf(c.Writer, c.Request)\n\t}\n}\n\n// WrapH is a helper function for wrapping http.Handler and returns a Gin middleware.\nfunc WrapH(h http.Handler) HandlerFunc {\n\treturn func(c *Context) {\n\t\th.ServeHTTP(c.Writer, c.Request)\n\t}\n}\n\n// H is a shortcut for map[string]interface{}\ntype H map[string]interface{}\n\n// MarshalXML allows type H to be used with xml.Marshal.\nfunc (h H) MarshalXML(e *xml.Encoder, start xml.StartElement) error {\n\tstart.Name = xml.Name{\n\t\tSpace: \"\",\n\t\tLocal: \"map\",\n\t}\n\tif err := e.EncodeToken(start); err != nil {\n\t\treturn err\n\t}\n\tfor key, value := range h {\n\t\telem := xml.StartElement{\n\t\t\tName: xml.Name{Space: \"\", Local: key},\n\t\t\tAttr: []xml.Attr{},\n\t\t}\n\t\tif err := e.EncodeElement(value, elem); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn e.EncodeToken(xml.EndElement{Name: start.Name})\n}\n\nfunc assert1(guard bool, text string) {\n\tif !guard {\n\t\tpanic(text)\n\t}\n}\n\nfunc filterFlags(content string) string {\n\tfor i, char := range content {\n\t\tif char == ' ' || char == ';' {\n\t\t\treturn content[:i]\n\t\t}\n\t}\n\treturn content\n}\n\nfunc chooseData(custom, wildcard interface{}) interface{} {\n\tif custom == nil {\n\t\tif wildcard == nil {\n\t\t\tpanic(\"negotiation config is invalid\")\n\t\t}\n\t\treturn wildcard\n\t}\n\treturn custom\n}\n\nfunc parseAccept(acceptHeader string) []string {\n\tparts := strings.Split(acceptHeader, \",\")\n\tout := make([]string, 0, len(parts))\n\tfor _, part := range parts {\n\t\tif part = strings.TrimSpace(strings.Split(part, \";\")[0]); part != \"\" {\n\t\t\tout = append(out, part)\n\t\t}\n\t}\n\treturn out\n}\n\nfunc lastChar(str string) uint8 {\n\tif str == \"\" {\n\t\tpanic(\"The length of the string can't be 0\")\n\t}\n\treturn str[len(str)-1]\n}\n\nfunc nameOfFunction(f interface{}) string {\n\treturn runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name()\n}\n\nfunc joinPaths(absolutePath, relativePath string) string {\n\tif relativePath == \"\" {\n\t\treturn absolutePath\n\t}\n\n\tfinalPath := path.Join(absolutePath, relativePath)\n\tappendSlash := lastChar(relativePath) == '/' && lastChar(finalPath) != '/'\n\tif appendSlash {\n\t\treturn finalPath + \"/\"\n\t}\n\treturn finalPath\n}\n\nfunc resolveAddress(addr []string) string {\n\tswitch len(addr) {\n\tcase 0:\n\t\tif port := os.Getenv(\"PORT\"); port != \"\" {\n\t\t\tdebugPrint(\"Environment variable PORT=\\\"%s\\\"\", port)\n\t\t\treturn \":\" + port\n\t\t}\n\t\tdebugPrint(\"Environment variable PORT is undefined. Using port :8080 by default\")\n\t\treturn \":8080\"\n\tcase 1:\n\t\treturn addr[0]\n\tdefault:\n\t\tpanic(\"too much parameters\")\n\t}\n}\n" }, { "path": "vendor/github.com/gin-gonic/gin/version.go", "content": "// Copyright 2018 Gin Core Team. All rights reserved.\n// Use of this source code is governed by a MIT style\n// license that can be found in the LICENSE file.\n\npackage gin\n\n// Version is the current gin framework's version.\nconst Version = \"v1.4.0\"\n" }, { "path": "vendor/github.com/go-ini/ini/.gitignore", "content": "testdata/conf_out.ini\nini.sublime-project\nini.sublime-workspace\ntestdata/conf_reflect.ini\n.idea\n/.vscode\n" }, { "path": "vendor/github.com/go-ini/ini/.travis.yml", "content": "sudo: false\nlanguage: go\ngo:\n - 1.5.x\n - 1.6.x\n - 1.7.x\n - 1.8.x\n - 1.9.x\n\nscript: \n - go get golang.org/x/tools/cmd/cover\n - go get github.com/smartystreets/goconvey\n - mkdir -p $HOME/gopath/src/gopkg.in\n - ln -s $HOME/gopath/src/github.com/go-ini/ini $HOME/gopath/src/gopkg.in/ini.v1\n - go test -v -cover -race\n" }, { "path": "vendor/github.com/go-ini/ini/LICENSE", "content": "Apache License\nVersion 2.0, January 2004\nhttp://www.apache.org/licenses/\n\nTERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n1. Definitions.\n\n\"License\" shall mean the terms and conditions for use, reproduction, and\ndistribution as defined by Sections 1 through 9 of this document.\n\n\"Licensor\" shall mean the copyright owner or entity authorized by the copyright\nowner that is granting the License.\n\n\"Legal Entity\" shall mean the union of the acting entity and all other entities\nthat control, are controlled by, or are under common control with that entity.\nFor the purposes of this definition, \"control\" means (i) the power, direct or\nindirect, to cause the direction or management of such entity, whether by\ncontract or otherwise, or (ii) ownership of fifty percent (50%) or more of the\noutstanding shares, or (iii) beneficial ownership of such entity.\n\n\"You\" (or \"Your\") shall mean an individual or Legal Entity exercising\npermissions granted by this License.\n\n\"Source\" form shall mean the preferred form for making modifications, including\nbut not limited to software source code, documentation source, and configuration\nfiles.\n\n\"Object\" form shall mean any form resulting from mechanical transformation or\ntranslation of a Source form, including but not limited to compiled object code,\ngenerated documentation, and conversions to other media types.\n\n\"Work\" shall mean the work of authorship, whether in Source or Object form, made\navailable under the License, as indicated by a copyright notice that is included\nin or attached to the work (an example is provided in the Appendix below).\n\n\"Derivative Works\" shall mean any work, whether in Source or Object form, that\nis based on (or derived from) the Work and for which the editorial revisions,\nannotations, elaborations, or other modifications represent, as a whole, an\noriginal work of authorship. For the purposes of this License, Derivative Works\nshall not include works that remain separable from, or merely link (or bind by\nname) to the interfaces of, the Work and Derivative Works thereof.\n\n\"Contribution\" shall mean any work of authorship, including the original version\nof the Work and any modifications or additions to that Work or Derivative Works\nthereof, that is intentionally submitted to Licensor for inclusion in the Work\nby the copyright owner or by an individual or Legal Entity authorized to submit\non behalf of the copyright owner. For the purposes of this definition,\n\"submitted\" means any form of electronic, verbal, or written communication sent\nto the Licensor or its representatives, including but not limited to\ncommunication on electronic mailing lists, source code control systems, and\nissue tracking systems that are managed by, or on behalf of, the Licensor for\nthe purpose of discussing and improving the Work, but excluding communication\nthat is conspicuously marked or otherwise designated in writing by the copyright\nowner as \"Not a Contribution.\"\n\n\"Contributor\" shall mean Licensor and any individual or Legal Entity on behalf\nof whom a Contribution has been received by Licensor and subsequently\nincorporated within the Work.\n\n2. Grant of Copyright License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable copyright license to reproduce, prepare Derivative Works of,\npublicly display, publicly perform, sublicense, and distribute the Work and such\nDerivative Works in Source or Object form.\n\n3. Grant of Patent License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable (except as stated in this section) patent license to make, have\nmade, use, offer to sell, sell, import, and otherwise transfer the Work, where\nsuch license applies only to those patent claims licensable by such Contributor\nthat are necessarily infringed by their Contribution(s) alone or by combination\nof their Contribution(s) with the Work to which such Contribution(s) was\nsubmitted. If You institute patent litigation against any entity (including a\ncross-claim or counterclaim in a lawsuit) alleging that the Work or a\nContribution incorporated within the Work constitutes direct or contributory\npatent infringement, then any patent licenses granted to You under this License\nfor that Work shall terminate as of the date such litigation is filed.\n\n4. Redistribution.\n\nYou may reproduce and distribute copies of the Work or Derivative Works thereof\nin any medium, with or without modifications, and in Source or Object form,\nprovided that You meet the following conditions:\n\nYou must give any other recipients of the Work or Derivative Works a copy of\nthis License; and\nYou must cause any modified files to carry prominent notices stating that You\nchanged the files; and\nYou must retain, in the Source form of any Derivative Works that You distribute,\nall copyright, patent, trademark, and attribution notices from the Source form\nof the Work, excluding those notices that do not pertain to any part of the\nDerivative Works; and\nIf the Work includes a \"NOTICE\" text file as part of its distribution, then any\nDerivative Works that You distribute must include a readable copy of the\nattribution notices contained within such NOTICE file, excluding those notices\nthat do not pertain to any part of the Derivative Works, in at least one of the\nfollowing places: within a NOTICE text file distributed as part of the\nDerivative Works; within the Source form or documentation, if provided along\nwith the Derivative Works; or, within a display generated by the Derivative\nWorks, if and wherever such third-party notices normally appear. The contents of\nthe NOTICE file are for informational purposes only and do not modify the\nLicense. You may add Your own attribution notices within Derivative Works that\nYou distribute, alongside or as an addendum to the NOTICE text from the Work,\nprovided that such additional attribution notices cannot be construed as\nmodifying the License.\nYou may add Your own copyright statement to Your modifications and may provide\nadditional or different license terms and conditions for use, reproduction, or\ndistribution of Your modifications, or for any such Derivative Works as a whole,\nprovided Your use, reproduction, and distribution of the Work otherwise complies\nwith the conditions stated in this License.\n\n5. Submission of Contributions.\n\nUnless You explicitly state otherwise, any Contribution intentionally submitted\nfor inclusion in the Work by You to the Licensor shall be under the terms and\nconditions of this License, without any additional terms or conditions.\nNotwithstanding the above, nothing herein shall supersede or modify the terms of\nany separate license agreement you may have executed with Licensor regarding\nsuch Contributions.\n\n6. Trademarks.\n\nThis License does not grant permission to use the trade names, trademarks,\nservice marks, or product names of the Licensor, except as required for\nreasonable and customary use in describing the origin of the Work and\nreproducing the content of the NOTICE file.\n\n7. Disclaimer of Warranty.\n\nUnless required by applicable law or agreed to in writing, Licensor provides the\nWork (and each Contributor provides its Contributions) on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,\nincluding, without limitation, any warranties or conditions of TITLE,\nNON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are\nsolely responsible for determining the appropriateness of using or\nredistributing the Work and assume any risks associated with Your exercise of\npermissions under this License.\n\n8. Limitation of Liability.\n\nIn no event and under no legal theory, whether in tort (including negligence),\ncontract, or otherwise, unless required by applicable law (such as deliberate\nand grossly negligent acts) or agreed to in writing, shall any Contributor be\nliable to You for damages, including any direct, indirect, special, incidental,\nor consequential damages of any character arising as a result of this License or\nout of the use or inability to use the Work (including but not limited to\ndamages for loss of goodwill, work stoppage, computer failure or malfunction, or\nany and all other commercial damages or losses), even if such Contributor has\nbeen advised of the possibility of such damages.\n\n9. Accepting Warranty or Additional Liability.\n\nWhile redistributing the Work or Derivative Works thereof, You may choose to\noffer, and charge a fee for, acceptance of support, warranty, indemnity, or\nother liability obligations and/or rights consistent with this License. However,\nin accepting such obligations, You may act only on Your own behalf and on Your\nsole responsibility, not on behalf of any other Contributor, and only if You\nagree to indemnify, defend, and hold each Contributor harmless for any liability\nincurred by, or claims asserted against, such Contributor by reason of your\naccepting any such warranty or additional liability.\n\nEND OF TERMS AND CONDITIONS\n\nAPPENDIX: How to apply the Apache License to your work\n\nTo apply the Apache License to your work, attach the following boilerplate\nnotice, with the fields enclosed by brackets \"[]\" replaced with your own\nidentifying information. (Don't include the brackets!) The text should be\nenclosed in the appropriate comment syntax for the file format. We also\nrecommend that a file or class name and description of purpose be included on\nthe same \"printed page\" as the copyright notice for easier identification within\nthird-party archives.\n\n Copyright 2014 Unknwon\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/go-ini/ini/Makefile", "content": ".PHONY: build test bench vet coverage\n\nbuild: vet bench\n\ntest:\n\tgo test -v -cover -race\n\nbench:\n\tgo test -v -cover -race -test.bench=. -test.benchmem\n\nvet:\n\tgo vet\n\ncoverage:\n\tgo test -coverprofile=c.out && go tool cover -html=c.out && rm c.out" }, { "path": "vendor/github.com/go-ini/ini/README.md", "content": "INI [![Build Status](https://travis-ci.org/go-ini/ini.svg?branch=master)](https://travis-ci.org/go-ini/ini) [![Sourcegraph](https://sourcegraph.com/github.com/go-ini/ini/-/badge.svg)](https://sourcegraph.com/github.com/go-ini/ini?badge)\n===\n\n![](https://avatars0.githubusercontent.com/u/10216035?v=3&s=200)\n\nPackage ini provides INI file read and write functionality in Go.\n\n[简体中文](README_ZH.md)\n\n## Feature\n\n- Load multiple data sources(`[]byte`, file and `io.ReadCloser`) with overwrites.\n- Read with recursion values.\n- Read with parent-child sections.\n- Read with auto-increment key names.\n- Read with multiple-line values.\n- Read with tons of helper methods.\n- Read and convert values to Go types.\n- Read and **WRITE** comments of sections and keys.\n- Manipulate sections, keys and comments with ease.\n- Keep sections and keys in order as you parse and save.\n\n## Installation\n\nTo use a tagged revision:\n\n\tgo get gopkg.in/ini.v1\n\nTo use with latest changes:\n\n\tgo get github.com/go-ini/ini\n\nPlease add `-u` flag to update in the future.\n\n### Testing\n\nIf you want to test on your machine, please apply `-t` flag:\n\n\tgo get -t gopkg.in/ini.v1\n\nPlease add `-u` flag to update in the future.\n\n## Getting Started\n\n### Loading from data sources\n\nA **Data Source** is either raw data in type `[]byte`, a file name with type `string` or `io.ReadCloser`. You can load **as many data sources as you want**. Passing other types will simply return an error.\n\n```go\ncfg, err := ini.Load([]byte(\"raw data\"), \"filename\", ioutil.NopCloser(bytes.NewReader([]byte(\"some other data\"))))\n```\n\nOr start with an empty object:\n\n```go\ncfg := ini.Empty()\n```\n\nWhen you cannot decide how many data sources to load at the beginning, you will still be able to **Append()** them later.\n\n```go\nerr := cfg.Append(\"other file\", []byte(\"other raw data\"))\n```\n\nIf you have a list of files with possibilities that some of them may not available at the time, and you don't know exactly which ones, you can use `LooseLoad` to ignore nonexistent files without returning error.\n\n```go\ncfg, err := ini.LooseLoad(\"filename\", \"filename_404\")\n```\n\nThe cool thing is, whenever the file is available to load while you're calling `Reload` method, it will be counted as usual.\n\n#### Ignore cases of key name\n\nWhen you do not care about cases of section and key names, you can use `InsensitiveLoad` to force all names to be lowercased while parsing.\n\n```go\ncfg, err := ini.InsensitiveLoad(\"filename\")\n//...\n\n// sec1 and sec2 are the exactly same section object\nsec1, err := cfg.GetSection(\"Section\")\nsec2, err := cfg.GetSection(\"SecTIOn\")\n\n// key1 and key2 are the exactly same key object\nkey1, err := sec1.GetKey(\"Key\")\nkey2, err := sec2.GetKey(\"KeY\")\n```\n\n#### MySQL-like boolean key \n\nMySQL's configuration allows a key without value as follows:\n\n```ini\n[mysqld]\n...\nskip-host-cache\nskip-name-resolve\n```\n\nBy default, this is considered as missing value. But if you know you're going to deal with those cases, you can assign advanced load options:\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{AllowBooleanKeys: true}, \"my.cnf\"))\n```\n\nThe value of those keys are always `true`, and when you save to a file, it will keep in the same foramt as you read.\n\nTo generate such keys in your program, you could use `NewBooleanKey`:\n\n```go\nkey, err := sec.NewBooleanKey(\"skip-host-cache\")\n```\n\n#### Comment\n\nTake care that following format will be treated as comment:\n\n1. Line begins with `#` or `;`\n2. Words after `#` or `;`\n3. Words after section name (i.e words after `[some section name]`)\n\nIf you want to save a value with `#` or `;`, please quote them with ``` ` ``` or ``` \"\"\" ```.\n\nAlternatively, you can use following `LoadOptions` to completely ignore inline comments:\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{IgnoreInlineComment: true}, \"app.ini\"))\n```\n\n### Working with sections\n\nTo get a section, you would need to:\n\n```go\nsection, err := cfg.GetSection(\"section name\")\n```\n\nFor a shortcut for default section, just give an empty string as name:\n\n```go\nsection, err := cfg.GetSection(\"\")\n```\n\nWhen you're pretty sure the section exists, following code could make your life easier:\n\n```go\nsection := cfg.Section(\"section name\")\n```\n\nWhat happens when the section somehow does not exist? Don't panic, it automatically creates and returns a new section to you.\n\nTo create a new section:\n\n```go\nerr := cfg.NewSection(\"new section\")\n```\n\nTo get a list of sections or section names:\n\n```go\nsections := cfg.Sections()\nnames := cfg.SectionStrings()\n```\n\n### Working with keys\n\nTo get a key under a section:\n\n```go\nkey, err := cfg.Section(\"\").GetKey(\"key name\")\n```\n\nSame rule applies to key operations:\n\n```go\nkey := cfg.Section(\"\").Key(\"key name\")\n```\n\nTo check if a key exists:\n\n```go\nyes := cfg.Section(\"\").HasKey(\"key name\")\n```\n\nTo create a new key:\n\n```go\nerr := cfg.Section(\"\").NewKey(\"name\", \"value\")\n```\n\nTo get a list of keys or key names:\n\n```go\nkeys := cfg.Section(\"\").Keys()\nnames := cfg.Section(\"\").KeyStrings()\n```\n\nTo get a clone hash of keys and corresponding values:\n\n```go\nhash := cfg.Section(\"\").KeysHash()\n```\n\n### Working with values\n\nTo get a string value:\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").String()\n```\n\nTo validate key value on the fly:\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").Validate(func(in string) string {\n\tif len(in) == 0 {\n\t\treturn \"default\"\n\t}\n\treturn in\n})\n```\n\nIf you do not want any auto-transformation (such as recursive read) for the values, you can get raw value directly (this way you get much better performance):\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").Value()\n```\n\nTo check if raw value exists:\n\n```go\nyes := cfg.Section(\"\").HasValue(\"test value\")\n```\n\nTo get value with types:\n\n```go\n// For boolean values:\n// true when value is: 1, t, T, TRUE, true, True, YES, yes, Yes, y, ON, on, On\n// false when value is: 0, f, F, FALSE, false, False, NO, no, No, n, OFF, off, Off\nv, err = cfg.Section(\"\").Key(\"BOOL\").Bool()\nv, err = cfg.Section(\"\").Key(\"FLOAT64\").Float64()\nv, err = cfg.Section(\"\").Key(\"INT\").Int()\nv, err = cfg.Section(\"\").Key(\"INT64\").Int64()\nv, err = cfg.Section(\"\").Key(\"UINT\").Uint()\nv, err = cfg.Section(\"\").Key(\"UINT64\").Uint64()\nv, err = cfg.Section(\"\").Key(\"TIME\").TimeFormat(time.RFC3339)\nv, err = cfg.Section(\"\").Key(\"TIME\").Time() // RFC3339\n\nv = cfg.Section(\"\").Key(\"BOOL\").MustBool()\nv = cfg.Section(\"\").Key(\"FLOAT64\").MustFloat64()\nv = cfg.Section(\"\").Key(\"INT\").MustInt()\nv = cfg.Section(\"\").Key(\"INT64\").MustInt64()\nv = cfg.Section(\"\").Key(\"UINT\").MustUint()\nv = cfg.Section(\"\").Key(\"UINT64\").MustUint64()\nv = cfg.Section(\"\").Key(\"TIME\").MustTimeFormat(time.RFC3339)\nv = cfg.Section(\"\").Key(\"TIME\").MustTime() // RFC3339\n\n// Methods start with Must also accept one argument for default value\n// when key not found or fail to parse value to given type.\n// Except method MustString, which you have to pass a default value.\n\nv = cfg.Section(\"\").Key(\"String\").MustString(\"default\")\nv = cfg.Section(\"\").Key(\"BOOL\").MustBool(true)\nv = cfg.Section(\"\").Key(\"FLOAT64\").MustFloat64(1.25)\nv = cfg.Section(\"\").Key(\"INT\").MustInt(10)\nv = cfg.Section(\"\").Key(\"INT64\").MustInt64(99)\nv = cfg.Section(\"\").Key(\"UINT\").MustUint(3)\nv = cfg.Section(\"\").Key(\"UINT64\").MustUint64(6)\nv = cfg.Section(\"\").Key(\"TIME\").MustTimeFormat(time.RFC3339, time.Now())\nv = cfg.Section(\"\").Key(\"TIME\").MustTime(time.Now()) // RFC3339\n```\n\nWhat if my value is three-line long?\n\n```ini\n[advance]\nADDRESS = \"\"\"404 road,\nNotFound, State, 5000\nEarth\"\"\"\n```\n\nNot a problem!\n\n```go\ncfg.Section(\"advance\").Key(\"ADDRESS\").String()\n\n/* --- start ---\n404 road,\nNotFound, State, 5000\nEarth\n------ end --- */\n```\n\nThat's cool, how about continuation lines?\n\n```ini\n[advance]\ntwo_lines = how about \\\n\tcontinuation lines?\nlots_of_lines = 1 \\\n\t2 \\\n\t3 \\\n\t4\n```\n\nPiece of cake!\n\n```go\ncfg.Section(\"advance\").Key(\"two_lines\").String() // how about continuation lines?\ncfg.Section(\"advance\").Key(\"lots_of_lines\").String() // 1 2 3 4\n```\n\nWell, I hate continuation lines, how do I disable that?\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{\n\tIgnoreContinuation: true,\n}, \"filename\")\n```\n\nHoly crap! \n\nNote that single quotes around values will be stripped:\n\n```ini\nfoo = \"some value\" // foo: some value\nbar = 'some value' // bar: some value\n```\n\nSometimes you downloaded file from [Crowdin](https://crowdin.com/) has values like the following (value is surrounded by double quotes and quotes in the value are escaped):\n\n```ini\ncreate_repo=\"created repository %s\"\n```\n\nHow do you transform this to regular format automatically?\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{UnescapeValueDoubleQuotes: true}, \"en-US.ini\"))\ncfg.Section(\"\").Key(\"create_repo\").String() \n// You got: created repository %s\n```\n\nThat's all? Hmm, no.\n\n#### Helper methods of working with values\n\nTo get value with given candidates:\n\n```go\nv = cfg.Section(\"\").Key(\"STRING\").In(\"default\", []string{\"str\", \"arr\", \"types\"})\nv = cfg.Section(\"\").Key(\"FLOAT64\").InFloat64(1.1, []float64{1.25, 2.5, 3.75})\nv = cfg.Section(\"\").Key(\"INT\").InInt(5, []int{10, 20, 30})\nv = cfg.Section(\"\").Key(\"INT64\").InInt64(10, []int64{10, 20, 30})\nv = cfg.Section(\"\").Key(\"UINT\").InUint(4, []int{3, 6, 9})\nv = cfg.Section(\"\").Key(\"UINT64\").InUint64(8, []int64{3, 6, 9})\nv = cfg.Section(\"\").Key(\"TIME\").InTimeFormat(time.RFC3339, time.Now(), []time.Time{time1, time2, time3})\nv = cfg.Section(\"\").Key(\"TIME\").InTime(time.Now(), []time.Time{time1, time2, time3}) // RFC3339\n```\n\nDefault value will be presented if value of key is not in candidates you given, and default value does not need be one of candidates.\n\nTo validate value in a given range:\n\n```go\nvals = cfg.Section(\"\").Key(\"FLOAT64\").RangeFloat64(0.0, 1.1, 2.2)\nvals = cfg.Section(\"\").Key(\"INT\").RangeInt(0, 10, 20)\nvals = cfg.Section(\"\").Key(\"INT64\").RangeInt64(0, 10, 20)\nvals = cfg.Section(\"\").Key(\"UINT\").RangeUint(0, 3, 9)\nvals = cfg.Section(\"\").Key(\"UINT64\").RangeUint64(0, 3, 9)\nvals = cfg.Section(\"\").Key(\"TIME\").RangeTimeFormat(time.RFC3339, time.Now(), minTime, maxTime)\nvals = cfg.Section(\"\").Key(\"TIME\").RangeTime(time.Now(), minTime, maxTime) // RFC3339\n```\n\n##### Auto-split values into a slice\n\nTo use zero value of type for invalid inputs:\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> [0.0 2.2 0.0 0.0]\nvals = cfg.Section(\"\").Key(\"STRINGS\").Strings(\",\")\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").Float64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").Ints(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").Int64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").Uints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").Uint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").Times(\",\")\n```\n\nTo exclude invalid values out of result slice:\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> [2.2]\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").ValidFloat64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").ValidInts(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").ValidInt64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").ValidUints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").ValidUint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").ValidTimes(\",\")\n```\n\nOr to return nothing but error when have invalid inputs:\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> error\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").StrictFloat64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").StrictInts(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").StrictInt64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").StrictUints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").StrictUint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").StrictTimes(\",\")\n```\n\n### Save your configuration\n\nFinally, it's time to save your configuration to somewhere.\n\nA typical way to save configuration is writing it to a file:\n\n```go\n// ...\nerr = cfg.SaveTo(\"my.ini\")\nerr = cfg.SaveToIndent(\"my.ini\", \"\\t\")\n```\n\nAnother way to save is writing to a `io.Writer` interface:\n\n```go\n// ...\ncfg.WriteTo(writer)\ncfg.WriteToIndent(writer, \"\\t\")\n```\n\nBy default, spaces are used to align \"=\" sign between key and values, to disable that:\n\n```go\nini.PrettyFormat = false\n``` \n\n## Advanced Usage\n\n### Recursive Values\n\nFor all value of keys, there is a special syntax `%()s`, where `` is the key name in same section or default section, and `%()s` will be replaced by corresponding value(empty string if key not found). You can use this syntax at most 99 level of recursions.\n\n```ini\nNAME = ini\n\n[author]\nNAME = Unknwon\nGITHUB = https://github.com/%(NAME)s\n\n[package]\nFULL_NAME = github.com/go-ini/%(NAME)s\n```\n\n```go\ncfg.Section(\"author\").Key(\"GITHUB\").String()\t\t// https://github.com/Unknwon\ncfg.Section(\"package\").Key(\"FULL_NAME\").String()\t// github.com/go-ini/ini\n```\n\n### Parent-child Sections\n\nYou can use `.` in section name to indicate parent-child relationship between two or more sections. If the key not found in the child section, library will try again on its parent section until there is no parent section.\n\n```ini\nNAME = ini\nVERSION = v1\nIMPORT_PATH = gopkg.in/%(NAME)s.%(VERSION)s\n\n[package]\nCLONE_URL = https://%(IMPORT_PATH)s\n\n[package.sub]\n```\n\n```go\ncfg.Section(\"package.sub\").Key(\"CLONE_URL\").String()\t// https://gopkg.in/ini.v1\n```\n\n#### Retrieve parent keys available to a child section\n\n```go\ncfg.Section(\"package.sub\").ParentKeys() // [\"CLONE_URL\"]\n```\n\n### Unparseable Sections\n\nSometimes, you have sections that do not contain key-value pairs but raw content, to handle such case, you can use `LoadOptions.UnparsableSections`:\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{UnparseableSections: []string{\"COMMENTS\"}}, `[COMMENTS]\n<1> This slide has the fuel listed in the wrong units `))\n\nbody := cfg.Section(\"COMMENTS\").Body()\n\n/* --- start ---\n<1> This slide has the fuel listed in the wrong units \n------ end --- */\n```\n\n### Auto-increment Key Names\n\nIf key name is `-` in data source, then it would be seen as special syntax for auto-increment key name start from 1, and every section is independent on counter.\n\n```ini\n[features]\n-: Support read/write comments of keys and sections\n-: Support auto-increment of key names\n-: Support load multiple files to overwrite key values\n```\n\n```go\ncfg.Section(\"features\").KeyStrings()\t// []{\"#1\", \"#2\", \"#3\"}\n```\n\n### Map To Struct\n\nWant more objective way to play with INI? Cool.\n\n```ini\nName = Unknwon\nage = 21\nMale = true\nBorn = 1993-01-01T20:17:05Z\n\n[Note]\nContent = Hi is a good man!\nCities = HangZhou, Boston\n```\n\n```go\ntype Note struct {\n\tContent string\n\tCities []string\n}\n\ntype Person struct {\n\tName string\n\tAge int `ini:\"age\"`\n\tMale bool\n\tBorn time.Time\n\tNote\n\tCreated time.Time `ini:\"-\"`\n}\n\nfunc main() {\n\tcfg, err := ini.Load(\"path/to/ini\")\n\t// ...\n\tp := new(Person)\n\terr = cfg.MapTo(p)\n\t// ...\n\n\t// Things can be simpler.\n\terr = ini.MapTo(p, \"path/to/ini\")\n\t// ...\n\n\t// Just map a section? Fine.\n\tn := new(Note)\n\terr = cfg.Section(\"Note\").MapTo(n)\n\t// ...\n}\n```\n\nCan I have default value for field? Absolutely.\n\nAssign it before you map to struct. It will keep the value as it is if the key is not presented or got wrong type.\n\n```go\n// ...\np := &Person{\n\tName: \"Joe\",\n}\n// ...\n```\n\nIt's really cool, but what's the point if you can't give me my file back from struct?\n\n### Reflect From Struct\n\nWhy not?\n\n```go\ntype Embeded struct {\n\tDates []time.Time `delim:\"|\" comment:\"Time data\"`\n\tPlaces []string `ini:\"places,omitempty\"`\n\tNone []int `ini:\",omitempty\"`\n}\n\ntype Author struct {\n\tName string `ini:\"NAME\"`\n\tMale bool\n\tAge int `comment:\"Author's age\"`\n\tGPA float64\n\tNeverMind string `ini:\"-\"`\n\t*Embeded `comment:\"Embeded section\"`\n}\n\nfunc main() {\n\ta := &Author{\"Unknwon\", true, 21, 2.8, \"\",\n\t\t&Embeded{\n\t\t\t[]time.Time{time.Now(), time.Now()},\n\t\t\t[]string{\"HangZhou\", \"Boston\"},\n\t\t\t[]int{},\n\t\t}}\n\tcfg := ini.Empty()\n\terr = ini.ReflectFrom(cfg, a)\n\t// ...\n}\n```\n\nSo, what do I get?\n\n```ini\nNAME = Unknwon\nMale = true\n; Author's age\nAge = 21\nGPA = 2.8\n\n; Embeded section\n[Embeded]\n; Time data\nDates = 2015-08-07T22:14:22+08:00|2015-08-07T22:14:22+08:00\nplaces = HangZhou,Boston\n```\n\n#### Name Mapper\n\nTo save your time and make your code cleaner, this library supports [`NameMapper`](https://gowalker.org/gopkg.in/ini.v1#NameMapper) between struct field and actual section and key name.\n\nThere are 2 built-in name mappers:\n\n- `AllCapsUnderscore`: it converts to format `ALL_CAPS_UNDERSCORE` then match section or key.\n- `TitleUnderscore`: it converts to format `title_underscore` then match section or key.\n\nTo use them:\n\n```go\ntype Info struct {\n\tPackageName string\n}\n\nfunc main() {\n\terr = ini.MapToWithMapper(&Info{}, ini.TitleUnderscore, []byte(\"package_name=ini\"))\n\t// ...\n\n\tcfg, err := ini.Load([]byte(\"PACKAGE_NAME=ini\"))\n\t// ...\n\tinfo := new(Info)\n\tcfg.NameMapper = ini.AllCapsUnderscore\n\terr = cfg.MapTo(info)\n\t// ...\n}\n```\n\nSame rules of name mapper apply to `ini.ReflectFromWithMapper` function.\n\n#### Value Mapper\n\nTo expand values (e.g. from environment variables), you can use the `ValueMapper` to transform values:\n\n```go\ntype Env struct {\n\tFoo string `ini:\"foo\"`\n}\n\nfunc main() {\n\tcfg, err := ini.Load([]byte(\"[env]\\nfoo = ${MY_VAR}\\n\")\n\tcfg.ValueMapper = os.ExpandEnv\n\t// ...\n\tenv := &Env{}\n\terr = cfg.Section(\"env\").MapTo(env)\n}\n```\n\nThis would set the value of `env.Foo` to the value of the environment variable `MY_VAR`.\n\n#### Other Notes On Map/Reflect\n\nAny embedded struct is treated as a section by default, and there is no automatic parent-child relations in map/reflect feature:\n\n```go\ntype Child struct {\n\tAge string\n}\n\ntype Parent struct {\n\tName string\n\tChild\n}\n\ntype Config struct {\n\tCity string\n\tParent\n}\n```\n\nExample configuration:\n\n```ini\nCity = Boston\n\n[Parent]\nName = Unknwon\n\n[Child]\nAge = 21\n```\n\nWhat if, yes, I'm paranoid, I want embedded struct to be in the same section. Well, all roads lead to Rome.\n\n```go\ntype Child struct {\n\tAge string\n}\n\ntype Parent struct {\n\tName string\n\tChild `ini:\"Parent\"`\n}\n\ntype Config struct {\n\tCity string\n\tParent\n}\n```\n\nExample configuration:\n\n```ini\nCity = Boston\n\n[Parent]\nName = Unknwon\nAge = 21\n```\n\n## Getting Help\n\n- [API Documentation](https://gowalker.org/gopkg.in/ini.v1)\n- [File An Issue](https://github.com/go-ini/ini/issues/new)\n\n## FAQs\n\n### What does `BlockMode` field do?\n\nBy default, library lets you read and write values so we need a locker to make sure your data is safe. But in cases that you are very sure about only reading data through the library, you can set `cfg.BlockMode = false` to speed up read operations about **50-70%** faster.\n\n### Why another INI library?\n\nMany people are using my another INI library [goconfig](https://github.com/Unknwon/goconfig), so the reason for this one is I would like to make more Go style code. Also when you set `cfg.BlockMode = false`, this one is about **10-30%** faster.\n\nTo make those changes I have to confirm API broken, so it's safer to keep it in another place and start using `gopkg.in` to version my package at this time.(PS: shorter import path)\n\n## License\n\nThis project is under Apache v2 License. See the [LICENSE](LICENSE) file for the full license text.\n" }, { "path": "vendor/github.com/go-ini/ini/README_ZH.md", "content": "本包提供了 Go 语言中读写 INI 文件的功能。\n\n## 功能特性\n\n- 支持覆盖加载多个数据源（`[]byte`、文件和 `io.ReadCloser`）\n- 支持递归读取键值\n- 支持读取父子分区\n- 支持读取自增键名\n- 支持读取多行的键值\n- 支持大量辅助方法\n- 支持在读取时直接转换为 Go 语言类型\n- 支持读取和 **写入** 分区和键的注释\n- 轻松操作分区、键值和注释\n- 在保存文件时分区和键值会保持原有的顺序\n\n## 下载安装\n\n使用一个特定版本：\n\n go get gopkg.in/ini.v1\n\n使用最新版：\n\n\tgo get github.com/go-ini/ini\n\n如需更新请添加 `-u` 选项。\n\n### 测试安装\n\n如果您想要在自己的机器上运行测试，请使用 `-t` 标记：\n\n\tgo get -t gopkg.in/ini.v1\n\n如需更新请添加 `-u` 选项。\n\n## 开始使用\n\n### 从数据源加载\n\n一个 **数据源** 可以是 `[]byte` 类型的原始数据，`string` 类型的文件路径或 `io.ReadCloser`。您可以加载 **任意多个** 数据源。如果您传递其它类型的数据源，则会直接返回错误。\n\n```go\ncfg, err := ini.Load([]byte(\"raw data\"), \"filename\", ioutil.NopCloser(bytes.NewReader([]byte(\"some other data\"))))\n```\n\n或者从一个空白的文件开始：\n\n```go\ncfg := ini.Empty()\n```\n\n当您在一开始无法决定需要加载哪些数据源时，仍可以使用 **Append()** 在需要的时候加载它们。\n\n```go\nerr := cfg.Append(\"other file\", []byte(\"other raw data\"))\n```\n\n当您想要加载一系列文件，但是不能够确定其中哪些文件是不存在的，可以通过调用函数 `LooseLoad` 来忽略它们（`Load` 会因为文件不存在而返回错误）：\n\n```go\ncfg, err := ini.LooseLoad(\"filename\", \"filename_404\")\n```\n\n更牛逼的是，当那些之前不存在的文件在重新调用 `Reload` 方法的时候突然出现了，那么它们会被正常加载。\n\n#### 忽略键名的大小写\n\n有时候分区和键的名称大小写混合非常烦人，这个时候就可以通过 `InsensitiveLoad` 将所有分区和键名在读取里强制转换为小写：\n\n```go\ncfg, err := ini.InsensitiveLoad(\"filename\")\n//...\n\n// sec1 和 sec2 指向同一个分区对象\nsec1, err := cfg.GetSection(\"Section\")\nsec2, err := cfg.GetSection(\"SecTIOn\")\n\n// key1 和 key2 指向同一个键对象\nkey1, err := sec1.GetKey(\"Key\")\nkey2, err := sec2.GetKey(\"KeY\")\n```\n\n#### 类似 MySQL 配置中的布尔值键\n\nMySQL 的配置文件中会出现没有具体值的布尔类型的键：\n\n```ini\n[mysqld]\n...\nskip-host-cache\nskip-name-resolve\n```\n\n默认情况下这被认为是缺失值而无法完成解析，但可以通过高级的加载选项对它们进行处理：\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{AllowBooleanKeys: true}, \"my.cnf\"))\n```\n\n这些键的值永远为 `true`，且在保存到文件时也只会输出键名。\n\n如果您想要通过程序来生成此类键，则可以使用 `NewBooleanKey`：\n\n```go\nkey, err := sec.NewBooleanKey(\"skip-host-cache\")\n```\n\n#### 关于注释\n\n下述几种情况的内容将被视为注释：\n\n1. 所有以 `#` 或 `;` 开头的行\n2. 所有在 `#` 或 `;` 之后的内容\n3. 分区标签后的文字 (即 `[分区名]` 之后的内容)\n\n如果你希望使用包含 `#` 或 `;` 的值，请使用 ``` ` ``` 或 ``` \"\"\" ``` 进行包覆。\n\n除此之外，您还可以通过 `LoadOptions` 完全忽略行内注释：\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{IgnoreInlineComment: true}, \"app.ini\"))\n```\n\n### 操作分区（Section）\n\n获取指定分区：\n\n```go\nsection, err := cfg.GetSection(\"section name\")\n```\n\n如果您想要获取默认分区，则可以用空字符串代替分区名：\n\n```go\nsection, err := cfg.GetSection(\"\")\n```\n\n当您非常确定某个分区是存在的，可以使用以下简便方法：\n\n```go\nsection := cfg.Section(\"section name\")\n```\n\n如果不小心判断错了，要获取的分区其实是不存在的，那会发生什么呢？没事的，它会自动创建并返回一个对应的分区对象给您。\n\n创建一个分区：\n\n```go\nerr := cfg.NewSection(\"new section\")\n```\n\n获取所有分区对象或名称：\n\n```go\nsections := cfg.Sections()\nnames := cfg.SectionStrings()\n```\n\n### 操作键（Key）\n\n获取某个分区下的键：\n\n```go\nkey, err := cfg.Section(\"\").GetKey(\"key name\")\n```\n\n和分区一样，您也可以直接获取键而忽略错误处理：\n\n```go\nkey := cfg.Section(\"\").Key(\"key name\")\n```\n\n判断某个键是否存在：\n\n```go\nyes := cfg.Section(\"\").HasKey(\"key name\")\n```\n\n创建一个新的键：\n\n```go\nerr := cfg.Section(\"\").NewKey(\"name\", \"value\")\n```\n\n获取分区下的所有键或键名：\n\n```go\nkeys := cfg.Section(\"\").Keys()\nnames := cfg.Section(\"\").KeyStrings()\n```\n\n获取分区下的所有键值对的克隆：\n\n```go\nhash := cfg.Section(\"\").KeysHash()\n```\n\n### 操作键值（Value）\n\n获取一个类型为字符串（string）的值：\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").String()\n```\n\n获取值的同时通过自定义函数进行处理验证：\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").Validate(func(in string) string {\n\tif len(in) == 0 {\n\t\treturn \"default\"\n\t}\n\treturn in\n})\n```\n\n如果您不需要任何对值的自动转变功能（例如递归读取），可以直接获取原值（这种方式性能最佳）：\n\n```go\nval := cfg.Section(\"\").Key(\"key name\").Value()\n```\n\n判断某个原值是否存在：\n\n```go\nyes := cfg.Section(\"\").HasValue(\"test value\")\n```\n\n获取其它类型的值：\n\n```go\n// 布尔值的规则：\n// true 当值为：1, t, T, TRUE, true, True, YES, yes, Yes, y, ON, on, On\n// false 当值为：0, f, F, FALSE, false, False, NO, no, No, n, OFF, off, Off\nv, err = cfg.Section(\"\").Key(\"BOOL\").Bool()\nv, err = cfg.Section(\"\").Key(\"FLOAT64\").Float64()\nv, err = cfg.Section(\"\").Key(\"INT\").Int()\nv, err = cfg.Section(\"\").Key(\"INT64\").Int64()\nv, err = cfg.Section(\"\").Key(\"UINT\").Uint()\nv, err = cfg.Section(\"\").Key(\"UINT64\").Uint64()\nv, err = cfg.Section(\"\").Key(\"TIME\").TimeFormat(time.RFC3339)\nv, err = cfg.Section(\"\").Key(\"TIME\").Time() // RFC3339\n\nv = cfg.Section(\"\").Key(\"BOOL\").MustBool()\nv = cfg.Section(\"\").Key(\"FLOAT64\").MustFloat64()\nv = cfg.Section(\"\").Key(\"INT\").MustInt()\nv = cfg.Section(\"\").Key(\"INT64\").MustInt64()\nv = cfg.Section(\"\").Key(\"UINT\").MustUint()\nv = cfg.Section(\"\").Key(\"UINT64\").MustUint64()\nv = cfg.Section(\"\").Key(\"TIME\").MustTimeFormat(time.RFC3339)\nv = cfg.Section(\"\").Key(\"TIME\").MustTime() // RFC3339\n\n// 由 Must 开头的方法名允许接收一个相同类型的参数来作为默认值，\n// 当键不存在或者转换失败时，则会直接返回该默认值。\n// 但是，MustString 方法必须传递一个默认值。\n\nv = cfg.Seciont(\"\").Key(\"String\").MustString(\"default\")\nv = cfg.Section(\"\").Key(\"BOOL\").MustBool(true)\nv = cfg.Section(\"\").Key(\"FLOAT64\").MustFloat64(1.25)\nv = cfg.Section(\"\").Key(\"INT\").MustInt(10)\nv = cfg.Section(\"\").Key(\"INT64\").MustInt64(99)\nv = cfg.Section(\"\").Key(\"UINT\").MustUint(3)\nv = cfg.Section(\"\").Key(\"UINT64\").MustUint64(6)\nv = cfg.Section(\"\").Key(\"TIME\").MustTimeFormat(time.RFC3339, time.Now())\nv = cfg.Section(\"\").Key(\"TIME\").MustTime(time.Now()) // RFC3339\n```\n\n如果我的值有好多行怎么办？\n\n```ini\n[advance]\nADDRESS = \"\"\"404 road,\nNotFound, State, 5000\nEarth\"\"\"\n```\n\n嗯哼？小 case！\n\n```go\ncfg.Section(\"advance\").Key(\"ADDRESS\").String()\n\n/* --- start ---\n404 road,\nNotFound, State, 5000\nEarth\n------ end --- */\n```\n\n赞爆了！那要是我属于一行的内容写不下想要写到第二行怎么办？\n\n```ini\n[advance]\ntwo_lines = how about \\\n\tcontinuation lines?\nlots_of_lines = 1 \\\n\t2 \\\n\t3 \\\n\t4\n```\n\n简直是小菜一碟！\n\n```go\ncfg.Section(\"advance\").Key(\"two_lines\").String() // how about continuation lines?\ncfg.Section(\"advance\").Key(\"lots_of_lines\").String() // 1 2 3 4\n```\n\n可是我有时候觉得两行连在一起特别没劲，怎么才能不自动连接两行呢？\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{\n\tIgnoreContinuation: true,\n}, \"filename\")\n```\n\n哇靠给力啊！\n\n需要注意的是，值两侧的单引号会被自动剔除：\n\n```ini\nfoo = \"some value\" // foo: some value\nbar = 'some value' // bar: some value\n```\n\n有时您会获得像从 [Crowdin](https://crowdin.com/) 网站下载的文件那样具有特殊格式的值（值使用双引号括起来，内部的双引号被转义）：\n\n```ini\ncreate_repo=\"创建了仓库 %s\"\n```\n\n那么，怎么自动地将这类值进行处理呢？\n\n```go\ncfg, err := ini.LoadSources(ini.LoadOptions{UnescapeValueDoubleQuotes: true}, \"en-US.ini\"))\ncfg.Section(\"\").Key(\"create_repo\").String() \n// You got: 创建了仓库 %s\n```\n\n这就是全部了？哈哈，当然不是。\n\n#### 操作键值的辅助方法\n\n获取键值时设定候选值：\n\n```go\nv = cfg.Section(\"\").Key(\"STRING\").In(\"default\", []string{\"str\", \"arr\", \"types\"})\nv = cfg.Section(\"\").Key(\"FLOAT64\").InFloat64(1.1, []float64{1.25, 2.5, 3.75})\nv = cfg.Section(\"\").Key(\"INT\").InInt(5, []int{10, 20, 30})\nv = cfg.Section(\"\").Key(\"INT64\").InInt64(10, []int64{10, 20, 30})\nv = cfg.Section(\"\").Key(\"UINT\").InUint(4, []int{3, 6, 9})\nv = cfg.Section(\"\").Key(\"UINT64\").InUint64(8, []int64{3, 6, 9})\nv = cfg.Section(\"\").Key(\"TIME\").InTimeFormat(time.RFC3339, time.Now(), []time.Time{time1, time2, time3})\nv = cfg.Section(\"\").Key(\"TIME\").InTime(time.Now(), []time.Time{time1, time2, time3}) // RFC3339\n```\n\n如果获取到的值不是候选值的任意一个，则会返回默认值，而默认值不需要是候选值中的一员。\n\n验证获取的值是否在指定范围内：\n\n```go\nvals = cfg.Section(\"\").Key(\"FLOAT64\").RangeFloat64(0.0, 1.1, 2.2)\nvals = cfg.Section(\"\").Key(\"INT\").RangeInt(0, 10, 20)\nvals = cfg.Section(\"\").Key(\"INT64\").RangeInt64(0, 10, 20)\nvals = cfg.Section(\"\").Key(\"UINT\").RangeUint(0, 3, 9)\nvals = cfg.Section(\"\").Key(\"UINT64\").RangeUint64(0, 3, 9)\nvals = cfg.Section(\"\").Key(\"TIME\").RangeTimeFormat(time.RFC3339, time.Now(), minTime, maxTime)\nvals = cfg.Section(\"\").Key(\"TIME\").RangeTime(time.Now(), minTime, maxTime) // RFC3339\n```\n\n##### 自动分割键值到切片（slice）\n\n当存在无效输入时，使用零值代替：\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> [0.0 2.2 0.0 0.0]\nvals = cfg.Section(\"\").Key(\"STRINGS\").Strings(\",\")\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").Float64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").Ints(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").Int64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").Uints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").Uint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").Times(\",\")\n```\n\n从结果切片中剔除无效输入：\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> [2.2]\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").ValidFloat64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").ValidInts(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").ValidInt64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").ValidUints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").ValidUint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").ValidTimes(\",\")\n```\n\n当存在无效输入时，直接返回错误：\n\n```go\n// Input: 1.1, 2.2, 3.3, 4.4 -> [1.1 2.2 3.3 4.4]\n// Input: how, 2.2, are, you -> error\nvals = cfg.Section(\"\").Key(\"FLOAT64S\").StrictFloat64s(\",\")\nvals = cfg.Section(\"\").Key(\"INTS\").StrictInts(\",\")\nvals = cfg.Section(\"\").Key(\"INT64S\").StrictInt64s(\",\")\nvals = cfg.Section(\"\").Key(\"UINTS\").StrictUints(\",\")\nvals = cfg.Section(\"\").Key(\"UINT64S\").StrictUint64s(\",\")\nvals = cfg.Section(\"\").Key(\"TIMES\").StrictTimes(\",\")\n```\n\n### 保存配置\n\n终于到了这个时刻，是时候保存一下配置了。\n\n比较原始的做法是输出配置到某个文件：\n\n```go\n// ...\nerr = cfg.SaveTo(\"my.ini\")\nerr = cfg.SaveToIndent(\"my.ini\", \"\\t\")\n```\n\n另一个比较高级的做法是写入到任何实现 `io.Writer` 接口的对象中：\n\n```go\n// ...\ncfg.WriteTo(writer)\ncfg.WriteToIndent(writer, \"\\t\")\n```\n\n默认情况下，空格将被用于对齐键值之间的等号以美化输出结果，以下代码可以禁用该功能：\n\n```go\nini.PrettyFormat = false\n``` \n\n## 高级用法\n\n### 递归读取键值\n\n在获取所有键值的过程中，特殊语法 `%()s` 会被应用，其中 `` 可以是相同分区或者默认分区下的键名。字符串 `%()s` 会被相应的键值所替代，如果指定的键不存在，则会用空字符串替代。您可以最多使用 99 层的递归嵌套。\n\n```ini\nNAME = ini\n\n[author]\nNAME = Unknwon\nGITHUB = https://github.com/%(NAME)s\n\n[package]\nFULL_NAME = github.com/go-ini/%(NAME)s\n```\n\n```go\ncfg.Section(\"author\").Key(\"GITHUB\").String()\t\t// https://github.com/Unknwon\ncfg.Section(\"package\").Key(\"FULL_NAME\").String()\t// github.com/go-ini/ini\n```\n\n### 读取父子分区\n\n您可以在分区名称中使用 `.` 来表示两个或多个分区之间的父子关系。如果某个键在子分区中不存在，则会去它的父分区中再次寻找，直到没有父分区为止。\n\n```ini\nNAME = ini\nVERSION = v1\nIMPORT_PATH = gopkg.in/%(NAME)s.%(VERSION)s\n\n[package]\nCLONE_URL = https://%(IMPORT_PATH)s\n\n[package.sub]\n```\n\n```go\ncfg.Section(\"package.sub\").Key(\"CLONE_URL\").String()\t// https://gopkg.in/ini.v1\n```\n\n#### 获取上级父分区下的所有键名\n\n```go\ncfg.Section(\"package.sub\").ParentKeys() // [\"CLONE_URL\"]\n```\n\n### 无法解析的分区\n\n如果遇到一些比较特殊的分区，它们不包含常见的键值对，而是没有固定格式的纯文本，则可以使用 `LoadOptions.UnparsableSections` 进行处理：\n\n```go\ncfg, err := LoadSources(ini.LoadOptions{UnparseableSections: []string{\"COMMENTS\"}}, `[COMMENTS]\n<1> This slide has the fuel listed in the wrong units `))\n\nbody := cfg.Section(\"COMMENTS\").Body()\n\n/* --- start ---\n<1> This slide has the fuel listed in the wrong units \n------ end --- */\n```\n\n### 读取自增键名\n\n如果数据源中的键名为 `-`，则认为该键使用了自增键名的特殊语法。计数器从 1 开始，并且分区之间是相互独立的。\n\n```ini\n[features]\n-: Support read/write comments of keys and sections\n-: Support auto-increment of key names\n-: Support load multiple files to overwrite key values\n```\n\n```go\ncfg.Section(\"features\").KeyStrings()\t// []{\"#1\", \"#2\", \"#3\"}\n```\n\n### 映射到结构\n\n想要使用更加面向对象的方式玩转 INI 吗？好主意。\n\n```ini\nName = Unknwon\nage = 21\nMale = true\nBorn = 1993-01-01T20:17:05Z\n\n[Note]\nContent = Hi is a good man!\nCities = HangZhou, Boston\n```\n\n```go\ntype Note struct {\n\tContent string\n\tCities []string\n}\n\ntype Person struct {\n\tName string\n\tAge int `ini:\"age\"`\n\tMale bool\n\tBorn time.Time\n\tNote\n\tCreated time.Time `ini:\"-\"`\n}\n\nfunc main() {\n\tcfg, err := ini.Load(\"path/to/ini\")\n\t// ...\n\tp := new(Person)\n\terr = cfg.MapTo(p)\n\t// ...\n\n\t// 一切竟可以如此的简单。\n\terr = ini.MapTo(p, \"path/to/ini\")\n\t// ...\n\n\t// 嗯哼？只需要映射一个分区吗？\n\tn := new(Note)\n\terr = cfg.Section(\"Note\").MapTo(n)\n\t// ...\n}\n```\n\n结构的字段怎么设置默认值呢？很简单，只要在映射之前对指定字段进行赋值就可以了。如果键未找到或者类型错误，该值不会发生改变。\n\n```go\n// ...\np := &Person{\n\tName: \"Joe\",\n}\n// ...\n```\n\n这样玩 INI 真的好酷啊！然而，如果不能还给我原来的配置文件，有什么卵用？\n\n### 从结构反射\n\n可是，我有说不能吗？\n\n```go\ntype Embeded struct {\n\tDates []time.Time `delim:\"|\" comment:\"Time data\"`\n\tPlaces []string `ini:\"places,omitempty\"`\n\tNone []int `ini:\",omitempty\"`\n}\n\ntype Author struct {\n\tName string `ini:\"NAME\"`\n\tMale bool\n\tAge int `comment:\"Author's age\"`\n\tGPA float64\n\tNeverMind string `ini:\"-\"`\n\t*Embeded `comment:\"Embeded section\"`\n}\n\nfunc main() {\n\ta := &Author{\"Unknwon\", true, 21, 2.8, \"\",\n\t\t&Embeded{\n\t\t\t[]time.Time{time.Now(), time.Now()},\n\t\t\t[]string{\"HangZhou\", \"Boston\"},\n\t\t\t[]int{},\n\t\t}}\n\tcfg := ini.Empty()\n\terr = ini.ReflectFrom(cfg, a)\n\t// ...\n}\n```\n\n瞧瞧，奇迹发生了。\n\n```ini\nNAME = Unknwon\nMale = true\n; Author's age\nAge = 21\nGPA = 2.8\n\n; Embeded section\n[Embeded]\n; Time data\nDates = 2015-08-07T22:14:22+08:00|2015-08-07T22:14:22+08:00\nplaces = HangZhou,Boston\n```\n\n#### 名称映射器（Name Mapper）\n\n为了节省您的时间并简化代码，本库支持类型为 [`NameMapper`](https://gowalker.org/gopkg.in/ini.v1#NameMapper) 的名称映射器，该映射器负责结构字段名与分区名和键名之间的映射。\n\n目前有 2 款内置的映射器：\n\n- `AllCapsUnderscore`：该映射器将字段名转换至格式 `ALL_CAPS_UNDERSCORE` 后再去匹配分区名和键名。\n- `TitleUnderscore`：该映射器将字段名转换至格式 `title_underscore` 后再去匹配分区名和键名。\n\n使用方法：\n\n```go\ntype Info struct{\n\tPackageName string\n}\n\nfunc main() {\n\terr = ini.MapToWithMapper(&Info{}, ini.TitleUnderscore, []byte(\"package_name=ini\"))\n\t// ...\n\n\tcfg, err := ini.Load([]byte(\"PACKAGE_NAME=ini\"))\n\t// ...\n\tinfo := new(Info)\n\tcfg.NameMapper = ini.AllCapsUnderscore\n\terr = cfg.MapTo(info)\n\t// ...\n}\n```\n\n使用函数 `ini.ReflectFromWithMapper` 时也可应用相同的规则。\n\n#### 值映射器（Value Mapper）\n\n值映射器允许使用一个自定义函数自动展开值的具体内容，例如：运行时获取环境变量：\n\n```go\ntype Env struct {\n\tFoo string `ini:\"foo\"`\n}\n\nfunc main() {\n\tcfg, err := ini.Load([]byte(\"[env]\\nfoo = ${MY_VAR}\\n\")\n\tcfg.ValueMapper = os.ExpandEnv\n\t// ...\n\tenv := &Env{}\n\terr = cfg.Section(\"env\").MapTo(env)\n}\n```\n\n本例中，`env.Foo` 将会是运行时所获取到环境变量 `MY_VAR` 的值。\n\n#### 映射/反射的其它说明\n\n任何嵌入的结构都会被默认认作一个不同的分区，并且不会自动产生所谓的父子分区关联：\n\n```go\ntype Child struct {\n\tAge string\n}\n\ntype Parent struct {\n\tName string\n\tChild\n}\n\ntype Config struct {\n\tCity string\n\tParent\n}\n```\n\n示例配置文件：\n\n```ini\nCity = Boston\n\n[Parent]\nName = Unknwon\n\n[Child]\nAge = 21\n```\n\n很好，但是，我就是要嵌入结构也在同一个分区。好吧，你爹是李刚！\n\n```go\ntype Child struct {\n\tAge string\n}\n\ntype Parent struct {\n\tName string\n\tChild `ini:\"Parent\"`\n}\n\ntype Config struct {\n\tCity string\n\tParent\n}\n```\n\n示例配置文件：\n\n```ini\nCity = Boston\n\n[Parent]\nName = Unknwon\nAge = 21\n```\n\n## 获取帮助\n\n- [API 文档](https://gowalker.org/gopkg.in/ini.v1)\n- [创建工单](https://github.com/go-ini/ini/issues/new)\n\n## 常见问题\n\n### 字段 `BlockMode` 是什么？\n\n默认情况下，本库会在您进行读写操作时采用锁机制来确保数据时间。但在某些情况下，您非常确定只进行读操作。此时，您可以通过设置 `cfg.BlockMode = false` 来将读操作提升大约 **50-70%** 的性能。\n\n### 为什么要写另一个 INI 解析库？\n\n许多人都在使用我的 [goconfig](https://github.com/Unknwon/goconfig) 来完成对 INI 文件的操作，但我希望使用更加 Go 风格的代码。并且当您设置 `cfg.BlockMode = false` 时，会有大约 **10-30%** 的性能提升。\n\n为了做出这些改变，我必须对 API 进行破坏，所以新开一个仓库是最安全的做法。除此之外，本库直接使用 `gopkg.in` 来进行版本化发布。（其实真相是导入路径更短了）\n" }, { "path": "vendor/github.com/go-ini/ini/error.go", "content": "// Copyright 2016 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"fmt\"\n)\n\ntype ErrDelimiterNotFound struct {\n\tLine string\n}\n\nfunc IsErrDelimiterNotFound(err error) bool {\n\t_, ok := err.(ErrDelimiterNotFound)\n\treturn ok\n}\n\nfunc (err ErrDelimiterNotFound) Error() string {\n\treturn fmt.Sprintf(\"key-value delimiter not found: %s\", err.Line)\n}\n" }, { "path": "vendor/github.com/go-ini/ini/file.go", "content": "// Copyright 2017 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"strings\"\n\t\"sync\"\n)\n\n// File represents a combination of a or more INI file(s) in memory.\ntype File struct {\n\toptions LoadOptions\n\tdataSources []dataSource\n\n\t// Should make things safe, but sometimes doesn't matter.\n\tBlockMode bool\n\tlock sync.RWMutex\n\n\t// To keep data in order.\n\tsectionList []string\n\t// Actual data is stored here.\n\tsections map[string]*Section\n\n\tNameMapper\n\tValueMapper\n}\n\n// newFile initializes File object with given data sources.\nfunc newFile(dataSources []dataSource, opts LoadOptions) *File {\n\treturn &File{\n\t\tBlockMode: true,\n\t\tdataSources: dataSources,\n\t\tsections: make(map[string]*Section),\n\t\tsectionList: make([]string, 0, 10),\n\t\toptions: opts,\n\t}\n}\n\n// Empty returns an empty file object.\nfunc Empty() *File {\n\t// Ignore error here, we sure our data is good.\n\tf, _ := Load([]byte(\"\"))\n\treturn f\n}\n\n// NewSection creates a new section.\nfunc (f *File) NewSection(name string) (*Section, error) {\n\tif len(name) == 0 {\n\t\treturn nil, errors.New(\"error creating new section: empty section name\")\n\t} else if f.options.Insensitive && name != DEFAULT_SECTION {\n\t\tname = strings.ToLower(name)\n\t}\n\n\tif f.BlockMode {\n\t\tf.lock.Lock()\n\t\tdefer f.lock.Unlock()\n\t}\n\n\tif inSlice(name, f.sectionList) {\n\t\treturn f.sections[name], nil\n\t}\n\n\tf.sectionList = append(f.sectionList, name)\n\tf.sections[name] = newSection(f, name)\n\treturn f.sections[name], nil\n}\n\n// NewRawSection creates a new section with an unparseable body.\nfunc (f *File) NewRawSection(name, body string) (*Section, error) {\n\tsection, err := f.NewSection(name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tsection.isRawSection = true\n\tsection.rawBody = body\n\treturn section, nil\n}\n\n// NewSections creates a list of sections.\nfunc (f *File) NewSections(names ...string) (err error) {\n\tfor _, name := range names {\n\t\tif _, err = f.NewSection(name); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// GetSection returns section by given name.\nfunc (f *File) GetSection(name string) (*Section, error) {\n\tif len(name) == 0 {\n\t\tname = DEFAULT_SECTION\n\t}\n\tif f.options.Insensitive {\n\t\tname = strings.ToLower(name)\n\t}\n\n\tif f.BlockMode {\n\t\tf.lock.RLock()\n\t\tdefer f.lock.RUnlock()\n\t}\n\n\tsec := f.sections[name]\n\tif sec == nil {\n\t\treturn nil, fmt.Errorf(\"section '%s' does not exist\", name)\n\t}\n\treturn sec, nil\n}\n\n// Section assumes named section exists and returns a zero-value when not.\nfunc (f *File) Section(name string) *Section {\n\tsec, err := f.GetSection(name)\n\tif err != nil {\n\t\t// Note: It's OK here because the only possible error is empty section name,\n\t\t// but if it's empty, this piece of code won't be executed.\n\t\tsec, _ = f.NewSection(name)\n\t\treturn sec\n\t}\n\treturn sec\n}\n\n// Section returns list of Section.\nfunc (f *File) Sections() []*Section {\n\tsections := make([]*Section, len(f.sectionList))\n\tfor i := range f.sectionList {\n\t\tsections[i] = f.Section(f.sectionList[i])\n\t}\n\treturn sections\n}\n\n// ChildSections returns a list of child sections of given section name.\nfunc (f *File) ChildSections(name string) []*Section {\n\treturn f.Section(name).ChildSections()\n}\n\n// SectionStrings returns list of section names.\nfunc (f *File) SectionStrings() []string {\n\tlist := make([]string, len(f.sectionList))\n\tcopy(list, f.sectionList)\n\treturn list\n}\n\n// DeleteSection deletes a section.\nfunc (f *File) DeleteSection(name string) {\n\tif f.BlockMode {\n\t\tf.lock.Lock()\n\t\tdefer f.lock.Unlock()\n\t}\n\n\tif len(name) == 0 {\n\t\tname = DEFAULT_SECTION\n\t}\n\n\tfor i, s := range f.sectionList {\n\t\tif s == name {\n\t\t\tf.sectionList = append(f.sectionList[:i], f.sectionList[i+1:]...)\n\t\t\tdelete(f.sections, name)\n\t\t\treturn\n\t\t}\n\t}\n}\n\nfunc (f *File) reload(s dataSource) error {\n\tr, err := s.ReadCloser()\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer r.Close()\n\n\treturn f.parse(r)\n}\n\n// Reload reloads and parses all data sources.\nfunc (f *File) Reload() (err error) {\n\tfor _, s := range f.dataSources {\n\t\tif err = f.reload(s); err != nil {\n\t\t\t// In loose mode, we create an empty default section for nonexistent files.\n\t\t\tif os.IsNotExist(err) && f.options.Loose {\n\t\t\t\tf.parse(bytes.NewBuffer(nil))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// Append appends one or more data sources and reloads automatically.\nfunc (f *File) Append(source interface{}, others ...interface{}) error {\n\tds, err := parseDataSource(source)\n\tif err != nil {\n\t\treturn err\n\t}\n\tf.dataSources = append(f.dataSources, ds)\n\tfor _, s := range others {\n\t\tds, err = parseDataSource(s)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tf.dataSources = append(f.dataSources, ds)\n\t}\n\treturn f.Reload()\n}\n\nfunc (f *File) writeToBuffer(indent string) (*bytes.Buffer, error) {\n\tequalSign := \"=\"\n\tif PrettyFormat {\n\t\tequalSign = \" = \"\n\t}\n\n\t// Use buffer to make sure target is safe until finish encoding.\n\tbuf := bytes.NewBuffer(nil)\n\tfor i, sname := range f.sectionList {\n\t\tsec := f.Section(sname)\n\t\tif len(sec.Comment) > 0 {\n\t\t\tif sec.Comment[0] != '#' && sec.Comment[0] != ';' {\n\t\t\t\tsec.Comment = \"; \" + sec.Comment\n\t\t\t} else {\n\t\t\t\tsec.Comment = sec.Comment[:1] + \" \" + strings.TrimSpace(sec.Comment[1:])\n\t\t\t}\n\t\t\tif _, err := buf.WriteString(sec.Comment + LineBreak); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\n\t\tif i > 0 || DefaultHeader {\n\t\t\tif _, err := buf.WriteString(\"[\" + sname + \"]\" + LineBreak); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t} else {\n\t\t\t// Write nothing if default section is empty\n\t\t\tif len(sec.keyList) == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tif sec.isRawSection {\n\t\t\tif _, err := buf.WriteString(sec.rawBody); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tif PrettySection {\n\t\t\t\t// Put a line between sections\n\t\t\t\tif _, err := buf.WriteString(LineBreak); err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\t// Count and generate alignment length and buffer spaces using the\n\t\t// longest key. Keys may be modifed if they contain certain characters so\n\t\t// we need to take that into account in our calculation.\n\t\talignLength := 0\n\t\tif PrettyFormat {\n\t\t\tfor _, kname := range sec.keyList {\n\t\t\t\tkeyLength := len(kname)\n\t\t\t\t// First case will surround key by ` and second by \"\"\"\n\t\t\t\tif strings.ContainsAny(kname, \"\\\"=:\") {\n\t\t\t\t\tkeyLength += 2\n\t\t\t\t} else if strings.Contains(kname, \"`\") {\n\t\t\t\t\tkeyLength += 6\n\t\t\t\t}\n\n\t\t\t\tif keyLength > alignLength {\n\t\t\t\t\talignLength = keyLength\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\talignSpaces := bytes.Repeat([]byte(\" \"), alignLength)\n\n\tKEY_LIST:\n\t\tfor _, kname := range sec.keyList {\n\t\t\tkey := sec.Key(kname)\n\t\t\tif len(key.Comment) > 0 {\n\t\t\t\tif len(indent) > 0 && sname != DEFAULT_SECTION {\n\t\t\t\t\tbuf.WriteString(indent)\n\t\t\t\t}\n\t\t\t\tif key.Comment[0] != '#' && key.Comment[0] != ';' {\n\t\t\t\t\tkey.Comment = \"; \" + key.Comment\n\t\t\t\t} else {\n\t\t\t\t\tkey.Comment = key.Comment[:1] + \" \" + strings.TrimSpace(key.Comment[1:])\n\t\t\t\t}\n\t\t\t\tif _, err := buf.WriteString(key.Comment + LineBreak); err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif len(indent) > 0 && sname != DEFAULT_SECTION {\n\t\t\t\tbuf.WriteString(indent)\n\t\t\t}\n\n\t\t\tswitch {\n\t\t\tcase key.isAutoIncrement:\n\t\t\t\tkname = \"-\"\n\t\t\tcase strings.ContainsAny(kname, \"\\\"=:\"):\n\t\t\t\tkname = \"`\" + kname + \"`\"\n\t\t\tcase strings.Contains(kname, \"`\"):\n\t\t\t\tkname = `\"\"\"` + kname + `\"\"\"`\n\t\t\t}\n\n\t\t\tfor _, val := range key.ValueWithShadows() {\n\t\t\t\tif _, err := buf.WriteString(kname); err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\n\t\t\t\tif key.isBooleanType {\n\t\t\t\t\tif kname != sec.keyList[len(sec.keyList)-1] {\n\t\t\t\t\t\tbuf.WriteString(LineBreak)\n\t\t\t\t\t}\n\t\t\t\t\tcontinue KEY_LIST\n\t\t\t\t}\n\n\t\t\t\t// Write out alignment spaces before \"=\" sign\n\t\t\t\tif PrettyFormat {\n\t\t\t\t\tbuf.Write(alignSpaces[:alignLength-len(kname)])\n\t\t\t\t}\n\n\t\t\t\t// In case key value contains \"\\n\", \"`\", \"\\\"\", \"#\" or \";\"\n\t\t\t\tif strings.ContainsAny(val, \"\\n`\") {\n\t\t\t\t\tval = `\"\"\"` + val + `\"\"\"`\n\t\t\t\t} else if !f.options.IgnoreInlineComment && strings.ContainsAny(val, \"#;\") {\n\t\t\t\t\tval = \"`\" + val + \"`\"\n\t\t\t\t}\n\t\t\t\tif _, err := buf.WriteString(equalSign + val + LineBreak); err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor _, val := range key.nestedValues {\n\t\t\t\tif _, err := buf.WriteString(indent + \" \" + val + LineBreak); err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif PrettySection {\n\t\t\t// Put a line between sections\n\t\t\tif _, err := buf.WriteString(LineBreak); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t}\n\n\treturn buf, nil\n}\n\n// WriteToIndent writes content into io.Writer with given indention.\n// If PrettyFormat has been set to be true,\n// it will align \"=\" sign with spaces under each section.\nfunc (f *File) WriteToIndent(w io.Writer, indent string) (int64, error) {\n\tbuf, err := f.writeToBuffer(indent)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\treturn buf.WriteTo(w)\n}\n\n// WriteTo writes file content into io.Writer.\nfunc (f *File) WriteTo(w io.Writer) (int64, error) {\n\treturn f.WriteToIndent(w, \"\")\n}\n\n// SaveToIndent writes content to file system with given value indention.\nfunc (f *File) SaveToIndent(filename, indent string) error {\n\t// Note: Because we are truncating with os.Create,\n\t// \tso it's safer to save to a temporary file location and rename afte done.\n\tbuf, err := f.writeToBuffer(indent)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn ioutil.WriteFile(filename, buf.Bytes(), 0666)\n}\n\n// SaveTo writes content to file system.\nfunc (f *File) SaveTo(filename string) error {\n\treturn f.SaveToIndent(filename, \"\")\n}\n" }, { "path": "vendor/github.com/go-ini/ini/ini.go", "content": "// Copyright 2014 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\n// Package ini provides INI file read and write functionality in Go.\npackage ini\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"regexp\"\n\t\"runtime\"\n)\n\nconst (\n\t// Name for default section. You can use this constant or the string literal.\n\t// In most of cases, an empty string is all you need to access the section.\n\tDEFAULT_SECTION = \"DEFAULT\"\n\n\t// Maximum allowed depth when recursively substituing variable names.\n\t_DEPTH_VALUES = 99\n\t_VERSION = \"1.32.1\"\n)\n\n// Version returns current package version literal.\nfunc Version() string {\n\treturn _VERSION\n}\n\nvar (\n\t// Delimiter to determine or compose a new line.\n\t// This variable will be changed to \"\\r\\n\" automatically on Windows\n\t// at package init time.\n\tLineBreak = \"\\n\"\n\n\t// Variable regexp pattern: %(variable)s\n\tvarPattern = regexp.MustCompile(`%\\(([^\\)]+)\\)s`)\n\n\t// Indicate whether to align \"=\" sign with spaces to produce pretty output\n\t// or reduce all possible spaces for compact format.\n\tPrettyFormat = true\n\n\t// Explicitly write DEFAULT section header\n\tDefaultHeader = false\n\n\t// Indicate whether to put a line between sections\n\tPrettySection = true\n)\n\nfunc init() {\n\tif runtime.GOOS == \"windows\" {\n\t\tLineBreak = \"\\r\\n\"\n\t}\n}\n\nfunc inSlice(str string, s []string) bool {\n\tfor _, v := range s {\n\t\tif str == v {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// dataSource is an interface that returns object which can be read and closed.\ntype dataSource interface {\n\tReadCloser() (io.ReadCloser, error)\n}\n\n// sourceFile represents an object that contains content on the local file system.\ntype sourceFile struct {\n\tname string\n}\n\nfunc (s sourceFile) ReadCloser() (_ io.ReadCloser, err error) {\n\treturn os.Open(s.name)\n}\n\n// sourceData represents an object that contains content in memory.\ntype sourceData struct {\n\tdata []byte\n}\n\nfunc (s *sourceData) ReadCloser() (io.ReadCloser, error) {\n\treturn ioutil.NopCloser(bytes.NewReader(s.data)), nil\n}\n\n// sourceReadCloser represents an input stream with Close method.\ntype sourceReadCloser struct {\n\treader io.ReadCloser\n}\n\nfunc (s *sourceReadCloser) ReadCloser() (io.ReadCloser, error) {\n\treturn s.reader, nil\n}\n\nfunc parseDataSource(source interface{}) (dataSource, error) {\n\tswitch s := source.(type) {\n\tcase string:\n\t\treturn sourceFile{s}, nil\n\tcase []byte:\n\t\treturn &sourceData{s}, nil\n\tcase io.ReadCloser:\n\t\treturn &sourceReadCloser{s}, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"error parsing data source: unknown type '%s'\", s)\n\t}\n}\n\ntype LoadOptions struct {\n\t// Loose indicates whether the parser should ignore nonexistent files or return error.\n\tLoose bool\n\t// Insensitive indicates whether the parser forces all section and key names to lowercase.\n\tInsensitive bool\n\t// IgnoreContinuation indicates whether to ignore continuation lines while parsing.\n\tIgnoreContinuation bool\n\t// IgnoreInlineComment indicates whether to ignore comments at the end of value and treat it as part of value.\n\tIgnoreInlineComment bool\n\t// AllowBooleanKeys indicates whether to allow boolean type keys or treat as value is missing.\n\t// This type of keys are mostly used in my.cnf.\n\tAllowBooleanKeys bool\n\t// AllowShadows indicates whether to keep track of keys with same name under same section.\n\tAllowShadows bool\n\t// AllowNestedValues indicates whether to allow AWS-like nested values.\n\t// Docs: http://docs.aws.amazon.com/cli/latest/topic/config-vars.html#nested-values\n\tAllowNestedValues bool\n\t// UnescapeValueDoubleQuotes indicates whether to unescape double quotes inside value to regular format\n\t// when value is surrounded by double quotes, e.g. key=\"a \\\"value\\\"\" => key=a \"value\"\n\tUnescapeValueDoubleQuotes bool\n\t// UnescapeValueCommentSymbols indicates to unescape comment symbols (\\# and \\;) inside value to regular format\n\t// when value is NOT surrounded by any quotes.\n\t// Note: UNSTABLE, behavior might change to only unescape inside double quotes but may noy necessary at all.\n\tUnescapeValueCommentSymbols bool\n\t// Some INI formats allow group blocks that store a block of raw content that doesn't otherwise\n\t// conform to key/value pairs. Specify the names of those blocks here.\n\tUnparseableSections []string\n}\n\nfunc LoadSources(opts LoadOptions, source interface{}, others ...interface{}) (_ *File, err error) {\n\tsources := make([]dataSource, len(others)+1)\n\tsources[0], err = parseDataSource(source)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tfor i := range others {\n\t\tsources[i+1], err = parseDataSource(others[i])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\tf := newFile(sources, opts)\n\tif err = f.Reload(); err != nil {\n\t\treturn nil, err\n\t}\n\treturn f, nil\n}\n\n// Load loads and parses from INI data sources.\n// Arguments can be mixed of file name with string type, or raw data in []byte.\n// It will return error if list contains nonexistent files.\nfunc Load(source interface{}, others ...interface{}) (*File, error) {\n\treturn LoadSources(LoadOptions{}, source, others...)\n}\n\n// LooseLoad has exactly same functionality as Load function\n// except it ignores nonexistent files instead of returning error.\nfunc LooseLoad(source interface{}, others ...interface{}) (*File, error) {\n\treturn LoadSources(LoadOptions{Loose: true}, source, others...)\n}\n\n// InsensitiveLoad has exactly same functionality as Load function\n// except it forces all section and key names to be lowercased.\nfunc InsensitiveLoad(source interface{}, others ...interface{}) (*File, error) {\n\treturn LoadSources(LoadOptions{Insensitive: true}, source, others...)\n}\n\n// InsensitiveLoad has exactly same functionality as Load function\n// except it allows have shadow keys.\nfunc ShadowLoad(source interface{}, others ...interface{}) (*File, error) {\n\treturn LoadSources(LoadOptions{AllowShadows: true}, source, others...)\n}\n" }, { "path": "vendor/github.com/go-ini/ini/key.go", "content": "// Copyright 2014 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\n// Key represents a key under a section.\ntype Key struct {\n\ts *Section\n\tComment string\n\tname string\n\tvalue string\n\tisAutoIncrement bool\n\tisBooleanType bool\n\n\tisShadow bool\n\tshadows []*Key\n\n\tnestedValues []string\n}\n\n// newKey simply return a key object with given values.\nfunc newKey(s *Section, name, val string) *Key {\n\treturn &Key{\n\t\ts: s,\n\t\tname: name,\n\t\tvalue: val,\n\t}\n}\n\nfunc (k *Key) addShadow(val string) error {\n\tif k.isShadow {\n\t\treturn errors.New(\"cannot add shadow to another shadow key\")\n\t} else if k.isAutoIncrement || k.isBooleanType {\n\t\treturn errors.New(\"cannot add shadow to auto-increment or boolean key\")\n\t}\n\n\tshadow := newKey(k.s, k.name, val)\n\tshadow.isShadow = true\n\tk.shadows = append(k.shadows, shadow)\n\treturn nil\n}\n\n// AddShadow adds a new shadow key to itself.\nfunc (k *Key) AddShadow(val string) error {\n\tif !k.s.f.options.AllowShadows {\n\t\treturn errors.New(\"shadow key is not allowed\")\n\t}\n\treturn k.addShadow(val)\n}\n\nfunc (k *Key) addNestedValue(val string) error {\n\tif k.isAutoIncrement || k.isBooleanType {\n\t\treturn errors.New(\"cannot add nested value to auto-increment or boolean key\")\n\t}\n\n\tk.nestedValues = append(k.nestedValues, val)\n\treturn nil\n}\n\nfunc (k *Key) AddNestedValue(val string) error {\n\tif !k.s.f.options.AllowNestedValues {\n\t\treturn errors.New(\"nested value is not allowed\")\n\t}\n\treturn k.addNestedValue(val)\n}\n\n// ValueMapper represents a mapping function for values, e.g. os.ExpandEnv\ntype ValueMapper func(string) string\n\n// Name returns name of key.\nfunc (k *Key) Name() string {\n\treturn k.name\n}\n\n// Value returns raw value of key for performance purpose.\nfunc (k *Key) Value() string {\n\treturn k.value\n}\n\n// ValueWithShadows returns raw values of key and its shadows if any.\nfunc (k *Key) ValueWithShadows() []string {\n\tif len(k.shadows) == 0 {\n\t\treturn []string{k.value}\n\t}\n\tvals := make([]string, len(k.shadows)+1)\n\tvals[0] = k.value\n\tfor i := range k.shadows {\n\t\tvals[i+1] = k.shadows[i].value\n\t}\n\treturn vals\n}\n\n// NestedValues returns nested values stored in the key.\n// It is possible returned value is nil if no nested values stored in the key.\nfunc (k *Key) NestedValues() []string {\n\treturn k.nestedValues\n}\n\n// transformValue takes a raw value and transforms to its final string.\nfunc (k *Key) transformValue(val string) string {\n\tif k.s.f.ValueMapper != nil {\n\t\tval = k.s.f.ValueMapper(val)\n\t}\n\n\t// Fail-fast if no indicate char found for recursive value\n\tif !strings.Contains(val, \"%\") {\n\t\treturn val\n\t}\n\tfor i := 0; i < _DEPTH_VALUES; i++ {\n\t\tvr := varPattern.FindString(val)\n\t\tif len(vr) == 0 {\n\t\t\tbreak\n\t\t}\n\n\t\t// Take off leading '%(' and trailing ')s'.\n\t\tnoption := strings.TrimLeft(vr, \"%(\")\n\t\tnoption = strings.TrimRight(noption, \")s\")\n\n\t\t// Search in the same section.\n\t\tnk, err := k.s.GetKey(noption)\n\t\tif err != nil || k == nk {\n\t\t\t// Search again in default section.\n\t\t\tnk, _ = k.s.f.Section(\"\").GetKey(noption)\n\t\t}\n\n\t\t// Substitute by new value and take off leading '%(' and trailing ')s'.\n\t\tval = strings.Replace(val, vr, nk.value, -1)\n\t}\n\treturn val\n}\n\n// String returns string representation of value.\nfunc (k *Key) String() string {\n\treturn k.transformValue(k.value)\n}\n\n// Validate accepts a validate function which can\n// return modifed result as key value.\nfunc (k *Key) Validate(fn func(string) string) string {\n\treturn fn(k.String())\n}\n\n// parseBool returns the boolean value represented by the string.\n//\n// It accepts 1, t, T, TRUE, true, True, YES, yes, Yes, y, ON, on, On,\n// 0, f, F, FALSE, false, False, NO, no, No, n, OFF, off, Off.\n// Any other value returns an error.\nfunc parseBool(str string) (value bool, err error) {\n\tswitch str {\n\tcase \"1\", \"t\", \"T\", \"true\", \"TRUE\", \"True\", \"YES\", \"yes\", \"Yes\", \"y\", \"ON\", \"on\", \"On\":\n\t\treturn true, nil\n\tcase \"0\", \"f\", \"F\", \"false\", \"FALSE\", \"False\", \"NO\", \"no\", \"No\", \"n\", \"OFF\", \"off\", \"Off\":\n\t\treturn false, nil\n\t}\n\treturn false, fmt.Errorf(\"parsing \\\"%s\\\": invalid syntax\", str)\n}\n\n// Bool returns bool type value.\nfunc (k *Key) Bool() (bool, error) {\n\treturn parseBool(k.String())\n}\n\n// Float64 returns float64 type value.\nfunc (k *Key) Float64() (float64, error) {\n\treturn strconv.ParseFloat(k.String(), 64)\n}\n\n// Int returns int type value.\nfunc (k *Key) Int() (int, error) {\n\treturn strconv.Atoi(k.String())\n}\n\n// Int64 returns int64 type value.\nfunc (k *Key) Int64() (int64, error) {\n\treturn strconv.ParseInt(k.String(), 10, 64)\n}\n\n// Uint returns uint type valued.\nfunc (k *Key) Uint() (uint, error) {\n\tu, e := strconv.ParseUint(k.String(), 10, 64)\n\treturn uint(u), e\n}\n\n// Uint64 returns uint64 type value.\nfunc (k *Key) Uint64() (uint64, error) {\n\treturn strconv.ParseUint(k.String(), 10, 64)\n}\n\n// Duration returns time.Duration type value.\nfunc (k *Key) Duration() (time.Duration, error) {\n\treturn time.ParseDuration(k.String())\n}\n\n// TimeFormat parses with given format and returns time.Time type value.\nfunc (k *Key) TimeFormat(format string) (time.Time, error) {\n\treturn time.Parse(format, k.String())\n}\n\n// Time parses with RFC3339 format and returns time.Time type value.\nfunc (k *Key) Time() (time.Time, error) {\n\treturn k.TimeFormat(time.RFC3339)\n}\n\n// MustString returns default value if key value is empty.\nfunc (k *Key) MustString(defaultVal string) string {\n\tval := k.String()\n\tif len(val) == 0 {\n\t\tk.value = defaultVal\n\t\treturn defaultVal\n\t}\n\treturn val\n}\n\n// MustBool always returns value without error,\n// it returns false if error occurs.\nfunc (k *Key) MustBool(defaultVal ...bool) bool {\n\tval, err := k.Bool()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatBool(defaultVal[0])\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustFloat64 always returns value without error,\n// it returns 0.0 if error occurs.\nfunc (k *Key) MustFloat64(defaultVal ...float64) float64 {\n\tval, err := k.Float64()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatFloat(defaultVal[0], 'f', -1, 64)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustInt always returns value without error,\n// it returns 0 if error occurs.\nfunc (k *Key) MustInt(defaultVal ...int) int {\n\tval, err := k.Int()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatInt(int64(defaultVal[0]), 10)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustInt64 always returns value without error,\n// it returns 0 if error occurs.\nfunc (k *Key) MustInt64(defaultVal ...int64) int64 {\n\tval, err := k.Int64()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatInt(defaultVal[0], 10)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustUint always returns value without error,\n// it returns 0 if error occurs.\nfunc (k *Key) MustUint(defaultVal ...uint) uint {\n\tval, err := k.Uint()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatUint(uint64(defaultVal[0]), 10)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustUint64 always returns value without error,\n// it returns 0 if error occurs.\nfunc (k *Key) MustUint64(defaultVal ...uint64) uint64 {\n\tval, err := k.Uint64()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = strconv.FormatUint(defaultVal[0], 10)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustDuration always returns value without error,\n// it returns zero value if error occurs.\nfunc (k *Key) MustDuration(defaultVal ...time.Duration) time.Duration {\n\tval, err := k.Duration()\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = defaultVal[0].String()\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustTimeFormat always parses with given format and returns value without error,\n// it returns zero value if error occurs.\nfunc (k *Key) MustTimeFormat(format string, defaultVal ...time.Time) time.Time {\n\tval, err := k.TimeFormat(format)\n\tif len(defaultVal) > 0 && err != nil {\n\t\tk.value = defaultVal[0].Format(format)\n\t\treturn defaultVal[0]\n\t}\n\treturn val\n}\n\n// MustTime always parses with RFC3339 format and returns value without error,\n// it returns zero value if error occurs.\nfunc (k *Key) MustTime(defaultVal ...time.Time) time.Time {\n\treturn k.MustTimeFormat(time.RFC3339, defaultVal...)\n}\n\n// In always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) In(defaultVal string, candidates []string) string {\n\tval := k.String()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InFloat64 always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InFloat64(defaultVal float64, candidates []float64) float64 {\n\tval := k.MustFloat64()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InInt always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InInt(defaultVal int, candidates []int) int {\n\tval := k.MustInt()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InInt64 always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InInt64(defaultVal int64, candidates []int64) int64 {\n\tval := k.MustInt64()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InUint always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InUint(defaultVal uint, candidates []uint) uint {\n\tval := k.MustUint()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InUint64 always returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InUint64(defaultVal uint64, candidates []uint64) uint64 {\n\tval := k.MustUint64()\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InTimeFormat always parses with given format and returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InTimeFormat(format string, defaultVal time.Time, candidates []time.Time) time.Time {\n\tval := k.MustTimeFormat(format)\n\tfor _, cand := range candidates {\n\t\tif val == cand {\n\t\t\treturn val\n\t\t}\n\t}\n\treturn defaultVal\n}\n\n// InTime always parses with RFC3339 format and returns value without error,\n// it returns default value if error occurs or doesn't fit into candidates.\nfunc (k *Key) InTime(defaultVal time.Time, candidates []time.Time) time.Time {\n\treturn k.InTimeFormat(time.RFC3339, defaultVal, candidates)\n}\n\n// RangeFloat64 checks if value is in given range inclusively,\n// and returns default value if it's not.\nfunc (k *Key) RangeFloat64(defaultVal, min, max float64) float64 {\n\tval := k.MustFloat64()\n\tif val < min || val > max {\n\t\treturn defaultVal\n\t}\n\treturn val\n}\n\n// RangeInt checks if value is in given range inclusively,\n// and returns default value if it's not.\nfunc (k *Key) RangeInt(defaultVal, min, max int) int {\n\tval := k.MustInt()\n\tif val < min || val > max {\n\t\treturn defaultVal\n\t}\n\treturn val\n}\n\n// RangeInt64 checks if value is in given range inclusively,\n// and returns default value if it's not.\nfunc (k *Key) RangeInt64(defaultVal, min, max int64) int64 {\n\tval := k.MustInt64()\n\tif val < min || val > max {\n\t\treturn defaultVal\n\t}\n\treturn val\n}\n\n// RangeTimeFormat checks if value with given format is in given range inclusively,\n// and returns default value if it's not.\nfunc (k *Key) RangeTimeFormat(format string, defaultVal, min, max time.Time) time.Time {\n\tval := k.MustTimeFormat(format)\n\tif val.Unix() < min.Unix() || val.Unix() > max.Unix() {\n\t\treturn defaultVal\n\t}\n\treturn val\n}\n\n// RangeTime checks if value with RFC3339 format is in given range inclusively,\n// and returns default value if it's not.\nfunc (k *Key) RangeTime(defaultVal, min, max time.Time) time.Time {\n\treturn k.RangeTimeFormat(time.RFC3339, defaultVal, min, max)\n}\n\n// Strings returns list of string divided by given delimiter.\nfunc (k *Key) Strings(delim string) []string {\n\tstr := k.String()\n\tif len(str) == 0 {\n\t\treturn []string{}\n\t}\n\n\trunes := []rune(str)\n\tvals := make([]string, 0, 2)\n\tvar buf bytes.Buffer\n\tescape := false\n\tidx := 0\n\tfor {\n\t\tif escape {\n\t\t\tescape = false\n\t\t\tif runes[idx] != '\\\\' && !strings.HasPrefix(string(runes[idx:]), delim) {\n\t\t\t\tbuf.WriteRune('\\\\')\n\t\t\t}\n\t\t\tbuf.WriteRune(runes[idx])\n\t\t} else {\n\t\t\tif runes[idx] == '\\\\' {\n\t\t\t\tescape = true\n\t\t\t} else if strings.HasPrefix(string(runes[idx:]), delim) {\n\t\t\t\tidx += len(delim) - 1\n\t\t\t\tvals = append(vals, strings.TrimSpace(buf.String()))\n\t\t\t\tbuf.Reset()\n\t\t\t} else {\n\t\t\t\tbuf.WriteRune(runes[idx])\n\t\t\t}\n\t\t}\n\t\tidx += 1\n\t\tif idx == len(runes) {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif buf.Len() > 0 {\n\t\tvals = append(vals, strings.TrimSpace(buf.String()))\n\t}\n\n\treturn vals\n}\n\n// StringsWithShadows returns list of string divided by given delimiter.\n// Shadows will also be appended if any.\nfunc (k *Key) StringsWithShadows(delim string) []string {\n\tvals := k.ValueWithShadows()\n\tresults := make([]string, 0, len(vals)*2)\n\tfor i := range vals {\n\t\tif len(vals) == 0 {\n\t\t\tcontinue\n\t\t}\n\n\t\tresults = append(results, strings.Split(vals[i], delim)...)\n\t}\n\n\tfor i := range results {\n\t\tresults[i] = k.transformValue(strings.TrimSpace(results[i]))\n\t}\n\treturn results\n}\n\n// Float64s returns list of float64 divided by given delimiter. Any invalid input will be treated as zero value.\nfunc (k *Key) Float64s(delim string) []float64 {\n\tvals, _ := k.parseFloat64s(k.Strings(delim), true, false)\n\treturn vals\n}\n\n// Ints returns list of int divided by given delimiter. Any invalid input will be treated as zero value.\nfunc (k *Key) Ints(delim string) []int {\n\tvals, _ := k.parseInts(k.Strings(delim), true, false)\n\treturn vals\n}\n\n// Int64s returns list of int64 divided by given delimiter. Any invalid input will be treated as zero value.\nfunc (k *Key) Int64s(delim string) []int64 {\n\tvals, _ := k.parseInt64s(k.Strings(delim), true, false)\n\treturn vals\n}\n\n// Uints returns list of uint divided by given delimiter. Any invalid input will be treated as zero value.\nfunc (k *Key) Uints(delim string) []uint {\n\tvals, _ := k.parseUints(k.Strings(delim), true, false)\n\treturn vals\n}\n\n// Uint64s returns list of uint64 divided by given delimiter. Any invalid input will be treated as zero value.\nfunc (k *Key) Uint64s(delim string) []uint64 {\n\tvals, _ := k.parseUint64s(k.Strings(delim), true, false)\n\treturn vals\n}\n\n// TimesFormat parses with given format and returns list of time.Time divided by given delimiter.\n// Any invalid input will be treated as zero value (0001-01-01 00:00:00 +0000 UTC).\nfunc (k *Key) TimesFormat(format, delim string) []time.Time {\n\tvals, _ := k.parseTimesFormat(format, k.Strings(delim), true, false)\n\treturn vals\n}\n\n// Times parses with RFC3339 format and returns list of time.Time divided by given delimiter.\n// Any invalid input will be treated as zero value (0001-01-01 00:00:00 +0000 UTC).\nfunc (k *Key) Times(delim string) []time.Time {\n\treturn k.TimesFormat(time.RFC3339, delim)\n}\n\n// ValidFloat64s returns list of float64 divided by given delimiter. If some value is not float, then\n// it will not be included to result list.\nfunc (k *Key) ValidFloat64s(delim string) []float64 {\n\tvals, _ := k.parseFloat64s(k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidInts returns list of int divided by given delimiter. If some value is not integer, then it will\n// not be included to result list.\nfunc (k *Key) ValidInts(delim string) []int {\n\tvals, _ := k.parseInts(k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidInt64s returns list of int64 divided by given delimiter. If some value is not 64-bit integer,\n// then it will not be included to result list.\nfunc (k *Key) ValidInt64s(delim string) []int64 {\n\tvals, _ := k.parseInt64s(k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidUints returns list of uint divided by given delimiter. If some value is not unsigned integer,\n// then it will not be included to result list.\nfunc (k *Key) ValidUints(delim string) []uint {\n\tvals, _ := k.parseUints(k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidUint64s returns list of uint64 divided by given delimiter. If some value is not 64-bit unsigned\n// integer, then it will not be included to result list.\nfunc (k *Key) ValidUint64s(delim string) []uint64 {\n\tvals, _ := k.parseUint64s(k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidTimesFormat parses with given format and returns list of time.Time divided by given delimiter.\nfunc (k *Key) ValidTimesFormat(format, delim string) []time.Time {\n\tvals, _ := k.parseTimesFormat(format, k.Strings(delim), false, false)\n\treturn vals\n}\n\n// ValidTimes parses with RFC3339 format and returns list of time.Time divided by given delimiter.\nfunc (k *Key) ValidTimes(delim string) []time.Time {\n\treturn k.ValidTimesFormat(time.RFC3339, delim)\n}\n\n// StrictFloat64s returns list of float64 divided by given delimiter or error on first invalid input.\nfunc (k *Key) StrictFloat64s(delim string) ([]float64, error) {\n\treturn k.parseFloat64s(k.Strings(delim), false, true)\n}\n\n// StrictInts returns list of int divided by given delimiter or error on first invalid input.\nfunc (k *Key) StrictInts(delim string) ([]int, error) {\n\treturn k.parseInts(k.Strings(delim), false, true)\n}\n\n// StrictInt64s returns list of int64 divided by given delimiter or error on first invalid input.\nfunc (k *Key) StrictInt64s(delim string) ([]int64, error) {\n\treturn k.parseInt64s(k.Strings(delim), false, true)\n}\n\n// StrictUints returns list of uint divided by given delimiter or error on first invalid input.\nfunc (k *Key) StrictUints(delim string) ([]uint, error) {\n\treturn k.parseUints(k.Strings(delim), false, true)\n}\n\n// StrictUint64s returns list of uint64 divided by given delimiter or error on first invalid input.\nfunc (k *Key) StrictUint64s(delim string) ([]uint64, error) {\n\treturn k.parseUint64s(k.Strings(delim), false, true)\n}\n\n// StrictTimesFormat parses with given format and returns list of time.Time divided by given delimiter\n// or error on first invalid input.\nfunc (k *Key) StrictTimesFormat(format, delim string) ([]time.Time, error) {\n\treturn k.parseTimesFormat(format, k.Strings(delim), false, true)\n}\n\n// StrictTimes parses with RFC3339 format and returns list of time.Time divided by given delimiter\n// or error on first invalid input.\nfunc (k *Key) StrictTimes(delim string) ([]time.Time, error) {\n\treturn k.StrictTimesFormat(time.RFC3339, delim)\n}\n\n// parseFloat64s transforms strings to float64s.\nfunc (k *Key) parseFloat64s(strs []string, addInvalid, returnOnInvalid bool) ([]float64, error) {\n\tvals := make([]float64, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := strconv.ParseFloat(str, 64)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, val)\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// parseInts transforms strings to ints.\nfunc (k *Key) parseInts(strs []string, addInvalid, returnOnInvalid bool) ([]int, error) {\n\tvals := make([]int, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := strconv.Atoi(str)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, val)\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// parseInt64s transforms strings to int64s.\nfunc (k *Key) parseInt64s(strs []string, addInvalid, returnOnInvalid bool) ([]int64, error) {\n\tvals := make([]int64, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := strconv.ParseInt(str, 10, 64)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, val)\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// parseUints transforms strings to uints.\nfunc (k *Key) parseUints(strs []string, addInvalid, returnOnInvalid bool) ([]uint, error) {\n\tvals := make([]uint, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := strconv.ParseUint(str, 10, 0)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, uint(val))\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// parseUint64s transforms strings to uint64s.\nfunc (k *Key) parseUint64s(strs []string, addInvalid, returnOnInvalid bool) ([]uint64, error) {\n\tvals := make([]uint64, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := strconv.ParseUint(str, 10, 64)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, val)\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// parseTimesFormat transforms strings to times in given format.\nfunc (k *Key) parseTimesFormat(format string, strs []string, addInvalid, returnOnInvalid bool) ([]time.Time, error) {\n\tvals := make([]time.Time, 0, len(strs))\n\tfor _, str := range strs {\n\t\tval, err := time.Parse(format, str)\n\t\tif err != nil && returnOnInvalid {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err == nil || addInvalid {\n\t\t\tvals = append(vals, val)\n\t\t}\n\t}\n\treturn vals, nil\n}\n\n// SetValue changes key value.\nfunc (k *Key) SetValue(v string) {\n\tif k.s.f.BlockMode {\n\t\tk.s.f.lock.Lock()\n\t\tdefer k.s.f.lock.Unlock()\n\t}\n\n\tk.value = v\n\tk.s.keysHash[k.name] = v\n}\n" }, { "path": "vendor/github.com/go-ini/ini/parser.go", "content": "// Copyright 2015 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode\"\n)\n\ntype tokenType int\n\nconst (\n\t_TOKEN_INVALID tokenType = iota\n\t_TOKEN_COMMENT\n\t_TOKEN_SECTION\n\t_TOKEN_KEY\n)\n\ntype parser struct {\n\tbuf *bufio.Reader\n\tisEOF bool\n\tcount int\n\tcomment *bytes.Buffer\n}\n\nfunc newParser(r io.Reader) *parser {\n\treturn &parser{\n\t\tbuf: bufio.NewReader(r),\n\t\tcount: 1,\n\t\tcomment: &bytes.Buffer{},\n\t}\n}\n\n// BOM handles header of UTF-8, UTF-16 LE and UTF-16 BE's BOM format.\n// http://en.wikipedia.org/wiki/Byte_order_mark#Representations_of_byte_order_marks_by_encoding\nfunc (p *parser) BOM() error {\n\tmask, err := p.buf.Peek(2)\n\tif err != nil && err != io.EOF {\n\t\treturn err\n\t} else if len(mask) < 2 {\n\t\treturn nil\n\t}\n\n\tswitch {\n\tcase mask[0] == 254 && mask[1] == 255:\n\t\tfallthrough\n\tcase mask[0] == 255 && mask[1] == 254:\n\t\tp.buf.Read(mask)\n\tcase mask[0] == 239 && mask[1] == 187:\n\t\tmask, err := p.buf.Peek(3)\n\t\tif err != nil && err != io.EOF {\n\t\t\treturn err\n\t\t} else if len(mask) < 3 {\n\t\t\treturn nil\n\t\t}\n\t\tif mask[2] == 191 {\n\t\t\tp.buf.Read(mask)\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (p *parser) readUntil(delim byte) ([]byte, error) {\n\tdata, err := p.buf.ReadBytes(delim)\n\tif err != nil {\n\t\tif err == io.EOF {\n\t\t\tp.isEOF = true\n\t\t} else {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn data, nil\n}\n\nfunc cleanComment(in []byte) ([]byte, bool) {\n\ti := bytes.IndexAny(in, \"#;\")\n\tif i == -1 {\n\t\treturn nil, false\n\t}\n\treturn in[i:], true\n}\n\nfunc readKeyName(in []byte) (string, int, error) {\n\tline := string(in)\n\n\t// Check if key name surrounded by quotes.\n\tvar keyQuote string\n\tif line[0] == '\"' {\n\t\tif len(line) > 6 && string(line[0:3]) == `\"\"\"` {\n\t\t\tkeyQuote = `\"\"\"`\n\t\t} else {\n\t\t\tkeyQuote = `\"`\n\t\t}\n\t} else if line[0] == '`' {\n\t\tkeyQuote = \"`\"\n\t}\n\n\t// Get out key name\n\tendIdx := -1\n\tif len(keyQuote) > 0 {\n\t\tstartIdx := len(keyQuote)\n\t\t// FIXME: fail case -> \"\"\"\"\"\"name\"\"\"=value\n\t\tpos := strings.Index(line[startIdx:], keyQuote)\n\t\tif pos == -1 {\n\t\t\treturn \"\", -1, fmt.Errorf(\"missing closing key quote: %s\", line)\n\t\t}\n\t\tpos += startIdx\n\n\t\t// Find key-value delimiter\n\t\ti := strings.IndexAny(line[pos+startIdx:], \"=:\")\n\t\tif i < 0 {\n\t\t\treturn \"\", -1, ErrDelimiterNotFound{line}\n\t\t}\n\t\tendIdx = pos + i\n\t\treturn strings.TrimSpace(line[startIdx:pos]), endIdx + startIdx + 1, nil\n\t}\n\n\tendIdx = strings.IndexAny(line, \"=:\")\n\tif endIdx < 0 {\n\t\treturn \"\", -1, ErrDelimiterNotFound{line}\n\t}\n\treturn strings.TrimSpace(line[0:endIdx]), endIdx + 1, nil\n}\n\nfunc (p *parser) readMultilines(line, val, valQuote string) (string, error) {\n\tfor {\n\t\tdata, err := p.readUntil('\\n')\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tnext := string(data)\n\n\t\tpos := strings.LastIndex(next, valQuote)\n\t\tif pos > -1 {\n\t\t\tval += next[:pos]\n\n\t\t\tcomment, has := cleanComment([]byte(next[pos:]))\n\t\t\tif has {\n\t\t\t\tp.comment.Write(bytes.TrimSpace(comment))\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t\tval += next\n\t\tif p.isEOF {\n\t\t\treturn \"\", fmt.Errorf(\"missing closing key quote from '%s' to '%s'\", line, next)\n\t\t}\n\t}\n\treturn val, nil\n}\n\nfunc (p *parser) readContinuationLines(val string) (string, error) {\n\tfor {\n\t\tdata, err := p.readUntil('\\n')\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tnext := strings.TrimSpace(string(data))\n\n\t\tif len(next) == 0 {\n\t\t\tbreak\n\t\t}\n\t\tval += next\n\t\tif val[len(val)-1] != '\\\\' {\n\t\t\tbreak\n\t\t}\n\t\tval = val[:len(val)-1]\n\t}\n\treturn val, nil\n}\n\n// hasSurroundedQuote check if and only if the first and last characters\n// are quotes \\\" or \\'.\n// It returns false if any other parts also contain same kind of quotes.\nfunc hasSurroundedQuote(in string, quote byte) bool {\n\treturn len(in) >= 2 && in[0] == quote && in[len(in)-1] == quote &&\n\t\tstrings.IndexByte(in[1:], quote) == len(in)-2\n}\n\nfunc (p *parser) readValue(in []byte,\n\tignoreContinuation, ignoreInlineComment, unescapeValueDoubleQuotes, unescapeValueCommentSymbols bool) (string, error) {\n\n\tline := strings.TrimLeftFunc(string(in), unicode.IsSpace)\n\tif len(line) == 0 {\n\t\treturn \"\", nil\n\t}\n\n\tvar valQuote string\n\tif len(line) > 3 && string(line[0:3]) == `\"\"\"` {\n\t\tvalQuote = `\"\"\"`\n\t} else if line[0] == '`' {\n\t\tvalQuote = \"`\"\n\t} else if unescapeValueDoubleQuotes && line[0] == '\"' {\n\t\tvalQuote = `\"`\n\t}\n\n\tif len(valQuote) > 0 {\n\t\tstartIdx := len(valQuote)\n\t\tpos := strings.LastIndex(line[startIdx:], valQuote)\n\t\t// Check for multi-line value\n\t\tif pos == -1 {\n\t\t\treturn p.readMultilines(line, line[startIdx:], valQuote)\n\t\t}\n\n\t\tif unescapeValueDoubleQuotes && valQuote == `\"` {\n\t\t\treturn strings.Replace(line[startIdx:pos+startIdx], `\\\"`, `\"`, -1), nil\n\t\t}\n\t\treturn line[startIdx : pos+startIdx], nil\n\t}\n\n\t// Won't be able to reach here if value only contains whitespace\n\tline = strings.TrimSpace(line)\n\n\t// Check continuation lines when desired\n\tif !ignoreContinuation && line[len(line)-1] == '\\\\' {\n\t\treturn p.readContinuationLines(line[:len(line)-1])\n\t}\n\n\t// Check if ignore inline comment\n\tif !ignoreInlineComment {\n\t\ti := strings.IndexAny(line, \"#;\")\n\t\tif i > -1 {\n\t\t\tp.comment.WriteString(line[i:])\n\t\t\tline = strings.TrimSpace(line[:i])\n\t\t}\n\t}\n\n\t// Trim single and double quotes\n\tif hasSurroundedQuote(line, '\\'') ||\n\t\thasSurroundedQuote(line, '\"') {\n\t\tline = line[1 : len(line)-1]\n\t} else if len(valQuote) == 0 && unescapeValueCommentSymbols {\n\t\tif strings.Contains(line, `\\;`) {\n\t\t\tline = strings.Replace(line, `\\;`, \";\", -1)\n\t\t}\n\t\tif strings.Contains(line, `\\#`) {\n\t\t\tline = strings.Replace(line, `\\#`, \"#\", -1)\n\t\t}\n\t}\n\treturn line, nil\n}\n\n// parse parses data through an io.Reader.\nfunc (f *File) parse(reader io.Reader) (err error) {\n\tp := newParser(reader)\n\tif err = p.BOM(); err != nil {\n\t\treturn fmt.Errorf(\"BOM: %v\", err)\n\t}\n\n\t// Ignore error because default section name is never empty string.\n\tname := DEFAULT_SECTION\n\tif f.options.Insensitive {\n\t\tname = strings.ToLower(DEFAULT_SECTION)\n\t}\n\tsection, _ := f.NewSection(name)\n\n\t// This \"last\" is not strictly equivalent to \"previous one\" if current key is not the first nested key\n\tvar isLastValueEmpty bool\n\tvar lastRegularKey *Key\n\n\tvar line []byte\n\tvar inUnparseableSection bool\n\tfor !p.isEOF {\n\t\tline, err = p.readUntil('\\n')\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif f.options.AllowNestedValues &&\n\t\t\tisLastValueEmpty && len(line) > 0 {\n\t\t\tif line[0] == ' ' || line[0] == '\\t' {\n\t\t\t\tlastRegularKey.addNestedValue(string(bytes.TrimSpace(line)))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tline = bytes.TrimLeftFunc(line, unicode.IsSpace)\n\t\tif len(line) == 0 {\n\t\t\tcontinue\n\t\t}\n\n\t\t// Comments\n\t\tif line[0] == '#' || line[0] == ';' {\n\t\t\t// Note: we do not care ending line break,\n\t\t\t// it is needed for adding second line,\n\t\t\t// so just clean it once at the end when set to value.\n\t\t\tp.comment.Write(line)\n\t\t\tcontinue\n\t\t}\n\n\t\t// Section\n\t\tif line[0] == '[' {\n\t\t\t// Read to the next ']' (TODO: support quoted strings)\n\t\t\t// TODO(unknwon): use LastIndexByte when stop supporting Go1.4\n\t\t\tcloseIdx := bytes.LastIndex(line, []byte(\"]\"))\n\t\t\tif closeIdx == -1 {\n\t\t\t\treturn fmt.Errorf(\"unclosed section: %s\", line)\n\t\t\t}\n\n\t\t\tname := string(line[1:closeIdx])\n\t\t\tsection, err = f.NewSection(name)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\tcomment, has := cleanComment(line[closeIdx+1:])\n\t\t\tif has {\n\t\t\t\tp.comment.Write(comment)\n\t\t\t}\n\n\t\t\tsection.Comment = strings.TrimSpace(p.comment.String())\n\n\t\t\t// Reset aotu-counter and comments\n\t\t\tp.comment.Reset()\n\t\t\tp.count = 1\n\n\t\t\tinUnparseableSection = false\n\t\t\tfor i := range f.options.UnparseableSections {\n\t\t\t\tif f.options.UnparseableSections[i] == name ||\n\t\t\t\t\t(f.options.Insensitive && strings.ToLower(f.options.UnparseableSections[i]) == strings.ToLower(name)) {\n\t\t\t\t\tinUnparseableSection = true\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tif inUnparseableSection {\n\t\t\tsection.isRawSection = true\n\t\t\tsection.rawBody += string(line)\n\t\t\tcontinue\n\t\t}\n\n\t\tkname, offset, err := readKeyName(line)\n\t\tif err != nil {\n\t\t\t// Treat as boolean key when desired, and whole line is key name.\n\t\t\tif IsErrDelimiterNotFound(err) && f.options.AllowBooleanKeys {\n\t\t\t\tkname, err := p.readValue(line,\n\t\t\t\t\tf.options.IgnoreContinuation,\n\t\t\t\t\tf.options.IgnoreInlineComment,\n\t\t\t\t\tf.options.UnescapeValueDoubleQuotes,\n\t\t\t\t\tf.options.UnescapeValueCommentSymbols)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tkey, err := section.NewBooleanKey(kname)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tkey.Comment = strings.TrimSpace(p.comment.String())\n\t\t\t\tp.comment.Reset()\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn err\n\t\t}\n\n\t\t// Auto increment.\n\t\tisAutoIncr := false\n\t\tif kname == \"-\" {\n\t\t\tisAutoIncr = true\n\t\t\tkname = \"#\" + strconv.Itoa(p.count)\n\t\t\tp.count++\n\t\t}\n\n\t\tvalue, err := p.readValue(line[offset:],\n\t\t\tf.options.IgnoreContinuation,\n\t\t\tf.options.IgnoreInlineComment,\n\t\t\tf.options.UnescapeValueDoubleQuotes,\n\t\t\tf.options.UnescapeValueCommentSymbols)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tisLastValueEmpty = len(value) == 0\n\n\t\tkey, err := section.NewKey(kname, value)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tkey.isAutoIncrement = isAutoIncr\n\t\tkey.Comment = strings.TrimSpace(p.comment.String())\n\t\tp.comment.Reset()\n\t\tlastRegularKey = key\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-ini/ini/section.go", "content": "// Copyright 2014 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"strings\"\n)\n\n// Section represents a config section.\ntype Section struct {\n\tf *File\n\tComment string\n\tname string\n\tkeys map[string]*Key\n\tkeyList []string\n\tkeysHash map[string]string\n\n\tisRawSection bool\n\trawBody string\n}\n\nfunc newSection(f *File, name string) *Section {\n\treturn &Section{\n\t\tf: f,\n\t\tname: name,\n\t\tkeys: make(map[string]*Key),\n\t\tkeyList: make([]string, 0, 10),\n\t\tkeysHash: make(map[string]string),\n\t}\n}\n\n// Name returns name of Section.\nfunc (s *Section) Name() string {\n\treturn s.name\n}\n\n// Body returns rawBody of Section if the section was marked as unparseable.\n// It still follows the other rules of the INI format surrounding leading/trailing whitespace.\nfunc (s *Section) Body() string {\n\treturn strings.TrimSpace(s.rawBody)\n}\n\n// SetBody updates body content only if section is raw.\nfunc (s *Section) SetBody(body string) {\n\tif !s.isRawSection {\n\t\treturn\n\t}\n\ts.rawBody = body\n}\n\n// NewKey creates a new key to given section.\nfunc (s *Section) NewKey(name, val string) (*Key, error) {\n\tif len(name) == 0 {\n\t\treturn nil, errors.New(\"error creating new key: empty key name\")\n\t} else if s.f.options.Insensitive {\n\t\tname = strings.ToLower(name)\n\t}\n\n\tif s.f.BlockMode {\n\t\ts.f.lock.Lock()\n\t\tdefer s.f.lock.Unlock()\n\t}\n\n\tif inSlice(name, s.keyList) {\n\t\tif s.f.options.AllowShadows {\n\t\t\tif err := s.keys[name].addShadow(val); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t} else {\n\t\t\ts.keys[name].value = val\n\t\t}\n\t\treturn s.keys[name], nil\n\t}\n\n\ts.keyList = append(s.keyList, name)\n\ts.keys[name] = newKey(s, name, val)\n\ts.keysHash[name] = val\n\treturn s.keys[name], nil\n}\n\n// NewBooleanKey creates a new boolean type key to given section.\nfunc (s *Section) NewBooleanKey(name string) (*Key, error) {\n\tkey, err := s.NewKey(name, \"true\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tkey.isBooleanType = true\n\treturn key, nil\n}\n\n// GetKey returns key in section by given name.\nfunc (s *Section) GetKey(name string) (*Key, error) {\n\t// FIXME: change to section level lock?\n\tif s.f.BlockMode {\n\t\ts.f.lock.RLock()\n\t}\n\tif s.f.options.Insensitive {\n\t\tname = strings.ToLower(name)\n\t}\n\tkey := s.keys[name]\n\tif s.f.BlockMode {\n\t\ts.f.lock.RUnlock()\n\t}\n\n\tif key == nil {\n\t\t// Check if it is a child-section.\n\t\tsname := s.name\n\t\tfor {\n\t\t\tif i := strings.LastIndex(sname, \".\"); i > -1 {\n\t\t\t\tsname = sname[:i]\n\t\t\t\tsec, err := s.f.GetSection(sname)\n\t\t\t\tif err != nil {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\treturn sec.GetKey(name)\n\t\t\t} else {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\treturn nil, fmt.Errorf(\"error when getting key of section '%s': key '%s' not exists\", s.name, name)\n\t}\n\treturn key, nil\n}\n\n// HasKey returns true if section contains a key with given name.\nfunc (s *Section) HasKey(name string) bool {\n\tkey, _ := s.GetKey(name)\n\treturn key != nil\n}\n\n// Haskey is a backwards-compatible name for HasKey.\n// TODO: delete me in v2\nfunc (s *Section) Haskey(name string) bool {\n\treturn s.HasKey(name)\n}\n\n// HasValue returns true if section contains given raw value.\nfunc (s *Section) HasValue(value string) bool {\n\tif s.f.BlockMode {\n\t\ts.f.lock.RLock()\n\t\tdefer s.f.lock.RUnlock()\n\t}\n\n\tfor _, k := range s.keys {\n\t\tif value == k.value {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// Key assumes named Key exists in section and returns a zero-value when not.\nfunc (s *Section) Key(name string) *Key {\n\tkey, err := s.GetKey(name)\n\tif err != nil {\n\t\t// It's OK here because the only possible error is empty key name,\n\t\t// but if it's empty, this piece of code won't be executed.\n\t\tkey, _ = s.NewKey(name, \"\")\n\t\treturn key\n\t}\n\treturn key\n}\n\n// Keys returns list of keys of section.\nfunc (s *Section) Keys() []*Key {\n\tkeys := make([]*Key, len(s.keyList))\n\tfor i := range s.keyList {\n\t\tkeys[i] = s.Key(s.keyList[i])\n\t}\n\treturn keys\n}\n\n// ParentKeys returns list of keys of parent section.\nfunc (s *Section) ParentKeys() []*Key {\n\tvar parentKeys []*Key\n\tsname := s.name\n\tfor {\n\t\tif i := strings.LastIndex(sname, \".\"); i > -1 {\n\t\t\tsname = sname[:i]\n\t\t\tsec, err := s.f.GetSection(sname)\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tparentKeys = append(parentKeys, sec.Keys()...)\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\n\t}\n\treturn parentKeys\n}\n\n// KeyStrings returns list of key names of section.\nfunc (s *Section) KeyStrings() []string {\n\tlist := make([]string, len(s.keyList))\n\tcopy(list, s.keyList)\n\treturn list\n}\n\n// KeysHash returns keys hash consisting of names and values.\nfunc (s *Section) KeysHash() map[string]string {\n\tif s.f.BlockMode {\n\t\ts.f.lock.RLock()\n\t\tdefer s.f.lock.RUnlock()\n\t}\n\n\thash := map[string]string{}\n\tfor key, value := range s.keysHash {\n\t\thash[key] = value\n\t}\n\treturn hash\n}\n\n// DeleteKey deletes a key from section.\nfunc (s *Section) DeleteKey(name string) {\n\tif s.f.BlockMode {\n\t\ts.f.lock.Lock()\n\t\tdefer s.f.lock.Unlock()\n\t}\n\n\tfor i, k := range s.keyList {\n\t\tif k == name {\n\t\t\ts.keyList = append(s.keyList[:i], s.keyList[i+1:]...)\n\t\t\tdelete(s.keys, name)\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// ChildSections returns a list of child sections of current section.\n// For example, \"[parent.child1]\" and \"[parent.child12]\" are child sections\n// of section \"[parent]\".\nfunc (s *Section) ChildSections() []*Section {\n\tprefix := s.name + \".\"\n\tchildren := make([]*Section, 0, 3)\n\tfor _, name := range s.f.sectionList {\n\t\tif strings.HasPrefix(name, prefix) {\n\t\t\tchildren = append(children, s.f.sections[name])\n\t\t}\n\t}\n\treturn children\n}\n" }, { "path": "vendor/github.com/go-ini/ini/struct.go", "content": "// Copyright 2014 Unknwon\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage ini\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode\"\n)\n\n// NameMapper represents a ini tag name mapper.\ntype NameMapper func(string) string\n\n// Built-in name getters.\nvar (\n\t// AllCapsUnderscore converts to format ALL_CAPS_UNDERSCORE.\n\tAllCapsUnderscore NameMapper = func(raw string) string {\n\t\tnewstr := make([]rune, 0, len(raw))\n\t\tfor i, chr := range raw {\n\t\t\tif isUpper := 'A' <= chr && chr <= 'Z'; isUpper {\n\t\t\t\tif i > 0 {\n\t\t\t\t\tnewstr = append(newstr, '_')\n\t\t\t\t}\n\t\t\t}\n\t\t\tnewstr = append(newstr, unicode.ToUpper(chr))\n\t\t}\n\t\treturn string(newstr)\n\t}\n\t// TitleUnderscore converts to format title_underscore.\n\tTitleUnderscore NameMapper = func(raw string) string {\n\t\tnewstr := make([]rune, 0, len(raw))\n\t\tfor i, chr := range raw {\n\t\t\tif isUpper := 'A' <= chr && chr <= 'Z'; isUpper {\n\t\t\t\tif i > 0 {\n\t\t\t\t\tnewstr = append(newstr, '_')\n\t\t\t\t}\n\t\t\t\tchr -= ('A' - 'a')\n\t\t\t}\n\t\t\tnewstr = append(newstr, chr)\n\t\t}\n\t\treturn string(newstr)\n\t}\n)\n\nfunc (s *Section) parseFieldName(raw, actual string) string {\n\tif len(actual) > 0 {\n\t\treturn actual\n\t}\n\tif s.f.NameMapper != nil {\n\t\treturn s.f.NameMapper(raw)\n\t}\n\treturn raw\n}\n\nfunc parseDelim(actual string) string {\n\tif len(actual) > 0 {\n\t\treturn actual\n\t}\n\treturn \",\"\n}\n\nvar reflectTime = reflect.TypeOf(time.Now()).Kind()\n\n// setSliceWithProperType sets proper values to slice based on its type.\nfunc setSliceWithProperType(key *Key, field reflect.Value, delim string, allowShadow, isStrict bool) error {\n\tvar strs []string\n\tif allowShadow {\n\t\tstrs = key.StringsWithShadows(delim)\n\t} else {\n\t\tstrs = key.Strings(delim)\n\t}\n\n\tnumVals := len(strs)\n\tif numVals == 0 {\n\t\treturn nil\n\t}\n\n\tvar vals interface{}\n\tvar err error\n\n\tsliceOf := field.Type().Elem().Kind()\n\tswitch sliceOf {\n\tcase reflect.String:\n\t\tvals = strs\n\tcase reflect.Int:\n\t\tvals, err = key.parseInts(strs, true, false)\n\tcase reflect.Int64:\n\t\tvals, err = key.parseInt64s(strs, true, false)\n\tcase reflect.Uint:\n\t\tvals, err = key.parseUints(strs, true, false)\n\tcase reflect.Uint64:\n\t\tvals, err = key.parseUint64s(strs, true, false)\n\tcase reflect.Float64:\n\t\tvals, err = key.parseFloat64s(strs, true, false)\n\tcase reflectTime:\n\t\tvals, err = key.parseTimesFormat(time.RFC3339, strs, true, false)\n\tdefault:\n\t\treturn fmt.Errorf(\"unsupported type '[]%s'\", sliceOf)\n\t}\n\tif err != nil && isStrict {\n\t\treturn err\n\t}\n\n\tslice := reflect.MakeSlice(field.Type(), numVals, numVals)\n\tfor i := 0; i < numVals; i++ {\n\t\tswitch sliceOf {\n\t\tcase reflect.String:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]string)[i]))\n\t\tcase reflect.Int:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]int)[i]))\n\t\tcase reflect.Int64:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]int64)[i]))\n\t\tcase reflect.Uint:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]uint)[i]))\n\t\tcase reflect.Uint64:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]uint64)[i]))\n\t\tcase reflect.Float64:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]float64)[i]))\n\t\tcase reflectTime:\n\t\t\tslice.Index(i).Set(reflect.ValueOf(vals.([]time.Time)[i]))\n\t\t}\n\t}\n\tfield.Set(slice)\n\treturn nil\n}\n\nfunc wrapStrictError(err error, isStrict bool) error {\n\tif isStrict {\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// setWithProperType sets proper value to field based on its type,\n// but it does not return error for failing parsing,\n// because we want to use default value that is already assigned to strcut.\nfunc setWithProperType(t reflect.Type, key *Key, field reflect.Value, delim string, allowShadow, isStrict bool) error {\n\tswitch t.Kind() {\n\tcase reflect.String:\n\t\tif len(key.String()) == 0 {\n\t\t\treturn nil\n\t\t}\n\t\tfield.SetString(key.String())\n\tcase reflect.Bool:\n\t\tboolVal, err := key.Bool()\n\t\tif err != nil {\n\t\t\treturn wrapStrictError(err, isStrict)\n\t\t}\n\t\tfield.SetBool(boolVal)\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tdurationVal, err := key.Duration()\n\t\t// Skip zero value\n\t\tif err == nil && int64(durationVal) > 0 {\n\t\t\tfield.Set(reflect.ValueOf(durationVal))\n\t\t\treturn nil\n\t\t}\n\n\t\tintVal, err := key.Int64()\n\t\tif err != nil {\n\t\t\treturn wrapStrictError(err, isStrict)\n\t\t}\n\t\tfield.SetInt(intVal)\n\t//\tbyte is an alias for uint8, so supporting uint8 breaks support for byte\n\tcase reflect.Uint, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\tdurationVal, err := key.Duration()\n\t\t// Skip zero value\n\t\tif err == nil && int(durationVal) > 0 {\n\t\t\tfield.Set(reflect.ValueOf(durationVal))\n\t\t\treturn nil\n\t\t}\n\n\t\tuintVal, err := key.Uint64()\n\t\tif err != nil {\n\t\t\treturn wrapStrictError(err, isStrict)\n\t\t}\n\t\tfield.SetUint(uintVal)\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tfloatVal, err := key.Float64()\n\t\tif err != nil {\n\t\t\treturn wrapStrictError(err, isStrict)\n\t\t}\n\t\tfield.SetFloat(floatVal)\n\tcase reflectTime:\n\t\ttimeVal, err := key.Time()\n\t\tif err != nil {\n\t\t\treturn wrapStrictError(err, isStrict)\n\t\t}\n\t\tfield.Set(reflect.ValueOf(timeVal))\n\tcase reflect.Slice:\n\t\treturn setSliceWithProperType(key, field, delim, allowShadow, isStrict)\n\tdefault:\n\t\treturn fmt.Errorf(\"unsupported type '%s'\", t)\n\t}\n\treturn nil\n}\n\nfunc parseTagOptions(tag string) (rawName string, omitEmpty bool, allowShadow bool) {\n\topts := strings.SplitN(tag, \",\", 3)\n\trawName = opts[0]\n\tif len(opts) > 1 {\n\t\tomitEmpty = opts[1] == \"omitempty\"\n\t}\n\tif len(opts) > 2 {\n\t\tallowShadow = opts[2] == \"allowshadow\"\n\t}\n\treturn rawName, omitEmpty, allowShadow\n}\n\nfunc (s *Section) mapTo(val reflect.Value, isStrict bool) error {\n\tif val.Kind() == reflect.Ptr {\n\t\tval = val.Elem()\n\t}\n\ttyp := val.Type()\n\n\tfor i := 0; i < typ.NumField(); i++ {\n\t\tfield := val.Field(i)\n\t\ttpField := typ.Field(i)\n\n\t\ttag := tpField.Tag.Get(\"ini\")\n\t\tif tag == \"-\" {\n\t\t\tcontinue\n\t\t}\n\n\t\trawName, _, allowShadow := parseTagOptions(tag)\n\t\tfieldName := s.parseFieldName(tpField.Name, rawName)\n\t\tif len(fieldName) == 0 || !field.CanSet() {\n\t\t\tcontinue\n\t\t}\n\n\t\tisAnonymous := tpField.Type.Kind() == reflect.Ptr && tpField.Anonymous\n\t\tisStruct := tpField.Type.Kind() == reflect.Struct\n\t\tif isAnonymous {\n\t\t\tfield.Set(reflect.New(tpField.Type.Elem()))\n\t\t}\n\n\t\tif isAnonymous || isStruct {\n\t\t\tif sec, err := s.f.GetSection(fieldName); err == nil {\n\t\t\t\tif err = sec.mapTo(field, isStrict); err != nil {\n\t\t\t\t\treturn fmt.Errorf(\"error mapping field(%s): %v\", fieldName, err)\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tif key, err := s.GetKey(fieldName); err == nil {\n\t\t\tdelim := parseDelim(tpField.Tag.Get(\"delim\"))\n\t\t\tif err = setWithProperType(tpField.Type, key, field, delim, allowShadow, isStrict); err != nil {\n\t\t\t\treturn fmt.Errorf(\"error mapping field(%s): %v\", fieldName, err)\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// MapTo maps section to given struct.\nfunc (s *Section) MapTo(v interface{}) error {\n\ttyp := reflect.TypeOf(v)\n\tval := reflect.ValueOf(v)\n\tif typ.Kind() == reflect.Ptr {\n\t\ttyp = typ.Elem()\n\t\tval = val.Elem()\n\t} else {\n\t\treturn errors.New(\"cannot map to non-pointer struct\")\n\t}\n\n\treturn s.mapTo(val, false)\n}\n\n// MapTo maps section to given struct in strict mode,\n// which returns all possible error including value parsing error.\nfunc (s *Section) StrictMapTo(v interface{}) error {\n\ttyp := reflect.TypeOf(v)\n\tval := reflect.ValueOf(v)\n\tif typ.Kind() == reflect.Ptr {\n\t\ttyp = typ.Elem()\n\t\tval = val.Elem()\n\t} else {\n\t\treturn errors.New(\"cannot map to non-pointer struct\")\n\t}\n\n\treturn s.mapTo(val, true)\n}\n\n// MapTo maps file to given struct.\nfunc (f *File) MapTo(v interface{}) error {\n\treturn f.Section(\"\").MapTo(v)\n}\n\n// MapTo maps file to given struct in strict mode,\n// which returns all possible error including value parsing error.\nfunc (f *File) StrictMapTo(v interface{}) error {\n\treturn f.Section(\"\").StrictMapTo(v)\n}\n\n// MapTo maps data sources to given struct with name mapper.\nfunc MapToWithMapper(v interface{}, mapper NameMapper, source interface{}, others ...interface{}) error {\n\tcfg, err := Load(source, others...)\n\tif err != nil {\n\t\treturn err\n\t}\n\tcfg.NameMapper = mapper\n\treturn cfg.MapTo(v)\n}\n\n// StrictMapToWithMapper maps data sources to given struct with name mapper in strict mode,\n// which returns all possible error including value parsing error.\nfunc StrictMapToWithMapper(v interface{}, mapper NameMapper, source interface{}, others ...interface{}) error {\n\tcfg, err := Load(source, others...)\n\tif err != nil {\n\t\treturn err\n\t}\n\tcfg.NameMapper = mapper\n\treturn cfg.StrictMapTo(v)\n}\n\n// MapTo maps data sources to given struct.\nfunc MapTo(v, source interface{}, others ...interface{}) error {\n\treturn MapToWithMapper(v, nil, source, others...)\n}\n\n// StrictMapTo maps data sources to given struct in strict mode,\n// which returns all possible error including value parsing error.\nfunc StrictMapTo(v, source interface{}, others ...interface{}) error {\n\treturn StrictMapToWithMapper(v, nil, source, others...)\n}\n\n// reflectSliceWithProperType does the opposite thing as setSliceWithProperType.\nfunc reflectSliceWithProperType(key *Key, field reflect.Value, delim string) error {\n\tslice := field.Slice(0, field.Len())\n\tif field.Len() == 0 {\n\t\treturn nil\n\t}\n\n\tvar buf bytes.Buffer\n\tsliceOf := field.Type().Elem().Kind()\n\tfor i := 0; i < field.Len(); i++ {\n\t\tswitch sliceOf {\n\t\tcase reflect.String:\n\t\t\tbuf.WriteString(slice.Index(i).String())\n\t\tcase reflect.Int, reflect.Int64:\n\t\t\tbuf.WriteString(fmt.Sprint(slice.Index(i).Int()))\n\t\tcase reflect.Uint, reflect.Uint64:\n\t\t\tbuf.WriteString(fmt.Sprint(slice.Index(i).Uint()))\n\t\tcase reflect.Float64:\n\t\t\tbuf.WriteString(fmt.Sprint(slice.Index(i).Float()))\n\t\tcase reflectTime:\n\t\t\tbuf.WriteString(slice.Index(i).Interface().(time.Time).Format(time.RFC3339))\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"unsupported type '[]%s'\", sliceOf)\n\t\t}\n\t\tbuf.WriteString(delim)\n\t}\n\tkey.SetValue(buf.String()[:buf.Len()-1])\n\treturn nil\n}\n\n// reflectWithProperType does the opposite thing as setWithProperType.\nfunc reflectWithProperType(t reflect.Type, key *Key, field reflect.Value, delim string) error {\n\tswitch t.Kind() {\n\tcase reflect.String:\n\t\tkey.SetValue(field.String())\n\tcase reflect.Bool:\n\t\tkey.SetValue(fmt.Sprint(field.Bool()))\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tkey.SetValue(fmt.Sprint(field.Int()))\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\tkey.SetValue(fmt.Sprint(field.Uint()))\n\tcase reflect.Float32, reflect.Float64:\n\t\tkey.SetValue(fmt.Sprint(field.Float()))\n\tcase reflectTime:\n\t\tkey.SetValue(fmt.Sprint(field.Interface().(time.Time).Format(time.RFC3339)))\n\tcase reflect.Slice:\n\t\treturn reflectSliceWithProperType(key, field, delim)\n\tdefault:\n\t\treturn fmt.Errorf(\"unsupported type '%s'\", t)\n\t}\n\treturn nil\n}\n\n// CR: copied from encoding/json/encode.go with modifications of time.Time support.\n// TODO: add more test coverage.\nfunc isEmptyValue(v reflect.Value) bool {\n\tswitch v.Kind() {\n\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\treturn v.Len() == 0\n\tcase reflect.Bool:\n\t\treturn !v.Bool()\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn v.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\treturn v.IsNil()\n\tcase reflectTime:\n\t\tt, ok := v.Interface().(time.Time)\n\t\treturn ok && t.IsZero()\n\t}\n\treturn false\n}\n\nfunc (s *Section) reflectFrom(val reflect.Value) error {\n\tif val.Kind() == reflect.Ptr {\n\t\tval = val.Elem()\n\t}\n\ttyp := val.Type()\n\n\tfor i := 0; i < typ.NumField(); i++ {\n\t\tfield := val.Field(i)\n\t\ttpField := typ.Field(i)\n\n\t\ttag := tpField.Tag.Get(\"ini\")\n\t\tif tag == \"-\" {\n\t\t\tcontinue\n\t\t}\n\n\t\topts := strings.SplitN(tag, \",\", 2)\n\t\tif len(opts) == 2 && opts[1] == \"omitempty\" && isEmptyValue(field) {\n\t\t\tcontinue\n\t\t}\n\n\t\tfieldName := s.parseFieldName(tpField.Name, opts[0])\n\t\tif len(fieldName) == 0 || !field.CanSet() {\n\t\t\tcontinue\n\t\t}\n\n\t\tif (tpField.Type.Kind() == reflect.Ptr && tpField.Anonymous) ||\n\t\t\t(tpField.Type.Kind() == reflect.Struct && tpField.Type.Name() != \"Time\") {\n\t\t\t// Note: The only error here is section doesn't exist.\n\t\t\tsec, err := s.f.GetSection(fieldName)\n\t\t\tif err != nil {\n\t\t\t\t// Note: fieldName can never be empty here, ignore error.\n\t\t\t\tsec, _ = s.f.NewSection(fieldName)\n\t\t\t}\n\n\t\t\t// Add comment from comment tag\n\t\t\tif len(sec.Comment) == 0 {\n\t\t\t\tsec.Comment = tpField.Tag.Get(\"comment\")\n\t\t\t}\n\n\t\t\tif err = sec.reflectFrom(field); err != nil {\n\t\t\t\treturn fmt.Errorf(\"error reflecting field (%s): %v\", fieldName, err)\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\t// Note: Same reason as secion.\n\t\tkey, err := s.GetKey(fieldName)\n\t\tif err != nil {\n\t\t\tkey, _ = s.NewKey(fieldName, \"\")\n\t\t}\n\n\t\t// Add comment from comment tag\n\t\tif len(key.Comment) == 0 {\n\t\t\tkey.Comment = tpField.Tag.Get(\"comment\")\n\t\t}\n\n\t\tif err = reflectWithProperType(tpField.Type, key, field, parseDelim(tpField.Tag.Get(\"delim\"))); err != nil {\n\t\t\treturn fmt.Errorf(\"error reflecting field (%s): %v\", fieldName, err)\n\t\t}\n\n\t}\n\treturn nil\n}\n\n// ReflectFrom reflects secion from given struct.\nfunc (s *Section) ReflectFrom(v interface{}) error {\n\ttyp := reflect.TypeOf(v)\n\tval := reflect.ValueOf(v)\n\tif typ.Kind() == reflect.Ptr {\n\t\ttyp = typ.Elem()\n\t\tval = val.Elem()\n\t} else {\n\t\treturn errors.New(\"cannot reflect from non-pointer struct\")\n\t}\n\n\treturn s.reflectFrom(val)\n}\n\n// ReflectFrom reflects file from given struct.\nfunc (f *File) ReflectFrom(v interface{}) error {\n\treturn f.Section(\"\").ReflectFrom(v)\n}\n\n// ReflectFrom reflects data sources from given struct with name mapper.\nfunc ReflectFromWithMapper(cfg *File, v interface{}, mapper NameMapper) error {\n\tcfg.NameMapper = mapper\n\treturn cfg.ReflectFrom(v)\n}\n\n// ReflectFrom reflects data sources from given struct.\nfunc ReflectFrom(cfg *File, v interface{}) error {\n\treturn ReflectFromWithMapper(cfg, v, nil)\n}\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/.editorconfig", "content": "# top-most EditorConfig file\nroot = true\n\n# Unix-style newlines with a newline ending every file\n[*]\nend_of_line = lf\ninsert_final_newline = true\nindent_style = space\nindent_size = 2\ntrim_trailing_whitespace = true\n\n# Set default charset\n[*.{js,py,go,scala,rb,java,html,css,less,sass,md}]\ncharset = utf-8\n\n# Tab indentation (no size specified)\n[*.go]\nindent_style = tab\n\n[*.md]\ntrim_trailing_whitespace = false\n\n# Matches the exact files either package.json or .travis.yml\n[{package.json,.travis.yml}]\nindent_style = space\nindent_size = 2\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/.gitignore", "content": "secrets.yml\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/.travis.yml", "content": "after_success:\n- bash <(curl -s https://codecov.io/bash)\ngo:\n- '1.9'\n- 1.10.x\n- 1.11.x\ninstall:\n- go get -u github.com/stretchr/testify/assert\n- go get -u github.com/go-openapi/swag\nlanguage: go\nnotifications:\n slack:\n secure: a5VgoiwB1G/AZqzmephPZIhEB9avMlsWSlVnM1dSAtYAwdrQHGTQxAmpOxYIoSPDhWNN5bfZmjd29++UlTwLcHSR+e0kJhH6IfDlsHj/HplNCJ9tyI0zYc7XchtdKgeMxMzBKCzgwFXGSbQGydXTliDNBo0HOzmY3cou/daMFTP60K+offcjS+3LRAYb1EroSRXZqrk1nuF/xDL3792DZUdPMiFR/L/Df6y74D6/QP4sTkTDFQitz4Wy/7jbsfj8dG6qK2zivgV6/l+w4OVjFkxVpPXogDWY10vVXNVynqxfJ7to2d1I9lNCHE2ilBCkWMIPdyJF7hjF8pKW+82yP4EzRh0vu8Xn0HT5MZpQxdRY/YMxNrWaG7SxsoEaO4q5uhgdzAqLYY3TRa7MjIK+7Ur+aqOeTXn6OKwVi0CjvZ6mIU3WUKSwiwkFZMbjRAkSb5CYwMEfGFO/z964xz83qGt6WAtBXNotqCQpTIiKtDHQeLOMfksHImCg6JLhQcWBVxamVgu0G3Pdh8Y6DyPnxraXY95+QDavbjqv7TeYT9T/FNnrkXaTTK0s4iWE5H4ACU0Qvz0wUYgfQrZv0/Hp7V17+rabUwnzYySHCy9SWX/7OV9Cfh31iMp9ZIffr76xmmThtOEqs8TrTtU6BWI3rWwvA9cXQipZTVtL0oswrGw=\nscript:\n- go test -v -race -cover -coverprofile=coverage.txt -covermode=atomic ./...\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as\ncontributors and maintainers pledge to making participation in our project and\nour community a harassment-free experience for everyone, regardless of age, body\nsize, disability, ethnicity, gender identity and expression, level of experience,\nnationality, personal appearance, race, religion, or sexual identity and\norientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment\ninclude:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or\nadvances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic\n address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a\n professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable\nbehavior and are expected to take appropriate and fair corrective action in\nresponse to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or\nreject comments, commits, code, wiki edits, issues, and other contributions\nthat are not aligned to this Code of Conduct, or to ban temporarily or\npermanently any contributor for other behaviors that they deem inappropriate,\nthreatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces\nwhen an individual is representing the project or its community. Examples of\nrepresenting a project or community include using an official project e-mail\naddress, posting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event. Representation of a project may be\nfurther defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported by contacting the project team at ivan+abuse@flanders.co.nz. All\ncomplaints will be reviewed and investigated and will result in a response that\nis deemed necessary and appropriate to the circumstances. The project team is\nobligated to maintain confidentiality with regard to the reporter of an incident.\nFurther details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good\nfaith may face temporary or permanent repercussions as determined by other\nmembers of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\navailable at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/README.md", "content": "# gojsonpointer [![Build Status](https://travis-ci.org/go-openapi/jsonpointer.svg?branch=master)](https://travis-ci.org/go-openapi/jsonpointer) [![codecov](https://codecov.io/gh/go-openapi/jsonpointer/branch/master/graph/badge.svg)](https://codecov.io/gh/go-openapi/jsonpointer) [![Slack Status](https://slackin.goswagger.io/badge.svg)](https://slackin.goswagger.io)\n\n[![license](http://img.shields.io/badge/license-Apache%20v2-orange.svg)](https://raw.githubusercontent.com/go-openapi/jsonpointer/master/LICENSE) [![GoDoc](https://godoc.org/github.com/go-openapi/jsonpointer?status.svg)](http://godoc.org/github.com/go-openapi/jsonpointer)\nAn implementation of JSON Pointer - Go language\n\n## Status\nCompleted YES\n\nTested YES\n\n## References\nhttp://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-07\n\n### Note\nThe 4.Evaluation part of the previous reference, starting with 'If the currently referenced value is a JSON array, the reference token MUST contain either...' is not implemented.\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/go.mod", "content": "module github.com/go-openapi/jsonpointer\n\nrequire (\n\tgithub.com/davecgh/go-spew v1.1.1 // indirect\n\tgithub.com/go-openapi/swag v0.17.0\n\tgithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 // indirect\n\tgithub.com/pmezard/go-difflib v1.0.0 // indirect\n\tgithub.com/stretchr/testify v1.2.2\n\tgopkg.in/yaml.v2 v2.2.1 // indirect\n)\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/go.sum", "content": "github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/go-openapi/swag v0.17.0 h1:7wu+dZ5k83kvUWeAb+WUkFiUhDzwGqzTR/NhWzeo1JU=\ngithub.com/go-openapi/swag v0.17.0/go.mod h1:DXUve3Dpr1UfpPtxFw+EFuQ41HhCWZfha5jSVRG7C7I=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 h1:2gxZ0XQIU/5z3Z3bUBu+FXuk2pFbkN6tcwi/pjyaDic=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/testify v1.2.2 h1:bSDNvY7ZPG5RlJ8otE/7V6gMiyenm9RtJ7IUVIAoJ1w=\ngithub.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/go-openapi/jsonpointer/pointer.go", "content": "// Copyright 2013 sigu-399 ( https://github.com/sigu-399 )\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// author sigu-399\n// author-github https://github.com/sigu-399\n// author-mail sigu.399@gmail.com\n//\n// repository-name jsonpointer\n// repository-desc An implementation of JSON Pointer - Go language\n//\n// description Main and unique file.\n//\n// created 25-02-2013\n\npackage jsonpointer\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/swag\"\n)\n\nconst (\n\temptyPointer = ``\n\tpointerSeparator = `/`\n\n\tinvalidStart = `JSON pointer must be empty or start with a \"` + pointerSeparator\n)\n\nvar jsonPointableType = reflect.TypeOf(new(JSONPointable)).Elem()\nvar jsonSetableType = reflect.TypeOf(new(JSONSetable)).Elem()\n\n// JSONPointable is an interface for structs to implement when they need to customize the\n// json pointer process\ntype JSONPointable interface {\n\tJSONLookup(string) (interface{}, error)\n}\n\n// JSONSetable is an interface for structs to implement when they need to customize the\n// json pointer process\ntype JSONSetable interface {\n\tJSONSet(string, interface{}) error\n}\n\n// New creates a new json pointer for the given string\nfunc New(jsonPointerString string) (Pointer, error) {\n\n\tvar p Pointer\n\terr := p.parse(jsonPointerString)\n\treturn p, err\n\n}\n\n// Pointer the json pointer reprsentation\ntype Pointer struct {\n\treferenceTokens []string\n}\n\n// \"Constructor\", parses the given string JSON pointer\nfunc (p *Pointer) parse(jsonPointerString string) error {\n\n\tvar err error\n\n\tif jsonPointerString != emptyPointer {\n\t\tif !strings.HasPrefix(jsonPointerString, pointerSeparator) {\n\t\t\terr = errors.New(invalidStart)\n\t\t} else {\n\t\t\treferenceTokens := strings.Split(jsonPointerString, pointerSeparator)\n\t\t\tfor _, referenceToken := range referenceTokens[1:] {\n\t\t\t\tp.referenceTokens = append(p.referenceTokens, referenceToken)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn err\n}\n\n// Get uses the pointer to retrieve a value from a JSON document\nfunc (p *Pointer) Get(document interface{}) (interface{}, reflect.Kind, error) {\n\treturn p.get(document, swag.DefaultJSONNameProvider)\n}\n\n// Set uses the pointer to set a value from a JSON document\nfunc (p *Pointer) Set(document interface{}, value interface{}) (interface{}, error) {\n\treturn document, p.set(document, value, swag.DefaultJSONNameProvider)\n}\n\n// GetForToken gets a value for a json pointer token 1 level deep\nfunc GetForToken(document interface{}, decodedToken string) (interface{}, reflect.Kind, error) {\n\treturn getSingleImpl(document, decodedToken, swag.DefaultJSONNameProvider)\n}\n\n// SetForToken gets a value for a json pointer token 1 level deep\nfunc SetForToken(document interface{}, decodedToken string, value interface{}) (interface{}, error) {\n\treturn document, setSingleImpl(document, value, decodedToken, swag.DefaultJSONNameProvider)\n}\n\nfunc getSingleImpl(node interface{}, decodedToken string, nameProvider *swag.NameProvider) (interface{}, reflect.Kind, error) {\n\trValue := reflect.Indirect(reflect.ValueOf(node))\n\tkind := rValue.Kind()\n\n\tswitch kind {\n\n\tcase reflect.Struct:\n\t\tif rValue.Type().Implements(jsonPointableType) {\n\t\t\tr, err := node.(JSONPointable).JSONLookup(decodedToken)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, kind, err\n\t\t\t}\n\t\t\treturn r, kind, nil\n\t\t}\n\t\tnm, ok := nameProvider.GetGoNameForType(rValue.Type(), decodedToken)\n\t\tif !ok {\n\t\t\treturn nil, kind, fmt.Errorf(\"object has no field %q\", decodedToken)\n\t\t}\n\t\tfld := rValue.FieldByName(nm)\n\t\treturn fld.Interface(), kind, nil\n\n\tcase reflect.Map:\n\t\tkv := reflect.ValueOf(decodedToken)\n\t\tmv := rValue.MapIndex(kv)\n\n\t\tif mv.IsValid() && !swag.IsZero(mv) {\n\t\t\treturn mv.Interface(), kind, nil\n\t\t}\n\t\treturn nil, kind, fmt.Errorf(\"object has no key %q\", decodedToken)\n\n\tcase reflect.Slice:\n\t\ttokenIndex, err := strconv.Atoi(decodedToken)\n\t\tif err != nil {\n\t\t\treturn nil, kind, err\n\t\t}\n\t\tsLength := rValue.Len()\n\t\tif tokenIndex < 0 || tokenIndex >= sLength {\n\t\t\treturn nil, kind, fmt.Errorf(\"index out of bounds array[0,%d] index '%d'\", sLength-1, tokenIndex)\n\t\t}\n\n\t\telem := rValue.Index(tokenIndex)\n\t\treturn elem.Interface(), kind, nil\n\n\tdefault:\n\t\treturn nil, kind, fmt.Errorf(\"invalid token reference %q\", decodedToken)\n\t}\n\n}\n\nfunc setSingleImpl(node, data interface{}, decodedToken string, nameProvider *swag.NameProvider) error {\n\trValue := reflect.Indirect(reflect.ValueOf(node))\n\tswitch rValue.Kind() {\n\n\tcase reflect.Struct:\n\t\tif ns, ok := node.(JSONSetable); ok { // pointer impl\n\t\t\treturn ns.JSONSet(decodedToken, data)\n\t\t}\n\n\t\tif rValue.Type().Implements(jsonSetableType) {\n\t\t\treturn node.(JSONSetable).JSONSet(decodedToken, data)\n\t\t}\n\n\t\tnm, ok := nameProvider.GetGoNameForType(rValue.Type(), decodedToken)\n\t\tif !ok {\n\t\t\treturn fmt.Errorf(\"object has no field %q\", decodedToken)\n\t\t}\n\t\tfld := rValue.FieldByName(nm)\n\t\tif fld.IsValid() {\n\t\t\tfld.Set(reflect.ValueOf(data))\n\t\t}\n\t\treturn nil\n\n\tcase reflect.Map:\n\t\tkv := reflect.ValueOf(decodedToken)\n\t\trValue.SetMapIndex(kv, reflect.ValueOf(data))\n\t\treturn nil\n\n\tcase reflect.Slice:\n\t\ttokenIndex, err := strconv.Atoi(decodedToken)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tsLength := rValue.Len()\n\t\tif tokenIndex < 0 || tokenIndex >= sLength {\n\t\t\treturn fmt.Errorf(\"index out of bounds array[0,%d] index '%d'\", sLength, tokenIndex)\n\t\t}\n\n\t\telem := rValue.Index(tokenIndex)\n\t\tif !elem.CanSet() {\n\t\t\treturn fmt.Errorf(\"can't set slice index %s to %v\", decodedToken, data)\n\t\t}\n\t\telem.Set(reflect.ValueOf(data))\n\t\treturn nil\n\n\tdefault:\n\t\treturn fmt.Errorf(\"invalid token reference %q\", decodedToken)\n\t}\n\n}\n\nfunc (p *Pointer) get(node interface{}, nameProvider *swag.NameProvider) (interface{}, reflect.Kind, error) {\n\n\tif nameProvider == nil {\n\t\tnameProvider = swag.DefaultJSONNameProvider\n\t}\n\n\tkind := reflect.Invalid\n\n\t// Full document when empty\n\tif len(p.referenceTokens) == 0 {\n\t\treturn node, kind, nil\n\t}\n\n\tfor _, token := range p.referenceTokens {\n\n\t\tdecodedToken := Unescape(token)\n\n\t\tr, knd, err := getSingleImpl(node, decodedToken, nameProvider)\n\t\tif err != nil {\n\t\t\treturn nil, knd, err\n\t\t}\n\t\tnode, kind = r, knd\n\n\t}\n\n\trValue := reflect.ValueOf(node)\n\tkind = rValue.Kind()\n\n\treturn node, kind, nil\n}\n\nfunc (p *Pointer) set(node, data interface{}, nameProvider *swag.NameProvider) error {\n\tknd := reflect.ValueOf(node).Kind()\n\n\tif knd != reflect.Ptr && knd != reflect.Struct && knd != reflect.Map && knd != reflect.Slice && knd != reflect.Array {\n\t\treturn fmt.Errorf(\"only structs, pointers, maps and slices are supported for setting values\")\n\t}\n\n\tif nameProvider == nil {\n\t\tnameProvider = swag.DefaultJSONNameProvider\n\t}\n\n\t// Full document when empty\n\tif len(p.referenceTokens) == 0 {\n\t\treturn nil\n\t}\n\n\tlastI := len(p.referenceTokens) - 1\n\tfor i, token := range p.referenceTokens {\n\t\tisLastToken := i == lastI\n\t\tdecodedToken := Unescape(token)\n\n\t\tif isLastToken {\n\n\t\t\treturn setSingleImpl(node, data, decodedToken, nameProvider)\n\t\t}\n\n\t\trValue := reflect.Indirect(reflect.ValueOf(node))\n\t\tkind := rValue.Kind()\n\n\t\tswitch kind {\n\n\t\tcase reflect.Struct:\n\t\t\tif rValue.Type().Implements(jsonPointableType) {\n\t\t\t\tr, err := node.(JSONPointable).JSONLookup(decodedToken)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tfld := reflect.ValueOf(r)\n\t\t\t\tif fld.CanAddr() && fld.Kind() != reflect.Interface && fld.Kind() != reflect.Map && fld.Kind() != reflect.Slice && fld.Kind() != reflect.Ptr {\n\t\t\t\t\tnode = fld.Addr().Interface()\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tnode = r\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tnm, ok := nameProvider.GetGoNameForType(rValue.Type(), decodedToken)\n\t\t\tif !ok {\n\t\t\t\treturn fmt.Errorf(\"object has no field %q\", decodedToken)\n\t\t\t}\n\t\t\tfld := rValue.FieldByName(nm)\n\t\t\tif fld.CanAddr() && fld.Kind() != reflect.Interface && fld.Kind() != reflect.Map && fld.Kind() != reflect.Slice && fld.Kind() != reflect.Ptr {\n\t\t\t\tnode = fld.Addr().Interface()\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tnode = fld.Interface()\n\n\t\tcase reflect.Map:\n\t\t\tkv := reflect.ValueOf(decodedToken)\n\t\t\tmv := rValue.MapIndex(kv)\n\n\t\t\tif !mv.IsValid() {\n\t\t\t\treturn fmt.Errorf(\"object has no key %q\", decodedToken)\n\t\t\t}\n\t\t\tif mv.CanAddr() && mv.Kind() != reflect.Interface && mv.Kind() != reflect.Map && mv.Kind() != reflect.Slice && mv.Kind() != reflect.Ptr {\n\t\t\t\tnode = mv.Addr().Interface()\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tnode = mv.Interface()\n\n\t\tcase reflect.Slice:\n\t\t\ttokenIndex, err := strconv.Atoi(decodedToken)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tsLength := rValue.Len()\n\t\t\tif tokenIndex < 0 || tokenIndex >= sLength {\n\t\t\t\treturn fmt.Errorf(\"index out of bounds array[0,%d] index '%d'\", sLength, tokenIndex)\n\t\t\t}\n\n\t\t\telem := rValue.Index(tokenIndex)\n\t\t\tif elem.CanAddr() && elem.Kind() != reflect.Interface && elem.Kind() != reflect.Map && elem.Kind() != reflect.Slice && elem.Kind() != reflect.Ptr {\n\t\t\t\tnode = elem.Addr().Interface()\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tnode = elem.Interface()\n\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"invalid token reference %q\", decodedToken)\n\t\t}\n\n\t}\n\n\treturn nil\n}\n\n// DecodedTokens returns the decoded tokens\nfunc (p *Pointer) DecodedTokens() []string {\n\tresult := make([]string, 0, len(p.referenceTokens))\n\tfor _, t := range p.referenceTokens {\n\t\tresult = append(result, Unescape(t))\n\t}\n\treturn result\n}\n\n// IsEmpty returns true if this is an empty json pointer\n// this indicates that it points to the root document\nfunc (p *Pointer) IsEmpty() bool {\n\treturn len(p.referenceTokens) == 0\n}\n\n// Pointer to string representation function\nfunc (p *Pointer) String() string {\n\n\tif len(p.referenceTokens) == 0 {\n\t\treturn emptyPointer\n\t}\n\n\tpointerString := pointerSeparator + strings.Join(p.referenceTokens, pointerSeparator)\n\n\treturn pointerString\n}\n\n// Specific JSON pointer encoding here\n// ~0 => ~\n// ~1 => /\n// ... and vice versa\n\nconst (\n\tencRefTok0 = `~0`\n\tencRefTok1 = `~1`\n\tdecRefTok0 = `~`\n\tdecRefTok1 = `/`\n)\n\n// Unescape unescapes a json pointer reference token string to the original representation\nfunc Unescape(token string) string {\n\tstep1 := strings.Replace(token, encRefTok1, decRefTok1, -1)\n\tstep2 := strings.Replace(step1, encRefTok0, decRefTok0, -1)\n\treturn step2\n}\n\n// Escape escapes a pointer reference token string\nfunc Escape(token string) string {\n\tstep1 := strings.Replace(token, decRefTok0, encRefTok0, -1)\n\tstep2 := strings.Replace(step1, decRefTok1, encRefTok1, -1)\n\treturn step2\n}\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/.gitignore", "content": "secrets.yml\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/.travis.yml", "content": "after_success:\n- bash <(curl -s https://codecov.io/bash)\ngo:\n- '1.9'\n- 1.10.x\n- 1.11.x\ninstall:\n- go get -u github.com/stretchr/testify/assert\n- go get -u github.com/PuerkitoBio/purell\n- go get -u github.com/go-openapi/jsonpointer\nlanguage: go\nnotifications:\n slack:\n secure: OpQG/36F7DSF00HLm9WZMhyqFCYYyYTsVDObW226cWiR8PWYiNfLZiSEvIzT1Gx4dDjhigKTIqcLhG34CkL5iNXDjm9Yyo2RYhQPlK8NErNqUEXuBqn4RqYHW48VGhEhOyDd4Ei0E2FN5ZbgpvHgtpkdZ6XDi64r3Ac89isP9aPHXQTuv2Jog6b4/OKKiUTftLcTIst0p4Cp3gqOJWf1wnoj+IadWiECNVQT6zb47IYjtyw6+uV8iUjTzdKcRB6Zc6b4Dq7JAg1Zd7Jfxkql3hlKp4PNlRf9Cy7y5iA3G7MLyg3FcPX5z2kmcyPt2jOTRMBWUJ5zIQpOxizAcN8WsT3WWBL5KbuYK6k0PzujrIDLqdxGpNmjkkMfDBT9cKmZpm2FdW+oZgPFJP+oKmAo4u4KJz/vjiPTXgQlN5bmrLuRMCp+AwC5wkIohTqWZVPE2TK6ZSnMYcg/W39s+RP/9mJoyryAvPSpBOLTI+biCgaUCTOAZxNTWpMFc3tPYntc41WWkdKcooZ9JA5DwfcaVFyTGQ3YXz+HvX6G1z/gW0Q/A4dBi9mj2iE1xm7tRTT+4VQ2AXFvSEI1HJpfPgYnwAtwOD1v3Qm2EUHk9sCdtEDR4wVGEPIVn44GnwFMnGKx9JWppMPYwFu3SVDdHt+E+LOlhZUply11Aa+IVrT2KUQ=\nscript:\n- go test -v -race -cover -coverprofile=coverage.txt -covermode=atomic ./...\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as\ncontributors and maintainers pledge to making participation in our project and\nour community a harassment-free experience for everyone, regardless of age, body\nsize, disability, ethnicity, gender identity and expression, level of experience,\nnationality, personal appearance, race, religion, or sexual identity and\norientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment\ninclude:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or\nadvances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic\n address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a\n professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable\nbehavior and are expected to take appropriate and fair corrective action in\nresponse to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or\nreject comments, commits, code, wiki edits, issues, and other contributions\nthat are not aligned to this Code of Conduct, or to ban temporarily or\npermanently any contributor for other behaviors that they deem inappropriate,\nthreatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces\nwhen an individual is representing the project or its community. Examples of\nrepresenting a project or community include using an official project e-mail\naddress, posting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event. Representation of a project may be\nfurther defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported by contacting the project team at ivan+abuse@flanders.co.nz. All\ncomplaints will be reviewed and investigated and will result in a response that\nis deemed necessary and appropriate to the circumstances. The project team is\nobligated to maintain confidentiality with regard to the reporter of an incident.\nFurther details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good\nfaith may face temporary or permanent repercussions as determined by other\nmembers of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\navailable at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/README.md", "content": "# gojsonreference [![Build Status](https://travis-ci.org/go-openapi/jsonreference.svg?branch=master)](https://travis-ci.org/go-openapi/jsonreference) [![codecov](https://codecov.io/gh/go-openapi/jsonreference/branch/master/graph/badge.svg)](https://codecov.io/gh/go-openapi/jsonreference) [![Slack Status](https://slackin.goswagger.io/badge.svg)](https://slackin.goswagger.io)\n\n[![license](http://img.shields.io/badge/license-Apache%20v2-orange.svg)](https://raw.githubusercontent.com/go-openapi/jsonreference/master/LICENSE) [![GoDoc](https://godoc.org/github.com/go-openapi/jsonreference?status.svg)](http://godoc.org/github.com/go-openapi/jsonreference)\nAn implementation of JSON Reference - Go language\n\n## Status\nWork in progress ( 90% done )\n\n## Dependencies\nhttps://github.com/go-openapi/jsonpointer\n\n## References\nhttp://tools.ietf.org/html/draft-ietf-appsawg-json-pointer-07\n\nhttp://tools.ietf.org/html/draft-pbryan-zyp-json-ref-03\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/go.mod", "content": "module github.com/go-openapi/jsonreference\n\nrequire (\n\tgithub.com/PuerkitoBio/purell v1.1.0\n\tgithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 // indirect\n\tgithub.com/davecgh/go-spew v1.1.1 // indirect\n\tgithub.com/go-openapi/jsonpointer v0.17.0\n\tgithub.com/go-openapi/swag v0.17.0 // indirect\n\tgithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 // indirect\n\tgithub.com/pmezard/go-difflib v1.0.0 // indirect\n\tgithub.com/stretchr/testify v1.2.2\n\tgolang.org/x/net v0.0.0-20181005035420-146acd28ed58 // indirect\n\tgolang.org/x/text v0.3.0 // indirect\n\tgopkg.in/yaml.v2 v2.2.1 // indirect\n)\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/go.sum", "content": "github.com/PuerkitoBio/purell v1.1.0 h1:rmGxhojJlM0tuKtfdvliR84CFHljx9ag64t2xmVkjK4=\ngithub.com/PuerkitoBio/purell v1.1.0/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 h1:d+Bc7a5rLufV/sSk/8dngufqelfh6jnri85riMAaF/M=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578/go.mod h1:uGdkoq3SwY9Y+13GIhn11/XLaGBb4BfwItxLd5jeuXE=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/go-openapi/jsonpointer v0.17.0 h1:Bpl2DtZ6k7wKqfFs7e+4P08+M9I3FQgn09a1UsRUQbk=\ngithub.com/go-openapi/jsonpointer v0.17.0/go.mod h1:+35s3my2LFTysnkMfxsJBAMHj/DoqoB9knIWoYG/Vk0=\ngithub.com/go-openapi/swag v0.17.0 h1:7wu+dZ5k83kvUWeAb+WUkFiUhDzwGqzTR/NhWzeo1JU=\ngithub.com/go-openapi/swag v0.17.0/go.mod h1:DXUve3Dpr1UfpPtxFw+EFuQ41HhCWZfha5jSVRG7C7I=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 h1:2gxZ0XQIU/5z3Z3bUBu+FXuk2pFbkN6tcwi/pjyaDic=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/testify v1.2.2 h1:bSDNvY7ZPG5RlJ8otE/7V6gMiyenm9RtJ7IUVIAoJ1w=\ngithub.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58 h1:otZG8yDCO4LVps5+9bxOeNiCvgmOyt96J3roHTYs7oE=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/go-openapi/jsonreference/reference.go", "content": "// Copyright 2013 sigu-399 ( https://github.com/sigu-399 )\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// author sigu-399\n// author-github https://github.com/sigu-399\n// author-mail sigu.399@gmail.com\n//\n// repository-name jsonreference\n// repository-desc An implementation of JSON Reference - Go language\n//\n// description Main and unique file.\n//\n// created 26-02-2013\n\npackage jsonreference\n\nimport (\n\t\"errors\"\n\t\"net/url\"\n\t\"strings\"\n\n\t\"github.com/PuerkitoBio/purell\"\n\t\"github.com/go-openapi/jsonpointer\"\n)\n\nconst (\n\tfragmentRune = `#`\n)\n\n// New creates a new reference for the given string\nfunc New(jsonReferenceString string) (Ref, error) {\n\n\tvar r Ref\n\terr := r.parse(jsonReferenceString)\n\treturn r, err\n\n}\n\n// MustCreateRef parses the ref string and panics when it's invalid.\n// Use the New method for a version that returns an error\nfunc MustCreateRef(ref string) Ref {\n\tr, err := New(ref)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn r\n}\n\n// Ref represents a json reference object\ntype Ref struct {\n\treferenceURL *url.URL\n\treferencePointer jsonpointer.Pointer\n\n\tHasFullURL bool\n\tHasURLPathOnly bool\n\tHasFragmentOnly bool\n\tHasFileScheme bool\n\tHasFullFilePath bool\n}\n\n// GetURL gets the URL for this reference\nfunc (r *Ref) GetURL() *url.URL {\n\treturn r.referenceURL\n}\n\n// GetPointer gets the json pointer for this reference\nfunc (r *Ref) GetPointer() *jsonpointer.Pointer {\n\treturn &r.referencePointer\n}\n\n// String returns the best version of the url for this reference\nfunc (r *Ref) String() string {\n\n\tif r.referenceURL != nil {\n\t\treturn r.referenceURL.String()\n\t}\n\n\tif r.HasFragmentOnly {\n\t\treturn fragmentRune + r.referencePointer.String()\n\t}\n\n\treturn r.referencePointer.String()\n}\n\n// IsRoot returns true if this reference is a root document\nfunc (r *Ref) IsRoot() bool {\n\treturn r.referenceURL != nil &&\n\t\t!r.IsCanonical() &&\n\t\t!r.HasURLPathOnly &&\n\t\tr.referenceURL.Fragment == \"\"\n}\n\n// IsCanonical returns true when this pointer starts with http(s):// or file://\nfunc (r *Ref) IsCanonical() bool {\n\treturn (r.HasFileScheme && r.HasFullFilePath) || (!r.HasFileScheme && r.HasFullURL)\n}\n\n// \"Constructor\", parses the given string JSON reference\nfunc (r *Ref) parse(jsonReferenceString string) error {\n\n\tparsed, err := url.Parse(jsonReferenceString)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tr.referenceURL, _ = url.Parse(purell.NormalizeURL(parsed, purell.FlagsSafe|purell.FlagRemoveDuplicateSlashes))\n\trefURL := r.referenceURL\n\n\tif refURL.Scheme != \"\" && refURL.Host != \"\" {\n\t\tr.HasFullURL = true\n\t} else {\n\t\tif refURL.Path != \"\" {\n\t\t\tr.HasURLPathOnly = true\n\t\t} else if refURL.RawQuery == \"\" && refURL.Fragment != \"\" {\n\t\t\tr.HasFragmentOnly = true\n\t\t}\n\t}\n\n\tr.HasFileScheme = refURL.Scheme == \"file\"\n\tr.HasFullFilePath = strings.HasPrefix(refURL.Path, \"/\")\n\n\t// invalid json-pointer error means url has no json-pointer fragment. simply ignore error\n\tr.referencePointer, _ = jsonpointer.New(refURL.Fragment)\n\n\treturn nil\n}\n\n// Inherits creates a new reference from a parent and a child\n// If the child cannot inherit from the parent, an error is returned\nfunc (r *Ref) Inherits(child Ref) (*Ref, error) {\n\tchildURL := child.GetURL()\n\tparentURL := r.GetURL()\n\tif childURL == nil {\n\t\treturn nil, errors.New(\"child url is nil\")\n\t}\n\tif parentURL == nil {\n\t\treturn &child, nil\n\t}\n\n\tref, err := New(parentURL.ResolveReference(childURL).String())\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &ref, nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/.editorconfig", "content": "# top-most EditorConfig file\nroot = true\n\n# Unix-style newlines with a newline ending every file\n[*]\nend_of_line = lf\ninsert_final_newline = true\nindent_style = space\nindent_size = 2\ntrim_trailing_whitespace = true\n\n# Set default charset\n[*.{js,py,go,scala,rb,java,html,css,less,sass,md}]\ncharset = utf-8\n\n# Tab indentation (no size specified)\n[*.go]\nindent_style = tab\n\n[*.md]\ntrim_trailing_whitespace = false\n\n# Matches the exact files either package.json or .travis.yml\n[{package.json,.travis.yml}]\nindent_style = space\nindent_size = 2\n" }, { "path": "vendor/github.com/go-openapi/spec/.gitignore", "content": "secrets.yml\ncoverage.out\n" }, { "path": "vendor/github.com/go-openapi/spec/.golangci.yml", "content": "linters-settings:\n govet:\n check-shadowing: true\n golint:\n min-confidence: 0\n gocyclo:\n min-complexity: 45\n maligned:\n suggest-new: true\n dupl:\n threshold: 100\n goconst:\n min-len: 2\n min-occurrences: 2\n\nlinters:\n enable-all: true\n disable:\n - maligned\n - unparam\n - lll\n - gochecknoinits\n - gochecknoglobals\n" }, { "path": "vendor/github.com/go-openapi/spec/.travis.yml", "content": "after_success:\n- bash <(curl -s https://codecov.io/bash)\ngo:\n- '1.9'\n- 1.10.x\n- 1.11.x\ninstall:\n- go get -u github.com/stretchr/testify\n- go get -u github.com/go-openapi/swag\n- go get -u gopkg.in/yaml.v2\n- go get -u github.com/go-openapi/jsonpointer\n- go get -u github.com/go-openapi/jsonreference\nlanguage: go\nnotifications:\n slack:\n secure: QUWvCkBBK09GF7YtEvHHVt70JOkdlNBG0nIKu/5qc4/nW5HP8I2w0SEf/XR2je0eED1Qe3L/AfMCWwrEj+IUZc3l4v+ju8X8R3Lomhme0Eb0jd1MTMCuPcBT47YCj0M7RON7vXtbFfm1hFJ/jLe5+9FXz0hpXsR24PJc5ZIi/ogNwkaPqG4BmndzecpSh0vc2FJPZUD9LT0I09REY/vXR0oQAalLkW0asGD5taHZTUZq/kBpsNxaAFrLM23i4mUcf33M5fjLpvx5LRICrX/57XpBrDh2TooBU6Qj3CgoY0uPRYUmSNxbVx1czNzl2JtEpb5yjoxfVPQeg0BvQM00G8LJINISR+ohrjhkZmAqchDupAX+yFrxTtORa78CtnIL6z/aTNlgwwVD8kvL/1pFA/JWYmKDmz93mV/+6wubGzNSQCstzjkFA4/iZEKewKUoRIAi/fxyscP6L/rCpmY/4llZZvrnyTqVbt6URWpopUpH4rwYqreXAtJxJsfBJIeSmUIiDIOMGkCTvyTEW3fWGmGoqWtSHLoaWDyAIGb7azb+KvfpWtEcoPFWfSWU+LGee0A/YsUhBl7ADB9A0CJEuR8q4BPpKpfLwPKSiKSAXL7zDkyjExyhtgqbSl2jS+rKIHOZNL8JkCcTP2MKMVd563C5rC5FMKqu3S9m2b6380E=\nscript:\n- go test -v -race -cover -coverprofile=coverage.txt -covermode=atomic ./...\n" }, { "path": "vendor/github.com/go-openapi/spec/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as\ncontributors and maintainers pledge to making participation in our project and\nour community a harassment-free experience for everyone, regardless of age, body\nsize, disability, ethnicity, gender identity and expression, level of experience,\nnationality, personal appearance, race, religion, or sexual identity and\norientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment\ninclude:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or\nadvances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic\n address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a\n professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable\nbehavior and are expected to take appropriate and fair corrective action in\nresponse to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or\nreject comments, commits, code, wiki edits, issues, and other contributions\nthat are not aligned to this Code of Conduct, or to ban temporarily or\npermanently any contributor for other behaviors that they deem inappropriate,\nthreatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces\nwhen an individual is representing the project or its community. Examples of\nrepresenting a project or community include using an official project e-mail\naddress, posting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event. Representation of a project may be\nfurther defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported by contacting the project team at ivan+abuse@flanders.co.nz. All\ncomplaints will be reviewed and investigated and will result in a response that\nis deemed necessary and appropriate to the circumstances. The project team is\nobligated to maintain confidentiality with regard to the reporter of an incident.\nFurther details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good\nfaith may face temporary or permanent repercussions as determined by other\nmembers of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\navailable at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/go-openapi/spec/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/go-openapi/spec/README.md", "content": "# OAI object model [![Build Status](https://travis-ci.org/go-openapi/spec.svg?branch=master)](https://travis-ci.org/go-openapi/spec) [![codecov](https://codecov.io/gh/go-openapi/spec/branch/master/graph/badge.svg)](https://codecov.io/gh/go-openapi/spec) [![Slack Status](https://slackin.goswagger.io/badge.svg)](https://slackin.goswagger.io)\n\n[![license](http://img.shields.io/badge/license-Apache%20v2-orange.svg)](https://raw.githubusercontent.com/go-openapi/spec/master/LICENSE)\n[![GoDoc](https://godoc.org/github.com/go-openapi/spec?status.svg)](http://godoc.org/github.com/go-openapi/spec)\n[![GolangCI](https://golangci.com/badges/github.com/go-openapi/spec.svg)](https://golangci.com)\n[![Go Report Card](https://goreportcard.com/badge/github.com/go-openapi/spec)](https://goreportcard.com/report/github.com/go-openapi/spec)\n\nThe object model for OpenAPI specification documents.\n\nCurrently supports Swagger 2.0.\n" }, { "path": "vendor/github.com/go-openapi/spec/bindata.go", "content": "// Code generated by go-bindata. DO NOT EDIT.\n// sources:\n// schemas/jsonschema-draft-04.json (4.357kB)\n// schemas/v2/schema.json (40.249kB)\n\npackage spec\n\nimport (\n\t\"bytes\"\n\t\"compress/gzip\"\n\t\"crypto/sha256\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc bindataRead(data []byte, name string) ([]byte, error) {\n\tgz, err := gzip.NewReader(bytes.NewBuffer(data))\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"Read %q: %v\", name, err)\n\t}\n\n\tvar buf bytes.Buffer\n\t_, err = io.Copy(&buf, gz)\n\tclErr := gz.Close()\n\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"Read %q: %v\", name, err)\n\t}\n\tif clErr != nil {\n\t\treturn nil, err\n\t}\n\n\treturn buf.Bytes(), nil\n}\n\ntype asset struct {\n\tbytes []byte\n\tinfo os.FileInfo\n\tdigest [sha256.Size]byte\n}\n\ntype bindataFileInfo struct {\n\tname string\n\tsize int64\n\tmode os.FileMode\n\tmodTime time.Time\n}\n\nfunc (fi bindataFileInfo) Name() string {\n\treturn fi.name\n}\nfunc (fi bindataFileInfo) Size() int64 {\n\treturn fi.size\n}\nfunc (fi bindataFileInfo) Mode() os.FileMode {\n\treturn fi.mode\n}\nfunc (fi bindataFileInfo) ModTime() time.Time {\n\treturn fi.modTime\n}\nfunc (fi bindataFileInfo) IsDir() bool {\n\treturn false\n}\nfunc (fi bindataFileInfo) Sys() interface{} {\n\treturn nil\n}\n\nvar _jsonschemaDraft04JSON = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x00\\x00\\x00\\x00\\xff\\xc4\\x57\\x3d\\x6f\\xdb\\x3c\\x10\\xde\\xf3\\x2b\\x08\\x26\\x63\\xf2\\x2a\\x2f\\xd0\\xc9\\x5b\\xd1\\x2e\\x01\\x5a\\x34\\x43\\x37\\x23\\x03\\x6d\\x9d\\x6c\\x06\\x14\\xa9\\x50\\x54\\x60\\xc3\\xd0\\x7f\\x2f\\x28\\x4a\\x14\\x29\\x91\\x92\\x2d\\xa7\\x8d\\x97\\x28\\xbc\\xaf\\xe7\\x8e\\xf7\\xc5\\xd3\\x0d\\x42\\x08\\x61\\x9a\\xe2\\x15\\xc2\\x7b\\xa5\\x8a\\x55\\x92\\xbc\\x96\\x82\\x3f\\x94\\xdb\\x3d\\xe4\\xe4\\x3f\\x21\\x77\\x49\\x2a\\x49\\xa6\\x1e\\x1e\\xbf\\x24\\xe6\\xec\\x16\\xdf\\x1b\\xa1\\x3b\\xf3\\xff\\x02\\xc9\\x14\\xca\\xad\\xa4\\x85\\xa2\\x82\\x6b\\xe9\\x6f\\x42\\x02\\x32\\x2c\\x28\\x07\\x45\\x5a\\x15\\x3d\\x77\\x46\\x39\\xd5\\xcc\\x25\\x5e\\x21\\x83\\xb8\\x21\\x18\\xb6\\xaf\\x52\\x92\\xa3\\x47\\x68\\x88\\xea\\x58\\x80\\x56\\x4e\\x1a\\xf2\\xbd\\x4f\\xcc\\x29\\x7f\\x52\\x90\\x6b\\x7d\\xff\\x0f\\x48\\xb4\\x3d\\x3f\\x21\\x7c\\x27\\x21\\xd3\\x2a\\x6e\\x31\\xaa\\x2d\\x53\\xdd\\xf3\\xe3\\x42\\x94\\x54\\xd1\\x77\\x78\\xe2\\x0a\\x76\\x20\\xe3\\x20\\x68\\xcb\\x30\\x86\\x41\\xf3\\x2a\\xc7\\x2b\\xf4\\x78\\x8e\\xfe\\xef\\x90\\x91\\x8a\\xa9\\xc7\\xb1\\x1d\\xc2\\xd8\\x2f\\x0d\\x75\\xed\\xc1\\x4e\\x9c\\xc8\\x25\\x43\\xac\\xa8\\xbe\\xd7\\xcc\\xa9\\xd1\\xa9\\x21\\xa0\\x1a\\xbd\\x04\\x61\\x94\\x34\\x2f\\x18\\xfc\\x3e\\x16\\x50\\x8e\\x4d\\x03\\x6f\\x1c\\x58\\xdb\\x48\\x23\\xbc\\x11\\x82\\x01\\xe1\\xfa\\xd3\\x3a\\x8e\\x30\\xaf\\x18\\x33\\x7f\\xf3\\x8d\\x39\\x11\\x9b\\x57\\xd8\\x2a\\xfd\\x55\\x2a\\x49\\xf9\\x0e\\xc7\\xec\\x37\\xd4\\x25\\xf7\\xec\\x5c\\x66\\xc7\\xd7\\x99\\xaa\\xcf\\x4f\\x89\\x8a\\xd3\\xb7\\x0a\\x3a\\xaa\\x92\\x15\\xf4\\x30\\x6f\\x1c\\xb0\\xd6\\x46\\xe7\\x98\\x39\\x2d\\xa4\\x28\\x40\\x2a\\x3a\\x88\\x9e\\x29\\xba\\x88\\x37\\x2d\\xca\\x60\\x38\\xfa\\xba\\x5b\\x20\\xac\\xa8\\x62\\xb0\\x4c\\xd4\\xaf\\xda\\x45\\x0a\\xba\\x5c\\x3b\\xb9\\xc7\\x79\\xc5\\x14\\x2d\\x18\\x34\\x19\\x1c\\x51\\xdb\\x25\\x4d\\xb4\\x7e\\x06\\x14\\x38\\x6c\\x59\\x55\\xd2\\x77\\xf8\\x69\\x59\\xfc\\x7b\\x73\\xed\\x93\\x43\\xcb\\x32\\x6d\\x3c\\x28\\xdc\\x1b\\x9a\\xd3\\x62\\xab\\xc2\\x27\\xf7\\x41\\xc9\\x08\\x2b\\x23\\x08\\xad\\x13\\x57\\x21\\x9c\\xd3\\x72\\x0d\\x42\\x72\\xf8\\x01\\x7c\\xa7\\xf6\\x83\\xce\\x39\\xd7\\x82\\x3c\\x1f\\x2f\\xd6\\x60\\x1b\\xa2\\xdf\\x35\\x89\\x52\\x20\\xe7\\x73\\x74\\xe0\\x66\\x26\\x64\\x4e\\xb4\\x97\\x58\\xc2\\x0e\\x0e\\xe1\\x60\\x92\\x34\\x6d\\xa0\\x10\\xd6\\xb5\\x83\\x61\\x27\\xe6\\x47\\xd3\\x89\\xbd\\x63\\xfd\\x3b\\x8d\\x03\\x3d\\x6c\\x42\\x2d\\x5b\\x70\\xee\\xe8\\xdf\\x4b\\xf4\\x66\\x4e\\xe1\\x01\\x45\\x17\\x80\\x74\\xad\\x4f\\xc3\\xf3\\xae\\xc6\\x1d\\xc6\\xd7\\xc2\\xce\\xc9\\xe1\\x29\\x30\\x86\\x2f\\x4a\\xa6\\x4b\\x15\\x84\\x73\\xc9\\x6f\\xfd\\x7f\\xa5\\x6e\\x9e\\xbd\\xf1\\xb0\\xd4\\xdd\\x45\\x5a\\xc2\\x3e\\x4b\\x78\\xab\\xa8\\x84\\x74\\x4a\\x91\\x3b\\x92\\x23\\x05\\xf2\\x1c\\x1e\\x7b\\xf3\\x09\\xf8\\xcf\\xab\\x24\\xb6\\x60\\xa2\\xe8\\x4c\\x9f\\x75\\x77\\xaa\\x8c\\xe6\\x01\\x45\\x36\\x86\\xcf\\xc3\\x63\\x3a\\xea\\xd4\\x8d\\x7e\\x06\\xac\\x14\\x0a\\xe0\\x29\\xf0\\xed\\x07\\x22\\x1a\\x65\\xda\\x44\\xae\\xa2\\x73\\x1a\\xe6\\x90\\x69\\xa2\\x8c\\x46\\xb2\\x2f\\xde\\x49\\x38\\x08\\xed\\xfe\\xfd\\x41\\xaf\\x9f\\xa9\\x55\\xd7\\xdd\\x22\\x8d\\xfa\\x45\\x63\\xc5\\x0f\\x80\\xf3\\xb4\\x08\\xd6\\x79\\x30\\x9e\\x93\\xee\\x59\\xa6\\xd0\\x4b\\xee\\x22\\xe3\\x33\\xc1\\x3a\\x27\\x68\\x36\\x78\\x7e\\x87\\x0a\\x06\\xd5\\x2e\\x20\\xd3\\xaf\\x15\\xfb\\xd8\\x3b\\x73\\x14\\xbb\\x92\\xed\\x05\\x5d\\x2e\\x29\\x38\\x2c\\x94\\xe4\\x42\\x45\\x5e\\xd3\\xb5\\x7d\\xdf\\x47\\xca\\x38\\xb4\\x5c\\xaf\\xfb\\x7d\\xdd\\x6d\\xf4\\xa1\\x2d\\x77\\xdd\\x2f\\xce\\x6d\\xc4\\x7b\\x8b\\x4e\\x67\\xa9\\x6f\\xfe\\x04\\x00\\x00\\xff\\xff\\xb1\\xd1\\x27\\x78\\x05\\x11\\x00\\x00\")\n\nfunc jsonschemaDraft04JSONBytes() ([]byte, error) {\n\treturn bindataRead(\n\t\t_jsonschemaDraft04JSON,\n\t\t\"jsonschema-draft-04.json\",\n\t)\n}\n\nfunc jsonschemaDraft04JSON() (*asset, error) {\n\tbytes, err := jsonschemaDraft04JSONBytes()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tinfo := bindataFileInfo{name: \"jsonschema-draft-04.json\", size: 4357, mode: os.FileMode(436), modTime: time.Unix(1540282154, 0)}\n\ta := &asset{bytes: bytes, info: info, digest: [32]uint8{0xe1, 0x48, 0x9d, 0xb, 0x47, 0x55, 0xf0, 0x27, 0x93, 0x30, 0x25, 0x91, 0xd3, 0xfc, 0xb8, 0xf0, 0x7b, 0x68, 0x93, 0xa8, 0x2a, 0x94, 0xf2, 0x48, 0x95, 0xf8, 0xe4, 0xed, 0xf1, 0x1b, 0x82, 0xe2}}\n\treturn a, nil\n}\n\nvar _v2SchemaJSON = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x00\\x00\\x00\\x00\\xff\\xec\\x5d\\x4f\\x93\\xdb\\x36\\xb2\\xbf\\xfb\\x53\\xa0\\x14\\x57\\xd9\\xae\\xd8\\x92\\xe3\\xf7\\x2e\\xcf\\x97\\xd4\\xbc\\xd8\\x49\\x66\\x37\\x5e\\x4f\\x79\\x26\\xbb\\x87\\x78\\x5c\\x05\\x91\\x2d\\x09\\x09\\x09\\x30\\x00\\x38\\x33\\x5a\\xef\\x7c\\xf7\\x2d\\xf0\\x9f\\x08\\x02\\x20\\x41\\x8a\\xd2\\xc8\\x0e\\x0f\\xa9\\x78\\x28\\xa0\\xd1\\xdd\\x68\\x34\\x7e\\xdd\\xf8\\xf7\\xf9\\x11\\x42\\x33\\x49\\x64\\x04\\xb3\\xd7\\x68\\x76\\x86\\xfe\\x76\\xf9\\xfe\\x1f\\xe8\\x32\\xd8\\x40\\x8c\\xd1\\x8a\\x71\\x74\\x79\\x8b\\xd7\\x6b\\xe0\\xe8\\xd5\\xfc\\x25\\x3a\\xbb\\x38\\x9f\\xcf\\x9e\\xab\\x0a\\x24\\x54\\xa5\\x37\\x52\\x26\\xaf\\x17\\x0b\\x91\\x17\\x99\\x13\\xb6\\xb8\\x79\\xb5\\x10\\x59\\xdd\\xf9\\xef\\x82\\xd1\\x6f\\xf2\\xc2\\x8f\\xf3\\x4f\\xb5\\x1a\\xea\\xc7\\x17\\x45\\x41\\xc6\\xd7\\x8b\\x90\\xe3\\x95\\x7c\\xf1\\xf2\\x7f\\x8b\\xca\\x45\\x3d\\xb9\\x4d\\x32\\xa6\\xd8\\xf2\\x77\\x08\\x64\\xfe\\x8d\\xc3\\x9f\\x29\\xe1\\xa0\\x9a\\xff\\xed\\x11\\x42\\x08\\xcd\\x8a\\xd6\\xb3\\x9f\\x15\\x67\\x74\\xc5\\xca\\x7f\\x27\\x58\\x6e\\xc4\\xec\\x11\\x42\\xd7\\x59\\x5d\\x1c\\x86\\x44\\x12\\x46\\x71\\x74\\xc1\\x59\\x02\\x5c\\x12\\x10\\xb3\\xd7\\x68\\x85\\x23\\x01\\x59\\x81\\x04\\x4b\\x09\\x9c\\x6a\\xbf\\x7e\\xce\\x49\\x7d\\xba\\x7b\\x51\\xfd\\xa1\\x44\\xe2\\xb0\\x52\\xac\\x7d\\xb3\\x08\\x61\\x45\\x68\\x46\\x56\\x2c\\x6e\\x80\\x86\\x8c\\xbf\\xbd\\x93\\x40\\x05\\x61\\x74\\x96\\x95\\xbe\\x7f\\x84\\xd0\\x7d\\x4e\\xde\\x42\\xb7\\xe4\\xbe\\x46\\xbb\\x14\\x5b\\x48\\x4e\\xe8\\xba\\x90\\x05\\xa1\\x19\\xd0\\x34\\xae\\xc4\\xce\\xbe\\xbc\\x9a\\xbf\\x9c\\x15\\x7f\\x5d\\x57\\xc5\\x42\\x10\\x01\\x27\\x89\\xe2\\x48\\x51\\xb9\\xda\\x40\\xd5\\x87\\x37\\xc0\\x15\\x5f\\x88\\xad\\x90\\xdc\\x10\\x81\\x42\\x16\\xa4\\x31\\x50\\x39\\x2f\\x38\\xad\\xab\\xb0\\x53\\xd8\\xac\\x94\\x56\\x6f\\xc3\\x84\\xf4\\x11\\xa4\\x50\\xb3\\xfa\\xe9\\xd3\\x6f\\x9f\\x3e\\xdf\\x2f\\xd0\\xeb\\x8f\\x1f\\x3f\\x7e\\xbc\\xfe\\xf6\\xe9\\xf7\\xaf\\x5f\\x7f\\xfc\\x18\\x7e\\xfb\\xec\\xfb\\xc7\\xb3\\x36\\x79\\x54\\x43\\xe8\\x29\\xc5\\x31\\x20\\xc6\\x11\\x49\\x9e\\xe5\\x12\\x41\\x66\\xa0\\xe8\\xed\\x1d\\x8e\\x93\\x08\\x5e\\xa3\\x27\\x3b\\xc3\\x7c\\xa2\\x73\\xba\\xc4\\x02\\x2e\\xb0\\xdc\\xf4\\xe5\\x76\\xd1\\xca\\x96\\xa2\\x8a\\x94\\xcd\\x21\\xc9\\x6c\\xec\\x2c\\x70\\x42\\x9e\\x34\\x74\\x9d\\x19\\x7c\\xcd\\x20\\x9c\\xea\\x2e\\x0a\\xfe\\x42\\x84\\xd4\\x29\\x04\\x8c\\x8a\\xb4\\x41\\xa2\\xc1\\xdc\\x19\\x8a\\x88\\x90\\x4a\\x49\\xef\\xce\\xdf\\xbd\\x45\\x4a\\x52\\x81\\x70\\x10\\x40\\x22\\x21\\x44\\xcb\\x6d\\xc5\\xec\\x4e\\x3c\\x1c\\x45\\xef\\x57\\x9a\\xb5\\x7d\\xae\\xfe\\xe5\\xe4\\x31\\x86\\x90\\xe0\\xab\\x6d\\x02\\x3b\\x2e\\xcb\\x11\\x90\\xd9\\xa8\\xc6\\x77\\xc2\\x59\\x98\\x06\\xfd\\xf9\\x2e\\x78\\x45\\x01\\xa6\\xa8\\xa0\\x71\\x5c\\xbe\\x33\\xa7\\xd2\\xd9\\x5f\\x95\\xef\\xd9\\xd5\\xac\\xfd\\xdc\\x5d\\xbf\\x5e\\xb8\\xd1\\x3e\\xc7\\x31\\x48\\xe0\\x5e\\x4c\\x14\\x65\\xdf\\xb8\\xa8\\x71\\x10\\x09\\xa3\\xc2\\xc7\\x02\\xcb\\xa2\\x4e\\x5a\\x02\\x82\\x94\\x13\\xb9\\xf5\\x30\\xe6\\xb2\\xa4\\xb5\\xfe\\x9b\\x3e\\x7a\\xb2\\x55\\xd2\\xa8\\x4a\\xbc\\x16\\xb6\\x71\\x8e\\x39\\xc7\\xdb\\x9d\\xe1\\x10\\x09\\x71\\xbd\\x9c\\xb3\\x41\\x89\\xd7\\xa5\\x89\\xdc\\x57\\xb5\\x53\\x4a\\xfe\\x4c\\xe1\\xbc\\xa0\\x21\\x79\\x0a\\x1a\\x0f\\x70\\xa7\\x5c\\x08\\x8e\\xde\\xb0\\xc0\\x43\\x24\\xad\\x74\\x63\\x0e\\xb1\\xd9\\x90\\xe1\\xb0\\x2d\\x13\\xa7\\x6d\\x78\\xfd\\x04\\x14\\x38\\x8e\\x90\\xaa\\xce\\x63\\xac\\x3e\\x23\\xbc\\x64\\xa9\\xb4\\xf8\\x03\\x63\\xde\\xcd\\xbe\\x16\\x13\\x4a\\x55\\xac\\x82\\x12\\xc6\\xac\\xd4\\x35\\xf7\\x22\\xd4\\x3a\\xff\\x22\\x73\\x0e\\x6e\\x51\\xa0\\x75\\x1e\\xae\\x8f\\xe8\\x5d\\xc7\\x59\\xe6\\xe4\\x9a\\x18\\x8d\\xd6\\x1c\\x53\\x84\\x4d\\xb7\\x67\\x28\\x37\\x09\\x84\\x69\\x88\\x12\\x0e\\x01\\x11\\x80\\x32\\xa2\\xf5\\xb9\\xaa\\xc6\\xd9\\x73\\x53\\xab\\xfb\\xb4\\x2e\\x20\\xc6\\x54\\x92\\xa0\\x9a\\xf3\\x69\\x1a\\x2f\\x81\\x77\\x37\\xae\\x53\\x1a\\xce\\x40\\xc4\\xa8\\x82\\x1c\\xb5\\xef\\xda\\x24\\x7d\\xb9\\x61\\x69\\x14\\xa2\\x25\\xa0\\x90\\xac\\x56\\xc0\\x81\\x4a\\xb4\\xe2\\x2c\\xce\\x4a\\x64\\x7a\\x9a\\x23\\xf4\\x13\\x91\\x3f\\xa7\\x4b\\xf4\\x63\\x84\\x6f\\x18\\x87\\x10\\xbd\\xc3\\xfc\\x8f\\x90\\xdd\\x52\\x44\\x04\\xc2\\x51\\xc4\\x6e\\x21\\x74\\x48\\x21\\x81\\xc7\\xe2\\xfd\\xea\\x12\\xf8\\x0d\\x09\\xf6\\xe9\\x47\\x35\\xaf\\x67\\xc4\\x14\\xf7\\x22\\x27\\x97\\xe1\\xe2\\x76\\x2d\\x06\\x8c\\x4a\\x1c\\x48\\x3f\\x73\\x2d\\x0b\\x5b\\x29\\x45\\x24\\x00\\x2a\\x0c\\x11\\xec\\x94\\xca\\xc2\\xa6\\xc1\\x37\\x21\\x43\\x83\\x3b\\x5f\\x97\\xf1\\x43\\x5e\\x53\\x73\\x19\\xa5\\x36\\xd8\\x2d\\x05\\x2e\\x34\\x0b\\xeb\\x39\\xfc\\x1d\\x63\\x51\\x01\\xbd\\x3d\\xbb\\x90\\x84\\x40\\x25\\x59\\x6d\\x09\\x5d\\xa3\\x1c\\x37\\xe6\\x5c\\x16\\x9a\\x40\\x09\\x70\\xc1\\xe8\\x82\\xf1\\x35\\xa6\\xe4\\xdf\\x99\\x5c\\x8e\\x9e\\x4d\\x79\\xb4\\x27\\x2f\\xbf\\x7e\\xf8\\x05\\x25\\x8c\\x50\\xa9\\x98\\x29\\x90\\x62\\x60\\xea\\x75\\xae\\x13\\xca\\xbf\\x2b\\x1a\\x29\\x27\\x76\\xd6\\x20\\xc6\\x64\\x5f\\xe6\\x32\\x1a\\x08\\x87\\x21\\x07\\x21\\xbc\\xb4\\xe4\\xe0\\x32\\x67\\xa6\\xcd\\xf3\\x1e\\xcd\\xd9\\x6b\\xb6\\x6f\\x8e\\x27\\xa7\\xed\\xdb\\xe7\\xbc\\xcc\\x1a\\x07\\xce\\x6f\\x87\\x33\\xf0\\xba\\x51\\x17\\x22\\x66\\x78\\x79\\x8e\\xce\\xe5\\x13\\x81\\x80\\x06\\x2c\\xe5\\x78\\x0d\\xa1\\xb2\\xb8\\x54\\xa8\\x79\\x09\\xbd\\xbf\\x3c\\x47\\x01\\x8b\\x13\\x2c\\xc9\\x32\\xaa\\xaa\\x1d\\xd5\\xee\\xab\\x36\\xbd\\x6c\\xfd\\x54\\x6c\\xc8\\x08\\x01\\x3c\\xbd\\xe7\\x07\\x88\\xb0\\x24\\x37\\x79\\x90\\x28\\x4a\\x1d\\x10\\x1a\\x92\\x1b\\x12\\xa6\\x38\\x42\\x40\\xc3\\x4c\\x43\\x62\\x8e\\xae\\x36\\xb0\\x45\\x71\\x2a\\xa4\\x9a\\x23\\x79\\x59\\xb1\\xa8\\xf2\\xa4\\x0c\\x60\\x9f\\xcc\\x8d\\x40\\xf5\\x80\\xca\\xa8\\x99\\xc3\\xa7\\x85\\x1f\\x31\\x25\\xa9\\x82\\xc5\\x6d\\xbd\\xd8\\x36\\x76\\x7c\\x02\\x28\\x97\\xf6\\x1d\\x74\\x3b\\x11\\x7e\\x91\\xae\\x32\\xf8\\x6c\\xf4\\xe6\\x7b\\x9a\\xa5\\x1f\\x62\\xc6\\x21\\xcf\\x9a\\xe5\\xed\\x8b\\x02\\xf3\\x2c\\x33\\x33\\xdf\\x00\\xca\\xc9\\x09\\xb4\\x04\\xf5\\xa5\\x08\\xd7\\xc3\\x02\\x18\\x66\\xf1\\xab\\x1e\\x83\\x37\\x4c\\xcd\\x12\\xc1\\x1d\\x50\\xf6\\xaa\\xbd\\xfe\\xe2\\x73\\x48\\x38\\x08\\xa0\\x32\\x9b\\x18\\x44\\x86\\x0b\\x6a\\xc1\\xaa\\x26\\x96\\x2d\\x96\\x3c\\xa0\\x54\\x65\\x73\\x87\\x15\\xca\\x15\\xe5\\xf5\\x94\\x46\\x9f\\x33\\x1a\\x0c\\x9a\\xb1\\x5a\\xd9\\x6a\\x95\\xcd\\xcb\\x7e\\xec\\x9a\\xc5\\x94\\x3b\\x37\\x26\\x31\\xd7\\xfc\\xe4\\x1f\\x13\\x8c\\x31\\x75\\x9c\\xba\\xf7\\x87\\x3c\\xa1\\xb7\\x4f\\x17\\x1b\\x09\\x82\\x98\\xc4\\x70\\x95\\xd3\\xe8\\x4c\\x48\\x5a\\xa6\\xd6\\x2a\\x3d\\x56\\x42\\x80\\x9f\\xaf\\xae\\x2e\\x50\\x0c\\x42\\xe0\\x35\\x34\\x3c\\x8a\\x62\\x03\\x37\\xba\\xb2\\x27\\x04\\xda\\x25\\x8d\\x06\\xe2\\xa0\\x13\\x8a\\xf3\\xf5\\xec\\x10\\x72\\x67\\x88\\x90\\x3d\\x4b\\x64\\xeb\\xaa\\xda\\x8f\\xf7\\x5a\\x75\\x47\\x9a\\xa8\\x51\\x70\\x26\\xd2\\x38\\xc6\\x7c\\xbb\\x57\\xfc\\xbd\\xe4\\x04\\x56\\xa8\\xa0\\x54\\x9a\\x45\\xd5\\xf7\\x0f\\x16\\xfc\\x57\\x1c\\x3c\\xdf\\x23\\xba\\x77\\x38\\xda\\x16\\x4b\\x31\\x53\\x6a\\x4d\\x9a\\x15\\x63\\xe7\\xe1\\x18\\x69\\x9f\\x22\\xe0\\x24\\xbb\\x94\\x4b\\x97\\xee\\x2d\\xf9\\x70\\x87\\x72\\x7b\\xe6\\xc4\\x33\\x2a\\x66\\x5e\\x1c\\x35\\x72\\xe3\\x2d\\xda\\x73\\xe4\\xc7\\x51\\x6d\\xa4\\xa1\\x2a\\x4f\\xde\\x94\\xcb\\xb2\\x3e\\x31\\x48\\xae\\x82\\xce\\xc9\\xc8\\x65\\xcd\\xc3\\xb7\\x34\\xb6\\x2b\\xdf\\x58\\x65\\x78\\x6e\\x73\\xac\\x5e\\x24\\x0d\\x3f\\xdc\\x70\\x23\\xc6\\xda\\x52\\x0b\\x2d\\x63\\x7d\\xa9\\x49\\x2d\\x54\\x48\\x28\\xc0\\x12\\x9c\\xe3\\x63\\xc9\\x58\\x04\\x98\\x36\\x07\\xc8\\x0a\\xa7\\x91\\xd4\\xf0\\xbc\\xc1\\xa8\\xb9\\x70\\xd0\\xc6\\xa9\\xb6\\x78\\x80\\x5a\\xa3\\xb4\\x2c\\xf4\\x18\\x0b\\x8a\\x9d\\xd0\\xb4\\x55\\x10\\xee\\x0d\\xc5\\xd6\\xe0\\x99\\x93\\xdc\\xa1\\x04\\xbb\\xf1\\xa7\\x23\\xd1\\xd1\\x97\\x8c\\x87\\x13\\x0a\\x21\\x02\\xe9\\x99\\x25\\xed\\x20\\xc5\\x92\\x66\\x3c\\x32\\x9c\\xd6\\x06\\xb0\\x31\\x5c\\x86\\x29\\x0a\\xcb\\x60\\x33\\x12\\xa5\\x91\\xfc\\x96\\x75\\xd0\\x59\\xd7\\x13\\xbd\\xd3\\x23\\x79\\xdd\\x2a\\x90\\xa6\\x38\\x06\\x91\\x39\\x7f\\x20\\x72\\x03\\x1c\\x2d\\x01\\x61\\xba\\x45\\x37\\x38\\x22\\x61\\x8e\\x71\\x85\\xc4\\x32\\x15\\x28\\x60\\x61\\x16\\xb8\\x3d\\x29\\xdc\\x4d\\x3d\\x2f\\x12\\x13\\x7d\\xc8\\x7e\\x37\\xee\\xa8\\x7f\\xfa\\xdb\\xcb\\x17\\xff\\x77\\xfd\\xf9\\x7f\\xee\\x9f\\x3d\\xfe\\xcf\\xa7\\xa7\\x45\\xfb\\xcf\\x1e\\xf7\\xf3\\xe0\\xff\\xc4\\x51\\x0a\\x8e\\x4c\\xcb\\x01\\xdc\\x0a\\x65\\xb2\\x01\\x83\\xed\\x3d\\xe4\\xa9\\xa3\\x4e\\x2d\\x59\\xc5\\xe8\\x2f\\x48\\x7d\\x5a\\x6e\\x37\\xbf\\x5c\\x9f\\x35\\x13\\x64\\x14\\xfa\\xef\\x0b\\x68\\xa6\\x0d\\xb4\\x8e\\xf1\\xa8\\xff\\xbb\\x60\\xf4\\x03\\x64\\xab\\x5b\\x81\\x65\\x51\\xe6\\xda\\xca\\xfa\\xf0\\xb0\\xac\\x3e\\x9c\\xca\\x26\\x0e\\x1d\\xdb\\x57\\x5b\\xbb\\xb4\\x9a\\xa6\\xb6\\x9b\\x1a\\x6b\\xd1\\x9a\\x9e\\x7e\\x33\\x9a\\xec\\x41\\x69\\x45\\x22\\xb8\\xb4\\x51\\xeb\\x04\\x77\\xca\\x6f\\x7b\\x7b\\xc8\\xb2\\xb0\\x95\\x92\\x25\\x5b\\xd0\\x42\\xaa\\x2a\\xdd\\x32\\x78\\x4f\\x0c\\xab\\x68\\x46\\x6c\\xea\\x6d\\xf4\\x5c\\x5e\\xde\\xc4\\xac\\xa5\\xf9\\xd1\\x00\\x9f\\x7d\\x98\\x65\\x24\\xbd\\xc7\\x97\\xd4\\xb3\\x3a\\xa8\\x2b\\xa0\\x34\\x76\\xf9\\x65\\x5f\\x2d\\x25\\x95\\x1b\\xcf\\xd6\\xf4\\x9b\\x5f\\x09\\x95\\xb0\\x36\\x3f\\xdb\\xd0\\x39\\x2a\\x93\\x1c\\x9d\\x03\\xa2\\x4a\\xca\\xf5\\xf6\\x10\\xb6\\x94\\x89\\x0b\\x6a\\x70\\x12\\x13\\x49\\x6e\\x40\\xe4\\x29\\x12\\x2b\\xbd\\x80\\x45\\x11\\x04\\xaa\\xc2\\x8f\\x56\\x9e\\x5c\\x6b\\xec\\x8d\\x5a\\x0e\\x14\\x59\\x06\\x2b\\x1e\\x24\\xcb\\xc2\\x56\\x4a\\x31\\xbe\\x23\\x71\\x1a\\xfb\\x51\\x2a\\x0b\\x3b\\x1c\\x48\\x10\\xa5\\x82\\xdc\\xc0\\xbb\\x3e\\x24\\x8d\\x5a\\x76\\x2e\\x09\\xed\\xc1\\x65\\x51\\xb8\\x83\\xcb\\x3e\\x24\\x8d\\x5a\\x2e\\x5d\\xfe\\x02\\x74\\x2d\\x3d\\xf1\\xef\\xae\\xb8\\x4b\\xe6\\x5e\\xd4\\xaa\\xe2\\x2e\\x5c\\x5e\\xec\\x0e\\xf5\\x5b\\x0c\\xcb\\x0a\\xbb\\xa4\\x3c\\xf7\\x1f\\x2a\\x55\\x69\\x97\\x8c\\x7d\\x68\\x95\\xa5\\xad\\xb4\\xf4\\x9c\\xa5\\x07\\xb9\\x7a\\x05\\xbb\\xad\\x50\\x6f\\xfb\\xa0\\x4e\\x9b\\x48\\x23\\x49\\x92\\x28\\x87\\x19\\x3e\\x32\\xee\\xca\\x3b\\x46\\x7e\\x7f\\x18\\x64\\xcc\\xcc\\x0f\\x34\\xe9\\x36\\x8b\\xb7\\x6c\\xa8\\xa5\\x5b\\x54\\x4c\\x54\\x5b\\x15\\x3a\\xf1\\x6c\\x2d\\xfe\\x96\\xc8\\x0d\\xba\\x7b\\x81\\x88\\xc8\\x23\\xab\\xee\\x7d\\x3b\\x92\\xa7\\x60\\x29\\xe3\\xdc\\xff\\xb8\\x64\\xe1\\xf6\\xa2\\x5a\\x59\\xdc\\x6f\\xeb\\x45\\x7d\\x6a\\xd1\\x76\\x1e\\xea\\xb8\\xf1\\xfa\\x14\\xd3\\x36\\x63\\xe5\\xd7\\xf3\\xe4\\xbe\\x25\\xbd\\x5e\\x05\\xeb\\x73\\x74\\xb5\\x21\\x2a\\x2e\\x4e\\xa3\\x30\\xdf\\xbf\\x43\\x28\\x2a\\xd1\\xa5\\x2a\\x9d\\x8a\\xfd\\x76\\xd8\\x8d\\xbc\\x67\\x65\\xc7\\xb8\\x03\\x45\\xec\\xa3\\xb0\\x37\\x8a\\x70\\x4c\\x68\\x91\\x51\\x8e\\x58\\x80\\xed\\x4a\\xf3\\x81\\x62\\xca\\x96\\xbb\\xf1\\x52\\xcd\\x80\\xfb\\xe4\\x4a\\x5d\\x6c\\xdf\\x6e\\x20\\x4b\\x80\\x30\\x8e\\x28\\x93\\xf9\\xe9\\x8d\\x8a\\x6d\\xd5\\x59\\x65\\x7b\\xaa\\x44\\x9e\\xc0\\xc2\\xd1\\x7c\\x40\\x26\\xd6\\x1a\\xce\\xf9\\xc5\\x69\\x7b\\x6c\\xec\\xc8\\x71\\x7b\\xe5\\x21\\x2e\\xd3\\xe5\\x65\\x93\\x91\\x53\\x0b\\x7b\\x3a\\xc7\\xfa\\x17\\x6a\\x01\\xa7\\x33\\xd0\\xf4\\x40\\x0f\\x39\\x87\\xda\\xe4\\x54\\x87\\x3a\\xd5\\xe3\\xc7\\xa6\\x8e\\x20\\xd4\\x11\\xb2\\x4e\\xb1\\xe9\\x14\\x9b\\x4e\\xb1\\xe9\\x14\\x9b\\xfe\\x15\\x63\\xd3\\x47\\xf5\\xff\\x97\\x38\\xe9\\xcf\\x14\\xf8\\x76\\x82\\x49\\x13\\x4c\\xaa\\x7d\\xcd\\x6c\\x62\\x42\\x49\\x87\\x43\\x49\\x19\\x33\\x6f\\xe3\\x44\\x6e\\x9b\\xab\\x8a\\x3e\\x86\\xaa\\x99\\x52\\x1b\\x5b\\x59\\x33\\x02\\x09\\xa0\\x21\\xa1\\x6b\\x84\\x6b\\x66\\xbb\\xdc\\x16\\x0c\\xd3\\x68\\xab\\xec\\x36\\x4b\\xd8\\x60\\x8a\\x40\\x31\\x85\\x6e\\x14\\x57\\x13\\xc2\\xfb\\x92\\x10\\xde\\xbf\\x88\\xdc\\xbc\\x53\\x5e\\x7f\\x82\\x7a\\x13\\xd4\\x9b\\xa0\\xde\\x04\\xf5\\x90\\x01\\xf5\\x94\\xcb\\x7b\\x83\\x25\\x9e\\xd0\\xde\\x84\\xf6\\x6a\\x5f\\x4b\\xb3\\x98\\x00\\xdf\\x04\\xf8\\x6c\\xbc\\x7f\\x19\\x80\\xaf\\xf1\\x71\\x45\\x22\\x98\\x40\\xe0\\x04\\x02\\x27\\x10\\xd8\\x29\\xf5\\x04\\x02\\xff\\x4a\\x20\\x30\\xc1\\x72\\xf3\\x65\\x02\\x40\\xd7\\xc1\\xd1\\xe2\\x6b\\xf1\\xa9\\x7b\\xfb\\xe4\\x20\\xc0\\x68\\x9d\\xd4\\xb4\\xd3\\x96\\xb5\\xa6\\xd1\\x41\\x20\\xe6\\x89\\xc3\\x48\\x65\\x58\\x13\\x84\\x9c\\x56\\x56\\x3b\\x0c\\xe0\\x6b\\x83\\x5c\\x13\\xd2\\x9a\\x90\\xd6\\x84\\xb4\\x26\\xa4\\x85\\x0c\\xa4\\x45\\x19\\xfd\\xff\\x63\\x6c\\x52\\xb5\\x1f\\x1e\\x19\\x74\\x3a\\xcd\\xb9\\x69\\xce\\xa6\\x3a\\x0f\\x7a\\x2d\\x19\\xc7\\x81\\x14\\x5d\\xcb\\xd5\\x03\\xc9\\x39\\xd0\\xb0\\xd1\\xb3\\xcd\\xfb\\x7a\\x2d\\x5d\\x3a\\x48\\xe1\\xfa\\x2e\\xe6\\x81\\x42\\x18\\x86\\xd6\\xc1\\xbe\\xb1\\x23\\xd3\\xf7\\x34\\xed\\x19\\x0a\\x0b\\xc4\\x48\\x44\\xfd\\x22\\x50\\xb6\\x42\\x58\\xbb\\xe5\\x3d\\xa7\\x73\\xd4\\x8b\\xc4\\x8c\\x70\\x61\\xec\\x73\\xee\\xc3\\x81\\x8b\\xf5\\xe2\\xd7\\x52\\x3e\\xcf\\xeb\\xeb\\x17\\x3b\\x71\\x16\\xda\\x7d\\xb8\\xde\\xf0\\x7a\\x8f\\x06\\x2d\\xa7\\x40\\x7b\\xc1\\x9d\\x41\\x4d\\xb6\\x61\\xa2\\x4e\\x9f\\x3d\\xa0\\xc5\\xae\\xe3\\x1c\\x1d\\x40\\x6c\\x48\\x8b\\x63\\xa0\\xb5\\x01\\xed\\x8e\\x02\\xe9\\x86\\xc8\\x3b\\x06\\xee\\xdb\\x4b\\xde\\xbd\\xc0\\xa1\\x6f\\xcb\\xda\\xfc\\xc2\\x44\\x16\\x87\\x9c\\x17\\x31\\xd3\\x30\\x20\\x39\\x42\\xcb\\x6f\\xf2\\xf1\\xf4\\x72\\x10\\xf8\\x1c\\xa0\\xf3\\xbd\\x10\\xea\\x21\\x35\\x7d\\xe8\\x86\\xdb\\x15\\xed\\x81\\x81\\x07\\x28\\xbb\\x13\\x28\\xc7\\xf8\\xce\\x7d\\x8d\\xc2\\x31\\xb4\\x7e\\x94\\xd6\\xdb\\x55\\xef\\x4a\\xfb\\xed\\xc3\\x40\\x3e\\xeb\\x9f\\xe9\\x99\\x0f\\xdf\\x08\\x65\\x88\\x27\\x73\\x86\\x31\\x9d\\x47\\xdf\\x55\\x19\\xba\\x3d\\xee\\x15\\x0a\\xcd\\x8c\\xaa\\x5e\\xb9\\xf6\\x57\\x33\\x73\\x5a\\xa1\\x89\\x7b\\x3b\\xa0\\xb2\\xa4\\xc2\\xf6\\xc1\\x53\\xb5\\x00\\xca\\x23\\xe5\\xf4\\x60\\x6a\\xb4\\x2d\\x74\\xea\\x4e\\xed\\x3b\\xe3\\x47\\xfb\\xed\\x82\\x3d\\x19\\xd4\\x3b\\x6b\\xaf\\xae\\x2b\\x2f\\x57\\xb3\\x82\\x68\\xcb\\xed\\x88\\x2e\\xe1\\x5c\\xd7\\x26\\xfa\\x0a\\x65\\xe7\\xce\\x11\\x33\\xb4\\xdd\\x66\\xe3\\x37\\xf6\\xfa\\x70\\xd6\\x4f\\xa1\\x21\\x51\\xd8\\x3c\\x26\\x14\\x4b\\xc6\\x87\\x44\\x27\\x1c\\x70\\xf8\\x9e\\x46\\xce\\xab\\x21\\x07\\x5f\\xc1\\x76\\x17\\x1b\\x77\\xb4\\xda\\x75\\xa0\\x0a\\x3a\\x30\\xe1\\xf8\\x97\\x32\\x16\\x2b\\x00\\x75\\x85\\xee\\x62\\x46\\xef\\xd3\\x85\\xb5\\x6b\\x60\\xbe\\xf2\\x30\\x7a\\x8c\\x0b\\x4b\\xa6\\xd0\\xf9\\x64\\x42\\xe7\\x07\\x41\\x41\\xe3\\x2c\\x5d\\xf9\\x6d\\xe9\\x39\\x98\\x3b\\x3b\\x5d\\x67\\xd4\\x5c\\xed\\xf2\\xf0\\x48\\x7b\\xbd\\x2d\\x31\\xdd\\x3f\\x34\\xad\\x44\\x76\\x51\\x9a\\x56\\x22\\xa7\\x95\\xc8\\x69\\x25\\xf2\\xe1\\x56\\x22\\x1f\\x00\\x32\\x6a\\x73\\x92\\xed\\xe1\\xc6\\x7d\\x9f\\x49\\x2c\\x69\\x7e\\xc8\\x31\\x4c\\x0c\\xb4\\xf2\\x54\\x3b\\x79\\x3b\\x9e\\x4d\\xb4\\xd1\\x18\\x3e\\x5f\\x9a\\x93\\xa2\\x11\\xc3\\xda\\x27\\x0b\\xaf\\x37\\x2e\\x5c\\x37\\xfb\\xeb\\x9a\\xd6\\xc3\\xac\\xc3\\xcc\\xf8\\x1e\\x5b\\x9d\\xac\\x22\\x64\\xb7\\xed\\x26\\xb8\\xf3\\xb9\\x3c\\xbb\\x1f\\xe2\\xb0\\x22\\x77\\x43\\x6a\\x62\\x29\\x39\\x59\\xa6\\xe6\\xe5\\xcd\\x7b\\x83\\xc0\\x5b\\x8e\\x93\\x64\\xac\\xeb\\xca\\x4f\\x65\\xac\\x4a\\xbc\\x1e\\xcd\\x82\\xfa\\x3c\\x70\\x36\\xb6\\xb5\\xed\\x79\\xef\\xec\\x68\\x00\\xff\\x54\\xfa\\xb5\\xe3\\xf1\\xdb\\xe1\\xbe\\xce\\x76\\x17\\xaf\\x57\\xb6\\x6b\\x89\\x05\\x09\\xce\\x52\\xb9\\x01\\x2a\\x49\\xbe\\xd9\\xf4\\xd2\\xb8\\x7a\\xbf\\x91\\x02\\xf3\\x22\\x8c\\x13\\xf2\\x77\\xd8\\x8e\\x43\\x8b\\xe1\\x54\\x6e\\x5e\\x9d\\xc7\\x49\\x44\\x02\\x22\\xc7\\xa4\\x79\\x81\\x85\\xb8\\x65\\x3c\\x1c\\x93\\xe6\\x59\\xa2\\xf8\\x1c\\x51\\x95\\x05\\xd9\\x20\\x00\\x21\\x7e\\x60\\x21\\x58\\xa9\\x56\\xff\\xbe\\xb6\\x5a\\x5e\\x5b\\x3f\\x1f\\xd6\\xd3\\x3c\\xc4\\x4d\\xba\\x99\\xb4\\x63\\x6e\\x7d\\x3e\\x3d\\x57\\xd2\\x18\\x5f\\x47\\xe8\\xc3\\x06\\x8a\\x68\\x6c\\x7f\\x3b\\x72\\x0f\\xe7\\xe2\\x77\\x77\\xf1\\xd0\\x99\\xab\\xdf\\x2e\\xfe\\xd6\\xbb\\xcd\\x1a\\xb9\\x90\\xd1\\xaf\\xf2\\x38\\x3d\\xdb\\x74\\xf8\\xeb\\xe3\\xda\\xe8\\x2a\\x62\\xb7\\xda\\x1b\\x07\\xa9\\xdc\\x30\\x5e\\xbc\\x68\\xfb\\x6b\\x9f\\x97\\xf1\\xc6\\xb1\\xd8\\x5c\\x29\\x1e\\x49\\x30\\xc5\\xf7\\xde\\xad\\x91\\x42\\xf9\\xdd\\xed\\x89\\x80\\x25\\xbe\\x37\\xd7\\xe7\\x32\\x5c\\xe6\\x35\\xac\\xd4\\x0c\\x2d\\xf7\\x90\\xc4\\xe3\\xf5\\xe3\\x2f\\x7f\\x54\\x18\\x88\\xe3\\x61\\x47\\x85\\x64\\x7f\\xc0\\xd7\\x3f\\x1a\\x92\\x42\\xe9\\xc7\\x1e\\x0d\\x95\\x76\\xa7\\x51\\xa0\\x8f\\x02\\x1b\\x46\\x9e\\x06\\x42\\xd1\\xf2\\x01\\x07\\x02\\xde\\xe9\\x7d\\x1a\\x0b\\xa7\\x32\\x16\\xcc\\xc0\\xee\\xc4\\x90\\xd2\\x5f\\x6f\\x98\\x54\\x5d\\xf2\\x95\\xe1\\xa7\\x69\\x10\\x3a\\x06\\xe1\\x65\\xb3\\x17\\x47\\x58\\x78\\xd0\\x45\\xd6\\x5b\\xd5\\x5f\\x25\\x1d\\x71\\x49\\xa6\\x7a\\x64\\xda\\xd0\\x6f\\xc7\\x3a\\x4c\\xe3\\x09\\xc0\\x6e\\x96\\x2c\\xa7\\xa7\\x77\\x34\\x10\\x05\\x08\\x21\\x44\\x92\\x65\\x77\\xdf\\x20\\x5c\\xbc\\xe7\\x97\\x3f\\xf4\\x1a\\x45\\xd6\\xe7\\x27\\x4a\\xde\\x74\\x27\\x66\\x11\\x7d\\x70\\xba\\xd3\\x78\\xf9\\x1e\\x0d\\xca\\xc8\\x39\\xde\\x7c\\xb3\\xa6\\xe1\\xbc\\xd7\\xc1\\x6a\\x6f\\xb3\\x0e\\x52\\xbe\\xe4\\x98\\x8a\\x15\\x70\\x94\\x70\\x26\\x59\\xc0\\xa2\\xf2\\x1c\\xfb\\xd9\\xc5\\xf9\\xbc\\xd5\\x92\\x9c\\xa3\\xdf\\xe6\\x1e\\xb3\\x0d\\x49\\xba\\x87\\x50\\x5f\\x84\\xfe\\xe9\\xd6\\xf8\\xbb\\xe6\\xf0\\x7a\\xeb\\xa6\\x65\\x3b\\x86\\x8b\\x79\\x93\\xf5\\x59\\x20\\x6e\\xb4\\xa7\\x44\\xf4\\x3f\\xa5\\xfe\\x67\\x42\\x12\\xdb\\xd3\\xe7\\xbb\\xa5\\xa3\\x8c\\x5c\\x2b\\x97\\xbb\\xbb\\x7f\\x8e\\xc5\\x6e\\xed\\x43\\x5c\\xbf\\x74\\xc8\\x8f\\xff\\xe6\\xd6\\xbe\\x91\\xb6\\xf5\\x95\\xe4\\xed\\x93\\xc4\\xa8\\x5b\\xf9\\x76\\x4d\\x35\\xb7\\xd8\\x8c\\xb6\\x7d\\xaf\\x72\\xe0\\xb6\\xbd\\x01\\x63\\x9e\\x76\\xab\\x1a\\x32\\x76\\xe4\\x8c\\x76\\xc2\\xad\\x6c\\xa2\\x65\\xf7\\xcf\\xf8\\xa7\\xda\\x2a\\xb9\\x8c\\x3d\\x3c\\xa3\\x9d\\x64\\x33\\xe5\\x1a\\xb5\\x2d\\xfb\\x86\\xa2\\x5a\\x7f\\x19\\x5b\\x7f\\xc6\\x3f\\xd1\\x53\\xd3\\xe2\\x41\\x5b\\xd3\\x4f\\xf0\\xec\\xb0\\x42\\x73\\x43\\xd2\\x68\\x27\\xd3\\x6a\\x6a\\x34\\xf6\\x4e\\x1e\\x52\\x8b\\x87\\x6c\\xcc\\xae\\x44\\xfb\\x9e\\xa7\\x51\\x4f\\x9d\\x55\\x03\\x81\\x8e\\x67\\xfc\\xb4\\x69\\xf0\\x3a\\x18\\xf2\\x40\\xd0\\xf6\\xa8\\x34\\xe3\\xc9\\x98\\xaf\\xf6\\xda\\x24\\xd3\\xeb\\x60\\xb9\\x0e\\xd3\\x1f\\xa9\\xff\\xee\\x1f\\xfd\\x37\\x00\\x00\\xff\\xff\\x69\\x5d\\x0a\\x6a\\x39\\x9d\\x00\\x00\")\n\nfunc v2SchemaJSONBytes() ([]byte, error) {\n\treturn bindataRead(\n\t\t_v2SchemaJSON,\n\t\t\"v2/schema.json\",\n\t)\n}\n\nfunc v2SchemaJSON() (*asset, error) {\n\tbytes, err := v2SchemaJSONBytes()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tinfo := bindataFileInfo{name: \"v2/schema.json\", size: 40249, mode: os.FileMode(436), modTime: time.Unix(1540282154, 0)}\n\ta := &asset{bytes: bytes, info: info, digest: [32]uint8{0xcb, 0x25, 0x27, 0xe8, 0x46, 0xae, 0x22, 0xc4, 0xf4, 0x8b, 0x1, 0x32, 0x4d, 0x1f, 0xf8, 0xdf, 0x75, 0x15, 0xc8, 0x2d, 0xc7, 0xed, 0xe, 0x7e, 0x0, 0x75, 0xc0, 0xf9, 0xd2, 0x1f, 0x75, 0x57}}\n\treturn a, nil\n}\n\n// Asset loads and returns the asset for the given name.\n// It returns an error if the asset could not be found or\n// could not be loaded.\nfunc Asset(name string) ([]byte, error) {\n\tcanonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n\tif f, ok := _bindata[canonicalName]; ok {\n\t\ta, err := f()\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"Asset %s can't read by error: %v\", name, err)\n\t\t}\n\t\treturn a.bytes, nil\n\t}\n\treturn nil, fmt.Errorf(\"Asset %s not found\", name)\n}\n\n// AssetString returns the asset contents as a string (instead of a []byte).\nfunc AssetString(name string) (string, error) {\n\tdata, err := Asset(name)\n\treturn string(data), err\n}\n\n// MustAsset is like Asset but panics when Asset would return an error.\n// It simplifies safe initialization of global variables.\nfunc MustAsset(name string) []byte {\n\ta, err := Asset(name)\n\tif err != nil {\n\t\tpanic(\"asset: Asset(\" + name + \"): \" + err.Error())\n\t}\n\n\treturn a\n}\n\n// MustAssetString is like AssetString but panics when Asset would return an\n// error. It simplifies safe initialization of global variables.\nfunc MustAssetString(name string) string {\n\treturn string(MustAsset(name))\n}\n\n// AssetInfo loads and returns the asset info for the given name.\n// It returns an error if the asset could not be found or\n// could not be loaded.\nfunc AssetInfo(name string) (os.FileInfo, error) {\n\tcanonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n\tif f, ok := _bindata[canonicalName]; ok {\n\t\ta, err := f()\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"AssetInfo %s can't read by error: %v\", name, err)\n\t\t}\n\t\treturn a.info, nil\n\t}\n\treturn nil, fmt.Errorf(\"AssetInfo %s not found\", name)\n}\n\n// AssetDigest returns the digest of the file with the given name. It returns an\n// error if the asset could not be found or the digest could not be loaded.\nfunc AssetDigest(name string) ([sha256.Size]byte, error) {\n\tcanonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n\tif f, ok := _bindata[canonicalName]; ok {\n\t\ta, err := f()\n\t\tif err != nil {\n\t\t\treturn [sha256.Size]byte{}, fmt.Errorf(\"AssetDigest %s can't read by error: %v\", name, err)\n\t\t}\n\t\treturn a.digest, nil\n\t}\n\treturn [sha256.Size]byte{}, fmt.Errorf(\"AssetDigest %s not found\", name)\n}\n\n// Digests returns a map of all known files and their checksums.\nfunc Digests() (map[string][sha256.Size]byte, error) {\n\tmp := make(map[string][sha256.Size]byte, len(_bindata))\n\tfor name := range _bindata {\n\t\ta, err := _bindata[name]()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tmp[name] = a.digest\n\t}\n\treturn mp, nil\n}\n\n// AssetNames returns the names of the assets.\nfunc AssetNames() []string {\n\tnames := make([]string, 0, len(_bindata))\n\tfor name := range _bindata {\n\t\tnames = append(names, name)\n\t}\n\treturn names\n}\n\n// _bindata is a table, holding each asset generator, mapped to its name.\nvar _bindata = map[string]func() (*asset, error){\n\t\"jsonschema-draft-04.json\": jsonschemaDraft04JSON,\n\n\t\"v2/schema.json\": v2SchemaJSON,\n}\n\n// AssetDir returns the file names below a certain\n// directory embedded in the file by go-bindata.\n// For example if you run go-bindata on data/... and data contains the\n// following hierarchy:\n// data/\n// foo.txt\n// img/\n// a.png\n// b.png\n// then AssetDir(\"data\") would return []string{\"foo.txt\", \"img\"},\n// AssetDir(\"data/img\") would return []string{\"a.png\", \"b.png\"},\n// AssetDir(\"foo.txt\") and AssetDir(\"notexist\") would return an error, and\n// AssetDir(\"\") will return []string{\"data\"}.\nfunc AssetDir(name string) ([]string, error) {\n\tnode := _bintree\n\tif len(name) != 0 {\n\t\tcanonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n\t\tpathList := strings.Split(canonicalName, \"/\")\n\t\tfor _, p := range pathList {\n\t\t\tnode = node.Children[p]\n\t\t\tif node == nil {\n\t\t\t\treturn nil, fmt.Errorf(\"Asset %s not found\", name)\n\t\t\t}\n\t\t}\n\t}\n\tif node.Func != nil {\n\t\treturn nil, fmt.Errorf(\"Asset %s not found\", name)\n\t}\n\trv := make([]string, 0, len(node.Children))\n\tfor childName := range node.Children {\n\t\trv = append(rv, childName)\n\t}\n\treturn rv, nil\n}\n\ntype bintree struct {\n\tFunc func() (*asset, error)\n\tChildren map[string]*bintree\n}\n\nvar _bintree = &bintree{nil, map[string]*bintree{\n\t\"jsonschema-draft-04.json\": &bintree{jsonschemaDraft04JSON, map[string]*bintree{}},\n\t\"v2\": &bintree{nil, map[string]*bintree{\n\t\t\"schema.json\": &bintree{v2SchemaJSON, map[string]*bintree{}},\n\t}},\n}}\n\n// RestoreAsset restores an asset under the given directory.\nfunc RestoreAsset(dir, name string) error {\n\tdata, err := Asset(name)\n\tif err != nil {\n\t\treturn err\n\t}\n\tinfo, err := AssetInfo(name)\n\tif err != nil {\n\t\treturn err\n\t}\n\terr = os.MkdirAll(_filePath(dir, filepath.Dir(name)), os.FileMode(0755))\n\tif err != nil {\n\t\treturn err\n\t}\n\terr = ioutil.WriteFile(_filePath(dir, name), data, info.Mode())\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn os.Chtimes(_filePath(dir, name), info.ModTime(), info.ModTime())\n}\n\n// RestoreAssets restores an asset under the given directory recursively.\nfunc RestoreAssets(dir, name string) error {\n\tchildren, err := AssetDir(name)\n\t// File\n\tif err != nil {\n\t\treturn RestoreAsset(dir, name)\n\t}\n\t// Dir\n\tfor _, child := range children {\n\t\terr = RestoreAssets(dir, filepath.Join(name, child))\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc _filePath(dir, name string) string {\n\tcanonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n\treturn filepath.Join(append([]string{dir}, strings.Split(canonicalName, \"/\")...)...)\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/cache.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport \"sync\"\n\n// ResolutionCache a cache for resolving urls\ntype ResolutionCache interface {\n\tGet(string) (interface{}, bool)\n\tSet(string, interface{})\n}\n\ntype simpleCache struct {\n\tlock sync.RWMutex\n\tstore map[string]interface{}\n}\n\n// Get retrieves a cached URI\nfunc (s *simpleCache) Get(uri string) (interface{}, bool) {\n\tdebugLog(\"getting %q from resolution cache\", uri)\n\ts.lock.RLock()\n\tv, ok := s.store[uri]\n\tdebugLog(\"got %q from resolution cache: %t\", uri, ok)\n\n\ts.lock.RUnlock()\n\treturn v, ok\n}\n\n// Set caches a URI\nfunc (s *simpleCache) Set(uri string, data interface{}) {\n\ts.lock.Lock()\n\ts.store[uri] = data\n\ts.lock.Unlock()\n}\n\nvar resCache ResolutionCache\n\nfunc init() {\n\tresCache = initResolutionCache()\n}\n\n// initResolutionCache initializes the URI resolution cache\nfunc initResolutionCache() ResolutionCache {\n\treturn &simpleCache{store: map[string]interface{}{\n\t\t\"http://swagger.io/v2/schema.json\": MustLoadSwagger20Schema(),\n\t\t\"http://json-schema.org/draft-04/schema\": MustLoadJSONSchemaDraft04(),\n\t}}\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/contact_info.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\n// ContactInfo contact information for the exposed API.\n//\n// For more information: http://goo.gl/8us55a#contactObject\ntype ContactInfo struct {\n\tName string `json:\"name,omitempty\"`\n\tURL string `json:\"url,omitempty\"`\n\tEmail string `json:\"email,omitempty\"`\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/debug.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"runtime\"\n)\n\nvar (\n\t// Debug is true when the SWAGGER_DEBUG env var is not empty.\n\t// It enables a more verbose logging of this package.\n\tDebug = os.Getenv(\"SWAGGER_DEBUG\") != \"\"\n\t// specLogger is a debug logger for this package\n\tspecLogger *log.Logger\n)\n\nfunc init() {\n\tdebugOptions()\n}\n\nfunc debugOptions() {\n\tspecLogger = log.New(os.Stdout, \"spec:\", log.LstdFlags)\n}\n\nfunc debugLog(msg string, args ...interface{}) {\n\t// A private, trivial trace logger, based on go-openapi/spec/expander.go:debugLog()\n\tif Debug {\n\t\t_, file1, pos1, _ := runtime.Caller(1)\n\t\tspecLogger.Printf(\"%s:%d: %s\", filepath.Base(file1), pos1, fmt.Sprintf(msg, args...))\n\t}\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/expander.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"strings\"\n)\n\n// ExpandOptions provides options for spec expand\ntype ExpandOptions struct {\n\tRelativeBase string\n\tSkipSchemas bool\n\tContinueOnError bool\n\tAbsoluteCircularRef bool\n}\n\n// ResolveRefWithBase resolves a reference against a context root with preservation of base path\nfunc ResolveRefWithBase(root interface{}, ref *Ref, opts *ExpandOptions) (*Schema, error) {\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tspecBasePath := \"\"\n\tif opts != nil && opts.RelativeBase != \"\" {\n\t\tspecBasePath, _ = absPath(opts.RelativeBase)\n\t}\n\n\tresult := new(Schema)\n\tif err := resolver.Resolve(ref, result, specBasePath); err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// ResolveRef resolves a reference against a context root\n// ref is guaranteed to be in root (no need to go to external files)\n// ResolveRef is ONLY called from the code generation module\nfunc ResolveRef(root interface{}, ref *Ref) (*Schema, error) {\n\tres, _, err := ref.GetPointer().Get(root)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tswitch sch := res.(type) {\n\tcase Schema:\n\t\treturn &sch, nil\n\tcase *Schema:\n\t\treturn sch, nil\n\tcase map[string]interface{}:\n\t\tb, _ := json.Marshal(sch)\n\t\tnewSch := new(Schema)\n\t\t_ = json.Unmarshal(b, newSch)\n\t\treturn newSch, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"unknown type for the resolved reference\")\n\t}\n}\n\n// ResolveParameter resolves a parameter reference against a context root\nfunc ResolveParameter(root interface{}, ref Ref) (*Parameter, error) {\n\treturn ResolveParameterWithBase(root, ref, nil)\n}\n\n// ResolveParameterWithBase resolves a parameter reference against a context root and base path\nfunc ResolveParameterWithBase(root interface{}, ref Ref, opts *ExpandOptions) (*Parameter, error) {\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tresult := new(Parameter)\n\tif err := resolver.Resolve(&ref, result, \"\"); err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// ResolveResponse resolves response a reference against a context root\nfunc ResolveResponse(root interface{}, ref Ref) (*Response, error) {\n\treturn ResolveResponseWithBase(root, ref, nil)\n}\n\n// ResolveResponseWithBase resolves response a reference against a context root and base path\nfunc ResolveResponseWithBase(root interface{}, ref Ref, opts *ExpandOptions) (*Response, error) {\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tresult := new(Response)\n\tif err := resolver.Resolve(&ref, result, \"\"); err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// ResolveItems resolves parameter items reference against a context root and base path.\n//\n// NOTE: stricly speaking, this construct is not supported by Swagger 2.0.\n// Similarly, $ref are forbidden in response headers.\nfunc ResolveItems(root interface{}, ref Ref, opts *ExpandOptions) (*Items, error) {\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tbasePath := \"\"\n\tif opts.RelativeBase != \"\" {\n\t\tbasePath = opts.RelativeBase\n\t}\n\tresult := new(Items)\n\tif err := resolver.Resolve(&ref, result, basePath); err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// ResolvePathItem resolves response a path item against a context root and base path\nfunc ResolvePathItem(root interface{}, ref Ref, opts *ExpandOptions) (*PathItem, error) {\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tbasePath := \"\"\n\tif opts.RelativeBase != \"\" {\n\t\tbasePath = opts.RelativeBase\n\t}\n\tresult := new(PathItem)\n\tif err := resolver.Resolve(&ref, result, basePath); err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// ExpandSpec expands the references in a swagger spec\nfunc ExpandSpec(spec *Swagger, options *ExpandOptions) error {\n\tresolver, err := defaultSchemaLoader(spec, options, nil, nil)\n\t// Just in case this ever returns an error.\n\tif resolver.shouldStopOnError(err) {\n\t\treturn err\n\t}\n\n\t// getting the base path of the spec to adjust all subsequent reference resolutions\n\tspecBasePath := \"\"\n\tif options != nil && options.RelativeBase != \"\" {\n\t\tspecBasePath, _ = absPath(options.RelativeBase)\n\t}\n\n\tif options == nil || !options.SkipSchemas {\n\t\tfor key, definition := range spec.Definitions {\n\t\t\tvar def *Schema\n\t\t\tvar err error\n\t\t\tif def, err = expandSchema(definition, []string{fmt.Sprintf(\"#/definitions/%s\", key)}, resolver, specBasePath); resolver.shouldStopOnError(err) {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif def != nil {\n\t\t\t\tspec.Definitions[key] = *def\n\t\t\t}\n\t\t}\n\t}\n\n\tfor key := range spec.Parameters {\n\t\tparameter := spec.Parameters[key]\n\t\tif err := expandParameterOrResponse(¶meter, resolver, specBasePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\tspec.Parameters[key] = parameter\n\t}\n\n\tfor key := range spec.Responses {\n\t\tresponse := spec.Responses[key]\n\t\tif err := expandParameterOrResponse(&response, resolver, specBasePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\tspec.Responses[key] = response\n\t}\n\n\tif spec.Paths != nil {\n\t\tfor key := range spec.Paths.Paths {\n\t\t\tpath := spec.Paths.Paths[key]\n\t\t\tif err := expandPathItem(&path, resolver, specBasePath); resolver.shouldStopOnError(err) {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tspec.Paths.Paths[key] = path\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// baseForRoot loads in the cache the root document and produces a fake \"root\" base path entry\n// for further $ref resolution\nfunc baseForRoot(root interface{}, cache ResolutionCache) string {\n\t// cache the root document to resolve $ref's\n\tconst rootBase = \"root\"\n\tif root != nil {\n\t\tbase, _ := absPath(rootBase)\n\t\tnormalizedBase := normalizeAbsPath(base)\n\t\tdebugLog(\"setting root doc in cache at: %s\", normalizedBase)\n\t\tif cache == nil {\n\t\t\tcache = resCache\n\t\t}\n\t\tcache.Set(normalizedBase, root)\n\t\treturn rootBase\n\t}\n\treturn \"\"\n}\n\n// ExpandSchema expands the refs in the schema object with reference to the root object\n// go-openapi/validate uses this function\n// notice that it is impossible to reference a json schema in a different file other than root\nfunc ExpandSchema(schema *Schema, root interface{}, cache ResolutionCache) error {\n\topts := &ExpandOptions{\n\t\t// when a root is specified, cache the root as an in-memory document for $ref retrieval\n\t\tRelativeBase: baseForRoot(root, cache),\n\t\tSkipSchemas: false,\n\t\tContinueOnError: false,\n\t\t// when no base path is specified, remaining $ref (circular) are rendered with an absolute path\n\t\tAbsoluteCircularRef: true,\n\t}\n\treturn ExpandSchemaWithBasePath(schema, cache, opts)\n}\n\n// ExpandSchemaWithBasePath expands the refs in the schema object, base path configured through expand options\nfunc ExpandSchemaWithBasePath(schema *Schema, cache ResolutionCache, opts *ExpandOptions) error {\n\tif schema == nil {\n\t\treturn nil\n\t}\n\n\tvar basePath string\n\tif opts.RelativeBase != \"\" {\n\t\tbasePath, _ = absPath(opts.RelativeBase)\n\t}\n\n\tresolver, err := defaultSchemaLoader(nil, opts, cache, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\trefs := []string{\"\"}\n\tvar s *Schema\n\tif s, err = expandSchema(*schema, refs, resolver, basePath); err != nil {\n\t\treturn err\n\t}\n\t*schema = *s\n\treturn nil\n}\n\nfunc expandItems(target Schema, parentRefs []string, resolver *schemaLoader, basePath string) (*Schema, error) {\n\tif target.Items != nil {\n\t\tif target.Items.Schema != nil {\n\t\t\tt, err := expandSchema(*target.Items.Schema, parentRefs, resolver, basePath)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\t*target.Items.Schema = *t\n\t\t}\n\t\tfor i := range target.Items.Schemas {\n\t\t\tt, err := expandSchema(target.Items.Schemas[i], parentRefs, resolver, basePath)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\ttarget.Items.Schemas[i] = *t\n\t\t}\n\t}\n\treturn &target, nil\n}\n\nfunc expandSchema(target Schema, parentRefs []string, resolver *schemaLoader, basePath string) (*Schema, error) {\n\tif target.Ref.String() == \"\" && target.Ref.IsRoot() {\n\t\t// normalizing is important\n\t\tnewRef := normalizeFileRef(&target.Ref, basePath)\n\t\ttarget.Ref = *newRef\n\t\treturn &target, nil\n\n\t}\n\n\t// change the base path of resolution when an ID is encountered\n\t// otherwise the basePath should inherit the parent's\n\t// important: ID can be relative path\n\tif target.ID != \"\" {\n\t\tdebugLog(\"schema has ID: %s\", target.ID)\n\t\t// handling the case when id is a folder\n\t\t// remember that basePath has to be a file\n\t\trefPath := target.ID\n\t\tif strings.HasSuffix(target.ID, \"/\") {\n\t\t\t// path.Clean here would not work correctly if basepath is http\n\t\t\trefPath = fmt.Sprintf(\"%s%s\", refPath, \"placeholder.json\")\n\t\t}\n\t\tbasePath = normalizePaths(refPath, basePath)\n\t}\n\n\tvar t *Schema\n\t// if Ref is found, everything else doesn't matter\n\t// Ref also changes the resolution scope of children expandSchema\n\tif target.Ref.String() != \"\" {\n\t\t// here the resolution scope is changed because a $ref was encountered\n\t\tnormalizedRef := normalizeFileRef(&target.Ref, basePath)\n\t\tnormalizedBasePath := normalizedRef.RemoteURI()\n\n\t\tif resolver.isCircular(normalizedRef, basePath, parentRefs...) {\n\t\t\t// this means there is a cycle in the recursion tree: return the Ref\n\t\t\t// - circular refs cannot be expanded. We leave them as ref.\n\t\t\t// - denormalization means that a new local file ref is set relative to the original basePath\n\t\t\tdebugLog(\"shortcut circular ref: basePath: %s, normalizedPath: %s, normalized ref: %s\",\n\t\t\t\tbasePath, normalizedBasePath, normalizedRef.String())\n\t\t\tif !resolver.options.AbsoluteCircularRef {\n\t\t\t\ttarget.Ref = *denormalizeFileRef(normalizedRef, normalizedBasePath, resolver.context.basePath)\n\t\t\t} else {\n\t\t\t\ttarget.Ref = *normalizedRef\n\t\t\t}\n\t\t\treturn &target, nil\n\t\t}\n\n\t\tdebugLog(\"basePath: %s: calling Resolve with target: %#v\", basePath, target)\n\t\tif err := resolver.Resolve(&target.Ref, &t, basePath); resolver.shouldStopOnError(err) {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tif t != nil {\n\t\t\tparentRefs = append(parentRefs, normalizedRef.String())\n\t\t\tvar err error\n\t\t\ttransitiveResolver, err := resolver.transitiveResolver(basePath, target.Ref)\n\t\t\tif transitiveResolver.shouldStopOnError(err) {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tbasePath = resolver.updateBasePath(transitiveResolver, normalizedBasePath)\n\n\t\t\treturn expandSchema(*t, parentRefs, transitiveResolver, basePath)\n\t\t}\n\t}\n\n\tt, err := expandItems(target, parentRefs, resolver, basePath)\n\tif resolver.shouldStopOnError(err) {\n\t\treturn &target, err\n\t}\n\tif t != nil {\n\t\ttarget = *t\n\t}\n\n\tfor i := range target.AllOf {\n\t\tt, err := expandSchema(target.AllOf[i], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\ttarget.AllOf[i] = *t\n\t}\n\tfor i := range target.AnyOf {\n\t\tt, err := expandSchema(target.AnyOf[i], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\ttarget.AnyOf[i] = *t\n\t}\n\tfor i := range target.OneOf {\n\t\tt, err := expandSchema(target.OneOf[i], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\ttarget.OneOf[i] = *t\n\t\t}\n\t}\n\tif target.Not != nil {\n\t\tt, err := expandSchema(*target.Not, parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\t*target.Not = *t\n\t\t}\n\t}\n\tfor k := range target.Properties {\n\t\tt, err := expandSchema(target.Properties[k], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\ttarget.Properties[k] = *t\n\t\t}\n\t}\n\tif target.AdditionalProperties != nil && target.AdditionalProperties.Schema != nil {\n\t\tt, err := expandSchema(*target.AdditionalProperties.Schema, parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\t*target.AdditionalProperties.Schema = *t\n\t\t}\n\t}\n\tfor k := range target.PatternProperties {\n\t\tt, err := expandSchema(target.PatternProperties[k], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\ttarget.PatternProperties[k] = *t\n\t\t}\n\t}\n\tfor k := range target.Dependencies {\n\t\tif target.Dependencies[k].Schema != nil {\n\t\t\tt, err := expandSchema(*target.Dependencies[k].Schema, parentRefs, resolver, basePath)\n\t\t\tif resolver.shouldStopOnError(err) {\n\t\t\t\treturn &target, err\n\t\t\t}\n\t\t\tif t != nil {\n\t\t\t\t*target.Dependencies[k].Schema = *t\n\t\t\t}\n\t\t}\n\t}\n\tif target.AdditionalItems != nil && target.AdditionalItems.Schema != nil {\n\t\tt, err := expandSchema(*target.AdditionalItems.Schema, parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\t*target.AdditionalItems.Schema = *t\n\t\t}\n\t}\n\tfor k := range target.Definitions {\n\t\tt, err := expandSchema(target.Definitions[k], parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn &target, err\n\t\t}\n\t\tif t != nil {\n\t\t\ttarget.Definitions[k] = *t\n\t\t}\n\t}\n\treturn &target, nil\n}\n\nfunc expandPathItem(pathItem *PathItem, resolver *schemaLoader, basePath string) error {\n\tif pathItem == nil {\n\t\treturn nil\n\t}\n\n\tparentRefs := []string{}\n\tif err := resolver.deref(pathItem, parentRefs, basePath); resolver.shouldStopOnError(err) {\n\t\treturn err\n\t}\n\tif pathItem.Ref.String() != \"\" {\n\t\tvar err error\n\t\tresolver, err = resolver.transitiveResolver(basePath, pathItem.Ref)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t}\n\tpathItem.Ref = Ref{}\n\n\tfor idx := range pathItem.Parameters {\n\t\tif err := expandParameterOrResponse(&(pathItem.Parameters[idx]), resolver, basePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t}\n\tops := []*Operation{\n\t\tpathItem.Get,\n\t\tpathItem.Head,\n\t\tpathItem.Options,\n\t\tpathItem.Put,\n\t\tpathItem.Post,\n\t\tpathItem.Patch,\n\t\tpathItem.Delete,\n\t}\n\tfor _, op := range ops {\n\t\tif err := expandOperation(op, resolver, basePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc expandOperation(op *Operation, resolver *schemaLoader, basePath string) error {\n\tif op == nil {\n\t\treturn nil\n\t}\n\n\tfor i := range op.Parameters {\n\t\tparam := op.Parameters[i]\n\t\tif err := expandParameterOrResponse(¶m, resolver, basePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\top.Parameters[i] = param\n\t}\n\n\tif op.Responses != nil {\n\t\tresponses := op.Responses\n\t\tif err := expandParameterOrResponse(responses.Default, resolver, basePath); resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\tfor code := range responses.StatusCodeResponses {\n\t\t\tresponse := responses.StatusCodeResponses[code]\n\t\t\tif err := expandParameterOrResponse(&response, resolver, basePath); resolver.shouldStopOnError(err) {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tresponses.StatusCodeResponses[code] = response\n\t\t}\n\t}\n\treturn nil\n}\n\n// ExpandResponseWithRoot expands a response based on a root document, not a fetchable document\nfunc ExpandResponseWithRoot(response *Response, root interface{}, cache ResolutionCache) error {\n\topts := &ExpandOptions{\n\t\tRelativeBase: baseForRoot(root, cache),\n\t\tSkipSchemas: false,\n\t\tContinueOnError: false,\n\t\t// when no base path is specified, remaining $ref (circular) are rendered with an absolute path\n\t\tAbsoluteCircularRef: true,\n\t}\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn expandParameterOrResponse(response, resolver, opts.RelativeBase)\n}\n\n// ExpandResponse expands a response based on a basepath\n// This is the exported version of expandResponse\n// all refs inside response will be resolved relative to basePath\nfunc ExpandResponse(response *Response, basePath string) error {\n\tvar specBasePath string\n\tif basePath != \"\" {\n\t\tspecBasePath, _ = absPath(basePath)\n\t}\n\topts := &ExpandOptions{\n\t\tRelativeBase: specBasePath,\n\t}\n\tresolver, err := defaultSchemaLoader(nil, opts, nil, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn expandParameterOrResponse(response, resolver, opts.RelativeBase)\n}\n\n// ExpandParameterWithRoot expands a parameter based on a root document, not a fetchable document\nfunc ExpandParameterWithRoot(parameter *Parameter, root interface{}, cache ResolutionCache) error {\n\topts := &ExpandOptions{\n\t\tRelativeBase: baseForRoot(root, cache),\n\t\tSkipSchemas: false,\n\t\tContinueOnError: false,\n\t\t// when no base path is specified, remaining $ref (circular) are rendered with an absolute path\n\t\tAbsoluteCircularRef: true,\n\t}\n\tresolver, err := defaultSchemaLoader(root, opts, nil, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn expandParameterOrResponse(parameter, resolver, opts.RelativeBase)\n}\n\n// ExpandParameter expands a parameter based on a basepath.\n// This is the exported version of expandParameter\n// all refs inside parameter will be resolved relative to basePath\nfunc ExpandParameter(parameter *Parameter, basePath string) error {\n\tvar specBasePath string\n\tif basePath != \"\" {\n\t\tspecBasePath, _ = absPath(basePath)\n\t}\n\topts := &ExpandOptions{\n\t\tRelativeBase: specBasePath,\n\t}\n\tresolver, err := defaultSchemaLoader(nil, opts, nil, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn expandParameterOrResponse(parameter, resolver, opts.RelativeBase)\n}\n\nfunc getRefAndSchema(input interface{}) (*Ref, *Schema, error) {\n\tvar ref *Ref\n\tvar sch *Schema\n\tswitch refable := input.(type) {\n\tcase *Parameter:\n\t\tif refable == nil {\n\t\t\treturn nil, nil, nil\n\t\t}\n\t\tref = &refable.Ref\n\t\tsch = refable.Schema\n\tcase *Response:\n\t\tif refable == nil {\n\t\t\treturn nil, nil, nil\n\t\t}\n\t\tref = &refable.Ref\n\t\tsch = refable.Schema\n\tdefault:\n\t\treturn nil, nil, fmt.Errorf(\"expand: unsupported type %T. Input should be of type *Parameter or *Response\", input)\n\t}\n\treturn ref, sch, nil\n}\n\nfunc expandParameterOrResponse(input interface{}, resolver *schemaLoader, basePath string) error {\n\tref, _, err := getRefAndSchema(input)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif ref == nil {\n\t\treturn nil\n\t}\n\tparentRefs := []string{}\n\tif err := resolver.deref(input, parentRefs, basePath); resolver.shouldStopOnError(err) {\n\t\treturn err\n\t}\n\tref, sch, _ := getRefAndSchema(input)\n\tif ref.String() != \"\" {\n\t\ttransitiveResolver, err := resolver.transitiveResolver(basePath, *ref)\n\t\tif transitiveResolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\tbasePath = resolver.updateBasePath(transitiveResolver, basePath)\n\t\tresolver = transitiveResolver\n\t}\n\n\tif sch != nil && sch.Ref.String() != \"\" {\n\t\t// schema expanded to a $ref in another root\n\t\tvar ern error\n\t\tsch.Ref, ern = NewRef(normalizePaths(sch.Ref.String(), ref.RemoteURI()))\n\t\tif ern != nil {\n\t\t\treturn ern\n\t\t}\n\t}\n\tif ref != nil {\n\t\t*ref = Ref{}\n\t}\n\n\tif !resolver.options.SkipSchemas && sch != nil {\n\t\ts, err := expandSchema(*sch, parentRefs, resolver, basePath)\n\t\tif resolver.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\t\t*sch = *s\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/external_docs.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\n// ExternalDocumentation allows referencing an external resource for\n// extended documentation.\n//\n// For more information: http://goo.gl/8us55a#externalDocumentationObject\ntype ExternalDocumentation struct {\n\tDescription string `json:\"description,omitempty\"`\n\tURL string `json:\"url,omitempty\"`\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/go.mod", "content": "module github.com/go-openapi/spec\n\nrequire (\n\tgithub.com/PuerkitoBio/purell v1.1.0 // indirect\n\tgithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 // indirect\n\tgithub.com/davecgh/go-spew v1.1.1 // indirect\n\tgithub.com/go-openapi/jsonpointer v0.17.0\n\tgithub.com/go-openapi/jsonreference v0.17.0\n\tgithub.com/go-openapi/swag v0.17.0\n\tgithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 // indirect\n\tgithub.com/pmezard/go-difflib v1.0.0 // indirect\n\tgithub.com/stretchr/testify v1.2.2\n\tgolang.org/x/net v0.0.0-20181005035420-146acd28ed58 // indirect\n\tgolang.org/x/text v0.3.0 // indirect\n\tgopkg.in/yaml.v2 v2.2.1\n)\n" }, { "path": "vendor/github.com/go-openapi/spec/go.sum", "content": "github.com/PuerkitoBio/purell v1.1.0 h1:rmGxhojJlM0tuKtfdvliR84CFHljx9ag64t2xmVkjK4=\ngithub.com/PuerkitoBio/purell v1.1.0/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 h1:d+Bc7a5rLufV/sSk/8dngufqelfh6jnri85riMAaF/M=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578/go.mod h1:uGdkoq3SwY9Y+13GIhn11/XLaGBb4BfwItxLd5jeuXE=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/go-openapi/jsonpointer v0.17.0 h1:Bpl2DtZ6k7wKqfFs7e+4P08+M9I3FQgn09a1UsRUQbk=\ngithub.com/go-openapi/jsonpointer v0.17.0/go.mod h1:+35s3my2LFTysnkMfxsJBAMHj/DoqoB9knIWoYG/Vk0=\ngithub.com/go-openapi/jsonreference v0.17.0 h1:d/o7/fsLWWQZACbihvZxcyLQ59jfUVs7WOJv/ak7T7A=\ngithub.com/go-openapi/jsonreference v0.17.0/go.mod h1:W3Z9FmVs9qj+KR4zFKmDPGiLdk1D9Rlm7cyMvf57TTg=\ngithub.com/go-openapi/swag v0.17.0 h1:7wu+dZ5k83kvUWeAb+WUkFiUhDzwGqzTR/NhWzeo1JU=\ngithub.com/go-openapi/swag v0.17.0/go.mod h1:DXUve3Dpr1UfpPtxFw+EFuQ41HhCWZfha5jSVRG7C7I=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 h1:2gxZ0XQIU/5z3Z3bUBu+FXuk2pFbkN6tcwi/pjyaDic=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/testify v1.2.2 h1:bSDNvY7ZPG5RlJ8otE/7V6gMiyenm9RtJ7IUVIAoJ1w=\ngithub.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58 h1:otZG8yDCO4LVps5+9bxOeNiCvgmOyt96J3roHTYs7oE=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/go-openapi/spec/header.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\nconst (\n\tjsonArray = \"array\"\n)\n\n// HeaderProps describes a response header\ntype HeaderProps struct {\n\tDescription string `json:\"description,omitempty\"`\n}\n\n// Header describes a header for a response of the API\n//\n// For more information: http://goo.gl/8us55a#headerObject\ntype Header struct {\n\tCommonValidations\n\tSimpleSchema\n\tVendorExtensible\n\tHeaderProps\n}\n\n// ResponseHeader creates a new header instance for use in a response\nfunc ResponseHeader() *Header {\n\treturn new(Header)\n}\n\n// WithDescription sets the description on this response, allows for chaining\nfunc (h *Header) WithDescription(description string) *Header {\n\th.Description = description\n\treturn h\n}\n\n// Typed a fluent builder method for the type of parameter\nfunc (h *Header) Typed(tpe, format string) *Header {\n\th.Type = tpe\n\th.Format = format\n\treturn h\n}\n\n// CollectionOf a fluent builder method for an array item\nfunc (h *Header) CollectionOf(items *Items, format string) *Header {\n\th.Type = jsonArray\n\th.Items = items\n\th.CollectionFormat = format\n\treturn h\n}\n\n// WithDefault sets the default value on this item\nfunc (h *Header) WithDefault(defaultValue interface{}) *Header {\n\th.Default = defaultValue\n\treturn h\n}\n\n// WithMaxLength sets a max length value\nfunc (h *Header) WithMaxLength(max int64) *Header {\n\th.MaxLength = &max\n\treturn h\n}\n\n// WithMinLength sets a min length value\nfunc (h *Header) WithMinLength(min int64) *Header {\n\th.MinLength = &min\n\treturn h\n}\n\n// WithPattern sets a pattern value\nfunc (h *Header) WithPattern(pattern string) *Header {\n\th.Pattern = pattern\n\treturn h\n}\n\n// WithMultipleOf sets a multiple of value\nfunc (h *Header) WithMultipleOf(number float64) *Header {\n\th.MultipleOf = &number\n\treturn h\n}\n\n// WithMaximum sets a maximum number value\nfunc (h *Header) WithMaximum(max float64, exclusive bool) *Header {\n\th.Maximum = &max\n\th.ExclusiveMaximum = exclusive\n\treturn h\n}\n\n// WithMinimum sets a minimum number value\nfunc (h *Header) WithMinimum(min float64, exclusive bool) *Header {\n\th.Minimum = &min\n\th.ExclusiveMinimum = exclusive\n\treturn h\n}\n\n// WithEnum sets a the enum values (replace)\nfunc (h *Header) WithEnum(values ...interface{}) *Header {\n\th.Enum = append([]interface{}{}, values...)\n\treturn h\n}\n\n// WithMaxItems sets the max items\nfunc (h *Header) WithMaxItems(size int64) *Header {\n\th.MaxItems = &size\n\treturn h\n}\n\n// WithMinItems sets the min items\nfunc (h *Header) WithMinItems(size int64) *Header {\n\th.MinItems = &size\n\treturn h\n}\n\n// UniqueValues dictates that this array can only have unique items\nfunc (h *Header) UniqueValues() *Header {\n\th.UniqueItems = true\n\treturn h\n}\n\n// AllowDuplicates this array can have duplicates\nfunc (h *Header) AllowDuplicates() *Header {\n\th.UniqueItems = false\n\treturn h\n}\n\n// MarshalJSON marshal this to JSON\nfunc (h Header) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(h.CommonValidations)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(h.SimpleSchema)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb3, err := json.Marshal(h.HeaderProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2, b3), nil\n}\n\n// UnmarshalJSON unmarshals this header from JSON\nfunc (h *Header) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &h.CommonValidations); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &h.SimpleSchema); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &h.VendorExtensible); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &h.HeaderProps)\n}\n\n// JSONLookup look up a value by the json property name\nfunc (h Header) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := h.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(h.CommonValidations, token)\n\tif err != nil && !strings.HasPrefix(err.Error(), \"object has no field\") {\n\t\treturn nil, err\n\t}\n\tif r != nil {\n\t\treturn r, nil\n\t}\n\tr, _, err = jsonpointer.GetForToken(h.SimpleSchema, token)\n\tif err != nil && !strings.HasPrefix(err.Error(), \"object has no field\") {\n\t\treturn nil, err\n\t}\n\tif r != nil {\n\t\treturn r, nil\n\t}\n\tr, _, err = jsonpointer.GetForToken(h.HeaderProps, token)\n\treturn r, err\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/info.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// Extensions vendor specific extensions\ntype Extensions map[string]interface{}\n\n// Add adds a value to these extensions\nfunc (e Extensions) Add(key string, value interface{}) {\n\trealKey := strings.ToLower(key)\n\te[realKey] = value\n}\n\n// GetString gets a string value from the extensions\nfunc (e Extensions) GetString(key string) (string, bool) {\n\tif v, ok := e[strings.ToLower(key)]; ok {\n\t\tstr, ok := v.(string)\n\t\treturn str, ok\n\t}\n\treturn \"\", false\n}\n\n// GetBool gets a string value from the extensions\nfunc (e Extensions) GetBool(key string) (bool, bool) {\n\tif v, ok := e[strings.ToLower(key)]; ok {\n\t\tstr, ok := v.(bool)\n\t\treturn str, ok\n\t}\n\treturn false, false\n}\n\n// GetStringSlice gets a string value from the extensions\nfunc (e Extensions) GetStringSlice(key string) ([]string, bool) {\n\tif v, ok := e[strings.ToLower(key)]; ok {\n\t\tarr, isSlice := v.([]interface{})\n\t\tif !isSlice {\n\t\t\treturn nil, false\n\t\t}\n\t\tvar strs []string\n\t\tfor _, iface := range arr {\n\t\t\tstr, isString := iface.(string)\n\t\t\tif !isString {\n\t\t\t\treturn nil, false\n\t\t\t}\n\t\t\tstrs = append(strs, str)\n\t\t}\n\t\treturn strs, ok\n\t}\n\treturn nil, false\n}\n\n// VendorExtensible composition block.\ntype VendorExtensible struct {\n\tExtensions Extensions\n}\n\n// AddExtension adds an extension to this extensible object\nfunc (v *VendorExtensible) AddExtension(key string, value interface{}) {\n\tif value == nil {\n\t\treturn\n\t}\n\tif v.Extensions == nil {\n\t\tv.Extensions = make(map[string]interface{})\n\t}\n\tv.Extensions.Add(key, value)\n}\n\n// MarshalJSON marshals the extensions to json\nfunc (v VendorExtensible) MarshalJSON() ([]byte, error) {\n\ttoser := make(map[string]interface{})\n\tfor k, v := range v.Extensions {\n\t\tlk := strings.ToLower(k)\n\t\tif strings.HasPrefix(lk, \"x-\") {\n\t\t\ttoser[k] = v\n\t\t}\n\t}\n\treturn json.Marshal(toser)\n}\n\n// UnmarshalJSON for this extensible object\nfunc (v *VendorExtensible) UnmarshalJSON(data []byte) error {\n\tvar d map[string]interface{}\n\tif err := json.Unmarshal(data, &d); err != nil {\n\t\treturn err\n\t}\n\tfor k, vv := range d {\n\t\tlk := strings.ToLower(k)\n\t\tif strings.HasPrefix(lk, \"x-\") {\n\t\t\tif v.Extensions == nil {\n\t\t\t\tv.Extensions = map[string]interface{}{}\n\t\t\t}\n\t\t\tv.Extensions[k] = vv\n\t\t}\n\t}\n\treturn nil\n}\n\n// InfoProps the properties for an info definition\ntype InfoProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tTitle string `json:\"title,omitempty\"`\n\tTermsOfService string `json:\"termsOfService,omitempty\"`\n\tContact *ContactInfo `json:\"contact,omitempty\"`\n\tLicense *License `json:\"license,omitempty\"`\n\tVersion string `json:\"version,omitempty\"`\n}\n\n// Info object provides metadata about the API.\n// The metadata can be used by the clients if needed, and can be presented in the Swagger-UI for convenience.\n//\n// For more information: http://goo.gl/8us55a#infoObject\ntype Info struct {\n\tVendorExtensible\n\tInfoProps\n}\n\n// JSONLookup look up a value by the json property name\nfunc (i Info) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := i.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tr, _, err := jsonpointer.GetForToken(i.InfoProps, token)\n\treturn r, err\n}\n\n// MarshalJSON marshal this to JSON\nfunc (i Info) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(i.InfoProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(i.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2), nil\n}\n\n// UnmarshalJSON marshal this from JSON\nfunc (i *Info) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &i.InfoProps); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &i.VendorExtensible)\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/items.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\nconst (\n\tjsonRef = \"$ref\"\n)\n\n// SimpleSchema describe swagger simple schemas for parameters and headers\ntype SimpleSchema struct {\n\tType string `json:\"type,omitempty\"`\n\tFormat string `json:\"format,omitempty\"`\n\tItems *Items `json:\"items,omitempty\"`\n\tCollectionFormat string `json:\"collectionFormat,omitempty\"`\n\tDefault interface{} `json:\"default,omitempty\"`\n\tExample interface{} `json:\"example,omitempty\"`\n}\n\n// TypeName return the type (or format) of a simple schema\nfunc (s *SimpleSchema) TypeName() string {\n\tif s.Format != \"\" {\n\t\treturn s.Format\n\t}\n\treturn s.Type\n}\n\n// ItemsTypeName yields the type of items in a simple schema array\nfunc (s *SimpleSchema) ItemsTypeName() string {\n\tif s.Items == nil {\n\t\treturn \"\"\n\t}\n\treturn s.Items.TypeName()\n}\n\n// CommonValidations describe common JSON-schema validations\ntype CommonValidations struct {\n\tMaximum *float64 `json:\"maximum,omitempty\"`\n\tExclusiveMaximum bool `json:\"exclusiveMaximum,omitempty\"`\n\tMinimum *float64 `json:\"minimum,omitempty\"`\n\tExclusiveMinimum bool `json:\"exclusiveMinimum,omitempty\"`\n\tMaxLength *int64 `json:\"maxLength,omitempty\"`\n\tMinLength *int64 `json:\"minLength,omitempty\"`\n\tPattern string `json:\"pattern,omitempty\"`\n\tMaxItems *int64 `json:\"maxItems,omitempty\"`\n\tMinItems *int64 `json:\"minItems,omitempty\"`\n\tUniqueItems bool `json:\"uniqueItems,omitempty\"`\n\tMultipleOf *float64 `json:\"multipleOf,omitempty\"`\n\tEnum []interface{} `json:\"enum,omitempty\"`\n}\n\n// Items a limited subset of JSON-Schema's items object.\n// It is used by parameter definitions that are not located in \"body\".\n//\n// For more information: http://goo.gl/8us55a#items-object\ntype Items struct {\n\tRefable\n\tCommonValidations\n\tSimpleSchema\n\tVendorExtensible\n}\n\n// NewItems creates a new instance of items\nfunc NewItems() *Items {\n\treturn &Items{}\n}\n\n// Typed a fluent builder method for the type of item\nfunc (i *Items) Typed(tpe, format string) *Items {\n\ti.Type = tpe\n\ti.Format = format\n\treturn i\n}\n\n// CollectionOf a fluent builder method for an array item\nfunc (i *Items) CollectionOf(items *Items, format string) *Items {\n\ti.Type = jsonArray\n\ti.Items = items\n\ti.CollectionFormat = format\n\treturn i\n}\n\n// WithDefault sets the default value on this item\nfunc (i *Items) WithDefault(defaultValue interface{}) *Items {\n\ti.Default = defaultValue\n\treturn i\n}\n\n// WithMaxLength sets a max length value\nfunc (i *Items) WithMaxLength(max int64) *Items {\n\ti.MaxLength = &max\n\treturn i\n}\n\n// WithMinLength sets a min length value\nfunc (i *Items) WithMinLength(min int64) *Items {\n\ti.MinLength = &min\n\treturn i\n}\n\n// WithPattern sets a pattern value\nfunc (i *Items) WithPattern(pattern string) *Items {\n\ti.Pattern = pattern\n\treturn i\n}\n\n// WithMultipleOf sets a multiple of value\nfunc (i *Items) WithMultipleOf(number float64) *Items {\n\ti.MultipleOf = &number\n\treturn i\n}\n\n// WithMaximum sets a maximum number value\nfunc (i *Items) WithMaximum(max float64, exclusive bool) *Items {\n\ti.Maximum = &max\n\ti.ExclusiveMaximum = exclusive\n\treturn i\n}\n\n// WithMinimum sets a minimum number value\nfunc (i *Items) WithMinimum(min float64, exclusive bool) *Items {\n\ti.Minimum = &min\n\ti.ExclusiveMinimum = exclusive\n\treturn i\n}\n\n// WithEnum sets a the enum values (replace)\nfunc (i *Items) WithEnum(values ...interface{}) *Items {\n\ti.Enum = append([]interface{}{}, values...)\n\treturn i\n}\n\n// WithMaxItems sets the max items\nfunc (i *Items) WithMaxItems(size int64) *Items {\n\ti.MaxItems = &size\n\treturn i\n}\n\n// WithMinItems sets the min items\nfunc (i *Items) WithMinItems(size int64) *Items {\n\ti.MinItems = &size\n\treturn i\n}\n\n// UniqueValues dictates that this array can only have unique items\nfunc (i *Items) UniqueValues() *Items {\n\ti.UniqueItems = true\n\treturn i\n}\n\n// AllowDuplicates this array can have duplicates\nfunc (i *Items) AllowDuplicates() *Items {\n\ti.UniqueItems = false\n\treturn i\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (i *Items) UnmarshalJSON(data []byte) error {\n\tvar validations CommonValidations\n\tif err := json.Unmarshal(data, &validations); err != nil {\n\t\treturn err\n\t}\n\tvar ref Refable\n\tif err := json.Unmarshal(data, &ref); err != nil {\n\t\treturn err\n\t}\n\tvar simpleSchema SimpleSchema\n\tif err := json.Unmarshal(data, &simpleSchema); err != nil {\n\t\treturn err\n\t}\n\tvar vendorExtensible VendorExtensible\n\tif err := json.Unmarshal(data, &vendorExtensible); err != nil {\n\t\treturn err\n\t}\n\ti.Refable = ref\n\ti.CommonValidations = validations\n\ti.SimpleSchema = simpleSchema\n\ti.VendorExtensible = vendorExtensible\n\treturn nil\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (i Items) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(i.CommonValidations)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(i.SimpleSchema)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb3, err := json.Marshal(i.Refable)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb4, err := json.Marshal(i.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b4, b3, b1, b2), nil\n}\n\n// JSONLookup look up a value by the json property name\nfunc (i Items) JSONLookup(token string) (interface{}, error) {\n\tif token == jsonRef {\n\t\treturn &i.Ref, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(i.CommonValidations, token)\n\tif err != nil && !strings.HasPrefix(err.Error(), \"object has no field\") {\n\t\treturn nil, err\n\t}\n\tif r != nil {\n\t\treturn r, nil\n\t}\n\tr, _, err = jsonpointer.GetForToken(i.SimpleSchema, token)\n\treturn r, err\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/license.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\n// License information for the exposed API.\n//\n// For more information: http://goo.gl/8us55a#licenseObject\ntype License struct {\n\tName string `json:\"name,omitempty\"`\n\tURL string `json:\"url,omitempty\"`\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/normalizer.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"fmt\"\n\t\"net/url\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"strings\"\n)\n\n// normalize absolute path for cache.\n// on Windows, drive letters should be converted to lower as scheme in net/url.URL\nfunc normalizeAbsPath(path string) string {\n\tu, err := url.Parse(path)\n\tif err != nil {\n\t\tdebugLog(\"normalize absolute path failed: %s\", err)\n\t\treturn path\n\t}\n\treturn u.String()\n}\n\n// base or refPath could be a file path or a URL\n// given a base absolute path and a ref path, return the absolute path of refPath\n// 1) if refPath is absolute, return it\n// 2) if refPath is relative, join it with basePath keeping the scheme, hosts, and ports if exists\n// base could be a directory or a full file path\nfunc normalizePaths(refPath, base string) string {\n\trefURL, _ := url.Parse(refPath)\n\tif path.IsAbs(refURL.Path) || filepath.IsAbs(refPath) {\n\t\t// refPath is actually absolute\n\t\tif refURL.Host != \"\" {\n\t\t\treturn refPath\n\t\t}\n\t\tparts := strings.Split(refPath, \"#\")\n\t\tresult := filepath.FromSlash(parts[0])\n\t\tif len(parts) == 2 {\n\t\t\tresult += \"#\" + parts[1]\n\t\t}\n\t\treturn result\n\t}\n\n\t// relative refPath\n\tbaseURL, _ := url.Parse(base)\n\tif !strings.HasPrefix(refPath, \"#\") {\n\t\t// combining paths\n\t\tif baseURL.Host != \"\" {\n\t\t\tbaseURL.Path = path.Join(path.Dir(baseURL.Path), refURL.Path)\n\t\t} else { // base is a file\n\t\t\tnewBase := fmt.Sprintf(\"%s#%s\", filepath.Join(filepath.Dir(base), filepath.FromSlash(refURL.Path)), refURL.Fragment)\n\t\t\treturn newBase\n\t\t}\n\n\t}\n\t// copying fragment from ref to base\n\tbaseURL.Fragment = refURL.Fragment\n\treturn baseURL.String()\n}\n\n// denormalizePaths returns to simplest notation on file $ref,\n// i.e. strips the absolute path and sets a path relative to the base path.\n//\n// This is currently used when we rewrite ref after a circular ref has been detected\nfunc denormalizeFileRef(ref *Ref, relativeBase, originalRelativeBase string) *Ref {\n\tdebugLog(\"denormalizeFileRef for: %s\", ref.String())\n\n\tif ref.String() == \"\" || ref.IsRoot() || ref.HasFragmentOnly {\n\t\treturn ref\n\t}\n\t// strip relativeBase from URI\n\trelativeBaseURL, _ := url.Parse(relativeBase)\n\trelativeBaseURL.Fragment = \"\"\n\n\tif relativeBaseURL.IsAbs() && strings.HasPrefix(ref.String(), relativeBase) {\n\t\t// this should work for absolute URI (e.g. http://...): we have an exact match, just trim prefix\n\t\tr, _ := NewRef(strings.TrimPrefix(ref.String(), relativeBase))\n\t\treturn &r\n\t}\n\n\tif relativeBaseURL.IsAbs() {\n\t\t// other absolute URL get unchanged (i.e. with a non-empty scheme)\n\t\treturn ref\n\t}\n\n\t// for relative file URIs:\n\toriginalRelativeBaseURL, _ := url.Parse(originalRelativeBase)\n\toriginalRelativeBaseURL.Fragment = \"\"\n\tif strings.HasPrefix(ref.String(), originalRelativeBaseURL.String()) {\n\t\t// the resulting ref is in the expanded spec: return a local ref\n\t\tr, _ := NewRef(strings.TrimPrefix(ref.String(), originalRelativeBaseURL.String()))\n\t\treturn &r\n\t}\n\n\t// check if we may set a relative path, considering the original base path for this spec.\n\t// Example:\n\t// spec is located at /mypath/spec.json\n\t// my normalized ref points to: /mypath/item.json#/target\n\t// expected result: item.json#/target\n\tparts := strings.Split(ref.String(), \"#\")\n\trelativePath, err := filepath.Rel(path.Dir(originalRelativeBaseURL.String()), parts[0])\n\tif err != nil {\n\t\t// there is no common ancestor (e.g. different drives on windows)\n\t\t// leaves the ref unchanged\n\t\treturn ref\n\t}\n\tif len(parts) == 2 {\n\t\trelativePath += \"#\" + parts[1]\n\t}\n\tr, _ := NewRef(relativePath)\n\treturn &r\n}\n\n// relativeBase could be an ABSOLUTE file path or an ABSOLUTE URL\nfunc normalizeFileRef(ref *Ref, relativeBase string) *Ref {\n\t// This is important for when the reference is pointing to the root schema\n\tif ref.String() == \"\" {\n\t\tr, _ := NewRef(relativeBase)\n\t\treturn &r\n\t}\n\n\tdebugLog(\"normalizing %s against %s\", ref.String(), relativeBase)\n\n\ts := normalizePaths(ref.String(), relativeBase)\n\tr, _ := NewRef(s)\n\treturn &r\n}\n\n// absPath returns the absolute path of a file\nfunc absPath(fname string) (string, error) {\n\tif strings.HasPrefix(fname, \"http\") {\n\t\treturn fname, nil\n\t}\n\tif filepath.IsAbs(fname) {\n\t\treturn fname, nil\n\t}\n\twd, err := os.Getwd()\n\treturn filepath.Join(wd, fname), err\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/operation.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"bytes\"\n\t\"encoding/gob\"\n\t\"encoding/json\"\n\t\"sort\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\nfunc init() {\n\t//gob.Register(map[string][]interface{}{})\n\tgob.Register(map[string]interface{}{})\n\tgob.Register([]interface{}{})\n}\n\n// OperationProps describes an operation\n//\n// NOTES:\n// - schemes, when present must be from [http, https, ws, wss]: see validate\n// - Security is handled as a special case: see MarshalJSON function\ntype OperationProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tConsumes []string `json:\"consumes,omitempty\"`\n\tProduces []string `json:\"produces,omitempty\"`\n\tSchemes []string `json:\"schemes,omitempty\"`\n\tTags []string `json:\"tags,omitempty\"`\n\tSummary string `json:\"summary,omitempty\"`\n\tExternalDocs *ExternalDocumentation `json:\"externalDocs,omitempty\"`\n\tID string `json:\"operationId,omitempty\"`\n\tDeprecated bool `json:\"deprecated,omitempty\"`\n\tSecurity []map[string][]string `json:\"security,omitempty\"`\n\tParameters []Parameter `json:\"parameters,omitempty\"`\n\tResponses *Responses `json:\"responses,omitempty\"`\n}\n\n// MarshalJSON takes care of serializing operation properties to JSON\n//\n// We use a custom marhaller here to handle a special cases related to\n// the Security field. We need to preserve zero length slice\n// while omitting the field when the value is nil/unset.\nfunc (op OperationProps) MarshalJSON() ([]byte, error) {\n\ttype Alias OperationProps\n\tif op.Security == nil {\n\t\treturn json.Marshal(&struct {\n\t\t\tSecurity []map[string][]string `json:\"security,omitempty\"`\n\t\t\t*Alias\n\t\t}{\n\t\t\tSecurity: op.Security,\n\t\t\tAlias: (*Alias)(&op),\n\t\t})\n\t}\n\treturn json.Marshal(&struct {\n\t\tSecurity []map[string][]string `json:\"security\"`\n\t\t*Alias\n\t}{\n\t\tSecurity: op.Security,\n\t\tAlias: (*Alias)(&op),\n\t})\n}\n\n// Operation describes a single API operation on a path.\n//\n// For more information: http://goo.gl/8us55a#operationObject\ntype Operation struct {\n\tVendorExtensible\n\tOperationProps\n}\n\n// SuccessResponse gets a success response model\nfunc (o *Operation) SuccessResponse() (*Response, int, bool) {\n\tif o.Responses == nil {\n\t\treturn nil, 0, false\n\t}\n\n\tresponseCodes := make([]int, 0, len(o.Responses.StatusCodeResponses))\n\tfor k := range o.Responses.StatusCodeResponses {\n\t\tif k >= 200 && k < 300 {\n\t\t\tresponseCodes = append(responseCodes, k)\n\t\t}\n\t}\n\tif len(responseCodes) > 0 {\n\t\tsort.Ints(responseCodes)\n\t\tv := o.Responses.StatusCodeResponses[responseCodes[0]]\n\t\treturn &v, responseCodes[0], true\n\t}\n\n\treturn o.Responses.Default, 0, false\n}\n\n// JSONLookup look up a value by the json property name\nfunc (o Operation) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := o.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tr, _, err := jsonpointer.GetForToken(o.OperationProps, token)\n\treturn r, err\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (o *Operation) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &o.OperationProps); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &o.VendorExtensible)\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (o Operation) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(o.OperationProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(o.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tconcated := swag.ConcatJSON(b1, b2)\n\treturn concated, nil\n}\n\n// NewOperation creates a new operation instance.\n// It expects an ID as parameter but not passing an ID is also valid.\nfunc NewOperation(id string) *Operation {\n\top := new(Operation)\n\top.ID = id\n\treturn op\n}\n\n// WithID sets the ID property on this operation, allows for chaining.\nfunc (o *Operation) WithID(id string) *Operation {\n\to.ID = id\n\treturn o\n}\n\n// WithDescription sets the description on this operation, allows for chaining\nfunc (o *Operation) WithDescription(description string) *Operation {\n\to.Description = description\n\treturn o\n}\n\n// WithSummary sets the summary on this operation, allows for chaining\nfunc (o *Operation) WithSummary(summary string) *Operation {\n\to.Summary = summary\n\treturn o\n}\n\n// WithExternalDocs sets/removes the external docs for/from this operation.\n// When you pass empty strings as params the external documents will be removed.\n// When you pass non-empty string as one value then those values will be used on the external docs object.\n// So when you pass a non-empty description, you should also pass the url and vice versa.\nfunc (o *Operation) WithExternalDocs(description, url string) *Operation {\n\tif description == \"\" && url == \"\" {\n\t\to.ExternalDocs = nil\n\t\treturn o\n\t}\n\n\tif o.ExternalDocs == nil {\n\t\to.ExternalDocs = &ExternalDocumentation{}\n\t}\n\to.ExternalDocs.Description = description\n\to.ExternalDocs.URL = url\n\treturn o\n}\n\n// Deprecate marks the operation as deprecated\nfunc (o *Operation) Deprecate() *Operation {\n\to.Deprecated = true\n\treturn o\n}\n\n// Undeprecate marks the operation as not deprected\nfunc (o *Operation) Undeprecate() *Operation {\n\to.Deprecated = false\n\treturn o\n}\n\n// WithConsumes adds media types for incoming body values\nfunc (o *Operation) WithConsumes(mediaTypes ...string) *Operation {\n\to.Consumes = append(o.Consumes, mediaTypes...)\n\treturn o\n}\n\n// WithProduces adds media types for outgoing body values\nfunc (o *Operation) WithProduces(mediaTypes ...string) *Operation {\n\to.Produces = append(o.Produces, mediaTypes...)\n\treturn o\n}\n\n// WithTags adds tags for this operation\nfunc (o *Operation) WithTags(tags ...string) *Operation {\n\to.Tags = append(o.Tags, tags...)\n\treturn o\n}\n\n// AddParam adds a parameter to this operation, when a parameter for that location\n// and with that name already exists it will be replaced\nfunc (o *Operation) AddParam(param *Parameter) *Operation {\n\tif param == nil {\n\t\treturn o\n\t}\n\n\tfor i, p := range o.Parameters {\n\t\tif p.Name == param.Name && p.In == param.In {\n\t\t\tparams := append(o.Parameters[:i], *param)\n\t\t\tparams = append(params, o.Parameters[i+1:]...)\n\t\t\to.Parameters = params\n\t\t\treturn o\n\t\t}\n\t}\n\n\to.Parameters = append(o.Parameters, *param)\n\treturn o\n}\n\n// RemoveParam removes a parameter from the operation\nfunc (o *Operation) RemoveParam(name, in string) *Operation {\n\tfor i, p := range o.Parameters {\n\t\tif p.Name == name && p.In == in {\n\t\t\to.Parameters = append(o.Parameters[:i], o.Parameters[i+1:]...)\n\t\t\treturn o\n\t\t}\n\t}\n\treturn o\n}\n\n// SecuredWith adds a security scope to this operation.\nfunc (o *Operation) SecuredWith(name string, scopes ...string) *Operation {\n\to.Security = append(o.Security, map[string][]string{name: scopes})\n\treturn o\n}\n\n// WithDefaultResponse adds a default response to the operation.\n// Passing a nil value will remove the response\nfunc (o *Operation) WithDefaultResponse(response *Response) *Operation {\n\treturn o.RespondsWith(0, response)\n}\n\n// RespondsWith adds a status code response to the operation.\n// When the code is 0 the value of the response will be used as default response value.\n// When the value of the response is nil it will be removed from the operation\nfunc (o *Operation) RespondsWith(code int, response *Response) *Operation {\n\tif o.Responses == nil {\n\t\to.Responses = new(Responses)\n\t}\n\tif code == 0 {\n\t\to.Responses.Default = response\n\t\treturn o\n\t}\n\tif response == nil {\n\t\tdelete(o.Responses.StatusCodeResponses, code)\n\t\treturn o\n\t}\n\tif o.Responses.StatusCodeResponses == nil {\n\t\to.Responses.StatusCodeResponses = make(map[int]Response)\n\t}\n\to.Responses.StatusCodeResponses[code] = *response\n\treturn o\n}\n\ntype opsAlias OperationProps\n\ntype gobAlias struct {\n\tSecurity []map[string]struct {\n\t\tList []string\n\t\tPad bool\n\t}\n\tAlias *opsAlias\n\tSecurityIsEmpty bool\n}\n\n// GobEncode provides a safe gob encoder for Operation, including empty security requirements\nfunc (o Operation) GobEncode() ([]byte, error) {\n\traw := struct {\n\t\tExt VendorExtensible\n\t\tProps OperationProps\n\t}{\n\t\tExt: o.VendorExtensible,\n\t\tProps: o.OperationProps,\n\t}\n\tvar b bytes.Buffer\n\terr := gob.NewEncoder(&b).Encode(raw)\n\treturn b.Bytes(), err\n}\n\n// GobDecode provides a safe gob decoder for Operation, including empty security requirements\nfunc (o *Operation) GobDecode(b []byte) error {\n\tvar raw struct {\n\t\tExt VendorExtensible\n\t\tProps OperationProps\n\t}\n\n\tbuf := bytes.NewBuffer(b)\n\terr := gob.NewDecoder(buf).Decode(&raw)\n\tif err != nil {\n\t\treturn err\n\t}\n\to.VendorExtensible = raw.Ext\n\to.OperationProps = raw.Props\n\treturn nil\n}\n\n// GobEncode provides a safe gob encoder for Operation, including empty security requirements\nfunc (op OperationProps) GobEncode() ([]byte, error) {\n\traw := gobAlias{\n\t\tAlias: (*opsAlias)(&op),\n\t}\n\n\tvar b bytes.Buffer\n\tif op.Security == nil {\n\t\t// nil security requirement\n\t\terr := gob.NewEncoder(&b).Encode(raw)\n\t\treturn b.Bytes(), err\n\t}\n\n\tif len(op.Security) == 0 {\n\t\t// empty, but non-nil security requirement\n\t\traw.SecurityIsEmpty = true\n\t\traw.Alias.Security = nil\n\t\terr := gob.NewEncoder(&b).Encode(raw)\n\t\treturn b.Bytes(), err\n\t}\n\n\traw.Security = make([]map[string]struct {\n\t\tList []string\n\t\tPad bool\n\t}, 0, len(op.Security))\n\tfor _, req := range op.Security {\n\t\tv := make(map[string]struct {\n\t\t\tList []string\n\t\t\tPad bool\n\t\t}, len(req))\n\t\tfor k, val := range req {\n\t\t\tv[k] = struct {\n\t\t\t\tList []string\n\t\t\t\tPad bool\n\t\t\t}{\n\t\t\t\tList: val,\n\t\t\t}\n\t\t}\n\t\traw.Security = append(raw.Security, v)\n\t}\n\n\terr := gob.NewEncoder(&b).Encode(raw)\n\treturn b.Bytes(), err\n}\n\n// GobDecode provides a safe gob decoder for Operation, including empty security requirements\nfunc (op *OperationProps) GobDecode(b []byte) error {\n\tvar raw gobAlias\n\n\tbuf := bytes.NewBuffer(b)\n\terr := gob.NewDecoder(buf).Decode(&raw)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif raw.Alias == nil {\n\t\treturn nil\n\t}\n\n\tswitch {\n\tcase raw.SecurityIsEmpty:\n\t\t// empty, but non-nil security requirement\n\t\traw.Alias.Security = []map[string][]string{}\n\tcase len(raw.Alias.Security) == 0:\n\t\t// nil security requirement\n\t\traw.Alias.Security = nil\n\tdefault:\n\t\traw.Alias.Security = make([]map[string][]string, 0, len(raw.Security))\n\t\tfor _, req := range raw.Security {\n\t\t\tv := make(map[string][]string, len(req))\n\t\t\tfor k, val := range req {\n\t\t\t\tv[k] = make([]string, 0, len(val.List))\n\t\t\t\tv[k] = append(v[k], val.List...)\n\t\t\t}\n\t\t\traw.Alias.Security = append(raw.Alias.Security, v)\n\t\t}\n\t}\n\n\t*op = *(*OperationProps)(raw.Alias)\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/parameter.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// QueryParam creates a query parameter\nfunc QueryParam(name string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"query\"}}\n}\n\n// HeaderParam creates a header parameter, this is always required by default\nfunc HeaderParam(name string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"header\", Required: true}}\n}\n\n// PathParam creates a path parameter, this is always required\nfunc PathParam(name string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"path\", Required: true}}\n}\n\n// BodyParam creates a body parameter\nfunc BodyParam(name string, schema *Schema) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"body\", Schema: schema},\n\t\tSimpleSchema: SimpleSchema{Type: \"object\"}}\n}\n\n// FormDataParam creates a body parameter\nfunc FormDataParam(name string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"formData\"}}\n}\n\n// FileParam creates a body parameter\nfunc FileParam(name string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name, In: \"formData\"},\n\t\tSimpleSchema: SimpleSchema{Type: \"file\"}}\n}\n\n// SimpleArrayParam creates a param for a simple array (string, int, date etc)\nfunc SimpleArrayParam(name, tpe, fmt string) *Parameter {\n\treturn &Parameter{ParamProps: ParamProps{Name: name},\n\t\tSimpleSchema: SimpleSchema{Type: jsonArray, CollectionFormat: \"csv\",\n\t\t\tItems: &Items{SimpleSchema: SimpleSchema{Type: \"string\", Format: fmt}}}}\n}\n\n// ParamRef creates a parameter that's a json reference\nfunc ParamRef(uri string) *Parameter {\n\tp := new(Parameter)\n\tp.Ref = MustCreateRef(uri)\n\treturn p\n}\n\n// ParamProps describes the specific attributes of an operation parameter\n//\n// NOTE:\n// - Schema is defined when \"in\" == \"body\": see validate\n// - AllowEmptyValue is allowed where \"in\" == \"query\" || \"formData\"\ntype ParamProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tName string `json:\"name,omitempty\"`\n\tIn string `json:\"in,omitempty\"`\n\tRequired bool `json:\"required,omitempty\"`\n\tSchema *Schema `json:\"schema,omitempty\"`\n\tAllowEmptyValue bool `json:\"allowEmptyValue,omitempty\"`\n}\n\n// Parameter a unique parameter is defined by a combination of a [name](#parameterName) and [location](#parameterIn).\n//\n// There are five possible parameter types.\n// * Path - Used together with [Path Templating](#pathTemplating), where the parameter value is actually part\n// of the operation's URL. This does not include the host or base path of the API. For example, in `/items/{itemId}`,\n// the path parameter is `itemId`.\n// * Query - Parameters that are appended to the URL. For example, in `/items?id=###`, the query parameter is `id`.\n// * Header - Custom headers that are expected as part of the request.\n// * Body - The payload that's appended to the HTTP request. Since there can only be one payload, there can only be\n// _one_ body parameter. The name of the body parameter has no effect on the parameter itself and is used for\n// documentation purposes only. Since Form parameters are also in the payload, body and form parameters cannot exist\n// together for the same operation.\n// * Form - Used to describe the payload of an HTTP request when either `application/x-www-form-urlencoded` or\n// `multipart/form-data` are used as the content type of the request (in Swagger's definition,\n// the [`consumes`](#operationConsumes) property of an operation). This is the only parameter type that can be used\n// to send files, thus supporting the `file` type. Since form parameters are sent in the payload, they cannot be\n// declared together with a body parameter for the same operation. Form parameters have a different format based on\n// the content-type used (for further details, consult http://www.w3.org/TR/html401/interact/forms.html#h-17.13.4).\n// * `application/x-www-form-urlencoded` - Similar to the format of Query parameters but as a payload.\n// For example, `foo=1&bar=swagger` - both `foo` and `bar` are form parameters. This is normally used for simple\n// parameters that are being transferred.\n// * `multipart/form-data` - each parameter takes a section in the payload with an internal header.\n// For example, for the header `Content-Disposition: form-data; name=\"submit-name\"` the name of the parameter is\n// `submit-name`. This type of form parameters is more commonly used for file transfers.\n//\n// For more information: http://goo.gl/8us55a#parameterObject\ntype Parameter struct {\n\tRefable\n\tCommonValidations\n\tSimpleSchema\n\tVendorExtensible\n\tParamProps\n}\n\n// JSONLookup look up a value by the json property name\nfunc (p Parameter) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := p.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tif token == jsonRef {\n\t\treturn &p.Ref, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(p.CommonValidations, token)\n\tif err != nil && !strings.HasPrefix(err.Error(), \"object has no field\") {\n\t\treturn nil, err\n\t}\n\tif r != nil {\n\t\treturn r, nil\n\t}\n\tr, _, err = jsonpointer.GetForToken(p.SimpleSchema, token)\n\tif err != nil && !strings.HasPrefix(err.Error(), \"object has no field\") {\n\t\treturn nil, err\n\t}\n\tif r != nil {\n\t\treturn r, nil\n\t}\n\tr, _, err = jsonpointer.GetForToken(p.ParamProps, token)\n\treturn r, err\n}\n\n// WithDescription a fluent builder method for the description of the parameter\nfunc (p *Parameter) WithDescription(description string) *Parameter {\n\tp.Description = description\n\treturn p\n}\n\n// Named a fluent builder method to override the name of the parameter\nfunc (p *Parameter) Named(name string) *Parameter {\n\tp.Name = name\n\treturn p\n}\n\n// WithLocation a fluent builder method to override the location of the parameter\nfunc (p *Parameter) WithLocation(in string) *Parameter {\n\tp.In = in\n\treturn p\n}\n\n// Typed a fluent builder method for the type of the parameter value\nfunc (p *Parameter) Typed(tpe, format string) *Parameter {\n\tp.Type = tpe\n\tp.Format = format\n\treturn p\n}\n\n// CollectionOf a fluent builder method for an array parameter\nfunc (p *Parameter) CollectionOf(items *Items, format string) *Parameter {\n\tp.Type = jsonArray\n\tp.Items = items\n\tp.CollectionFormat = format\n\treturn p\n}\n\n// WithDefault sets the default value on this parameter\nfunc (p *Parameter) WithDefault(defaultValue interface{}) *Parameter {\n\tp.AsOptional() // with default implies optional\n\tp.Default = defaultValue\n\treturn p\n}\n\n// AllowsEmptyValues flags this parameter as being ok with empty values\nfunc (p *Parameter) AllowsEmptyValues() *Parameter {\n\tp.AllowEmptyValue = true\n\treturn p\n}\n\n// NoEmptyValues flags this parameter as not liking empty values\nfunc (p *Parameter) NoEmptyValues() *Parameter {\n\tp.AllowEmptyValue = false\n\treturn p\n}\n\n// AsOptional flags this parameter as optional\nfunc (p *Parameter) AsOptional() *Parameter {\n\tp.Required = false\n\treturn p\n}\n\n// AsRequired flags this parameter as required\nfunc (p *Parameter) AsRequired() *Parameter {\n\tif p.Default != nil { // with a default required makes no sense\n\t\treturn p\n\t}\n\tp.Required = true\n\treturn p\n}\n\n// WithMaxLength sets a max length value\nfunc (p *Parameter) WithMaxLength(max int64) *Parameter {\n\tp.MaxLength = &max\n\treturn p\n}\n\n// WithMinLength sets a min length value\nfunc (p *Parameter) WithMinLength(min int64) *Parameter {\n\tp.MinLength = &min\n\treturn p\n}\n\n// WithPattern sets a pattern value\nfunc (p *Parameter) WithPattern(pattern string) *Parameter {\n\tp.Pattern = pattern\n\treturn p\n}\n\n// WithMultipleOf sets a multiple of value\nfunc (p *Parameter) WithMultipleOf(number float64) *Parameter {\n\tp.MultipleOf = &number\n\treturn p\n}\n\n// WithMaximum sets a maximum number value\nfunc (p *Parameter) WithMaximum(max float64, exclusive bool) *Parameter {\n\tp.Maximum = &max\n\tp.ExclusiveMaximum = exclusive\n\treturn p\n}\n\n// WithMinimum sets a minimum number value\nfunc (p *Parameter) WithMinimum(min float64, exclusive bool) *Parameter {\n\tp.Minimum = &min\n\tp.ExclusiveMinimum = exclusive\n\treturn p\n}\n\n// WithEnum sets a the enum values (replace)\nfunc (p *Parameter) WithEnum(values ...interface{}) *Parameter {\n\tp.Enum = append([]interface{}{}, values...)\n\treturn p\n}\n\n// WithMaxItems sets the max items\nfunc (p *Parameter) WithMaxItems(size int64) *Parameter {\n\tp.MaxItems = &size\n\treturn p\n}\n\n// WithMinItems sets the min items\nfunc (p *Parameter) WithMinItems(size int64) *Parameter {\n\tp.MinItems = &size\n\treturn p\n}\n\n// UniqueValues dictates that this array can only have unique items\nfunc (p *Parameter) UniqueValues() *Parameter {\n\tp.UniqueItems = true\n\treturn p\n}\n\n// AllowDuplicates this array can have duplicates\nfunc (p *Parameter) AllowDuplicates() *Parameter {\n\tp.UniqueItems = false\n\treturn p\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (p *Parameter) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &p.CommonValidations); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &p.Refable); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &p.SimpleSchema); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &p.VendorExtensible); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &p.ParamProps)\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (p Parameter) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(p.CommonValidations)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(p.SimpleSchema)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb3, err := json.Marshal(p.Refable)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb4, err := json.Marshal(p.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb5, err := json.Marshal(p.ParamProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b3, b1, b2, b4, b5), nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/path_item.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// PathItemProps the path item specific properties\ntype PathItemProps struct {\n\tGet *Operation `json:\"get,omitempty\"`\n\tPut *Operation `json:\"put,omitempty\"`\n\tPost *Operation `json:\"post,omitempty\"`\n\tDelete *Operation `json:\"delete,omitempty\"`\n\tOptions *Operation `json:\"options,omitempty\"`\n\tHead *Operation `json:\"head,omitempty\"`\n\tPatch *Operation `json:\"patch,omitempty\"`\n\tParameters []Parameter `json:\"parameters,omitempty\"`\n}\n\n// PathItem describes the operations available on a single path.\n// A Path Item may be empty, due to [ACL constraints](http://goo.gl/8us55a#securityFiltering).\n// The path itself is still exposed to the documentation viewer but they will\n// not know which operations and parameters are available.\n//\n// For more information: http://goo.gl/8us55a#pathItemObject\ntype PathItem struct {\n\tRefable\n\tVendorExtensible\n\tPathItemProps\n}\n\n// JSONLookup look up a value by the json property name\nfunc (p PathItem) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := p.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tif token == jsonRef {\n\t\treturn &p.Ref, nil\n\t}\n\tr, _, err := jsonpointer.GetForToken(p.PathItemProps, token)\n\treturn r, err\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (p *PathItem) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &p.Refable); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &p.VendorExtensible); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &p.PathItemProps)\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (p PathItem) MarshalJSON() ([]byte, error) {\n\tb3, err := json.Marshal(p.Refable)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb4, err := json.Marshal(p.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb5, err := json.Marshal(p.PathItemProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tconcated := swag.ConcatJSON(b3, b4, b5)\n\treturn concated, nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/paths.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/swag\"\n)\n\n// Paths holds the relative paths to the individual endpoints.\n// The path is appended to the [`basePath`](http://goo.gl/8us55a#swaggerBasePath) in order\n// to construct the full URL.\n// The Paths may be empty, due to [ACL constraints](http://goo.gl/8us55a#securityFiltering).\n//\n// For more information: http://goo.gl/8us55a#pathsObject\ntype Paths struct {\n\tVendorExtensible\n\tPaths map[string]PathItem `json:\"-\"` // custom serializer to flatten this, each entry must start with \"/\"\n}\n\n// JSONLookup look up a value by the json property name\nfunc (p Paths) JSONLookup(token string) (interface{}, error) {\n\tif pi, ok := p.Paths[token]; ok {\n\t\treturn &pi, nil\n\t}\n\tif ex, ok := p.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\treturn nil, fmt.Errorf(\"object has no field %q\", token)\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (p *Paths) UnmarshalJSON(data []byte) error {\n\tvar res map[string]json.RawMessage\n\tif err := json.Unmarshal(data, &res); err != nil {\n\t\treturn err\n\t}\n\tfor k, v := range res {\n\t\tif strings.HasPrefix(strings.ToLower(k), \"x-\") {\n\t\t\tif p.Extensions == nil {\n\t\t\t\tp.Extensions = make(map[string]interface{})\n\t\t\t}\n\t\t\tvar d interface{}\n\t\t\tif err := json.Unmarshal(v, &d); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tp.Extensions[k] = d\n\t\t}\n\t\tif strings.HasPrefix(k, \"/\") {\n\t\t\tif p.Paths == nil {\n\t\t\t\tp.Paths = make(map[string]PathItem)\n\t\t\t}\n\t\t\tvar pi PathItem\n\t\t\tif err := json.Unmarshal(v, &pi); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tp.Paths[k] = pi\n\t\t}\n\t}\n\treturn nil\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (p Paths) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(p.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tpths := make(map[string]PathItem)\n\tfor k, v := range p.Paths {\n\t\tif strings.HasPrefix(k, \"/\") {\n\t\t\tpths[k] = v\n\t\t}\n\t}\n\tb2, err := json.Marshal(pths)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tconcated := swag.ConcatJSON(b1, b2)\n\treturn concated, nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/ref.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"bytes\"\n\t\"encoding/gob\"\n\t\"encoding/json\"\n\t\"net/http\"\n\t\"os\"\n\t\"path/filepath\"\n\n\t\"github.com/go-openapi/jsonreference\"\n)\n\n// Refable is a struct for things that accept a $ref property\ntype Refable struct {\n\tRef Ref\n}\n\n// MarshalJSON marshals the ref to json\nfunc (r Refable) MarshalJSON() ([]byte, error) {\n\treturn r.Ref.MarshalJSON()\n}\n\n// UnmarshalJSON unmarshalss the ref from json\nfunc (r *Refable) UnmarshalJSON(d []byte) error {\n\treturn json.Unmarshal(d, &r.Ref)\n}\n\n// Ref represents a json reference that is potentially resolved\ntype Ref struct {\n\tjsonreference.Ref\n}\n\n// RemoteURI gets the remote uri part of the ref\nfunc (r *Ref) RemoteURI() string {\n\tif r.String() == \"\" {\n\t\treturn r.String()\n\t}\n\n\tu := *r.GetURL()\n\tu.Fragment = \"\"\n\treturn u.String()\n}\n\n// IsValidURI returns true when the url the ref points to can be found\nfunc (r *Ref) IsValidURI(basepaths ...string) bool {\n\tif r.String() == \"\" {\n\t\treturn true\n\t}\n\n\tv := r.RemoteURI()\n\tif v == \"\" {\n\t\treturn true\n\t}\n\n\tif r.HasFullURL {\n\t\trr, err := http.Get(v)\n\t\tif err != nil {\n\t\t\treturn false\n\t\t}\n\n\t\treturn rr.StatusCode/100 == 2\n\t}\n\n\tif !(r.HasFileScheme || r.HasFullFilePath || r.HasURLPathOnly) {\n\t\treturn false\n\t}\n\n\t// check for local file\n\tpth := v\n\tif r.HasURLPathOnly {\n\t\tbase := \".\"\n\t\tif len(basepaths) > 0 {\n\t\t\tbase = filepath.Dir(filepath.Join(basepaths...))\n\t\t}\n\t\tp, e := filepath.Abs(filepath.ToSlash(filepath.Join(base, pth)))\n\t\tif e != nil {\n\t\t\treturn false\n\t\t}\n\t\tpth = p\n\t}\n\n\tfi, err := os.Stat(filepath.ToSlash(pth))\n\tif err != nil {\n\t\treturn false\n\t}\n\n\treturn !fi.IsDir()\n}\n\n// Inherits creates a new reference from a parent and a child\n// If the child cannot inherit from the parent, an error is returned\nfunc (r *Ref) Inherits(child Ref) (*Ref, error) {\n\tref, err := r.Ref.Inherits(child.Ref)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &Ref{Ref: *ref}, nil\n}\n\n// NewRef creates a new instance of a ref object\n// returns an error when the reference uri is an invalid uri\nfunc NewRef(refURI string) (Ref, error) {\n\tref, err := jsonreference.New(refURI)\n\tif err != nil {\n\t\treturn Ref{}, err\n\t}\n\treturn Ref{Ref: ref}, nil\n}\n\n// MustCreateRef creates a ref object but panics when refURI is invalid.\n// Use the NewRef method for a version that returns an error.\nfunc MustCreateRef(refURI string) Ref {\n\treturn Ref{Ref: jsonreference.MustCreateRef(refURI)}\n}\n\n// MarshalJSON marshals this ref into a JSON object\nfunc (r Ref) MarshalJSON() ([]byte, error) {\n\tstr := r.String()\n\tif str == \"\" {\n\t\tif r.IsRoot() {\n\t\t\treturn []byte(`{\"$ref\":\"\"}`), nil\n\t\t}\n\t\treturn []byte(\"{}\"), nil\n\t}\n\tv := map[string]interface{}{\"$ref\": str}\n\treturn json.Marshal(v)\n}\n\n// UnmarshalJSON unmarshals this ref from a JSON object\nfunc (r *Ref) UnmarshalJSON(d []byte) error {\n\tvar v map[string]interface{}\n\tif err := json.Unmarshal(d, &v); err != nil {\n\t\treturn err\n\t}\n\treturn r.fromMap(v)\n}\n\n// GobEncode provides a safe gob encoder for Ref\nfunc (r Ref) GobEncode() ([]byte, error) {\n\tvar b bytes.Buffer\n\traw, err := r.MarshalJSON()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\terr = gob.NewEncoder(&b).Encode(raw)\n\treturn b.Bytes(), err\n}\n\n// GobDecode provides a safe gob decoder for Ref\nfunc (r *Ref) GobDecode(b []byte) error {\n\tvar raw []byte\n\tbuf := bytes.NewBuffer(b)\n\terr := gob.NewDecoder(buf).Decode(&raw)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(raw, r)\n}\n\nfunc (r *Ref) fromMap(v map[string]interface{}) error {\n\tif v == nil {\n\t\treturn nil\n\t}\n\n\tif vv, ok := v[\"$ref\"]; ok {\n\t\tif str, ok := vv.(string); ok {\n\t\t\tref, err := jsonreference.New(str)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\t*r = Ref{Ref: ref}\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/response.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// ResponseProps properties specific to a response\ntype ResponseProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tSchema *Schema `json:\"schema,omitempty\"`\n\tHeaders map[string]Header `json:\"headers,omitempty\"`\n\tExamples map[string]interface{} `json:\"examples,omitempty\"`\n}\n\n// Response describes a single response from an API Operation.\n//\n// For more information: http://goo.gl/8us55a#responseObject\ntype Response struct {\n\tRefable\n\tResponseProps\n\tVendorExtensible\n}\n\n// JSONLookup look up a value by the json property name\nfunc (r Response) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := r.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tif token == \"$ref\" {\n\t\treturn &r.Ref, nil\n\t}\n\tptr, _, err := jsonpointer.GetForToken(r.ResponseProps, token)\n\treturn ptr, err\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (r *Response) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &r.ResponseProps); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &r.Refable); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &r.VendorExtensible)\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (r Response) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(r.ResponseProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(r.Refable)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb3, err := json.Marshal(r.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2, b3), nil\n}\n\n// NewResponse creates a new response instance\nfunc NewResponse() *Response {\n\treturn new(Response)\n}\n\n// ResponseRef creates a response as a json reference\nfunc ResponseRef(url string) *Response {\n\tresp := NewResponse()\n\tresp.Ref = MustCreateRef(url)\n\treturn resp\n}\n\n// WithDescription sets the description on this response, allows for chaining\nfunc (r *Response) WithDescription(description string) *Response {\n\tr.Description = description\n\treturn r\n}\n\n// WithSchema sets the schema on this response, allows for chaining.\n// Passing a nil argument removes the schema from this response\nfunc (r *Response) WithSchema(schema *Schema) *Response {\n\tr.Schema = schema\n\treturn r\n}\n\n// AddHeader adds a header to this response\nfunc (r *Response) AddHeader(name string, header *Header) *Response {\n\tif header == nil {\n\t\treturn r.RemoveHeader(name)\n\t}\n\tif r.Headers == nil {\n\t\tr.Headers = make(map[string]Header)\n\t}\n\tr.Headers[name] = *header\n\treturn r\n}\n\n// RemoveHeader removes a header from this response\nfunc (r *Response) RemoveHeader(name string) *Response {\n\tdelete(r.Headers, name)\n\treturn r\n}\n\n// AddExample adds an example to this response\nfunc (r *Response) AddExample(mediaType string, example interface{}) *Response {\n\tif r.Examples == nil {\n\t\tr.Examples = make(map[string]interface{})\n\t}\n\tr.Examples[mediaType] = example\n\treturn r\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/responses.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\n\t\"github.com/go-openapi/swag\"\n)\n\n// Responses is a container for the expected responses of an operation.\n// The container maps a HTTP response code to the expected response.\n// It is not expected from the documentation to necessarily cover all possible HTTP response codes,\n// since they may not be known in advance. However, it is expected from the documentation to cover\n// a successful operation response and any known errors.\n//\n// The `default` can be used a default response object for all HTTP codes that are not covered\n// individually by the specification.\n//\n// The `Responses Object` MUST contain at least one response code, and it SHOULD be the response\n// for a successful operation call.\n//\n// For more information: http://goo.gl/8us55a#responsesObject\ntype Responses struct {\n\tVendorExtensible\n\tResponsesProps\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (r Responses) JSONLookup(token string) (interface{}, error) {\n\tif token == \"default\" {\n\t\treturn r.Default, nil\n\t}\n\tif ex, ok := r.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tif i, err := strconv.Atoi(token); err == nil {\n\t\tif scr, ok := r.StatusCodeResponses[i]; ok {\n\t\t\treturn scr, nil\n\t\t}\n\t}\n\treturn nil, fmt.Errorf(\"object has no field %q\", token)\n}\n\n// UnmarshalJSON hydrates this items instance with the data from JSON\nfunc (r *Responses) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &r.ResponsesProps); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &r.VendorExtensible); err != nil {\n\t\treturn err\n\t}\n\tif reflect.DeepEqual(ResponsesProps{}, r.ResponsesProps) {\n\t\tr.ResponsesProps = ResponsesProps{}\n\t}\n\treturn nil\n}\n\n// MarshalJSON converts this items object to JSON\nfunc (r Responses) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(r.ResponsesProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(r.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tconcated := swag.ConcatJSON(b1, b2)\n\treturn concated, nil\n}\n\n// ResponsesProps describes all responses for an operation.\n// It tells what is the default response and maps all responses with a\n// HTTP status code.\ntype ResponsesProps struct {\n\tDefault *Response\n\tStatusCodeResponses map[int]Response\n}\n\n// MarshalJSON marshals responses as JSON\nfunc (r ResponsesProps) MarshalJSON() ([]byte, error) {\n\ttoser := map[string]Response{}\n\tif r.Default != nil {\n\t\ttoser[\"default\"] = *r.Default\n\t}\n\tfor k, v := range r.StatusCodeResponses {\n\t\ttoser[strconv.Itoa(k)] = v\n\t}\n\treturn json.Marshal(toser)\n}\n\n// UnmarshalJSON unmarshals responses from JSON\nfunc (r *ResponsesProps) UnmarshalJSON(data []byte) error {\n\tvar res map[string]Response\n\tif err := json.Unmarshal(data, &res); err != nil {\n\t\treturn nil\n\t}\n\tif v, ok := res[\"default\"]; ok {\n\t\tr.Default = &v\n\t\tdelete(res, \"default\")\n\t}\n\tfor k, v := range res {\n\t\tif nk, err := strconv.Atoi(k); err == nil {\n\t\t\tif r.StatusCodeResponses == nil {\n\t\t\t\tr.StatusCodeResponses = map[int]Response{}\n\t\t\t}\n\t\t\tr.StatusCodeResponses[nk] = v\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/schema.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"net/url\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// BooleanProperty creates a boolean property\nfunc BooleanProperty() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"boolean\"}}}\n}\n\n// BoolProperty creates a boolean property\nfunc BoolProperty() *Schema { return BooleanProperty() }\n\n// StringProperty creates a string property\nfunc StringProperty() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"string\"}}}\n}\n\n// CharProperty creates a string property\nfunc CharProperty() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"string\"}}}\n}\n\n// Float64Property creates a float64/double property\nfunc Float64Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"number\"}, Format: \"double\"}}\n}\n\n// Float32Property creates a float32/float property\nfunc Float32Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"number\"}, Format: \"float\"}}\n}\n\n// Int8Property creates an int8 property\nfunc Int8Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"integer\"}, Format: \"int8\"}}\n}\n\n// Int16Property creates an int16 property\nfunc Int16Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"integer\"}, Format: \"int16\"}}\n}\n\n// Int32Property creates an int32 property\nfunc Int32Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"integer\"}, Format: \"int32\"}}\n}\n\n// Int64Property creates an int64 property\nfunc Int64Property() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"integer\"}, Format: \"int64\"}}\n}\n\n// StrFmtProperty creates a property for the named string format\nfunc StrFmtProperty(format string) *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"string\"}, Format: format}}\n}\n\n// DateProperty creates a date property\nfunc DateProperty() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"string\"}, Format: \"date\"}}\n}\n\n// DateTimeProperty creates a date time property\nfunc DateTimeProperty() *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"string\"}, Format: \"date-time\"}}\n}\n\n// MapProperty creates a map property\nfunc MapProperty(property *Schema) *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"object\"},\n\t\tAdditionalProperties: &SchemaOrBool{Allows: true, Schema: property}}}\n}\n\n// RefProperty creates a ref property\nfunc RefProperty(name string) *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Ref: MustCreateRef(name)}}\n}\n\n// RefSchema creates a ref property\nfunc RefSchema(name string) *Schema {\n\treturn &Schema{SchemaProps: SchemaProps{Ref: MustCreateRef(name)}}\n}\n\n// ArrayProperty creates an array property\nfunc ArrayProperty(items *Schema) *Schema {\n\tif items == nil {\n\t\treturn &Schema{SchemaProps: SchemaProps{Type: []string{\"array\"}}}\n\t}\n\treturn &Schema{SchemaProps: SchemaProps{Items: &SchemaOrArray{Schema: items}, Type: []string{\"array\"}}}\n}\n\n// ComposedSchema creates a schema with allOf\nfunc ComposedSchema(schemas ...Schema) *Schema {\n\ts := new(Schema)\n\ts.AllOf = schemas\n\treturn s\n}\n\n// SchemaURL represents a schema url\ntype SchemaURL string\n\n// MarshalJSON marshal this to JSON\nfunc (r SchemaURL) MarshalJSON() ([]byte, error) {\n\tif r == \"\" {\n\t\treturn []byte(\"{}\"), nil\n\t}\n\tv := map[string]interface{}{\"$schema\": string(r)}\n\treturn json.Marshal(v)\n}\n\n// UnmarshalJSON unmarshal this from JSON\nfunc (r *SchemaURL) UnmarshalJSON(data []byte) error {\n\tvar v map[string]interface{}\n\tif err := json.Unmarshal(data, &v); err != nil {\n\t\treturn err\n\t}\n\treturn r.fromMap(v)\n}\n\nfunc (r *SchemaURL) fromMap(v map[string]interface{}) error {\n\tif v == nil {\n\t\treturn nil\n\t}\n\tif vv, ok := v[\"$schema\"]; ok {\n\t\tif str, ok := vv.(string); ok {\n\t\t\tu, err := url.Parse(str)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\t*r = SchemaURL(u.String())\n\t\t}\n\t}\n\treturn nil\n}\n\n// SchemaProps describes a JSON schema (draft 4)\ntype SchemaProps struct {\n\tID string `json:\"id,omitempty\"`\n\tRef Ref `json:\"-\"`\n\tSchema SchemaURL `json:\"-\"`\n\tDescription string `json:\"description,omitempty\"`\n\tType StringOrArray `json:\"type,omitempty\"`\n\tFormat string `json:\"format,omitempty\"`\n\tTitle string `json:\"title,omitempty\"`\n\tDefault interface{} `json:\"default,omitempty\"`\n\tMaximum *float64 `json:\"maximum,omitempty\"`\n\tExclusiveMaximum bool `json:\"exclusiveMaximum,omitempty\"`\n\tMinimum *float64 `json:\"minimum,omitempty\"`\n\tExclusiveMinimum bool `json:\"exclusiveMinimum,omitempty\"`\n\tMaxLength *int64 `json:\"maxLength,omitempty\"`\n\tMinLength *int64 `json:\"minLength,omitempty\"`\n\tPattern string `json:\"pattern,omitempty\"`\n\tMaxItems *int64 `json:\"maxItems,omitempty\"`\n\tMinItems *int64 `json:\"minItems,omitempty\"`\n\tUniqueItems bool `json:\"uniqueItems,omitempty\"`\n\tMultipleOf *float64 `json:\"multipleOf,omitempty\"`\n\tEnum []interface{} `json:\"enum,omitempty\"`\n\tMaxProperties *int64 `json:\"maxProperties,omitempty\"`\n\tMinProperties *int64 `json:\"minProperties,omitempty\"`\n\tRequired []string `json:\"required,omitempty\"`\n\tItems *SchemaOrArray `json:\"items,omitempty\"`\n\tAllOf []Schema `json:\"allOf,omitempty\"`\n\tOneOf []Schema `json:\"oneOf,omitempty\"`\n\tAnyOf []Schema `json:\"anyOf,omitempty\"`\n\tNot *Schema `json:\"not,omitempty\"`\n\tProperties map[string]Schema `json:\"properties,omitempty\"`\n\tAdditionalProperties *SchemaOrBool `json:\"additionalProperties,omitempty\"`\n\tPatternProperties map[string]Schema `json:\"patternProperties,omitempty\"`\n\tDependencies Dependencies `json:\"dependencies,omitempty\"`\n\tAdditionalItems *SchemaOrBool `json:\"additionalItems,omitempty\"`\n\tDefinitions Definitions `json:\"definitions,omitempty\"`\n}\n\n// SwaggerSchemaProps are additional properties supported by swagger schemas, but not JSON-schema (draft 4)\ntype SwaggerSchemaProps struct {\n\tDiscriminator string `json:\"discriminator,omitempty\"`\n\tReadOnly bool `json:\"readOnly,omitempty\"`\n\tXML *XMLObject `json:\"xml,omitempty\"`\n\tExternalDocs *ExternalDocumentation `json:\"externalDocs,omitempty\"`\n\tExample interface{} `json:\"example,omitempty\"`\n}\n\n// Schema the schema object allows the definition of input and output data types.\n// These types can be objects, but also primitives and arrays.\n// This object is based on the [JSON Schema Specification Draft 4](http://json-schema.org/)\n// and uses a predefined subset of it.\n// On top of this subset, there are extensions provided by this specification to allow for more complete documentation.\n//\n// For more information: http://goo.gl/8us55a#schemaObject\ntype Schema struct {\n\tVendorExtensible\n\tSchemaProps\n\tSwaggerSchemaProps\n\tExtraProps map[string]interface{} `json:\"-\"`\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (s Schema) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := s.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\n\tif ex, ok := s.ExtraProps[token]; ok {\n\t\treturn &ex, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(s.SchemaProps, token)\n\tif r != nil || (err != nil && !strings.HasPrefix(err.Error(), \"object has no field\")) {\n\t\treturn r, err\n\t}\n\tr, _, err = jsonpointer.GetForToken(s.SwaggerSchemaProps, token)\n\treturn r, err\n}\n\n// WithID sets the id for this schema, allows for chaining\nfunc (s *Schema) WithID(id string) *Schema {\n\ts.ID = id\n\treturn s\n}\n\n// WithTitle sets the title for this schema, allows for chaining\nfunc (s *Schema) WithTitle(title string) *Schema {\n\ts.Title = title\n\treturn s\n}\n\n// WithDescription sets the description for this schema, allows for chaining\nfunc (s *Schema) WithDescription(description string) *Schema {\n\ts.Description = description\n\treturn s\n}\n\n// WithProperties sets the properties for this schema\nfunc (s *Schema) WithProperties(schemas map[string]Schema) *Schema {\n\ts.Properties = schemas\n\treturn s\n}\n\n// SetProperty sets a property on this schema\nfunc (s *Schema) SetProperty(name string, schema Schema) *Schema {\n\tif s.Properties == nil {\n\t\ts.Properties = make(map[string]Schema)\n\t}\n\ts.Properties[name] = schema\n\treturn s\n}\n\n// WithAllOf sets the all of property\nfunc (s *Schema) WithAllOf(schemas ...Schema) *Schema {\n\ts.AllOf = schemas\n\treturn s\n}\n\n// WithMaxProperties sets the max number of properties an object can have\nfunc (s *Schema) WithMaxProperties(max int64) *Schema {\n\ts.MaxProperties = &max\n\treturn s\n}\n\n// WithMinProperties sets the min number of properties an object must have\nfunc (s *Schema) WithMinProperties(min int64) *Schema {\n\ts.MinProperties = &min\n\treturn s\n}\n\n// Typed sets the type of this schema for a single value item\nfunc (s *Schema) Typed(tpe, format string) *Schema {\n\ts.Type = []string{tpe}\n\ts.Format = format\n\treturn s\n}\n\n// AddType adds a type with potential format to the types for this schema\nfunc (s *Schema) AddType(tpe, format string) *Schema {\n\ts.Type = append(s.Type, tpe)\n\tif format != \"\" {\n\t\ts.Format = format\n\t}\n\treturn s\n}\n\n// CollectionOf a fluent builder method for an array parameter\nfunc (s *Schema) CollectionOf(items Schema) *Schema {\n\ts.Type = []string{jsonArray}\n\ts.Items = &SchemaOrArray{Schema: &items}\n\treturn s\n}\n\n// WithDefault sets the default value on this parameter\nfunc (s *Schema) WithDefault(defaultValue interface{}) *Schema {\n\ts.Default = defaultValue\n\treturn s\n}\n\n// WithRequired flags this parameter as required\nfunc (s *Schema) WithRequired(items ...string) *Schema {\n\ts.Required = items\n\treturn s\n}\n\n// AddRequired adds field names to the required properties array\nfunc (s *Schema) AddRequired(items ...string) *Schema {\n\ts.Required = append(s.Required, items...)\n\treturn s\n}\n\n// WithMaxLength sets a max length value\nfunc (s *Schema) WithMaxLength(max int64) *Schema {\n\ts.MaxLength = &max\n\treturn s\n}\n\n// WithMinLength sets a min length value\nfunc (s *Schema) WithMinLength(min int64) *Schema {\n\ts.MinLength = &min\n\treturn s\n}\n\n// WithPattern sets a pattern value\nfunc (s *Schema) WithPattern(pattern string) *Schema {\n\ts.Pattern = pattern\n\treturn s\n}\n\n// WithMultipleOf sets a multiple of value\nfunc (s *Schema) WithMultipleOf(number float64) *Schema {\n\ts.MultipleOf = &number\n\treturn s\n}\n\n// WithMaximum sets a maximum number value\nfunc (s *Schema) WithMaximum(max float64, exclusive bool) *Schema {\n\ts.Maximum = &max\n\ts.ExclusiveMaximum = exclusive\n\treturn s\n}\n\n// WithMinimum sets a minimum number value\nfunc (s *Schema) WithMinimum(min float64, exclusive bool) *Schema {\n\ts.Minimum = &min\n\ts.ExclusiveMinimum = exclusive\n\treturn s\n}\n\n// WithEnum sets a the enum values (replace)\nfunc (s *Schema) WithEnum(values ...interface{}) *Schema {\n\ts.Enum = append([]interface{}{}, values...)\n\treturn s\n}\n\n// WithMaxItems sets the max items\nfunc (s *Schema) WithMaxItems(size int64) *Schema {\n\ts.MaxItems = &size\n\treturn s\n}\n\n// WithMinItems sets the min items\nfunc (s *Schema) WithMinItems(size int64) *Schema {\n\ts.MinItems = &size\n\treturn s\n}\n\n// UniqueValues dictates that this array can only have unique items\nfunc (s *Schema) UniqueValues() *Schema {\n\ts.UniqueItems = true\n\treturn s\n}\n\n// AllowDuplicates this array can have duplicates\nfunc (s *Schema) AllowDuplicates() *Schema {\n\ts.UniqueItems = false\n\treturn s\n}\n\n// AddToAllOf adds a schema to the allOf property\nfunc (s *Schema) AddToAllOf(schemas ...Schema) *Schema {\n\ts.AllOf = append(s.AllOf, schemas...)\n\treturn s\n}\n\n// WithDiscriminator sets the name of the discriminator field\nfunc (s *Schema) WithDiscriminator(discriminator string) *Schema {\n\ts.Discriminator = discriminator\n\treturn s\n}\n\n// AsReadOnly flags this schema as readonly\nfunc (s *Schema) AsReadOnly() *Schema {\n\ts.ReadOnly = true\n\treturn s\n}\n\n// AsWritable flags this schema as writeable (not read-only)\nfunc (s *Schema) AsWritable() *Schema {\n\ts.ReadOnly = false\n\treturn s\n}\n\n// WithExample sets the example for this schema\nfunc (s *Schema) WithExample(example interface{}) *Schema {\n\ts.Example = example\n\treturn s\n}\n\n// WithExternalDocs sets/removes the external docs for/from this schema.\n// When you pass empty strings as params the external documents will be removed.\n// When you pass non-empty string as one value then those values will be used on the external docs object.\n// So when you pass a non-empty description, you should also pass the url and vice versa.\nfunc (s *Schema) WithExternalDocs(description, url string) *Schema {\n\tif description == \"\" && url == \"\" {\n\t\ts.ExternalDocs = nil\n\t\treturn s\n\t}\n\n\tif s.ExternalDocs == nil {\n\t\ts.ExternalDocs = &ExternalDocumentation{}\n\t}\n\ts.ExternalDocs.Description = description\n\ts.ExternalDocs.URL = url\n\treturn s\n}\n\n// WithXMLName sets the xml name for the object\nfunc (s *Schema) WithXMLName(name string) *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Name = name\n\treturn s\n}\n\n// WithXMLNamespace sets the xml namespace for the object\nfunc (s *Schema) WithXMLNamespace(namespace string) *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Namespace = namespace\n\treturn s\n}\n\n// WithXMLPrefix sets the xml prefix for the object\nfunc (s *Schema) WithXMLPrefix(prefix string) *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Prefix = prefix\n\treturn s\n}\n\n// AsXMLAttribute flags this object as xml attribute\nfunc (s *Schema) AsXMLAttribute() *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Attribute = true\n\treturn s\n}\n\n// AsXMLElement flags this object as an xml node\nfunc (s *Schema) AsXMLElement() *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Attribute = false\n\treturn s\n}\n\n// AsWrappedXML flags this object as wrapped, this is mostly useful for array types\nfunc (s *Schema) AsWrappedXML() *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Wrapped = true\n\treturn s\n}\n\n// AsUnwrappedXML flags this object as an xml node\nfunc (s *Schema) AsUnwrappedXML() *Schema {\n\tif s.XML == nil {\n\t\ts.XML = new(XMLObject)\n\t}\n\ts.XML.Wrapped = false\n\treturn s\n}\n\n// MarshalJSON marshal this to JSON\nfunc (s Schema) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(s.SchemaProps)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"schema props %v\", err)\n\t}\n\tb2, err := json.Marshal(s.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"vendor props %v\", err)\n\t}\n\tb3, err := s.Ref.MarshalJSON()\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"ref prop %v\", err)\n\t}\n\tb4, err := s.Schema.MarshalJSON()\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"schema prop %v\", err)\n\t}\n\tb5, err := json.Marshal(s.SwaggerSchemaProps)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"common validations %v\", err)\n\t}\n\tvar b6 []byte\n\tif s.ExtraProps != nil {\n\t\tjj, err := json.Marshal(s.ExtraProps)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"extra props %v\", err)\n\t\t}\n\t\tb6 = jj\n\t}\n\treturn swag.ConcatJSON(b1, b2, b3, b4, b5, b6), nil\n}\n\n// UnmarshalJSON marshal this from JSON\nfunc (s *Schema) UnmarshalJSON(data []byte) error {\n\tprops := struct {\n\t\tSchemaProps\n\t\tSwaggerSchemaProps\n\t}{}\n\tif err := json.Unmarshal(data, &props); err != nil {\n\t\treturn err\n\t}\n\n\tsch := Schema{\n\t\tSchemaProps: props.SchemaProps,\n\t\tSwaggerSchemaProps: props.SwaggerSchemaProps,\n\t}\n\n\tvar d map[string]interface{}\n\tif err := json.Unmarshal(data, &d); err != nil {\n\t\treturn err\n\t}\n\n\t_ = sch.Ref.fromMap(d)\n\t_ = sch.Schema.fromMap(d)\n\n\tdelete(d, \"$ref\")\n\tdelete(d, \"$schema\")\n\tfor _, pn := range swag.DefaultJSONNameProvider.GetJSONNames(s) {\n\t\tdelete(d, pn)\n\t}\n\n\tfor k, vv := range d {\n\t\tlk := strings.ToLower(k)\n\t\tif strings.HasPrefix(lk, \"x-\") {\n\t\t\tif sch.Extensions == nil {\n\t\t\t\tsch.Extensions = map[string]interface{}{}\n\t\t\t}\n\t\t\tsch.Extensions[k] = vv\n\t\t\tcontinue\n\t\t}\n\t\tif sch.ExtraProps == nil {\n\t\t\tsch.ExtraProps = map[string]interface{}{}\n\t\t}\n\t\tsch.ExtraProps[k] = vv\n\t}\n\n\t*s = sch\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/schema_loader.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"log\"\n\t\"net/url\"\n\t\"reflect\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/swag\"\n)\n\n// PathLoader function to use when loading remote refs\nvar PathLoader func(string) (json.RawMessage, error)\n\nfunc init() {\n\tPathLoader = func(path string) (json.RawMessage, error) {\n\t\tdata, err := swag.LoadFromFileOrHTTP(path)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn json.RawMessage(data), nil\n\t}\n}\n\n// resolverContext allows to share a context during spec processing.\n// At the moment, it just holds the index of circular references found.\ntype resolverContext struct {\n\t// circulars holds all visited circular references, which allows shortcuts.\n\t// NOTE: this is not just a performance improvement: it is required to figure out\n\t// circular references which participate several cycles.\n\t// This structure is privately instantiated and needs not be locked against\n\t// concurrent access, unless we chose to implement a parallel spec walking.\n\tcirculars map[string]bool\n\tbasePath string\n}\n\nfunc newResolverContext(originalBasePath string) *resolverContext {\n\treturn &resolverContext{\n\t\tcirculars: make(map[string]bool),\n\t\tbasePath: originalBasePath, // keep the root base path in context\n\t}\n}\n\ntype schemaLoader struct {\n\troot interface{}\n\toptions *ExpandOptions\n\tcache ResolutionCache\n\tcontext *resolverContext\n\tloadDoc func(string) (json.RawMessage, error)\n}\n\nfunc (r *schemaLoader) transitiveResolver(basePath string, ref Ref) (*schemaLoader, error) {\n\tif ref.IsRoot() || ref.HasFragmentOnly {\n\t\treturn r, nil\n\t}\n\n\tbaseRef, _ := NewRef(basePath)\n\tcurrentRef := normalizeFileRef(&ref, basePath)\n\tif strings.HasPrefix(currentRef.String(), baseRef.String()) {\n\t\treturn r, nil\n\t}\n\n\t// Set a new root to resolve against\n\trootURL := currentRef.GetURL()\n\trootURL.Fragment = \"\"\n\troot, _ := r.cache.Get(rootURL.String())\n\n\t// shallow copy of resolver options to set a new RelativeBase when\n\t// traversing multiple documents\n\tnewOptions := r.options\n\tnewOptions.RelativeBase = rootURL.String()\n\tdebugLog(\"setting new root: %s\", newOptions.RelativeBase)\n\tresolver, err := defaultSchemaLoader(root, newOptions, r.cache, r.context)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn resolver, nil\n}\n\nfunc (r *schemaLoader) updateBasePath(transitive *schemaLoader, basePath string) string {\n\tif transitive != r {\n\t\tdebugLog(\"got a new resolver\")\n\t\tif transitive.options != nil && transitive.options.RelativeBase != \"\" {\n\t\t\tbasePath, _ = absPath(transitive.options.RelativeBase)\n\t\t\tdebugLog(\"new basePath = %s\", basePath)\n\t\t}\n\t}\n\treturn basePath\n}\n\nfunc (r *schemaLoader) resolveRef(ref *Ref, target interface{}, basePath string) error {\n\ttgt := reflect.ValueOf(target)\n\tif tgt.Kind() != reflect.Ptr {\n\t\treturn fmt.Errorf(\"resolve ref: target needs to be a pointer\")\n\t}\n\n\trefURL := ref.GetURL()\n\tif refURL == nil {\n\t\treturn nil\n\t}\n\n\tvar res interface{}\n\tvar data interface{}\n\tvar err error\n\t// Resolve against the root if it isn't nil, and if ref is pointing at the root, or has a fragment only which means\n\t// it is pointing somewhere in the root.\n\troot := r.root\n\tif (ref.IsRoot() || ref.HasFragmentOnly) && root == nil && basePath != \"\" {\n\t\tif baseRef, erb := NewRef(basePath); erb == nil {\n\t\t\troot, _, _, _ = r.load(baseRef.GetURL())\n\t\t}\n\t}\n\tif (ref.IsRoot() || ref.HasFragmentOnly) && root != nil {\n\t\tdata = root\n\t} else {\n\t\tbaseRef := normalizeFileRef(ref, basePath)\n\t\tdebugLog(\"current ref is: %s\", ref.String())\n\t\tdebugLog(\"current ref normalized file: %s\", baseRef.String())\n\t\tdata, _, _, err = r.load(baseRef.GetURL())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\tres = data\n\tif ref.String() != \"\" {\n\t\tres, _, err = ref.GetPointer().Get(data)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn swag.DynamicJSONToStruct(res, target)\n}\n\nfunc (r *schemaLoader) load(refURL *url.URL) (interface{}, url.URL, bool, error) {\n\tdebugLog(\"loading schema from url: %s\", refURL)\n\ttoFetch := *refURL\n\ttoFetch.Fragment = \"\"\n\n\tnormalized := normalizeAbsPath(toFetch.String())\n\n\tdata, fromCache := r.cache.Get(normalized)\n\tif !fromCache {\n\t\tb, err := r.loadDoc(normalized)\n\t\tif err != nil {\n\t\t\treturn nil, url.URL{}, false, err\n\t\t}\n\n\t\tif err := json.Unmarshal(b, &data); err != nil {\n\t\t\treturn nil, url.URL{}, false, err\n\t\t}\n\t\tr.cache.Set(normalized, data)\n\t}\n\n\treturn data, toFetch, fromCache, nil\n}\n\n// isCircular detects cycles in sequences of $ref.\n// It relies on a private context (which needs not be locked).\nfunc (r *schemaLoader) isCircular(ref *Ref, basePath string, parentRefs ...string) (foundCycle bool) {\n\tnormalizedRef := normalizePaths(ref.String(), basePath)\n\tif _, ok := r.context.circulars[normalizedRef]; ok {\n\t\t// circular $ref has been already detected in another explored cycle\n\t\tfoundCycle = true\n\t\treturn\n\t}\n\tfoundCycle = swag.ContainsStringsCI(parentRefs, normalizedRef)\n\tif foundCycle {\n\t\tr.context.circulars[normalizedRef] = true\n\t}\n\treturn\n}\n\n// Resolve resolves a reference against basePath and stores the result in target\n// Resolve is not in charge of following references, it only resolves ref by following its URL\n// if the schema that ref is referring to has more refs in it. Resolve doesn't resolve them\n// if basePath is an empty string, ref is resolved against the root schema stored in the schemaLoader struct\nfunc (r *schemaLoader) Resolve(ref *Ref, target interface{}, basePath string) error {\n\treturn r.resolveRef(ref, target, basePath)\n}\n\nfunc (r *schemaLoader) deref(input interface{}, parentRefs []string, basePath string) error {\n\tvar ref *Ref\n\tswitch refable := input.(type) {\n\tcase *Schema:\n\t\tref = &refable.Ref\n\tcase *Parameter:\n\t\tref = &refable.Ref\n\tcase *Response:\n\t\tref = &refable.Ref\n\tcase *PathItem:\n\t\tref = &refable.Ref\n\tdefault:\n\t\treturn fmt.Errorf(\"deref: unsupported type %T\", input)\n\t}\n\n\tcurRef := ref.String()\n\tif curRef != \"\" {\n\t\tnormalizedRef := normalizeFileRef(ref, basePath)\n\t\tnormalizedBasePath := normalizedRef.RemoteURI()\n\n\t\tif r.isCircular(normalizedRef, basePath, parentRefs...) {\n\t\t\treturn nil\n\t\t}\n\n\t\tif err := r.resolveRef(ref, input, basePath); r.shouldStopOnError(err) {\n\t\t\treturn err\n\t\t}\n\n\t\t// NOTE(fredbi): removed basePath check => needs more testing\n\t\tif ref.String() != \"\" && ref.String() != curRef {\n\t\t\tparentRefs = append(parentRefs, normalizedRef.String())\n\t\t\treturn r.deref(input, parentRefs, normalizedBasePath)\n\t\t}\n\t}\n\n\treturn nil\n}\n\nfunc (r *schemaLoader) shouldStopOnError(err error) bool {\n\tif err != nil && !r.options.ContinueOnError {\n\t\treturn true\n\t}\n\n\tif err != nil {\n\t\tlog.Println(err)\n\t}\n\n\treturn false\n}\n\nfunc defaultSchemaLoader(\n\troot interface{},\n\texpandOptions *ExpandOptions,\n\tcache ResolutionCache,\n\tcontext *resolverContext) (*schemaLoader, error) {\n\n\tif cache == nil {\n\t\tcache = resCache\n\t}\n\tif expandOptions == nil {\n\t\texpandOptions = &ExpandOptions{}\n\t}\n\tabsBase, _ := absPath(expandOptions.RelativeBase)\n\tif context == nil {\n\t\tcontext = newResolverContext(absBase)\n\t}\n\treturn &schemaLoader{\n\t\troot: root,\n\t\toptions: expandOptions,\n\t\tcache: cache,\n\t\tcontext: context,\n\t\tloadDoc: func(path string) (json.RawMessage, error) {\n\t\t\tdebugLog(\"fetching document at %q\", path)\n\t\t\treturn PathLoader(path)\n\t\t},\n\t}, nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/security_scheme.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\nconst (\n\tbasic = \"basic\"\n\tapiKey = \"apiKey\"\n\toauth2 = \"oauth2\"\n\timplicit = \"implicit\"\n\tpassword = \"password\"\n\tapplication = \"application\"\n\taccessCode = \"accessCode\"\n)\n\n// BasicAuth creates a basic auth security scheme\nfunc BasicAuth() *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{Type: basic}}\n}\n\n// APIKeyAuth creates an api key auth security scheme\nfunc APIKeyAuth(fieldName, valueSource string) *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{Type: apiKey, Name: fieldName, In: valueSource}}\n}\n\n// OAuth2Implicit creates an implicit flow oauth2 security scheme\nfunc OAuth2Implicit(authorizationURL string) *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{\n\t\tType: oauth2,\n\t\tFlow: implicit,\n\t\tAuthorizationURL: authorizationURL,\n\t}}\n}\n\n// OAuth2Password creates a password flow oauth2 security scheme\nfunc OAuth2Password(tokenURL string) *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{\n\t\tType: oauth2,\n\t\tFlow: password,\n\t\tTokenURL: tokenURL,\n\t}}\n}\n\n// OAuth2Application creates an application flow oauth2 security scheme\nfunc OAuth2Application(tokenURL string) *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{\n\t\tType: oauth2,\n\t\tFlow: application,\n\t\tTokenURL: tokenURL,\n\t}}\n}\n\n// OAuth2AccessToken creates an access token flow oauth2 security scheme\nfunc OAuth2AccessToken(authorizationURL, tokenURL string) *SecurityScheme {\n\treturn &SecurityScheme{SecuritySchemeProps: SecuritySchemeProps{\n\t\tType: oauth2,\n\t\tFlow: accessCode,\n\t\tAuthorizationURL: authorizationURL,\n\t\tTokenURL: tokenURL,\n\t}}\n}\n\n// SecuritySchemeProps describes a swagger security scheme in the securityDefinitions section\ntype SecuritySchemeProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tType string `json:\"type\"`\n\tName string `json:\"name,omitempty\"` // api key\n\tIn string `json:\"in,omitempty\"` // api key\n\tFlow string `json:\"flow,omitempty\"` // oauth2\n\tAuthorizationURL string `json:\"authorizationUrl,omitempty\"` // oauth2\n\tTokenURL string `json:\"tokenUrl,omitempty\"` // oauth2\n\tScopes map[string]string `json:\"scopes,omitempty\"` // oauth2\n}\n\n// AddScope adds a scope to this security scheme\nfunc (s *SecuritySchemeProps) AddScope(scope, description string) {\n\tif s.Scopes == nil {\n\t\ts.Scopes = make(map[string]string)\n\t}\n\ts.Scopes[scope] = description\n}\n\n// SecurityScheme allows the definition of a security scheme that can be used by the operations.\n// Supported schemes are basic authentication, an API key (either as a header or as a query parameter)\n// and OAuth2's common flows (implicit, password, application and access code).\n//\n// For more information: http://goo.gl/8us55a#securitySchemeObject\ntype SecurityScheme struct {\n\tVendorExtensible\n\tSecuritySchemeProps\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (s SecurityScheme) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := s.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(s.SecuritySchemeProps, token)\n\treturn r, err\n}\n\n// MarshalJSON marshal this to JSON\nfunc (s SecurityScheme) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(s.SecuritySchemeProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(s.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2), nil\n}\n\n// UnmarshalJSON marshal this from JSON\nfunc (s *SecurityScheme) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &s.SecuritySchemeProps); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &s.VendorExtensible)\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/spec.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport \"encoding/json\"\n\n//go:generate curl -L --progress -o ./schemas/v2/schema.json http://swagger.io/v2/schema.json\n//go:generate curl -L --progress -o ./schemas/jsonschema-draft-04.json http://json-schema.org/draft-04/schema\n//go:generate go-bindata -pkg=spec -prefix=./schemas -ignore=.*\\.md ./schemas/...\n//go:generate perl -pi -e s,Json,JSON,g bindata.go\n\nconst (\n\t// SwaggerSchemaURL the url for the swagger 2.0 schema to validate specs\n\tSwaggerSchemaURL = \"http://swagger.io/v2/schema.json#\"\n\t// JSONSchemaURL the url for the json schema schema\n\tJSONSchemaURL = \"http://json-schema.org/draft-04/schema#\"\n)\n\nvar (\n\tjsonSchema *Schema\n\tswaggerSchema *Schema\n)\n\nfunc init() {\n\tjsonSchema = MustLoadJSONSchemaDraft04()\n\tswaggerSchema = MustLoadSwagger20Schema()\n}\n\n// MustLoadJSONSchemaDraft04 panics when Swagger20Schema returns an error\nfunc MustLoadJSONSchemaDraft04() *Schema {\n\td, e := JSONSchemaDraft04()\n\tif e != nil {\n\t\tpanic(e)\n\t}\n\treturn d\n}\n\n// JSONSchemaDraft04 loads the json schema document for json shema draft04\nfunc JSONSchemaDraft04() (*Schema, error) {\n\tb, err := Asset(\"jsonschema-draft-04.json\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tschema := new(Schema)\n\tif err := json.Unmarshal(b, schema); err != nil {\n\t\treturn nil, err\n\t}\n\treturn schema, nil\n}\n\n// MustLoadSwagger20Schema panics when Swagger20Schema returns an error\nfunc MustLoadSwagger20Schema() *Schema {\n\td, e := Swagger20Schema()\n\tif e != nil {\n\t\tpanic(e)\n\t}\n\treturn d\n}\n\n// Swagger20Schema loads the swagger 2.0 schema from the embedded assets\nfunc Swagger20Schema() (*Schema, error) {\n\n\tb, err := Asset(\"v2/schema.json\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tschema := new(Schema)\n\tif err := json.Unmarshal(b, schema); err != nil {\n\t\treturn nil, err\n\t}\n\treturn schema, nil\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/swagger.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"strconv\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// Swagger this is the root document object for the API specification.\n// It combines what previously was the Resource Listing and API Declaration (version 1.2 and earlier)\n// together into one document.\n//\n// For more information: http://goo.gl/8us55a#swagger-object-\ntype Swagger struct {\n\tVendorExtensible\n\tSwaggerProps\n}\n\n// JSONLookup look up a value by the json property name\nfunc (s Swagger) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := s.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\tr, _, err := jsonpointer.GetForToken(s.SwaggerProps, token)\n\treturn r, err\n}\n\n// MarshalJSON marshals this swagger structure to json\nfunc (s Swagger) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(s.SwaggerProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(s.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2), nil\n}\n\n// UnmarshalJSON unmarshals a swagger spec from json\nfunc (s *Swagger) UnmarshalJSON(data []byte) error {\n\tvar sw Swagger\n\tif err := json.Unmarshal(data, &sw.SwaggerProps); err != nil {\n\t\treturn err\n\t}\n\tif err := json.Unmarshal(data, &sw.VendorExtensible); err != nil {\n\t\treturn err\n\t}\n\t*s = sw\n\treturn nil\n}\n\n// SwaggerProps captures the top-level properties of an Api specification\n//\n// NOTE: validation rules\n// - the scheme, when present must be from [http, https, ws, wss]\n// - BasePath must start with a leading \"/\"\n// - Paths is required\ntype SwaggerProps struct {\n\tID string `json:\"id,omitempty\"`\n\tConsumes []string `json:\"consumes,omitempty\"`\n\tProduces []string `json:\"produces,omitempty\"`\n\tSchemes []string `json:\"schemes,omitempty\"`\n\tSwagger string `json:\"swagger,omitempty\"`\n\tInfo *Info `json:\"info,omitempty\"`\n\tHost string `json:\"host,omitempty\"`\n\tBasePath string `json:\"basePath,omitempty\"`\n\tPaths *Paths `json:\"paths\"`\n\tDefinitions Definitions `json:\"definitions,omitempty\"`\n\tParameters map[string]Parameter `json:\"parameters,omitempty\"`\n\tResponses map[string]Response `json:\"responses,omitempty\"`\n\tSecurityDefinitions SecurityDefinitions `json:\"securityDefinitions,omitempty\"`\n\tSecurity []map[string][]string `json:\"security,omitempty\"`\n\tTags []Tag `json:\"tags,omitempty\"`\n\tExternalDocs *ExternalDocumentation `json:\"externalDocs,omitempty\"`\n}\n\n// Dependencies represent a dependencies property\ntype Dependencies map[string]SchemaOrStringArray\n\n// SchemaOrBool represents a schema or boolean value, is biased towards true for the boolean property\ntype SchemaOrBool struct {\n\tAllows bool\n\tSchema *Schema\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (s SchemaOrBool) JSONLookup(token string) (interface{}, error) {\n\tif token == \"allows\" {\n\t\treturn s.Allows, nil\n\t}\n\tr, _, err := jsonpointer.GetForToken(s.Schema, token)\n\treturn r, err\n}\n\nvar jsTrue = []byte(\"true\")\nvar jsFalse = []byte(\"false\")\n\n// MarshalJSON convert this object to JSON\nfunc (s SchemaOrBool) MarshalJSON() ([]byte, error) {\n\tif s.Schema != nil {\n\t\treturn json.Marshal(s.Schema)\n\t}\n\n\tif s.Schema == nil && !s.Allows {\n\t\treturn jsFalse, nil\n\t}\n\treturn jsTrue, nil\n}\n\n// UnmarshalJSON converts this bool or schema object from a JSON structure\nfunc (s *SchemaOrBool) UnmarshalJSON(data []byte) error {\n\tvar nw SchemaOrBool\n\tif len(data) >= 4 {\n\t\tif data[0] == '{' {\n\t\t\tvar sch Schema\n\t\t\tif err := json.Unmarshal(data, &sch); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tnw.Schema = &sch\n\t\t}\n\t\tnw.Allows = !(data[0] == 'f' && data[1] == 'a' && data[2] == 'l' && data[3] == 's' && data[4] == 'e')\n\t}\n\t*s = nw\n\treturn nil\n}\n\n// SchemaOrStringArray represents a schema or a string array\ntype SchemaOrStringArray struct {\n\tSchema *Schema\n\tProperty []string\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (s SchemaOrStringArray) JSONLookup(token string) (interface{}, error) {\n\tr, _, err := jsonpointer.GetForToken(s.Schema, token)\n\treturn r, err\n}\n\n// MarshalJSON converts this schema object or array into JSON structure\nfunc (s SchemaOrStringArray) MarshalJSON() ([]byte, error) {\n\tif len(s.Property) > 0 {\n\t\treturn json.Marshal(s.Property)\n\t}\n\tif s.Schema != nil {\n\t\treturn json.Marshal(s.Schema)\n\t}\n\treturn []byte(\"null\"), nil\n}\n\n// UnmarshalJSON converts this schema object or array from a JSON structure\nfunc (s *SchemaOrStringArray) UnmarshalJSON(data []byte) error {\n\tvar first byte\n\tif len(data) > 1 {\n\t\tfirst = data[0]\n\t}\n\tvar nw SchemaOrStringArray\n\tif first == '{' {\n\t\tvar sch Schema\n\t\tif err := json.Unmarshal(data, &sch); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tnw.Schema = &sch\n\t}\n\tif first == '[' {\n\t\tif err := json.Unmarshal(data, &nw.Property); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t*s = nw\n\treturn nil\n}\n\n// Definitions contains the models explicitly defined in this spec\n// An object to hold data types that can be consumed and produced by operations.\n// These data types can be primitives, arrays or models.\n//\n// For more information: http://goo.gl/8us55a#definitionsObject\ntype Definitions map[string]Schema\n\n// SecurityDefinitions a declaration of the security schemes available to be used in the specification.\n// This does not enforce the security schemes on the operations and only serves to provide\n// the relevant details for each scheme.\n//\n// For more information: http://goo.gl/8us55a#securityDefinitionsObject\ntype SecurityDefinitions map[string]*SecurityScheme\n\n// StringOrArray represents a value that can either be a string\n// or an array of strings. Mainly here for serialization purposes\ntype StringOrArray []string\n\n// Contains returns true when the value is contained in the slice\nfunc (s StringOrArray) Contains(value string) bool {\n\tfor _, str := range s {\n\t\tif str == value {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (s SchemaOrArray) JSONLookup(token string) (interface{}, error) {\n\tif _, err := strconv.Atoi(token); err == nil {\n\t\tr, _, err := jsonpointer.GetForToken(s.Schemas, token)\n\t\treturn r, err\n\t}\n\tr, _, err := jsonpointer.GetForToken(s.Schema, token)\n\treturn r, err\n}\n\n// UnmarshalJSON unmarshals this string or array object from a JSON array or JSON string\nfunc (s *StringOrArray) UnmarshalJSON(data []byte) error {\n\tvar first byte\n\tif len(data) > 1 {\n\t\tfirst = data[0]\n\t}\n\n\tif first == '[' {\n\t\tvar parsed []string\n\t\tif err := json.Unmarshal(data, &parsed); err != nil {\n\t\t\treturn err\n\t\t}\n\t\t*s = StringOrArray(parsed)\n\t\treturn nil\n\t}\n\n\tvar single interface{}\n\tif err := json.Unmarshal(data, &single); err != nil {\n\t\treturn err\n\t}\n\tif single == nil {\n\t\treturn nil\n\t}\n\tswitch v := single.(type) {\n\tcase string:\n\t\t*s = StringOrArray([]string{v})\n\t\treturn nil\n\tdefault:\n\t\treturn fmt.Errorf(\"only string or array is allowed, not %T\", single)\n\t}\n}\n\n// MarshalJSON converts this string or array to a JSON array or JSON string\nfunc (s StringOrArray) MarshalJSON() ([]byte, error) {\n\tif len(s) == 1 {\n\t\treturn json.Marshal([]string(s)[0])\n\t}\n\treturn json.Marshal([]string(s))\n}\n\n// SchemaOrArray represents a value that can either be a Schema\n// or an array of Schema. Mainly here for serialization purposes\ntype SchemaOrArray struct {\n\tSchema *Schema\n\tSchemas []Schema\n}\n\n// Len returns the number of schemas in this property\nfunc (s SchemaOrArray) Len() int {\n\tif s.Schema != nil {\n\t\treturn 1\n\t}\n\treturn len(s.Schemas)\n}\n\n// ContainsType returns true when one of the schemas is of the specified type\nfunc (s *SchemaOrArray) ContainsType(name string) bool {\n\tif s.Schema != nil {\n\t\treturn s.Schema.Type != nil && s.Schema.Type.Contains(name)\n\t}\n\treturn false\n}\n\n// MarshalJSON converts this schema object or array into JSON structure\nfunc (s SchemaOrArray) MarshalJSON() ([]byte, error) {\n\tif len(s.Schemas) > 0 {\n\t\treturn json.Marshal(s.Schemas)\n\t}\n\treturn json.Marshal(s.Schema)\n}\n\n// UnmarshalJSON converts this schema object or array from a JSON structure\nfunc (s *SchemaOrArray) UnmarshalJSON(data []byte) error {\n\tvar nw SchemaOrArray\n\tvar first byte\n\tif len(data) > 1 {\n\t\tfirst = data[0]\n\t}\n\tif first == '{' {\n\t\tvar sch Schema\n\t\tif err := json.Unmarshal(data, &sch); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tnw.Schema = &sch\n\t}\n\tif first == '[' {\n\t\tif err := json.Unmarshal(data, &nw.Schemas); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t*s = nw\n\treturn nil\n}\n\n// vim:set ft=go noet sts=2 sw=2 ts=2:\n" }, { "path": "vendor/github.com/go-openapi/spec/tag.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\nimport (\n\t\"encoding/json\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n\t\"github.com/go-openapi/swag\"\n)\n\n// TagProps describe a tag entry in the top level tags section of a swagger spec\ntype TagProps struct {\n\tDescription string `json:\"description,omitempty\"`\n\tName string `json:\"name,omitempty\"`\n\tExternalDocs *ExternalDocumentation `json:\"externalDocs,omitempty\"`\n}\n\n// NewTag creates a new tag\nfunc NewTag(name, description string, externalDocs *ExternalDocumentation) Tag {\n\treturn Tag{TagProps: TagProps{Description: description, Name: name, ExternalDocs: externalDocs}}\n}\n\n// Tag allows adding meta data to a single tag that is used by the\n// [Operation Object](http://goo.gl/8us55a#operationObject).\n// It is not mandatory to have a Tag Object per tag used there.\n//\n// For more information: http://goo.gl/8us55a#tagObject\ntype Tag struct {\n\tVendorExtensible\n\tTagProps\n}\n\n// JSONLookup implements an interface to customize json pointer lookup\nfunc (t Tag) JSONLookup(token string) (interface{}, error) {\n\tif ex, ok := t.Extensions[token]; ok {\n\t\treturn &ex, nil\n\t}\n\n\tr, _, err := jsonpointer.GetForToken(t.TagProps, token)\n\treturn r, err\n}\n\n// MarshalJSON marshal this to JSON\nfunc (t Tag) MarshalJSON() ([]byte, error) {\n\tb1, err := json.Marshal(t.TagProps)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tb2, err := json.Marshal(t.VendorExtensible)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn swag.ConcatJSON(b1, b2), nil\n}\n\n// UnmarshalJSON marshal this from JSON\nfunc (t *Tag) UnmarshalJSON(data []byte) error {\n\tif err := json.Unmarshal(data, &t.TagProps); err != nil {\n\t\treturn err\n\t}\n\treturn json.Unmarshal(data, &t.VendorExtensible)\n}\n" }, { "path": "vendor/github.com/go-openapi/spec/unused.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\n/*\n\nimport (\n\t\"net/url\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\n\t\"github.com/go-openapi/jsonpointer\"\n)\n\n // Some currently unused functions and definitions that\n // used to be part of the expander.\n\n // Moved here for the record and possible future reuse\n\nvar (\n\tidPtr, _ = jsonpointer.New(\"/id\")\n\trefPtr, _ = jsonpointer.New(\"/$ref\")\n)\n\nfunc idFromNode(node interface{}) (*Ref, error) {\n\tif idValue, _, err := idPtr.Get(node); err == nil {\n\t\tif refStr, ok := idValue.(string); ok && refStr != \"\" {\n\t\t\tidRef, err := NewRef(refStr)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\treturn &idRef, nil\n\t\t}\n\t}\n\treturn nil, nil\n}\n\nfunc nextRef(startingNode interface{}, startingRef *Ref, ptr *jsonpointer.Pointer) *Ref {\n\tif startingRef == nil {\n\t\treturn nil\n\t}\n\n\tif ptr == nil {\n\t\treturn startingRef\n\t}\n\n\tret := startingRef\n\tvar idRef *Ref\n\tnode := startingNode\n\n\tfor _, tok := range ptr.DecodedTokens() {\n\t\tnode, _, _ = jsonpointer.GetForToken(node, tok)\n\t\tif node == nil {\n\t\t\tbreak\n\t\t}\n\n\t\tidRef, _ = idFromNode(node)\n\t\tif idRef != nil {\n\t\t\tnw, err := ret.Inherits(*idRef)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tret = nw\n\t\t}\n\n\t\trefRef, _, _ := refPtr.Get(node)\n\t\tif refRef != nil {\n\t\t\tvar rf Ref\n\t\t\tswitch value := refRef.(type) {\n\t\t\tcase string:\n\t\t\t\trf, _ = NewRef(value)\n\t\t\t}\n\t\t\tnw, err := ret.Inherits(rf)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tnwURL := nw.GetURL()\n\t\t\tif nwURL.Scheme == \"file\" || (nwURL.Scheme == \"\" && nwURL.Host == \"\") {\n\t\t\t\tnwpt := filepath.ToSlash(nwURL.Path)\n\t\t\t\tif filepath.IsAbs(nwpt) {\n\t\t\t\t\t_, err := os.Stat(nwpt)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tnwURL.Path = filepath.Join(\".\", nwpt)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tret = nw\n\t\t}\n\n\t}\n\n\treturn ret\n}\n\n// basePathFromSchemaID returns a new basePath based on an existing basePath and a schema ID\nfunc basePathFromSchemaID(oldBasePath, id string) string {\n\tu, err := url.Parse(oldBasePath)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tuid, err := url.Parse(id)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\n\tif path.IsAbs(uid.Path) {\n\t\treturn id\n\t}\n\tu.Path = path.Join(path.Dir(u.Path), uid.Path)\n\treturn u.String()\n}\n*/\n\n// type ExtraSchemaProps map[string]interface{}\n\n// // JSONSchema represents a structure that is a json schema draft 04\n// type JSONSchema struct {\n// \tSchemaProps\n// \tExtraSchemaProps\n// }\n\n// // MarshalJSON marshal this to JSON\n// func (s JSONSchema) MarshalJSON() ([]byte, error) {\n// \tb1, err := json.Marshal(s.SchemaProps)\n// \tif err != nil {\n// \t\treturn nil, err\n// \t}\n// \tb2, err := s.Ref.MarshalJSON()\n// \tif err != nil {\n// \t\treturn nil, err\n// \t}\n// \tb3, err := s.Schema.MarshalJSON()\n// \tif err != nil {\n// \t\treturn nil, err\n// \t}\n// \tb4, err := json.Marshal(s.ExtraSchemaProps)\n// \tif err != nil {\n// \t\treturn nil, err\n// \t}\n// \treturn swag.ConcatJSON(b1, b2, b3, b4), nil\n// }\n\n// // UnmarshalJSON marshal this from JSON\n// func (s *JSONSchema) UnmarshalJSON(data []byte) error {\n// \tvar sch JSONSchema\n// \tif err := json.Unmarshal(data, &sch.SchemaProps); err != nil {\n// \t\treturn err\n// \t}\n// \tif err := json.Unmarshal(data, &sch.Ref); err != nil {\n// \t\treturn err\n// \t}\n// \tif err := json.Unmarshal(data, &sch.Schema); err != nil {\n// \t\treturn err\n// \t}\n// \tif err := json.Unmarshal(data, &sch.ExtraSchemaProps); err != nil {\n// \t\treturn err\n// \t}\n// \t*s = sch\n// \treturn nil\n// }\n" }, { "path": "vendor/github.com/go-openapi/spec/xml_object.go", "content": "// Copyright 2015 go-swagger maintainers\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage spec\n\n// XMLObject a metadata object that allows for more fine-tuned XML model definitions.\n//\n// For more information: http://goo.gl/8us55a#xmlObject\ntype XMLObject struct {\n\tName string `json:\"name,omitempty\"`\n\tNamespace string `json:\"namespace,omitempty\"`\n\tPrefix string `json:\"prefix,omitempty\"`\n\tAttribute bool `json:\"attribute,omitempty\"`\n\tWrapped bool `json:\"wrapped,omitempty\"`\n}\n\n// WithName sets the xml name for the object\nfunc (x *XMLObject) WithName(name string) *XMLObject {\n\tx.Name = name\n\treturn x\n}\n\n// WithNamespace sets the xml namespace for the object\nfunc (x *XMLObject) WithNamespace(namespace string) *XMLObject {\n\tx.Namespace = namespace\n\treturn x\n}\n\n// WithPrefix sets the xml prefix for the object\nfunc (x *XMLObject) WithPrefix(prefix string) *XMLObject {\n\tx.Prefix = prefix\n\treturn x\n}\n\n// AsAttribute flags this object as xml attribute\nfunc (x *XMLObject) AsAttribute() *XMLObject {\n\tx.Attribute = true\n\treturn x\n}\n\n// AsElement flags this object as an xml node\nfunc (x *XMLObject) AsElement() *XMLObject {\n\tx.Attribute = false\n\treturn x\n}\n\n// AsWrapped flags this object as wrapped, this is mostly useful for array types\nfunc (x *XMLObject) AsWrapped() *XMLObject {\n\tx.Wrapped = true\n\treturn x\n}\n\n// AsUnwrapped flags this object as an xml node\nfunc (x *XMLObject) AsUnwrapped() *XMLObject {\n\tx.Wrapped = false\n\treturn x\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/.gitignore", "content": ".DS_Store\n.DS_Store?\n._*\n.Spotlight-V100\n.Trashes\nIcon?\nehthumbs.db\nThumbs.db\n.idea\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/.travis.yml", "content": "sudo: false\nlanguage: go\ngo:\n - 1.9.x\n - 1.10.x\n - 1.11.x\n - 1.12.x\n - master\n\nbefore_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n\nbefore_script:\n - echo -e \"[server]\\ninnodb_log_file_size=256MB\\ninnodb_buffer_pool_size=512MB\\nmax_allowed_packet=16MB\" | sudo tee -a /etc/mysql/my.cnf\n - sudo service mysql restart\n - .travis/wait_mysql.sh\n - mysql -e 'create database gotest;'\n\nmatrix:\n include:\n - env: DB=MYSQL8\n sudo: required\n dist: trusty\n go: 1.10.x\n services:\n - docker\n before_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n - docker pull mysql:8.0\n - docker run -d -p 127.0.0.1:3307:3306 --name mysqld -e MYSQL_DATABASE=gotest -e MYSQL_USER=gotest -e MYSQL_PASSWORD=secret -e MYSQL_ROOT_PASSWORD=verysecret\n mysql:8.0 --innodb_log_file_size=256MB --innodb_buffer_pool_size=512MB --max_allowed_packet=16MB --local-infile=1\n - cp .travis/docker.cnf ~/.my.cnf\n - .travis/wait_mysql.sh\n before_script:\n - export MYSQL_TEST_USER=gotest\n - export MYSQL_TEST_PASS=secret\n - export MYSQL_TEST_ADDR=127.0.0.1:3307\n - export MYSQL_TEST_CONCURRENT=1\n\n - env: DB=MYSQL57\n sudo: required\n dist: trusty\n go: 1.10.x\n services:\n - docker\n before_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n - docker pull mysql:5.7\n - docker run -d -p 127.0.0.1:3307:3306 --name mysqld -e MYSQL_DATABASE=gotest -e MYSQL_USER=gotest -e MYSQL_PASSWORD=secret -e MYSQL_ROOT_PASSWORD=verysecret\n mysql:5.7 --innodb_log_file_size=256MB --innodb_buffer_pool_size=512MB --max_allowed_packet=16MB --local-infile=1\n - cp .travis/docker.cnf ~/.my.cnf\n - .travis/wait_mysql.sh\n before_script:\n - export MYSQL_TEST_USER=gotest\n - export MYSQL_TEST_PASS=secret\n - export MYSQL_TEST_ADDR=127.0.0.1:3307\n - export MYSQL_TEST_CONCURRENT=1\n\n - env: DB=MARIA55\n sudo: required\n dist: trusty\n go: 1.10.x\n services:\n - docker\n before_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n - docker pull mariadb:5.5\n - docker run -d -p 127.0.0.1:3307:3306 --name mysqld -e MYSQL_DATABASE=gotest -e MYSQL_USER=gotest -e MYSQL_PASSWORD=secret -e MYSQL_ROOT_PASSWORD=verysecret\n mariadb:5.5 --innodb_log_file_size=256MB --innodb_buffer_pool_size=512MB --max_allowed_packet=16MB --local-infile=1\n - cp .travis/docker.cnf ~/.my.cnf\n - .travis/wait_mysql.sh\n before_script:\n - export MYSQL_TEST_USER=gotest\n - export MYSQL_TEST_PASS=secret\n - export MYSQL_TEST_ADDR=127.0.0.1:3307\n - export MYSQL_TEST_CONCURRENT=1\n\n - env: DB=MARIA10_1\n sudo: required\n dist: trusty\n go: 1.10.x\n services:\n - docker\n before_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n - docker pull mariadb:10.1\n - docker run -d -p 127.0.0.1:3307:3306 --name mysqld -e MYSQL_DATABASE=gotest -e MYSQL_USER=gotest -e MYSQL_PASSWORD=secret -e MYSQL_ROOT_PASSWORD=verysecret\n mariadb:10.1 --innodb_log_file_size=256MB --innodb_buffer_pool_size=512MB --max_allowed_packet=16MB --local-infile=1\n - cp .travis/docker.cnf ~/.my.cnf\n - .travis/wait_mysql.sh\n before_script:\n - export MYSQL_TEST_USER=gotest\n - export MYSQL_TEST_PASS=secret\n - export MYSQL_TEST_ADDR=127.0.0.1:3307\n - export MYSQL_TEST_CONCURRENT=1\n\n - os: osx\n osx_image: xcode10.1\n addons:\n homebrew:\n packages:\n - mysql\n go: 1.12.x\n before_install:\n - go get golang.org/x/tools/cmd/cover\n - go get github.com/mattn/goveralls\n before_script:\n - echo -e \"[server]\\ninnodb_log_file_size=256MB\\ninnodb_buffer_pool_size=512MB\\nmax_allowed_packet=16MB\\nlocal_infile=1\" >> /usr/local/etc/my.cnf\n - mysql.server start\n - mysql -uroot -e 'CREATE USER gotest IDENTIFIED BY \"secret\"'\n - mysql -uroot -e 'GRANT ALL ON *.* TO gotest'\n - mysql -uroot -e 'create database gotest;'\n - export MYSQL_TEST_USER=gotest\n - export MYSQL_TEST_PASS=secret\n - export MYSQL_TEST_ADDR=127.0.0.1:3306\n - export MYSQL_TEST_CONCURRENT=1\n\nscript:\n - go test -v -covermode=count -coverprofile=coverage.out\n - go vet ./...\n - .travis/gofmt.sh\nafter_script:\n - $HOME/gopath/bin/goveralls -coverprofile=coverage.out -service=travis-ci\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/AUTHORS", "content": "# This is the official list of Go-MySQL-Driver authors for copyright purposes.\n\n# If you are submitting a patch, please add your name or the name of the\n# organization which holds the copyright to this list in alphabetical order.\n\n# Names should be added to this file as\n#\tName \n# The email address is not required for organizations.\n# Please keep the list sorted.\n\n\n# Individual Persons\n\nAaron Hopkins \nAchille Roussel \nAlexey Palazhchenko \nAndrew Reid \nArne Hormann \nAsta Xie \nBulat Gaifullin \nCarlos Nieto \nChris Moos \nCraig Wilson \nDaniel Montoya \nDaniel Nichter \nDaniël van Eeden \nDave Protasowski \nDisposaBoy \nEgor Smolyakov \nErwan Martin \nEvan Shaw \nFrederick Mayle \nGustavo Kristic \nHajime Nakagami \nHanno Braun \nHenri Yandell \nHirotaka Yamamoto \nHuyiguang \nICHINOSE Shogo \nIlia Cimpoes \nINADA Naoki \nJacek Szwec \nJames Harr \nJeff Hodges \nJeffrey Charles \nJerome Meyer \nJian Zhen \nJoshua Prunier \nJulien Lefevre \nJulien Schmidt \nJustin Li \nJustin Nuß \nKamil Dziedzic \nKevin Malachowski \nKieron Woodhouse \nLennart Rudolph \nLeonardo YongUk Kim \nLinh Tran Tuan \nLion Yang \nLuca Looz \nLucas Liu \nLuke Scott \nMaciej Zimnoch \nMichael Woolnough \nNicola Peduzzi \nOlivier Mengué \noscarzhao \nPaul Bonser \nPeter Schultz \nRebecca Chin \nReed Allman \nRichard Wilkes \nRobert Russell \nRunrioter Wung \nShuode Li \nSimon J Mudd \nSoroush Pour \nStan Putrya \nStanley Gunawan \nSteven Hartland \nThomas Wodarek \nTim Ruffles \nTom Jenkinson \nXiangyu Hu \nXiaobing Jiang \nXiuming Chen \nZhenye Xie \n\n# Organizations\n\nBarracuda Networks, Inc.\nCounting Ltd.\nFacebook Inc.\nGitHub Inc.\nGoogle Inc.\nInfoSum Ltd.\nKeybase Inc.\nMultiplay Ltd.\nPercona LLC\nPivotal Inc.\nStripe Inc.\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/CHANGELOG.md", "content": "## Version 1.4 (2018-06-03)\n\nChanges:\n\n - Documentation fixes (#530, #535, #567)\n - Refactoring (#575, #579, #580, #581, #603, #615, #704)\n - Cache column names (#444)\n - Sort the DSN parameters in DSNs generated from a config (#637)\n - Allow native password authentication by default (#644)\n - Use the default port if it is missing in the DSN (#668)\n - Removed the `strict` mode (#676)\n - Do not query `max_allowed_packet` by default (#680)\n - Dropped support Go 1.6 and lower (#696)\n - Updated `ConvertValue()` to match the database/sql/driver implementation (#760)\n - Document the usage of `0000-00-00T00:00:00` as the time.Time zero value (#783)\n - Improved the compatibility of the authentication system (#807)\n\nNew Features:\n\n - Multi-Results support (#537)\n - `rejectReadOnly` DSN option (#604)\n - `context.Context` support (#608, #612, #627, #761)\n - Transaction isolation level support (#619, #744)\n - Read-Only transactions support (#618, #634)\n - `NewConfig` function which initializes a config with default values (#679)\n - Implemented the `ColumnType` interfaces (#667, #724)\n - Support for custom string types in `ConvertValue` (#623)\n - Implemented `NamedValueChecker`, improving support for uint64 with high bit set (#690, #709, #710)\n - `caching_sha2_password` authentication plugin support (#794, #800, #801, #802)\n - Implemented `driver.SessionResetter` (#779)\n - `sha256_password` authentication plugin support (#808)\n\nBugfixes:\n\n - Use the DSN hostname as TLS default ServerName if `tls=true` (#564, #718)\n - Fixed LOAD LOCAL DATA INFILE for empty files (#590)\n - Removed columns definition cache since it sometimes cached invalid data (#592)\n - Don't mutate registered TLS configs (#600)\n - Make RegisterTLSConfig concurrency-safe (#613)\n - Handle missing auth data in the handshake packet correctly (#646)\n - Do not retry queries when data was written to avoid data corruption (#302, #736)\n - Cache the connection pointer for error handling before invalidating it (#678)\n - Fixed imports for appengine/cloudsql (#700)\n - Fix sending STMT_LONG_DATA for 0 byte data (#734)\n - Set correct capacity for []bytes read from length-encoded strings (#766)\n - Make RegisterDial concurrency-safe (#773)\n\n\n## Version 1.3 (2016-12-01)\n\nChanges:\n\n - Go 1.1 is no longer supported\n - Use decimals fields in MySQL to format time types (#249)\n - Buffer optimizations (#269)\n - TLS ServerName defaults to the host (#283)\n - Refactoring (#400, #410, #437)\n - Adjusted documentation for second generation CloudSQL (#485)\n - Documented DSN system var quoting rules (#502)\n - Made statement.Close() calls idempotent to avoid errors in Go 1.6+ (#512)\n\nNew Features:\n\n - Enable microsecond resolution on TIME, DATETIME and TIMESTAMP (#249)\n - Support for returning table alias on Columns() (#289, #359, #382)\n - Placeholder interpolation, can be actived with the DSN parameter `interpolateParams=true` (#309, #318, #490)\n - Support for uint64 parameters with high bit set (#332, #345)\n - Cleartext authentication plugin support (#327)\n - Exported ParseDSN function and the Config struct (#403, #419, #429)\n - Read / Write timeouts (#401)\n - Support for JSON field type (#414)\n - Support for multi-statements and multi-results (#411, #431)\n - DSN parameter to set the driver-side max_allowed_packet value manually (#489)\n - Native password authentication plugin support (#494, #524)\n\nBugfixes:\n\n - Fixed handling of queries without columns and rows (#255)\n - Fixed a panic when SetKeepAlive() failed (#298)\n - Handle ERR packets while reading rows (#321)\n - Fixed reading NULL length-encoded integers in MySQL 5.6+ (#349)\n - Fixed absolute paths support in LOAD LOCAL DATA INFILE (#356)\n - Actually zero out bytes in handshake response (#378)\n - Fixed race condition in registering LOAD DATA INFILE handler (#383)\n - Fixed tests with MySQL 5.7.9+ (#380)\n - QueryUnescape TLS config names (#397)\n - Fixed \"broken pipe\" error by writing to closed socket (#390)\n - Fixed LOAD LOCAL DATA INFILE buffering (#424)\n - Fixed parsing of floats into float64 when placeholders are used (#434)\n - Fixed DSN tests with Go 1.7+ (#459)\n - Handle ERR packets while waiting for EOF (#473)\n - Invalidate connection on error while discarding additional results (#513)\n - Allow terminating packets of length 0 (#516)\n\n\n## Version 1.2 (2014-06-03)\n\nChanges:\n\n - We switched back to a \"rolling release\". `go get` installs the current master branch again\n - Version v1 of the driver will not be maintained anymore. Go 1.0 is no longer supported by this driver\n - Exported errors to allow easy checking from application code\n - Enabled TCP Keepalives on TCP connections\n - Optimized INFILE handling (better buffer size calculation, lazy init, ...)\n - The DSN parser also checks for a missing separating slash\n - Faster binary date / datetime to string formatting\n - Also exported the MySQLWarning type\n - mysqlConn.Close returns the first error encountered instead of ignoring all errors\n - writePacket() automatically writes the packet size to the header\n - readPacket() uses an iterative approach instead of the recursive approach to merge splitted packets\n\nNew Features:\n\n - `RegisterDial` allows the usage of a custom dial function to establish the network connection\n - Setting the connection collation is possible with the `collation` DSN parameter. This parameter should be preferred over the `charset` parameter\n - Logging of critical errors is configurable with `SetLogger`\n - Google CloudSQL support\n\nBugfixes:\n\n - Allow more than 32 parameters in prepared statements\n - Various old_password fixes\n - Fixed TestConcurrent test to pass Go's race detection\n - Fixed appendLengthEncodedInteger for large numbers\n - Renamed readLengthEnodedString to readLengthEncodedString and skipLengthEnodedString to skipLengthEncodedString (fixed typo)\n\n\n## Version 1.1 (2013-11-02)\n\nChanges:\n\n - Go-MySQL-Driver now requires Go 1.1\n - Connections now use the collation `utf8_general_ci` by default. Adding `&charset=UTF8` to the DSN should not be necessary anymore\n - Made closing rows and connections error tolerant. This allows for example deferring rows.Close() without checking for errors\n - `[]byte(nil)` is now treated as a NULL value. Before, it was treated like an empty string / `[]byte(\"\")`\n - DSN parameter values must now be url.QueryEscape'ed. This allows text values to contain special characters, such as '&'.\n - Use the IO buffer also for writing. This results in zero allocations (by the driver) for most queries\n - Optimized the buffer for reading\n - stmt.Query now caches column metadata\n - New Logo\n - Changed the copyright header to include all contributors\n - Improved the LOAD INFILE documentation\n - The driver struct is now exported to make the driver directly accessible\n - Refactored the driver tests\n - Added more benchmarks and moved all to a separate file\n - Other small refactoring\n\nNew Features:\n\n - Added *old_passwords* support: Required in some cases, but must be enabled by adding `allowOldPasswords=true` to the DSN since it is insecure\n - Added a `clientFoundRows` parameter: Return the number of matching rows instead of the number of rows changed on UPDATEs\n - Added TLS/SSL support: Use a TLS/SSL encrypted connection to the server. Custom TLS configs can be registered and used\n\nBugfixes:\n\n - Fixed MySQL 4.1 support: MySQL 4.1 sends packets with lengths which differ from the specification\n - Convert to DB timezone when inserting `time.Time`\n - Splitted packets (more than 16MB) are now merged correctly\n - Fixed false positive `io.EOF` errors when the data was fully read\n - Avoid panics on reuse of closed connections\n - Fixed empty string producing false nil values\n - Fixed sign byte for positive TIME fields\n\n\n## Version 1.0 (2013-05-14)\n\nInitial Release\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/CONTRIBUTING.md", "content": "# Contributing Guidelines\n\n## Reporting Issues\n\nBefore creating a new Issue, please check first if a similar Issue [already exists](https://github.com/go-sql-driver/mysql/issues?state=open) or was [recently closed](https://github.com/go-sql-driver/mysql/issues?direction=desc&page=1&sort=updated&state=closed).\n\n## Contributing Code\n\nBy contributing to this project, you share your code under the Mozilla Public License 2, as specified in the LICENSE file.\nDon't forget to add yourself to the AUTHORS file.\n\n### Code Review\n\nEveryone is invited to review and comment on pull requests.\nIf it looks fine to you, comment with \"LGTM\" (Looks good to me).\n\nIf changes are required, notice the reviewers with \"PTAL\" (Please take another look) after committing the fixes.\n\nBefore merging the Pull Request, at least one [team member](https://github.com/go-sql-driver?tab=members) must have commented with \"LGTM\".\n\n## Development Ideas\n\nIf you are looking for ideas for code contributions, please check our [Development Ideas](https://github.com/go-sql-driver/mysql/wiki/Development-Ideas) Wiki page.\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/LICENSE", "content": "Mozilla Public License Version 2.0\n==================================\n\n1. Definitions\n--------------\n\n1.1. \"Contributor\"\n means each individual or legal entity that creates, contributes to\n the creation of, or owns Covered Software.\n\n1.2. \"Contributor Version\"\n means the combination of the Contributions of others (if any) used\n by a Contributor and that particular Contributor's Contribution.\n\n1.3. \"Contribution\"\n means Covered Software of a particular Contributor.\n\n1.4. \"Covered Software\"\n means Source Code Form to which the initial Contributor has attached\n the notice in Exhibit A, the Executable Form of such Source Code\n Form, and Modifications of such Source Code Form, in each case\n including portions thereof.\n\n1.5. \"Incompatible With Secondary Licenses\"\n means\n\n (a) that the initial Contributor has attached the notice described\n in Exhibit B to the Covered Software; or\n\n (b) that the Covered Software was made available under the terms of\n version 1.1 or earlier of the License, but not also under the\n terms of a Secondary License.\n\n1.6. \"Executable Form\"\n means any form of the work other than Source Code Form.\n\n1.7. \"Larger Work\"\n means a work that combines Covered Software with other material, in \n a separate file or files, that is not Covered Software.\n\n1.8. \"License\"\n means this document.\n\n1.9. \"Licensable\"\n means having the right to grant, to the maximum extent possible,\n whether at the time of the initial grant or subsequently, any and\n all of the rights conveyed by this License.\n\n1.10. \"Modifications\"\n means any of the following:\n\n (a) any file in Source Code Form that results from an addition to,\n deletion from, or modification of the contents of Covered\n Software; or\n\n (b) any new file in Source Code Form that contains any Covered\n Software.\n\n1.11. \"Patent Claims\" of a Contributor\n means any patent claim(s), including without limitation, method,\n process, and apparatus claims, in any patent Licensable by such\n Contributor that would be infringed, but for the grant of the\n License, by the making, using, selling, offering for sale, having\n made, import, or transfer of either its Contributions or its\n Contributor Version.\n\n1.12. \"Secondary License\"\n means either the GNU General Public License, Version 2.0, the GNU\n Lesser General Public License, Version 2.1, the GNU Affero General\n Public License, Version 3.0, or any later versions of those\n licenses.\n\n1.13. \"Source Code Form\"\n means the form of the work preferred for making modifications.\n\n1.14. \"You\" (or \"Your\")\n means an individual or a legal entity exercising rights under this\n License. For legal entities, \"You\" includes any entity that\n controls, is controlled by, or is under common control with You. For\n purposes of this definition, \"control\" means (a) the power, direct\n or indirect, to cause the direction or management of such entity,\n whether by contract or otherwise, or (b) ownership of more than\n fifty percent (50%) of the outstanding shares or beneficial\n ownership of such entity.\n\n2. License Grants and Conditions\n--------------------------------\n\n2.1. Grants\n\nEach Contributor hereby grants You a world-wide, royalty-free,\nnon-exclusive license:\n\n(a) under intellectual property rights (other than patent or trademark)\n Licensable by such Contributor to use, reproduce, make available,\n modify, display, perform, distribute, and otherwise exploit its\n Contributions, either on an unmodified basis, with Modifications, or\n as part of a Larger Work; and\n\n(b) under Patent Claims of such Contributor to make, use, sell, offer\n for sale, have made, import, and otherwise transfer either its\n Contributions or its Contributor Version.\n\n2.2. Effective Date\n\nThe licenses granted in Section 2.1 with respect to any Contribution\nbecome effective for each Contribution on the date the Contributor first\ndistributes such Contribution.\n\n2.3. Limitations on Grant Scope\n\nThe licenses granted in this Section 2 are the only rights granted under\nthis License. No additional rights or licenses will be implied from the\ndistribution or licensing of Covered Software under this License.\nNotwithstanding Section 2.1(b) above, no patent license is granted by a\nContributor:\n\n(a) for any code that a Contributor has removed from Covered Software;\n or\n\n(b) for infringements caused by: (i) Your and any other third party's\n modifications of Covered Software, or (ii) the combination of its\n Contributions with other software (except as part of its Contributor\n Version); or\n\n(c) under Patent Claims infringed by Covered Software in the absence of\n its Contributions.\n\nThis License does not grant any rights in the trademarks, service marks,\nor logos of any Contributor (except as may be necessary to comply with\nthe notice requirements in Section 3.4).\n\n2.4. Subsequent Licenses\n\nNo Contributor makes additional grants as a result of Your choice to\ndistribute the Covered Software under a subsequent version of this\nLicense (see Section 10.2) or under the terms of a Secondary License (if\npermitted under the terms of Section 3.3).\n\n2.5. Representation\n\nEach Contributor represents that the Contributor believes its\nContributions are its original creation(s) or it has sufficient rights\nto grant the rights to its Contributions conveyed by this License.\n\n2.6. Fair Use\n\nThis License is not intended to limit any rights You have under\napplicable copyright doctrines of fair use, fair dealing, or other\nequivalents.\n\n2.7. Conditions\n\nSections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted\nin Section 2.1.\n\n3. Responsibilities\n-------------------\n\n3.1. Distribution of Source Form\n\nAll distribution of Covered Software in Source Code Form, including any\nModifications that You create or to which You contribute, must be under\nthe terms of this License. You must inform recipients that the Source\nCode Form of the Covered Software is governed by the terms of this\nLicense, and how they can obtain a copy of this License. You may not\nattempt to alter or restrict the recipients' rights in the Source Code\nForm.\n\n3.2. Distribution of Executable Form\n\nIf You distribute Covered Software in Executable Form then:\n\n(a) such Covered Software must also be made available in Source Code\n Form, as described in Section 3.1, and You must inform recipients of\n the Executable Form how they can obtain a copy of such Source Code\n Form by reasonable means in a timely manner, at a charge no more\n than the cost of distribution to the recipient; and\n\n(b) You may distribute such Executable Form under the terms of this\n License, or sublicense it under different terms, provided that the\n license for the Executable Form does not attempt to limit or alter\n the recipients' rights in the Source Code Form under this License.\n\n3.3. Distribution of a Larger Work\n\nYou may create and distribute a Larger Work under terms of Your choice,\nprovided that You also comply with the requirements of this License for\nthe Covered Software. If the Larger Work is a combination of Covered\nSoftware with a work governed by one or more Secondary Licenses, and the\nCovered Software is not Incompatible With Secondary Licenses, this\nLicense permits You to additionally distribute such Covered Software\nunder the terms of such Secondary License(s), so that the recipient of\nthe Larger Work may, at their option, further distribute the Covered\nSoftware under the terms of either this License or such Secondary\nLicense(s).\n\n3.4. Notices\n\nYou may not remove or alter the substance of any license notices\n(including copyright notices, patent notices, disclaimers of warranty,\nor limitations of liability) contained within the Source Code Form of\nthe Covered Software, except that You may alter any license notices to\nthe extent required to remedy known factual inaccuracies.\n\n3.5. Application of Additional Terms\n\nYou may choose to offer, and to charge a fee for, warranty, support,\nindemnity or liability obligations to one or more recipients of Covered\nSoftware. However, You may do so only on Your own behalf, and not on\nbehalf of any Contributor. You must make it absolutely clear that any\nsuch warranty, support, indemnity, or liability obligation is offered by\nYou alone, and You hereby agree to indemnify every Contributor for any\nliability incurred by such Contributor as a result of warranty, support,\nindemnity or liability terms You offer. You may include additional\ndisclaimers of warranty and limitations of liability specific to any\njurisdiction.\n\n4. Inability to Comply Due to Statute or Regulation\n---------------------------------------------------\n\nIf it is impossible for You to comply with any of the terms of this\nLicense with respect to some or all of the Covered Software due to\nstatute, judicial order, or regulation then You must: (a) comply with\nthe terms of this License to the maximum extent possible; and (b)\ndescribe the limitations and the code they affect. Such description must\nbe placed in a text file included with all distributions of the Covered\nSoftware under this License. Except to the extent prohibited by statute\nor regulation, such description must be sufficiently detailed for a\nrecipient of ordinary skill to be able to understand it.\n\n5. Termination\n--------------\n\n5.1. The rights granted under this License will terminate automatically\nif You fail to comply with any of its terms. However, if You become\ncompliant, then the rights granted under this License from a particular\nContributor are reinstated (a) provisionally, unless and until such\nContributor explicitly and finally terminates Your grants, and (b) on an\nongoing basis, if such Contributor fails to notify You of the\nnon-compliance by some reasonable means prior to 60 days after You have\ncome back into compliance. Moreover, Your grants from a particular\nContributor are reinstated on an ongoing basis if such Contributor\nnotifies You of the non-compliance by some reasonable means, this is the\nfirst time You have received notice of non-compliance with this License\nfrom such Contributor, and You become compliant prior to 30 days after\nYour receipt of the notice.\n\n5.2. If You initiate litigation against any entity by asserting a patent\ninfringement claim (excluding declaratory judgment actions,\ncounter-claims, and cross-claims) alleging that a Contributor Version\ndirectly or indirectly infringes any patent, then the rights granted to\nYou by any and all Contributors for the Covered Software under Section\n2.1 of this License shall terminate.\n\n5.3. In the event of termination under Sections 5.1 or 5.2 above, all\nend user license agreements (excluding distributors and resellers) which\nhave been validly granted by You or Your distributors under this License\nprior to termination shall survive termination.\n\n************************************************************************\n* *\n* 6. Disclaimer of Warranty *\n* ------------------------- *\n* *\n* Covered Software is provided under this License on an \"as is\" *\n* basis, without warranty of any kind, either expressed, implied, or *\n* statutory, including, without limitation, warranties that the *\n* Covered Software is free of defects, merchantable, fit for a *\n* particular purpose or non-infringing. The entire risk as to the *\n* quality and performance of the Covered Software is with You. *\n* Should any Covered Software prove defective in any respect, You *\n* (not any Contributor) assume the cost of any necessary servicing, *\n* repair, or correction. This disclaimer of warranty constitutes an *\n* essential part of this License. No use of any Covered Software is *\n* authorized under this License except under this disclaimer. *\n* *\n************************************************************************\n\n************************************************************************\n* *\n* 7. Limitation of Liability *\n* -------------------------- *\n* *\n* Under no circumstances and under no legal theory, whether tort *\n* (including negligence), contract, or otherwise, shall any *\n* Contributor, or anyone who distributes Covered Software as *\n* permitted above, be liable to You for any direct, indirect, *\n* special, incidental, or consequential damages of any character *\n* including, without limitation, damages for lost profits, loss of *\n* goodwill, work stoppage, computer failure or malfunction, or any *\n* and all other commercial damages or losses, even if such party *\n* shall have been informed of the possibility of such damages. This *\n* limitation of liability shall not apply to liability for death or *\n* personal injury resulting from such party's negligence to the *\n* extent applicable law prohibits such limitation. Some *\n* jurisdictions do not allow the exclusion or limitation of *\n* incidental or consequential damages, so this exclusion and *\n* limitation may not apply to You. *\n* *\n************************************************************************\n\n8. Litigation\n-------------\n\nAny litigation relating to this License may be brought only in the\ncourts of a jurisdiction where the defendant maintains its principal\nplace of business and such litigation shall be governed by laws of that\njurisdiction, without reference to its conflict-of-law provisions.\nNothing in this Section shall prevent a party's ability to bring\ncross-claims or counter-claims.\n\n9. Miscellaneous\n----------------\n\nThis License represents the complete agreement concerning the subject\nmatter hereof. If any provision of this License is held to be\nunenforceable, such provision shall be reformed only to the extent\nnecessary to make it enforceable. Any law or regulation which provides\nthat the language of a contract shall be construed against the drafter\nshall not be used to construe this License against a Contributor.\n\n10. Versions of the License\n---------------------------\n\n10.1. New Versions\n\nMozilla Foundation is the license steward. Except as provided in Section\n10.3, no one other than the license steward has the right to modify or\npublish new versions of this License. Each version will be given a\ndistinguishing version number.\n\n10.2. Effect of New Versions\n\nYou may distribute the Covered Software under the terms of the version\nof the License under which You originally received the Covered Software,\nor under the terms of any subsequent version published by the license\nsteward.\n\n10.3. Modified Versions\n\nIf you create software not governed by this License, and you want to\ncreate a new license for such software, you may create and use a\nmodified version of this License if you rename the license and remove\nany references to the name of the license steward (except to note that\nsuch modified license differs from this License).\n\n10.4. Distributing Source Code Form that is Incompatible With Secondary\nLicenses\n\nIf You choose to distribute Source Code Form that is Incompatible With\nSecondary Licenses under the terms of this version of the License, the\nnotice described in Exhibit B of this License must be attached.\n\nExhibit A - Source Code Form License Notice\n-------------------------------------------\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http://mozilla.org/MPL/2.0/.\n\nIf it is not possible or desirable to put the notice in a particular\nfile, then You may include the notice in a location (such as a LICENSE\nfile in a relevant directory) where a recipient would be likely to look\nfor such a notice.\n\nYou may add additional accurate notices of copyright ownership.\n\nExhibit B - \"Incompatible With Secondary Licenses\" Notice\n---------------------------------------------------------\n\n This Source Code Form is \"Incompatible With Secondary Licenses\", as\n defined by the Mozilla Public License, v. 2.0.\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/README.md", "content": "# Go-MySQL-Driver\n\nA MySQL-Driver for Go's [database/sql](https://golang.org/pkg/database/sql/) package\n\n![Go-MySQL-Driver logo](https://raw.github.com/wiki/go-sql-driver/mysql/gomysql_m.png \"Golang Gopher holding the MySQL Dolphin\")\n\n---------------------------------------\n * [Features](#features)\n * [Requirements](#requirements)\n * [Installation](#installation)\n * [Usage](#usage)\n * [DSN (Data Source Name)](#dsn-data-source-name)\n * [Password](#password)\n * [Protocol](#protocol)\n * [Address](#address)\n * [Parameters](#parameters)\n * [Examples](#examples)\n * [Connection pool and timeouts](#connection-pool-and-timeouts)\n * [context.Context Support](#contextcontext-support)\n * [ColumnType Support](#columntype-support)\n * [LOAD DATA LOCAL INFILE support](#load-data-local-infile-support)\n * [time.Time support](#timetime-support)\n * [Unicode support](#unicode-support)\n * [Testing / Development](#testing--development)\n * [License](#license)\n\n---------------------------------------\n\n## Features\n * Lightweight and [fast](https://github.com/go-sql-driver/sql-benchmark \"golang MySQL-Driver performance\")\n * Native Go implementation. No C-bindings, just pure Go\n * Connections over TCP/IPv4, TCP/IPv6, Unix domain sockets or [custom protocols](https://godoc.org/github.com/go-sql-driver/mysql#DialFunc)\n * Automatic handling of broken connections\n * Automatic Connection Pooling *(by database/sql package)*\n * Supports queries larger than 16MB\n * Full [`sql.RawBytes`](https://golang.org/pkg/database/sql/#RawBytes) support.\n * Intelligent `LONG DATA` handling in prepared statements\n * Secure `LOAD DATA LOCAL INFILE` support with file Whitelisting and `io.Reader` support\n * Optional `time.Time` parsing\n * Optional placeholder interpolation\n\n## Requirements\n * Go 1.9 or higher. We aim to support the 3 latest versions of Go.\n * MySQL (4.1+), MariaDB, Percona Server, Google CloudSQL or Sphinx (2.2.3+)\n\n---------------------------------------\n\n## Installation\nSimple install the package to your [$GOPATH](https://github.com/golang/go/wiki/GOPATH \"GOPATH\") with the [go tool](https://golang.org/cmd/go/ \"go command\") from shell:\n```bash\n$ go get -u github.com/go-sql-driver/mysql\n```\nMake sure [Git is installed](https://git-scm.com/downloads) on your machine and in your system's `PATH`.\n\n## Usage\n_Go MySQL Driver_ is an implementation of Go's `database/sql/driver` interface. You only need to import the driver and can use the full [`database/sql`](https://golang.org/pkg/database/sql/) API then.\n\nUse `mysql` as `driverName` and a valid [DSN](#dsn-data-source-name) as `dataSourceName`:\n```go\nimport \"database/sql\"\nimport _ \"github.com/go-sql-driver/mysql\"\n\ndb, err := sql.Open(\"mysql\", \"user:password@/dbname\")\n```\n\n[Examples are available in our Wiki](https://github.com/go-sql-driver/mysql/wiki/Examples \"Go-MySQL-Driver Examples\").\n\n\n### DSN (Data Source Name)\n\nThe Data Source Name has a common format, like e.g. [PEAR DB](http://pear.php.net/manual/en/package.database.db.intro-dsn.php) uses it, but without type-prefix (optional parts marked by squared brackets):\n```\n[username[:password]@][protocol[(address)]]/dbname[?param1=value1&...¶mN=valueN]\n```\n\nA DSN in its fullest form:\n```\nusername:password@protocol(address)/dbname?param=value\n```\n\nExcept for the databasename, all values are optional. So the minimal DSN is:\n```\n/dbname\n```\n\nIf you do not want to preselect a database, leave `dbname` empty:\n```\n/\n```\nThis has the same effect as an empty DSN string:\n```\n\n```\n\nAlternatively, [Config.FormatDSN](https://godoc.org/github.com/go-sql-driver/mysql#Config.FormatDSN) can be used to create a DSN string by filling a struct.\n\n#### Password\nPasswords can consist of any character. Escaping is **not** necessary.\n\n#### Protocol\nSee [net.Dial](https://golang.org/pkg/net/#Dial) for more information which networks are available.\nIn general you should use an Unix domain socket if available and TCP otherwise for best performance.\n\n#### Address\nFor TCP and UDP networks, addresses have the form `host[:port]`.\nIf `port` is omitted, the default port will be used.\nIf `host` is a literal IPv6 address, it must be enclosed in square brackets.\nThe functions [net.JoinHostPort](https://golang.org/pkg/net/#JoinHostPort) and [net.SplitHostPort](https://golang.org/pkg/net/#SplitHostPort) manipulate addresses in this form.\n\nFor Unix domain sockets the address is the absolute path to the MySQL-Server-socket, e.g. `/var/run/mysqld/mysqld.sock` or `/tmp/mysql.sock`.\n\n#### Parameters\n*Parameters are case-sensitive!*\n\nNotice that any of `true`, `TRUE`, `True` or `1` is accepted to stand for a true boolean value. Not surprisingly, false can be specified as any of: `false`, `FALSE`, `False` or `0`.\n\n##### `allowAllFiles`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\n`allowAllFiles=true` disables the file Whitelist for `LOAD DATA LOCAL INFILE` and allows *all* files.\n[*Might be insecure!*](http://dev.mysql.com/doc/refman/5.7/en/load-data-local.html)\n\n##### `allowCleartextPasswords`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\n`allowCleartextPasswords=true` allows using the [cleartext client side plugin](http://dev.mysql.com/doc/en/cleartext-authentication-plugin.html) if required by an account, such as one defined with the [PAM authentication plugin](http://dev.mysql.com/doc/en/pam-authentication-plugin.html). Sending passwords in clear text may be a security problem in some configurations. To avoid problems if there is any possibility that the password would be intercepted, clients should connect to MySQL Server using a method that protects the password. Possibilities include [TLS / SSL](#tls), IPsec, or a private network.\n\n##### `allowNativePasswords`\n\n```\nType: bool\nValid Values: true, false\nDefault: true\n```\n`allowNativePasswords=false` disallows the usage of MySQL native password method.\n\n##### `allowOldPasswords`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n`allowOldPasswords=true` allows the usage of the insecure old password method. This should be avoided, but is necessary in some cases. See also [the old_passwords wiki page](https://github.com/go-sql-driver/mysql/wiki/old_passwords).\n\n##### `charset`\n\n```\nType: string\nValid Values: \nDefault: none\n```\n\nSets the charset used for client-server interaction (`\"SET NAMES \"`). If multiple charsets are set (separated by a comma), the following charset is used if setting the charset failes. This enables for example support for `utf8mb4` ([introduced in MySQL 5.5.3](http://dev.mysql.com/doc/refman/5.5/en/charset-unicode-utf8mb4.html)) with fallback to `utf8` for older servers (`charset=utf8mb4,utf8`).\n\nUsage of the `charset` parameter is discouraged because it issues additional queries to the server.\nUnless you need the fallback behavior, please use `collation` instead.\n\n##### `collation`\n\n```\nType: string\nValid Values: \nDefault: utf8mb4_general_ci\n```\n\nSets the collation used for client-server interaction on connection. In contrast to `charset`, `collation` does not issue additional queries. If the specified collation is unavailable on the target server, the connection will fail.\n\nA list of valid charsets for a server is retrievable with `SHOW COLLATION`.\n\nThe default collation (`utf8mb4_general_ci`) is supported from MySQL 5.5. You should use an older collation (e.g. `utf8_general_ci`) for older MySQL.\n\nCollations for charset \"ucs2\", \"utf16\", \"utf16le\", and \"utf32\" can not be used ([ref](https://dev.mysql.com/doc/refman/5.7/en/charset-connection.html#charset-connection-impermissible-client-charset)).\n\n\n##### `clientFoundRows`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\n`clientFoundRows=true` causes an UPDATE to return the number of matching rows instead of the number of rows changed.\n\n##### `columnsWithAlias`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\nWhen `columnsWithAlias` is true, calls to `sql.Rows.Columns()` will return the table alias and the column name separated by a dot. For example:\n\n```\nSELECT u.id FROM users as u\n```\n\nwill return `u.id` instead of just `id` if `columnsWithAlias=true`.\n\n##### `interpolateParams`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\nIf `interpolateParams` is true, placeholders (`?`) in calls to `db.Query()` and `db.Exec()` are interpolated into a single query string with given parameters. This reduces the number of roundtrips, since the driver has to prepare a statement, execute it with given parameters and close the statement again with `interpolateParams=false`.\n\n*This can not be used together with the multibyte encodings BIG5, CP932, GB2312, GBK or SJIS. These are blacklisted as they may [introduce a SQL injection vulnerability](http://stackoverflow.com/a/12118602/3430118)!*\n\n##### `loc`\n\n```\nType: string\nValid Values: \nDefault: UTC\n```\n\nSets the location for time.Time values (when using `parseTime=true`). *\"Local\"* sets the system's location. See [time.LoadLocation](https://golang.org/pkg/time/#LoadLocation) for details.\n\nNote that this sets the location for time.Time values but does not change MySQL's [time_zone setting](https://dev.mysql.com/doc/refman/5.5/en/time-zone-support.html). For that see the [time_zone system variable](#system-variables), which can also be set as a DSN parameter.\n\nPlease keep in mind, that param values must be [url.QueryEscape](https://golang.org/pkg/net/url/#QueryEscape)'ed. Alternatively you can manually replace the `/` with `%2F`. For example `US/Pacific` would be `loc=US%2FPacific`.\n\n##### `maxAllowedPacket`\n```\nType: decimal number\nDefault: 4194304\n```\n\nMax packet size allowed in bytes. The default value is 4 MiB and should be adjusted to match the server settings. `maxAllowedPacket=0` can be used to automatically fetch the `max_allowed_packet` variable from server *on every connection*.\n\n##### `multiStatements`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\nAllow multiple statements in one query. While this allows batch queries, it also greatly increases the risk of SQL injections. Only the result of the first query is returned, all other results are silently discarded.\n\nWhen `multiStatements` is used, `?` parameters must only be used in the first statement.\n\n##### `parseTime`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\n`parseTime=true` changes the output type of `DATE` and `DATETIME` values to `time.Time` instead of `[]byte` / `string`\nThe date or datetime like `0000-00-00 00:00:00` is converted into zero value of `time.Time`.\n\n\n##### `readTimeout`\n\n```\nType: duration\nDefault: 0\n```\n\nI/O read timeout. The value must be a decimal number with a unit suffix (*\"ms\"*, *\"s\"*, *\"m\"*, *\"h\"*), such as *\"30s\"*, *\"0.5m\"* or *\"1m30s\"*.\n\n##### `rejectReadOnly`\n\n```\nType: bool\nValid Values: true, false\nDefault: false\n```\n\n\n`rejectReadOnly=true` causes the driver to reject read-only connections. This\nis for a possible race condition during an automatic failover, where the mysql\nclient gets connected to a read-only replica after the failover.\n\nNote that this should be a fairly rare case, as an automatic failover normally\nhappens when the primary is down, and the race condition shouldn't happen\nunless it comes back up online as soon as the failover is kicked off. On the\nother hand, when this happens, a MySQL application can get stuck on a\nread-only connection until restarted. It is however fairly easy to reproduce,\nfor example, using a manual failover on AWS Aurora's MySQL-compatible cluster.\n\nIf you are not relying on read-only transactions to reject writes that aren't\nsupposed to happen, setting this on some MySQL providers (such as AWS Aurora)\nis safer for failovers.\n\nNote that ERROR 1290 can be returned for a `read-only` server and this option will\ncause a retry for that error. However the same error number is used for some\nother cases. You should ensure your application will never cause an ERROR 1290\nexcept for `read-only` mode when enabling this option.\n\n\n##### `serverPubKey`\n\n```\nType: string\nValid Values: \nDefault: none\n```\n\nServer public keys can be registered with [`mysql.RegisterServerPubKey`](https://godoc.org/github.com/go-sql-driver/mysql#RegisterServerPubKey), which can then be used by the assigned name in the DSN.\nPublic keys are used to transmit encrypted data, e.g. for authentication.\nIf the server's public key is known, it should be set manually to avoid expensive and potentially insecure transmissions of the public key from the server to the client each time it is required.\n\n\n##### `timeout`\n\n```\nType: duration\nDefault: OS default\n```\n\nTimeout for establishing connections, aka dial timeout. The value must be a decimal number with a unit suffix (*\"ms\"*, *\"s\"*, *\"m\"*, *\"h\"*), such as *\"30s\"*, *\"0.5m\"* or *\"1m30s\"*.\n\n\n##### `tls`\n\n```\nType: bool / string\nValid Values: true, false, skip-verify, preferred, \nDefault: false\n```\n\n`tls=true` enables TLS / SSL encrypted connection to the server. Use `skip-verify` if you want to use a self-signed or invalid certificate (server side) or use `preferred` to use TLS only when advertised by the server. This is similar to `skip-verify`, but additionally allows a fallback to a connection which is not encrypted. Neither `skip-verify` nor `preferred` add any reliable security. You can use a custom TLS config after registering it with [`mysql.RegisterTLSConfig`](https://godoc.org/github.com/go-sql-driver/mysql#RegisterTLSConfig).\n\n\n##### `writeTimeout`\n\n```\nType: duration\nDefault: 0\n```\n\nI/O write timeout. The value must be a decimal number with a unit suffix (*\"ms\"*, *\"s\"*, *\"m\"*, *\"h\"*), such as *\"30s\"*, *\"0.5m\"* or *\"1m30s\"*.\n\n\n##### System Variables\n\nAny other parameters are interpreted as system variables:\n * `=`: `SET =`\n * `=`: `SET =`\n * `=%27%27`: `SET =''`\n\nRules:\n* The values for string variables must be quoted with `'`.\n* The values must also be [url.QueryEscape](http://golang.org/pkg/net/url/#QueryEscape)'ed!\n (which implies values of string variables must be wrapped with `%27`).\n\nExamples:\n * `autocommit=1`: `SET autocommit=1`\n * [`time_zone=%27Europe%2FParis%27`](https://dev.mysql.com/doc/refman/5.5/en/time-zone-support.html): `SET time_zone='Europe/Paris'`\n * [`tx_isolation=%27REPEATABLE-READ%27`](https://dev.mysql.com/doc/refman/5.5/en/server-system-variables.html#sysvar_tx_isolation): `SET tx_isolation='REPEATABLE-READ'`\n\n\n#### Examples\n```\nuser@unix(/path/to/socket)/dbname\n```\n\n```\nroot:pw@unix(/tmp/mysql.sock)/myDatabase?loc=Local\n```\n\n```\nuser:password@tcp(localhost:5555)/dbname?tls=skip-verify&autocommit=true\n```\n\nTreat warnings as errors by setting the system variable [`sql_mode`](https://dev.mysql.com/doc/refman/5.7/en/sql-mode.html):\n```\nuser:password@/dbname?sql_mode=TRADITIONAL\n```\n\nTCP via IPv6:\n```\nuser:password@tcp([de:ad:be:ef::ca:fe]:80)/dbname?timeout=90s&collation=utf8mb4_unicode_ci\n```\n\nTCP on a remote host, e.g. Amazon RDS:\n```\nid:password@tcp(your-amazonaws-uri.com:3306)/dbname\n```\n\nGoogle Cloud SQL on App Engine (First Generation MySQL Server):\n```\nuser@cloudsql(project-id:instance-name)/dbname\n```\n\nGoogle Cloud SQL on App Engine (Second Generation MySQL Server):\n```\nuser@cloudsql(project-id:regionname:instance-name)/dbname\n```\n\nTCP using default port (3306) on localhost:\n```\nuser:password@tcp/dbname?charset=utf8mb4,utf8&sys_var=esc%40ped\n```\n\nUse the default protocol (tcp) and host (localhost:3306):\n```\nuser:password@/dbname\n```\n\nNo Database preselected:\n```\nuser:password@/\n```\n\n\n### Connection pool and timeouts\nThe connection pool is managed by Go's database/sql package. For details on how to configure the size of the pool and how long connections stay in the pool see `*DB.SetMaxOpenConns`, `*DB.SetMaxIdleConns`, and `*DB.SetConnMaxLifetime` in the [database/sql documentation](https://golang.org/pkg/database/sql/). The read, write, and dial timeouts for each individual connection are configured with the DSN parameters [`readTimeout`](#readtimeout), [`writeTimeout`](#writetimeout), and [`timeout`](#timeout), respectively.\n\n## `ColumnType` Support\nThis driver supports the [`ColumnType` interface](https://golang.org/pkg/database/sql/#ColumnType) introduced in Go 1.8, with the exception of [`ColumnType.Length()`](https://golang.org/pkg/database/sql/#ColumnType.Length), which is currently not supported.\n\n## `context.Context` Support\nGo 1.8 added `database/sql` support for `context.Context`. This driver supports query timeouts and cancellation via contexts.\nSee [context support in the database/sql package](https://golang.org/doc/go1.8#database_sql) for more details.\n\n\n### `LOAD DATA LOCAL INFILE` support\nFor this feature you need direct access to the package. Therefore you must change the import path (no `_`):\n```go\nimport \"github.com/go-sql-driver/mysql\"\n```\n\nFiles must be whitelisted by registering them with `mysql.RegisterLocalFile(filepath)` (recommended) or the Whitelist check must be deactivated by using the DSN parameter `allowAllFiles=true` ([*Might be insecure!*](http://dev.mysql.com/doc/refman/5.7/en/load-data-local.html)).\n\nTo use a `io.Reader` a handler function must be registered with `mysql.RegisterReaderHandler(name, handler)` which returns a `io.Reader` or `io.ReadCloser`. The Reader is available with the filepath `Reader::` then. Choose different names for different handlers and `DeregisterReaderHandler` when you don't need it anymore.\n\nSee the [godoc of Go-MySQL-Driver](https://godoc.org/github.com/go-sql-driver/mysql \"golang mysql driver documentation\") for details.\n\n\n### `time.Time` support\nThe default internal output type of MySQL `DATE` and `DATETIME` values is `[]byte` which allows you to scan the value into a `[]byte`, `string` or `sql.RawBytes` variable in your program.\n\nHowever, many want to scan MySQL `DATE` and `DATETIME` values into `time.Time` variables, which is the logical equivalent in Go to `DATE` and `DATETIME` in MySQL. You can do that by changing the internal output type from `[]byte` to `time.Time` with the DSN parameter `parseTime=true`. You can set the default [`time.Time` location](https://golang.org/pkg/time/#Location) with the `loc` DSN parameter.\n\n**Caution:** As of Go 1.1, this makes `time.Time` the only variable type you can scan `DATE` and `DATETIME` values into. This breaks for example [`sql.RawBytes` support](https://github.com/go-sql-driver/mysql/wiki/Examples#rawbytes).\n\nAlternatively you can use the [`NullTime`](https://godoc.org/github.com/go-sql-driver/mysql#NullTime) type as the scan destination, which works with both `time.Time` and `string` / `[]byte`.\n\n\n### Unicode support\nSince version 1.1 Go-MySQL-Driver automatically uses the collation `utf8_general_ci` by default.\n\nOther collations / charsets can be set using the [`collation`](#collation) DSN parameter.\n\nVersion 1.0 of the driver recommended adding `&charset=utf8` (alias for `SET NAMES utf8`) to the DSN to enable proper UTF-8 support. This is not necessary anymore. The [`collation`](#collation) parameter should be preferred to set another collation / charset than the default.\n\nSee http://dev.mysql.com/doc/refman/5.7/en/charset-unicode.html for more details on MySQL's Unicode support.\n\n## Testing / Development\nTo run the driver tests you may need to adjust the configuration. See the [Testing Wiki-Page](https://github.com/go-sql-driver/mysql/wiki/Testing \"Testing\") for details.\n\nGo-MySQL-Driver is not feature-complete yet. Your help is very appreciated.\nIf you want to contribute, you can work on an [open issue](https://github.com/go-sql-driver/mysql/issues?state=open) or review a [pull request](https://github.com/go-sql-driver/mysql/pulls).\n\nSee the [Contribution Guidelines](https://github.com/go-sql-driver/mysql/blob/master/CONTRIBUTING.md) for details.\n\n---------------------------------------\n\n## License\nGo-MySQL-Driver is licensed under the [Mozilla Public License Version 2.0](https://raw.github.com/go-sql-driver/mysql/master/LICENSE)\n\nMozilla summarizes the license scope as follows:\n> MPL: The copyleft applies to any files containing MPLed code.\n\n\nThat means:\n * You can **use** the **unchanged** source code both in private and commercially.\n * When distributing, you **must publish** the source code of any **changed files** licensed under the MPL 2.0 under a) the MPL 2.0 itself or b) a compatible license (e.g. GPL 3.0 or Apache License 2.0).\n * You **needn't publish** the source code of your library as long as the files licensed under the MPL 2.0 are **unchanged**.\n\nPlease read the [MPL 2.0 FAQ](https://www.mozilla.org/en-US/MPL/2.0/FAQ/) if you have further questions regarding the license.\n\nYou can read the full terms here: [LICENSE](https://raw.github.com/go-sql-driver/mysql/master/LICENSE).\n\n![Go Gopher and MySQL Dolphin](https://raw.github.com/wiki/go-sql-driver/mysql/go-mysql-driver_m.jpg \"Golang Gopher transporting the MySQL Dolphin in a wheelbarrow\")\n\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/appengine.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2013 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\n// +build appengine\n\npackage mysql\n\nimport (\n\t\"context\"\n\t\"net\"\n\n\t\"google.golang.org/appengine/cloudsql\"\n)\n\nfunc init() {\n\tRegisterDialContext(\"cloudsql\", func(_ context.Context, instance string) (net.Conn, error) {\n\t\t// XXX: the cloudsql driver still does not export a Context-aware dialer.\n\t\treturn cloudsql.Dial(instance)\n\t})\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/auth.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2018 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"crypto/rand\"\n\t\"crypto/rsa\"\n\t\"crypto/sha1\"\n\t\"crypto/sha256\"\n\t\"crypto/x509\"\n\t\"encoding/pem\"\n\t\"sync\"\n)\n\n// server pub keys registry\nvar (\n\tserverPubKeyLock sync.RWMutex\n\tserverPubKeyRegistry map[string]*rsa.PublicKey\n)\n\n// RegisterServerPubKey registers a server RSA public key which can be used to\n// send data in a secure manner to the server without receiving the public key\n// in a potentially insecure way from the server first.\n// Registered keys can afterwards be used adding serverPubKey= to the DSN.\n//\n// Note: The provided rsa.PublicKey instance is exclusively owned by the driver\n// after registering it and may not be modified.\n//\n// data, err := ioutil.ReadFile(\"mykey.pem\")\n// if err != nil {\n// \tlog.Fatal(err)\n// }\n//\n// block, _ := pem.Decode(data)\n// if block == nil || block.Type != \"PUBLIC KEY\" {\n// \tlog.Fatal(\"failed to decode PEM block containing public key\")\n// }\n//\n// pub, err := x509.ParsePKIXPublicKey(block.Bytes)\n// if err != nil {\n// \tlog.Fatal(err)\n// }\n//\n// if rsaPubKey, ok := pub.(*rsa.PublicKey); ok {\n// \tmysql.RegisterServerPubKey(\"mykey\", rsaPubKey)\n// } else {\n// \tlog.Fatal(\"not a RSA public key\")\n// }\n//\nfunc RegisterServerPubKey(name string, pubKey *rsa.PublicKey) {\n\tserverPubKeyLock.Lock()\n\tif serverPubKeyRegistry == nil {\n\t\tserverPubKeyRegistry = make(map[string]*rsa.PublicKey)\n\t}\n\n\tserverPubKeyRegistry[name] = pubKey\n\tserverPubKeyLock.Unlock()\n}\n\n// DeregisterServerPubKey removes the public key registered with the given name.\nfunc DeregisterServerPubKey(name string) {\n\tserverPubKeyLock.Lock()\n\tif serverPubKeyRegistry != nil {\n\t\tdelete(serverPubKeyRegistry, name)\n\t}\n\tserverPubKeyLock.Unlock()\n}\n\nfunc getServerPubKey(name string) (pubKey *rsa.PublicKey) {\n\tserverPubKeyLock.RLock()\n\tif v, ok := serverPubKeyRegistry[name]; ok {\n\t\tpubKey = v\n\t}\n\tserverPubKeyLock.RUnlock()\n\treturn\n}\n\n// Hash password using pre 4.1 (old password) method\n// https://github.com/atcurtis/mariadb/blob/master/mysys/my_rnd.c\ntype myRnd struct {\n\tseed1, seed2 uint32\n}\n\nconst myRndMaxVal = 0x3FFFFFFF\n\n// Pseudo random number generator\nfunc newMyRnd(seed1, seed2 uint32) *myRnd {\n\treturn &myRnd{\n\t\tseed1: seed1 % myRndMaxVal,\n\t\tseed2: seed2 % myRndMaxVal,\n\t}\n}\n\n// Tested to be equivalent to MariaDB's floating point variant\n// http://play.golang.org/p/QHvhd4qved\n// http://play.golang.org/p/RG0q4ElWDx\nfunc (r *myRnd) NextByte() byte {\n\tr.seed1 = (r.seed1*3 + r.seed2) % myRndMaxVal\n\tr.seed2 = (r.seed1 + r.seed2 + 33) % myRndMaxVal\n\n\treturn byte(uint64(r.seed1) * 31 / myRndMaxVal)\n}\n\n// Generate binary hash from byte string using insecure pre 4.1 method\nfunc pwHash(password []byte) (result [2]uint32) {\n\tvar add uint32 = 7\n\tvar tmp uint32\n\n\tresult[0] = 1345345333\n\tresult[1] = 0x12345671\n\n\tfor _, c := range password {\n\t\t// skip spaces and tabs in password\n\t\tif c == ' ' || c == '\\t' {\n\t\t\tcontinue\n\t\t}\n\n\t\ttmp = uint32(c)\n\t\tresult[0] ^= (((result[0] & 63) + add) * tmp) + (result[0] << 8)\n\t\tresult[1] += (result[1] << 8) ^ result[0]\n\t\tadd += tmp\n\t}\n\n\t// Remove sign bit (1<<31)-1)\n\tresult[0] &= 0x7FFFFFFF\n\tresult[1] &= 0x7FFFFFFF\n\n\treturn\n}\n\n// Hash password using insecure pre 4.1 method\nfunc scrambleOldPassword(scramble []byte, password string) []byte {\n\tif len(password) == 0 {\n\t\treturn nil\n\t}\n\n\tscramble = scramble[:8]\n\n\thashPw := pwHash([]byte(password))\n\thashSc := pwHash(scramble)\n\n\tr := newMyRnd(hashPw[0]^hashSc[0], hashPw[1]^hashSc[1])\n\n\tvar out [8]byte\n\tfor i := range out {\n\t\tout[i] = r.NextByte() + 64\n\t}\n\n\tmask := r.NextByte()\n\tfor i := range out {\n\t\tout[i] ^= mask\n\t}\n\n\treturn out[:]\n}\n\n// Hash password using 4.1+ method (SHA1)\nfunc scramblePassword(scramble []byte, password string) []byte {\n\tif len(password) == 0 {\n\t\treturn nil\n\t}\n\n\t// stage1Hash = SHA1(password)\n\tcrypt := sha1.New()\n\tcrypt.Write([]byte(password))\n\tstage1 := crypt.Sum(nil)\n\n\t// scrambleHash = SHA1(scramble + SHA1(stage1Hash))\n\t// inner Hash\n\tcrypt.Reset()\n\tcrypt.Write(stage1)\n\thash := crypt.Sum(nil)\n\n\t// outer Hash\n\tcrypt.Reset()\n\tcrypt.Write(scramble)\n\tcrypt.Write(hash)\n\tscramble = crypt.Sum(nil)\n\n\t// token = scrambleHash XOR stage1Hash\n\tfor i := range scramble {\n\t\tscramble[i] ^= stage1[i]\n\t}\n\treturn scramble\n}\n\n// Hash password using MySQL 8+ method (SHA256)\nfunc scrambleSHA256Password(scramble []byte, password string) []byte {\n\tif len(password) == 0 {\n\t\treturn nil\n\t}\n\n\t// XOR(SHA256(password), SHA256(SHA256(SHA256(password)), scramble))\n\n\tcrypt := sha256.New()\n\tcrypt.Write([]byte(password))\n\tmessage1 := crypt.Sum(nil)\n\n\tcrypt.Reset()\n\tcrypt.Write(message1)\n\tmessage1Hash := crypt.Sum(nil)\n\n\tcrypt.Reset()\n\tcrypt.Write(message1Hash)\n\tcrypt.Write(scramble)\n\tmessage2 := crypt.Sum(nil)\n\n\tfor i := range message1 {\n\t\tmessage1[i] ^= message2[i]\n\t}\n\n\treturn message1\n}\n\nfunc encryptPassword(password string, seed []byte, pub *rsa.PublicKey) ([]byte, error) {\n\tplain := make([]byte, len(password)+1)\n\tcopy(plain, password)\n\tfor i := range plain {\n\t\tj := i % len(seed)\n\t\tplain[i] ^= seed[j]\n\t}\n\tsha1 := sha1.New()\n\treturn rsa.EncryptOAEP(sha1, rand.Reader, pub, plain, nil)\n}\n\nfunc (mc *mysqlConn) sendEncryptedPassword(seed []byte, pub *rsa.PublicKey) error {\n\tenc, err := encryptPassword(mc.cfg.Passwd, seed, pub)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn mc.writeAuthSwitchPacket(enc)\n}\n\nfunc (mc *mysqlConn) auth(authData []byte, plugin string) ([]byte, error) {\n\tswitch plugin {\n\tcase \"caching_sha2_password\":\n\t\tauthResp := scrambleSHA256Password(authData, mc.cfg.Passwd)\n\t\treturn authResp, nil\n\n\tcase \"mysql_old_password\":\n\t\tif !mc.cfg.AllowOldPasswords {\n\t\t\treturn nil, ErrOldPassword\n\t\t}\n\t\t// Note: there are edge cases where this should work but doesn't;\n\t\t// this is currently \"wontfix\":\n\t\t// https://github.com/go-sql-driver/mysql/issues/184\n\t\tauthResp := append(scrambleOldPassword(authData[:8], mc.cfg.Passwd), 0)\n\t\treturn authResp, nil\n\n\tcase \"mysql_clear_password\":\n\t\tif !mc.cfg.AllowCleartextPasswords {\n\t\t\treturn nil, ErrCleartextPassword\n\t\t}\n\t\t// http://dev.mysql.com/doc/refman/5.7/en/cleartext-authentication-plugin.html\n\t\t// http://dev.mysql.com/doc/refman/5.7/en/pam-authentication-plugin.html\n\t\treturn append([]byte(mc.cfg.Passwd), 0), nil\n\n\tcase \"mysql_native_password\":\n\t\tif !mc.cfg.AllowNativePasswords {\n\t\t\treturn nil, ErrNativePassword\n\t\t}\n\t\t// https://dev.mysql.com/doc/internals/en/secure-password-authentication.html\n\t\t// Native password authentication only need and will need 20-byte challenge.\n\t\tauthResp := scramblePassword(authData[:20], mc.cfg.Passwd)\n\t\treturn authResp, nil\n\n\tcase \"sha256_password\":\n\t\tif len(mc.cfg.Passwd) == 0 {\n\t\t\treturn []byte{0}, nil\n\t\t}\n\t\tif mc.cfg.tls != nil || mc.cfg.Net == \"unix\" {\n\t\t\t// write cleartext auth packet\n\t\t\treturn append([]byte(mc.cfg.Passwd), 0), nil\n\t\t}\n\n\t\tpubKey := mc.cfg.pubKey\n\t\tif pubKey == nil {\n\t\t\t// request public key from server\n\t\t\treturn []byte{1}, nil\n\t\t}\n\n\t\t// encrypted password\n\t\tenc, err := encryptPassword(mc.cfg.Passwd, authData, pubKey)\n\t\treturn enc, err\n\n\tdefault:\n\t\terrLog.Print(\"unknown auth plugin:\", plugin)\n\t\treturn nil, ErrUnknownPlugin\n\t}\n}\n\nfunc (mc *mysqlConn) handleAuthResult(oldAuthData []byte, plugin string) error {\n\t// Read Result Packet\n\tauthData, newPlugin, err := mc.readAuthResult()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// handle auth plugin switch, if requested\n\tif newPlugin != \"\" {\n\t\t// If CLIENT_PLUGIN_AUTH capability is not supported, no new cipher is\n\t\t// sent and we have to keep using the cipher sent in the init packet.\n\t\tif authData == nil {\n\t\t\tauthData = oldAuthData\n\t\t} else {\n\t\t\t// copy data from read buffer to owned slice\n\t\t\tcopy(oldAuthData, authData)\n\t\t}\n\n\t\tplugin = newPlugin\n\n\t\tauthResp, err := mc.auth(authData, plugin)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err = mc.writeAuthSwitchPacket(authResp); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Read Result Packet\n\t\tauthData, newPlugin, err = mc.readAuthResult()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Do not allow to change the auth plugin more than once\n\t\tif newPlugin != \"\" {\n\t\t\treturn ErrMalformPkt\n\t\t}\n\t}\n\n\tswitch plugin {\n\n\t// https://insidemysql.com/preparing-your-community-connector-for-mysql-8-part-2-sha256/\n\tcase \"caching_sha2_password\":\n\t\tswitch len(authData) {\n\t\tcase 0:\n\t\t\treturn nil // auth successful\n\t\tcase 1:\n\t\t\tswitch authData[0] {\n\t\t\tcase cachingSha2PasswordFastAuthSuccess:\n\t\t\t\tif err = mc.readResultOK(); err == nil {\n\t\t\t\t\treturn nil // auth successful\n\t\t\t\t}\n\n\t\t\tcase cachingSha2PasswordPerformFullAuthentication:\n\t\t\t\tif mc.cfg.tls != nil || mc.cfg.Net == \"unix\" {\n\t\t\t\t\t// write cleartext auth packet\n\t\t\t\t\terr = mc.writeAuthSwitchPacket(append([]byte(mc.cfg.Passwd), 0))\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tpubKey := mc.cfg.pubKey\n\t\t\t\t\tif pubKey == nil {\n\t\t\t\t\t\t// request public key from server\n\t\t\t\t\t\tdata, err := mc.buf.takeSmallBuffer(4 + 1)\n\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdata[4] = cachingSha2PasswordRequestPublicKey\n\t\t\t\t\t\tmc.writePacket(data)\n\n\t\t\t\t\t\t// parse public key\n\t\t\t\t\t\tif data, err = mc.readPacket(); err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tblock, _ := pem.Decode(data[1:])\n\t\t\t\t\t\tpkix, err := x509.ParsePKIXPublicKey(block.Bytes)\n\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpubKey = pkix.(*rsa.PublicKey)\n\t\t\t\t\t}\n\n\t\t\t\t\t// send encrypted password\n\t\t\t\t\terr = mc.sendEncryptedPassword(oldAuthData, pubKey)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn mc.readResultOK()\n\n\t\t\tdefault:\n\t\t\t\treturn ErrMalformPkt\n\t\t\t}\n\t\tdefault:\n\t\t\treturn ErrMalformPkt\n\t\t}\n\n\tcase \"sha256_password\":\n\t\tswitch len(authData) {\n\t\tcase 0:\n\t\t\treturn nil // auth successful\n\t\tdefault:\n\t\t\tblock, _ := pem.Decode(authData)\n\t\t\tpub, err := x509.ParsePKIXPublicKey(block.Bytes)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\t// send encrypted password\n\t\t\terr = mc.sendEncryptedPassword(oldAuthData, pub.(*rsa.PublicKey))\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\treturn mc.readResultOK()\n\t\t}\n\n\tdefault:\n\t\treturn nil // auth successful\n\t}\n\n\treturn err\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/buffer.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2013 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"io\"\n\t\"net\"\n\t\"time\"\n)\n\nconst defaultBufSize = 4096\nconst maxCachedBufSize = 256 * 1024\n\n// A buffer which is used for both reading and writing.\n// This is possible since communication on each connection is synchronous.\n// In other words, we can't write and read simultaneously on the same connection.\n// The buffer is similar to bufio.Reader / Writer but zero-copy-ish\n// Also highly optimized for this particular use case.\n// This buffer is backed by two byte slices in a double-buffering scheme\ntype buffer struct {\n\tbuf []byte // buf is a byte buffer who's length and capacity are equal.\n\tnc net.Conn\n\tidx int\n\tlength int\n\ttimeout time.Duration\n\tdbuf [2][]byte // dbuf is an array with the two byte slices that back this buffer\n\tflipcnt uint // flipccnt is the current buffer counter for double-buffering\n}\n\n// newBuffer allocates and returns a new buffer.\nfunc newBuffer(nc net.Conn) buffer {\n\tfg := make([]byte, defaultBufSize)\n\treturn buffer{\n\t\tbuf: fg,\n\t\tnc: nc,\n\t\tdbuf: [2][]byte{fg, nil},\n\t}\n}\n\n// flip replaces the active buffer with the background buffer\n// this is a delayed flip that simply increases the buffer counter;\n// the actual flip will be performed the next time we call `buffer.fill`\nfunc (b *buffer) flip() {\n\tb.flipcnt += 1\n}\n\n// fill reads into the buffer until at least _need_ bytes are in it\nfunc (b *buffer) fill(need int) error {\n\tn := b.length\n\t// fill data into its double-buffering target: if we've called\n\t// flip on this buffer, we'll be copying to the background buffer,\n\t// and then filling it with network data; otherwise we'll just move\n\t// the contents of the current buffer to the front before filling it\n\tdest := b.dbuf[b.flipcnt&1]\n\n\t// grow buffer if necessary to fit the whole packet.\n\tif need > len(dest) {\n\t\t// Round up to the next multiple of the default size\n\t\tdest = make([]byte, ((need/defaultBufSize)+1)*defaultBufSize)\n\n\t\t// if the allocated buffer is not too large, move it to backing storage\n\t\t// to prevent extra allocations on applications that perform large reads\n\t\tif len(dest) <= maxCachedBufSize {\n\t\t\tb.dbuf[b.flipcnt&1] = dest\n\t\t}\n\t}\n\n\t// if we're filling the fg buffer, move the existing data to the start of it.\n\t// if we're filling the bg buffer, copy over the data\n\tif n > 0 {\n\t\tcopy(dest[:n], b.buf[b.idx:])\n\t}\n\n\tb.buf = dest\n\tb.idx = 0\n\n\tfor {\n\t\tif b.timeout > 0 {\n\t\t\tif err := b.nc.SetReadDeadline(time.Now().Add(b.timeout)); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\t\tnn, err := b.nc.Read(b.buf[n:])\n\t\tn += nn\n\n\t\tswitch err {\n\t\tcase nil:\n\t\t\tif n < need {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tb.length = n\n\t\t\treturn nil\n\n\t\tcase io.EOF:\n\t\t\tif n >= need {\n\t\t\t\tb.length = n\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\treturn io.ErrUnexpectedEOF\n\n\t\tdefault:\n\t\t\treturn err\n\t\t}\n\t}\n}\n\n// returns next N bytes from buffer.\n// The returned slice is only guaranteed to be valid until the next read\nfunc (b *buffer) readNext(need int) ([]byte, error) {\n\tif b.length < need {\n\t\t// refill\n\t\tif err := b.fill(need); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\toffset := b.idx\n\tb.idx += need\n\tb.length -= need\n\treturn b.buf[offset:b.idx], nil\n}\n\n// takeBuffer returns a buffer with the requested size.\n// If possible, a slice from the existing buffer is returned.\n// Otherwise a bigger buffer is made.\n// Only one buffer (total) can be used at a time.\nfunc (b *buffer) takeBuffer(length int) ([]byte, error) {\n\tif b.length > 0 {\n\t\treturn nil, ErrBusyBuffer\n\t}\n\n\t// test (cheap) general case first\n\tif length <= cap(b.buf) {\n\t\treturn b.buf[:length], nil\n\t}\n\n\tif length < maxPacketSize {\n\t\tb.buf = make([]byte, length)\n\t\treturn b.buf, nil\n\t}\n\n\t// buffer is larger than we want to store.\n\treturn make([]byte, length), nil\n}\n\n// takeSmallBuffer is shortcut which can be used if length is\n// known to be smaller than defaultBufSize.\n// Only one buffer (total) can be used at a time.\nfunc (b *buffer) takeSmallBuffer(length int) ([]byte, error) {\n\tif b.length > 0 {\n\t\treturn nil, ErrBusyBuffer\n\t}\n\treturn b.buf[:length], nil\n}\n\n// takeCompleteBuffer returns the complete existing buffer.\n// This can be used if the necessary buffer size is unknown.\n// cap and len of the returned buffer will be equal.\n// Only one buffer (total) can be used at a time.\nfunc (b *buffer) takeCompleteBuffer() ([]byte, error) {\n\tif b.length > 0 {\n\t\treturn nil, ErrBusyBuffer\n\t}\n\treturn b.buf, nil\n}\n\n// store stores buf, an updated buffer, if its suitable to do so.\nfunc (b *buffer) store(buf []byte) error {\n\tif b.length > 0 {\n\t\treturn ErrBusyBuffer\n\t} else if cap(buf) <= maxPacketSize && cap(buf) > cap(b.buf) {\n\t\tb.buf = buf[:cap(buf)]\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/collations.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2014 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nconst defaultCollation = \"utf8mb4_general_ci\"\nconst binaryCollation = \"binary\"\n\n// A list of available collations mapped to the internal ID.\n// To update this map use the following MySQL query:\n// SELECT COLLATION_NAME, ID FROM information_schema.COLLATIONS WHERE ID<256 ORDER BY ID\n//\n// Handshake packet have only 1 byte for collation_id. So we can't use collations with ID > 255.\n//\n// ucs2, utf16, and utf32 can't be used for connection charset.\n// https://dev.mysql.com/doc/refman/5.7/en/charset-connection.html#charset-connection-impermissible-client-charset\n// They are commented out to reduce this map.\nvar collations = map[string]byte{\n\t\"big5_chinese_ci\": 1,\n\t\"latin2_czech_cs\": 2,\n\t\"dec8_swedish_ci\": 3,\n\t\"cp850_general_ci\": 4,\n\t\"latin1_german1_ci\": 5,\n\t\"hp8_english_ci\": 6,\n\t\"koi8r_general_ci\": 7,\n\t\"latin1_swedish_ci\": 8,\n\t\"latin2_general_ci\": 9,\n\t\"swe7_swedish_ci\": 10,\n\t\"ascii_general_ci\": 11,\n\t\"ujis_japanese_ci\": 12,\n\t\"sjis_japanese_ci\": 13,\n\t\"cp1251_bulgarian_ci\": 14,\n\t\"latin1_danish_ci\": 15,\n\t\"hebrew_general_ci\": 16,\n\t\"tis620_thai_ci\": 18,\n\t\"euckr_korean_ci\": 19,\n\t\"latin7_estonian_cs\": 20,\n\t\"latin2_hungarian_ci\": 21,\n\t\"koi8u_general_ci\": 22,\n\t\"cp1251_ukrainian_ci\": 23,\n\t\"gb2312_chinese_ci\": 24,\n\t\"greek_general_ci\": 25,\n\t\"cp1250_general_ci\": 26,\n\t\"latin2_croatian_ci\": 27,\n\t\"gbk_chinese_ci\": 28,\n\t\"cp1257_lithuanian_ci\": 29,\n\t\"latin5_turkish_ci\": 30,\n\t\"latin1_german2_ci\": 31,\n\t\"armscii8_general_ci\": 32,\n\t\"utf8_general_ci\": 33,\n\t\"cp1250_czech_cs\": 34,\n\t//\"ucs2_general_ci\": 35,\n\t\"cp866_general_ci\": 36,\n\t\"keybcs2_general_ci\": 37,\n\t\"macce_general_ci\": 38,\n\t\"macroman_general_ci\": 39,\n\t\"cp852_general_ci\": 40,\n\t\"latin7_general_ci\": 41,\n\t\"latin7_general_cs\": 42,\n\t\"macce_bin\": 43,\n\t\"cp1250_croatian_ci\": 44,\n\t\"utf8mb4_general_ci\": 45,\n\t\"utf8mb4_bin\": 46,\n\t\"latin1_bin\": 47,\n\t\"latin1_general_ci\": 48,\n\t\"latin1_general_cs\": 49,\n\t\"cp1251_bin\": 50,\n\t\"cp1251_general_ci\": 51,\n\t\"cp1251_general_cs\": 52,\n\t\"macroman_bin\": 53,\n\t//\"utf16_general_ci\": 54,\n\t//\"utf16_bin\": 55,\n\t//\"utf16le_general_ci\": 56,\n\t\"cp1256_general_ci\": 57,\n\t\"cp1257_bin\": 58,\n\t\"cp1257_general_ci\": 59,\n\t//\"utf32_general_ci\": 60,\n\t//\"utf32_bin\": 61,\n\t//\"utf16le_bin\": 62,\n\t\"binary\": 63,\n\t\"armscii8_bin\": 64,\n\t\"ascii_bin\": 65,\n\t\"cp1250_bin\": 66,\n\t\"cp1256_bin\": 67,\n\t\"cp866_bin\": 68,\n\t\"dec8_bin\": 69,\n\t\"greek_bin\": 70,\n\t\"hebrew_bin\": 71,\n\t\"hp8_bin\": 72,\n\t\"keybcs2_bin\": 73,\n\t\"koi8r_bin\": 74,\n\t\"koi8u_bin\": 75,\n\t\"utf8_tolower_ci\": 76,\n\t\"latin2_bin\": 77,\n\t\"latin5_bin\": 78,\n\t\"latin7_bin\": 79,\n\t\"cp850_bin\": 80,\n\t\"cp852_bin\": 81,\n\t\"swe7_bin\": 82,\n\t\"utf8_bin\": 83,\n\t\"big5_bin\": 84,\n\t\"euckr_bin\": 85,\n\t\"gb2312_bin\": 86,\n\t\"gbk_bin\": 87,\n\t\"sjis_bin\": 88,\n\t\"tis620_bin\": 89,\n\t//\"ucs2_bin\": 90,\n\t\"ujis_bin\": 91,\n\t\"geostd8_general_ci\": 92,\n\t\"geostd8_bin\": 93,\n\t\"latin1_spanish_ci\": 94,\n\t\"cp932_japanese_ci\": 95,\n\t\"cp932_bin\": 96,\n\t\"eucjpms_japanese_ci\": 97,\n\t\"eucjpms_bin\": 98,\n\t\"cp1250_polish_ci\": 99,\n\t//\"utf16_unicode_ci\": 101,\n\t//\"utf16_icelandic_ci\": 102,\n\t//\"utf16_latvian_ci\": 103,\n\t//\"utf16_romanian_ci\": 104,\n\t//\"utf16_slovenian_ci\": 105,\n\t//\"utf16_polish_ci\": 106,\n\t//\"utf16_estonian_ci\": 107,\n\t//\"utf16_spanish_ci\": 108,\n\t//\"utf16_swedish_ci\": 109,\n\t//\"utf16_turkish_ci\": 110,\n\t//\"utf16_czech_ci\": 111,\n\t//\"utf16_danish_ci\": 112,\n\t//\"utf16_lithuanian_ci\": 113,\n\t//\"utf16_slovak_ci\": 114,\n\t//\"utf16_spanish2_ci\": 115,\n\t//\"utf16_roman_ci\": 116,\n\t//\"utf16_persian_ci\": 117,\n\t//\"utf16_esperanto_ci\": 118,\n\t//\"utf16_hungarian_ci\": 119,\n\t//\"utf16_sinhala_ci\": 120,\n\t//\"utf16_german2_ci\": 121,\n\t//\"utf16_croatian_ci\": 122,\n\t//\"utf16_unicode_520_ci\": 123,\n\t//\"utf16_vietnamese_ci\": 124,\n\t//\"ucs2_unicode_ci\": 128,\n\t//\"ucs2_icelandic_ci\": 129,\n\t//\"ucs2_latvian_ci\": 130,\n\t//\"ucs2_romanian_ci\": 131,\n\t//\"ucs2_slovenian_ci\": 132,\n\t//\"ucs2_polish_ci\": 133,\n\t//\"ucs2_estonian_ci\": 134,\n\t//\"ucs2_spanish_ci\": 135,\n\t//\"ucs2_swedish_ci\": 136,\n\t//\"ucs2_turkish_ci\": 137,\n\t//\"ucs2_czech_ci\": 138,\n\t//\"ucs2_danish_ci\": 139,\n\t//\"ucs2_lithuanian_ci\": 140,\n\t//\"ucs2_slovak_ci\": 141,\n\t//\"ucs2_spanish2_ci\": 142,\n\t//\"ucs2_roman_ci\": 143,\n\t//\"ucs2_persian_ci\": 144,\n\t//\"ucs2_esperanto_ci\": 145,\n\t//\"ucs2_hungarian_ci\": 146,\n\t//\"ucs2_sinhala_ci\": 147,\n\t//\"ucs2_german2_ci\": 148,\n\t//\"ucs2_croatian_ci\": 149,\n\t//\"ucs2_unicode_520_ci\": 150,\n\t//\"ucs2_vietnamese_ci\": 151,\n\t//\"ucs2_general_mysql500_ci\": 159,\n\t//\"utf32_unicode_ci\": 160,\n\t//\"utf32_icelandic_ci\": 161,\n\t//\"utf32_latvian_ci\": 162,\n\t//\"utf32_romanian_ci\": 163,\n\t//\"utf32_slovenian_ci\": 164,\n\t//\"utf32_polish_ci\": 165,\n\t//\"utf32_estonian_ci\": 166,\n\t//\"utf32_spanish_ci\": 167,\n\t//\"utf32_swedish_ci\": 168,\n\t//\"utf32_turkish_ci\": 169,\n\t//\"utf32_czech_ci\": 170,\n\t//\"utf32_danish_ci\": 171,\n\t//\"utf32_lithuanian_ci\": 172,\n\t//\"utf32_slovak_ci\": 173,\n\t//\"utf32_spanish2_ci\": 174,\n\t//\"utf32_roman_ci\": 175,\n\t//\"utf32_persian_ci\": 176,\n\t//\"utf32_esperanto_ci\": 177,\n\t//\"utf32_hungarian_ci\": 178,\n\t//\"utf32_sinhala_ci\": 179,\n\t//\"utf32_german2_ci\": 180,\n\t//\"utf32_croatian_ci\": 181,\n\t//\"utf32_unicode_520_ci\": 182,\n\t//\"utf32_vietnamese_ci\": 183,\n\t\"utf8_unicode_ci\": 192,\n\t\"utf8_icelandic_ci\": 193,\n\t\"utf8_latvian_ci\": 194,\n\t\"utf8_romanian_ci\": 195,\n\t\"utf8_slovenian_ci\": 196,\n\t\"utf8_polish_ci\": 197,\n\t\"utf8_estonian_ci\": 198,\n\t\"utf8_spanish_ci\": 199,\n\t\"utf8_swedish_ci\": 200,\n\t\"utf8_turkish_ci\": 201,\n\t\"utf8_czech_ci\": 202,\n\t\"utf8_danish_ci\": 203,\n\t\"utf8_lithuanian_ci\": 204,\n\t\"utf8_slovak_ci\": 205,\n\t\"utf8_spanish2_ci\": 206,\n\t\"utf8_roman_ci\": 207,\n\t\"utf8_persian_ci\": 208,\n\t\"utf8_esperanto_ci\": 209,\n\t\"utf8_hungarian_ci\": 210,\n\t\"utf8_sinhala_ci\": 211,\n\t\"utf8_german2_ci\": 212,\n\t\"utf8_croatian_ci\": 213,\n\t\"utf8_unicode_520_ci\": 214,\n\t\"utf8_vietnamese_ci\": 215,\n\t\"utf8_general_mysql500_ci\": 223,\n\t\"utf8mb4_unicode_ci\": 224,\n\t\"utf8mb4_icelandic_ci\": 225,\n\t\"utf8mb4_latvian_ci\": 226,\n\t\"utf8mb4_romanian_ci\": 227,\n\t\"utf8mb4_slovenian_ci\": 228,\n\t\"utf8mb4_polish_ci\": 229,\n\t\"utf8mb4_estonian_ci\": 230,\n\t\"utf8mb4_spanish_ci\": 231,\n\t\"utf8mb4_swedish_ci\": 232,\n\t\"utf8mb4_turkish_ci\": 233,\n\t\"utf8mb4_czech_ci\": 234,\n\t\"utf8mb4_danish_ci\": 235,\n\t\"utf8mb4_lithuanian_ci\": 236,\n\t\"utf8mb4_slovak_ci\": 237,\n\t\"utf8mb4_spanish2_ci\": 238,\n\t\"utf8mb4_roman_ci\": 239,\n\t\"utf8mb4_persian_ci\": 240,\n\t\"utf8mb4_esperanto_ci\": 241,\n\t\"utf8mb4_hungarian_ci\": 242,\n\t\"utf8mb4_sinhala_ci\": 243,\n\t\"utf8mb4_german2_ci\": 244,\n\t\"utf8mb4_croatian_ci\": 245,\n\t\"utf8mb4_unicode_520_ci\": 246,\n\t\"utf8mb4_vietnamese_ci\": 247,\n\t\"gb18030_chinese_ci\": 248,\n\t\"gb18030_bin\": 249,\n\t\"gb18030_unicode_520_ci\": 250,\n\t\"utf8mb4_0900_ai_ci\": 255,\n}\n\n// A blacklist of collations which is unsafe to interpolate parameters.\n// These multibyte encodings may contains 0x5c (`\\`) in their trailing bytes.\nvar unsafeCollations = map[string]bool{\n\t\"big5_chinese_ci\": true,\n\t\"sjis_japanese_ci\": true,\n\t\"gbk_chinese_ci\": true,\n\t\"big5_bin\": true,\n\t\"gb2312_bin\": true,\n\t\"gbk_bin\": true,\n\t\"sjis_bin\": true,\n\t\"cp932_japanese_ci\": true,\n\t\"cp932_bin\": true,\n\t\"gb18030_chinese_ci\": true,\n\t\"gb18030_bin\": true,\n\t\"gb18030_unicode_520_ci\": true,\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/conncheck.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2019 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\n// +build !windows,!appengine\n\npackage mysql\n\nimport (\n\t\"errors\"\n\t\"io\"\n\t\"net\"\n\t\"syscall\"\n)\n\nvar errUnexpectedRead = errors.New(\"unexpected read from socket\")\n\nfunc connCheck(c net.Conn) error {\n\tvar (\n\t\tn int\n\t\terr error\n\t\tbuff [1]byte\n\t)\n\n\tsconn, ok := c.(syscall.Conn)\n\tif !ok {\n\t\treturn nil\n\t}\n\trc, err := sconn.SyscallConn()\n\tif err != nil {\n\t\treturn err\n\t}\n\trerr := rc.Read(func(fd uintptr) bool {\n\t\tn, err = syscall.Read(int(fd), buff[:])\n\t\treturn true\n\t})\n\tswitch {\n\tcase rerr != nil:\n\t\treturn rerr\n\tcase n == 0 && err == nil:\n\t\treturn io.EOF\n\tcase n > 0:\n\t\treturn errUnexpectedRead\n\tcase err == syscall.EAGAIN || err == syscall.EWOULDBLOCK:\n\t\treturn nil\n\tdefault:\n\t\treturn err\n\t}\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/conncheck_dummy.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2019 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\n// +build windows appengine\n\npackage mysql\n\nimport \"net\"\n\nfunc connCheck(c net.Conn) error {\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/connection.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"context\"\n\t\"database/sql\"\n\t\"database/sql/driver\"\n\t\"io\"\n\t\"net\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\ntype mysqlConn struct {\n\tbuf buffer\n\tnetConn net.Conn\n\trawConn net.Conn // underlying connection when netConn is TLS connection.\n\taffectedRows uint64\n\tinsertId uint64\n\tcfg *Config\n\tmaxAllowedPacket int\n\tmaxWriteSize int\n\twriteTimeout time.Duration\n\tflags clientFlag\n\tstatus statusFlag\n\tsequence uint8\n\tparseTime bool\n\treset bool // set when the Go SQL package calls ResetSession\n\n\t// for context support (Go 1.8+)\n\twatching bool\n\twatcher chan<- context.Context\n\tclosech chan struct{}\n\tfinished chan<- struct{}\n\tcanceled atomicError // set non-nil if conn is canceled\n\tclosed atomicBool // set when conn is closed, before closech is closed\n}\n\n// Handles parameters set in DSN after the connection is established\nfunc (mc *mysqlConn) handleParams() (err error) {\n\tfor param, val := range mc.cfg.Params {\n\t\tswitch param {\n\t\t// Charset\n\t\tcase \"charset\":\n\t\t\tcharsets := strings.Split(val, \",\")\n\t\t\tfor i := range charsets {\n\t\t\t\t// ignore errors here - a charset may not exist\n\t\t\t\terr = mc.exec(\"SET NAMES \" + charsets[i])\n\t\t\t\tif err == nil {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t// System Vars\n\t\tdefault:\n\t\t\terr = mc.exec(\"SET \" + param + \"=\" + val + \"\")\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\treturn\n}\n\nfunc (mc *mysqlConn) markBadConn(err error) error {\n\tif mc == nil {\n\t\treturn err\n\t}\n\tif err != errBadConnNoWrite {\n\t\treturn err\n\t}\n\treturn driver.ErrBadConn\n}\n\nfunc (mc *mysqlConn) Begin() (driver.Tx, error) {\n\treturn mc.begin(false)\n}\n\nfunc (mc *mysqlConn) begin(readOnly bool) (driver.Tx, error) {\n\tif mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\tvar q string\n\tif readOnly {\n\t\tq = \"START TRANSACTION READ ONLY\"\n\t} else {\n\t\tq = \"START TRANSACTION\"\n\t}\n\terr := mc.exec(q)\n\tif err == nil {\n\t\treturn &mysqlTx{mc}, err\n\t}\n\treturn nil, mc.markBadConn(err)\n}\n\nfunc (mc *mysqlConn) Close() (err error) {\n\t// Makes Close idempotent\n\tif !mc.closed.IsSet() {\n\t\terr = mc.writeCommandPacket(comQuit)\n\t}\n\n\tmc.cleanup()\n\n\treturn\n}\n\n// Closes the network connection and unsets internal variables. Do not call this\n// function after successfully authentication, call Close instead. This function\n// is called before auth or on auth failure because MySQL will have already\n// closed the network connection.\nfunc (mc *mysqlConn) cleanup() {\n\tif !mc.closed.TrySet(true) {\n\t\treturn\n\t}\n\n\t// Makes cleanup idempotent\n\tclose(mc.closech)\n\tif mc.netConn == nil {\n\t\treturn\n\t}\n\tif err := mc.netConn.Close(); err != nil {\n\t\terrLog.Print(err)\n\t}\n}\n\nfunc (mc *mysqlConn) error() error {\n\tif mc.closed.IsSet() {\n\t\tif err := mc.canceled.Value(); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn ErrInvalidConn\n\t}\n\treturn nil\n}\n\nfunc (mc *mysqlConn) Prepare(query string) (driver.Stmt, error) {\n\tif mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\t// Send command\n\terr := mc.writeCommandPacketStr(comStmtPrepare, query)\n\tif err != nil {\n\t\treturn nil, mc.markBadConn(err)\n\t}\n\n\tstmt := &mysqlStmt{\n\t\tmc: mc,\n\t}\n\n\t// Read Result\n\tcolumnCount, err := stmt.readPrepareResultPacket()\n\tif err == nil {\n\t\tif stmt.paramCount > 0 {\n\t\t\tif err = mc.readUntilEOF(); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\n\t\tif columnCount > 0 {\n\t\t\terr = mc.readUntilEOF()\n\t\t}\n\t}\n\n\treturn stmt, err\n}\n\nfunc (mc *mysqlConn) interpolateParams(query string, args []driver.Value) (string, error) {\n\t// Number of ? should be same to len(args)\n\tif strings.Count(query, \"?\") != len(args) {\n\t\treturn \"\", driver.ErrSkip\n\t}\n\n\tbuf, err := mc.buf.takeCompleteBuffer()\n\tif err != nil {\n\t\t// can not take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn \"\", ErrInvalidConn\n\t}\n\tbuf = buf[:0]\n\targPos := 0\n\n\tfor i := 0; i < len(query); i++ {\n\t\tq := strings.IndexByte(query[i:], '?')\n\t\tif q == -1 {\n\t\t\tbuf = append(buf, query[i:]...)\n\t\t\tbreak\n\t\t}\n\t\tbuf = append(buf, query[i:i+q]...)\n\t\ti += q\n\n\t\targ := args[argPos]\n\t\targPos++\n\n\t\tif arg == nil {\n\t\t\tbuf = append(buf, \"NULL\"...)\n\t\t\tcontinue\n\t\t}\n\n\t\tswitch v := arg.(type) {\n\t\tcase int64:\n\t\t\tbuf = strconv.AppendInt(buf, v, 10)\n\t\tcase uint64:\n\t\t\t// Handle uint64 explicitly because our custom ConvertValue emits unsigned values\n\t\t\tbuf = strconv.AppendUint(buf, v, 10)\n\t\tcase float64:\n\t\t\tbuf = strconv.AppendFloat(buf, v, 'g', -1, 64)\n\t\tcase bool:\n\t\t\tif v {\n\t\t\t\tbuf = append(buf, '1')\n\t\t\t} else {\n\t\t\t\tbuf = append(buf, '0')\n\t\t\t}\n\t\tcase time.Time:\n\t\t\tif v.IsZero() {\n\t\t\t\tbuf = append(buf, \"'0000-00-00'\"...)\n\t\t\t} else {\n\t\t\t\tv := v.In(mc.cfg.Loc)\n\t\t\t\tv = v.Add(time.Nanosecond * 500) // To round under microsecond\n\t\t\t\tyear := v.Year()\n\t\t\t\tyear100 := year / 100\n\t\t\t\tyear1 := year % 100\n\t\t\t\tmonth := v.Month()\n\t\t\t\tday := v.Day()\n\t\t\t\thour := v.Hour()\n\t\t\t\tminute := v.Minute()\n\t\t\t\tsecond := v.Second()\n\t\t\t\tmicro := v.Nanosecond() / 1000\n\n\t\t\t\tbuf = append(buf, []byte{\n\t\t\t\t\t'\\'',\n\t\t\t\t\tdigits10[year100], digits01[year100],\n\t\t\t\t\tdigits10[year1], digits01[year1],\n\t\t\t\t\t'-',\n\t\t\t\t\tdigits10[month], digits01[month],\n\t\t\t\t\t'-',\n\t\t\t\t\tdigits10[day], digits01[day],\n\t\t\t\t\t' ',\n\t\t\t\t\tdigits10[hour], digits01[hour],\n\t\t\t\t\t':',\n\t\t\t\t\tdigits10[minute], digits01[minute],\n\t\t\t\t\t':',\n\t\t\t\t\tdigits10[second], digits01[second],\n\t\t\t\t}...)\n\n\t\t\t\tif micro != 0 {\n\t\t\t\t\tmicro10000 := micro / 10000\n\t\t\t\t\tmicro100 := micro / 100 % 100\n\t\t\t\t\tmicro1 := micro % 100\n\t\t\t\t\tbuf = append(buf, []byte{\n\t\t\t\t\t\t'.',\n\t\t\t\t\t\tdigits10[micro10000], digits01[micro10000],\n\t\t\t\t\t\tdigits10[micro100], digits01[micro100],\n\t\t\t\t\t\tdigits10[micro1], digits01[micro1],\n\t\t\t\t\t}...)\n\t\t\t\t}\n\t\t\t\tbuf = append(buf, '\\'')\n\t\t\t}\n\t\tcase []byte:\n\t\t\tif v == nil {\n\t\t\t\tbuf = append(buf, \"NULL\"...)\n\t\t\t} else {\n\t\t\t\tbuf = append(buf, \"_binary'\"...)\n\t\t\t\tif mc.status&statusNoBackslashEscapes == 0 {\n\t\t\t\t\tbuf = escapeBytesBackslash(buf, v)\n\t\t\t\t} else {\n\t\t\t\t\tbuf = escapeBytesQuotes(buf, v)\n\t\t\t\t}\n\t\t\t\tbuf = append(buf, '\\'')\n\t\t\t}\n\t\tcase string:\n\t\t\tbuf = append(buf, '\\'')\n\t\t\tif mc.status&statusNoBackslashEscapes == 0 {\n\t\t\t\tbuf = escapeStringBackslash(buf, v)\n\t\t\t} else {\n\t\t\t\tbuf = escapeStringQuotes(buf, v)\n\t\t\t}\n\t\t\tbuf = append(buf, '\\'')\n\t\tdefault:\n\t\t\treturn \"\", driver.ErrSkip\n\t\t}\n\n\t\tif len(buf)+4 > mc.maxAllowedPacket {\n\t\t\treturn \"\", driver.ErrSkip\n\t\t}\n\t}\n\tif argPos != len(args) {\n\t\treturn \"\", driver.ErrSkip\n\t}\n\treturn string(buf), nil\n}\n\nfunc (mc *mysqlConn) Exec(query string, args []driver.Value) (driver.Result, error) {\n\tif mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\tif len(args) != 0 {\n\t\tif !mc.cfg.InterpolateParams {\n\t\t\treturn nil, driver.ErrSkip\n\t\t}\n\t\t// try to interpolate the parameters to save extra roundtrips for preparing and closing a statement\n\t\tprepared, err := mc.interpolateParams(query, args)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tquery = prepared\n\t}\n\tmc.affectedRows = 0\n\tmc.insertId = 0\n\n\terr := mc.exec(query)\n\tif err == nil {\n\t\treturn &mysqlResult{\n\t\t\taffectedRows: int64(mc.affectedRows),\n\t\t\tinsertId: int64(mc.insertId),\n\t\t}, err\n\t}\n\treturn nil, mc.markBadConn(err)\n}\n\n// Internal function to execute commands\nfunc (mc *mysqlConn) exec(query string) error {\n\t// Send command\n\tif err := mc.writeCommandPacketStr(comQuery, query); err != nil {\n\t\treturn mc.markBadConn(err)\n\t}\n\n\t// Read Result\n\tresLen, err := mc.readResultSetHeaderPacket()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif resLen > 0 {\n\t\t// columns\n\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// rows\n\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn mc.discardResults()\n}\n\nfunc (mc *mysqlConn) Query(query string, args []driver.Value) (driver.Rows, error) {\n\treturn mc.query(query, args)\n}\n\nfunc (mc *mysqlConn) query(query string, args []driver.Value) (*textRows, error) {\n\tif mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\tif len(args) != 0 {\n\t\tif !mc.cfg.InterpolateParams {\n\t\t\treturn nil, driver.ErrSkip\n\t\t}\n\t\t// try client-side prepare to reduce roundtrip\n\t\tprepared, err := mc.interpolateParams(query, args)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tquery = prepared\n\t}\n\t// Send command\n\terr := mc.writeCommandPacketStr(comQuery, query)\n\tif err == nil {\n\t\t// Read Result\n\t\tvar resLen int\n\t\tresLen, err = mc.readResultSetHeaderPacket()\n\t\tif err == nil {\n\t\t\trows := new(textRows)\n\t\t\trows.mc = mc\n\n\t\t\tif resLen == 0 {\n\t\t\t\trows.rs.done = true\n\n\t\t\t\tswitch err := rows.NextResultSet(); err {\n\t\t\t\tcase nil, io.EOF:\n\t\t\t\t\treturn rows, nil\n\t\t\t\tdefault:\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Columns\n\t\t\trows.rs.columns, err = mc.readColumns(resLen)\n\t\t\treturn rows, err\n\t\t}\n\t}\n\treturn nil, mc.markBadConn(err)\n}\n\n// Gets the value of the given MySQL System Variable\n// The returned byte slice is only valid until the next read\nfunc (mc *mysqlConn) getSystemVar(name string) ([]byte, error) {\n\t// Send command\n\tif err := mc.writeCommandPacketStr(comQuery, \"SELECT @@\"+name); err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Read Result\n\tresLen, err := mc.readResultSetHeaderPacket()\n\tif err == nil {\n\t\trows := new(textRows)\n\t\trows.mc = mc\n\t\trows.rs.columns = []mysqlField{{fieldType: fieldTypeVarChar}}\n\n\t\tif resLen > 0 {\n\t\t\t// Columns\n\t\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\n\t\tdest := make([]driver.Value, resLen)\n\t\tif err = rows.readRow(dest); err == nil {\n\t\t\treturn dest[0].([]byte), mc.readUntilEOF()\n\t\t}\n\t}\n\treturn nil, err\n}\n\n// finish is called when the query has canceled.\nfunc (mc *mysqlConn) cancel(err error) {\n\tmc.canceled.Set(err)\n\tmc.cleanup()\n}\n\n// finish is called when the query has succeeded.\nfunc (mc *mysqlConn) finish() {\n\tif !mc.watching || mc.finished == nil {\n\t\treturn\n\t}\n\tselect {\n\tcase mc.finished <- struct{}{}:\n\t\tmc.watching = false\n\tcase <-mc.closech:\n\t}\n}\n\n// Ping implements driver.Pinger interface\nfunc (mc *mysqlConn) Ping(ctx context.Context) (err error) {\n\tif mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn driver.ErrBadConn\n\t}\n\n\tif err = mc.watchCancel(ctx); err != nil {\n\t\treturn\n\t}\n\tdefer mc.finish()\n\n\tif err = mc.writeCommandPacket(comPing); err != nil {\n\t\treturn mc.markBadConn(err)\n\t}\n\n\treturn mc.readResultOK()\n}\n\n// BeginTx implements driver.ConnBeginTx interface\nfunc (mc *mysqlConn) BeginTx(ctx context.Context, opts driver.TxOptions) (driver.Tx, error) {\n\tif err := mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\tdefer mc.finish()\n\n\tif sql.IsolationLevel(opts.Isolation) != sql.LevelDefault {\n\t\tlevel, err := mapIsolationLevel(opts.Isolation)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\terr = mc.exec(\"SET TRANSACTION ISOLATION LEVEL \" + level)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn mc.begin(opts.ReadOnly)\n}\n\nfunc (mc *mysqlConn) QueryContext(ctx context.Context, query string, args []driver.NamedValue) (driver.Rows, error) {\n\tdargs, err := namedValueToValue(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif err := mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\n\trows, err := mc.query(query, dargs)\n\tif err != nil {\n\t\tmc.finish()\n\t\treturn nil, err\n\t}\n\trows.finish = mc.finish\n\treturn rows, err\n}\n\nfunc (mc *mysqlConn) ExecContext(ctx context.Context, query string, args []driver.NamedValue) (driver.Result, error) {\n\tdargs, err := namedValueToValue(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif err := mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\tdefer mc.finish()\n\n\treturn mc.Exec(query, dargs)\n}\n\nfunc (mc *mysqlConn) PrepareContext(ctx context.Context, query string) (driver.Stmt, error) {\n\tif err := mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\n\tstmt, err := mc.Prepare(query)\n\tmc.finish()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tselect {\n\tdefault:\n\tcase <-ctx.Done():\n\t\tstmt.Close()\n\t\treturn nil, ctx.Err()\n\t}\n\treturn stmt, nil\n}\n\nfunc (stmt *mysqlStmt) QueryContext(ctx context.Context, args []driver.NamedValue) (driver.Rows, error) {\n\tdargs, err := namedValueToValue(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif err := stmt.mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\n\trows, err := stmt.query(dargs)\n\tif err != nil {\n\t\tstmt.mc.finish()\n\t\treturn nil, err\n\t}\n\trows.finish = stmt.mc.finish\n\treturn rows, err\n}\n\nfunc (stmt *mysqlStmt) ExecContext(ctx context.Context, args []driver.NamedValue) (driver.Result, error) {\n\tdargs, err := namedValueToValue(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif err := stmt.mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\tdefer stmt.mc.finish()\n\n\treturn stmt.Exec(dargs)\n}\n\nfunc (mc *mysqlConn) watchCancel(ctx context.Context) error {\n\tif mc.watching {\n\t\t// Reach here if canceled,\n\t\t// so the connection is already invalid\n\t\tmc.cleanup()\n\t\treturn nil\n\t}\n\t// When ctx is already cancelled, don't watch it.\n\tif err := ctx.Err(); err != nil {\n\t\treturn err\n\t}\n\t// When ctx is not cancellable, don't watch it.\n\tif ctx.Done() == nil {\n\t\treturn nil\n\t}\n\t// When watcher is not alive, can't watch it.\n\tif mc.watcher == nil {\n\t\treturn nil\n\t}\n\n\tmc.watching = true\n\tmc.watcher <- ctx\n\treturn nil\n}\n\nfunc (mc *mysqlConn) startWatcher() {\n\twatcher := make(chan context.Context, 1)\n\tmc.watcher = watcher\n\tfinished := make(chan struct{})\n\tmc.finished = finished\n\tgo func() {\n\t\tfor {\n\t\t\tvar ctx context.Context\n\t\t\tselect {\n\t\t\tcase ctx = <-watcher:\n\t\t\tcase <-mc.closech:\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tselect {\n\t\t\tcase <-ctx.Done():\n\t\t\t\tmc.cancel(ctx.Err())\n\t\t\tcase <-finished:\n\t\t\tcase <-mc.closech:\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}()\n}\n\nfunc (mc *mysqlConn) CheckNamedValue(nv *driver.NamedValue) (err error) {\n\tnv.Value, err = converter{}.ConvertValue(nv.Value)\n\treturn\n}\n\n// ResetSession implements driver.SessionResetter.\n// (From Go 1.10)\nfunc (mc *mysqlConn) ResetSession(ctx context.Context) error {\n\tif mc.closed.IsSet() {\n\t\treturn driver.ErrBadConn\n\t}\n\tmc.reset = true\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/connector.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2018 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"context\"\n\t\"database/sql/driver\"\n\t\"net\"\n)\n\ntype connector struct {\n\tcfg *Config // immutable private copy.\n}\n\n// Connect implements driver.Connector interface.\n// Connect returns a connection to the database.\nfunc (c *connector) Connect(ctx context.Context) (driver.Conn, error) {\n\tvar err error\n\n\t// New mysqlConn\n\tmc := &mysqlConn{\n\t\tmaxAllowedPacket: maxPacketSize,\n\t\tmaxWriteSize: maxPacketSize - 1,\n\t\tclosech: make(chan struct{}),\n\t\tcfg: c.cfg,\n\t}\n\tmc.parseTime = mc.cfg.ParseTime\n\n\t// Connect to Server\n\tdialsLock.RLock()\n\tdial, ok := dials[mc.cfg.Net]\n\tdialsLock.RUnlock()\n\tif ok {\n\t\tmc.netConn, err = dial(ctx, mc.cfg.Addr)\n\t} else {\n\t\tnd := net.Dialer{Timeout: mc.cfg.Timeout}\n\t\tmc.netConn, err = nd.DialContext(ctx, mc.cfg.Net, mc.cfg.Addr)\n\t}\n\n\tif err != nil {\n\t\tif nerr, ok := err.(net.Error); ok && nerr.Temporary() {\n\t\t\terrLog.Print(\"net.Error from Dial()': \", nerr.Error())\n\t\t\treturn nil, driver.ErrBadConn\n\t\t}\n\t\treturn nil, err\n\t}\n\n\t// Enable TCP Keepalives on TCP connections\n\tif tc, ok := mc.netConn.(*net.TCPConn); ok {\n\t\tif err := tc.SetKeepAlive(true); err != nil {\n\t\t\t// Don't send COM_QUIT before handshake.\n\t\t\tmc.netConn.Close()\n\t\t\tmc.netConn = nil\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\t// Call startWatcher for context support (From Go 1.8)\n\tmc.startWatcher()\n\tif err := mc.watchCancel(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\tdefer mc.finish()\n\n\tmc.buf = newBuffer(mc.netConn)\n\n\t// Set I/O timeouts\n\tmc.buf.timeout = mc.cfg.ReadTimeout\n\tmc.writeTimeout = mc.cfg.WriteTimeout\n\n\t// Reading Handshake Initialization Packet\n\tauthData, plugin, err := mc.readHandshakePacket()\n\tif err != nil {\n\t\tmc.cleanup()\n\t\treturn nil, err\n\t}\n\n\tif plugin == \"\" {\n\t\tplugin = defaultAuthPlugin\n\t}\n\n\t// Send Client Authentication Packet\n\tauthResp, err := mc.auth(authData, plugin)\n\tif err != nil {\n\t\t// try the default auth plugin, if using the requested plugin failed\n\t\terrLog.Print(\"could not use requested auth plugin '\"+plugin+\"': \", err.Error())\n\t\tplugin = defaultAuthPlugin\n\t\tauthResp, err = mc.auth(authData, plugin)\n\t\tif err != nil {\n\t\t\tmc.cleanup()\n\t\t\treturn nil, err\n\t\t}\n\t}\n\tif err = mc.writeHandshakeResponsePacket(authResp, plugin); err != nil {\n\t\tmc.cleanup()\n\t\treturn nil, err\n\t}\n\n\t// Handle response to auth packet, switch methods if possible\n\tif err = mc.handleAuthResult(authData, plugin); err != nil {\n\t\t// Authentication failed and MySQL has already closed the connection\n\t\t// (https://dev.mysql.com/doc/internals/en/authentication-fails.html).\n\t\t// Do not send COM_QUIT, just cleanup and return the error.\n\t\tmc.cleanup()\n\t\treturn nil, err\n\t}\n\n\tif mc.cfg.MaxAllowedPacket > 0 {\n\t\tmc.maxAllowedPacket = mc.cfg.MaxAllowedPacket\n\t} else {\n\t\t// Get max allowed packet size\n\t\tmaxap, err := mc.getSystemVar(\"max_allowed_packet\")\n\t\tif err != nil {\n\t\t\tmc.Close()\n\t\t\treturn nil, err\n\t\t}\n\t\tmc.maxAllowedPacket = stringToInt(maxap) - 1\n\t}\n\tif mc.maxAllowedPacket < maxPacketSize {\n\t\tmc.maxWriteSize = mc.maxAllowedPacket\n\t}\n\n\t// Handle DSN Params\n\terr = mc.handleParams()\n\tif err != nil {\n\t\tmc.Close()\n\t\treturn nil, err\n\t}\n\n\treturn mc, nil\n}\n\n// Driver implements driver.Connector interface.\n// Driver returns &MySQLDriver{}.\nfunc (c *connector) Driver() driver.Driver {\n\treturn &MySQLDriver{}\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/const.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nconst (\n\tdefaultAuthPlugin = \"mysql_native_password\"\n\tdefaultMaxAllowedPacket = 4 << 20 // 4 MiB\n\tminProtocolVersion = 10\n\tmaxPacketSize = 1<<24 - 1\n\ttimeFormat = \"2006-01-02 15:04:05.999999\"\n)\n\n// MySQL constants documentation:\n// http://dev.mysql.com/doc/internals/en/client-server-protocol.html\n\nconst (\n\tiOK byte = 0x00\n\tiAuthMoreData byte = 0x01\n\tiLocalInFile byte = 0xfb\n\tiEOF byte = 0xfe\n\tiERR byte = 0xff\n)\n\n// https://dev.mysql.com/doc/internals/en/capability-flags.html#packet-Protocol::CapabilityFlags\ntype clientFlag uint32\n\nconst (\n\tclientLongPassword clientFlag = 1 << iota\n\tclientFoundRows\n\tclientLongFlag\n\tclientConnectWithDB\n\tclientNoSchema\n\tclientCompress\n\tclientODBC\n\tclientLocalFiles\n\tclientIgnoreSpace\n\tclientProtocol41\n\tclientInteractive\n\tclientSSL\n\tclientIgnoreSIGPIPE\n\tclientTransactions\n\tclientReserved\n\tclientSecureConn\n\tclientMultiStatements\n\tclientMultiResults\n\tclientPSMultiResults\n\tclientPluginAuth\n\tclientConnectAttrs\n\tclientPluginAuthLenEncClientData\n\tclientCanHandleExpiredPasswords\n\tclientSessionTrack\n\tclientDeprecateEOF\n)\n\nconst (\n\tcomQuit byte = iota + 1\n\tcomInitDB\n\tcomQuery\n\tcomFieldList\n\tcomCreateDB\n\tcomDropDB\n\tcomRefresh\n\tcomShutdown\n\tcomStatistics\n\tcomProcessInfo\n\tcomConnect\n\tcomProcessKill\n\tcomDebug\n\tcomPing\n\tcomTime\n\tcomDelayedInsert\n\tcomChangeUser\n\tcomBinlogDump\n\tcomTableDump\n\tcomConnectOut\n\tcomRegisterSlave\n\tcomStmtPrepare\n\tcomStmtExecute\n\tcomStmtSendLongData\n\tcomStmtClose\n\tcomStmtReset\n\tcomSetOption\n\tcomStmtFetch\n)\n\n// https://dev.mysql.com/doc/internals/en/com-query-response.html#packet-Protocol::ColumnType\ntype fieldType byte\n\nconst (\n\tfieldTypeDecimal fieldType = iota\n\tfieldTypeTiny\n\tfieldTypeShort\n\tfieldTypeLong\n\tfieldTypeFloat\n\tfieldTypeDouble\n\tfieldTypeNULL\n\tfieldTypeTimestamp\n\tfieldTypeLongLong\n\tfieldTypeInt24\n\tfieldTypeDate\n\tfieldTypeTime\n\tfieldTypeDateTime\n\tfieldTypeYear\n\tfieldTypeNewDate\n\tfieldTypeVarChar\n\tfieldTypeBit\n)\nconst (\n\tfieldTypeJSON fieldType = iota + 0xf5\n\tfieldTypeNewDecimal\n\tfieldTypeEnum\n\tfieldTypeSet\n\tfieldTypeTinyBLOB\n\tfieldTypeMediumBLOB\n\tfieldTypeLongBLOB\n\tfieldTypeBLOB\n\tfieldTypeVarString\n\tfieldTypeString\n\tfieldTypeGeometry\n)\n\ntype fieldFlag uint16\n\nconst (\n\tflagNotNULL fieldFlag = 1 << iota\n\tflagPriKey\n\tflagUniqueKey\n\tflagMultipleKey\n\tflagBLOB\n\tflagUnsigned\n\tflagZeroFill\n\tflagBinary\n\tflagEnum\n\tflagAutoIncrement\n\tflagTimestamp\n\tflagSet\n\tflagUnknown1\n\tflagUnknown2\n\tflagUnknown3\n\tflagUnknown4\n)\n\n// http://dev.mysql.com/doc/internals/en/status-flags.html\ntype statusFlag uint16\n\nconst (\n\tstatusInTrans statusFlag = 1 << iota\n\tstatusInAutocommit\n\tstatusReserved // Not in documentation\n\tstatusMoreResultsExists\n\tstatusNoGoodIndexUsed\n\tstatusNoIndexUsed\n\tstatusCursorExists\n\tstatusLastRowSent\n\tstatusDbDropped\n\tstatusNoBackslashEscapes\n\tstatusMetadataChanged\n\tstatusQueryWasSlow\n\tstatusPsOutParams\n\tstatusInTransReadonly\n\tstatusSessionStateChanged\n)\n\nconst (\n\tcachingSha2PasswordRequestPublicKey = 2\n\tcachingSha2PasswordFastAuthSuccess = 3\n\tcachingSha2PasswordPerformFullAuthentication = 4\n)\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/driver.go", "content": "// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\n// Package mysql provides a MySQL driver for Go's database/sql package.\n//\n// The driver should be used via the database/sql package:\n//\n// import \"database/sql\"\n// import _ \"github.com/go-sql-driver/mysql\"\n//\n// db, err := sql.Open(\"mysql\", \"user:password@/dbname\")\n//\n// See https://github.com/go-sql-driver/mysql#usage for details\npackage mysql\n\nimport (\n\t\"context\"\n\t\"database/sql\"\n\t\"database/sql/driver\"\n\t\"net\"\n\t\"sync\"\n)\n\n// MySQLDriver is exported to make the driver directly accessible.\n// In general the driver is used via the database/sql package.\ntype MySQLDriver struct{}\n\n// DialFunc is a function which can be used to establish the network connection.\n// Custom dial functions must be registered with RegisterDial\n//\n// Deprecated: users should register a DialContextFunc instead\ntype DialFunc func(addr string) (net.Conn, error)\n\n// DialContextFunc is a function which can be used to establish the network connection.\n// Custom dial functions must be registered with RegisterDialContext\ntype DialContextFunc func(ctx context.Context, addr string) (net.Conn, error)\n\nvar (\n\tdialsLock sync.RWMutex\n\tdials map[string]DialContextFunc\n)\n\n// RegisterDialContext registers a custom dial function. It can then be used by the\n// network address mynet(addr), where mynet is the registered new network.\n// The current context for the connection and its address is passed to the dial function.\nfunc RegisterDialContext(net string, dial DialContextFunc) {\n\tdialsLock.Lock()\n\tdefer dialsLock.Unlock()\n\tif dials == nil {\n\t\tdials = make(map[string]DialContextFunc)\n\t}\n\tdials[net] = dial\n}\n\n// RegisterDial registers a custom dial function. It can then be used by the\n// network address mynet(addr), where mynet is the registered new network.\n// addr is passed as a parameter to the dial function.\n//\n// Deprecated: users should call RegisterDialContext instead\nfunc RegisterDial(network string, dial DialFunc) {\n\tRegisterDialContext(network, func(_ context.Context, addr string) (net.Conn, error) {\n\t\treturn dial(addr)\n\t})\n}\n\n// Open new Connection.\n// See https://github.com/go-sql-driver/mysql#dsn-data-source-name for how\n// the DSN string is formatted\nfunc (d MySQLDriver) Open(dsn string) (driver.Conn, error) {\n\tcfg, err := ParseDSN(dsn)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tc := &connector{\n\t\tcfg: cfg,\n\t}\n\treturn c.Connect(context.Background())\n}\n\nfunc init() {\n\tsql.Register(\"mysql\", &MySQLDriver{})\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/driver_go110.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2018 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\n// +build go1.10\n\npackage mysql\n\nimport (\n\t\"database/sql/driver\"\n)\n\n// NewConnector returns new driver.Connector.\nfunc NewConnector(cfg *Config) (driver.Connector, error) {\n\tcfg = cfg.Clone()\n\t// normalize the contents of cfg so calls to NewConnector have the same\n\t// behavior as MySQLDriver.OpenConnector\n\tif err := cfg.normalize(); err != nil {\n\t\treturn nil, err\n\t}\n\treturn &connector{cfg: cfg}, nil\n}\n\n// OpenConnector implements driver.DriverContext.\nfunc (d MySQLDriver) OpenConnector(dsn string) (driver.Connector, error) {\n\tcfg, err := ParseDSN(dsn)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &connector{\n\t\tcfg: cfg,\n\t}, nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/dsn.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2016 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"bytes\"\n\t\"crypto/rsa\"\n\t\"crypto/tls\"\n\t\"errors\"\n\t\"fmt\"\n\t\"math/big\"\n\t\"net\"\n\t\"net/url\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\nvar (\n\terrInvalidDSNUnescaped = errors.New(\"invalid DSN: did you forget to escape a param value?\")\n\terrInvalidDSNAddr = errors.New(\"invalid DSN: network address not terminated (missing closing brace)\")\n\terrInvalidDSNNoSlash = errors.New(\"invalid DSN: missing the slash separating the database name\")\n\terrInvalidDSNUnsafeCollation = errors.New(\"invalid DSN: interpolateParams can not be used with unsafe collations\")\n)\n\n// Config is a configuration parsed from a DSN string.\n// If a new Config is created instead of being parsed from a DSN string,\n// the NewConfig function should be used, which sets default values.\ntype Config struct {\n\tUser string // Username\n\tPasswd string // Password (requires User)\n\tNet string // Network type\n\tAddr string // Network address (requires Net)\n\tDBName string // Database name\n\tParams map[string]string // Connection parameters\n\tCollation string // Connection collation\n\tLoc *time.Location // Location for time.Time values\n\tMaxAllowedPacket int // Max packet size allowed\n\tServerPubKey string // Server public key name\n\tpubKey *rsa.PublicKey // Server public key\n\tTLSConfig string // TLS configuration name\n\ttls *tls.Config // TLS configuration\n\tTimeout time.Duration // Dial timeout\n\tReadTimeout time.Duration // I/O read timeout\n\tWriteTimeout time.Duration // I/O write timeout\n\n\tAllowAllFiles bool // Allow all files to be used with LOAD DATA LOCAL INFILE\n\tAllowCleartextPasswords bool // Allows the cleartext client side plugin\n\tAllowNativePasswords bool // Allows the native password authentication method\n\tAllowOldPasswords bool // Allows the old insecure password method\n\tClientFoundRows bool // Return number of matching rows instead of rows changed\n\tColumnsWithAlias bool // Prepend table alias to column names\n\tInterpolateParams bool // Interpolate placeholders into query string\n\tMultiStatements bool // Allow multiple statements in one query\n\tParseTime bool // Parse time values to time.Time\n\tRejectReadOnly bool // Reject read-only connections\n}\n\n// NewConfig creates a new Config and sets default values.\nfunc NewConfig() *Config {\n\treturn &Config{\n\t\tCollation: defaultCollation,\n\t\tLoc: time.UTC,\n\t\tMaxAllowedPacket: defaultMaxAllowedPacket,\n\t\tAllowNativePasswords: true,\n\t}\n}\n\nfunc (cfg *Config) Clone() *Config {\n\tcp := *cfg\n\tif cp.tls != nil {\n\t\tcp.tls = cfg.tls.Clone()\n\t}\n\tif len(cp.Params) > 0 {\n\t\tcp.Params = make(map[string]string, len(cfg.Params))\n\t\tfor k, v := range cfg.Params {\n\t\t\tcp.Params[k] = v\n\t\t}\n\t}\n\tif cfg.pubKey != nil {\n\t\tcp.pubKey = &rsa.PublicKey{\n\t\t\tN: new(big.Int).Set(cfg.pubKey.N),\n\t\t\tE: cfg.pubKey.E,\n\t\t}\n\t}\n\treturn &cp\n}\n\nfunc (cfg *Config) normalize() error {\n\tif cfg.InterpolateParams && unsafeCollations[cfg.Collation] {\n\t\treturn errInvalidDSNUnsafeCollation\n\t}\n\n\t// Set default network if empty\n\tif cfg.Net == \"\" {\n\t\tcfg.Net = \"tcp\"\n\t}\n\n\t// Set default address if empty\n\tif cfg.Addr == \"\" {\n\t\tswitch cfg.Net {\n\t\tcase \"tcp\":\n\t\t\tcfg.Addr = \"127.0.0.1:3306\"\n\t\tcase \"unix\":\n\t\t\tcfg.Addr = \"/tmp/mysql.sock\"\n\t\tdefault:\n\t\t\treturn errors.New(\"default addr for network '\" + cfg.Net + \"' unknown\")\n\t\t}\n\t} else if cfg.Net == \"tcp\" {\n\t\tcfg.Addr = ensureHavePort(cfg.Addr)\n\t}\n\n\tswitch cfg.TLSConfig {\n\tcase \"false\", \"\":\n\t\t// don't set anything\n\tcase \"true\":\n\t\tcfg.tls = &tls.Config{}\n\tcase \"skip-verify\", \"preferred\":\n\t\tcfg.tls = &tls.Config{InsecureSkipVerify: true}\n\tdefault:\n\t\tcfg.tls = getTLSConfigClone(cfg.TLSConfig)\n\t\tif cfg.tls == nil {\n\t\t\treturn errors.New(\"invalid value / unknown config name: \" + cfg.TLSConfig)\n\t\t}\n\t}\n\n\tif cfg.tls != nil && cfg.tls.ServerName == \"\" && !cfg.tls.InsecureSkipVerify {\n\t\thost, _, err := net.SplitHostPort(cfg.Addr)\n\t\tif err == nil {\n\t\t\tcfg.tls.ServerName = host\n\t\t}\n\t}\n\n\tif cfg.ServerPubKey != \"\" {\n\t\tcfg.pubKey = getServerPubKey(cfg.ServerPubKey)\n\t\tif cfg.pubKey == nil {\n\t\t\treturn errors.New(\"invalid value / unknown server pub key name: \" + cfg.ServerPubKey)\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// FormatDSN formats the given Config into a DSN string which can be passed to\n// the driver.\nfunc (cfg *Config) FormatDSN() string {\n\tvar buf bytes.Buffer\n\n\t// [username[:password]@]\n\tif len(cfg.User) > 0 {\n\t\tbuf.WriteString(cfg.User)\n\t\tif len(cfg.Passwd) > 0 {\n\t\t\tbuf.WriteByte(':')\n\t\t\tbuf.WriteString(cfg.Passwd)\n\t\t}\n\t\tbuf.WriteByte('@')\n\t}\n\n\t// [protocol[(address)]]\n\tif len(cfg.Net) > 0 {\n\t\tbuf.WriteString(cfg.Net)\n\t\tif len(cfg.Addr) > 0 {\n\t\t\tbuf.WriteByte('(')\n\t\t\tbuf.WriteString(cfg.Addr)\n\t\t\tbuf.WriteByte(')')\n\t\t}\n\t}\n\n\t// /dbname\n\tbuf.WriteByte('/')\n\tbuf.WriteString(cfg.DBName)\n\n\t// [?param1=value1&...¶mN=valueN]\n\thasParam := false\n\n\tif cfg.AllowAllFiles {\n\t\thasParam = true\n\t\tbuf.WriteString(\"?allowAllFiles=true\")\n\t}\n\n\tif cfg.AllowCleartextPasswords {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&allowCleartextPasswords=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?allowCleartextPasswords=true\")\n\t\t}\n\t}\n\n\tif !cfg.AllowNativePasswords {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&allowNativePasswords=false\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?allowNativePasswords=false\")\n\t\t}\n\t}\n\n\tif cfg.AllowOldPasswords {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&allowOldPasswords=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?allowOldPasswords=true\")\n\t\t}\n\t}\n\n\tif cfg.ClientFoundRows {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&clientFoundRows=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?clientFoundRows=true\")\n\t\t}\n\t}\n\n\tif col := cfg.Collation; col != defaultCollation && len(col) > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&collation=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?collation=\")\n\t\t}\n\t\tbuf.WriteString(col)\n\t}\n\n\tif cfg.ColumnsWithAlias {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&columnsWithAlias=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?columnsWithAlias=true\")\n\t\t}\n\t}\n\n\tif cfg.InterpolateParams {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&interpolateParams=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?interpolateParams=true\")\n\t\t}\n\t}\n\n\tif cfg.Loc != time.UTC && cfg.Loc != nil {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&loc=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?loc=\")\n\t\t}\n\t\tbuf.WriteString(url.QueryEscape(cfg.Loc.String()))\n\t}\n\n\tif cfg.MultiStatements {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&multiStatements=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?multiStatements=true\")\n\t\t}\n\t}\n\n\tif cfg.ParseTime {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&parseTime=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?parseTime=true\")\n\t\t}\n\t}\n\n\tif cfg.ReadTimeout > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&readTimeout=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?readTimeout=\")\n\t\t}\n\t\tbuf.WriteString(cfg.ReadTimeout.String())\n\t}\n\n\tif cfg.RejectReadOnly {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&rejectReadOnly=true\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?rejectReadOnly=true\")\n\t\t}\n\t}\n\n\tif len(cfg.ServerPubKey) > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&serverPubKey=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?serverPubKey=\")\n\t\t}\n\t\tbuf.WriteString(url.QueryEscape(cfg.ServerPubKey))\n\t}\n\n\tif cfg.Timeout > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&timeout=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?timeout=\")\n\t\t}\n\t\tbuf.WriteString(cfg.Timeout.String())\n\t}\n\n\tif len(cfg.TLSConfig) > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&tls=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?tls=\")\n\t\t}\n\t\tbuf.WriteString(url.QueryEscape(cfg.TLSConfig))\n\t}\n\n\tif cfg.WriteTimeout > 0 {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&writeTimeout=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?writeTimeout=\")\n\t\t}\n\t\tbuf.WriteString(cfg.WriteTimeout.String())\n\t}\n\n\tif cfg.MaxAllowedPacket != defaultMaxAllowedPacket {\n\t\tif hasParam {\n\t\t\tbuf.WriteString(\"&maxAllowedPacket=\")\n\t\t} else {\n\t\t\thasParam = true\n\t\t\tbuf.WriteString(\"?maxAllowedPacket=\")\n\t\t}\n\t\tbuf.WriteString(strconv.Itoa(cfg.MaxAllowedPacket))\n\n\t}\n\n\t// other params\n\tif cfg.Params != nil {\n\t\tvar params []string\n\t\tfor param := range cfg.Params {\n\t\t\tparams = append(params, param)\n\t\t}\n\t\tsort.Strings(params)\n\t\tfor _, param := range params {\n\t\t\tif hasParam {\n\t\t\t\tbuf.WriteByte('&')\n\t\t\t} else {\n\t\t\t\thasParam = true\n\t\t\t\tbuf.WriteByte('?')\n\t\t\t}\n\n\t\t\tbuf.WriteString(param)\n\t\t\tbuf.WriteByte('=')\n\t\t\tbuf.WriteString(url.QueryEscape(cfg.Params[param]))\n\t\t}\n\t}\n\n\treturn buf.String()\n}\n\n// ParseDSN parses the DSN string to a Config\nfunc ParseDSN(dsn string) (cfg *Config, err error) {\n\t// New config with some default values\n\tcfg = NewConfig()\n\n\t// [user[:password]@][net[(addr)]]/dbname[?param1=value1¶mN=valueN]\n\t// Find the last '/' (since the password or the net addr might contain a '/')\n\tfoundSlash := false\n\tfor i := len(dsn) - 1; i >= 0; i-- {\n\t\tif dsn[i] == '/' {\n\t\t\tfoundSlash = true\n\t\t\tvar j, k int\n\n\t\t\t// left part is empty if i <= 0\n\t\t\tif i > 0 {\n\t\t\t\t// [username[:password]@][protocol[(address)]]\n\t\t\t\t// Find the last '@' in dsn[:i]\n\t\t\t\tfor j = i; j >= 0; j-- {\n\t\t\t\t\tif dsn[j] == '@' {\n\t\t\t\t\t\t// username[:password]\n\t\t\t\t\t\t// Find the first ':' in dsn[:j]\n\t\t\t\t\t\tfor k = 0; k < j; k++ {\n\t\t\t\t\t\t\tif dsn[k] == ':' {\n\t\t\t\t\t\t\t\tcfg.Passwd = dsn[k+1 : j]\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcfg.User = dsn[:k]\n\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// [protocol[(address)]]\n\t\t\t\t// Find the first '(' in dsn[j+1:i]\n\t\t\t\tfor k = j + 1; k < i; k++ {\n\t\t\t\t\tif dsn[k] == '(' {\n\t\t\t\t\t\t// dsn[i-1] must be == ')' if an address is specified\n\t\t\t\t\t\tif dsn[i-1] != ')' {\n\t\t\t\t\t\t\tif strings.ContainsRune(dsn[k+1:i], ')') {\n\t\t\t\t\t\t\t\treturn nil, errInvalidDSNUnescaped\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn nil, errInvalidDSNAddr\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcfg.Addr = dsn[k+1 : i-1]\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcfg.Net = dsn[j+1 : k]\n\t\t\t}\n\n\t\t\t// dbname[?param1=value1&...¶mN=valueN]\n\t\t\t// Find the first '?' in dsn[i+1:]\n\t\t\tfor j = i + 1; j < len(dsn); j++ {\n\t\t\t\tif dsn[j] == '?' {\n\t\t\t\t\tif err = parseDSNParams(cfg, dsn[j+1:]); err != nil {\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tcfg.DBName = dsn[i+1 : j]\n\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif !foundSlash && len(dsn) > 0 {\n\t\treturn nil, errInvalidDSNNoSlash\n\t}\n\n\tif err = cfg.normalize(); err != nil {\n\t\treturn nil, err\n\t}\n\treturn\n}\n\n// parseDSNParams parses the DSN \"query string\"\n// Values must be url.QueryEscape'ed\nfunc parseDSNParams(cfg *Config, params string) (err error) {\n\tfor _, v := range strings.Split(params, \"&\") {\n\t\tparam := strings.SplitN(v, \"=\", 2)\n\t\tif len(param) != 2 {\n\t\t\tcontinue\n\t\t}\n\n\t\t// cfg params\n\t\tswitch value := param[1]; param[0] {\n\t\t// Disable INFILE whitelist / enable all files\n\t\tcase \"allowAllFiles\":\n\t\t\tvar isBool bool\n\t\t\tcfg.AllowAllFiles, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Use cleartext authentication mode (MySQL 5.5.10+)\n\t\tcase \"allowCleartextPasswords\":\n\t\t\tvar isBool bool\n\t\t\tcfg.AllowCleartextPasswords, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Use native password authentication\n\t\tcase \"allowNativePasswords\":\n\t\t\tvar isBool bool\n\t\t\tcfg.AllowNativePasswords, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Use old authentication mode (pre MySQL 4.1)\n\t\tcase \"allowOldPasswords\":\n\t\t\tvar isBool bool\n\t\t\tcfg.AllowOldPasswords, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Switch \"rowsAffected\" mode\n\t\tcase \"clientFoundRows\":\n\t\t\tvar isBool bool\n\t\t\tcfg.ClientFoundRows, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Collation\n\t\tcase \"collation\":\n\t\t\tcfg.Collation = value\n\t\t\tbreak\n\n\t\tcase \"columnsWithAlias\":\n\t\t\tvar isBool bool\n\t\t\tcfg.ColumnsWithAlias, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Compression\n\t\tcase \"compress\":\n\t\t\treturn errors.New(\"compression not implemented yet\")\n\n\t\t// Enable client side placeholder substitution\n\t\tcase \"interpolateParams\":\n\t\t\tvar isBool bool\n\t\t\tcfg.InterpolateParams, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Time Location\n\t\tcase \"loc\":\n\t\t\tif value, err = url.QueryUnescape(value); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tcfg.Loc, err = time.LoadLocation(value)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t// multiple statements in one query\n\t\tcase \"multiStatements\":\n\t\t\tvar isBool bool\n\t\t\tcfg.MultiStatements, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// time.Time parsing\n\t\tcase \"parseTime\":\n\t\t\tvar isBool bool\n\t\t\tcfg.ParseTime, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// I/O read Timeout\n\t\tcase \"readTimeout\":\n\t\t\tcfg.ReadTimeout, err = time.ParseDuration(value)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t// Reject read-only connections\n\t\tcase \"rejectReadOnly\":\n\t\t\tvar isBool bool\n\t\t\tcfg.RejectReadOnly, isBool = readBool(value)\n\t\t\tif !isBool {\n\t\t\t\treturn errors.New(\"invalid bool value: \" + value)\n\t\t\t}\n\n\t\t// Server public key\n\t\tcase \"serverPubKey\":\n\t\t\tname, err := url.QueryUnescape(value)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"invalid value for server pub key name: %v\", err)\n\t\t\t}\n\t\t\tcfg.ServerPubKey = name\n\n\t\t// Strict mode\n\t\tcase \"strict\":\n\t\t\tpanic(\"strict mode has been removed. See https://github.com/go-sql-driver/mysql/wiki/strict-mode\")\n\n\t\t// Dial Timeout\n\t\tcase \"timeout\":\n\t\t\tcfg.Timeout, err = time.ParseDuration(value)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t// TLS-Encryption\n\t\tcase \"tls\":\n\t\t\tboolValue, isBool := readBool(value)\n\t\t\tif isBool {\n\t\t\t\tif boolValue {\n\t\t\t\t\tcfg.TLSConfig = \"true\"\n\t\t\t\t} else {\n\t\t\t\t\tcfg.TLSConfig = \"false\"\n\t\t\t\t}\n\t\t\t} else if vl := strings.ToLower(value); vl == \"skip-verify\" || vl == \"preferred\" {\n\t\t\t\tcfg.TLSConfig = vl\n\t\t\t} else {\n\t\t\t\tname, err := url.QueryUnescape(value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn fmt.Errorf(\"invalid value for TLS config name: %v\", err)\n\t\t\t\t}\n\t\t\t\tcfg.TLSConfig = name\n\t\t\t}\n\n\t\t// I/O write Timeout\n\t\tcase \"writeTimeout\":\n\t\t\tcfg.WriteTimeout, err = time.ParseDuration(value)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase \"maxAllowedPacket\":\n\t\t\tcfg.MaxAllowedPacket, err = strconv.Atoi(value)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tdefault:\n\t\t\t// lazy init\n\t\t\tif cfg.Params == nil {\n\t\t\t\tcfg.Params = make(map[string]string)\n\t\t\t}\n\n\t\t\tif cfg.Params[param[0]], err = url.QueryUnescape(value); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\treturn\n}\n\nfunc ensureHavePort(addr string) string {\n\tif _, _, err := net.SplitHostPort(addr); err != nil {\n\t\treturn net.JoinHostPort(addr, \"3306\")\n\t}\n\treturn addr\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/errors.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2013 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n)\n\n// Various errors the driver might return. Can change between driver versions.\nvar (\n\tErrInvalidConn = errors.New(\"invalid connection\")\n\tErrMalformPkt = errors.New(\"malformed packet\")\n\tErrNoTLS = errors.New(\"TLS requested but server does not support TLS\")\n\tErrCleartextPassword = errors.New(\"this user requires clear text authentication. If you still want to use it, please add 'allowCleartextPasswords=1' to your DSN\")\n\tErrNativePassword = errors.New(\"this user requires mysql native password authentication.\")\n\tErrOldPassword = errors.New(\"this user requires old password authentication. If you still want to use it, please add 'allowOldPasswords=1' to your DSN. See also https://github.com/go-sql-driver/mysql/wiki/old_passwords\")\n\tErrUnknownPlugin = errors.New(\"this authentication plugin is not supported\")\n\tErrOldProtocol = errors.New(\"MySQL server does not support required protocol 41+\")\n\tErrPktSync = errors.New(\"commands out of sync. You can't run this command now\")\n\tErrPktSyncMul = errors.New(\"commands out of sync. Did you run multiple statements at once?\")\n\tErrPktTooLarge = errors.New(\"packet for query is too large. Try adjusting the 'max_allowed_packet' variable on the server\")\n\tErrBusyBuffer = errors.New(\"busy buffer\")\n\n\t// errBadConnNoWrite is used for connection errors where nothing was sent to the database yet.\n\t// If this happens first in a function starting a database interaction, it should be replaced by driver.ErrBadConn\n\t// to trigger a resend.\n\t// See https://github.com/go-sql-driver/mysql/pull/302\n\terrBadConnNoWrite = errors.New(\"bad connection\")\n)\n\nvar errLog = Logger(log.New(os.Stderr, \"[mysql] \", log.Ldate|log.Ltime|log.Lshortfile))\n\n// Logger is used to log critical error messages.\ntype Logger interface {\n\tPrint(v ...interface{})\n}\n\n// SetLogger is used to set the logger for critical errors.\n// The initial logger is os.Stderr.\nfunc SetLogger(logger Logger) error {\n\tif logger == nil {\n\t\treturn errors.New(\"logger is nil\")\n\t}\n\terrLog = logger\n\treturn nil\n}\n\n// MySQLError is an error type which represents a single MySQL error\ntype MySQLError struct {\n\tNumber uint16\n\tMessage string\n}\n\nfunc (me *MySQLError) Error() string {\n\treturn fmt.Sprintf(\"Error %d: %s\", me.Number, me.Message)\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/fields.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2017 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"database/sql\"\n\t\"reflect\"\n)\n\nfunc (mf *mysqlField) typeDatabaseName() string {\n\tswitch mf.fieldType {\n\tcase fieldTypeBit:\n\t\treturn \"BIT\"\n\tcase fieldTypeBLOB:\n\t\tif mf.charSet != collations[binaryCollation] {\n\t\t\treturn \"TEXT\"\n\t\t}\n\t\treturn \"BLOB\"\n\tcase fieldTypeDate:\n\t\treturn \"DATE\"\n\tcase fieldTypeDateTime:\n\t\treturn \"DATETIME\"\n\tcase fieldTypeDecimal:\n\t\treturn \"DECIMAL\"\n\tcase fieldTypeDouble:\n\t\treturn \"DOUBLE\"\n\tcase fieldTypeEnum:\n\t\treturn \"ENUM\"\n\tcase fieldTypeFloat:\n\t\treturn \"FLOAT\"\n\tcase fieldTypeGeometry:\n\t\treturn \"GEOMETRY\"\n\tcase fieldTypeInt24:\n\t\treturn \"MEDIUMINT\"\n\tcase fieldTypeJSON:\n\t\treturn \"JSON\"\n\tcase fieldTypeLong:\n\t\treturn \"INT\"\n\tcase fieldTypeLongBLOB:\n\t\tif mf.charSet != collations[binaryCollation] {\n\t\t\treturn \"LONGTEXT\"\n\t\t}\n\t\treturn \"LONGBLOB\"\n\tcase fieldTypeLongLong:\n\t\treturn \"BIGINT\"\n\tcase fieldTypeMediumBLOB:\n\t\tif mf.charSet != collations[binaryCollation] {\n\t\t\treturn \"MEDIUMTEXT\"\n\t\t}\n\t\treturn \"MEDIUMBLOB\"\n\tcase fieldTypeNewDate:\n\t\treturn \"DATE\"\n\tcase fieldTypeNewDecimal:\n\t\treturn \"DECIMAL\"\n\tcase fieldTypeNULL:\n\t\treturn \"NULL\"\n\tcase fieldTypeSet:\n\t\treturn \"SET\"\n\tcase fieldTypeShort:\n\t\treturn \"SMALLINT\"\n\tcase fieldTypeString:\n\t\tif mf.charSet == collations[binaryCollation] {\n\t\t\treturn \"BINARY\"\n\t\t}\n\t\treturn \"CHAR\"\n\tcase fieldTypeTime:\n\t\treturn \"TIME\"\n\tcase fieldTypeTimestamp:\n\t\treturn \"TIMESTAMP\"\n\tcase fieldTypeTiny:\n\t\treturn \"TINYINT\"\n\tcase fieldTypeTinyBLOB:\n\t\tif mf.charSet != collations[binaryCollation] {\n\t\t\treturn \"TINYTEXT\"\n\t\t}\n\t\treturn \"TINYBLOB\"\n\tcase fieldTypeVarChar:\n\t\tif mf.charSet == collations[binaryCollation] {\n\t\t\treturn \"VARBINARY\"\n\t\t}\n\t\treturn \"VARCHAR\"\n\tcase fieldTypeVarString:\n\t\tif mf.charSet == collations[binaryCollation] {\n\t\t\treturn \"VARBINARY\"\n\t\t}\n\t\treturn \"VARCHAR\"\n\tcase fieldTypeYear:\n\t\treturn \"YEAR\"\n\tdefault:\n\t\treturn \"\"\n\t}\n}\n\nvar (\n\tscanTypeFloat32 = reflect.TypeOf(float32(0))\n\tscanTypeFloat64 = reflect.TypeOf(float64(0))\n\tscanTypeInt8 = reflect.TypeOf(int8(0))\n\tscanTypeInt16 = reflect.TypeOf(int16(0))\n\tscanTypeInt32 = reflect.TypeOf(int32(0))\n\tscanTypeInt64 = reflect.TypeOf(int64(0))\n\tscanTypeNullFloat = reflect.TypeOf(sql.NullFloat64{})\n\tscanTypeNullInt = reflect.TypeOf(sql.NullInt64{})\n\tscanTypeNullTime = reflect.TypeOf(NullTime{})\n\tscanTypeUint8 = reflect.TypeOf(uint8(0))\n\tscanTypeUint16 = reflect.TypeOf(uint16(0))\n\tscanTypeUint32 = reflect.TypeOf(uint32(0))\n\tscanTypeUint64 = reflect.TypeOf(uint64(0))\n\tscanTypeRawBytes = reflect.TypeOf(sql.RawBytes{})\n\tscanTypeUnknown = reflect.TypeOf(new(interface{}))\n)\n\ntype mysqlField struct {\n\ttableName string\n\tname string\n\tlength uint32\n\tflags fieldFlag\n\tfieldType fieldType\n\tdecimals byte\n\tcharSet uint8\n}\n\nfunc (mf *mysqlField) scanType() reflect.Type {\n\tswitch mf.fieldType {\n\tcase fieldTypeTiny:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\tif mf.flags&flagUnsigned != 0 {\n\t\t\t\treturn scanTypeUint8\n\t\t\t}\n\t\t\treturn scanTypeInt8\n\t\t}\n\t\treturn scanTypeNullInt\n\n\tcase fieldTypeShort, fieldTypeYear:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\tif mf.flags&flagUnsigned != 0 {\n\t\t\t\treturn scanTypeUint16\n\t\t\t}\n\t\t\treturn scanTypeInt16\n\t\t}\n\t\treturn scanTypeNullInt\n\n\tcase fieldTypeInt24, fieldTypeLong:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\tif mf.flags&flagUnsigned != 0 {\n\t\t\t\treturn scanTypeUint32\n\t\t\t}\n\t\t\treturn scanTypeInt32\n\t\t}\n\t\treturn scanTypeNullInt\n\n\tcase fieldTypeLongLong:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\tif mf.flags&flagUnsigned != 0 {\n\t\t\t\treturn scanTypeUint64\n\t\t\t}\n\t\t\treturn scanTypeInt64\n\t\t}\n\t\treturn scanTypeNullInt\n\n\tcase fieldTypeFloat:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\treturn scanTypeFloat32\n\t\t}\n\t\treturn scanTypeNullFloat\n\n\tcase fieldTypeDouble:\n\t\tif mf.flags&flagNotNULL != 0 {\n\t\t\treturn scanTypeFloat64\n\t\t}\n\t\treturn scanTypeNullFloat\n\n\tcase fieldTypeDecimal, fieldTypeNewDecimal, fieldTypeVarChar,\n\t\tfieldTypeBit, fieldTypeEnum, fieldTypeSet, fieldTypeTinyBLOB,\n\t\tfieldTypeMediumBLOB, fieldTypeLongBLOB, fieldTypeBLOB,\n\t\tfieldTypeVarString, fieldTypeString, fieldTypeGeometry, fieldTypeJSON,\n\t\tfieldTypeTime:\n\t\treturn scanTypeRawBytes\n\n\tcase fieldTypeDate, fieldTypeNewDate,\n\t\tfieldTypeTimestamp, fieldTypeDateTime:\n\t\t// NullTime is always returned for more consistent behavior as it can\n\t\t// handle both cases of parseTime regardless if the field is nullable.\n\t\treturn scanTypeNullTime\n\n\tdefault:\n\t\treturn scanTypeUnknown\n\t}\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/infile.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2013 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"strings\"\n\t\"sync\"\n)\n\nvar (\n\tfileRegister map[string]bool\n\tfileRegisterLock sync.RWMutex\n\treaderRegister map[string]func() io.Reader\n\treaderRegisterLock sync.RWMutex\n)\n\n// RegisterLocalFile adds the given file to the file whitelist,\n// so that it can be used by \"LOAD DATA LOCAL INFILE \".\n// Alternatively you can allow the use of all local files with\n// the DSN parameter 'allowAllFiles=true'\n//\n// filePath := \"/home/gopher/data.csv\"\n// mysql.RegisterLocalFile(filePath)\n// err := db.Exec(\"LOAD DATA LOCAL INFILE '\" + filePath + \"' INTO TABLE foo\")\n// if err != nil {\n// ...\n//\nfunc RegisterLocalFile(filePath string) {\n\tfileRegisterLock.Lock()\n\t// lazy map init\n\tif fileRegister == nil {\n\t\tfileRegister = make(map[string]bool)\n\t}\n\n\tfileRegister[strings.Trim(filePath, `\"`)] = true\n\tfileRegisterLock.Unlock()\n}\n\n// DeregisterLocalFile removes the given filepath from the whitelist.\nfunc DeregisterLocalFile(filePath string) {\n\tfileRegisterLock.Lock()\n\tdelete(fileRegister, strings.Trim(filePath, `\"`))\n\tfileRegisterLock.Unlock()\n}\n\n// RegisterReaderHandler registers a handler function which is used\n// to receive a io.Reader.\n// The Reader can be used by \"LOAD DATA LOCAL INFILE Reader::\".\n// If the handler returns a io.ReadCloser Close() is called when the\n// request is finished.\n//\n// mysql.RegisterReaderHandler(\"data\", func() io.Reader {\n// \tvar csvReader io.Reader // Some Reader that returns CSV data\n// \t... // Open Reader here\n// \treturn csvReader\n// })\n// err := db.Exec(\"LOAD DATA LOCAL INFILE 'Reader::data' INTO TABLE foo\")\n// if err != nil {\n// ...\n//\nfunc RegisterReaderHandler(name string, handler func() io.Reader) {\n\treaderRegisterLock.Lock()\n\t// lazy map init\n\tif readerRegister == nil {\n\t\treaderRegister = make(map[string]func() io.Reader)\n\t}\n\n\treaderRegister[name] = handler\n\treaderRegisterLock.Unlock()\n}\n\n// DeregisterReaderHandler removes the ReaderHandler function with\n// the given name from the registry.\nfunc DeregisterReaderHandler(name string) {\n\treaderRegisterLock.Lock()\n\tdelete(readerRegister, name)\n\treaderRegisterLock.Unlock()\n}\n\nfunc deferredClose(err *error, closer io.Closer) {\n\tcloseErr := closer.Close()\n\tif *err == nil {\n\t\t*err = closeErr\n\t}\n}\n\nfunc (mc *mysqlConn) handleInFileRequest(name string) (err error) {\n\tvar rdr io.Reader\n\tvar data []byte\n\tpacketSize := 16 * 1024 // 16KB is small enough for disk readahead and large enough for TCP\n\tif mc.maxWriteSize < packetSize {\n\t\tpacketSize = mc.maxWriteSize\n\t}\n\n\tif idx := strings.Index(name, \"Reader::\"); idx == 0 || (idx > 0 && name[idx-1] == '/') { // io.Reader\n\t\t// The server might return an an absolute path. See issue #355.\n\t\tname = name[idx+8:]\n\n\t\treaderRegisterLock.RLock()\n\t\thandler, inMap := readerRegister[name]\n\t\treaderRegisterLock.RUnlock()\n\n\t\tif inMap {\n\t\t\trdr = handler()\n\t\t\tif rdr != nil {\n\t\t\t\tif cl, ok := rdr.(io.Closer); ok {\n\t\t\t\t\tdefer deferredClose(&err, cl)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\terr = fmt.Errorf(\"Reader '%s' is \", name)\n\t\t\t}\n\t\t} else {\n\t\t\terr = fmt.Errorf(\"Reader '%s' is not registered\", name)\n\t\t}\n\t} else { // File\n\t\tname = strings.Trim(name, `\"`)\n\t\tfileRegisterLock.RLock()\n\t\tfr := fileRegister[name]\n\t\tfileRegisterLock.RUnlock()\n\t\tif mc.cfg.AllowAllFiles || fr {\n\t\t\tvar file *os.File\n\t\t\tvar fi os.FileInfo\n\n\t\t\tif file, err = os.Open(name); err == nil {\n\t\t\t\tdefer deferredClose(&err, file)\n\n\t\t\t\t// get file size\n\t\t\t\tif fi, err = file.Stat(); err == nil {\n\t\t\t\t\trdr = file\n\t\t\t\t\tif fileSize := int(fi.Size()); fileSize < packetSize {\n\t\t\t\t\t\tpacketSize = fileSize\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\terr = fmt.Errorf(\"local file '%s' is not registered\", name)\n\t\t}\n\t}\n\n\t// send content packets\n\t// if packetSize == 0, the Reader contains no data\n\tif err == nil && packetSize > 0 {\n\t\tdata := make([]byte, 4+packetSize)\n\t\tvar n int\n\t\tfor err == nil {\n\t\t\tn, err = rdr.Read(data[4:])\n\t\t\tif n > 0 {\n\t\t\t\tif ioErr := mc.writePacket(data[:4+n]); ioErr != nil {\n\t\t\t\t\treturn ioErr\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif err == io.EOF {\n\t\t\terr = nil\n\t\t}\n\t}\n\n\t// send empty packet (termination)\n\tif data == nil {\n\t\tdata = make([]byte, 4)\n\t}\n\tif ioErr := mc.writePacket(data[:4]); ioErr != nil {\n\t\treturn ioErr\n\t}\n\n\t// read OK packet\n\tif err == nil {\n\t\treturn mc.readResultOK()\n\t}\n\n\tmc.readPacket()\n\treturn err\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/packets.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"bytes\"\n\t\"crypto/tls\"\n\t\"database/sql/driver\"\n\t\"encoding/binary\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"time\"\n)\n\n// Packets documentation:\n// http://dev.mysql.com/doc/internals/en/client-server-protocol.html\n\n// Read packet to buffer 'data'\nfunc (mc *mysqlConn) readPacket() ([]byte, error) {\n\tvar prevData []byte\n\tfor {\n\t\t// read packet header\n\t\tdata, err := mc.buf.readNext(4)\n\t\tif err != nil {\n\t\t\tif cerr := mc.canceled.Value(); cerr != nil {\n\t\t\t\treturn nil, cerr\n\t\t\t}\n\t\t\terrLog.Print(err)\n\t\t\tmc.Close()\n\t\t\treturn nil, ErrInvalidConn\n\t\t}\n\n\t\t// packet length [24 bit]\n\t\tpktLen := int(uint32(data[0]) | uint32(data[1])<<8 | uint32(data[2])<<16)\n\n\t\t// check packet sync [8 bit]\n\t\tif data[3] != mc.sequence {\n\t\t\tif data[3] > mc.sequence {\n\t\t\t\treturn nil, ErrPktSyncMul\n\t\t\t}\n\t\t\treturn nil, ErrPktSync\n\t\t}\n\t\tmc.sequence++\n\n\t\t// packets with length 0 terminate a previous packet which is a\n\t\t// multiple of (2^24)-1 bytes long\n\t\tif pktLen == 0 {\n\t\t\t// there was no previous packet\n\t\t\tif prevData == nil {\n\t\t\t\terrLog.Print(ErrMalformPkt)\n\t\t\t\tmc.Close()\n\t\t\t\treturn nil, ErrInvalidConn\n\t\t\t}\n\n\t\t\treturn prevData, nil\n\t\t}\n\n\t\t// read packet body [pktLen bytes]\n\t\tdata, err = mc.buf.readNext(pktLen)\n\t\tif err != nil {\n\t\t\tif cerr := mc.canceled.Value(); cerr != nil {\n\t\t\t\treturn nil, cerr\n\t\t\t}\n\t\t\terrLog.Print(err)\n\t\t\tmc.Close()\n\t\t\treturn nil, ErrInvalidConn\n\t\t}\n\n\t\t// return data if this was the last packet\n\t\tif pktLen < maxPacketSize {\n\t\t\t// zero allocations for non-split packets\n\t\t\tif prevData == nil {\n\t\t\t\treturn data, nil\n\t\t\t}\n\n\t\t\treturn append(prevData, data...), nil\n\t\t}\n\n\t\tprevData = append(prevData, data...)\n\t}\n}\n\n// Write packet buffer 'data'\nfunc (mc *mysqlConn) writePacket(data []byte) error {\n\tpktLen := len(data) - 4\n\n\tif pktLen > mc.maxAllowedPacket {\n\t\treturn ErrPktTooLarge\n\t}\n\n\t// Perform a stale connection check. We only perform this check for\n\t// the first query on a connection that has been checked out of the\n\t// connection pool: a fresh connection from the pool is more likely\n\t// to be stale, and it has not performed any previous writes that\n\t// could cause data corruption, so it's safe to return ErrBadConn\n\t// if the check fails.\n\tif mc.reset {\n\t\tmc.reset = false\n\t\tconn := mc.netConn\n\t\tif mc.rawConn != nil {\n\t\t\tconn = mc.rawConn\n\t\t}\n\t\tvar err error\n\t\t// If this connection has a ReadTimeout which we've been setting on\n\t\t// reads, reset it to its default value before we attempt a non-blocking\n\t\t// read, otherwise the scheduler will just time us out before we can read\n\t\tif mc.cfg.ReadTimeout != 0 {\n\t\t\terr = conn.SetReadDeadline(time.Time{})\n\t\t}\n\t\tif err == nil {\n\t\t\terr = connCheck(conn)\n\t\t}\n\t\tif err != nil {\n\t\t\terrLog.Print(\"closing bad idle connection: \", err)\n\t\t\tmc.Close()\n\t\t\treturn driver.ErrBadConn\n\t\t}\n\t}\n\n\tfor {\n\t\tvar size int\n\t\tif pktLen >= maxPacketSize {\n\t\t\tdata[0] = 0xff\n\t\t\tdata[1] = 0xff\n\t\t\tdata[2] = 0xff\n\t\t\tsize = maxPacketSize\n\t\t} else {\n\t\t\tdata[0] = byte(pktLen)\n\t\t\tdata[1] = byte(pktLen >> 8)\n\t\t\tdata[2] = byte(pktLen >> 16)\n\t\t\tsize = pktLen\n\t\t}\n\t\tdata[3] = mc.sequence\n\n\t\t// Write packet\n\t\tif mc.writeTimeout > 0 {\n\t\t\tif err := mc.netConn.SetWriteDeadline(time.Now().Add(mc.writeTimeout)); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\t\tn, err := mc.netConn.Write(data[:4+size])\n\t\tif err == nil && n == 4+size {\n\t\t\tmc.sequence++\n\t\t\tif size != maxPacketSize {\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tpktLen -= size\n\t\t\tdata = data[size:]\n\t\t\tcontinue\n\t\t}\n\n\t\t// Handle error\n\t\tif err == nil { // n != len(data)\n\t\t\tmc.cleanup()\n\t\t\terrLog.Print(ErrMalformPkt)\n\t\t} else {\n\t\t\tif cerr := mc.canceled.Value(); cerr != nil {\n\t\t\t\treturn cerr\n\t\t\t}\n\t\t\tif n == 0 && pktLen == len(data)-4 {\n\t\t\t\t// only for the first loop iteration when nothing was written yet\n\t\t\t\treturn errBadConnNoWrite\n\t\t\t}\n\t\t\tmc.cleanup()\n\t\t\terrLog.Print(err)\n\t\t}\n\t\treturn ErrInvalidConn\n\t}\n}\n\n/******************************************************************************\n* Initialization Process *\n******************************************************************************/\n\n// Handshake Initialization Packet\n// http://dev.mysql.com/doc/internals/en/connection-phase-packets.html#packet-Protocol::Handshake\nfunc (mc *mysqlConn) readHandshakePacket() (data []byte, plugin string, err error) {\n\tdata, err = mc.readPacket()\n\tif err != nil {\n\t\t// for init we can rewrite this to ErrBadConn for sql.Driver to retry, since\n\t\t// in connection initialization we don't risk retrying non-idempotent actions.\n\t\tif err == ErrInvalidConn {\n\t\t\treturn nil, \"\", driver.ErrBadConn\n\t\t}\n\t\treturn\n\t}\n\n\tif data[0] == iERR {\n\t\treturn nil, \"\", mc.handleErrorPacket(data)\n\t}\n\n\t// protocol version [1 byte]\n\tif data[0] < minProtocolVersion {\n\t\treturn nil, \"\", fmt.Errorf(\n\t\t\t\"unsupported protocol version %d. Version %d or higher is required\",\n\t\t\tdata[0],\n\t\t\tminProtocolVersion,\n\t\t)\n\t}\n\n\t// server version [null terminated string]\n\t// connection id [4 bytes]\n\tpos := 1 + bytes.IndexByte(data[1:], 0x00) + 1 + 4\n\n\t// first part of the password cipher [8 bytes]\n\tauthData := data[pos : pos+8]\n\n\t// (filler) always 0x00 [1 byte]\n\tpos += 8 + 1\n\n\t// capability flags (lower 2 bytes) [2 bytes]\n\tmc.flags = clientFlag(binary.LittleEndian.Uint16(data[pos : pos+2]))\n\tif mc.flags&clientProtocol41 == 0 {\n\t\treturn nil, \"\", ErrOldProtocol\n\t}\n\tif mc.flags&clientSSL == 0 && mc.cfg.tls != nil {\n\t\tif mc.cfg.TLSConfig == \"preferred\" {\n\t\t\tmc.cfg.tls = nil\n\t\t} else {\n\t\t\treturn nil, \"\", ErrNoTLS\n\t\t}\n\t}\n\tpos += 2\n\n\tif len(data) > pos {\n\t\t// character set [1 byte]\n\t\t// status flags [2 bytes]\n\t\t// capability flags (upper 2 bytes) [2 bytes]\n\t\t// length of auth-plugin-data [1 byte]\n\t\t// reserved (all [00]) [10 bytes]\n\t\tpos += 1 + 2 + 2 + 1 + 10\n\n\t\t// second part of the password cipher [mininum 13 bytes],\n\t\t// where len=MAX(13, length of auth-plugin-data - 8)\n\t\t//\n\t\t// The web documentation is ambiguous about the length. However,\n\t\t// according to mysql-5.7/sql/auth/sql_authentication.cc line 538,\n\t\t// the 13th byte is \"\\0 byte, terminating the second part of\n\t\t// a scramble\". So the second part of the password cipher is\n\t\t// a NULL terminated string that's at least 13 bytes with the\n\t\t// last byte being NULL.\n\t\t//\n\t\t// The official Python library uses the fixed length 12\n\t\t// which seems to work but technically could have a hidden bug.\n\t\tauthData = append(authData, data[pos:pos+12]...)\n\t\tpos += 13\n\n\t\t// EOF if version (>= 5.5.7 and < 5.5.10) or (>= 5.6.0 and < 5.6.2)\n\t\t// \\NUL otherwise\n\t\tif end := bytes.IndexByte(data[pos:], 0x00); end != -1 {\n\t\t\tplugin = string(data[pos : pos+end])\n\t\t} else {\n\t\t\tplugin = string(data[pos:])\n\t\t}\n\n\t\t// make a memory safe copy of the cipher slice\n\t\tvar b [20]byte\n\t\tcopy(b[:], authData)\n\t\treturn b[:], plugin, nil\n\t}\n\n\t// make a memory safe copy of the cipher slice\n\tvar b [8]byte\n\tcopy(b[:], authData)\n\treturn b[:], plugin, nil\n}\n\n// Client Authentication Packet\n// http://dev.mysql.com/doc/internals/en/connection-phase-packets.html#packet-Protocol::HandshakeResponse\nfunc (mc *mysqlConn) writeHandshakeResponsePacket(authResp []byte, plugin string) error {\n\t// Adjust client flags based on server support\n\tclientFlags := clientProtocol41 |\n\t\tclientSecureConn |\n\t\tclientLongPassword |\n\t\tclientTransactions |\n\t\tclientLocalFiles |\n\t\tclientPluginAuth |\n\t\tclientMultiResults |\n\t\tmc.flags&clientLongFlag\n\n\tif mc.cfg.ClientFoundRows {\n\t\tclientFlags |= clientFoundRows\n\t}\n\n\t// To enable TLS / SSL\n\tif mc.cfg.tls != nil {\n\t\tclientFlags |= clientSSL\n\t}\n\n\tif mc.cfg.MultiStatements {\n\t\tclientFlags |= clientMultiStatements\n\t}\n\n\t// encode length of the auth plugin data\n\tvar authRespLEIBuf [9]byte\n\tauthRespLen := len(authResp)\n\tauthRespLEI := appendLengthEncodedInteger(authRespLEIBuf[:0], uint64(authRespLen))\n\tif len(authRespLEI) > 1 {\n\t\t// if the length can not be written in 1 byte, it must be written as a\n\t\t// length encoded integer\n\t\tclientFlags |= clientPluginAuthLenEncClientData\n\t}\n\n\tpktLen := 4 + 4 + 1 + 23 + len(mc.cfg.User) + 1 + len(authRespLEI) + len(authResp) + 21 + 1\n\n\t// To specify a db name\n\tif n := len(mc.cfg.DBName); n > 0 {\n\t\tclientFlags |= clientConnectWithDB\n\t\tpktLen += n + 1\n\t}\n\n\t// Calculate packet length and get buffer with that size\n\tdata, err := mc.buf.takeSmallBuffer(pktLen + 4)\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// ClientFlags [32 bit]\n\tdata[4] = byte(clientFlags)\n\tdata[5] = byte(clientFlags >> 8)\n\tdata[6] = byte(clientFlags >> 16)\n\tdata[7] = byte(clientFlags >> 24)\n\n\t// MaxPacketSize [32 bit] (none)\n\tdata[8] = 0x00\n\tdata[9] = 0x00\n\tdata[10] = 0x00\n\tdata[11] = 0x00\n\n\t// Charset [1 byte]\n\tvar found bool\n\tdata[12], found = collations[mc.cfg.Collation]\n\tif !found {\n\t\t// Note possibility for false negatives:\n\t\t// could be triggered although the collation is valid if the\n\t\t// collations map does not contain entries the server supports.\n\t\treturn errors.New(\"unknown collation\")\n\t}\n\n\t// SSL Connection Request Packet\n\t// http://dev.mysql.com/doc/internals/en/connection-phase-packets.html#packet-Protocol::SSLRequest\n\tif mc.cfg.tls != nil {\n\t\t// Send TLS / SSL request packet\n\t\tif err := mc.writePacket(data[:(4+4+1+23)+4]); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Switch to TLS\n\t\ttlsConn := tls.Client(mc.netConn, mc.cfg.tls)\n\t\tif err := tlsConn.Handshake(); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tmc.rawConn = mc.netConn\n\t\tmc.netConn = tlsConn\n\t\tmc.buf.nc = tlsConn\n\t}\n\n\t// Filler [23 bytes] (all 0x00)\n\tpos := 13\n\tfor ; pos < 13+23; pos++ {\n\t\tdata[pos] = 0\n\t}\n\n\t// User [null terminated string]\n\tif len(mc.cfg.User) > 0 {\n\t\tpos += copy(data[pos:], mc.cfg.User)\n\t}\n\tdata[pos] = 0x00\n\tpos++\n\n\t// Auth Data [length encoded integer]\n\tpos += copy(data[pos:], authRespLEI)\n\tpos += copy(data[pos:], authResp)\n\n\t// Databasename [null terminated string]\n\tif len(mc.cfg.DBName) > 0 {\n\t\tpos += copy(data[pos:], mc.cfg.DBName)\n\t\tdata[pos] = 0x00\n\t\tpos++\n\t}\n\n\tpos += copy(data[pos:], plugin)\n\tdata[pos] = 0x00\n\tpos++\n\n\t// Send Auth packet\n\treturn mc.writePacket(data[:pos])\n}\n\n// http://dev.mysql.com/doc/internals/en/connection-phase-packets.html#packet-Protocol::AuthSwitchResponse\nfunc (mc *mysqlConn) writeAuthSwitchPacket(authData []byte) error {\n\tpktLen := 4 + len(authData)\n\tdata, err := mc.buf.takeSmallBuffer(pktLen)\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// Add the auth data [EOF]\n\tcopy(data[4:], authData)\n\treturn mc.writePacket(data)\n}\n\n/******************************************************************************\n* Command Packets *\n******************************************************************************/\n\nfunc (mc *mysqlConn) writeCommandPacket(command byte) error {\n\t// Reset Packet Sequence\n\tmc.sequence = 0\n\n\tdata, err := mc.buf.takeSmallBuffer(4 + 1)\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// Add command byte\n\tdata[4] = command\n\n\t// Send CMD packet\n\treturn mc.writePacket(data)\n}\n\nfunc (mc *mysqlConn) writeCommandPacketStr(command byte, arg string) error {\n\t// Reset Packet Sequence\n\tmc.sequence = 0\n\n\tpktLen := 1 + len(arg)\n\tdata, err := mc.buf.takeBuffer(pktLen + 4)\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// Add command byte\n\tdata[4] = command\n\n\t// Add arg\n\tcopy(data[5:], arg)\n\n\t// Send CMD packet\n\treturn mc.writePacket(data)\n}\n\nfunc (mc *mysqlConn) writeCommandPacketUint32(command byte, arg uint32) error {\n\t// Reset Packet Sequence\n\tmc.sequence = 0\n\n\tdata, err := mc.buf.takeSmallBuffer(4 + 1 + 4)\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// Add command byte\n\tdata[4] = command\n\n\t// Add arg [32 bit]\n\tdata[5] = byte(arg)\n\tdata[6] = byte(arg >> 8)\n\tdata[7] = byte(arg >> 16)\n\tdata[8] = byte(arg >> 24)\n\n\t// Send CMD packet\n\treturn mc.writePacket(data)\n}\n\n/******************************************************************************\n* Result Packets *\n******************************************************************************/\n\nfunc (mc *mysqlConn) readAuthResult() ([]byte, string, error) {\n\tdata, err := mc.readPacket()\n\tif err != nil {\n\t\treturn nil, \"\", err\n\t}\n\n\t// packet indicator\n\tswitch data[0] {\n\n\tcase iOK:\n\t\treturn nil, \"\", mc.handleOkPacket(data)\n\n\tcase iAuthMoreData:\n\t\treturn data[1:], \"\", err\n\n\tcase iEOF:\n\t\tif len(data) == 1 {\n\t\t\t// https://dev.mysql.com/doc/internals/en/connection-phase-packets.html#packet-Protocol::OldAuthSwitchRequest\n\t\t\treturn nil, \"mysql_old_password\", nil\n\t\t}\n\t\tpluginEndIndex := bytes.IndexByte(data, 0x00)\n\t\tif pluginEndIndex < 0 {\n\t\t\treturn nil, \"\", ErrMalformPkt\n\t\t}\n\t\tplugin := string(data[1:pluginEndIndex])\n\t\tauthData := data[pluginEndIndex+1:]\n\t\treturn authData, plugin, nil\n\n\tdefault: // Error otherwise\n\t\treturn nil, \"\", mc.handleErrorPacket(data)\n\t}\n}\n\n// Returns error if Packet is not an 'Result OK'-Packet\nfunc (mc *mysqlConn) readResultOK() error {\n\tdata, err := mc.readPacket()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif data[0] == iOK {\n\t\treturn mc.handleOkPacket(data)\n\t}\n\treturn mc.handleErrorPacket(data)\n}\n\n// Result Set Header Packet\n// http://dev.mysql.com/doc/internals/en/com-query-response.html#packet-ProtocolText::Resultset\nfunc (mc *mysqlConn) readResultSetHeaderPacket() (int, error) {\n\tdata, err := mc.readPacket()\n\tif err == nil {\n\t\tswitch data[0] {\n\n\t\tcase iOK:\n\t\t\treturn 0, mc.handleOkPacket(data)\n\n\t\tcase iERR:\n\t\t\treturn 0, mc.handleErrorPacket(data)\n\n\t\tcase iLocalInFile:\n\t\t\treturn 0, mc.handleInFileRequest(string(data[1:]))\n\t\t}\n\n\t\t// column count\n\t\tnum, _, n := readLengthEncodedInteger(data)\n\t\tif n-len(data) == 0 {\n\t\t\treturn int(num), nil\n\t\t}\n\n\t\treturn 0, ErrMalformPkt\n\t}\n\treturn 0, err\n}\n\n// Error Packet\n// http://dev.mysql.com/doc/internals/en/generic-response-packets.html#packet-ERR_Packet\nfunc (mc *mysqlConn) handleErrorPacket(data []byte) error {\n\tif data[0] != iERR {\n\t\treturn ErrMalformPkt\n\t}\n\n\t// 0xff [1 byte]\n\n\t// Error Number [16 bit uint]\n\terrno := binary.LittleEndian.Uint16(data[1:3])\n\n\t// 1792: ER_CANT_EXECUTE_IN_READ_ONLY_TRANSACTION\n\t// 1290: ER_OPTION_PREVENTS_STATEMENT (returned by Aurora during failover)\n\tif (errno == 1792 || errno == 1290) && mc.cfg.RejectReadOnly {\n\t\t// Oops; we are connected to a read-only connection, and won't be able\n\t\t// to issue any write statements. Since RejectReadOnly is configured,\n\t\t// we throw away this connection hoping this one would have write\n\t\t// permission. This is specifically for a possible race condition\n\t\t// during failover (e.g. on AWS Aurora). See README.md for more.\n\t\t//\n\t\t// We explicitly close the connection before returning\n\t\t// driver.ErrBadConn to ensure that `database/sql` purges this\n\t\t// connection and initiates a new one for next statement next time.\n\t\tmc.Close()\n\t\treturn driver.ErrBadConn\n\t}\n\n\tpos := 3\n\n\t// SQL State [optional: # + 5bytes string]\n\tif data[3] == 0x23 {\n\t\t//sqlstate := string(data[4 : 4+5])\n\t\tpos = 9\n\t}\n\n\t// Error Message [string]\n\treturn &MySQLError{\n\t\tNumber: errno,\n\t\tMessage: string(data[pos:]),\n\t}\n}\n\nfunc readStatus(b []byte) statusFlag {\n\treturn statusFlag(b[0]) | statusFlag(b[1])<<8\n}\n\n// Ok Packet\n// http://dev.mysql.com/doc/internals/en/generic-response-packets.html#packet-OK_Packet\nfunc (mc *mysqlConn) handleOkPacket(data []byte) error {\n\tvar n, m int\n\n\t// 0x00 [1 byte]\n\n\t// Affected rows [Length Coded Binary]\n\tmc.affectedRows, _, n = readLengthEncodedInteger(data[1:])\n\n\t// Insert id [Length Coded Binary]\n\tmc.insertId, _, m = readLengthEncodedInteger(data[1+n:])\n\n\t// server_status [2 bytes]\n\tmc.status = readStatus(data[1+n+m : 1+n+m+2])\n\tif mc.status&statusMoreResultsExists != 0 {\n\t\treturn nil\n\t}\n\n\t// warning count [2 bytes]\n\n\treturn nil\n}\n\n// Read Packets as Field Packets until EOF-Packet or an Error appears\n// http://dev.mysql.com/doc/internals/en/com-query-response.html#packet-Protocol::ColumnDefinition41\nfunc (mc *mysqlConn) readColumns(count int) ([]mysqlField, error) {\n\tcolumns := make([]mysqlField, count)\n\n\tfor i := 0; ; i++ {\n\t\tdata, err := mc.readPacket()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// EOF Packet\n\t\tif data[0] == iEOF && (len(data) == 5 || len(data) == 1) {\n\t\t\tif i == count {\n\t\t\t\treturn columns, nil\n\t\t\t}\n\t\t\treturn nil, fmt.Errorf(\"column count mismatch n:%d len:%d\", count, len(columns))\n\t\t}\n\n\t\t// Catalog\n\t\tpos, err := skipLengthEncodedString(data)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// Database [len coded string]\n\t\tn, err := skipLengthEncodedString(data[pos:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tpos += n\n\n\t\t// Table [len coded string]\n\t\tif mc.cfg.ColumnsWithAlias {\n\t\t\ttableName, _, n, err := readLengthEncodedString(data[pos:])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tpos += n\n\t\t\tcolumns[i].tableName = string(tableName)\n\t\t} else {\n\t\t\tn, err = skipLengthEncodedString(data[pos:])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tpos += n\n\t\t}\n\n\t\t// Original table [len coded string]\n\t\tn, err = skipLengthEncodedString(data[pos:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tpos += n\n\n\t\t// Name [len coded string]\n\t\tname, _, n, err := readLengthEncodedString(data[pos:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tcolumns[i].name = string(name)\n\t\tpos += n\n\n\t\t// Original name [len coded string]\n\t\tn, err = skipLengthEncodedString(data[pos:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tpos += n\n\n\t\t// Filler [uint8]\n\t\tpos++\n\n\t\t// Charset [charset, collation uint8]\n\t\tcolumns[i].charSet = data[pos]\n\t\tpos += 2\n\n\t\t// Length [uint32]\n\t\tcolumns[i].length = binary.LittleEndian.Uint32(data[pos : pos+4])\n\t\tpos += 4\n\n\t\t// Field type [uint8]\n\t\tcolumns[i].fieldType = fieldType(data[pos])\n\t\tpos++\n\n\t\t// Flags [uint16]\n\t\tcolumns[i].flags = fieldFlag(binary.LittleEndian.Uint16(data[pos : pos+2]))\n\t\tpos += 2\n\n\t\t// Decimals [uint8]\n\t\tcolumns[i].decimals = data[pos]\n\t\t//pos++\n\n\t\t// Default value [len coded binary]\n\t\t//if pos < len(data) {\n\t\t//\tdefaultVal, _, err = bytesToLengthCodedBinary(data[pos:])\n\t\t//}\n\t}\n}\n\n// Read Packets as Field Packets until EOF-Packet or an Error appears\n// http://dev.mysql.com/doc/internals/en/com-query-response.html#packet-ProtocolText::ResultsetRow\nfunc (rows *textRows) readRow(dest []driver.Value) error {\n\tmc := rows.mc\n\n\tif rows.rs.done {\n\t\treturn io.EOF\n\t}\n\n\tdata, err := mc.readPacket()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// EOF Packet\n\tif data[0] == iEOF && len(data) == 5 {\n\t\t// server_status [2 bytes]\n\t\trows.mc.status = readStatus(data[3:])\n\t\trows.rs.done = true\n\t\tif !rows.HasNextResultSet() {\n\t\t\trows.mc = nil\n\t\t}\n\t\treturn io.EOF\n\t}\n\tif data[0] == iERR {\n\t\trows.mc = nil\n\t\treturn mc.handleErrorPacket(data)\n\t}\n\n\t// RowSet Packet\n\tvar n int\n\tvar isNull bool\n\tpos := 0\n\n\tfor i := range dest {\n\t\t// Read bytes and convert to string\n\t\tdest[i], isNull, n, err = readLengthEncodedString(data[pos:])\n\t\tpos += n\n\t\tif err == nil {\n\t\t\tif !isNull {\n\t\t\t\tif !mc.parseTime {\n\t\t\t\t\tcontinue\n\t\t\t\t} else {\n\t\t\t\t\tswitch rows.rs.columns[i].fieldType {\n\t\t\t\t\tcase fieldTypeTimestamp, fieldTypeDateTime,\n\t\t\t\t\t\tfieldTypeDate, fieldTypeNewDate:\n\t\t\t\t\t\tdest[i], err = parseDateTime(\n\t\t\t\t\t\t\tstring(dest[i].([]byte)),\n\t\t\t\t\t\t\tmc.cfg.Loc,\n\t\t\t\t\t\t)\n\t\t\t\t\t\tif err == nil {\n\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t}\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tdest[i] = nil\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\treturn err // err != nil\n\t}\n\n\treturn nil\n}\n\n// Reads Packets until EOF-Packet or an Error appears. Returns count of Packets read\nfunc (mc *mysqlConn) readUntilEOF() error {\n\tfor {\n\t\tdata, err := mc.readPacket()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tswitch data[0] {\n\t\tcase iERR:\n\t\t\treturn mc.handleErrorPacket(data)\n\t\tcase iEOF:\n\t\t\tif len(data) == 5 {\n\t\t\t\tmc.status = readStatus(data[3:])\n\t\t\t}\n\t\t\treturn nil\n\t\t}\n\t}\n}\n\n/******************************************************************************\n* Prepared Statements *\n******************************************************************************/\n\n// Prepare Result Packets\n// http://dev.mysql.com/doc/internals/en/com-stmt-prepare-response.html\nfunc (stmt *mysqlStmt) readPrepareResultPacket() (uint16, error) {\n\tdata, err := stmt.mc.readPacket()\n\tif err == nil {\n\t\t// packet indicator [1 byte]\n\t\tif data[0] != iOK {\n\t\t\treturn 0, stmt.mc.handleErrorPacket(data)\n\t\t}\n\n\t\t// statement id [4 bytes]\n\t\tstmt.id = binary.LittleEndian.Uint32(data[1:5])\n\n\t\t// Column count [16 bit uint]\n\t\tcolumnCount := binary.LittleEndian.Uint16(data[5:7])\n\n\t\t// Param count [16 bit uint]\n\t\tstmt.paramCount = int(binary.LittleEndian.Uint16(data[7:9]))\n\n\t\t// Reserved [8 bit]\n\n\t\t// Warning count [16 bit uint]\n\n\t\treturn columnCount, nil\n\t}\n\treturn 0, err\n}\n\n// http://dev.mysql.com/doc/internals/en/com-stmt-send-long-data.html\nfunc (stmt *mysqlStmt) writeCommandLongData(paramID int, arg []byte) error {\n\tmaxLen := stmt.mc.maxAllowedPacket - 1\n\tpktLen := maxLen\n\n\t// After the header (bytes 0-3) follows before the data:\n\t// 1 byte command\n\t// 4 bytes stmtID\n\t// 2 bytes paramID\n\tconst dataOffset = 1 + 4 + 2\n\n\t// Cannot use the write buffer since\n\t// a) the buffer is too small\n\t// b) it is in use\n\tdata := make([]byte, 4+1+4+2+len(arg))\n\n\tcopy(data[4+dataOffset:], arg)\n\n\tfor argLen := len(arg); argLen > 0; argLen -= pktLen - dataOffset {\n\t\tif dataOffset+argLen < maxLen {\n\t\t\tpktLen = dataOffset + argLen\n\t\t}\n\n\t\tstmt.mc.sequence = 0\n\t\t// Add command byte [1 byte]\n\t\tdata[4] = comStmtSendLongData\n\n\t\t// Add stmtID [32 bit]\n\t\tdata[5] = byte(stmt.id)\n\t\tdata[6] = byte(stmt.id >> 8)\n\t\tdata[7] = byte(stmt.id >> 16)\n\t\tdata[8] = byte(stmt.id >> 24)\n\n\t\t// Add paramID [16 bit]\n\t\tdata[9] = byte(paramID)\n\t\tdata[10] = byte(paramID >> 8)\n\n\t\t// Send CMD packet\n\t\terr := stmt.mc.writePacket(data[:4+pktLen])\n\t\tif err == nil {\n\t\t\tdata = data[pktLen-dataOffset:]\n\t\t\tcontinue\n\t\t}\n\t\treturn err\n\n\t}\n\n\t// Reset Packet Sequence\n\tstmt.mc.sequence = 0\n\treturn nil\n}\n\n// Execute Prepared Statement\n// http://dev.mysql.com/doc/internals/en/com-stmt-execute.html\nfunc (stmt *mysqlStmt) writeExecutePacket(args []driver.Value) error {\n\tif len(args) != stmt.paramCount {\n\t\treturn fmt.Errorf(\n\t\t\t\"argument count mismatch (got: %d; has: %d)\",\n\t\t\tlen(args),\n\t\t\tstmt.paramCount,\n\t\t)\n\t}\n\n\tconst minPktLen = 4 + 1 + 4 + 1 + 4\n\tmc := stmt.mc\n\n\t// Determine threshold dynamically to avoid packet size shortage.\n\tlongDataSize := mc.maxAllowedPacket / (stmt.paramCount + 1)\n\tif longDataSize < 64 {\n\t\tlongDataSize = 64\n\t}\n\n\t// Reset packet-sequence\n\tmc.sequence = 0\n\n\tvar data []byte\n\tvar err error\n\n\tif len(args) == 0 {\n\t\tdata, err = mc.buf.takeBuffer(minPktLen)\n\t} else {\n\t\tdata, err = mc.buf.takeCompleteBuffer()\n\t\t// In this case the len(data) == cap(data) which is used to optimise the flow below.\n\t}\n\tif err != nil {\n\t\t// cannot take the buffer. Something must be wrong with the connection\n\t\terrLog.Print(err)\n\t\treturn errBadConnNoWrite\n\t}\n\n\t// command [1 byte]\n\tdata[4] = comStmtExecute\n\n\t// statement_id [4 bytes]\n\tdata[5] = byte(stmt.id)\n\tdata[6] = byte(stmt.id >> 8)\n\tdata[7] = byte(stmt.id >> 16)\n\tdata[8] = byte(stmt.id >> 24)\n\n\t// flags (0: CURSOR_TYPE_NO_CURSOR) [1 byte]\n\tdata[9] = 0x00\n\n\t// iteration_count (uint32(1)) [4 bytes]\n\tdata[10] = 0x01\n\tdata[11] = 0x00\n\tdata[12] = 0x00\n\tdata[13] = 0x00\n\n\tif len(args) > 0 {\n\t\tpos := minPktLen\n\n\t\tvar nullMask []byte\n\t\tif maskLen, typesLen := (len(args)+7)/8, 1+2*len(args); pos+maskLen+typesLen >= cap(data) {\n\t\t\t// buffer has to be extended but we don't know by how much so\n\t\t\t// we depend on append after all data with known sizes fit.\n\t\t\t// We stop at that because we deal with a lot of columns here\n\t\t\t// which makes the required allocation size hard to guess.\n\t\t\ttmp := make([]byte, pos+maskLen+typesLen)\n\t\t\tcopy(tmp[:pos], data[:pos])\n\t\t\tdata = tmp\n\t\t\tnullMask = data[pos : pos+maskLen]\n\t\t\t// No need to clean nullMask as make ensures that.\n\t\t\tpos += maskLen\n\t\t} else {\n\t\t\tnullMask = data[pos : pos+maskLen]\n\t\t\tfor i := range nullMask {\n\t\t\t\tnullMask[i] = 0\n\t\t\t}\n\t\t\tpos += maskLen\n\t\t}\n\n\t\t// newParameterBoundFlag 1 [1 byte]\n\t\tdata[pos] = 0x01\n\t\tpos++\n\n\t\t// type of each parameter [len(args)*2 bytes]\n\t\tparamTypes := data[pos:]\n\t\tpos += len(args) * 2\n\n\t\t// value of each parameter [n bytes]\n\t\tparamValues := data[pos:pos]\n\t\tvaluesCap := cap(paramValues)\n\n\t\tfor i, arg := range args {\n\t\t\t// build NULL-bitmap\n\t\t\tif arg == nil {\n\t\t\t\tnullMask[i/8] |= 1 << (uint(i) & 7)\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeNULL)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// cache types and values\n\t\t\tswitch v := arg.(type) {\n\t\t\tcase int64:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeLongLong)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\tif cap(paramValues)-len(paramValues)-8 >= 0 {\n\t\t\t\t\tparamValues = paramValues[:len(paramValues)+8]\n\t\t\t\t\tbinary.LittleEndian.PutUint64(\n\t\t\t\t\t\tparamValues[len(paramValues)-8:],\n\t\t\t\t\t\tuint64(v),\n\t\t\t\t\t)\n\t\t\t\t} else {\n\t\t\t\t\tparamValues = append(paramValues,\n\t\t\t\t\t\tuint64ToBytes(uint64(v))...,\n\t\t\t\t\t)\n\t\t\t\t}\n\n\t\t\tcase uint64:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeLongLong)\n\t\t\t\tparamTypes[i+i+1] = 0x80 // type is unsigned\n\n\t\t\t\tif cap(paramValues)-len(paramValues)-8 >= 0 {\n\t\t\t\t\tparamValues = paramValues[:len(paramValues)+8]\n\t\t\t\t\tbinary.LittleEndian.PutUint64(\n\t\t\t\t\t\tparamValues[len(paramValues)-8:],\n\t\t\t\t\t\tuint64(v),\n\t\t\t\t\t)\n\t\t\t\t} else {\n\t\t\t\t\tparamValues = append(paramValues,\n\t\t\t\t\t\tuint64ToBytes(uint64(v))...,\n\t\t\t\t\t)\n\t\t\t\t}\n\n\t\t\tcase float64:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeDouble)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\tif cap(paramValues)-len(paramValues)-8 >= 0 {\n\t\t\t\t\tparamValues = paramValues[:len(paramValues)+8]\n\t\t\t\t\tbinary.LittleEndian.PutUint64(\n\t\t\t\t\t\tparamValues[len(paramValues)-8:],\n\t\t\t\t\t\tmath.Float64bits(v),\n\t\t\t\t\t)\n\t\t\t\t} else {\n\t\t\t\t\tparamValues = append(paramValues,\n\t\t\t\t\t\tuint64ToBytes(math.Float64bits(v))...,\n\t\t\t\t\t)\n\t\t\t\t}\n\n\t\t\tcase bool:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeTiny)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\tif v {\n\t\t\t\t\tparamValues = append(paramValues, 0x01)\n\t\t\t\t} else {\n\t\t\t\t\tparamValues = append(paramValues, 0x00)\n\t\t\t\t}\n\n\t\t\tcase []byte:\n\t\t\t\t// Common case (non-nil value) first\n\t\t\t\tif v != nil {\n\t\t\t\t\tparamTypes[i+i] = byte(fieldTypeString)\n\t\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\t\tif len(v) < longDataSize {\n\t\t\t\t\t\tparamValues = appendLengthEncodedInteger(paramValues,\n\t\t\t\t\t\t\tuint64(len(v)),\n\t\t\t\t\t\t)\n\t\t\t\t\t\tparamValues = append(paramValues, v...)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif err := stmt.writeCommandLongData(i, v); err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\t\t// Handle []byte(nil) as a NULL value\n\t\t\t\tnullMask[i/8] |= 1 << (uint(i) & 7)\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeNULL)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\tcase string:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeString)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\tif len(v) < longDataSize {\n\t\t\t\t\tparamValues = appendLengthEncodedInteger(paramValues,\n\t\t\t\t\t\tuint64(len(v)),\n\t\t\t\t\t)\n\t\t\t\t\tparamValues = append(paramValues, v...)\n\t\t\t\t} else {\n\t\t\t\t\tif err := stmt.writeCommandLongData(i, []byte(v)); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase time.Time:\n\t\t\t\tparamTypes[i+i] = byte(fieldTypeString)\n\t\t\t\tparamTypes[i+i+1] = 0x00\n\n\t\t\t\tvar a [64]byte\n\t\t\t\tvar b = a[:0]\n\n\t\t\t\tif v.IsZero() {\n\t\t\t\t\tb = append(b, \"0000-00-00\"...)\n\t\t\t\t} else {\n\t\t\t\t\tb = v.In(mc.cfg.Loc).AppendFormat(b, timeFormat)\n\t\t\t\t}\n\n\t\t\t\tparamValues = appendLengthEncodedInteger(paramValues,\n\t\t\t\t\tuint64(len(b)),\n\t\t\t\t)\n\t\t\t\tparamValues = append(paramValues, b...)\n\n\t\t\tdefault:\n\t\t\t\treturn fmt.Errorf(\"cannot convert type: %T\", arg)\n\t\t\t}\n\t\t}\n\n\t\t// Check if param values exceeded the available buffer\n\t\t// In that case we must build the data packet with the new values buffer\n\t\tif valuesCap != cap(paramValues) {\n\t\t\tdata = append(data[:pos], paramValues...)\n\t\t\tif err = mc.buf.store(data); err != nil {\n\t\t\t\terrLog.Print(err)\n\t\t\t\treturn errBadConnNoWrite\n\t\t\t}\n\t\t}\n\n\t\tpos += len(paramValues)\n\t\tdata = data[:pos]\n\t}\n\n\treturn mc.writePacket(data)\n}\n\nfunc (mc *mysqlConn) discardResults() error {\n\tfor mc.status&statusMoreResultsExists != 0 {\n\t\tresLen, err := mc.readResultSetHeaderPacket()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif resLen > 0 {\n\t\t\t// columns\n\t\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\t// rows\n\t\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// http://dev.mysql.com/doc/internals/en/binary-protocol-resultset-row.html\nfunc (rows *binaryRows) readRow(dest []driver.Value) error {\n\tdata, err := rows.mc.readPacket()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// packet indicator [1 byte]\n\tif data[0] != iOK {\n\t\t// EOF Packet\n\t\tif data[0] == iEOF && len(data) == 5 {\n\t\t\trows.mc.status = readStatus(data[3:])\n\t\t\trows.rs.done = true\n\t\t\tif !rows.HasNextResultSet() {\n\t\t\t\trows.mc = nil\n\t\t\t}\n\t\t\treturn io.EOF\n\t\t}\n\t\tmc := rows.mc\n\t\trows.mc = nil\n\n\t\t// Error otherwise\n\t\treturn mc.handleErrorPacket(data)\n\t}\n\n\t// NULL-bitmap, [(column-count + 7 + 2) / 8 bytes]\n\tpos := 1 + (len(dest)+7+2)>>3\n\tnullMask := data[1:pos]\n\n\tfor i := range dest {\n\t\t// Field is NULL\n\t\t// (byte >> bit-pos) % 2 == 1\n\t\tif ((nullMask[(i+2)>>3] >> uint((i+2)&7)) & 1) == 1 {\n\t\t\tdest[i] = nil\n\t\t\tcontinue\n\t\t}\n\n\t\t// Convert to byte-coded string\n\t\tswitch rows.rs.columns[i].fieldType {\n\t\tcase fieldTypeNULL:\n\t\t\tdest[i] = nil\n\t\t\tcontinue\n\n\t\t// Numeric Types\n\t\tcase fieldTypeTiny:\n\t\t\tif rows.rs.columns[i].flags&flagUnsigned != 0 {\n\t\t\t\tdest[i] = int64(data[pos])\n\t\t\t} else {\n\t\t\t\tdest[i] = int64(int8(data[pos]))\n\t\t\t}\n\t\t\tpos++\n\t\t\tcontinue\n\n\t\tcase fieldTypeShort, fieldTypeYear:\n\t\t\tif rows.rs.columns[i].flags&flagUnsigned != 0 {\n\t\t\t\tdest[i] = int64(binary.LittleEndian.Uint16(data[pos : pos+2]))\n\t\t\t} else {\n\t\t\t\tdest[i] = int64(int16(binary.LittleEndian.Uint16(data[pos : pos+2])))\n\t\t\t}\n\t\t\tpos += 2\n\t\t\tcontinue\n\n\t\tcase fieldTypeInt24, fieldTypeLong:\n\t\t\tif rows.rs.columns[i].flags&flagUnsigned != 0 {\n\t\t\t\tdest[i] = int64(binary.LittleEndian.Uint32(data[pos : pos+4]))\n\t\t\t} else {\n\t\t\t\tdest[i] = int64(int32(binary.LittleEndian.Uint32(data[pos : pos+4])))\n\t\t\t}\n\t\t\tpos += 4\n\t\t\tcontinue\n\n\t\tcase fieldTypeLongLong:\n\t\t\tif rows.rs.columns[i].flags&flagUnsigned != 0 {\n\t\t\t\tval := binary.LittleEndian.Uint64(data[pos : pos+8])\n\t\t\t\tif val > math.MaxInt64 {\n\t\t\t\t\tdest[i] = uint64ToString(val)\n\t\t\t\t} else {\n\t\t\t\t\tdest[i] = int64(val)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdest[i] = int64(binary.LittleEndian.Uint64(data[pos : pos+8]))\n\t\t\t}\n\t\t\tpos += 8\n\t\t\tcontinue\n\n\t\tcase fieldTypeFloat:\n\t\t\tdest[i] = math.Float32frombits(binary.LittleEndian.Uint32(data[pos : pos+4]))\n\t\t\tpos += 4\n\t\t\tcontinue\n\n\t\tcase fieldTypeDouble:\n\t\t\tdest[i] = math.Float64frombits(binary.LittleEndian.Uint64(data[pos : pos+8]))\n\t\t\tpos += 8\n\t\t\tcontinue\n\n\t\t// Length coded Binary Strings\n\t\tcase fieldTypeDecimal, fieldTypeNewDecimal, fieldTypeVarChar,\n\t\t\tfieldTypeBit, fieldTypeEnum, fieldTypeSet, fieldTypeTinyBLOB,\n\t\t\tfieldTypeMediumBLOB, fieldTypeLongBLOB, fieldTypeBLOB,\n\t\t\tfieldTypeVarString, fieldTypeString, fieldTypeGeometry, fieldTypeJSON:\n\t\t\tvar isNull bool\n\t\t\tvar n int\n\t\t\tdest[i], isNull, n, err = readLengthEncodedString(data[pos:])\n\t\t\tpos += n\n\t\t\tif err == nil {\n\t\t\t\tif !isNull {\n\t\t\t\t\tcontinue\n\t\t\t\t} else {\n\t\t\t\t\tdest[i] = nil\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn err\n\n\t\tcase\n\t\t\tfieldTypeDate, fieldTypeNewDate, // Date YYYY-MM-DD\n\t\t\tfieldTypeTime, // Time [-][H]HH:MM:SS[.fractal]\n\t\t\tfieldTypeTimestamp, fieldTypeDateTime: // Timestamp YYYY-MM-DD HH:MM:SS[.fractal]\n\n\t\t\tnum, isNull, n := readLengthEncodedInteger(data[pos:])\n\t\t\tpos += n\n\n\t\t\tswitch {\n\t\t\tcase isNull:\n\t\t\t\tdest[i] = nil\n\t\t\t\tcontinue\n\t\t\tcase rows.rs.columns[i].fieldType == fieldTypeTime:\n\t\t\t\t// database/sql does not support an equivalent to TIME, return a string\n\t\t\t\tvar dstlen uint8\n\t\t\t\tswitch decimals := rows.rs.columns[i].decimals; decimals {\n\t\t\t\tcase 0x00, 0x1f:\n\t\t\t\t\tdstlen = 8\n\t\t\t\tcase 1, 2, 3, 4, 5, 6:\n\t\t\t\t\tdstlen = 8 + 1 + decimals\n\t\t\t\tdefault:\n\t\t\t\t\treturn fmt.Errorf(\n\t\t\t\t\t\t\"protocol error, illegal decimals value %d\",\n\t\t\t\t\t\trows.rs.columns[i].decimals,\n\t\t\t\t\t)\n\t\t\t\t}\n\t\t\t\tdest[i], err = formatBinaryTime(data[pos:pos+int(num)], dstlen)\n\t\t\tcase rows.mc.parseTime:\n\t\t\t\tdest[i], err = parseBinaryDateTime(num, data[pos:], rows.mc.cfg.Loc)\n\t\t\tdefault:\n\t\t\t\tvar dstlen uint8\n\t\t\t\tif rows.rs.columns[i].fieldType == fieldTypeDate {\n\t\t\t\t\tdstlen = 10\n\t\t\t\t} else {\n\t\t\t\t\tswitch decimals := rows.rs.columns[i].decimals; decimals {\n\t\t\t\t\tcase 0x00, 0x1f:\n\t\t\t\t\t\tdstlen = 19\n\t\t\t\t\tcase 1, 2, 3, 4, 5, 6:\n\t\t\t\t\t\tdstlen = 19 + 1 + decimals\n\t\t\t\t\tdefault:\n\t\t\t\t\t\treturn fmt.Errorf(\n\t\t\t\t\t\t\t\"protocol error, illegal decimals value %d\",\n\t\t\t\t\t\t\trows.rs.columns[i].decimals,\n\t\t\t\t\t\t)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdest[i], err = formatBinaryDateTime(data[pos:pos+int(num)], dstlen)\n\t\t\t}\n\n\t\t\tif err == nil {\n\t\t\t\tpos += int(num)\n\t\t\t\tcontinue\n\t\t\t} else {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t// Please report if this happens!\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"unknown field type %d\", rows.rs.columns[i].fieldType)\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/result.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\ntype mysqlResult struct {\n\taffectedRows int64\n\tinsertId int64\n}\n\nfunc (res *mysqlResult) LastInsertId() (int64, error) {\n\treturn res.insertId, nil\n}\n\nfunc (res *mysqlResult) RowsAffected() (int64, error) {\n\treturn res.affectedRows, nil\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/rows.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"database/sql/driver\"\n\t\"io\"\n\t\"math\"\n\t\"reflect\"\n)\n\ntype resultSet struct {\n\tcolumns []mysqlField\n\tcolumnNames []string\n\tdone bool\n}\n\ntype mysqlRows struct {\n\tmc *mysqlConn\n\trs resultSet\n\tfinish func()\n}\n\ntype binaryRows struct {\n\tmysqlRows\n}\n\ntype textRows struct {\n\tmysqlRows\n}\n\nfunc (rows *mysqlRows) Columns() []string {\n\tif rows.rs.columnNames != nil {\n\t\treturn rows.rs.columnNames\n\t}\n\n\tcolumns := make([]string, len(rows.rs.columns))\n\tif rows.mc != nil && rows.mc.cfg.ColumnsWithAlias {\n\t\tfor i := range columns {\n\t\t\tif tableName := rows.rs.columns[i].tableName; len(tableName) > 0 {\n\t\t\t\tcolumns[i] = tableName + \".\" + rows.rs.columns[i].name\n\t\t\t} else {\n\t\t\t\tcolumns[i] = rows.rs.columns[i].name\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor i := range columns {\n\t\t\tcolumns[i] = rows.rs.columns[i].name\n\t\t}\n\t}\n\n\trows.rs.columnNames = columns\n\treturn columns\n}\n\nfunc (rows *mysqlRows) ColumnTypeDatabaseTypeName(i int) string {\n\treturn rows.rs.columns[i].typeDatabaseName()\n}\n\n// func (rows *mysqlRows) ColumnTypeLength(i int) (length int64, ok bool) {\n// \treturn int64(rows.rs.columns[i].length), true\n// }\n\nfunc (rows *mysqlRows) ColumnTypeNullable(i int) (nullable, ok bool) {\n\treturn rows.rs.columns[i].flags&flagNotNULL == 0, true\n}\n\nfunc (rows *mysqlRows) ColumnTypePrecisionScale(i int) (int64, int64, bool) {\n\tcolumn := rows.rs.columns[i]\n\tdecimals := int64(column.decimals)\n\n\tswitch column.fieldType {\n\tcase fieldTypeDecimal, fieldTypeNewDecimal:\n\t\tif decimals > 0 {\n\t\t\treturn int64(column.length) - 2, decimals, true\n\t\t}\n\t\treturn int64(column.length) - 1, decimals, true\n\tcase fieldTypeTimestamp, fieldTypeDateTime, fieldTypeTime:\n\t\treturn decimals, decimals, true\n\tcase fieldTypeFloat, fieldTypeDouble:\n\t\tif decimals == 0x1f {\n\t\t\treturn math.MaxInt64, math.MaxInt64, true\n\t\t}\n\t\treturn math.MaxInt64, decimals, true\n\t}\n\n\treturn 0, 0, false\n}\n\nfunc (rows *mysqlRows) ColumnTypeScanType(i int) reflect.Type {\n\treturn rows.rs.columns[i].scanType()\n}\n\nfunc (rows *mysqlRows) Close() (err error) {\n\tif f := rows.finish; f != nil {\n\t\tf()\n\t\trows.finish = nil\n\t}\n\n\tmc := rows.mc\n\tif mc == nil {\n\t\treturn nil\n\t}\n\tif err := mc.error(); err != nil {\n\t\treturn err\n\t}\n\n\t// flip the buffer for this connection if we need to drain it.\n\t// note that for a successful query (i.e. one where rows.next()\n\t// has been called until it returns false), `rows.mc` will be nil\n\t// by the time the user calls `(*Rows).Close`, so we won't reach this\n\t// see: https://github.com/golang/go/commit/651ddbdb5056ded455f47f9c494c67b389622a47\n\tmc.buf.flip()\n\n\t// Remove unread packets from stream\n\tif !rows.rs.done {\n\t\terr = mc.readUntilEOF()\n\t}\n\tif err == nil {\n\t\tif err = mc.discardResults(); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\trows.mc = nil\n\treturn err\n}\n\nfunc (rows *mysqlRows) HasNextResultSet() (b bool) {\n\tif rows.mc == nil {\n\t\treturn false\n\t}\n\treturn rows.mc.status&statusMoreResultsExists != 0\n}\n\nfunc (rows *mysqlRows) nextResultSet() (int, error) {\n\tif rows.mc == nil {\n\t\treturn 0, io.EOF\n\t}\n\tif err := rows.mc.error(); err != nil {\n\t\treturn 0, err\n\t}\n\n\t// Remove unread packets from stream\n\tif !rows.rs.done {\n\t\tif err := rows.mc.readUntilEOF(); err != nil {\n\t\t\treturn 0, err\n\t\t}\n\t\trows.rs.done = true\n\t}\n\n\tif !rows.HasNextResultSet() {\n\t\trows.mc = nil\n\t\treturn 0, io.EOF\n\t}\n\trows.rs = resultSet{}\n\treturn rows.mc.readResultSetHeaderPacket()\n}\n\nfunc (rows *mysqlRows) nextNotEmptyResultSet() (int, error) {\n\tfor {\n\t\tresLen, err := rows.nextResultSet()\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\n\t\tif resLen > 0 {\n\t\t\treturn resLen, nil\n\t\t}\n\n\t\trows.rs.done = true\n\t}\n}\n\nfunc (rows *binaryRows) NextResultSet() error {\n\tresLen, err := rows.nextNotEmptyResultSet()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\trows.rs.columns, err = rows.mc.readColumns(resLen)\n\treturn err\n}\n\nfunc (rows *binaryRows) Next(dest []driver.Value) error {\n\tif mc := rows.mc; mc != nil {\n\t\tif err := mc.error(); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Fetch next row from stream\n\t\treturn rows.readRow(dest)\n\t}\n\treturn io.EOF\n}\n\nfunc (rows *textRows) NextResultSet() (err error) {\n\tresLen, err := rows.nextNotEmptyResultSet()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\trows.rs.columns, err = rows.mc.readColumns(resLen)\n\treturn err\n}\n\nfunc (rows *textRows) Next(dest []driver.Value) error {\n\tif mc := rows.mc; mc != nil {\n\t\tif err := mc.error(); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Fetch next row from stream\n\t\treturn rows.readRow(dest)\n\t}\n\treturn io.EOF\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/statement.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"database/sql/driver\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n)\n\ntype mysqlStmt struct {\n\tmc *mysqlConn\n\tid uint32\n\tparamCount int\n}\n\nfunc (stmt *mysqlStmt) Close() error {\n\tif stmt.mc == nil || stmt.mc.closed.IsSet() {\n\t\t// driver.Stmt.Close can be called more than once, thus this function\n\t\t// has to be idempotent.\n\t\t// See also Issue #450 and golang/go#16019.\n\t\t//errLog.Print(ErrInvalidConn)\n\t\treturn driver.ErrBadConn\n\t}\n\n\terr := stmt.mc.writeCommandPacketUint32(comStmtClose, stmt.id)\n\tstmt.mc = nil\n\treturn err\n}\n\nfunc (stmt *mysqlStmt) NumInput() int {\n\treturn stmt.paramCount\n}\n\nfunc (stmt *mysqlStmt) ColumnConverter(idx int) driver.ValueConverter {\n\treturn converter{}\n}\n\nfunc (stmt *mysqlStmt) Exec(args []driver.Value) (driver.Result, error) {\n\tif stmt.mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\t// Send command\n\terr := stmt.writeExecutePacket(args)\n\tif err != nil {\n\t\treturn nil, stmt.mc.markBadConn(err)\n\t}\n\n\tmc := stmt.mc\n\n\tmc.affectedRows = 0\n\tmc.insertId = 0\n\n\t// Read Result\n\tresLen, err := mc.readResultSetHeaderPacket()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif resLen > 0 {\n\t\t// Columns\n\t\tif err = mc.readUntilEOF(); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// Rows\n\t\tif err := mc.readUntilEOF(); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tif err := mc.discardResults(); err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &mysqlResult{\n\t\taffectedRows: int64(mc.affectedRows),\n\t\tinsertId: int64(mc.insertId),\n\t}, nil\n}\n\nfunc (stmt *mysqlStmt) Query(args []driver.Value) (driver.Rows, error) {\n\treturn stmt.query(args)\n}\n\nfunc (stmt *mysqlStmt) query(args []driver.Value) (*binaryRows, error) {\n\tif stmt.mc.closed.IsSet() {\n\t\terrLog.Print(ErrInvalidConn)\n\t\treturn nil, driver.ErrBadConn\n\t}\n\t// Send command\n\terr := stmt.writeExecutePacket(args)\n\tif err != nil {\n\t\treturn nil, stmt.mc.markBadConn(err)\n\t}\n\n\tmc := stmt.mc\n\n\t// Read Result\n\tresLen, err := mc.readResultSetHeaderPacket()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\trows := new(binaryRows)\n\n\tif resLen > 0 {\n\t\trows.mc = mc\n\t\trows.rs.columns, err = mc.readColumns(resLen)\n\t} else {\n\t\trows.rs.done = true\n\n\t\tswitch err := rows.NextResultSet(); err {\n\t\tcase nil, io.EOF:\n\t\t\treturn rows, nil\n\t\tdefault:\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn rows, err\n}\n\ntype converter struct{}\n\n// ConvertValue mirrors the reference/default converter in database/sql/driver\n// with _one_ exception. We support uint64 with their high bit and the default\n// implementation does not. This function should be kept in sync with\n// database/sql/driver defaultConverter.ConvertValue() except for that\n// deliberate difference.\nfunc (c converter) ConvertValue(v interface{}) (driver.Value, error) {\n\tif driver.IsValue(v) {\n\t\treturn v, nil\n\t}\n\n\tif vr, ok := v.(driver.Valuer); ok {\n\t\tsv, err := callValuerValue(vr)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif !driver.IsValue(sv) {\n\t\t\treturn nil, fmt.Errorf(\"non-Value type %T returned from Value\", sv)\n\t\t}\n\t\treturn sv, nil\n\t}\n\n\trv := reflect.ValueOf(v)\n\tswitch rv.Kind() {\n\tcase reflect.Ptr:\n\t\t// indirect pointers\n\t\tif rv.IsNil() {\n\t\t\treturn nil, nil\n\t\t} else {\n\t\t\treturn c.ConvertValue(rv.Elem().Interface())\n\t\t}\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn rv.Int(), nil\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\treturn rv.Uint(), nil\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn rv.Float(), nil\n\tcase reflect.Bool:\n\t\treturn rv.Bool(), nil\n\tcase reflect.Slice:\n\t\tek := rv.Type().Elem().Kind()\n\t\tif ek == reflect.Uint8 {\n\t\t\treturn rv.Bytes(), nil\n\t\t}\n\t\treturn nil, fmt.Errorf(\"unsupported type %T, a slice of %s\", v, ek)\n\tcase reflect.String:\n\t\treturn rv.String(), nil\n\t}\n\treturn nil, fmt.Errorf(\"unsupported type %T, a %s\", v, rv.Kind())\n}\n\nvar valuerReflectType = reflect.TypeOf((*driver.Valuer)(nil)).Elem()\n\n// callValuerValue returns vr.Value(), with one exception:\n// If vr.Value is an auto-generated method on a pointer type and the\n// pointer is nil, it would panic at runtime in the panicwrap\n// method. Treat it like nil instead.\n//\n// This is so people can implement driver.Value on value types and\n// still use nil pointers to those types to mean nil/NULL, just like\n// string/*string.\n//\n// This is an exact copy of the same-named unexported function from the\n// database/sql package.\nfunc callValuerValue(vr driver.Valuer) (v driver.Value, err error) {\n\tif rv := reflect.ValueOf(vr); rv.Kind() == reflect.Ptr &&\n\t\trv.IsNil() &&\n\t\trv.Type().Elem().Implements(valuerReflectType) {\n\t\treturn nil, nil\n\t}\n\treturn vr.Value()\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/transaction.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\ntype mysqlTx struct {\n\tmc *mysqlConn\n}\n\nfunc (tx *mysqlTx) Commit() (err error) {\n\tif tx.mc == nil || tx.mc.closed.IsSet() {\n\t\treturn ErrInvalidConn\n\t}\n\terr = tx.mc.exec(\"COMMIT\")\n\ttx.mc = nil\n\treturn\n}\n\nfunc (tx *mysqlTx) Rollback() (err error) {\n\tif tx.mc == nil || tx.mc.closed.IsSet() {\n\t\treturn ErrInvalidConn\n\t}\n\terr = tx.mc.exec(\"ROLLBACK\")\n\ttx.mc = nil\n\treturn\n}\n" }, { "path": "vendor/github.com/go-sql-driver/mysql/utils.go", "content": "// Go MySQL Driver - A MySQL-Driver for Go's database/sql package\n//\n// Copyright 2012 The Go-MySQL-Driver Authors. All rights reserved.\n//\n// This Source Code Form is subject to the terms of the Mozilla Public\n// License, v. 2.0. If a copy of the MPL was not distributed with this file,\n// You can obtain one at http://mozilla.org/MPL/2.0/.\n\npackage mysql\n\nimport (\n\t\"crypto/tls\"\n\t\"database/sql\"\n\t\"database/sql/driver\"\n\t\"encoding/binary\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"time\"\n)\n\n// Registry for custom tls.Configs\nvar (\n\ttlsConfigLock sync.RWMutex\n\ttlsConfigRegistry map[string]*tls.Config\n)\n\n// RegisterTLSConfig registers a custom tls.Config to be used with sql.Open.\n// Use the key as a value in the DSN where tls=value.\n//\n// Note: The provided tls.Config is exclusively owned by the driver after\n// registering it.\n//\n// rootCertPool := x509.NewCertPool()\n// pem, err := ioutil.ReadFile(\"/path/ca-cert.pem\")\n// if err != nil {\n// log.Fatal(err)\n// }\n// if ok := rootCertPool.AppendCertsFromPEM(pem); !ok {\n// log.Fatal(\"Failed to append PEM.\")\n// }\n// clientCert := make([]tls.Certificate, 0, 1)\n// certs, err := tls.LoadX509KeyPair(\"/path/client-cert.pem\", \"/path/client-key.pem\")\n// if err != nil {\n// log.Fatal(err)\n// }\n// clientCert = append(clientCert, certs)\n// mysql.RegisterTLSConfig(\"custom\", &tls.Config{\n// RootCAs: rootCertPool,\n// Certificates: clientCert,\n// })\n// db, err := sql.Open(\"mysql\", \"user@tcp(localhost:3306)/test?tls=custom\")\n//\nfunc RegisterTLSConfig(key string, config *tls.Config) error {\n\tif _, isBool := readBool(key); isBool || strings.ToLower(key) == \"skip-verify\" || strings.ToLower(key) == \"preferred\" {\n\t\treturn fmt.Errorf(\"key '%s' is reserved\", key)\n\t}\n\n\ttlsConfigLock.Lock()\n\tif tlsConfigRegistry == nil {\n\t\ttlsConfigRegistry = make(map[string]*tls.Config)\n\t}\n\n\ttlsConfigRegistry[key] = config\n\ttlsConfigLock.Unlock()\n\treturn nil\n}\n\n// DeregisterTLSConfig removes the tls.Config associated with key.\nfunc DeregisterTLSConfig(key string) {\n\ttlsConfigLock.Lock()\n\tif tlsConfigRegistry != nil {\n\t\tdelete(tlsConfigRegistry, key)\n\t}\n\ttlsConfigLock.Unlock()\n}\n\nfunc getTLSConfigClone(key string) (config *tls.Config) {\n\ttlsConfigLock.RLock()\n\tif v, ok := tlsConfigRegistry[key]; ok {\n\t\tconfig = v.Clone()\n\t}\n\ttlsConfigLock.RUnlock()\n\treturn\n}\n\n// Returns the bool value of the input.\n// The 2nd return value indicates if the input was a valid bool value\nfunc readBool(input string) (value bool, valid bool) {\n\tswitch input {\n\tcase \"1\", \"true\", \"TRUE\", \"True\":\n\t\treturn true, true\n\tcase \"0\", \"false\", \"FALSE\", \"False\":\n\t\treturn false, true\n\t}\n\n\t// Not a valid bool value\n\treturn\n}\n\n/******************************************************************************\n* Time related utils *\n******************************************************************************/\n\n// NullTime represents a time.Time that may be NULL.\n// NullTime implements the Scanner interface so\n// it can be used as a scan destination:\n//\n// var nt NullTime\n// err := db.QueryRow(\"SELECT time FROM foo WHERE id=?\", id).Scan(&nt)\n// ...\n// if nt.Valid {\n// // use nt.Time\n// } else {\n// // NULL value\n// }\n//\n// This NullTime implementation is not driver-specific\ntype NullTime struct {\n\tTime time.Time\n\tValid bool // Valid is true if Time is not NULL\n}\n\n// Scan implements the Scanner interface.\n// The value type must be time.Time or string / []byte (formatted time-string),\n// otherwise Scan fails.\nfunc (nt *NullTime) Scan(value interface{}) (err error) {\n\tif value == nil {\n\t\tnt.Time, nt.Valid = time.Time{}, false\n\t\treturn\n\t}\n\n\tswitch v := value.(type) {\n\tcase time.Time:\n\t\tnt.Time, nt.Valid = v, true\n\t\treturn\n\tcase []byte:\n\t\tnt.Time, err = parseDateTime(string(v), time.UTC)\n\t\tnt.Valid = (err == nil)\n\t\treturn\n\tcase string:\n\t\tnt.Time, err = parseDateTime(v, time.UTC)\n\t\tnt.Valid = (err == nil)\n\t\treturn\n\t}\n\n\tnt.Valid = false\n\treturn fmt.Errorf(\"Can't convert %T to time.Time\", value)\n}\n\n// Value implements the driver Valuer interface.\nfunc (nt NullTime) Value() (driver.Value, error) {\n\tif !nt.Valid {\n\t\treturn nil, nil\n\t}\n\treturn nt.Time, nil\n}\n\nfunc parseDateTime(str string, loc *time.Location) (t time.Time, err error) {\n\tbase := \"0000-00-00 00:00:00.0000000\"\n\tswitch len(str) {\n\tcase 10, 19, 21, 22, 23, 24, 25, 26: // up to \"YYYY-MM-DD HH:MM:SS.MMMMMM\"\n\t\tif str == base[:len(str)] {\n\t\t\treturn\n\t\t}\n\t\tt, err = time.Parse(timeFormat[:len(str)], str)\n\tdefault:\n\t\terr = fmt.Errorf(\"invalid time string: %s\", str)\n\t\treturn\n\t}\n\n\t// Adjust location\n\tif err == nil && loc != time.UTC {\n\t\ty, mo, d := t.Date()\n\t\th, mi, s := t.Clock()\n\t\tt, err = time.Date(y, mo, d, h, mi, s, t.Nanosecond(), loc), nil\n\t}\n\n\treturn\n}\n\nfunc parseBinaryDateTime(num uint64, data []byte, loc *time.Location) (driver.Value, error) {\n\tswitch num {\n\tcase 0:\n\t\treturn time.Time{}, nil\n\tcase 4:\n\t\treturn time.Date(\n\t\t\tint(binary.LittleEndian.Uint16(data[:2])), // year\n\t\t\ttime.Month(data[2]), // month\n\t\t\tint(data[3]), // day\n\t\t\t0, 0, 0, 0,\n\t\t\tloc,\n\t\t), nil\n\tcase 7:\n\t\treturn time.Date(\n\t\t\tint(binary.LittleEndian.Uint16(data[:2])), // year\n\t\t\ttime.Month(data[2]), // month\n\t\t\tint(data[3]), // day\n\t\t\tint(data[4]), // hour\n\t\t\tint(data[5]), // minutes\n\t\t\tint(data[6]), // seconds\n\t\t\t0,\n\t\t\tloc,\n\t\t), nil\n\tcase 11:\n\t\treturn time.Date(\n\t\t\tint(binary.LittleEndian.Uint16(data[:2])), // year\n\t\t\ttime.Month(data[2]), // month\n\t\t\tint(data[3]), // day\n\t\t\tint(data[4]), // hour\n\t\t\tint(data[5]), // minutes\n\t\t\tint(data[6]), // seconds\n\t\t\tint(binary.LittleEndian.Uint32(data[7:11]))*1000, // nanoseconds\n\t\t\tloc,\n\t\t), nil\n\t}\n\treturn nil, fmt.Errorf(\"invalid DATETIME packet length %d\", num)\n}\n\n// zeroDateTime is used in formatBinaryDateTime to avoid an allocation\n// if the DATE or DATETIME has the zero value.\n// It must never be changed.\n// The current behavior depends on database/sql copying the result.\nvar zeroDateTime = []byte(\"0000-00-00 00:00:00.000000\")\n\nconst digits01 = \"0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789\"\nconst digits10 = \"0000000000111111111122222222223333333333444444444455555555556666666666777777777788888888889999999999\"\n\nfunc appendMicrosecs(dst, src []byte, decimals int) []byte {\n\tif decimals <= 0 {\n\t\treturn dst\n\t}\n\tif len(src) == 0 {\n\t\treturn append(dst, \".000000\"[:decimals+1]...)\n\t}\n\n\tmicrosecs := binary.LittleEndian.Uint32(src[:4])\n\tp1 := byte(microsecs / 10000)\n\tmicrosecs -= 10000 * uint32(p1)\n\tp2 := byte(microsecs / 100)\n\tmicrosecs -= 100 * uint32(p2)\n\tp3 := byte(microsecs)\n\n\tswitch decimals {\n\tdefault:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1], digits01[p1],\n\t\t\tdigits10[p2], digits01[p2],\n\t\t\tdigits10[p3], digits01[p3],\n\t\t)\n\tcase 1:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1],\n\t\t)\n\tcase 2:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1], digits01[p1],\n\t\t)\n\tcase 3:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1], digits01[p1],\n\t\t\tdigits10[p2],\n\t\t)\n\tcase 4:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1], digits01[p1],\n\t\t\tdigits10[p2], digits01[p2],\n\t\t)\n\tcase 5:\n\t\treturn append(dst, '.',\n\t\t\tdigits10[p1], digits01[p1],\n\t\t\tdigits10[p2], digits01[p2],\n\t\t\tdigits10[p3],\n\t\t)\n\t}\n}\n\nfunc formatBinaryDateTime(src []byte, length uint8) (driver.Value, error) {\n\t// length expects the deterministic length of the zero value,\n\t// negative time and 100+ hours are automatically added if needed\n\tif len(src) == 0 {\n\t\treturn zeroDateTime[:length], nil\n\t}\n\tvar dst []byte // return value\n\tvar p1, p2, p3 byte // current digit pair\n\n\tswitch length {\n\tcase 10, 19, 21, 22, 23, 24, 25, 26:\n\tdefault:\n\t\tt := \"DATE\"\n\t\tif length > 10 {\n\t\t\tt += \"TIME\"\n\t\t}\n\t\treturn nil, fmt.Errorf(\"illegal %s length %d\", t, length)\n\t}\n\tswitch len(src) {\n\tcase 4, 7, 11:\n\tdefault:\n\t\tt := \"DATE\"\n\t\tif length > 10 {\n\t\t\tt += \"TIME\"\n\t\t}\n\t\treturn nil, fmt.Errorf(\"illegal %s packet length %d\", t, len(src))\n\t}\n\tdst = make([]byte, 0, length)\n\t// start with the date\n\tyear := binary.LittleEndian.Uint16(src[:2])\n\tpt := year / 100\n\tp1 = byte(year - 100*uint16(pt))\n\tp2, p3 = src[2], src[3]\n\tdst = append(dst,\n\t\tdigits10[pt], digits01[pt],\n\t\tdigits10[p1], digits01[p1], '-',\n\t\tdigits10[p2], digits01[p2], '-',\n\t\tdigits10[p3], digits01[p3],\n\t)\n\tif length == 10 {\n\t\treturn dst, nil\n\t}\n\tif len(src) == 4 {\n\t\treturn append(dst, zeroDateTime[10:length]...), nil\n\t}\n\tdst = append(dst, ' ')\n\tp1 = src[4] // hour\n\tsrc = src[5:]\n\n\t// p1 is 2-digit hour, src is after hour\n\tp2, p3 = src[0], src[1]\n\tdst = append(dst,\n\t\tdigits10[p1], digits01[p1], ':',\n\t\tdigits10[p2], digits01[p2], ':',\n\t\tdigits10[p3], digits01[p3],\n\t)\n\treturn appendMicrosecs(dst, src[2:], int(length)-20), nil\n}\n\nfunc formatBinaryTime(src []byte, length uint8) (driver.Value, error) {\n\t// length expects the deterministic length of the zero value,\n\t// negative time and 100+ hours are automatically added if needed\n\tif len(src) == 0 {\n\t\treturn zeroDateTime[11 : 11+length], nil\n\t}\n\tvar dst []byte // return value\n\n\tswitch length {\n\tcase\n\t\t8, // time (can be up to 10 when negative and 100+ hours)\n\t\t10, 11, 12, 13, 14, 15: // time with fractional seconds\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"illegal TIME length %d\", length)\n\t}\n\tswitch len(src) {\n\tcase 8, 12:\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"invalid TIME packet length %d\", len(src))\n\t}\n\t// +2 to enable negative time and 100+ hours\n\tdst = make([]byte, 0, length+2)\n\tif src[0] == 1 {\n\t\tdst = append(dst, '-')\n\t}\n\tdays := binary.LittleEndian.Uint32(src[1:5])\n\thours := int64(days)*24 + int64(src[5])\n\n\tif hours >= 100 {\n\t\tdst = strconv.AppendInt(dst, hours, 10)\n\t} else {\n\t\tdst = append(dst, digits10[hours], digits01[hours])\n\t}\n\n\tmin, sec := src[6], src[7]\n\tdst = append(dst, ':',\n\t\tdigits10[min], digits01[min], ':',\n\t\tdigits10[sec], digits01[sec],\n\t)\n\treturn appendMicrosecs(dst, src[8:], int(length)-9), nil\n}\n\n/******************************************************************************\n* Convert from and to bytes *\n******************************************************************************/\n\nfunc uint64ToBytes(n uint64) []byte {\n\treturn []byte{\n\t\tbyte(n),\n\t\tbyte(n >> 8),\n\t\tbyte(n >> 16),\n\t\tbyte(n >> 24),\n\t\tbyte(n >> 32),\n\t\tbyte(n >> 40),\n\t\tbyte(n >> 48),\n\t\tbyte(n >> 56),\n\t}\n}\n\nfunc uint64ToString(n uint64) []byte {\n\tvar a [20]byte\n\ti := 20\n\n\t// U+0030 = 0\n\t// ...\n\t// U+0039 = 9\n\n\tvar q uint64\n\tfor n >= 10 {\n\t\ti--\n\t\tq = n / 10\n\t\ta[i] = uint8(n-q*10) + 0x30\n\t\tn = q\n\t}\n\n\ti--\n\ta[i] = uint8(n) + 0x30\n\n\treturn a[i:]\n}\n\n// treats string value as unsigned integer representation\nfunc stringToInt(b []byte) int {\n\tval := 0\n\tfor i := range b {\n\t\tval *= 10\n\t\tval += int(b[i] - 0x30)\n\t}\n\treturn val\n}\n\n// returns the string read as a bytes slice, wheter the value is NULL,\n// the number of bytes read and an error, in case the string is longer than\n// the input slice\nfunc readLengthEncodedString(b []byte) ([]byte, bool, int, error) {\n\t// Get length\n\tnum, isNull, n := readLengthEncodedInteger(b)\n\tif num < 1 {\n\t\treturn b[n:n], isNull, n, nil\n\t}\n\n\tn += int(num)\n\n\t// Check data length\n\tif len(b) >= n {\n\t\treturn b[n-int(num) : n : n], false, n, nil\n\t}\n\treturn nil, false, n, io.EOF\n}\n\n// returns the number of bytes skipped and an error, in case the string is\n// longer than the input slice\nfunc skipLengthEncodedString(b []byte) (int, error) {\n\t// Get length\n\tnum, _, n := readLengthEncodedInteger(b)\n\tif num < 1 {\n\t\treturn n, nil\n\t}\n\n\tn += int(num)\n\n\t// Check data length\n\tif len(b) >= n {\n\t\treturn n, nil\n\t}\n\treturn n, io.EOF\n}\n\n// returns the number read, whether the value is NULL and the number of bytes read\nfunc readLengthEncodedInteger(b []byte) (uint64, bool, int) {\n\t// See issue #349\n\tif len(b) == 0 {\n\t\treturn 0, true, 1\n\t}\n\n\tswitch b[0] {\n\t// 251: NULL\n\tcase 0xfb:\n\t\treturn 0, true, 1\n\n\t// 252: value of following 2\n\tcase 0xfc:\n\t\treturn uint64(b[1]) | uint64(b[2])<<8, false, 3\n\n\t// 253: value of following 3\n\tcase 0xfd:\n\t\treturn uint64(b[1]) | uint64(b[2])<<8 | uint64(b[3])<<16, false, 4\n\n\t// 254: value of following 8\n\tcase 0xfe:\n\t\treturn uint64(b[1]) | uint64(b[2])<<8 | uint64(b[3])<<16 |\n\t\t\t\tuint64(b[4])<<24 | uint64(b[5])<<32 | uint64(b[6])<<40 |\n\t\t\t\tuint64(b[7])<<48 | uint64(b[8])<<56,\n\t\t\tfalse, 9\n\t}\n\n\t// 0-250: value of first byte\n\treturn uint64(b[0]), false, 1\n}\n\n// encodes a uint64 value and appends it to the given bytes slice\nfunc appendLengthEncodedInteger(b []byte, n uint64) []byte {\n\tswitch {\n\tcase n <= 250:\n\t\treturn append(b, byte(n))\n\n\tcase n <= 0xffff:\n\t\treturn append(b, 0xfc, byte(n), byte(n>>8))\n\n\tcase n <= 0xffffff:\n\t\treturn append(b, 0xfd, byte(n), byte(n>>8), byte(n>>16))\n\t}\n\treturn append(b, 0xfe, byte(n), byte(n>>8), byte(n>>16), byte(n>>24),\n\t\tbyte(n>>32), byte(n>>40), byte(n>>48), byte(n>>56))\n}\n\n// reserveBuffer checks cap(buf) and expand buffer to len(buf) + appendSize.\n// If cap(buf) is not enough, reallocate new buffer.\nfunc reserveBuffer(buf []byte, appendSize int) []byte {\n\tnewSize := len(buf) + appendSize\n\tif cap(buf) < newSize {\n\t\t// Grow buffer exponentially\n\t\tnewBuf := make([]byte, len(buf)*2+appendSize)\n\t\tcopy(newBuf, buf)\n\t\tbuf = newBuf\n\t}\n\treturn buf[:newSize]\n}\n\n// escapeBytesBackslash escapes []byte with backslashes (\\)\n// This escapes the contents of a string (provided as []byte) by adding backslashes before special\n// characters, and turning others into specific escape sequences, such as\n// turning newlines into \\n and null bytes into \\0.\n// https://github.com/mysql/mysql-server/blob/mysql-5.7.5/mysys/charset.c#L823-L932\nfunc escapeBytesBackslash(buf, v []byte) []byte {\n\tpos := len(buf)\n\tbuf = reserveBuffer(buf, len(v)*2)\n\n\tfor _, c := range v {\n\t\tswitch c {\n\t\tcase '\\x00':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '0'\n\t\t\tpos += 2\n\t\tcase '\\n':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'n'\n\t\t\tpos += 2\n\t\tcase '\\r':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'r'\n\t\t\tpos += 2\n\t\tcase '\\x1a':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'Z'\n\t\t\tpos += 2\n\t\tcase '\\'':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\\''\n\t\t\tpos += 2\n\t\tcase '\"':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\"'\n\t\t\tpos += 2\n\t\tcase '\\\\':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\\\\'\n\t\t\tpos += 2\n\t\tdefault:\n\t\t\tbuf[pos] = c\n\t\t\tpos++\n\t\t}\n\t}\n\n\treturn buf[:pos]\n}\n\n// escapeStringBackslash is similar to escapeBytesBackslash but for string.\nfunc escapeStringBackslash(buf []byte, v string) []byte {\n\tpos := len(buf)\n\tbuf = reserveBuffer(buf, len(v)*2)\n\n\tfor i := 0; i < len(v); i++ {\n\t\tc := v[i]\n\t\tswitch c {\n\t\tcase '\\x00':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '0'\n\t\t\tpos += 2\n\t\tcase '\\n':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'n'\n\t\t\tpos += 2\n\t\tcase '\\r':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'r'\n\t\t\tpos += 2\n\t\tcase '\\x1a':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = 'Z'\n\t\t\tpos += 2\n\t\tcase '\\'':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\\''\n\t\t\tpos += 2\n\t\tcase '\"':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\"'\n\t\t\tpos += 2\n\t\tcase '\\\\':\n\t\t\tbuf[pos] = '\\\\'\n\t\t\tbuf[pos+1] = '\\\\'\n\t\t\tpos += 2\n\t\tdefault:\n\t\t\tbuf[pos] = c\n\t\t\tpos++\n\t\t}\n\t}\n\n\treturn buf[:pos]\n}\n\n// escapeBytesQuotes escapes apostrophes in []byte by doubling them up.\n// This escapes the contents of a string by doubling up any apostrophes that\n// it contains. This is used when the NO_BACKSLASH_ESCAPES SQL_MODE is in\n// effect on the server.\n// https://github.com/mysql/mysql-server/blob/mysql-5.7.5/mysys/charset.c#L963-L1038\nfunc escapeBytesQuotes(buf, v []byte) []byte {\n\tpos := len(buf)\n\tbuf = reserveBuffer(buf, len(v)*2)\n\n\tfor _, c := range v {\n\t\tif c == '\\'' {\n\t\t\tbuf[pos] = '\\''\n\t\t\tbuf[pos+1] = '\\''\n\t\t\tpos += 2\n\t\t} else {\n\t\t\tbuf[pos] = c\n\t\t\tpos++\n\t\t}\n\t}\n\n\treturn buf[:pos]\n}\n\n// escapeStringQuotes is similar to escapeBytesQuotes but for string.\nfunc escapeStringQuotes(buf []byte, v string) []byte {\n\tpos := len(buf)\n\tbuf = reserveBuffer(buf, len(v)*2)\n\n\tfor i := 0; i < len(v); i++ {\n\t\tc := v[i]\n\t\tif c == '\\'' {\n\t\t\tbuf[pos] = '\\''\n\t\t\tbuf[pos+1] = '\\''\n\t\t\tpos += 2\n\t\t} else {\n\t\t\tbuf[pos] = c\n\t\t\tpos++\n\t\t}\n\t}\n\n\treturn buf[:pos]\n}\n\n/******************************************************************************\n* Sync utils *\n******************************************************************************/\n\n// noCopy may be embedded into structs which must not be copied\n// after the first use.\n//\n// See https://github.com/golang/go/issues/8005#issuecomment-190753527\n// for details.\ntype noCopy struct{}\n\n// Lock is a no-op used by -copylocks checker from `go vet`.\nfunc (*noCopy) Lock() {}\n\n// atomicBool is a wrapper around uint32 for usage as a boolean value with\n// atomic access.\ntype atomicBool struct {\n\t_noCopy noCopy\n\tvalue uint32\n}\n\n// IsSet returns whether the current boolean value is true\nfunc (ab *atomicBool) IsSet() bool {\n\treturn atomic.LoadUint32(&ab.value) > 0\n}\n\n// Set sets the value of the bool regardless of the previous value\nfunc (ab *atomicBool) Set(value bool) {\n\tif value {\n\t\tatomic.StoreUint32(&ab.value, 1)\n\t} else {\n\t\tatomic.StoreUint32(&ab.value, 0)\n\t}\n}\n\n// TrySet sets the value of the bool and returns whether the value changed\nfunc (ab *atomicBool) TrySet(value bool) bool {\n\tif value {\n\t\treturn atomic.SwapUint32(&ab.value, 1) == 0\n\t}\n\treturn atomic.SwapUint32(&ab.value, 0) > 0\n}\n\n// atomicError is a wrapper for atomically accessed error values\ntype atomicError struct {\n\t_noCopy noCopy\n\tvalue atomic.Value\n}\n\n// Set sets the error value regardless of the previous value.\n// The value must not be nil\nfunc (ae *atomicError) Set(value error) {\n\tae.value.Store(value)\n}\n\n// Value returns the current error value\nfunc (ae *atomicError) Value() error {\n\tif v := ae.value.Load(); v != nil {\n\t\t// this will panic if the value doesn't implement the error interface\n\t\treturn v.(error)\n\t}\n\treturn nil\n}\n\nfunc namedValueToValue(named []driver.NamedValue) ([]driver.Value, error) {\n\tdargs := make([]driver.Value, len(named))\n\tfor n, param := range named {\n\t\tif len(param.Name) > 0 {\n\t\t\t// TODO: support the use of Named Parameters #561\n\t\t\treturn nil, errors.New(\"mysql: driver does not support the use of Named Parameters\")\n\t\t}\n\t\tdargs[n] = param.Value\n\t}\n\treturn dargs, nil\n}\n\nfunc mapIsolationLevel(level driver.IsolationLevel) (string, error) {\n\tswitch sql.IsolationLevel(level) {\n\tcase sql.LevelRepeatableRead:\n\t\treturn \"REPEATABLE READ\", nil\n\tcase sql.LevelReadCommitted:\n\t\treturn \"READ COMMITTED\", nil\n\tcase sql.LevelReadUncommitted:\n\t\treturn \"READ UNCOMMITTED\", nil\n\tcase sql.LevelSerializable:\n\t\treturn \"SERIALIZABLE\", nil\n\tdefault:\n\t\treturn \"\", fmt.Errorf(\"mysql: unsupported isolation level: %v\", level)\n\t}\n}\n" }, { "path": "vendor/github.com/golang/freetype/AUTHORS", "content": "# This is the official list of Freetype-Go authors for copyright purposes.\n# This file is distinct from the CONTRIBUTORS files.\n# See the latter for an explanation.\n#\n# Freetype-Go is derived from Freetype, which is written in C. The latter\n# is copyright 1996-2010 David Turner, Robert Wilhelm, and Werner Lemberg.\n\n# Names should be added to this file as\n#\tName or Organization \n# The email address is not required for organizations.\n\n# Please keep the list sorted.\n\nGoogle Inc.\nJeff R. Allen \nMaksim Kochkin \nMichael Fogleman \nRémy Oudompheng \nRoger Peppe \nSteven Edwards \n" }, { "path": "vendor/github.com/golang/freetype/CONTRIBUTORS", "content": "# This is the official list of people who can contribute\n# (and typically have contributed) code to the Freetype-Go repository.\n# The AUTHORS file lists the copyright holders; this file\n# lists people. For example, Google employees are listed here\n# but not in AUTHORS, because Google holds the copyright.\n#\n# The submission process automatically checks to make sure\n# that people submitting code are listed in this file (by email address).\n#\n# Names should be added to this file only after verifying that\n# the individual or the individual's organization has agreed to\n# the appropriate Contributor License Agreement, found here:\n#\n# http://code.google.com/legal/individual-cla-v1.0.html\n# http://code.google.com/legal/corporate-cla-v1.0.html\n#\n# The agreement for individuals can be filled out on the web.\n#\n# When adding J Random Contributor's name to this file,\n# either J's name or J's organization's name should be\n# added to the AUTHORS file, depending on whether the\n# individual or corporate CLA was used.\n\n# Names should be added to this file like so:\n# Name \n\n# Please keep the list sorted.\n\nAndrew Gerrand \nJeff R. Allen \nMaksim Kochkin \nMichael Fogleman \nNigel Tao \nRémy Oudompheng \nRob Pike \nRoger Peppe \nRuss Cox \nSteven Edwards \n" }, { "path": "vendor/github.com/golang/freetype/LICENSE", "content": "Use of the Freetype-Go software is subject to your choice of exactly one of\nthe following two licenses:\n * The FreeType License, which is similar to the original BSD license with\n an advertising clause, or\n * The GNU General Public License (GPL), version 2 or later.\n\nThe text of these licenses are available in the licenses/ftl.txt and the\nlicenses/gpl.txt files respectively. They are also available at\nhttp://freetype.sourceforge.net/license.html\n\nThe Luxi fonts in the testdata directory are licensed separately. See the\ntestdata/COPYING file for details.\n" }, { "path": "vendor/github.com/golang/freetype/README", "content": "The Freetype font rasterizer in the Go programming language.\n\nTo download and install from source:\n$ go get github.com/golang/freetype\n\nIt is an incomplete port:\n * It only supports TrueType fonts, and not Type 1 fonts nor bitmap fonts.\n * It only supports the Unicode encoding.\n\nThere are also some implementation differences:\n * It uses a 26.6 fixed point co-ordinate system everywhere internally,\n as opposed to the original Freetype's mix of 26.6 (or 10.6 for 16-bit\n systems) in some places, and 24.8 in the \"smooth\" rasterizer.\n\nFreetype-Go is derived from Freetype, which is written in C. Freetype is\ncopyright 1996-2010 David Turner, Robert Wilhelm, and Werner Lemberg.\nFreetype-Go is copyright The Freetype-Go Authors, who are listed in the\nAUTHORS file.\n\nUnless otherwise noted, the Freetype-Go source files are distributed\nunder the BSD-style license found in the LICENSE file.\n" }, { "path": "vendor/github.com/golang/freetype/freetype.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\n// The freetype package provides a convenient API to draw text onto an image.\n// Use the freetype/raster and freetype/truetype packages for lower level\n// control over rasterization and TrueType parsing.\npackage freetype // import \"github.com/golang/freetype\"\n\nimport (\n\t\"errors\"\n\t\"image\"\n\t\"image/draw\"\n\n\t\"github.com/golang/freetype/raster\"\n\t\"github.com/golang/freetype/truetype\"\n\t\"golang.org/x/image/font\"\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// These constants determine the size of the glyph cache. The cache is keyed\n// primarily by the glyph index modulo nGlyphs, and secondarily by sub-pixel\n// position for the mask image. Sub-pixel positions are quantized to\n// nXFractions possible values in both the x and y directions.\nconst (\n\tnGlyphs = 256\n\tnXFractions = 4\n\tnYFractions = 1\n)\n\n// An entry in the glyph cache is keyed explicitly by the glyph index and\n// implicitly by the quantized x and y fractional offset. It maps to a mask\n// image and an offset.\ntype cacheEntry struct {\n\tvalid bool\n\tglyph truetype.Index\n\tadvanceWidth fixed.Int26_6\n\tmask *image.Alpha\n\toffset image.Point\n}\n\n// ParseFont just calls the Parse function from the freetype/truetype package.\n// It is provided here so that code that imports this package doesn't need\n// to also include the freetype/truetype package.\nfunc ParseFont(b []byte) (*truetype.Font, error) {\n\treturn truetype.Parse(b)\n}\n\n// Pt converts from a co-ordinate pair measured in pixels to a fixed.Point26_6\n// co-ordinate pair measured in fixed.Int26_6 units.\nfunc Pt(x, y int) fixed.Point26_6 {\n\treturn fixed.Point26_6{\n\t\tX: fixed.Int26_6(x << 6),\n\t\tY: fixed.Int26_6(y << 6),\n\t}\n}\n\n// A Context holds the state for drawing text in a given font and size.\ntype Context struct {\n\tr *raster.Rasterizer\n\tf *truetype.Font\n\tglyphBuf truetype.GlyphBuf\n\t// clip is the clip rectangle for drawing.\n\tclip image.Rectangle\n\t// dst and src are the destination and source images for drawing.\n\tdst draw.Image\n\tsrc image.Image\n\t// fontSize and dpi are used to calculate scale. scale is the number of\n\t// 26.6 fixed point units in 1 em. hinting is the hinting policy.\n\tfontSize, dpi float64\n\tscale fixed.Int26_6\n\thinting font.Hinting\n\t// cache is the glyph cache.\n\tcache [nGlyphs * nXFractions * nYFractions]cacheEntry\n}\n\n// PointToFixed converts the given number of points (as in \"a 12 point font\")\n// into a 26.6 fixed point number of pixels.\nfunc (c *Context) PointToFixed(x float64) fixed.Int26_6 {\n\treturn fixed.Int26_6(x * float64(c.dpi) * (64.0 / 72.0))\n}\n\n// drawContour draws the given closed contour with the given offset.\nfunc (c *Context) drawContour(ps []truetype.Point, dx, dy fixed.Int26_6) {\n\tif len(ps) == 0 {\n\t\treturn\n\t}\n\n\t// The low bit of each point's Flags value is whether the point is on the\n\t// curve. Truetype fonts only have quadratic Bézier curves, not cubics.\n\t// Thus, two consecutive off-curve points imply an on-curve point in the\n\t// middle of those two.\n\t//\n\t// See http://chanae.walon.org/pub/ttf/ttf_glyphs.htm for more details.\n\n\t// ps[0] is a truetype.Point measured in FUnits and positive Y going\n\t// upwards. start is the same thing measured in fixed point units and\n\t// positive Y going downwards, and offset by (dx, dy).\n\tstart := fixed.Point26_6{\n\t\tX: dx + ps[0].X,\n\t\tY: dy - ps[0].Y,\n\t}\n\tothers := []truetype.Point(nil)\n\tif ps[0].Flags&0x01 != 0 {\n\t\tothers = ps[1:]\n\t} else {\n\t\tlast := fixed.Point26_6{\n\t\t\tX: dx + ps[len(ps)-1].X,\n\t\t\tY: dy - ps[len(ps)-1].Y,\n\t\t}\n\t\tif ps[len(ps)-1].Flags&0x01 != 0 {\n\t\t\tstart = last\n\t\t\tothers = ps[:len(ps)-1]\n\t\t} else {\n\t\t\tstart = fixed.Point26_6{\n\t\t\t\tX: (start.X + last.X) / 2,\n\t\t\t\tY: (start.Y + last.Y) / 2,\n\t\t\t}\n\t\t\tothers = ps\n\t\t}\n\t}\n\tc.r.Start(start)\n\tq0, on0 := start, true\n\tfor _, p := range others {\n\t\tq := fixed.Point26_6{\n\t\t\tX: dx + p.X,\n\t\t\tY: dy - p.Y,\n\t\t}\n\t\ton := p.Flags&0x01 != 0\n\t\tif on {\n\t\t\tif on0 {\n\t\t\t\tc.r.Add1(q)\n\t\t\t} else {\n\t\t\t\tc.r.Add2(q0, q)\n\t\t\t}\n\t\t} else {\n\t\t\tif on0 {\n\t\t\t\t// No-op.\n\t\t\t} else {\n\t\t\t\tmid := fixed.Point26_6{\n\t\t\t\t\tX: (q0.X + q.X) / 2,\n\t\t\t\t\tY: (q0.Y + q.Y) / 2,\n\t\t\t\t}\n\t\t\t\tc.r.Add2(q0, mid)\n\t\t\t}\n\t\t}\n\t\tq0, on0 = q, on\n\t}\n\t// Close the curve.\n\tif on0 {\n\t\tc.r.Add1(start)\n\t} else {\n\t\tc.r.Add2(q0, start)\n\t}\n}\n\n// rasterize returns the advance width, glyph mask and integer-pixel offset\n// to render the given glyph at the given sub-pixel offsets.\n// The 26.6 fixed point arguments fx and fy must be in the range [0, 1).\nfunc (c *Context) rasterize(glyph truetype.Index, fx, fy fixed.Int26_6) (\n\tfixed.Int26_6, *image.Alpha, image.Point, error) {\n\n\tif err := c.glyphBuf.Load(c.f, c.scale, glyph, c.hinting); err != nil {\n\t\treturn 0, nil, image.Point{}, err\n\t}\n\t// Calculate the integer-pixel bounds for the glyph.\n\txmin := int(fx+c.glyphBuf.Bounds.Min.X) >> 6\n\tymin := int(fy-c.glyphBuf.Bounds.Max.Y) >> 6\n\txmax := int(fx+c.glyphBuf.Bounds.Max.X+0x3f) >> 6\n\tymax := int(fy-c.glyphBuf.Bounds.Min.Y+0x3f) >> 6\n\tif xmin > xmax || ymin > ymax {\n\t\treturn 0, nil, image.Point{}, errors.New(\"freetype: negative sized glyph\")\n\t}\n\t// A TrueType's glyph's nodes can have negative co-ordinates, but the\n\t// rasterizer clips anything left of x=0 or above y=0. xmin and ymin are\n\t// the pixel offsets, based on the font's FUnit metrics, that let a\n\t// negative co-ordinate in TrueType space be non-negative in rasterizer\n\t// space. xmin and ymin are typically <= 0.\n\tfx -= fixed.Int26_6(xmin << 6)\n\tfy -= fixed.Int26_6(ymin << 6)\n\t// Rasterize the glyph's vectors.\n\tc.r.Clear()\n\te0 := 0\n\tfor _, e1 := range c.glyphBuf.Ends {\n\t\tc.drawContour(c.glyphBuf.Points[e0:e1], fx, fy)\n\t\te0 = e1\n\t}\n\ta := image.NewAlpha(image.Rect(0, 0, xmax-xmin, ymax-ymin))\n\tc.r.Rasterize(raster.NewAlphaSrcPainter(a))\n\treturn c.glyphBuf.AdvanceWidth, a, image.Point{xmin, ymin}, nil\n}\n\n// glyph returns the advance width, glyph mask and integer-pixel offset to\n// render the given glyph at the given sub-pixel point. It is a cache for the\n// rasterize method. Unlike rasterize, p's co-ordinates do not have to be in\n// the range [0, 1).\nfunc (c *Context) glyph(glyph truetype.Index, p fixed.Point26_6) (\n\tfixed.Int26_6, *image.Alpha, image.Point, error) {\n\n\t// Split p.X and p.Y into their integer and fractional parts.\n\tix, fx := int(p.X>>6), p.X&0x3f\n\tiy, fy := int(p.Y>>6), p.Y&0x3f\n\t// Calculate the index t into the cache array.\n\ttg := int(glyph) % nGlyphs\n\ttx := int(fx) / (64 / nXFractions)\n\tty := int(fy) / (64 / nYFractions)\n\tt := ((tg*nXFractions)+tx)*nYFractions + ty\n\t// Check for a cache hit.\n\tif e := c.cache[t]; e.valid && e.glyph == glyph {\n\t\treturn e.advanceWidth, e.mask, e.offset.Add(image.Point{ix, iy}), nil\n\t}\n\t// Rasterize the glyph and put the result into the cache.\n\tadvanceWidth, mask, offset, err := c.rasterize(glyph, fx, fy)\n\tif err != nil {\n\t\treturn 0, nil, image.Point{}, err\n\t}\n\tc.cache[t] = cacheEntry{true, glyph, advanceWidth, mask, offset}\n\treturn advanceWidth, mask, offset.Add(image.Point{ix, iy}), nil\n}\n\n// DrawString draws s at p and returns p advanced by the text extent. The text\n// is placed so that the left edge of the em square of the first character of s\n// and the baseline intersect at p. The majority of the affected pixels will be\n// above and to the right of the point, but some may be below or to the left.\n// For example, drawing a string that starts with a 'J' in an italic font may\n// affect pixels below and left of the point.\n//\n// p is a fixed.Point26_6 and can therefore represent sub-pixel positions.\nfunc (c *Context) DrawString(s string, p fixed.Point26_6) (fixed.Point26_6, error) {\n\tif c.f == nil {\n\t\treturn fixed.Point26_6{}, errors.New(\"freetype: DrawText called with a nil font\")\n\t}\n\tprev, hasPrev := truetype.Index(0), false\n\tfor _, rune := range s {\n\t\tindex := c.f.Index(rune)\n\t\tif hasPrev {\n\t\t\tkern := c.f.Kern(c.scale, prev, index)\n\t\t\tif c.hinting != font.HintingNone {\n\t\t\t\tkern = (kern + 32) &^ 63\n\t\t\t}\n\t\t\tp.X += kern\n\t\t}\n\t\tadvanceWidth, mask, offset, err := c.glyph(index, p)\n\t\tif err != nil {\n\t\t\treturn fixed.Point26_6{}, err\n\t\t}\n\t\tp.X += advanceWidth\n\t\tglyphRect := mask.Bounds().Add(offset)\n\t\tdr := c.clip.Intersect(glyphRect)\n\t\tif !dr.Empty() {\n\t\t\tmp := image.Point{0, dr.Min.Y - glyphRect.Min.Y}\n\t\t\tdraw.DrawMask(c.dst, dr, c.src, image.ZP, mask, mp, draw.Over)\n\t\t}\n\t\tprev, hasPrev = index, true\n\t}\n\treturn p, nil\n}\n\n// recalc recalculates scale and bounds values from the font size, screen\n// resolution and font metrics, and invalidates the glyph cache.\nfunc (c *Context) recalc() {\n\tc.scale = fixed.Int26_6(c.fontSize * c.dpi * (64.0 / 72.0))\n\tif c.f == nil {\n\t\tc.r.SetBounds(0, 0)\n\t} else {\n\t\t// Set the rasterizer's bounds to be big enough to handle the largest glyph.\n\t\tb := c.f.Bounds(c.scale)\n\t\txmin := +int(b.Min.X) >> 6\n\t\tymin := -int(b.Max.Y) >> 6\n\t\txmax := +int(b.Max.X+63) >> 6\n\t\tymax := -int(b.Min.Y-63) >> 6\n\t\tc.r.SetBounds(xmax-xmin, ymax-ymin)\n\t}\n\tfor i := range c.cache {\n\t\tc.cache[i] = cacheEntry{}\n\t}\n}\n\n// SetDPI sets the screen resolution in dots per inch.\nfunc (c *Context) SetDPI(dpi float64) {\n\tif c.dpi == dpi {\n\t\treturn\n\t}\n\tc.dpi = dpi\n\tc.recalc()\n}\n\n// SetFont sets the font used to draw text.\nfunc (c *Context) SetFont(f *truetype.Font) {\n\tif c.f == f {\n\t\treturn\n\t}\n\tc.f = f\n\tc.recalc()\n}\n\n// SetFontSize sets the font size in points (as in \"a 12 point font\").\nfunc (c *Context) SetFontSize(fontSize float64) {\n\tif c.fontSize == fontSize {\n\t\treturn\n\t}\n\tc.fontSize = fontSize\n\tc.recalc()\n}\n\n// SetHinting sets the hinting policy.\nfunc (c *Context) SetHinting(hinting font.Hinting) {\n\tc.hinting = hinting\n\tfor i := range c.cache {\n\t\tc.cache[i] = cacheEntry{}\n\t}\n}\n\n// SetDst sets the destination image for draw operations.\nfunc (c *Context) SetDst(dst draw.Image) {\n\tc.dst = dst\n}\n\n// SetSrc sets the source image for draw operations. This is typically an\n// image.Uniform.\nfunc (c *Context) SetSrc(src image.Image) {\n\tc.src = src\n}\n\n// SetClip sets the clip rectangle for drawing.\nfunc (c *Context) SetClip(clip image.Rectangle) {\n\tc.clip = clip\n}\n\n// TODO(nigeltao): implement Context.SetGamma.\n\n// NewContext creates a new Context.\nfunc NewContext() *Context {\n\treturn &Context{\n\t\tr: raster.NewRasterizer(0, 0),\n\t\tfontSize: 12,\n\t\tdpi: 72,\n\t\tscale: 12 << 6,\n\t}\n}\n" }, { "path": "vendor/github.com/golang/freetype/raster/geom.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage raster\n\nimport (\n\t\"fmt\"\n\t\"math\"\n\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// maxAbs returns the maximum of abs(a) and abs(b).\nfunc maxAbs(a, b fixed.Int26_6) fixed.Int26_6 {\n\tif a < 0 {\n\t\ta = -a\n\t}\n\tif b < 0 {\n\t\tb = -b\n\t}\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}\n\n// pNeg returns the vector -p, or equivalently p rotated by 180 degrees.\nfunc pNeg(p fixed.Point26_6) fixed.Point26_6 {\n\treturn fixed.Point26_6{-p.X, -p.Y}\n}\n\n// pDot returns the dot product p·q.\nfunc pDot(p fixed.Point26_6, q fixed.Point26_6) fixed.Int52_12 {\n\tpx, py := int64(p.X), int64(p.Y)\n\tqx, qy := int64(q.X), int64(q.Y)\n\treturn fixed.Int52_12(px*qx + py*qy)\n}\n\n// pLen returns the length of the vector p.\nfunc pLen(p fixed.Point26_6) fixed.Int26_6 {\n\t// TODO(nigeltao): use fixed point math.\n\tx := float64(p.X)\n\ty := float64(p.Y)\n\treturn fixed.Int26_6(math.Sqrt(x*x + y*y))\n}\n\n// pNorm returns the vector p normalized to the given length, or zero if p is\n// degenerate.\nfunc pNorm(p fixed.Point26_6, length fixed.Int26_6) fixed.Point26_6 {\n\td := pLen(p)\n\tif d == 0 {\n\t\treturn fixed.Point26_6{}\n\t}\n\ts, t := int64(length), int64(d)\n\tx := int64(p.X) * s / t\n\ty := int64(p.Y) * s / t\n\treturn fixed.Point26_6{fixed.Int26_6(x), fixed.Int26_6(y)}\n}\n\n// pRot45CW returns the vector p rotated clockwise by 45 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot45CW is {1/√2, 1/√2}.\nfunc pRot45CW(p fixed.Point26_6) fixed.Point26_6 {\n\t// 181/256 is approximately 1/√2, or sin(π/4).\n\tpx, py := int64(p.X), int64(p.Y)\n\tqx := (+px - py) * 181 / 256\n\tqy := (+px + py) * 181 / 256\n\treturn fixed.Point26_6{fixed.Int26_6(qx), fixed.Int26_6(qy)}\n}\n\n// pRot90CW returns the vector p rotated clockwise by 90 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot90CW is {0, 1}.\nfunc pRot90CW(p fixed.Point26_6) fixed.Point26_6 {\n\treturn fixed.Point26_6{-p.Y, p.X}\n}\n\n// pRot135CW returns the vector p rotated clockwise by 135 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot135CW is {-1/√2, 1/√2}.\nfunc pRot135CW(p fixed.Point26_6) fixed.Point26_6 {\n\t// 181/256 is approximately 1/√2, or sin(π/4).\n\tpx, py := int64(p.X), int64(p.Y)\n\tqx := (-px - py) * 181 / 256\n\tqy := (+px - py) * 181 / 256\n\treturn fixed.Point26_6{fixed.Int26_6(qx), fixed.Int26_6(qy)}\n}\n\n// pRot45CCW returns the vector p rotated counter-clockwise by 45 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot45CCW is {1/√2, -1/√2}.\nfunc pRot45CCW(p fixed.Point26_6) fixed.Point26_6 {\n\t// 181/256 is approximately 1/√2, or sin(π/4).\n\tpx, py := int64(p.X), int64(p.Y)\n\tqx := (+px + py) * 181 / 256\n\tqy := (-px + py) * 181 / 256\n\treturn fixed.Point26_6{fixed.Int26_6(qx), fixed.Int26_6(qy)}\n}\n\n// pRot90CCW returns the vector p rotated counter-clockwise by 90 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot90CCW is {0, -1}.\nfunc pRot90CCW(p fixed.Point26_6) fixed.Point26_6 {\n\treturn fixed.Point26_6{p.Y, -p.X}\n}\n\n// pRot135CCW returns the vector p rotated counter-clockwise by 135 degrees.\n//\n// Note that the Y-axis grows downwards, so {1, 0}.Rot135CCW is {-1/√2, -1/√2}.\nfunc pRot135CCW(p fixed.Point26_6) fixed.Point26_6 {\n\t// 181/256 is approximately 1/√2, or sin(π/4).\n\tpx, py := int64(p.X), int64(p.Y)\n\tqx := (-px + py) * 181 / 256\n\tqy := (-px - py) * 181 / 256\n\treturn fixed.Point26_6{fixed.Int26_6(qx), fixed.Int26_6(qy)}\n}\n\n// An Adder accumulates points on a curve.\ntype Adder interface {\n\t// Start starts a new curve at the given point.\n\tStart(a fixed.Point26_6)\n\t// Add1 adds a linear segment to the current curve.\n\tAdd1(b fixed.Point26_6)\n\t// Add2 adds a quadratic segment to the current curve.\n\tAdd2(b, c fixed.Point26_6)\n\t// Add3 adds a cubic segment to the current curve.\n\tAdd3(b, c, d fixed.Point26_6)\n}\n\n// A Path is a sequence of curves, and a curve is a start point followed by a\n// sequence of linear, quadratic or cubic segments.\ntype Path []fixed.Int26_6\n\n// String returns a human-readable representation of a Path.\nfunc (p Path) String() string {\n\ts := \"\"\n\tfor i := 0; i < len(p); {\n\t\tif i != 0 {\n\t\t\ts += \" \"\n\t\t}\n\t\tswitch p[i] {\n\t\tcase 0:\n\t\t\ts += \"S0\" + fmt.Sprint([]fixed.Int26_6(p[i+1:i+3]))\n\t\t\ti += 4\n\t\tcase 1:\n\t\t\ts += \"A1\" + fmt.Sprint([]fixed.Int26_6(p[i+1:i+3]))\n\t\t\ti += 4\n\t\tcase 2:\n\t\t\ts += \"A2\" + fmt.Sprint([]fixed.Int26_6(p[i+1:i+5]))\n\t\t\ti += 6\n\t\tcase 3:\n\t\t\ts += \"A3\" + fmt.Sprint([]fixed.Int26_6(p[i+1:i+7]))\n\t\t\ti += 8\n\t\tdefault:\n\t\t\tpanic(\"freetype/raster: bad path\")\n\t\t}\n\t}\n\treturn s\n}\n\n// Clear cancels any previous calls to p.Start or p.AddXxx.\nfunc (p *Path) Clear() {\n\t*p = (*p)[:0]\n}\n\n// Start starts a new curve at the given point.\nfunc (p *Path) Start(a fixed.Point26_6) {\n\t*p = append(*p, 0, a.X, a.Y, 0)\n}\n\n// Add1 adds a linear segment to the current curve.\nfunc (p *Path) Add1(b fixed.Point26_6) {\n\t*p = append(*p, 1, b.X, b.Y, 1)\n}\n\n// Add2 adds a quadratic segment to the current curve.\nfunc (p *Path) Add2(b, c fixed.Point26_6) {\n\t*p = append(*p, 2, b.X, b.Y, c.X, c.Y, 2)\n}\n\n// Add3 adds a cubic segment to the current curve.\nfunc (p *Path) Add3(b, c, d fixed.Point26_6) {\n\t*p = append(*p, 3, b.X, b.Y, c.X, c.Y, d.X, d.Y, 3)\n}\n\n// AddPath adds the Path q to p.\nfunc (p *Path) AddPath(q Path) {\n\t*p = append(*p, q...)\n}\n\n// AddStroke adds a stroked Path.\nfunc (p *Path) AddStroke(q Path, width fixed.Int26_6, cr Capper, jr Joiner) {\n\tStroke(p, q, width, cr, jr)\n}\n\n// firstPoint returns the first point in a non-empty Path.\nfunc (p Path) firstPoint() fixed.Point26_6 {\n\treturn fixed.Point26_6{p[1], p[2]}\n}\n\n// lastPoint returns the last point in a non-empty Path.\nfunc (p Path) lastPoint() fixed.Point26_6 {\n\treturn fixed.Point26_6{p[len(p)-3], p[len(p)-2]}\n}\n\n// addPathReversed adds q reversed to p.\n// For example, if q consists of a linear segment from A to B followed by a\n// quadratic segment from B to C to D, then the values of q looks like:\n// index: 01234567890123\n// value: 0AA01BB12CCDD2\n// So, when adding q backwards to p, we want to Add2(C, B) followed by Add1(A).\nfunc addPathReversed(p Adder, q Path) {\n\tif len(q) == 0 {\n\t\treturn\n\t}\n\ti := len(q) - 1\n\tfor {\n\t\tswitch q[i] {\n\t\tcase 0:\n\t\t\treturn\n\t\tcase 1:\n\t\t\ti -= 4\n\t\t\tp.Add1(\n\t\t\t\tfixed.Point26_6{q[i-2], q[i-1]},\n\t\t\t)\n\t\tcase 2:\n\t\t\ti -= 6\n\t\t\tp.Add2(\n\t\t\t\tfixed.Point26_6{q[i+2], q[i+3]},\n\t\t\t\tfixed.Point26_6{q[i-2], q[i-1]},\n\t\t\t)\n\t\tcase 3:\n\t\t\ti -= 8\n\t\t\tp.Add3(\n\t\t\t\tfixed.Point26_6{q[i+4], q[i+5]},\n\t\t\t\tfixed.Point26_6{q[i+2], q[i+3]},\n\t\t\t\tfixed.Point26_6{q[i-2], q[i-1]},\n\t\t\t)\n\t\tdefault:\n\t\t\tpanic(\"freetype/raster: bad path\")\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/golang/freetype/raster/paint.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage raster\n\nimport (\n\t\"image\"\n\t\"image/color\"\n\t\"image/draw\"\n\t\"math\"\n)\n\n// A Span is a horizontal segment of pixels with constant alpha. X0 is an\n// inclusive bound and X1 is exclusive, the same as for slices. A fully opaque\n// Span has Alpha == 0xffff.\ntype Span struct {\n\tY, X0, X1 int\n\tAlpha uint32\n}\n\n// A Painter knows how to paint a batch of Spans. Rasterization may involve\n// Painting multiple batches, and done will be true for the final batch. The\n// Spans' Y values are monotonically increasing during a rasterization. Paint\n// may use all of ss as scratch space during the call.\ntype Painter interface {\n\tPaint(ss []Span, done bool)\n}\n\n// The PainterFunc type adapts an ordinary function to the Painter interface.\ntype PainterFunc func(ss []Span, done bool)\n\n// Paint just delegates the call to f.\nfunc (f PainterFunc) Paint(ss []Span, done bool) { f(ss, done) }\n\n// An AlphaOverPainter is a Painter that paints Spans onto a *image.Alpha using\n// the Over Porter-Duff composition operator.\ntype AlphaOverPainter struct {\n\tImage *image.Alpha\n}\n\n// Paint satisfies the Painter interface.\nfunc (r AlphaOverPainter) Paint(ss []Span, done bool) {\n\tb := r.Image.Bounds()\n\tfor _, s := range ss {\n\t\tif s.Y < b.Min.Y {\n\t\t\tcontinue\n\t\t}\n\t\tif s.Y >= b.Max.Y {\n\t\t\treturn\n\t\t}\n\t\tif s.X0 < b.Min.X {\n\t\t\ts.X0 = b.Min.X\n\t\t}\n\t\tif s.X1 > b.Max.X {\n\t\t\ts.X1 = b.Max.X\n\t\t}\n\t\tif s.X0 >= s.X1 {\n\t\t\tcontinue\n\t\t}\n\t\tbase := (s.Y-r.Image.Rect.Min.Y)*r.Image.Stride - r.Image.Rect.Min.X\n\t\tp := r.Image.Pix[base+s.X0 : base+s.X1]\n\t\ta := int(s.Alpha >> 8)\n\t\tfor i, c := range p {\n\t\t\tv := int(c)\n\t\t\tp[i] = uint8((v*255 + (255-v)*a) / 255)\n\t\t}\n\t}\n}\n\n// NewAlphaOverPainter creates a new AlphaOverPainter for the given image.\nfunc NewAlphaOverPainter(m *image.Alpha) AlphaOverPainter {\n\treturn AlphaOverPainter{m}\n}\n\n// An AlphaSrcPainter is a Painter that paints Spans onto a *image.Alpha using\n// the Src Porter-Duff composition operator.\ntype AlphaSrcPainter struct {\n\tImage *image.Alpha\n}\n\n// Paint satisfies the Painter interface.\nfunc (r AlphaSrcPainter) Paint(ss []Span, done bool) {\n\tb := r.Image.Bounds()\n\tfor _, s := range ss {\n\t\tif s.Y < b.Min.Y {\n\t\t\tcontinue\n\t\t}\n\t\tif s.Y >= b.Max.Y {\n\t\t\treturn\n\t\t}\n\t\tif s.X0 < b.Min.X {\n\t\t\ts.X0 = b.Min.X\n\t\t}\n\t\tif s.X1 > b.Max.X {\n\t\t\ts.X1 = b.Max.X\n\t\t}\n\t\tif s.X0 >= s.X1 {\n\t\t\tcontinue\n\t\t}\n\t\tbase := (s.Y-r.Image.Rect.Min.Y)*r.Image.Stride - r.Image.Rect.Min.X\n\t\tp := r.Image.Pix[base+s.X0 : base+s.X1]\n\t\tcolor := uint8(s.Alpha >> 8)\n\t\tfor i := range p {\n\t\t\tp[i] = color\n\t\t}\n\t}\n}\n\n// NewAlphaSrcPainter creates a new AlphaSrcPainter for the given image.\nfunc NewAlphaSrcPainter(m *image.Alpha) AlphaSrcPainter {\n\treturn AlphaSrcPainter{m}\n}\n\n// An RGBAPainter is a Painter that paints Spans onto a *image.RGBA.\ntype RGBAPainter struct {\n\t// Image is the image to compose onto.\n\tImage *image.RGBA\n\t// Op is the Porter-Duff composition operator.\n\tOp draw.Op\n\t// cr, cg, cb and ca are the 16-bit color to paint the spans.\n\tcr, cg, cb, ca uint32\n}\n\n// Paint satisfies the Painter interface.\nfunc (r *RGBAPainter) Paint(ss []Span, done bool) {\n\tb := r.Image.Bounds()\n\tfor _, s := range ss {\n\t\tif s.Y < b.Min.Y {\n\t\t\tcontinue\n\t\t}\n\t\tif s.Y >= b.Max.Y {\n\t\t\treturn\n\t\t}\n\t\tif s.X0 < b.Min.X {\n\t\t\ts.X0 = b.Min.X\n\t\t}\n\t\tif s.X1 > b.Max.X {\n\t\t\ts.X1 = b.Max.X\n\t\t}\n\t\tif s.X0 >= s.X1 {\n\t\t\tcontinue\n\t\t}\n\t\t// This code mimics drawGlyphOver in $GOROOT/src/image/draw/draw.go.\n\t\tma := s.Alpha\n\t\tconst m = 1<<16 - 1\n\t\ti0 := (s.Y-r.Image.Rect.Min.Y)*r.Image.Stride + (s.X0-r.Image.Rect.Min.X)*4\n\t\ti1 := i0 + (s.X1-s.X0)*4\n\t\tif r.Op == draw.Over {\n\t\t\tfor i := i0; i < i1; i += 4 {\n\t\t\t\tdr := uint32(r.Image.Pix[i+0])\n\t\t\t\tdg := uint32(r.Image.Pix[i+1])\n\t\t\t\tdb := uint32(r.Image.Pix[i+2])\n\t\t\t\tda := uint32(r.Image.Pix[i+3])\n\t\t\t\ta := (m - (r.ca * ma / m)) * 0x101\n\t\t\t\tr.Image.Pix[i+0] = uint8((dr*a + r.cr*ma) / m >> 8)\n\t\t\t\tr.Image.Pix[i+1] = uint8((dg*a + r.cg*ma) / m >> 8)\n\t\t\t\tr.Image.Pix[i+2] = uint8((db*a + r.cb*ma) / m >> 8)\n\t\t\t\tr.Image.Pix[i+3] = uint8((da*a + r.ca*ma) / m >> 8)\n\t\t\t}\n\t\t} else {\n\t\t\tfor i := i0; i < i1; i += 4 {\n\t\t\t\tr.Image.Pix[i+0] = uint8(r.cr * ma / m >> 8)\n\t\t\t\tr.Image.Pix[i+1] = uint8(r.cg * ma / m >> 8)\n\t\t\t\tr.Image.Pix[i+2] = uint8(r.cb * ma / m >> 8)\n\t\t\t\tr.Image.Pix[i+3] = uint8(r.ca * ma / m >> 8)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// SetColor sets the color to paint the spans.\nfunc (r *RGBAPainter) SetColor(c color.Color) {\n\tr.cr, r.cg, r.cb, r.ca = c.RGBA()\n}\n\n// NewRGBAPainter creates a new RGBAPainter for the given image.\nfunc NewRGBAPainter(m *image.RGBA) *RGBAPainter {\n\treturn &RGBAPainter{Image: m}\n}\n\n// A MonochromePainter wraps another Painter, quantizing each Span's alpha to\n// be either fully opaque or fully transparent.\ntype MonochromePainter struct {\n\tPainter Painter\n\ty, x0, x1 int\n}\n\n// Paint delegates to the wrapped Painter after quantizing each Span's alpha\n// value and merging adjacent fully opaque Spans.\nfunc (m *MonochromePainter) Paint(ss []Span, done bool) {\n\t// We compact the ss slice, discarding any Spans whose alpha quantizes to zero.\n\tj := 0\n\tfor _, s := range ss {\n\t\tif s.Alpha >= 0x8000 {\n\t\t\tif m.y == s.Y && m.x1 == s.X0 {\n\t\t\t\tm.x1 = s.X1\n\t\t\t} else {\n\t\t\t\tss[j] = Span{m.y, m.x0, m.x1, 1<<16 - 1}\n\t\t\t\tj++\n\t\t\t\tm.y, m.x0, m.x1 = s.Y, s.X0, s.X1\n\t\t\t}\n\t\t}\n\t}\n\tif done {\n\t\t// Flush the accumulated Span.\n\t\tfinalSpan := Span{m.y, m.x0, m.x1, 1<<16 - 1}\n\t\tif j < len(ss) {\n\t\t\tss[j] = finalSpan\n\t\t\tj++\n\t\t\tm.Painter.Paint(ss[:j], true)\n\t\t} else if j == len(ss) {\n\t\t\tm.Painter.Paint(ss, false)\n\t\t\tif cap(ss) > 0 {\n\t\t\t\tss = ss[:1]\n\t\t\t} else {\n\t\t\t\tss = make([]Span, 1)\n\t\t\t}\n\t\t\tss[0] = finalSpan\n\t\t\tm.Painter.Paint(ss, true)\n\t\t} else {\n\t\t\tpanic(\"unreachable\")\n\t\t}\n\t\t// Reset the accumulator, so that this Painter can be re-used.\n\t\tm.y, m.x0, m.x1 = 0, 0, 0\n\t} else {\n\t\tm.Painter.Paint(ss[:j], false)\n\t}\n}\n\n// NewMonochromePainter creates a new MonochromePainter that wraps the given\n// Painter.\nfunc NewMonochromePainter(p Painter) *MonochromePainter {\n\treturn &MonochromePainter{Painter: p}\n}\n\n// A GammaCorrectionPainter wraps another Painter, performing gamma-correction\n// on each Span's alpha value.\ntype GammaCorrectionPainter struct {\n\t// Painter is the wrapped Painter.\n\tPainter Painter\n\t// a is the precomputed alpha values for linear interpolation, with fully\n\t// opaque == 0xffff.\n\ta [256]uint16\n\t// gammaIsOne is whether gamma correction is a no-op.\n\tgammaIsOne bool\n}\n\n// Paint delegates to the wrapped Painter after performing gamma-correction on\n// each Span.\nfunc (g *GammaCorrectionPainter) Paint(ss []Span, done bool) {\n\tif !g.gammaIsOne {\n\t\tconst n = 0x101\n\t\tfor i, s := range ss {\n\t\t\tif s.Alpha == 0 || s.Alpha == 0xffff {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tp, q := s.Alpha/n, s.Alpha%n\n\t\t\t// The resultant alpha is a linear interpolation of g.a[p] and g.a[p+1].\n\t\t\ta := uint32(g.a[p])*(n-q) + uint32(g.a[p+1])*q\n\t\t\tss[i].Alpha = (a + n/2) / n\n\t\t}\n\t}\n\tg.Painter.Paint(ss, done)\n}\n\n// SetGamma sets the gamma value.\nfunc (g *GammaCorrectionPainter) SetGamma(gamma float64) {\n\tg.gammaIsOne = gamma == 1\n\tif g.gammaIsOne {\n\t\treturn\n\t}\n\tfor i := 0; i < 256; i++ {\n\t\ta := float64(i) / 0xff\n\t\ta = math.Pow(a, gamma)\n\t\tg.a[i] = uint16(0xffff * a)\n\t}\n}\n\n// NewGammaCorrectionPainter creates a new GammaCorrectionPainter that wraps\n// the given Painter.\nfunc NewGammaCorrectionPainter(p Painter, gamma float64) *GammaCorrectionPainter {\n\tg := &GammaCorrectionPainter{Painter: p}\n\tg.SetGamma(gamma)\n\treturn g\n}\n" }, { "path": "vendor/github.com/golang/freetype/raster/raster.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\n// Package raster provides an anti-aliasing 2-D rasterizer.\n//\n// It is part of the larger Freetype suite of font-related packages, but the\n// raster package is not specific to font rasterization, and can be used\n// standalone without any other Freetype package.\n//\n// Rasterization is done by the same area/coverage accumulation algorithm as\n// the Freetype \"smooth\" module, and the Anti-Grain Geometry library. A\n// description of the area/coverage algorithm is at\n// http://projects.tuxee.net/cl-vectors/section-the-cl-aa-algorithm\npackage raster // import \"github.com/golang/freetype/raster\"\n\nimport (\n\t\"strconv\"\n\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// A cell is part of a linked list (for a given yi co-ordinate) of accumulated\n// area/coverage for the pixel at (xi, yi).\ntype cell struct {\n\txi int\n\tarea, cover int\n\tnext int\n}\n\ntype Rasterizer struct {\n\t// If false, the default behavior is to use the even-odd winding fill\n\t// rule during Rasterize.\n\tUseNonZeroWinding bool\n\t// An offset (in pixels) to the painted spans.\n\tDx, Dy int\n\n\t// The width of the Rasterizer. The height is implicit in len(cellIndex).\n\twidth int\n\t// splitScaleN is the scaling factor used to determine how many times\n\t// to decompose a quadratic or cubic segment into a linear approximation.\n\tsplitScale2, splitScale3 int\n\n\t// The current pen position.\n\ta fixed.Point26_6\n\t// The current cell and its area/coverage being accumulated.\n\txi, yi int\n\tarea, cover int\n\n\t// Saved cells.\n\tcell []cell\n\t// Linked list of cells, one per row.\n\tcellIndex []int\n\t// Buffers.\n\tcellBuf [256]cell\n\tcellIndexBuf [64]int\n\tspanBuf [64]Span\n}\n\n// findCell returns the index in r.cell for the cell corresponding to\n// (r.xi, r.yi). The cell is created if necessary.\nfunc (r *Rasterizer) findCell() int {\n\tif r.yi < 0 || r.yi >= len(r.cellIndex) {\n\t\treturn -1\n\t}\n\txi := r.xi\n\tif xi < 0 {\n\t\txi = -1\n\t} else if xi > r.width {\n\t\txi = r.width\n\t}\n\ti, prev := r.cellIndex[r.yi], -1\n\tfor i != -1 && r.cell[i].xi <= xi {\n\t\tif r.cell[i].xi == xi {\n\t\t\treturn i\n\t\t}\n\t\ti, prev = r.cell[i].next, i\n\t}\n\tc := len(r.cell)\n\tif c == cap(r.cell) {\n\t\tbuf := make([]cell, c, 4*c)\n\t\tcopy(buf, r.cell)\n\t\tr.cell = buf[0 : c+1]\n\t} else {\n\t\tr.cell = r.cell[0 : c+1]\n\t}\n\tr.cell[c] = cell{xi, 0, 0, i}\n\tif prev == -1 {\n\t\tr.cellIndex[r.yi] = c\n\t} else {\n\t\tr.cell[prev].next = c\n\t}\n\treturn c\n}\n\n// saveCell saves any accumulated r.area/r.cover for (r.xi, r.yi).\nfunc (r *Rasterizer) saveCell() {\n\tif r.area != 0 || r.cover != 0 {\n\t\ti := r.findCell()\n\t\tif i != -1 {\n\t\t\tr.cell[i].area += r.area\n\t\t\tr.cell[i].cover += r.cover\n\t\t}\n\t\tr.area = 0\n\t\tr.cover = 0\n\t}\n}\n\n// setCell sets the (xi, yi) cell that r is accumulating area/coverage for.\nfunc (r *Rasterizer) setCell(xi, yi int) {\n\tif r.xi != xi || r.yi != yi {\n\t\tr.saveCell()\n\t\tr.xi, r.yi = xi, yi\n\t}\n}\n\n// scan accumulates area/coverage for the yi'th scanline, going from\n// x0 to x1 in the horizontal direction (in 26.6 fixed point co-ordinates)\n// and from y0f to y1f fractional vertical units within that scanline.\nfunc (r *Rasterizer) scan(yi int, x0, y0f, x1, y1f fixed.Int26_6) {\n\t// Break the 26.6 fixed point X co-ordinates into integral and fractional parts.\n\tx0i := int(x0) / 64\n\tx0f := x0 - fixed.Int26_6(64*x0i)\n\tx1i := int(x1) / 64\n\tx1f := x1 - fixed.Int26_6(64*x1i)\n\n\t// A perfectly horizontal scan.\n\tif y0f == y1f {\n\t\tr.setCell(x1i, yi)\n\t\treturn\n\t}\n\tdx, dy := x1-x0, y1f-y0f\n\t// A single cell scan.\n\tif x0i == x1i {\n\t\tr.area += int((x0f + x1f) * dy)\n\t\tr.cover += int(dy)\n\t\treturn\n\t}\n\t// There are at least two cells. Apart from the first and last cells,\n\t// all intermediate cells go through the full width of the cell,\n\t// or 64 units in 26.6 fixed point format.\n\tvar (\n\t\tp, q, edge0, edge1 fixed.Int26_6\n\t\txiDelta int\n\t)\n\tif dx > 0 {\n\t\tp, q = (64-x0f)*dy, dx\n\t\tedge0, edge1, xiDelta = 0, 64, 1\n\t} else {\n\t\tp, q = x0f*dy, -dx\n\t\tedge0, edge1, xiDelta = 64, 0, -1\n\t}\n\tyDelta, yRem := p/q, p%q\n\tif yRem < 0 {\n\t\tyDelta -= 1\n\t\tyRem += q\n\t}\n\t// Do the first cell.\n\txi, y := x0i, y0f\n\tr.area += int((x0f + edge1) * yDelta)\n\tr.cover += int(yDelta)\n\txi, y = xi+xiDelta, y+yDelta\n\tr.setCell(xi, yi)\n\tif xi != x1i {\n\t\t// Do all the intermediate cells.\n\t\tp = 64 * (y1f - y + yDelta)\n\t\tfullDelta, fullRem := p/q, p%q\n\t\tif fullRem < 0 {\n\t\t\tfullDelta -= 1\n\t\t\tfullRem += q\n\t\t}\n\t\tyRem -= q\n\t\tfor xi != x1i {\n\t\t\tyDelta = fullDelta\n\t\t\tyRem += fullRem\n\t\t\tif yRem >= 0 {\n\t\t\t\tyDelta += 1\n\t\t\t\tyRem -= q\n\t\t\t}\n\t\t\tr.area += int(64 * yDelta)\n\t\t\tr.cover += int(yDelta)\n\t\t\txi, y = xi+xiDelta, y+yDelta\n\t\t\tr.setCell(xi, yi)\n\t\t}\n\t}\n\t// Do the last cell.\n\tyDelta = y1f - y\n\tr.area += int((edge0 + x1f) * yDelta)\n\tr.cover += int(yDelta)\n}\n\n// Start starts a new curve at the given point.\nfunc (r *Rasterizer) Start(a fixed.Point26_6) {\n\tr.setCell(int(a.X/64), int(a.Y/64))\n\tr.a = a\n}\n\n// Add1 adds a linear segment to the current curve.\nfunc (r *Rasterizer) Add1(b fixed.Point26_6) {\n\tx0, y0 := r.a.X, r.a.Y\n\tx1, y1 := b.X, b.Y\n\tdx, dy := x1-x0, y1-y0\n\t// Break the 26.6 fixed point Y co-ordinates into integral and fractional\n\t// parts.\n\ty0i := int(y0) / 64\n\ty0f := y0 - fixed.Int26_6(64*y0i)\n\ty1i := int(y1) / 64\n\ty1f := y1 - fixed.Int26_6(64*y1i)\n\n\tif y0i == y1i {\n\t\t// There is only one scanline.\n\t\tr.scan(y0i, x0, y0f, x1, y1f)\n\n\t} else if dx == 0 {\n\t\t// This is a vertical line segment. We avoid calling r.scan and instead\n\t\t// manipulate r.area and r.cover directly.\n\t\tvar (\n\t\t\tedge0, edge1 fixed.Int26_6\n\t\t\tyiDelta int\n\t\t)\n\t\tif dy > 0 {\n\t\t\tedge0, edge1, yiDelta = 0, 64, 1\n\t\t} else {\n\t\t\tedge0, edge1, yiDelta = 64, 0, -1\n\t\t}\n\t\tx0i, yi := int(x0)/64, y0i\n\t\tx0fTimes2 := (int(x0) - (64 * x0i)) * 2\n\t\t// Do the first pixel.\n\t\tdcover := int(edge1 - y0f)\n\t\tdarea := int(x0fTimes2 * dcover)\n\t\tr.area += darea\n\t\tr.cover += dcover\n\t\tyi += yiDelta\n\t\tr.setCell(x0i, yi)\n\t\t// Do all the intermediate pixels.\n\t\tdcover = int(edge1 - edge0)\n\t\tdarea = int(x0fTimes2 * dcover)\n\t\tfor yi != y1i {\n\t\t\tr.area += darea\n\t\t\tr.cover += dcover\n\t\t\tyi += yiDelta\n\t\t\tr.setCell(x0i, yi)\n\t\t}\n\t\t// Do the last pixel.\n\t\tdcover = int(y1f - edge0)\n\t\tdarea = int(x0fTimes2 * dcover)\n\t\tr.area += darea\n\t\tr.cover += dcover\n\n\t} else {\n\t\t// There are at least two scanlines. Apart from the first and last\n\t\t// scanlines, all intermediate scanlines go through the full height of\n\t\t// the row, or 64 units in 26.6 fixed point format.\n\t\tvar (\n\t\t\tp, q, edge0, edge1 fixed.Int26_6\n\t\t\tyiDelta int\n\t\t)\n\t\tif dy > 0 {\n\t\t\tp, q = (64-y0f)*dx, dy\n\t\t\tedge0, edge1, yiDelta = 0, 64, 1\n\t\t} else {\n\t\t\tp, q = y0f*dx, -dy\n\t\t\tedge0, edge1, yiDelta = 64, 0, -1\n\t\t}\n\t\txDelta, xRem := p/q, p%q\n\t\tif xRem < 0 {\n\t\t\txDelta -= 1\n\t\t\txRem += q\n\t\t}\n\t\t// Do the first scanline.\n\t\tx, yi := x0, y0i\n\t\tr.scan(yi, x, y0f, x+xDelta, edge1)\n\t\tx, yi = x+xDelta, yi+yiDelta\n\t\tr.setCell(int(x)/64, yi)\n\t\tif yi != y1i {\n\t\t\t// Do all the intermediate scanlines.\n\t\t\tp = 64 * dx\n\t\t\tfullDelta, fullRem := p/q, p%q\n\t\t\tif fullRem < 0 {\n\t\t\t\tfullDelta -= 1\n\t\t\t\tfullRem += q\n\t\t\t}\n\t\t\txRem -= q\n\t\t\tfor yi != y1i {\n\t\t\t\txDelta = fullDelta\n\t\t\t\txRem += fullRem\n\t\t\t\tif xRem >= 0 {\n\t\t\t\t\txDelta += 1\n\t\t\t\t\txRem -= q\n\t\t\t\t}\n\t\t\t\tr.scan(yi, x, edge0, x+xDelta, edge1)\n\t\t\t\tx, yi = x+xDelta, yi+yiDelta\n\t\t\t\tr.setCell(int(x)/64, yi)\n\t\t\t}\n\t\t}\n\t\t// Do the last scanline.\n\t\tr.scan(yi, x, edge0, x1, y1f)\n\t}\n\t// The next lineTo starts from b.\n\tr.a = b\n}\n\n// Add2 adds a quadratic segment to the current curve.\nfunc (r *Rasterizer) Add2(b, c fixed.Point26_6) {\n\t// Calculate nSplit (the number of recursive decompositions) based on how\n\t// 'curvy' it is. Specifically, how much the middle point b deviates from\n\t// (a+c)/2.\n\tdev := maxAbs(r.a.X-2*b.X+c.X, r.a.Y-2*b.Y+c.Y) / fixed.Int26_6(r.splitScale2)\n\tnsplit := 0\n\tfor dev > 0 {\n\t\tdev /= 4\n\t\tnsplit++\n\t}\n\t// dev is 32-bit, and nsplit++ every time we shift off 2 bits, so maxNsplit\n\t// is 16.\n\tconst maxNsplit = 16\n\tif nsplit > maxNsplit {\n\t\tpanic(\"freetype/raster: Add2 nsplit too large: \" + strconv.Itoa(nsplit))\n\t}\n\t// Recursively decompose the curve nSplit levels deep.\n\tvar (\n\t\tpStack [2*maxNsplit + 3]fixed.Point26_6\n\t\tsStack [maxNsplit + 1]int\n\t\ti int\n\t)\n\tsStack[0] = nsplit\n\tpStack[0] = c\n\tpStack[1] = b\n\tpStack[2] = r.a\n\tfor i >= 0 {\n\t\ts := sStack[i]\n\t\tp := pStack[2*i:]\n\t\tif s > 0 {\n\t\t\t// Split the quadratic curve p[:3] into an equivalent set of two\n\t\t\t// shorter curves: p[:3] and p[2:5]. The new p[4] is the old p[2],\n\t\t\t// and p[0] is unchanged.\n\t\t\tmx := p[1].X\n\t\t\tp[4].X = p[2].X\n\t\t\tp[3].X = (p[4].X + mx) / 2\n\t\t\tp[1].X = (p[0].X + mx) / 2\n\t\t\tp[2].X = (p[1].X + p[3].X) / 2\n\t\t\tmy := p[1].Y\n\t\t\tp[4].Y = p[2].Y\n\t\t\tp[3].Y = (p[4].Y + my) / 2\n\t\t\tp[1].Y = (p[0].Y + my) / 2\n\t\t\tp[2].Y = (p[1].Y + p[3].Y) / 2\n\t\t\t// The two shorter curves have one less split to do.\n\t\t\tsStack[i] = s - 1\n\t\t\tsStack[i+1] = s - 1\n\t\t\ti++\n\t\t} else {\n\t\t\t// Replace the level-0 quadratic with a two-linear-piece\n\t\t\t// approximation.\n\t\t\tmidx := (p[0].X + 2*p[1].X + p[2].X) / 4\n\t\t\tmidy := (p[0].Y + 2*p[1].Y + p[2].Y) / 4\n\t\t\tr.Add1(fixed.Point26_6{midx, midy})\n\t\t\tr.Add1(p[0])\n\t\t\ti--\n\t\t}\n\t}\n}\n\n// Add3 adds a cubic segment to the current curve.\nfunc (r *Rasterizer) Add3(b, c, d fixed.Point26_6) {\n\t// Calculate nSplit (the number of recursive decompositions) based on how\n\t// 'curvy' it is.\n\tdev2 := maxAbs(r.a.X-3*(b.X+c.X)+d.X, r.a.Y-3*(b.Y+c.Y)+d.Y) / fixed.Int26_6(r.splitScale2)\n\tdev3 := maxAbs(r.a.X-2*b.X+d.X, r.a.Y-2*b.Y+d.Y) / fixed.Int26_6(r.splitScale3)\n\tnsplit := 0\n\tfor dev2 > 0 || dev3 > 0 {\n\t\tdev2 /= 8\n\t\tdev3 /= 4\n\t\tnsplit++\n\t}\n\t// devN is 32-bit, and nsplit++ every time we shift off 2 bits, so\n\t// maxNsplit is 16.\n\tconst maxNsplit = 16\n\tif nsplit > maxNsplit {\n\t\tpanic(\"freetype/raster: Add3 nsplit too large: \" + strconv.Itoa(nsplit))\n\t}\n\t// Recursively decompose the curve nSplit levels deep.\n\tvar (\n\t\tpStack [3*maxNsplit + 4]fixed.Point26_6\n\t\tsStack [maxNsplit + 1]int\n\t\ti int\n\t)\n\tsStack[0] = nsplit\n\tpStack[0] = d\n\tpStack[1] = c\n\tpStack[2] = b\n\tpStack[3] = r.a\n\tfor i >= 0 {\n\t\ts := sStack[i]\n\t\tp := pStack[3*i:]\n\t\tif s > 0 {\n\t\t\t// Split the cubic curve p[:4] into an equivalent set of two\n\t\t\t// shorter curves: p[:4] and p[3:7]. The new p[6] is the old p[3],\n\t\t\t// and p[0] is unchanged.\n\t\t\tm01x := (p[0].X + p[1].X) / 2\n\t\t\tm12x := (p[1].X + p[2].X) / 2\n\t\t\tm23x := (p[2].X + p[3].X) / 2\n\t\t\tp[6].X = p[3].X\n\t\t\tp[5].X = m23x\n\t\t\tp[1].X = m01x\n\t\t\tp[2].X = (m01x + m12x) / 2\n\t\t\tp[4].X = (m12x + m23x) / 2\n\t\t\tp[3].X = (p[2].X + p[4].X) / 2\n\t\t\tm01y := (p[0].Y + p[1].Y) / 2\n\t\t\tm12y := (p[1].Y + p[2].Y) / 2\n\t\t\tm23y := (p[2].Y + p[3].Y) / 2\n\t\t\tp[6].Y = p[3].Y\n\t\t\tp[5].Y = m23y\n\t\t\tp[1].Y = m01y\n\t\t\tp[2].Y = (m01y + m12y) / 2\n\t\t\tp[4].Y = (m12y + m23y) / 2\n\t\t\tp[3].Y = (p[2].Y + p[4].Y) / 2\n\t\t\t// The two shorter curves have one less split to do.\n\t\t\tsStack[i] = s - 1\n\t\t\tsStack[i+1] = s - 1\n\t\t\ti++\n\t\t} else {\n\t\t\t// Replace the level-0 cubic with a two-linear-piece approximation.\n\t\t\tmidx := (p[0].X + 3*(p[1].X+p[2].X) + p[3].X) / 8\n\t\t\tmidy := (p[0].Y + 3*(p[1].Y+p[2].Y) + p[3].Y) / 8\n\t\t\tr.Add1(fixed.Point26_6{midx, midy})\n\t\t\tr.Add1(p[0])\n\t\t\ti--\n\t\t}\n\t}\n}\n\n// AddPath adds the given Path.\nfunc (r *Rasterizer) AddPath(p Path) {\n\tfor i := 0; i < len(p); {\n\t\tswitch p[i] {\n\t\tcase 0:\n\t\t\tr.Start(\n\t\t\t\tfixed.Point26_6{p[i+1], p[i+2]},\n\t\t\t)\n\t\t\ti += 4\n\t\tcase 1:\n\t\t\tr.Add1(\n\t\t\t\tfixed.Point26_6{p[i+1], p[i+2]},\n\t\t\t)\n\t\t\ti += 4\n\t\tcase 2:\n\t\t\tr.Add2(\n\t\t\t\tfixed.Point26_6{p[i+1], p[i+2]},\n\t\t\t\tfixed.Point26_6{p[i+3], p[i+4]},\n\t\t\t)\n\t\t\ti += 6\n\t\tcase 3:\n\t\t\tr.Add3(\n\t\t\t\tfixed.Point26_6{p[i+1], p[i+2]},\n\t\t\t\tfixed.Point26_6{p[i+3], p[i+4]},\n\t\t\t\tfixed.Point26_6{p[i+5], p[i+6]},\n\t\t\t)\n\t\t\ti += 8\n\t\tdefault:\n\t\t\tpanic(\"freetype/raster: bad path\")\n\t\t}\n\t}\n}\n\n// AddStroke adds a stroked Path.\nfunc (r *Rasterizer) AddStroke(q Path, width fixed.Int26_6, cr Capper, jr Joiner) {\n\tStroke(r, q, width, cr, jr)\n}\n\n// areaToAlpha converts an area value to a uint32 alpha value. A completely\n// filled pixel corresponds to an area of 64*64*2, and an alpha of 0xffff. The\n// conversion of area values greater than this depends on the winding rule:\n// even-odd or non-zero.\nfunc (r *Rasterizer) areaToAlpha(area int) uint32 {\n\t// The C Freetype implementation (version 2.3.12) does \"alpha := area>>1\"\n\t// without the +1. Round-to-nearest gives a more symmetric result than\n\t// round-down. The C implementation also returns 8-bit alpha, not 16-bit\n\t// alpha.\n\ta := (area + 1) >> 1\n\tif a < 0 {\n\t\ta = -a\n\t}\n\talpha := uint32(a)\n\tif r.UseNonZeroWinding {\n\t\tif alpha > 0x0fff {\n\t\t\talpha = 0x0fff\n\t\t}\n\t} else {\n\t\talpha &= 0x1fff\n\t\tif alpha > 0x1000 {\n\t\t\talpha = 0x2000 - alpha\n\t\t} else if alpha == 0x1000 {\n\t\t\talpha = 0x0fff\n\t\t}\n\t}\n\t// alpha is now in the range [0x0000, 0x0fff]. Convert that 12-bit alpha to\n\t// 16-bit alpha.\n\treturn alpha<<4 | alpha>>8\n}\n\n// Rasterize converts r's accumulated curves into Spans for p. The Spans passed\n// to p are non-overlapping, and sorted by Y and then X. They all have non-zero\n// width (and 0 <= X0 < X1 <= r.width) and non-zero A, except for the final\n// Span, which has Y, X0, X1 and A all equal to zero.\nfunc (r *Rasterizer) Rasterize(p Painter) {\n\tr.saveCell()\n\ts := 0\n\tfor yi := 0; yi < len(r.cellIndex); yi++ {\n\t\txi, cover := 0, 0\n\t\tfor c := r.cellIndex[yi]; c != -1; c = r.cell[c].next {\n\t\t\tif cover != 0 && r.cell[c].xi > xi {\n\t\t\t\talpha := r.areaToAlpha(cover * 64 * 2)\n\t\t\t\tif alpha != 0 {\n\t\t\t\t\txi0, xi1 := xi, r.cell[c].xi\n\t\t\t\t\tif xi0 < 0 {\n\t\t\t\t\t\txi0 = 0\n\t\t\t\t\t}\n\t\t\t\t\tif xi1 >= r.width {\n\t\t\t\t\t\txi1 = r.width\n\t\t\t\t\t}\n\t\t\t\t\tif xi0 < xi1 {\n\t\t\t\t\t\tr.spanBuf[s] = Span{yi + r.Dy, xi0 + r.Dx, xi1 + r.Dx, alpha}\n\t\t\t\t\t\ts++\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcover += r.cell[c].cover\n\t\t\talpha := r.areaToAlpha(cover*64*2 - r.cell[c].area)\n\t\t\txi = r.cell[c].xi + 1\n\t\t\tif alpha != 0 {\n\t\t\t\txi0, xi1 := r.cell[c].xi, xi\n\t\t\t\tif xi0 < 0 {\n\t\t\t\t\txi0 = 0\n\t\t\t\t}\n\t\t\t\tif xi1 >= r.width {\n\t\t\t\t\txi1 = r.width\n\t\t\t\t}\n\t\t\t\tif xi0 < xi1 {\n\t\t\t\t\tr.spanBuf[s] = Span{yi + r.Dy, xi0 + r.Dx, xi1 + r.Dx, alpha}\n\t\t\t\t\ts++\n\t\t\t\t}\n\t\t\t}\n\t\t\tif s > len(r.spanBuf)-2 {\n\t\t\t\tp.Paint(r.spanBuf[:s], false)\n\t\t\t\ts = 0\n\t\t\t}\n\t\t}\n\t}\n\tp.Paint(r.spanBuf[:s], true)\n}\n\n// Clear cancels any previous calls to r.Start or r.AddXxx.\nfunc (r *Rasterizer) Clear() {\n\tr.a = fixed.Point26_6{}\n\tr.xi = 0\n\tr.yi = 0\n\tr.area = 0\n\tr.cover = 0\n\tr.cell = r.cell[:0]\n\tfor i := 0; i < len(r.cellIndex); i++ {\n\t\tr.cellIndex[i] = -1\n\t}\n}\n\n// SetBounds sets the maximum width and height of the rasterized image and\n// calls Clear. The width and height are in pixels, not fixed.Int26_6 units.\nfunc (r *Rasterizer) SetBounds(width, height int) {\n\tif width < 0 {\n\t\twidth = 0\n\t}\n\tif height < 0 {\n\t\theight = 0\n\t}\n\t// Use the same ssN heuristic as the C Freetype (version 2.4.0)\n\t// implementation.\n\tss2, ss3 := 32, 16\n\tif width > 24 || height > 24 {\n\t\tss2, ss3 = 2*ss2, 2*ss3\n\t\tif width > 120 || height > 120 {\n\t\t\tss2, ss3 = 2*ss2, 2*ss3\n\t\t}\n\t}\n\tr.width = width\n\tr.splitScale2 = ss2\n\tr.splitScale3 = ss3\n\tr.cell = r.cellBuf[:0]\n\tif height > len(r.cellIndexBuf) {\n\t\tr.cellIndex = make([]int, height)\n\t} else {\n\t\tr.cellIndex = r.cellIndexBuf[:height]\n\t}\n\tr.Clear()\n}\n\n// NewRasterizer creates a new Rasterizer with the given bounds.\nfunc NewRasterizer(width, height int) *Rasterizer {\n\tr := new(Rasterizer)\n\tr.SetBounds(width, height)\n\treturn r\n}\n" }, { "path": "vendor/github.com/golang/freetype/raster/stroke.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage raster\n\nimport (\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// Two points are considered practically equal if the square of the distance\n// between them is less than one quarter (i.e. 1024 / 4096).\nconst epsilon = fixed.Int52_12(1024)\n\n// A Capper signifies how to begin or end a stroked path.\ntype Capper interface {\n\t// Cap adds a cap to p given a pivot point and the normal vector of a\n\t// terminal segment. The normal's length is half of the stroke width.\n\tCap(p Adder, halfWidth fixed.Int26_6, pivot, n1 fixed.Point26_6)\n}\n\n// The CapperFunc type adapts an ordinary function to be a Capper.\ntype CapperFunc func(Adder, fixed.Int26_6, fixed.Point26_6, fixed.Point26_6)\n\nfunc (f CapperFunc) Cap(p Adder, halfWidth fixed.Int26_6, pivot, n1 fixed.Point26_6) {\n\tf(p, halfWidth, pivot, n1)\n}\n\n// A Joiner signifies how to join interior nodes of a stroked path.\ntype Joiner interface {\n\t// Join adds a join to the two sides of a stroked path given a pivot\n\t// point and the normal vectors of the trailing and leading segments.\n\t// Both normals have length equal to half of the stroke width.\n\tJoin(lhs, rhs Adder, halfWidth fixed.Int26_6, pivot, n0, n1 fixed.Point26_6)\n}\n\n// The JoinerFunc type adapts an ordinary function to be a Joiner.\ntype JoinerFunc func(lhs, rhs Adder, halfWidth fixed.Int26_6, pivot, n0, n1 fixed.Point26_6)\n\nfunc (f JoinerFunc) Join(lhs, rhs Adder, halfWidth fixed.Int26_6, pivot, n0, n1 fixed.Point26_6) {\n\tf(lhs, rhs, halfWidth, pivot, n0, n1)\n}\n\n// RoundCapper adds round caps to a stroked path.\nvar RoundCapper Capper = CapperFunc(roundCapper)\n\nfunc roundCapper(p Adder, halfWidth fixed.Int26_6, pivot, n1 fixed.Point26_6) {\n\t// The cubic Bézier approximation to a circle involves the magic number\n\t// (√2 - 1) * 4/3, which is approximately 35/64.\n\tconst k = 35\n\te := pRot90CCW(n1)\n\tside := pivot.Add(e)\n\tstart, end := pivot.Sub(n1), pivot.Add(n1)\n\td, e := n1.Mul(k), e.Mul(k)\n\tp.Add3(start.Add(e), side.Sub(d), side)\n\tp.Add3(side.Add(d), end.Add(e), end)\n}\n\n// ButtCapper adds butt caps to a stroked path.\nvar ButtCapper Capper = CapperFunc(buttCapper)\n\nfunc buttCapper(p Adder, halfWidth fixed.Int26_6, pivot, n1 fixed.Point26_6) {\n\tp.Add1(pivot.Add(n1))\n}\n\n// SquareCapper adds square caps to a stroked path.\nvar SquareCapper Capper = CapperFunc(squareCapper)\n\nfunc squareCapper(p Adder, halfWidth fixed.Int26_6, pivot, n1 fixed.Point26_6) {\n\te := pRot90CCW(n1)\n\tside := pivot.Add(e)\n\tp.Add1(side.Sub(n1))\n\tp.Add1(side.Add(n1))\n\tp.Add1(pivot.Add(n1))\n}\n\n// RoundJoiner adds round joins to a stroked path.\nvar RoundJoiner Joiner = JoinerFunc(roundJoiner)\n\nfunc roundJoiner(lhs, rhs Adder, haflWidth fixed.Int26_6, pivot, n0, n1 fixed.Point26_6) {\n\tdot := pDot(pRot90CW(n0), n1)\n\tif dot >= 0 {\n\t\taddArc(lhs, pivot, n0, n1)\n\t\trhs.Add1(pivot.Sub(n1))\n\t} else {\n\t\tlhs.Add1(pivot.Add(n1))\n\t\taddArc(rhs, pivot, pNeg(n0), pNeg(n1))\n\t}\n}\n\n// BevelJoiner adds bevel joins to a stroked path.\nvar BevelJoiner Joiner = JoinerFunc(bevelJoiner)\n\nfunc bevelJoiner(lhs, rhs Adder, haflWidth fixed.Int26_6, pivot, n0, n1 fixed.Point26_6) {\n\tlhs.Add1(pivot.Add(n1))\n\trhs.Add1(pivot.Sub(n1))\n}\n\n// addArc adds a circular arc from pivot+n0 to pivot+n1 to p. The shorter of\n// the two possible arcs is taken, i.e. the one spanning <= 180 degrees. The\n// two vectors n0 and n1 must be of equal length.\nfunc addArc(p Adder, pivot, n0, n1 fixed.Point26_6) {\n\t// r2 is the square of the length of n0.\n\tr2 := pDot(n0, n0)\n\tif r2 < epsilon {\n\t\t// The arc radius is so small that we collapse to a straight line.\n\t\tp.Add1(pivot.Add(n1))\n\t\treturn\n\t}\n\t// We approximate the arc by 0, 1, 2 or 3 45-degree quadratic segments plus\n\t// a final quadratic segment from s to n1. Each 45-degree segment has\n\t// control points {1, 0}, {1, tan(π/8)} and {1/√2, 1/√2} suitably scaled,\n\t// rotated and translated. tan(π/8) is approximately 27/64.\n\tconst tpo8 = 27\n\tvar s fixed.Point26_6\n\t// We determine which octant the angle between n0 and n1 is in via three\n\t// dot products. m0, m1 and m2 are n0 rotated clockwise by 45, 90 and 135\n\t// degrees.\n\tm0 := pRot45CW(n0)\n\tm1 := pRot90CW(n0)\n\tm2 := pRot90CW(m0)\n\tif pDot(m1, n1) >= 0 {\n\t\tif pDot(n0, n1) >= 0 {\n\t\t\tif pDot(m2, n1) <= 0 {\n\t\t\t\t// n1 is between 0 and 45 degrees clockwise of n0.\n\t\t\t\ts = n0\n\t\t\t} else {\n\t\t\t\t// n1 is between 45 and 90 degrees clockwise of n0.\n\t\t\t\tp.Add2(pivot.Add(n0).Add(m1.Mul(tpo8)), pivot.Add(m0))\n\t\t\t\ts = m0\n\t\t\t}\n\t\t} else {\n\t\t\tpm1, n0t := pivot.Add(m1), n0.Mul(tpo8)\n\t\t\tp.Add2(pivot.Add(n0).Add(m1.Mul(tpo8)), pivot.Add(m0))\n\t\t\tp.Add2(pm1.Add(n0t), pm1)\n\t\t\tif pDot(m0, n1) >= 0 {\n\t\t\t\t// n1 is between 90 and 135 degrees clockwise of n0.\n\t\t\t\ts = m1\n\t\t\t} else {\n\t\t\t\t// n1 is between 135 and 180 degrees clockwise of n0.\n\t\t\t\tp.Add2(pm1.Sub(n0t), pivot.Add(m2))\n\t\t\t\ts = m2\n\t\t\t}\n\t\t}\n\t} else {\n\t\tif pDot(n0, n1) >= 0 {\n\t\t\tif pDot(m0, n1) >= 0 {\n\t\t\t\t// n1 is between 0 and 45 degrees counter-clockwise of n0.\n\t\t\t\ts = n0\n\t\t\t} else {\n\t\t\t\t// n1 is between 45 and 90 degrees counter-clockwise of n0.\n\t\t\t\tp.Add2(pivot.Add(n0).Sub(m1.Mul(tpo8)), pivot.Sub(m2))\n\t\t\t\ts = pNeg(m2)\n\t\t\t}\n\t\t} else {\n\t\t\tpm1, n0t := pivot.Sub(m1), n0.Mul(tpo8)\n\t\t\tp.Add2(pivot.Add(n0).Sub(m1.Mul(tpo8)), pivot.Sub(m2))\n\t\t\tp.Add2(pm1.Add(n0t), pm1)\n\t\t\tif pDot(m2, n1) <= 0 {\n\t\t\t\t// n1 is between 90 and 135 degrees counter-clockwise of n0.\n\t\t\t\ts = pNeg(m1)\n\t\t\t} else {\n\t\t\t\t// n1 is between 135 and 180 degrees counter-clockwise of n0.\n\t\t\t\tp.Add2(pm1.Sub(n0t), pivot.Sub(m0))\n\t\t\t\ts = pNeg(m0)\n\t\t\t}\n\t\t}\n\t}\n\t// The final quadratic segment has two endpoints s and n1 and the middle\n\t// control point is a multiple of s.Add(n1), i.e. it is on the angle\n\t// bisector of those two points. The multiple ranges between 128/256 and\n\t// 150/256 as the angle between s and n1 ranges between 0 and 45 degrees.\n\t//\n\t// When the angle is 0 degrees (i.e. s and n1 are coincident) then\n\t// s.Add(n1) is twice s and so the middle control point of the degenerate\n\t// quadratic segment should be half s.Add(n1), and half = 128/256.\n\t//\n\t// When the angle is 45 degrees then 150/256 is the ratio of the lengths of\n\t// the two vectors {1, tan(π/8)} and {1 + 1/√2, 1/√2}.\n\t//\n\t// d is the normalized dot product between s and n1. Since the angle ranges\n\t// between 0 and 45 degrees then d ranges between 256/256 and 181/256.\n\td := 256 * pDot(s, n1) / r2\n\tmultiple := fixed.Int26_6(150-(150-128)*(d-181)/(256-181)) >> 2\n\tp.Add2(pivot.Add(s.Add(n1).Mul(multiple)), pivot.Add(n1))\n}\n\n// midpoint returns the midpoint of two Points.\nfunc midpoint(a, b fixed.Point26_6) fixed.Point26_6 {\n\treturn fixed.Point26_6{(a.X + b.X) / 2, (a.Y + b.Y) / 2}\n}\n\n// angleGreaterThan45 returns whether the angle between two vectors is more\n// than 45 degrees.\nfunc angleGreaterThan45(v0, v1 fixed.Point26_6) bool {\n\tv := pRot45CCW(v0)\n\treturn pDot(v, v1) < 0 || pDot(pRot90CW(v), v1) < 0\n}\n\n// interpolate returns the point (1-t)*a + t*b.\nfunc interpolate(a, b fixed.Point26_6, t fixed.Int52_12) fixed.Point26_6 {\n\ts := 1<<12 - t\n\tx := s*fixed.Int52_12(a.X) + t*fixed.Int52_12(b.X)\n\ty := s*fixed.Int52_12(a.Y) + t*fixed.Int52_12(b.Y)\n\treturn fixed.Point26_6{fixed.Int26_6(x >> 12), fixed.Int26_6(y >> 12)}\n}\n\n// curviest2 returns the value of t for which the quadratic parametric curve\n// (1-t)²*a + 2*t*(1-t).b + t²*c has maximum curvature.\n//\n// The curvature of the parametric curve f(t) = (x(t), y(t)) is\n// |x′y″-y′x″| / (x′²+y′²)^(3/2).\n//\n// Let d = b-a and e = c-2*b+a, so that f′(t) = 2*d+2*e*t and f″(t) = 2*e.\n// The curvature's numerator is (2*dx+2*ex*t)*(2*ey)-(2*dy+2*ey*t)*(2*ex),\n// which simplifies to 4*dx*ey-4*dy*ex, which is constant with respect to t.\n//\n// Thus, curvature is extreme where the denominator is extreme, i.e. where\n// (x′²+y′²) is extreme. The first order condition is that\n// 2*x′*x″+2*y′*y″ = 0, or (dx+ex*t)*ex + (dy+ey*t)*ey = 0.\n// Solving for t gives t = -(dx*ex+dy*ey) / (ex*ex+ey*ey).\nfunc curviest2(a, b, c fixed.Point26_6) fixed.Int52_12 {\n\tdx := int64(b.X - a.X)\n\tdy := int64(b.Y - a.Y)\n\tex := int64(c.X - 2*b.X + a.X)\n\tey := int64(c.Y - 2*b.Y + a.Y)\n\tif ex == 0 && ey == 0 {\n\t\treturn 2048\n\t}\n\treturn fixed.Int52_12(-4096 * (dx*ex + dy*ey) / (ex*ex + ey*ey))\n}\n\n// A stroker holds state for stroking a path.\ntype stroker struct {\n\t// p is the destination that records the stroked path.\n\tp Adder\n\t// u is the half-width of the stroke.\n\tu fixed.Int26_6\n\t// cr and jr specify how to end and connect path segments.\n\tcr Capper\n\tjr Joiner\n\t// r is the reverse path. Stroking a path involves constructing two\n\t// parallel paths 2*u apart. The first path is added immediately to p,\n\t// the second path is accumulated in r and eventually added in reverse.\n\tr Path\n\t// a is the most recent segment point. anorm is the segment normal of\n\t// length u at that point.\n\ta, anorm fixed.Point26_6\n}\n\n// addNonCurvy2 adds a quadratic segment to the stroker, where the segment\n// defined by (k.a, b, c) achieves maximum curvature at either k.a or c.\nfunc (k *stroker) addNonCurvy2(b, c fixed.Point26_6) {\n\t// We repeatedly divide the segment at its middle until it is straight\n\t// enough to approximate the stroke by just translating the control points.\n\t// ds and ps are stacks of depths and points. t is the top of the stack.\n\tconst maxDepth = 5\n\tvar (\n\t\tds [maxDepth + 1]int\n\t\tps [2*maxDepth + 3]fixed.Point26_6\n\t\tt int\n\t)\n\t// Initially the ps stack has one quadratic segment of depth zero.\n\tds[0] = 0\n\tps[2] = k.a\n\tps[1] = b\n\tps[0] = c\n\tanorm := k.anorm\n\tvar cnorm fixed.Point26_6\n\n\tfor {\n\t\tdepth := ds[t]\n\t\ta := ps[2*t+2]\n\t\tb := ps[2*t+1]\n\t\tc := ps[2*t+0]\n\t\tab := b.Sub(a)\n\t\tbc := c.Sub(b)\n\t\tabIsSmall := pDot(ab, ab) < fixed.Int52_12(1<<12)\n\t\tbcIsSmall := pDot(bc, bc) < fixed.Int52_12(1<<12)\n\t\tif abIsSmall && bcIsSmall {\n\t\t\t// Approximate the segment by a circular arc.\n\t\t\tcnorm = pRot90CCW(pNorm(bc, k.u))\n\t\t\tmac := midpoint(a, c)\n\t\t\taddArc(k.p, mac, anorm, cnorm)\n\t\t\taddArc(&k.r, mac, pNeg(anorm), pNeg(cnorm))\n\t\t} else if depth < maxDepth && angleGreaterThan45(ab, bc) {\n\t\t\t// Divide the segment in two and push both halves on the stack.\n\t\t\tmab := midpoint(a, b)\n\t\t\tmbc := midpoint(b, c)\n\t\t\tt++\n\t\t\tds[t+0] = depth + 1\n\t\t\tds[t-1] = depth + 1\n\t\t\tps[2*t+2] = a\n\t\t\tps[2*t+1] = mab\n\t\t\tps[2*t+0] = midpoint(mab, mbc)\n\t\t\tps[2*t-1] = mbc\n\t\t\tcontinue\n\t\t} else {\n\t\t\t// Translate the control points.\n\t\t\tbnorm := pRot90CCW(pNorm(c.Sub(a), k.u))\n\t\t\tcnorm = pRot90CCW(pNorm(bc, k.u))\n\t\t\tk.p.Add2(b.Add(bnorm), c.Add(cnorm))\n\t\t\tk.r.Add2(b.Sub(bnorm), c.Sub(cnorm))\n\t\t}\n\t\tif t == 0 {\n\t\t\tk.a, k.anorm = c, cnorm\n\t\t\treturn\n\t\t}\n\t\tt--\n\t\tanorm = cnorm\n\t}\n\tpanic(\"unreachable\")\n}\n\n// Add1 adds a linear segment to the stroker.\nfunc (k *stroker) Add1(b fixed.Point26_6) {\n\tbnorm := pRot90CCW(pNorm(b.Sub(k.a), k.u))\n\tif len(k.r) == 0 {\n\t\tk.p.Start(k.a.Add(bnorm))\n\t\tk.r.Start(k.a.Sub(bnorm))\n\t} else {\n\t\tk.jr.Join(k.p, &k.r, k.u, k.a, k.anorm, bnorm)\n\t}\n\tk.p.Add1(b.Add(bnorm))\n\tk.r.Add1(b.Sub(bnorm))\n\tk.a, k.anorm = b, bnorm\n}\n\n// Add2 adds a quadratic segment to the stroker.\nfunc (k *stroker) Add2(b, c fixed.Point26_6) {\n\tab := b.Sub(k.a)\n\tbc := c.Sub(b)\n\tabnorm := pRot90CCW(pNorm(ab, k.u))\n\tif len(k.r) == 0 {\n\t\tk.p.Start(k.a.Add(abnorm))\n\t\tk.r.Start(k.a.Sub(abnorm))\n\t} else {\n\t\tk.jr.Join(k.p, &k.r, k.u, k.a, k.anorm, abnorm)\n\t}\n\n\t// Approximate nearly-degenerate quadratics by linear segments.\n\tabIsSmall := pDot(ab, ab) < epsilon\n\tbcIsSmall := pDot(bc, bc) < epsilon\n\tif abIsSmall || bcIsSmall {\n\t\tacnorm := pRot90CCW(pNorm(c.Sub(k.a), k.u))\n\t\tk.p.Add1(c.Add(acnorm))\n\t\tk.r.Add1(c.Sub(acnorm))\n\t\tk.a, k.anorm = c, acnorm\n\t\treturn\n\t}\n\n\t// The quadratic segment (k.a, b, c) has a point of maximum curvature.\n\t// If this occurs at an end point, we process the segment as a whole.\n\tt := curviest2(k.a, b, c)\n\tif t <= 0 || 4096 <= t {\n\t\tk.addNonCurvy2(b, c)\n\t\treturn\n\t}\n\n\t// Otherwise, we perform a de Casteljau decomposition at the point of\n\t// maximum curvature and process the two straighter parts.\n\tmab := interpolate(k.a, b, t)\n\tmbc := interpolate(b, c, t)\n\tmabc := interpolate(mab, mbc, t)\n\n\t// If the vectors ab and bc are close to being in opposite directions,\n\t// then the decomposition can become unstable, so we approximate the\n\t// quadratic segment by two linear segments joined by an arc.\n\tbcnorm := pRot90CCW(pNorm(bc, k.u))\n\tif pDot(abnorm, bcnorm) < -fixed.Int52_12(k.u)*fixed.Int52_12(k.u)*2047/2048 {\n\t\tpArc := pDot(abnorm, bc) < 0\n\n\t\tk.p.Add1(mabc.Add(abnorm))\n\t\tif pArc {\n\t\t\tz := pRot90CW(abnorm)\n\t\t\taddArc(k.p, mabc, abnorm, z)\n\t\t\taddArc(k.p, mabc, z, bcnorm)\n\t\t}\n\t\tk.p.Add1(mabc.Add(bcnorm))\n\t\tk.p.Add1(c.Add(bcnorm))\n\n\t\tk.r.Add1(mabc.Sub(abnorm))\n\t\tif !pArc {\n\t\t\tz := pRot90CW(abnorm)\n\t\t\taddArc(&k.r, mabc, pNeg(abnorm), z)\n\t\t\taddArc(&k.r, mabc, z, pNeg(bcnorm))\n\t\t}\n\t\tk.r.Add1(mabc.Sub(bcnorm))\n\t\tk.r.Add1(c.Sub(bcnorm))\n\n\t\tk.a, k.anorm = c, bcnorm\n\t\treturn\n\t}\n\n\t// Process the decomposed parts.\n\tk.addNonCurvy2(mab, mabc)\n\tk.addNonCurvy2(mbc, c)\n}\n\n// Add3 adds a cubic segment to the stroker.\nfunc (k *stroker) Add3(b, c, d fixed.Point26_6) {\n\tpanic(\"freetype/raster: stroke unimplemented for cubic segments\")\n}\n\n// stroke adds the stroked Path q to p, where q consists of exactly one curve.\nfunc (k *stroker) stroke(q Path) {\n\t// Stroking is implemented by deriving two paths each k.u apart from q.\n\t// The left-hand-side path is added immediately to k.p; the right-hand-side\n\t// path is accumulated in k.r. Once we've finished adding the LHS to k.p,\n\t// we add the RHS in reverse order.\n\tk.r = make(Path, 0, len(q))\n\tk.a = fixed.Point26_6{q[1], q[2]}\n\tfor i := 4; i < len(q); {\n\t\tswitch q[i] {\n\t\tcase 1:\n\t\t\tk.Add1(\n\t\t\t\tfixed.Point26_6{q[i+1], q[i+2]},\n\t\t\t)\n\t\t\ti += 4\n\t\tcase 2:\n\t\t\tk.Add2(\n\t\t\t\tfixed.Point26_6{q[i+1], q[i+2]},\n\t\t\t\tfixed.Point26_6{q[i+3], q[i+4]},\n\t\t\t)\n\t\t\ti += 6\n\t\tcase 3:\n\t\t\tk.Add3(\n\t\t\t\tfixed.Point26_6{q[i+1], q[i+2]},\n\t\t\t\tfixed.Point26_6{q[i+3], q[i+4]},\n\t\t\t\tfixed.Point26_6{q[i+5], q[i+6]},\n\t\t\t)\n\t\t\ti += 8\n\t\tdefault:\n\t\t\tpanic(\"freetype/raster: bad path\")\n\t\t}\n\t}\n\tif len(k.r) == 0 {\n\t\treturn\n\t}\n\t// TODO(nigeltao): if q is a closed curve then we should join the first and\n\t// last segments instead of capping them.\n\tk.cr.Cap(k.p, k.u, q.lastPoint(), pNeg(k.anorm))\n\taddPathReversed(k.p, k.r)\n\tpivot := q.firstPoint()\n\tk.cr.Cap(k.p, k.u, pivot, pivot.Sub(fixed.Point26_6{k.r[1], k.r[2]}))\n}\n\n// Stroke adds q stroked with the given width to p. The result is typically\n// self-intersecting and should be rasterized with UseNonZeroWinding.\n// cr and jr may be nil, which defaults to a RoundCapper or RoundJoiner.\nfunc Stroke(p Adder, q Path, width fixed.Int26_6, cr Capper, jr Joiner) {\n\tif len(q) == 0 {\n\t\treturn\n\t}\n\tif cr == nil {\n\t\tcr = RoundCapper\n\t}\n\tif jr == nil {\n\t\tjr = RoundJoiner\n\t}\n\tif q[0] != 0 {\n\t\tpanic(\"freetype/raster: bad path\")\n\t}\n\ts := stroker{p: p, u: width / 2, cr: cr, jr: jr}\n\ti := 0\n\tfor j := 4; j < len(q); {\n\t\tswitch q[j] {\n\t\tcase 0:\n\t\t\ts.stroke(q[i:j])\n\t\t\ti, j = j, j+4\n\t\tcase 1:\n\t\t\tj += 4\n\t\tcase 2:\n\t\t\tj += 6\n\t\tcase 3:\n\t\t\tj += 8\n\t\tdefault:\n\t\t\tpanic(\"freetype/raster: bad path\")\n\t\t}\n\t}\n\ts.stroke(q[i:])\n}\n" }, { "path": "vendor/github.com/golang/freetype/truetype/face.go", "content": "// Copyright 2015 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage truetype\n\nimport (\n\t\"image\"\n\t\"math\"\n\n\t\"github.com/golang/freetype/raster\"\n\t\"golang.org/x/image/font\"\n\t\"golang.org/x/image/math/fixed\"\n)\n\nfunc powerOf2(i int) bool {\n\treturn i != 0 && (i&(i-1)) == 0\n}\n\n// Options are optional arguments to NewFace.\ntype Options struct {\n\t// Size is the font size in points, as in \"a 10 point font size\".\n\t//\n\t// A zero value means to use a 12 point font size.\n\tSize float64\n\n\t// DPI is the dots-per-inch resolution.\n\t//\n\t// A zero value means to use 72 DPI.\n\tDPI float64\n\n\t// Hinting is how to quantize the glyph nodes.\n\t//\n\t// A zero value means to use no hinting.\n\tHinting font.Hinting\n\n\t// GlyphCacheEntries is the number of entries in the glyph mask image\n\t// cache.\n\t//\n\t// If non-zero, it must be a power of 2.\n\t//\n\t// A zero value means to use 512 entries.\n\tGlyphCacheEntries int\n\n\t// SubPixelsX is the number of sub-pixel locations a glyph's dot is\n\t// quantized to, in the horizontal direction. For example, a value of 8\n\t// means that the dot is quantized to 1/8th of a pixel. This quantization\n\t// only affects the glyph mask image, not its bounding box or advance\n\t// width. A higher value gives a more faithful glyph image, but reduces the\n\t// effectiveness of the glyph cache.\n\t//\n\t// If non-zero, it must be a power of 2, and be between 1 and 64 inclusive.\n\t//\n\t// A zero value means to use 4 sub-pixel locations.\n\tSubPixelsX int\n\n\t// SubPixelsY is the number of sub-pixel locations a glyph's dot is\n\t// quantized to, in the vertical direction. For example, a value of 8\n\t// means that the dot is quantized to 1/8th of a pixel. This quantization\n\t// only affects the glyph mask image, not its bounding box or advance\n\t// width. A higher value gives a more faithful glyph image, but reduces the\n\t// effectiveness of the glyph cache.\n\t//\n\t// If non-zero, it must be a power of 2, and be between 1 and 64 inclusive.\n\t//\n\t// A zero value means to use 1 sub-pixel location.\n\tSubPixelsY int\n}\n\nfunc (o *Options) size() float64 {\n\tif o != nil && o.Size > 0 {\n\t\treturn o.Size\n\t}\n\treturn 12\n}\n\nfunc (o *Options) dpi() float64 {\n\tif o != nil && o.DPI > 0 {\n\t\treturn o.DPI\n\t}\n\treturn 72\n}\n\nfunc (o *Options) hinting() font.Hinting {\n\tif o != nil {\n\t\tswitch o.Hinting {\n\t\tcase font.HintingVertical, font.HintingFull:\n\t\t\t// TODO: support vertical hinting.\n\t\t\treturn font.HintingFull\n\t\t}\n\t}\n\treturn font.HintingNone\n}\n\nfunc (o *Options) glyphCacheEntries() int {\n\tif o != nil && powerOf2(o.GlyphCacheEntries) {\n\t\treturn o.GlyphCacheEntries\n\t}\n\t// 512 is 128 * 4 * 1, which lets us cache 128 glyphs at 4 * 1 subpixel\n\t// locations in the X and Y direction.\n\treturn 512\n}\n\nfunc (o *Options) subPixelsX() (value uint32, halfQuantum, mask fixed.Int26_6) {\n\tif o != nil {\n\t\tswitch o.SubPixelsX {\n\t\tcase 1, 2, 4, 8, 16, 32, 64:\n\t\t\treturn subPixels(o.SubPixelsX)\n\t\t}\n\t}\n\t// This default value of 4 isn't based on anything scientific, merely as\n\t// small a number as possible that looks almost as good as no quantization,\n\t// or returning subPixels(64).\n\treturn subPixels(4)\n}\n\nfunc (o *Options) subPixelsY() (value uint32, halfQuantum, mask fixed.Int26_6) {\n\tif o != nil {\n\t\tswitch o.SubPixelsX {\n\t\tcase 1, 2, 4, 8, 16, 32, 64:\n\t\t\treturn subPixels(o.SubPixelsX)\n\t\t}\n\t}\n\t// This default value of 1 isn't based on anything scientific, merely that\n\t// vertical sub-pixel glyph rendering is pretty rare. Baseline locations\n\t// can usually afford to snap to the pixel grid, so the vertical direction\n\t// doesn't have the deal with the horizontal's fractional advance widths.\n\treturn subPixels(1)\n}\n\n// subPixels returns q and the bias and mask that leads to q quantized\n// sub-pixel locations per full pixel.\n//\n// For example, q == 4 leads to a bias of 8 and a mask of 0xfffffff0, or -16,\n// because we want to round fractions of fixed.Int26_6 as:\n//\t- 0 to 7 rounds to 0.\n//\t- 8 to 23 rounds to 16.\n//\t- 24 to 39 rounds to 32.\n//\t- 40 to 55 rounds to 48.\n//\t- 56 to 63 rounds to 64.\n// which means to add 8 and then bitwise-and with -16, in two's complement\n// representation.\n//\n// When q == 1, we want bias == 32 and mask == -64.\n// When q == 2, we want bias == 16 and mask == -32.\n// When q == 4, we want bias == 8 and mask == -16.\n// ...\n// When q == 64, we want bias == 0 and mask == -1. (The no-op case).\n// The pattern is clear.\nfunc subPixels(q int) (value uint32, bias, mask fixed.Int26_6) {\n\treturn uint32(q), 32 / fixed.Int26_6(q), -64 / fixed.Int26_6(q)\n}\n\n// glyphCacheEntry caches the arguments and return values of rasterize.\ntype glyphCacheEntry struct {\n\tkey glyphCacheKey\n\tval glyphCacheVal\n}\n\ntype glyphCacheKey struct {\n\tindex Index\n\tfx, fy uint8\n}\n\ntype glyphCacheVal struct {\n\tadvanceWidth fixed.Int26_6\n\toffset image.Point\n\tgw int\n\tgh int\n}\n\ntype indexCacheEntry struct {\n\trune rune\n\tindex Index\n}\n\n// NewFace returns a new font.Face for the given Font.\nfunc NewFace(f *Font, opts *Options) font.Face {\n\ta := &face{\n\t\tf: f,\n\t\thinting: opts.hinting(),\n\t\tscale: fixed.Int26_6(0.5 + (opts.size() * opts.dpi() * 64 / 72)),\n\t\tglyphCache: make([]glyphCacheEntry, opts.glyphCacheEntries()),\n\t}\n\ta.subPixelX, a.subPixelBiasX, a.subPixelMaskX = opts.subPixelsX()\n\ta.subPixelY, a.subPixelBiasY, a.subPixelMaskY = opts.subPixelsY()\n\n\t// Fill the cache with invalid entries. Valid glyph cache entries have fx\n\t// and fy in the range [0, 64). Valid index cache entries have rune >= 0.\n\tfor i := range a.glyphCache {\n\t\ta.glyphCache[i].key.fy = 0xff\n\t}\n\tfor i := range a.indexCache {\n\t\ta.indexCache[i].rune = -1\n\t}\n\n\t// Set the rasterizer's bounds to be big enough to handle the largest glyph.\n\tb := f.Bounds(a.scale)\n\txmin := +int(b.Min.X) >> 6\n\tymin := -int(b.Max.Y) >> 6\n\txmax := +int(b.Max.X+63) >> 6\n\tymax := -int(b.Min.Y-63) >> 6\n\ta.maxw = xmax - xmin\n\ta.maxh = ymax - ymin\n\ta.masks = image.NewAlpha(image.Rect(0, 0, a.maxw, a.maxh*len(a.glyphCache)))\n\ta.r.SetBounds(a.maxw, a.maxh)\n\ta.p = facePainter{a}\n\n\treturn a\n}\n\ntype face struct {\n\tf *Font\n\thinting font.Hinting\n\tscale fixed.Int26_6\n\tsubPixelX uint32\n\tsubPixelBiasX fixed.Int26_6\n\tsubPixelMaskX fixed.Int26_6\n\tsubPixelY uint32\n\tsubPixelBiasY fixed.Int26_6\n\tsubPixelMaskY fixed.Int26_6\n\tmasks *image.Alpha\n\tglyphCache []glyphCacheEntry\n\tr raster.Rasterizer\n\tp raster.Painter\n\tpaintOffset int\n\tmaxw int\n\tmaxh int\n\tglyphBuf GlyphBuf\n\tindexCache [indexCacheLen]indexCacheEntry\n\n\t// TODO: clip rectangle?\n}\n\nconst indexCacheLen = 256\n\nfunc (a *face) index(r rune) Index {\n\tconst mask = indexCacheLen - 1\n\tc := &a.indexCache[r&mask]\n\tif c.rune == r {\n\t\treturn c.index\n\t}\n\ti := a.f.Index(r)\n\tc.rune = r\n\tc.index = i\n\treturn i\n}\n\n// Close satisfies the font.Face interface.\nfunc (a *face) Close() error { return nil }\n\n// Metrics satisfies the font.Face interface.\nfunc (a *face) Metrics() font.Metrics {\n\tscale := float64(a.scale)\n\tfupe := float64(a.f.FUnitsPerEm())\n\treturn font.Metrics{\n\t\tHeight: a.scale,\n\t\tAscent: fixed.Int26_6(math.Ceil(scale * float64(+a.f.ascent) / fupe)),\n\t\tDescent: fixed.Int26_6(math.Ceil(scale * float64(-a.f.descent) / fupe)),\n\t}\n}\n\n// Kern satisfies the font.Face interface.\nfunc (a *face) Kern(r0, r1 rune) fixed.Int26_6 {\n\ti0 := a.index(r0)\n\ti1 := a.index(r1)\n\tkern := a.f.Kern(a.scale, i0, i1)\n\tif a.hinting != font.HintingNone {\n\t\tkern = (kern + 32) &^ 63\n\t}\n\treturn kern\n}\n\n// Glyph satisfies the font.Face interface.\nfunc (a *face) Glyph(dot fixed.Point26_6, r rune) (\n\tdr image.Rectangle, mask image.Image, maskp image.Point, advance fixed.Int26_6, ok bool) {\n\n\t// Quantize to the sub-pixel granularity.\n\tdotX := (dot.X + a.subPixelBiasX) & a.subPixelMaskX\n\tdotY := (dot.Y + a.subPixelBiasY) & a.subPixelMaskY\n\n\t// Split the coordinates into their integer and fractional parts.\n\tix, fx := int(dotX>>6), dotX&0x3f\n\tiy, fy := int(dotY>>6), dotY&0x3f\n\n\tindex := a.index(r)\n\tcIndex := uint32(index)\n\tcIndex = cIndex*a.subPixelX - uint32(fx/a.subPixelMaskX)\n\tcIndex = cIndex*a.subPixelY - uint32(fy/a.subPixelMaskY)\n\tcIndex &= uint32(len(a.glyphCache) - 1)\n\ta.paintOffset = a.maxh * int(cIndex)\n\tk := glyphCacheKey{\n\t\tindex: index,\n\t\tfx: uint8(fx),\n\t\tfy: uint8(fy),\n\t}\n\tvar v glyphCacheVal\n\tif a.glyphCache[cIndex].key != k {\n\t\tvar ok bool\n\t\tv, ok = a.rasterize(index, fx, fy)\n\t\tif !ok {\n\t\t\treturn image.Rectangle{}, nil, image.Point{}, 0, false\n\t\t}\n\t\ta.glyphCache[cIndex] = glyphCacheEntry{k, v}\n\t} else {\n\t\tv = a.glyphCache[cIndex].val\n\t}\n\n\tdr.Min = image.Point{\n\t\tX: ix + v.offset.X,\n\t\tY: iy + v.offset.Y,\n\t}\n\tdr.Max = image.Point{\n\t\tX: dr.Min.X + v.gw,\n\t\tY: dr.Min.Y + v.gh,\n\t}\n\treturn dr, a.masks, image.Point{Y: a.paintOffset}, v.advanceWidth, true\n}\n\nfunc (a *face) GlyphBounds(r rune) (bounds fixed.Rectangle26_6, advance fixed.Int26_6, ok bool) {\n\tif err := a.glyphBuf.Load(a.f, a.scale, a.index(r), a.hinting); err != nil {\n\t\treturn fixed.Rectangle26_6{}, 0, false\n\t}\n\txmin := +a.glyphBuf.Bounds.Min.X\n\tymin := -a.glyphBuf.Bounds.Max.Y\n\txmax := +a.glyphBuf.Bounds.Max.X\n\tymax := -a.glyphBuf.Bounds.Min.Y\n\tif xmin > xmax || ymin > ymax {\n\t\treturn fixed.Rectangle26_6{}, 0, false\n\t}\n\treturn fixed.Rectangle26_6{\n\t\tMin: fixed.Point26_6{\n\t\t\tX: xmin,\n\t\t\tY: ymin,\n\t\t},\n\t\tMax: fixed.Point26_6{\n\t\t\tX: xmax,\n\t\t\tY: ymax,\n\t\t},\n\t}, a.glyphBuf.AdvanceWidth, true\n}\n\nfunc (a *face) GlyphAdvance(r rune) (advance fixed.Int26_6, ok bool) {\n\tif err := a.glyphBuf.Load(a.f, a.scale, a.index(r), a.hinting); err != nil {\n\t\treturn 0, false\n\t}\n\treturn a.glyphBuf.AdvanceWidth, true\n}\n\n// rasterize returns the advance width, integer-pixel offset to render at, and\n// the width and height of the given glyph at the given sub-pixel offsets.\n//\n// The 26.6 fixed point arguments fx and fy must be in the range [0, 1).\nfunc (a *face) rasterize(index Index, fx, fy fixed.Int26_6) (v glyphCacheVal, ok bool) {\n\tif err := a.glyphBuf.Load(a.f, a.scale, index, a.hinting); err != nil {\n\t\treturn glyphCacheVal{}, false\n\t}\n\t// Calculate the integer-pixel bounds for the glyph.\n\txmin := int(fx+a.glyphBuf.Bounds.Min.X) >> 6\n\tymin := int(fy-a.glyphBuf.Bounds.Max.Y) >> 6\n\txmax := int(fx+a.glyphBuf.Bounds.Max.X+0x3f) >> 6\n\tymax := int(fy-a.glyphBuf.Bounds.Min.Y+0x3f) >> 6\n\tif xmin > xmax || ymin > ymax {\n\t\treturn glyphCacheVal{}, false\n\t}\n\t// A TrueType's glyph's nodes can have negative co-ordinates, but the\n\t// rasterizer clips anything left of x=0 or above y=0. xmin and ymin are\n\t// the pixel offsets, based on the font's FUnit metrics, that let a\n\t// negative co-ordinate in TrueType space be non-negative in rasterizer\n\t// space. xmin and ymin are typically <= 0.\n\tfx -= fixed.Int26_6(xmin << 6)\n\tfy -= fixed.Int26_6(ymin << 6)\n\t// Rasterize the glyph's vectors.\n\ta.r.Clear()\n\tpixOffset := a.paintOffset * a.maxw\n\tclear(a.masks.Pix[pixOffset : pixOffset+a.maxw*a.maxh])\n\te0 := 0\n\tfor _, e1 := range a.glyphBuf.Ends {\n\t\ta.drawContour(a.glyphBuf.Points[e0:e1], fx, fy)\n\t\te0 = e1\n\t}\n\ta.r.Rasterize(a.p)\n\treturn glyphCacheVal{\n\t\ta.glyphBuf.AdvanceWidth,\n\t\timage.Point{xmin, ymin},\n\t\txmax - xmin,\n\t\tymax - ymin,\n\t}, true\n}\n\nfunc clear(pix []byte) {\n\tfor i := range pix {\n\t\tpix[i] = 0\n\t}\n}\n\n// drawContour draws the given closed contour with the given offset.\nfunc (a *face) drawContour(ps []Point, dx, dy fixed.Int26_6) {\n\tif len(ps) == 0 {\n\t\treturn\n\t}\n\n\t// The low bit of each point's Flags value is whether the point is on the\n\t// curve. Truetype fonts only have quadratic Bézier curves, not cubics.\n\t// Thus, two consecutive off-curve points imply an on-curve point in the\n\t// middle of those two.\n\t//\n\t// See http://chanae.walon.org/pub/ttf/ttf_glyphs.htm for more details.\n\n\t// ps[0] is a truetype.Point measured in FUnits and positive Y going\n\t// upwards. start is the same thing measured in fixed point units and\n\t// positive Y going downwards, and offset by (dx, dy).\n\tstart := fixed.Point26_6{\n\t\tX: dx + ps[0].X,\n\t\tY: dy - ps[0].Y,\n\t}\n\tvar others []Point\n\tif ps[0].Flags&0x01 != 0 {\n\t\tothers = ps[1:]\n\t} else {\n\t\tlast := fixed.Point26_6{\n\t\t\tX: dx + ps[len(ps)-1].X,\n\t\t\tY: dy - ps[len(ps)-1].Y,\n\t\t}\n\t\tif ps[len(ps)-1].Flags&0x01 != 0 {\n\t\t\tstart = last\n\t\t\tothers = ps[:len(ps)-1]\n\t\t} else {\n\t\t\tstart = fixed.Point26_6{\n\t\t\t\tX: (start.X + last.X) / 2,\n\t\t\t\tY: (start.Y + last.Y) / 2,\n\t\t\t}\n\t\t\tothers = ps\n\t\t}\n\t}\n\ta.r.Start(start)\n\tq0, on0 := start, true\n\tfor _, p := range others {\n\t\tq := fixed.Point26_6{\n\t\t\tX: dx + p.X,\n\t\t\tY: dy - p.Y,\n\t\t}\n\t\ton := p.Flags&0x01 != 0\n\t\tif on {\n\t\t\tif on0 {\n\t\t\t\ta.r.Add1(q)\n\t\t\t} else {\n\t\t\t\ta.r.Add2(q0, q)\n\t\t\t}\n\t\t} else {\n\t\t\tif on0 {\n\t\t\t\t// No-op.\n\t\t\t} else {\n\t\t\t\tmid := fixed.Point26_6{\n\t\t\t\t\tX: (q0.X + q.X) / 2,\n\t\t\t\t\tY: (q0.Y + q.Y) / 2,\n\t\t\t\t}\n\t\t\t\ta.r.Add2(q0, mid)\n\t\t\t}\n\t\t}\n\t\tq0, on0 = q, on\n\t}\n\t// Close the curve.\n\tif on0 {\n\t\ta.r.Add1(start)\n\t} else {\n\t\ta.r.Add2(q0, start)\n\t}\n}\n\n// facePainter is like a raster.AlphaSrcPainter, with an additional Y offset\n// (face.paintOffset) to the painted spans.\ntype facePainter struct {\n\ta *face\n}\n\nfunc (p facePainter) Paint(ss []raster.Span, done bool) {\n\tm := p.a.masks\n\tb := m.Bounds()\n\tb.Min.Y = p.a.paintOffset\n\tb.Max.Y = p.a.paintOffset + p.a.maxh\n\tfor _, s := range ss {\n\t\ts.Y += p.a.paintOffset\n\t\tif s.Y < b.Min.Y {\n\t\t\tcontinue\n\t\t}\n\t\tif s.Y >= b.Max.Y {\n\t\t\treturn\n\t\t}\n\t\tif s.X0 < b.Min.X {\n\t\t\ts.X0 = b.Min.X\n\t\t}\n\t\tif s.X1 > b.Max.X {\n\t\t\ts.X1 = b.Max.X\n\t\t}\n\t\tif s.X0 >= s.X1 {\n\t\t\tcontinue\n\t\t}\n\t\tbase := (s.Y-m.Rect.Min.Y)*m.Stride - m.Rect.Min.X\n\t\tp := m.Pix[base+s.X0 : base+s.X1]\n\t\tcolor := uint8(s.Alpha >> 8)\n\t\tfor i := range p {\n\t\t\tp[i] = color\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/golang/freetype/truetype/glyph.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage truetype\n\nimport (\n\t\"golang.org/x/image/font\"\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// TODO: implement VerticalHinting.\n\n// A Point is a co-ordinate pair plus whether it is 'on' a contour or an 'off'\n// control point.\ntype Point struct {\n\tX, Y fixed.Int26_6\n\t// The Flags' LSB means whether or not this Point is 'on' the contour.\n\t// Other bits are reserved for internal use.\n\tFlags uint32\n}\n\n// A GlyphBuf holds a glyph's contours. A GlyphBuf can be re-used to load a\n// series of glyphs from a Font.\ntype GlyphBuf struct {\n\t// AdvanceWidth is the glyph's advance width.\n\tAdvanceWidth fixed.Int26_6\n\t// Bounds is the glyph's bounding box.\n\tBounds fixed.Rectangle26_6\n\t// Points contains all Points from all contours of the glyph. If hinting\n\t// was used to load a glyph then Unhinted contains those Points before they\n\t// were hinted, and InFontUnits contains those Points before they were\n\t// hinted and scaled.\n\tPoints, Unhinted, InFontUnits []Point\n\t// Ends is the point indexes of the end point of each contour. The length\n\t// of Ends is the number of contours in the glyph. The i'th contour\n\t// consists of points Points[Ends[i-1]:Ends[i]], where Ends[-1] is\n\t// interpreted to mean zero.\n\tEnds []int\n\n\tfont *Font\n\tscale fixed.Int26_6\n\thinting font.Hinting\n\thinter hinter\n\t// phantomPoints are the co-ordinates of the synthetic phantom points\n\t// used for hinting and bounding box calculations.\n\tphantomPoints [4]Point\n\t// pp1x is the X co-ordinate of the first phantom point. The '1' is\n\t// using 1-based indexing; pp1x is almost always phantomPoints[0].X.\n\t// TODO: eliminate this and consistently use phantomPoints[0].X.\n\tpp1x fixed.Int26_6\n\t// metricsSet is whether the glyph's metrics have been set yet. For a\n\t// compound glyph, a sub-glyph may override the outer glyph's metrics.\n\tmetricsSet bool\n\t// tmp is a scratch buffer.\n\ttmp []Point\n}\n\n// Flags for decoding a glyph's contours. These flags are documented at\n// http://developer.apple.com/fonts/TTRefMan/RM06/Chap6glyf.html.\nconst (\n\tflagOnCurve = 1 << iota\n\tflagXShortVector\n\tflagYShortVector\n\tflagRepeat\n\tflagPositiveXShortVector\n\tflagPositiveYShortVector\n\n\t// The remaining flags are for internal use.\n\tflagTouchedX\n\tflagTouchedY\n)\n\n// The same flag bits (0x10 and 0x20) are overloaded to have two meanings,\n// dependent on the value of the flag{X,Y}ShortVector bits.\nconst (\n\tflagThisXIsSame = flagPositiveXShortVector\n\tflagThisYIsSame = flagPositiveYShortVector\n)\n\n// Load loads a glyph's contours from a Font, overwriting any previously loaded\n// contours for this GlyphBuf. scale is the number of 26.6 fixed point units in\n// 1 em, i is the glyph index, and h is the hinting policy.\nfunc (g *GlyphBuf) Load(f *Font, scale fixed.Int26_6, i Index, h font.Hinting) error {\n\tg.Points = g.Points[:0]\n\tg.Unhinted = g.Unhinted[:0]\n\tg.InFontUnits = g.InFontUnits[:0]\n\tg.Ends = g.Ends[:0]\n\tg.font = f\n\tg.hinting = h\n\tg.scale = scale\n\tg.pp1x = 0\n\tg.phantomPoints = [4]Point{}\n\tg.metricsSet = false\n\n\tif h != font.HintingNone {\n\t\tif err := g.hinter.init(f, scale); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tif err := g.load(0, i, true); err != nil {\n\t\treturn err\n\t}\n\t// TODO: this selection of either g.pp1x or g.phantomPoints[0].X isn't ideal,\n\t// and should be cleaned up once we have all the testScaling tests passing,\n\t// plus additional tests for Freetype-Go's bounding boxes matching C Freetype's.\n\tpp1x := g.pp1x\n\tif h != font.HintingNone {\n\t\tpp1x = g.phantomPoints[0].X\n\t}\n\tif pp1x != 0 {\n\t\tfor i := range g.Points {\n\t\t\tg.Points[i].X -= pp1x\n\t\t}\n\t}\n\n\tadvanceWidth := g.phantomPoints[1].X - g.phantomPoints[0].X\n\tif h != font.HintingNone {\n\t\tif len(f.hdmx) >= 8 {\n\t\t\tif n := u32(f.hdmx, 4); n > 3+uint32(i) {\n\t\t\t\tfor hdmx := f.hdmx[8:]; uint32(len(hdmx)) >= n; hdmx = hdmx[n:] {\n\t\t\t\t\tif fixed.Int26_6(hdmx[0]) == scale>>6 {\n\t\t\t\t\t\tadvanceWidth = fixed.Int26_6(hdmx[2+i]) << 6\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tadvanceWidth = (advanceWidth + 32) &^ 63\n\t}\n\tg.AdvanceWidth = advanceWidth\n\n\t// Set g.Bounds to the 'control box', which is the bounding box of the\n\t// Bézier curves' control points. This is easier to calculate, no smaller\n\t// than and often equal to the tightest possible bounding box of the curves\n\t// themselves. This approach is what C Freetype does. We can't just scale\n\t// the nominal bounding box in the glyf data as the hinting process and\n\t// phantom point adjustment may move points outside of that box.\n\tif len(g.Points) == 0 {\n\t\tg.Bounds = fixed.Rectangle26_6{}\n\t} else {\n\t\tp := g.Points[0]\n\t\tg.Bounds.Min.X = p.X\n\t\tg.Bounds.Max.X = p.X\n\t\tg.Bounds.Min.Y = p.Y\n\t\tg.Bounds.Max.Y = p.Y\n\t\tfor _, p := range g.Points[1:] {\n\t\t\tif g.Bounds.Min.X > p.X {\n\t\t\t\tg.Bounds.Min.X = p.X\n\t\t\t} else if g.Bounds.Max.X < p.X {\n\t\t\t\tg.Bounds.Max.X = p.X\n\t\t\t}\n\t\t\tif g.Bounds.Min.Y > p.Y {\n\t\t\t\tg.Bounds.Min.Y = p.Y\n\t\t\t} else if g.Bounds.Max.Y < p.Y {\n\t\t\t\tg.Bounds.Max.Y = p.Y\n\t\t\t}\n\t\t}\n\t\t// Snap the box to the grid, if hinting is on.\n\t\tif h != font.HintingNone {\n\t\t\tg.Bounds.Min.X &^= 63\n\t\t\tg.Bounds.Min.Y &^= 63\n\t\t\tg.Bounds.Max.X += 63\n\t\t\tg.Bounds.Max.X &^= 63\n\t\t\tg.Bounds.Max.Y += 63\n\t\t\tg.Bounds.Max.Y &^= 63\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (g *GlyphBuf) load(recursion uint32, i Index, useMyMetrics bool) (err error) {\n\t// The recursion limit here is arbitrary, but defends against malformed glyphs.\n\tif recursion >= 32 {\n\t\treturn UnsupportedError(\"excessive compound glyph recursion\")\n\t}\n\t// Find the relevant slice of g.font.glyf.\n\tvar g0, g1 uint32\n\tif g.font.locaOffsetFormat == locaOffsetFormatShort {\n\t\tg0 = 2 * uint32(u16(g.font.loca, 2*int(i)))\n\t\tg1 = 2 * uint32(u16(g.font.loca, 2*int(i)+2))\n\t} else {\n\t\tg0 = u32(g.font.loca, 4*int(i))\n\t\tg1 = u32(g.font.loca, 4*int(i)+4)\n\t}\n\n\t// Decode the contour count and nominal bounding box, from the first\n\t// 10 bytes of the glyf data. boundsYMin and boundsXMax, at offsets 4\n\t// and 6, are unused.\n\tglyf, ne, boundsXMin, boundsYMax := []byte(nil), 0, fixed.Int26_6(0), fixed.Int26_6(0)\n\tif g0+10 <= g1 {\n\t\tglyf = g.font.glyf[g0:g1]\n\t\tne = int(int16(u16(glyf, 0)))\n\t\tboundsXMin = fixed.Int26_6(int16(u16(glyf, 2)))\n\t\tboundsYMax = fixed.Int26_6(int16(u16(glyf, 8)))\n\t}\n\n\t// Create the phantom points.\n\tuhm, pp1x := g.font.unscaledHMetric(i), fixed.Int26_6(0)\n\tuvm := g.font.unscaledVMetric(i, boundsYMax)\n\tg.phantomPoints = [4]Point{\n\t\t{X: boundsXMin - uhm.LeftSideBearing},\n\t\t{X: boundsXMin - uhm.LeftSideBearing + uhm.AdvanceWidth},\n\t\t{X: uhm.AdvanceWidth / 2, Y: boundsYMax + uvm.TopSideBearing},\n\t\t{X: uhm.AdvanceWidth / 2, Y: boundsYMax + uvm.TopSideBearing - uvm.AdvanceHeight},\n\t}\n\tif len(glyf) == 0 {\n\t\tg.addPhantomsAndScale(len(g.Points), len(g.Points), true, true)\n\t\tcopy(g.phantomPoints[:], g.Points[len(g.Points)-4:])\n\t\tg.Points = g.Points[:len(g.Points)-4]\n\t\t// TODO: also trim g.InFontUnits and g.Unhinted?\n\t\treturn nil\n\t}\n\n\t// Load and hint the contours.\n\tif ne < 0 {\n\t\tif ne != -1 {\n\t\t\t// http://developer.apple.com/fonts/TTRefMan/RM06/Chap6glyf.html says that\n\t\t\t// \"the values -2, -3, and so forth, are reserved for future use.\"\n\t\t\treturn UnsupportedError(\"negative number of contours\")\n\t\t}\n\t\tpp1x = g.font.scale(g.scale * (boundsXMin - uhm.LeftSideBearing))\n\t\tif err := g.loadCompound(recursion, uhm, i, glyf, useMyMetrics); err != nil {\n\t\t\treturn err\n\t\t}\n\t} else {\n\t\tnp0, ne0 := len(g.Points), len(g.Ends)\n\t\tprogram := g.loadSimple(glyf, ne)\n\t\tg.addPhantomsAndScale(np0, np0, true, true)\n\t\tpp1x = g.Points[len(g.Points)-4].X\n\t\tif g.hinting != font.HintingNone {\n\t\t\tif len(program) != 0 {\n\t\t\t\terr := g.hinter.run(\n\t\t\t\t\tprogram,\n\t\t\t\t\tg.Points[np0:],\n\t\t\t\t\tg.Unhinted[np0:],\n\t\t\t\t\tg.InFontUnits[np0:],\n\t\t\t\t\tg.Ends[ne0:],\n\t\t\t\t)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Drop the four phantom points.\n\t\t\tg.InFontUnits = g.InFontUnits[:len(g.InFontUnits)-4]\n\t\t\tg.Unhinted = g.Unhinted[:len(g.Unhinted)-4]\n\t\t}\n\t\tif useMyMetrics {\n\t\t\tcopy(g.phantomPoints[:], g.Points[len(g.Points)-4:])\n\t\t}\n\t\tg.Points = g.Points[:len(g.Points)-4]\n\t\tif np0 != 0 {\n\t\t\t// The hinting program expects the []Ends values to be indexed\n\t\t\t// relative to the inner glyph, not the outer glyph, so we delay\n\t\t\t// adding np0 until after the hinting program (if any) has run.\n\t\t\tfor i := ne0; i < len(g.Ends); i++ {\n\t\t\t\tg.Ends[i] += np0\n\t\t\t}\n\t\t}\n\t}\n\tif useMyMetrics && !g.metricsSet {\n\t\tg.metricsSet = true\n\t\tg.pp1x = pp1x\n\t}\n\treturn nil\n}\n\n// loadOffset is the initial offset for loadSimple and loadCompound. The first\n// 10 bytes are the number of contours and the bounding box.\nconst loadOffset = 10\n\nfunc (g *GlyphBuf) loadSimple(glyf []byte, ne int) (program []byte) {\n\toffset := loadOffset\n\tfor i := 0; i < ne; i++ {\n\t\tg.Ends = append(g.Ends, 1+int(u16(glyf, offset)))\n\t\toffset += 2\n\t}\n\n\t// Note the TrueType hinting instructions.\n\tinstrLen := int(u16(glyf, offset))\n\toffset += 2\n\tprogram = glyf[offset : offset+instrLen]\n\toffset += instrLen\n\n\tif ne == 0 {\n\t\treturn program\n\t}\n\n\tnp0 := len(g.Points)\n\tnp1 := np0 + int(g.Ends[len(g.Ends)-1])\n\n\t// Decode the flags.\n\tfor i := np0; i < np1; {\n\t\tc := uint32(glyf[offset])\n\t\toffset++\n\t\tg.Points = append(g.Points, Point{Flags: c})\n\t\ti++\n\t\tif c&flagRepeat != 0 {\n\t\t\tcount := glyf[offset]\n\t\t\toffset++\n\t\t\tfor ; count > 0; count-- {\n\t\t\t\tg.Points = append(g.Points, Point{Flags: c})\n\t\t\t\ti++\n\t\t\t}\n\t\t}\n\t}\n\n\t// Decode the co-ordinates.\n\tvar x int16\n\tfor i := np0; i < np1; i++ {\n\t\tf := g.Points[i].Flags\n\t\tif f&flagXShortVector != 0 {\n\t\t\tdx := int16(glyf[offset])\n\t\t\toffset++\n\t\t\tif f&flagPositiveXShortVector == 0 {\n\t\t\t\tx -= dx\n\t\t\t} else {\n\t\t\t\tx += dx\n\t\t\t}\n\t\t} else if f&flagThisXIsSame == 0 {\n\t\t\tx += int16(u16(glyf, offset))\n\t\t\toffset += 2\n\t\t}\n\t\tg.Points[i].X = fixed.Int26_6(x)\n\t}\n\tvar y int16\n\tfor i := np0; i < np1; i++ {\n\t\tf := g.Points[i].Flags\n\t\tif f&flagYShortVector != 0 {\n\t\t\tdy := int16(glyf[offset])\n\t\t\toffset++\n\t\t\tif f&flagPositiveYShortVector == 0 {\n\t\t\t\ty -= dy\n\t\t\t} else {\n\t\t\t\ty += dy\n\t\t\t}\n\t\t} else if f&flagThisYIsSame == 0 {\n\t\t\ty += int16(u16(glyf, offset))\n\t\t\toffset += 2\n\t\t}\n\t\tg.Points[i].Y = fixed.Int26_6(y)\n\t}\n\n\treturn program\n}\n\nfunc (g *GlyphBuf) loadCompound(recursion uint32, uhm HMetric, i Index,\n\tglyf []byte, useMyMetrics bool) error {\n\n\t// Flags for decoding a compound glyph. These flags are documented at\n\t// http://developer.apple.com/fonts/TTRefMan/RM06/Chap6glyf.html.\n\tconst (\n\t\tflagArg1And2AreWords = 1 << iota\n\t\tflagArgsAreXYValues\n\t\tflagRoundXYToGrid\n\t\tflagWeHaveAScale\n\t\tflagUnused\n\t\tflagMoreComponents\n\t\tflagWeHaveAnXAndYScale\n\t\tflagWeHaveATwoByTwo\n\t\tflagWeHaveInstructions\n\t\tflagUseMyMetrics\n\t\tflagOverlapCompound\n\t)\n\tnp0, ne0 := len(g.Points), len(g.Ends)\n\toffset := loadOffset\n\tfor {\n\t\tflags := u16(glyf, offset)\n\t\tcomponent := Index(u16(glyf, offset+2))\n\t\tdx, dy, transform, hasTransform := fixed.Int26_6(0), fixed.Int26_6(0), [4]int16{}, false\n\t\tif flags&flagArg1And2AreWords != 0 {\n\t\t\tdx = fixed.Int26_6(int16(u16(glyf, offset+4)))\n\t\t\tdy = fixed.Int26_6(int16(u16(glyf, offset+6)))\n\t\t\toffset += 8\n\t\t} else {\n\t\t\tdx = fixed.Int26_6(int16(int8(glyf[offset+4])))\n\t\t\tdy = fixed.Int26_6(int16(int8(glyf[offset+5])))\n\t\t\toffset += 6\n\t\t}\n\t\tif flags&flagArgsAreXYValues == 0 {\n\t\t\treturn UnsupportedError(\"compound glyph transform vector\")\n\t\t}\n\t\tif flags&(flagWeHaveAScale|flagWeHaveAnXAndYScale|flagWeHaveATwoByTwo) != 0 {\n\t\t\thasTransform = true\n\t\t\tswitch {\n\t\t\tcase flags&flagWeHaveAScale != 0:\n\t\t\t\ttransform[0] = int16(u16(glyf, offset+0))\n\t\t\t\ttransform[3] = transform[0]\n\t\t\t\toffset += 2\n\t\t\tcase flags&flagWeHaveAnXAndYScale != 0:\n\t\t\t\ttransform[0] = int16(u16(glyf, offset+0))\n\t\t\t\ttransform[3] = int16(u16(glyf, offset+2))\n\t\t\t\toffset += 4\n\t\t\tcase flags&flagWeHaveATwoByTwo != 0:\n\t\t\t\ttransform[0] = int16(u16(glyf, offset+0))\n\t\t\t\ttransform[1] = int16(u16(glyf, offset+2))\n\t\t\t\ttransform[2] = int16(u16(glyf, offset+4))\n\t\t\t\ttransform[3] = int16(u16(glyf, offset+6))\n\t\t\t\toffset += 8\n\t\t\t}\n\t\t}\n\t\tsavedPP := g.phantomPoints\n\t\tnp0 := len(g.Points)\n\t\tcomponentUMM := useMyMetrics && (flags&flagUseMyMetrics != 0)\n\t\tif err := g.load(recursion+1, component, componentUMM); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif flags&flagUseMyMetrics == 0 {\n\t\t\tg.phantomPoints = savedPP\n\t\t}\n\t\tif hasTransform {\n\t\t\tfor j := np0; j < len(g.Points); j++ {\n\t\t\t\tp := &g.Points[j]\n\t\t\t\tnewX := 0 +\n\t\t\t\t\tfixed.Int26_6((int64(p.X)*int64(transform[0])+1<<13)>>14) +\n\t\t\t\t\tfixed.Int26_6((int64(p.Y)*int64(transform[2])+1<<13)>>14)\n\t\t\t\tnewY := 0 +\n\t\t\t\t\tfixed.Int26_6((int64(p.X)*int64(transform[1])+1<<13)>>14) +\n\t\t\t\t\tfixed.Int26_6((int64(p.Y)*int64(transform[3])+1<<13)>>14)\n\t\t\t\tp.X, p.Y = newX, newY\n\t\t\t}\n\t\t}\n\t\tdx = g.font.scale(g.scale * dx)\n\t\tdy = g.font.scale(g.scale * dy)\n\t\tif flags&flagRoundXYToGrid != 0 {\n\t\t\tdx = (dx + 32) &^ 63\n\t\t\tdy = (dy + 32) &^ 63\n\t\t}\n\t\tfor j := np0; j < len(g.Points); j++ {\n\t\t\tp := &g.Points[j]\n\t\t\tp.X += dx\n\t\t\tp.Y += dy\n\t\t}\n\t\t// TODO: also adjust g.InFontUnits and g.Unhinted?\n\t\tif flags&flagMoreComponents == 0 {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tinstrLen := 0\n\tif g.hinting != font.HintingNone && offset+2 <= len(glyf) {\n\t\tinstrLen = int(u16(glyf, offset))\n\t\toffset += 2\n\t}\n\n\tg.addPhantomsAndScale(np0, len(g.Points), false, instrLen > 0)\n\tpoints, ends := g.Points[np0:], g.Ends[ne0:]\n\tg.Points = g.Points[:len(g.Points)-4]\n\tfor j := range points {\n\t\tpoints[j].Flags &^= flagTouchedX | flagTouchedY\n\t}\n\n\tif instrLen == 0 {\n\t\tif !g.metricsSet {\n\t\t\tcopy(g.phantomPoints[:], points[len(points)-4:])\n\t\t}\n\t\treturn nil\n\t}\n\n\t// Hint the compound glyph.\n\tprogram := glyf[offset : offset+instrLen]\n\t// Temporarily adjust the ends to be relative to this compound glyph.\n\tif np0 != 0 {\n\t\tfor i := range ends {\n\t\t\tends[i] -= np0\n\t\t}\n\t}\n\t// Hinting instructions of a composite glyph completely refer to the\n\t// (already) hinted subglyphs.\n\tg.tmp = append(g.tmp[:0], points...)\n\tif err := g.hinter.run(program, points, g.tmp, g.tmp, ends); err != nil {\n\t\treturn err\n\t}\n\tif np0 != 0 {\n\t\tfor i := range ends {\n\t\t\tends[i] += np0\n\t\t}\n\t}\n\tif !g.metricsSet {\n\t\tcopy(g.phantomPoints[:], points[len(points)-4:])\n\t}\n\treturn nil\n}\n\nfunc (g *GlyphBuf) addPhantomsAndScale(np0, np1 int, simple, adjust bool) {\n\t// Add the four phantom points.\n\tg.Points = append(g.Points, g.phantomPoints[:]...)\n\t// Scale the points.\n\tif simple && g.hinting != font.HintingNone {\n\t\tg.InFontUnits = append(g.InFontUnits, g.Points[np1:]...)\n\t}\n\tfor i := np1; i < len(g.Points); i++ {\n\t\tp := &g.Points[i]\n\t\tp.X = g.font.scale(g.scale * p.X)\n\t\tp.Y = g.font.scale(g.scale * p.Y)\n\t}\n\tif g.hinting == font.HintingNone {\n\t\treturn\n\t}\n\t// Round the 1st phantom point to the grid, shifting all other points equally.\n\t// Note that \"all other points\" starts from np0, not np1.\n\t// TODO: delete this adjustment and the np0/np1 distinction, when\n\t// we update the compatibility tests to C Freetype 2.5.3.\n\t// See http://git.savannah.gnu.org/cgit/freetype/freetype2.git/commit/?id=05c786d990390a7ca18e62962641dac740bacb06\n\tif adjust {\n\t\tpp1x := g.Points[len(g.Points)-4].X\n\t\tif dx := ((pp1x + 32) &^ 63) - pp1x; dx != 0 {\n\t\t\tfor i := np0; i < len(g.Points); i++ {\n\t\t\t\tg.Points[i].X += dx\n\t\t\t}\n\t\t}\n\t}\n\tif simple {\n\t\tg.Unhinted = append(g.Unhinted, g.Points[np1:]...)\n\t}\n\t// Round the 2nd and 4th phantom point to the grid.\n\tp := &g.Points[len(g.Points)-3]\n\tp.X = (p.X + 32) &^ 63\n\tp = &g.Points[len(g.Points)-1]\n\tp.Y = (p.Y + 32) &^ 63\n}\n" }, { "path": "vendor/github.com/golang/freetype/truetype/hint.go", "content": "// Copyright 2012 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage truetype\n\n// This file implements a Truetype bytecode interpreter.\n// The opcodes are described at https://developer.apple.com/fonts/TTRefMan/RM05/Chap5.html\n\nimport (\n\t\"errors\"\n\t\"math\"\n\n\t\"golang.org/x/image/math/fixed\"\n)\n\nconst (\n\ttwilightZone = 0\n\tglyphZone = 1\n\tnumZone = 2\n)\n\ntype pointType uint32\n\nconst (\n\tcurrent pointType = 0\n\tunhinted pointType = 1\n\tinFontUnits pointType = 2\n\tnumPointType = 3\n)\n\n// callStackEntry is a bytecode call stack entry.\ntype callStackEntry struct {\n\tprogram []byte\n\tpc int\n\tloopCount int32\n}\n\n// hinter implements bytecode hinting. A hinter can be re-used to hint a series\n// of glyphs from a Font.\ntype hinter struct {\n\tstack, store []int32\n\n\t// functions is a map from function number to bytecode.\n\tfunctions map[int32][]byte\n\n\t// font and scale are the font and scale last used for this hinter.\n\t// Changing the font will require running the new font's fpgm bytecode.\n\t// Changing either will require running the font's prep bytecode.\n\tfont *Font\n\tscale fixed.Int26_6\n\n\t// gs and defaultGS are the current and default graphics state. The\n\t// default graphics state is the global default graphics state after\n\t// the font's fpgm and prep programs have been run.\n\tgs, defaultGS graphicsState\n\n\t// points and ends are the twilight zone's points, glyph's points\n\t// and glyph's contour boundaries.\n\tpoints [numZone][numPointType][]Point\n\tends []int\n\n\t// scaledCVT is the lazily initialized scaled Control Value Table.\n\tscaledCVTInitialized bool\n\tscaledCVT []fixed.Int26_6\n}\n\n// graphicsState is described at https://developer.apple.com/fonts/TTRefMan/RM04/Chap4.html\ntype graphicsState struct {\n\t// Projection vector, freedom vector and dual projection vector.\n\tpv, fv, dv [2]f2dot14\n\t// Reference points and zone pointers.\n\trp, zp [3]int32\n\t// Control Value / Single Width Cut-In.\n\tcontrolValueCutIn, singleWidthCutIn, singleWidth fixed.Int26_6\n\t// Delta base / shift.\n\tdeltaBase, deltaShift int32\n\t// Minimum distance.\n\tminDist fixed.Int26_6\n\t// Loop count.\n\tloop int32\n\t// Rounding policy.\n\troundPeriod, roundPhase, roundThreshold fixed.Int26_6\n\troundSuper45 bool\n\t// Auto-flip.\n\tautoFlip bool\n}\n\nvar globalDefaultGS = graphicsState{\n\tpv: [2]f2dot14{0x4000, 0}, // Unit vector along the X axis.\n\tfv: [2]f2dot14{0x4000, 0},\n\tdv: [2]f2dot14{0x4000, 0},\n\tzp: [3]int32{1, 1, 1},\n\tcontrolValueCutIn: (17 << 6) / 16, // 17/16 as a fixed.Int26_6.\n\tdeltaBase: 9,\n\tdeltaShift: 3,\n\tminDist: 1 << 6, // 1 as a fixed.Int26_6.\n\tloop: 1,\n\troundPeriod: 1 << 6, // 1 as a fixed.Int26_6.\n\troundThreshold: 1 << 5, // 1/2 as a fixed.Int26_6.\n\troundSuper45: false,\n\tautoFlip: true,\n}\n\nfunc resetTwilightPoints(f *Font, p []Point) []Point {\n\tif n := int(f.maxTwilightPoints) + 4; n <= cap(p) {\n\t\tp = p[:n]\n\t\tfor i := range p {\n\t\t\tp[i] = Point{}\n\t\t}\n\t} else {\n\t\tp = make([]Point, n)\n\t}\n\treturn p\n}\n\nfunc (h *hinter) init(f *Font, scale fixed.Int26_6) error {\n\th.points[twilightZone][0] = resetTwilightPoints(f, h.points[twilightZone][0])\n\th.points[twilightZone][1] = resetTwilightPoints(f, h.points[twilightZone][1])\n\th.points[twilightZone][2] = resetTwilightPoints(f, h.points[twilightZone][2])\n\n\trescale := h.scale != scale\n\tif h.font != f {\n\t\th.font, rescale = f, true\n\t\tif h.functions == nil {\n\t\t\th.functions = make(map[int32][]byte)\n\t\t} else {\n\t\t\tfor k := range h.functions {\n\t\t\t\tdelete(h.functions, k)\n\t\t\t}\n\t\t}\n\n\t\tif x := int(f.maxStackElements); x > len(h.stack) {\n\t\t\tx += 255\n\t\t\tx &^= 255\n\t\t\th.stack = make([]int32, x)\n\t\t}\n\t\tif x := int(f.maxStorage); x > len(h.store) {\n\t\t\tx += 15\n\t\t\tx &^= 15\n\t\t\th.store = make([]int32, x)\n\t\t}\n\t\tif len(f.fpgm) != 0 {\n\t\t\tif err := h.run(f.fpgm, nil, nil, nil, nil); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t}\n\n\tif rescale {\n\t\th.scale = scale\n\t\th.scaledCVTInitialized = false\n\n\t\th.defaultGS = globalDefaultGS\n\n\t\tif len(f.prep) != 0 {\n\t\t\tif err := h.run(f.prep, nil, nil, nil, nil); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\th.defaultGS = h.gs\n\t\t\t// The MS rasterizer doesn't allow the following graphics state\n\t\t\t// variables to be modified by the CVT program.\n\t\t\th.defaultGS.pv = globalDefaultGS.pv\n\t\t\th.defaultGS.fv = globalDefaultGS.fv\n\t\t\th.defaultGS.dv = globalDefaultGS.dv\n\t\t\th.defaultGS.rp = globalDefaultGS.rp\n\t\t\th.defaultGS.zp = globalDefaultGS.zp\n\t\t\th.defaultGS.loop = globalDefaultGS.loop\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (h *hinter) run(program []byte, pCurrent, pUnhinted, pInFontUnits []Point, ends []int) error {\n\th.gs = h.defaultGS\n\th.points[glyphZone][current] = pCurrent\n\th.points[glyphZone][unhinted] = pUnhinted\n\th.points[glyphZone][inFontUnits] = pInFontUnits\n\th.ends = ends\n\n\tif len(program) > 50000 {\n\t\treturn errors.New(\"truetype: hinting: too many instructions\")\n\t}\n\tvar (\n\t\tsteps, pc, top int\n\t\topcode uint8\n\n\t\tcallStack [32]callStackEntry\n\t\tcallStackTop int\n\t)\n\n\tfor 0 <= pc && pc < len(program) {\n\t\tsteps++\n\t\tif steps == 100000 {\n\t\t\treturn errors.New(\"truetype: hinting: too many steps\")\n\t\t}\n\t\topcode = program[pc]\n\t\tif top < int(popCount[opcode]) {\n\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t}\n\t\tswitch opcode {\n\n\t\tcase opSVTCA0:\n\t\t\th.gs.pv = [2]f2dot14{0, 0x4000}\n\t\t\th.gs.fv = [2]f2dot14{0, 0x4000}\n\t\t\th.gs.dv = [2]f2dot14{0, 0x4000}\n\n\t\tcase opSVTCA1:\n\t\t\th.gs.pv = [2]f2dot14{0x4000, 0}\n\t\t\th.gs.fv = [2]f2dot14{0x4000, 0}\n\t\t\th.gs.dv = [2]f2dot14{0x4000, 0}\n\n\t\tcase opSPVTCA0:\n\t\t\th.gs.pv = [2]f2dot14{0, 0x4000}\n\t\t\th.gs.dv = [2]f2dot14{0, 0x4000}\n\n\t\tcase opSPVTCA1:\n\t\t\th.gs.pv = [2]f2dot14{0x4000, 0}\n\t\t\th.gs.dv = [2]f2dot14{0x4000, 0}\n\n\t\tcase opSFVTCA0:\n\t\t\th.gs.fv = [2]f2dot14{0, 0x4000}\n\n\t\tcase opSFVTCA1:\n\t\t\th.gs.fv = [2]f2dot14{0x4000, 0}\n\n\t\tcase opSPVTL0, opSPVTL1, opSFVTL0, opSFVTL1:\n\t\t\ttop -= 2\n\t\t\tp1 := h.point(0, current, h.stack[top+0])\n\t\t\tp2 := h.point(0, current, h.stack[top+1])\n\t\t\tif p1 == nil || p2 == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tdx := f2dot14(p1.X - p2.X)\n\t\t\tdy := f2dot14(p1.Y - p2.Y)\n\t\t\tif dx == 0 && dy == 0 {\n\t\t\t\tdx = 0x4000\n\t\t\t} else if opcode&1 != 0 {\n\t\t\t\t// Counter-clockwise rotation.\n\t\t\t\tdx, dy = -dy, dx\n\t\t\t}\n\t\t\tv := normalize(dx, dy)\n\t\t\tif opcode < opSFVTL0 {\n\t\t\t\th.gs.pv = v\n\t\t\t\th.gs.dv = v\n\t\t\t} else {\n\t\t\t\th.gs.fv = v\n\t\t\t}\n\n\t\tcase opSPVFS:\n\t\t\ttop -= 2\n\t\t\th.gs.pv = normalize(f2dot14(h.stack[top]), f2dot14(h.stack[top+1]))\n\t\t\th.gs.dv = h.gs.pv\n\n\t\tcase opSFVFS:\n\t\t\ttop -= 2\n\t\t\th.gs.fv = normalize(f2dot14(h.stack[top]), f2dot14(h.stack[top+1]))\n\n\t\tcase opGPV:\n\t\t\tif top+1 >= len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\th.stack[top+0] = int32(h.gs.pv[0])\n\t\t\th.stack[top+1] = int32(h.gs.pv[1])\n\t\t\ttop += 2\n\n\t\tcase opGFV:\n\t\t\tif top+1 >= len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\th.stack[top+0] = int32(h.gs.fv[0])\n\t\t\th.stack[top+1] = int32(h.gs.fv[1])\n\t\t\ttop += 2\n\n\t\tcase opSFVTPV:\n\t\t\th.gs.fv = h.gs.pv\n\n\t\tcase opISECT:\n\t\t\ttop -= 5\n\t\t\tp := h.point(2, current, h.stack[top+0])\n\t\t\ta0 := h.point(1, current, h.stack[top+1])\n\t\t\ta1 := h.point(1, current, h.stack[top+2])\n\t\t\tb0 := h.point(0, current, h.stack[top+3])\n\t\t\tb1 := h.point(0, current, h.stack[top+4])\n\t\t\tif p == nil || a0 == nil || a1 == nil || b0 == nil || b1 == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\n\t\t\tdbx := b1.X - b0.X\n\t\t\tdby := b1.Y - b0.Y\n\t\t\tdax := a1.X - a0.X\n\t\t\tday := a1.Y - a0.Y\n\t\t\tdx := b0.X - a0.X\n\t\t\tdy := b0.Y - a0.Y\n\t\t\tdiscriminant := mulDiv(int64(dax), int64(-dby), 0x40) +\n\t\t\t\tmulDiv(int64(day), int64(dbx), 0x40)\n\t\t\tdotProduct := mulDiv(int64(dax), int64(dbx), 0x40) +\n\t\t\t\tmulDiv(int64(day), int64(dby), 0x40)\n\t\t\t// The discriminant above is actually a cross product of vectors\n\t\t\t// da and db. Together with the dot product, they can be used as\n\t\t\t// surrogates for sine and cosine of the angle between the vectors.\n\t\t\t// Indeed,\n\t\t\t// dotproduct = |da||db|cos(angle)\n\t\t\t// discriminant = |da||db|sin(angle)\n\t\t\t// We use these equations to reject grazing intersections by\n\t\t\t// thresholding abs(tan(angle)) at 1/19, corresponding to 3 degrees.\n\t\t\tabsDisc, absDotP := discriminant, dotProduct\n\t\t\tif absDisc < 0 {\n\t\t\t\tabsDisc = -absDisc\n\t\t\t}\n\t\t\tif absDotP < 0 {\n\t\t\t\tabsDotP = -absDotP\n\t\t\t}\n\t\t\tif 19*absDisc > absDotP {\n\t\t\t\tval := mulDiv(int64(dx), int64(-dby), 0x40) +\n\t\t\t\t\tmulDiv(int64(dy), int64(dbx), 0x40)\n\t\t\t\trx := mulDiv(val, int64(dax), discriminant)\n\t\t\t\try := mulDiv(val, int64(day), discriminant)\n\t\t\t\tp.X = a0.X + fixed.Int26_6(rx)\n\t\t\t\tp.Y = a0.Y + fixed.Int26_6(ry)\n\t\t\t} else {\n\t\t\t\tp.X = (a0.X + a1.X + b0.X + b1.X) / 4\n\t\t\t\tp.Y = (a0.Y + a1.Y + b0.Y + b1.Y) / 4\n\t\t\t}\n\t\t\tp.Flags |= flagTouchedX | flagTouchedY\n\n\t\tcase opSRP0, opSRP1, opSRP2:\n\t\t\ttop--\n\t\t\th.gs.rp[opcode-opSRP0] = h.stack[top]\n\n\t\tcase opSZP0, opSZP1, opSZP2:\n\t\t\ttop--\n\t\t\th.gs.zp[opcode-opSZP0] = h.stack[top]\n\n\t\tcase opSZPS:\n\t\t\ttop--\n\t\t\th.gs.zp[0] = h.stack[top]\n\t\t\th.gs.zp[1] = h.stack[top]\n\t\t\th.gs.zp[2] = h.stack[top]\n\n\t\tcase opSLOOP:\n\t\t\ttop--\n\t\t\t// https://developer.apple.com/fonts/TrueType-Reference-Manual/RM05/Chap5.html#SLOOP\n\t\t\t// says that \"Setting the loop variable to zero is an error\". In\n\t\t\t// theory, the inequality on the next line should be \"<=\" instead\n\t\t\t// of \"<\". In practice, some font files' bytecode, such as the '2'\n\t\t\t// glyph in the DejaVuSansMono.ttf that comes with Ubuntu 14.04,\n\t\t\t// issue SLOOP with a zero on top of the stack. Just like the C\n\t\t\t// Freetype code, we allow the zero.\n\t\t\tif h.stack[top] < 0 {\n\t\t\t\treturn errors.New(\"truetype: hinting: invalid data\")\n\t\t\t}\n\t\t\th.gs.loop = h.stack[top]\n\n\t\tcase opRTG:\n\t\t\th.gs.roundPeriod = 1 << 6\n\t\t\th.gs.roundPhase = 0\n\t\t\th.gs.roundThreshold = 1 << 5\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opRTHG:\n\t\t\th.gs.roundPeriod = 1 << 6\n\t\t\th.gs.roundPhase = 1 << 5\n\t\t\th.gs.roundThreshold = 1 << 5\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opSMD:\n\t\t\ttop--\n\t\t\th.gs.minDist = fixed.Int26_6(h.stack[top])\n\n\t\tcase opELSE:\n\t\t\topcode = 1\n\t\t\tgoto ifelse\n\n\t\tcase opJMPR:\n\t\t\ttop--\n\t\t\tpc += int(h.stack[top])\n\t\t\tcontinue\n\n\t\tcase opSCVTCI:\n\t\t\ttop--\n\t\t\th.gs.controlValueCutIn = fixed.Int26_6(h.stack[top])\n\n\t\tcase opSSWCI:\n\t\t\ttop--\n\t\t\th.gs.singleWidthCutIn = fixed.Int26_6(h.stack[top])\n\n\t\tcase opSSW:\n\t\t\ttop--\n\t\t\th.gs.singleWidth = h.font.scale(h.scale * fixed.Int26_6(h.stack[top]))\n\n\t\tcase opDUP:\n\t\t\tif top >= len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\th.stack[top] = h.stack[top-1]\n\t\t\ttop++\n\n\t\tcase opPOP:\n\t\t\ttop--\n\n\t\tcase opCLEAR:\n\t\t\ttop = 0\n\n\t\tcase opSWAP:\n\t\t\th.stack[top-1], h.stack[top-2] = h.stack[top-2], h.stack[top-1]\n\n\t\tcase opDEPTH:\n\t\t\tif top >= len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\th.stack[top] = int32(top)\n\t\t\ttop++\n\n\t\tcase opCINDEX, opMINDEX:\n\t\t\tx := int(h.stack[top-1])\n\t\t\tif x <= 0 || x >= top {\n\t\t\t\treturn errors.New(\"truetype: hinting: invalid data\")\n\t\t\t}\n\t\t\th.stack[top-1] = h.stack[top-1-x]\n\t\t\tif opcode == opMINDEX {\n\t\t\t\tcopy(h.stack[top-1-x:top-1], h.stack[top-x:top])\n\t\t\t\ttop--\n\t\t\t}\n\n\t\tcase opALIGNPTS:\n\t\t\ttop -= 2\n\t\t\tp := h.point(1, current, h.stack[top])\n\t\t\tq := h.point(0, current, h.stack[top+1])\n\t\t\tif p == nil || q == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\td := dotProduct(fixed.Int26_6(q.X-p.X), fixed.Int26_6(q.Y-p.Y), h.gs.pv) / 2\n\t\t\th.move(p, +d, true)\n\t\t\th.move(q, -d, true)\n\n\t\tcase opUTP:\n\t\t\ttop--\n\t\t\tp := h.point(0, current, h.stack[top])\n\t\t\tif p == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tp.Flags &^= flagTouchedX | flagTouchedY\n\n\t\tcase opLOOPCALL, opCALL:\n\t\t\tif callStackTop >= len(callStack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: call stack overflow\")\n\t\t\t}\n\t\t\ttop--\n\t\t\tf, ok := h.functions[h.stack[top]]\n\t\t\tif !ok {\n\t\t\t\treturn errors.New(\"truetype: hinting: undefined function\")\n\t\t\t}\n\t\t\tcallStack[callStackTop] = callStackEntry{program, pc, 1}\n\t\t\tif opcode == opLOOPCALL {\n\t\t\t\ttop--\n\t\t\t\tif h.stack[top] == 0 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tcallStack[callStackTop].loopCount = h.stack[top]\n\t\t\t}\n\t\t\tcallStackTop++\n\t\t\tprogram, pc = f, 0\n\t\t\tcontinue\n\n\t\tcase opFDEF:\n\t\t\t// Save all bytecode up until the next ENDF.\n\t\t\tstartPC := pc + 1\n\t\tfdefloop:\n\t\t\tfor {\n\t\t\t\tpc++\n\t\t\t\tif pc >= len(program) {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: unbalanced FDEF\")\n\t\t\t\t}\n\t\t\t\tswitch program[pc] {\n\t\t\t\tcase opFDEF:\n\t\t\t\t\treturn errors.New(\"truetype: hinting: nested FDEF\")\n\t\t\t\tcase opENDF:\n\t\t\t\t\ttop--\n\t\t\t\t\th.functions[h.stack[top]] = program[startPC : pc+1]\n\t\t\t\t\tbreak fdefloop\n\t\t\t\tdefault:\n\t\t\t\t\tvar ok bool\n\t\t\t\t\tpc, ok = skipInstructionPayload(program, pc)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\treturn errors.New(\"truetype: hinting: unbalanced FDEF\")\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase opENDF:\n\t\t\tif callStackTop == 0 {\n\t\t\t\treturn errors.New(\"truetype: hinting: call stack underflow\")\n\t\t\t}\n\t\t\tcallStackTop--\n\t\t\tcallStack[callStackTop].loopCount--\n\t\t\tif callStack[callStackTop].loopCount != 0 {\n\t\t\t\tcallStackTop++\n\t\t\t\tpc = 0\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprogram, pc = callStack[callStackTop].program, callStack[callStackTop].pc\n\n\t\tcase opMDAP0, opMDAP1:\n\t\t\ttop--\n\t\t\ti := h.stack[top]\n\t\t\tp := h.point(0, current, i)\n\t\t\tif p == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tdistance := fixed.Int26_6(0)\n\t\t\tif opcode == opMDAP1 {\n\t\t\t\tdistance = dotProduct(p.X, p.Y, h.gs.pv)\n\t\t\t\t// TODO: metrics compensation.\n\t\t\t\tdistance = h.round(distance) - distance\n\t\t\t}\n\t\t\th.move(p, distance, true)\n\t\t\th.gs.rp[0] = i\n\t\t\th.gs.rp[1] = i\n\n\t\tcase opIUP0, opIUP1:\n\t\t\tiupY, mask := opcode == opIUP0, uint32(flagTouchedX)\n\t\t\tif iupY {\n\t\t\t\tmask = flagTouchedY\n\t\t\t}\n\t\t\tprevEnd := 0\n\t\t\tfor _, end := range h.ends {\n\t\t\t\tfor i := prevEnd; i < end; i++ {\n\t\t\t\t\tfor i < end && h.points[glyphZone][current][i].Flags&mask == 0 {\n\t\t\t\t\t\ti++\n\t\t\t\t\t}\n\t\t\t\t\tif i == end {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t\tfirstTouched, curTouched := i, i\n\t\t\t\t\ti++\n\t\t\t\t\tfor ; i < end; i++ {\n\t\t\t\t\t\tif h.points[glyphZone][current][i].Flags&mask != 0 {\n\t\t\t\t\t\t\th.iupInterp(iupY, curTouched+1, i-1, curTouched, i)\n\t\t\t\t\t\t\tcurTouched = i\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif curTouched == firstTouched {\n\t\t\t\t\t\th.iupShift(iupY, prevEnd, end, curTouched)\n\t\t\t\t\t} else {\n\t\t\t\t\t\th.iupInterp(iupY, curTouched+1, end-1, curTouched, firstTouched)\n\t\t\t\t\t\tif firstTouched > 0 {\n\t\t\t\t\t\t\th.iupInterp(iupY, prevEnd, firstTouched-1, curTouched, firstTouched)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tprevEnd = end\n\t\t\t}\n\n\t\tcase opSHP0, opSHP1:\n\t\t\tif top < int(h.gs.loop) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\t_, _, d, ok := h.displacement(opcode&1 == 0)\n\t\t\tif !ok {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tfor ; h.gs.loop != 0; h.gs.loop-- {\n\t\t\t\ttop--\n\t\t\t\tp := h.point(2, current, h.stack[top])\n\t\t\t\tif p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\th.move(p, d, true)\n\t\t\t}\n\t\t\th.gs.loop = 1\n\n\t\tcase opSHC0, opSHC1:\n\t\t\ttop--\n\t\t\tzonePointer, i, d, ok := h.displacement(opcode&1 == 0)\n\t\t\tif !ok {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tif h.gs.zp[2] == 0 {\n\t\t\t\t// TODO: implement this when we have a glyph that does this.\n\t\t\t\treturn errors.New(\"hinting: unimplemented SHC instruction\")\n\t\t\t}\n\t\t\tcontour := h.stack[top]\n\t\t\tif contour < 0 || len(ends) <= int(contour) {\n\t\t\t\treturn errors.New(\"truetype: hinting: contour out of range\")\n\t\t\t}\n\t\t\tj0, j1 := int32(0), int32(h.ends[contour])\n\t\t\tif contour > 0 {\n\t\t\t\tj0 = int32(h.ends[contour-1])\n\t\t\t}\n\t\t\tmove := h.gs.zp[zonePointer] != h.gs.zp[2]\n\t\t\tfor j := j0; j < j1; j++ {\n\t\t\t\tif move || j != i {\n\t\t\t\t\th.move(h.point(2, current, j), d, true)\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase opSHZ0, opSHZ1:\n\t\t\ttop--\n\t\t\tzonePointer, i, d, ok := h.displacement(opcode&1 == 0)\n\t\t\tif !ok {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\n\t\t\t// As per C Freetype, SHZ doesn't move the phantom points, or mark\n\t\t\t// the points as touched.\n\t\t\tlimit := int32(len(h.points[h.gs.zp[2]][current]))\n\t\t\tif h.gs.zp[2] == glyphZone {\n\t\t\t\tlimit -= 4\n\t\t\t}\n\t\t\tfor j := int32(0); j < limit; j++ {\n\t\t\t\tif i != j || h.gs.zp[zonePointer] != h.gs.zp[2] {\n\t\t\t\t\th.move(h.point(2, current, j), d, false)\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase opSHPIX:\n\t\t\ttop--\n\t\t\td := fixed.Int26_6(h.stack[top])\n\t\t\tif top < int(h.gs.loop) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\tfor ; h.gs.loop != 0; h.gs.loop-- {\n\t\t\t\ttop--\n\t\t\t\tp := h.point(2, current, h.stack[top])\n\t\t\t\tif p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\th.move(p, d, true)\n\t\t\t}\n\t\t\th.gs.loop = 1\n\n\t\tcase opIP:\n\t\t\tif top < int(h.gs.loop) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\tpointType := inFontUnits\n\t\t\ttwilight := h.gs.zp[0] == 0 || h.gs.zp[1] == 0 || h.gs.zp[2] == 0\n\t\t\tif twilight {\n\t\t\t\tpointType = unhinted\n\t\t\t}\n\t\t\tp := h.point(1, pointType, h.gs.rp[2])\n\t\t\toldP := h.point(0, pointType, h.gs.rp[1])\n\t\t\toldRange := dotProduct(p.X-oldP.X, p.Y-oldP.Y, h.gs.dv)\n\n\t\t\tp = h.point(1, current, h.gs.rp[2])\n\t\t\tcurP := h.point(0, current, h.gs.rp[1])\n\t\t\tcurRange := dotProduct(p.X-curP.X, p.Y-curP.Y, h.gs.pv)\n\t\t\tfor ; h.gs.loop != 0; h.gs.loop-- {\n\t\t\t\ttop--\n\t\t\t\ti := h.stack[top]\n\t\t\t\tp = h.point(2, pointType, i)\n\t\t\t\toldDist := dotProduct(p.X-oldP.X, p.Y-oldP.Y, h.gs.dv)\n\t\t\t\tp = h.point(2, current, i)\n\t\t\t\tcurDist := dotProduct(p.X-curP.X, p.Y-curP.Y, h.gs.pv)\n\t\t\t\tnewDist := fixed.Int26_6(0)\n\t\t\t\tif oldDist != 0 {\n\t\t\t\t\tif oldRange != 0 {\n\t\t\t\t\t\tnewDist = fixed.Int26_6(mulDiv(int64(oldDist), int64(curRange), int64(oldRange)))\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnewDist = -oldDist\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\th.move(p, newDist-curDist, true)\n\t\t\t}\n\t\t\th.gs.loop = 1\n\n\t\tcase opMSIRP0, opMSIRP1:\n\t\t\ttop -= 2\n\t\t\ti := h.stack[top]\n\t\t\tdistance := fixed.Int26_6(h.stack[top+1])\n\n\t\t\t// TODO: special case h.gs.zp[1] == 0 in C Freetype.\n\t\t\tref := h.point(0, current, h.gs.rp[0])\n\t\t\tp := h.point(1, current, i)\n\t\t\tif ref == nil || p == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tcurDist := dotProduct(p.X-ref.X, p.Y-ref.Y, h.gs.pv)\n\n\t\t\t// Set-RP0 bit.\n\t\t\tif opcode == opMSIRP1 {\n\t\t\t\th.gs.rp[0] = i\n\t\t\t}\n\t\t\th.gs.rp[1] = h.gs.rp[0]\n\t\t\th.gs.rp[2] = i\n\n\t\t\t// Move the point.\n\t\t\th.move(p, distance-curDist, true)\n\n\t\tcase opALIGNRP:\n\t\t\tif top < int(h.gs.loop) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\tref := h.point(0, current, h.gs.rp[0])\n\t\t\tif ref == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tfor ; h.gs.loop != 0; h.gs.loop-- {\n\t\t\t\ttop--\n\t\t\t\tp := h.point(1, current, h.stack[top])\n\t\t\t\tif p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\th.move(p, -dotProduct(p.X-ref.X, p.Y-ref.Y, h.gs.pv), true)\n\t\t\t}\n\t\t\th.gs.loop = 1\n\n\t\tcase opRTDG:\n\t\t\th.gs.roundPeriod = 1 << 5\n\t\t\th.gs.roundPhase = 0\n\t\t\th.gs.roundThreshold = 1 << 4\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opMIAP0, opMIAP1:\n\t\t\ttop -= 2\n\t\t\ti := h.stack[top]\n\t\t\tdistance := h.getScaledCVT(h.stack[top+1])\n\t\t\tif h.gs.zp[0] == 0 {\n\t\t\t\tp := h.point(0, unhinted, i)\n\t\t\t\tq := h.point(0, current, i)\n\t\t\t\tp.X = fixed.Int26_6((int64(distance) * int64(h.gs.fv[0])) >> 14)\n\t\t\t\tp.Y = fixed.Int26_6((int64(distance) * int64(h.gs.fv[1])) >> 14)\n\t\t\t\t*q = *p\n\t\t\t}\n\t\t\tp := h.point(0, current, i)\n\t\t\toldDist := dotProduct(p.X, p.Y, h.gs.pv)\n\t\t\tif opcode == opMIAP1 {\n\t\t\t\tif fabs(distance-oldDist) > h.gs.controlValueCutIn {\n\t\t\t\t\tdistance = oldDist\n\t\t\t\t}\n\t\t\t\t// TODO: metrics compensation.\n\t\t\t\tdistance = h.round(distance)\n\t\t\t}\n\t\t\th.move(p, distance-oldDist, true)\n\t\t\th.gs.rp[0] = i\n\t\t\th.gs.rp[1] = i\n\n\t\tcase opNPUSHB:\n\t\t\topcode = 0\n\t\t\tgoto push\n\n\t\tcase opNPUSHW:\n\t\t\topcode = 0x80\n\t\t\tgoto push\n\n\t\tcase opWS:\n\t\t\ttop -= 2\n\t\t\ti := int(h.stack[top])\n\t\t\tif i < 0 || len(h.store) <= i {\n\t\t\t\treturn errors.New(\"truetype: hinting: invalid data\")\n\t\t\t}\n\t\t\th.store[i] = h.stack[top+1]\n\n\t\tcase opRS:\n\t\t\ti := int(h.stack[top-1])\n\t\t\tif i < 0 || len(h.store) <= i {\n\t\t\t\treturn errors.New(\"truetype: hinting: invalid data\")\n\t\t\t}\n\t\t\th.stack[top-1] = h.store[i]\n\n\t\tcase opWCVTP:\n\t\t\ttop -= 2\n\t\t\th.setScaledCVT(h.stack[top], fixed.Int26_6(h.stack[top+1]))\n\n\t\tcase opRCVT:\n\t\t\th.stack[top-1] = int32(h.getScaledCVT(h.stack[top-1]))\n\n\t\tcase opGC0, opGC1:\n\t\t\ti := h.stack[top-1]\n\t\t\tif opcode == opGC0 {\n\t\t\t\tp := h.point(2, current, i)\n\t\t\t\th.stack[top-1] = int32(dotProduct(p.X, p.Y, h.gs.pv))\n\t\t\t} else {\n\t\t\t\tp := h.point(2, unhinted, i)\n\t\t\t\t// Using dv as per C Freetype.\n\t\t\t\th.stack[top-1] = int32(dotProduct(p.X, p.Y, h.gs.dv))\n\t\t\t}\n\n\t\tcase opSCFS:\n\t\t\ttop -= 2\n\t\t\ti := h.stack[top]\n\t\t\tp := h.point(2, current, i)\n\t\t\tif p == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tc := dotProduct(p.X, p.Y, h.gs.pv)\n\t\t\th.move(p, fixed.Int26_6(h.stack[top+1])-c, true)\n\t\t\tif h.gs.zp[2] != 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tq := h.point(2, unhinted, i)\n\t\t\tif q == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tq.X = p.X\n\t\t\tq.Y = p.Y\n\n\t\tcase opMD0, opMD1:\n\t\t\ttop--\n\t\t\tpt, v, scale := pointType(0), [2]f2dot14{}, false\n\t\t\tif opcode == opMD0 {\n\t\t\t\tpt = current\n\t\t\t\tv = h.gs.pv\n\t\t\t} else if h.gs.zp[0] == 0 || h.gs.zp[1] == 0 {\n\t\t\t\tpt = unhinted\n\t\t\t\tv = h.gs.dv\n\t\t\t} else {\n\t\t\t\tpt = inFontUnits\n\t\t\t\tv = h.gs.dv\n\t\t\t\tscale = true\n\t\t\t}\n\t\t\tp := h.point(0, pt, h.stack[top-1])\n\t\t\tq := h.point(1, pt, h.stack[top])\n\t\t\tif p == nil || q == nil {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\td := int32(dotProduct(p.X-q.X, p.Y-q.Y, v))\n\t\t\tif scale {\n\t\t\t\td = int32(int64(d*int32(h.scale)) / int64(h.font.fUnitsPerEm))\n\t\t\t}\n\t\t\th.stack[top-1] = d\n\n\t\tcase opMPPEM, opMPS:\n\t\t\tif top >= len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\t// For MPS, point size should be irrelevant; we return the PPEM.\n\t\t\th.stack[top] = int32(h.scale) >> 6\n\t\t\ttop++\n\n\t\tcase opFLIPON, opFLIPOFF:\n\t\t\th.gs.autoFlip = opcode == opFLIPON\n\n\t\tcase opDEBUG:\n\t\t\t// No-op.\n\n\t\tcase opLT:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] < h.stack[top])\n\n\t\tcase opLTEQ:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] <= h.stack[top])\n\n\t\tcase opGT:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] > h.stack[top])\n\n\t\tcase opGTEQ:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] >= h.stack[top])\n\n\t\tcase opEQ:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] == h.stack[top])\n\n\t\tcase opNEQ:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] != h.stack[top])\n\n\t\tcase opODD, opEVEN:\n\t\t\ti := h.round(fixed.Int26_6(h.stack[top-1])) >> 6\n\t\t\th.stack[top-1] = int32(i&1) ^ int32(opcode-opODD)\n\n\t\tcase opIF:\n\t\t\ttop--\n\t\t\tif h.stack[top] == 0 {\n\t\t\t\topcode = 0\n\t\t\t\tgoto ifelse\n\t\t\t}\n\n\t\tcase opEIF:\n\t\t\t// No-op.\n\n\t\tcase opAND:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] != 0 && h.stack[top] != 0)\n\n\t\tcase opOR:\n\t\t\ttop--\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1]|h.stack[top] != 0)\n\n\t\tcase opNOT:\n\t\t\th.stack[top-1] = bool2int32(h.stack[top-1] == 0)\n\n\t\tcase opDELTAP1:\n\t\t\tgoto delta\n\n\t\tcase opSDB:\n\t\t\ttop--\n\t\t\th.gs.deltaBase = h.stack[top]\n\n\t\tcase opSDS:\n\t\t\ttop--\n\t\t\th.gs.deltaShift = h.stack[top]\n\n\t\tcase opADD:\n\t\t\ttop--\n\t\t\th.stack[top-1] += h.stack[top]\n\n\t\tcase opSUB:\n\t\t\ttop--\n\t\t\th.stack[top-1] -= h.stack[top]\n\n\t\tcase opDIV:\n\t\t\ttop--\n\t\t\tif h.stack[top] == 0 {\n\t\t\t\treturn errors.New(\"truetype: hinting: division by zero\")\n\t\t\t}\n\t\t\th.stack[top-1] = int32(fdiv(fixed.Int26_6(h.stack[top-1]), fixed.Int26_6(h.stack[top])))\n\n\t\tcase opMUL:\n\t\t\ttop--\n\t\t\th.stack[top-1] = int32(fmul(fixed.Int26_6(h.stack[top-1]), fixed.Int26_6(h.stack[top])))\n\n\t\tcase opABS:\n\t\t\tif h.stack[top-1] < 0 {\n\t\t\t\th.stack[top-1] = -h.stack[top-1]\n\t\t\t}\n\n\t\tcase opNEG:\n\t\t\th.stack[top-1] = -h.stack[top-1]\n\n\t\tcase opFLOOR:\n\t\t\th.stack[top-1] &^= 63\n\n\t\tcase opCEILING:\n\t\t\th.stack[top-1] += 63\n\t\t\th.stack[top-1] &^= 63\n\n\t\tcase opROUND00, opROUND01, opROUND10, opROUND11:\n\t\t\t// The four flavors of opROUND are equivalent. See the comment below on\n\t\t\t// opNROUND for the rationale.\n\t\t\th.stack[top-1] = int32(h.round(fixed.Int26_6(h.stack[top-1])))\n\n\t\tcase opNROUND00, opNROUND01, opNROUND10, opNROUND11:\n\t\t\t// No-op. The spec says to add one of four \"compensations for the engine\n\t\t\t// characteristics\", to cater for things like \"different dot-size printers\".\n\t\t\t// https://developer.apple.com/fonts/TTRefMan/RM02/Chap2.html#engine_compensation\n\t\t\t// This code does not implement engine compensation, as we don't expect to\n\t\t\t// be used to output on dot-matrix printers.\n\n\t\tcase opWCVTF:\n\t\t\ttop -= 2\n\t\t\th.setScaledCVT(h.stack[top], h.font.scale(h.scale*fixed.Int26_6(h.stack[top+1])))\n\n\t\tcase opDELTAP2, opDELTAP3, opDELTAC1, opDELTAC2, opDELTAC3:\n\t\t\tgoto delta\n\n\t\tcase opSROUND, opS45ROUND:\n\t\t\ttop--\n\t\t\tswitch (h.stack[top] >> 6) & 0x03 {\n\t\t\tcase 0:\n\t\t\t\th.gs.roundPeriod = 1 << 5\n\t\t\tcase 1, 3:\n\t\t\t\th.gs.roundPeriod = 1 << 6\n\t\t\tcase 2:\n\t\t\t\th.gs.roundPeriod = 1 << 7\n\t\t\t}\n\t\t\th.gs.roundSuper45 = opcode == opS45ROUND\n\t\t\tif h.gs.roundSuper45 {\n\t\t\t\t// The spec says to multiply by √2, but the C Freetype code says 1/√2.\n\t\t\t\t// We go with 1/√2.\n\t\t\t\th.gs.roundPeriod *= 46341\n\t\t\t\th.gs.roundPeriod /= 65536\n\t\t\t}\n\t\t\th.gs.roundPhase = h.gs.roundPeriod * fixed.Int26_6((h.stack[top]>>4)&0x03) / 4\n\t\t\tif x := h.stack[top] & 0x0f; x != 0 {\n\t\t\t\th.gs.roundThreshold = h.gs.roundPeriod * fixed.Int26_6(x-4) / 8\n\t\t\t} else {\n\t\t\t\th.gs.roundThreshold = h.gs.roundPeriod - 1\n\t\t\t}\n\n\t\tcase opJROT:\n\t\t\ttop -= 2\n\t\t\tif h.stack[top+1] != 0 {\n\t\t\t\tpc += int(h.stack[top])\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\tcase opJROF:\n\t\t\ttop -= 2\n\t\t\tif h.stack[top+1] == 0 {\n\t\t\t\tpc += int(h.stack[top])\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\tcase opROFF:\n\t\t\th.gs.roundPeriod = 0\n\t\t\th.gs.roundPhase = 0\n\t\t\th.gs.roundThreshold = 0\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opRUTG:\n\t\t\th.gs.roundPeriod = 1 << 6\n\t\t\th.gs.roundPhase = 0\n\t\t\th.gs.roundThreshold = 1<<6 - 1\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opRDTG:\n\t\t\th.gs.roundPeriod = 1 << 6\n\t\t\th.gs.roundPhase = 0\n\t\t\th.gs.roundThreshold = 0\n\t\t\th.gs.roundSuper45 = false\n\n\t\tcase opSANGW, opAA:\n\t\t\t// These ops are \"anachronistic\" and no longer used.\n\t\t\ttop--\n\n\t\tcase opFLIPPT:\n\t\t\tif top < int(h.gs.loop) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\tpoints := h.points[glyphZone][current]\n\t\t\tfor ; h.gs.loop != 0; h.gs.loop-- {\n\t\t\t\ttop--\n\t\t\t\ti := h.stack[top]\n\t\t\t\tif i < 0 || len(points) <= int(i) {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\tpoints[i].Flags ^= flagOnCurve\n\t\t\t}\n\t\t\th.gs.loop = 1\n\n\t\tcase opFLIPRGON, opFLIPRGOFF:\n\t\t\ttop -= 2\n\t\t\ti, j, points := h.stack[top], h.stack[top+1], h.points[glyphZone][current]\n\t\t\tif i < 0 || len(points) <= int(i) || j < 0 || len(points) <= int(j) {\n\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t}\n\t\t\tfor ; i <= j; i++ {\n\t\t\t\tif opcode == opFLIPRGON {\n\t\t\t\t\tpoints[i].Flags |= flagOnCurve\n\t\t\t\t} else {\n\t\t\t\t\tpoints[i].Flags &^= flagOnCurve\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase opSCANCTRL:\n\t\t\t// We do not support dropout control, as we always rasterize grayscale glyphs.\n\t\t\ttop--\n\n\t\tcase opSDPVTL0, opSDPVTL1:\n\t\t\ttop -= 2\n\t\t\tfor i := 0; i < 2; i++ {\n\t\t\t\tpt := unhinted\n\t\t\t\tif i != 0 {\n\t\t\t\t\tpt = current\n\t\t\t\t}\n\t\t\t\tp := h.point(1, pt, h.stack[top])\n\t\t\t\tq := h.point(2, pt, h.stack[top+1])\n\t\t\t\tif p == nil || q == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\tdx := f2dot14(p.X - q.X)\n\t\t\t\tdy := f2dot14(p.Y - q.Y)\n\t\t\t\tif dx == 0 && dy == 0 {\n\t\t\t\t\tdx = 0x4000\n\t\t\t\t} else if opcode&1 != 0 {\n\t\t\t\t\t// Counter-clockwise rotation.\n\t\t\t\t\tdx, dy = -dy, dx\n\t\t\t\t}\n\t\t\t\tif i == 0 {\n\t\t\t\t\th.gs.dv = normalize(dx, dy)\n\t\t\t\t} else {\n\t\t\t\t\th.gs.pv = normalize(dx, dy)\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase opGETINFO:\n\t\t\tres := int32(0)\n\t\t\tif h.stack[top-1]&(1<<0) != 0 {\n\t\t\t\t// Set the engine version. We hard-code this to 35, the same as\n\t\t\t\t// the C freetype code, which says that \"Version~35 corresponds\n\t\t\t\t// to MS rasterizer v.1.7 as used e.g. in Windows~98\".\n\t\t\t\tres |= 35\n\t\t\t}\n\t\t\tif h.stack[top-1]&(1<<5) != 0 {\n\t\t\t\t// Set that we support grayscale.\n\t\t\t\tres |= 1 << 12\n\t\t\t}\n\t\t\t// We set no other bits, as we do not support rotated or stretched glyphs.\n\t\t\th.stack[top-1] = res\n\n\t\tcase opIDEF:\n\t\t\t// IDEF is for ancient versions of the bytecode interpreter, and is no longer used.\n\t\t\treturn errors.New(\"truetype: hinting: unsupported IDEF instruction\")\n\n\t\tcase opROLL:\n\t\t\th.stack[top-1], h.stack[top-3], h.stack[top-2] =\n\t\t\t\th.stack[top-3], h.stack[top-2], h.stack[top-1]\n\n\t\tcase opMAX:\n\t\t\ttop--\n\t\t\tif h.stack[top-1] < h.stack[top] {\n\t\t\t\th.stack[top-1] = h.stack[top]\n\t\t\t}\n\n\t\tcase opMIN:\n\t\t\ttop--\n\t\t\tif h.stack[top-1] > h.stack[top] {\n\t\t\t\th.stack[top-1] = h.stack[top]\n\t\t\t}\n\n\t\tcase opSCANTYPE:\n\t\t\t// We do not support dropout control, as we always rasterize grayscale glyphs.\n\t\t\ttop--\n\n\t\tcase opINSTCTRL:\n\t\t\t// TODO: support instruction execution control? It seems rare, and even when\n\t\t\t// nominally used (e.g. Source Sans Pro), it seems conditional on extreme or\n\t\t\t// unusual rasterization conditions. For example, the code snippet at\n\t\t\t// https://developer.apple.com/fonts/TTRefMan/RM05/Chap5.html#INSTCTRL\n\t\t\t// uses INSTCTRL when grid-fitting a rotated or stretched glyph, but\n\t\t\t// freetype-go does not support rotated or stretched glyphs.\n\t\t\ttop -= 2\n\n\t\tdefault:\n\t\t\tif opcode < opPUSHB000 {\n\t\t\t\treturn errors.New(\"truetype: hinting: unrecognized instruction\")\n\t\t\t}\n\n\t\t\tif opcode < opMDRP00000 {\n\t\t\t\t// PUSHxxxx opcode.\n\n\t\t\t\tif opcode < opPUSHW000 {\n\t\t\t\t\topcode -= opPUSHB000 - 1\n\t\t\t\t} else {\n\t\t\t\t\topcode -= opPUSHW000 - 1 - 0x80\n\t\t\t\t}\n\t\t\t\tgoto push\n\t\t\t}\n\n\t\t\tif opcode < opMIRP00000 {\n\t\t\t\t// MDRPxxxxx opcode.\n\n\t\t\t\ttop--\n\t\t\t\ti := h.stack[top]\n\t\t\t\tref := h.point(0, current, h.gs.rp[0])\n\t\t\t\tp := h.point(1, current, i)\n\t\t\t\tif ref == nil || p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\n\t\t\t\toldDist := fixed.Int26_6(0)\n\t\t\t\tif h.gs.zp[0] == 0 || h.gs.zp[1] == 0 {\n\t\t\t\t\tp0 := h.point(1, unhinted, i)\n\t\t\t\t\tp1 := h.point(0, unhinted, h.gs.rp[0])\n\t\t\t\t\toldDist = dotProduct(p0.X-p1.X, p0.Y-p1.Y, h.gs.dv)\n\t\t\t\t} else {\n\t\t\t\t\tp0 := h.point(1, inFontUnits, i)\n\t\t\t\t\tp1 := h.point(0, inFontUnits, h.gs.rp[0])\n\t\t\t\t\toldDist = dotProduct(p0.X-p1.X, p0.Y-p1.Y, h.gs.dv)\n\t\t\t\t\toldDist = h.font.scale(h.scale * oldDist)\n\t\t\t\t}\n\n\t\t\t\t// Single-width cut-in test.\n\t\t\t\tif x := fabs(oldDist - h.gs.singleWidth); x < h.gs.singleWidthCutIn {\n\t\t\t\t\tif oldDist >= 0 {\n\t\t\t\t\t\toldDist = +h.gs.singleWidth\n\t\t\t\t\t} else {\n\t\t\t\t\t\toldDist = -h.gs.singleWidth\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Rounding bit.\n\t\t\t\t// TODO: metrics compensation.\n\t\t\t\tdistance := oldDist\n\t\t\t\tif opcode&0x04 != 0 {\n\t\t\t\t\tdistance = h.round(oldDist)\n\t\t\t\t}\n\n\t\t\t\t// Minimum distance bit.\n\t\t\t\tif opcode&0x08 != 0 {\n\t\t\t\t\tif oldDist >= 0 {\n\t\t\t\t\t\tif distance < h.gs.minDist {\n\t\t\t\t\t\t\tdistance = h.gs.minDist\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif distance > -h.gs.minDist {\n\t\t\t\t\t\t\tdistance = -h.gs.minDist\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Set-RP0 bit.\n\t\t\t\th.gs.rp[1] = h.gs.rp[0]\n\t\t\t\th.gs.rp[2] = i\n\t\t\t\tif opcode&0x10 != 0 {\n\t\t\t\t\th.gs.rp[0] = i\n\t\t\t\t}\n\n\t\t\t\t// Move the point.\n\t\t\t\toldDist = dotProduct(p.X-ref.X, p.Y-ref.Y, h.gs.pv)\n\t\t\t\th.move(p, distance-oldDist, true)\n\n\t\t\t} else {\n\t\t\t\t// MIRPxxxxx opcode.\n\n\t\t\t\ttop -= 2\n\t\t\t\ti := h.stack[top]\n\t\t\t\tcvtDist := h.getScaledCVT(h.stack[top+1])\n\t\t\t\tif fabs(cvtDist-h.gs.singleWidth) < h.gs.singleWidthCutIn {\n\t\t\t\t\tif cvtDist >= 0 {\n\t\t\t\t\t\tcvtDist = +h.gs.singleWidth\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcvtDist = -h.gs.singleWidth\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif h.gs.zp[1] == 0 {\n\t\t\t\t\t// TODO: implement once we have a .ttf file that triggers\n\t\t\t\t\t// this, so that we can step through C's freetype.\n\t\t\t\t\treturn errors.New(\"truetype: hinting: unimplemented twilight point adjustment\")\n\t\t\t\t}\n\n\t\t\t\tref := h.point(0, unhinted, h.gs.rp[0])\n\t\t\t\tp := h.point(1, unhinted, i)\n\t\t\t\tif ref == nil || p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\toldDist := dotProduct(p.X-ref.X, p.Y-ref.Y, h.gs.dv)\n\n\t\t\t\tref = h.point(0, current, h.gs.rp[0])\n\t\t\t\tp = h.point(1, current, i)\n\t\t\t\tif ref == nil || p == nil {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t}\n\t\t\t\tcurDist := dotProduct(p.X-ref.X, p.Y-ref.Y, h.gs.pv)\n\n\t\t\t\tif h.gs.autoFlip && oldDist^cvtDist < 0 {\n\t\t\t\t\tcvtDist = -cvtDist\n\t\t\t\t}\n\n\t\t\t\t// Rounding bit.\n\t\t\t\t// TODO: metrics compensation.\n\t\t\t\tdistance := cvtDist\n\t\t\t\tif opcode&0x04 != 0 {\n\t\t\t\t\t// The CVT value is only used if close enough to oldDist.\n\t\t\t\t\tif (h.gs.zp[0] == h.gs.zp[1]) &&\n\t\t\t\t\t\t(fabs(cvtDist-oldDist) > h.gs.controlValueCutIn) {\n\n\t\t\t\t\t\tdistance = oldDist\n\t\t\t\t\t}\n\t\t\t\t\tdistance = h.round(distance)\n\t\t\t\t}\n\n\t\t\t\t// Minimum distance bit.\n\t\t\t\tif opcode&0x08 != 0 {\n\t\t\t\t\tif oldDist >= 0 {\n\t\t\t\t\t\tif distance < h.gs.minDist {\n\t\t\t\t\t\t\tdistance = h.gs.minDist\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif distance > -h.gs.minDist {\n\t\t\t\t\t\t\tdistance = -h.gs.minDist\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Set-RP0 bit.\n\t\t\t\th.gs.rp[1] = h.gs.rp[0]\n\t\t\t\th.gs.rp[2] = i\n\t\t\t\tif opcode&0x10 != 0 {\n\t\t\t\t\th.gs.rp[0] = i\n\t\t\t\t}\n\n\t\t\t\t// Move the point.\n\t\t\t\th.move(p, distance-curDist, true)\n\t\t\t}\n\t\t}\n\t\tpc++\n\t\tcontinue\n\n\tifelse:\n\t\t// Skip past bytecode until the next ELSE (if opcode == 0) or the\n\t\t// next EIF (for all opcodes). Opcode == 0 means that we have come\n\t\t// from an IF. Opcode == 1 means that we have come from an ELSE.\n\t\t{\n\t\tifelseloop:\n\t\t\tfor depth := 0; ; {\n\t\t\t\tpc++\n\t\t\t\tif pc >= len(program) {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: unbalanced IF or ELSE\")\n\t\t\t\t}\n\t\t\t\tswitch program[pc] {\n\t\t\t\tcase opIF:\n\t\t\t\t\tdepth++\n\t\t\t\tcase opELSE:\n\t\t\t\t\tif depth == 0 && opcode == 0 {\n\t\t\t\t\t\tbreak ifelseloop\n\t\t\t\t\t}\n\t\t\t\tcase opEIF:\n\t\t\t\t\tdepth--\n\t\t\t\t\tif depth < 0 {\n\t\t\t\t\t\tbreak ifelseloop\n\t\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\tvar ok bool\n\t\t\t\t\tpc, ok = skipInstructionPayload(program, pc)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\treturn errors.New(\"truetype: hinting: unbalanced IF or ELSE\")\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tpc++\n\t\t\tcontinue\n\t\t}\n\n\tpush:\n\t\t// Push n elements from the program to the stack, where n is the low 7 bits of\n\t\t// opcode. If the low 7 bits are zero, then n is the next byte from the program.\n\t\t// The high bit being 0 means that the elements are zero-extended bytes.\n\t\t// The high bit being 1 means that the elements are sign-extended words.\n\t\t{\n\t\t\twidth := 1\n\t\t\tif opcode&0x80 != 0 {\n\t\t\t\topcode &^= 0x80\n\t\t\t\twidth = 2\n\t\t\t}\n\t\t\tif opcode == 0 {\n\t\t\t\tpc++\n\t\t\t\tif pc >= len(program) {\n\t\t\t\t\treturn errors.New(\"truetype: hinting: insufficient data\")\n\t\t\t\t}\n\t\t\t\topcode = program[pc]\n\t\t\t}\n\t\t\tpc++\n\t\t\tif top+int(opcode) > len(h.stack) {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack overflow\")\n\t\t\t}\n\t\t\tif pc+width*int(opcode) > len(program) {\n\t\t\t\treturn errors.New(\"truetype: hinting: insufficient data\")\n\t\t\t}\n\t\t\tfor ; opcode > 0; opcode-- {\n\t\t\t\tif width == 1 {\n\t\t\t\t\th.stack[top] = int32(program[pc])\n\t\t\t\t} else {\n\t\t\t\t\th.stack[top] = int32(int8(program[pc]))<<8 | int32(program[pc+1])\n\t\t\t\t}\n\t\t\t\ttop++\n\t\t\t\tpc += width\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\tdelta:\n\t\t{\n\t\t\tif opcode >= opDELTAC1 && !h.scaledCVTInitialized {\n\t\t\t\th.initializeScaledCVT()\n\t\t\t}\n\t\t\ttop--\n\t\t\tn := h.stack[top]\n\t\t\tif int32(top) < 2*n {\n\t\t\t\treturn errors.New(\"truetype: hinting: stack underflow\")\n\t\t\t}\n\t\t\tfor ; n > 0; n-- {\n\t\t\t\ttop -= 2\n\t\t\t\tb := h.stack[top]\n\t\t\t\tc := (b & 0xf0) >> 4\n\t\t\t\tswitch opcode {\n\t\t\t\tcase opDELTAP2, opDELTAC2:\n\t\t\t\t\tc += 16\n\t\t\t\tcase opDELTAP3, opDELTAC3:\n\t\t\t\t\tc += 32\n\t\t\t\t}\n\t\t\t\tc += h.gs.deltaBase\n\t\t\t\tif ppem := (int32(h.scale) + 1<<5) >> 6; ppem != c {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tb = (b & 0x0f) - 8\n\t\t\t\tif b >= 0 {\n\t\t\t\t\tb++\n\t\t\t\t}\n\t\t\t\tb = b * 64 / (1 << uint32(h.gs.deltaShift))\n\t\t\t\tif opcode >= opDELTAC1 {\n\t\t\t\t\ta := h.stack[top+1]\n\t\t\t\t\tif a < 0 || len(h.scaledCVT) <= int(a) {\n\t\t\t\t\t\treturn errors.New(\"truetype: hinting: index out of range\")\n\t\t\t\t\t}\n\t\t\t\t\th.scaledCVT[a] += fixed.Int26_6(b)\n\t\t\t\t} else {\n\t\t\t\t\tp := h.point(0, current, h.stack[top+1])\n\t\t\t\t\tif p == nil {\n\t\t\t\t\t\treturn errors.New(\"truetype: hinting: point out of range\")\n\t\t\t\t\t}\n\t\t\t\t\th.move(p, fixed.Int26_6(b), true)\n\t\t\t\t}\n\t\t\t}\n\t\t\tpc++\n\t\t\tcontinue\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (h *hinter) initializeScaledCVT() {\n\th.scaledCVTInitialized = true\n\tif n := len(h.font.cvt) / 2; n <= cap(h.scaledCVT) {\n\t\th.scaledCVT = h.scaledCVT[:n]\n\t} else {\n\t\tif n < 32 {\n\t\t\tn = 32\n\t\t}\n\t\th.scaledCVT = make([]fixed.Int26_6, len(h.font.cvt)/2, n)\n\t}\n\tfor i := range h.scaledCVT {\n\t\tunscaled := uint16(h.font.cvt[2*i])<<8 | uint16(h.font.cvt[2*i+1])\n\t\th.scaledCVT[i] = h.font.scale(h.scale * fixed.Int26_6(int16(unscaled)))\n\t}\n}\n\n// getScaledCVT returns the scaled value from the font's Control Value Table.\nfunc (h *hinter) getScaledCVT(i int32) fixed.Int26_6 {\n\tif !h.scaledCVTInitialized {\n\t\th.initializeScaledCVT()\n\t}\n\tif i < 0 || len(h.scaledCVT) <= int(i) {\n\t\treturn 0\n\t}\n\treturn h.scaledCVT[i]\n}\n\n// setScaledCVT overrides the scaled value from the font's Control Value Table.\nfunc (h *hinter) setScaledCVT(i int32, v fixed.Int26_6) {\n\tif !h.scaledCVTInitialized {\n\t\th.initializeScaledCVT()\n\t}\n\tif i < 0 || len(h.scaledCVT) <= int(i) {\n\t\treturn\n\t}\n\th.scaledCVT[i] = v\n}\n\nfunc (h *hinter) point(zonePointer uint32, pt pointType, i int32) *Point {\n\tpoints := h.points[h.gs.zp[zonePointer]][pt]\n\tif i < 0 || len(points) <= int(i) {\n\t\treturn nil\n\t}\n\treturn &points[i]\n}\n\nfunc (h *hinter) move(p *Point, distance fixed.Int26_6, touch bool) {\n\tfvx := int64(h.gs.fv[0])\n\tpvx := int64(h.gs.pv[0])\n\tif fvx == 0x4000 && pvx == 0x4000 {\n\t\tp.X += fixed.Int26_6(distance)\n\t\tif touch {\n\t\t\tp.Flags |= flagTouchedX\n\t\t}\n\t\treturn\n\t}\n\n\tfvy := int64(h.gs.fv[1])\n\tpvy := int64(h.gs.pv[1])\n\tif fvy == 0x4000 && pvy == 0x4000 {\n\t\tp.Y += fixed.Int26_6(distance)\n\t\tif touch {\n\t\t\tp.Flags |= flagTouchedY\n\t\t}\n\t\treturn\n\t}\n\n\tfvDotPv := (fvx*pvx + fvy*pvy) >> 14\n\n\tif fvx != 0 {\n\t\tp.X += fixed.Int26_6(mulDiv(fvx, int64(distance), fvDotPv))\n\t\tif touch {\n\t\t\tp.Flags |= flagTouchedX\n\t\t}\n\t}\n\n\tif fvy != 0 {\n\t\tp.Y += fixed.Int26_6(mulDiv(fvy, int64(distance), fvDotPv))\n\t\tif touch {\n\t\t\tp.Flags |= flagTouchedY\n\t\t}\n\t}\n}\n\nfunc (h *hinter) iupInterp(interpY bool, p1, p2, ref1, ref2 int) {\n\tif p1 > p2 {\n\t\treturn\n\t}\n\tif ref1 >= len(h.points[glyphZone][current]) ||\n\t\tref2 >= len(h.points[glyphZone][current]) {\n\t\treturn\n\t}\n\n\tvar ifu1, ifu2 fixed.Int26_6\n\tif interpY {\n\t\tifu1 = h.points[glyphZone][inFontUnits][ref1].Y\n\t\tifu2 = h.points[glyphZone][inFontUnits][ref2].Y\n\t} else {\n\t\tifu1 = h.points[glyphZone][inFontUnits][ref1].X\n\t\tifu2 = h.points[glyphZone][inFontUnits][ref2].X\n\t}\n\tif ifu1 > ifu2 {\n\t\tifu1, ifu2 = ifu2, ifu1\n\t\tref1, ref2 = ref2, ref1\n\t}\n\n\tvar unh1, unh2, delta1, delta2 fixed.Int26_6\n\tif interpY {\n\t\tunh1 = h.points[glyphZone][unhinted][ref1].Y\n\t\tunh2 = h.points[glyphZone][unhinted][ref2].Y\n\t\tdelta1 = h.points[glyphZone][current][ref1].Y - unh1\n\t\tdelta2 = h.points[glyphZone][current][ref2].Y - unh2\n\t} else {\n\t\tunh1 = h.points[glyphZone][unhinted][ref1].X\n\t\tunh2 = h.points[glyphZone][unhinted][ref2].X\n\t\tdelta1 = h.points[glyphZone][current][ref1].X - unh1\n\t\tdelta2 = h.points[glyphZone][current][ref2].X - unh2\n\t}\n\n\tvar xy, ifuXY fixed.Int26_6\n\tif ifu1 == ifu2 {\n\t\tfor i := p1; i <= p2; i++ {\n\t\t\tif interpY {\n\t\t\t\txy = h.points[glyphZone][unhinted][i].Y\n\t\t\t} else {\n\t\t\t\txy = h.points[glyphZone][unhinted][i].X\n\t\t\t}\n\n\t\t\tif xy <= unh1 {\n\t\t\t\txy += delta1\n\t\t\t} else {\n\t\t\t\txy += delta2\n\t\t\t}\n\n\t\t\tif interpY {\n\t\t\t\th.points[glyphZone][current][i].Y = xy\n\t\t\t} else {\n\t\t\t\th.points[glyphZone][current][i].X = xy\n\t\t\t}\n\t\t}\n\t\treturn\n\t}\n\n\tscale, scaleOK := int64(0), false\n\tfor i := p1; i <= p2; i++ {\n\t\tif interpY {\n\t\t\txy = h.points[glyphZone][unhinted][i].Y\n\t\t\tifuXY = h.points[glyphZone][inFontUnits][i].Y\n\t\t} else {\n\t\t\txy = h.points[glyphZone][unhinted][i].X\n\t\t\tifuXY = h.points[glyphZone][inFontUnits][i].X\n\t\t}\n\n\t\tif xy <= unh1 {\n\t\t\txy += delta1\n\t\t} else if xy >= unh2 {\n\t\t\txy += delta2\n\t\t} else {\n\t\t\tif !scaleOK {\n\t\t\t\tscaleOK = true\n\t\t\t\tscale = mulDiv(int64(unh2+delta2-unh1-delta1), 0x10000, int64(ifu2-ifu1))\n\t\t\t}\n\t\t\tnumer := int64(ifuXY-ifu1) * scale\n\t\t\tif numer >= 0 {\n\t\t\t\tnumer += 0x8000\n\t\t\t} else {\n\t\t\t\tnumer -= 0x8000\n\t\t\t}\n\t\t\txy = unh1 + delta1 + fixed.Int26_6(numer/0x10000)\n\t\t}\n\n\t\tif interpY {\n\t\t\th.points[glyphZone][current][i].Y = xy\n\t\t} else {\n\t\t\th.points[glyphZone][current][i].X = xy\n\t\t}\n\t}\n}\n\nfunc (h *hinter) iupShift(interpY bool, p1, p2, p int) {\n\tvar delta fixed.Int26_6\n\tif interpY {\n\t\tdelta = h.points[glyphZone][current][p].Y - h.points[glyphZone][unhinted][p].Y\n\t} else {\n\t\tdelta = h.points[glyphZone][current][p].X - h.points[glyphZone][unhinted][p].X\n\t}\n\tif delta == 0 {\n\t\treturn\n\t}\n\tfor i := p1; i < p2; i++ {\n\t\tif i == p {\n\t\t\tcontinue\n\t\t}\n\t\tif interpY {\n\t\t\th.points[glyphZone][current][i].Y += delta\n\t\t} else {\n\t\t\th.points[glyphZone][current][i].X += delta\n\t\t}\n\t}\n}\n\nfunc (h *hinter) displacement(useZP1 bool) (zonePointer uint32, i int32, d fixed.Int26_6, ok bool) {\n\tzonePointer, i = uint32(0), h.gs.rp[1]\n\tif useZP1 {\n\t\tzonePointer, i = 1, h.gs.rp[2]\n\t}\n\tp := h.point(zonePointer, current, i)\n\tq := h.point(zonePointer, unhinted, i)\n\tif p == nil || q == nil {\n\t\treturn 0, 0, 0, false\n\t}\n\td = dotProduct(p.X-q.X, p.Y-q.Y, h.gs.pv)\n\treturn zonePointer, i, d, true\n}\n\n// skipInstructionPayload increments pc by the extra data that follows a\n// variable length PUSHB or PUSHW instruction.\nfunc skipInstructionPayload(program []byte, pc int) (newPC int, ok bool) {\n\tswitch program[pc] {\n\tcase opNPUSHB:\n\t\tpc++\n\t\tif pc >= len(program) {\n\t\t\treturn 0, false\n\t\t}\n\t\tpc += int(program[pc])\n\tcase opNPUSHW:\n\t\tpc++\n\t\tif pc >= len(program) {\n\t\t\treturn 0, false\n\t\t}\n\t\tpc += 2 * int(program[pc])\n\tcase opPUSHB000, opPUSHB001, opPUSHB010, opPUSHB011,\n\t\topPUSHB100, opPUSHB101, opPUSHB110, opPUSHB111:\n\t\tpc += int(program[pc] - (opPUSHB000 - 1))\n\tcase opPUSHW000, opPUSHW001, opPUSHW010, opPUSHW011,\n\t\topPUSHW100, opPUSHW101, opPUSHW110, opPUSHW111:\n\t\tpc += 2 * int(program[pc]-(opPUSHW000-1))\n\t}\n\treturn pc, true\n}\n\n// f2dot14 is a 2.14 fixed point number.\ntype f2dot14 int16\n\nfunc normalize(x, y f2dot14) [2]f2dot14 {\n\tfx, fy := float64(x), float64(y)\n\tl := 0x4000 / math.Hypot(fx, fy)\n\tfx *= l\n\tif fx >= 0 {\n\t\tfx += 0.5\n\t} else {\n\t\tfx -= 0.5\n\t}\n\tfy *= l\n\tif fy >= 0 {\n\t\tfy += 0.5\n\t} else {\n\t\tfy -= 0.5\n\t}\n\treturn [2]f2dot14{f2dot14(fx), f2dot14(fy)}\n}\n\n// fabs returns abs(x) in 26.6 fixed point arithmetic.\nfunc fabs(x fixed.Int26_6) fixed.Int26_6 {\n\tif x < 0 {\n\t\treturn -x\n\t}\n\treturn x\n}\n\n// fdiv returns x/y in 26.6 fixed point arithmetic.\nfunc fdiv(x, y fixed.Int26_6) fixed.Int26_6 {\n\treturn fixed.Int26_6((int64(x) << 6) / int64(y))\n}\n\n// fmul returns x*y in 26.6 fixed point arithmetic.\nfunc fmul(x, y fixed.Int26_6) fixed.Int26_6 {\n\treturn fixed.Int26_6((int64(x)*int64(y) + 1<<5) >> 6)\n}\n\n// dotProduct returns the dot product of [x, y] and q. It is almost the same as\n//\tpx := int64(x)\n//\tpy := int64(y)\n//\tqx := int64(q[0])\n//\tqy := int64(q[1])\n//\treturn fixed.Int26_6((px*qx + py*qy + 1<<13) >> 14)\n// except that the computation is done with 32-bit integers to produce exactly\n// the same rounding behavior as C Freetype.\nfunc dotProduct(x, y fixed.Int26_6, q [2]f2dot14) fixed.Int26_6 {\n\t// Compute x*q[0] as 64-bit value.\n\tl := uint32((int32(x) & 0xFFFF) * int32(q[0]))\n\tm := (int32(x) >> 16) * int32(q[0])\n\n\tlo1 := l + (uint32(m) << 16)\n\thi1 := (m >> 16) + (int32(l) >> 31) + bool2int32(lo1 < l)\n\n\t// Compute y*q[1] as 64-bit value.\n\tl = uint32((int32(y) & 0xFFFF) * int32(q[1]))\n\tm = (int32(y) >> 16) * int32(q[1])\n\n\tlo2 := l + (uint32(m) << 16)\n\thi2 := (m >> 16) + (int32(l) >> 31) + bool2int32(lo2 < l)\n\n\t// Add them.\n\tlo := lo1 + lo2\n\thi := hi1 + hi2 + bool2int32(lo < lo1)\n\n\t// Divide the result by 2^14 with rounding.\n\ts := hi >> 31\n\tl = lo + uint32(s)\n\thi += s + bool2int32(l < lo)\n\tlo = l\n\n\tl = lo + 0x2000\n\thi += bool2int32(l < lo)\n\n\treturn fixed.Int26_6((uint32(hi) << 18) | (l >> 14))\n}\n\n// mulDiv returns x*y/z, rounded to the nearest integer.\nfunc mulDiv(x, y, z int64) int64 {\n\txy := x * y\n\tif z < 0 {\n\t\txy, z = -xy, -z\n\t}\n\tif xy >= 0 {\n\t\txy += z / 2\n\t} else {\n\t\txy -= z / 2\n\t}\n\treturn xy / z\n}\n\n// round rounds the given number. The rounding algorithm is described at\n// https://developer.apple.com/fonts/TTRefMan/RM02/Chap2.html#rounding\nfunc (h *hinter) round(x fixed.Int26_6) fixed.Int26_6 {\n\tif h.gs.roundPeriod == 0 {\n\t\t// Rounding is off.\n\t\treturn x\n\t}\n\tif x >= 0 {\n\t\tret := x - h.gs.roundPhase + h.gs.roundThreshold\n\t\tif h.gs.roundSuper45 {\n\t\t\tret /= h.gs.roundPeriod\n\t\t\tret *= h.gs.roundPeriod\n\t\t} else {\n\t\t\tret &= -h.gs.roundPeriod\n\t\t}\n\t\tif x != 0 && ret < 0 {\n\t\t\tret = 0\n\t\t}\n\t\treturn ret + h.gs.roundPhase\n\t}\n\tret := -x - h.gs.roundPhase + h.gs.roundThreshold\n\tif h.gs.roundSuper45 {\n\t\tret /= h.gs.roundPeriod\n\t\tret *= h.gs.roundPeriod\n\t} else {\n\t\tret &= -h.gs.roundPeriod\n\t}\n\tif ret < 0 {\n\t\tret = 0\n\t}\n\treturn -ret - h.gs.roundPhase\n}\n\nfunc bool2int32(b bool) int32 {\n\tif b {\n\t\treturn 1\n\t}\n\treturn 0\n}\n" }, { "path": "vendor/github.com/golang/freetype/truetype/opcodes.go", "content": "// Copyright 2012 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\npackage truetype\n\n// The Truetype opcodes are summarized at\n// https://developer.apple.com/fonts/TTRefMan/RM07/appendixA.html\n\nconst (\n\topSVTCA0 = 0x00 // Set freedom and projection Vectors To Coordinate Axis\n\topSVTCA1 = 0x01 // .\n\topSPVTCA0 = 0x02 // Set Projection Vector To Coordinate Axis\n\topSPVTCA1 = 0x03 // .\n\topSFVTCA0 = 0x04 // Set Freedom Vector to Coordinate Axis\n\topSFVTCA1 = 0x05 // .\n\topSPVTL0 = 0x06 // Set Projection Vector To Line\n\topSPVTL1 = 0x07 // .\n\topSFVTL0 = 0x08 // Set Freedom Vector To Line\n\topSFVTL1 = 0x09 // .\n\topSPVFS = 0x0a // Set Projection Vector From Stack\n\topSFVFS = 0x0b // Set Freedom Vector From Stack\n\topGPV = 0x0c // Get Projection Vector\n\topGFV = 0x0d // Get Freedom Vector\n\topSFVTPV = 0x0e // Set Freedom Vector To Projection Vector\n\topISECT = 0x0f // moves point p to the InterSECTion of two lines\n\topSRP0 = 0x10 // Set Reference Point 0\n\topSRP1 = 0x11 // Set Reference Point 1\n\topSRP2 = 0x12 // Set Reference Point 2\n\topSZP0 = 0x13 // Set Zone Pointer 0\n\topSZP1 = 0x14 // Set Zone Pointer 1\n\topSZP2 = 0x15 // Set Zone Pointer 2\n\topSZPS = 0x16 // Set Zone PointerS\n\topSLOOP = 0x17 // Set LOOP variable\n\topRTG = 0x18 // Round To Grid\n\topRTHG = 0x19 // Round To Half Grid\n\topSMD = 0x1a // Set Minimum Distance\n\topELSE = 0x1b // ELSE clause\n\topJMPR = 0x1c // JuMP Relative\n\topSCVTCI = 0x1d // Set Control Value Table Cut-In\n\topSSWCI = 0x1e // Set Single Width Cut-In\n\topSSW = 0x1f // Set Single Width\n\topDUP = 0x20 // DUPlicate top stack element\n\topPOP = 0x21 // POP top stack element\n\topCLEAR = 0x22 // CLEAR the stack\n\topSWAP = 0x23 // SWAP the top two elements on the stack\n\topDEPTH = 0x24 // DEPTH of the stack\n\topCINDEX = 0x25 // Copy the INDEXed element to the top of the stack\n\topMINDEX = 0x26 // Move the INDEXed element to the top of the stack\n\topALIGNPTS = 0x27 // ALIGN PoinTS\n\top_0x28 = 0x28 // deprecated\n\topUTP = 0x29 // UnTouch Point\n\topLOOPCALL = 0x2a // LOOP and CALL function\n\topCALL = 0x2b // CALL function\n\topFDEF = 0x2c // Function DEFinition\n\topENDF = 0x2d // END Function definition\n\topMDAP0 = 0x2e // Move Direct Absolute Point\n\topMDAP1 = 0x2f // .\n\topIUP0 = 0x30 // Interpolate Untouched Points through the outline\n\topIUP1 = 0x31 // .\n\topSHP0 = 0x32 // SHift Point using reference point\n\topSHP1 = 0x33 // .\n\topSHC0 = 0x34 // SHift Contour using reference point\n\topSHC1 = 0x35 // .\n\topSHZ0 = 0x36 // SHift Zone using reference point\n\topSHZ1 = 0x37 // .\n\topSHPIX = 0x38 // SHift point by a PIXel amount\n\topIP = 0x39 // Interpolate Point\n\topMSIRP0 = 0x3a // Move Stack Indirect Relative Point\n\topMSIRP1 = 0x3b // .\n\topALIGNRP = 0x3c // ALIGN to Reference Point\n\topRTDG = 0x3d // Round To Double Grid\n\topMIAP0 = 0x3e // Move Indirect Absolute Point\n\topMIAP1 = 0x3f // .\n\topNPUSHB = 0x40 // PUSH N Bytes\n\topNPUSHW = 0x41 // PUSH N Words\n\topWS = 0x42 // Write Store\n\topRS = 0x43 // Read Store\n\topWCVTP = 0x44 // Write Control Value Table in Pixel units\n\topRCVT = 0x45 // Read Control Value Table entry\n\topGC0 = 0x46 // Get Coordinate projected onto the projection vector\n\topGC1 = 0x47 // .\n\topSCFS = 0x48 // Sets Coordinate From the Stack using projection vector and freedom vector\n\topMD0 = 0x49 // Measure Distance\n\topMD1 = 0x4a // .\n\topMPPEM = 0x4b // Measure Pixels Per EM\n\topMPS = 0x4c // Measure Point Size\n\topFLIPON = 0x4d // set the auto FLIP Boolean to ON\n\topFLIPOFF = 0x4e // set the auto FLIP Boolean to OFF\n\topDEBUG = 0x4f // DEBUG call\n\topLT = 0x50 // Less Than\n\topLTEQ = 0x51 // Less Than or EQual\n\topGT = 0x52 // Greater Than\n\topGTEQ = 0x53 // Greater Than or EQual\n\topEQ = 0x54 // EQual\n\topNEQ = 0x55 // Not EQual\n\topODD = 0x56 // ODD\n\topEVEN = 0x57 // EVEN\n\topIF = 0x58 // IF test\n\topEIF = 0x59 // End IF\n\topAND = 0x5a // logical AND\n\topOR = 0x5b // logical OR\n\topNOT = 0x5c // logical NOT\n\topDELTAP1 = 0x5d // DELTA exception P1\n\topSDB = 0x5e // Set Delta Base in the graphics state\n\topSDS = 0x5f // Set Delta Shift in the graphics state\n\topADD = 0x60 // ADD\n\topSUB = 0x61 // SUBtract\n\topDIV = 0x62 // DIVide\n\topMUL = 0x63 // MULtiply\n\topABS = 0x64 // ABSolute value\n\topNEG = 0x65 // NEGate\n\topFLOOR = 0x66 // FLOOR\n\topCEILING = 0x67 // CEILING\n\topROUND00 = 0x68 // ROUND value\n\topROUND01 = 0x69 // .\n\topROUND10 = 0x6a // .\n\topROUND11 = 0x6b // .\n\topNROUND00 = 0x6c // No ROUNDing of value\n\topNROUND01 = 0x6d // .\n\topNROUND10 = 0x6e // .\n\topNROUND11 = 0x6f // .\n\topWCVTF = 0x70 // Write Control Value Table in Funits\n\topDELTAP2 = 0x71 // DELTA exception P2\n\topDELTAP3 = 0x72 // DELTA exception P3\n\topDELTAC1 = 0x73 // DELTA exception C1\n\topDELTAC2 = 0x74 // DELTA exception C2\n\topDELTAC3 = 0x75 // DELTA exception C3\n\topSROUND = 0x76 // Super ROUND\n\topS45ROUND = 0x77 // Super ROUND 45 degrees\n\topJROT = 0x78 // Jump Relative On True\n\topJROF = 0x79 // Jump Relative On False\n\topROFF = 0x7a // Round OFF\n\top_0x7b = 0x7b // deprecated\n\topRUTG = 0x7c // Round Up To Grid\n\topRDTG = 0x7d // Round Down To Grid\n\topSANGW = 0x7e // Set ANGle Weight\n\topAA = 0x7f // Adjust Angle\n\topFLIPPT = 0x80 // FLIP PoinT\n\topFLIPRGON = 0x81 // FLIP RanGe ON\n\topFLIPRGOFF = 0x82 // FLIP RanGe OFF\n\top_0x83 = 0x83 // deprecated\n\top_0x84 = 0x84 // deprecated\n\topSCANCTRL = 0x85 // SCAN conversion ConTRoL\n\topSDPVTL0 = 0x86 // Set Dual Projection Vector To Line\n\topSDPVTL1 = 0x87 // .\n\topGETINFO = 0x88 // GET INFOrmation\n\topIDEF = 0x89 // Instruction DEFinition\n\topROLL = 0x8a // ROLL the top three stack elements\n\topMAX = 0x8b // MAXimum of top two stack elements\n\topMIN = 0x8c // MINimum of top two stack elements\n\topSCANTYPE = 0x8d // SCANTYPE\n\topINSTCTRL = 0x8e // INSTRuction execution ConTRoL\n\top_0x8f = 0x8f\n\top_0x90 = 0x90\n\top_0x91 = 0x91\n\top_0x92 = 0x92\n\top_0x93 = 0x93\n\top_0x94 = 0x94\n\top_0x95 = 0x95\n\top_0x96 = 0x96\n\top_0x97 = 0x97\n\top_0x98 = 0x98\n\top_0x99 = 0x99\n\top_0x9a = 0x9a\n\top_0x9b = 0x9b\n\top_0x9c = 0x9c\n\top_0x9d = 0x9d\n\top_0x9e = 0x9e\n\top_0x9f = 0x9f\n\top_0xa0 = 0xa0\n\top_0xa1 = 0xa1\n\top_0xa2 = 0xa2\n\top_0xa3 = 0xa3\n\top_0xa4 = 0xa4\n\top_0xa5 = 0xa5\n\top_0xa6 = 0xa6\n\top_0xa7 = 0xa7\n\top_0xa8 = 0xa8\n\top_0xa9 = 0xa9\n\top_0xaa = 0xaa\n\top_0xab = 0xab\n\top_0xac = 0xac\n\top_0xad = 0xad\n\top_0xae = 0xae\n\top_0xaf = 0xaf\n\topPUSHB000 = 0xb0 // PUSH Bytes\n\topPUSHB001 = 0xb1 // .\n\topPUSHB010 = 0xb2 // .\n\topPUSHB011 = 0xb3 // .\n\topPUSHB100 = 0xb4 // .\n\topPUSHB101 = 0xb5 // .\n\topPUSHB110 = 0xb6 // .\n\topPUSHB111 = 0xb7 // .\n\topPUSHW000 = 0xb8 // PUSH Words\n\topPUSHW001 = 0xb9 // .\n\topPUSHW010 = 0xba // .\n\topPUSHW011 = 0xbb // .\n\topPUSHW100 = 0xbc // .\n\topPUSHW101 = 0xbd // .\n\topPUSHW110 = 0xbe // .\n\topPUSHW111 = 0xbf // .\n\topMDRP00000 = 0xc0 // Move Direct Relative Point\n\topMDRP00001 = 0xc1 // .\n\topMDRP00010 = 0xc2 // .\n\topMDRP00011 = 0xc3 // .\n\topMDRP00100 = 0xc4 // .\n\topMDRP00101 = 0xc5 // .\n\topMDRP00110 = 0xc6 // .\n\topMDRP00111 = 0xc7 // .\n\topMDRP01000 = 0xc8 // .\n\topMDRP01001 = 0xc9 // .\n\topMDRP01010 = 0xca // .\n\topMDRP01011 = 0xcb // .\n\topMDRP01100 = 0xcc // .\n\topMDRP01101 = 0xcd // .\n\topMDRP01110 = 0xce // .\n\topMDRP01111 = 0xcf // .\n\topMDRP10000 = 0xd0 // .\n\topMDRP10001 = 0xd1 // .\n\topMDRP10010 = 0xd2 // .\n\topMDRP10011 = 0xd3 // .\n\topMDRP10100 = 0xd4 // .\n\topMDRP10101 = 0xd5 // .\n\topMDRP10110 = 0xd6 // .\n\topMDRP10111 = 0xd7 // .\n\topMDRP11000 = 0xd8 // .\n\topMDRP11001 = 0xd9 // .\n\topMDRP11010 = 0xda // .\n\topMDRP11011 = 0xdb // .\n\topMDRP11100 = 0xdc // .\n\topMDRP11101 = 0xdd // .\n\topMDRP11110 = 0xde // .\n\topMDRP11111 = 0xdf // .\n\topMIRP00000 = 0xe0 // Move Indirect Relative Point\n\topMIRP00001 = 0xe1 // .\n\topMIRP00010 = 0xe2 // .\n\topMIRP00011 = 0xe3 // .\n\topMIRP00100 = 0xe4 // .\n\topMIRP00101 = 0xe5 // .\n\topMIRP00110 = 0xe6 // .\n\topMIRP00111 = 0xe7 // .\n\topMIRP01000 = 0xe8 // .\n\topMIRP01001 = 0xe9 // .\n\topMIRP01010 = 0xea // .\n\topMIRP01011 = 0xeb // .\n\topMIRP01100 = 0xec // .\n\topMIRP01101 = 0xed // .\n\topMIRP01110 = 0xee // .\n\topMIRP01111 = 0xef // .\n\topMIRP10000 = 0xf0 // .\n\topMIRP10001 = 0xf1 // .\n\topMIRP10010 = 0xf2 // .\n\topMIRP10011 = 0xf3 // .\n\topMIRP10100 = 0xf4 // .\n\topMIRP10101 = 0xf5 // .\n\topMIRP10110 = 0xf6 // .\n\topMIRP10111 = 0xf7 // .\n\topMIRP11000 = 0xf8 // .\n\topMIRP11001 = 0xf9 // .\n\topMIRP11010 = 0xfa // .\n\topMIRP11011 = 0xfb // .\n\topMIRP11100 = 0xfc // .\n\topMIRP11101 = 0xfd // .\n\topMIRP11110 = 0xfe // .\n\topMIRP11111 = 0xff // .\n)\n\n// popCount is the number of stack elements that each opcode pops.\nvar popCount = [256]uint8{\n\t// 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f\n\t0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 0, 0, 0, 5, // 0x00 - 0x0f\n\t1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, // 0x10 - 0x1f\n\t1, 1, 0, 2, 0, 1, 1, 2, 0, 1, 2, 1, 1, 0, 1, 1, // 0x20 - 0x2f\n\t0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 2, 2, 0, 0, 2, 2, // 0x30 - 0x3f\n\t0, 0, 2, 1, 2, 1, 1, 1, 2, 2, 2, 0, 0, 0, 0, 0, // 0x40 - 0x4f\n\t2, 2, 2, 2, 2, 2, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, // 0x50 - 0x5f\n\t2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0x60 - 0x6f\n\t2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 0, 0, 0, 0, 1, 1, // 0x70 - 0x7f\n\t0, 2, 2, 0, 0, 1, 2, 2, 1, 1, 3, 2, 2, 1, 2, 0, // 0x80 - 0x8f\n\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 0x90 - 0x9f\n\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 0xa0 - 0xaf\n\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 0xb0 - 0xbf\n\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0xc0 - 0xcf\n\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0xd0 - 0xdf\n\t2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // 0xe0 - 0xef\n\t2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // 0xf0 - 0xff\n}\n" }, { "path": "vendor/github.com/golang/freetype/truetype/truetype.go", "content": "// Copyright 2010 The Freetype-Go Authors. All rights reserved.\n// Use of this source code is governed by your choice of either the\n// FreeType License or the GNU General Public License version 2 (or\n// any later version), both of which can be found in the LICENSE file.\n\n// Package truetype provides a parser for the TTF and TTC file formats.\n// Those formats are documented at http://developer.apple.com/fonts/TTRefMan/\n// and http://www.microsoft.com/typography/otspec/\n//\n// Some of a font's methods provide lengths or co-ordinates, e.g. bounds, font\n// metrics and control points. All these methods take a scale parameter, which\n// is the number of pixels in 1 em, expressed as a 26.6 fixed point value. For\n// example, if 1 em is 10 pixels then scale is fixed.I(10), which is equal to\n// fixed.Int26_6(10 << 6).\n//\n// To measure a TrueType font in ideal FUnit space, use scale equal to\n// font.FUnitsPerEm().\npackage truetype // import \"github.com/golang/freetype/truetype\"\n\nimport (\n\t\"fmt\"\n\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// An Index is a Font's index of a rune.\ntype Index uint16\n\n// A NameID identifies a name table entry.\n//\n// See https://developer.apple.com/fonts/TrueType-Reference-Manual/RM06/Chap6name.html\ntype NameID uint16\n\nconst (\n\tNameIDCopyright NameID = 0\n\tNameIDFontFamily = 1\n\tNameIDFontSubfamily = 2\n\tNameIDUniqueSubfamilyID = 3\n\tNameIDFontFullName = 4\n\tNameIDNameTableVersion = 5\n\tNameIDPostscriptName = 6\n\tNameIDTrademarkNotice = 7\n\tNameIDManufacturerName = 8\n\tNameIDDesignerName = 9\n\tNameIDFontDescription = 10\n\tNameIDFontVendorURL = 11\n\tNameIDFontDesignerURL = 12\n\tNameIDFontLicense = 13\n\tNameIDFontLicenseURL = 14\n\tNameIDPreferredFamily = 16\n\tNameIDPreferredSubfamily = 17\n\tNameIDCompatibleName = 18\n\tNameIDSampleText = 19\n)\n\nconst (\n\t// A 32-bit encoding consists of a most-significant 16-bit Platform ID and a\n\t// least-significant 16-bit Platform Specific ID. The magic numbers are\n\t// specified at https://www.microsoft.com/typography/otspec/name.htm\n\tunicodeEncodingBMPOnly = 0x00000003 // PID = 0 (Unicode), PSID = 3 (Unicode 2.0 BMP Only)\n\tunicodeEncodingFull = 0x00000004 // PID = 0 (Unicode), PSID = 4 (Unicode 2.0 Full Repertoire)\n\tmicrosoftSymbolEncoding = 0x00030000 // PID = 3 (Microsoft), PSID = 0 (Symbol)\n\tmicrosoftUCS2Encoding = 0x00030001 // PID = 3 (Microsoft), PSID = 1 (UCS-2)\n\tmicrosoftUCS4Encoding = 0x0003000a // PID = 3 (Microsoft), PSID = 10 (UCS-4)\n)\n\n// An HMetric holds the horizontal metrics of a single glyph.\ntype HMetric struct {\n\tAdvanceWidth, LeftSideBearing fixed.Int26_6\n}\n\n// A VMetric holds the vertical metrics of a single glyph.\ntype VMetric struct {\n\tAdvanceHeight, TopSideBearing fixed.Int26_6\n}\n\n// A FormatError reports that the input is not a valid TrueType font.\ntype FormatError string\n\nfunc (e FormatError) Error() string {\n\treturn \"freetype: invalid TrueType format: \" + string(e)\n}\n\n// An UnsupportedError reports that the input uses a valid but unimplemented\n// TrueType feature.\ntype UnsupportedError string\n\nfunc (e UnsupportedError) Error() string {\n\treturn \"freetype: unsupported TrueType feature: \" + string(e)\n}\n\n// u32 returns the big-endian uint32 at b[i:].\nfunc u32(b []byte, i int) uint32 {\n\treturn uint32(b[i])<<24 | uint32(b[i+1])<<16 | uint32(b[i+2])<<8 | uint32(b[i+3])\n}\n\n// u16 returns the big-endian uint16 at b[i:].\nfunc u16(b []byte, i int) uint16 {\n\treturn uint16(b[i])<<8 | uint16(b[i+1])\n}\n\n// readTable returns a slice of the TTF data given by a table's directory entry.\nfunc readTable(ttf []byte, offsetLength []byte) ([]byte, error) {\n\toffset := int(u32(offsetLength, 0))\n\tif offset < 0 {\n\t\treturn nil, FormatError(fmt.Sprintf(\"offset too large: %d\", uint32(offset)))\n\t}\n\tlength := int(u32(offsetLength, 4))\n\tif length < 0 {\n\t\treturn nil, FormatError(fmt.Sprintf(\"length too large: %d\", uint32(length)))\n\t}\n\tend := offset + length\n\tif end < 0 || end > len(ttf) {\n\t\treturn nil, FormatError(fmt.Sprintf(\"offset + length too large: %d\", uint32(offset)+uint32(length)))\n\t}\n\treturn ttf[offset:end], nil\n}\n\n// parseSubtables returns the offset and platformID of the best subtable in\n// table, where best favors a Unicode cmap encoding, and failing that, a\n// Microsoft cmap encoding. offset is the offset of the first subtable in\n// table, and size is the size of each subtable.\n//\n// If pred is non-nil, then only subtables that satisfy that predicate will be\n// considered.\nfunc parseSubtables(table []byte, name string, offset, size int, pred func([]byte) bool) (\n\tbestOffset int, bestPID uint32, retErr error) {\n\n\tif len(table) < 4 {\n\t\treturn 0, 0, FormatError(name + \" too short\")\n\t}\n\tnSubtables := int(u16(table, 2))\n\tif len(table) < size*nSubtables+offset {\n\t\treturn 0, 0, FormatError(name + \" too short\")\n\t}\n\tok := false\n\tfor i := 0; i < nSubtables; i, offset = i+1, offset+size {\n\t\tif pred != nil && !pred(table[offset:]) {\n\t\t\tcontinue\n\t\t}\n\t\t// We read the 16-bit Platform ID and 16-bit Platform Specific ID as a single uint32.\n\t\t// All values are big-endian.\n\t\tpidPsid := u32(table, offset)\n\t\t// We prefer the Unicode cmap encoding. Failing to find that, we fall\n\t\t// back onto the Microsoft cmap encoding.\n\t\tif pidPsid == unicodeEncodingBMPOnly || pidPsid == unicodeEncodingFull {\n\t\t\tbestOffset, bestPID, ok = offset, pidPsid>>16, true\n\t\t\tbreak\n\n\t\t} else if pidPsid == microsoftSymbolEncoding ||\n\t\t\tpidPsid == microsoftUCS2Encoding ||\n\t\t\tpidPsid == microsoftUCS4Encoding {\n\n\t\t\tbestOffset, bestPID, ok = offset, pidPsid>>16, true\n\t\t\t// We don't break out of the for loop, so that Unicode can override Microsoft.\n\t\t}\n\t}\n\tif !ok {\n\t\treturn 0, 0, UnsupportedError(name + \" encoding\")\n\t}\n\treturn bestOffset, bestPID, nil\n}\n\nconst (\n\tlocaOffsetFormatUnknown int = iota\n\tlocaOffsetFormatShort\n\tlocaOffsetFormatLong\n)\n\n// A cm holds a parsed cmap entry.\ntype cm struct {\n\tstart, end, delta, offset uint32\n}\n\n// A Font represents a Truetype font.\ntype Font struct {\n\t// Tables sliced from the TTF data. The different tables are documented\n\t// at http://developer.apple.com/fonts/TTRefMan/RM06/Chap6.html\n\tcmap, cvt, fpgm, glyf, hdmx, head, hhea, hmtx, kern, loca, maxp, name, os2, prep, vmtx []byte\n\n\tcmapIndexes []byte\n\n\t// Cached values derived from the raw ttf data.\n\tcm []cm\n\tlocaOffsetFormat int\n\tnGlyph, nHMetric, nKern int\n\tfUnitsPerEm int32\n\tascent int32 // In FUnits.\n\tdescent int32 // In FUnits; typically negative.\n\tbounds fixed.Rectangle26_6 // In FUnits.\n\t// Values from the maxp section.\n\tmaxTwilightPoints, maxStorage, maxFunctionDefs, maxStackElements uint16\n}\n\nfunc (f *Font) parseCmap() error {\n\tconst (\n\t\tcmapFormat4 = 4\n\t\tcmapFormat12 = 12\n\t\tlanguageIndependent = 0\n\t)\n\n\toffset, _, err := parseSubtables(f.cmap, \"cmap\", 4, 8, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\toffset = int(u32(f.cmap, offset+4))\n\tif offset <= 0 || offset > len(f.cmap) {\n\t\treturn FormatError(\"bad cmap offset\")\n\t}\n\n\tcmapFormat := u16(f.cmap, offset)\n\tswitch cmapFormat {\n\tcase cmapFormat4:\n\t\tlanguage := u16(f.cmap, offset+4)\n\t\tif language != languageIndependent {\n\t\t\treturn UnsupportedError(fmt.Sprintf(\"language: %d\", language))\n\t\t}\n\t\tsegCountX2 := int(u16(f.cmap, offset+6))\n\t\tif segCountX2%2 == 1 {\n\t\t\treturn FormatError(fmt.Sprintf(\"bad segCountX2: %d\", segCountX2))\n\t\t}\n\t\tsegCount := segCountX2 / 2\n\t\toffset += 14\n\t\tf.cm = make([]cm, segCount)\n\t\tfor i := 0; i < segCount; i++ {\n\t\t\tf.cm[i].end = uint32(u16(f.cmap, offset))\n\t\t\toffset += 2\n\t\t}\n\t\toffset += 2\n\t\tfor i := 0; i < segCount; i++ {\n\t\t\tf.cm[i].start = uint32(u16(f.cmap, offset))\n\t\t\toffset += 2\n\t\t}\n\t\tfor i := 0; i < segCount; i++ {\n\t\t\tf.cm[i].delta = uint32(u16(f.cmap, offset))\n\t\t\toffset += 2\n\t\t}\n\t\tfor i := 0; i < segCount; i++ {\n\t\t\tf.cm[i].offset = uint32(u16(f.cmap, offset))\n\t\t\toffset += 2\n\t\t}\n\t\tf.cmapIndexes = f.cmap[offset:]\n\t\treturn nil\n\n\tcase cmapFormat12:\n\t\tif u16(f.cmap, offset+2) != 0 {\n\t\t\treturn FormatError(fmt.Sprintf(\"cmap format: % x\", f.cmap[offset:offset+4]))\n\t\t}\n\t\tlength := u32(f.cmap, offset+4)\n\t\tlanguage := u32(f.cmap, offset+8)\n\t\tif language != languageIndependent {\n\t\t\treturn UnsupportedError(fmt.Sprintf(\"language: %d\", language))\n\t\t}\n\t\tnGroups := u32(f.cmap, offset+12)\n\t\tif length != 12*nGroups+16 {\n\t\t\treturn FormatError(\"inconsistent cmap length\")\n\t\t}\n\t\toffset += 16\n\t\tf.cm = make([]cm, nGroups)\n\t\tfor i := uint32(0); i < nGroups; i++ {\n\t\t\tf.cm[i].start = u32(f.cmap, offset+0)\n\t\t\tf.cm[i].end = u32(f.cmap, offset+4)\n\t\t\tf.cm[i].delta = u32(f.cmap, offset+8) - f.cm[i].start\n\t\t\toffset += 12\n\t\t}\n\t\treturn nil\n\t}\n\treturn UnsupportedError(fmt.Sprintf(\"cmap format: %d\", cmapFormat))\n}\n\nfunc (f *Font) parseHead() error {\n\tif len(f.head) != 54 {\n\t\treturn FormatError(fmt.Sprintf(\"bad head length: %d\", len(f.head)))\n\t}\n\tf.fUnitsPerEm = int32(u16(f.head, 18))\n\tf.bounds.Min.X = fixed.Int26_6(int16(u16(f.head, 36)))\n\tf.bounds.Min.Y = fixed.Int26_6(int16(u16(f.head, 38)))\n\tf.bounds.Max.X = fixed.Int26_6(int16(u16(f.head, 40)))\n\tf.bounds.Max.Y = fixed.Int26_6(int16(u16(f.head, 42)))\n\tswitch i := u16(f.head, 50); i {\n\tcase 0:\n\t\tf.locaOffsetFormat = locaOffsetFormatShort\n\tcase 1:\n\t\tf.locaOffsetFormat = locaOffsetFormatLong\n\tdefault:\n\t\treturn FormatError(fmt.Sprintf(\"bad indexToLocFormat: %d\", i))\n\t}\n\treturn nil\n}\n\nfunc (f *Font) parseHhea() error {\n\tif len(f.hhea) != 36 {\n\t\treturn FormatError(fmt.Sprintf(\"bad hhea length: %d\", len(f.hhea)))\n\t}\n\tf.ascent = int32(int16(u16(f.hhea, 4)))\n\tf.descent = int32(int16(u16(f.hhea, 6)))\n\tf.nHMetric = int(u16(f.hhea, 34))\n\tif 4*f.nHMetric+2*(f.nGlyph-f.nHMetric) != len(f.hmtx) {\n\t\treturn FormatError(fmt.Sprintf(\"bad hmtx length: %d\", len(f.hmtx)))\n\t}\n\treturn nil\n}\n\nfunc (f *Font) parseKern() error {\n\t// Apple's TrueType documentation (http://developer.apple.com/fonts/TTRefMan/RM06/Chap6kern.html) says:\n\t// \"Previous versions of the 'kern' table defined both the version and nTables fields in the header\n\t// as UInt16 values and not UInt32 values. Use of the older format on the Mac OS is discouraged\n\t// (although AAT can sense an old kerning table and still make correct use of it). Microsoft\n\t// Windows still uses the older format for the 'kern' table and will not recognize the newer one.\n\t// Fonts targeted for the Mac OS only should use the new format; fonts targeted for both the Mac OS\n\t// and Windows should use the old format.\"\n\t// Since we expect that almost all fonts aim to be Windows-compatible, we only parse the \"older\" format,\n\t// just like the C Freetype implementation.\n\tif len(f.kern) == 0 {\n\t\tif f.nKern != 0 {\n\t\t\treturn FormatError(\"bad kern table length\")\n\t\t}\n\t\treturn nil\n\t}\n\tif len(f.kern) < 18 {\n\t\treturn FormatError(\"kern data too short\")\n\t}\n\tversion, offset := u16(f.kern, 0), 2\n\tif version != 0 {\n\t\treturn UnsupportedError(fmt.Sprintf(\"kern version: %d\", version))\n\t}\n\n\tn, offset := u16(f.kern, offset), offset+2\n\tif n == 0 {\n\t\treturn UnsupportedError(\"kern nTables: 0\")\n\t}\n\t// TODO: support multiple subtables. In practice, almost all .ttf files\n\t// have only one subtable, if they have a kern table at all. But it's not\n\t// impossible. Xolonium Regular (https://fontlibrary.org/en/font/xolonium)\n\t// has 3 subtables. Those subtables appear to be disjoint, rather than\n\t// being the same kerning pairs encoded in three different ways.\n\t//\n\t// For now, we'll use only the first subtable.\n\n\toffset += 2 // Skip the version.\n\tlength, offset := int(u16(f.kern, offset)), offset+2\n\tcoverage, offset := u16(f.kern, offset), offset+2\n\tif coverage != 0x0001 {\n\t\t// We only support horizontal kerning.\n\t\treturn UnsupportedError(fmt.Sprintf(\"kern coverage: 0x%04x\", coverage))\n\t}\n\tf.nKern, offset = int(u16(f.kern, offset)), offset+2\n\tif 6*f.nKern != length-14 {\n\t\treturn FormatError(\"bad kern table length\")\n\t}\n\treturn nil\n}\n\nfunc (f *Font) parseMaxp() error {\n\tif len(f.maxp) != 32 {\n\t\treturn FormatError(fmt.Sprintf(\"bad maxp length: %d\", len(f.maxp)))\n\t}\n\tf.nGlyph = int(u16(f.maxp, 4))\n\tf.maxTwilightPoints = u16(f.maxp, 16)\n\tf.maxStorage = u16(f.maxp, 18)\n\tf.maxFunctionDefs = u16(f.maxp, 20)\n\tf.maxStackElements = u16(f.maxp, 24)\n\treturn nil\n}\n\n// scale returns x divided by f.fUnitsPerEm, rounded to the nearest integer.\nfunc (f *Font) scale(x fixed.Int26_6) fixed.Int26_6 {\n\tif x >= 0 {\n\t\tx += fixed.Int26_6(f.fUnitsPerEm) / 2\n\t} else {\n\t\tx -= fixed.Int26_6(f.fUnitsPerEm) / 2\n\t}\n\treturn x / fixed.Int26_6(f.fUnitsPerEm)\n}\n\n// Bounds returns the union of a Font's glyphs' bounds.\nfunc (f *Font) Bounds(scale fixed.Int26_6) fixed.Rectangle26_6 {\n\tb := f.bounds\n\tb.Min.X = f.scale(scale * b.Min.X)\n\tb.Min.Y = f.scale(scale * b.Min.Y)\n\tb.Max.X = f.scale(scale * b.Max.X)\n\tb.Max.Y = f.scale(scale * b.Max.Y)\n\treturn b\n}\n\n// FUnitsPerEm returns the number of FUnits in a Font's em-square's side.\nfunc (f *Font) FUnitsPerEm() int32 {\n\treturn f.fUnitsPerEm\n}\n\n// Index returns a Font's index for the given rune.\nfunc (f *Font) Index(x rune) Index {\n\tc := uint32(x)\n\tfor i, j := 0, len(f.cm); i < j; {\n\t\th := i + (j-i)/2\n\t\tcm := &f.cm[h]\n\t\tif c < cm.start {\n\t\t\tj = h\n\t\t} else if cm.end < c {\n\t\t\ti = h + 1\n\t\t} else if cm.offset == 0 {\n\t\t\treturn Index(c + cm.delta)\n\t\t} else {\n\t\t\toffset := int(cm.offset) + 2*(h-len(f.cm)+int(c-cm.start))\n\t\t\treturn Index(u16(f.cmapIndexes, offset))\n\t\t}\n\t}\n\treturn 0\n}\n\n// Name returns the Font's name value for the given NameID. It returns \"\" if\n// there was an error, or if that name was not found.\nfunc (f *Font) Name(id NameID) string {\n\tx, platformID, err := parseSubtables(f.name, \"name\", 6, 12, func(b []byte) bool {\n\t\treturn NameID(u16(b, 6)) == id\n\t})\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\toffset, length := u16(f.name, 4)+u16(f.name, x+10), u16(f.name, x+8)\n\t// Return the ASCII value of the encoded string.\n\t// The string is encoded as UTF-16 on non-Apple platformIDs; Apple is platformID 1.\n\tsrc := f.name[offset : offset+length]\n\tvar dst []byte\n\tif platformID != 1 { // UTF-16.\n\t\tif len(src)&1 != 0 {\n\t\t\treturn \"\"\n\t\t}\n\t\tdst = make([]byte, len(src)/2)\n\t\tfor i := range dst {\n\t\t\tdst[i] = printable(u16(src, 2*i))\n\t\t}\n\t} else { // ASCII.\n\t\tdst = make([]byte, len(src))\n\t\tfor i, c := range src {\n\t\t\tdst[i] = printable(uint16(c))\n\t\t}\n\t}\n\treturn string(dst)\n}\n\nfunc printable(r uint16) byte {\n\tif 0x20 <= r && r < 0x7f {\n\t\treturn byte(r)\n\t}\n\treturn '?'\n}\n\n// unscaledHMetric returns the unscaled horizontal metrics for the glyph with\n// the given index.\nfunc (f *Font) unscaledHMetric(i Index) (h HMetric) {\n\tj := int(i)\n\tif j < 0 || f.nGlyph <= j {\n\t\treturn HMetric{}\n\t}\n\tif j >= f.nHMetric {\n\t\tp := 4 * (f.nHMetric - 1)\n\t\treturn HMetric{\n\t\t\tAdvanceWidth: fixed.Int26_6(u16(f.hmtx, p)),\n\t\t\tLeftSideBearing: fixed.Int26_6(int16(u16(f.hmtx, p+2*(j-f.nHMetric)+4))),\n\t\t}\n\t}\n\treturn HMetric{\n\t\tAdvanceWidth: fixed.Int26_6(u16(f.hmtx, 4*j)),\n\t\tLeftSideBearing: fixed.Int26_6(int16(u16(f.hmtx, 4*j+2))),\n\t}\n}\n\n// HMetric returns the horizontal metrics for the glyph with the given index.\nfunc (f *Font) HMetric(scale fixed.Int26_6, i Index) HMetric {\n\th := f.unscaledHMetric(i)\n\th.AdvanceWidth = f.scale(scale * h.AdvanceWidth)\n\th.LeftSideBearing = f.scale(scale * h.LeftSideBearing)\n\treturn h\n}\n\n// unscaledVMetric returns the unscaled vertical metrics for the glyph with\n// the given index. yMax is the top of the glyph's bounding box.\nfunc (f *Font) unscaledVMetric(i Index, yMax fixed.Int26_6) (v VMetric) {\n\tj := int(i)\n\tif j < 0 || f.nGlyph <= j {\n\t\treturn VMetric{}\n\t}\n\tif 4*j+4 <= len(f.vmtx) {\n\t\treturn VMetric{\n\t\t\tAdvanceHeight: fixed.Int26_6(u16(f.vmtx, 4*j)),\n\t\t\tTopSideBearing: fixed.Int26_6(int16(u16(f.vmtx, 4*j+2))),\n\t\t}\n\t}\n\t// The OS/2 table has grown over time.\n\t// https://developer.apple.com/fonts/TTRefMan/RM06/Chap6OS2.html\n\t// says that it was originally 68 bytes. Optional fields, including\n\t// the ascender and descender, are described at\n\t// http://www.microsoft.com/typography/otspec/os2.htm\n\tif len(f.os2) >= 72 {\n\t\tsTypoAscender := fixed.Int26_6(int16(u16(f.os2, 68)))\n\t\tsTypoDescender := fixed.Int26_6(int16(u16(f.os2, 70)))\n\t\treturn VMetric{\n\t\t\tAdvanceHeight: sTypoAscender - sTypoDescender,\n\t\t\tTopSideBearing: sTypoAscender - yMax,\n\t\t}\n\t}\n\treturn VMetric{\n\t\tAdvanceHeight: fixed.Int26_6(f.fUnitsPerEm),\n\t\tTopSideBearing: 0,\n\t}\n}\n\n// VMetric returns the vertical metrics for the glyph with the given index.\nfunc (f *Font) VMetric(scale fixed.Int26_6, i Index) VMetric {\n\t// TODO: should 0 be bounds.YMax?\n\tv := f.unscaledVMetric(i, 0)\n\tv.AdvanceHeight = f.scale(scale * v.AdvanceHeight)\n\tv.TopSideBearing = f.scale(scale * v.TopSideBearing)\n\treturn v\n}\n\n// Kern returns the horizontal adjustment for the given glyph pair. A positive\n// kern means to move the glyphs further apart.\nfunc (f *Font) Kern(scale fixed.Int26_6, i0, i1 Index) fixed.Int26_6 {\n\tif f.nKern == 0 {\n\t\treturn 0\n\t}\n\tg := uint32(i0)<<16 | uint32(i1)\n\tlo, hi := 0, f.nKern\n\tfor lo < hi {\n\t\ti := (lo + hi) / 2\n\t\tig := u32(f.kern, 18+6*i)\n\t\tif ig < g {\n\t\t\tlo = i + 1\n\t\t} else if ig > g {\n\t\t\thi = i\n\t\t} else {\n\t\t\treturn f.scale(scale * fixed.Int26_6(int16(u16(f.kern, 22+6*i))))\n\t\t}\n\t}\n\treturn 0\n}\n\n// Parse returns a new Font for the given TTF or TTC data.\n//\n// For TrueType Collections, the first font in the collection is parsed.\nfunc Parse(ttf []byte) (font *Font, err error) {\n\treturn parse(ttf, 0)\n}\n\nfunc parse(ttf []byte, offset int) (font *Font, err error) {\n\tif len(ttf)-offset < 12 {\n\t\terr = FormatError(\"TTF data is too short\")\n\t\treturn\n\t}\n\toriginalOffset := offset\n\tmagic, offset := u32(ttf, offset), offset+4\n\tswitch magic {\n\tcase 0x00010000:\n\t\t// No-op.\n\tcase 0x74746366: // \"ttcf\" as a big-endian uint32.\n\t\tif originalOffset != 0 {\n\t\t\terr = FormatError(\"recursive TTC\")\n\t\t\treturn\n\t\t}\n\t\tttcVersion, offset := u32(ttf, offset), offset+4\n\t\tif ttcVersion != 0x00010000 && ttcVersion != 0x00020000 {\n\t\t\terr = FormatError(\"bad TTC version\")\n\t\t\treturn\n\t\t}\n\t\tnumFonts, offset := int(u32(ttf, offset)), offset+4\n\t\tif numFonts <= 0 {\n\t\t\terr = FormatError(\"bad number of TTC fonts\")\n\t\t\treturn\n\t\t}\n\t\tif len(ttf[offset:])/4 < numFonts {\n\t\t\terr = FormatError(\"TTC offset table is too short\")\n\t\t\treturn\n\t\t}\n\t\t// TODO: provide an API to select which font in a TrueType collection to return,\n\t\t// not just the first one. This may require an API to parse a TTC's name tables,\n\t\t// so users of this package can select the font in a TTC by name.\n\t\toffset = int(u32(ttf, offset))\n\t\tif offset <= 0 || offset > len(ttf) {\n\t\t\terr = FormatError(\"bad TTC offset\")\n\t\t\treturn\n\t\t}\n\t\treturn parse(ttf, offset)\n\tdefault:\n\t\terr = FormatError(\"bad TTF version\")\n\t\treturn\n\t}\n\tn, offset := int(u16(ttf, offset)), offset+2\n\toffset += 6 // Skip the searchRange, entrySelector and rangeShift.\n\tif len(ttf) < 16*n+offset {\n\t\terr = FormatError(\"TTF data is too short\")\n\t\treturn\n\t}\n\tf := new(Font)\n\t// Assign the table slices.\n\tfor i := 0; i < n; i++ {\n\t\tx := 16*i + offset\n\t\tswitch string(ttf[x : x+4]) {\n\t\tcase \"cmap\":\n\t\t\tf.cmap, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"cvt \":\n\t\t\tf.cvt, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"fpgm\":\n\t\t\tf.fpgm, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"glyf\":\n\t\t\tf.glyf, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"hdmx\":\n\t\t\tf.hdmx, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"head\":\n\t\t\tf.head, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"hhea\":\n\t\t\tf.hhea, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"hmtx\":\n\t\t\tf.hmtx, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"kern\":\n\t\t\tf.kern, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"loca\":\n\t\t\tf.loca, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"maxp\":\n\t\t\tf.maxp, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"name\":\n\t\t\tf.name, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"OS/2\":\n\t\t\tf.os2, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"prep\":\n\t\t\tf.prep, err = readTable(ttf, ttf[x+8:x+16])\n\t\tcase \"vmtx\":\n\t\t\tf.vmtx, err = readTable(ttf, ttf[x+8:x+16])\n\t\t}\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t}\n\t// Parse and sanity-check the TTF data.\n\tif err = f.parseHead(); err != nil {\n\t\treturn\n\t}\n\tif err = f.parseMaxp(); err != nil {\n\t\treturn\n\t}\n\tif err = f.parseCmap(); err != nil {\n\t\treturn\n\t}\n\tif err = f.parseKern(); err != nil {\n\t\treturn\n\t}\n\tif err = f.parseHhea(); err != nil {\n\t\treturn\n\t}\n\tfont = f\n\treturn\n}\n" }, { "path": "vendor/github.com/golang/protobuf/AUTHORS", "content": "# This source code refers to The Go Authors for copyright purposes.\n# The master list of authors is in the main Go distribution,\n# visible at http://tip.golang.org/AUTHORS.\n" }, { "path": "vendor/github.com/golang/protobuf/CONTRIBUTORS", "content": "# This source code was written by the Go contributors.\n# The master list of contributors is in the main Go distribution,\n# visible at http://tip.golang.org/CONTRIBUTORS.\n" }, { "path": "vendor/github.com/golang/protobuf/LICENSE", "content": "Copyright 2010 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n" }, { "path": "vendor/github.com/golang/protobuf/proto/clone.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2011 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Protocol buffer deep copy and merge.\n// TODO: RawMessage.\n\npackage proto\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"reflect\"\n\t\"strings\"\n)\n\n// Clone returns a deep copy of a protocol buffer.\nfunc Clone(src Message) Message {\n\tin := reflect.ValueOf(src)\n\tif in.IsNil() {\n\t\treturn src\n\t}\n\tout := reflect.New(in.Type().Elem())\n\tdst := out.Interface().(Message)\n\tMerge(dst, src)\n\treturn dst\n}\n\n// Merger is the interface representing objects that can merge messages of the same type.\ntype Merger interface {\n\t// Merge merges src into this message.\n\t// Required and optional fields that are set in src will be set to that value in dst.\n\t// Elements of repeated fields will be appended.\n\t//\n\t// Merge may panic if called with a different argument type than the receiver.\n\tMerge(src Message)\n}\n\n// generatedMerger is the custom merge method that generated protos will have.\n// We must add this method since a generate Merge method will conflict with\n// many existing protos that have a Merge data field already defined.\ntype generatedMerger interface {\n\tXXX_Merge(src Message)\n}\n\n// Merge merges src into dst.\n// Required and optional fields that are set in src will be set to that value in dst.\n// Elements of repeated fields will be appended.\n// Merge panics if src and dst are not the same type, or if dst is nil.\nfunc Merge(dst, src Message) {\n\tif m, ok := dst.(Merger); ok {\n\t\tm.Merge(src)\n\t\treturn\n\t}\n\n\tin := reflect.ValueOf(src)\n\tout := reflect.ValueOf(dst)\n\tif out.IsNil() {\n\t\tpanic(\"proto: nil destination\")\n\t}\n\tif in.Type() != out.Type() {\n\t\tpanic(fmt.Sprintf(\"proto.Merge(%T, %T) type mismatch\", dst, src))\n\t}\n\tif in.IsNil() {\n\t\treturn // Merge from nil src is a noop\n\t}\n\tif m, ok := dst.(generatedMerger); ok {\n\t\tm.XXX_Merge(src)\n\t\treturn\n\t}\n\tmergeStruct(out.Elem(), in.Elem())\n}\n\nfunc mergeStruct(out, in reflect.Value) {\n\tsprop := GetProperties(in.Type())\n\tfor i := 0; i < in.NumField(); i++ {\n\t\tf := in.Type().Field(i)\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\t\tmergeAny(out.Field(i), in.Field(i), false, sprop.Prop[i])\n\t}\n\n\tif emIn, err := extendable(in.Addr().Interface()); err == nil {\n\t\temOut, _ := extendable(out.Addr().Interface())\n\t\tmIn, muIn := emIn.extensionsRead()\n\t\tif mIn != nil {\n\t\t\tmOut := emOut.extensionsWrite()\n\t\t\tmuIn.Lock()\n\t\t\tmergeExtension(mOut, mIn)\n\t\t\tmuIn.Unlock()\n\t\t}\n\t}\n\n\tuf := in.FieldByName(\"XXX_unrecognized\")\n\tif !uf.IsValid() {\n\t\treturn\n\t}\n\tuin := uf.Bytes()\n\tif len(uin) > 0 {\n\t\tout.FieldByName(\"XXX_unrecognized\").SetBytes(append([]byte(nil), uin...))\n\t}\n}\n\n// mergeAny performs a merge between two values of the same type.\n// viaPtr indicates whether the values were indirected through a pointer (implying proto2).\n// prop is set if this is a struct field (it may be nil).\nfunc mergeAny(out, in reflect.Value, viaPtr bool, prop *Properties) {\n\tif in.Type() == protoMessageType {\n\t\tif !in.IsNil() {\n\t\t\tif out.IsNil() {\n\t\t\t\tout.Set(reflect.ValueOf(Clone(in.Interface().(Message))))\n\t\t\t} else {\n\t\t\t\tMerge(out.Interface().(Message), in.Interface().(Message))\n\t\t\t}\n\t\t}\n\t\treturn\n\t}\n\tswitch in.Kind() {\n\tcase reflect.Bool, reflect.Float32, reflect.Float64, reflect.Int32, reflect.Int64,\n\t\treflect.String, reflect.Uint32, reflect.Uint64:\n\t\tif !viaPtr && isProto3Zero(in) {\n\t\t\treturn\n\t\t}\n\t\tout.Set(in)\n\tcase reflect.Interface:\n\t\t// Probably a oneof field; copy non-nil values.\n\t\tif in.IsNil() {\n\t\t\treturn\n\t\t}\n\t\t// Allocate destination if it is not set, or set to a different type.\n\t\t// Otherwise we will merge as normal.\n\t\tif out.IsNil() || out.Elem().Type() != in.Elem().Type() {\n\t\t\tout.Set(reflect.New(in.Elem().Elem().Type())) // interface -> *T -> T -> new(T)\n\t\t}\n\t\tmergeAny(out.Elem(), in.Elem(), false, nil)\n\tcase reflect.Map:\n\t\tif in.Len() == 0 {\n\t\t\treturn\n\t\t}\n\t\tif out.IsNil() {\n\t\t\tout.Set(reflect.MakeMap(in.Type()))\n\t\t}\n\t\t// For maps with value types of *T or []byte we need to deep copy each value.\n\t\telemKind := in.Type().Elem().Kind()\n\t\tfor _, key := range in.MapKeys() {\n\t\t\tvar val reflect.Value\n\t\t\tswitch elemKind {\n\t\t\tcase reflect.Ptr:\n\t\t\t\tval = reflect.New(in.Type().Elem().Elem())\n\t\t\t\tmergeAny(val, in.MapIndex(key), false, nil)\n\t\t\tcase reflect.Slice:\n\t\t\t\tval = in.MapIndex(key)\n\t\t\t\tval = reflect.ValueOf(append([]byte{}, val.Bytes()...))\n\t\t\tdefault:\n\t\t\t\tval = in.MapIndex(key)\n\t\t\t}\n\t\t\tout.SetMapIndex(key, val)\n\t\t}\n\tcase reflect.Ptr:\n\t\tif in.IsNil() {\n\t\t\treturn\n\t\t}\n\t\tif out.IsNil() {\n\t\t\tout.Set(reflect.New(in.Elem().Type()))\n\t\t}\n\t\tmergeAny(out.Elem(), in.Elem(), true, nil)\n\tcase reflect.Slice:\n\t\tif in.IsNil() {\n\t\t\treturn\n\t\t}\n\t\tif in.Type().Elem().Kind() == reflect.Uint8 {\n\t\t\t// []byte is a scalar bytes field, not a repeated field.\n\n\t\t\t// Edge case: if this is in a proto3 message, a zero length\n\t\t\t// bytes field is considered the zero value, and should not\n\t\t\t// be merged.\n\t\t\tif prop != nil && prop.proto3 && in.Len() == 0 {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Make a deep copy.\n\t\t\t// Append to []byte{} instead of []byte(nil) so that we never end up\n\t\t\t// with a nil result.\n\t\t\tout.SetBytes(append([]byte{}, in.Bytes()...))\n\t\t\treturn\n\t\t}\n\t\tn := in.Len()\n\t\tif out.IsNil() {\n\t\t\tout.Set(reflect.MakeSlice(in.Type(), 0, n))\n\t\t}\n\t\tswitch in.Type().Elem().Kind() {\n\t\tcase reflect.Bool, reflect.Float32, reflect.Float64, reflect.Int32, reflect.Int64,\n\t\t\treflect.String, reflect.Uint32, reflect.Uint64:\n\t\t\tout.Set(reflect.AppendSlice(out, in))\n\t\tdefault:\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tx := reflect.Indirect(reflect.New(in.Type().Elem()))\n\t\t\t\tmergeAny(x, in.Index(i), false, nil)\n\t\t\t\tout.Set(reflect.Append(out, x))\n\t\t\t}\n\t\t}\n\tcase reflect.Struct:\n\t\tmergeStruct(out, in)\n\tdefault:\n\t\t// unknown type, so not a protocol buffer\n\t\tlog.Printf(\"proto: don't know how to copy %v\", in)\n\t}\n}\n\nfunc mergeExtension(out, in map[int32]Extension) {\n\tfor extNum, eIn := range in {\n\t\teOut := Extension{desc: eIn.desc}\n\t\tif eIn.value != nil {\n\t\t\tv := reflect.New(reflect.TypeOf(eIn.value)).Elem()\n\t\t\tmergeAny(v, reflect.ValueOf(eIn.value), false, nil)\n\t\t\teOut.value = v.Interface()\n\t\t}\n\t\tif eIn.enc != nil {\n\t\t\teOut.enc = make([]byte, len(eIn.enc))\n\t\t\tcopy(eOut.enc, eIn.enc)\n\t\t}\n\n\t\tout[extNum] = eOut\n\t}\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/decode.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n/*\n * Routines for decoding protocol buffer data to construct in-memory representations.\n */\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n)\n\n// errOverflow is returned when an integer is too large to be represented.\nvar errOverflow = errors.New(\"proto: integer overflow\")\n\n// ErrInternalBadWireType is returned by generated code when an incorrect\n// wire type is encountered. It does not get returned to user code.\nvar ErrInternalBadWireType = errors.New(\"proto: internal error: bad wiretype for oneof\")\n\n// DecodeVarint reads a varint-encoded integer from the slice.\n// It returns the integer and the number of bytes consumed, or\n// zero if there is not enough.\n// This is the format for the\n// int32, int64, uint32, uint64, bool, and enum\n// protocol buffer types.\nfunc DecodeVarint(buf []byte) (x uint64, n int) {\n\tfor shift := uint(0); shift < 64; shift += 7 {\n\t\tif n >= len(buf) {\n\t\t\treturn 0, 0\n\t\t}\n\t\tb := uint64(buf[n])\n\t\tn++\n\t\tx |= (b & 0x7F) << shift\n\t\tif (b & 0x80) == 0 {\n\t\t\treturn x, n\n\t\t}\n\t}\n\n\t// The number is too large to represent in a 64-bit value.\n\treturn 0, 0\n}\n\nfunc (p *Buffer) decodeVarintSlow() (x uint64, err error) {\n\ti := p.index\n\tl := len(p.buf)\n\n\tfor shift := uint(0); shift < 64; shift += 7 {\n\t\tif i >= l {\n\t\t\terr = io.ErrUnexpectedEOF\n\t\t\treturn\n\t\t}\n\t\tb := p.buf[i]\n\t\ti++\n\t\tx |= (uint64(b) & 0x7F) << shift\n\t\tif b < 0x80 {\n\t\t\tp.index = i\n\t\t\treturn\n\t\t}\n\t}\n\n\t// The number is too large to represent in a 64-bit value.\n\terr = errOverflow\n\treturn\n}\n\n// DecodeVarint reads a varint-encoded integer from the Buffer.\n// This is the format for the\n// int32, int64, uint32, uint64, bool, and enum\n// protocol buffer types.\nfunc (p *Buffer) DecodeVarint() (x uint64, err error) {\n\ti := p.index\n\tbuf := p.buf\n\n\tif i >= len(buf) {\n\t\treturn 0, io.ErrUnexpectedEOF\n\t} else if buf[i] < 0x80 {\n\t\tp.index++\n\t\treturn uint64(buf[i]), nil\n\t} else if len(buf)-i < 10 {\n\t\treturn p.decodeVarintSlow()\n\t}\n\n\tvar b uint64\n\t// we already checked the first byte\n\tx = uint64(buf[i]) - 0x80\n\ti++\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 7\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 7\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 14\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 14\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 21\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 21\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 28\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 28\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 35\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 35\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 42\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 42\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 49\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 49\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 56\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\tx -= 0x80 << 56\n\n\tb = uint64(buf[i])\n\ti++\n\tx += b << 63\n\tif b&0x80 == 0 {\n\t\tgoto done\n\t}\n\n\treturn 0, errOverflow\n\ndone:\n\tp.index = i\n\treturn x, nil\n}\n\n// DecodeFixed64 reads a 64-bit integer from the Buffer.\n// This is the format for the\n// fixed64, sfixed64, and double protocol buffer types.\nfunc (p *Buffer) DecodeFixed64() (x uint64, err error) {\n\t// x, err already 0\n\ti := p.index + 8\n\tif i < 0 || i > len(p.buf) {\n\t\terr = io.ErrUnexpectedEOF\n\t\treturn\n\t}\n\tp.index = i\n\n\tx = uint64(p.buf[i-8])\n\tx |= uint64(p.buf[i-7]) << 8\n\tx |= uint64(p.buf[i-6]) << 16\n\tx |= uint64(p.buf[i-5]) << 24\n\tx |= uint64(p.buf[i-4]) << 32\n\tx |= uint64(p.buf[i-3]) << 40\n\tx |= uint64(p.buf[i-2]) << 48\n\tx |= uint64(p.buf[i-1]) << 56\n\treturn\n}\n\n// DecodeFixed32 reads a 32-bit integer from the Buffer.\n// This is the format for the\n// fixed32, sfixed32, and float protocol buffer types.\nfunc (p *Buffer) DecodeFixed32() (x uint64, err error) {\n\t// x, err already 0\n\ti := p.index + 4\n\tif i < 0 || i > len(p.buf) {\n\t\terr = io.ErrUnexpectedEOF\n\t\treturn\n\t}\n\tp.index = i\n\n\tx = uint64(p.buf[i-4])\n\tx |= uint64(p.buf[i-3]) << 8\n\tx |= uint64(p.buf[i-2]) << 16\n\tx |= uint64(p.buf[i-1]) << 24\n\treturn\n}\n\n// DecodeZigzag64 reads a zigzag-encoded 64-bit integer\n// from the Buffer.\n// This is the format used for the sint64 protocol buffer type.\nfunc (p *Buffer) DecodeZigzag64() (x uint64, err error) {\n\tx, err = p.DecodeVarint()\n\tif err != nil {\n\t\treturn\n\t}\n\tx = (x >> 1) ^ uint64((int64(x&1)<<63)>>63)\n\treturn\n}\n\n// DecodeZigzag32 reads a zigzag-encoded 32-bit integer\n// from the Buffer.\n// This is the format used for the sint32 protocol buffer type.\nfunc (p *Buffer) DecodeZigzag32() (x uint64, err error) {\n\tx, err = p.DecodeVarint()\n\tif err != nil {\n\t\treturn\n\t}\n\tx = uint64((uint32(x) >> 1) ^ uint32((int32(x&1)<<31)>>31))\n\treturn\n}\n\n// DecodeRawBytes reads a count-delimited byte buffer from the Buffer.\n// This is the format used for the bytes protocol buffer\n// type and for embedded messages.\nfunc (p *Buffer) DecodeRawBytes(alloc bool) (buf []byte, err error) {\n\tn, err := p.DecodeVarint()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tnb := int(n)\n\tif nb < 0 {\n\t\treturn nil, fmt.Errorf(\"proto: bad byte length %d\", nb)\n\t}\n\tend := p.index + nb\n\tif end < p.index || end > len(p.buf) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\n\tif !alloc {\n\t\t// todo: check if can get more uses of alloc=false\n\t\tbuf = p.buf[p.index:end]\n\t\tp.index += nb\n\t\treturn\n\t}\n\n\tbuf = make([]byte, nb)\n\tcopy(buf, p.buf[p.index:])\n\tp.index += nb\n\treturn\n}\n\n// DecodeStringBytes reads an encoded string from the Buffer.\n// This is the format used for the proto2 string type.\nfunc (p *Buffer) DecodeStringBytes() (s string, err error) {\n\tbuf, err := p.DecodeRawBytes(false)\n\tif err != nil {\n\t\treturn\n\t}\n\treturn string(buf), nil\n}\n\n// Unmarshaler is the interface representing objects that can\n// unmarshal themselves. The argument points to data that may be\n// overwritten, so implementations should not keep references to the\n// buffer.\n// Unmarshal implementations should not clear the receiver.\n// Any unmarshaled data should be merged into the receiver.\n// Callers of Unmarshal that do not want to retain existing data\n// should Reset the receiver before calling Unmarshal.\ntype Unmarshaler interface {\n\tUnmarshal([]byte) error\n}\n\n// newUnmarshaler is the interface representing objects that can\n// unmarshal themselves. The semantics are identical to Unmarshaler.\n//\n// This exists to support protoc-gen-go generated messages.\n// The proto package will stop type-asserting to this interface in the future.\n//\n// DO NOT DEPEND ON THIS.\ntype newUnmarshaler interface {\n\tXXX_Unmarshal([]byte) error\n}\n\n// Unmarshal parses the protocol buffer representation in buf and places the\n// decoded result in pb. If the struct underlying pb does not match\n// the data in buf, the results can be unpredictable.\n//\n// Unmarshal resets pb before starting to unmarshal, so any\n// existing data in pb is always removed. Use UnmarshalMerge\n// to preserve and append to existing data.\nfunc Unmarshal(buf []byte, pb Message) error {\n\tpb.Reset()\n\tif u, ok := pb.(newUnmarshaler); ok {\n\t\treturn u.XXX_Unmarshal(buf)\n\t}\n\tif u, ok := pb.(Unmarshaler); ok {\n\t\treturn u.Unmarshal(buf)\n\t}\n\treturn NewBuffer(buf).Unmarshal(pb)\n}\n\n// UnmarshalMerge parses the protocol buffer representation in buf and\n// writes the decoded result to pb. If the struct underlying pb does not match\n// the data in buf, the results can be unpredictable.\n//\n// UnmarshalMerge merges into existing data in pb.\n// Most code should use Unmarshal instead.\nfunc UnmarshalMerge(buf []byte, pb Message) error {\n\tif u, ok := pb.(newUnmarshaler); ok {\n\t\treturn u.XXX_Unmarshal(buf)\n\t}\n\tif u, ok := pb.(Unmarshaler); ok {\n\t\t// NOTE: The history of proto have unfortunately been inconsistent\n\t\t// whether Unmarshaler should or should not implicitly clear itself.\n\t\t// Some implementations do, most do not.\n\t\t// Thus, calling this here may or may not do what people want.\n\t\t//\n\t\t// See https://github.com/golang/protobuf/issues/424\n\t\treturn u.Unmarshal(buf)\n\t}\n\treturn NewBuffer(buf).Unmarshal(pb)\n}\n\n// DecodeMessage reads a count-delimited message from the Buffer.\nfunc (p *Buffer) DecodeMessage(pb Message) error {\n\tenc, err := p.DecodeRawBytes(false)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn NewBuffer(enc).Unmarshal(pb)\n}\n\n// DecodeGroup reads a tag-delimited group from the Buffer.\n// StartGroup tag is already consumed. This function consumes\n// EndGroup tag.\nfunc (p *Buffer) DecodeGroup(pb Message) error {\n\tb := p.buf[p.index:]\n\tx, y := findEndGroup(b)\n\tif x < 0 {\n\t\treturn io.ErrUnexpectedEOF\n\t}\n\terr := Unmarshal(b[:x], pb)\n\tp.index += y\n\treturn err\n}\n\n// Unmarshal parses the protocol buffer representation in the\n// Buffer and places the decoded result in pb. If the struct\n// underlying pb does not match the data in the buffer, the results can be\n// unpredictable.\n//\n// Unlike proto.Unmarshal, this does not reset pb before starting to unmarshal.\nfunc (p *Buffer) Unmarshal(pb Message) error {\n\t// If the object can unmarshal itself, let it.\n\tif u, ok := pb.(newUnmarshaler); ok {\n\t\terr := u.XXX_Unmarshal(p.buf[p.index:])\n\t\tp.index = len(p.buf)\n\t\treturn err\n\t}\n\tif u, ok := pb.(Unmarshaler); ok {\n\t\t// NOTE: The history of proto have unfortunately been inconsistent\n\t\t// whether Unmarshaler should or should not implicitly clear itself.\n\t\t// Some implementations do, most do not.\n\t\t// Thus, calling this here may or may not do what people want.\n\t\t//\n\t\t// See https://github.com/golang/protobuf/issues/424\n\t\terr := u.Unmarshal(p.buf[p.index:])\n\t\tp.index = len(p.buf)\n\t\treturn err\n\t}\n\n\t// Slow workaround for messages that aren't Unmarshalers.\n\t// This includes some hand-coded .pb.go files and\n\t// bootstrap protos.\n\t// TODO: fix all of those and then add Unmarshal to\n\t// the Message interface. Then:\n\t// The cast above and code below can be deleted.\n\t// The old unmarshaler can be deleted.\n\t// Clients can call Unmarshal directly (can already do that, actually).\n\tvar info InternalMessageInfo\n\terr := info.Unmarshal(pb, p.buf[p.index:])\n\tp.index = len(p.buf)\n\treturn err\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/deprecated.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2018 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport \"errors\"\n\n// Deprecated: do not use.\ntype Stats struct{ Emalloc, Dmalloc, Encode, Decode, Chit, Cmiss, Size uint64 }\n\n// Deprecated: do not use.\nfunc GetStats() Stats { return Stats{} }\n\n// Deprecated: do not use.\nfunc MarshalMessageSet(interface{}) ([]byte, error) {\n\treturn nil, errors.New(\"proto: not implemented\")\n}\n\n// Deprecated: do not use.\nfunc UnmarshalMessageSet([]byte, interface{}) error {\n\treturn errors.New(\"proto: not implemented\")\n}\n\n// Deprecated: do not use.\nfunc MarshalMessageSetJSON(interface{}) ([]byte, error) {\n\treturn nil, errors.New(\"proto: not implemented\")\n}\n\n// Deprecated: do not use.\nfunc UnmarshalMessageSetJSON([]byte, interface{}) error {\n\treturn errors.New(\"proto: not implemented\")\n}\n\n// Deprecated: do not use.\nfunc RegisterMessageSetType(Message, int32, string) {}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/discard.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2017 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n)\n\ntype generatedDiscarder interface {\n\tXXX_DiscardUnknown()\n}\n\n// DiscardUnknown recursively discards all unknown fields from this message\n// and all embedded messages.\n//\n// When unmarshaling a message with unrecognized fields, the tags and values\n// of such fields are preserved in the Message. This allows a later call to\n// marshal to be able to produce a message that continues to have those\n// unrecognized fields. To avoid this, DiscardUnknown is used to\n// explicitly clear the unknown fields after unmarshaling.\n//\n// For proto2 messages, the unknown fields of message extensions are only\n// discarded from messages that have been accessed via GetExtension.\nfunc DiscardUnknown(m Message) {\n\tif m, ok := m.(generatedDiscarder); ok {\n\t\tm.XXX_DiscardUnknown()\n\t\treturn\n\t}\n\t// TODO: Dynamically populate a InternalMessageInfo for legacy messages,\n\t// but the master branch has no implementation for InternalMessageInfo,\n\t// so it would be more work to replicate that approach.\n\tdiscardLegacy(m)\n}\n\n// DiscardUnknown recursively discards all unknown fields.\nfunc (a *InternalMessageInfo) DiscardUnknown(m Message) {\n\tdi := atomicLoadDiscardInfo(&a.discard)\n\tif di == nil {\n\t\tdi = getDiscardInfo(reflect.TypeOf(m).Elem())\n\t\tatomicStoreDiscardInfo(&a.discard, di)\n\t}\n\tdi.discard(toPointer(&m))\n}\n\ntype discardInfo struct {\n\ttyp reflect.Type\n\n\tinitialized int32 // 0: only typ is valid, 1: everything is valid\n\tlock sync.Mutex\n\n\tfields []discardFieldInfo\n\tunrecognized field\n}\n\ntype discardFieldInfo struct {\n\tfield field // Offset of field, guaranteed to be valid\n\tdiscard func(src pointer)\n}\n\nvar (\n\tdiscardInfoMap = map[reflect.Type]*discardInfo{}\n\tdiscardInfoLock sync.Mutex\n)\n\nfunc getDiscardInfo(t reflect.Type) *discardInfo {\n\tdiscardInfoLock.Lock()\n\tdefer discardInfoLock.Unlock()\n\tdi := discardInfoMap[t]\n\tif di == nil {\n\t\tdi = &discardInfo{typ: t}\n\t\tdiscardInfoMap[t] = di\n\t}\n\treturn di\n}\n\nfunc (di *discardInfo) discard(src pointer) {\n\tif src.isNil() {\n\t\treturn // Nothing to do.\n\t}\n\n\tif atomic.LoadInt32(&di.initialized) == 0 {\n\t\tdi.computeDiscardInfo()\n\t}\n\n\tfor _, fi := range di.fields {\n\t\tsfp := src.offset(fi.field)\n\t\tfi.discard(sfp)\n\t}\n\n\t// For proto2 messages, only discard unknown fields in message extensions\n\t// that have been accessed via GetExtension.\n\tif em, err := extendable(src.asPointerTo(di.typ).Interface()); err == nil {\n\t\t// Ignore lock since DiscardUnknown is not concurrency safe.\n\t\temm, _ := em.extensionsRead()\n\t\tfor _, mx := range emm {\n\t\t\tif m, ok := mx.value.(Message); ok {\n\t\t\t\tDiscardUnknown(m)\n\t\t\t}\n\t\t}\n\t}\n\n\tif di.unrecognized.IsValid() {\n\t\t*src.offset(di.unrecognized).toBytes() = nil\n\t}\n}\n\nfunc (di *discardInfo) computeDiscardInfo() {\n\tdi.lock.Lock()\n\tdefer di.lock.Unlock()\n\tif di.initialized != 0 {\n\t\treturn\n\t}\n\tt := di.typ\n\tn := t.NumField()\n\n\tfor i := 0; i < n; i++ {\n\t\tf := t.Field(i)\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\n\t\tdfi := discardFieldInfo{field: toField(&f)}\n\t\ttf := f.Type\n\n\t\t// Unwrap tf to get its most basic type.\n\t\tvar isPointer, isSlice bool\n\t\tif tf.Kind() == reflect.Slice && tf.Elem().Kind() != reflect.Uint8 {\n\t\t\tisSlice = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif tf.Kind() == reflect.Ptr {\n\t\t\tisPointer = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif isPointer && isSlice && tf.Kind() != reflect.Struct {\n\t\t\tpanic(fmt.Sprintf(\"%v.%s cannot be a slice of pointers to primitive types\", t, f.Name))\n\t\t}\n\n\t\tswitch tf.Kind() {\n\t\tcase reflect.Struct:\n\t\t\tswitch {\n\t\t\tcase !isPointer:\n\t\t\t\tpanic(fmt.Sprintf(\"%v.%s cannot be a direct struct value\", t, f.Name))\n\t\t\tcase isSlice: // E.g., []*pb.T\n\t\t\t\tdi := getDiscardInfo(tf)\n\t\t\t\tdfi.discard = func(src pointer) {\n\t\t\t\t\tsps := src.getPointerSlice()\n\t\t\t\t\tfor _, sp := range sps {\n\t\t\t\t\t\tif !sp.isNil() {\n\t\t\t\t\t\t\tdi.discard(sp)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., *pb.T\n\t\t\t\tdi := getDiscardInfo(tf)\n\t\t\t\tdfi.discard = func(src pointer) {\n\t\t\t\t\tsp := src.getPointer()\n\t\t\t\t\tif !sp.isNil() {\n\t\t\t\t\t\tdi.discard(sp)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Map:\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(fmt.Sprintf(\"%v.%s cannot be a pointer to a map or a slice of map values\", t, f.Name))\n\t\t\tdefault: // E.g., map[K]V\n\t\t\t\tif tf.Elem().Kind() == reflect.Ptr { // Proto struct (e.g., *T)\n\t\t\t\t\tdfi.discard = func(src pointer) {\n\t\t\t\t\t\tsm := src.asPointerTo(tf).Elem()\n\t\t\t\t\t\tif sm.Len() == 0 {\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor _, key := range sm.MapKeys() {\n\t\t\t\t\t\t\tval := sm.MapIndex(key)\n\t\t\t\t\t\t\tDiscardUnknown(val.Interface().(Message))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tdfi.discard = func(pointer) {} // Noop\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Interface:\n\t\t\t// Must be oneof field.\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(fmt.Sprintf(\"%v.%s cannot be a pointer to a interface or a slice of interface values\", t, f.Name))\n\t\t\tdefault: // E.g., interface{}\n\t\t\t\t// TODO: Make this faster?\n\t\t\t\tdfi.discard = func(src pointer) {\n\t\t\t\t\tsu := src.asPointerTo(tf).Elem()\n\t\t\t\t\tif !su.IsNil() {\n\t\t\t\t\t\tsv := su.Elem().Elem().Field(0)\n\t\t\t\t\t\tif sv.Kind() == reflect.Ptr && sv.IsNil() {\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t\tswitch sv.Type().Kind() {\n\t\t\t\t\t\tcase reflect.Ptr: // Proto struct (e.g., *T)\n\t\t\t\t\t\t\tDiscardUnknown(sv.Interface().(Message))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tcontinue\n\t\t}\n\t\tdi.fields = append(di.fields, dfi)\n\t}\n\n\tdi.unrecognized = invalidField\n\tif f, ok := t.FieldByName(\"XXX_unrecognized\"); ok {\n\t\tif f.Type != reflect.TypeOf([]byte{}) {\n\t\t\tpanic(\"expected XXX_unrecognized to be of type []byte\")\n\t\t}\n\t\tdi.unrecognized = toField(&f)\n\t}\n\n\tatomic.StoreInt32(&di.initialized, 1)\n}\n\nfunc discardLegacy(m Message) {\n\tv := reflect.ValueOf(m)\n\tif v.Kind() != reflect.Ptr || v.IsNil() {\n\t\treturn\n\t}\n\tv = v.Elem()\n\tif v.Kind() != reflect.Struct {\n\t\treturn\n\t}\n\tt := v.Type()\n\n\tfor i := 0; i < v.NumField(); i++ {\n\t\tf := t.Field(i)\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\t\tvf := v.Field(i)\n\t\ttf := f.Type\n\n\t\t// Unwrap tf to get its most basic type.\n\t\tvar isPointer, isSlice bool\n\t\tif tf.Kind() == reflect.Slice && tf.Elem().Kind() != reflect.Uint8 {\n\t\t\tisSlice = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif tf.Kind() == reflect.Ptr {\n\t\t\tisPointer = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif isPointer && isSlice && tf.Kind() != reflect.Struct {\n\t\t\tpanic(fmt.Sprintf(\"%T.%s cannot be a slice of pointers to primitive types\", m, f.Name))\n\t\t}\n\n\t\tswitch tf.Kind() {\n\t\tcase reflect.Struct:\n\t\t\tswitch {\n\t\t\tcase !isPointer:\n\t\t\t\tpanic(fmt.Sprintf(\"%T.%s cannot be a direct struct value\", m, f.Name))\n\t\t\tcase isSlice: // E.g., []*pb.T\n\t\t\t\tfor j := 0; j < vf.Len(); j++ {\n\t\t\t\t\tdiscardLegacy(vf.Index(j).Interface().(Message))\n\t\t\t\t}\n\t\t\tdefault: // E.g., *pb.T\n\t\t\t\tdiscardLegacy(vf.Interface().(Message))\n\t\t\t}\n\t\tcase reflect.Map:\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(fmt.Sprintf(\"%T.%s cannot be a pointer to a map or a slice of map values\", m, f.Name))\n\t\t\tdefault: // E.g., map[K]V\n\t\t\t\ttv := vf.Type().Elem()\n\t\t\t\tif tv.Kind() == reflect.Ptr && tv.Implements(protoMessageType) { // Proto struct (e.g., *T)\n\t\t\t\t\tfor _, key := range vf.MapKeys() {\n\t\t\t\t\t\tval := vf.MapIndex(key)\n\t\t\t\t\t\tdiscardLegacy(val.Interface().(Message))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Interface:\n\t\t\t// Must be oneof field.\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(fmt.Sprintf(\"%T.%s cannot be a pointer to a interface or a slice of interface values\", m, f.Name))\n\t\t\tdefault: // E.g., test_proto.isCommunique_Union interface\n\t\t\t\tif !vf.IsNil() && f.Tag.Get(\"protobuf_oneof\") != \"\" {\n\t\t\t\t\tvf = vf.Elem() // E.g., *test_proto.Communique_Msg\n\t\t\t\t\tif !vf.IsNil() {\n\t\t\t\t\t\tvf = vf.Elem() // E.g., test_proto.Communique_Msg\n\t\t\t\t\t\tvf = vf.Field(0) // E.g., Proto struct (e.g., *T) or primitive value\n\t\t\t\t\t\tif vf.Kind() == reflect.Ptr {\n\t\t\t\t\t\t\tdiscardLegacy(vf.Interface().(Message))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif vf := v.FieldByName(\"XXX_unrecognized\"); vf.IsValid() {\n\t\tif vf.Type() != reflect.TypeOf([]byte{}) {\n\t\t\tpanic(\"expected XXX_unrecognized to be of type []byte\")\n\t\t}\n\t\tvf.Set(reflect.ValueOf([]byte(nil)))\n\t}\n\n\t// For proto2 messages, only discard unknown fields in message extensions\n\t// that have been accessed via GetExtension.\n\tif em, err := extendable(m); err == nil {\n\t\t// Ignore lock since discardLegacy is not concurrency safe.\n\t\temm, _ := em.extensionsRead()\n\t\tfor _, mx := range emm {\n\t\t\tif m, ok := mx.value.(Message); ok {\n\t\t\t\tdiscardLegacy(m)\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/encode.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n/*\n * Routines for encoding data into the wire format for protocol buffers.\n */\n\nimport (\n\t\"errors\"\n\t\"reflect\"\n)\n\nvar (\n\t// errRepeatedHasNil is the error returned if Marshal is called with\n\t// a struct with a repeated field containing a nil element.\n\terrRepeatedHasNil = errors.New(\"proto: repeated field has nil element\")\n\n\t// errOneofHasNil is the error returned if Marshal is called with\n\t// a struct with a oneof field containing a nil element.\n\terrOneofHasNil = errors.New(\"proto: oneof field has nil value\")\n\n\t// ErrNil is the error returned if Marshal is called with nil.\n\tErrNil = errors.New(\"proto: Marshal called with nil\")\n\n\t// ErrTooLarge is the error returned if Marshal is called with a\n\t// message that encodes to >2GB.\n\tErrTooLarge = errors.New(\"proto: message encodes to over 2 GB\")\n)\n\n// The fundamental encoders that put bytes on the wire.\n// Those that take integer types all accept uint64 and are\n// therefore of type valueEncoder.\n\nconst maxVarintBytes = 10 // maximum length of a varint\n\n// EncodeVarint returns the varint encoding of x.\n// This is the format for the\n// int32, int64, uint32, uint64, bool, and enum\n// protocol buffer types.\n// Not used by the package itself, but helpful to clients\n// wishing to use the same encoding.\nfunc EncodeVarint(x uint64) []byte {\n\tvar buf [maxVarintBytes]byte\n\tvar n int\n\tfor n = 0; x > 127; n++ {\n\t\tbuf[n] = 0x80 | uint8(x&0x7F)\n\t\tx >>= 7\n\t}\n\tbuf[n] = uint8(x)\n\tn++\n\treturn buf[0:n]\n}\n\n// EncodeVarint writes a varint-encoded integer to the Buffer.\n// This is the format for the\n// int32, int64, uint32, uint64, bool, and enum\n// protocol buffer types.\nfunc (p *Buffer) EncodeVarint(x uint64) error {\n\tfor x >= 1<<7 {\n\t\tp.buf = append(p.buf, uint8(x&0x7f|0x80))\n\t\tx >>= 7\n\t}\n\tp.buf = append(p.buf, uint8(x))\n\treturn nil\n}\n\n// SizeVarint returns the varint encoding size of an integer.\nfunc SizeVarint(x uint64) int {\n\tswitch {\n\tcase x < 1<<7:\n\t\treturn 1\n\tcase x < 1<<14:\n\t\treturn 2\n\tcase x < 1<<21:\n\t\treturn 3\n\tcase x < 1<<28:\n\t\treturn 4\n\tcase x < 1<<35:\n\t\treturn 5\n\tcase x < 1<<42:\n\t\treturn 6\n\tcase x < 1<<49:\n\t\treturn 7\n\tcase x < 1<<56:\n\t\treturn 8\n\tcase x < 1<<63:\n\t\treturn 9\n\t}\n\treturn 10\n}\n\n// EncodeFixed64 writes a 64-bit integer to the Buffer.\n// This is the format for the\n// fixed64, sfixed64, and double protocol buffer types.\nfunc (p *Buffer) EncodeFixed64(x uint64) error {\n\tp.buf = append(p.buf,\n\t\tuint8(x),\n\t\tuint8(x>>8),\n\t\tuint8(x>>16),\n\t\tuint8(x>>24),\n\t\tuint8(x>>32),\n\t\tuint8(x>>40),\n\t\tuint8(x>>48),\n\t\tuint8(x>>56))\n\treturn nil\n}\n\n// EncodeFixed32 writes a 32-bit integer to the Buffer.\n// This is the format for the\n// fixed32, sfixed32, and float protocol buffer types.\nfunc (p *Buffer) EncodeFixed32(x uint64) error {\n\tp.buf = append(p.buf,\n\t\tuint8(x),\n\t\tuint8(x>>8),\n\t\tuint8(x>>16),\n\t\tuint8(x>>24))\n\treturn nil\n}\n\n// EncodeZigzag64 writes a zigzag-encoded 64-bit integer\n// to the Buffer.\n// This is the format used for the sint64 protocol buffer type.\nfunc (p *Buffer) EncodeZigzag64(x uint64) error {\n\t// use signed number to get arithmetic right shift.\n\treturn p.EncodeVarint(uint64((x << 1) ^ uint64((int64(x) >> 63))))\n}\n\n// EncodeZigzag32 writes a zigzag-encoded 32-bit integer\n// to the Buffer.\n// This is the format used for the sint32 protocol buffer type.\nfunc (p *Buffer) EncodeZigzag32(x uint64) error {\n\t// use signed number to get arithmetic right shift.\n\treturn p.EncodeVarint(uint64((uint32(x) << 1) ^ uint32((int32(x) >> 31))))\n}\n\n// EncodeRawBytes writes a count-delimited byte buffer to the Buffer.\n// This is the format used for the bytes protocol buffer\n// type and for embedded messages.\nfunc (p *Buffer) EncodeRawBytes(b []byte) error {\n\tp.EncodeVarint(uint64(len(b)))\n\tp.buf = append(p.buf, b...)\n\treturn nil\n}\n\n// EncodeStringBytes writes an encoded string to the Buffer.\n// This is the format used for the proto2 string type.\nfunc (p *Buffer) EncodeStringBytes(s string) error {\n\tp.EncodeVarint(uint64(len(s)))\n\tp.buf = append(p.buf, s...)\n\treturn nil\n}\n\n// Marshaler is the interface representing objects that can marshal themselves.\ntype Marshaler interface {\n\tMarshal() ([]byte, error)\n}\n\n// EncodeMessage writes the protocol buffer to the Buffer,\n// prefixed by a varint-encoded length.\nfunc (p *Buffer) EncodeMessage(pb Message) error {\n\tsiz := Size(pb)\n\tp.EncodeVarint(uint64(siz))\n\treturn p.Marshal(pb)\n}\n\n// All protocol buffer fields are nillable, but be careful.\nfunc isNil(v reflect.Value) bool {\n\tswitch v.Kind() {\n\tcase reflect.Interface, reflect.Map, reflect.Ptr, reflect.Slice:\n\t\treturn v.IsNil()\n\t}\n\treturn false\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/equal.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2011 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Protocol buffer comparison.\n\npackage proto\n\nimport (\n\t\"bytes\"\n\t\"log\"\n\t\"reflect\"\n\t\"strings\"\n)\n\n/*\nEqual returns true iff protocol buffers a and b are equal.\nThe arguments must both be pointers to protocol buffer structs.\n\nEquality is defined in this way:\n - Two messages are equal iff they are the same type,\n corresponding fields are equal, unknown field sets\n are equal, and extensions sets are equal.\n - Two set scalar fields are equal iff their values are equal.\n If the fields are of a floating-point type, remember that\n NaN != x for all x, including NaN. If the message is defined\n in a proto3 .proto file, fields are not \"set\"; specifically,\n zero length proto3 \"bytes\" fields are equal (nil == {}).\n - Two repeated fields are equal iff their lengths are the same,\n and their corresponding elements are equal. Note a \"bytes\" field,\n although represented by []byte, is not a repeated field and the\n rule for the scalar fields described above applies.\n - Two unset fields are equal.\n - Two unknown field sets are equal if their current\n encoded state is equal.\n - Two extension sets are equal iff they have corresponding\n elements that are pairwise equal.\n - Two map fields are equal iff their lengths are the same,\n and they contain the same set of elements. Zero-length map\n fields are equal.\n - Every other combination of things are not equal.\n\nThe return value is undefined if a and b are not protocol buffers.\n*/\nfunc Equal(a, b Message) bool {\n\tif a == nil || b == nil {\n\t\treturn a == b\n\t}\n\tv1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)\n\tif v1.Type() != v2.Type() {\n\t\treturn false\n\t}\n\tif v1.Kind() == reflect.Ptr {\n\t\tif v1.IsNil() {\n\t\t\treturn v2.IsNil()\n\t\t}\n\t\tif v2.IsNil() {\n\t\t\treturn false\n\t\t}\n\t\tv1, v2 = v1.Elem(), v2.Elem()\n\t}\n\tif v1.Kind() != reflect.Struct {\n\t\treturn false\n\t}\n\treturn equalStruct(v1, v2)\n}\n\n// v1 and v2 are known to have the same type.\nfunc equalStruct(v1, v2 reflect.Value) bool {\n\tsprop := GetProperties(v1.Type())\n\tfor i := 0; i < v1.NumField(); i++ {\n\t\tf := v1.Type().Field(i)\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\t\tf1, f2 := v1.Field(i), v2.Field(i)\n\t\tif f.Type.Kind() == reflect.Ptr {\n\t\t\tif n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {\n\t\t\t\t// both unset\n\t\t\t\tcontinue\n\t\t\t} else if n1 != n2 {\n\t\t\t\t// set/unset mismatch\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tf1, f2 = f1.Elem(), f2.Elem()\n\t\t}\n\t\tif !equalAny(f1, f2, sprop.Prop[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif em1 := v1.FieldByName(\"XXX_InternalExtensions\"); em1.IsValid() {\n\t\tem2 := v2.FieldByName(\"XXX_InternalExtensions\")\n\t\tif !equalExtensions(v1.Type(), em1.Interface().(XXX_InternalExtensions), em2.Interface().(XXX_InternalExtensions)) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif em1 := v1.FieldByName(\"XXX_extensions\"); em1.IsValid() {\n\t\tem2 := v2.FieldByName(\"XXX_extensions\")\n\t\tif !equalExtMap(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tuf := v1.FieldByName(\"XXX_unrecognized\")\n\tif !uf.IsValid() {\n\t\treturn true\n\t}\n\n\tu1 := uf.Bytes()\n\tu2 := v2.FieldByName(\"XXX_unrecognized\").Bytes()\n\treturn bytes.Equal(u1, u2)\n}\n\n// v1 and v2 are known to have the same type.\n// prop may be nil.\nfunc equalAny(v1, v2 reflect.Value, prop *Properties) bool {\n\tif v1.Type() == protoMessageType {\n\t\tm1, _ := v1.Interface().(Message)\n\t\tm2, _ := v2.Interface().(Message)\n\t\treturn Equal(m1, m2)\n\t}\n\tswitch v1.Kind() {\n\tcase reflect.Bool:\n\t\treturn v1.Bool() == v2.Bool()\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v1.Float() == v2.Float()\n\tcase reflect.Int32, reflect.Int64:\n\t\treturn v1.Int() == v2.Int()\n\tcase reflect.Interface:\n\t\t// Probably a oneof field; compare the inner values.\n\t\tn1, n2 := v1.IsNil(), v2.IsNil()\n\t\tif n1 || n2 {\n\t\t\treturn n1 == n2\n\t\t}\n\t\te1, e2 := v1.Elem(), v2.Elem()\n\t\tif e1.Type() != e2.Type() {\n\t\t\treturn false\n\t\t}\n\t\treturn equalAny(e1, e2, nil)\n\tcase reflect.Map:\n\t\tif v1.Len() != v2.Len() {\n\t\t\treturn false\n\t\t}\n\t\tfor _, key := range v1.MapKeys() {\n\t\t\tval2 := v2.MapIndex(key)\n\t\t\tif !val2.IsValid() {\n\t\t\t\t// This key was not found in the second map.\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !equalAny(v1.MapIndex(key), val2, nil) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\tcase reflect.Ptr:\n\t\t// Maps may have nil values in them, so check for nil.\n\t\tif v1.IsNil() && v2.IsNil() {\n\t\t\treturn true\n\t\t}\n\t\tif v1.IsNil() != v2.IsNil() {\n\t\t\treturn false\n\t\t}\n\t\treturn equalAny(v1.Elem(), v2.Elem(), prop)\n\tcase reflect.Slice:\n\t\tif v1.Type().Elem().Kind() == reflect.Uint8 {\n\t\t\t// short circuit: []byte\n\n\t\t\t// Edge case: if this is in a proto3 message, a zero length\n\t\t\t// bytes field is considered the zero value.\n\t\t\tif prop != nil && prop.proto3 && v1.Len() == 0 && v2.Len() == 0 {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\tif v1.IsNil() != v2.IsNil() {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\treturn bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))\n\t\t}\n\n\t\tif v1.Len() != v2.Len() {\n\t\t\treturn false\n\t\t}\n\t\tfor i := 0; i < v1.Len(); i++ {\n\t\t\tif !equalAny(v1.Index(i), v2.Index(i), prop) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\tcase reflect.String:\n\t\treturn v1.Interface().(string) == v2.Interface().(string)\n\tcase reflect.Struct:\n\t\treturn equalStruct(v1, v2)\n\tcase reflect.Uint32, reflect.Uint64:\n\t\treturn v1.Uint() == v2.Uint()\n\t}\n\n\t// unknown type, so not a protocol buffer\n\tlog.Printf(\"proto: don't know how to compare %v\", v1)\n\treturn false\n}\n\n// base is the struct type that the extensions are based on.\n// x1 and x2 are InternalExtensions.\nfunc equalExtensions(base reflect.Type, x1, x2 XXX_InternalExtensions) bool {\n\tem1, _ := x1.extensionsRead()\n\tem2, _ := x2.extensionsRead()\n\treturn equalExtMap(base, em1, em2)\n}\n\nfunc equalExtMap(base reflect.Type, em1, em2 map[int32]Extension) bool {\n\tif len(em1) != len(em2) {\n\t\treturn false\n\t}\n\n\tfor extNum, e1 := range em1 {\n\t\te2, ok := em2[extNum]\n\t\tif !ok {\n\t\t\treturn false\n\t\t}\n\n\t\tm1 := extensionAsLegacyType(e1.value)\n\t\tm2 := extensionAsLegacyType(e2.value)\n\n\t\tif m1 == nil && m2 == nil {\n\t\t\t// Both have only encoded form.\n\t\t\tif bytes.Equal(e1.enc, e2.enc) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// The bytes are different, but the extensions might still be\n\t\t\t// equal. We need to decode them to compare.\n\t\t}\n\n\t\tif m1 != nil && m2 != nil {\n\t\t\t// Both are unencoded.\n\t\t\tif !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\t// At least one is encoded. To do a semantically correct comparison\n\t\t// we need to unmarshal them first.\n\t\tvar desc *ExtensionDesc\n\t\tif m := extensionMaps[base]; m != nil {\n\t\t\tdesc = m[extNum]\n\t\t}\n\t\tif desc == nil {\n\t\t\t// If both have only encoded form and the bytes are the same,\n\t\t\t// it is handled above. We get here when the bytes are different.\n\t\t\t// We don't know how to decode it, so just compare them as byte\n\t\t\t// slices.\n\t\t\tlog.Printf(\"proto: don't know how to compare extension %d of %v\", extNum, base)\n\t\t\treturn false\n\t\t}\n\t\tvar err error\n\t\tif m1 == nil {\n\t\t\tm1, err = decodeExtension(e1.enc, desc)\n\t\t}\n\t\tif m2 == nil && err == nil {\n\t\t\tm2, err = decodeExtension(e2.enc, desc)\n\t\t}\n\t\tif err != nil {\n\t\t\t// The encoded form is invalid.\n\t\t\tlog.Printf(\"proto: badly encoded extension %d of %v: %v\", extNum, base, err)\n\t\t\treturn false\n\t\t}\n\t\tif !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/extensions.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n/*\n * Types and routines for supporting protocol buffer extensions.\n */\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"sync\"\n)\n\n// ErrMissingExtension is the error returned by GetExtension if the named extension is not in the message.\nvar ErrMissingExtension = errors.New(\"proto: missing extension\")\n\n// ExtensionRange represents a range of message extensions for a protocol buffer.\n// Used in code generated by the protocol compiler.\ntype ExtensionRange struct {\n\tStart, End int32 // both inclusive\n}\n\n// extendableProto is an interface implemented by any protocol buffer generated by the current\n// proto compiler that may be extended.\ntype extendableProto interface {\n\tMessage\n\tExtensionRangeArray() []ExtensionRange\n\textensionsWrite() map[int32]Extension\n\textensionsRead() (map[int32]Extension, sync.Locker)\n}\n\n// extendableProtoV1 is an interface implemented by a protocol buffer generated by the previous\n// version of the proto compiler that may be extended.\ntype extendableProtoV1 interface {\n\tMessage\n\tExtensionRangeArray() []ExtensionRange\n\tExtensionMap() map[int32]Extension\n}\n\n// extensionAdapter is a wrapper around extendableProtoV1 that implements extendableProto.\ntype extensionAdapter struct {\n\textendableProtoV1\n}\n\nfunc (e extensionAdapter) extensionsWrite() map[int32]Extension {\n\treturn e.ExtensionMap()\n}\n\nfunc (e extensionAdapter) extensionsRead() (map[int32]Extension, sync.Locker) {\n\treturn e.ExtensionMap(), notLocker{}\n}\n\n// notLocker is a sync.Locker whose Lock and Unlock methods are nops.\ntype notLocker struct{}\n\nfunc (n notLocker) Lock() {}\nfunc (n notLocker) Unlock() {}\n\n// extendable returns the extendableProto interface for the given generated proto message.\n// If the proto message has the old extension format, it returns a wrapper that implements\n// the extendableProto interface.\nfunc extendable(p interface{}) (extendableProto, error) {\n\tswitch p := p.(type) {\n\tcase extendableProto:\n\t\tif isNilPtr(p) {\n\t\t\treturn nil, fmt.Errorf(\"proto: nil %T is not extendable\", p)\n\t\t}\n\t\treturn p, nil\n\tcase extendableProtoV1:\n\t\tif isNilPtr(p) {\n\t\t\treturn nil, fmt.Errorf(\"proto: nil %T is not extendable\", p)\n\t\t}\n\t\treturn extensionAdapter{p}, nil\n\t}\n\t// Don't allocate a specific error containing %T:\n\t// this is the hot path for Clone and MarshalText.\n\treturn nil, errNotExtendable\n}\n\nvar errNotExtendable = errors.New(\"proto: not an extendable proto.Message\")\n\nfunc isNilPtr(x interface{}) bool {\n\tv := reflect.ValueOf(x)\n\treturn v.Kind() == reflect.Ptr && v.IsNil()\n}\n\n// XXX_InternalExtensions is an internal representation of proto extensions.\n//\n// Each generated message struct type embeds an anonymous XXX_InternalExtensions field,\n// thus gaining the unexported 'extensions' method, which can be called only from the proto package.\n//\n// The methods of XXX_InternalExtensions are not concurrency safe in general,\n// but calls to logically read-only methods such as has and get may be executed concurrently.\ntype XXX_InternalExtensions struct {\n\t// The struct must be indirect so that if a user inadvertently copies a\n\t// generated message and its embedded XXX_InternalExtensions, they\n\t// avoid the mayhem of a copied mutex.\n\t//\n\t// The mutex serializes all logically read-only operations to p.extensionMap.\n\t// It is up to the client to ensure that write operations to p.extensionMap are\n\t// mutually exclusive with other accesses.\n\tp *struct {\n\t\tmu sync.Mutex\n\t\textensionMap map[int32]Extension\n\t}\n}\n\n// extensionsWrite returns the extension map, creating it on first use.\nfunc (e *XXX_InternalExtensions) extensionsWrite() map[int32]Extension {\n\tif e.p == nil {\n\t\te.p = new(struct {\n\t\t\tmu sync.Mutex\n\t\t\textensionMap map[int32]Extension\n\t\t})\n\t\te.p.extensionMap = make(map[int32]Extension)\n\t}\n\treturn e.p.extensionMap\n}\n\n// extensionsRead returns the extensions map for read-only use. It may be nil.\n// The caller must hold the returned mutex's lock when accessing Elements within the map.\nfunc (e *XXX_InternalExtensions) extensionsRead() (map[int32]Extension, sync.Locker) {\n\tif e.p == nil {\n\t\treturn nil, nil\n\t}\n\treturn e.p.extensionMap, &e.p.mu\n}\n\n// ExtensionDesc represents an extension specification.\n// Used in generated code from the protocol compiler.\ntype ExtensionDesc struct {\n\tExtendedType Message // nil pointer to the type that is being extended\n\tExtensionType interface{} // nil pointer to the extension type\n\tField int32 // field number\n\tName string // fully-qualified name of extension, for text formatting\n\tTag string // protobuf tag style\n\tFilename string // name of the file in which the extension is defined\n}\n\nfunc (ed *ExtensionDesc) repeated() bool {\n\tt := reflect.TypeOf(ed.ExtensionType)\n\treturn t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8\n}\n\n// Extension represents an extension in a message.\ntype Extension struct {\n\t// When an extension is stored in a message using SetExtension\n\t// only desc and value are set. When the message is marshaled\n\t// enc will be set to the encoded form of the message.\n\t//\n\t// When a message is unmarshaled and contains extensions, each\n\t// extension will have only enc set. When such an extension is\n\t// accessed using GetExtension (or GetExtensions) desc and value\n\t// will be set.\n\tdesc *ExtensionDesc\n\n\t// value is a concrete value for the extension field. Let the type of\n\t// desc.ExtensionType be the \"API type\" and the type of Extension.value\n\t// be the \"storage type\". The API type and storage type are the same except:\n\t//\t* For scalars (except []byte), the API type uses *T,\n\t//\twhile the storage type uses T.\n\t//\t* For repeated fields, the API type uses []T, while the storage type\n\t//\tuses *[]T.\n\t//\n\t// The reason for the divergence is so that the storage type more naturally\n\t// matches what is expected of when retrieving the values through the\n\t// protobuf reflection APIs.\n\t//\n\t// The value may only be populated if desc is also populated.\n\tvalue interface{}\n\n\t// enc is the raw bytes for the extension field.\n\tenc []byte\n}\n\n// SetRawExtension is for testing only.\nfunc SetRawExtension(base Message, id int32, b []byte) {\n\tepb, err := extendable(base)\n\tif err != nil {\n\t\treturn\n\t}\n\textmap := epb.extensionsWrite()\n\textmap[id] = Extension{enc: b}\n}\n\n// isExtensionField returns true iff the given field number is in an extension range.\nfunc isExtensionField(pb extendableProto, field int32) bool {\n\tfor _, er := range pb.ExtensionRangeArray() {\n\t\tif er.Start <= field && field <= er.End {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// checkExtensionTypes checks that the given extension is valid for pb.\nfunc checkExtensionTypes(pb extendableProto, extension *ExtensionDesc) error {\n\tvar pbi interface{} = pb\n\t// Check the extended type.\n\tif ea, ok := pbi.(extensionAdapter); ok {\n\t\tpbi = ea.extendableProtoV1\n\t}\n\tif a, b := reflect.TypeOf(pbi), reflect.TypeOf(extension.ExtendedType); a != b {\n\t\treturn fmt.Errorf(\"proto: bad extended type; %v does not extend %v\", b, a)\n\t}\n\t// Check the range.\n\tif !isExtensionField(pb, extension.Field) {\n\t\treturn errors.New(\"proto: bad extension number; not in declared ranges\")\n\t}\n\treturn nil\n}\n\n// extPropKey is sufficient to uniquely identify an extension.\ntype extPropKey struct {\n\tbase reflect.Type\n\tfield int32\n}\n\nvar extProp = struct {\n\tsync.RWMutex\n\tm map[extPropKey]*Properties\n}{\n\tm: make(map[extPropKey]*Properties),\n}\n\nfunc extensionProperties(ed *ExtensionDesc) *Properties {\n\tkey := extPropKey{base: reflect.TypeOf(ed.ExtendedType), field: ed.Field}\n\n\textProp.RLock()\n\tif prop, ok := extProp.m[key]; ok {\n\t\textProp.RUnlock()\n\t\treturn prop\n\t}\n\textProp.RUnlock()\n\n\textProp.Lock()\n\tdefer extProp.Unlock()\n\t// Check again.\n\tif prop, ok := extProp.m[key]; ok {\n\t\treturn prop\n\t}\n\n\tprop := new(Properties)\n\tprop.Init(reflect.TypeOf(ed.ExtensionType), \"unknown_name\", ed.Tag, nil)\n\textProp.m[key] = prop\n\treturn prop\n}\n\n// HasExtension returns whether the given extension is present in pb.\nfunc HasExtension(pb Message, extension *ExtensionDesc) bool {\n\t// TODO: Check types, field numbers, etc.?\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn false\n\t}\n\textmap, mu := epb.extensionsRead()\n\tif extmap == nil {\n\t\treturn false\n\t}\n\tmu.Lock()\n\t_, ok := extmap[extension.Field]\n\tmu.Unlock()\n\treturn ok\n}\n\n// ClearExtension removes the given extension from pb.\nfunc ClearExtension(pb Message, extension *ExtensionDesc) {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn\n\t}\n\t// TODO: Check types, field numbers, etc.?\n\textmap := epb.extensionsWrite()\n\tdelete(extmap, extension.Field)\n}\n\n// GetExtension retrieves a proto2 extended field from pb.\n//\n// If the descriptor is type complete (i.e., ExtensionDesc.ExtensionType is non-nil),\n// then GetExtension parses the encoded field and returns a Go value of the specified type.\n// If the field is not present, then the default value is returned (if one is specified),\n// otherwise ErrMissingExtension is reported.\n//\n// If the descriptor is not type complete (i.e., ExtensionDesc.ExtensionType is nil),\n// then GetExtension returns the raw encoded bytes of the field extension.\nfunc GetExtension(pb Message, extension *ExtensionDesc) (interface{}, error) {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif extension.ExtendedType != nil {\n\t\t// can only check type if this is a complete descriptor\n\t\tif err := checkExtensionTypes(epb, extension); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\temap, mu := epb.extensionsRead()\n\tif emap == nil {\n\t\treturn defaultExtensionValue(extension)\n\t}\n\tmu.Lock()\n\tdefer mu.Unlock()\n\te, ok := emap[extension.Field]\n\tif !ok {\n\t\t// defaultExtensionValue returns the default value or\n\t\t// ErrMissingExtension if there is no default.\n\t\treturn defaultExtensionValue(extension)\n\t}\n\n\tif e.value != nil {\n\t\t// Already decoded. Check the descriptor, though.\n\t\tif e.desc != extension {\n\t\t\t// This shouldn't happen. If it does, it means that\n\t\t\t// GetExtension was called twice with two different\n\t\t\t// descriptors with the same field number.\n\t\t\treturn nil, errors.New(\"proto: descriptor conflict\")\n\t\t}\n\t\treturn extensionAsLegacyType(e.value), nil\n\t}\n\n\tif extension.ExtensionType == nil {\n\t\t// incomplete descriptor\n\t\treturn e.enc, nil\n\t}\n\n\tv, err := decodeExtension(e.enc, extension)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Remember the decoded version and drop the encoded version.\n\t// That way it is safe to mutate what we return.\n\te.value = extensionAsStorageType(v)\n\te.desc = extension\n\te.enc = nil\n\temap[extension.Field] = e\n\treturn extensionAsLegacyType(e.value), nil\n}\n\n// defaultExtensionValue returns the default value for extension.\n// If no default for an extension is defined ErrMissingExtension is returned.\nfunc defaultExtensionValue(extension *ExtensionDesc) (interface{}, error) {\n\tif extension.ExtensionType == nil {\n\t\t// incomplete descriptor, so no default\n\t\treturn nil, ErrMissingExtension\n\t}\n\n\tt := reflect.TypeOf(extension.ExtensionType)\n\tprops := extensionProperties(extension)\n\n\tsf, _, err := fieldDefault(t, props)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif sf == nil || sf.value == nil {\n\t\t// There is no default value.\n\t\treturn nil, ErrMissingExtension\n\t}\n\n\tif t.Kind() != reflect.Ptr {\n\t\t// We do not need to return a Ptr, we can directly return sf.value.\n\t\treturn sf.value, nil\n\t}\n\n\t// We need to return an interface{} that is a pointer to sf.value.\n\tvalue := reflect.New(t).Elem()\n\tvalue.Set(reflect.New(value.Type().Elem()))\n\tif sf.kind == reflect.Int32 {\n\t\t// We may have an int32 or an enum, but the underlying data is int32.\n\t\t// Since we can't set an int32 into a non int32 reflect.value directly\n\t\t// set it as a int32.\n\t\tvalue.Elem().SetInt(int64(sf.value.(int32)))\n\t} else {\n\t\tvalue.Elem().Set(reflect.ValueOf(sf.value))\n\t}\n\treturn value.Interface(), nil\n}\n\n// decodeExtension decodes an extension encoded in b.\nfunc decodeExtension(b []byte, extension *ExtensionDesc) (interface{}, error) {\n\tt := reflect.TypeOf(extension.ExtensionType)\n\tunmarshal := typeUnmarshaler(t, extension.Tag)\n\n\t// t is a pointer to a struct, pointer to basic type or a slice.\n\t// Allocate space to store the pointer/slice.\n\tvalue := reflect.New(t).Elem()\n\n\tvar err error\n\tfor {\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\twire := int(x) & 7\n\n\t\tb, err = unmarshal(b, valToPointer(value.Addr()), wire)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tif len(b) == 0 {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn value.Interface(), nil\n}\n\n// GetExtensions returns a slice of the extensions present in pb that are also listed in es.\n// The returned slice has the same length as es; missing extensions will appear as nil elements.\nfunc GetExtensions(pb Message, es []*ExtensionDesc) (extensions []interface{}, err error) {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\textensions = make([]interface{}, len(es))\n\tfor i, e := range es {\n\t\textensions[i], err = GetExtension(epb, e)\n\t\tif err == ErrMissingExtension {\n\t\t\terr = nil\n\t\t}\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t}\n\treturn\n}\n\n// ExtensionDescs returns a new slice containing pb's extension descriptors, in undefined order.\n// For non-registered extensions, ExtensionDescs returns an incomplete descriptor containing\n// just the Field field, which defines the extension's field number.\nfunc ExtensionDescs(pb Message) ([]*ExtensionDesc, error) {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tregisteredExtensions := RegisteredExtensions(pb)\n\n\temap, mu := epb.extensionsRead()\n\tif emap == nil {\n\t\treturn nil, nil\n\t}\n\tmu.Lock()\n\tdefer mu.Unlock()\n\textensions := make([]*ExtensionDesc, 0, len(emap))\n\tfor extid, e := range emap {\n\t\tdesc := e.desc\n\t\tif desc == nil {\n\t\t\tdesc = registeredExtensions[extid]\n\t\t\tif desc == nil {\n\t\t\t\tdesc = &ExtensionDesc{Field: extid}\n\t\t\t}\n\t\t}\n\n\t\textensions = append(extensions, desc)\n\t}\n\treturn extensions, nil\n}\n\n// SetExtension sets the specified extension of pb to the specified value.\nfunc SetExtension(pb Message, extension *ExtensionDesc, value interface{}) error {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif err := checkExtensionTypes(epb, extension); err != nil {\n\t\treturn err\n\t}\n\ttyp := reflect.TypeOf(extension.ExtensionType)\n\tif typ != reflect.TypeOf(value) {\n\t\treturn fmt.Errorf(\"proto: bad extension value type. got: %T, want: %T\", value, extension.ExtensionType)\n\t}\n\t// nil extension values need to be caught early, because the\n\t// encoder can't distinguish an ErrNil due to a nil extension\n\t// from an ErrNil due to a missing field. Extensions are\n\t// always optional, so the encoder would just swallow the error\n\t// and drop all the extensions from the encoded message.\n\tif reflect.ValueOf(value).IsNil() {\n\t\treturn fmt.Errorf(\"proto: SetExtension called with nil value of type %T\", value)\n\t}\n\n\textmap := epb.extensionsWrite()\n\textmap[extension.Field] = Extension{desc: extension, value: extensionAsStorageType(value)}\n\treturn nil\n}\n\n// ClearAllExtensions clears all extensions from pb.\nfunc ClearAllExtensions(pb Message) {\n\tepb, err := extendable(pb)\n\tif err != nil {\n\t\treturn\n\t}\n\tm := epb.extensionsWrite()\n\tfor k := range m {\n\t\tdelete(m, k)\n\t}\n}\n\n// A global registry of extensions.\n// The generated code will register the generated descriptors by calling RegisterExtension.\n\nvar extensionMaps = make(map[reflect.Type]map[int32]*ExtensionDesc)\n\n// RegisterExtension is called from the generated code.\nfunc RegisterExtension(desc *ExtensionDesc) {\n\tst := reflect.TypeOf(desc.ExtendedType).Elem()\n\tm := extensionMaps[st]\n\tif m == nil {\n\t\tm = make(map[int32]*ExtensionDesc)\n\t\textensionMaps[st] = m\n\t}\n\tif _, ok := m[desc.Field]; ok {\n\t\tpanic(\"proto: duplicate extension registered: \" + st.String() + \" \" + strconv.Itoa(int(desc.Field)))\n\t}\n\tm[desc.Field] = desc\n}\n\n// RegisteredExtensions returns a map of the registered extensions of a\n// protocol buffer struct, indexed by the extension number.\n// The argument pb should be a nil pointer to the struct type.\nfunc RegisteredExtensions(pb Message) map[int32]*ExtensionDesc {\n\treturn extensionMaps[reflect.TypeOf(pb).Elem()]\n}\n\n// extensionAsLegacyType converts an value in the storage type as the API type.\n// See Extension.value.\nfunc extensionAsLegacyType(v interface{}) interface{} {\n\tswitch rv := reflect.ValueOf(v); rv.Kind() {\n\tcase reflect.Bool, reflect.Int32, reflect.Int64, reflect.Uint32, reflect.Uint64, reflect.Float32, reflect.Float64, reflect.String:\n\t\t// Represent primitive types as a pointer to the value.\n\t\trv2 := reflect.New(rv.Type())\n\t\trv2.Elem().Set(rv)\n\t\tv = rv2.Interface()\n\tcase reflect.Ptr:\n\t\t// Represent slice types as the value itself.\n\t\tswitch rv.Type().Elem().Kind() {\n\t\tcase reflect.Slice:\n\t\t\tif rv.IsNil() {\n\t\t\t\tv = reflect.Zero(rv.Type().Elem()).Interface()\n\t\t\t} else {\n\t\t\t\tv = rv.Elem().Interface()\n\t\t\t}\n\t\t}\n\t}\n\treturn v\n}\n\n// extensionAsStorageType converts an value in the API type as the storage type.\n// See Extension.value.\nfunc extensionAsStorageType(v interface{}) interface{} {\n\tswitch rv := reflect.ValueOf(v); rv.Kind() {\n\tcase reflect.Ptr:\n\t\t// Represent slice types as the value itself.\n\t\tswitch rv.Type().Elem().Kind() {\n\t\tcase reflect.Bool, reflect.Int32, reflect.Int64, reflect.Uint32, reflect.Uint64, reflect.Float32, reflect.Float64, reflect.String:\n\t\t\tif rv.IsNil() {\n\t\t\t\tv = reflect.Zero(rv.Type().Elem()).Interface()\n\t\t\t} else {\n\t\t\t\tv = rv.Elem().Interface()\n\t\t\t}\n\t\t}\n\tcase reflect.Slice:\n\t\t// Represent slice types as a pointer to the value.\n\t\tif rv.Type().Elem().Kind() != reflect.Uint8 {\n\t\t\trv2 := reflect.New(rv.Type())\n\t\t\trv2.Elem().Set(rv)\n\t\t\tv = rv2.Interface()\n\t\t}\n\t}\n\treturn v\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/lib.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n/*\nPackage proto converts data structures to and from the wire format of\nprotocol buffers. It works in concert with the Go source code generated\nfor .proto files by the protocol compiler.\n\nA summary of the properties of the protocol buffer interface\nfor a protocol buffer variable v:\n\n - Names are turned from camel_case to CamelCase for export.\n - There are no methods on v to set fields; just treat\n\tthem as structure fields.\n - There are getters that return a field's value if set,\n\tand return the field's default value if unset.\n\tThe getters work even if the receiver is a nil message.\n - The zero value for a struct is its correct initialization state.\n\tAll desired fields must be set before marshaling.\n - A Reset() method will restore a protobuf struct to its zero state.\n - Non-repeated fields are pointers to the values; nil means unset.\n\tThat is, optional or required field int32 f becomes F *int32.\n - Repeated fields are slices.\n - Helper functions are available to aid the setting of fields.\n\tmsg.Foo = proto.String(\"hello\") // set field\n - Constants are defined to hold the default values of all fields that\n\thave them. They have the form Default_StructName_FieldName.\n\tBecause the getter methods handle defaulted values,\n\tdirect use of these constants should be rare.\n - Enums are given type names and maps from names to values.\n\tEnum values are prefixed by the enclosing message's name, or by the\n\tenum's type name if it is a top-level enum. Enum types have a String\n\tmethod, and a Enum method to assist in message construction.\n - Nested messages, groups and enums have type names prefixed with the name of\n\tthe surrounding message type.\n - Extensions are given descriptor names that start with E_,\n\tfollowed by an underscore-delimited list of the nested messages\n\tthat contain it (if any) followed by the CamelCased name of the\n\textension field itself. HasExtension, ClearExtension, GetExtension\n\tand SetExtension are functions for manipulating extensions.\n - Oneof field sets are given a single field in their message,\n\twith distinguished wrapper types for each possible field value.\n - Marshal and Unmarshal are functions to encode and decode the wire format.\n\nWhen the .proto file specifies `syntax=\"proto3\"`, there are some differences:\n\n - Non-repeated fields of non-message type are values instead of pointers.\n - Enum types do not get an Enum method.\n\nThe simplest way to describe this is to see an example.\nGiven file test.proto, containing\n\n\tpackage example;\n\n\tenum FOO { X = 17; }\n\n\tmessage Test {\n\t required string label = 1;\n\t optional int32 type = 2 [default=77];\n\t repeated int64 reps = 3;\n\t optional group OptionalGroup = 4 {\n\t required string RequiredField = 5;\n\t }\n\t oneof union {\n\t int32 number = 6;\n\t string name = 7;\n\t }\n\t}\n\nThe resulting file, test.pb.go, is:\n\n\tpackage example\n\n\timport proto \"github.com/golang/protobuf/proto\"\n\timport math \"math\"\n\n\ttype FOO int32\n\tconst (\n\t\tFOO_X FOO = 17\n\t)\n\tvar FOO_name = map[int32]string{\n\t\t17: \"X\",\n\t}\n\tvar FOO_value = map[string]int32{\n\t\t\"X\": 17,\n\t}\n\n\tfunc (x FOO) Enum() *FOO {\n\t\tp := new(FOO)\n\t\t*p = x\n\t\treturn p\n\t}\n\tfunc (x FOO) String() string {\n\t\treturn proto.EnumName(FOO_name, int32(x))\n\t}\n\tfunc (x *FOO) UnmarshalJSON(data []byte) error {\n\t\tvalue, err := proto.UnmarshalJSONEnum(FOO_value, data)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t*x = FOO(value)\n\t\treturn nil\n\t}\n\n\ttype Test struct {\n\t\tLabel *string `protobuf:\"bytes,1,req,name=label\" json:\"label,omitempty\"`\n\t\tType *int32 `protobuf:\"varint,2,opt,name=type,def=77\" json:\"type,omitempty\"`\n\t\tReps []int64 `protobuf:\"varint,3,rep,name=reps\" json:\"reps,omitempty\"`\n\t\tOptionalgroup *Test_OptionalGroup `protobuf:\"group,4,opt,name=OptionalGroup\" json:\"optionalgroup,omitempty\"`\n\t\t// Types that are valid to be assigned to Union:\n\t\t//\t*Test_Number\n\t\t//\t*Test_Name\n\t\tUnion isTest_Union `protobuf_oneof:\"union\"`\n\t\tXXX_unrecognized []byte `json:\"-\"`\n\t}\n\tfunc (m *Test) Reset() { *m = Test{} }\n\tfunc (m *Test) String() string { return proto.CompactTextString(m) }\n\tfunc (*Test) ProtoMessage() {}\n\n\ttype isTest_Union interface {\n\t\tisTest_Union()\n\t}\n\n\ttype Test_Number struct {\n\t\tNumber int32 `protobuf:\"varint,6,opt,name=number\"`\n\t}\n\ttype Test_Name struct {\n\t\tName string `protobuf:\"bytes,7,opt,name=name\"`\n\t}\n\n\tfunc (*Test_Number) isTest_Union() {}\n\tfunc (*Test_Name) isTest_Union() {}\n\n\tfunc (m *Test) GetUnion() isTest_Union {\n\t\tif m != nil {\n\t\t\treturn m.Union\n\t\t}\n\t\treturn nil\n\t}\n\tconst Default_Test_Type int32 = 77\n\n\tfunc (m *Test) GetLabel() string {\n\t\tif m != nil && m.Label != nil {\n\t\t\treturn *m.Label\n\t\t}\n\t\treturn \"\"\n\t}\n\n\tfunc (m *Test) GetType() int32 {\n\t\tif m != nil && m.Type != nil {\n\t\t\treturn *m.Type\n\t\t}\n\t\treturn Default_Test_Type\n\t}\n\n\tfunc (m *Test) GetOptionalgroup() *Test_OptionalGroup {\n\t\tif m != nil {\n\t\t\treturn m.Optionalgroup\n\t\t}\n\t\treturn nil\n\t}\n\n\ttype Test_OptionalGroup struct {\n\t\tRequiredField *string `protobuf:\"bytes,5,req\" json:\"RequiredField,omitempty\"`\n\t}\n\tfunc (m *Test_OptionalGroup) Reset() { *m = Test_OptionalGroup{} }\n\tfunc (m *Test_OptionalGroup) String() string { return proto.CompactTextString(m) }\n\n\tfunc (m *Test_OptionalGroup) GetRequiredField() string {\n\t\tif m != nil && m.RequiredField != nil {\n\t\t\treturn *m.RequiredField\n\t\t}\n\t\treturn \"\"\n\t}\n\n\tfunc (m *Test) GetNumber() int32 {\n\t\tif x, ok := m.GetUnion().(*Test_Number); ok {\n\t\t\treturn x.Number\n\t\t}\n\t\treturn 0\n\t}\n\n\tfunc (m *Test) GetName() string {\n\t\tif x, ok := m.GetUnion().(*Test_Name); ok {\n\t\t\treturn x.Name\n\t\t}\n\t\treturn \"\"\n\t}\n\n\tfunc init() {\n\t\tproto.RegisterEnum(\"example.FOO\", FOO_name, FOO_value)\n\t}\n\nTo create and play with a Test object:\n\n\tpackage main\n\n\timport (\n\t\t\"log\"\n\n\t\t\"github.com/golang/protobuf/proto\"\n\t\tpb \"./example.pb\"\n\t)\n\n\tfunc main() {\n\t\ttest := &pb.Test{\n\t\t\tLabel: proto.String(\"hello\"),\n\t\t\tType: proto.Int32(17),\n\t\t\tReps: []int64{1, 2, 3},\n\t\t\tOptionalgroup: &pb.Test_OptionalGroup{\n\t\t\t\tRequiredField: proto.String(\"good bye\"),\n\t\t\t},\n\t\t\tUnion: &pb.Test_Name{\"fred\"},\n\t\t}\n\t\tdata, err := proto.Marshal(test)\n\t\tif err != nil {\n\t\t\tlog.Fatal(\"marshaling error: \", err)\n\t\t}\n\t\tnewTest := &pb.Test{}\n\t\terr = proto.Unmarshal(data, newTest)\n\t\tif err != nil {\n\t\t\tlog.Fatal(\"unmarshaling error: \", err)\n\t\t}\n\t\t// Now test and newTest contain the same data.\n\t\tif test.GetLabel() != newTest.GetLabel() {\n\t\t\tlog.Fatalf(\"data mismatch %q != %q\", test.GetLabel(), newTest.GetLabel())\n\t\t}\n\t\t// Use a type switch to determine which oneof was set.\n\t\tswitch u := test.Union.(type) {\n\t\tcase *pb.Test_Number: // u.Number contains the number.\n\t\tcase *pb.Test_Name: // u.Name contains the string.\n\t\t}\n\t\t// etc.\n\t}\n*/\npackage proto\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"log\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"sync\"\n)\n\n// RequiredNotSetError is an error type returned by either Marshal or Unmarshal.\n// Marshal reports this when a required field is not initialized.\n// Unmarshal reports this when a required field is missing from the wire data.\ntype RequiredNotSetError struct{ field string }\n\nfunc (e *RequiredNotSetError) Error() string {\n\tif e.field == \"\" {\n\t\treturn fmt.Sprintf(\"proto: required field not set\")\n\t}\n\treturn fmt.Sprintf(\"proto: required field %q not set\", e.field)\n}\nfunc (e *RequiredNotSetError) RequiredNotSet() bool {\n\treturn true\n}\n\ntype invalidUTF8Error struct{ field string }\n\nfunc (e *invalidUTF8Error) Error() string {\n\tif e.field == \"\" {\n\t\treturn \"proto: invalid UTF-8 detected\"\n\t}\n\treturn fmt.Sprintf(\"proto: field %q contains invalid UTF-8\", e.field)\n}\nfunc (e *invalidUTF8Error) InvalidUTF8() bool {\n\treturn true\n}\n\n// errInvalidUTF8 is a sentinel error to identify fields with invalid UTF-8.\n// This error should not be exposed to the external API as such errors should\n// be recreated with the field information.\nvar errInvalidUTF8 = &invalidUTF8Error{}\n\n// isNonFatal reports whether the error is either a RequiredNotSet error\n// or a InvalidUTF8 error.\nfunc isNonFatal(err error) bool {\n\tif re, ok := err.(interface{ RequiredNotSet() bool }); ok && re.RequiredNotSet() {\n\t\treturn true\n\t}\n\tif re, ok := err.(interface{ InvalidUTF8() bool }); ok && re.InvalidUTF8() {\n\t\treturn true\n\t}\n\treturn false\n}\n\ntype nonFatal struct{ E error }\n\n// Merge merges err into nf and reports whether it was successful.\n// Otherwise it returns false for any fatal non-nil errors.\nfunc (nf *nonFatal) Merge(err error) (ok bool) {\n\tif err == nil {\n\t\treturn true // not an error\n\t}\n\tif !isNonFatal(err) {\n\t\treturn false // fatal error\n\t}\n\tif nf.E == nil {\n\t\tnf.E = err // store first instance of non-fatal error\n\t}\n\treturn true\n}\n\n// Message is implemented by generated protocol buffer messages.\ntype Message interface {\n\tReset()\n\tString() string\n\tProtoMessage()\n}\n\n// A Buffer is a buffer manager for marshaling and unmarshaling\n// protocol buffers. It may be reused between invocations to\n// reduce memory usage. It is not necessary to use a Buffer;\n// the global functions Marshal and Unmarshal create a\n// temporary Buffer and are fine for most applications.\ntype Buffer struct {\n\tbuf []byte // encode/decode byte stream\n\tindex int // read point\n\n\tdeterministic bool\n}\n\n// NewBuffer allocates a new Buffer and initializes its internal data to\n// the contents of the argument slice.\nfunc NewBuffer(e []byte) *Buffer {\n\treturn &Buffer{buf: e}\n}\n\n// Reset resets the Buffer, ready for marshaling a new protocol buffer.\nfunc (p *Buffer) Reset() {\n\tp.buf = p.buf[0:0] // for reading/writing\n\tp.index = 0 // for reading\n}\n\n// SetBuf replaces the internal buffer with the slice,\n// ready for unmarshaling the contents of the slice.\nfunc (p *Buffer) SetBuf(s []byte) {\n\tp.buf = s\n\tp.index = 0\n}\n\n// Bytes returns the contents of the Buffer.\nfunc (p *Buffer) Bytes() []byte { return p.buf }\n\n// SetDeterministic sets whether to use deterministic serialization.\n//\n// Deterministic serialization guarantees that for a given binary, equal\n// messages will always be serialized to the same bytes. This implies:\n//\n// - Repeated serialization of a message will return the same bytes.\n// - Different processes of the same binary (which may be executing on\n// different machines) will serialize equal messages to the same bytes.\n//\n// Note that the deterministic serialization is NOT canonical across\n// languages. It is not guaranteed to remain stable over time. It is unstable\n// across different builds with schema changes due to unknown fields.\n// Users who need canonical serialization (e.g., persistent storage in a\n// canonical form, fingerprinting, etc.) should define their own\n// canonicalization specification and implement their own serializer rather\n// than relying on this API.\n//\n// If deterministic serialization is requested, map entries will be sorted\n// by keys in lexographical order. This is an implementation detail and\n// subject to change.\nfunc (p *Buffer) SetDeterministic(deterministic bool) {\n\tp.deterministic = deterministic\n}\n\n/*\n * Helper routines for simplifying the creation of optional fields of basic type.\n */\n\n// Bool is a helper routine that allocates a new bool value\n// to store v and returns a pointer to it.\nfunc Bool(v bool) *bool {\n\treturn &v\n}\n\n// Int32 is a helper routine that allocates a new int32 value\n// to store v and returns a pointer to it.\nfunc Int32(v int32) *int32 {\n\treturn &v\n}\n\n// Int is a helper routine that allocates a new int32 value\n// to store v and returns a pointer to it, but unlike Int32\n// its argument value is an int.\nfunc Int(v int) *int32 {\n\tp := new(int32)\n\t*p = int32(v)\n\treturn p\n}\n\n// Int64 is a helper routine that allocates a new int64 value\n// to store v and returns a pointer to it.\nfunc Int64(v int64) *int64 {\n\treturn &v\n}\n\n// Float32 is a helper routine that allocates a new float32 value\n// to store v and returns a pointer to it.\nfunc Float32(v float32) *float32 {\n\treturn &v\n}\n\n// Float64 is a helper routine that allocates a new float64 value\n// to store v and returns a pointer to it.\nfunc Float64(v float64) *float64 {\n\treturn &v\n}\n\n// Uint32 is a helper routine that allocates a new uint32 value\n// to store v and returns a pointer to it.\nfunc Uint32(v uint32) *uint32 {\n\treturn &v\n}\n\n// Uint64 is a helper routine that allocates a new uint64 value\n// to store v and returns a pointer to it.\nfunc Uint64(v uint64) *uint64 {\n\treturn &v\n}\n\n// String is a helper routine that allocates a new string value\n// to store v and returns a pointer to it.\nfunc String(v string) *string {\n\treturn &v\n}\n\n// EnumName is a helper function to simplify printing protocol buffer enums\n// by name. Given an enum map and a value, it returns a useful string.\nfunc EnumName(m map[int32]string, v int32) string {\n\ts, ok := m[v]\n\tif ok {\n\t\treturn s\n\t}\n\treturn strconv.Itoa(int(v))\n}\n\n// UnmarshalJSONEnum is a helper function to simplify recovering enum int values\n// from their JSON-encoded representation. Given a map from the enum's symbolic\n// names to its int values, and a byte buffer containing the JSON-encoded\n// value, it returns an int32 that can be cast to the enum type by the caller.\n//\n// The function can deal with both JSON representations, numeric and symbolic.\nfunc UnmarshalJSONEnum(m map[string]int32, data []byte, enumName string) (int32, error) {\n\tif data[0] == '\"' {\n\t\t// New style: enums are strings.\n\t\tvar repr string\n\t\tif err := json.Unmarshal(data, &repr); err != nil {\n\t\t\treturn -1, err\n\t\t}\n\t\tval, ok := m[repr]\n\t\tif !ok {\n\t\t\treturn 0, fmt.Errorf(\"unrecognized enum %s value %q\", enumName, repr)\n\t\t}\n\t\treturn val, nil\n\t}\n\t// Old style: enums are ints.\n\tvar val int32\n\tif err := json.Unmarshal(data, &val); err != nil {\n\t\treturn 0, fmt.Errorf(\"cannot unmarshal %#q into enum %s\", data, enumName)\n\t}\n\treturn val, nil\n}\n\n// DebugPrint dumps the encoded data in b in a debugging format with a header\n// including the string s. Used in testing but made available for general debugging.\nfunc (p *Buffer) DebugPrint(s string, b []byte) {\n\tvar u uint64\n\n\tobuf := p.buf\n\tindex := p.index\n\tp.buf = b\n\tp.index = 0\n\tdepth := 0\n\n\tfmt.Printf(\"\\n--- %s ---\\n\", s)\n\nout:\n\tfor {\n\t\tfor i := 0; i < depth; i++ {\n\t\t\tfmt.Print(\" \")\n\t\t}\n\n\t\tindex := p.index\n\t\tif index == len(p.buf) {\n\t\t\tbreak\n\t\t}\n\n\t\top, err := p.DecodeVarint()\n\t\tif err != nil {\n\t\t\tfmt.Printf(\"%3d: fetching op err %v\\n\", index, err)\n\t\t\tbreak out\n\t\t}\n\t\ttag := op >> 3\n\t\twire := op & 7\n\n\t\tswitch wire {\n\t\tdefault:\n\t\t\tfmt.Printf(\"%3d: t=%3d unknown wire=%d\\n\",\n\t\t\t\tindex, tag, wire)\n\t\t\tbreak out\n\n\t\tcase WireBytes:\n\t\t\tvar r []byte\n\n\t\t\tr, err = p.DecodeRawBytes(false)\n\t\t\tif err != nil {\n\t\t\t\tbreak out\n\t\t\t}\n\t\t\tfmt.Printf(\"%3d: t=%3d bytes [%d]\", index, tag, len(r))\n\t\t\tif len(r) <= 6 {\n\t\t\t\tfor i := 0; i < len(r); i++ {\n\t\t\t\t\tfmt.Printf(\" %.2x\", r[i])\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor i := 0; i < 3; i++ {\n\t\t\t\t\tfmt.Printf(\" %.2x\", r[i])\n\t\t\t\t}\n\t\t\t\tfmt.Printf(\" ..\")\n\t\t\t\tfor i := len(r) - 3; i < len(r); i++ {\n\t\t\t\t\tfmt.Printf(\" %.2x\", r[i])\n\t\t\t\t}\n\t\t\t}\n\t\t\tfmt.Printf(\"\\n\")\n\n\t\tcase WireFixed32:\n\t\t\tu, err = p.DecodeFixed32()\n\t\t\tif err != nil {\n\t\t\t\tfmt.Printf(\"%3d: t=%3d fix32 err %v\\n\", index, tag, err)\n\t\t\t\tbreak out\n\t\t\t}\n\t\t\tfmt.Printf(\"%3d: t=%3d fix32 %d\\n\", index, tag, u)\n\n\t\tcase WireFixed64:\n\t\t\tu, err = p.DecodeFixed64()\n\t\t\tif err != nil {\n\t\t\t\tfmt.Printf(\"%3d: t=%3d fix64 err %v\\n\", index, tag, err)\n\t\t\t\tbreak out\n\t\t\t}\n\t\t\tfmt.Printf(\"%3d: t=%3d fix64 %d\\n\", index, tag, u)\n\n\t\tcase WireVarint:\n\t\t\tu, err = p.DecodeVarint()\n\t\t\tif err != nil {\n\t\t\t\tfmt.Printf(\"%3d: t=%3d varint err %v\\n\", index, tag, err)\n\t\t\t\tbreak out\n\t\t\t}\n\t\t\tfmt.Printf(\"%3d: t=%3d varint %d\\n\", index, tag, u)\n\n\t\tcase WireStartGroup:\n\t\t\tfmt.Printf(\"%3d: t=%3d start\\n\", index, tag)\n\t\t\tdepth++\n\n\t\tcase WireEndGroup:\n\t\t\tdepth--\n\t\t\tfmt.Printf(\"%3d: t=%3d end\\n\", index, tag)\n\t\t}\n\t}\n\n\tif depth != 0 {\n\t\tfmt.Printf(\"%3d: start-end not balanced %d\\n\", p.index, depth)\n\t}\n\tfmt.Printf(\"\\n\")\n\n\tp.buf = obuf\n\tp.index = index\n}\n\n// SetDefaults sets unset protocol buffer fields to their default values.\n// It only modifies fields that are both unset and have defined defaults.\n// It recursively sets default values in any non-nil sub-messages.\nfunc SetDefaults(pb Message) {\n\tsetDefaults(reflect.ValueOf(pb), true, false)\n}\n\n// v is a pointer to a struct.\nfunc setDefaults(v reflect.Value, recur, zeros bool) {\n\tv = v.Elem()\n\n\tdefaultMu.RLock()\n\tdm, ok := defaults[v.Type()]\n\tdefaultMu.RUnlock()\n\tif !ok {\n\t\tdm = buildDefaultMessage(v.Type())\n\t\tdefaultMu.Lock()\n\t\tdefaults[v.Type()] = dm\n\t\tdefaultMu.Unlock()\n\t}\n\n\tfor _, sf := range dm.scalars {\n\t\tf := v.Field(sf.index)\n\t\tif !f.IsNil() {\n\t\t\t// field already set\n\t\t\tcontinue\n\t\t}\n\t\tdv := sf.value\n\t\tif dv == nil && !zeros {\n\t\t\t// no explicit default, and don't want to set zeros\n\t\t\tcontinue\n\t\t}\n\t\tfptr := f.Addr().Interface() // **T\n\t\t// TODO: Consider batching the allocations we do here.\n\t\tswitch sf.kind {\n\t\tcase reflect.Bool:\n\t\t\tb := new(bool)\n\t\t\tif dv != nil {\n\t\t\t\t*b = dv.(bool)\n\t\t\t}\n\t\t\t*(fptr.(**bool)) = b\n\t\tcase reflect.Float32:\n\t\t\tf := new(float32)\n\t\t\tif dv != nil {\n\t\t\t\t*f = dv.(float32)\n\t\t\t}\n\t\t\t*(fptr.(**float32)) = f\n\t\tcase reflect.Float64:\n\t\t\tf := new(float64)\n\t\t\tif dv != nil {\n\t\t\t\t*f = dv.(float64)\n\t\t\t}\n\t\t\t*(fptr.(**float64)) = f\n\t\tcase reflect.Int32:\n\t\t\t// might be an enum\n\t\t\tif ft := f.Type(); ft != int32PtrType {\n\t\t\t\t// enum\n\t\t\t\tf.Set(reflect.New(ft.Elem()))\n\t\t\t\tif dv != nil {\n\t\t\t\t\tf.Elem().SetInt(int64(dv.(int32)))\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// int32 field\n\t\t\t\ti := new(int32)\n\t\t\t\tif dv != nil {\n\t\t\t\t\t*i = dv.(int32)\n\t\t\t\t}\n\t\t\t\t*(fptr.(**int32)) = i\n\t\t\t}\n\t\tcase reflect.Int64:\n\t\t\ti := new(int64)\n\t\t\tif dv != nil {\n\t\t\t\t*i = dv.(int64)\n\t\t\t}\n\t\t\t*(fptr.(**int64)) = i\n\t\tcase reflect.String:\n\t\t\ts := new(string)\n\t\t\tif dv != nil {\n\t\t\t\t*s = dv.(string)\n\t\t\t}\n\t\t\t*(fptr.(**string)) = s\n\t\tcase reflect.Uint8:\n\t\t\t// exceptional case: []byte\n\t\t\tvar b []byte\n\t\t\tif dv != nil {\n\t\t\t\tdb := dv.([]byte)\n\t\t\t\tb = make([]byte, len(db))\n\t\t\t\tcopy(b, db)\n\t\t\t} else {\n\t\t\t\tb = []byte{}\n\t\t\t}\n\t\t\t*(fptr.(*[]byte)) = b\n\t\tcase reflect.Uint32:\n\t\t\tu := new(uint32)\n\t\t\tif dv != nil {\n\t\t\t\t*u = dv.(uint32)\n\t\t\t}\n\t\t\t*(fptr.(**uint32)) = u\n\t\tcase reflect.Uint64:\n\t\t\tu := new(uint64)\n\t\t\tif dv != nil {\n\t\t\t\t*u = dv.(uint64)\n\t\t\t}\n\t\t\t*(fptr.(**uint64)) = u\n\t\tdefault:\n\t\t\tlog.Printf(\"proto: can't set default for field %v (sf.kind=%v)\", f, sf.kind)\n\t\t}\n\t}\n\n\tfor _, ni := range dm.nested {\n\t\tf := v.Field(ni)\n\t\t// f is *T or []*T or map[T]*T\n\t\tswitch f.Kind() {\n\t\tcase reflect.Ptr:\n\t\t\tif f.IsNil() {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tsetDefaults(f, recur, zeros)\n\n\t\tcase reflect.Slice:\n\t\t\tfor i := 0; i < f.Len(); i++ {\n\t\t\t\te := f.Index(i)\n\t\t\t\tif e.IsNil() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tsetDefaults(e, recur, zeros)\n\t\t\t}\n\n\t\tcase reflect.Map:\n\t\t\tfor _, k := range f.MapKeys() {\n\t\t\t\te := f.MapIndex(k)\n\t\t\t\tif e.IsNil() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tsetDefaults(e, recur, zeros)\n\t\t\t}\n\t\t}\n\t}\n}\n\nvar (\n\t// defaults maps a protocol buffer struct type to a slice of the fields,\n\t// with its scalar fields set to their proto-declared non-zero default values.\n\tdefaultMu sync.RWMutex\n\tdefaults = make(map[reflect.Type]defaultMessage)\n\n\tint32PtrType = reflect.TypeOf((*int32)(nil))\n)\n\n// defaultMessage represents information about the default values of a message.\ntype defaultMessage struct {\n\tscalars []scalarField\n\tnested []int // struct field index of nested messages\n}\n\ntype scalarField struct {\n\tindex int // struct field index\n\tkind reflect.Kind // element type (the T in *T or []T)\n\tvalue interface{} // the proto-declared default value, or nil\n}\n\n// t is a struct type.\nfunc buildDefaultMessage(t reflect.Type) (dm defaultMessage) {\n\tsprop := GetProperties(t)\n\tfor _, prop := range sprop.Prop {\n\t\tfi, ok := sprop.decoderTags.get(prop.Tag)\n\t\tif !ok {\n\t\t\t// XXX_unrecognized\n\t\t\tcontinue\n\t\t}\n\t\tft := t.Field(fi).Type\n\n\t\tsf, nested, err := fieldDefault(ft, prop)\n\t\tswitch {\n\t\tcase err != nil:\n\t\t\tlog.Print(err)\n\t\tcase nested:\n\t\t\tdm.nested = append(dm.nested, fi)\n\t\tcase sf != nil:\n\t\t\tsf.index = fi\n\t\t\tdm.scalars = append(dm.scalars, *sf)\n\t\t}\n\t}\n\n\treturn dm\n}\n\n// fieldDefault returns the scalarField for field type ft.\n// sf will be nil if the field can not have a default.\n// nestedMessage will be true if this is a nested message.\n// Note that sf.index is not set on return.\nfunc fieldDefault(ft reflect.Type, prop *Properties) (sf *scalarField, nestedMessage bool, err error) {\n\tvar canHaveDefault bool\n\tswitch ft.Kind() {\n\tcase reflect.Ptr:\n\t\tif ft.Elem().Kind() == reflect.Struct {\n\t\t\tnestedMessage = true\n\t\t} else {\n\t\t\tcanHaveDefault = true // proto2 scalar field\n\t\t}\n\n\tcase reflect.Slice:\n\t\tswitch ft.Elem().Kind() {\n\t\tcase reflect.Ptr:\n\t\t\tnestedMessage = true // repeated message\n\t\tcase reflect.Uint8:\n\t\t\tcanHaveDefault = true // bytes field\n\t\t}\n\n\tcase reflect.Map:\n\t\tif ft.Elem().Kind() == reflect.Ptr {\n\t\t\tnestedMessage = true // map with message values\n\t\t}\n\t}\n\n\tif !canHaveDefault {\n\t\tif nestedMessage {\n\t\t\treturn nil, true, nil\n\t\t}\n\t\treturn nil, false, nil\n\t}\n\n\t// We now know that ft is a pointer or slice.\n\tsf = &scalarField{kind: ft.Elem().Kind()}\n\n\t// scalar fields without defaults\n\tif !prop.HasDefault {\n\t\treturn sf, false, nil\n\t}\n\n\t// a scalar field: either *T or []byte\n\tswitch ft.Elem().Kind() {\n\tcase reflect.Bool:\n\t\tx, err := strconv.ParseBool(prop.Default)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default bool %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = x\n\tcase reflect.Float32:\n\t\tx, err := strconv.ParseFloat(prop.Default, 32)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default float32 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = float32(x)\n\tcase reflect.Float64:\n\t\tx, err := strconv.ParseFloat(prop.Default, 64)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default float64 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = x\n\tcase reflect.Int32:\n\t\tx, err := strconv.ParseInt(prop.Default, 10, 32)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default int32 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = int32(x)\n\tcase reflect.Int64:\n\t\tx, err := strconv.ParseInt(prop.Default, 10, 64)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default int64 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = x\n\tcase reflect.String:\n\t\tsf.value = prop.Default\n\tcase reflect.Uint8:\n\t\t// []byte (not *uint8)\n\t\tsf.value = []byte(prop.Default)\n\tcase reflect.Uint32:\n\t\tx, err := strconv.ParseUint(prop.Default, 10, 32)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default uint32 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = uint32(x)\n\tcase reflect.Uint64:\n\t\tx, err := strconv.ParseUint(prop.Default, 10, 64)\n\t\tif err != nil {\n\t\t\treturn nil, false, fmt.Errorf(\"proto: bad default uint64 %q: %v\", prop.Default, err)\n\t\t}\n\t\tsf.value = x\n\tdefault:\n\t\treturn nil, false, fmt.Errorf(\"proto: unhandled def kind %v\", ft.Elem().Kind())\n\t}\n\n\treturn sf, false, nil\n}\n\n// mapKeys returns a sort.Interface to be used for sorting the map keys.\n// Map fields may have key types of non-float scalars, strings and enums.\nfunc mapKeys(vs []reflect.Value) sort.Interface {\n\ts := mapKeySorter{vs: vs}\n\n\t// Type specialization per https://developers.google.com/protocol-buffers/docs/proto#maps.\n\tif len(vs) == 0 {\n\t\treturn s\n\t}\n\tswitch vs[0].Kind() {\n\tcase reflect.Int32, reflect.Int64:\n\t\ts.less = func(a, b reflect.Value) bool { return a.Int() < b.Int() }\n\tcase reflect.Uint32, reflect.Uint64:\n\t\ts.less = func(a, b reflect.Value) bool { return a.Uint() < b.Uint() }\n\tcase reflect.Bool:\n\t\ts.less = func(a, b reflect.Value) bool { return !a.Bool() && b.Bool() } // false < true\n\tcase reflect.String:\n\t\ts.less = func(a, b reflect.Value) bool { return a.String() < b.String() }\n\tdefault:\n\t\tpanic(fmt.Sprintf(\"unsupported map key type: %v\", vs[0].Kind()))\n\t}\n\n\treturn s\n}\n\ntype mapKeySorter struct {\n\tvs []reflect.Value\n\tless func(a, b reflect.Value) bool\n}\n\nfunc (s mapKeySorter) Len() int { return len(s.vs) }\nfunc (s mapKeySorter) Swap(i, j int) { s.vs[i], s.vs[j] = s.vs[j], s.vs[i] }\nfunc (s mapKeySorter) Less(i, j int) bool {\n\treturn s.less(s.vs[i], s.vs[j])\n}\n\n// isProto3Zero reports whether v is a zero proto3 value.\nfunc isProto3Zero(v reflect.Value) bool {\n\tswitch v.Kind() {\n\tcase reflect.Bool:\n\t\treturn !v.Bool()\n\tcase reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Uint32, reflect.Uint64:\n\t\treturn v.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.String:\n\t\treturn v.String() == \"\"\n\t}\n\treturn false\n}\n\nconst (\n\t// ProtoPackageIsVersion3 is referenced from generated protocol buffer files\n\t// to assert that that code is compatible with this version of the proto package.\n\tProtoPackageIsVersion3 = true\n\n\t// ProtoPackageIsVersion2 is referenced from generated protocol buffer files\n\t// to assert that that code is compatible with this version of the proto package.\n\tProtoPackageIsVersion2 = true\n\n\t// ProtoPackageIsVersion1 is referenced from generated protocol buffer files\n\t// to assert that that code is compatible with this version of the proto package.\n\tProtoPackageIsVersion1 = true\n)\n\n// InternalMessageInfo is a type used internally by generated .pb.go files.\n// This type is not intended to be used by non-generated code.\n// This type is not subject to any compatibility guarantee.\ntype InternalMessageInfo struct {\n\tmarshal *marshalInfo\n\tunmarshal *unmarshalInfo\n\tmerge *mergeInfo\n\tdiscard *discardInfo\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/message_set.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n/*\n * Support for message sets.\n */\n\nimport (\n\t\"errors\"\n)\n\n// errNoMessageTypeID occurs when a protocol buffer does not have a message type ID.\n// A message type ID is required for storing a protocol buffer in a message set.\nvar errNoMessageTypeID = errors.New(\"proto does not have a message type ID\")\n\n// The first two types (_MessageSet_Item and messageSet)\n// model what the protocol compiler produces for the following protocol message:\n// message MessageSet {\n// repeated group Item = 1 {\n// required int32 type_id = 2;\n// required string message = 3;\n// };\n// }\n// That is the MessageSet wire format. We can't use a proto to generate these\n// because that would introduce a circular dependency between it and this package.\n\ntype _MessageSet_Item struct {\n\tTypeId *int32 `protobuf:\"varint,2,req,name=type_id\"`\n\tMessage []byte `protobuf:\"bytes,3,req,name=message\"`\n}\n\ntype messageSet struct {\n\tItem []*_MessageSet_Item `protobuf:\"group,1,rep\"`\n\tXXX_unrecognized []byte\n\t// TODO: caching?\n}\n\n// Make sure messageSet is a Message.\nvar _ Message = (*messageSet)(nil)\n\n// messageTypeIder is an interface satisfied by a protocol buffer type\n// that may be stored in a MessageSet.\ntype messageTypeIder interface {\n\tMessageTypeId() int32\n}\n\nfunc (ms *messageSet) find(pb Message) *_MessageSet_Item {\n\tmti, ok := pb.(messageTypeIder)\n\tif !ok {\n\t\treturn nil\n\t}\n\tid := mti.MessageTypeId()\n\tfor _, item := range ms.Item {\n\t\tif *item.TypeId == id {\n\t\t\treturn item\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (ms *messageSet) Has(pb Message) bool {\n\treturn ms.find(pb) != nil\n}\n\nfunc (ms *messageSet) Unmarshal(pb Message) error {\n\tif item := ms.find(pb); item != nil {\n\t\treturn Unmarshal(item.Message, pb)\n\t}\n\tif _, ok := pb.(messageTypeIder); !ok {\n\t\treturn errNoMessageTypeID\n\t}\n\treturn nil // TODO: return error instead?\n}\n\nfunc (ms *messageSet) Marshal(pb Message) error {\n\tmsg, err := Marshal(pb)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif item := ms.find(pb); item != nil {\n\t\t// reuse existing item\n\t\titem.Message = msg\n\t\treturn nil\n\t}\n\n\tmti, ok := pb.(messageTypeIder)\n\tif !ok {\n\t\treturn errNoMessageTypeID\n\t}\n\n\tmtid := mti.MessageTypeId()\n\tms.Item = append(ms.Item, &_MessageSet_Item{\n\t\tTypeId: &mtid,\n\t\tMessage: msg,\n\t})\n\treturn nil\n}\n\nfunc (ms *messageSet) Reset() { *ms = messageSet{} }\nfunc (ms *messageSet) String() string { return CompactTextString(ms) }\nfunc (*messageSet) ProtoMessage() {}\n\n// Support for the message_set_wire_format message option.\n\nfunc skipVarint(buf []byte) []byte {\n\ti := 0\n\tfor ; buf[i]&0x80 != 0; i++ {\n\t}\n\treturn buf[i+1:]\n}\n\n// unmarshalMessageSet decodes the extension map encoded in buf in the message set wire format.\n// It is called by Unmarshal methods on protocol buffer messages with the message_set_wire_format option.\nfunc unmarshalMessageSet(buf []byte, exts interface{}) error {\n\tvar m map[int32]Extension\n\tswitch exts := exts.(type) {\n\tcase *XXX_InternalExtensions:\n\t\tm = exts.extensionsWrite()\n\tcase map[int32]Extension:\n\t\tm = exts\n\tdefault:\n\t\treturn errors.New(\"proto: not an extension map\")\n\t}\n\n\tms := new(messageSet)\n\tif err := Unmarshal(buf, ms); err != nil {\n\t\treturn err\n\t}\n\tfor _, item := range ms.Item {\n\t\tid := *item.TypeId\n\t\tmsg := item.Message\n\n\t\t// Restore wire type and field number varint, plus length varint.\n\t\t// Be careful to preserve duplicate items.\n\t\tb := EncodeVarint(uint64(id)<<3 | WireBytes)\n\t\tif ext, ok := m[id]; ok {\n\t\t\t// Existing data; rip off the tag and length varint\n\t\t\t// so we join the new data correctly.\n\t\t\t// We can assume that ext.enc is set because we are unmarshaling.\n\t\t\to := ext.enc[len(b):] // skip wire type and field number\n\t\t\t_, n := DecodeVarint(o) // calculate length of length varint\n\t\t\to = o[n:] // skip length varint\n\t\t\tmsg = append(o, msg...) // join old data and new data\n\t\t}\n\t\tb = append(b, EncodeVarint(uint64(len(msg)))...)\n\t\tb = append(b, msg...)\n\n\t\tm[id] = Extension{enc: b}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/pointer_reflect.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2012 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// +build purego appengine js\n\n// This file contains an implementation of proto field accesses using package reflect.\n// It is slower than the code in pointer_unsafe.go but it avoids package unsafe and can\n// be used on App Engine.\n\npackage proto\n\nimport (\n\t\"reflect\"\n\t\"sync\"\n)\n\nconst unsafeAllowed = false\n\n// A field identifies a field in a struct, accessible from a pointer.\n// In this implementation, a field is identified by the sequence of field indices\n// passed to reflect's FieldByIndex.\ntype field []int\n\n// toField returns a field equivalent to the given reflect field.\nfunc toField(f *reflect.StructField) field {\n\treturn f.Index\n}\n\n// invalidField is an invalid field identifier.\nvar invalidField = field(nil)\n\n// zeroField is a noop when calling pointer.offset.\nvar zeroField = field([]int{})\n\n// IsValid reports whether the field identifier is valid.\nfunc (f field) IsValid() bool { return f != nil }\n\n// The pointer type is for the table-driven decoder.\n// The implementation here uses a reflect.Value of pointer type to\n// create a generic pointer. In pointer_unsafe.go we use unsafe\n// instead of reflect to implement the same (but faster) interface.\ntype pointer struct {\n\tv reflect.Value\n}\n\n// toPointer converts an interface of pointer type to a pointer\n// that points to the same target.\nfunc toPointer(i *Message) pointer {\n\treturn pointer{v: reflect.ValueOf(*i)}\n}\n\n// toAddrPointer converts an interface to a pointer that points to\n// the interface data.\nfunc toAddrPointer(i *interface{}, isptr, deref bool) pointer {\n\tv := reflect.ValueOf(*i)\n\tu := reflect.New(v.Type())\n\tu.Elem().Set(v)\n\tif deref {\n\t\tu = u.Elem()\n\t}\n\treturn pointer{v: u}\n}\n\n// valToPointer converts v to a pointer. v must be of pointer type.\nfunc valToPointer(v reflect.Value) pointer {\n\treturn pointer{v: v}\n}\n\n// offset converts from a pointer to a structure to a pointer to\n// one of its fields.\nfunc (p pointer) offset(f field) pointer {\n\treturn pointer{v: p.v.Elem().FieldByIndex(f).Addr()}\n}\n\nfunc (p pointer) isNil() bool {\n\treturn p.v.IsNil()\n}\n\n// grow updates the slice s in place to make it one element longer.\n// s must be addressable.\n// Returns the (addressable) new element.\nfunc grow(s reflect.Value) reflect.Value {\n\tn, m := s.Len(), s.Cap()\n\tif n < m {\n\t\ts.SetLen(n + 1)\n\t} else {\n\t\ts.Set(reflect.Append(s, reflect.Zero(s.Type().Elem())))\n\t}\n\treturn s.Index(n)\n}\n\nfunc (p pointer) toInt64() *int64 {\n\treturn p.v.Interface().(*int64)\n}\nfunc (p pointer) toInt64Ptr() **int64 {\n\treturn p.v.Interface().(**int64)\n}\nfunc (p pointer) toInt64Slice() *[]int64 {\n\treturn p.v.Interface().(*[]int64)\n}\n\nvar int32ptr = reflect.TypeOf((*int32)(nil))\n\nfunc (p pointer) toInt32() *int32 {\n\treturn p.v.Convert(int32ptr).Interface().(*int32)\n}\n\n// The toInt32Ptr/Slice methods don't work because of enums.\n// Instead, we must use set/get methods for the int32ptr/slice case.\n/*\n\tfunc (p pointer) toInt32Ptr() **int32 {\n\t\treturn p.v.Interface().(**int32)\n}\n\tfunc (p pointer) toInt32Slice() *[]int32 {\n\t\treturn p.v.Interface().(*[]int32)\n}\n*/\nfunc (p pointer) getInt32Ptr() *int32 {\n\tif p.v.Type().Elem().Elem() == reflect.TypeOf(int32(0)) {\n\t\t// raw int32 type\n\t\treturn p.v.Elem().Interface().(*int32)\n\t}\n\t// an enum\n\treturn p.v.Elem().Convert(int32PtrType).Interface().(*int32)\n}\nfunc (p pointer) setInt32Ptr(v int32) {\n\t// Allocate value in a *int32. Possibly convert that to a *enum.\n\t// Then assign it to a **int32 or **enum.\n\t// Note: we can convert *int32 to *enum, but we can't convert\n\t// **int32 to **enum!\n\tp.v.Elem().Set(reflect.ValueOf(&v).Convert(p.v.Type().Elem()))\n}\n\n// getInt32Slice copies []int32 from p as a new slice.\n// This behavior differs from the implementation in pointer_unsafe.go.\nfunc (p pointer) getInt32Slice() []int32 {\n\tif p.v.Type().Elem().Elem() == reflect.TypeOf(int32(0)) {\n\t\t// raw int32 type\n\t\treturn p.v.Elem().Interface().([]int32)\n\t}\n\t// an enum\n\t// Allocate a []int32, then assign []enum's values into it.\n\t// Note: we can't convert []enum to []int32.\n\tslice := p.v.Elem()\n\ts := make([]int32, slice.Len())\n\tfor i := 0; i < slice.Len(); i++ {\n\t\ts[i] = int32(slice.Index(i).Int())\n\t}\n\treturn s\n}\n\n// setInt32Slice copies []int32 into p as a new slice.\n// This behavior differs from the implementation in pointer_unsafe.go.\nfunc (p pointer) setInt32Slice(v []int32) {\n\tif p.v.Type().Elem().Elem() == reflect.TypeOf(int32(0)) {\n\t\t// raw int32 type\n\t\tp.v.Elem().Set(reflect.ValueOf(v))\n\t\treturn\n\t}\n\t// an enum\n\t// Allocate a []enum, then assign []int32's values into it.\n\t// Note: we can't convert []enum to []int32.\n\tslice := reflect.MakeSlice(p.v.Type().Elem(), len(v), cap(v))\n\tfor i, x := range v {\n\t\tslice.Index(i).SetInt(int64(x))\n\t}\n\tp.v.Elem().Set(slice)\n}\nfunc (p pointer) appendInt32Slice(v int32) {\n\tgrow(p.v.Elem()).SetInt(int64(v))\n}\n\nfunc (p pointer) toUint64() *uint64 {\n\treturn p.v.Interface().(*uint64)\n}\nfunc (p pointer) toUint64Ptr() **uint64 {\n\treturn p.v.Interface().(**uint64)\n}\nfunc (p pointer) toUint64Slice() *[]uint64 {\n\treturn p.v.Interface().(*[]uint64)\n}\nfunc (p pointer) toUint32() *uint32 {\n\treturn p.v.Interface().(*uint32)\n}\nfunc (p pointer) toUint32Ptr() **uint32 {\n\treturn p.v.Interface().(**uint32)\n}\nfunc (p pointer) toUint32Slice() *[]uint32 {\n\treturn p.v.Interface().(*[]uint32)\n}\nfunc (p pointer) toBool() *bool {\n\treturn p.v.Interface().(*bool)\n}\nfunc (p pointer) toBoolPtr() **bool {\n\treturn p.v.Interface().(**bool)\n}\nfunc (p pointer) toBoolSlice() *[]bool {\n\treturn p.v.Interface().(*[]bool)\n}\nfunc (p pointer) toFloat64() *float64 {\n\treturn p.v.Interface().(*float64)\n}\nfunc (p pointer) toFloat64Ptr() **float64 {\n\treturn p.v.Interface().(**float64)\n}\nfunc (p pointer) toFloat64Slice() *[]float64 {\n\treturn p.v.Interface().(*[]float64)\n}\nfunc (p pointer) toFloat32() *float32 {\n\treturn p.v.Interface().(*float32)\n}\nfunc (p pointer) toFloat32Ptr() **float32 {\n\treturn p.v.Interface().(**float32)\n}\nfunc (p pointer) toFloat32Slice() *[]float32 {\n\treturn p.v.Interface().(*[]float32)\n}\nfunc (p pointer) toString() *string {\n\treturn p.v.Interface().(*string)\n}\nfunc (p pointer) toStringPtr() **string {\n\treturn p.v.Interface().(**string)\n}\nfunc (p pointer) toStringSlice() *[]string {\n\treturn p.v.Interface().(*[]string)\n}\nfunc (p pointer) toBytes() *[]byte {\n\treturn p.v.Interface().(*[]byte)\n}\nfunc (p pointer) toBytesSlice() *[][]byte {\n\treturn p.v.Interface().(*[][]byte)\n}\nfunc (p pointer) toExtensions() *XXX_InternalExtensions {\n\treturn p.v.Interface().(*XXX_InternalExtensions)\n}\nfunc (p pointer) toOldExtensions() *map[int32]Extension {\n\treturn p.v.Interface().(*map[int32]Extension)\n}\nfunc (p pointer) getPointer() pointer {\n\treturn pointer{v: p.v.Elem()}\n}\nfunc (p pointer) setPointer(q pointer) {\n\tp.v.Elem().Set(q.v)\n}\nfunc (p pointer) appendPointer(q pointer) {\n\tgrow(p.v.Elem()).Set(q.v)\n}\n\n// getPointerSlice copies []*T from p as a new []pointer.\n// This behavior differs from the implementation in pointer_unsafe.go.\nfunc (p pointer) getPointerSlice() []pointer {\n\tif p.v.IsNil() {\n\t\treturn nil\n\t}\n\tn := p.v.Elem().Len()\n\ts := make([]pointer, n)\n\tfor i := 0; i < n; i++ {\n\t\ts[i] = pointer{v: p.v.Elem().Index(i)}\n\t}\n\treturn s\n}\n\n// setPointerSlice copies []pointer into p as a new []*T.\n// This behavior differs from the implementation in pointer_unsafe.go.\nfunc (p pointer) setPointerSlice(v []pointer) {\n\tif v == nil {\n\t\tp.v.Elem().Set(reflect.New(p.v.Elem().Type()).Elem())\n\t\treturn\n\t}\n\ts := reflect.MakeSlice(p.v.Elem().Type(), 0, len(v))\n\tfor _, p := range v {\n\t\ts = reflect.Append(s, p.v)\n\t}\n\tp.v.Elem().Set(s)\n}\n\n// getInterfacePointer returns a pointer that points to the\n// interface data of the interface pointed by p.\nfunc (p pointer) getInterfacePointer() pointer {\n\tif p.v.Elem().IsNil() {\n\t\treturn pointer{v: p.v.Elem()}\n\t}\n\treturn pointer{v: p.v.Elem().Elem().Elem().Field(0).Addr()} // *interface -> interface -> *struct -> struct\n}\n\nfunc (p pointer) asPointerTo(t reflect.Type) reflect.Value {\n\t// TODO: check that p.v.Type().Elem() == t?\n\treturn p.v\n}\n\nfunc atomicLoadUnmarshalInfo(p **unmarshalInfo) *unmarshalInfo {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\treturn *p\n}\nfunc atomicStoreUnmarshalInfo(p **unmarshalInfo, v *unmarshalInfo) {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\t*p = v\n}\nfunc atomicLoadMarshalInfo(p **marshalInfo) *marshalInfo {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\treturn *p\n}\nfunc atomicStoreMarshalInfo(p **marshalInfo, v *marshalInfo) {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\t*p = v\n}\nfunc atomicLoadMergeInfo(p **mergeInfo) *mergeInfo {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\treturn *p\n}\nfunc atomicStoreMergeInfo(p **mergeInfo, v *mergeInfo) {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\t*p = v\n}\nfunc atomicLoadDiscardInfo(p **discardInfo) *discardInfo {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\treturn *p\n}\nfunc atomicStoreDiscardInfo(p **discardInfo, v *discardInfo) {\n\tatomicLock.Lock()\n\tdefer atomicLock.Unlock()\n\t*p = v\n}\n\nvar atomicLock sync.Mutex\n" }, { "path": "vendor/github.com/golang/protobuf/proto/pointer_unsafe.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2012 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// +build !purego,!appengine,!js\n\n// This file contains the implementation of the proto field accesses using package unsafe.\n\npackage proto\n\nimport (\n\t\"reflect\"\n\t\"sync/atomic\"\n\t\"unsafe\"\n)\n\nconst unsafeAllowed = true\n\n// A field identifies a field in a struct, accessible from a pointer.\n// In this implementation, a field is identified by its byte offset from the start of the struct.\ntype field uintptr\n\n// toField returns a field equivalent to the given reflect field.\nfunc toField(f *reflect.StructField) field {\n\treturn field(f.Offset)\n}\n\n// invalidField is an invalid field identifier.\nconst invalidField = ^field(0)\n\n// zeroField is a noop when calling pointer.offset.\nconst zeroField = field(0)\n\n// IsValid reports whether the field identifier is valid.\nfunc (f field) IsValid() bool {\n\treturn f != invalidField\n}\n\n// The pointer type below is for the new table-driven encoder/decoder.\n// The implementation here uses unsafe.Pointer to create a generic pointer.\n// In pointer_reflect.go we use reflect instead of unsafe to implement\n// the same (but slower) interface.\ntype pointer struct {\n\tp unsafe.Pointer\n}\n\n// size of pointer\nvar ptrSize = unsafe.Sizeof(uintptr(0))\n\n// toPointer converts an interface of pointer type to a pointer\n// that points to the same target.\nfunc toPointer(i *Message) pointer {\n\t// Super-tricky - read pointer out of data word of interface value.\n\t// Saves ~25ns over the equivalent:\n\t// return valToPointer(reflect.ValueOf(*i))\n\treturn pointer{p: (*[2]unsafe.Pointer)(unsafe.Pointer(i))[1]}\n}\n\n// toAddrPointer converts an interface to a pointer that points to\n// the interface data.\nfunc toAddrPointer(i *interface{}, isptr, deref bool) (p pointer) {\n\t// Super-tricky - read or get the address of data word of interface value.\n\tif isptr {\n\t\t// The interface is of pointer type, thus it is a direct interface.\n\t\t// The data word is the pointer data itself. We take its address.\n\t\tp = pointer{p: unsafe.Pointer(uintptr(unsafe.Pointer(i)) + ptrSize)}\n\t} else {\n\t\t// The interface is not of pointer type. The data word is the pointer\n\t\t// to the data.\n\t\tp = pointer{p: (*[2]unsafe.Pointer)(unsafe.Pointer(i))[1]}\n\t}\n\tif deref {\n\t\tp.p = *(*unsafe.Pointer)(p.p)\n\t}\n\treturn p\n}\n\n// valToPointer converts v to a pointer. v must be of pointer type.\nfunc valToPointer(v reflect.Value) pointer {\n\treturn pointer{p: unsafe.Pointer(v.Pointer())}\n}\n\n// offset converts from a pointer to a structure to a pointer to\n// one of its fields.\nfunc (p pointer) offset(f field) pointer {\n\t// For safety, we should panic if !f.IsValid, however calling panic causes\n\t// this to no longer be inlineable, which is a serious performance cost.\n\t/*\n\t\tif !f.IsValid() {\n\t\t\tpanic(\"invalid field\")\n\t\t}\n\t*/\n\treturn pointer{p: unsafe.Pointer(uintptr(p.p) + uintptr(f))}\n}\n\nfunc (p pointer) isNil() bool {\n\treturn p.p == nil\n}\n\nfunc (p pointer) toInt64() *int64 {\n\treturn (*int64)(p.p)\n}\nfunc (p pointer) toInt64Ptr() **int64 {\n\treturn (**int64)(p.p)\n}\nfunc (p pointer) toInt64Slice() *[]int64 {\n\treturn (*[]int64)(p.p)\n}\nfunc (p pointer) toInt32() *int32 {\n\treturn (*int32)(p.p)\n}\n\n// See pointer_reflect.go for why toInt32Ptr/Slice doesn't exist.\n/*\n\tfunc (p pointer) toInt32Ptr() **int32 {\n\t\treturn (**int32)(p.p)\n\t}\n\tfunc (p pointer) toInt32Slice() *[]int32 {\n\t\treturn (*[]int32)(p.p)\n\t}\n*/\nfunc (p pointer) getInt32Ptr() *int32 {\n\treturn *(**int32)(p.p)\n}\nfunc (p pointer) setInt32Ptr(v int32) {\n\t*(**int32)(p.p) = &v\n}\n\n// getInt32Slice loads a []int32 from p.\n// The value returned is aliased with the original slice.\n// This behavior differs from the implementation in pointer_reflect.go.\nfunc (p pointer) getInt32Slice() []int32 {\n\treturn *(*[]int32)(p.p)\n}\n\n// setInt32Slice stores a []int32 to p.\n// The value set is aliased with the input slice.\n// This behavior differs from the implementation in pointer_reflect.go.\nfunc (p pointer) setInt32Slice(v []int32) {\n\t*(*[]int32)(p.p) = v\n}\n\n// TODO: Can we get rid of appendInt32Slice and use setInt32Slice instead?\nfunc (p pointer) appendInt32Slice(v int32) {\n\ts := (*[]int32)(p.p)\n\t*s = append(*s, v)\n}\n\nfunc (p pointer) toUint64() *uint64 {\n\treturn (*uint64)(p.p)\n}\nfunc (p pointer) toUint64Ptr() **uint64 {\n\treturn (**uint64)(p.p)\n}\nfunc (p pointer) toUint64Slice() *[]uint64 {\n\treturn (*[]uint64)(p.p)\n}\nfunc (p pointer) toUint32() *uint32 {\n\treturn (*uint32)(p.p)\n}\nfunc (p pointer) toUint32Ptr() **uint32 {\n\treturn (**uint32)(p.p)\n}\nfunc (p pointer) toUint32Slice() *[]uint32 {\n\treturn (*[]uint32)(p.p)\n}\nfunc (p pointer) toBool() *bool {\n\treturn (*bool)(p.p)\n}\nfunc (p pointer) toBoolPtr() **bool {\n\treturn (**bool)(p.p)\n}\nfunc (p pointer) toBoolSlice() *[]bool {\n\treturn (*[]bool)(p.p)\n}\nfunc (p pointer) toFloat64() *float64 {\n\treturn (*float64)(p.p)\n}\nfunc (p pointer) toFloat64Ptr() **float64 {\n\treturn (**float64)(p.p)\n}\nfunc (p pointer) toFloat64Slice() *[]float64 {\n\treturn (*[]float64)(p.p)\n}\nfunc (p pointer) toFloat32() *float32 {\n\treturn (*float32)(p.p)\n}\nfunc (p pointer) toFloat32Ptr() **float32 {\n\treturn (**float32)(p.p)\n}\nfunc (p pointer) toFloat32Slice() *[]float32 {\n\treturn (*[]float32)(p.p)\n}\nfunc (p pointer) toString() *string {\n\treturn (*string)(p.p)\n}\nfunc (p pointer) toStringPtr() **string {\n\treturn (**string)(p.p)\n}\nfunc (p pointer) toStringSlice() *[]string {\n\treturn (*[]string)(p.p)\n}\nfunc (p pointer) toBytes() *[]byte {\n\treturn (*[]byte)(p.p)\n}\nfunc (p pointer) toBytesSlice() *[][]byte {\n\treturn (*[][]byte)(p.p)\n}\nfunc (p pointer) toExtensions() *XXX_InternalExtensions {\n\treturn (*XXX_InternalExtensions)(p.p)\n}\nfunc (p pointer) toOldExtensions() *map[int32]Extension {\n\treturn (*map[int32]Extension)(p.p)\n}\n\n// getPointerSlice loads []*T from p as a []pointer.\n// The value returned is aliased with the original slice.\n// This behavior differs from the implementation in pointer_reflect.go.\nfunc (p pointer) getPointerSlice() []pointer {\n\t// Super-tricky - p should point to a []*T where T is a\n\t// message type. We load it as []pointer.\n\treturn *(*[]pointer)(p.p)\n}\n\n// setPointerSlice stores []pointer into p as a []*T.\n// The value set is aliased with the input slice.\n// This behavior differs from the implementation in pointer_reflect.go.\nfunc (p pointer) setPointerSlice(v []pointer) {\n\t// Super-tricky - p should point to a []*T where T is a\n\t// message type. We store it as []pointer.\n\t*(*[]pointer)(p.p) = v\n}\n\n// getPointer loads the pointer at p and returns it.\nfunc (p pointer) getPointer() pointer {\n\treturn pointer{p: *(*unsafe.Pointer)(p.p)}\n}\n\n// setPointer stores the pointer q at p.\nfunc (p pointer) setPointer(q pointer) {\n\t*(*unsafe.Pointer)(p.p) = q.p\n}\n\n// append q to the slice pointed to by p.\nfunc (p pointer) appendPointer(q pointer) {\n\ts := (*[]unsafe.Pointer)(p.p)\n\t*s = append(*s, q.p)\n}\n\n// getInterfacePointer returns a pointer that points to the\n// interface data of the interface pointed by p.\nfunc (p pointer) getInterfacePointer() pointer {\n\t// Super-tricky - read pointer out of data word of interface value.\n\treturn pointer{p: (*(*[2]unsafe.Pointer)(p.p))[1]}\n}\n\n// asPointerTo returns a reflect.Value that is a pointer to an\n// object of type t stored at p.\nfunc (p pointer) asPointerTo(t reflect.Type) reflect.Value {\n\treturn reflect.NewAt(t, p.p)\n}\n\nfunc atomicLoadUnmarshalInfo(p **unmarshalInfo) *unmarshalInfo {\n\treturn (*unmarshalInfo)(atomic.LoadPointer((*unsafe.Pointer)(unsafe.Pointer(p))))\n}\nfunc atomicStoreUnmarshalInfo(p **unmarshalInfo, v *unmarshalInfo) {\n\tatomic.StorePointer((*unsafe.Pointer)(unsafe.Pointer(p)), unsafe.Pointer(v))\n}\nfunc atomicLoadMarshalInfo(p **marshalInfo) *marshalInfo {\n\treturn (*marshalInfo)(atomic.LoadPointer((*unsafe.Pointer)(unsafe.Pointer(p))))\n}\nfunc atomicStoreMarshalInfo(p **marshalInfo, v *marshalInfo) {\n\tatomic.StorePointer((*unsafe.Pointer)(unsafe.Pointer(p)), unsafe.Pointer(v))\n}\nfunc atomicLoadMergeInfo(p **mergeInfo) *mergeInfo {\n\treturn (*mergeInfo)(atomic.LoadPointer((*unsafe.Pointer)(unsafe.Pointer(p))))\n}\nfunc atomicStoreMergeInfo(p **mergeInfo, v *mergeInfo) {\n\tatomic.StorePointer((*unsafe.Pointer)(unsafe.Pointer(p)), unsafe.Pointer(v))\n}\nfunc atomicLoadDiscardInfo(p **discardInfo) *discardInfo {\n\treturn (*discardInfo)(atomic.LoadPointer((*unsafe.Pointer)(unsafe.Pointer(p))))\n}\nfunc atomicStoreDiscardInfo(p **discardInfo, v *discardInfo) {\n\tatomic.StorePointer((*unsafe.Pointer)(unsafe.Pointer(p)), unsafe.Pointer(v))\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/properties.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n/*\n * Routines for encoding data into the wire format for protocol buffers.\n */\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n)\n\nconst debug bool = false\n\n// Constants that identify the encoding of a value on the wire.\nconst (\n\tWireVarint = 0\n\tWireFixed64 = 1\n\tWireBytes = 2\n\tWireStartGroup = 3\n\tWireEndGroup = 4\n\tWireFixed32 = 5\n)\n\n// tagMap is an optimization over map[int]int for typical protocol buffer\n// use-cases. Encoded protocol buffers are often in tag order with small tag\n// numbers.\ntype tagMap struct {\n\tfastTags []int\n\tslowTags map[int]int\n}\n\n// tagMapFastLimit is the upper bound on the tag number that will be stored in\n// the tagMap slice rather than its map.\nconst tagMapFastLimit = 1024\n\nfunc (p *tagMap) get(t int) (int, bool) {\n\tif t > 0 && t < tagMapFastLimit {\n\t\tif t >= len(p.fastTags) {\n\t\t\treturn 0, false\n\t\t}\n\t\tfi := p.fastTags[t]\n\t\treturn fi, fi >= 0\n\t}\n\tfi, ok := p.slowTags[t]\n\treturn fi, ok\n}\n\nfunc (p *tagMap) put(t int, fi int) {\n\tif t > 0 && t < tagMapFastLimit {\n\t\tfor len(p.fastTags) < t+1 {\n\t\t\tp.fastTags = append(p.fastTags, -1)\n\t\t}\n\t\tp.fastTags[t] = fi\n\t\treturn\n\t}\n\tif p.slowTags == nil {\n\t\tp.slowTags = make(map[int]int)\n\t}\n\tp.slowTags[t] = fi\n}\n\n// StructProperties represents properties for all the fields of a struct.\n// decoderTags and decoderOrigNames should only be used by the decoder.\ntype StructProperties struct {\n\tProp []*Properties // properties for each field\n\treqCount int // required count\n\tdecoderTags tagMap // map from proto tag to struct field number\n\tdecoderOrigNames map[string]int // map from original name to struct field number\n\torder []int // list of struct field numbers in tag order\n\n\t// OneofTypes contains information about the oneof fields in this message.\n\t// It is keyed by the original name of a field.\n\tOneofTypes map[string]*OneofProperties\n}\n\n// OneofProperties represents information about a specific field in a oneof.\ntype OneofProperties struct {\n\tType reflect.Type // pointer to generated struct type for this oneof field\n\tField int // struct field number of the containing oneof in the message\n\tProp *Properties\n}\n\n// Implement the sorting interface so we can sort the fields in tag order, as recommended by the spec.\n// See encode.go, (*Buffer).enc_struct.\n\nfunc (sp *StructProperties) Len() int { return len(sp.order) }\nfunc (sp *StructProperties) Less(i, j int) bool {\n\treturn sp.Prop[sp.order[i]].Tag < sp.Prop[sp.order[j]].Tag\n}\nfunc (sp *StructProperties) Swap(i, j int) { sp.order[i], sp.order[j] = sp.order[j], sp.order[i] }\n\n// Properties represents the protocol-specific behavior of a single struct field.\ntype Properties struct {\n\tName string // name of the field, for error messages\n\tOrigName string // original name before protocol compiler (always set)\n\tJSONName string // name to use for JSON; determined by protoc\n\tWire string\n\tWireType int\n\tTag int\n\tRequired bool\n\tOptional bool\n\tRepeated bool\n\tPacked bool // relevant for repeated primitives only\n\tEnum string // set for enum types only\n\tproto3 bool // whether this is known to be a proto3 field\n\toneof bool // whether this is a oneof field\n\n\tDefault string // default value\n\tHasDefault bool // whether an explicit default was provided\n\n\tstype reflect.Type // set for struct types only\n\tsprop *StructProperties // set for struct types only\n\n\tmtype reflect.Type // set for map types only\n\tMapKeyProp *Properties // set for map types only\n\tMapValProp *Properties // set for map types only\n}\n\n// String formats the properties in the protobuf struct field tag style.\nfunc (p *Properties) String() string {\n\ts := p.Wire\n\ts += \",\"\n\ts += strconv.Itoa(p.Tag)\n\tif p.Required {\n\t\ts += \",req\"\n\t}\n\tif p.Optional {\n\t\ts += \",opt\"\n\t}\n\tif p.Repeated {\n\t\ts += \",rep\"\n\t}\n\tif p.Packed {\n\t\ts += \",packed\"\n\t}\n\ts += \",name=\" + p.OrigName\n\tif p.JSONName != p.OrigName {\n\t\ts += \",json=\" + p.JSONName\n\t}\n\tif p.proto3 {\n\t\ts += \",proto3\"\n\t}\n\tif p.oneof {\n\t\ts += \",oneof\"\n\t}\n\tif len(p.Enum) > 0 {\n\t\ts += \",enum=\" + p.Enum\n\t}\n\tif p.HasDefault {\n\t\ts += \",def=\" + p.Default\n\t}\n\treturn s\n}\n\n// Parse populates p by parsing a string in the protobuf struct field tag style.\nfunc (p *Properties) Parse(s string) {\n\t// \"bytes,49,opt,name=foo,def=hello!\"\n\tfields := strings.Split(s, \",\") // breaks def=, but handled below.\n\tif len(fields) < 2 {\n\t\tfmt.Fprintf(os.Stderr, \"proto: tag has too few fields: %q\\n\", s)\n\t\treturn\n\t}\n\n\tp.Wire = fields[0]\n\tswitch p.Wire {\n\tcase \"varint\":\n\t\tp.WireType = WireVarint\n\tcase \"fixed32\":\n\t\tp.WireType = WireFixed32\n\tcase \"fixed64\":\n\t\tp.WireType = WireFixed64\n\tcase \"zigzag32\":\n\t\tp.WireType = WireVarint\n\tcase \"zigzag64\":\n\t\tp.WireType = WireVarint\n\tcase \"bytes\", \"group\":\n\t\tp.WireType = WireBytes\n\t\t// no numeric converter for non-numeric types\n\tdefault:\n\t\tfmt.Fprintf(os.Stderr, \"proto: tag has unknown wire type: %q\\n\", s)\n\t\treturn\n\t}\n\n\tvar err error\n\tp.Tag, err = strconv.Atoi(fields[1])\n\tif err != nil {\n\t\treturn\n\t}\n\nouter:\n\tfor i := 2; i < len(fields); i++ {\n\t\tf := fields[i]\n\t\tswitch {\n\t\tcase f == \"req\":\n\t\t\tp.Required = true\n\t\tcase f == \"opt\":\n\t\t\tp.Optional = true\n\t\tcase f == \"rep\":\n\t\t\tp.Repeated = true\n\t\tcase f == \"packed\":\n\t\t\tp.Packed = true\n\t\tcase strings.HasPrefix(f, \"name=\"):\n\t\t\tp.OrigName = f[5:]\n\t\tcase strings.HasPrefix(f, \"json=\"):\n\t\t\tp.JSONName = f[5:]\n\t\tcase strings.HasPrefix(f, \"enum=\"):\n\t\t\tp.Enum = f[5:]\n\t\tcase f == \"proto3\":\n\t\t\tp.proto3 = true\n\t\tcase f == \"oneof\":\n\t\t\tp.oneof = true\n\t\tcase strings.HasPrefix(f, \"def=\"):\n\t\t\tp.HasDefault = true\n\t\t\tp.Default = f[4:] // rest of string\n\t\t\tif i+1 < len(fields) {\n\t\t\t\t// Commas aren't escaped, and def is always last.\n\t\t\t\tp.Default += \",\" + strings.Join(fields[i+1:], \",\")\n\t\t\t\tbreak outer\n\t\t\t}\n\t\t}\n\t}\n}\n\nvar protoMessageType = reflect.TypeOf((*Message)(nil)).Elem()\n\n// setFieldProps initializes the field properties for submessages and maps.\nfunc (p *Properties) setFieldProps(typ reflect.Type, f *reflect.StructField, lockGetProp bool) {\n\tswitch t1 := typ; t1.Kind() {\n\tcase reflect.Ptr:\n\t\tif t1.Elem().Kind() == reflect.Struct {\n\t\t\tp.stype = t1.Elem()\n\t\t}\n\n\tcase reflect.Slice:\n\t\tif t2 := t1.Elem(); t2.Kind() == reflect.Ptr && t2.Elem().Kind() == reflect.Struct {\n\t\t\tp.stype = t2.Elem()\n\t\t}\n\n\tcase reflect.Map:\n\t\tp.mtype = t1\n\t\tp.MapKeyProp = &Properties{}\n\t\tp.MapKeyProp.init(reflect.PtrTo(p.mtype.Key()), \"Key\", f.Tag.Get(\"protobuf_key\"), nil, lockGetProp)\n\t\tp.MapValProp = &Properties{}\n\t\tvtype := p.mtype.Elem()\n\t\tif vtype.Kind() != reflect.Ptr && vtype.Kind() != reflect.Slice {\n\t\t\t// The value type is not a message (*T) or bytes ([]byte),\n\t\t\t// so we need encoders for the pointer to this type.\n\t\t\tvtype = reflect.PtrTo(vtype)\n\t\t}\n\t\tp.MapValProp.init(vtype, \"Value\", f.Tag.Get(\"protobuf_val\"), nil, lockGetProp)\n\t}\n\n\tif p.stype != nil {\n\t\tif lockGetProp {\n\t\t\tp.sprop = GetProperties(p.stype)\n\t\t} else {\n\t\t\tp.sprop = getPropertiesLocked(p.stype)\n\t\t}\n\t}\n}\n\nvar (\n\tmarshalerType = reflect.TypeOf((*Marshaler)(nil)).Elem()\n)\n\n// Init populates the properties from a protocol buffer struct tag.\nfunc (p *Properties) Init(typ reflect.Type, name, tag string, f *reflect.StructField) {\n\tp.init(typ, name, tag, f, true)\n}\n\nfunc (p *Properties) init(typ reflect.Type, name, tag string, f *reflect.StructField, lockGetProp bool) {\n\t// \"bytes,49,opt,def=hello!\"\n\tp.Name = name\n\tp.OrigName = name\n\tif tag == \"\" {\n\t\treturn\n\t}\n\tp.Parse(tag)\n\tp.setFieldProps(typ, f, lockGetProp)\n}\n\nvar (\n\tpropertiesMu sync.RWMutex\n\tpropertiesMap = make(map[reflect.Type]*StructProperties)\n)\n\n// GetProperties returns the list of properties for the type represented by t.\n// t must represent a generated struct type of a protocol message.\nfunc GetProperties(t reflect.Type) *StructProperties {\n\tif t.Kind() != reflect.Struct {\n\t\tpanic(\"proto: type must have kind struct\")\n\t}\n\n\t// Most calls to GetProperties in a long-running program will be\n\t// retrieving details for types we have seen before.\n\tpropertiesMu.RLock()\n\tsprop, ok := propertiesMap[t]\n\tpropertiesMu.RUnlock()\n\tif ok {\n\t\treturn sprop\n\t}\n\n\tpropertiesMu.Lock()\n\tsprop = getPropertiesLocked(t)\n\tpropertiesMu.Unlock()\n\treturn sprop\n}\n\ntype (\n\toneofFuncsIface interface {\n\t\tXXX_OneofFuncs() (func(Message, *Buffer) error, func(Message, int, int, *Buffer) (bool, error), func(Message) int, []interface{})\n\t}\n\toneofWrappersIface interface {\n\t\tXXX_OneofWrappers() []interface{}\n\t}\n)\n\n// getPropertiesLocked requires that propertiesMu is held.\nfunc getPropertiesLocked(t reflect.Type) *StructProperties {\n\tif prop, ok := propertiesMap[t]; ok {\n\t\treturn prop\n\t}\n\n\tprop := new(StructProperties)\n\t// in case of recursive protos, fill this in now.\n\tpropertiesMap[t] = prop\n\n\t// build properties\n\tprop.Prop = make([]*Properties, t.NumField())\n\tprop.order = make([]int, t.NumField())\n\n\tfor i := 0; i < t.NumField(); i++ {\n\t\tf := t.Field(i)\n\t\tp := new(Properties)\n\t\tname := f.Name\n\t\tp.init(f.Type, name, f.Tag.Get(\"protobuf\"), &f, false)\n\n\t\toneof := f.Tag.Get(\"protobuf_oneof\") // special case\n\t\tif oneof != \"\" {\n\t\t\t// Oneof fields don't use the traditional protobuf tag.\n\t\t\tp.OrigName = oneof\n\t\t}\n\t\tprop.Prop[i] = p\n\t\tprop.order[i] = i\n\t\tif debug {\n\t\t\tprint(i, \" \", f.Name, \" \", t.String(), \" \")\n\t\t\tif p.Tag > 0 {\n\t\t\t\tprint(p.String())\n\t\t\t}\n\t\t\tprint(\"\\n\")\n\t\t}\n\t}\n\n\t// Re-order prop.order.\n\tsort.Sort(prop)\n\n\tvar oots []interface{}\n\tswitch m := reflect.Zero(reflect.PtrTo(t)).Interface().(type) {\n\tcase oneofFuncsIface:\n\t\t_, _, _, oots = m.XXX_OneofFuncs()\n\tcase oneofWrappersIface:\n\t\toots = m.XXX_OneofWrappers()\n\t}\n\tif len(oots) > 0 {\n\t\t// Interpret oneof metadata.\n\t\tprop.OneofTypes = make(map[string]*OneofProperties)\n\t\tfor _, oot := range oots {\n\t\t\toop := &OneofProperties{\n\t\t\t\tType: reflect.ValueOf(oot).Type(), // *T\n\t\t\t\tProp: new(Properties),\n\t\t\t}\n\t\t\tsft := oop.Type.Elem().Field(0)\n\t\t\toop.Prop.Name = sft.Name\n\t\t\toop.Prop.Parse(sft.Tag.Get(\"protobuf\"))\n\t\t\t// There will be exactly one interface field that\n\t\t\t// this new value is assignable to.\n\t\t\tfor i := 0; i < t.NumField(); i++ {\n\t\t\t\tf := t.Field(i)\n\t\t\t\tif f.Type.Kind() != reflect.Interface {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif !oop.Type.AssignableTo(f.Type) {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\toop.Field = i\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tprop.OneofTypes[oop.Prop.OrigName] = oop\n\t\t}\n\t}\n\n\t// build required counts\n\t// build tags\n\treqCount := 0\n\tprop.decoderOrigNames = make(map[string]int)\n\tfor i, p := range prop.Prop {\n\t\tif strings.HasPrefix(p.Name, \"XXX_\") {\n\t\t\t// Internal fields should not appear in tags/origNames maps.\n\t\t\t// They are handled specially when encoding and decoding.\n\t\t\tcontinue\n\t\t}\n\t\tif p.Required {\n\t\t\treqCount++\n\t\t}\n\t\tprop.decoderTags.put(p.Tag, i)\n\t\tprop.decoderOrigNames[p.OrigName] = i\n\t}\n\tprop.reqCount = reqCount\n\n\treturn prop\n}\n\n// A global registry of enum types.\n// The generated code will register the generated maps by calling RegisterEnum.\n\nvar enumValueMaps = make(map[string]map[string]int32)\n\n// RegisterEnum is called from the generated code to install the enum descriptor\n// maps into the global table to aid parsing text format protocol buffers.\nfunc RegisterEnum(typeName string, unusedNameMap map[int32]string, valueMap map[string]int32) {\n\tif _, ok := enumValueMaps[typeName]; ok {\n\t\tpanic(\"proto: duplicate enum registered: \" + typeName)\n\t}\n\tenumValueMaps[typeName] = valueMap\n}\n\n// EnumValueMap returns the mapping from names to integers of the\n// enum type enumType, or a nil if not found.\nfunc EnumValueMap(enumType string) map[string]int32 {\n\treturn enumValueMaps[enumType]\n}\n\n// A registry of all linked message types.\n// The string is a fully-qualified proto name (\"pkg.Message\").\nvar (\n\tprotoTypedNils = make(map[string]Message) // a map from proto names to typed nil pointers\n\tprotoMapTypes = make(map[string]reflect.Type) // a map from proto names to map types\n\trevProtoTypes = make(map[reflect.Type]string)\n)\n\n// RegisterType is called from generated code and maps from the fully qualified\n// proto name to the type (pointer to struct) of the protocol buffer.\nfunc RegisterType(x Message, name string) {\n\tif _, ok := protoTypedNils[name]; ok {\n\t\t// TODO: Some day, make this a panic.\n\t\tlog.Printf(\"proto: duplicate proto type registered: %s\", name)\n\t\treturn\n\t}\n\tt := reflect.TypeOf(x)\n\tif v := reflect.ValueOf(x); v.Kind() == reflect.Ptr && v.Pointer() == 0 {\n\t\t// Generated code always calls RegisterType with nil x.\n\t\t// This check is just for extra safety.\n\t\tprotoTypedNils[name] = x\n\t} else {\n\t\tprotoTypedNils[name] = reflect.Zero(t).Interface().(Message)\n\t}\n\trevProtoTypes[t] = name\n}\n\n// RegisterMapType is called from generated code and maps from the fully qualified\n// proto name to the native map type of the proto map definition.\nfunc RegisterMapType(x interface{}, name string) {\n\tif reflect.TypeOf(x).Kind() != reflect.Map {\n\t\tpanic(fmt.Sprintf(\"RegisterMapType(%T, %q); want map\", x, name))\n\t}\n\tif _, ok := protoMapTypes[name]; ok {\n\t\tlog.Printf(\"proto: duplicate proto type registered: %s\", name)\n\t\treturn\n\t}\n\tt := reflect.TypeOf(x)\n\tprotoMapTypes[name] = t\n\trevProtoTypes[t] = name\n}\n\n// MessageName returns the fully-qualified proto name for the given message type.\nfunc MessageName(x Message) string {\n\ttype xname interface {\n\t\tXXX_MessageName() string\n\t}\n\tif m, ok := x.(xname); ok {\n\t\treturn m.XXX_MessageName()\n\t}\n\treturn revProtoTypes[reflect.TypeOf(x)]\n}\n\n// MessageType returns the message type (pointer to struct) for a named message.\n// The type is not guaranteed to implement proto.Message if the name refers to a\n// map entry.\nfunc MessageType(name string) reflect.Type {\n\tif t, ok := protoTypedNils[name]; ok {\n\t\treturn reflect.TypeOf(t)\n\t}\n\treturn protoMapTypes[name]\n}\n\n// A registry of all linked proto files.\nvar (\n\tprotoFiles = make(map[string][]byte) // file name => fileDescriptor\n)\n\n// RegisterFile is called from generated code and maps from the\n// full file name of a .proto file to its compressed FileDescriptorProto.\nfunc RegisterFile(filename string, fileDescriptor []byte) {\n\tprotoFiles[filename] = fileDescriptor\n}\n\n// FileDescriptor returns the compressed FileDescriptorProto for a .proto file.\nfunc FileDescriptor(filename string) []byte { return protoFiles[filename] }\n" }, { "path": "vendor/github.com/golang/protobuf/proto/table_marshal.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2016 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"math\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"unicode/utf8\"\n)\n\n// a sizer takes a pointer to a field and the size of its tag, computes the size of\n// the encoded data.\ntype sizer func(pointer, int) int\n\n// a marshaler takes a byte slice, a pointer to a field, and its tag (in wire format),\n// marshals the field to the end of the slice, returns the slice and error (if any).\ntype marshaler func(b []byte, ptr pointer, wiretag uint64, deterministic bool) ([]byte, error)\n\n// marshalInfo is the information used for marshaling a message.\ntype marshalInfo struct {\n\ttyp reflect.Type\n\tfields []*marshalFieldInfo\n\tunrecognized field // offset of XXX_unrecognized\n\textensions field // offset of XXX_InternalExtensions\n\tv1extensions field // offset of XXX_extensions\n\tsizecache field // offset of XXX_sizecache\n\tinitialized int32 // 0 -- only typ is set, 1 -- fully initialized\n\tmessageset bool // uses message set wire format\n\thasmarshaler bool // has custom marshaler\n\tsync.RWMutex // protect extElems map, also for initialization\n\textElems map[int32]*marshalElemInfo // info of extension elements\n}\n\n// marshalFieldInfo is the information used for marshaling a field of a message.\ntype marshalFieldInfo struct {\n\tfield field\n\twiretag uint64 // tag in wire format\n\ttagsize int // size of tag in wire format\n\tsizer sizer\n\tmarshaler marshaler\n\tisPointer bool\n\trequired bool // field is required\n\tname string // name of the field, for error reporting\n\toneofElems map[reflect.Type]*marshalElemInfo // info of oneof elements\n}\n\n// marshalElemInfo is the information used for marshaling an extension or oneof element.\ntype marshalElemInfo struct {\n\twiretag uint64 // tag in wire format\n\ttagsize int // size of tag in wire format\n\tsizer sizer\n\tmarshaler marshaler\n\tisptr bool // elem is pointer typed, thus interface of this type is a direct interface (extension only)\n\tderef bool // dereference the pointer before operating on it; implies isptr\n}\n\nvar (\n\tmarshalInfoMap = map[reflect.Type]*marshalInfo{}\n\tmarshalInfoLock sync.Mutex\n)\n\n// getMarshalInfo returns the information to marshal a given type of message.\n// The info it returns may not necessarily initialized.\n// t is the type of the message (NOT the pointer to it).\nfunc getMarshalInfo(t reflect.Type) *marshalInfo {\n\tmarshalInfoLock.Lock()\n\tu, ok := marshalInfoMap[t]\n\tif !ok {\n\t\tu = &marshalInfo{typ: t}\n\t\tmarshalInfoMap[t] = u\n\t}\n\tmarshalInfoLock.Unlock()\n\treturn u\n}\n\n// Size is the entry point from generated code,\n// and should be ONLY called by generated code.\n// It computes the size of encoded data of msg.\n// a is a pointer to a place to store cached marshal info.\nfunc (a *InternalMessageInfo) Size(msg Message) int {\n\tu := getMessageMarshalInfo(msg, a)\n\tptr := toPointer(&msg)\n\tif ptr.isNil() {\n\t\t// We get here if msg is a typed nil ((*SomeMessage)(nil)),\n\t\t// so it satisfies the interface, and msg == nil wouldn't\n\t\t// catch it. We don't want crash in this case.\n\t\treturn 0\n\t}\n\treturn u.size(ptr)\n}\n\n// Marshal is the entry point from generated code,\n// and should be ONLY called by generated code.\n// It marshals msg to the end of b.\n// a is a pointer to a place to store cached marshal info.\nfunc (a *InternalMessageInfo) Marshal(b []byte, msg Message, deterministic bool) ([]byte, error) {\n\tu := getMessageMarshalInfo(msg, a)\n\tptr := toPointer(&msg)\n\tif ptr.isNil() {\n\t\t// We get here if msg is a typed nil ((*SomeMessage)(nil)),\n\t\t// so it satisfies the interface, and msg == nil wouldn't\n\t\t// catch it. We don't want crash in this case.\n\t\treturn b, ErrNil\n\t}\n\treturn u.marshal(b, ptr, deterministic)\n}\n\nfunc getMessageMarshalInfo(msg interface{}, a *InternalMessageInfo) *marshalInfo {\n\t// u := a.marshal, but atomically.\n\t// We use an atomic here to ensure memory consistency.\n\tu := atomicLoadMarshalInfo(&a.marshal)\n\tif u == nil {\n\t\t// Get marshal information from type of message.\n\t\tt := reflect.ValueOf(msg).Type()\n\t\tif t.Kind() != reflect.Ptr {\n\t\t\tpanic(fmt.Sprintf(\"cannot handle non-pointer message type %v\", t))\n\t\t}\n\t\tu = getMarshalInfo(t.Elem())\n\t\t// Store it in the cache for later users.\n\t\t// a.marshal = u, but atomically.\n\t\tatomicStoreMarshalInfo(&a.marshal, u)\n\t}\n\treturn u\n}\n\n// size is the main function to compute the size of the encoded data of a message.\n// ptr is the pointer to the message.\nfunc (u *marshalInfo) size(ptr pointer) int {\n\tif atomic.LoadInt32(&u.initialized) == 0 {\n\t\tu.computeMarshalInfo()\n\t}\n\n\t// If the message can marshal itself, let it do it, for compatibility.\n\t// NOTE: This is not efficient.\n\tif u.hasmarshaler {\n\t\tm := ptr.asPointerTo(u.typ).Interface().(Marshaler)\n\t\tb, _ := m.Marshal()\n\t\treturn len(b)\n\t}\n\n\tn := 0\n\tfor _, f := range u.fields {\n\t\tif f.isPointer && ptr.offset(f.field).getPointer().isNil() {\n\t\t\t// nil pointer always marshals to nothing\n\t\t\tcontinue\n\t\t}\n\t\tn += f.sizer(ptr.offset(f.field), f.tagsize)\n\t}\n\tif u.extensions.IsValid() {\n\t\te := ptr.offset(u.extensions).toExtensions()\n\t\tif u.messageset {\n\t\t\tn += u.sizeMessageSet(e)\n\t\t} else {\n\t\t\tn += u.sizeExtensions(e)\n\t\t}\n\t}\n\tif u.v1extensions.IsValid() {\n\t\tm := *ptr.offset(u.v1extensions).toOldExtensions()\n\t\tn += u.sizeV1Extensions(m)\n\t}\n\tif u.unrecognized.IsValid() {\n\t\ts := *ptr.offset(u.unrecognized).toBytes()\n\t\tn += len(s)\n\t}\n\t// cache the result for use in marshal\n\tif u.sizecache.IsValid() {\n\t\tatomic.StoreInt32(ptr.offset(u.sizecache).toInt32(), int32(n))\n\t}\n\treturn n\n}\n\n// cachedsize gets the size from cache. If there is no cache (i.e. message is not generated),\n// fall back to compute the size.\nfunc (u *marshalInfo) cachedsize(ptr pointer) int {\n\tif u.sizecache.IsValid() {\n\t\treturn int(atomic.LoadInt32(ptr.offset(u.sizecache).toInt32()))\n\t}\n\treturn u.size(ptr)\n}\n\n// marshal is the main function to marshal a message. It takes a byte slice and appends\n// the encoded data to the end of the slice, returns the slice and error (if any).\n// ptr is the pointer to the message.\n// If deterministic is true, map is marshaled in deterministic order.\nfunc (u *marshalInfo) marshal(b []byte, ptr pointer, deterministic bool) ([]byte, error) {\n\tif atomic.LoadInt32(&u.initialized) == 0 {\n\t\tu.computeMarshalInfo()\n\t}\n\n\t// If the message can marshal itself, let it do it, for compatibility.\n\t// NOTE: This is not efficient.\n\tif u.hasmarshaler {\n\t\tm := ptr.asPointerTo(u.typ).Interface().(Marshaler)\n\t\tb1, err := m.Marshal()\n\t\tb = append(b, b1...)\n\t\treturn b, err\n\t}\n\n\tvar err, errLater error\n\t// The old marshaler encodes extensions at beginning.\n\tif u.extensions.IsValid() {\n\t\te := ptr.offset(u.extensions).toExtensions()\n\t\tif u.messageset {\n\t\t\tb, err = u.appendMessageSet(b, e, deterministic)\n\t\t} else {\n\t\t\tb, err = u.appendExtensions(b, e, deterministic)\n\t\t}\n\t\tif err != nil {\n\t\t\treturn b, err\n\t\t}\n\t}\n\tif u.v1extensions.IsValid() {\n\t\tm := *ptr.offset(u.v1extensions).toOldExtensions()\n\t\tb, err = u.appendV1Extensions(b, m, deterministic)\n\t\tif err != nil {\n\t\t\treturn b, err\n\t\t}\n\t}\n\tfor _, f := range u.fields {\n\t\tif f.required {\n\t\t\tif ptr.offset(f.field).getPointer().isNil() {\n\t\t\t\t// Required field is not set.\n\t\t\t\t// We record the error but keep going, to give a complete marshaling.\n\t\t\t\tif errLater == nil {\n\t\t\t\t\terrLater = &RequiredNotSetError{f.name}\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\tif f.isPointer && ptr.offset(f.field).getPointer().isNil() {\n\t\t\t// nil pointer always marshals to nothing\n\t\t\tcontinue\n\t\t}\n\t\tb, err = f.marshaler(b, ptr.offset(f.field), f.wiretag, deterministic)\n\t\tif err != nil {\n\t\t\tif err1, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\t// Required field in submessage is not set.\n\t\t\t\t// We record the error but keep going, to give a complete marshaling.\n\t\t\t\tif errLater == nil {\n\t\t\t\t\terrLater = &RequiredNotSetError{f.name + \".\" + err1.field}\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err == errRepeatedHasNil {\n\t\t\t\terr = errors.New(\"proto: repeated field \" + f.name + \" has nil element\")\n\t\t\t}\n\t\t\tif err == errInvalidUTF8 {\n\t\t\t\tif errLater == nil {\n\t\t\t\t\tfullName := revProtoTypes[reflect.PtrTo(u.typ)] + \".\" + f.name\n\t\t\t\t\terrLater = &invalidUTF8Error{fullName}\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn b, err\n\t\t}\n\t}\n\tif u.unrecognized.IsValid() {\n\t\ts := *ptr.offset(u.unrecognized).toBytes()\n\t\tb = append(b, s...)\n\t}\n\treturn b, errLater\n}\n\n// computeMarshalInfo initializes the marshal info.\nfunc (u *marshalInfo) computeMarshalInfo() {\n\tu.Lock()\n\tdefer u.Unlock()\n\tif u.initialized != 0 { // non-atomic read is ok as it is protected by the lock\n\t\treturn\n\t}\n\n\tt := u.typ\n\tu.unrecognized = invalidField\n\tu.extensions = invalidField\n\tu.v1extensions = invalidField\n\tu.sizecache = invalidField\n\n\t// If the message can marshal itself, let it do it, for compatibility.\n\t// NOTE: This is not efficient.\n\tif reflect.PtrTo(t).Implements(marshalerType) {\n\t\tu.hasmarshaler = true\n\t\tatomic.StoreInt32(&u.initialized, 1)\n\t\treturn\n\t}\n\n\t// get oneof implementers\n\tvar oneofImplementers []interface{}\n\tswitch m := reflect.Zero(reflect.PtrTo(t)).Interface().(type) {\n\tcase oneofFuncsIface:\n\t\t_, _, _, oneofImplementers = m.XXX_OneofFuncs()\n\tcase oneofWrappersIface:\n\t\toneofImplementers = m.XXX_OneofWrappers()\n\t}\n\n\tn := t.NumField()\n\n\t// deal with XXX fields first\n\tfor i := 0; i < t.NumField(); i++ {\n\t\tf := t.Field(i)\n\t\tif !strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\t\tswitch f.Name {\n\t\tcase \"XXX_sizecache\":\n\t\t\tu.sizecache = toField(&f)\n\t\tcase \"XXX_unrecognized\":\n\t\t\tu.unrecognized = toField(&f)\n\t\tcase \"XXX_InternalExtensions\":\n\t\t\tu.extensions = toField(&f)\n\t\t\tu.messageset = f.Tag.Get(\"protobuf_messageset\") == \"1\"\n\t\tcase \"XXX_extensions\":\n\t\t\tu.v1extensions = toField(&f)\n\t\tcase \"XXX_NoUnkeyedLiteral\":\n\t\t\t// nothing to do\n\t\tdefault:\n\t\t\tpanic(\"unknown XXX field: \" + f.Name)\n\t\t}\n\t\tn--\n\t}\n\n\t// normal fields\n\tfields := make([]marshalFieldInfo, n) // batch allocation\n\tu.fields = make([]*marshalFieldInfo, 0, n)\n\tfor i, j := 0, 0; i < t.NumField(); i++ {\n\t\tf := t.Field(i)\n\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\t\tfield := &fields[j]\n\t\tj++\n\t\tfield.name = f.Name\n\t\tu.fields = append(u.fields, field)\n\t\tif f.Tag.Get(\"protobuf_oneof\") != \"\" {\n\t\t\tfield.computeOneofFieldInfo(&f, oneofImplementers)\n\t\t\tcontinue\n\t\t}\n\t\tif f.Tag.Get(\"protobuf\") == \"\" {\n\t\t\t// field has no tag (not in generated message), ignore it\n\t\t\tu.fields = u.fields[:len(u.fields)-1]\n\t\t\tj--\n\t\t\tcontinue\n\t\t}\n\t\tfield.computeMarshalFieldInfo(&f)\n\t}\n\n\t// fields are marshaled in tag order on the wire.\n\tsort.Sort(byTag(u.fields))\n\n\tatomic.StoreInt32(&u.initialized, 1)\n}\n\n// helper for sorting fields by tag\ntype byTag []*marshalFieldInfo\n\nfunc (a byTag) Len() int { return len(a) }\nfunc (a byTag) Swap(i, j int) { a[i], a[j] = a[j], a[i] }\nfunc (a byTag) Less(i, j int) bool { return a[i].wiretag < a[j].wiretag }\n\n// getExtElemInfo returns the information to marshal an extension element.\n// The info it returns is initialized.\nfunc (u *marshalInfo) getExtElemInfo(desc *ExtensionDesc) *marshalElemInfo {\n\t// get from cache first\n\tu.RLock()\n\te, ok := u.extElems[desc.Field]\n\tu.RUnlock()\n\tif ok {\n\t\treturn e\n\t}\n\n\tt := reflect.TypeOf(desc.ExtensionType) // pointer or slice to basic type or struct\n\ttags := strings.Split(desc.Tag, \",\")\n\ttag, err := strconv.Atoi(tags[1])\n\tif err != nil {\n\t\tpanic(\"tag is not an integer\")\n\t}\n\twt := wiretype(tags[0])\n\tif t.Kind() == reflect.Ptr && t.Elem().Kind() != reflect.Struct {\n\t\tt = t.Elem()\n\t}\n\tsizer, marshaler := typeMarshaler(t, tags, false, false)\n\tvar deref bool\n\tif t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8 {\n\t\tt = reflect.PtrTo(t)\n\t\tderef = true\n\t}\n\te = &marshalElemInfo{\n\t\twiretag: uint64(tag)<<3 | wt,\n\t\ttagsize: SizeVarint(uint64(tag) << 3),\n\t\tsizer: sizer,\n\t\tmarshaler: marshaler,\n\t\tisptr: t.Kind() == reflect.Ptr,\n\t\tderef: deref,\n\t}\n\n\t// update cache\n\tu.Lock()\n\tif u.extElems == nil {\n\t\tu.extElems = make(map[int32]*marshalElemInfo)\n\t}\n\tu.extElems[desc.Field] = e\n\tu.Unlock()\n\treturn e\n}\n\n// computeMarshalFieldInfo fills up the information to marshal a field.\nfunc (fi *marshalFieldInfo) computeMarshalFieldInfo(f *reflect.StructField) {\n\t// parse protobuf tag of the field.\n\t// tag has format of \"bytes,49,opt,name=foo,def=hello!\"\n\ttags := strings.Split(f.Tag.Get(\"protobuf\"), \",\")\n\tif tags[0] == \"\" {\n\t\treturn\n\t}\n\ttag, err := strconv.Atoi(tags[1])\n\tif err != nil {\n\t\tpanic(\"tag is not an integer\")\n\t}\n\twt := wiretype(tags[0])\n\tif tags[2] == \"req\" {\n\t\tfi.required = true\n\t}\n\tfi.setTag(f, tag, wt)\n\tfi.setMarshaler(f, tags)\n}\n\nfunc (fi *marshalFieldInfo) computeOneofFieldInfo(f *reflect.StructField, oneofImplementers []interface{}) {\n\tfi.field = toField(f)\n\tfi.wiretag = math.MaxInt32 // Use a large tag number, make oneofs sorted at the end. This tag will not appear on the wire.\n\tfi.isPointer = true\n\tfi.sizer, fi.marshaler = makeOneOfMarshaler(fi, f)\n\tfi.oneofElems = make(map[reflect.Type]*marshalElemInfo)\n\n\tityp := f.Type // interface type\n\tfor _, o := range oneofImplementers {\n\t\tt := reflect.TypeOf(o)\n\t\tif !t.Implements(ityp) {\n\t\t\tcontinue\n\t\t}\n\t\tsf := t.Elem().Field(0) // oneof implementer is a struct with a single field\n\t\ttags := strings.Split(sf.Tag.Get(\"protobuf\"), \",\")\n\t\ttag, err := strconv.Atoi(tags[1])\n\t\tif err != nil {\n\t\t\tpanic(\"tag is not an integer\")\n\t\t}\n\t\twt := wiretype(tags[0])\n\t\tsizer, marshaler := typeMarshaler(sf.Type, tags, false, true) // oneof should not omit any zero value\n\t\tfi.oneofElems[t.Elem()] = &marshalElemInfo{\n\t\t\twiretag: uint64(tag)<<3 | wt,\n\t\t\ttagsize: SizeVarint(uint64(tag) << 3),\n\t\t\tsizer: sizer,\n\t\t\tmarshaler: marshaler,\n\t\t}\n\t}\n}\n\n// wiretype returns the wire encoding of the type.\nfunc wiretype(encoding string) uint64 {\n\tswitch encoding {\n\tcase \"fixed32\":\n\t\treturn WireFixed32\n\tcase \"fixed64\":\n\t\treturn WireFixed64\n\tcase \"varint\", \"zigzag32\", \"zigzag64\":\n\t\treturn WireVarint\n\tcase \"bytes\":\n\t\treturn WireBytes\n\tcase \"group\":\n\t\treturn WireStartGroup\n\t}\n\tpanic(\"unknown wire type \" + encoding)\n}\n\n// setTag fills up the tag (in wire format) and its size in the info of a field.\nfunc (fi *marshalFieldInfo) setTag(f *reflect.StructField, tag int, wt uint64) {\n\tfi.field = toField(f)\n\tfi.wiretag = uint64(tag)<<3 | wt\n\tfi.tagsize = SizeVarint(uint64(tag) << 3)\n}\n\n// setMarshaler fills up the sizer and marshaler in the info of a field.\nfunc (fi *marshalFieldInfo) setMarshaler(f *reflect.StructField, tags []string) {\n\tswitch f.Type.Kind() {\n\tcase reflect.Map:\n\t\t// map field\n\t\tfi.isPointer = true\n\t\tfi.sizer, fi.marshaler = makeMapMarshaler(f)\n\t\treturn\n\tcase reflect.Ptr, reflect.Slice:\n\t\tfi.isPointer = true\n\t}\n\tfi.sizer, fi.marshaler = typeMarshaler(f.Type, tags, true, false)\n}\n\n// typeMarshaler returns the sizer and marshaler of a given field.\n// t is the type of the field.\n// tags is the generated \"protobuf\" tag of the field.\n// If nozero is true, zero value is not marshaled to the wire.\n// If oneof is true, it is a oneof field.\nfunc typeMarshaler(t reflect.Type, tags []string, nozero, oneof bool) (sizer, marshaler) {\n\tencoding := tags[0]\n\n\tpointer := false\n\tslice := false\n\tif t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8 {\n\t\tslice = true\n\t\tt = t.Elem()\n\t}\n\tif t.Kind() == reflect.Ptr {\n\t\tpointer = true\n\t\tt = t.Elem()\n\t}\n\n\tpacked := false\n\tproto3 := false\n\tvalidateUTF8 := true\n\tfor i := 2; i < len(tags); i++ {\n\t\tif tags[i] == \"packed\" {\n\t\t\tpacked = true\n\t\t}\n\t\tif tags[i] == \"proto3\" {\n\t\t\tproto3 = true\n\t\t}\n\t}\n\tvalidateUTF8 = validateUTF8 && proto3\n\n\tswitch t.Kind() {\n\tcase reflect.Bool:\n\t\tif pointer {\n\t\t\treturn sizeBoolPtr, appendBoolPtr\n\t\t}\n\t\tif slice {\n\t\t\tif packed {\n\t\t\t\treturn sizeBoolPackedSlice, appendBoolPackedSlice\n\t\t\t}\n\t\t\treturn sizeBoolSlice, appendBoolSlice\n\t\t}\n\t\tif nozero {\n\t\t\treturn sizeBoolValueNoZero, appendBoolValueNoZero\n\t\t}\n\t\treturn sizeBoolValue, appendBoolValue\n\tcase reflect.Uint32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeFixed32Ptr, appendFixed32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeFixed32PackedSlice, appendFixed32PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeFixed32Slice, appendFixed32Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeFixed32ValueNoZero, appendFixed32ValueNoZero\n\t\t\t}\n\t\t\treturn sizeFixed32Value, appendFixed32Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeVarint32Ptr, appendVarint32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeVarint32PackedSlice, appendVarint32PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeVarint32Slice, appendVarint32Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeVarint32ValueNoZero, appendVarint32ValueNoZero\n\t\t\t}\n\t\t\treturn sizeVarint32Value, appendVarint32Value\n\t\t}\n\tcase reflect.Int32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeFixedS32Ptr, appendFixedS32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeFixedS32PackedSlice, appendFixedS32PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeFixedS32Slice, appendFixedS32Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeFixedS32ValueNoZero, appendFixedS32ValueNoZero\n\t\t\t}\n\t\t\treturn sizeFixedS32Value, appendFixedS32Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeVarintS32Ptr, appendVarintS32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeVarintS32PackedSlice, appendVarintS32PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeVarintS32Slice, appendVarintS32Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeVarintS32ValueNoZero, appendVarintS32ValueNoZero\n\t\t\t}\n\t\t\treturn sizeVarintS32Value, appendVarintS32Value\n\t\tcase \"zigzag32\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeZigzag32Ptr, appendZigzag32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeZigzag32PackedSlice, appendZigzag32PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeZigzag32Slice, appendZigzag32Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeZigzag32ValueNoZero, appendZigzag32ValueNoZero\n\t\t\t}\n\t\t\treturn sizeZigzag32Value, appendZigzag32Value\n\t\t}\n\tcase reflect.Uint64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeFixed64Ptr, appendFixed64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeFixed64PackedSlice, appendFixed64PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeFixed64Slice, appendFixed64Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeFixed64ValueNoZero, appendFixed64ValueNoZero\n\t\t\t}\n\t\t\treturn sizeFixed64Value, appendFixed64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeVarint64Ptr, appendVarint64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeVarint64PackedSlice, appendVarint64PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeVarint64Slice, appendVarint64Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeVarint64ValueNoZero, appendVarint64ValueNoZero\n\t\t\t}\n\t\t\treturn sizeVarint64Value, appendVarint64Value\n\t\t}\n\tcase reflect.Int64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeFixedS64Ptr, appendFixedS64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeFixedS64PackedSlice, appendFixedS64PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeFixedS64Slice, appendFixedS64Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeFixedS64ValueNoZero, appendFixedS64ValueNoZero\n\t\t\t}\n\t\t\treturn sizeFixedS64Value, appendFixedS64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeVarintS64Ptr, appendVarintS64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeVarintS64PackedSlice, appendVarintS64PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeVarintS64Slice, appendVarintS64Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeVarintS64ValueNoZero, appendVarintS64ValueNoZero\n\t\t\t}\n\t\t\treturn sizeVarintS64Value, appendVarintS64Value\n\t\tcase \"zigzag64\":\n\t\t\tif pointer {\n\t\t\t\treturn sizeZigzag64Ptr, appendZigzag64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\tif packed {\n\t\t\t\t\treturn sizeZigzag64PackedSlice, appendZigzag64PackedSlice\n\t\t\t\t}\n\t\t\t\treturn sizeZigzag64Slice, appendZigzag64Slice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeZigzag64ValueNoZero, appendZigzag64ValueNoZero\n\t\t\t}\n\t\t\treturn sizeZigzag64Value, appendZigzag64Value\n\t\t}\n\tcase reflect.Float32:\n\t\tif pointer {\n\t\t\treturn sizeFloat32Ptr, appendFloat32Ptr\n\t\t}\n\t\tif slice {\n\t\t\tif packed {\n\t\t\t\treturn sizeFloat32PackedSlice, appendFloat32PackedSlice\n\t\t\t}\n\t\t\treturn sizeFloat32Slice, appendFloat32Slice\n\t\t}\n\t\tif nozero {\n\t\t\treturn sizeFloat32ValueNoZero, appendFloat32ValueNoZero\n\t\t}\n\t\treturn sizeFloat32Value, appendFloat32Value\n\tcase reflect.Float64:\n\t\tif pointer {\n\t\t\treturn sizeFloat64Ptr, appendFloat64Ptr\n\t\t}\n\t\tif slice {\n\t\t\tif packed {\n\t\t\t\treturn sizeFloat64PackedSlice, appendFloat64PackedSlice\n\t\t\t}\n\t\t\treturn sizeFloat64Slice, appendFloat64Slice\n\t\t}\n\t\tif nozero {\n\t\t\treturn sizeFloat64ValueNoZero, appendFloat64ValueNoZero\n\t\t}\n\t\treturn sizeFloat64Value, appendFloat64Value\n\tcase reflect.String:\n\t\tif validateUTF8 {\n\t\t\tif pointer {\n\t\t\t\treturn sizeStringPtr, appendUTF8StringPtr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn sizeStringSlice, appendUTF8StringSlice\n\t\t\t}\n\t\t\tif nozero {\n\t\t\t\treturn sizeStringValueNoZero, appendUTF8StringValueNoZero\n\t\t\t}\n\t\t\treturn sizeStringValue, appendUTF8StringValue\n\t\t}\n\t\tif pointer {\n\t\t\treturn sizeStringPtr, appendStringPtr\n\t\t}\n\t\tif slice {\n\t\t\treturn sizeStringSlice, appendStringSlice\n\t\t}\n\t\tif nozero {\n\t\t\treturn sizeStringValueNoZero, appendStringValueNoZero\n\t\t}\n\t\treturn sizeStringValue, appendStringValue\n\tcase reflect.Slice:\n\t\tif slice {\n\t\t\treturn sizeBytesSlice, appendBytesSlice\n\t\t}\n\t\tif oneof {\n\t\t\t// Oneof bytes field may also have \"proto3\" tag.\n\t\t\t// We want to marshal it as a oneof field. Do this\n\t\t\t// check before the proto3 check.\n\t\t\treturn sizeBytesOneof, appendBytesOneof\n\t\t}\n\t\tif proto3 {\n\t\t\treturn sizeBytes3, appendBytes3\n\t\t}\n\t\treturn sizeBytes, appendBytes\n\tcase reflect.Struct:\n\t\tswitch encoding {\n\t\tcase \"group\":\n\t\t\tif slice {\n\t\t\t\treturn makeGroupSliceMarshaler(getMarshalInfo(t))\n\t\t\t}\n\t\t\treturn makeGroupMarshaler(getMarshalInfo(t))\n\t\tcase \"bytes\":\n\t\t\tif slice {\n\t\t\t\treturn makeMessageSliceMarshaler(getMarshalInfo(t))\n\t\t\t}\n\t\t\treturn makeMessageMarshaler(getMarshalInfo(t))\n\t\t}\n\t}\n\tpanic(fmt.Sprintf(\"unknown or mismatched type: type: %v, wire type: %v\", t, encoding))\n}\n\n// Below are functions to size/marshal a specific type of a field.\n// They are stored in the field's info, and called by function pointers.\n// They have type sizer or marshaler.\n\nfunc sizeFixed32Value(_ pointer, tagsize int) int {\n\treturn 4 + tagsize\n}\nfunc sizeFixed32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint32()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFixed32Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toUint32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFixed32Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint32Slice()\n\treturn (4 + tagsize) * len(s)\n}\nfunc sizeFixed32PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 4*len(s) + SizeVarint(uint64(4*len(s))) + tagsize\n}\nfunc sizeFixedS32Value(_ pointer, tagsize int) int {\n\treturn 4 + tagsize\n}\nfunc sizeFixedS32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFixedS32Ptr(ptr pointer, tagsize int) int {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFixedS32Slice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\treturn (4 + tagsize) * len(s)\n}\nfunc sizeFixedS32PackedSlice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 4*len(s) + SizeVarint(uint64(4*len(s))) + tagsize\n}\nfunc sizeFloat32Value(_ pointer, tagsize int) int {\n\treturn 4 + tagsize\n}\nfunc sizeFloat32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := math.Float32bits(*ptr.toFloat32())\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFloat32Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toFloat32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 4 + tagsize\n}\nfunc sizeFloat32Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toFloat32Slice()\n\treturn (4 + tagsize) * len(s)\n}\nfunc sizeFloat32PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toFloat32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 4*len(s) + SizeVarint(uint64(4*len(s))) + tagsize\n}\nfunc sizeFixed64Value(_ pointer, tagsize int) int {\n\treturn 8 + tagsize\n}\nfunc sizeFixed64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint64()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFixed64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toUint64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFixed64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint64Slice()\n\treturn (8 + tagsize) * len(s)\n}\nfunc sizeFixed64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 8*len(s) + SizeVarint(uint64(8*len(s))) + tagsize\n}\nfunc sizeFixedS64Value(_ pointer, tagsize int) int {\n\treturn 8 + tagsize\n}\nfunc sizeFixedS64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFixedS64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFixedS64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\treturn (8 + tagsize) * len(s)\n}\nfunc sizeFixedS64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 8*len(s) + SizeVarint(uint64(8*len(s))) + tagsize\n}\nfunc sizeFloat64Value(_ pointer, tagsize int) int {\n\treturn 8 + tagsize\n}\nfunc sizeFloat64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := math.Float64bits(*ptr.toFloat64())\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFloat64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toFloat64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 8 + tagsize\n}\nfunc sizeFloat64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toFloat64Slice()\n\treturn (8 + tagsize) * len(s)\n}\nfunc sizeFloat64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toFloat64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn 8*len(s) + SizeVarint(uint64(8*len(s))) + tagsize\n}\nfunc sizeVarint32Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint32()\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarint32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint32()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarint32Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toUint32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(*p)) + tagsize\n}\nfunc sizeVarint32Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint32Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v)) + tagsize\n\t}\n\treturn n\n}\nfunc sizeVarint32PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeVarintS32Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt32()\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarintS32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarintS32Ptr(ptr pointer, tagsize int) int {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(*p)) + tagsize\n}\nfunc sizeVarintS32Slice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v)) + tagsize\n\t}\n\treturn n\n}\nfunc sizeVarintS32PackedSlice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeVarint64Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint64()\n\treturn SizeVarint(v) + tagsize\n}\nfunc sizeVarint64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toUint64()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(v) + tagsize\n}\nfunc sizeVarint64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toUint64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn SizeVarint(*p) + tagsize\n}\nfunc sizeVarint64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint64Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(v) + tagsize\n\t}\n\treturn n\n}\nfunc sizeVarint64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toUint64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(v)\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeVarintS64Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt64()\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarintS64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(v)) + tagsize\n}\nfunc sizeVarintS64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(*p)) + tagsize\n}\nfunc sizeVarintS64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v)) + tagsize\n\t}\n\treturn n\n}\nfunc sizeVarintS64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeZigzag32Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt32()\n\treturn SizeVarint(uint64((uint32(v)<<1)^uint32((int32(v)>>31)))) + tagsize\n}\nfunc sizeZigzag32ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64((uint32(v)<<1)^uint32((int32(v)>>31)))) + tagsize\n}\nfunc sizeZigzag32Ptr(ptr pointer, tagsize int) int {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\tv := *p\n\treturn SizeVarint(uint64((uint32(v)<<1)^uint32((int32(v)>>31)))) + tagsize\n}\nfunc sizeZigzag32Slice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64((uint32(v)<<1)^uint32((int32(v)>>31)))) + tagsize\n\t}\n\treturn n\n}\nfunc sizeZigzag32PackedSlice(ptr pointer, tagsize int) int {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64((uint32(v) << 1) ^ uint32((int32(v) >> 31))))\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeZigzag64Value(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt64()\n\treturn SizeVarint(uint64(v<<1)^uint64((int64(v)>>63))) + tagsize\n}\nfunc sizeZigzag64ValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn 0\n\t}\n\treturn SizeVarint(uint64(v<<1)^uint64((int64(v)>>63))) + tagsize\n}\nfunc sizeZigzag64Ptr(ptr pointer, tagsize int) int {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\tv := *p\n\treturn SizeVarint(uint64(v<<1)^uint64((int64(v)>>63))) + tagsize\n}\nfunc sizeZigzag64Slice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v<<1)^uint64((int64(v)>>63))) + tagsize\n\t}\n\treturn n\n}\nfunc sizeZigzag64PackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v<<1) ^ uint64((int64(v) >> 63)))\n\t}\n\treturn n + SizeVarint(uint64(n)) + tagsize\n}\nfunc sizeBoolValue(_ pointer, tagsize int) int {\n\treturn 1 + tagsize\n}\nfunc sizeBoolValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toBool()\n\tif !v {\n\t\treturn 0\n\t}\n\treturn 1 + tagsize\n}\nfunc sizeBoolPtr(ptr pointer, tagsize int) int {\n\tp := *ptr.toBoolPtr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn 1 + tagsize\n}\nfunc sizeBoolSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toBoolSlice()\n\treturn (1 + tagsize) * len(s)\n}\nfunc sizeBoolPackedSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toBoolSlice()\n\tif len(s) == 0 {\n\t\treturn 0\n\t}\n\treturn len(s) + SizeVarint(uint64(len(s))) + tagsize\n}\nfunc sizeStringValue(ptr pointer, tagsize int) int {\n\tv := *ptr.toString()\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeStringValueNoZero(ptr pointer, tagsize int) int {\n\tv := *ptr.toString()\n\tif v == \"\" {\n\t\treturn 0\n\t}\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeStringPtr(ptr pointer, tagsize int) int {\n\tp := *ptr.toStringPtr()\n\tif p == nil {\n\t\treturn 0\n\t}\n\tv := *p\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeStringSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toStringSlice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += len(v) + SizeVarint(uint64(len(v))) + tagsize\n\t}\n\treturn n\n}\nfunc sizeBytes(ptr pointer, tagsize int) int {\n\tv := *ptr.toBytes()\n\tif v == nil {\n\t\treturn 0\n\t}\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeBytes3(ptr pointer, tagsize int) int {\n\tv := *ptr.toBytes()\n\tif len(v) == 0 {\n\t\treturn 0\n\t}\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeBytesOneof(ptr pointer, tagsize int) int {\n\tv := *ptr.toBytes()\n\treturn len(v) + SizeVarint(uint64(len(v))) + tagsize\n}\nfunc sizeBytesSlice(ptr pointer, tagsize int) int {\n\ts := *ptr.toBytesSlice()\n\tn := 0\n\tfor _, v := range s {\n\t\tn += len(v) + SizeVarint(uint64(len(v))) + tagsize\n\t}\n\treturn n\n}\n\n// appendFixed32 appends an encoded fixed32 to b.\nfunc appendFixed32(b []byte, v uint32) []byte {\n\tb = append(b,\n\t\tbyte(v),\n\t\tbyte(v>>8),\n\t\tbyte(v>>16),\n\t\tbyte(v>>24))\n\treturn b\n}\n\n// appendFixed64 appends an encoded fixed64 to b.\nfunc appendFixed64(b []byte, v uint64) []byte {\n\tb = append(b,\n\t\tbyte(v),\n\t\tbyte(v>>8),\n\t\tbyte(v>>16),\n\t\tbyte(v>>24),\n\t\tbyte(v>>32),\n\t\tbyte(v>>40),\n\t\tbyte(v>>48),\n\t\tbyte(v>>56))\n\treturn b\n}\n\n// appendVarint appends an encoded varint to b.\nfunc appendVarint(b []byte, v uint64) []byte {\n\t// TODO: make 1-byte (maybe 2-byte) case inline-able, once we\n\t// have non-leaf inliner.\n\tswitch {\n\tcase v < 1<<7:\n\t\tb = append(b, byte(v))\n\tcase v < 1<<14:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte(v>>7))\n\tcase v < 1<<21:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte(v>>14))\n\tcase v < 1<<28:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte(v>>21))\n\tcase v < 1<<35:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte(v>>28))\n\tcase v < 1<<42:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte((v>>28)&0x7f|0x80),\n\t\t\tbyte(v>>35))\n\tcase v < 1<<49:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte((v>>28)&0x7f|0x80),\n\t\t\tbyte((v>>35)&0x7f|0x80),\n\t\t\tbyte(v>>42))\n\tcase v < 1<<56:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte((v>>28)&0x7f|0x80),\n\t\t\tbyte((v>>35)&0x7f|0x80),\n\t\t\tbyte((v>>42)&0x7f|0x80),\n\t\t\tbyte(v>>49))\n\tcase v < 1<<63:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte((v>>28)&0x7f|0x80),\n\t\t\tbyte((v>>35)&0x7f|0x80),\n\t\t\tbyte((v>>42)&0x7f|0x80),\n\t\t\tbyte((v>>49)&0x7f|0x80),\n\t\t\tbyte(v>>56))\n\tdefault:\n\t\tb = append(b,\n\t\t\tbyte(v&0x7f|0x80),\n\t\t\tbyte((v>>7)&0x7f|0x80),\n\t\t\tbyte((v>>14)&0x7f|0x80),\n\t\t\tbyte((v>>21)&0x7f|0x80),\n\t\t\tbyte((v>>28)&0x7f|0x80),\n\t\t\tbyte((v>>35)&0x7f|0x80),\n\t\t\tbyte((v>>42)&0x7f|0x80),\n\t\t\tbyte((v>>49)&0x7f|0x80),\n\t\t\tbyte((v>>56)&0x7f|0x80),\n\t\t\t1)\n\t}\n\treturn b\n}\n\nfunc appendFixed32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint32()\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, v)\n\treturn b, nil\n}\nfunc appendFixed32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint32()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, v)\n\treturn b, nil\n}\nfunc appendFixed32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toUint32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, *p)\n\treturn b, nil\n}\nfunc appendFixed32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed32(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendFixed32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(4*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed32(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendFixedS32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, uint32(v))\n\treturn b, nil\n}\nfunc appendFixedS32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, uint32(v))\n\treturn b, nil\n}\nfunc appendFixedS32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, uint32(*p))\n\treturn b, nil\n}\nfunc appendFixedS32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed32(b, uint32(v))\n\t}\n\treturn b, nil\n}\nfunc appendFixedS32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(4*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed32(b, uint32(v))\n\t}\n\treturn b, nil\n}\nfunc appendFloat32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := math.Float32bits(*ptr.toFloat32())\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, v)\n\treturn b, nil\n}\nfunc appendFloat32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := math.Float32bits(*ptr.toFloat32())\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, v)\n\treturn b, nil\n}\nfunc appendFloat32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toFloat32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed32(b, math.Float32bits(*p))\n\treturn b, nil\n}\nfunc appendFloat32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toFloat32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed32(b, math.Float32bits(v))\n\t}\n\treturn b, nil\n}\nfunc appendFloat32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toFloat32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(4*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed32(b, math.Float32bits(v))\n\t}\n\treturn b, nil\n}\nfunc appendFixed64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint64()\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, v)\n\treturn b, nil\n}\nfunc appendFixed64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint64()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, v)\n\treturn b, nil\n}\nfunc appendFixed64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toUint64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, *p)\n\treturn b, nil\n}\nfunc appendFixed64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed64(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendFixed64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(8*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed64(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendFixedS64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, uint64(v))\n\treturn b, nil\n}\nfunc appendFixedS64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, uint64(v))\n\treturn b, nil\n}\nfunc appendFixedS64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, uint64(*p))\n\treturn b, nil\n}\nfunc appendFixedS64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed64(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendFixedS64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(8*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed64(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendFloat64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := math.Float64bits(*ptr.toFloat64())\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, v)\n\treturn b, nil\n}\nfunc appendFloat64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := math.Float64bits(*ptr.toFloat64())\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, v)\n\treturn b, nil\n}\nfunc appendFloat64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toFloat64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendFixed64(b, math.Float64bits(*p))\n\treturn b, nil\n}\nfunc appendFloat64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toFloat64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendFixed64(b, math.Float64bits(v))\n\t}\n\treturn b, nil\n}\nfunc appendFloat64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toFloat64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(8*len(s)))\n\tfor _, v := range s {\n\t\tb = appendFixed64(b, math.Float64bits(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarint32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint32()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarint32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint32()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarint32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toUint32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(*p))\n\treturn b, nil\n}\nfunc appendVarint32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarint32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarintS32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarintS32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarintS32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(*p))\n\treturn b, nil\n}\nfunc appendVarintS32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarintS32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarint64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint64()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, v)\n\treturn b, nil\n}\nfunc appendVarint64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toUint64()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, v)\n\treturn b, nil\n}\nfunc appendVarint64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toUint64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, *p)\n\treturn b, nil\n}\nfunc appendVarint64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendVarint64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toUint64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(v)\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, v)\n\t}\n\treturn b, nil\n}\nfunc appendVarintS64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarintS64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v))\n\treturn b, nil\n}\nfunc appendVarintS64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(*p))\n\treturn b, nil\n}\nfunc appendVarintS64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendVarintS64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v))\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, uint64(v))\n\t}\n\treturn b, nil\n}\nfunc appendZigzag32Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64((uint32(v)<<1)^uint32((int32(v)>>31))))\n\treturn b, nil\n}\nfunc appendZigzag32ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt32()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64((uint32(v)<<1)^uint32((int32(v)>>31))))\n\treturn b, nil\n}\nfunc appendZigzag32Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := ptr.getInt32Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tv := *p\n\tb = appendVarint(b, uint64((uint32(v)<<1)^uint32((int32(v)>>31))))\n\treturn b, nil\n}\nfunc appendZigzag32Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64((uint32(v)<<1)^uint32((int32(v)>>31))))\n\t}\n\treturn b, nil\n}\nfunc appendZigzag32PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := ptr.getInt32Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64((uint32(v) << 1) ^ uint32((int32(v) >> 31))))\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, uint64((uint32(v)<<1)^uint32((int32(v)>>31))))\n\t}\n\treturn b, nil\n}\nfunc appendZigzag64Value(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v<<1)^uint64((int64(v)>>63)))\n\treturn b, nil\n}\nfunc appendZigzag64ValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toInt64()\n\tif v == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(v<<1)^uint64((int64(v)>>63)))\n\treturn b, nil\n}\nfunc appendZigzag64Ptr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toInt64Ptr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tv := *p\n\tb = appendVarint(b, uint64(v<<1)^uint64((int64(v)>>63)))\n\treturn b, nil\n}\nfunc appendZigzag64Slice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(v<<1)^uint64((int64(v)>>63)))\n\t}\n\treturn b, nil\n}\nfunc appendZigzag64PackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toInt64Slice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\t// compute size\n\tn := 0\n\tfor _, v := range s {\n\t\tn += SizeVarint(uint64(v<<1) ^ uint64((int64(v) >> 63)))\n\t}\n\tb = appendVarint(b, uint64(n))\n\tfor _, v := range s {\n\t\tb = appendVarint(b, uint64(v<<1)^uint64((int64(v)>>63)))\n\t}\n\treturn b, nil\n}\nfunc appendBoolValue(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toBool()\n\tb = appendVarint(b, wiretag)\n\tif v {\n\t\tb = append(b, 1)\n\t} else {\n\t\tb = append(b, 0)\n\t}\n\treturn b, nil\n}\nfunc appendBoolValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toBool()\n\tif !v {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = append(b, 1)\n\treturn b, nil\n}\n\nfunc appendBoolPtr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toBoolPtr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tif *p {\n\t\tb = append(b, 1)\n\t} else {\n\t\tb = append(b, 0)\n\t}\n\treturn b, nil\n}\nfunc appendBoolSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toBoolSlice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tif v {\n\t\t\tb = append(b, 1)\n\t\t} else {\n\t\t\tb = append(b, 0)\n\t\t}\n\t}\n\treturn b, nil\n}\nfunc appendBoolPackedSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toBoolSlice()\n\tif len(s) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag&^7|WireBytes)\n\tb = appendVarint(b, uint64(len(s)))\n\tfor _, v := range s {\n\t\tif v {\n\t\t\tb = append(b, 1)\n\t\t} else {\n\t\t\tb = append(b, 0)\n\t\t}\n\t}\n\treturn b, nil\n}\nfunc appendStringValue(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toString()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendStringValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toString()\n\tif v == \"\" {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendStringPtr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tp := *ptr.toStringPtr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tv := *p\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendStringSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toStringSlice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(len(v)))\n\t\tb = append(b, v...)\n\t}\n\treturn b, nil\n}\nfunc appendUTF8StringValue(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tvar invalidUTF8 bool\n\tv := *ptr.toString()\n\tif !utf8.ValidString(v) {\n\t\tinvalidUTF8 = true\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\tif invalidUTF8 {\n\t\treturn b, errInvalidUTF8\n\t}\n\treturn b, nil\n}\nfunc appendUTF8StringValueNoZero(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tvar invalidUTF8 bool\n\tv := *ptr.toString()\n\tif v == \"\" {\n\t\treturn b, nil\n\t}\n\tif !utf8.ValidString(v) {\n\t\tinvalidUTF8 = true\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\tif invalidUTF8 {\n\t\treturn b, errInvalidUTF8\n\t}\n\treturn b, nil\n}\nfunc appendUTF8StringPtr(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tvar invalidUTF8 bool\n\tp := *ptr.toStringPtr()\n\tif p == nil {\n\t\treturn b, nil\n\t}\n\tv := *p\n\tif !utf8.ValidString(v) {\n\t\tinvalidUTF8 = true\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\tif invalidUTF8 {\n\t\treturn b, errInvalidUTF8\n\t}\n\treturn b, nil\n}\nfunc appendUTF8StringSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tvar invalidUTF8 bool\n\ts := *ptr.toStringSlice()\n\tfor _, v := range s {\n\t\tif !utf8.ValidString(v) {\n\t\t\tinvalidUTF8 = true\n\t\t}\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(len(v)))\n\t\tb = append(b, v...)\n\t}\n\tif invalidUTF8 {\n\t\treturn b, errInvalidUTF8\n\t}\n\treturn b, nil\n}\nfunc appendBytes(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toBytes()\n\tif v == nil {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendBytes3(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toBytes()\n\tif len(v) == 0 {\n\t\treturn b, nil\n\t}\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendBytesOneof(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\tv := *ptr.toBytes()\n\tb = appendVarint(b, wiretag)\n\tb = appendVarint(b, uint64(len(v)))\n\tb = append(b, v...)\n\treturn b, nil\n}\nfunc appendBytesSlice(b []byte, ptr pointer, wiretag uint64, _ bool) ([]byte, error) {\n\ts := *ptr.toBytesSlice()\n\tfor _, v := range s {\n\t\tb = appendVarint(b, wiretag)\n\t\tb = appendVarint(b, uint64(len(v)))\n\t\tb = append(b, v...)\n\t}\n\treturn b, nil\n}\n\n// makeGroupMarshaler returns the sizer and marshaler for a group.\n// u is the marshal info of the underlying message.\nfunc makeGroupMarshaler(u *marshalInfo) (sizer, marshaler) {\n\treturn func(ptr pointer, tagsize int) int {\n\t\t\tp := ptr.getPointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn 0\n\t\t\t}\n\t\t\treturn u.size(p) + 2*tagsize\n\t\t},\n\t\tfunc(b []byte, ptr pointer, wiretag uint64, deterministic bool) ([]byte, error) {\n\t\t\tp := ptr.getPointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn b, nil\n\t\t\t}\n\t\t\tvar err error\n\t\t\tb = appendVarint(b, wiretag) // start group\n\t\t\tb, err = u.marshal(b, p, deterministic)\n\t\t\tb = appendVarint(b, wiretag+(WireEndGroup-WireStartGroup)) // end group\n\t\t\treturn b, err\n\t\t}\n}\n\n// makeGroupSliceMarshaler returns the sizer and marshaler for a group slice.\n// u is the marshal info of the underlying message.\nfunc makeGroupSliceMarshaler(u *marshalInfo) (sizer, marshaler) {\n\treturn func(ptr pointer, tagsize int) int {\n\t\t\ts := ptr.getPointerSlice()\n\t\t\tn := 0\n\t\t\tfor _, v := range s {\n\t\t\t\tif v.isNil() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tn += u.size(v) + 2*tagsize\n\t\t\t}\n\t\t\treturn n\n\t\t},\n\t\tfunc(b []byte, ptr pointer, wiretag uint64, deterministic bool) ([]byte, error) {\n\t\t\ts := ptr.getPointerSlice()\n\t\t\tvar err error\n\t\t\tvar nerr nonFatal\n\t\t\tfor _, v := range s {\n\t\t\t\tif v.isNil() {\n\t\t\t\t\treturn b, errRepeatedHasNil\n\t\t\t\t}\n\t\t\t\tb = appendVarint(b, wiretag) // start group\n\t\t\t\tb, err = u.marshal(b, v, deterministic)\n\t\t\t\tb = appendVarint(b, wiretag+(WireEndGroup-WireStartGroup)) // end group\n\t\t\t\tif !nerr.Merge(err) {\n\t\t\t\t\tif err == ErrNil {\n\t\t\t\t\t\terr = errRepeatedHasNil\n\t\t\t\t\t}\n\t\t\t\t\treturn b, err\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn b, nerr.E\n\t\t}\n}\n\n// makeMessageMarshaler returns the sizer and marshaler for a message field.\n// u is the marshal info of the message.\nfunc makeMessageMarshaler(u *marshalInfo) (sizer, marshaler) {\n\treturn func(ptr pointer, tagsize int) int {\n\t\t\tp := ptr.getPointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn 0\n\t\t\t}\n\t\t\tsiz := u.size(p)\n\t\t\treturn siz + SizeVarint(uint64(siz)) + tagsize\n\t\t},\n\t\tfunc(b []byte, ptr pointer, wiretag uint64, deterministic bool) ([]byte, error) {\n\t\t\tp := ptr.getPointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn b, nil\n\t\t\t}\n\t\t\tb = appendVarint(b, wiretag)\n\t\t\tsiz := u.cachedsize(p)\n\t\t\tb = appendVarint(b, uint64(siz))\n\t\t\treturn u.marshal(b, p, deterministic)\n\t\t}\n}\n\n// makeMessageSliceMarshaler returns the sizer and marshaler for a message slice.\n// u is the marshal info of the message.\nfunc makeMessageSliceMarshaler(u *marshalInfo) (sizer, marshaler) {\n\treturn func(ptr pointer, tagsize int) int {\n\t\t\ts := ptr.getPointerSlice()\n\t\t\tn := 0\n\t\t\tfor _, v := range s {\n\t\t\t\tif v.isNil() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tsiz := u.size(v)\n\t\t\t\tn += siz + SizeVarint(uint64(siz)) + tagsize\n\t\t\t}\n\t\t\treturn n\n\t\t},\n\t\tfunc(b []byte, ptr pointer, wiretag uint64, deterministic bool) ([]byte, error) {\n\t\t\ts := ptr.getPointerSlice()\n\t\t\tvar err error\n\t\t\tvar nerr nonFatal\n\t\t\tfor _, v := range s {\n\t\t\t\tif v.isNil() {\n\t\t\t\t\treturn b, errRepeatedHasNil\n\t\t\t\t}\n\t\t\t\tb = appendVarint(b, wiretag)\n\t\t\t\tsiz := u.cachedsize(v)\n\t\t\t\tb = appendVarint(b, uint64(siz))\n\t\t\t\tb, err = u.marshal(b, v, deterministic)\n\n\t\t\t\tif !nerr.Merge(err) {\n\t\t\t\t\tif err == ErrNil {\n\t\t\t\t\t\terr = errRepeatedHasNil\n\t\t\t\t\t}\n\t\t\t\t\treturn b, err\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn b, nerr.E\n\t\t}\n}\n\n// makeMapMarshaler returns the sizer and marshaler for a map field.\n// f is the pointer to the reflect data structure of the field.\nfunc makeMapMarshaler(f *reflect.StructField) (sizer, marshaler) {\n\t// figure out key and value type\n\tt := f.Type\n\tkeyType := t.Key()\n\tvalType := t.Elem()\n\tkeyTags := strings.Split(f.Tag.Get(\"protobuf_key\"), \",\")\n\tvalTags := strings.Split(f.Tag.Get(\"protobuf_val\"), \",\")\n\tkeySizer, keyMarshaler := typeMarshaler(keyType, keyTags, false, false) // don't omit zero value in map\n\tvalSizer, valMarshaler := typeMarshaler(valType, valTags, false, false) // don't omit zero value in map\n\tkeyWireTag := 1<<3 | wiretype(keyTags[0])\n\tvalWireTag := 2<<3 | wiretype(valTags[0])\n\n\t// We create an interface to get the addresses of the map key and value.\n\t// If value is pointer-typed, the interface is a direct interface, the\n\t// idata itself is the value. Otherwise, the idata is the pointer to the\n\t// value.\n\t// Key cannot be pointer-typed.\n\tvalIsPtr := valType.Kind() == reflect.Ptr\n\n\t// If value is a message with nested maps, calling\n\t// valSizer in marshal may be quadratic. We should use\n\t// cached version in marshal (but not in size).\n\t// If value is not message type, we don't have size cache,\n\t// but it cannot be nested either. Just use valSizer.\n\tvalCachedSizer := valSizer\n\tif valIsPtr && valType.Elem().Kind() == reflect.Struct {\n\t\tu := getMarshalInfo(valType.Elem())\n\t\tvalCachedSizer = func(ptr pointer, tagsize int) int {\n\t\t\t// Same as message sizer, but use cache.\n\t\t\tp := ptr.getPointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn 0\n\t\t\t}\n\t\t\tsiz := u.cachedsize(p)\n\t\t\treturn siz + SizeVarint(uint64(siz)) + tagsize\n\t\t}\n\t}\n\treturn func(ptr pointer, tagsize int) int {\n\t\t\tm := ptr.asPointerTo(t).Elem() // the map\n\t\t\tn := 0\n\t\t\tfor _, k := range m.MapKeys() {\n\t\t\t\tki := k.Interface()\n\t\t\t\tvi := m.MapIndex(k).Interface()\n\t\t\t\tkaddr := toAddrPointer(&ki, false, false) // pointer to key\n\t\t\t\tvaddr := toAddrPointer(&vi, valIsPtr, false) // pointer to value\n\t\t\t\tsiz := keySizer(kaddr, 1) + valSizer(vaddr, 1) // tag of key = 1 (size=1), tag of val = 2 (size=1)\n\t\t\t\tn += siz + SizeVarint(uint64(siz)) + tagsize\n\t\t\t}\n\t\t\treturn n\n\t\t},\n\t\tfunc(b []byte, ptr pointer, tag uint64, deterministic bool) ([]byte, error) {\n\t\t\tm := ptr.asPointerTo(t).Elem() // the map\n\t\t\tvar err error\n\t\t\tkeys := m.MapKeys()\n\t\t\tif len(keys) > 1 && deterministic {\n\t\t\t\tsort.Sort(mapKeys(keys))\n\t\t\t}\n\n\t\t\tvar nerr nonFatal\n\t\t\tfor _, k := range keys {\n\t\t\t\tki := k.Interface()\n\t\t\t\tvi := m.MapIndex(k).Interface()\n\t\t\t\tkaddr := toAddrPointer(&ki, false, false) // pointer to key\n\t\t\t\tvaddr := toAddrPointer(&vi, valIsPtr, false) // pointer to value\n\t\t\t\tb = appendVarint(b, tag)\n\t\t\t\tsiz := keySizer(kaddr, 1) + valCachedSizer(vaddr, 1) // tag of key = 1 (size=1), tag of val = 2 (size=1)\n\t\t\t\tb = appendVarint(b, uint64(siz))\n\t\t\t\tb, err = keyMarshaler(b, kaddr, keyWireTag, deterministic)\n\t\t\t\tif !nerr.Merge(err) {\n\t\t\t\t\treturn b, err\n\t\t\t\t}\n\t\t\t\tb, err = valMarshaler(b, vaddr, valWireTag, deterministic)\n\t\t\t\tif err != ErrNil && !nerr.Merge(err) { // allow nil value in map\n\t\t\t\t\treturn b, err\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn b, nerr.E\n\t\t}\n}\n\n// makeOneOfMarshaler returns the sizer and marshaler for a oneof field.\n// fi is the marshal info of the field.\n// f is the pointer to the reflect data structure of the field.\nfunc makeOneOfMarshaler(fi *marshalFieldInfo, f *reflect.StructField) (sizer, marshaler) {\n\t// Oneof field is an interface. We need to get the actual data type on the fly.\n\tt := f.Type\n\treturn func(ptr pointer, _ int) int {\n\t\t\tp := ptr.getInterfacePointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn 0\n\t\t\t}\n\t\t\tv := ptr.asPointerTo(t).Elem().Elem().Elem() // *interface -> interface -> *struct -> struct\n\t\t\ttelem := v.Type()\n\t\t\te := fi.oneofElems[telem]\n\t\t\treturn e.sizer(p, e.tagsize)\n\t\t},\n\t\tfunc(b []byte, ptr pointer, _ uint64, deterministic bool) ([]byte, error) {\n\t\t\tp := ptr.getInterfacePointer()\n\t\t\tif p.isNil() {\n\t\t\t\treturn b, nil\n\t\t\t}\n\t\t\tv := ptr.asPointerTo(t).Elem().Elem().Elem() // *interface -> interface -> *struct -> struct\n\t\t\ttelem := v.Type()\n\t\t\tif telem.Field(0).Type.Kind() == reflect.Ptr && p.getPointer().isNil() {\n\t\t\t\treturn b, errOneofHasNil\n\t\t\t}\n\t\t\te := fi.oneofElems[telem]\n\t\t\treturn e.marshaler(b, p, e.wiretag, deterministic)\n\t\t}\n}\n\n// sizeExtensions computes the size of encoded data for a XXX_InternalExtensions field.\nfunc (u *marshalInfo) sizeExtensions(ext *XXX_InternalExtensions) int {\n\tm, mu := ext.extensionsRead()\n\tif m == nil {\n\t\treturn 0\n\t}\n\tmu.Lock()\n\n\tn := 0\n\tfor _, e := range m {\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tn += len(e.enc)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tn += ei.sizer(p, ei.tagsize)\n\t}\n\tmu.Unlock()\n\treturn n\n}\n\n// appendExtensions marshals a XXX_InternalExtensions field to the end of byte slice b.\nfunc (u *marshalInfo) appendExtensions(b []byte, ext *XXX_InternalExtensions, deterministic bool) ([]byte, error) {\n\tm, mu := ext.extensionsRead()\n\tif m == nil {\n\t\treturn b, nil\n\t}\n\tmu.Lock()\n\tdefer mu.Unlock()\n\n\tvar err error\n\tvar nerr nonFatal\n\n\t// Fast-path for common cases: zero or one extensions.\n\t// Don't bother sorting the keys.\n\tif len(m) <= 1 {\n\t\tfor _, e := range m {\n\t\t\tif e.value == nil || e.desc == nil {\n\t\t\t\t// Extension is only in its encoded form.\n\t\t\t\tb = append(b, e.enc...)\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// We don't skip extensions that have an encoded form set,\n\t\t\t// because the extension value may have been mutated after\n\t\t\t// the last time this function was called.\n\n\t\t\tei := u.getExtElemInfo(e.desc)\n\t\t\tv := e.value\n\t\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\t\tb, err = ei.marshaler(b, p, ei.wiretag, deterministic)\n\t\t\tif !nerr.Merge(err) {\n\t\t\t\treturn b, err\n\t\t\t}\n\t\t}\n\t\treturn b, nerr.E\n\t}\n\n\t// Sort the keys to provide a deterministic encoding.\n\t// Not sure this is required, but the old code does it.\n\tkeys := make([]int, 0, len(m))\n\tfor k := range m {\n\t\tkeys = append(keys, int(k))\n\t}\n\tsort.Ints(keys)\n\n\tfor _, k := range keys {\n\t\te := m[int32(k)]\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tb = append(b, e.enc...)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tb, err = ei.marshaler(b, p, ei.wiretag, deterministic)\n\t\tif !nerr.Merge(err) {\n\t\t\treturn b, err\n\t\t}\n\t}\n\treturn b, nerr.E\n}\n\n// message set format is:\n// message MessageSet {\n// repeated group Item = 1 {\n// required int32 type_id = 2;\n// required string message = 3;\n// };\n// }\n\n// sizeMessageSet computes the size of encoded data for a XXX_InternalExtensions field\n// in message set format (above).\nfunc (u *marshalInfo) sizeMessageSet(ext *XXX_InternalExtensions) int {\n\tm, mu := ext.extensionsRead()\n\tif m == nil {\n\t\treturn 0\n\t}\n\tmu.Lock()\n\n\tn := 0\n\tfor id, e := range m {\n\t\tn += 2 // start group, end group. tag = 1 (size=1)\n\t\tn += SizeVarint(uint64(id)) + 1 // type_id, tag = 2 (size=1)\n\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tmsgWithLen := skipVarint(e.enc) // skip old tag, but leave the length varint\n\t\t\tsiz := len(msgWithLen)\n\t\t\tn += siz + 1 // message, tag = 3 (size=1)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tn += ei.sizer(p, 1) // message, tag = 3 (size=1)\n\t}\n\tmu.Unlock()\n\treturn n\n}\n\n// appendMessageSet marshals a XXX_InternalExtensions field in message set format (above)\n// to the end of byte slice b.\nfunc (u *marshalInfo) appendMessageSet(b []byte, ext *XXX_InternalExtensions, deterministic bool) ([]byte, error) {\n\tm, mu := ext.extensionsRead()\n\tif m == nil {\n\t\treturn b, nil\n\t}\n\tmu.Lock()\n\tdefer mu.Unlock()\n\n\tvar err error\n\tvar nerr nonFatal\n\n\t// Fast-path for common cases: zero or one extensions.\n\t// Don't bother sorting the keys.\n\tif len(m) <= 1 {\n\t\tfor id, e := range m {\n\t\t\tb = append(b, 1<<3|WireStartGroup)\n\t\t\tb = append(b, 2<<3|WireVarint)\n\t\t\tb = appendVarint(b, uint64(id))\n\n\t\t\tif e.value == nil || e.desc == nil {\n\t\t\t\t// Extension is only in its encoded form.\n\t\t\t\tmsgWithLen := skipVarint(e.enc) // skip old tag, but leave the length varint\n\t\t\t\tb = append(b, 3<<3|WireBytes)\n\t\t\t\tb = append(b, msgWithLen...)\n\t\t\t\tb = append(b, 1<<3|WireEndGroup)\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// We don't skip extensions that have an encoded form set,\n\t\t\t// because the extension value may have been mutated after\n\t\t\t// the last time this function was called.\n\n\t\t\tei := u.getExtElemInfo(e.desc)\n\t\t\tv := e.value\n\t\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\t\tb, err = ei.marshaler(b, p, 3<<3|WireBytes, deterministic)\n\t\t\tif !nerr.Merge(err) {\n\t\t\t\treturn b, err\n\t\t\t}\n\t\t\tb = append(b, 1<<3|WireEndGroup)\n\t\t}\n\t\treturn b, nerr.E\n\t}\n\n\t// Sort the keys to provide a deterministic encoding.\n\tkeys := make([]int, 0, len(m))\n\tfor k := range m {\n\t\tkeys = append(keys, int(k))\n\t}\n\tsort.Ints(keys)\n\n\tfor _, id := range keys {\n\t\te := m[int32(id)]\n\t\tb = append(b, 1<<3|WireStartGroup)\n\t\tb = append(b, 2<<3|WireVarint)\n\t\tb = appendVarint(b, uint64(id))\n\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tmsgWithLen := skipVarint(e.enc) // skip old tag, but leave the length varint\n\t\t\tb = append(b, 3<<3|WireBytes)\n\t\t\tb = append(b, msgWithLen...)\n\t\t\tb = append(b, 1<<3|WireEndGroup)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tb, err = ei.marshaler(b, p, 3<<3|WireBytes, deterministic)\n\t\tb = append(b, 1<<3|WireEndGroup)\n\t\tif !nerr.Merge(err) {\n\t\t\treturn b, err\n\t\t}\n\t}\n\treturn b, nerr.E\n}\n\n// sizeV1Extensions computes the size of encoded data for a V1-API extension field.\nfunc (u *marshalInfo) sizeV1Extensions(m map[int32]Extension) int {\n\tif m == nil {\n\t\treturn 0\n\t}\n\n\tn := 0\n\tfor _, e := range m {\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tn += len(e.enc)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tn += ei.sizer(p, ei.tagsize)\n\t}\n\treturn n\n}\n\n// appendV1Extensions marshals a V1-API extension field to the end of byte slice b.\nfunc (u *marshalInfo) appendV1Extensions(b []byte, m map[int32]Extension, deterministic bool) ([]byte, error) {\n\tif m == nil {\n\t\treturn b, nil\n\t}\n\n\t// Sort the keys to provide a deterministic encoding.\n\tkeys := make([]int, 0, len(m))\n\tfor k := range m {\n\t\tkeys = append(keys, int(k))\n\t}\n\tsort.Ints(keys)\n\n\tvar err error\n\tvar nerr nonFatal\n\tfor _, k := range keys {\n\t\te := m[int32(k)]\n\t\tif e.value == nil || e.desc == nil {\n\t\t\t// Extension is only in its encoded form.\n\t\t\tb = append(b, e.enc...)\n\t\t\tcontinue\n\t\t}\n\n\t\t// We don't skip extensions that have an encoded form set,\n\t\t// because the extension value may have been mutated after\n\t\t// the last time this function was called.\n\n\t\tei := u.getExtElemInfo(e.desc)\n\t\tv := e.value\n\t\tp := toAddrPointer(&v, ei.isptr, ei.deref)\n\t\tb, err = ei.marshaler(b, p, ei.wiretag, deterministic)\n\t\tif !nerr.Merge(err) {\n\t\t\treturn b, err\n\t\t}\n\t}\n\treturn b, nerr.E\n}\n\n// newMarshaler is the interface representing objects that can marshal themselves.\n//\n// This exists to support protoc-gen-go generated messages.\n// The proto package will stop type-asserting to this interface in the future.\n//\n// DO NOT DEPEND ON THIS.\ntype newMarshaler interface {\n\tXXX_Size() int\n\tXXX_Marshal(b []byte, deterministic bool) ([]byte, error)\n}\n\n// Size returns the encoded size of a protocol buffer message.\n// This is the main entry point.\nfunc Size(pb Message) int {\n\tif m, ok := pb.(newMarshaler); ok {\n\t\treturn m.XXX_Size()\n\t}\n\tif m, ok := pb.(Marshaler); ok {\n\t\t// If the message can marshal itself, let it do it, for compatibility.\n\t\t// NOTE: This is not efficient.\n\t\tb, _ := m.Marshal()\n\t\treturn len(b)\n\t}\n\t// in case somehow we didn't generate the wrapper\n\tif pb == nil {\n\t\treturn 0\n\t}\n\tvar info InternalMessageInfo\n\treturn info.Size(pb)\n}\n\n// Marshal takes a protocol buffer message\n// and encodes it into the wire format, returning the data.\n// This is the main entry point.\nfunc Marshal(pb Message) ([]byte, error) {\n\tif m, ok := pb.(newMarshaler); ok {\n\t\tsiz := m.XXX_Size()\n\t\tb := make([]byte, 0, siz)\n\t\treturn m.XXX_Marshal(b, false)\n\t}\n\tif m, ok := pb.(Marshaler); ok {\n\t\t// If the message can marshal itself, let it do it, for compatibility.\n\t\t// NOTE: This is not efficient.\n\t\treturn m.Marshal()\n\t}\n\t// in case somehow we didn't generate the wrapper\n\tif pb == nil {\n\t\treturn nil, ErrNil\n\t}\n\tvar info InternalMessageInfo\n\tsiz := info.Size(pb)\n\tb := make([]byte, 0, siz)\n\treturn info.Marshal(b, pb, false)\n}\n\n// Marshal takes a protocol buffer message\n// and encodes it into the wire format, writing the result to the\n// Buffer.\n// This is an alternative entry point. It is not necessary to use\n// a Buffer for most applications.\nfunc (p *Buffer) Marshal(pb Message) error {\n\tvar err error\n\tif m, ok := pb.(newMarshaler); ok {\n\t\tsiz := m.XXX_Size()\n\t\tp.grow(siz) // make sure buf has enough capacity\n\t\tp.buf, err = m.XXX_Marshal(p.buf, p.deterministic)\n\t\treturn err\n\t}\n\tif m, ok := pb.(Marshaler); ok {\n\t\t// If the message can marshal itself, let it do it, for compatibility.\n\t\t// NOTE: This is not efficient.\n\t\tb, err := m.Marshal()\n\t\tp.buf = append(p.buf, b...)\n\t\treturn err\n\t}\n\t// in case somehow we didn't generate the wrapper\n\tif pb == nil {\n\t\treturn ErrNil\n\t}\n\tvar info InternalMessageInfo\n\tsiz := info.Size(pb)\n\tp.grow(siz) // make sure buf has enough capacity\n\tp.buf, err = info.Marshal(p.buf, pb, p.deterministic)\n\treturn err\n}\n\n// grow grows the buffer's capacity, if necessary, to guarantee space for\n// another n bytes. After grow(n), at least n bytes can be written to the\n// buffer without another allocation.\nfunc (p *Buffer) grow(n int) {\n\tneed := len(p.buf) + n\n\tif need <= cap(p.buf) {\n\t\treturn\n\t}\n\tnewCap := len(p.buf) * 2\n\tif newCap < need {\n\t\tnewCap = need\n\t}\n\tp.buf = append(make([]byte, 0, newCap), p.buf...)\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/table_merge.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2016 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n)\n\n// Merge merges the src message into dst.\n// This assumes that dst and src of the same type and are non-nil.\nfunc (a *InternalMessageInfo) Merge(dst, src Message) {\n\tmi := atomicLoadMergeInfo(&a.merge)\n\tif mi == nil {\n\t\tmi = getMergeInfo(reflect.TypeOf(dst).Elem())\n\t\tatomicStoreMergeInfo(&a.merge, mi)\n\t}\n\tmi.merge(toPointer(&dst), toPointer(&src))\n}\n\ntype mergeInfo struct {\n\ttyp reflect.Type\n\n\tinitialized int32 // 0: only typ is valid, 1: everything is valid\n\tlock sync.Mutex\n\n\tfields []mergeFieldInfo\n\tunrecognized field // Offset of XXX_unrecognized\n}\n\ntype mergeFieldInfo struct {\n\tfield field // Offset of field, guaranteed to be valid\n\n\t// isPointer reports whether the value in the field is a pointer.\n\t// This is true for the following situations:\n\t//\t* Pointer to struct\n\t//\t* Pointer to basic type (proto2 only)\n\t//\t* Slice (first value in slice header is a pointer)\n\t//\t* String (first value in string header is a pointer)\n\tisPointer bool\n\n\t// basicWidth reports the width of the field assuming that it is directly\n\t// embedded in the struct (as is the case for basic types in proto3).\n\t// The possible values are:\n\t// \t0: invalid\n\t//\t1: bool\n\t//\t4: int32, uint32, float32\n\t//\t8: int64, uint64, float64\n\tbasicWidth int\n\n\t// Where dst and src are pointers to the types being merged.\n\tmerge func(dst, src pointer)\n}\n\nvar (\n\tmergeInfoMap = map[reflect.Type]*mergeInfo{}\n\tmergeInfoLock sync.Mutex\n)\n\nfunc getMergeInfo(t reflect.Type) *mergeInfo {\n\tmergeInfoLock.Lock()\n\tdefer mergeInfoLock.Unlock()\n\tmi := mergeInfoMap[t]\n\tif mi == nil {\n\t\tmi = &mergeInfo{typ: t}\n\t\tmergeInfoMap[t] = mi\n\t}\n\treturn mi\n}\n\n// merge merges src into dst assuming they are both of type *mi.typ.\nfunc (mi *mergeInfo) merge(dst, src pointer) {\n\tif dst.isNil() {\n\t\tpanic(\"proto: nil destination\")\n\t}\n\tif src.isNil() {\n\t\treturn // Nothing to do.\n\t}\n\n\tif atomic.LoadInt32(&mi.initialized) == 0 {\n\t\tmi.computeMergeInfo()\n\t}\n\n\tfor _, fi := range mi.fields {\n\t\tsfp := src.offset(fi.field)\n\n\t\t// As an optimization, we can avoid the merge function call cost\n\t\t// if we know for sure that the source will have no effect\n\t\t// by checking if it is the zero value.\n\t\tif unsafeAllowed {\n\t\t\tif fi.isPointer && sfp.getPointer().isNil() { // Could be slice or string\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif fi.basicWidth > 0 {\n\t\t\t\tswitch {\n\t\t\t\tcase fi.basicWidth == 1 && !*sfp.toBool():\n\t\t\t\t\tcontinue\n\t\t\t\tcase fi.basicWidth == 4 && *sfp.toUint32() == 0:\n\t\t\t\t\tcontinue\n\t\t\t\tcase fi.basicWidth == 8 && *sfp.toUint64() == 0:\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdfp := dst.offset(fi.field)\n\t\tfi.merge(dfp, sfp)\n\t}\n\n\t// TODO: Make this faster?\n\tout := dst.asPointerTo(mi.typ).Elem()\n\tin := src.asPointerTo(mi.typ).Elem()\n\tif emIn, err := extendable(in.Addr().Interface()); err == nil {\n\t\temOut, _ := extendable(out.Addr().Interface())\n\t\tmIn, muIn := emIn.extensionsRead()\n\t\tif mIn != nil {\n\t\t\tmOut := emOut.extensionsWrite()\n\t\t\tmuIn.Lock()\n\t\t\tmergeExtension(mOut, mIn)\n\t\t\tmuIn.Unlock()\n\t\t}\n\t}\n\n\tif mi.unrecognized.IsValid() {\n\t\tif b := *src.offset(mi.unrecognized).toBytes(); len(b) > 0 {\n\t\t\t*dst.offset(mi.unrecognized).toBytes() = append([]byte(nil), b...)\n\t\t}\n\t}\n}\n\nfunc (mi *mergeInfo) computeMergeInfo() {\n\tmi.lock.Lock()\n\tdefer mi.lock.Unlock()\n\tif mi.initialized != 0 {\n\t\treturn\n\t}\n\tt := mi.typ\n\tn := t.NumField()\n\n\tprops := GetProperties(t)\n\tfor i := 0; i < n; i++ {\n\t\tf := t.Field(i)\n\t\tif strings.HasPrefix(f.Name, \"XXX_\") {\n\t\t\tcontinue\n\t\t}\n\n\t\tmfi := mergeFieldInfo{field: toField(&f)}\n\t\ttf := f.Type\n\n\t\t// As an optimization, we can avoid the merge function call cost\n\t\t// if we know for sure that the source will have no effect\n\t\t// by checking if it is the zero value.\n\t\tif unsafeAllowed {\n\t\t\tswitch tf.Kind() {\n\t\t\tcase reflect.Ptr, reflect.Slice, reflect.String:\n\t\t\t\t// As a special case, we assume slices and strings are pointers\n\t\t\t\t// since we know that the first field in the SliceSlice or\n\t\t\t\t// StringHeader is a data pointer.\n\t\t\t\tmfi.isPointer = true\n\t\t\tcase reflect.Bool:\n\t\t\t\tmfi.basicWidth = 1\n\t\t\tcase reflect.Int32, reflect.Uint32, reflect.Float32:\n\t\t\t\tmfi.basicWidth = 4\n\t\t\tcase reflect.Int64, reflect.Uint64, reflect.Float64:\n\t\t\t\tmfi.basicWidth = 8\n\t\t\t}\n\t\t}\n\n\t\t// Unwrap tf to get at its most basic type.\n\t\tvar isPointer, isSlice bool\n\t\tif tf.Kind() == reflect.Slice && tf.Elem().Kind() != reflect.Uint8 {\n\t\t\tisSlice = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif tf.Kind() == reflect.Ptr {\n\t\t\tisPointer = true\n\t\t\ttf = tf.Elem()\n\t\t}\n\t\tif isPointer && isSlice && tf.Kind() != reflect.Struct {\n\t\t\tpanic(\"both pointer and slice for basic type in \" + tf.Name())\n\t\t}\n\n\t\tswitch tf.Kind() {\n\t\tcase reflect.Int32:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []int32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\t// NOTE: toInt32Slice is not defined (see pointer_reflect.go).\n\t\t\t\t\t/*\n\t\t\t\t\t\tsfsp := src.toInt32Slice()\n\t\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\t\tdfsp := dst.toInt32Slice()\n\t\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t\t*dfsp = []int64{}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t\tsfs := src.getInt32Slice()\n\t\t\t\t\tif sfs != nil {\n\t\t\t\t\t\tdfs := dst.getInt32Slice()\n\t\t\t\t\t\tdfs = append(dfs, sfs...)\n\t\t\t\t\t\tif dfs == nil {\n\t\t\t\t\t\t\tdfs = []int32{}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdst.setInt32Slice(dfs)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *int32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\t// NOTE: toInt32Ptr is not defined (see pointer_reflect.go).\n\t\t\t\t\t/*\n\t\t\t\t\t\tsfpp := src.toInt32Ptr()\n\t\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\t\tdfpp := dst.toInt32Ptr()\n\t\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t\t*dfpp = Int32(**sfpp)\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t\tsfp := src.getInt32Ptr()\n\t\t\t\t\tif sfp != nil {\n\t\t\t\t\t\tdfp := dst.getInt32Ptr()\n\t\t\t\t\t\tif dfp == nil {\n\t\t\t\t\t\t\tdst.setInt32Ptr(*sfp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t*dfp = *sfp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., int32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toInt32(); v != 0 {\n\t\t\t\t\t\t*dst.toInt32() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Int64:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []int64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toInt64Slice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toInt64Slice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []int64{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *int64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toInt64Ptr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toInt64Ptr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Int64(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., int64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toInt64(); v != 0 {\n\t\t\t\t\t\t*dst.toInt64() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Uint32:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []uint32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toUint32Slice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toUint32Slice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []uint32{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *uint32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toUint32Ptr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toUint32Ptr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Uint32(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., uint32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toUint32(); v != 0 {\n\t\t\t\t\t\t*dst.toUint32() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Uint64:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []uint64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toUint64Slice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toUint64Slice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []uint64{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *uint64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toUint64Ptr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toUint64Ptr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Uint64(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., uint64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toUint64(); v != 0 {\n\t\t\t\t\t\t*dst.toUint64() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Float32:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []float32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toFloat32Slice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toFloat32Slice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []float32{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *float32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toFloat32Ptr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toFloat32Ptr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Float32(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., float32\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toFloat32(); v != 0 {\n\t\t\t\t\t\t*dst.toFloat32() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Float64:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []float64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toFloat64Slice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toFloat64Slice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []float64{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *float64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toFloat64Ptr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toFloat64Ptr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Float64(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., float64\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toFloat64(); v != 0 {\n\t\t\t\t\t\t*dst.toFloat64() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Bool:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []bool\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toBoolSlice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toBoolSlice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []bool{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *bool\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toBoolPtr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toBoolPtr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = Bool(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., bool\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toBool(); v {\n\t\t\t\t\t\t*dst.toBool() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.String:\n\t\t\tswitch {\n\t\t\tcase isSlice: // E.g., []string\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfsp := src.toStringSlice()\n\t\t\t\t\tif *sfsp != nil {\n\t\t\t\t\t\tdfsp := dst.toStringSlice()\n\t\t\t\t\t\t*dfsp = append(*dfsp, *sfsp...)\n\t\t\t\t\t\tif *dfsp == nil {\n\t\t\t\t\t\t\t*dfsp = []string{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase isPointer: // E.g., *string\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsfpp := src.toStringPtr()\n\t\t\t\t\tif *sfpp != nil {\n\t\t\t\t\t\tdfpp := dst.toStringPtr()\n\t\t\t\t\t\tif *dfpp == nil {\n\t\t\t\t\t\t\t*dfpp = String(**sfpp)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t**dfpp = **sfpp\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., string\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tif v := *src.toString(); v != \"\" {\n\t\t\t\t\t\t*dst.toString() = v\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Slice:\n\t\t\tisProto3 := props.Prop[i].proto3\n\t\t\tswitch {\n\t\t\tcase isPointer:\n\t\t\t\tpanic(\"bad pointer in byte slice case in \" + tf.Name())\n\t\t\tcase tf.Elem().Kind() != reflect.Uint8:\n\t\t\t\tpanic(\"bad element kind in byte slice case in \" + tf.Name())\n\t\t\tcase isSlice: // E.g., [][]byte\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsbsp := src.toBytesSlice()\n\t\t\t\t\tif *sbsp != nil {\n\t\t\t\t\t\tdbsp := dst.toBytesSlice()\n\t\t\t\t\t\tfor _, sb := range *sbsp {\n\t\t\t\t\t\t\tif sb == nil {\n\t\t\t\t\t\t\t\t*dbsp = append(*dbsp, nil)\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t*dbsp = append(*dbsp, append([]byte{}, sb...))\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif *dbsp == nil {\n\t\t\t\t\t\t\t*dbsp = [][]byte{}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., []byte\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsbp := src.toBytes()\n\t\t\t\t\tif *sbp != nil {\n\t\t\t\t\t\tdbp := dst.toBytes()\n\t\t\t\t\t\tif !isProto3 || len(*sbp) > 0 {\n\t\t\t\t\t\t\t*dbp = append([]byte{}, *sbp...)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tswitch {\n\t\t\tcase !isPointer:\n\t\t\t\tpanic(fmt.Sprintf(\"message field %s without pointer\", tf))\n\t\t\tcase isSlice: // E.g., []*pb.T\n\t\t\t\tmi := getMergeInfo(tf)\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsps := src.getPointerSlice()\n\t\t\t\t\tif sps != nil {\n\t\t\t\t\t\tdps := dst.getPointerSlice()\n\t\t\t\t\t\tfor _, sp := range sps {\n\t\t\t\t\t\t\tvar dp pointer\n\t\t\t\t\t\t\tif !sp.isNil() {\n\t\t\t\t\t\t\t\tdp = valToPointer(reflect.New(tf))\n\t\t\t\t\t\t\t\tmi.merge(dp, sp)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdps = append(dps, dp)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif dps == nil {\n\t\t\t\t\t\t\tdps = []pointer{}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdst.setPointerSlice(dps)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault: // E.g., *pb.T\n\t\t\t\tmi := getMergeInfo(tf)\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsp := src.getPointer()\n\t\t\t\t\tif !sp.isNil() {\n\t\t\t\t\t\tdp := dst.getPointer()\n\t\t\t\t\t\tif dp.isNil() {\n\t\t\t\t\t\t\tdp = valToPointer(reflect.New(tf))\n\t\t\t\t\t\t\tdst.setPointer(dp)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmi.merge(dp, sp)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Map:\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(\"bad pointer or slice in map case in \" + tf.Name())\n\t\t\tdefault: // E.g., map[K]V\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsm := src.asPointerTo(tf).Elem()\n\t\t\t\t\tif sm.Len() == 0 {\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\tdm := dst.asPointerTo(tf).Elem()\n\t\t\t\t\tif dm.IsNil() {\n\t\t\t\t\t\tdm.Set(reflect.MakeMap(tf))\n\t\t\t\t\t}\n\n\t\t\t\t\tswitch tf.Elem().Kind() {\n\t\t\t\t\tcase reflect.Ptr: // Proto struct (e.g., *T)\n\t\t\t\t\t\tfor _, key := range sm.MapKeys() {\n\t\t\t\t\t\t\tval := sm.MapIndex(key)\n\t\t\t\t\t\t\tval = reflect.ValueOf(Clone(val.Interface().(Message)))\n\t\t\t\t\t\t\tdm.SetMapIndex(key, val)\n\t\t\t\t\t\t}\n\t\t\t\t\tcase reflect.Slice: // E.g. Bytes type (e.g., []byte)\n\t\t\t\t\t\tfor _, key := range sm.MapKeys() {\n\t\t\t\t\t\t\tval := sm.MapIndex(key)\n\t\t\t\t\t\t\tval = reflect.ValueOf(append([]byte{}, val.Bytes()...))\n\t\t\t\t\t\t\tdm.SetMapIndex(key, val)\n\t\t\t\t\t\t}\n\t\t\t\t\tdefault: // Basic type (e.g., string)\n\t\t\t\t\t\tfor _, key := range sm.MapKeys() {\n\t\t\t\t\t\t\tval := sm.MapIndex(key)\n\t\t\t\t\t\t\tdm.SetMapIndex(key, val)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Interface:\n\t\t\t// Must be oneof field.\n\t\t\tswitch {\n\t\t\tcase isPointer || isSlice:\n\t\t\t\tpanic(\"bad pointer or slice in interface case in \" + tf.Name())\n\t\t\tdefault: // E.g., interface{}\n\t\t\t\t// TODO: Make this faster?\n\t\t\t\tmfi.merge = func(dst, src pointer) {\n\t\t\t\t\tsu := src.asPointerTo(tf).Elem()\n\t\t\t\t\tif !su.IsNil() {\n\t\t\t\t\t\tdu := dst.asPointerTo(tf).Elem()\n\t\t\t\t\t\ttyp := su.Elem().Type()\n\t\t\t\t\t\tif du.IsNil() || du.Elem().Type() != typ {\n\t\t\t\t\t\t\tdu.Set(reflect.New(typ.Elem())) // Initialize interface if empty\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsv := su.Elem().Elem().Field(0)\n\t\t\t\t\t\tif sv.Kind() == reflect.Ptr && sv.IsNil() {\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdv := du.Elem().Elem().Field(0)\n\t\t\t\t\t\tif dv.Kind() == reflect.Ptr && dv.IsNil() {\n\t\t\t\t\t\t\tdv.Set(reflect.New(sv.Type().Elem())) // Initialize proto message if empty\n\t\t\t\t\t\t}\n\t\t\t\t\t\tswitch sv.Type().Kind() {\n\t\t\t\t\t\tcase reflect.Ptr: // Proto struct (e.g., *T)\n\t\t\t\t\t\t\tMerge(dv.Interface().(Message), sv.Interface().(Message))\n\t\t\t\t\t\tcase reflect.Slice: // E.g. Bytes type (e.g., []byte)\n\t\t\t\t\t\t\tdv.Set(reflect.ValueOf(append([]byte{}, sv.Bytes()...)))\n\t\t\t\t\t\tdefault: // Basic type (e.g., string)\n\t\t\t\t\t\t\tdv.Set(sv)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tpanic(fmt.Sprintf(\"merger not found for type:%s\", tf))\n\t\t}\n\t\tmi.fields = append(mi.fields, mfi)\n\t}\n\n\tmi.unrecognized = invalidField\n\tif f, ok := t.FieldByName(\"XXX_unrecognized\"); ok {\n\t\tif f.Type != reflect.TypeOf([]byte{}) {\n\t\t\tpanic(\"expected XXX_unrecognized to be of type []byte\")\n\t\t}\n\t\tmi.unrecognized = toField(&f)\n\t}\n\n\tatomic.StoreInt32(&mi.initialized, 1)\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/table_unmarshal.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2016 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"unicode/utf8\"\n)\n\n// Unmarshal is the entry point from the generated .pb.go files.\n// This function is not intended to be used by non-generated code.\n// This function is not subject to any compatibility guarantee.\n// msg contains a pointer to a protocol buffer struct.\n// b is the data to be unmarshaled into the protocol buffer.\n// a is a pointer to a place to store cached unmarshal information.\nfunc (a *InternalMessageInfo) Unmarshal(msg Message, b []byte) error {\n\t// Load the unmarshal information for this message type.\n\t// The atomic load ensures memory consistency.\n\tu := atomicLoadUnmarshalInfo(&a.unmarshal)\n\tif u == nil {\n\t\t// Slow path: find unmarshal info for msg, update a with it.\n\t\tu = getUnmarshalInfo(reflect.TypeOf(msg).Elem())\n\t\tatomicStoreUnmarshalInfo(&a.unmarshal, u)\n\t}\n\t// Then do the unmarshaling.\n\terr := u.unmarshal(toPointer(&msg), b)\n\treturn err\n}\n\ntype unmarshalInfo struct {\n\ttyp reflect.Type // type of the protobuf struct\n\n\t// 0 = only typ field is initialized\n\t// 1 = completely initialized\n\tinitialized int32\n\tlock sync.Mutex // prevents double initialization\n\tdense []unmarshalFieldInfo // fields indexed by tag #\n\tsparse map[uint64]unmarshalFieldInfo // fields indexed by tag #\n\treqFields []string // names of required fields\n\treqMask uint64 // 1< 0 {\n\t\t// Read tag and wire type.\n\t\t// Special case 1 and 2 byte varints.\n\t\tvar x uint64\n\t\tif b[0] < 128 {\n\t\t\tx = uint64(b[0])\n\t\t\tb = b[1:]\n\t\t} else if len(b) >= 2 && b[1] < 128 {\n\t\t\tx = uint64(b[0]&0x7f) + uint64(b[1])<<7\n\t\t\tb = b[2:]\n\t\t} else {\n\t\t\tvar n int\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t}\n\t\ttag := x >> 3\n\t\twire := int(x) & 7\n\n\t\t// Dispatch on the tag to one of the unmarshal* functions below.\n\t\tvar f unmarshalFieldInfo\n\t\tif tag < uint64(len(u.dense)) {\n\t\t\tf = u.dense[tag]\n\t\t} else {\n\t\t\tf = u.sparse[tag]\n\t\t}\n\t\tif fn := f.unmarshal; fn != nil {\n\t\t\tvar err error\n\t\t\tb, err = fn(b, m.offset(f.field), wire)\n\t\t\tif err == nil {\n\t\t\t\treqMask |= f.reqMask\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\t// Remember this error, but keep parsing. We need to produce\n\t\t\t\t// a full parse even if a required field is missing.\n\t\t\t\tif errLater == nil {\n\t\t\t\t\terrLater = r\n\t\t\t\t}\n\t\t\t\treqMask |= f.reqMask\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err != errInternalBadWireType {\n\t\t\t\tif err == errInvalidUTF8 {\n\t\t\t\t\tif errLater == nil {\n\t\t\t\t\t\tfullName := revProtoTypes[reflect.PtrTo(u.typ)] + \".\" + f.name\n\t\t\t\t\t\terrLater = &invalidUTF8Error{fullName}\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\treturn err\n\t\t\t}\n\t\t\t// Fragments with bad wire type are treated as unknown fields.\n\t\t}\n\n\t\t// Unknown tag.\n\t\tif !u.unrecognized.IsValid() {\n\t\t\t// Don't keep unrecognized data; just skip it.\n\t\t\tvar err error\n\t\t\tb, err = skipField(b, wire)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\t// Keep unrecognized data around.\n\t\t// maybe in extensions, maybe in the unrecognized field.\n\t\tz := m.offset(u.unrecognized).toBytes()\n\t\tvar emap map[int32]Extension\n\t\tvar e Extension\n\t\tfor _, r := range u.extensionRanges {\n\t\t\tif uint64(r.Start) <= tag && tag <= uint64(r.End) {\n\t\t\t\tif u.extensions.IsValid() {\n\t\t\t\t\tmp := m.offset(u.extensions).toExtensions()\n\t\t\t\t\temap = mp.extensionsWrite()\n\t\t\t\t\te = emap[int32(tag)]\n\t\t\t\t\tz = &e.enc\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tif u.oldExtensions.IsValid() {\n\t\t\t\t\tp := m.offset(u.oldExtensions).toOldExtensions()\n\t\t\t\t\temap = *p\n\t\t\t\t\tif emap == nil {\n\t\t\t\t\t\temap = map[int32]Extension{}\n\t\t\t\t\t\t*p = emap\n\t\t\t\t\t}\n\t\t\t\t\te = emap[int32(tag)]\n\t\t\t\t\tz = &e.enc\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tpanic(\"no extensions field available\")\n\t\t\t}\n\t\t}\n\n\t\t// Use wire type to skip data.\n\t\tvar err error\n\t\tb0 := b\n\t\tb, err = skipField(b, wire)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t*z = encodeVarint(*z, tag<<3|uint64(wire))\n\t\t*z = append(*z, b0[:len(b0)-len(b)]...)\n\n\t\tif emap != nil {\n\t\t\temap[int32(tag)] = e\n\t\t}\n\t}\n\tif reqMask != u.reqMask && errLater == nil {\n\t\t// A required field of this message is missing.\n\t\tfor _, n := range u.reqFields {\n\t\t\tif reqMask&1 == 0 {\n\t\t\t\terrLater = &RequiredNotSetError{n}\n\t\t\t}\n\t\t\treqMask >>= 1\n\t\t}\n\t}\n\treturn errLater\n}\n\n// computeUnmarshalInfo fills in u with information for use\n// in unmarshaling protocol buffers of type u.typ.\nfunc (u *unmarshalInfo) computeUnmarshalInfo() {\n\tu.lock.Lock()\n\tdefer u.lock.Unlock()\n\tif u.initialized != 0 {\n\t\treturn\n\t}\n\tt := u.typ\n\tn := t.NumField()\n\n\t// Set up the \"not found\" value for the unrecognized byte buffer.\n\t// This is the default for proto3.\n\tu.unrecognized = invalidField\n\tu.extensions = invalidField\n\tu.oldExtensions = invalidField\n\n\t// List of the generated type and offset for each oneof field.\n\ttype oneofField struct {\n\t\tityp reflect.Type // interface type of oneof field\n\t\tfield field // offset in containing message\n\t}\n\tvar oneofFields []oneofField\n\n\tfor i := 0; i < n; i++ {\n\t\tf := t.Field(i)\n\t\tif f.Name == \"XXX_unrecognized\" {\n\t\t\t// The byte slice used to hold unrecognized input is special.\n\t\t\tif f.Type != reflect.TypeOf(([]byte)(nil)) {\n\t\t\t\tpanic(\"bad type for XXX_unrecognized field: \" + f.Type.Name())\n\t\t\t}\n\t\t\tu.unrecognized = toField(&f)\n\t\t\tcontinue\n\t\t}\n\t\tif f.Name == \"XXX_InternalExtensions\" {\n\t\t\t// Ditto here.\n\t\t\tif f.Type != reflect.TypeOf(XXX_InternalExtensions{}) {\n\t\t\t\tpanic(\"bad type for XXX_InternalExtensions field: \" + f.Type.Name())\n\t\t\t}\n\t\t\tu.extensions = toField(&f)\n\t\t\tif f.Tag.Get(\"protobuf_messageset\") == \"1\" {\n\t\t\t\tu.isMessageSet = true\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif f.Name == \"XXX_extensions\" {\n\t\t\t// An older form of the extensions field.\n\t\t\tif f.Type != reflect.TypeOf((map[int32]Extension)(nil)) {\n\t\t\t\tpanic(\"bad type for XXX_extensions field: \" + f.Type.Name())\n\t\t\t}\n\t\t\tu.oldExtensions = toField(&f)\n\t\t\tcontinue\n\t\t}\n\t\tif f.Name == \"XXX_NoUnkeyedLiteral\" || f.Name == \"XXX_sizecache\" {\n\t\t\tcontinue\n\t\t}\n\n\t\toneof := f.Tag.Get(\"protobuf_oneof\")\n\t\tif oneof != \"\" {\n\t\t\toneofFields = append(oneofFields, oneofField{f.Type, toField(&f)})\n\t\t\t// The rest of oneof processing happens below.\n\t\t\tcontinue\n\t\t}\n\n\t\ttags := f.Tag.Get(\"protobuf\")\n\t\ttagArray := strings.Split(tags, \",\")\n\t\tif len(tagArray) < 2 {\n\t\t\tpanic(\"protobuf tag not enough fields in \" + t.Name() + \".\" + f.Name + \": \" + tags)\n\t\t}\n\t\ttag, err := strconv.Atoi(tagArray[1])\n\t\tif err != nil {\n\t\t\tpanic(\"protobuf tag field not an integer: \" + tagArray[1])\n\t\t}\n\n\t\tname := \"\"\n\t\tfor _, tag := range tagArray[3:] {\n\t\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\t\tname = tag[5:]\n\t\t\t}\n\t\t}\n\n\t\t// Extract unmarshaling function from the field (its type and tags).\n\t\tunmarshal := fieldUnmarshaler(&f)\n\n\t\t// Required field?\n\t\tvar reqMask uint64\n\t\tif tagArray[2] == \"req\" {\n\t\t\tbit := len(u.reqFields)\n\t\t\tu.reqFields = append(u.reqFields, name)\n\t\t\treqMask = uint64(1) << uint(bit)\n\t\t\t// TODO: if we have more than 64 required fields, we end up\n\t\t\t// not verifying that all required fields are present.\n\t\t\t// Fix this, perhaps using a count of required fields?\n\t\t}\n\n\t\t// Store the info in the correct slot in the message.\n\t\tu.setTag(tag, toField(&f), unmarshal, reqMask, name)\n\t}\n\n\t// Find any types associated with oneof fields.\n\tvar oneofImplementers []interface{}\n\tswitch m := reflect.Zero(reflect.PtrTo(t)).Interface().(type) {\n\tcase oneofFuncsIface:\n\t\t_, _, _, oneofImplementers = m.XXX_OneofFuncs()\n\tcase oneofWrappersIface:\n\t\toneofImplementers = m.XXX_OneofWrappers()\n\t}\n\tfor _, v := range oneofImplementers {\n\t\ttptr := reflect.TypeOf(v) // *Msg_X\n\t\ttyp := tptr.Elem() // Msg_X\n\n\t\tf := typ.Field(0) // oneof implementers have one field\n\t\tbaseUnmarshal := fieldUnmarshaler(&f)\n\t\ttags := strings.Split(f.Tag.Get(\"protobuf\"), \",\")\n\t\tfieldNum, err := strconv.Atoi(tags[1])\n\t\tif err != nil {\n\t\t\tpanic(\"protobuf tag field not an integer: \" + tags[1])\n\t\t}\n\t\tvar name string\n\t\tfor _, tag := range tags {\n\t\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\t\tname = strings.TrimPrefix(tag, \"name=\")\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\n\t\t// Find the oneof field that this struct implements.\n\t\t// Might take O(n^2) to process all of the oneofs, but who cares.\n\t\tfor _, of := range oneofFields {\n\t\t\tif tptr.Implements(of.ityp) {\n\t\t\t\t// We have found the corresponding interface for this struct.\n\t\t\t\t// That lets us know where this struct should be stored\n\t\t\t\t// when we encounter it during unmarshaling.\n\t\t\t\tunmarshal := makeUnmarshalOneof(typ, of.ityp, baseUnmarshal)\n\t\t\t\tu.setTag(fieldNum, of.field, unmarshal, 0, name)\n\t\t\t}\n\t\t}\n\n\t}\n\n\t// Get extension ranges, if any.\n\tfn := reflect.Zero(reflect.PtrTo(t)).MethodByName(\"ExtensionRangeArray\")\n\tif fn.IsValid() {\n\t\tif !u.extensions.IsValid() && !u.oldExtensions.IsValid() {\n\t\t\tpanic(\"a message with extensions, but no extensions field in \" + t.Name())\n\t\t}\n\t\tu.extensionRanges = fn.Call(nil)[0].Interface().([]ExtensionRange)\n\t}\n\n\t// Explicitly disallow tag 0. This will ensure we flag an error\n\t// when decoding a buffer of all zeros. Without this code, we\n\t// would decode and skip an all-zero buffer of even length.\n\t// [0 0] is [tag=0/wiretype=varint varint-encoded-0].\n\tu.setTag(0, zeroField, func(b []byte, f pointer, w int) ([]byte, error) {\n\t\treturn nil, fmt.Errorf(\"proto: %s: illegal tag 0 (wire type %d)\", t, w)\n\t}, 0, \"\")\n\n\t// Set mask for required field check.\n\tu.reqMask = uint64(1)<= 0 && (tag < 16 || tag < 2*n) { // TODO: what are the right numbers here?\n\t\tfor len(u.dense) <= tag {\n\t\t\tu.dense = append(u.dense, unmarshalFieldInfo{})\n\t\t}\n\t\tu.dense[tag] = i\n\t\treturn\n\t}\n\tif u.sparse == nil {\n\t\tu.sparse = map[uint64]unmarshalFieldInfo{}\n\t}\n\tu.sparse[uint64(tag)] = i\n}\n\n// fieldUnmarshaler returns an unmarshaler for the given field.\nfunc fieldUnmarshaler(f *reflect.StructField) unmarshaler {\n\tif f.Type.Kind() == reflect.Map {\n\t\treturn makeUnmarshalMap(f)\n\t}\n\treturn typeUnmarshaler(f.Type, f.Tag.Get(\"protobuf\"))\n}\n\n// typeUnmarshaler returns an unmarshaler for the given field type / field tag pair.\nfunc typeUnmarshaler(t reflect.Type, tags string) unmarshaler {\n\ttagArray := strings.Split(tags, \",\")\n\tencoding := tagArray[0]\n\tname := \"unknown\"\n\tproto3 := false\n\tvalidateUTF8 := true\n\tfor _, tag := range tagArray[3:] {\n\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\tname = tag[5:]\n\t\t}\n\t\tif tag == \"proto3\" {\n\t\t\tproto3 = true\n\t\t}\n\t}\n\tvalidateUTF8 = validateUTF8 && proto3\n\n\t// Figure out packaging (pointer, slice, or both)\n\tslice := false\n\tpointer := false\n\tif t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8 {\n\t\tslice = true\n\t\tt = t.Elem()\n\t}\n\tif t.Kind() == reflect.Ptr {\n\t\tpointer = true\n\t\tt = t.Elem()\n\t}\n\n\t// We'll never have both pointer and slice for basic types.\n\tif pointer && slice && t.Kind() != reflect.Struct {\n\t\tpanic(\"both pointer and slice for basic type in \" + t.Name())\n\t}\n\n\tswitch t.Kind() {\n\tcase reflect.Bool:\n\t\tif pointer {\n\t\t\treturn unmarshalBoolPtr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalBoolSlice\n\t\t}\n\t\treturn unmarshalBoolValue\n\tcase reflect.Int32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixedS32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixedS32Slice\n\t\t\t}\n\t\t\treturn unmarshalFixedS32Value\n\t\tcase \"varint\":\n\t\t\t// this could be int32 or enum\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalInt32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalInt32Slice\n\t\t\t}\n\t\t\treturn unmarshalInt32Value\n\t\tcase \"zigzag32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalSint32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalSint32Slice\n\t\t\t}\n\t\t\treturn unmarshalSint32Value\n\t\t}\n\tcase reflect.Int64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixedS64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixedS64Slice\n\t\t\t}\n\t\t\treturn unmarshalFixedS64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalInt64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalInt64Slice\n\t\t\t}\n\t\t\treturn unmarshalInt64Value\n\t\tcase \"zigzag64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalSint64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalSint64Slice\n\t\t\t}\n\t\t\treturn unmarshalSint64Value\n\t\t}\n\tcase reflect.Uint32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixed32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixed32Slice\n\t\t\t}\n\t\t\treturn unmarshalFixed32Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUint32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUint32Slice\n\t\t\t}\n\t\t\treturn unmarshalUint32Value\n\t\t}\n\tcase reflect.Uint64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixed64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixed64Slice\n\t\t\t}\n\t\t\treturn unmarshalFixed64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUint64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUint64Slice\n\t\t\t}\n\t\t\treturn unmarshalUint64Value\n\t\t}\n\tcase reflect.Float32:\n\t\tif pointer {\n\t\t\treturn unmarshalFloat32Ptr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalFloat32Slice\n\t\t}\n\t\treturn unmarshalFloat32Value\n\tcase reflect.Float64:\n\t\tif pointer {\n\t\t\treturn unmarshalFloat64Ptr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalFloat64Slice\n\t\t}\n\t\treturn unmarshalFloat64Value\n\tcase reflect.Map:\n\t\tpanic(\"map type in typeUnmarshaler in \" + t.Name())\n\tcase reflect.Slice:\n\t\tif pointer {\n\t\t\tpanic(\"bad pointer in slice case in \" + t.Name())\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalBytesSlice\n\t\t}\n\t\treturn unmarshalBytesValue\n\tcase reflect.String:\n\t\tif validateUTF8 {\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUTF8StringPtr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUTF8StringSlice\n\t\t\t}\n\t\t\treturn unmarshalUTF8StringValue\n\t\t}\n\t\tif pointer {\n\t\t\treturn unmarshalStringPtr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalStringSlice\n\t\t}\n\t\treturn unmarshalStringValue\n\tcase reflect.Struct:\n\t\t// message or group field\n\t\tif !pointer {\n\t\t\tpanic(fmt.Sprintf(\"message/group field %s:%s without pointer\", t, encoding))\n\t\t}\n\t\tswitch encoding {\n\t\tcase \"bytes\":\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalMessageSlicePtr(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalMessagePtr(getUnmarshalInfo(t), name)\n\t\tcase \"group\":\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalGroupSlicePtr(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalGroupPtr(getUnmarshalInfo(t), name)\n\t\t}\n\t}\n\tpanic(fmt.Sprintf(\"unmarshaler not found type:%s encoding:%s\", t, encoding))\n}\n\n// Below are all the unmarshalers for individual fields of various types.\n\nfunc unmarshalInt64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\t*f.toInt64() = v\n\treturn b, nil\n}\n\nfunc unmarshalInt64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\t*f.toInt64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalInt64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int64(x)\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalSint64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t*f.toInt64() = v\n\treturn b, nil\n}\n\nfunc unmarshalSint64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t*f.toInt64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalSint64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalUint64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\t*f.toUint64() = v\n\treturn b, nil\n}\n\nfunc unmarshalUint64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\t*f.toUint64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalUint64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := uint64(x)\n\t\t\ts := f.toUint64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\ts := f.toUint64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalInt32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\t*f.toInt32() = v\n\treturn b, nil\n}\n\nfunc unmarshalInt32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\tf.setInt32Ptr(v)\n\treturn b, nil\n}\n\nfunc unmarshalInt32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int32(x)\n\t\t\tf.appendInt32Slice(v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\tf.appendInt32Slice(v)\n\treturn b, nil\n}\n\nfunc unmarshalSint32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\t*f.toInt32() = v\n\treturn b, nil\n}\n\nfunc unmarshalSint32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\tf.setInt32Ptr(v)\n\treturn b, nil\n}\n\nfunc unmarshalSint32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int32(x>>1) ^ int32(x)<<31>>31\n\t\t\tf.appendInt32Slice(v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\tf.appendInt32Slice(v)\n\treturn b, nil\n}\n\nfunc unmarshalUint32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\t*f.toUint32() = v\n\treturn b, nil\n}\n\nfunc unmarshalUint32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\t*f.toUint32Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalUint32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := uint32(x)\n\t\t\ts := f.toUint32Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\ts := f.toUint32Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalFixed64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t*f.toUint64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t*f.toUint64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t\t\ts := f.toUint64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\ts := f.toUint64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t*f.toInt64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t*f.toInt64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t*f.toUint32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixed32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t*f.toUint32Ptr() = &v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixed32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t\t\ts := f.toUint32Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\ts := f.toUint32Slice()\n\t*s = append(*s, v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\t*f.toInt32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\tf.setInt32Ptr(v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\t\t\tf.appendInt32Slice(v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\tf.appendInt32Slice(v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalBoolValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\t// Note: any length varint is allowed, even though any sane\n\t// encoder will use one byte.\n\t// See https://github.com/golang/protobuf/issues/76\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\t// TODO: check if x>1? Tests seem to indicate no.\n\tv := x != 0\n\t*f.toBool() = v\n\treturn b[n:], nil\n}\n\nfunc unmarshalBoolPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := x != 0\n\t*f.toBoolPtr() = &v\n\treturn b[n:], nil\n}\n\nfunc unmarshalBoolSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := x != 0\n\t\t\ts := f.toBoolSlice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[n:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := x != 0\n\ts := f.toBoolSlice()\n\t*s = append(*s, v)\n\treturn b[n:], nil\n}\n\nfunc unmarshalFloat64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t*f.toFloat64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t*f.toFloat64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t\t\ts := f.toFloat64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\ts := f.toFloat64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t*f.toFloat32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFloat32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t*f.toFloat32Ptr() = &v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFloat32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t\t\ts := f.toFloat32Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\ts := f.toFloat32Slice()\n\t*s = append(*s, v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalStringValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toString() = v\n\treturn b[x:], nil\n}\n\nfunc unmarshalStringPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toStringPtr() = &v\n\treturn b[x:], nil\n}\n\nfunc unmarshalStringSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\ts := f.toStringSlice()\n\t*s = append(*s, v)\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toString() = v\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toStringPtr() = &v\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\ts := f.toStringSlice()\n\t*s = append(*s, v)\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nvar emptyBuf [0]byte\n\nfunc unmarshalBytesValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\t// The use of append here is a trick which avoids the zeroing\n\t// that would be required if we used a make/copy pair.\n\t// We append to emptyBuf instead of nil because we want\n\t// a non-nil result even when the length is 0.\n\tv := append(emptyBuf[:], b[:x]...)\n\t*f.toBytes() = v\n\treturn b[x:], nil\n}\n\nfunc unmarshalBytesSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := append(emptyBuf[:], b[:x]...)\n\ts := f.toBytesSlice()\n\t*s = append(*s, v)\n\treturn b[x:], nil\n}\n\nfunc makeUnmarshalMessagePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireBytes {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\t// First read the message field to see if something is there.\n\t\t// The semantics of multiple submessages are weird. Instead of\n\t\t// the last one winning (as it is for all other fields), multiple\n\t\t// submessages are merged.\n\t\tv := f.getPointer()\n\t\tif v.isNil() {\n\t\t\tv = valToPointer(reflect.New(sub.typ))\n\t\t\tf.setPointer(v)\n\t\t}\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn b[x:], err\n\t}\n}\n\nfunc makeUnmarshalMessageSlicePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireBytes {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := valToPointer(reflect.New(sub.typ))\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tf.appendPointer(v)\n\t\treturn b[x:], err\n\t}\n}\n\nfunc makeUnmarshalGroupPtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireStartGroup {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, y := findEndGroup(b)\n\t\tif x < 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := f.getPointer()\n\t\tif v.isNil() {\n\t\t\tv = valToPointer(reflect.New(sub.typ))\n\t\t\tf.setPointer(v)\n\t\t}\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn b[y:], err\n\t}\n}\n\nfunc makeUnmarshalGroupSlicePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireStartGroup {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, y := findEndGroup(b)\n\t\tif x < 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := valToPointer(reflect.New(sub.typ))\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tf.appendPointer(v)\n\t\treturn b[y:], err\n\t}\n}\n\nfunc makeUnmarshalMap(f *reflect.StructField) unmarshaler {\n\tt := f.Type\n\tkt := t.Key()\n\tvt := t.Elem()\n\tunmarshalKey := typeUnmarshaler(kt, f.Tag.Get(\"protobuf_key\"))\n\tunmarshalVal := typeUnmarshaler(vt, f.Tag.Get(\"protobuf_val\"))\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\t// The map entry is a submessage. Figure out how big it is.\n\t\tif w != WireBytes {\n\t\t\treturn nil, fmt.Errorf(\"proto: bad wiretype for map field: got %d want %d\", w, WireBytes)\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tr := b[x:] // unused data to return\n\t\tb = b[:x] // data for map entry\n\n\t\t// Note: we could use #keys * #values ~= 200 functions\n\t\t// to do map decoding without reflection. Probably not worth it.\n\t\t// Maps will be somewhat slow. Oh well.\n\n\t\t// Read key and value from data.\n\t\tvar nerr nonFatal\n\t\tk := reflect.New(kt)\n\t\tv := reflect.New(vt)\n\t\tfor len(b) > 0 {\n\t\t\tx, n := decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\twire := int(x) & 7\n\t\t\tb = b[n:]\n\n\t\t\tvar err error\n\t\t\tswitch x >> 3 {\n\t\t\tcase 1:\n\t\t\t\tb, err = unmarshalKey(b, valToPointer(k), wire)\n\t\t\tcase 2:\n\t\t\t\tb, err = unmarshalVal(b, valToPointer(v), wire)\n\t\t\tdefault:\n\t\t\t\terr = errInternalBadWireType // skip unknown tag\n\t\t\t}\n\n\t\t\tif nerr.Merge(err) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err != errInternalBadWireType {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\t// Skip past unknown fields.\n\t\t\tb, err = skipField(b, wire)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\n\t\t// Get map, allocate if needed.\n\t\tm := f.asPointerTo(t).Elem() // an addressable map[K]T\n\t\tif m.IsNil() {\n\t\t\tm.Set(reflect.MakeMap(t))\n\t\t}\n\n\t\t// Insert into map.\n\t\tm.SetMapIndex(k.Elem(), v.Elem())\n\n\t\treturn r, nerr.E\n\t}\n}\n\n// makeUnmarshalOneof makes an unmarshaler for oneof fields.\n// for:\n// message Msg {\n// oneof F {\n// int64 X = 1;\n// float64 Y = 2;\n// }\n// }\n// typ is the type of the concrete entry for a oneof case (e.g. Msg_X).\n// ityp is the interface type of the oneof field (e.g. isMsg_F).\n// unmarshal is the unmarshaler for the base type of the oneof case (e.g. int64).\n// Note that this function will be called once for each case in the oneof.\nfunc makeUnmarshalOneof(typ, ityp reflect.Type, unmarshal unmarshaler) unmarshaler {\n\tsf := typ.Field(0)\n\tfield0 := toField(&sf)\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\t// Allocate holder for value.\n\t\tv := reflect.New(typ)\n\n\t\t// Unmarshal data into holder.\n\t\t// We unmarshal into the first field of the holder object.\n\t\tvar err error\n\t\tvar nerr nonFatal\n\t\tb, err = unmarshal(b, valToPointer(v).offset(field0), w)\n\t\tif !nerr.Merge(err) {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// Write pointer to holder into target field.\n\t\tf.asPointerTo(ityp).Elem().Set(v)\n\n\t\treturn b, nerr.E\n\t}\n}\n\n// Error used by decode internally.\nvar errInternalBadWireType = errors.New(\"proto: internal error: bad wiretype\")\n\n// skipField skips past a field of type wire and returns the remaining bytes.\nfunc skipField(b []byte, wire int) ([]byte, error) {\n\tswitch wire {\n\tcase WireVarint:\n\t\t_, k := decodeVarint(b)\n\t\tif k == 0 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[k:]\n\tcase WireFixed32:\n\t\tif len(b) < 4 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[4:]\n\tcase WireFixed64:\n\t\tif len(b) < 8 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[8:]\n\tcase WireBytes:\n\t\tm, k := decodeVarint(b)\n\t\tif k == 0 || uint64(len(b)-k) < m {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[uint64(k)+m:]\n\tcase WireStartGroup:\n\t\t_, i := findEndGroup(b)\n\t\tif i == -1 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[i:]\n\tdefault:\n\t\treturn b, fmt.Errorf(\"proto: can't skip unknown wire type %d\", wire)\n\t}\n\treturn b, nil\n}\n\n// findEndGroup finds the index of the next EndGroup tag.\n// Groups may be nested, so the \"next\" EndGroup tag is the first\n// unpaired EndGroup.\n// findEndGroup returns the indexes of the start and end of the EndGroup tag.\n// Returns (-1,-1) if it can't find one.\nfunc findEndGroup(b []byte) (int, int) {\n\tdepth := 1\n\ti := 0\n\tfor {\n\t\tx, n := decodeVarint(b[i:])\n\t\tif n == 0 {\n\t\t\treturn -1, -1\n\t\t}\n\t\tj := i\n\t\ti += n\n\t\tswitch x & 7 {\n\t\tcase WireVarint:\n\t\t\t_, k := decodeVarint(b[i:])\n\t\t\tif k == 0 {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += k\n\t\tcase WireFixed32:\n\t\t\tif len(b)-4 < i {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += 4\n\t\tcase WireFixed64:\n\t\t\tif len(b)-8 < i {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += 8\n\t\tcase WireBytes:\n\t\t\tm, k := decodeVarint(b[i:])\n\t\t\tif k == 0 {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += k\n\t\t\tif uint64(len(b)-i) < m {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += int(m)\n\t\tcase WireStartGroup:\n\t\t\tdepth++\n\t\tcase WireEndGroup:\n\t\t\tdepth--\n\t\t\tif depth == 0 {\n\t\t\t\treturn j, i\n\t\t\t}\n\t\tdefault:\n\t\t\treturn -1, -1\n\t\t}\n\t}\n}\n\n// encodeVarint appends a varint-encoded integer to b and returns the result.\nfunc encodeVarint(b []byte, x uint64) []byte {\n\tfor x >= 1<<7 {\n\t\tb = append(b, byte(x&0x7f|0x80))\n\t\tx >>= 7\n\t}\n\treturn append(b, byte(x))\n}\n\n// decodeVarint reads a varint-encoded integer from b.\n// Returns the decoded integer and the number of bytes read.\n// If there is an error, it returns 0,0.\nfunc decodeVarint(b []byte) (uint64, int) {\n\tvar x, y uint64\n\tif len(b) == 0 {\n\t\tgoto bad\n\t}\n\tx = uint64(b[0])\n\tif x < 0x80 {\n\t\treturn x, 1\n\t}\n\tx -= 0x80\n\n\tif len(b) <= 1 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[1])\n\tx += y << 7\n\tif y < 0x80 {\n\t\treturn x, 2\n\t}\n\tx -= 0x80 << 7\n\n\tif len(b) <= 2 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[2])\n\tx += y << 14\n\tif y < 0x80 {\n\t\treturn x, 3\n\t}\n\tx -= 0x80 << 14\n\n\tif len(b) <= 3 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[3])\n\tx += y << 21\n\tif y < 0x80 {\n\t\treturn x, 4\n\t}\n\tx -= 0x80 << 21\n\n\tif len(b) <= 4 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[4])\n\tx += y << 28\n\tif y < 0x80 {\n\t\treturn x, 5\n\t}\n\tx -= 0x80 << 28\n\n\tif len(b) <= 5 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[5])\n\tx += y << 35\n\tif y < 0x80 {\n\t\treturn x, 6\n\t}\n\tx -= 0x80 << 35\n\n\tif len(b) <= 6 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[6])\n\tx += y << 42\n\tif y < 0x80 {\n\t\treturn x, 7\n\t}\n\tx -= 0x80 << 42\n\n\tif len(b) <= 7 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[7])\n\tx += y << 49\n\tif y < 0x80 {\n\t\treturn x, 8\n\t}\n\tx -= 0x80 << 49\n\n\tif len(b) <= 8 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[8])\n\tx += y << 56\n\tif y < 0x80 {\n\t\treturn x, 9\n\t}\n\tx -= 0x80 << 56\n\n\tif len(b) <= 9 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[9])\n\tx += y << 63\n\tif y < 2 {\n\t\treturn x, 10\n\t}\n\nbad:\n\treturn 0, 0\n}\n" }, { "path": "vendor/github.com/golang/protobuf/proto/text.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n// Functions for writing the text protocol buffer format.\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"encoding\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"log\"\n\t\"math\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strings\"\n)\n\nvar (\n\tnewline = []byte(\"\\n\")\n\tspaces = []byte(\" \")\n\tendBraceNewline = []byte(\"}\\n\")\n\tbackslashN = []byte{'\\\\', 'n'}\n\tbackslashR = []byte{'\\\\', 'r'}\n\tbackslashT = []byte{'\\\\', 't'}\n\tbackslashDQ = []byte{'\\\\', '\"'}\n\tbackslashBS = []byte{'\\\\', '\\\\'}\n\tposInf = []byte(\"inf\")\n\tnegInf = []byte(\"-inf\")\n\tnan = []byte(\"nan\")\n)\n\ntype writer interface {\n\tio.Writer\n\tWriteByte(byte) error\n}\n\n// textWriter is an io.Writer that tracks its indentation level.\ntype textWriter struct {\n\tind int\n\tcomplete bool // if the current position is a complete line\n\tcompact bool // whether to write out as a one-liner\n\tw writer\n}\n\nfunc (w *textWriter) WriteString(s string) (n int, err error) {\n\tif !strings.Contains(s, \"\\n\") {\n\t\tif !w.compact && w.complete {\n\t\t\tw.writeIndent()\n\t\t}\n\t\tw.complete = false\n\t\treturn io.WriteString(w.w, s)\n\t}\n\t// WriteString is typically called without newlines, so this\n\t// codepath and its copy are rare. We copy to avoid\n\t// duplicating all of Write's logic here.\n\treturn w.Write([]byte(s))\n}\n\nfunc (w *textWriter) Write(p []byte) (n int, err error) {\n\tnewlines := bytes.Count(p, newline)\n\tif newlines == 0 {\n\t\tif !w.compact && w.complete {\n\t\t\tw.writeIndent()\n\t\t}\n\t\tn, err = w.w.Write(p)\n\t\tw.complete = false\n\t\treturn n, err\n\t}\n\n\tfrags := bytes.SplitN(p, newline, newlines+1)\n\tif w.compact {\n\t\tfor i, frag := range frags {\n\t\t\tif i > 0 {\n\t\t\t\tif err := w.w.WriteByte(' '); err != nil {\n\t\t\t\t\treturn n, err\n\t\t\t\t}\n\t\t\t\tn++\n\t\t\t}\n\t\t\tnn, err := w.w.Write(frag)\n\t\t\tn += nn\n\t\t\tif err != nil {\n\t\t\t\treturn n, err\n\t\t\t}\n\t\t}\n\t\treturn n, nil\n\t}\n\n\tfor i, frag := range frags {\n\t\tif w.complete {\n\t\t\tw.writeIndent()\n\t\t}\n\t\tnn, err := w.w.Write(frag)\n\t\tn += nn\n\t\tif err != nil {\n\t\t\treturn n, err\n\t\t}\n\t\tif i+1 < len(frags) {\n\t\t\tif err := w.w.WriteByte('\\n'); err != nil {\n\t\t\t\treturn n, err\n\t\t\t}\n\t\t\tn++\n\t\t}\n\t}\n\tw.complete = len(frags[len(frags)-1]) == 0\n\treturn n, nil\n}\n\nfunc (w *textWriter) WriteByte(c byte) error {\n\tif w.compact && c == '\\n' {\n\t\tc = ' '\n\t}\n\tif !w.compact && w.complete {\n\t\tw.writeIndent()\n\t}\n\terr := w.w.WriteByte(c)\n\tw.complete = c == '\\n'\n\treturn err\n}\n\nfunc (w *textWriter) indent() { w.ind++ }\n\nfunc (w *textWriter) unindent() {\n\tif w.ind == 0 {\n\t\tlog.Print(\"proto: textWriter unindented too far\")\n\t\treturn\n\t}\n\tw.ind--\n}\n\nfunc writeName(w *textWriter, props *Properties) error {\n\tif _, err := w.WriteString(props.OrigName); err != nil {\n\t\treturn err\n\t}\n\tif props.Wire != \"group\" {\n\t\treturn w.WriteByte(':')\n\t}\n\treturn nil\n}\n\nfunc requiresQuotes(u string) bool {\n\t// When type URL contains any characters except [0-9A-Za-z./\\-]*, it must be quoted.\n\tfor _, ch := range u {\n\t\tswitch {\n\t\tcase ch == '.' || ch == '/' || ch == '_':\n\t\t\tcontinue\n\t\tcase '0' <= ch && ch <= '9':\n\t\t\tcontinue\n\t\tcase 'A' <= ch && ch <= 'Z':\n\t\t\tcontinue\n\t\tcase 'a' <= ch && ch <= 'z':\n\t\t\tcontinue\n\t\tdefault:\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// isAny reports whether sv is a google.protobuf.Any message\nfunc isAny(sv reflect.Value) bool {\n\ttype wkt interface {\n\t\tXXX_WellKnownType() string\n\t}\n\tt, ok := sv.Addr().Interface().(wkt)\n\treturn ok && t.XXX_WellKnownType() == \"Any\"\n}\n\n// writeProto3Any writes an expanded google.protobuf.Any message.\n//\n// It returns (false, nil) if sv value can't be unmarshaled (e.g. because\n// required messages are not linked in).\n//\n// It returns (true, error) when sv was written in expanded format or an error\n// was encountered.\nfunc (tm *TextMarshaler) writeProto3Any(w *textWriter, sv reflect.Value) (bool, error) {\n\tturl := sv.FieldByName(\"TypeUrl\")\n\tval := sv.FieldByName(\"Value\")\n\tif !turl.IsValid() || !val.IsValid() {\n\t\treturn true, errors.New(\"proto: invalid google.protobuf.Any message\")\n\t}\n\n\tb, ok := val.Interface().([]byte)\n\tif !ok {\n\t\treturn true, errors.New(\"proto: invalid google.protobuf.Any message\")\n\t}\n\n\tparts := strings.Split(turl.String(), \"/\")\n\tmt := MessageType(parts[len(parts)-1])\n\tif mt == nil {\n\t\treturn false, nil\n\t}\n\tm := reflect.New(mt.Elem())\n\tif err := Unmarshal(b, m.Interface().(Message)); err != nil {\n\t\treturn false, nil\n\t}\n\tw.Write([]byte(\"[\"))\n\tu := turl.String()\n\tif requiresQuotes(u) {\n\t\twriteString(w, u)\n\t} else {\n\t\tw.Write([]byte(u))\n\t}\n\tif w.compact {\n\t\tw.Write([]byte(\"]:<\"))\n\t} else {\n\t\tw.Write([]byte(\"]: <\\n\"))\n\t\tw.ind++\n\t}\n\tif err := tm.writeStruct(w, m.Elem()); err != nil {\n\t\treturn true, err\n\t}\n\tif w.compact {\n\t\tw.Write([]byte(\"> \"))\n\t} else {\n\t\tw.ind--\n\t\tw.Write([]byte(\">\\n\"))\n\t}\n\treturn true, nil\n}\n\nfunc (tm *TextMarshaler) writeStruct(w *textWriter, sv reflect.Value) error {\n\tif tm.ExpandAny && isAny(sv) {\n\t\tif canExpand, err := tm.writeProto3Any(w, sv); canExpand {\n\t\t\treturn err\n\t\t}\n\t}\n\tst := sv.Type()\n\tsprops := GetProperties(st)\n\tfor i := 0; i < sv.NumField(); i++ {\n\t\tfv := sv.Field(i)\n\t\tprops := sprops.Prop[i]\n\t\tname := st.Field(i).Name\n\n\t\tif name == \"XXX_NoUnkeyedLiteral\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tif strings.HasPrefix(name, \"XXX_\") {\n\t\t\t// There are two XXX_ fields:\n\t\t\t// XXX_unrecognized []byte\n\t\t\t// XXX_extensions map[int32]proto.Extension\n\t\t\t// The first is handled here;\n\t\t\t// the second is handled at the bottom of this function.\n\t\t\tif name == \"XXX_unrecognized\" && !fv.IsNil() {\n\t\t\t\tif err := writeUnknownStruct(w, fv.Interface().([]byte)); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif fv.Kind() == reflect.Ptr && fv.IsNil() {\n\t\t\t// Field not filled in. This could be an optional field or\n\t\t\t// a required field that wasn't filled in. Either way, there\n\t\t\t// isn't anything we can show for it.\n\t\t\tcontinue\n\t\t}\n\t\tif fv.Kind() == reflect.Slice && fv.IsNil() {\n\t\t\t// Repeated field that is empty, or a bytes field that is unused.\n\t\t\tcontinue\n\t\t}\n\n\t\tif props.Repeated && fv.Kind() == reflect.Slice {\n\t\t\t// Repeated field.\n\t\t\tfor j := 0; j < fv.Len(); j++ {\n\t\t\t\tif err := writeName(w, props); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif !w.compact {\n\t\t\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tv := fv.Index(j)\n\t\t\t\tif v.Kind() == reflect.Ptr && v.IsNil() {\n\t\t\t\t\t// A nil message in a repeated field is not valid,\n\t\t\t\t\t// but we can handle that more gracefully than panicking.\n\t\t\t\t\tif _, err := w.Write([]byte(\"\\n\")); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif err := tm.writeAny(w, v, props); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif fv.Kind() == reflect.Map {\n\t\t\t// Map fields are rendered as a repeated struct with key/value fields.\n\t\t\tkeys := fv.MapKeys()\n\t\t\tsort.Sort(mapKeys(keys))\n\t\t\tfor _, key := range keys {\n\t\t\t\tval := fv.MapIndex(key)\n\t\t\t\tif err := writeName(w, props); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif !w.compact {\n\t\t\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// open struct\n\t\t\t\tif err := w.WriteByte('<'); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif !w.compact {\n\t\t\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tw.indent()\n\t\t\t\t// key\n\t\t\t\tif _, err := w.WriteString(\"key:\"); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif !w.compact {\n\t\t\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif err := tm.writeAny(w, key, props.MapKeyProp); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\t// nil values aren't legal, but we can avoid panicking because of them.\n\t\t\t\tif val.Kind() != reflect.Ptr || !val.IsNil() {\n\t\t\t\t\t// value\n\t\t\t\t\tif _, err := w.WriteString(\"value:\"); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif !w.compact {\n\t\t\t\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif err := tm.writeAny(w, val, props.MapValProp); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// close struct\n\t\t\t\tw.unindent()\n\t\t\t\tif err := w.WriteByte('>'); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif props.proto3 && fv.Kind() == reflect.Slice && fv.Len() == 0 {\n\t\t\t// empty bytes field\n\t\t\tcontinue\n\t\t}\n\t\tif fv.Kind() != reflect.Ptr && fv.Kind() != reflect.Slice {\n\t\t\t// proto3 non-repeated scalar field; skip if zero value\n\t\t\tif isProto3Zero(fv) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tif fv.Kind() == reflect.Interface {\n\t\t\t// Check if it is a oneof.\n\t\t\tif st.Field(i).Tag.Get(\"protobuf_oneof\") != \"\" {\n\t\t\t\t// fv is nil, or holds a pointer to generated struct.\n\t\t\t\t// That generated struct has exactly one field,\n\t\t\t\t// which has a protobuf struct tag.\n\t\t\t\tif fv.IsNil() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tinner := fv.Elem().Elem() // interface -> *T -> T\n\t\t\t\ttag := inner.Type().Field(0).Tag.Get(\"protobuf\")\n\t\t\t\tprops = new(Properties) // Overwrite the outer props var, but not its pointee.\n\t\t\t\tprops.Parse(tag)\n\t\t\t\t// Write the value in the oneof, not the oneof itself.\n\t\t\t\tfv = inner.Field(0)\n\n\t\t\t\t// Special case to cope with malformed messages gracefully:\n\t\t\t\t// If the value in the oneof is a nil pointer, don't panic\n\t\t\t\t// in writeAny.\n\t\t\t\tif fv.Kind() == reflect.Ptr && fv.IsNil() {\n\t\t\t\t\t// Use errors.New so writeAny won't render quotes.\n\t\t\t\t\tmsg := errors.New(\"/* nil */\")\n\t\t\t\t\tfv = reflect.ValueOf(&msg).Elem()\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif err := writeName(w, props); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif !w.compact {\n\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\t\t// Enums have a String method, so writeAny will work fine.\n\t\tif err := tm.writeAny(w, fv, props); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\t// Extensions (the XXX_extensions field).\n\tpv := sv.Addr()\n\tif _, err := extendable(pv.Interface()); err == nil {\n\t\tif err := tm.writeExtensions(w, pv); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// writeAny writes an arbitrary field.\nfunc (tm *TextMarshaler) writeAny(w *textWriter, v reflect.Value, props *Properties) error {\n\tv = reflect.Indirect(v)\n\n\t// Floats have special cases.\n\tif v.Kind() == reflect.Float32 || v.Kind() == reflect.Float64 {\n\t\tx := v.Float()\n\t\tvar b []byte\n\t\tswitch {\n\t\tcase math.IsInf(x, 1):\n\t\t\tb = posInf\n\t\tcase math.IsInf(x, -1):\n\t\t\tb = negInf\n\t\tcase math.IsNaN(x):\n\t\t\tb = nan\n\t\t}\n\t\tif b != nil {\n\t\t\t_, err := w.Write(b)\n\t\t\treturn err\n\t\t}\n\t\t// Other values are handled below.\n\t}\n\n\t// We don't attempt to serialise every possible value type; only those\n\t// that can occur in protocol buffers.\n\tswitch v.Kind() {\n\tcase reflect.Slice:\n\t\t// Should only be a []byte; repeated fields are handled in writeStruct.\n\t\tif err := writeString(w, string(v.Bytes())); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase reflect.String:\n\t\tif err := writeString(w, v.String()); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase reflect.Struct:\n\t\t// Required/optional group/message.\n\t\tvar bra, ket byte = '<', '>'\n\t\tif props != nil && props.Wire == \"group\" {\n\t\t\tbra, ket = '{', '}'\n\t\t}\n\t\tif err := w.WriteByte(bra); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif !w.compact {\n\t\t\tif err := w.WriteByte('\\n'); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tw.indent()\n\t\tif v.CanAddr() {\n\t\t\t// Calling v.Interface on a struct causes the reflect package to\n\t\t\t// copy the entire struct. This is racy with the new Marshaler\n\t\t\t// since we atomically update the XXX_sizecache.\n\t\t\t//\n\t\t\t// Thus, we retrieve a pointer to the struct if possible to avoid\n\t\t\t// a race since v.Interface on the pointer doesn't copy the struct.\n\t\t\t//\n\t\t\t// If v is not addressable, then we are not worried about a race\n\t\t\t// since it implies that the binary Marshaler cannot possibly be\n\t\t\t// mutating this value.\n\t\t\tv = v.Addr()\n\t\t}\n\t\tif etm, ok := v.Interface().(encoding.TextMarshaler); ok {\n\t\t\ttext, err := etm.MarshalText()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif _, err = w.Write(text); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t} else {\n\t\t\tif v.Kind() == reflect.Ptr {\n\t\t\t\tv = v.Elem()\n\t\t\t}\n\t\t\tif err := tm.writeStruct(w, v); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tw.unindent()\n\t\tif err := w.WriteByte(ket); err != nil {\n\t\t\treturn err\n\t\t}\n\tdefault:\n\t\t_, err := fmt.Fprint(w, v.Interface())\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// equivalent to C's isprint.\nfunc isprint(c byte) bool {\n\treturn c >= 0x20 && c < 0x7f\n}\n\n// writeString writes a string in the protocol buffer text format.\n// It is similar to strconv.Quote except we don't use Go escape sequences,\n// we treat the string as a byte sequence, and we use octal escapes.\n// These differences are to maintain interoperability with the other\n// languages' implementations of the text format.\nfunc writeString(w *textWriter, s string) error {\n\t// use WriteByte here to get any needed indent\n\tif err := w.WriteByte('\"'); err != nil {\n\t\treturn err\n\t}\n\t// Loop over the bytes, not the runes.\n\tfor i := 0; i < len(s); i++ {\n\t\tvar err error\n\t\t// Divergence from C++: we don't escape apostrophes.\n\t\t// There's no need to escape them, and the C++ parser\n\t\t// copes with a naked apostrophe.\n\t\tswitch c := s[i]; c {\n\t\tcase '\\n':\n\t\t\t_, err = w.w.Write(backslashN)\n\t\tcase '\\r':\n\t\t\t_, err = w.w.Write(backslashR)\n\t\tcase '\\t':\n\t\t\t_, err = w.w.Write(backslashT)\n\t\tcase '\"':\n\t\t\t_, err = w.w.Write(backslashDQ)\n\t\tcase '\\\\':\n\t\t\t_, err = w.w.Write(backslashBS)\n\t\tdefault:\n\t\t\tif isprint(c) {\n\t\t\t\terr = w.w.WriteByte(c)\n\t\t\t} else {\n\t\t\t\t_, err = fmt.Fprintf(w.w, \"\\\\%03o\", c)\n\t\t\t}\n\t\t}\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn w.WriteByte('\"')\n}\n\nfunc writeUnknownStruct(w *textWriter, data []byte) (err error) {\n\tif !w.compact {\n\t\tif _, err := fmt.Fprintf(w, \"/* %d unknown bytes */\\n\", len(data)); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tb := NewBuffer(data)\n\tfor b.index < len(b.buf) {\n\t\tx, err := b.DecodeVarint()\n\t\tif err != nil {\n\t\t\t_, err := fmt.Fprintf(w, \"/* %v */\\n\", err)\n\t\t\treturn err\n\t\t}\n\t\twire, tag := x&7, x>>3\n\t\tif wire == WireEndGroup {\n\t\t\tw.unindent()\n\t\t\tif _, err := w.Write(endBraceNewline); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif _, err := fmt.Fprint(w, tag); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif wire != WireStartGroup {\n\t\t\tif err := w.WriteByte(':'); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tif !w.compact || wire == WireStartGroup {\n\t\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tswitch wire {\n\t\tcase WireBytes:\n\t\t\tbuf, e := b.DecodeRawBytes(false)\n\t\t\tif e == nil {\n\t\t\t\t_, err = fmt.Fprintf(w, \"%q\", buf)\n\t\t\t} else {\n\t\t\t\t_, err = fmt.Fprintf(w, \"/* %v */\", e)\n\t\t\t}\n\t\tcase WireFixed32:\n\t\t\tx, err = b.DecodeFixed32()\n\t\t\terr = writeUnknownInt(w, x, err)\n\t\tcase WireFixed64:\n\t\t\tx, err = b.DecodeFixed64()\n\t\t\terr = writeUnknownInt(w, x, err)\n\t\tcase WireStartGroup:\n\t\t\terr = w.WriteByte('{')\n\t\t\tw.indent()\n\t\tcase WireVarint:\n\t\t\tx, err = b.DecodeVarint()\n\t\t\terr = writeUnknownInt(w, x, err)\n\t\tdefault:\n\t\t\t_, err = fmt.Fprintf(w, \"/* unknown wire type %d */\", wire)\n\t\t}\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err = w.WriteByte('\\n'); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc writeUnknownInt(w *textWriter, x uint64, err error) error {\n\tif err == nil {\n\t\t_, err = fmt.Fprint(w, x)\n\t} else {\n\t\t_, err = fmt.Fprintf(w, \"/* %v */\", err)\n\t}\n\treturn err\n}\n\ntype int32Slice []int32\n\nfunc (s int32Slice) Len() int { return len(s) }\nfunc (s int32Slice) Less(i, j int) bool { return s[i] < s[j] }\nfunc (s int32Slice) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\n\n// writeExtensions writes all the extensions in pv.\n// pv is assumed to be a pointer to a protocol message struct that is extendable.\nfunc (tm *TextMarshaler) writeExtensions(w *textWriter, pv reflect.Value) error {\n\temap := extensionMaps[pv.Type().Elem()]\n\tep, _ := extendable(pv.Interface())\n\n\t// Order the extensions by ID.\n\t// This isn't strictly necessary, but it will give us\n\t// canonical output, which will also make testing easier.\n\tm, mu := ep.extensionsRead()\n\tif m == nil {\n\t\treturn nil\n\t}\n\tmu.Lock()\n\tids := make([]int32, 0, len(m))\n\tfor id := range m {\n\t\tids = append(ids, id)\n\t}\n\tsort.Sort(int32Slice(ids))\n\tmu.Unlock()\n\n\tfor _, extNum := range ids {\n\t\text := m[extNum]\n\t\tvar desc *ExtensionDesc\n\t\tif emap != nil {\n\t\t\tdesc = emap[extNum]\n\t\t}\n\t\tif desc == nil {\n\t\t\t// Unknown extension.\n\t\t\tif err := writeUnknownStruct(w, ext.enc); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tpb, err := GetExtension(ep, desc)\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"failed getting extension: %v\", err)\n\t\t}\n\n\t\t// Repeated extensions will appear as a slice.\n\t\tif !desc.repeated() {\n\t\t\tif err := tm.writeExtension(w, desc.Name, pb); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t} else {\n\t\t\tv := reflect.ValueOf(pb)\n\t\t\tfor i := 0; i < v.Len(); i++ {\n\t\t\t\tif err := tm.writeExtension(w, desc.Name, v.Index(i).Interface()); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (tm *TextMarshaler) writeExtension(w *textWriter, name string, pb interface{}) error {\n\tif _, err := fmt.Fprintf(w, \"[%s]:\", name); err != nil {\n\t\treturn err\n\t}\n\tif !w.compact {\n\t\tif err := w.WriteByte(' '); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tif err := tm.writeAny(w, reflect.ValueOf(pb), nil); err != nil {\n\t\treturn err\n\t}\n\tif err := w.WriteByte('\\n'); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (w *textWriter) writeIndent() {\n\tif !w.complete {\n\t\treturn\n\t}\n\tremain := w.ind * 2\n\tfor remain > 0 {\n\t\tn := remain\n\t\tif n > len(spaces) {\n\t\t\tn = len(spaces)\n\t\t}\n\t\tw.w.Write(spaces[:n])\n\t\tremain -= n\n\t}\n\tw.complete = false\n}\n\n// TextMarshaler is a configurable text format marshaler.\ntype TextMarshaler struct {\n\tCompact bool // use compact text format (one line).\n\tExpandAny bool // expand google.protobuf.Any messages of known types\n}\n\n// Marshal writes a given protocol buffer in text format.\n// The only errors returned are from w.\nfunc (tm *TextMarshaler) Marshal(w io.Writer, pb Message) error {\n\tval := reflect.ValueOf(pb)\n\tif pb == nil || val.IsNil() {\n\t\tw.Write([]byte(\"\"))\n\t\treturn nil\n\t}\n\tvar bw *bufio.Writer\n\tww, ok := w.(writer)\n\tif !ok {\n\t\tbw = bufio.NewWriter(w)\n\t\tww = bw\n\t}\n\taw := &textWriter{\n\t\tw: ww,\n\t\tcomplete: true,\n\t\tcompact: tm.Compact,\n\t}\n\n\tif etm, ok := pb.(encoding.TextMarshaler); ok {\n\t\ttext, err := etm.MarshalText()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif _, err = aw.Write(text); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif bw != nil {\n\t\t\treturn bw.Flush()\n\t\t}\n\t\treturn nil\n\t}\n\t// Dereference the received pointer so we don't have outer < and >.\n\tv := reflect.Indirect(val)\n\tif err := tm.writeStruct(aw, v); err != nil {\n\t\treturn err\n\t}\n\tif bw != nil {\n\t\treturn bw.Flush()\n\t}\n\treturn nil\n}\n\n// Text is the same as Marshal, but returns the string directly.\nfunc (tm *TextMarshaler) Text(pb Message) string {\n\tvar buf bytes.Buffer\n\ttm.Marshal(&buf, pb)\n\treturn buf.String()\n}\n\nvar (\n\tdefaultTextMarshaler = TextMarshaler{}\n\tcompactTextMarshaler = TextMarshaler{Compact: true}\n)\n\n// TODO: consider removing some of the Marshal functions below.\n\n// MarshalText writes a given protocol buffer in text format.\n// The only errors returned are from w.\nfunc MarshalText(w io.Writer, pb Message) error { return defaultTextMarshaler.Marshal(w, pb) }\n\n// MarshalTextString is the same as MarshalText, but returns the string directly.\nfunc MarshalTextString(pb Message) string { return defaultTextMarshaler.Text(pb) }\n\n// CompactText writes a given protocol buffer in compact text format (one line).\nfunc CompactText(w io.Writer, pb Message) error { return compactTextMarshaler.Marshal(w, pb) }\n\n// CompactTextString is the same as CompactText, but returns the string directly.\nfunc CompactTextString(pb Message) string { return compactTextMarshaler.Text(pb) }\n" }, { "path": "vendor/github.com/golang/protobuf/proto/text_parser.go", "content": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2010 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\n// Functions for parsing the Text protocol buffer format.\n// TODO: message sets.\n\nimport (\n\t\"encoding\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\n// Error string emitted when deserializing Any and fields are already set\nconst anyRepeatedlyUnpacked = \"Any message unpacked multiple times, or %q already set\"\n\ntype ParseError struct {\n\tMessage string\n\tLine int // 1-based line number\n\tOffset int // 0-based byte offset from start of input\n}\n\nfunc (p *ParseError) Error() string {\n\tif p.Line == 1 {\n\t\t// show offset only for first line\n\t\treturn fmt.Sprintf(\"line 1.%d: %v\", p.Offset, p.Message)\n\t}\n\treturn fmt.Sprintf(\"line %d: %v\", p.Line, p.Message)\n}\n\ntype token struct {\n\tvalue string\n\terr *ParseError\n\tline int // line number\n\toffset int // byte number from start of input, not start of line\n\tunquoted string // the unquoted version of value, if it was a quoted string\n}\n\nfunc (t *token) String() string {\n\tif t.err == nil {\n\t\treturn fmt.Sprintf(\"%q (line=%d, offset=%d)\", t.value, t.line, t.offset)\n\t}\n\treturn fmt.Sprintf(\"parse error: %v\", t.err)\n}\n\ntype textParser struct {\n\ts string // remaining input\n\tdone bool // whether the parsing is finished (success or error)\n\tbacked bool // whether back() was called\n\toffset, line int\n\tcur token\n}\n\nfunc newTextParser(s string) *textParser {\n\tp := new(textParser)\n\tp.s = s\n\tp.line = 1\n\tp.cur.line = 1\n\treturn p\n}\n\nfunc (p *textParser) errorf(format string, a ...interface{}) *ParseError {\n\tpe := &ParseError{fmt.Sprintf(format, a...), p.cur.line, p.cur.offset}\n\tp.cur.err = pe\n\tp.done = true\n\treturn pe\n}\n\n// Numbers and identifiers are matched by [-+._A-Za-z0-9]\nfunc isIdentOrNumberChar(c byte) bool {\n\tswitch {\n\tcase 'A' <= c && c <= 'Z', 'a' <= c && c <= 'z':\n\t\treturn true\n\tcase '0' <= c && c <= '9':\n\t\treturn true\n\t}\n\tswitch c {\n\tcase '-', '+', '.', '_':\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc isWhitespace(c byte) bool {\n\tswitch c {\n\tcase ' ', '\\t', '\\n', '\\r':\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc isQuote(c byte) bool {\n\tswitch c {\n\tcase '\"', '\\'':\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (p *textParser) skipWhitespace() {\n\ti := 0\n\tfor i < len(p.s) && (isWhitespace(p.s[i]) || p.s[i] == '#') {\n\t\tif p.s[i] == '#' {\n\t\t\t// comment; skip to end of line or input\n\t\t\tfor i < len(p.s) && p.s[i] != '\\n' {\n\t\t\t\ti++\n\t\t\t}\n\t\t\tif i == len(p.s) {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif p.s[i] == '\\n' {\n\t\t\tp.line++\n\t\t}\n\t\ti++\n\t}\n\tp.offset += i\n\tp.s = p.s[i:len(p.s)]\n\tif len(p.s) == 0 {\n\t\tp.done = true\n\t}\n}\n\nfunc (p *textParser) advance() {\n\t// Skip whitespace\n\tp.skipWhitespace()\n\tif p.done {\n\t\treturn\n\t}\n\n\t// Start of non-whitespace\n\tp.cur.err = nil\n\tp.cur.offset, p.cur.line = p.offset, p.line\n\tp.cur.unquoted = \"\"\n\tswitch p.s[0] {\n\tcase '<', '>', '{', '}', ':', '[', ']', ';', ',', '/':\n\t\t// Single symbol\n\t\tp.cur.value, p.s = p.s[0:1], p.s[1:len(p.s)]\n\tcase '\"', '\\'':\n\t\t// Quoted string\n\t\ti := 1\n\t\tfor i < len(p.s) && p.s[i] != p.s[0] && p.s[i] != '\\n' {\n\t\t\tif p.s[i] == '\\\\' && i+1 < len(p.s) {\n\t\t\t\t// skip escaped char\n\t\t\t\ti++\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t\tif i >= len(p.s) || p.s[i] != p.s[0] {\n\t\t\tp.errorf(\"unmatched quote\")\n\t\t\treturn\n\t\t}\n\t\tunq, err := unquoteC(p.s[1:i], rune(p.s[0]))\n\t\tif err != nil {\n\t\t\tp.errorf(\"invalid quoted string %s: %v\", p.s[0:i+1], err)\n\t\t\treturn\n\t\t}\n\t\tp.cur.value, p.s = p.s[0:i+1], p.s[i+1:len(p.s)]\n\t\tp.cur.unquoted = unq\n\tdefault:\n\t\ti := 0\n\t\tfor i < len(p.s) && isIdentOrNumberChar(p.s[i]) {\n\t\t\ti++\n\t\t}\n\t\tif i == 0 {\n\t\t\tp.errorf(\"unexpected byte %#x\", p.s[0])\n\t\t\treturn\n\t\t}\n\t\tp.cur.value, p.s = p.s[0:i], p.s[i:len(p.s)]\n\t}\n\tp.offset += len(p.cur.value)\n}\n\nvar (\n\terrBadUTF8 = errors.New(\"proto: bad UTF-8\")\n)\n\nfunc unquoteC(s string, quote rune) (string, error) {\n\t// This is based on C++'s tokenizer.cc.\n\t// Despite its name, this is *not* parsing C syntax.\n\t// For instance, \"\\0\" is an invalid quoted string.\n\n\t// Avoid allocation in trivial cases.\n\tsimple := true\n\tfor _, r := range s {\n\t\tif r == '\\\\' || r == quote {\n\t\t\tsimple = false\n\t\t\tbreak\n\t\t}\n\t}\n\tif simple {\n\t\treturn s, nil\n\t}\n\n\tbuf := make([]byte, 0, 3*len(s)/2)\n\tfor len(s) > 0 {\n\t\tr, n := utf8.DecodeRuneInString(s)\n\t\tif r == utf8.RuneError && n == 1 {\n\t\t\treturn \"\", errBadUTF8\n\t\t}\n\t\ts = s[n:]\n\t\tif r != '\\\\' {\n\t\t\tif r < utf8.RuneSelf {\n\t\t\t\tbuf = append(buf, byte(r))\n\t\t\t} else {\n\t\t\t\tbuf = append(buf, string(r)...)\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tch, tail, err := unescape(s)\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tbuf = append(buf, ch...)\n\t\ts = tail\n\t}\n\treturn string(buf), nil\n}\n\nfunc unescape(s string) (ch string, tail string, err error) {\n\tr, n := utf8.DecodeRuneInString(s)\n\tif r == utf8.RuneError && n == 1 {\n\t\treturn \"\", \"\", errBadUTF8\n\t}\n\ts = s[n:]\n\tswitch r {\n\tcase 'a':\n\t\treturn \"\\a\", s, nil\n\tcase 'b':\n\t\treturn \"\\b\", s, nil\n\tcase 'f':\n\t\treturn \"\\f\", s, nil\n\tcase 'n':\n\t\treturn \"\\n\", s, nil\n\tcase 'r':\n\t\treturn \"\\r\", s, nil\n\tcase 't':\n\t\treturn \"\\t\", s, nil\n\tcase 'v':\n\t\treturn \"\\v\", s, nil\n\tcase '?':\n\t\treturn \"?\", s, nil // trigraph workaround\n\tcase '\\'', '\"', '\\\\':\n\t\treturn string(r), s, nil\n\tcase '0', '1', '2', '3', '4', '5', '6', '7':\n\t\tif len(s) < 2 {\n\t\t\treturn \"\", \"\", fmt.Errorf(`\\%c requires 2 following digits`, r)\n\t\t}\n\t\tss := string(r) + s[:2]\n\t\ts = s[2:]\n\t\ti, err := strconv.ParseUint(ss, 8, 8)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", fmt.Errorf(`\\%s contains non-octal digits`, ss)\n\t\t}\n\t\treturn string([]byte{byte(i)}), s, nil\n\tcase 'x', 'X', 'u', 'U':\n\t\tvar n int\n\t\tswitch r {\n\t\tcase 'x', 'X':\n\t\t\tn = 2\n\t\tcase 'u':\n\t\t\tn = 4\n\t\tcase 'U':\n\t\t\tn = 8\n\t\t}\n\t\tif len(s) < n {\n\t\t\treturn \"\", \"\", fmt.Errorf(`\\%c requires %d following digits`, r, n)\n\t\t}\n\t\tss := s[:n]\n\t\ts = s[n:]\n\t\ti, err := strconv.ParseUint(ss, 16, 64)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", fmt.Errorf(`\\%c%s contains non-hexadecimal digits`, r, ss)\n\t\t}\n\t\tif r == 'x' || r == 'X' {\n\t\t\treturn string([]byte{byte(i)}), s, nil\n\t\t}\n\t\tif i > utf8.MaxRune {\n\t\t\treturn \"\", \"\", fmt.Errorf(`\\%c%s is not a valid Unicode code point`, r, ss)\n\t\t}\n\t\treturn string(i), s, nil\n\t}\n\treturn \"\", \"\", fmt.Errorf(`unknown escape \\%c`, r)\n}\n\n// Back off the parser by one token. Can only be done between calls to next().\n// It makes the next advance() a no-op.\nfunc (p *textParser) back() { p.backed = true }\n\n// Advances the parser and returns the new current token.\nfunc (p *textParser) next() *token {\n\tif p.backed || p.done {\n\t\tp.backed = false\n\t\treturn &p.cur\n\t}\n\tp.advance()\n\tif p.done {\n\t\tp.cur.value = \"\"\n\t} else if len(p.cur.value) > 0 && isQuote(p.cur.value[0]) {\n\t\t// Look for multiple quoted strings separated by whitespace,\n\t\t// and concatenate them.\n\t\tcat := p.cur\n\t\tfor {\n\t\t\tp.skipWhitespace()\n\t\t\tif p.done || !isQuote(p.s[0]) {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tp.advance()\n\t\t\tif p.cur.err != nil {\n\t\t\t\treturn &p.cur\n\t\t\t}\n\t\t\tcat.value += \" \" + p.cur.value\n\t\t\tcat.unquoted += p.cur.unquoted\n\t\t}\n\t\tp.done = false // parser may have seen EOF, but we want to return cat\n\t\tp.cur = cat\n\t}\n\treturn &p.cur\n}\n\nfunc (p *textParser) consumeToken(s string) error {\n\ttok := p.next()\n\tif tok.err != nil {\n\t\treturn tok.err\n\t}\n\tif tok.value != s {\n\t\tp.back()\n\t\treturn p.errorf(\"expected %q, found %q\", s, tok.value)\n\t}\n\treturn nil\n}\n\n// Return a RequiredNotSetError indicating which required field was not set.\nfunc (p *textParser) missingRequiredFieldError(sv reflect.Value) *RequiredNotSetError {\n\tst := sv.Type()\n\tsprops := GetProperties(st)\n\tfor i := 0; i < st.NumField(); i++ {\n\t\tif !isNil(sv.Field(i)) {\n\t\t\tcontinue\n\t\t}\n\n\t\tprops := sprops.Prop[i]\n\t\tif props.Required {\n\t\t\treturn &RequiredNotSetError{fmt.Sprintf(\"%v.%v\", st, props.OrigName)}\n\t\t}\n\t}\n\treturn &RequiredNotSetError{fmt.Sprintf(\"%v.\", st)} // should not happen\n}\n\n// Returns the index in the struct for the named field, as well as the parsed tag properties.\nfunc structFieldByName(sprops *StructProperties, name string) (int, *Properties, bool) {\n\ti, ok := sprops.decoderOrigNames[name]\n\tif ok {\n\t\treturn i, sprops.Prop[i], true\n\t}\n\treturn -1, nil, false\n}\n\n// Consume a ':' from the input stream (if the next token is a colon),\n// returning an error if a colon is needed but not present.\nfunc (p *textParser) checkForColon(props *Properties, typ reflect.Type) *ParseError {\n\ttok := p.next()\n\tif tok.err != nil {\n\t\treturn tok.err\n\t}\n\tif tok.value != \":\" {\n\t\t// Colon is optional when the field is a group or message.\n\t\tneedColon := true\n\t\tswitch props.Wire {\n\t\tcase \"group\":\n\t\t\tneedColon = false\n\t\tcase \"bytes\":\n\t\t\t// A \"bytes\" field is either a message, a string, or a repeated field;\n\t\t\t// those three become *T, *string and []T respectively, so we can check for\n\t\t\t// this field being a pointer to a non-string.\n\t\t\tif typ.Kind() == reflect.Ptr {\n\t\t\t\t// *T or *string\n\t\t\t\tif typ.Elem().Kind() == reflect.String {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t} else if typ.Kind() == reflect.Slice {\n\t\t\t\t// []T or []*T\n\t\t\t\tif typ.Elem().Kind() != reflect.Ptr {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t} else if typ.Kind() == reflect.String {\n\t\t\t\t// The proto3 exception is for a string field,\n\t\t\t\t// which requires a colon.\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tneedColon = false\n\t\t}\n\t\tif needColon {\n\t\t\treturn p.errorf(\"expected ':', found %q\", tok.value)\n\t\t}\n\t\tp.back()\n\t}\n\treturn nil\n}\n\nfunc (p *textParser) readStruct(sv reflect.Value, terminator string) error {\n\tst := sv.Type()\n\tsprops := GetProperties(st)\n\treqCount := sprops.reqCount\n\tvar reqFieldErr error\n\tfieldSet := make(map[string]bool)\n\t// A struct is a sequence of \"name: value\", terminated by one of\n\t// '>' or '}', or the end of the input. A name may also be\n\t// \"[extension]\" or \"[type/url]\".\n\t//\n\t// The whole struct can also be an expanded Any message, like:\n\t// [type/url] < ... struct contents ... >\n\tfor {\n\t\ttok := p.next()\n\t\tif tok.err != nil {\n\t\t\treturn tok.err\n\t\t}\n\t\tif tok.value == terminator {\n\t\t\tbreak\n\t\t}\n\t\tif tok.value == \"[\" {\n\t\t\t// Looks like an extension or an Any.\n\t\t\t//\n\t\t\t// TODO: Check whether we need to handle\n\t\t\t// namespace rooted names (e.g. \".something.Foo\").\n\t\t\textName, err := p.consumeExtName()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\tif s := strings.LastIndex(extName, \"/\"); s >= 0 {\n\t\t\t\t// If it contains a slash, it's an Any type URL.\n\t\t\t\tmessageName := extName[s+1:]\n\t\t\t\tmt := MessageType(messageName)\n\t\t\t\tif mt == nil {\n\t\t\t\t\treturn p.errorf(\"unrecognized message %q in google.protobuf.Any\", messageName)\n\t\t\t\t}\n\t\t\t\ttok = p.next()\n\t\t\t\tif tok.err != nil {\n\t\t\t\t\treturn tok.err\n\t\t\t\t}\n\t\t\t\t// consume an optional colon\n\t\t\t\tif tok.value == \":\" {\n\t\t\t\t\ttok = p.next()\n\t\t\t\t\tif tok.err != nil {\n\t\t\t\t\t\treturn tok.err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvar terminator string\n\t\t\t\tswitch tok.value {\n\t\t\t\tcase \"<\":\n\t\t\t\t\tterminator = \">\"\n\t\t\t\tcase \"{\":\n\t\t\t\t\tterminator = \"}\"\n\t\t\t\tdefault:\n\t\t\t\t\treturn p.errorf(\"expected '{' or '<', found %q\", tok.value)\n\t\t\t\t}\n\t\t\t\tv := reflect.New(mt.Elem())\n\t\t\t\tif pe := p.readStruct(v.Elem(), terminator); pe != nil {\n\t\t\t\t\treturn pe\n\t\t\t\t}\n\t\t\t\tb, err := Marshal(v.Interface().(Message))\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn p.errorf(\"failed to marshal message of type %q: %v\", messageName, err)\n\t\t\t\t}\n\t\t\t\tif fieldSet[\"type_url\"] {\n\t\t\t\t\treturn p.errorf(anyRepeatedlyUnpacked, \"type_url\")\n\t\t\t\t}\n\t\t\t\tif fieldSet[\"value\"] {\n\t\t\t\t\treturn p.errorf(anyRepeatedlyUnpacked, \"value\")\n\t\t\t\t}\n\t\t\t\tsv.FieldByName(\"TypeUrl\").SetString(extName)\n\t\t\t\tsv.FieldByName(\"Value\").SetBytes(b)\n\t\t\t\tfieldSet[\"type_url\"] = true\n\t\t\t\tfieldSet[\"value\"] = true\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tvar desc *ExtensionDesc\n\t\t\t// This could be faster, but it's functional.\n\t\t\t// TODO: Do something smarter than a linear scan.\n\t\t\tfor _, d := range RegisteredExtensions(reflect.New(st).Interface().(Message)) {\n\t\t\t\tif d.Name == extName {\n\t\t\t\t\tdesc = d\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif desc == nil {\n\t\t\t\treturn p.errorf(\"unrecognized extension %q\", extName)\n\t\t\t}\n\n\t\t\tprops := &Properties{}\n\t\t\tprops.Parse(desc.Tag)\n\n\t\t\ttyp := reflect.TypeOf(desc.ExtensionType)\n\t\t\tif err := p.checkForColon(props, typ); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\trep := desc.repeated()\n\n\t\t\t// Read the extension structure, and set it in\n\t\t\t// the value we're constructing.\n\t\t\tvar ext reflect.Value\n\t\t\tif !rep {\n\t\t\t\text = reflect.New(typ).Elem()\n\t\t\t} else {\n\t\t\t\text = reflect.New(typ.Elem()).Elem()\n\t\t\t}\n\t\t\tif err := p.readAny(ext, props); err != nil {\n\t\t\t\tif _, ok := err.(*RequiredNotSetError); !ok {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\treqFieldErr = err\n\t\t\t}\n\t\t\tep := sv.Addr().Interface().(Message)\n\t\t\tif !rep {\n\t\t\t\tSetExtension(ep, desc, ext.Interface())\n\t\t\t} else {\n\t\t\t\told, err := GetExtension(ep, desc)\n\t\t\t\tvar sl reflect.Value\n\t\t\t\tif err == nil {\n\t\t\t\t\tsl = reflect.ValueOf(old) // existing slice\n\t\t\t\t} else {\n\t\t\t\t\tsl = reflect.MakeSlice(typ, 0, 1)\n\t\t\t\t}\n\t\t\t\tsl = reflect.Append(sl, ext)\n\t\t\t\tSetExtension(ep, desc, sl.Interface())\n\t\t\t}\n\t\t\tif err := p.consumeOptionalSeparator(); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\t// This is a normal, non-extension field.\n\t\tname := tok.value\n\t\tvar dst reflect.Value\n\t\tfi, props, ok := structFieldByName(sprops, name)\n\t\tif ok {\n\t\t\tdst = sv.Field(fi)\n\t\t} else if oop, ok := sprops.OneofTypes[name]; ok {\n\t\t\t// It is a oneof.\n\t\t\tprops = oop.Prop\n\t\t\tnv := reflect.New(oop.Type.Elem())\n\t\t\tdst = nv.Elem().Field(0)\n\t\t\tfield := sv.Field(oop.Field)\n\t\t\tif !field.IsNil() {\n\t\t\t\treturn p.errorf(\"field '%s' would overwrite already parsed oneof '%s'\", name, sv.Type().Field(oop.Field).Name)\n\t\t\t}\n\t\t\tfield.Set(nv)\n\t\t}\n\t\tif !dst.IsValid() {\n\t\t\treturn p.errorf(\"unknown field name %q in %v\", name, st)\n\t\t}\n\n\t\tif dst.Kind() == reflect.Map {\n\t\t\t// Consume any colon.\n\t\t\tif err := p.checkForColon(props, dst.Type()); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\t// Construct the map if it doesn't already exist.\n\t\t\tif dst.IsNil() {\n\t\t\t\tdst.Set(reflect.MakeMap(dst.Type()))\n\t\t\t}\n\t\t\tkey := reflect.New(dst.Type().Key()).Elem()\n\t\t\tval := reflect.New(dst.Type().Elem()).Elem()\n\n\t\t\t// The map entry should be this sequence of tokens:\n\t\t\t//\t< key : KEY value : VALUE >\n\t\t\t// However, implementations may omit key or value, and technically\n\t\t\t// we should support them in any order. See b/28924776 for a time\n\t\t\t// this went wrong.\n\n\t\t\ttok := p.next()\n\t\t\tvar terminator string\n\t\t\tswitch tok.value {\n\t\t\tcase \"<\":\n\t\t\t\tterminator = \">\"\n\t\t\tcase \"{\":\n\t\t\t\tterminator = \"}\"\n\t\t\tdefault:\n\t\t\t\treturn p.errorf(\"expected '{' or '<', found %q\", tok.value)\n\t\t\t}\n\t\t\tfor {\n\t\t\t\ttok := p.next()\n\t\t\t\tif tok.err != nil {\n\t\t\t\t\treturn tok.err\n\t\t\t\t}\n\t\t\t\tif tok.value == terminator {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tswitch tok.value {\n\t\t\t\tcase \"key\":\n\t\t\t\t\tif err := p.consumeToken(\":\"); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif err := p.readAny(key, props.MapKeyProp); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif err := p.consumeOptionalSeparator(); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\tcase \"value\":\n\t\t\t\t\tif err := p.checkForColon(props.MapValProp, dst.Type().Elem()); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif err := p.readAny(val, props.MapValProp); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tif err := p.consumeOptionalSeparator(); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\tp.back()\n\t\t\t\t\treturn p.errorf(`expected \"key\", \"value\", or %q, found %q`, terminator, tok.value)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdst.SetMapIndex(key, val)\n\t\t\tcontinue\n\t\t}\n\n\t\t// Check that it's not already set if it's not a repeated field.\n\t\tif !props.Repeated && fieldSet[name] {\n\t\t\treturn p.errorf(\"non-repeated field %q was repeated\", name)\n\t\t}\n\n\t\tif err := p.checkForColon(props, dst.Type()); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Parse into the field.\n\t\tfieldSet[name] = true\n\t\tif err := p.readAny(dst, props); err != nil {\n\t\t\tif _, ok := err.(*RequiredNotSetError); !ok {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\treqFieldErr = err\n\t\t}\n\t\tif props.Required {\n\t\t\treqCount--\n\t\t}\n\n\t\tif err := p.consumeOptionalSeparator(); err != nil {\n\t\t\treturn err\n\t\t}\n\n\t}\n\n\tif reqCount > 0 {\n\t\treturn p.missingRequiredFieldError(sv)\n\t}\n\treturn reqFieldErr\n}\n\n// consumeExtName consumes extension name or expanded Any type URL and the\n// following ']'. It returns the name or URL consumed.\nfunc (p *textParser) consumeExtName() (string, error) {\n\ttok := p.next()\n\tif tok.err != nil {\n\t\treturn \"\", tok.err\n\t}\n\n\t// If extension name or type url is quoted, it's a single token.\n\tif len(tok.value) > 2 && isQuote(tok.value[0]) && tok.value[len(tok.value)-1] == tok.value[0] {\n\t\tname, err := unquoteC(tok.value[1:len(tok.value)-1], rune(tok.value[0]))\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\treturn name, p.consumeToken(\"]\")\n\t}\n\n\t// Consume everything up to \"]\"\n\tvar parts []string\n\tfor tok.value != \"]\" {\n\t\tparts = append(parts, tok.value)\n\t\ttok = p.next()\n\t\tif tok.err != nil {\n\t\t\treturn \"\", p.errorf(\"unrecognized type_url or extension name: %s\", tok.err)\n\t\t}\n\t\tif p.done && tok.value != \"]\" {\n\t\t\treturn \"\", p.errorf(\"unclosed type_url or extension name\")\n\t\t}\n\t}\n\treturn strings.Join(parts, \"\"), nil\n}\n\n// consumeOptionalSeparator consumes an optional semicolon or comma.\n// It is used in readStruct to provide backward compatibility.\nfunc (p *textParser) consumeOptionalSeparator() error {\n\ttok := p.next()\n\tif tok.err != nil {\n\t\treturn tok.err\n\t}\n\tif tok.value != \";\" && tok.value != \",\" {\n\t\tp.back()\n\t}\n\treturn nil\n}\n\nfunc (p *textParser) readAny(v reflect.Value, props *Properties) error {\n\ttok := p.next()\n\tif tok.err != nil {\n\t\treturn tok.err\n\t}\n\tif tok.value == \"\" {\n\t\treturn p.errorf(\"unexpected EOF\")\n\t}\n\n\tswitch fv := v; fv.Kind() {\n\tcase reflect.Slice:\n\t\tat := v.Type()\n\t\tif at.Elem().Kind() == reflect.Uint8 {\n\t\t\t// Special case for []byte\n\t\t\tif tok.value[0] != '\"' && tok.value[0] != '\\'' {\n\t\t\t\t// Deliberately written out here, as the error after\n\t\t\t\t// this switch statement would write \"invalid []byte: ...\",\n\t\t\t\t// which is not as user-friendly.\n\t\t\t\treturn p.errorf(\"invalid string: %v\", tok.value)\n\t\t\t}\n\t\t\tbytes := []byte(tok.unquoted)\n\t\t\tfv.Set(reflect.ValueOf(bytes))\n\t\t\treturn nil\n\t\t}\n\t\t// Repeated field.\n\t\tif tok.value == \"[\" {\n\t\t\t// Repeated field with list notation, like [1,2,3].\n\t\t\tfor {\n\t\t\t\tfv.Set(reflect.Append(fv, reflect.New(at.Elem()).Elem()))\n\t\t\t\terr := p.readAny(fv.Index(fv.Len()-1), props)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\ttok := p.next()\n\t\t\t\tif tok.err != nil {\n\t\t\t\t\treturn tok.err\n\t\t\t\t}\n\t\t\t\tif tok.value == \"]\" {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tif tok.value != \",\" {\n\t\t\t\t\treturn p.errorf(\"Expected ']' or ',' found %q\", tok.value)\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn nil\n\t\t}\n\t\t// One value of the repeated field.\n\t\tp.back()\n\t\tfv.Set(reflect.Append(fv, reflect.New(at.Elem()).Elem()))\n\t\treturn p.readAny(fv.Index(fv.Len()-1), props)\n\tcase reflect.Bool:\n\t\t// true/1/t/True or false/f/0/False.\n\t\tswitch tok.value {\n\t\tcase \"true\", \"1\", \"t\", \"True\":\n\t\t\tfv.SetBool(true)\n\t\t\treturn nil\n\t\tcase \"false\", \"0\", \"f\", \"False\":\n\t\t\tfv.SetBool(false)\n\t\t\treturn nil\n\t\t}\n\tcase reflect.Float32, reflect.Float64:\n\t\tv := tok.value\n\t\t// Ignore 'f' for compatibility with output generated by C++, but don't\n\t\t// remove 'f' when the value is \"-inf\" or \"inf\".\n\t\tif strings.HasSuffix(v, \"f\") && tok.value != \"-inf\" && tok.value != \"inf\" {\n\t\t\tv = v[:len(v)-1]\n\t\t}\n\t\tif f, err := strconv.ParseFloat(v, fv.Type().Bits()); err == nil {\n\t\t\tfv.SetFloat(f)\n\t\t\treturn nil\n\t\t}\n\tcase reflect.Int32:\n\t\tif x, err := strconv.ParseInt(tok.value, 0, 32); err == nil {\n\t\t\tfv.SetInt(x)\n\t\t\treturn nil\n\t\t}\n\n\t\tif len(props.Enum) == 0 {\n\t\t\tbreak\n\t\t}\n\t\tm, ok := enumValueMaps[props.Enum]\n\t\tif !ok {\n\t\t\tbreak\n\t\t}\n\t\tx, ok := m[tok.value]\n\t\tif !ok {\n\t\t\tbreak\n\t\t}\n\t\tfv.SetInt(int64(x))\n\t\treturn nil\n\tcase reflect.Int64:\n\t\tif x, err := strconv.ParseInt(tok.value, 0, 64); err == nil {\n\t\t\tfv.SetInt(x)\n\t\t\treturn nil\n\t\t}\n\n\tcase reflect.Ptr:\n\t\t// A basic field (indirected through pointer), or a repeated message/group\n\t\tp.back()\n\t\tfv.Set(reflect.New(fv.Type().Elem()))\n\t\treturn p.readAny(fv.Elem(), props)\n\tcase reflect.String:\n\t\tif tok.value[0] == '\"' || tok.value[0] == '\\'' {\n\t\t\tfv.SetString(tok.unquoted)\n\t\t\treturn nil\n\t\t}\n\tcase reflect.Struct:\n\t\tvar terminator string\n\t\tswitch tok.value {\n\t\tcase \"{\":\n\t\t\tterminator = \"}\"\n\t\tcase \"<\":\n\t\t\tterminator = \">\"\n\t\tdefault:\n\t\t\treturn p.errorf(\"expected '{' or '<', found %q\", tok.value)\n\t\t}\n\t\t// TODO: Handle nested messages which implement encoding.TextUnmarshaler.\n\t\treturn p.readStruct(fv, terminator)\n\tcase reflect.Uint32:\n\t\tif x, err := strconv.ParseUint(tok.value, 0, 32); err == nil {\n\t\t\tfv.SetUint(uint64(x))\n\t\t\treturn nil\n\t\t}\n\tcase reflect.Uint64:\n\t\tif x, err := strconv.ParseUint(tok.value, 0, 64); err == nil {\n\t\t\tfv.SetUint(x)\n\t\t\treturn nil\n\t\t}\n\t}\n\treturn p.errorf(\"invalid %v: %v\", v.Type(), tok.value)\n}\n\n// UnmarshalText reads a protocol buffer in Text format. UnmarshalText resets pb\n// before starting to unmarshal, so any existing data in pb is always removed.\n// If a required field is not set and no other error occurs,\n// UnmarshalText returns *RequiredNotSetError.\nfunc UnmarshalText(s string, pb Message) error {\n\tif um, ok := pb.(encoding.TextUnmarshaler); ok {\n\t\treturn um.UnmarshalText([]byte(s))\n\t}\n\tpb.Reset()\n\tv := reflect.ValueOf(pb)\n\treturn newTextParser(s).readStruct(v.Elem(), \"\")\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n" }, { "path": "vendor/github.com/gomodule/redigo/internal/commandinfo.go", "content": "// Copyright 2014 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage internal // import \"github.com/gomodule/redigo/internal\"\n\nimport (\n\t\"strings\"\n)\n\nconst (\n\tWatchState = 1 << iota\n\tMultiState\n\tSubscribeState\n\tMonitorState\n)\n\ntype CommandInfo struct {\n\tSet, Clear int\n}\n\nvar commandInfos = map[string]CommandInfo{\n\t\"WATCH\": {Set: WatchState},\n\t\"UNWATCH\": {Clear: WatchState},\n\t\"MULTI\": {Set: MultiState},\n\t\"EXEC\": {Clear: WatchState | MultiState},\n\t\"DISCARD\": {Clear: WatchState | MultiState},\n\t\"PSUBSCRIBE\": {Set: SubscribeState},\n\t\"SUBSCRIBE\": {Set: SubscribeState},\n\t\"MONITOR\": {Set: MonitorState},\n}\n\nfunc init() {\n\tfor n, ci := range commandInfos {\n\t\tcommandInfos[strings.ToLower(n)] = ci\n\t}\n}\n\nfunc LookupCommandInfo(commandName string) CommandInfo {\n\tif ci, ok := commandInfos[commandName]; ok {\n\t\treturn ci\n\t}\n\treturn commandInfos[strings.ToUpper(commandName)]\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/conn.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"crypto/tls\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"net/url\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"sync\"\n\t\"time\"\n)\n\nvar (\n\t_ ConnWithTimeout = (*conn)(nil)\n)\n\n// conn is the low-level implementation of Conn\ntype conn struct {\n\t// Shared\n\tmu sync.Mutex\n\tpending int\n\terr error\n\tconn net.Conn\n\n\t// Read\n\treadTimeout time.Duration\n\tbr *bufio.Reader\n\n\t// Write\n\twriteTimeout time.Duration\n\tbw *bufio.Writer\n\n\t// Scratch space for formatting argument length.\n\t// '*' or '$', length, \"\\r\\n\"\n\tlenScratch [32]byte\n\n\t// Scratch space for formatting integers and floats.\n\tnumScratch [40]byte\n}\n\n// DialTimeout acts like Dial but takes timeouts for establishing the\n// connection to the server, writing a command and reading a reply.\n//\n// Deprecated: Use Dial with options instead.\nfunc DialTimeout(network, address string, connectTimeout, readTimeout, writeTimeout time.Duration) (Conn, error) {\n\treturn Dial(network, address,\n\t\tDialConnectTimeout(connectTimeout),\n\t\tDialReadTimeout(readTimeout),\n\t\tDialWriteTimeout(writeTimeout))\n}\n\n// DialOption specifies an option for dialing a Redis server.\ntype DialOption struct {\n\tf func(*dialOptions)\n}\n\ntype dialOptions struct {\n\treadTimeout time.Duration\n\twriteTimeout time.Duration\n\tdialer *net.Dialer\n\tdial func(network, addr string) (net.Conn, error)\n\tdb int\n\tpassword string\n\tuseTLS bool\n\tskipVerify bool\n\ttlsConfig *tls.Config\n}\n\n// DialReadTimeout specifies the timeout for reading a single command reply.\nfunc DialReadTimeout(d time.Duration) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.readTimeout = d\n\t}}\n}\n\n// DialWriteTimeout specifies the timeout for writing a single command.\nfunc DialWriteTimeout(d time.Duration) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.writeTimeout = d\n\t}}\n}\n\n// DialConnectTimeout specifies the timeout for connecting to the Redis server when\n// no DialNetDial option is specified.\nfunc DialConnectTimeout(d time.Duration) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.dialer.Timeout = d\n\t}}\n}\n\n// DialKeepAlive specifies the keep-alive period for TCP connections to the Redis server\n// when no DialNetDial option is specified.\n// If zero, keep-alives are not enabled. If no DialKeepAlive option is specified then\n// the default of 5 minutes is used to ensure that half-closed TCP sessions are detected.\nfunc DialKeepAlive(d time.Duration) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.dialer.KeepAlive = d\n\t}}\n}\n\n// DialNetDial specifies a custom dial function for creating TCP\n// connections, otherwise a net.Dialer customized via the other options is used.\n// DialNetDial overrides DialConnectTimeout and DialKeepAlive.\nfunc DialNetDial(dial func(network, addr string) (net.Conn, error)) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.dial = dial\n\t}}\n}\n\n// DialDatabase specifies the database to select when dialing a connection.\nfunc DialDatabase(db int) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.db = db\n\t}}\n}\n\n// DialPassword specifies the password to use when connecting to\n// the Redis server.\nfunc DialPassword(password string) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.password = password\n\t}}\n}\n\n// DialTLSConfig specifies the config to use when a TLS connection is dialed.\n// Has no effect when not dialing a TLS connection.\nfunc DialTLSConfig(c *tls.Config) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.tlsConfig = c\n\t}}\n}\n\n// DialTLSSkipVerify disables server name verification when connecting over\n// TLS. Has no effect when not dialing a TLS connection.\nfunc DialTLSSkipVerify(skip bool) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.skipVerify = skip\n\t}}\n}\n\n// DialUseTLS specifies whether TLS should be used when connecting to the\n// server. This option is ignore by DialURL.\nfunc DialUseTLS(useTLS bool) DialOption {\n\treturn DialOption{func(do *dialOptions) {\n\t\tdo.useTLS = useTLS\n\t}}\n}\n\n// Dial connects to the Redis server at the given network and\n// address using the specified options.\nfunc Dial(network, address string, options ...DialOption) (Conn, error) {\n\tdo := dialOptions{\n\t\tdialer: &net.Dialer{\n\t\t\tKeepAlive: time.Minute * 5,\n\t\t},\n\t}\n\tfor _, option := range options {\n\t\toption.f(&do)\n\t}\n\tif do.dial == nil {\n\t\tdo.dial = do.dialer.Dial\n\t}\n\n\tnetConn, err := do.dial(network, address)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif do.useTLS {\n\t\tvar tlsConfig *tls.Config\n\t\tif do.tlsConfig == nil {\n\t\t\ttlsConfig = &tls.Config{InsecureSkipVerify: do.skipVerify}\n\t\t} else {\n\t\t\ttlsConfig = cloneTLSConfig(do.tlsConfig)\n\t\t}\n\t\tif tlsConfig.ServerName == \"\" {\n\t\t\thost, _, err := net.SplitHostPort(address)\n\t\t\tif err != nil {\n\t\t\t\tnetConn.Close()\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\ttlsConfig.ServerName = host\n\t\t}\n\n\t\ttlsConn := tls.Client(netConn, tlsConfig)\n\t\tif err := tlsConn.Handshake(); err != nil {\n\t\t\tnetConn.Close()\n\t\t\treturn nil, err\n\t\t}\n\t\tnetConn = tlsConn\n\t}\n\n\tc := &conn{\n\t\tconn: netConn,\n\t\tbw: bufio.NewWriter(netConn),\n\t\tbr: bufio.NewReader(netConn),\n\t\treadTimeout: do.readTimeout,\n\t\twriteTimeout: do.writeTimeout,\n\t}\n\n\tif do.password != \"\" {\n\t\tif _, err := c.Do(\"AUTH\", do.password); err != nil {\n\t\t\tnetConn.Close()\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tif do.db != 0 {\n\t\tif _, err := c.Do(\"SELECT\", do.db); err != nil {\n\t\t\tnetConn.Close()\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn c, nil\n}\n\nvar pathDBRegexp = regexp.MustCompile(`/(\\d*)\\z`)\n\n// DialURL connects to a Redis server at the given URL using the Redis\n// URI scheme. URLs should follow the draft IANA specification for the\n// scheme (https://www.iana.org/assignments/uri-schemes/prov/redis).\nfunc DialURL(rawurl string, options ...DialOption) (Conn, error) {\n\tu, err := url.Parse(rawurl)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif u.Scheme != \"redis\" && u.Scheme != \"rediss\" {\n\t\treturn nil, fmt.Errorf(\"invalid redis URL scheme: %s\", u.Scheme)\n\t}\n\n\t// As per the IANA draft spec, the host defaults to localhost and\n\t// the port defaults to 6379.\n\thost, port, err := net.SplitHostPort(u.Host)\n\tif err != nil {\n\t\t// assume port is missing\n\t\thost = u.Host\n\t\tport = \"6379\"\n\t}\n\tif host == \"\" {\n\t\thost = \"localhost\"\n\t}\n\taddress := net.JoinHostPort(host, port)\n\n\tif u.User != nil {\n\t\tpassword, isSet := u.User.Password()\n\t\tif isSet {\n\t\t\toptions = append(options, DialPassword(password))\n\t\t}\n\t}\n\n\tmatch := pathDBRegexp.FindStringSubmatch(u.Path)\n\tif len(match) == 2 {\n\t\tdb := 0\n\t\tif len(match[1]) > 0 {\n\t\t\tdb, err = strconv.Atoi(match[1])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"invalid database: %s\", u.Path[1:])\n\t\t\t}\n\t\t}\n\t\tif db != 0 {\n\t\t\toptions = append(options, DialDatabase(db))\n\t\t}\n\t} else if u.Path != \"\" {\n\t\treturn nil, fmt.Errorf(\"invalid database: %s\", u.Path[1:])\n\t}\n\n\toptions = append(options, DialUseTLS(u.Scheme == \"rediss\"))\n\n\treturn Dial(\"tcp\", address, options...)\n}\n\n// NewConn returns a new Redigo connection for the given net connection.\nfunc NewConn(netConn net.Conn, readTimeout, writeTimeout time.Duration) Conn {\n\treturn &conn{\n\t\tconn: netConn,\n\t\tbw: bufio.NewWriter(netConn),\n\t\tbr: bufio.NewReader(netConn),\n\t\treadTimeout: readTimeout,\n\t\twriteTimeout: writeTimeout,\n\t}\n}\n\nfunc (c *conn) Close() error {\n\tc.mu.Lock()\n\terr := c.err\n\tif c.err == nil {\n\t\tc.err = errors.New(\"redigo: closed\")\n\t\terr = c.conn.Close()\n\t}\n\tc.mu.Unlock()\n\treturn err\n}\n\nfunc (c *conn) fatal(err error) error {\n\tc.mu.Lock()\n\tif c.err == nil {\n\t\tc.err = err\n\t\t// Close connection to force errors on subsequent calls and to unblock\n\t\t// other reader or writer.\n\t\tc.conn.Close()\n\t}\n\tc.mu.Unlock()\n\treturn err\n}\n\nfunc (c *conn) Err() error {\n\tc.mu.Lock()\n\terr := c.err\n\tc.mu.Unlock()\n\treturn err\n}\n\nfunc (c *conn) writeLen(prefix byte, n int) error {\n\tc.lenScratch[len(c.lenScratch)-1] = '\\n'\n\tc.lenScratch[len(c.lenScratch)-2] = '\\r'\n\ti := len(c.lenScratch) - 3\n\tfor {\n\t\tc.lenScratch[i] = byte('0' + n%10)\n\t\ti -= 1\n\t\tn = n / 10\n\t\tif n == 0 {\n\t\t\tbreak\n\t\t}\n\t}\n\tc.lenScratch[i] = prefix\n\t_, err := c.bw.Write(c.lenScratch[i:])\n\treturn err\n}\n\nfunc (c *conn) writeString(s string) error {\n\tc.writeLen('$', len(s))\n\tc.bw.WriteString(s)\n\t_, err := c.bw.WriteString(\"\\r\\n\")\n\treturn err\n}\n\nfunc (c *conn) writeBytes(p []byte) error {\n\tc.writeLen('$', len(p))\n\tc.bw.Write(p)\n\t_, err := c.bw.WriteString(\"\\r\\n\")\n\treturn err\n}\n\nfunc (c *conn) writeInt64(n int64) error {\n\treturn c.writeBytes(strconv.AppendInt(c.numScratch[:0], n, 10))\n}\n\nfunc (c *conn) writeFloat64(n float64) error {\n\treturn c.writeBytes(strconv.AppendFloat(c.numScratch[:0], n, 'g', -1, 64))\n}\n\nfunc (c *conn) writeCommand(cmd string, args []interface{}) error {\n\tc.writeLen('*', 1+len(args))\n\tif err := c.writeString(cmd); err != nil {\n\t\treturn err\n\t}\n\tfor _, arg := range args {\n\t\tif err := c.writeArg(arg, true); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (c *conn) writeArg(arg interface{}, argumentTypeOK bool) (err error) {\n\tswitch arg := arg.(type) {\n\tcase string:\n\t\treturn c.writeString(arg)\n\tcase []byte:\n\t\treturn c.writeBytes(arg)\n\tcase int:\n\t\treturn c.writeInt64(int64(arg))\n\tcase int64:\n\t\treturn c.writeInt64(arg)\n\tcase float64:\n\t\treturn c.writeFloat64(arg)\n\tcase bool:\n\t\tif arg {\n\t\t\treturn c.writeString(\"1\")\n\t\t} else {\n\t\t\treturn c.writeString(\"0\")\n\t\t}\n\tcase nil:\n\t\treturn c.writeString(\"\")\n\tcase Argument:\n\t\tif argumentTypeOK {\n\t\t\treturn c.writeArg(arg.RedisArg(), false)\n\t\t}\n\t\t// See comment in default clause below.\n\t\tvar buf bytes.Buffer\n\t\tfmt.Fprint(&buf, arg)\n\t\treturn c.writeBytes(buf.Bytes())\n\tdefault:\n\t\t// This default clause is intended to handle builtin numeric types.\n\t\t// The function should return an error for other types, but this is not\n\t\t// done for compatibility with previous versions of the package.\n\t\tvar buf bytes.Buffer\n\t\tfmt.Fprint(&buf, arg)\n\t\treturn c.writeBytes(buf.Bytes())\n\t}\n}\n\ntype protocolError string\n\nfunc (pe protocolError) Error() string {\n\treturn fmt.Sprintf(\"redigo: %s (possible server error or unsupported concurrent read by application)\", string(pe))\n}\n\nfunc (c *conn) readLine() ([]byte, error) {\n\tp, err := c.br.ReadSlice('\\n')\n\tif err == bufio.ErrBufferFull {\n\t\treturn nil, protocolError(\"long response line\")\n\t}\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\ti := len(p) - 2\n\tif i < 0 || p[i] != '\\r' {\n\t\treturn nil, protocolError(\"bad response line terminator\")\n\t}\n\treturn p[:i], nil\n}\n\n// parseLen parses bulk string and array lengths.\nfunc parseLen(p []byte) (int, error) {\n\tif len(p) == 0 {\n\t\treturn -1, protocolError(\"malformed length\")\n\t}\n\n\tif p[0] == '-' && len(p) == 2 && p[1] == '1' {\n\t\t// handle $-1 and $-1 null replies.\n\t\treturn -1, nil\n\t}\n\n\tvar n int\n\tfor _, b := range p {\n\t\tn *= 10\n\t\tif b < '0' || b > '9' {\n\t\t\treturn -1, protocolError(\"illegal bytes in length\")\n\t\t}\n\t\tn += int(b - '0')\n\t}\n\n\treturn n, nil\n}\n\n// parseInt parses an integer reply.\nfunc parseInt(p []byte) (interface{}, error) {\n\tif len(p) == 0 {\n\t\treturn 0, protocolError(\"malformed integer\")\n\t}\n\n\tvar negate bool\n\tif p[0] == '-' {\n\t\tnegate = true\n\t\tp = p[1:]\n\t\tif len(p) == 0 {\n\t\t\treturn 0, protocolError(\"malformed integer\")\n\t\t}\n\t}\n\n\tvar n int64\n\tfor _, b := range p {\n\t\tn *= 10\n\t\tif b < '0' || b > '9' {\n\t\t\treturn 0, protocolError(\"illegal bytes in length\")\n\t\t}\n\t\tn += int64(b - '0')\n\t}\n\n\tif negate {\n\t\tn = -n\n\t}\n\treturn n, nil\n}\n\nvar (\n\tokReply interface{} = \"OK\"\n\tpongReply interface{} = \"PONG\"\n)\n\nfunc (c *conn) readReply() (interface{}, error) {\n\tline, err := c.readLine()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(line) == 0 {\n\t\treturn nil, protocolError(\"short response line\")\n\t}\n\tswitch line[0] {\n\tcase '+':\n\t\tswitch {\n\t\tcase len(line) == 3 && line[1] == 'O' && line[2] == 'K':\n\t\t\t// Avoid allocation for frequent \"+OK\" response.\n\t\t\treturn okReply, nil\n\t\tcase len(line) == 5 && line[1] == 'P' && line[2] == 'O' && line[3] == 'N' && line[4] == 'G':\n\t\t\t// Avoid allocation in PING command benchmarks :)\n\t\t\treturn pongReply, nil\n\t\tdefault:\n\t\t\treturn string(line[1:]), nil\n\t\t}\n\tcase '-':\n\t\treturn Error(string(line[1:])), nil\n\tcase ':':\n\t\treturn parseInt(line[1:])\n\tcase '$':\n\t\tn, err := parseLen(line[1:])\n\t\tif n < 0 || err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tp := make([]byte, n)\n\t\t_, err = io.ReadFull(c.br, p)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif line, err := c.readLine(); err != nil {\n\t\t\treturn nil, err\n\t\t} else if len(line) != 0 {\n\t\t\treturn nil, protocolError(\"bad bulk string format\")\n\t\t}\n\t\treturn p, nil\n\tcase '*':\n\t\tn, err := parseLen(line[1:])\n\t\tif n < 0 || err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tr := make([]interface{}, n)\n\t\tfor i := range r {\n\t\t\tr[i], err = c.readReply()\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn r, nil\n\t}\n\treturn nil, protocolError(\"unexpected response line\")\n}\n\nfunc (c *conn) Send(cmd string, args ...interface{}) error {\n\tc.mu.Lock()\n\tc.pending += 1\n\tc.mu.Unlock()\n\tif c.writeTimeout != 0 {\n\t\tc.conn.SetWriteDeadline(time.Now().Add(c.writeTimeout))\n\t}\n\tif err := c.writeCommand(cmd, args); err != nil {\n\t\treturn c.fatal(err)\n\t}\n\treturn nil\n}\n\nfunc (c *conn) Flush() error {\n\tif c.writeTimeout != 0 {\n\t\tc.conn.SetWriteDeadline(time.Now().Add(c.writeTimeout))\n\t}\n\tif err := c.bw.Flush(); err != nil {\n\t\treturn c.fatal(err)\n\t}\n\treturn nil\n}\n\nfunc (c *conn) Receive() (interface{}, error) {\n\treturn c.ReceiveWithTimeout(c.readTimeout)\n}\n\nfunc (c *conn) ReceiveWithTimeout(timeout time.Duration) (reply interface{}, err error) {\n\tvar deadline time.Time\n\tif timeout != 0 {\n\t\tdeadline = time.Now().Add(timeout)\n\t}\n\tc.conn.SetReadDeadline(deadline)\n\n\tif reply, err = c.readReply(); err != nil {\n\t\treturn nil, c.fatal(err)\n\t}\n\t// When using pub/sub, the number of receives can be greater than the\n\t// number of sends. To enable normal use of the connection after\n\t// unsubscribing from all channels, we do not decrement pending to a\n\t// negative value.\n\t//\n\t// The pending field is decremented after the reply is read to handle the\n\t// case where Receive is called before Send.\n\tc.mu.Lock()\n\tif c.pending > 0 {\n\t\tc.pending -= 1\n\t}\n\tc.mu.Unlock()\n\tif err, ok := reply.(Error); ok {\n\t\treturn nil, err\n\t}\n\treturn\n}\n\nfunc (c *conn) Do(cmd string, args ...interface{}) (interface{}, error) {\n\treturn c.DoWithTimeout(c.readTimeout, cmd, args...)\n}\n\nfunc (c *conn) DoWithTimeout(readTimeout time.Duration, cmd string, args ...interface{}) (interface{}, error) {\n\tc.mu.Lock()\n\tpending := c.pending\n\tc.pending = 0\n\tc.mu.Unlock()\n\n\tif cmd == \"\" && pending == 0 {\n\t\treturn nil, nil\n\t}\n\n\tif c.writeTimeout != 0 {\n\t\tc.conn.SetWriteDeadline(time.Now().Add(c.writeTimeout))\n\t}\n\n\tif cmd != \"\" {\n\t\tif err := c.writeCommand(cmd, args); err != nil {\n\t\t\treturn nil, c.fatal(err)\n\t\t}\n\t}\n\n\tif err := c.bw.Flush(); err != nil {\n\t\treturn nil, c.fatal(err)\n\t}\n\n\tvar deadline time.Time\n\tif readTimeout != 0 {\n\t\tdeadline = time.Now().Add(readTimeout)\n\t}\n\tc.conn.SetReadDeadline(deadline)\n\n\tif cmd == \"\" {\n\t\treply := make([]interface{}, pending)\n\t\tfor i := range reply {\n\t\t\tr, e := c.readReply()\n\t\t\tif e != nil {\n\t\t\t\treturn nil, c.fatal(e)\n\t\t\t}\n\t\t\treply[i] = r\n\t\t}\n\t\treturn reply, nil\n\t}\n\n\tvar err error\n\tvar reply interface{}\n\tfor i := 0; i <= pending; i++ {\n\t\tvar e error\n\t\tif reply, e = c.readReply(); e != nil {\n\t\t\treturn nil, c.fatal(e)\n\t\t}\n\t\tif e, ok := reply.(Error); ok && err == nil {\n\t\t\terr = e\n\t\t}\n\t}\n\treturn reply, err\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/doc.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\n// Package redis is a client for the Redis database.\n//\n// The Redigo FAQ (https://github.com/gomodule/redigo/wiki/FAQ) contains more\n// documentation about this package.\n//\n// Connections\n//\n// The Conn interface is the primary interface for working with Redis.\n// Applications create connections by calling the Dial, DialWithTimeout or\n// NewConn functions. In the future, functions will be added for creating\n// sharded and other types of connections.\n//\n// The application must call the connection Close method when the application\n// is done with the connection.\n//\n// Executing Commands\n//\n// The Conn interface has a generic method for executing Redis commands:\n//\n// Do(commandName string, args ...interface{}) (reply interface{}, err error)\n//\n// The Redis command reference (http://redis.io/commands) lists the available\n// commands. An example of using the Redis APPEND command is:\n//\n// n, err := conn.Do(\"APPEND\", \"key\", \"value\")\n//\n// The Do method converts command arguments to bulk strings for transmission\n// to the server as follows:\n//\n// Go Type Conversion\n// []byte Sent as is\n// string Sent as is\n// int, int64 strconv.FormatInt(v)\n// float64 strconv.FormatFloat(v, 'g', -1, 64)\n// bool true -> \"1\", false -> \"0\"\n// nil \"\"\n// all other types fmt.Fprint(w, v)\n//\n// Redis command reply types are represented using the following Go types:\n//\n// Redis type Go type\n// error redis.Error\n// integer int64\n// simple string string\n// bulk string []byte or nil if value not present.\n// array []interface{} or nil if value not present.\n//\n// Use type assertions or the reply helper functions to convert from\n// interface{} to the specific Go type for the command result.\n//\n// Pipelining\n//\n// Connections support pipelining using the Send, Flush and Receive methods.\n//\n// Send(commandName string, args ...interface{}) error\n// Flush() error\n// Receive() (reply interface{}, err error)\n//\n// Send writes the command to the connection's output buffer. Flush flushes the\n// connection's output buffer to the server. Receive reads a single reply from\n// the server. The following example shows a simple pipeline.\n//\n// c.Send(\"SET\", \"foo\", \"bar\")\n// c.Send(\"GET\", \"foo\")\n// c.Flush()\n// c.Receive() // reply from SET\n// v, err = c.Receive() // reply from GET\n//\n// The Do method combines the functionality of the Send, Flush and Receive\n// methods. The Do method starts by writing the command and flushing the output\n// buffer. Next, the Do method receives all pending replies including the reply\n// for the command just sent by Do. If any of the received replies is an error,\n// then Do returns the error. If there are no errors, then Do returns the last\n// reply. If the command argument to the Do method is \"\", then the Do method\n// will flush the output buffer and receive pending replies without sending a\n// command.\n//\n// Use the Send and Do methods to implement pipelined transactions.\n//\n// c.Send(\"MULTI\")\n// c.Send(\"INCR\", \"foo\")\n// c.Send(\"INCR\", \"bar\")\n// r, err := c.Do(\"EXEC\")\n// fmt.Println(r) // prints [1, 1]\n//\n// Concurrency\n//\n// Connections support one concurrent caller to the Receive method and one\n// concurrent caller to the Send and Flush methods. No other concurrency is\n// supported including concurrent calls to the Do method.\n//\n// For full concurrent access to Redis, use the thread-safe Pool to get, use\n// and release a connection from within a goroutine. Connections returned from\n// a Pool have the concurrency restrictions described in the previous\n// paragraph.\n//\n// Publish and Subscribe\n//\n// Use the Send, Flush and Receive methods to implement Pub/Sub subscribers.\n//\n// c.Send(\"SUBSCRIBE\", \"example\")\n// c.Flush()\n// for {\n// reply, err := c.Receive()\n// if err != nil {\n// return err\n// }\n// // process pushed message\n// }\n//\n// The PubSubConn type wraps a Conn with convenience methods for implementing\n// subscribers. The Subscribe, PSubscribe, Unsubscribe and PUnsubscribe methods\n// send and flush a subscription management command. The receive method\n// converts a pushed message to convenient types for use in a type switch.\n//\n// psc := redis.PubSubConn{Conn: c}\n// psc.Subscribe(\"example\")\n// for {\n// switch v := psc.Receive().(type) {\n// case redis.Message:\n// fmt.Printf(\"%s: message: %s\\n\", v.Channel, v.Data)\n// case redis.Subscription:\n// fmt.Printf(\"%s: %s %d\\n\", v.Channel, v.Kind, v.Count)\n// case error:\n// return v\n// }\n// }\n//\n// Reply Helpers\n//\n// The Bool, Int, Bytes, String, Strings and Values functions convert a reply\n// to a value of a specific type. To allow convenient wrapping of calls to the\n// connection Do and Receive methods, the functions take a second argument of\n// type error. If the error is non-nil, then the helper function returns the\n// error. If the error is nil, the function converts the reply to the specified\n// type:\n//\n// exists, err := redis.Bool(c.Do(\"EXISTS\", \"foo\"))\n// if err != nil {\n// // handle error return from c.Do or type conversion error.\n// }\n//\n// The Scan function converts elements of a array reply to Go types:\n//\n// var value1 int\n// var value2 string\n// reply, err := redis.Values(c.Do(\"MGET\", \"key1\", \"key2\"))\n// if err != nil {\n// // handle error\n// }\n// if _, err := redis.Scan(reply, &value1, &value2); err != nil {\n// // handle error\n// }\n//\n// Errors\n//\n// Connection methods return error replies from the server as type redis.Error.\n//\n// Call the connection Err() method to determine if the connection encountered\n// non-recoverable error such as a network error or protocol parsing error. If\n// Err() returns a non-nil value, then the connection is not usable and should\n// be closed.\npackage redis // import \"github.com/gomodule/redigo/redis\"\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/go16.go", "content": "// +build !go1.7\n\npackage redis\n\nimport \"crypto/tls\"\n\nfunc cloneTLSConfig(cfg *tls.Config) *tls.Config {\n\treturn &tls.Config{\n\t\tRand: cfg.Rand,\n\t\tTime: cfg.Time,\n\t\tCertificates: cfg.Certificates,\n\t\tNameToCertificate: cfg.NameToCertificate,\n\t\tGetCertificate: cfg.GetCertificate,\n\t\tRootCAs: cfg.RootCAs,\n\t\tNextProtos: cfg.NextProtos,\n\t\tServerName: cfg.ServerName,\n\t\tClientAuth: cfg.ClientAuth,\n\t\tClientCAs: cfg.ClientCAs,\n\t\tInsecureSkipVerify: cfg.InsecureSkipVerify,\n\t\tCipherSuites: cfg.CipherSuites,\n\t\tPreferServerCipherSuites: cfg.PreferServerCipherSuites,\n\t\tClientSessionCache: cfg.ClientSessionCache,\n\t\tMinVersion: cfg.MinVersion,\n\t\tMaxVersion: cfg.MaxVersion,\n\t\tCurvePreferences: cfg.CurvePreferences,\n\t}\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/go17.go", "content": "// +build go1.7,!go1.8\n\npackage redis\n\nimport \"crypto/tls\"\n\nfunc cloneTLSConfig(cfg *tls.Config) *tls.Config {\n\treturn &tls.Config{\n\t\tRand: cfg.Rand,\n\t\tTime: cfg.Time,\n\t\tCertificates: cfg.Certificates,\n\t\tNameToCertificate: cfg.NameToCertificate,\n\t\tGetCertificate: cfg.GetCertificate,\n\t\tRootCAs: cfg.RootCAs,\n\t\tNextProtos: cfg.NextProtos,\n\t\tServerName: cfg.ServerName,\n\t\tClientAuth: cfg.ClientAuth,\n\t\tClientCAs: cfg.ClientCAs,\n\t\tInsecureSkipVerify: cfg.InsecureSkipVerify,\n\t\tCipherSuites: cfg.CipherSuites,\n\t\tPreferServerCipherSuites: cfg.PreferServerCipherSuites,\n\t\tClientSessionCache: cfg.ClientSessionCache,\n\t\tMinVersion: cfg.MinVersion,\n\t\tMaxVersion: cfg.MaxVersion,\n\t\tCurvePreferences: cfg.CurvePreferences,\n\t\tDynamicRecordSizingDisabled: cfg.DynamicRecordSizingDisabled,\n\t\tRenegotiation: cfg.Renegotiation,\n\t}\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/go18.go", "content": "// +build go1.8\n\npackage redis\n\nimport \"crypto/tls\"\n\nfunc cloneTLSConfig(cfg *tls.Config) *tls.Config {\n\treturn cfg.Clone()\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/log.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"log\"\n\t\"time\"\n)\n\nvar (\n\t_ ConnWithTimeout = (*loggingConn)(nil)\n)\n\n// NewLoggingConn returns a logging wrapper around a connection.\nfunc NewLoggingConn(conn Conn, logger *log.Logger, prefix string) Conn {\n\tif prefix != \"\" {\n\t\tprefix = prefix + \".\"\n\t}\n\treturn &loggingConn{conn, logger, prefix}\n}\n\ntype loggingConn struct {\n\tConn\n\tlogger *log.Logger\n\tprefix string\n}\n\nfunc (c *loggingConn) Close() error {\n\terr := c.Conn.Close()\n\tvar buf bytes.Buffer\n\tfmt.Fprintf(&buf, \"%sClose() -> (%v)\", c.prefix, err)\n\tc.logger.Output(2, buf.String())\n\treturn err\n}\n\nfunc (c *loggingConn) printValue(buf *bytes.Buffer, v interface{}) {\n\tconst chop = 32\n\tswitch v := v.(type) {\n\tcase []byte:\n\t\tif len(v) > chop {\n\t\t\tfmt.Fprintf(buf, \"%q...\", v[:chop])\n\t\t} else {\n\t\t\tfmt.Fprintf(buf, \"%q\", v)\n\t\t}\n\tcase string:\n\t\tif len(v) > chop {\n\t\t\tfmt.Fprintf(buf, \"%q...\", v[:chop])\n\t\t} else {\n\t\t\tfmt.Fprintf(buf, \"%q\", v)\n\t\t}\n\tcase []interface{}:\n\t\tif len(v) == 0 {\n\t\t\tbuf.WriteString(\"[]\")\n\t\t} else {\n\t\t\tsep := \"[\"\n\t\t\tfin := \"]\"\n\t\t\tif len(v) > chop {\n\t\t\t\tv = v[:chop]\n\t\t\t\tfin = \"...]\"\n\t\t\t}\n\t\t\tfor _, vv := range v {\n\t\t\t\tbuf.WriteString(sep)\n\t\t\t\tc.printValue(buf, vv)\n\t\t\t\tsep = \", \"\n\t\t\t}\n\t\t\tbuf.WriteString(fin)\n\t\t}\n\tdefault:\n\t\tfmt.Fprint(buf, v)\n\t}\n}\n\nfunc (c *loggingConn) print(method, commandName string, args []interface{}, reply interface{}, err error) {\n\tvar buf bytes.Buffer\n\tfmt.Fprintf(&buf, \"%s%s(\", c.prefix, method)\n\tif method != \"Receive\" {\n\t\tbuf.WriteString(commandName)\n\t\tfor _, arg := range args {\n\t\t\tbuf.WriteString(\", \")\n\t\t\tc.printValue(&buf, arg)\n\t\t}\n\t}\n\tbuf.WriteString(\") -> (\")\n\tif method != \"Send\" {\n\t\tc.printValue(&buf, reply)\n\t\tbuf.WriteString(\", \")\n\t}\n\tfmt.Fprintf(&buf, \"%v)\", err)\n\tc.logger.Output(3, buf.String())\n}\n\nfunc (c *loggingConn) Do(commandName string, args ...interface{}) (interface{}, error) {\n\treply, err := c.Conn.Do(commandName, args...)\n\tc.print(\"Do\", commandName, args, reply, err)\n\treturn reply, err\n}\n\nfunc (c *loggingConn) DoWithTimeout(timeout time.Duration, commandName string, args ...interface{}) (interface{}, error) {\n\treply, err := DoWithTimeout(c.Conn, timeout, commandName, args...)\n\tc.print(\"DoWithTimeout\", commandName, args, reply, err)\n\treturn reply, err\n}\n\nfunc (c *loggingConn) Send(commandName string, args ...interface{}) error {\n\terr := c.Conn.Send(commandName, args...)\n\tc.print(\"Send\", commandName, args, nil, err)\n\treturn err\n}\n\nfunc (c *loggingConn) Receive() (interface{}, error) {\n\treply, err := c.Conn.Receive()\n\tc.print(\"Receive\", \"\", nil, reply, err)\n\treturn reply, err\n}\n\nfunc (c *loggingConn) ReceiveWithTimeout(timeout time.Duration) (interface{}, error) {\n\treply, err := ReceiveWithTimeout(c.Conn, timeout)\n\tc.print(\"ReceiveWithTimeout\", \"\", nil, reply, err)\n\treturn reply, err\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/pool.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"bytes\"\n\t\"crypto/rand\"\n\t\"crypto/sha1\"\n\t\"errors\"\n\t\"io\"\n\t\"strconv\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"time\"\n\n\t\"github.com/gomodule/redigo/internal\"\n)\n\nvar (\n\t_ ConnWithTimeout = (*activeConn)(nil)\n\t_ ConnWithTimeout = (*errorConn)(nil)\n)\n\nvar nowFunc = time.Now // for testing\n\n// ErrPoolExhausted is returned from a pool connection method (Do, Send,\n// Receive, Flush, Err) when the maximum number of database connections in the\n// pool has been reached.\nvar ErrPoolExhausted = errors.New(\"redigo: connection pool exhausted\")\n\nvar (\n\terrPoolClosed = errors.New(\"redigo: connection pool closed\")\n\terrConnClosed = errors.New(\"redigo: connection closed\")\n)\n\n// Pool maintains a pool of connections. The application calls the Get method\n// to get a connection from the pool and the connection's Close method to\n// return the connection's resources to the pool.\n//\n// The following example shows how to use a pool in a web application. The\n// application creates a pool at application startup and makes it available to\n// request handlers using a package level variable. The pool configuration used\n// here is an example, not a recommendation.\n//\n// func newPool(addr string) *redis.Pool {\n// return &redis.Pool{\n// MaxIdle: 3,\n// IdleTimeout: 240 * time.Second,\n// Dial: func () (redis.Conn, error) { return redis.Dial(\"tcp\", addr) },\n// }\n// }\n//\n// var (\n// pool *redis.Pool\n// redisServer = flag.String(\"redisServer\", \":6379\", \"\")\n// )\n//\n// func main() {\n// flag.Parse()\n// pool = newPool(*redisServer)\n// ...\n// }\n//\n// A request handler gets a connection from the pool and closes the connection\n// when the handler is done:\n//\n// func serveHome(w http.ResponseWriter, r *http.Request) {\n// conn := pool.Get()\n// defer conn.Close()\n// ...\n// }\n//\n// Use the Dial function to authenticate connections with the AUTH command or\n// select a database with the SELECT command:\n//\n// pool := &redis.Pool{\n// // Other pool configuration not shown in this example.\n// Dial: func () (redis.Conn, error) {\n// c, err := redis.Dial(\"tcp\", server)\n// if err != nil {\n// return nil, err\n// }\n// if _, err := c.Do(\"AUTH\", password); err != nil {\n// c.Close()\n// return nil, err\n// }\n// if _, err := c.Do(\"SELECT\", db); err != nil {\n// c.Close()\n// return nil, err\n// }\n// return c, nil\n// },\n// }\n//\n// Use the TestOnBorrow function to check the health of an idle connection\n// before the connection is returned to the application. This example PINGs\n// connections that have been idle more than a minute:\n//\n// pool := &redis.Pool{\n// // Other pool configuration not shown in this example.\n// TestOnBorrow: func(c redis.Conn, t time.Time) error {\n// if time.Since(t) < time.Minute {\n// return nil\n// }\n// _, err := c.Do(\"PING\")\n// return err\n// },\n// }\n//\ntype Pool struct {\n\t// Dial is an application supplied function for creating and configuring a\n\t// connection.\n\t//\n\t// The connection returned from Dial must not be in a special state\n\t// (subscribed to pubsub channel, transaction started, ...).\n\tDial func() (Conn, error)\n\n\t// TestOnBorrow is an optional application supplied function for checking\n\t// the health of an idle connection before the connection is used again by\n\t// the application. Argument t is the time that the connection was returned\n\t// to the pool. If the function returns an error, then the connection is\n\t// closed.\n\tTestOnBorrow func(c Conn, t time.Time) error\n\n\t// Maximum number of idle connections in the pool.\n\tMaxIdle int\n\n\t// Maximum number of connections allocated by the pool at a given time.\n\t// When zero, there is no limit on the number of connections in the pool.\n\tMaxActive int\n\n\t// Close connections after remaining idle for this duration. If the value\n\t// is zero, then idle connections are not closed. Applications should set\n\t// the timeout to a value less than the server's timeout.\n\tIdleTimeout time.Duration\n\n\t// If Wait is true and the pool is at the MaxActive limit, then Get() waits\n\t// for a connection to be returned to the pool before returning.\n\tWait bool\n\n\t// Close connections older than this duration. If the value is zero, then\n\t// the pool does not close connections based on age.\n\tMaxConnLifetime time.Duration\n\n\tchInitialized uint32 // set to 1 when field ch is initialized\n\n\tmu sync.Mutex // mu protects the following fields\n\tclosed bool // set to true when the pool is closed.\n\tactive int // the number of open connections in the pool\n\tch chan struct{} // limits open connections when p.Wait is true\n\tidle idleList // idle connections\n}\n\n// NewPool creates a new pool.\n//\n// Deprecated: Initialize the Pool directory as shown in the example.\nfunc NewPool(newFn func() (Conn, error), maxIdle int) *Pool {\n\treturn &Pool{Dial: newFn, MaxIdle: maxIdle}\n}\n\n// Get gets a connection. The application must close the returned connection.\n// This method always returns a valid connection so that applications can defer\n// error handling to the first use of the connection. If there is an error\n// getting an underlying connection, then the connection Err, Do, Send, Flush\n// and Receive methods return that error.\nfunc (p *Pool) Get() Conn {\n\tpc, err := p.get(nil)\n\tif err != nil {\n\t\treturn errorConn{err}\n\t}\n\treturn &activeConn{p: p, pc: pc}\n}\n\n// PoolStats contains pool statistics.\ntype PoolStats struct {\n\t// ActiveCount is the number of connections in the pool. The count includes\n\t// idle connections and connections in use.\n\tActiveCount int\n\t// IdleCount is the number of idle connections in the pool.\n\tIdleCount int\n}\n\n// Stats returns pool's statistics.\nfunc (p *Pool) Stats() PoolStats {\n\tp.mu.Lock()\n\tstats := PoolStats{\n\t\tActiveCount: p.active,\n\t\tIdleCount: p.idle.count,\n\t}\n\tp.mu.Unlock()\n\n\treturn stats\n}\n\n// ActiveCount returns the number of connections in the pool. The count\n// includes idle connections and connections in use.\nfunc (p *Pool) ActiveCount() int {\n\tp.mu.Lock()\n\tactive := p.active\n\tp.mu.Unlock()\n\treturn active\n}\n\n// IdleCount returns the number of idle connections in the pool.\nfunc (p *Pool) IdleCount() int {\n\tp.mu.Lock()\n\tidle := p.idle.count\n\tp.mu.Unlock()\n\treturn idle\n}\n\n// Close releases the resources used by the pool.\nfunc (p *Pool) Close() error {\n\tp.mu.Lock()\n\tif p.closed {\n\t\tp.mu.Unlock()\n\t\treturn nil\n\t}\n\tp.closed = true\n\tp.active -= p.idle.count\n\tpc := p.idle.front\n\tp.idle.count = 0\n\tp.idle.front, p.idle.back = nil, nil\n\tif p.ch != nil {\n\t\tclose(p.ch)\n\t}\n\tp.mu.Unlock()\n\tfor ; pc != nil; pc = pc.next {\n\t\tpc.c.Close()\n\t}\n\treturn nil\n}\n\nfunc (p *Pool) lazyInit() {\n\t// Fast path.\n\tif atomic.LoadUint32(&p.chInitialized) == 1 {\n\t\treturn\n\t}\n\t// Slow path.\n\tp.mu.Lock()\n\tif p.chInitialized == 0 {\n\t\tp.ch = make(chan struct{}, p.MaxActive)\n\t\tif p.closed {\n\t\t\tclose(p.ch)\n\t\t} else {\n\t\t\tfor i := 0; i < p.MaxActive; i++ {\n\t\t\t\tp.ch <- struct{}{}\n\t\t\t}\n\t\t}\n\t\tatomic.StoreUint32(&p.chInitialized, 1)\n\t}\n\tp.mu.Unlock()\n}\n\n// get prunes stale connections and returns a connection from the idle list or\n// creates a new connection.\nfunc (p *Pool) get(ctx interface {\n\tDone() <-chan struct{}\n\tErr() error\n}) (*poolConn, error) {\n\n\t// Handle limit for p.Wait == true.\n\tif p.Wait && p.MaxActive > 0 {\n\t\tp.lazyInit()\n\t\tif ctx == nil {\n\t\t\t<-p.ch\n\t\t} else {\n\t\t\tselect {\n\t\t\tcase <-p.ch:\n\t\t\tcase <-ctx.Done():\n\t\t\t\treturn nil, ctx.Err()\n\t\t\t}\n\t\t}\n\t}\n\n\tp.mu.Lock()\n\n\t// Prune stale connections at the back of the idle list.\n\tif p.IdleTimeout > 0 {\n\t\tn := p.idle.count\n\t\tfor i := 0; i < n && p.idle.back != nil && p.idle.back.t.Add(p.IdleTimeout).Before(nowFunc()); i++ {\n\t\t\tpc := p.idle.back\n\t\t\tp.idle.popBack()\n\t\t\tp.mu.Unlock()\n\t\t\tpc.c.Close()\n\t\t\tp.mu.Lock()\n\t\t\tp.active--\n\t\t}\n\t}\n\n\t// Get idle connection from the front of idle list.\n\tfor p.idle.front != nil {\n\t\tpc := p.idle.front\n\t\tp.idle.popFront()\n\t\tp.mu.Unlock()\n\t\tif (p.TestOnBorrow == nil || p.TestOnBorrow(pc.c, pc.t) == nil) &&\n\t\t\t(p.MaxConnLifetime == 0 || nowFunc().Sub(pc.created) < p.MaxConnLifetime) {\n\t\t\treturn pc, nil\n\t\t}\n\t\tpc.c.Close()\n\t\tp.mu.Lock()\n\t\tp.active--\n\t}\n\n\t// Check for pool closed before dialing a new connection.\n\tif p.closed {\n\t\tp.mu.Unlock()\n\t\treturn nil, errors.New(\"redigo: get on closed pool\")\n\t}\n\n\t// Handle limit for p.Wait == false.\n\tif !p.Wait && p.MaxActive > 0 && p.active >= p.MaxActive {\n\t\tp.mu.Unlock()\n\t\treturn nil, ErrPoolExhausted\n\t}\n\n\tp.active++\n\tp.mu.Unlock()\n\tc, err := p.Dial()\n\tif err != nil {\n\t\tc = nil\n\t\tp.mu.Lock()\n\t\tp.active--\n\t\tif p.ch != nil && !p.closed {\n\t\t\tp.ch <- struct{}{}\n\t\t}\n\t\tp.mu.Unlock()\n\t}\n\treturn &poolConn{c: c, created: nowFunc()}, err\n}\n\nfunc (p *Pool) put(pc *poolConn, forceClose bool) error {\n\tp.mu.Lock()\n\tif !p.closed && !forceClose {\n\t\tpc.t = nowFunc()\n\t\tp.idle.pushFront(pc)\n\t\tif p.idle.count > p.MaxIdle {\n\t\t\tpc = p.idle.back\n\t\t\tp.idle.popBack()\n\t\t} else {\n\t\t\tpc = nil\n\t\t}\n\t}\n\n\tif pc != nil {\n\t\tp.mu.Unlock()\n\t\tpc.c.Close()\n\t\tp.mu.Lock()\n\t\tp.active--\n\t}\n\n\tif p.ch != nil && !p.closed {\n\t\tp.ch <- struct{}{}\n\t}\n\tp.mu.Unlock()\n\treturn nil\n}\n\ntype activeConn struct {\n\tp *Pool\n\tpc *poolConn\n\tstate int\n}\n\nvar (\n\tsentinel []byte\n\tsentinelOnce sync.Once\n)\n\nfunc initSentinel() {\n\tp := make([]byte, 64)\n\tif _, err := rand.Read(p); err == nil {\n\t\tsentinel = p\n\t} else {\n\t\th := sha1.New()\n\t\tio.WriteString(h, \"Oops, rand failed. Use time instead.\")\n\t\tio.WriteString(h, strconv.FormatInt(time.Now().UnixNano(), 10))\n\t\tsentinel = h.Sum(nil)\n\t}\n}\n\nfunc (ac *activeConn) Close() error {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn nil\n\t}\n\tac.pc = nil\n\n\tif ac.state&internal.MultiState != 0 {\n\t\tpc.c.Send(\"DISCARD\")\n\t\tac.state &^= (internal.MultiState | internal.WatchState)\n\t} else if ac.state&internal.WatchState != 0 {\n\t\tpc.c.Send(\"UNWATCH\")\n\t\tac.state &^= internal.WatchState\n\t}\n\tif ac.state&internal.SubscribeState != 0 {\n\t\tpc.c.Send(\"UNSUBSCRIBE\")\n\t\tpc.c.Send(\"PUNSUBSCRIBE\")\n\t\t// To detect the end of the message stream, ask the server to echo\n\t\t// a sentinel value and read until we see that value.\n\t\tsentinelOnce.Do(initSentinel)\n\t\tpc.c.Send(\"ECHO\", sentinel)\n\t\tpc.c.Flush()\n\t\tfor {\n\t\t\tp, err := pc.c.Receive()\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif p, ok := p.([]byte); ok && bytes.Equal(p, sentinel) {\n\t\t\t\tac.state &^= internal.SubscribeState\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tpc.c.Do(\"\")\n\tac.p.put(pc, ac.state != 0 || pc.c.Err() != nil)\n\treturn nil\n}\n\nfunc (ac *activeConn) Err() error {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn errConnClosed\n\t}\n\treturn pc.c.Err()\n}\n\nfunc (ac *activeConn) Do(commandName string, args ...interface{}) (reply interface{}, err error) {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn nil, errConnClosed\n\t}\n\tci := internal.LookupCommandInfo(commandName)\n\tac.state = (ac.state | ci.Set) &^ ci.Clear\n\treturn pc.c.Do(commandName, args...)\n}\n\nfunc (ac *activeConn) DoWithTimeout(timeout time.Duration, commandName string, args ...interface{}) (reply interface{}, err error) {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn nil, errConnClosed\n\t}\n\tcwt, ok := pc.c.(ConnWithTimeout)\n\tif !ok {\n\t\treturn nil, errTimeoutNotSupported\n\t}\n\tci := internal.LookupCommandInfo(commandName)\n\tac.state = (ac.state | ci.Set) &^ ci.Clear\n\treturn cwt.DoWithTimeout(timeout, commandName, args...)\n}\n\nfunc (ac *activeConn) Send(commandName string, args ...interface{}) error {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn errConnClosed\n\t}\n\tci := internal.LookupCommandInfo(commandName)\n\tac.state = (ac.state | ci.Set) &^ ci.Clear\n\treturn pc.c.Send(commandName, args...)\n}\n\nfunc (ac *activeConn) Flush() error {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn errConnClosed\n\t}\n\treturn pc.c.Flush()\n}\n\nfunc (ac *activeConn) Receive() (reply interface{}, err error) {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn nil, errConnClosed\n\t}\n\treturn pc.c.Receive()\n}\n\nfunc (ac *activeConn) ReceiveWithTimeout(timeout time.Duration) (reply interface{}, err error) {\n\tpc := ac.pc\n\tif pc == nil {\n\t\treturn nil, errConnClosed\n\t}\n\tcwt, ok := pc.c.(ConnWithTimeout)\n\tif !ok {\n\t\treturn nil, errTimeoutNotSupported\n\t}\n\treturn cwt.ReceiveWithTimeout(timeout)\n}\n\ntype errorConn struct{ err error }\n\nfunc (ec errorConn) Do(string, ...interface{}) (interface{}, error) { return nil, ec.err }\nfunc (ec errorConn) DoWithTimeout(time.Duration, string, ...interface{}) (interface{}, error) {\n\treturn nil, ec.err\n}\nfunc (ec errorConn) Send(string, ...interface{}) error { return ec.err }\nfunc (ec errorConn) Err() error { return ec.err }\nfunc (ec errorConn) Close() error { return nil }\nfunc (ec errorConn) Flush() error { return ec.err }\nfunc (ec errorConn) Receive() (interface{}, error) { return nil, ec.err }\nfunc (ec errorConn) ReceiveWithTimeout(time.Duration) (interface{}, error) { return nil, ec.err }\n\ntype idleList struct {\n\tcount int\n\tfront, back *poolConn\n}\n\ntype poolConn struct {\n\tc Conn\n\tt time.Time\n\tcreated time.Time\n\tnext, prev *poolConn\n}\n\nfunc (l *idleList) pushFront(pc *poolConn) {\n\tpc.next = l.front\n\tpc.prev = nil\n\tif l.count == 0 {\n\t\tl.back = pc\n\t} else {\n\t\tl.front.prev = pc\n\t}\n\tl.front = pc\n\tl.count++\n\treturn\n}\n\nfunc (l *idleList) popFront() {\n\tpc := l.front\n\tl.count--\n\tif l.count == 0 {\n\t\tl.front, l.back = nil, nil\n\t} else {\n\t\tpc.next.prev = nil\n\t\tl.front = pc.next\n\t}\n\tpc.next, pc.prev = nil, nil\n}\n\nfunc (l *idleList) popBack() {\n\tpc := l.back\n\tl.count--\n\tif l.count == 0 {\n\t\tl.front, l.back = nil, nil\n\t} else {\n\t\tpc.prev.next = nil\n\t\tl.back = pc.prev\n\t}\n\tpc.next, pc.prev = nil, nil\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/pool17.go", "content": "// Copyright 2018 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\n// +build go1.7\n\npackage redis\n\nimport \"context\"\n\n// GetContext gets a connection using the provided context.\n//\n// The provided Context must be non-nil. If the context expires before the\n// connection is complete, an error is returned. Any expiration on the context\n// will not affect the returned connection.\n//\n// If the function completes without error, then the application must close the\n// returned connection.\nfunc (p *Pool) GetContext(ctx context.Context) (Conn, error) {\n\tpc, err := p.get(ctx)\n\tif err != nil {\n\t\treturn errorConn{err}, err\n\t}\n\treturn &activeConn{p: p, pc: pc}, nil\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/pubsub.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"errors\"\n\t\"time\"\n)\n\n// Subscription represents a subscribe or unsubscribe notification.\ntype Subscription struct {\n\t// Kind is \"subscribe\", \"unsubscribe\", \"psubscribe\" or \"punsubscribe\"\n\tKind string\n\n\t// The channel that was changed.\n\tChannel string\n\n\t// The current number of subscriptions for connection.\n\tCount int\n}\n\n// Message represents a message notification.\ntype Message struct {\n\t// The originating channel.\n\tChannel string\n\n\t// The matched pattern, if any\n\tPattern string\n\n\t// The message data.\n\tData []byte\n}\n\n// Pong represents a pubsub pong notification.\ntype Pong struct {\n\tData string\n}\n\n// PubSubConn wraps a Conn with convenience methods for subscribers.\ntype PubSubConn struct {\n\tConn Conn\n}\n\n// Close closes the connection.\nfunc (c PubSubConn) Close() error {\n\treturn c.Conn.Close()\n}\n\n// Subscribe subscribes the connection to the specified channels.\nfunc (c PubSubConn) Subscribe(channel ...interface{}) error {\n\tc.Conn.Send(\"SUBSCRIBE\", channel...)\n\treturn c.Conn.Flush()\n}\n\n// PSubscribe subscribes the connection to the given patterns.\nfunc (c PubSubConn) PSubscribe(channel ...interface{}) error {\n\tc.Conn.Send(\"PSUBSCRIBE\", channel...)\n\treturn c.Conn.Flush()\n}\n\n// Unsubscribe unsubscribes the connection from the given channels, or from all\n// of them if none is given.\nfunc (c PubSubConn) Unsubscribe(channel ...interface{}) error {\n\tc.Conn.Send(\"UNSUBSCRIBE\", channel...)\n\treturn c.Conn.Flush()\n}\n\n// PUnsubscribe unsubscribes the connection from the given patterns, or from all\n// of them if none is given.\nfunc (c PubSubConn) PUnsubscribe(channel ...interface{}) error {\n\tc.Conn.Send(\"PUNSUBSCRIBE\", channel...)\n\treturn c.Conn.Flush()\n}\n\n// Ping sends a PING to the server with the specified data.\n//\n// The connection must be subscribed to at least one channel or pattern when\n// calling this method.\nfunc (c PubSubConn) Ping(data string) error {\n\tc.Conn.Send(\"PING\", data)\n\treturn c.Conn.Flush()\n}\n\n// Receive returns a pushed message as a Subscription, Message, Pong or error.\n// The return value is intended to be used directly in a type switch as\n// illustrated in the PubSubConn example.\nfunc (c PubSubConn) Receive() interface{} {\n\treturn c.receiveInternal(c.Conn.Receive())\n}\n\n// ReceiveWithTimeout is like Receive, but it allows the application to\n// override the connection's default timeout.\nfunc (c PubSubConn) ReceiveWithTimeout(timeout time.Duration) interface{} {\n\treturn c.receiveInternal(ReceiveWithTimeout(c.Conn, timeout))\n}\n\nfunc (c PubSubConn) receiveInternal(replyArg interface{}, errArg error) interface{} {\n\treply, err := Values(replyArg, errArg)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tvar kind string\n\treply, err = Scan(reply, &kind)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tswitch kind {\n\tcase \"message\":\n\t\tvar m Message\n\t\tif _, err := Scan(reply, &m.Channel, &m.Data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn m\n\tcase \"pmessage\":\n\t\tvar m Message\n\t\tif _, err := Scan(reply, &m.Pattern, &m.Channel, &m.Data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn m\n\tcase \"subscribe\", \"psubscribe\", \"unsubscribe\", \"punsubscribe\":\n\t\ts := Subscription{Kind: kind}\n\t\tif _, err := Scan(reply, &s.Channel, &s.Count); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn s\n\tcase \"pong\":\n\t\tvar p Pong\n\t\tif _, err := Scan(reply, &p.Data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn p\n\t}\n\treturn errors.New(\"redigo: unknown pubsub notification\")\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/redis.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"errors\"\n\t\"time\"\n)\n\n// Error represents an error returned in a command reply.\ntype Error string\n\nfunc (err Error) Error() string { return string(err) }\n\n// Conn represents a connection to a Redis server.\ntype Conn interface {\n\t// Close closes the connection.\n\tClose() error\n\n\t// Err returns a non-nil value when the connection is not usable.\n\tErr() error\n\n\t// Do sends a command to the server and returns the received reply.\n\tDo(commandName string, args ...interface{}) (reply interface{}, err error)\n\n\t// Send writes the command to the client's output buffer.\n\tSend(commandName string, args ...interface{}) error\n\n\t// Flush flushes the output buffer to the Redis server.\n\tFlush() error\n\n\t// Receive receives a single reply from the Redis server\n\tReceive() (reply interface{}, err error)\n}\n\n// Argument is the interface implemented by an object which wants to control how\n// the object is converted to Redis bulk strings.\ntype Argument interface {\n\t// RedisArg returns a value to be encoded as a bulk string per the\n\t// conversions listed in the section 'Executing Commands'.\n\t// Implementations should typically return a []byte or string.\n\tRedisArg() interface{}\n}\n\n// Scanner is implemented by an object which wants to control its value is\n// interpreted when read from Redis.\ntype Scanner interface {\n\t// RedisScan assigns a value from a Redis value. The argument src is one of\n\t// the reply types listed in the section `Executing Commands`.\n\t//\n\t// An error should be returned if the value cannot be stored without\n\t// loss of information.\n\tRedisScan(src interface{}) error\n}\n\n// ConnWithTimeout is an optional interface that allows the caller to override\n// a connection's default read timeout. This interface is useful for executing\n// the BLPOP, BRPOP, BRPOPLPUSH, XREAD and other commands that block at the\n// server.\n//\n// A connection's default read timeout is set with the DialReadTimeout dial\n// option. Applications should rely on the default timeout for commands that do\n// not block at the server.\n//\n// All of the Conn implementations in this package satisfy the ConnWithTimeout\n// interface.\n//\n// Use the DoWithTimeout and ReceiveWithTimeout helper functions to simplify\n// use of this interface.\ntype ConnWithTimeout interface {\n\tConn\n\n\t// Do sends a command to the server and returns the received reply.\n\t// The timeout overrides the read timeout set when dialing the\n\t// connection.\n\tDoWithTimeout(timeout time.Duration, commandName string, args ...interface{}) (reply interface{}, err error)\n\n\t// Receive receives a single reply from the Redis server. The timeout\n\t// overrides the read timeout set when dialing the connection.\n\tReceiveWithTimeout(timeout time.Duration) (reply interface{}, err error)\n}\n\nvar errTimeoutNotSupported = errors.New(\"redis: connection does not support ConnWithTimeout\")\n\n// DoWithTimeout executes a Redis command with the specified read timeout. If\n// the connection does not satisfy the ConnWithTimeout interface, then an error\n// is returned.\nfunc DoWithTimeout(c Conn, timeout time.Duration, cmd string, args ...interface{}) (interface{}, error) {\n\tcwt, ok := c.(ConnWithTimeout)\n\tif !ok {\n\t\treturn nil, errTimeoutNotSupported\n\t}\n\treturn cwt.DoWithTimeout(timeout, cmd, args...)\n}\n\n// ReceiveWithTimeout receives a reply with the specified read timeout. If the\n// connection does not satisfy the ConnWithTimeout interface, then an error is\n// returned.\nfunc ReceiveWithTimeout(c Conn, timeout time.Duration) (interface{}, error) {\n\tcwt, ok := c.(ConnWithTimeout)\n\tif !ok {\n\t\treturn nil, errTimeoutNotSupported\n\t}\n\treturn cwt.ReceiveWithTimeout(timeout)\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/reply.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"strconv\"\n)\n\n// ErrNil indicates that a reply value is nil.\nvar ErrNil = errors.New(\"redigo: nil returned\")\n\n// Int is a helper that converts a command reply to an integer. If err is not\n// equal to nil, then Int returns 0, err. Otherwise, Int converts the\n// reply to an int as follows:\n//\n// Reply type Result\n// integer int(reply), nil\n// bulk string parsed reply, nil\n// nil 0, ErrNil\n// other 0, error\nfunc Int(reply interface{}, err error) (int, error) {\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase int64:\n\t\tx := int(reply)\n\t\tif int64(x) != reply {\n\t\t\treturn 0, strconv.ErrRange\n\t\t}\n\t\treturn x, nil\n\tcase []byte:\n\t\tn, err := strconv.ParseInt(string(reply), 10, 0)\n\t\treturn int(n), err\n\tcase nil:\n\t\treturn 0, ErrNil\n\tcase Error:\n\t\treturn 0, reply\n\t}\n\treturn 0, fmt.Errorf(\"redigo: unexpected type for Int, got type %T\", reply)\n}\n\n// Int64 is a helper that converts a command reply to 64 bit integer. If err is\n// not equal to nil, then Int returns 0, err. Otherwise, Int64 converts the\n// reply to an int64 as follows:\n//\n// Reply type Result\n// integer reply, nil\n// bulk string parsed reply, nil\n// nil 0, ErrNil\n// other 0, error\nfunc Int64(reply interface{}, err error) (int64, error) {\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase int64:\n\t\treturn reply, nil\n\tcase []byte:\n\t\tn, err := strconv.ParseInt(string(reply), 10, 64)\n\t\treturn n, err\n\tcase nil:\n\t\treturn 0, ErrNil\n\tcase Error:\n\t\treturn 0, reply\n\t}\n\treturn 0, fmt.Errorf(\"redigo: unexpected type for Int64, got type %T\", reply)\n}\n\nvar errNegativeInt = errors.New(\"redigo: unexpected value for Uint64\")\n\n// Uint64 is a helper that converts a command reply to 64 bit integer. If err is\n// not equal to nil, then Int returns 0, err. Otherwise, Int64 converts the\n// reply to an int64 as follows:\n//\n// Reply type Result\n// integer reply, nil\n// bulk string parsed reply, nil\n// nil 0, ErrNil\n// other 0, error\nfunc Uint64(reply interface{}, err error) (uint64, error) {\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase int64:\n\t\tif reply < 0 {\n\t\t\treturn 0, errNegativeInt\n\t\t}\n\t\treturn uint64(reply), nil\n\tcase []byte:\n\t\tn, err := strconv.ParseUint(string(reply), 10, 64)\n\t\treturn n, err\n\tcase nil:\n\t\treturn 0, ErrNil\n\tcase Error:\n\t\treturn 0, reply\n\t}\n\treturn 0, fmt.Errorf(\"redigo: unexpected type for Uint64, got type %T\", reply)\n}\n\n// Float64 is a helper that converts a command reply to 64 bit float. If err is\n// not equal to nil, then Float64 returns 0, err. Otherwise, Float64 converts\n// the reply to an int as follows:\n//\n// Reply type Result\n// bulk string parsed reply, nil\n// nil 0, ErrNil\n// other 0, error\nfunc Float64(reply interface{}, err error) (float64, error) {\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase []byte:\n\t\tn, err := strconv.ParseFloat(string(reply), 64)\n\t\treturn n, err\n\tcase nil:\n\t\treturn 0, ErrNil\n\tcase Error:\n\t\treturn 0, reply\n\t}\n\treturn 0, fmt.Errorf(\"redigo: unexpected type for Float64, got type %T\", reply)\n}\n\n// String is a helper that converts a command reply to a string. If err is not\n// equal to nil, then String returns \"\", err. Otherwise String converts the\n// reply to a string as follows:\n//\n// Reply type Result\n// bulk string string(reply), nil\n// simple string reply, nil\n// nil \"\", ErrNil\n// other \"\", error\nfunc String(reply interface{}, err error) (string, error) {\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tswitch reply := reply.(type) {\n\tcase []byte:\n\t\treturn string(reply), nil\n\tcase string:\n\t\treturn reply, nil\n\tcase nil:\n\t\treturn \"\", ErrNil\n\tcase Error:\n\t\treturn \"\", reply\n\t}\n\treturn \"\", fmt.Errorf(\"redigo: unexpected type for String, got type %T\", reply)\n}\n\n// Bytes is a helper that converts a command reply to a slice of bytes. If err\n// is not equal to nil, then Bytes returns nil, err. Otherwise Bytes converts\n// the reply to a slice of bytes as follows:\n//\n// Reply type Result\n// bulk string reply, nil\n// simple string []byte(reply), nil\n// nil nil, ErrNil\n// other nil, error\nfunc Bytes(reply interface{}, err error) ([]byte, error) {\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase []byte:\n\t\treturn reply, nil\n\tcase string:\n\t\treturn []byte(reply), nil\n\tcase nil:\n\t\treturn nil, ErrNil\n\tcase Error:\n\t\treturn nil, reply\n\t}\n\treturn nil, fmt.Errorf(\"redigo: unexpected type for Bytes, got type %T\", reply)\n}\n\n// Bool is a helper that converts a command reply to a boolean. If err is not\n// equal to nil, then Bool returns false, err. Otherwise Bool converts the\n// reply to boolean as follows:\n//\n// Reply type Result\n// integer value != 0, nil\n// bulk string strconv.ParseBool(reply)\n// nil false, ErrNil\n// other false, error\nfunc Bool(reply interface{}, err error) (bool, error) {\n\tif err != nil {\n\t\treturn false, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase int64:\n\t\treturn reply != 0, nil\n\tcase []byte:\n\t\treturn strconv.ParseBool(string(reply))\n\tcase nil:\n\t\treturn false, ErrNil\n\tcase Error:\n\t\treturn false, reply\n\t}\n\treturn false, fmt.Errorf(\"redigo: unexpected type for Bool, got type %T\", reply)\n}\n\n// MultiBulk is a helper that converts an array command reply to a []interface{}.\n//\n// Deprecated: Use Values instead.\nfunc MultiBulk(reply interface{}, err error) ([]interface{}, error) { return Values(reply, err) }\n\n// Values is a helper that converts an array command reply to a []interface{}.\n// If err is not equal to nil, then Values returns nil, err. Otherwise, Values\n// converts the reply as follows:\n//\n// Reply type Result\n// array reply, nil\n// nil nil, ErrNil\n// other nil, error\nfunc Values(reply interface{}, err error) ([]interface{}, error) {\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tswitch reply := reply.(type) {\n\tcase []interface{}:\n\t\treturn reply, nil\n\tcase nil:\n\t\treturn nil, ErrNil\n\tcase Error:\n\t\treturn nil, reply\n\t}\n\treturn nil, fmt.Errorf(\"redigo: unexpected type for Values, got type %T\", reply)\n}\n\nfunc sliceHelper(reply interface{}, err error, name string, makeSlice func(int), assign func(int, interface{}) error) error {\n\tif err != nil {\n\t\treturn err\n\t}\n\tswitch reply := reply.(type) {\n\tcase []interface{}:\n\t\tmakeSlice(len(reply))\n\t\tfor i := range reply {\n\t\t\tif reply[i] == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err := assign(i, reply[i]); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\treturn nil\n\tcase nil:\n\t\treturn ErrNil\n\tcase Error:\n\t\treturn reply\n\t}\n\treturn fmt.Errorf(\"redigo: unexpected type for %s, got type %T\", name, reply)\n}\n\n// Float64s is a helper that converts an array command reply to a []float64. If\n// err is not equal to nil, then Float64s returns nil, err. Nil array items are\n// converted to 0 in the output slice. Floats64 returns an error if an array\n// item is not a bulk string or nil.\nfunc Float64s(reply interface{}, err error) ([]float64, error) {\n\tvar result []float64\n\terr = sliceHelper(reply, err, \"Float64s\", func(n int) { result = make([]float64, n) }, func(i int, v interface{}) error {\n\t\tp, ok := v.([]byte)\n\t\tif !ok {\n\t\t\treturn fmt.Errorf(\"redigo: unexpected element type for Floats64, got type %T\", v)\n\t\t}\n\t\tf, err := strconv.ParseFloat(string(p), 64)\n\t\tresult[i] = f\n\t\treturn err\n\t})\n\treturn result, err\n}\n\n// Strings is a helper that converts an array command reply to a []string. If\n// err is not equal to nil, then Strings returns nil, err. Nil array items are\n// converted to \"\" in the output slice. Strings returns an error if an array\n// item is not a bulk string or nil.\nfunc Strings(reply interface{}, err error) ([]string, error) {\n\tvar result []string\n\terr = sliceHelper(reply, err, \"Strings\", func(n int) { result = make([]string, n) }, func(i int, v interface{}) error {\n\t\tswitch v := v.(type) {\n\t\tcase string:\n\t\t\tresult[i] = v\n\t\t\treturn nil\n\t\tcase []byte:\n\t\t\tresult[i] = string(v)\n\t\t\treturn nil\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"redigo: unexpected element type for Strings, got type %T\", v)\n\t\t}\n\t})\n\treturn result, err\n}\n\n// ByteSlices is a helper that converts an array command reply to a [][]byte.\n// If err is not equal to nil, then ByteSlices returns nil, err. Nil array\n// items are stay nil. ByteSlices returns an error if an array item is not a\n// bulk string or nil.\nfunc ByteSlices(reply interface{}, err error) ([][]byte, error) {\n\tvar result [][]byte\n\terr = sliceHelper(reply, err, \"ByteSlices\", func(n int) { result = make([][]byte, n) }, func(i int, v interface{}) error {\n\t\tp, ok := v.([]byte)\n\t\tif !ok {\n\t\t\treturn fmt.Errorf(\"redigo: unexpected element type for ByteSlices, got type %T\", v)\n\t\t}\n\t\tresult[i] = p\n\t\treturn nil\n\t})\n\treturn result, err\n}\n\n// Int64s is a helper that converts an array command reply to a []int64.\n// If err is not equal to nil, then Int64s returns nil, err. Nil array\n// items are stay nil. Int64s returns an error if an array item is not a\n// bulk string or nil.\nfunc Int64s(reply interface{}, err error) ([]int64, error) {\n\tvar result []int64\n\terr = sliceHelper(reply, err, \"Int64s\", func(n int) { result = make([]int64, n) }, func(i int, v interface{}) error {\n\t\tswitch v := v.(type) {\n\t\tcase int64:\n\t\t\tresult[i] = v\n\t\t\treturn nil\n\t\tcase []byte:\n\t\t\tn, err := strconv.ParseInt(string(v), 10, 64)\n\t\t\tresult[i] = n\n\t\t\treturn err\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"redigo: unexpected element type for Int64s, got type %T\", v)\n\t\t}\n\t})\n\treturn result, err\n}\n\n// Ints is a helper that converts an array command reply to a []in.\n// If err is not equal to nil, then Ints returns nil, err. Nil array\n// items are stay nil. Ints returns an error if an array item is not a\n// bulk string or nil.\nfunc Ints(reply interface{}, err error) ([]int, error) {\n\tvar result []int\n\terr = sliceHelper(reply, err, \"Ints\", func(n int) { result = make([]int, n) }, func(i int, v interface{}) error {\n\t\tswitch v := v.(type) {\n\t\tcase int64:\n\t\t\tn := int(v)\n\t\t\tif int64(n) != v {\n\t\t\t\treturn strconv.ErrRange\n\t\t\t}\n\t\t\tresult[i] = n\n\t\t\treturn nil\n\t\tcase []byte:\n\t\t\tn, err := strconv.Atoi(string(v))\n\t\t\tresult[i] = n\n\t\t\treturn err\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"redigo: unexpected element type for Ints, got type %T\", v)\n\t\t}\n\t})\n\treturn result, err\n}\n\n// StringMap is a helper that converts an array of strings (alternating key, value)\n// into a map[string]string. The HGETALL and CONFIG GET commands return replies in this format.\n// Requires an even number of values in result.\nfunc StringMap(result interface{}, err error) (map[string]string, error) {\n\tvalues, err := Values(result, err)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(values)%2 != 0 {\n\t\treturn nil, errors.New(\"redigo: StringMap expects even number of values result\")\n\t}\n\tm := make(map[string]string, len(values)/2)\n\tfor i := 0; i < len(values); i += 2 {\n\t\tkey, okKey := values[i].([]byte)\n\t\tvalue, okValue := values[i+1].([]byte)\n\t\tif !okKey || !okValue {\n\t\t\treturn nil, errors.New(\"redigo: StringMap key not a bulk string value\")\n\t\t}\n\t\tm[string(key)] = string(value)\n\t}\n\treturn m, nil\n}\n\n// IntMap is a helper that converts an array of strings (alternating key, value)\n// into a map[string]int. The HGETALL commands return replies in this format.\n// Requires an even number of values in result.\nfunc IntMap(result interface{}, err error) (map[string]int, error) {\n\tvalues, err := Values(result, err)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(values)%2 != 0 {\n\t\treturn nil, errors.New(\"redigo: IntMap expects even number of values result\")\n\t}\n\tm := make(map[string]int, len(values)/2)\n\tfor i := 0; i < len(values); i += 2 {\n\t\tkey, ok := values[i].([]byte)\n\t\tif !ok {\n\t\t\treturn nil, errors.New(\"redigo: IntMap key not a bulk string value\")\n\t\t}\n\t\tvalue, err := Int(values[i+1], nil)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tm[string(key)] = value\n\t}\n\treturn m, nil\n}\n\n// Int64Map is a helper that converts an array of strings (alternating key, value)\n// into a map[string]int64. The HGETALL commands return replies in this format.\n// Requires an even number of values in result.\nfunc Int64Map(result interface{}, err error) (map[string]int64, error) {\n\tvalues, err := Values(result, err)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(values)%2 != 0 {\n\t\treturn nil, errors.New(\"redigo: Int64Map expects even number of values result\")\n\t}\n\tm := make(map[string]int64, len(values)/2)\n\tfor i := 0; i < len(values); i += 2 {\n\t\tkey, ok := values[i].([]byte)\n\t\tif !ok {\n\t\t\treturn nil, errors.New(\"redigo: Int64Map key not a bulk string value\")\n\t\t}\n\t\tvalue, err := Int64(values[i+1], nil)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tm[string(key)] = value\n\t}\n\treturn m, nil\n}\n\n// Positions is a helper that converts an array of positions (lat, long)\n// into a [][2]float64. The GEOPOS command returns replies in this format.\nfunc Positions(result interface{}, err error) ([]*[2]float64, error) {\n\tvalues, err := Values(result, err)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tpositions := make([]*[2]float64, len(values))\n\tfor i := range values {\n\t\tif values[i] == nil {\n\t\t\tcontinue\n\t\t}\n\t\tp, ok := values[i].([]interface{})\n\t\tif !ok {\n\t\t\treturn nil, fmt.Errorf(\"redigo: unexpected element type for interface slice, got type %T\", values[i])\n\t\t}\n\t\tif len(p) != 2 {\n\t\t\treturn nil, fmt.Errorf(\"redigo: unexpected number of values for a member position, got %d\", len(p))\n\t\t}\n\t\tlat, err := Float64(p[0], nil)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tlong, err := Float64(p[1], nil)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tpositions[i] = &[2]float64{lat, long}\n\t}\n\treturn positions, nil\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/scan.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n)\n\nfunc ensureLen(d reflect.Value, n int) {\n\tif n > d.Cap() {\n\t\td.Set(reflect.MakeSlice(d.Type(), n, n))\n\t} else {\n\t\td.SetLen(n)\n\t}\n}\n\nfunc cannotConvert(d reflect.Value, s interface{}) error {\n\tvar sname string\n\tswitch s.(type) {\n\tcase string:\n\t\tsname = \"Redis simple string\"\n\tcase Error:\n\t\tsname = \"Redis error\"\n\tcase int64:\n\t\tsname = \"Redis integer\"\n\tcase []byte:\n\t\tsname = \"Redis bulk string\"\n\tcase []interface{}:\n\t\tsname = \"Redis array\"\n\tdefault:\n\t\tsname = reflect.TypeOf(s).String()\n\t}\n\treturn fmt.Errorf(\"cannot convert from %s to %s\", sname, d.Type())\n}\n\nfunc convertAssignBulkString(d reflect.Value, s []byte) (err error) {\n\tswitch d.Type().Kind() {\n\tcase reflect.Float32, reflect.Float64:\n\t\tvar x float64\n\t\tx, err = strconv.ParseFloat(string(s), d.Type().Bits())\n\t\td.SetFloat(x)\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tvar x int64\n\t\tx, err = strconv.ParseInt(string(s), 10, d.Type().Bits())\n\t\td.SetInt(x)\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\tvar x uint64\n\t\tx, err = strconv.ParseUint(string(s), 10, d.Type().Bits())\n\t\td.SetUint(x)\n\tcase reflect.Bool:\n\t\tvar x bool\n\t\tx, err = strconv.ParseBool(string(s))\n\t\td.SetBool(x)\n\tcase reflect.String:\n\t\td.SetString(string(s))\n\tcase reflect.Slice:\n\t\tif d.Type().Elem().Kind() != reflect.Uint8 {\n\t\t\terr = cannotConvert(d, s)\n\t\t} else {\n\t\t\td.SetBytes(s)\n\t\t}\n\tdefault:\n\t\terr = cannotConvert(d, s)\n\t}\n\treturn\n}\n\nfunc convertAssignInt(d reflect.Value, s int64) (err error) {\n\tswitch d.Type().Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\td.SetInt(s)\n\t\tif d.Int() != s {\n\t\t\terr = strconv.ErrRange\n\t\t\td.SetInt(0)\n\t\t}\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\tif s < 0 {\n\t\t\terr = strconv.ErrRange\n\t\t} else {\n\t\t\tx := uint64(s)\n\t\t\td.SetUint(x)\n\t\t\tif d.Uint() != x {\n\t\t\t\terr = strconv.ErrRange\n\t\t\t\td.SetUint(0)\n\t\t\t}\n\t\t}\n\tcase reflect.Bool:\n\t\td.SetBool(s != 0)\n\tdefault:\n\t\terr = cannotConvert(d, s)\n\t}\n\treturn\n}\n\nfunc convertAssignValue(d reflect.Value, s interface{}) (err error) {\n\tif d.Kind() != reflect.Ptr {\n\t\tif d.CanAddr() {\n\t\t\td2 := d.Addr()\n\t\t\tif d2.CanInterface() {\n\t\t\t\tif scanner, ok := d2.Interface().(Scanner); ok {\n\t\t\t\t\treturn scanner.RedisScan(s)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else if d.CanInterface() {\n\t\t// Already a reflect.Ptr\n\t\tif d.IsNil() {\n\t\t\td.Set(reflect.New(d.Type().Elem()))\n\t\t}\n\t\tif scanner, ok := d.Interface().(Scanner); ok {\n\t\t\treturn scanner.RedisScan(s)\n\t\t}\n\t}\n\n\tswitch s := s.(type) {\n\tcase []byte:\n\t\terr = convertAssignBulkString(d, s)\n\tcase int64:\n\t\terr = convertAssignInt(d, s)\n\tdefault:\n\t\terr = cannotConvert(d, s)\n\t}\n\treturn err\n}\n\nfunc convertAssignArray(d reflect.Value, s []interface{}) error {\n\tif d.Type().Kind() != reflect.Slice {\n\t\treturn cannotConvert(d, s)\n\t}\n\tensureLen(d, len(s))\n\tfor i := 0; i < len(s); i++ {\n\t\tif err := convertAssignValue(d.Index(i), s[i]); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc convertAssign(d interface{}, s interface{}) (err error) {\n\tif scanner, ok := d.(Scanner); ok {\n\t\treturn scanner.RedisScan(s)\n\t}\n\n\t// Handle the most common destination types using type switches and\n\t// fall back to reflection for all other types.\n\tswitch s := s.(type) {\n\tcase nil:\n\t\t// ignore\n\tcase []byte:\n\t\tswitch d := d.(type) {\n\t\tcase *string:\n\t\t\t*d = string(s)\n\t\tcase *int:\n\t\t\t*d, err = strconv.Atoi(string(s))\n\t\tcase *bool:\n\t\t\t*d, err = strconv.ParseBool(string(s))\n\t\tcase *[]byte:\n\t\t\t*d = s\n\t\tcase *interface{}:\n\t\t\t*d = s\n\t\tcase nil:\n\t\t\t// skip value\n\t\tdefault:\n\t\t\tif d := reflect.ValueOf(d); d.Type().Kind() != reflect.Ptr {\n\t\t\t\terr = cannotConvert(d, s)\n\t\t\t} else {\n\t\t\t\terr = convertAssignBulkString(d.Elem(), s)\n\t\t\t}\n\t\t}\n\tcase int64:\n\t\tswitch d := d.(type) {\n\t\tcase *int:\n\t\t\tx := int(s)\n\t\t\tif int64(x) != s {\n\t\t\t\terr = strconv.ErrRange\n\t\t\t\tx = 0\n\t\t\t}\n\t\t\t*d = x\n\t\tcase *bool:\n\t\t\t*d = s != 0\n\t\tcase *interface{}:\n\t\t\t*d = s\n\t\tcase nil:\n\t\t\t// skip value\n\t\tdefault:\n\t\t\tif d := reflect.ValueOf(d); d.Type().Kind() != reflect.Ptr {\n\t\t\t\terr = cannotConvert(d, s)\n\t\t\t} else {\n\t\t\t\terr = convertAssignInt(d.Elem(), s)\n\t\t\t}\n\t\t}\n\tcase string:\n\t\tswitch d := d.(type) {\n\t\tcase *string:\n\t\t\t*d = s\n\t\tcase *interface{}:\n\t\t\t*d = s\n\t\tcase nil:\n\t\t\t// skip value\n\t\tdefault:\n\t\t\terr = cannotConvert(reflect.ValueOf(d), s)\n\t\t}\n\tcase []interface{}:\n\t\tswitch d := d.(type) {\n\t\tcase *[]interface{}:\n\t\t\t*d = s\n\t\tcase *interface{}:\n\t\t\t*d = s\n\t\tcase nil:\n\t\t\t// skip value\n\t\tdefault:\n\t\t\tif d := reflect.ValueOf(d); d.Type().Kind() != reflect.Ptr {\n\t\t\t\terr = cannotConvert(d, s)\n\t\t\t} else {\n\t\t\t\terr = convertAssignArray(d.Elem(), s)\n\t\t\t}\n\t\t}\n\tcase Error:\n\t\terr = s\n\tdefault:\n\t\terr = cannotConvert(reflect.ValueOf(d), s)\n\t}\n\treturn\n}\n\n// Scan copies from src to the values pointed at by dest.\n//\n// Scan uses RedisScan if available otherwise:\n//\n// The values pointed at by dest must be an integer, float, boolean, string,\n// []byte, interface{} or slices of these types. Scan uses the standard strconv\n// package to convert bulk strings to numeric and boolean types.\n//\n// If a dest value is nil, then the corresponding src value is skipped.\n//\n// If a src element is nil, then the corresponding dest value is not modified.\n//\n// To enable easy use of Scan in a loop, Scan returns the slice of src\n// following the copied values.\nfunc Scan(src []interface{}, dest ...interface{}) ([]interface{}, error) {\n\tif len(src) < len(dest) {\n\t\treturn nil, errors.New(\"redigo.Scan: array short\")\n\t}\n\tvar err error\n\tfor i, d := range dest {\n\t\terr = convertAssign(d, src[i])\n\t\tif err != nil {\n\t\t\terr = fmt.Errorf(\"redigo.Scan: cannot assign to dest %d: %v\", i, err)\n\t\t\tbreak\n\t\t}\n\t}\n\treturn src[len(dest):], err\n}\n\ntype fieldSpec struct {\n\tname string\n\tindex []int\n\tomitEmpty bool\n}\n\ntype structSpec struct {\n\tm map[string]*fieldSpec\n\tl []*fieldSpec\n}\n\nfunc (ss *structSpec) fieldSpec(name []byte) *fieldSpec {\n\treturn ss.m[string(name)]\n}\n\nfunc compileStructSpec(t reflect.Type, depth map[string]int, index []int, ss *structSpec) {\n\tfor i := 0; i < t.NumField(); i++ {\n\t\tf := t.Field(i)\n\t\tswitch {\n\t\tcase f.PkgPath != \"\" && !f.Anonymous:\n\t\t\t// Ignore unexported fields.\n\t\tcase f.Anonymous:\n\t\t\t// TODO: Handle pointers. Requires change to decoder and\n\t\t\t// protection against infinite recursion.\n\t\t\tif f.Type.Kind() == reflect.Struct {\n\t\t\t\tcompileStructSpec(f.Type, depth, append(index, i), ss)\n\t\t\t}\n\t\tdefault:\n\t\t\tfs := &fieldSpec{name: f.Name}\n\t\t\ttag := f.Tag.Get(\"redis\")\n\t\t\tp := strings.Split(tag, \",\")\n\t\t\tif len(p) > 0 {\n\t\t\t\tif p[0] == \"-\" {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif len(p[0]) > 0 {\n\t\t\t\t\tfs.name = p[0]\n\t\t\t\t}\n\t\t\t\tfor _, s := range p[1:] {\n\t\t\t\t\tswitch s {\n\t\t\t\t\tcase \"omitempty\":\n\t\t\t\t\t\tfs.omitEmpty = true\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tpanic(fmt.Errorf(\"redigo: unknown field tag %s for type %s\", s, t.Name()))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\td, found := depth[fs.name]\n\t\t\tif !found {\n\t\t\t\td = 1 << 30\n\t\t\t}\n\t\t\tswitch {\n\t\t\tcase len(index) == d:\n\t\t\t\t// At same depth, remove from result.\n\t\t\t\tdelete(ss.m, fs.name)\n\t\t\t\tj := 0\n\t\t\t\tfor i := 0; i < len(ss.l); i++ {\n\t\t\t\t\tif fs.name != ss.l[i].name {\n\t\t\t\t\t\tss.l[j] = ss.l[i]\n\t\t\t\t\t\tj += 1\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tss.l = ss.l[:j]\n\t\t\tcase len(index) < d:\n\t\t\t\tfs.index = make([]int, len(index)+1)\n\t\t\t\tcopy(fs.index, index)\n\t\t\t\tfs.index[len(index)] = i\n\t\t\t\tdepth[fs.name] = len(index)\n\t\t\t\tss.m[fs.name] = fs\n\t\t\t\tss.l = append(ss.l, fs)\n\t\t\t}\n\t\t}\n\t}\n}\n\nvar (\n\tstructSpecMutex sync.RWMutex\n\tstructSpecCache = make(map[reflect.Type]*structSpec)\n\tdefaultFieldSpec = &fieldSpec{}\n)\n\nfunc structSpecForType(t reflect.Type) *structSpec {\n\n\tstructSpecMutex.RLock()\n\tss, found := structSpecCache[t]\n\tstructSpecMutex.RUnlock()\n\tif found {\n\t\treturn ss\n\t}\n\n\tstructSpecMutex.Lock()\n\tdefer structSpecMutex.Unlock()\n\tss, found = structSpecCache[t]\n\tif found {\n\t\treturn ss\n\t}\n\n\tss = &structSpec{m: make(map[string]*fieldSpec)}\n\tcompileStructSpec(t, make(map[string]int), nil, ss)\n\tstructSpecCache[t] = ss\n\treturn ss\n}\n\nvar errScanStructValue = errors.New(\"redigo.ScanStruct: value must be non-nil pointer to a struct\")\n\n// ScanStruct scans alternating names and values from src to a struct. The\n// HGETALL and CONFIG GET commands return replies in this format.\n//\n// ScanStruct uses exported field names to match values in the response. Use\n// 'redis' field tag to override the name:\n//\n// Field int `redis:\"myName\"`\n//\n// Fields with the tag redis:\"-\" are ignored.\n//\n// Each field uses RedisScan if available otherwise:\n// Integer, float, boolean, string and []byte fields are supported. Scan uses the\n// standard strconv package to convert bulk string values to numeric and\n// boolean types.\n//\n// If a src element is nil, then the corresponding field is not modified.\nfunc ScanStruct(src []interface{}, dest interface{}) error {\n\td := reflect.ValueOf(dest)\n\tif d.Kind() != reflect.Ptr || d.IsNil() {\n\t\treturn errScanStructValue\n\t}\n\td = d.Elem()\n\tif d.Kind() != reflect.Struct {\n\t\treturn errScanStructValue\n\t}\n\tss := structSpecForType(d.Type())\n\n\tif len(src)%2 != 0 {\n\t\treturn errors.New(\"redigo.ScanStruct: number of values not a multiple of 2\")\n\t}\n\n\tfor i := 0; i < len(src); i += 2 {\n\t\ts := src[i+1]\n\t\tif s == nil {\n\t\t\tcontinue\n\t\t}\n\t\tname, ok := src[i].([]byte)\n\t\tif !ok {\n\t\t\treturn fmt.Errorf(\"redigo.ScanStruct: key %d not a bulk string value\", i)\n\t\t}\n\t\tfs := ss.fieldSpec(name)\n\t\tif fs == nil {\n\t\t\tcontinue\n\t\t}\n\t\tif err := convertAssignValue(d.FieldByIndex(fs.index), s); err != nil {\n\t\t\treturn fmt.Errorf(\"redigo.ScanStruct: cannot assign field %s: %v\", fs.name, err)\n\t\t}\n\t}\n\treturn nil\n}\n\nvar (\n\terrScanSliceValue = errors.New(\"redigo.ScanSlice: dest must be non-nil pointer to a struct\")\n)\n\n// ScanSlice scans src to the slice pointed to by dest. The elements the dest\n// slice must be integer, float, boolean, string, struct or pointer to struct\n// values.\n//\n// Struct fields must be integer, float, boolean or string values. All struct\n// fields are used unless a subset is specified using fieldNames.\nfunc ScanSlice(src []interface{}, dest interface{}, fieldNames ...string) error {\n\td := reflect.ValueOf(dest)\n\tif d.Kind() != reflect.Ptr || d.IsNil() {\n\t\treturn errScanSliceValue\n\t}\n\td = d.Elem()\n\tif d.Kind() != reflect.Slice {\n\t\treturn errScanSliceValue\n\t}\n\n\tisPtr := false\n\tt := d.Type().Elem()\n\tif t.Kind() == reflect.Ptr && t.Elem().Kind() == reflect.Struct {\n\t\tisPtr = true\n\t\tt = t.Elem()\n\t}\n\n\tif t.Kind() != reflect.Struct {\n\t\tensureLen(d, len(src))\n\t\tfor i, s := range src {\n\t\t\tif s == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err := convertAssignValue(d.Index(i), s); err != nil {\n\t\t\t\treturn fmt.Errorf(\"redigo.ScanSlice: cannot assign element %d: %v\", i, err)\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t}\n\n\tss := structSpecForType(t)\n\tfss := ss.l\n\tif len(fieldNames) > 0 {\n\t\tfss = make([]*fieldSpec, len(fieldNames))\n\t\tfor i, name := range fieldNames {\n\t\t\tfss[i] = ss.m[name]\n\t\t\tif fss[i] == nil {\n\t\t\t\treturn fmt.Errorf(\"redigo.ScanSlice: ScanSlice bad field name %s\", name)\n\t\t\t}\n\t\t}\n\t}\n\n\tif len(fss) == 0 {\n\t\treturn errors.New(\"redigo.ScanSlice: no struct fields\")\n\t}\n\n\tn := len(src) / len(fss)\n\tif n*len(fss) != len(src) {\n\t\treturn errors.New(\"redigo.ScanSlice: length not a multiple of struct field count\")\n\t}\n\n\tensureLen(d, n)\n\tfor i := 0; i < n; i++ {\n\t\td := d.Index(i)\n\t\tif isPtr {\n\t\t\tif d.IsNil() {\n\t\t\t\td.Set(reflect.New(t))\n\t\t\t}\n\t\t\td = d.Elem()\n\t\t}\n\t\tfor j, fs := range fss {\n\t\t\ts := src[i*len(fss)+j]\n\t\t\tif s == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err := convertAssignValue(d.FieldByIndex(fs.index), s); err != nil {\n\t\t\t\treturn fmt.Errorf(\"redigo.ScanSlice: cannot assign element %d to field %s: %v\", i*len(fss)+j, fs.name, err)\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// Args is a helper for constructing command arguments from structured values.\ntype Args []interface{}\n\n// Add returns the result of appending value to args.\nfunc (args Args) Add(value ...interface{}) Args {\n\treturn append(args, value...)\n}\n\n// AddFlat returns the result of appending the flattened value of v to args.\n//\n// Maps are flattened by appending the alternating keys and map values to args.\n//\n// Slices are flattened by appending the slice elements to args.\n//\n// Structs are flattened by appending the alternating names and values of\n// exported fields to args. If v is a nil struct pointer, then nothing is\n// appended. The 'redis' field tag overrides struct field names. See ScanStruct\n// for more information on the use of the 'redis' field tag.\n//\n// Other types are appended to args as is.\nfunc (args Args) AddFlat(v interface{}) Args {\n\trv := reflect.ValueOf(v)\n\tswitch rv.Kind() {\n\tcase reflect.Struct:\n\t\targs = flattenStruct(args, rv)\n\tcase reflect.Slice:\n\t\tfor i := 0; i < rv.Len(); i++ {\n\t\t\targs = append(args, rv.Index(i).Interface())\n\t\t}\n\tcase reflect.Map:\n\t\tfor _, k := range rv.MapKeys() {\n\t\t\targs = append(args, k.Interface(), rv.MapIndex(k).Interface())\n\t\t}\n\tcase reflect.Ptr:\n\t\tif rv.Type().Elem().Kind() == reflect.Struct {\n\t\t\tif !rv.IsNil() {\n\t\t\t\targs = flattenStruct(args, rv.Elem())\n\t\t\t}\n\t\t} else {\n\t\t\targs = append(args, v)\n\t\t}\n\tdefault:\n\t\targs = append(args, v)\n\t}\n\treturn args\n}\n\nfunc flattenStruct(args Args, v reflect.Value) Args {\n\tss := structSpecForType(v.Type())\n\tfor _, fs := range ss.l {\n\t\tfv := v.FieldByIndex(fs.index)\n\t\tif fs.omitEmpty {\n\t\t\tvar empty = false\n\t\t\tswitch fv.Kind() {\n\t\t\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\t\t\tempty = fv.Len() == 0\n\t\t\tcase reflect.Bool:\n\t\t\t\tempty = !fv.Bool()\n\t\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\t\t\tempty = fv.Int() == 0\n\t\t\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\t\t\tempty = fv.Uint() == 0\n\t\t\tcase reflect.Float32, reflect.Float64:\n\t\t\t\tempty = fv.Float() == 0\n\t\t\tcase reflect.Interface, reflect.Ptr:\n\t\t\t\tempty = fv.IsNil()\n\t\t\t}\n\t\t\tif empty {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\targs = append(args, fs.name, fv.Interface())\n\t}\n\treturn args\n}\n" }, { "path": "vendor/github.com/gomodule/redigo/redis/script.go", "content": "// Copyright 2012 Gary Burd\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"): you may\n// not use this file except in compliance with the License. You may obtain\n// a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n// License for the specific language governing permissions and limitations\n// under the License.\n\npackage redis\n\nimport (\n\t\"crypto/sha1\"\n\t\"encoding/hex\"\n\t\"io\"\n\t\"strings\"\n)\n\n// Script encapsulates the source, hash and key count for a Lua script. See\n// http://redis.io/commands/eval for information on scripts in Redis.\ntype Script struct {\n\tkeyCount int\n\tsrc string\n\thash string\n}\n\n// NewScript returns a new script object. If keyCount is greater than or equal\n// to zero, then the count is automatically inserted in the EVAL command\n// argument list. If keyCount is less than zero, then the application supplies\n// the count as the first value in the keysAndArgs argument to the Do, Send and\n// SendHash methods.\nfunc NewScript(keyCount int, src string) *Script {\n\th := sha1.New()\n\tio.WriteString(h, src)\n\treturn &Script{keyCount, src, hex.EncodeToString(h.Sum(nil))}\n}\n\nfunc (s *Script) args(spec string, keysAndArgs []interface{}) []interface{} {\n\tvar args []interface{}\n\tif s.keyCount < 0 {\n\t\targs = make([]interface{}, 1+len(keysAndArgs))\n\t\targs[0] = spec\n\t\tcopy(args[1:], keysAndArgs)\n\t} else {\n\t\targs = make([]interface{}, 2+len(keysAndArgs))\n\t\targs[0] = spec\n\t\targs[1] = s.keyCount\n\t\tcopy(args[2:], keysAndArgs)\n\t}\n\treturn args\n}\n\n// Hash returns the script hash.\nfunc (s *Script) Hash() string {\n\treturn s.hash\n}\n\n// Do evaluates the script. Under the covers, Do optimistically evaluates the\n// script using the EVALSHA command. If the command fails because the script is\n// not loaded, then Do evaluates the script using the EVAL command (thus\n// causing the script to load).\nfunc (s *Script) Do(c Conn, keysAndArgs ...interface{}) (interface{}, error) {\n\tv, err := c.Do(\"EVALSHA\", s.args(s.hash, keysAndArgs)...)\n\tif e, ok := err.(Error); ok && strings.HasPrefix(string(e), \"NOSCRIPT \") {\n\t\tv, err = c.Do(\"EVAL\", s.args(s.src, keysAndArgs)...)\n\t}\n\treturn v, err\n}\n\n// SendHash evaluates the script without waiting for the reply. The script is\n// evaluated with the EVALSHA command. The application must ensure that the\n// script is loaded by a previous call to Send, Do or Load methods.\nfunc (s *Script) SendHash(c Conn, keysAndArgs ...interface{}) error {\n\treturn c.Send(\"EVALSHA\", s.args(s.hash, keysAndArgs)...)\n}\n\n// Send evaluates the script without waiting for the reply.\nfunc (s *Script) Send(c Conn, keysAndArgs ...interface{}) error {\n\treturn c.Send(\"EVAL\", s.args(s.src, keysAndArgs)...)\n}\n\n// Load loads the script without evaluating it.\nfunc (s *Script) Load(c Conn) error {\n\t_, err := c.Do(\"SCRIPT\", \"LOAD\", s.src)\n\treturn err\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/.codeclimate.yml", "content": "---\nengines:\n gofmt:\n enabled: true\n govet:\n enabled: true\n golint:\n enabled: true\nratings:\n paths:\n - \"**.go\"\n" }, { "path": "vendor/github.com/jinzhu/gorm/.gitignore", "content": "documents\n_book\n" }, { "path": "vendor/github.com/jinzhu/gorm/License", "content": "The MIT License (MIT)\n\nCopyright (c) 2013-NOW Jinzhu \n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n" }, { "path": "vendor/github.com/jinzhu/gorm/README.md", "content": "# GORM\n\nThe fantastic ORM library for Golang, aims to be developer friendly.\n\n[![go report card](https://goreportcard.com/badge/github.com/jinzhu/gorm \"go report card\")](https://goreportcard.com/report/github.com/jinzhu/gorm)\n[![wercker status](https://app.wercker.com/status/8596cace912c9947dd9c8542ecc8cb8b/s/master \"wercker status\")](https://app.wercker.com/project/byKey/8596cace912c9947dd9c8542ecc8cb8b)\n[![Join the chat at https://gitter.im/jinzhu/gorm](https://img.shields.io/gitter/room/jinzhu/gorm.svg)](https://gitter.im/jinzhu/gorm?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n[![Open Collective Backer](https://opencollective.com/gorm/tiers/backer/badge.svg?label=backer&color=brightgreen \"Open Collective Backer\")](https://opencollective.com/gorm)\n[![Open Collective Sponsor](https://opencollective.com/gorm/tiers/sponsor/badge.svg?label=sponsor&color=brightgreen \"Open Collective Sponsor\")](https://opencollective.com/gorm)\n[![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT)\n[![GoDoc](https://godoc.org/github.com/jinzhu/gorm?status.svg)](https://godoc.org/github.com/jinzhu/gorm)\n\n## Overview\n\n* Full-Featured ORM (almost)\n* Associations (Has One, Has Many, Belongs To, Many To Many, Polymorphism)\n* Callbacks (Before/After Create/Save/Update/Delete/Find)\n* Preloading (eager loading)\n* Transactions\n* Composite Primary Key\n* SQL Builder\n* Auto Migrations\n* Logger\n* Extendable, write Plugins based on GORM callbacks\n* Every feature comes with tests\n* Developer Friendly\n\n## Getting Started\n\n* GORM Guides [http://gorm.io](http://gorm.io)\n\n## Contributing\n\n[Become a backer or sponsor on Open Collective](http://opencollective.com/gorm)\n\n[Become a backer or sponsor on Patreon](http://patreon.com/jinzhu)\n\n## License\n\n© Jinzhu, 2013~time.Now\n\nReleased under the [MIT License](https://github.com/jinzhu/gorm/blob/master/License)\n" }, { "path": "vendor/github.com/jinzhu/gorm/association.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n)\n\n// Association Mode contains some helper methods to handle relationship things easily.\ntype Association struct {\n\tError error\n\tscope *Scope\n\tcolumn string\n\tfield *Field\n}\n\n// Find find out all related associations\nfunc (association *Association) Find(value interface{}) *Association {\n\tassociation.scope.related(value, association.column)\n\treturn association.setErr(association.scope.db.Error)\n}\n\n// Append append new associations for many2many, has_many, replace current association for has_one, belongs_to\nfunc (association *Association) Append(values ...interface{}) *Association {\n\tif association.Error != nil {\n\t\treturn association\n\t}\n\n\tif relationship := association.field.Relationship; relationship.Kind == \"has_one\" {\n\t\treturn association.Replace(values...)\n\t}\n\treturn association.saveAssociations(values...)\n}\n\n// Replace replace current associations with new one\nfunc (association *Association) Replace(values ...interface{}) *Association {\n\tif association.Error != nil {\n\t\treturn association\n\t}\n\n\tvar (\n\t\trelationship = association.field.Relationship\n\t\tscope = association.scope\n\t\tfield = association.field.Field\n\t\tnewDB = scope.NewDB()\n\t)\n\n\t// Append new values\n\tassociation.field.Set(reflect.Zero(association.field.Field.Type()))\n\tassociation.saveAssociations(values...)\n\n\t// Belongs To\n\tif relationship.Kind == \"belongs_to\" {\n\t\t// Set foreign key to be null when clearing value (length equals 0)\n\t\tif len(values) == 0 {\n\t\t\t// Set foreign key to be nil\n\t\t\tvar foreignKeyMap = map[string]interface{}{}\n\t\t\tfor _, foreignKey := range relationship.ForeignDBNames {\n\t\t\t\tforeignKeyMap[foreignKey] = nil\n\t\t\t}\n\t\t\tassociation.setErr(newDB.Model(scope.Value).UpdateColumn(foreignKeyMap).Error)\n\t\t}\n\t} else {\n\t\t// Polymorphic Relations\n\t\tif relationship.PolymorphicDBName != \"\" {\n\t\t\tnewDB = newDB.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(relationship.PolymorphicDBName)), relationship.PolymorphicValue)\n\t\t}\n\n\t\t// Delete Relations except new created\n\t\tif len(values) > 0 {\n\t\t\tvar associationForeignFieldNames, associationForeignDBNames []string\n\t\t\tif relationship.Kind == \"many_to_many\" {\n\t\t\t\t// if many to many relations, get association fields name from association foreign keys\n\t\t\t\tassociationScope := scope.New(reflect.New(field.Type()).Interface())\n\t\t\t\tfor idx, dbName := range relationship.AssociationForeignFieldNames {\n\t\t\t\t\tif field, ok := associationScope.FieldByName(dbName); ok {\n\t\t\t\t\t\tassociationForeignFieldNames = append(associationForeignFieldNames, field.Name)\n\t\t\t\t\t\tassociationForeignDBNames = append(associationForeignDBNames, relationship.AssociationForeignDBNames[idx])\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// If has one/many relations, use primary keys\n\t\t\t\tfor _, field := range scope.New(reflect.New(field.Type()).Interface()).PrimaryFields() {\n\t\t\t\t\tassociationForeignFieldNames = append(associationForeignFieldNames, field.Name)\n\t\t\t\t\tassociationForeignDBNames = append(associationForeignDBNames, field.DBName)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tnewPrimaryKeys := scope.getColumnAsArray(associationForeignFieldNames, field.Interface())\n\n\t\t\tif len(newPrimaryKeys) > 0 {\n\t\t\t\tsql := fmt.Sprintf(\"%v NOT IN (%v)\", toQueryCondition(scope, associationForeignDBNames), toQueryMarks(newPrimaryKeys))\n\t\t\t\tnewDB = newDB.Where(sql, toQueryValues(newPrimaryKeys)...)\n\t\t\t}\n\t\t}\n\n\t\tif relationship.Kind == \"many_to_many\" {\n\t\t\t// if many to many relations, delete related relations from join table\n\t\t\tvar sourceForeignFieldNames []string\n\n\t\t\tfor _, dbName := range relationship.ForeignFieldNames {\n\t\t\t\tif field, ok := scope.FieldByName(dbName); ok {\n\t\t\t\t\tsourceForeignFieldNames = append(sourceForeignFieldNames, field.Name)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif sourcePrimaryKeys := scope.getColumnAsArray(sourceForeignFieldNames, scope.Value); len(sourcePrimaryKeys) > 0 {\n\t\t\t\tnewDB = newDB.Where(fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.ForeignDBNames), toQueryMarks(sourcePrimaryKeys)), toQueryValues(sourcePrimaryKeys)...)\n\n\t\t\t\tassociation.setErr(relationship.JoinTableHandler.Delete(relationship.JoinTableHandler, newDB))\n\t\t\t}\n\t\t} else if relationship.Kind == \"has_one\" || relationship.Kind == \"has_many\" {\n\t\t\t// has_one or has_many relations, set foreign key to be nil (TODO or delete them?)\n\t\t\tvar foreignKeyMap = map[string]interface{}{}\n\t\t\tfor idx, foreignKey := range relationship.ForeignDBNames {\n\t\t\t\tforeignKeyMap[foreignKey] = nil\n\t\t\t\tif field, ok := scope.FieldByName(relationship.AssociationForeignFieldNames[idx]); ok {\n\t\t\t\t\tnewDB = newDB.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(foreignKey)), field.Field.Interface())\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfieldValue := reflect.New(association.field.Field.Type()).Interface()\n\t\t\tassociation.setErr(newDB.Model(fieldValue).UpdateColumn(foreignKeyMap).Error)\n\t\t}\n\t}\n\treturn association\n}\n\n// Delete remove relationship between source & passed arguments, but won't delete those arguments\nfunc (association *Association) Delete(values ...interface{}) *Association {\n\tif association.Error != nil {\n\t\treturn association\n\t}\n\n\tvar (\n\t\trelationship = association.field.Relationship\n\t\tscope = association.scope\n\t\tfield = association.field.Field\n\t\tnewDB = scope.NewDB()\n\t)\n\n\tif len(values) == 0 {\n\t\treturn association\n\t}\n\n\tvar deletingResourcePrimaryFieldNames, deletingResourcePrimaryDBNames []string\n\tfor _, field := range scope.New(reflect.New(field.Type()).Interface()).PrimaryFields() {\n\t\tdeletingResourcePrimaryFieldNames = append(deletingResourcePrimaryFieldNames, field.Name)\n\t\tdeletingResourcePrimaryDBNames = append(deletingResourcePrimaryDBNames, field.DBName)\n\t}\n\n\tdeletingPrimaryKeys := scope.getColumnAsArray(deletingResourcePrimaryFieldNames, values...)\n\n\tif relationship.Kind == \"many_to_many\" {\n\t\t// source value's foreign keys\n\t\tfor idx, foreignKey := range relationship.ForeignDBNames {\n\t\t\tif field, ok := scope.FieldByName(relationship.ForeignFieldNames[idx]); ok {\n\t\t\t\tnewDB = newDB.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(foreignKey)), field.Field.Interface())\n\t\t\t}\n\t\t}\n\n\t\t// get association's foreign fields name\n\t\tvar associationScope = scope.New(reflect.New(field.Type()).Interface())\n\t\tvar associationForeignFieldNames []string\n\t\tfor _, associationDBName := range relationship.AssociationForeignFieldNames {\n\t\t\tif field, ok := associationScope.FieldByName(associationDBName); ok {\n\t\t\t\tassociationForeignFieldNames = append(associationForeignFieldNames, field.Name)\n\t\t\t}\n\t\t}\n\n\t\t// association value's foreign keys\n\t\tdeletingPrimaryKeys := scope.getColumnAsArray(associationForeignFieldNames, values...)\n\t\tsql := fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.AssociationForeignDBNames), toQueryMarks(deletingPrimaryKeys))\n\t\tnewDB = newDB.Where(sql, toQueryValues(deletingPrimaryKeys)...)\n\n\t\tassociation.setErr(relationship.JoinTableHandler.Delete(relationship.JoinTableHandler, newDB))\n\t} else {\n\t\tvar foreignKeyMap = map[string]interface{}{}\n\t\tfor _, foreignKey := range relationship.ForeignDBNames {\n\t\t\tforeignKeyMap[foreignKey] = nil\n\t\t}\n\n\t\tif relationship.Kind == \"belongs_to\" {\n\t\t\t// find with deleting relation's foreign keys\n\t\t\tprimaryKeys := scope.getColumnAsArray(relationship.AssociationForeignFieldNames, values...)\n\t\t\tnewDB = newDB.Where(\n\t\t\t\tfmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.ForeignDBNames), toQueryMarks(primaryKeys)),\n\t\t\t\ttoQueryValues(primaryKeys)...,\n\t\t\t)\n\n\t\t\t// set foreign key to be null if there are some records affected\n\t\t\tmodelValue := reflect.New(scope.GetModelStruct().ModelType).Interface()\n\t\t\tif results := newDB.Model(modelValue).UpdateColumn(foreignKeyMap); results.Error == nil {\n\t\t\t\tif results.RowsAffected > 0 {\n\t\t\t\t\tscope.updatedAttrsWithValues(foreignKeyMap)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tassociation.setErr(results.Error)\n\t\t\t}\n\t\t} else if relationship.Kind == \"has_one\" || relationship.Kind == \"has_many\" {\n\t\t\t// find all relations\n\t\t\tprimaryKeys := scope.getColumnAsArray(relationship.AssociationForeignFieldNames, scope.Value)\n\t\t\tnewDB = newDB.Where(\n\t\t\t\tfmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.ForeignDBNames), toQueryMarks(primaryKeys)),\n\t\t\t\ttoQueryValues(primaryKeys)...,\n\t\t\t)\n\n\t\t\t// only include those deleting relations\n\t\t\tnewDB = newDB.Where(\n\t\t\t\tfmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, deletingResourcePrimaryDBNames), toQueryMarks(deletingPrimaryKeys)),\n\t\t\t\ttoQueryValues(deletingPrimaryKeys)...,\n\t\t\t)\n\n\t\t\t// set matched relation's foreign key to be null\n\t\t\tfieldValue := reflect.New(association.field.Field.Type()).Interface()\n\t\t\tassociation.setErr(newDB.Model(fieldValue).UpdateColumn(foreignKeyMap).Error)\n\t\t}\n\t}\n\n\t// Remove deleted records from source's field\n\tif association.Error == nil {\n\t\tif field.Kind() == reflect.Slice {\n\t\t\tleftValues := reflect.Zero(field.Type())\n\n\t\t\tfor i := 0; i < field.Len(); i++ {\n\t\t\t\treflectValue := field.Index(i)\n\t\t\t\tprimaryKey := scope.getColumnAsArray(deletingResourcePrimaryFieldNames, reflectValue.Interface())[0]\n\t\t\t\tvar isDeleted = false\n\t\t\t\tfor _, pk := range deletingPrimaryKeys {\n\t\t\t\t\tif equalAsString(primaryKey, pk) {\n\t\t\t\t\t\tisDeleted = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif !isDeleted {\n\t\t\t\t\tleftValues = reflect.Append(leftValues, reflectValue)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tassociation.field.Set(leftValues)\n\t\t} else if field.Kind() == reflect.Struct {\n\t\t\tprimaryKey := scope.getColumnAsArray(deletingResourcePrimaryFieldNames, field.Interface())[0]\n\t\t\tfor _, pk := range deletingPrimaryKeys {\n\t\t\t\tif equalAsString(primaryKey, pk) {\n\t\t\t\t\tassociation.field.Set(reflect.Zero(field.Type()))\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn association\n}\n\n// Clear remove relationship between source & current associations, won't delete those associations\nfunc (association *Association) Clear() *Association {\n\treturn association.Replace()\n}\n\n// Count return the count of current associations\nfunc (association *Association) Count() int {\n\tvar (\n\t\tcount = 0\n\t\trelationship = association.field.Relationship\n\t\tscope = association.scope\n\t\tfieldValue = association.field.Field.Interface()\n\t\tquery = scope.DB()\n\t)\n\n\tif relationship.Kind == \"many_to_many\" {\n\t\tquery = relationship.JoinTableHandler.JoinWith(relationship.JoinTableHandler, query, scope.Value)\n\t} else if relationship.Kind == \"has_many\" || relationship.Kind == \"has_one\" {\n\t\tprimaryKeys := scope.getColumnAsArray(relationship.AssociationForeignFieldNames, scope.Value)\n\t\tquery = query.Where(\n\t\t\tfmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.ForeignDBNames), toQueryMarks(primaryKeys)),\n\t\t\ttoQueryValues(primaryKeys)...,\n\t\t)\n\t} else if relationship.Kind == \"belongs_to\" {\n\t\tprimaryKeys := scope.getColumnAsArray(relationship.ForeignFieldNames, scope.Value)\n\t\tquery = query.Where(\n\t\t\tfmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relationship.AssociationForeignDBNames), toQueryMarks(primaryKeys)),\n\t\t\ttoQueryValues(primaryKeys)...,\n\t\t)\n\t}\n\n\tif relationship.PolymorphicType != \"\" {\n\t\tquery = query.Where(\n\t\t\tfmt.Sprintf(\"%v.%v = ?\", scope.New(fieldValue).QuotedTableName(), scope.Quote(relationship.PolymorphicDBName)),\n\t\t\trelationship.PolymorphicValue,\n\t\t)\n\t}\n\n\tif err := query.Model(fieldValue).Count(&count).Error; err != nil {\n\t\tassociation.Error = err\n\t}\n\treturn count\n}\n\n// saveAssociations save passed values as associations\nfunc (association *Association) saveAssociations(values ...interface{}) *Association {\n\tvar (\n\t\tscope = association.scope\n\t\tfield = association.field\n\t\trelationship = field.Relationship\n\t)\n\n\tsaveAssociation := func(reflectValue reflect.Value) {\n\t\t// value has to been pointer\n\t\tif reflectValue.Kind() != reflect.Ptr {\n\t\t\treflectPtr := reflect.New(reflectValue.Type())\n\t\t\treflectPtr.Elem().Set(reflectValue)\n\t\t\treflectValue = reflectPtr\n\t\t}\n\n\t\t// value has to been saved for many2many\n\t\tif relationship.Kind == \"many_to_many\" {\n\t\t\tif scope.New(reflectValue.Interface()).PrimaryKeyZero() {\n\t\t\t\tassociation.setErr(scope.NewDB().Save(reflectValue.Interface()).Error)\n\t\t\t}\n\t\t}\n\n\t\t// Assign Fields\n\t\tvar fieldType = field.Field.Type()\n\t\tvar setFieldBackToValue, setSliceFieldBackToValue bool\n\t\tif reflectValue.Type().AssignableTo(fieldType) {\n\t\t\tfield.Set(reflectValue)\n\t\t} else if reflectValue.Type().Elem().AssignableTo(fieldType) {\n\t\t\t// if field's type is struct, then need to set value back to argument after save\n\t\t\tsetFieldBackToValue = true\n\t\t\tfield.Set(reflectValue.Elem())\n\t\t} else if fieldType.Kind() == reflect.Slice {\n\t\t\tif reflectValue.Type().AssignableTo(fieldType.Elem()) {\n\t\t\t\tfield.Set(reflect.Append(field.Field, reflectValue))\n\t\t\t} else if reflectValue.Type().Elem().AssignableTo(fieldType.Elem()) {\n\t\t\t\t// if field's type is slice of struct, then need to set value back to argument after save\n\t\t\t\tsetSliceFieldBackToValue = true\n\t\t\t\tfield.Set(reflect.Append(field.Field, reflectValue.Elem()))\n\t\t\t}\n\t\t}\n\n\t\tif relationship.Kind == \"many_to_many\" {\n\t\t\tassociation.setErr(relationship.JoinTableHandler.Add(relationship.JoinTableHandler, scope.NewDB(), scope.Value, reflectValue.Interface()))\n\t\t} else {\n\t\t\tassociation.setErr(scope.NewDB().Select(field.Name).Save(scope.Value).Error)\n\n\t\t\tif setFieldBackToValue {\n\t\t\t\treflectValue.Elem().Set(field.Field)\n\t\t\t} else if setSliceFieldBackToValue {\n\t\t\t\treflectValue.Elem().Set(field.Field.Index(field.Field.Len() - 1))\n\t\t\t}\n\t\t}\n\t}\n\n\tfor _, value := range values {\n\t\treflectValue := reflect.ValueOf(value)\n\t\tindirectReflectValue := reflect.Indirect(reflectValue)\n\t\tif indirectReflectValue.Kind() == reflect.Struct {\n\t\t\tsaveAssociation(reflectValue)\n\t\t} else if indirectReflectValue.Kind() == reflect.Slice {\n\t\t\tfor i := 0; i < indirectReflectValue.Len(); i++ {\n\t\t\t\tsaveAssociation(indirectReflectValue.Index(i))\n\t\t\t}\n\t\t} else {\n\t\t\tassociation.setErr(errors.New(\"invalid value type\"))\n\t\t}\n\t}\n\treturn association\n}\n\nfunc (association *Association) setErr(err error) *Association {\n\tif err != nil {\n\t\tassociation.Error = err\n\t}\n\treturn association\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback.go", "content": "package gorm\n\nimport \"log\"\n\n// DefaultCallback default callbacks defined by gorm\nvar DefaultCallback = &Callback{}\n\n// Callback is a struct that contains all CRUD callbacks\n// Field `creates` contains callbacks will be call when creating object\n// Field `updates` contains callbacks will be call when updating object\n// Field `deletes` contains callbacks will be call when deleting object\n// Field `queries` contains callbacks will be call when querying object with query methods like Find, First, Related, Association...\n// Field `rowQueries` contains callbacks will be call when querying object with Row, Rows...\n// Field `processors` contains all callback processors, will be used to generate above callbacks in order\ntype Callback struct {\n\tcreates []*func(scope *Scope)\n\tupdates []*func(scope *Scope)\n\tdeletes []*func(scope *Scope)\n\tqueries []*func(scope *Scope)\n\trowQueries []*func(scope *Scope)\n\tprocessors []*CallbackProcessor\n}\n\n// CallbackProcessor contains callback informations\ntype CallbackProcessor struct {\n\tname string // current callback's name\n\tbefore string // register current callback before a callback\n\tafter string // register current callback after a callback\n\treplace bool // replace callbacks with same name\n\tremove bool // delete callbacks with same name\n\tkind string // callback type: create, update, delete, query, row_query\n\tprocessor *func(scope *Scope) // callback handler\n\tparent *Callback\n}\n\nfunc (c *Callback) clone() *Callback {\n\treturn &Callback{\n\t\tcreates: c.creates,\n\t\tupdates: c.updates,\n\t\tdeletes: c.deletes,\n\t\tqueries: c.queries,\n\t\trowQueries: c.rowQueries,\n\t\tprocessors: c.processors,\n\t}\n}\n\n// Create could be used to register callbacks for creating object\n// db.Callback().Create().After(\"gorm:create\").Register(\"plugin:run_after_create\", func(*Scope) {\n// // business logic\n// ...\n//\n// // set error if some thing wrong happened, will rollback the creating\n// scope.Err(errors.New(\"error\"))\n// })\nfunc (c *Callback) Create() *CallbackProcessor {\n\treturn &CallbackProcessor{kind: \"create\", parent: c}\n}\n\n// Update could be used to register callbacks for updating object, refer `Create` for usage\nfunc (c *Callback) Update() *CallbackProcessor {\n\treturn &CallbackProcessor{kind: \"update\", parent: c}\n}\n\n// Delete could be used to register callbacks for deleting object, refer `Create` for usage\nfunc (c *Callback) Delete() *CallbackProcessor {\n\treturn &CallbackProcessor{kind: \"delete\", parent: c}\n}\n\n// Query could be used to register callbacks for querying objects with query methods like `Find`, `First`, `Related`, `Association`...\n// Refer `Create` for usage\nfunc (c *Callback) Query() *CallbackProcessor {\n\treturn &CallbackProcessor{kind: \"query\", parent: c}\n}\n\n// RowQuery could be used to register callbacks for querying objects with `Row`, `Rows`, refer `Create` for usage\nfunc (c *Callback) RowQuery() *CallbackProcessor {\n\treturn &CallbackProcessor{kind: \"row_query\", parent: c}\n}\n\n// After insert a new callback after callback `callbackName`, refer `Callbacks.Create`\nfunc (cp *CallbackProcessor) After(callbackName string) *CallbackProcessor {\n\tcp.after = callbackName\n\treturn cp\n}\n\n// Before insert a new callback before callback `callbackName`, refer `Callbacks.Create`\nfunc (cp *CallbackProcessor) Before(callbackName string) *CallbackProcessor {\n\tcp.before = callbackName\n\treturn cp\n}\n\n// Register a new callback, refer `Callbacks.Create`\nfunc (cp *CallbackProcessor) Register(callbackName string, callback func(scope *Scope)) {\n\tif cp.kind == \"row_query\" {\n\t\tif cp.before == \"\" && cp.after == \"\" && callbackName != \"gorm:row_query\" {\n\t\t\tlog.Printf(\"Registing RowQuery callback %v without specify order with Before(), After(), applying Before('gorm:row_query') by default for compatibility...\\n\", callbackName)\n\t\t\tcp.before = \"gorm:row_query\"\n\t\t}\n\t}\n\n\tcp.name = callbackName\n\tcp.processor = &callback\n\tcp.parent.processors = append(cp.parent.processors, cp)\n\tcp.parent.reorder()\n}\n\n// Remove a registered callback\n// db.Callback().Create().Remove(\"gorm:update_time_stamp_when_create\")\nfunc (cp *CallbackProcessor) Remove(callbackName string) {\n\tlog.Printf(\"[info] removing callback `%v` from %v\\n\", callbackName, fileWithLineNum())\n\tcp.name = callbackName\n\tcp.remove = true\n\tcp.parent.processors = append(cp.parent.processors, cp)\n\tcp.parent.reorder()\n}\n\n// Replace a registered callback with new callback\n// db.Callback().Create().Replace(\"gorm:update_time_stamp_when_create\", func(*Scope) {\n//\t\t scope.SetColumn(\"Created\", now)\n//\t\t scope.SetColumn(\"Updated\", now)\n// })\nfunc (cp *CallbackProcessor) Replace(callbackName string, callback func(scope *Scope)) {\n\tlog.Printf(\"[info] replacing callback `%v` from %v\\n\", callbackName, fileWithLineNum())\n\tcp.name = callbackName\n\tcp.processor = &callback\n\tcp.replace = true\n\tcp.parent.processors = append(cp.parent.processors, cp)\n\tcp.parent.reorder()\n}\n\n// Get registered callback\n// db.Callback().Create().Get(\"gorm:create\")\nfunc (cp *CallbackProcessor) Get(callbackName string) (callback func(scope *Scope)) {\n\tfor _, p := range cp.parent.processors {\n\t\tif p.name == callbackName && p.kind == cp.kind && !cp.remove {\n\t\t\treturn *p.processor\n\t\t}\n\t}\n\treturn nil\n}\n\n// getRIndex get right index from string slice\nfunc getRIndex(strs []string, str string) int {\n\tfor i := len(strs) - 1; i >= 0; i-- {\n\t\tif strs[i] == str {\n\t\t\treturn i\n\t\t}\n\t}\n\treturn -1\n}\n\n// sortProcessors sort callback processors based on its before, after, remove, replace\nfunc sortProcessors(cps []*CallbackProcessor) []*func(scope *Scope) {\n\tvar (\n\t\tallNames, sortedNames []string\n\t\tsortCallbackProcessor func(c *CallbackProcessor)\n\t)\n\n\tfor _, cp := range cps {\n\t\t// show warning message the callback name already exists\n\t\tif index := getRIndex(allNames, cp.name); index > -1 && !cp.replace && !cp.remove {\n\t\t\tlog.Printf(\"[warning] duplicated callback `%v` from %v\\n\", cp.name, fileWithLineNum())\n\t\t}\n\t\tallNames = append(allNames, cp.name)\n\t}\n\n\tsortCallbackProcessor = func(c *CallbackProcessor) {\n\t\tif getRIndex(sortedNames, c.name) == -1 { // if not sorted\n\t\t\tif c.before != \"\" { // if defined before callback\n\t\t\t\tif index := getRIndex(sortedNames, c.before); index != -1 {\n\t\t\t\t\t// if before callback already sorted, append current callback just after it\n\t\t\t\t\tsortedNames = append(sortedNames[:index], append([]string{c.name}, sortedNames[index:]...)...)\n\t\t\t\t} else if index := getRIndex(allNames, c.before); index != -1 {\n\t\t\t\t\t// if before callback exists but haven't sorted, append current callback to last\n\t\t\t\t\tsortedNames = append(sortedNames, c.name)\n\t\t\t\t\tsortCallbackProcessor(cps[index])\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif c.after != \"\" { // if defined after callback\n\t\t\t\tif index := getRIndex(sortedNames, c.after); index != -1 {\n\t\t\t\t\t// if after callback already sorted, append current callback just before it\n\t\t\t\t\tsortedNames = append(sortedNames[:index+1], append([]string{c.name}, sortedNames[index+1:]...)...)\n\t\t\t\t} else if index := getRIndex(allNames, c.after); index != -1 {\n\t\t\t\t\t// if after callback exists but haven't sorted\n\t\t\t\t\tcp := cps[index]\n\t\t\t\t\t// set after callback's before callback to current callback\n\t\t\t\t\tif cp.before == \"\" {\n\t\t\t\t\t\tcp.before = c.name\n\t\t\t\t\t}\n\t\t\t\t\tsortCallbackProcessor(cp)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// if current callback haven't been sorted, append it to last\n\t\t\tif getRIndex(sortedNames, c.name) == -1 {\n\t\t\t\tsortedNames = append(sortedNames, c.name)\n\t\t\t}\n\t\t}\n\t}\n\n\tfor _, cp := range cps {\n\t\tsortCallbackProcessor(cp)\n\t}\n\n\tvar sortedFuncs []*func(scope *Scope)\n\tfor _, name := range sortedNames {\n\t\tif index := getRIndex(allNames, name); !cps[index].remove {\n\t\t\tsortedFuncs = append(sortedFuncs, cps[index].processor)\n\t\t}\n\t}\n\n\treturn sortedFuncs\n}\n\n// reorder all registered processors, and reset CRUD callbacks\nfunc (c *Callback) reorder() {\n\tvar creates, updates, deletes, queries, rowQueries []*CallbackProcessor\n\n\tfor _, processor := range c.processors {\n\t\tif processor.name != \"\" {\n\t\t\tswitch processor.kind {\n\t\t\tcase \"create\":\n\t\t\t\tcreates = append(creates, processor)\n\t\t\tcase \"update\":\n\t\t\t\tupdates = append(updates, processor)\n\t\t\tcase \"delete\":\n\t\t\t\tdeletes = append(deletes, processor)\n\t\t\tcase \"query\":\n\t\t\t\tqueries = append(queries, processor)\n\t\t\tcase \"row_query\":\n\t\t\t\trowQueries = append(rowQueries, processor)\n\t\t\t}\n\t\t}\n\t}\n\n\tc.creates = sortProcessors(creates)\n\tc.updates = sortProcessors(updates)\n\tc.deletes = sortProcessors(deletes)\n\tc.queries = sortProcessors(queries)\n\tc.rowQueries = sortProcessors(rowQueries)\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_create.go", "content": "package gorm\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n)\n\n// Define callbacks for creating\nfunc init() {\n\tDefaultCallback.Create().Register(\"gorm:begin_transaction\", beginTransactionCallback)\n\tDefaultCallback.Create().Register(\"gorm:before_create\", beforeCreateCallback)\n\tDefaultCallback.Create().Register(\"gorm:save_before_associations\", saveBeforeAssociationsCallback)\n\tDefaultCallback.Create().Register(\"gorm:update_time_stamp\", updateTimeStampForCreateCallback)\n\tDefaultCallback.Create().Register(\"gorm:create\", createCallback)\n\tDefaultCallback.Create().Register(\"gorm:force_reload_after_create\", forceReloadAfterCreateCallback)\n\tDefaultCallback.Create().Register(\"gorm:save_after_associations\", saveAfterAssociationsCallback)\n\tDefaultCallback.Create().Register(\"gorm:after_create\", afterCreateCallback)\n\tDefaultCallback.Create().Register(\"gorm:commit_or_rollback_transaction\", commitOrRollbackTransactionCallback)\n}\n\n// beforeCreateCallback will invoke `BeforeSave`, `BeforeCreate` method before creating\nfunc beforeCreateCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"BeforeSave\")\n\t}\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"BeforeCreate\")\n\t}\n}\n\n// updateTimeStampForCreateCallback will set `CreatedAt`, `UpdatedAt` when creating\nfunc updateTimeStampForCreateCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tnow := NowFunc()\n\n\t\tif createdAtField, ok := scope.FieldByName(\"CreatedAt\"); ok {\n\t\t\tif createdAtField.IsBlank {\n\t\t\t\tcreatedAtField.Set(now)\n\t\t\t}\n\t\t}\n\n\t\tif updatedAtField, ok := scope.FieldByName(\"UpdatedAt\"); ok {\n\t\t\tif updatedAtField.IsBlank {\n\t\t\t\tupdatedAtField.Set(now)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// createCallback the callback used to insert data into database\nfunc createCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tdefer scope.trace(NowFunc())\n\n\t\tvar (\n\t\t\tcolumns, placeholders []string\n\t\t\tblankColumnsWithDefaultValue []string\n\t\t)\n\n\t\tfor _, field := range scope.Fields() {\n\t\t\tif scope.changeableField(field) {\n\t\t\t\tif field.IsNormal {\n\t\t\t\t\tif field.IsBlank && field.HasDefaultValue {\n\t\t\t\t\t\tblankColumnsWithDefaultValue = append(blankColumnsWithDefaultValue, scope.Quote(field.DBName))\n\t\t\t\t\t\tscope.InstanceSet(\"gorm:blank_columns_with_default_value\", blankColumnsWithDefaultValue)\n\t\t\t\t\t} else if !field.IsPrimaryKey || !field.IsBlank {\n\t\t\t\t\t\tcolumns = append(columns, scope.Quote(field.DBName))\n\t\t\t\t\t\tplaceholders = append(placeholders, scope.AddToVars(field.Field.Interface()))\n\t\t\t\t\t}\n\t\t\t\t} else if field.Relationship != nil && field.Relationship.Kind == \"belongs_to\" {\n\t\t\t\t\tfor _, foreignKey := range field.Relationship.ForeignDBNames {\n\t\t\t\t\t\tif foreignField, ok := scope.FieldByName(foreignKey); ok && !scope.changeableField(foreignField) {\n\t\t\t\t\t\t\tcolumns = append(columns, scope.Quote(foreignField.DBName))\n\t\t\t\t\t\t\tplaceholders = append(placeholders, scope.AddToVars(foreignField.Field.Interface()))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvar (\n\t\t\treturningColumn = \"*\"\n\t\t\tquotedTableName = scope.QuotedTableName()\n\t\t\tprimaryField = scope.PrimaryField()\n\t\t\textraOption string\n\t\t)\n\n\t\tif str, ok := scope.Get(\"gorm:insert_option\"); ok {\n\t\t\textraOption = fmt.Sprint(str)\n\t\t}\n\n\t\tif primaryField != nil {\n\t\t\treturningColumn = scope.Quote(primaryField.DBName)\n\t\t}\n\n\t\tlastInsertIDReturningSuffix := scope.Dialect().LastInsertIDReturningSuffix(quotedTableName, returningColumn)\n\n\t\tif len(columns) == 0 {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"INSERT INTO %v %v%v%v\",\n\t\t\t\tquotedTableName,\n\t\t\t\tscope.Dialect().DefaultValueStr(),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t\taddExtraSpaceIfExist(lastInsertIDReturningSuffix),\n\t\t\t))\n\t\t} else {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"INSERT INTO %v (%v) VALUES (%v)%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\tstrings.Join(columns, \",\"),\n\t\t\t\tstrings.Join(placeholders, \",\"),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t\taddExtraSpaceIfExist(lastInsertIDReturningSuffix),\n\t\t\t))\n\t\t}\n\n\t\t// execute create sql\n\t\tif lastInsertIDReturningSuffix == \"\" || primaryField == nil {\n\t\t\tif result, err := scope.SQLDB().Exec(scope.SQL, scope.SQLVars...); scope.Err(err) == nil {\n\t\t\t\t// set rows affected count\n\t\t\t\tscope.db.RowsAffected, _ = result.RowsAffected()\n\n\t\t\t\t// set primary value to primary field\n\t\t\t\tif primaryField != nil && primaryField.IsBlank {\n\t\t\t\t\tif primaryValue, err := result.LastInsertId(); scope.Err(err) == nil {\n\t\t\t\t\t\tscope.Err(primaryField.Set(primaryValue))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tif primaryField.Field.CanAddr() {\n\t\t\t\tif err := scope.SQLDB().QueryRow(scope.SQL, scope.SQLVars...).Scan(primaryField.Field.Addr().Interface()); scope.Err(err) == nil {\n\t\t\t\t\tprimaryField.IsBlank = false\n\t\t\t\t\tscope.db.RowsAffected = 1\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tscope.Err(ErrUnaddressable)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// forceReloadAfterCreateCallback will reload columns that having default value, and set it back to current object\nfunc forceReloadAfterCreateCallback(scope *Scope) {\n\tif blankColumnsWithDefaultValue, ok := scope.InstanceGet(\"gorm:blank_columns_with_default_value\"); ok {\n\t\tdb := scope.DB().New().Table(scope.TableName()).Select(blankColumnsWithDefaultValue.([]string))\n\t\tfor _, field := range scope.Fields() {\n\t\t\tif field.IsPrimaryKey && !field.IsBlank {\n\t\t\t\tdb = db.Where(fmt.Sprintf(\"%v = ?\", field.DBName), field.Field.Interface())\n\t\t\t}\n\t\t}\n\t\tdb.Scan(scope.Value)\n\t}\n}\n\n// afterCreateCallback will invoke `AfterCreate`, `AfterSave` method after creating\nfunc afterCreateCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"AfterCreate\")\n\t}\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"AfterSave\")\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_delete.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n)\n\n// Define callbacks for deleting\nfunc init() {\n\tDefaultCallback.Delete().Register(\"gorm:begin_transaction\", beginTransactionCallback)\n\tDefaultCallback.Delete().Register(\"gorm:before_delete\", beforeDeleteCallback)\n\tDefaultCallback.Delete().Register(\"gorm:delete\", deleteCallback)\n\tDefaultCallback.Delete().Register(\"gorm:after_delete\", afterDeleteCallback)\n\tDefaultCallback.Delete().Register(\"gorm:commit_or_rollback_transaction\", commitOrRollbackTransactionCallback)\n}\n\n// beforeDeleteCallback will invoke `BeforeDelete` method before deleting\nfunc beforeDeleteCallback(scope *Scope) {\n\tif scope.DB().HasBlockGlobalUpdate() && !scope.hasConditions() {\n\t\tscope.Err(errors.New(\"Missing WHERE clause while deleting\"))\n\t\treturn\n\t}\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"BeforeDelete\")\n\t}\n}\n\n// deleteCallback used to delete data from database or set deleted_at to current time (when using with soft delete)\nfunc deleteCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tvar extraOption string\n\t\tif str, ok := scope.Get(\"gorm:delete_option\"); ok {\n\t\t\textraOption = fmt.Sprint(str)\n\t\t}\n\n\t\tdeletedAtField, hasDeletedAtField := scope.FieldByName(\"DeletedAt\")\n\n\t\tif !scope.Search.Unscoped && hasDeletedAtField {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"UPDATE %v SET %v=%v%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\tscope.Quote(deletedAtField.DBName),\n\t\t\t\tscope.AddToVars(NowFunc()),\n\t\t\t\taddExtraSpaceIfExist(scope.CombinedConditionSql()),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t)).Exec()\n\t\t} else {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"DELETE FROM %v%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\taddExtraSpaceIfExist(scope.CombinedConditionSql()),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t)).Exec()\n\t\t}\n\t}\n}\n\n// afterDeleteCallback will invoke `AfterDelete` method after deleting\nfunc afterDeleteCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"AfterDelete\")\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_query.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n)\n\n// Define callbacks for querying\nfunc init() {\n\tDefaultCallback.Query().Register(\"gorm:query\", queryCallback)\n\tDefaultCallback.Query().Register(\"gorm:preload\", preloadCallback)\n\tDefaultCallback.Query().Register(\"gorm:after_query\", afterQueryCallback)\n}\n\n// queryCallback used to query data from database\nfunc queryCallback(scope *Scope) {\n\tif _, skip := scope.InstanceGet(\"gorm:skip_query_callback\"); skip {\n\t\treturn\n\t}\n\n\tdefer scope.trace(NowFunc())\n\n\tvar (\n\t\tisSlice, isPtr bool\n\t\tresultType reflect.Type\n\t\tresults = scope.IndirectValue()\n\t)\n\n\tif orderBy, ok := scope.Get(\"gorm:order_by_primary_key\"); ok {\n\t\tif primaryField := scope.PrimaryField(); primaryField != nil {\n\t\t\tscope.Search.Order(fmt.Sprintf(\"%v.%v %v\", scope.QuotedTableName(), scope.Quote(primaryField.DBName), orderBy))\n\t\t}\n\t}\n\n\tif value, ok := scope.Get(\"gorm:query_destination\"); ok {\n\t\tresults = indirect(reflect.ValueOf(value))\n\t}\n\n\tif kind := results.Kind(); kind == reflect.Slice {\n\t\tisSlice = true\n\t\tresultType = results.Type().Elem()\n\t\tresults.Set(reflect.MakeSlice(results.Type(), 0, 0))\n\n\t\tif resultType.Kind() == reflect.Ptr {\n\t\t\tisPtr = true\n\t\t\tresultType = resultType.Elem()\n\t\t}\n\t} else if kind != reflect.Struct {\n\t\tscope.Err(errors.New(\"unsupported destination, should be slice or struct\"))\n\t\treturn\n\t}\n\n\tscope.prepareQuerySQL()\n\n\tif !scope.HasError() {\n\t\tscope.db.RowsAffected = 0\n\t\tif str, ok := scope.Get(\"gorm:query_option\"); ok {\n\t\t\tscope.SQL += addExtraSpaceIfExist(fmt.Sprint(str))\n\t\t}\n\n\t\tif rows, err := scope.SQLDB().Query(scope.SQL, scope.SQLVars...); scope.Err(err) == nil {\n\t\t\tdefer rows.Close()\n\n\t\t\tcolumns, _ := rows.Columns()\n\t\t\tfor rows.Next() {\n\t\t\t\tscope.db.RowsAffected++\n\n\t\t\t\telem := results\n\t\t\t\tif isSlice {\n\t\t\t\t\telem = reflect.New(resultType).Elem()\n\t\t\t\t}\n\n\t\t\t\tscope.scan(rows, columns, scope.New(elem.Addr().Interface()).Fields())\n\n\t\t\t\tif isSlice {\n\t\t\t\t\tif isPtr {\n\t\t\t\t\t\tresults.Set(reflect.Append(results, elem.Addr()))\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresults.Set(reflect.Append(results, elem))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif err := rows.Err(); err != nil {\n\t\t\t\tscope.Err(err)\n\t\t\t} else if scope.db.RowsAffected == 0 && !isSlice {\n\t\t\t\tscope.Err(ErrRecordNotFound)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// afterQueryCallback will invoke `AfterFind` method after querying\nfunc afterQueryCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tscope.CallMethod(\"AfterFind\")\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_query_preload.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// preloadCallback used to preload associations\nfunc preloadCallback(scope *Scope) {\n\tif _, skip := scope.InstanceGet(\"gorm:skip_query_callback\"); skip {\n\t\treturn\n\t}\n\n\tif _, ok := scope.Get(\"gorm:auto_preload\"); ok {\n\t\tautoPreload(scope)\n\t}\n\n\tif scope.Search.preload == nil || scope.HasError() {\n\t\treturn\n\t}\n\n\tvar (\n\t\tpreloadedMap = map[string]bool{}\n\t\tfields = scope.Fields()\n\t)\n\n\tfor _, preload := range scope.Search.preload {\n\t\tvar (\n\t\t\tpreloadFields = strings.Split(preload.schema, \".\")\n\t\t\tcurrentScope = scope\n\t\t\tcurrentFields = fields\n\t\t)\n\n\t\tfor idx, preloadField := range preloadFields {\n\t\t\tvar currentPreloadConditions []interface{}\n\n\t\t\tif currentScope == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// if not preloaded\n\t\t\tif preloadKey := strings.Join(preloadFields[:idx+1], \".\"); !preloadedMap[preloadKey] {\n\n\t\t\t\t// assign search conditions to last preload\n\t\t\t\tif idx == len(preloadFields)-1 {\n\t\t\t\t\tcurrentPreloadConditions = preload.conditions\n\t\t\t\t}\n\n\t\t\t\tfor _, field := range currentFields {\n\t\t\t\t\tif field.Name != preloadField || field.Relationship == nil {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\tswitch field.Relationship.Kind {\n\t\t\t\t\tcase \"has_one\":\n\t\t\t\t\t\tcurrentScope.handleHasOnePreload(field, currentPreloadConditions)\n\t\t\t\t\tcase \"has_many\":\n\t\t\t\t\t\tcurrentScope.handleHasManyPreload(field, currentPreloadConditions)\n\t\t\t\t\tcase \"belongs_to\":\n\t\t\t\t\t\tcurrentScope.handleBelongsToPreload(field, currentPreloadConditions)\n\t\t\t\t\tcase \"many_to_many\":\n\t\t\t\t\t\tcurrentScope.handleManyToManyPreload(field, currentPreloadConditions)\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tscope.Err(errors.New(\"unsupported relation\"))\n\t\t\t\t\t}\n\n\t\t\t\t\tpreloadedMap[preloadKey] = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\tif !preloadedMap[preloadKey] {\n\t\t\t\t\tscope.Err(fmt.Errorf(\"can't preload field %s for %s\", preloadField, currentScope.GetModelStruct().ModelType))\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// preload next level\n\t\t\tif idx < len(preloadFields)-1 {\n\t\t\t\tcurrentScope = currentScope.getColumnAsScope(preloadField)\n\t\t\t\tif currentScope != nil {\n\t\t\t\t\tcurrentFields = currentScope.Fields()\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc autoPreload(scope *Scope) {\n\tfor _, field := range scope.Fields() {\n\t\tif field.Relationship == nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tif val, ok := field.TagSettings[\"PRELOAD\"]; ok {\n\t\t\tif preload, err := strconv.ParseBool(val); err != nil {\n\t\t\t\tscope.Err(errors.New(\"invalid preload option\"))\n\t\t\t\treturn\n\t\t\t} else if !preload {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tscope.Search.Preload(field.Name)\n\t}\n}\n\nfunc (scope *Scope) generatePreloadDBWithConditions(conditions []interface{}) (*DB, []interface{}) {\n\tvar (\n\t\tpreloadDB = scope.NewDB()\n\t\tpreloadConditions []interface{}\n\t)\n\n\tfor _, condition := range conditions {\n\t\tif scopes, ok := condition.(func(*DB) *DB); ok {\n\t\t\tpreloadDB = scopes(preloadDB)\n\t\t} else {\n\t\t\tpreloadConditions = append(preloadConditions, condition)\n\t\t}\n\t}\n\n\treturn preloadDB, preloadConditions\n}\n\n// handleHasOnePreload used to preload has one associations\nfunc (scope *Scope) handleHasOnePreload(field *Field, conditions []interface{}) {\n\trelation := field.Relationship\n\n\t// get relations's primary keys\n\tprimaryKeys := scope.getColumnAsArray(relation.AssociationForeignFieldNames, scope.Value)\n\tif len(primaryKeys) == 0 {\n\t\treturn\n\t}\n\n\t// preload conditions\n\tpreloadDB, preloadConditions := scope.generatePreloadDBWithConditions(conditions)\n\n\t// find relations\n\tquery := fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relation.ForeignDBNames), toQueryMarks(primaryKeys))\n\tvalues := toQueryValues(primaryKeys)\n\tif relation.PolymorphicType != \"\" {\n\t\tquery += fmt.Sprintf(\" AND %v = ?\", scope.Quote(relation.PolymorphicDBName))\n\t\tvalues = append(values, relation.PolymorphicValue)\n\t}\n\n\tresults := makeSlice(field.Struct.Type)\n\tscope.Err(preloadDB.Where(query, values...).Find(results, preloadConditions...).Error)\n\n\t// assign find results\n\tvar (\n\t\tresultsValue = indirect(reflect.ValueOf(results))\n\t\tindirectScopeValue = scope.IndirectValue()\n\t)\n\n\tif indirectScopeValue.Kind() == reflect.Slice {\n\t\tfor j := 0; j < indirectScopeValue.Len(); j++ {\n\t\t\tfor i := 0; i < resultsValue.Len(); i++ {\n\t\t\t\tresult := resultsValue.Index(i)\n\t\t\t\tforeignValues := getValueFromFields(result, relation.ForeignFieldNames)\n\t\t\t\tif indirectValue := indirect(indirectScopeValue.Index(j)); equalAsString(getValueFromFields(indirectValue, relation.AssociationForeignFieldNames), foreignValues) {\n\t\t\t\t\tindirectValue.FieldByName(field.Name).Set(result)\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor i := 0; i < resultsValue.Len(); i++ {\n\t\t\tresult := resultsValue.Index(i)\n\t\t\tscope.Err(field.Set(result))\n\t\t}\n\t}\n}\n\n// handleHasManyPreload used to preload has many associations\nfunc (scope *Scope) handleHasManyPreload(field *Field, conditions []interface{}) {\n\trelation := field.Relationship\n\n\t// get relations's primary keys\n\tprimaryKeys := scope.getColumnAsArray(relation.AssociationForeignFieldNames, scope.Value)\n\tif len(primaryKeys) == 0 {\n\t\treturn\n\t}\n\n\t// preload conditions\n\tpreloadDB, preloadConditions := scope.generatePreloadDBWithConditions(conditions)\n\n\t// find relations\n\tquery := fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relation.ForeignDBNames), toQueryMarks(primaryKeys))\n\tvalues := toQueryValues(primaryKeys)\n\tif relation.PolymorphicType != \"\" {\n\t\tquery += fmt.Sprintf(\" AND %v = ?\", scope.Quote(relation.PolymorphicDBName))\n\t\tvalues = append(values, relation.PolymorphicValue)\n\t}\n\n\tresults := makeSlice(field.Struct.Type)\n\tscope.Err(preloadDB.Where(query, values...).Find(results, preloadConditions...).Error)\n\n\t// assign find results\n\tvar (\n\t\tresultsValue = indirect(reflect.ValueOf(results))\n\t\tindirectScopeValue = scope.IndirectValue()\n\t)\n\n\tif indirectScopeValue.Kind() == reflect.Slice {\n\t\tpreloadMap := make(map[string][]reflect.Value)\n\t\tfor i := 0; i < resultsValue.Len(); i++ {\n\t\t\tresult := resultsValue.Index(i)\n\t\t\tforeignValues := getValueFromFields(result, relation.ForeignFieldNames)\n\t\t\tpreloadMap[toString(foreignValues)] = append(preloadMap[toString(foreignValues)], result)\n\t\t}\n\n\t\tfor j := 0; j < indirectScopeValue.Len(); j++ {\n\t\t\tobject := indirect(indirectScopeValue.Index(j))\n\t\t\tobjectRealValue := getValueFromFields(object, relation.AssociationForeignFieldNames)\n\t\t\tf := object.FieldByName(field.Name)\n\t\t\tif results, ok := preloadMap[toString(objectRealValue)]; ok {\n\t\t\t\tf.Set(reflect.Append(f, results...))\n\t\t\t} else {\n\t\t\t\tf.Set(reflect.MakeSlice(f.Type(), 0, 0))\n\t\t\t}\n\t\t}\n\t} else {\n\t\tscope.Err(field.Set(resultsValue))\n\t}\n}\n\n// handleBelongsToPreload used to preload belongs to associations\nfunc (scope *Scope) handleBelongsToPreload(field *Field, conditions []interface{}) {\n\trelation := field.Relationship\n\n\t// preload conditions\n\tpreloadDB, preloadConditions := scope.generatePreloadDBWithConditions(conditions)\n\n\t// get relations's primary keys\n\tprimaryKeys := scope.getColumnAsArray(relation.ForeignFieldNames, scope.Value)\n\tif len(primaryKeys) == 0 {\n\t\treturn\n\t}\n\n\t// find relations\n\tresults := makeSlice(field.Struct.Type)\n\tscope.Err(preloadDB.Where(fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, relation.AssociationForeignDBNames), toQueryMarks(primaryKeys)), toQueryValues(primaryKeys)...).Find(results, preloadConditions...).Error)\n\n\t// assign find results\n\tvar (\n\t\tresultsValue = indirect(reflect.ValueOf(results))\n\t\tindirectScopeValue = scope.IndirectValue()\n\t)\n\n\tfor i := 0; i < resultsValue.Len(); i++ {\n\t\tresult := resultsValue.Index(i)\n\t\tif indirectScopeValue.Kind() == reflect.Slice {\n\t\t\tvalue := getValueFromFields(result, relation.AssociationForeignFieldNames)\n\t\t\tfor j := 0; j < indirectScopeValue.Len(); j++ {\n\t\t\t\tobject := indirect(indirectScopeValue.Index(j))\n\t\t\t\tif equalAsString(getValueFromFields(object, relation.ForeignFieldNames), value) {\n\t\t\t\t\tobject.FieldByName(field.Name).Set(result)\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tscope.Err(field.Set(result))\n\t\t}\n\t}\n}\n\n// handleManyToManyPreload used to preload many to many associations\nfunc (scope *Scope) handleManyToManyPreload(field *Field, conditions []interface{}) {\n\tvar (\n\t\trelation = field.Relationship\n\t\tjoinTableHandler = relation.JoinTableHandler\n\t\tfieldType = field.Struct.Type.Elem()\n\t\tforeignKeyValue interface{}\n\t\tforeignKeyType = reflect.ValueOf(&foreignKeyValue).Type()\n\t\tlinkHash = map[string][]reflect.Value{}\n\t\tisPtr bool\n\t)\n\n\tif fieldType.Kind() == reflect.Ptr {\n\t\tisPtr = true\n\t\tfieldType = fieldType.Elem()\n\t}\n\n\tvar sourceKeys = []string{}\n\tfor _, key := range joinTableHandler.SourceForeignKeys() {\n\t\tsourceKeys = append(sourceKeys, key.DBName)\n\t}\n\n\t// preload conditions\n\tpreloadDB, preloadConditions := scope.generatePreloadDBWithConditions(conditions)\n\n\t// generate query with join table\n\tnewScope := scope.New(reflect.New(fieldType).Interface())\n\tpreloadDB = preloadDB.Table(newScope.TableName()).Model(newScope.Value)\n\n\tif len(preloadDB.search.selects) == 0 {\n\t\tpreloadDB = preloadDB.Select(\"*\")\n\t}\n\n\tpreloadDB = joinTableHandler.JoinWith(joinTableHandler, preloadDB, scope.Value)\n\n\t// preload inline conditions\n\tif len(preloadConditions) > 0 {\n\t\tpreloadDB = preloadDB.Where(preloadConditions[0], preloadConditions[1:]...)\n\t}\n\n\trows, err := preloadDB.Rows()\n\n\tif scope.Err(err) != nil {\n\t\treturn\n\t}\n\tdefer rows.Close()\n\n\tcolumns, _ := rows.Columns()\n\tfor rows.Next() {\n\t\tvar (\n\t\t\telem = reflect.New(fieldType).Elem()\n\t\t\tfields = scope.New(elem.Addr().Interface()).Fields()\n\t\t)\n\n\t\t// register foreign keys in join tables\n\t\tvar joinTableFields []*Field\n\t\tfor _, sourceKey := range sourceKeys {\n\t\t\tjoinTableFields = append(joinTableFields, &Field{StructField: &StructField{DBName: sourceKey, IsNormal: true}, Field: reflect.New(foreignKeyType).Elem()})\n\t\t}\n\n\t\tscope.scan(rows, columns, append(fields, joinTableFields...))\n\n\t\tscope.New(elem.Addr().Interface()).\n\t\t\tInstanceSet(\"gorm:skip_query_callback\", true).\n\t\t\tcallCallbacks(scope.db.parent.callbacks.queries)\n\n\t\tvar foreignKeys = make([]interface{}, len(sourceKeys))\n\t\t// generate hashed forkey keys in join table\n\t\tfor idx, joinTableField := range joinTableFields {\n\t\t\tif !joinTableField.Field.IsNil() {\n\t\t\t\tforeignKeys[idx] = joinTableField.Field.Elem().Interface()\n\t\t\t}\n\t\t}\n\t\thashedSourceKeys := toString(foreignKeys)\n\n\t\tif isPtr {\n\t\t\tlinkHash[hashedSourceKeys] = append(linkHash[hashedSourceKeys], elem.Addr())\n\t\t} else {\n\t\t\tlinkHash[hashedSourceKeys] = append(linkHash[hashedSourceKeys], elem)\n\t\t}\n\t}\n\n\tif err := rows.Err(); err != nil {\n\t\tscope.Err(err)\n\t}\n\n\t// assign find results\n\tvar (\n\t\tindirectScopeValue = scope.IndirectValue()\n\t\tfieldsSourceMap = map[string][]reflect.Value{}\n\t\tforeignFieldNames = []string{}\n\t)\n\n\tfor _, dbName := range relation.ForeignFieldNames {\n\t\tif field, ok := scope.FieldByName(dbName); ok {\n\t\t\tforeignFieldNames = append(foreignFieldNames, field.Name)\n\t\t}\n\t}\n\n\tif indirectScopeValue.Kind() == reflect.Slice {\n\t\tfor j := 0; j < indirectScopeValue.Len(); j++ {\n\t\t\tobject := indirect(indirectScopeValue.Index(j))\n\t\t\tkey := toString(getValueFromFields(object, foreignFieldNames))\n\t\t\tfieldsSourceMap[key] = append(fieldsSourceMap[key], object.FieldByName(field.Name))\n\t\t}\n\t} else if indirectScopeValue.IsValid() {\n\t\tkey := toString(getValueFromFields(indirectScopeValue, foreignFieldNames))\n\t\tfieldsSourceMap[key] = append(fieldsSourceMap[key], indirectScopeValue.FieldByName(field.Name))\n\t}\n\tfor source, link := range linkHash {\n\t\tfor i, field := range fieldsSourceMap[source] {\n\t\t\t//If not 0 this means Value is a pointer and we already added preloaded models to it\n\t\t\tif fieldsSourceMap[source][i].Len() != 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfield.Set(reflect.Append(fieldsSourceMap[source][i], link...))\n\t\t}\n\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_row_query.go", "content": "package gorm\n\nimport \"database/sql\"\n\n// Define callbacks for row query\nfunc init() {\n\tDefaultCallback.RowQuery().Register(\"gorm:row_query\", rowQueryCallback)\n}\n\ntype RowQueryResult struct {\n\tRow *sql.Row\n}\n\ntype RowsQueryResult struct {\n\tRows *sql.Rows\n\tError error\n}\n\n// queryCallback used to query data from database\nfunc rowQueryCallback(scope *Scope) {\n\tif result, ok := scope.InstanceGet(\"row_query_result\"); ok {\n\t\tscope.prepareQuerySQL()\n\n\t\tif rowResult, ok := result.(*RowQueryResult); ok {\n\t\t\trowResult.Row = scope.SQLDB().QueryRow(scope.SQL, scope.SQLVars...)\n\t\t} else if rowsResult, ok := result.(*RowsQueryResult); ok {\n\t\t\trowsResult.Rows, rowsResult.Error = scope.SQLDB().Query(scope.SQL, scope.SQLVars...)\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_save.go", "content": "package gorm\n\nimport (\n\t\"reflect\"\n\t\"strings\"\n)\n\nfunc beginTransactionCallback(scope *Scope) {\n\tscope.Begin()\n}\n\nfunc commitOrRollbackTransactionCallback(scope *Scope) {\n\tscope.CommitOrRollback()\n}\n\nfunc saveAssociationCheck(scope *Scope, field *Field) (autoUpdate bool, autoCreate bool, saveReference bool, r *Relationship) {\n\tcheckTruth := func(value interface{}) bool {\n\t\tif v, ok := value.(bool); ok && !v {\n\t\t\treturn false\n\t\t}\n\n\t\tif v, ok := value.(string); ok {\n\t\t\tv = strings.ToLower(v)\n\t\t\tif v == \"false\" || v != \"skip\" {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\treturn true\n\t}\n\n\tif scope.changeableField(field) && !field.IsBlank && !field.IsIgnored {\n\t\tif r = field.Relationship; r != nil {\n\t\t\tautoUpdate, autoCreate, saveReference = true, true, true\n\n\t\t\tif value, ok := scope.Get(\"gorm:save_associations\"); ok {\n\t\t\t\tautoUpdate = checkTruth(value)\n\t\t\t\tautoCreate = autoUpdate\n\t\t\t} else if value, ok := field.TagSettings[\"SAVE_ASSOCIATIONS\"]; ok {\n\t\t\t\tautoUpdate = checkTruth(value)\n\t\t\t\tautoCreate = autoUpdate\n\t\t\t}\n\n\t\t\tif value, ok := scope.Get(\"gorm:association_autoupdate\"); ok {\n\t\t\t\tautoUpdate = checkTruth(value)\n\t\t\t} else if value, ok := field.TagSettings[\"ASSOCIATION_AUTOUPDATE\"]; ok {\n\t\t\t\tautoUpdate = checkTruth(value)\n\t\t\t}\n\n\t\t\tif value, ok := scope.Get(\"gorm:association_autocreate\"); ok {\n\t\t\t\tautoCreate = checkTruth(value)\n\t\t\t} else if value, ok := field.TagSettings[\"ASSOCIATION_AUTOCREATE\"]; ok {\n\t\t\t\tautoCreate = checkTruth(value)\n\t\t\t}\n\n\t\t\tif value, ok := scope.Get(\"gorm:association_save_reference\"); ok {\n\t\t\t\tsaveReference = checkTruth(value)\n\t\t\t} else if value, ok := field.TagSettings[\"ASSOCIATION_SAVE_REFERENCE\"]; ok {\n\t\t\t\tsaveReference = checkTruth(value)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn\n}\n\nfunc saveBeforeAssociationsCallback(scope *Scope) {\n\tfor _, field := range scope.Fields() {\n\t\tautoUpdate, autoCreate, saveReference, relationship := saveAssociationCheck(scope, field)\n\n\t\tif relationship != nil && relationship.Kind == \"belongs_to\" {\n\t\t\tfieldValue := field.Field.Addr().Interface()\n\t\t\tnewScope := scope.New(fieldValue)\n\n\t\t\tif newScope.PrimaryKeyZero() {\n\t\t\t\tif autoCreate {\n\t\t\t\t\tscope.Err(scope.NewDB().Save(fieldValue).Error)\n\t\t\t\t}\n\t\t\t} else if autoUpdate {\n\t\t\t\tscope.Err(scope.NewDB().Save(fieldValue).Error)\n\t\t\t}\n\n\t\t\tif saveReference {\n\t\t\t\tif len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t// set value's foreign key\n\t\t\t\t\tfor idx, fieldName := range relationship.ForeignFieldNames {\n\t\t\t\t\t\tassociationForeignName := relationship.AssociationForeignDBNames[idx]\n\t\t\t\t\t\tif foreignField, ok := scope.New(fieldValue).FieldByName(associationForeignName); ok {\n\t\t\t\t\t\t\tscope.Err(scope.SetColumn(fieldName, foreignField.Field.Interface()))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc saveAfterAssociationsCallback(scope *Scope) {\n\tfor _, field := range scope.Fields() {\n\t\tautoUpdate, autoCreate, saveReference, relationship := saveAssociationCheck(scope, field)\n\n\t\tif relationship != nil && (relationship.Kind == \"has_one\" || relationship.Kind == \"has_many\" || relationship.Kind == \"many_to_many\") {\n\t\t\tvalue := field.Field\n\n\t\t\tswitch value.Kind() {\n\t\t\tcase reflect.Slice:\n\t\t\t\tfor i := 0; i < value.Len(); i++ {\n\t\t\t\t\tnewDB := scope.NewDB()\n\t\t\t\t\telem := value.Index(i).Addr().Interface()\n\t\t\t\t\tnewScope := newDB.NewScope(elem)\n\n\t\t\t\t\tif saveReference {\n\t\t\t\t\t\tif relationship.JoinTableHandler == nil && len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t\t\tfor idx, fieldName := range relationship.ForeignFieldNames {\n\t\t\t\t\t\t\t\tassociationForeignName := relationship.AssociationForeignDBNames[idx]\n\t\t\t\t\t\t\t\tif f, ok := scope.FieldByName(associationForeignName); ok {\n\t\t\t\t\t\t\t\t\tscope.Err(newScope.SetColumn(fieldName, f.Field.Interface()))\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif relationship.PolymorphicType != \"\" {\n\t\t\t\t\t\t\tscope.Err(newScope.SetColumn(relationship.PolymorphicType, relationship.PolymorphicValue))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif newScope.PrimaryKeyZero() {\n\t\t\t\t\t\tif autoCreate {\n\t\t\t\t\t\t\tscope.Err(newDB.Save(elem).Error)\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if autoUpdate {\n\t\t\t\t\t\tscope.Err(newDB.Save(elem).Error)\n\t\t\t\t\t}\n\n\t\t\t\t\tif !scope.New(newScope.Value).PrimaryKeyZero() && saveReference {\n\t\t\t\t\t\tif joinTableHandler := relationship.JoinTableHandler; joinTableHandler != nil {\n\t\t\t\t\t\t\tscope.Err(joinTableHandler.Add(joinTableHandler, newDB, scope.Value, newScope.Value))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tdefault:\n\t\t\t\telem := value.Addr().Interface()\n\t\t\t\tnewScope := scope.New(elem)\n\n\t\t\t\tif saveReference {\n\t\t\t\t\tif len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t\tfor idx, fieldName := range relationship.ForeignFieldNames {\n\t\t\t\t\t\t\tassociationForeignName := relationship.AssociationForeignDBNames[idx]\n\t\t\t\t\t\t\tif f, ok := scope.FieldByName(associationForeignName); ok {\n\t\t\t\t\t\t\t\tscope.Err(newScope.SetColumn(fieldName, f.Field.Interface()))\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif relationship.PolymorphicType != \"\" {\n\t\t\t\t\t\tscope.Err(newScope.SetColumn(relationship.PolymorphicType, relationship.PolymorphicValue))\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif newScope.PrimaryKeyZero() {\n\t\t\t\t\tif autoCreate {\n\t\t\t\t\t\tscope.Err(scope.NewDB().Save(elem).Error)\n\t\t\t\t\t}\n\t\t\t\t} else if autoUpdate {\n\t\t\t\t\tscope.Err(scope.NewDB().Save(elem).Error)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/callback_update.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"sort\"\n\t\"strings\"\n)\n\n// Define callbacks for updating\nfunc init() {\n\tDefaultCallback.Update().Register(\"gorm:assign_updating_attributes\", assignUpdatingAttributesCallback)\n\tDefaultCallback.Update().Register(\"gorm:begin_transaction\", beginTransactionCallback)\n\tDefaultCallback.Update().Register(\"gorm:before_update\", beforeUpdateCallback)\n\tDefaultCallback.Update().Register(\"gorm:save_before_associations\", saveBeforeAssociationsCallback)\n\tDefaultCallback.Update().Register(\"gorm:update_time_stamp\", updateTimeStampForUpdateCallback)\n\tDefaultCallback.Update().Register(\"gorm:update\", updateCallback)\n\tDefaultCallback.Update().Register(\"gorm:save_after_associations\", saveAfterAssociationsCallback)\n\tDefaultCallback.Update().Register(\"gorm:after_update\", afterUpdateCallback)\n\tDefaultCallback.Update().Register(\"gorm:commit_or_rollback_transaction\", commitOrRollbackTransactionCallback)\n}\n\n// assignUpdatingAttributesCallback assign updating attributes to model\nfunc assignUpdatingAttributesCallback(scope *Scope) {\n\tif attrs, ok := scope.InstanceGet(\"gorm:update_interface\"); ok {\n\t\tif updateMaps, hasUpdate := scope.updatedAttrsWithValues(attrs); hasUpdate {\n\t\t\tscope.InstanceSet(\"gorm:update_attrs\", updateMaps)\n\t\t} else {\n\t\t\tscope.SkipLeft()\n\t\t}\n\t}\n}\n\n// beforeUpdateCallback will invoke `BeforeSave`, `BeforeUpdate` method before updating\nfunc beforeUpdateCallback(scope *Scope) {\n\tif scope.DB().HasBlockGlobalUpdate() && !scope.hasConditions() {\n\t\tscope.Err(errors.New(\"Missing WHERE clause while updating\"))\n\t\treturn\n\t}\n\tif _, ok := scope.Get(\"gorm:update_column\"); !ok {\n\t\tif !scope.HasError() {\n\t\t\tscope.CallMethod(\"BeforeSave\")\n\t\t}\n\t\tif !scope.HasError() {\n\t\t\tscope.CallMethod(\"BeforeUpdate\")\n\t\t}\n\t}\n}\n\n// updateTimeStampForUpdateCallback will set `UpdatedAt` when updating\nfunc updateTimeStampForUpdateCallback(scope *Scope) {\n\tif _, ok := scope.Get(\"gorm:update_column\"); !ok {\n\t\tscope.SetColumn(\"UpdatedAt\", NowFunc())\n\t}\n}\n\n// updateCallback the callback used to update data to database\nfunc updateCallback(scope *Scope) {\n\tif !scope.HasError() {\n\t\tvar sqls []string\n\n\t\tif updateAttrs, ok := scope.InstanceGet(\"gorm:update_attrs\"); ok {\n\t\t\t// Sort the column names so that the generated SQL is the same every time.\n\t\t\tupdateMap := updateAttrs.(map[string]interface{})\n\t\t\tvar columns []string\n\t\t\tfor c := range updateMap {\n\t\t\t\tcolumns = append(columns, c)\n\t\t\t}\n\t\t\tsort.Strings(columns)\n\n\t\t\tfor _, column := range columns {\n\t\t\t\tvalue := updateMap[column]\n\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"%v = %v\", scope.Quote(column), scope.AddToVars(value)))\n\t\t\t}\n\t\t} else {\n\t\t\tfor _, field := range scope.Fields() {\n\t\t\t\tif scope.changeableField(field) {\n\t\t\t\t\tif !field.IsPrimaryKey && field.IsNormal {\n\t\t\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"%v = %v\", scope.Quote(field.DBName), scope.AddToVars(field.Field.Interface())))\n\t\t\t\t\t} else if relationship := field.Relationship; relationship != nil && relationship.Kind == \"belongs_to\" {\n\t\t\t\t\t\tfor _, foreignKey := range relationship.ForeignDBNames {\n\t\t\t\t\t\t\tif foreignField, ok := scope.FieldByName(foreignKey); ok && !scope.changeableField(foreignField) {\n\t\t\t\t\t\t\t\tsqls = append(sqls,\n\t\t\t\t\t\t\t\t\tfmt.Sprintf(\"%v = %v\", scope.Quote(foreignField.DBName), scope.AddToVars(foreignField.Field.Interface())))\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvar extraOption string\n\t\tif str, ok := scope.Get(\"gorm:update_option\"); ok {\n\t\t\textraOption = fmt.Sprint(str)\n\t\t}\n\n\t\tif len(sqls) > 0 {\n\t\t\tscope.Raw(fmt.Sprintf(\n\t\t\t\t\"UPDATE %v SET %v%v%v\",\n\t\t\t\tscope.QuotedTableName(),\n\t\t\t\tstrings.Join(sqls, \", \"),\n\t\t\t\taddExtraSpaceIfExist(scope.CombinedConditionSql()),\n\t\t\t\taddExtraSpaceIfExist(extraOption),\n\t\t\t)).Exec()\n\t\t}\n\t}\n}\n\n// afterUpdateCallback will invoke `AfterUpdate`, `AfterSave` method after updating\nfunc afterUpdateCallback(scope *Scope) {\n\tif _, ok := scope.Get(\"gorm:update_column\"); !ok {\n\t\tif !scope.HasError() {\n\t\t\tscope.CallMethod(\"AfterUpdate\")\n\t\t}\n\t\tif !scope.HasError() {\n\t\t\tscope.CallMethod(\"AfterSave\")\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialect.go", "content": "package gorm\n\nimport (\n\t\"database/sql\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Dialect interface contains behaviors that differ across SQL database\ntype Dialect interface {\n\t// GetName get dialect's name\n\tGetName() string\n\n\t// SetDB set db for dialect\n\tSetDB(db SQLCommon)\n\n\t// BindVar return the placeholder for actual values in SQL statements, in many dbs it is \"?\", Postgres using $1\n\tBindVar(i int) string\n\t// Quote quotes field name to avoid SQL parsing exceptions by using a reserved word as a field name\n\tQuote(key string) string\n\t// DataTypeOf return data's sql type\n\tDataTypeOf(field *StructField) string\n\n\t// HasIndex check has index or not\n\tHasIndex(tableName string, indexName string) bool\n\t// HasForeignKey check has foreign key or not\n\tHasForeignKey(tableName string, foreignKeyName string) bool\n\t// RemoveIndex remove index\n\tRemoveIndex(tableName string, indexName string) error\n\t// HasTable check has table or not\n\tHasTable(tableName string) bool\n\t// HasColumn check has column or not\n\tHasColumn(tableName string, columnName string) bool\n\t// ModifyColumn modify column's type\n\tModifyColumn(tableName string, columnName string, typ string) error\n\n\t// LimitAndOffsetSQL return generated SQL with Limit and Offset, as mssql has special case\n\tLimitAndOffsetSQL(limit, offset interface{}) string\n\t// SelectFromDummyTable return select values, for most dbs, `SELECT values` just works, mysql needs `SELECT value FROM DUAL`\n\tSelectFromDummyTable() string\n\t// LastInsertIdReturningSuffix most dbs support LastInsertId, but postgres needs to use `RETURNING`\n\tLastInsertIDReturningSuffix(tableName, columnName string) string\n\t// DefaultValueStr\n\tDefaultValueStr() string\n\n\t// BuildKeyName returns a valid key name (foreign key, index key) for the given table, field and reference\n\tBuildKeyName(kind, tableName string, fields ...string) string\n\n\t// CurrentDatabase return current database name\n\tCurrentDatabase() string\n}\n\nvar dialectsMap = map[string]Dialect{}\n\nfunc newDialect(name string, db SQLCommon) Dialect {\n\tif value, ok := dialectsMap[name]; ok {\n\t\tdialect := reflect.New(reflect.TypeOf(value).Elem()).Interface().(Dialect)\n\t\tdialect.SetDB(db)\n\t\treturn dialect\n\t}\n\n\tfmt.Printf(\"`%v` is not officially supported, running under compatibility mode.\\n\", name)\n\tcommontDialect := &commonDialect{}\n\tcommontDialect.SetDB(db)\n\treturn commontDialect\n}\n\n// RegisterDialect register new dialect\nfunc RegisterDialect(name string, dialect Dialect) {\n\tdialectsMap[name] = dialect\n}\n\n// ParseFieldStructForDialect get field's sql data type\nvar ParseFieldStructForDialect = func(field *StructField, dialect Dialect) (fieldValue reflect.Value, sqlType string, size int, additionalType string) {\n\t// Get redirected field type\n\tvar (\n\t\treflectType = field.Struct.Type\n\t\tdataType = field.TagSettings[\"TYPE\"]\n\t)\n\n\tfor reflectType.Kind() == reflect.Ptr {\n\t\treflectType = reflectType.Elem()\n\t}\n\n\t// Get redirected field value\n\tfieldValue = reflect.Indirect(reflect.New(reflectType))\n\n\tif gormDataType, ok := fieldValue.Interface().(interface {\n\t\tGormDataType(Dialect) string\n\t}); ok {\n\t\tdataType = gormDataType.GormDataType(dialect)\n\t}\n\n\t// Get scanner's real value\n\tvar getScannerValue func(reflect.Value)\n\tgetScannerValue = func(value reflect.Value) {\n\t\tfieldValue = value\n\t\tif _, isScanner := reflect.New(fieldValue.Type()).Interface().(sql.Scanner); isScanner && fieldValue.Kind() == reflect.Struct {\n\t\t\tgetScannerValue(fieldValue.Field(0))\n\t\t}\n\t}\n\tgetScannerValue(fieldValue)\n\n\t// Default Size\n\tif num, ok := field.TagSettings[\"SIZE\"]; ok {\n\t\tsize, _ = strconv.Atoi(num)\n\t} else {\n\t\tsize = 255\n\t}\n\n\t// Default type from tag setting\n\tadditionalType = field.TagSettings[\"NOT NULL\"] + \" \" + field.TagSettings[\"UNIQUE\"]\n\tif value, ok := field.TagSettings[\"DEFAULT\"]; ok {\n\t\tadditionalType = additionalType + \" DEFAULT \" + value\n\t}\n\n\treturn fieldValue, dataType, size, strings.TrimSpace(additionalType)\n}\n\nfunc currentDatabaseAndTable(dialect Dialect, tableName string) (string, string) {\n\tif strings.Contains(tableName, \".\") {\n\t\tsplitStrings := strings.SplitN(tableName, \".\", 2)\n\t\treturn splitStrings[0], splitStrings[1]\n\t}\n\treturn dialect.CurrentDatabase(), tableName\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialect_common.go", "content": "package gorm\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\n// DefaultForeignKeyNamer contains the default foreign key name generator method\ntype DefaultForeignKeyNamer struct {\n}\n\ntype commonDialect struct {\n\tdb SQLCommon\n\tDefaultForeignKeyNamer\n}\n\nfunc init() {\n\tRegisterDialect(\"common\", &commonDialect{})\n}\n\nfunc (commonDialect) GetName() string {\n\treturn \"common\"\n}\n\nfunc (s *commonDialect) SetDB(db SQLCommon) {\n\ts.db = db\n}\n\nfunc (commonDialect) BindVar(i int) string {\n\treturn \"$$$\" // ?\n}\n\nfunc (commonDialect) Quote(key string) string {\n\treturn fmt.Sprintf(`\"%s\"`, key)\n}\n\nfunc (s *commonDialect) fieldCanAutoIncrement(field *StructField) bool {\n\tif value, ok := field.TagSettings[\"AUTO_INCREMENT\"]; ok {\n\t\treturn strings.ToLower(value) != \"false\"\n\t}\n\treturn field.IsPrimaryKey\n}\n\nfunc (s *commonDialect) DataTypeOf(field *StructField) string {\n\tvar dataValue, sqlType, size, additionalType = ParseFieldStructForDialect(field, s)\n\n\tif sqlType == \"\" {\n\t\tswitch dataValue.Kind() {\n\t\tcase reflect.Bool:\n\t\t\tsqlType = \"BOOLEAN\"\n\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uintptr:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tsqlType = \"INTEGER AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"INTEGER\"\n\t\t\t}\n\t\tcase reflect.Int64, reflect.Uint64:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tsqlType = \"BIGINT AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"BIGINT\"\n\t\t\t}\n\t\tcase reflect.Float32, reflect.Float64:\n\t\t\tsqlType = \"FLOAT\"\n\t\tcase reflect.String:\n\t\t\tif size > 0 && size < 65532 {\n\t\t\t\tsqlType = fmt.Sprintf(\"VARCHAR(%d)\", size)\n\t\t\t} else {\n\t\t\t\tsqlType = \"VARCHAR(65532)\"\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tif _, ok := dataValue.Interface().(time.Time); ok {\n\t\t\t\tsqlType = \"TIMESTAMP\"\n\t\t\t}\n\t\tdefault:\n\t\t\tif _, ok := dataValue.Interface().([]byte); ok {\n\t\t\t\tif size > 0 && size < 65532 {\n\t\t\t\t\tsqlType = fmt.Sprintf(\"BINARY(%d)\", size)\n\t\t\t\t} else {\n\t\t\t\t\tsqlType = \"BINARY(65532)\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif sqlType == \"\" {\n\t\tpanic(fmt.Sprintf(\"invalid sql type %s (%s) for commonDialect\", dataValue.Type().Name(), dataValue.Kind().String()))\n\t}\n\n\tif strings.TrimSpace(additionalType) == \"\" {\n\t\treturn sqlType\n\t}\n\treturn fmt.Sprintf(\"%v %v\", sqlType, additionalType)\n}\n\nfunc (s commonDialect) HasIndex(tableName string, indexName string) bool {\n\tvar count int\n\tcurrentDatabase, tableName := currentDatabaseAndTable(&s, tableName)\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.STATISTICS WHERE table_schema = ? AND table_name = ? AND index_name = ?\", currentDatabase, tableName, indexName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s commonDialect) RemoveIndex(tableName string, indexName string) error {\n\t_, err := s.db.Exec(fmt.Sprintf(\"DROP INDEX %v\", indexName))\n\treturn err\n}\n\nfunc (s commonDialect) HasForeignKey(tableName string, foreignKeyName string) bool {\n\treturn false\n}\n\nfunc (s commonDialect) HasTable(tableName string) bool {\n\tvar count int\n\tcurrentDatabase, tableName := currentDatabaseAndTable(&s, tableName)\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.TABLES WHERE table_schema = ? AND table_name = ?\", currentDatabase, tableName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s commonDialect) HasColumn(tableName string, columnName string) bool {\n\tvar count int\n\tcurrentDatabase, tableName := currentDatabaseAndTable(&s, tableName)\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.COLUMNS WHERE table_schema = ? AND table_name = ? AND column_name = ?\", currentDatabase, tableName, columnName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s commonDialect) ModifyColumn(tableName string, columnName string, typ string) error {\n\t_, err := s.db.Exec(fmt.Sprintf(\"ALTER TABLE %v ALTER COLUMN %v TYPE %v\", tableName, columnName, typ))\n\treturn err\n}\n\nfunc (s commonDialect) CurrentDatabase() (name string) {\n\ts.db.QueryRow(\"SELECT DATABASE()\").Scan(&name)\n\treturn\n}\n\nfunc (commonDialect) LimitAndOffsetSQL(limit, offset interface{}) (sql string) {\n\tif limit != nil {\n\t\tif parsedLimit, err := strconv.ParseInt(fmt.Sprint(limit), 0, 0); err == nil && parsedLimit >= 0 {\n\t\t\tsql += fmt.Sprintf(\" LIMIT %d\", parsedLimit)\n\t\t}\n\t}\n\tif offset != nil {\n\t\tif parsedOffset, err := strconv.ParseInt(fmt.Sprint(offset), 0, 0); err == nil && parsedOffset >= 0 {\n\t\t\tsql += fmt.Sprintf(\" OFFSET %d\", parsedOffset)\n\t\t}\n\t}\n\treturn\n}\n\nfunc (commonDialect) SelectFromDummyTable() string {\n\treturn \"\"\n}\n\nfunc (commonDialect) LastInsertIDReturningSuffix(tableName, columnName string) string {\n\treturn \"\"\n}\n\nfunc (commonDialect) DefaultValueStr() string {\n\treturn \"DEFAULT VALUES\"\n}\n\n// BuildKeyName returns a valid key name (foreign key, index key) for the given table, field and reference\nfunc (DefaultForeignKeyNamer) BuildKeyName(kind, tableName string, fields ...string) string {\n\tkeyName := fmt.Sprintf(\"%s_%s_%s\", kind, tableName, strings.Join(fields, \"_\"))\n\tkeyName = regexp.MustCompile(\"[^a-zA-Z0-9]+\").ReplaceAllString(keyName, \"_\")\n\treturn keyName\n}\n\n// IsByteArrayOrSlice returns true of the reflected value is an array or slice\nfunc IsByteArrayOrSlice(value reflect.Value) bool {\n\treturn (value.Kind() == reflect.Array || value.Kind() == reflect.Slice) && value.Type().Elem() == reflect.TypeOf(uint8(0))\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialect_mysql.go", "content": "package gorm\n\nimport (\n\t\"crypto/sha1\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode/utf8\"\n)\n\ntype mysql struct {\n\tcommonDialect\n}\n\nfunc init() {\n\tRegisterDialect(\"mysql\", &mysql{})\n}\n\nfunc (mysql) GetName() string {\n\treturn \"mysql\"\n}\n\nfunc (mysql) Quote(key string) string {\n\treturn fmt.Sprintf(\"`%s`\", key)\n}\n\n// Get Data Type for MySQL Dialect\nfunc (s *mysql) DataTypeOf(field *StructField) string {\n\tvar dataValue, sqlType, size, additionalType = ParseFieldStructForDialect(field, s)\n\n\t// MySQL allows only one auto increment column per table, and it must\n\t// be a KEY column.\n\tif _, ok := field.TagSettings[\"AUTO_INCREMENT\"]; ok {\n\t\tif _, ok = field.TagSettings[\"INDEX\"]; !ok && !field.IsPrimaryKey {\n\t\t\tdelete(field.TagSettings, \"AUTO_INCREMENT\")\n\t\t}\n\t}\n\n\tif sqlType == \"\" {\n\t\tswitch dataValue.Kind() {\n\t\tcase reflect.Bool:\n\t\t\tsqlType = \"boolean\"\n\t\tcase reflect.Int8:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"tinyint AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"tinyint\"\n\t\t\t}\n\t\tcase reflect.Int, reflect.Int16, reflect.Int32:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"int AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"int\"\n\t\t\t}\n\t\tcase reflect.Uint8:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"tinyint unsigned AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"tinyint unsigned\"\n\t\t\t}\n\t\tcase reflect.Uint, reflect.Uint16, reflect.Uint32, reflect.Uintptr:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"int unsigned AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"int unsigned\"\n\t\t\t}\n\t\tcase reflect.Int64:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"bigint AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"bigint\"\n\t\t\t}\n\t\tcase reflect.Uint64:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"bigint unsigned AUTO_INCREMENT\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"bigint unsigned\"\n\t\t\t}\n\t\tcase reflect.Float32, reflect.Float64:\n\t\t\tsqlType = \"double\"\n\t\tcase reflect.String:\n\t\t\tif size > 0 && size < 65532 {\n\t\t\t\tsqlType = fmt.Sprintf(\"varchar(%d)\", size)\n\t\t\t} else {\n\t\t\t\tsqlType = \"longtext\"\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tif _, ok := dataValue.Interface().(time.Time); ok {\n\t\t\t\tprecision := \"\"\n\t\t\t\tif p, ok := field.TagSettings[\"PRECISION\"]; ok {\n\t\t\t\t\tprecision = fmt.Sprintf(\"(%s)\", p)\n\t\t\t\t}\n\n\t\t\t\tif _, ok := field.TagSettings[\"NOT NULL\"]; ok {\n\t\t\t\t\tsqlType = fmt.Sprintf(\"timestamp%v\", precision)\n\t\t\t\t} else {\n\t\t\t\t\tsqlType = fmt.Sprintf(\"timestamp%v NULL\", precision)\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tif IsByteArrayOrSlice(dataValue) {\n\t\t\t\tif size > 0 && size < 65532 {\n\t\t\t\t\tsqlType = fmt.Sprintf(\"varbinary(%d)\", size)\n\t\t\t\t} else {\n\t\t\t\t\tsqlType = \"longblob\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif sqlType == \"\" {\n\t\tpanic(fmt.Sprintf(\"invalid sql type %s (%s) for mysql\", dataValue.Type().Name(), dataValue.Kind().String()))\n\t}\n\n\tif strings.TrimSpace(additionalType) == \"\" {\n\t\treturn sqlType\n\t}\n\treturn fmt.Sprintf(\"%v %v\", sqlType, additionalType)\n}\n\nfunc (s mysql) RemoveIndex(tableName string, indexName string) error {\n\t_, err := s.db.Exec(fmt.Sprintf(\"DROP INDEX %v ON %v\", indexName, s.Quote(tableName)))\n\treturn err\n}\n\nfunc (s mysql) ModifyColumn(tableName string, columnName string, typ string) error {\n\t_, err := s.db.Exec(fmt.Sprintf(\"ALTER TABLE %v MODIFY COLUMN %v %v\", tableName, columnName, typ))\n\treturn err\n}\n\nfunc (s mysql) LimitAndOffsetSQL(limit, offset interface{}) (sql string) {\n\tif limit != nil {\n\t\tif parsedLimit, err := strconv.ParseInt(fmt.Sprint(limit), 0, 0); err == nil && parsedLimit >= 0 {\n\t\t\tsql += fmt.Sprintf(\" LIMIT %d\", parsedLimit)\n\n\t\t\tif offset != nil {\n\t\t\t\tif parsedOffset, err := strconv.ParseInt(fmt.Sprint(offset), 0, 0); err == nil && parsedOffset >= 0 {\n\t\t\t\t\tsql += fmt.Sprintf(\" OFFSET %d\", parsedOffset)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc (s mysql) HasForeignKey(tableName string, foreignKeyName string) bool {\n\tvar count int\n\tcurrentDatabase, tableName := currentDatabaseAndTable(&s, tableName)\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.TABLE_CONSTRAINTS WHERE CONSTRAINT_SCHEMA=? AND TABLE_NAME=? AND CONSTRAINT_NAME=? AND CONSTRAINT_TYPE='FOREIGN KEY'\", currentDatabase, tableName, foreignKeyName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s mysql) CurrentDatabase() (name string) {\n\ts.db.QueryRow(\"SELECT DATABASE()\").Scan(&name)\n\treturn\n}\n\nfunc (mysql) SelectFromDummyTable() string {\n\treturn \"FROM DUAL\"\n}\n\nfunc (s mysql) BuildKeyName(kind, tableName string, fields ...string) string {\n\tkeyName := s.commonDialect.BuildKeyName(kind, tableName, fields...)\n\tif utf8.RuneCountInString(keyName) <= 64 {\n\t\treturn keyName\n\t}\n\th := sha1.New()\n\th.Write([]byte(keyName))\n\tbs := h.Sum(nil)\n\n\t// sha1 is 40 characters, keep first 24 characters of destination\n\tdestRunes := []rune(regexp.MustCompile(\"[^a-zA-Z0-9]+\").ReplaceAllString(fields[0], \"_\"))\n\tif len(destRunes) > 24 {\n\t\tdestRunes = destRunes[:24]\n\t}\n\n\treturn fmt.Sprintf(\"%s%x\", string(destRunes), bs)\n}\n\nfunc (mysql) DefaultValueStr() string {\n\treturn \"VALUES()\"\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialect_postgres.go", "content": "package gorm\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n)\n\ntype postgres struct {\n\tcommonDialect\n}\n\nfunc init() {\n\tRegisterDialect(\"postgres\", &postgres{})\n\tRegisterDialect(\"cloudsqlpostgres\", &postgres{})\n}\n\nfunc (postgres) GetName() string {\n\treturn \"postgres\"\n}\n\nfunc (postgres) BindVar(i int) string {\n\treturn fmt.Sprintf(\"$%v\", i)\n}\n\nfunc (s *postgres) DataTypeOf(field *StructField) string {\n\tvar dataValue, sqlType, size, additionalType = ParseFieldStructForDialect(field, s)\n\n\tif sqlType == \"\" {\n\t\tswitch dataValue.Kind() {\n\t\tcase reflect.Bool:\n\t\t\tsqlType = \"boolean\"\n\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uintptr:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"serial\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"integer\"\n\t\t\t}\n\t\tcase reflect.Int64, reflect.Uint32, reflect.Uint64:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"bigserial\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"bigint\"\n\t\t\t}\n\t\tcase reflect.Float32, reflect.Float64:\n\t\t\tsqlType = \"numeric\"\n\t\tcase reflect.String:\n\t\t\tif _, ok := field.TagSettings[\"SIZE\"]; !ok {\n\t\t\t\tsize = 0 // if SIZE haven't been set, use `text` as the default type, as there are no performance different\n\t\t\t}\n\n\t\t\tif size > 0 && size < 65532 {\n\t\t\t\tsqlType = fmt.Sprintf(\"varchar(%d)\", size)\n\t\t\t} else {\n\t\t\t\tsqlType = \"text\"\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tif _, ok := dataValue.Interface().(time.Time); ok {\n\t\t\t\tsqlType = \"timestamp with time zone\"\n\t\t\t}\n\t\tcase reflect.Map:\n\t\t\tif dataValue.Type().Name() == \"Hstore\" {\n\t\t\t\tsqlType = \"hstore\"\n\t\t\t}\n\t\tdefault:\n\t\t\tif IsByteArrayOrSlice(dataValue) {\n\t\t\t\tsqlType = \"bytea\"\n\n\t\t\t\tif isUUID(dataValue) {\n\t\t\t\t\tsqlType = \"uuid\"\n\t\t\t\t}\n\n\t\t\t\tif isJSON(dataValue) {\n\t\t\t\t\tsqlType = \"jsonb\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif sqlType == \"\" {\n\t\tpanic(fmt.Sprintf(\"invalid sql type %s (%s) for postgres\", dataValue.Type().Name(), dataValue.Kind().String()))\n\t}\n\n\tif strings.TrimSpace(additionalType) == \"\" {\n\t\treturn sqlType\n\t}\n\treturn fmt.Sprintf(\"%v %v\", sqlType, additionalType)\n}\n\nfunc (s postgres) HasIndex(tableName string, indexName string) bool {\n\tvar count int\n\ts.db.QueryRow(\"SELECT count(*) FROM pg_indexes WHERE tablename = $1 AND indexname = $2 AND schemaname = CURRENT_SCHEMA()\", tableName, indexName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s postgres) HasForeignKey(tableName string, foreignKeyName string) bool {\n\tvar count int\n\ts.db.QueryRow(\"SELECT count(con.conname) FROM pg_constraint con WHERE $1::regclass::oid = con.conrelid AND con.conname = $2 AND con.contype='f'\", tableName, foreignKeyName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s postgres) HasTable(tableName string) bool {\n\tvar count int\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.tables WHERE table_name = $1 AND table_type = 'BASE TABLE' AND table_schema = CURRENT_SCHEMA()\", tableName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s postgres) HasColumn(tableName string, columnName string) bool {\n\tvar count int\n\ts.db.QueryRow(\"SELECT count(*) FROM INFORMATION_SCHEMA.columns WHERE table_name = $1 AND column_name = $2 AND table_schema = CURRENT_SCHEMA()\", tableName, columnName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s postgres) CurrentDatabase() (name string) {\n\ts.db.QueryRow(\"SELECT CURRENT_DATABASE()\").Scan(&name)\n\treturn\n}\n\nfunc (s postgres) LastInsertIDReturningSuffix(tableName, key string) string {\n\treturn fmt.Sprintf(\"RETURNING %v.%v\", tableName, key)\n}\n\nfunc (postgres) SupportLastInsertID() bool {\n\treturn false\n}\n\nfunc isUUID(value reflect.Value) bool {\n\tif value.Kind() != reflect.Array || value.Type().Len() != 16 {\n\t\treturn false\n\t}\n\ttypename := value.Type().Name()\n\tlower := strings.ToLower(typename)\n\treturn \"uuid\" == lower || \"guid\" == lower\n}\n\nfunc isJSON(value reflect.Value) bool {\n\t_, ok := value.Interface().(json.RawMessage)\n\treturn ok\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialect_sqlite3.go", "content": "package gorm\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n)\n\ntype sqlite3 struct {\n\tcommonDialect\n}\n\nfunc init() {\n\tRegisterDialect(\"sqlite3\", &sqlite3{})\n}\n\nfunc (sqlite3) GetName() string {\n\treturn \"sqlite3\"\n}\n\n// Get Data Type for Sqlite Dialect\nfunc (s *sqlite3) DataTypeOf(field *StructField) string {\n\tvar dataValue, sqlType, size, additionalType = ParseFieldStructForDialect(field, s)\n\n\tif sqlType == \"\" {\n\t\tswitch dataValue.Kind() {\n\t\tcase reflect.Bool:\n\t\t\tsqlType = \"bool\"\n\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uintptr:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"integer primary key autoincrement\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"integer\"\n\t\t\t}\n\t\tcase reflect.Int64, reflect.Uint64:\n\t\t\tif s.fieldCanAutoIncrement(field) {\n\t\t\t\tfield.TagSettings[\"AUTO_INCREMENT\"] = \"AUTO_INCREMENT\"\n\t\t\t\tsqlType = \"integer primary key autoincrement\"\n\t\t\t} else {\n\t\t\t\tsqlType = \"bigint\"\n\t\t\t}\n\t\tcase reflect.Float32, reflect.Float64:\n\t\t\tsqlType = \"real\"\n\t\tcase reflect.String:\n\t\t\tif size > 0 && size < 65532 {\n\t\t\t\tsqlType = fmt.Sprintf(\"varchar(%d)\", size)\n\t\t\t} else {\n\t\t\t\tsqlType = \"text\"\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tif _, ok := dataValue.Interface().(time.Time); ok {\n\t\t\t\tsqlType = \"datetime\"\n\t\t\t}\n\t\tdefault:\n\t\t\tif IsByteArrayOrSlice(dataValue) {\n\t\t\t\tsqlType = \"blob\"\n\t\t\t}\n\t\t}\n\t}\n\n\tif sqlType == \"\" {\n\t\tpanic(fmt.Sprintf(\"invalid sql type %s (%s) for sqlite3\", dataValue.Type().Name(), dataValue.Kind().String()))\n\t}\n\n\tif strings.TrimSpace(additionalType) == \"\" {\n\t\treturn sqlType\n\t}\n\treturn fmt.Sprintf(\"%v %v\", sqlType, additionalType)\n}\n\nfunc (s sqlite3) HasIndex(tableName string, indexName string) bool {\n\tvar count int\n\ts.db.QueryRow(fmt.Sprintf(\"SELECT count(*) FROM sqlite_master WHERE tbl_name = ? AND sql LIKE '%%INDEX %v ON%%'\", indexName), tableName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s sqlite3) HasTable(tableName string) bool {\n\tvar count int\n\ts.db.QueryRow(\"SELECT count(*) FROM sqlite_master WHERE type='table' AND name=?\", tableName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s sqlite3) HasColumn(tableName string, columnName string) bool {\n\tvar count int\n\ts.db.QueryRow(fmt.Sprintf(\"SELECT count(*) FROM sqlite_master WHERE tbl_name = ? AND (sql LIKE '%%\\\"%v\\\" %%' OR sql LIKE '%%%v %%');\\n\", columnName, columnName), tableName).Scan(&count)\n\treturn count > 0\n}\n\nfunc (s sqlite3) CurrentDatabase() (name string) {\n\tvar (\n\t\tifaces = make([]interface{}, 3)\n\t\tpointers = make([]*string, 3)\n\t\ti int\n\t)\n\tfor i = 0; i < 3; i++ {\n\t\tifaces[i] = &pointers[i]\n\t}\n\tif err := s.db.QueryRow(\"PRAGMA database_list\").Scan(ifaces...); err != nil {\n\t\treturn\n\t}\n\tif pointers[1] != nil {\n\t\tname = *pointers[1]\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/dialects/mysql/mysql.go", "content": "package mysql\n\nimport _ \"github.com/go-sql-driver/mysql\"\n" }, { "path": "vendor/github.com/jinzhu/gorm/docker-compose.yml", "content": "version: '3'\n\nservices:\n mysql:\n image: 'mysql:latest'\n ports:\n - 9910:3306\n environment:\n - MYSQL_DATABASE=gorm\n - MYSQL_USER=gorm\n - MYSQL_PASSWORD=gorm\n - MYSQL_RANDOM_ROOT_PASSWORD=\"yes\"\n postgres:\n image: 'postgres:latest'\n ports:\n - 9920:5432\n environment:\n - POSTGRES_USER=gorm\n - POSTGRES_DB=gorm\n - POSTGRES_PASSWORD=gorm\n mssql:\n image: 'mcmoe/mssqldocker:latest'\n ports:\n - 9930:1433\n environment:\n - ACCEPT_EULA=Y\n - SA_PASSWORD=LoremIpsum86\n - MSSQL_DB=gorm\n - MSSQL_USER=gorm\n - MSSQL_PASSWORD=LoremIpsum86\n" }, { "path": "vendor/github.com/jinzhu/gorm/errors.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"strings\"\n)\n\nvar (\n\t// ErrRecordNotFound record not found error, happens when haven't find any matched data when looking up with a struct\n\tErrRecordNotFound = errors.New(\"record not found\")\n\t// ErrInvalidSQL invalid SQL error, happens when you passed invalid SQL\n\tErrInvalidSQL = errors.New(\"invalid SQL\")\n\t// ErrInvalidTransaction invalid transaction when you are trying to `Commit` or `Rollback`\n\tErrInvalidTransaction = errors.New(\"no valid transaction\")\n\t// ErrCantStartTransaction can't start transaction when you are trying to start one with `Begin`\n\tErrCantStartTransaction = errors.New(\"can't start transaction\")\n\t// ErrUnaddressable unaddressable value\n\tErrUnaddressable = errors.New(\"using unaddressable value\")\n)\n\n// Errors contains all happened errors\ntype Errors []error\n\n// IsRecordNotFoundError returns current error has record not found error or not\nfunc IsRecordNotFoundError(err error) bool {\n\tif errs, ok := err.(Errors); ok {\n\t\tfor _, err := range errs {\n\t\t\tif err == ErrRecordNotFound {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t}\n\treturn err == ErrRecordNotFound\n}\n\n// GetErrors gets all happened errors\nfunc (errs Errors) GetErrors() []error {\n\treturn errs\n}\n\n// Add adds an error\nfunc (errs Errors) Add(newErrors ...error) Errors {\n\tfor _, err := range newErrors {\n\t\tif err == nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tif errors, ok := err.(Errors); ok {\n\t\t\terrs = errs.Add(errors...)\n\t\t} else {\n\t\t\tok = true\n\t\t\tfor _, e := range errs {\n\t\t\t\tif err == e {\n\t\t\t\t\tok = false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ok {\n\t\t\t\terrs = append(errs, err)\n\t\t\t}\n\t\t}\n\t}\n\treturn errs\n}\n\n// Error format happened errors\nfunc (errs Errors) Error() string {\n\tvar errors = []string{}\n\tfor _, e := range errs {\n\t\terrors = append(errors, e.Error())\n\t}\n\treturn strings.Join(errors, \"; \")\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/field.go", "content": "package gorm\n\nimport (\n\t\"database/sql\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n)\n\n// Field model field definition\ntype Field struct {\n\t*StructField\n\tIsBlank bool\n\tField reflect.Value\n}\n\n// Set set a value to the field\nfunc (field *Field) Set(value interface{}) (err error) {\n\tif !field.Field.IsValid() {\n\t\treturn errors.New(\"field value not valid\")\n\t}\n\n\tif !field.Field.CanAddr() {\n\t\treturn ErrUnaddressable\n\t}\n\n\treflectValue, ok := value.(reflect.Value)\n\tif !ok {\n\t\treflectValue = reflect.ValueOf(value)\n\t}\n\n\tfieldValue := field.Field\n\tif reflectValue.IsValid() {\n\t\tif reflectValue.Type().ConvertibleTo(fieldValue.Type()) {\n\t\t\tfieldValue.Set(reflectValue.Convert(fieldValue.Type()))\n\t\t} else {\n\t\t\tif fieldValue.Kind() == reflect.Ptr {\n\t\t\t\tif fieldValue.IsNil() {\n\t\t\t\t\tfieldValue.Set(reflect.New(field.Struct.Type.Elem()))\n\t\t\t\t}\n\t\t\t\tfieldValue = fieldValue.Elem()\n\t\t\t}\n\n\t\t\tif reflectValue.Type().ConvertibleTo(fieldValue.Type()) {\n\t\t\t\tfieldValue.Set(reflectValue.Convert(fieldValue.Type()))\n\t\t\t} else if scanner, ok := fieldValue.Addr().Interface().(sql.Scanner); ok {\n\t\t\t\terr = scanner.Scan(reflectValue.Interface())\n\t\t\t} else {\n\t\t\t\terr = fmt.Errorf(\"could not convert argument of field %s from %s to %s\", field.Name, reflectValue.Type(), fieldValue.Type())\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfield.Field.Set(reflect.Zero(field.Field.Type()))\n\t}\n\n\tfield.IsBlank = isBlank(field.Field)\n\treturn err\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/interface.go", "content": "package gorm\n\nimport \"database/sql\"\n\n// SQLCommon is the minimal database connection functionality gorm requires. Implemented by *sql.DB.\ntype SQLCommon interface {\n\tExec(query string, args ...interface{}) (sql.Result, error)\n\tPrepare(query string) (*sql.Stmt, error)\n\tQuery(query string, args ...interface{}) (*sql.Rows, error)\n\tQueryRow(query string, args ...interface{}) *sql.Row\n}\n\ntype sqlDb interface {\n\tBegin() (*sql.Tx, error)\n}\n\ntype sqlTx interface {\n\tCommit() error\n\tRollback() error\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/join_table_handler.go", "content": "package gorm\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n)\n\n// JoinTableHandlerInterface is an interface for how to handle many2many relations\ntype JoinTableHandlerInterface interface {\n\t// initialize join table handler\n\tSetup(relationship *Relationship, tableName string, source reflect.Type, destination reflect.Type)\n\t// Table return join table's table name\n\tTable(db *DB) string\n\t// Add create relationship in join table for source and destination\n\tAdd(handler JoinTableHandlerInterface, db *DB, source interface{}, destination interface{}) error\n\t// Delete delete relationship in join table for sources\n\tDelete(handler JoinTableHandlerInterface, db *DB, sources ...interface{}) error\n\t// JoinWith query with `Join` conditions\n\tJoinWith(handler JoinTableHandlerInterface, db *DB, source interface{}) *DB\n\t// SourceForeignKeys return source foreign keys\n\tSourceForeignKeys() []JoinTableForeignKey\n\t// DestinationForeignKeys return destination foreign keys\n\tDestinationForeignKeys() []JoinTableForeignKey\n}\n\n// JoinTableForeignKey join table foreign key struct\ntype JoinTableForeignKey struct {\n\tDBName string\n\tAssociationDBName string\n}\n\n// JoinTableSource is a struct that contains model type and foreign keys\ntype JoinTableSource struct {\n\tModelType reflect.Type\n\tForeignKeys []JoinTableForeignKey\n}\n\n// JoinTableHandler default join table handler\ntype JoinTableHandler struct {\n\tTableName string `sql:\"-\"`\n\tSource JoinTableSource `sql:\"-\"`\n\tDestination JoinTableSource `sql:\"-\"`\n}\n\n// SourceForeignKeys return source foreign keys\nfunc (s *JoinTableHandler) SourceForeignKeys() []JoinTableForeignKey {\n\treturn s.Source.ForeignKeys\n}\n\n// DestinationForeignKeys return destination foreign keys\nfunc (s *JoinTableHandler) DestinationForeignKeys() []JoinTableForeignKey {\n\treturn s.Destination.ForeignKeys\n}\n\n// Setup initialize a default join table handler\nfunc (s *JoinTableHandler) Setup(relationship *Relationship, tableName string, source reflect.Type, destination reflect.Type) {\n\ts.TableName = tableName\n\n\ts.Source = JoinTableSource{ModelType: source}\n\ts.Source.ForeignKeys = []JoinTableForeignKey{}\n\tfor idx, dbName := range relationship.ForeignFieldNames {\n\t\ts.Source.ForeignKeys = append(s.Source.ForeignKeys, JoinTableForeignKey{\n\t\t\tDBName: relationship.ForeignDBNames[idx],\n\t\t\tAssociationDBName: dbName,\n\t\t})\n\t}\n\n\ts.Destination = JoinTableSource{ModelType: destination}\n\ts.Destination.ForeignKeys = []JoinTableForeignKey{}\n\tfor idx, dbName := range relationship.AssociationForeignFieldNames {\n\t\ts.Destination.ForeignKeys = append(s.Destination.ForeignKeys, JoinTableForeignKey{\n\t\t\tDBName: relationship.AssociationForeignDBNames[idx],\n\t\t\tAssociationDBName: dbName,\n\t\t})\n\t}\n}\n\n// Table return join table's table name\nfunc (s JoinTableHandler) Table(db *DB) string {\n\treturn DefaultTableNameHandler(db, s.TableName)\n}\n\nfunc (s JoinTableHandler) updateConditionMap(conditionMap map[string]interface{}, db *DB, joinTableSources []JoinTableSource, sources ...interface{}) {\n\tfor _, source := range sources {\n\t\tscope := db.NewScope(source)\n\t\tmodelType := scope.GetModelStruct().ModelType\n\n\t\tfor _, joinTableSource := range joinTableSources {\n\t\t\tif joinTableSource.ModelType == modelType {\n\t\t\t\tfor _, foreignKey := range joinTableSource.ForeignKeys {\n\t\t\t\t\tif field, ok := scope.FieldByName(foreignKey.AssociationDBName); ok {\n\t\t\t\t\t\tconditionMap[foreignKey.DBName] = field.Field.Interface()\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n}\n\n// Add create relationship in join table for source and destination\nfunc (s JoinTableHandler) Add(handler JoinTableHandlerInterface, db *DB, source interface{}, destination interface{}) error {\n\tvar (\n\t\tscope = db.NewScope(\"\")\n\t\tconditionMap = map[string]interface{}{}\n\t)\n\n\t// Update condition map for source\n\ts.updateConditionMap(conditionMap, db, []JoinTableSource{s.Source}, source)\n\n\t// Update condition map for destination\n\ts.updateConditionMap(conditionMap, db, []JoinTableSource{s.Destination}, destination)\n\n\tvar assignColumns, binVars, conditions []string\n\tvar values []interface{}\n\tfor key, value := range conditionMap {\n\t\tassignColumns = append(assignColumns, scope.Quote(key))\n\t\tbinVars = append(binVars, `?`)\n\t\tconditions = append(conditions, fmt.Sprintf(\"%v = ?\", scope.Quote(key)))\n\t\tvalues = append(values, value)\n\t}\n\n\tfor _, value := range values {\n\t\tvalues = append(values, value)\n\t}\n\n\tquotedTable := scope.Quote(handler.Table(db))\n\tsql := fmt.Sprintf(\n\t\t\"INSERT INTO %v (%v) SELECT %v %v WHERE NOT EXISTS (SELECT * FROM %v WHERE %v)\",\n\t\tquotedTable,\n\t\tstrings.Join(assignColumns, \",\"),\n\t\tstrings.Join(binVars, \",\"),\n\t\tscope.Dialect().SelectFromDummyTable(),\n\t\tquotedTable,\n\t\tstrings.Join(conditions, \" AND \"),\n\t)\n\n\treturn db.Exec(sql, values...).Error\n}\n\n// Delete delete relationship in join table for sources\nfunc (s JoinTableHandler) Delete(handler JoinTableHandlerInterface, db *DB, sources ...interface{}) error {\n\tvar (\n\t\tscope = db.NewScope(nil)\n\t\tconditions []string\n\t\tvalues []interface{}\n\t\tconditionMap = map[string]interface{}{}\n\t)\n\n\ts.updateConditionMap(conditionMap, db, []JoinTableSource{s.Source, s.Destination}, sources...)\n\n\tfor key, value := range conditionMap {\n\t\tconditions = append(conditions, fmt.Sprintf(\"%v = ?\", scope.Quote(key)))\n\t\tvalues = append(values, value)\n\t}\n\n\treturn db.Table(handler.Table(db)).Where(strings.Join(conditions, \" AND \"), values...).Delete(\"\").Error\n}\n\n// JoinWith query with `Join` conditions\nfunc (s JoinTableHandler) JoinWith(handler JoinTableHandlerInterface, db *DB, source interface{}) *DB {\n\tvar (\n\t\tscope = db.NewScope(source)\n\t\ttableName = handler.Table(db)\n\t\tquotedTableName = scope.Quote(tableName)\n\t\tjoinConditions []string\n\t\tvalues []interface{}\n\t)\n\n\tif s.Source.ModelType == scope.GetModelStruct().ModelType {\n\t\tdestinationTableName := db.NewScope(reflect.New(s.Destination.ModelType).Interface()).QuotedTableName()\n\t\tfor _, foreignKey := range s.Destination.ForeignKeys {\n\t\t\tjoinConditions = append(joinConditions, fmt.Sprintf(\"%v.%v = %v.%v\", quotedTableName, scope.Quote(foreignKey.DBName), destinationTableName, scope.Quote(foreignKey.AssociationDBName)))\n\t\t}\n\n\t\tvar foreignDBNames []string\n\t\tvar foreignFieldNames []string\n\n\t\tfor _, foreignKey := range s.Source.ForeignKeys {\n\t\t\tforeignDBNames = append(foreignDBNames, foreignKey.DBName)\n\t\t\tif field, ok := scope.FieldByName(foreignKey.AssociationDBName); ok {\n\t\t\t\tforeignFieldNames = append(foreignFieldNames, field.Name)\n\t\t\t}\n\t\t}\n\n\t\tforeignFieldValues := scope.getColumnAsArray(foreignFieldNames, scope.Value)\n\n\t\tvar condString string\n\t\tif len(foreignFieldValues) > 0 {\n\t\t\tvar quotedForeignDBNames []string\n\t\t\tfor _, dbName := range foreignDBNames {\n\t\t\t\tquotedForeignDBNames = append(quotedForeignDBNames, tableName+\".\"+dbName)\n\t\t\t}\n\n\t\t\tcondString = fmt.Sprintf(\"%v IN (%v)\", toQueryCondition(scope, quotedForeignDBNames), toQueryMarks(foreignFieldValues))\n\n\t\t\tkeys := scope.getColumnAsArray(foreignFieldNames, scope.Value)\n\t\t\tvalues = append(values, toQueryValues(keys))\n\t\t} else {\n\t\t\tcondString = fmt.Sprintf(\"1 <> 1\")\n\t\t}\n\n\t\treturn db.Joins(fmt.Sprintf(\"INNER JOIN %v ON %v\", quotedTableName, strings.Join(joinConditions, \" AND \"))).\n\t\t\tWhere(condString, toQueryValues(foreignFieldValues)...)\n\t}\n\n\tdb.Error = errors.New(\"wrong source type for join table handler\")\n\treturn db\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/logger.go", "content": "package gorm\n\nimport (\n\t\"database/sql/driver\"\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"time\"\n\t\"unicode\"\n)\n\nvar (\n\tdefaultLogger = Logger{log.New(os.Stdout, \"\\r\\n\", 0)}\n\tsqlRegexp = regexp.MustCompile(`\\?`)\n\tnumericPlaceHolderRegexp = regexp.MustCompile(`\\$\\d+`)\n)\n\nfunc isPrintable(s string) bool {\n\tfor _, r := range s {\n\t\tif !unicode.IsPrint(r) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nvar LogFormatter = func(values ...interface{}) (messages []interface{}) {\n\tif len(values) > 1 {\n\t\tvar (\n\t\t\tsql string\n\t\t\tformattedValues []string\n\t\t\tlevel = values[0]\n\t\t\tcurrentTime = \"\\n\\033[33m[\" + NowFunc().Format(\"2006-01-02 15:04:05\") + \"]\\033[0m\"\n\t\t\tsource = fmt.Sprintf(\"\\033[35m(%v)\\033[0m\", values[1])\n\t\t)\n\n\t\tmessages = []interface{}{source, currentTime}\n\n\t\tif level == \"sql\" {\n\t\t\t// duration\n\t\t\tmessages = append(messages, fmt.Sprintf(\" \\033[36;1m[%.2fms]\\033[0m \", float64(values[2].(time.Duration).Nanoseconds()/1e4)/100.0))\n\t\t\t// sql\n\n\t\t\tfor _, value := range values[4].([]interface{}) {\n\t\t\t\tindirectValue := reflect.Indirect(reflect.ValueOf(value))\n\t\t\t\tif indirectValue.IsValid() {\n\t\t\t\t\tvalue = indirectValue.Interface()\n\t\t\t\t\tif t, ok := value.(time.Time); ok {\n\t\t\t\t\t\tformattedValues = append(formattedValues, fmt.Sprintf(\"'%v'\", t.Format(\"2006-01-02 15:04:05\")))\n\t\t\t\t\t} else if b, ok := value.([]byte); ok {\n\t\t\t\t\t\tif str := string(b); isPrintable(str) {\n\t\t\t\t\t\t\tformattedValues = append(formattedValues, fmt.Sprintf(\"'%v'\", str))\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tformattedValues = append(formattedValues, \"''\")\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if r, ok := value.(driver.Valuer); ok {\n\t\t\t\t\t\tif value, err := r.Value(); err == nil && value != nil {\n\t\t\t\t\t\t\tformattedValues = append(formattedValues, fmt.Sprintf(\"'%v'\", value))\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tformattedValues = append(formattedValues, \"NULL\")\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tformattedValues = append(formattedValues, fmt.Sprintf(\"'%v'\", value))\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tformattedValues = append(formattedValues, \"NULL\")\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// differentiate between $n placeholders or else treat like ?\n\t\t\tif numericPlaceHolderRegexp.MatchString(values[3].(string)) {\n\t\t\t\tsql = values[3].(string)\n\t\t\t\tfor index, value := range formattedValues {\n\t\t\t\t\tplaceholder := fmt.Sprintf(`\\$%d([^\\d]|$)`, index+1)\n\t\t\t\t\tsql = regexp.MustCompile(placeholder).ReplaceAllString(sql, value+\"$1\")\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tformattedValuesLength := len(formattedValues)\n\t\t\t\tfor index, value := range sqlRegexp.Split(values[3].(string), -1) {\n\t\t\t\t\tsql += value\n\t\t\t\t\tif index < formattedValuesLength {\n\t\t\t\t\t\tsql += formattedValues[index]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmessages = append(messages, sql)\n\t\t\tmessages = append(messages, fmt.Sprintf(\" \\n\\033[36;31m[%v]\\033[0m \", strconv.FormatInt(values[5].(int64), 10)+\" rows affected or returned \"))\n\t\t} else {\n\t\t\tmessages = append(messages, \"\\033[31;1m\")\n\t\t\tmessages = append(messages, values[2:]...)\n\t\t\tmessages = append(messages, \"\\033[0m\")\n\t\t}\n\t}\n\n\treturn\n}\n\ntype logger interface {\n\tPrint(v ...interface{})\n}\n\n// LogWriter log writer interface\ntype LogWriter interface {\n\tPrintln(v ...interface{})\n}\n\n// Logger default logger\ntype Logger struct {\n\tLogWriter\n}\n\n// Print format & print log\nfunc (logger Logger) Print(values ...interface{}) {\n\tlogger.Println(LogFormatter(values...)...)\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/main.go", "content": "package gorm\n\nimport (\n\t\"database/sql\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n)\n\n// DB contains information for current db connection\ntype DB struct {\n\tValue interface{}\n\tError error\n\tRowsAffected int64\n\n\t// single db\n\tdb SQLCommon\n\tblockGlobalUpdate bool\n\tlogMode int\n\tlogger logger\n\tsearch *search\n\tvalues map[string]interface{}\n\n\t// global db\n\tparent *DB\n\tcallbacks *Callback\n\tdialect Dialect\n\tsingularTable bool\n}\n\n// Open initialize a new db connection, need to import driver first, e.g:\n//\n// import _ \"github.com/go-sql-driver/mysql\"\n// func main() {\n// db, err := gorm.Open(\"mysql\", \"user:password@/dbname?charset=utf8&parseTime=True&loc=Local\")\n// }\n// GORM has wrapped some drivers, for easier to remember driver's import path, so you could import the mysql driver with\n// import _ \"github.com/jinzhu/gorm/dialects/mysql\"\n// // import _ \"github.com/jinzhu/gorm/dialects/postgres\"\n// // import _ \"github.com/jinzhu/gorm/dialects/sqlite\"\n// // import _ \"github.com/jinzhu/gorm/dialects/mssql\"\nfunc Open(dialect string, args ...interface{}) (db *DB, err error) {\n\tif len(args) == 0 {\n\t\terr = errors.New(\"invalid database source\")\n\t\treturn nil, err\n\t}\n\tvar source string\n\tvar dbSQL SQLCommon\n\n\tswitch value := args[0].(type) {\n\tcase string:\n\t\tvar driver = dialect\n\t\tif len(args) == 1 {\n\t\t\tsource = value\n\t\t} else if len(args) >= 2 {\n\t\t\tdriver = value\n\t\t\tsource = args[1].(string)\n\t\t}\n\t\tdbSQL, err = sql.Open(driver, source)\n\tcase SQLCommon:\n\t\tdbSQL = value\n\t}\n\n\tdb = &DB{\n\t\tdb: dbSQL,\n\t\tlogger: defaultLogger,\n\t\tvalues: map[string]interface{}{},\n\t\tcallbacks: DefaultCallback,\n\t\tdialect: newDialect(dialect, dbSQL),\n\t}\n\tdb.parent = db\n\tif err != nil {\n\t\treturn\n\t}\n\t// Send a ping to make sure the database connection is alive.\n\tif d, ok := dbSQL.(*sql.DB); ok {\n\t\tif err = d.Ping(); err != nil {\n\t\t\td.Close()\n\t\t}\n\t}\n\treturn\n}\n\n// New clone a new db connection without search conditions\nfunc (s *DB) New() *DB {\n\tclone := s.clone()\n\tclone.search = nil\n\tclone.Value = nil\n\treturn clone\n}\n\ntype closer interface {\n\tClose() error\n}\n\n// Close close current db connection. If database connection is not an io.Closer, returns an error.\nfunc (s *DB) Close() error {\n\tif db, ok := s.parent.db.(closer); ok {\n\t\treturn db.Close()\n\t}\n\treturn errors.New(\"can't close current db\")\n}\n\n// DB get `*sql.DB` from current connection\n// If the underlying database connection is not a *sql.DB, returns nil\nfunc (s *DB) DB() *sql.DB {\n\tdb, _ := s.db.(*sql.DB)\n\treturn db\n}\n\n// CommonDB return the underlying `*sql.DB` or `*sql.Tx` instance, mainly intended to allow coexistence with legacy non-GORM code.\nfunc (s *DB) CommonDB() SQLCommon {\n\treturn s.db\n}\n\n// Dialect get dialect\nfunc (s *DB) Dialect() Dialect {\n\treturn s.parent.dialect\n}\n\n// Callback return `Callbacks` container, you could add/change/delete callbacks with it\n// db.Callback().Create().Register(\"update_created_at\", updateCreated)\n// Refer https://jinzhu.github.io/gorm/development.html#callbacks\nfunc (s *DB) Callback() *Callback {\n\ts.parent.callbacks = s.parent.callbacks.clone()\n\treturn s.parent.callbacks\n}\n\n// SetLogger replace default logger\nfunc (s *DB) SetLogger(log logger) {\n\ts.logger = log\n}\n\n// LogMode set log mode, `true` for detailed logs, `false` for no log, default, will only print error logs\nfunc (s *DB) LogMode(enable bool) *DB {\n\tif enable {\n\t\ts.logMode = 2\n\t} else {\n\t\ts.logMode = 1\n\t}\n\treturn s\n}\n\n// BlockGlobalUpdate if true, generates an error on update/delete without where clause.\n// This is to prevent eventual error with empty objects updates/deletions\nfunc (s *DB) BlockGlobalUpdate(enable bool) *DB {\n\ts.blockGlobalUpdate = enable\n\treturn s\n}\n\n// HasBlockGlobalUpdate return state of block\nfunc (s *DB) HasBlockGlobalUpdate() bool {\n\treturn s.blockGlobalUpdate\n}\n\n// SingularTable use singular table by default\nfunc (s *DB) SingularTable(enable bool) {\n\tmodelStructsMap = newModelStructsMap()\n\ts.parent.singularTable = enable\n}\n\n// NewScope create a scope for current operation\nfunc (s *DB) NewScope(value interface{}) *Scope {\n\tdbClone := s.clone()\n\tdbClone.Value = value\n\treturn &Scope{db: dbClone, Search: dbClone.search.clone(), Value: value}\n}\n\n// QueryExpr returns the query as expr object\nfunc (s *DB) QueryExpr() *expr {\n\tscope := s.NewScope(s.Value)\n\tscope.InstanceSet(\"skip_bindvar\", true)\n\tscope.prepareQuerySQL()\n\n\treturn Expr(scope.SQL, scope.SQLVars...)\n}\n\n// Where return a new relation, filter records with given conditions, accepts `map`, `struct` or `string` as conditions, refer http://jinzhu.github.io/gorm/crud.html#query\nfunc (s *DB) Where(query interface{}, args ...interface{}) *DB {\n\treturn s.clone().search.Where(query, args...).db\n}\n\n// Or filter records that match before conditions or this one, similar to `Where`\nfunc (s *DB) Or(query interface{}, args ...interface{}) *DB {\n\treturn s.clone().search.Or(query, args...).db\n}\n\n// Not filter records that don't match current conditions, similar to `Where`\nfunc (s *DB) Not(query interface{}, args ...interface{}) *DB {\n\treturn s.clone().search.Not(query, args...).db\n}\n\n// Limit specify the number of records to be retrieved\nfunc (s *DB) Limit(limit interface{}) *DB {\n\treturn s.clone().search.Limit(limit).db\n}\n\n// Offset specify the number of records to skip before starting to return the records\nfunc (s *DB) Offset(offset interface{}) *DB {\n\treturn s.clone().search.Offset(offset).db\n}\n\n// Order specify order when retrieve records from database, set reorder to `true` to overwrite defined conditions\n// db.Order(\"name DESC\")\n// db.Order(\"name DESC\", true) // reorder\n// db.Order(gorm.Expr(\"name = ? DESC\", \"first\")) // sql expression\nfunc (s *DB) Order(value interface{}, reorder ...bool) *DB {\n\treturn s.clone().search.Order(value, reorder...).db\n}\n\n// Select specify fields that you want to retrieve from database when querying, by default, will select all fields;\n// When creating/updating, specify fields that you want to save to database\nfunc (s *DB) Select(query interface{}, args ...interface{}) *DB {\n\treturn s.clone().search.Select(query, args...).db\n}\n\n// Omit specify fields that you want to ignore when saving to database for creating, updating\nfunc (s *DB) Omit(columns ...string) *DB {\n\treturn s.clone().search.Omit(columns...).db\n}\n\n// Group specify the group method on the find\nfunc (s *DB) Group(query string) *DB {\n\treturn s.clone().search.Group(query).db\n}\n\n// Having specify HAVING conditions for GROUP BY\nfunc (s *DB) Having(query interface{}, values ...interface{}) *DB {\n\treturn s.clone().search.Having(query, values...).db\n}\n\n// Joins specify Joins conditions\n// db.Joins(\"JOIN emails ON emails.user_id = users.id AND emails.email = ?\", \"jinzhu@example.org\").Find(&user)\nfunc (s *DB) Joins(query string, args ...interface{}) *DB {\n\treturn s.clone().search.Joins(query, args...).db\n}\n\n// Scopes pass current database connection to arguments `func(*DB) *DB`, which could be used to add conditions dynamically\n// func AmountGreaterThan1000(db *gorm.DB) *gorm.DB {\n// return db.Where(\"amount > ?\", 1000)\n// }\n//\n// func OrderStatus(status []string) func (db *gorm.DB) *gorm.DB {\n// return func (db *gorm.DB) *gorm.DB {\n// return db.Scopes(AmountGreaterThan1000).Where(\"status in (?)\", status)\n// }\n// }\n//\n// db.Scopes(AmountGreaterThan1000, OrderStatus([]string{\"paid\", \"shipped\"})).Find(&orders)\n// Refer https://jinzhu.github.io/gorm/crud.html#scopes\nfunc (s *DB) Scopes(funcs ...func(*DB) *DB) *DB {\n\tfor _, f := range funcs {\n\t\ts = f(s)\n\t}\n\treturn s\n}\n\n// Unscoped return all record including deleted record, refer Soft Delete https://jinzhu.github.io/gorm/crud.html#soft-delete\nfunc (s *DB) Unscoped() *DB {\n\treturn s.clone().search.unscoped().db\n}\n\n// Attrs initialize struct with argument if record not found with `FirstOrInit` https://jinzhu.github.io/gorm/crud.html#firstorinit or `FirstOrCreate` https://jinzhu.github.io/gorm/crud.html#firstorcreate\nfunc (s *DB) Attrs(attrs ...interface{}) *DB {\n\treturn s.clone().search.Attrs(attrs...).db\n}\n\n// Assign assign result with argument regardless it is found or not with `FirstOrInit` https://jinzhu.github.io/gorm/crud.html#firstorinit or `FirstOrCreate` https://jinzhu.github.io/gorm/crud.html#firstorcreate\nfunc (s *DB) Assign(attrs ...interface{}) *DB {\n\treturn s.clone().search.Assign(attrs...).db\n}\n\n// First find first record that match given conditions, order by primary key\nfunc (s *DB) First(out interface{}, where ...interface{}) *DB {\n\tnewScope := s.NewScope(out)\n\tnewScope.Search.Limit(1)\n\treturn newScope.Set(\"gorm:order_by_primary_key\", \"ASC\").\n\t\tinlineCondition(where...).callCallbacks(s.parent.callbacks.queries).db\n}\n\n// Take return a record that match given conditions, the order will depend on the database implementation\nfunc (s *DB) Take(out interface{}, where ...interface{}) *DB {\n\tnewScope := s.NewScope(out)\n\tnewScope.Search.Limit(1)\n\treturn newScope.inlineCondition(where...).callCallbacks(s.parent.callbacks.queries).db\n}\n\n// Last find last record that match given conditions, order by primary key\nfunc (s *DB) Last(out interface{}, where ...interface{}) *DB {\n\tnewScope := s.NewScope(out)\n\tnewScope.Search.Limit(1)\n\treturn newScope.Set(\"gorm:order_by_primary_key\", \"DESC\").\n\t\tinlineCondition(where...).callCallbacks(s.parent.callbacks.queries).db\n}\n\n// Find find records that match given conditions\nfunc (s *DB) Find(out interface{}, where ...interface{}) *DB {\n\treturn s.NewScope(out).inlineCondition(where...).callCallbacks(s.parent.callbacks.queries).db\n}\n\n// Scan scan value to a struct\nfunc (s *DB) Scan(dest interface{}) *DB {\n\treturn s.NewScope(s.Value).Set(\"gorm:query_destination\", dest).callCallbacks(s.parent.callbacks.queries).db\n}\n\n// Row return `*sql.Row` with given conditions\nfunc (s *DB) Row() *sql.Row {\n\treturn s.NewScope(s.Value).row()\n}\n\n// Rows return `*sql.Rows` with given conditions\nfunc (s *DB) Rows() (*sql.Rows, error) {\n\treturn s.NewScope(s.Value).rows()\n}\n\n// ScanRows scan `*sql.Rows` to give struct\nfunc (s *DB) ScanRows(rows *sql.Rows, result interface{}) error {\n\tvar (\n\t\tscope = s.NewScope(result)\n\t\tclone = scope.db\n\t\tcolumns, err = rows.Columns()\n\t)\n\n\tif clone.AddError(err) == nil {\n\t\tscope.scan(rows, columns, scope.Fields())\n\t}\n\n\treturn clone.Error\n}\n\n// Pluck used to query single column from a model as a map\n// var ages []int64\n// db.Find(&users).Pluck(\"age\", &ages)\nfunc (s *DB) Pluck(column string, value interface{}) *DB {\n\treturn s.NewScope(s.Value).pluck(column, value).db\n}\n\n// Count get how many records for a model\nfunc (s *DB) Count(value interface{}) *DB {\n\treturn s.NewScope(s.Value).count(value).db\n}\n\n// Related get related associations\nfunc (s *DB) Related(value interface{}, foreignKeys ...string) *DB {\n\treturn s.NewScope(s.Value).related(value, foreignKeys...).db\n}\n\n// FirstOrInit find first matched record or initialize a new one with given conditions (only works with struct, map conditions)\n// https://jinzhu.github.io/gorm/crud.html#firstorinit\nfunc (s *DB) FirstOrInit(out interface{}, where ...interface{}) *DB {\n\tc := s.clone()\n\tif result := c.First(out, where...); result.Error != nil {\n\t\tif !result.RecordNotFound() {\n\t\t\treturn result\n\t\t}\n\t\tc.NewScope(out).inlineCondition(where...).initialize()\n\t} else {\n\t\tc.NewScope(out).updatedAttrsWithValues(c.search.assignAttrs)\n\t}\n\treturn c\n}\n\n// FirstOrCreate find first matched record or create a new one with given conditions (only works with struct, map conditions)\n// https://jinzhu.github.io/gorm/crud.html#firstorcreate\nfunc (s *DB) FirstOrCreate(out interface{}, where ...interface{}) *DB {\n\tc := s.clone()\n\tif result := s.First(out, where...); result.Error != nil {\n\t\tif !result.RecordNotFound() {\n\t\t\treturn result\n\t\t}\n\t\treturn c.NewScope(out).inlineCondition(where...).initialize().callCallbacks(c.parent.callbacks.creates).db\n\t} else if len(c.search.assignAttrs) > 0 {\n\t\treturn c.NewScope(out).InstanceSet(\"gorm:update_interface\", c.search.assignAttrs).callCallbacks(c.parent.callbacks.updates).db\n\t}\n\treturn c\n}\n\n// Update update attributes with callbacks, refer: https://jinzhu.github.io/gorm/crud.html#update\nfunc (s *DB) Update(attrs ...interface{}) *DB {\n\treturn s.Updates(toSearchableMap(attrs...), true)\n}\n\n// Updates update attributes with callbacks, refer: https://jinzhu.github.io/gorm/crud.html#update\nfunc (s *DB) Updates(values interface{}, ignoreProtectedAttrs ...bool) *DB {\n\treturn s.NewScope(s.Value).\n\t\tSet(\"gorm:ignore_protected_attrs\", len(ignoreProtectedAttrs) > 0).\n\t\tInstanceSet(\"gorm:update_interface\", values).\n\t\tcallCallbacks(s.parent.callbacks.updates).db\n}\n\n// UpdateColumn update attributes without callbacks, refer: https://jinzhu.github.io/gorm/crud.html#update\nfunc (s *DB) UpdateColumn(attrs ...interface{}) *DB {\n\treturn s.UpdateColumns(toSearchableMap(attrs...))\n}\n\n// UpdateColumns update attributes without callbacks, refer: https://jinzhu.github.io/gorm/crud.html#update\nfunc (s *DB) UpdateColumns(values interface{}) *DB {\n\treturn s.NewScope(s.Value).\n\t\tSet(\"gorm:update_column\", true).\n\t\tSet(\"gorm:save_associations\", false).\n\t\tInstanceSet(\"gorm:update_interface\", values).\n\t\tcallCallbacks(s.parent.callbacks.updates).db\n}\n\n// Save update value in database, if the value doesn't have primary key, will insert it\nfunc (s *DB) Save(value interface{}) *DB {\n\tscope := s.NewScope(value)\n\tif !scope.PrimaryKeyZero() {\n\t\tnewDB := scope.callCallbacks(s.parent.callbacks.updates).db\n\t\tif newDB.Error == nil && newDB.RowsAffected == 0 {\n\t\t\treturn s.New().FirstOrCreate(value)\n\t\t}\n\t\treturn newDB\n\t}\n\treturn scope.callCallbacks(s.parent.callbacks.creates).db\n}\n\n// Create insert the value into database\nfunc (s *DB) Create(value interface{}) *DB {\n\tscope := s.NewScope(value)\n\treturn scope.callCallbacks(s.parent.callbacks.creates).db\n}\n\n// Delete delete value match given conditions, if the value has primary key, then will including the primary key as condition\nfunc (s *DB) Delete(value interface{}, where ...interface{}) *DB {\n\treturn s.NewScope(value).inlineCondition(where...).callCallbacks(s.parent.callbacks.deletes).db\n}\n\n// Raw use raw sql as conditions, won't run it unless invoked by other methods\n// db.Raw(\"SELECT name, age FROM users WHERE name = ?\", 3).Scan(&result)\nfunc (s *DB) Raw(sql string, values ...interface{}) *DB {\n\treturn s.clone().search.Raw(true).Where(sql, values...).db\n}\n\n// Exec execute raw sql\nfunc (s *DB) Exec(sql string, values ...interface{}) *DB {\n\tscope := s.NewScope(nil)\n\tgeneratedSQL := scope.buildCondition(map[string]interface{}{\"query\": sql, \"args\": values}, true)\n\tgeneratedSQL = strings.TrimSuffix(strings.TrimPrefix(generatedSQL, \"(\"), \")\")\n\tscope.Raw(generatedSQL)\n\treturn scope.Exec().db\n}\n\n// Model specify the model you would like to run db operations\n// // update all users's name to `hello`\n// db.Model(&User{}).Update(\"name\", \"hello\")\n// // if user's primary key is non-blank, will use it as condition, then will only update the user's name to `hello`\n// db.Model(&user).Update(\"name\", \"hello\")\nfunc (s *DB) Model(value interface{}) *DB {\n\tc := s.clone()\n\tc.Value = value\n\treturn c\n}\n\n// Table specify the table you would like to run db operations\nfunc (s *DB) Table(name string) *DB {\n\tclone := s.clone()\n\tclone.search.Table(name)\n\tclone.Value = nil\n\treturn clone\n}\n\n// Debug start debug mode\nfunc (s *DB) Debug() *DB {\n\treturn s.clone().LogMode(true)\n}\n\n// Begin begin a transaction\nfunc (s *DB) Begin() *DB {\n\tc := s.clone()\n\tif db, ok := c.db.(sqlDb); ok && db != nil {\n\t\ttx, err := db.Begin()\n\t\tc.db = interface{}(tx).(SQLCommon)\n\t\tc.AddError(err)\n\t} else {\n\t\tc.AddError(ErrCantStartTransaction)\n\t}\n\treturn c\n}\n\n// Commit commit a transaction\nfunc (s *DB) Commit() *DB {\n\tif db, ok := s.db.(sqlTx); ok && db != nil {\n\t\ts.AddError(db.Commit())\n\t} else {\n\t\ts.AddError(ErrInvalidTransaction)\n\t}\n\treturn s\n}\n\n// Rollback rollback a transaction\nfunc (s *DB) Rollback() *DB {\n\tif db, ok := s.db.(sqlTx); ok && db != nil {\n\t\ts.AddError(db.Rollback())\n\t} else {\n\t\ts.AddError(ErrInvalidTransaction)\n\t}\n\treturn s\n}\n\n// NewRecord check if value's primary key is blank\nfunc (s *DB) NewRecord(value interface{}) bool {\n\treturn s.NewScope(value).PrimaryKeyZero()\n}\n\n// RecordNotFound check if returning ErrRecordNotFound error\nfunc (s *DB) RecordNotFound() bool {\n\tfor _, err := range s.GetErrors() {\n\t\tif err == ErrRecordNotFound {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// CreateTable create table for models\nfunc (s *DB) CreateTable(models ...interface{}) *DB {\n\tdb := s.Unscoped()\n\tfor _, model := range models {\n\t\tdb = db.NewScope(model).createTable().db\n\t}\n\treturn db\n}\n\n// DropTable drop table for models\nfunc (s *DB) DropTable(values ...interface{}) *DB {\n\tdb := s.clone()\n\tfor _, value := range values {\n\t\tif tableName, ok := value.(string); ok {\n\t\t\tdb = db.Table(tableName)\n\t\t}\n\n\t\tdb = db.NewScope(value).dropTable().db\n\t}\n\treturn db\n}\n\n// DropTableIfExists drop table if it is exist\nfunc (s *DB) DropTableIfExists(values ...interface{}) *DB {\n\tdb := s.clone()\n\tfor _, value := range values {\n\t\tif s.HasTable(value) {\n\t\t\tdb.AddError(s.DropTable(value).Error)\n\t\t}\n\t}\n\treturn db\n}\n\n// HasTable check has table or not\nfunc (s *DB) HasTable(value interface{}) bool {\n\tvar (\n\t\tscope = s.NewScope(value)\n\t\ttableName string\n\t)\n\n\tif name, ok := value.(string); ok {\n\t\ttableName = name\n\t} else {\n\t\ttableName = scope.TableName()\n\t}\n\n\thas := scope.Dialect().HasTable(tableName)\n\ts.AddError(scope.db.Error)\n\treturn has\n}\n\n// AutoMigrate run auto migration for given models, will only add missing fields, won't delete/change current data\nfunc (s *DB) AutoMigrate(values ...interface{}) *DB {\n\tdb := s.Unscoped()\n\tfor _, value := range values {\n\t\tdb = db.NewScope(value).autoMigrate().db\n\t}\n\treturn db\n}\n\n// ModifyColumn modify column to type\nfunc (s *DB) ModifyColumn(column string, typ string) *DB {\n\tscope := s.NewScope(s.Value)\n\tscope.modifyColumn(column, typ)\n\treturn scope.db\n}\n\n// DropColumn drop a column\nfunc (s *DB) DropColumn(column string) *DB {\n\tscope := s.NewScope(s.Value)\n\tscope.dropColumn(column)\n\treturn scope.db\n}\n\n// AddIndex add index for columns with given name\nfunc (s *DB) AddIndex(indexName string, columns ...string) *DB {\n\tscope := s.Unscoped().NewScope(s.Value)\n\tscope.addIndex(false, indexName, columns...)\n\treturn scope.db\n}\n\n// AddUniqueIndex add unique index for columns with given name\nfunc (s *DB) AddUniqueIndex(indexName string, columns ...string) *DB {\n\tscope := s.Unscoped().NewScope(s.Value)\n\tscope.addIndex(true, indexName, columns...)\n\treturn scope.db\n}\n\n// RemoveIndex remove index with name\nfunc (s *DB) RemoveIndex(indexName string) *DB {\n\tscope := s.NewScope(s.Value)\n\tscope.removeIndex(indexName)\n\treturn scope.db\n}\n\n// AddForeignKey Add foreign key to the given scope, e.g:\n// db.Model(&User{}).AddForeignKey(\"city_id\", \"cities(id)\", \"RESTRICT\", \"RESTRICT\")\nfunc (s *DB) AddForeignKey(field string, dest string, onDelete string, onUpdate string) *DB {\n\tscope := s.NewScope(s.Value)\n\tscope.addForeignKey(field, dest, onDelete, onUpdate)\n\treturn scope.db\n}\n\n// RemoveForeignKey Remove foreign key from the given scope, e.g:\n// db.Model(&User{}).RemoveForeignKey(\"city_id\", \"cities(id)\")\nfunc (s *DB) RemoveForeignKey(field string, dest string) *DB {\n\tscope := s.clone().NewScope(s.Value)\n\tscope.removeForeignKey(field, dest)\n\treturn scope.db\n}\n\n// Association start `Association Mode` to handler relations things easir in that mode, refer: https://jinzhu.github.io/gorm/associations.html#association-mode\nfunc (s *DB) Association(column string) *Association {\n\tvar err error\n\tvar scope = s.Set(\"gorm:association:source\", s.Value).NewScope(s.Value)\n\n\tif primaryField := scope.PrimaryField(); primaryField.IsBlank {\n\t\terr = errors.New(\"primary key can't be nil\")\n\t} else {\n\t\tif field, ok := scope.FieldByName(column); ok {\n\t\t\tif field.Relationship == nil || len(field.Relationship.ForeignFieldNames) == 0 {\n\t\t\t\terr = fmt.Errorf(\"invalid association %v for %v\", column, scope.IndirectValue().Type())\n\t\t\t} else {\n\t\t\t\treturn &Association{scope: scope, column: column, field: field}\n\t\t\t}\n\t\t} else {\n\t\t\terr = fmt.Errorf(\"%v doesn't have column %v\", scope.IndirectValue().Type(), column)\n\t\t}\n\t}\n\n\treturn &Association{Error: err}\n}\n\n// Preload preload associations with given conditions\n// db.Preload(\"Orders\", \"state NOT IN (?)\", \"cancelled\").Find(&users)\nfunc (s *DB) Preload(column string, conditions ...interface{}) *DB {\n\treturn s.clone().search.Preload(column, conditions...).db\n}\n\n// Set set setting by name, which could be used in callbacks, will clone a new db, and update its setting\nfunc (s *DB) Set(name string, value interface{}) *DB {\n\treturn s.clone().InstantSet(name, value)\n}\n\n// InstantSet instant set setting, will affect current db\nfunc (s *DB) InstantSet(name string, value interface{}) *DB {\n\ts.values[name] = value\n\treturn s\n}\n\n// Get get setting by name\nfunc (s *DB) Get(name string) (value interface{}, ok bool) {\n\tvalue, ok = s.values[name]\n\treturn\n}\n\n// SetJoinTableHandler set a model's join table handler for a relation\nfunc (s *DB) SetJoinTableHandler(source interface{}, column string, handler JoinTableHandlerInterface) {\n\tscope := s.NewScope(source)\n\tfor _, field := range scope.GetModelStruct().StructFields {\n\t\tif field.Name == column || field.DBName == column {\n\t\t\tif many2many := field.TagSettings[\"MANY2MANY\"]; many2many != \"\" {\n\t\t\t\tsource := (&Scope{Value: source}).GetModelStruct().ModelType\n\t\t\t\tdestination := (&Scope{Value: reflect.New(field.Struct.Type).Interface()}).GetModelStruct().ModelType\n\t\t\t\thandler.Setup(field.Relationship, many2many, source, destination)\n\t\t\t\tfield.Relationship.JoinTableHandler = handler\n\t\t\t\tif table := handler.Table(s); scope.Dialect().HasTable(table) {\n\t\t\t\t\ts.Table(table).AutoMigrate(handler)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// AddError add error to the db\nfunc (s *DB) AddError(err error) error {\n\tif err != nil {\n\t\tif err != ErrRecordNotFound {\n\t\t\tif s.logMode == 0 {\n\t\t\t\tgo s.print(fileWithLineNum(), err)\n\t\t\t} else {\n\t\t\t\ts.log(err)\n\t\t\t}\n\n\t\t\terrors := Errors(s.GetErrors())\n\t\t\terrors = errors.Add(err)\n\t\t\tif len(errors) > 1 {\n\t\t\t\terr = errors\n\t\t\t}\n\t\t}\n\n\t\ts.Error = err\n\t}\n\treturn err\n}\n\n// GetErrors get happened errors from the db\nfunc (s *DB) GetErrors() []error {\n\tif errs, ok := s.Error.(Errors); ok {\n\t\treturn errs\n\t} else if s.Error != nil {\n\t\treturn []error{s.Error}\n\t}\n\treturn []error{}\n}\n\n////////////////////////////////////////////////////////////////////////////////\n// Private Methods For DB\n////////////////////////////////////////////////////////////////////////////////\n\nfunc (s *DB) clone() *DB {\n\tdb := &DB{\n\t\tdb: s.db,\n\t\tparent: s.parent,\n\t\tlogger: s.logger,\n\t\tlogMode: s.logMode,\n\t\tvalues: map[string]interface{}{},\n\t\tValue: s.Value,\n\t\tError: s.Error,\n\t\tblockGlobalUpdate: s.blockGlobalUpdate,\n\t}\n\n\tfor key, value := range s.values {\n\t\tdb.values[key] = value\n\t}\n\n\tif s.search == nil {\n\t\tdb.search = &search{limit: -1, offset: -1}\n\t} else {\n\t\tdb.search = s.search.clone()\n\t}\n\n\tdb.search.db = db\n\treturn db\n}\n\nfunc (s *DB) print(v ...interface{}) {\n\ts.logger.Print(v...)\n}\n\nfunc (s *DB) log(v ...interface{}) {\n\tif s != nil && s.logMode == 2 {\n\t\ts.print(append([]interface{}{\"log\", fileWithLineNum()}, v...)...)\n\t}\n}\n\nfunc (s *DB) slog(sql string, t time.Time, vars ...interface{}) {\n\tif s.logMode == 2 {\n\t\ts.print(\"sql\", fileWithLineNum(), NowFunc().Sub(t), sql, vars, s.RowsAffected)\n\t}\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/model.go", "content": "package gorm\n\nimport \"time\"\n\n// Model base model definition, including fields `ID`, `CreatedAt`, `UpdatedAt`, `DeletedAt`, which could be embedded in your models\n// type User struct {\n// gorm.Model\n// }\ntype Model struct {\n\tID uint `gorm:\"primary_key\"`\n\tCreatedAt time.Time\n\tUpdatedAt time.Time\n\tDeletedAt *time.Time `sql:\"index\"`\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/model_struct.go", "content": "package gorm\n\nimport (\n\t\"database/sql\"\n\t\"errors\"\n\t\"go/ast\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n\n\t\"github.com/jinzhu/inflection\"\n)\n\n// DefaultTableNameHandler default table name handler\nvar DefaultTableNameHandler = func(db *DB, defaultTableName string) string {\n\treturn defaultTableName\n}\n\ntype safeModelStructsMap struct {\n\tm map[reflect.Type]*ModelStruct\n\tl *sync.RWMutex\n}\n\nfunc (s *safeModelStructsMap) Set(key reflect.Type, value *ModelStruct) {\n\ts.l.Lock()\n\tdefer s.l.Unlock()\n\ts.m[key] = value\n}\n\nfunc (s *safeModelStructsMap) Get(key reflect.Type) *ModelStruct {\n\ts.l.RLock()\n\tdefer s.l.RUnlock()\n\treturn s.m[key]\n}\n\nfunc newModelStructsMap() *safeModelStructsMap {\n\treturn &safeModelStructsMap{l: new(sync.RWMutex), m: make(map[reflect.Type]*ModelStruct)}\n}\n\nvar modelStructsMap = newModelStructsMap()\n\n// ModelStruct model definition\ntype ModelStruct struct {\n\tPrimaryFields []*StructField\n\tStructFields []*StructField\n\tModelType reflect.Type\n\tdefaultTableName string\n}\n\n// TableName get model's table name\nfunc (s *ModelStruct) TableName(db *DB) string {\n\tif s.defaultTableName == \"\" && db != nil && s.ModelType != nil {\n\t\t// Set default table name\n\t\tif tabler, ok := reflect.New(s.ModelType).Interface().(tabler); ok {\n\t\t\ts.defaultTableName = tabler.TableName()\n\t\t} else {\n\t\t\ttableName := ToDBName(s.ModelType.Name())\n\t\t\tif db == nil || !db.parent.singularTable {\n\t\t\t\ttableName = inflection.Plural(tableName)\n\t\t\t}\n\t\t\ts.defaultTableName = tableName\n\t\t}\n\t}\n\n\treturn DefaultTableNameHandler(db, s.defaultTableName)\n}\n\n// StructField model field's struct definition\ntype StructField struct {\n\tDBName string\n\tName string\n\tNames []string\n\tIsPrimaryKey bool\n\tIsNormal bool\n\tIsIgnored bool\n\tIsScanner bool\n\tHasDefaultValue bool\n\tTag reflect.StructTag\n\tTagSettings map[string]string\n\tStruct reflect.StructField\n\tIsForeignKey bool\n\tRelationship *Relationship\n}\n\nfunc (structField *StructField) clone() *StructField {\n\tclone := &StructField{\n\t\tDBName: structField.DBName,\n\t\tName: structField.Name,\n\t\tNames: structField.Names,\n\t\tIsPrimaryKey: structField.IsPrimaryKey,\n\t\tIsNormal: structField.IsNormal,\n\t\tIsIgnored: structField.IsIgnored,\n\t\tIsScanner: structField.IsScanner,\n\t\tHasDefaultValue: structField.HasDefaultValue,\n\t\tTag: structField.Tag,\n\t\tTagSettings: map[string]string{},\n\t\tStruct: structField.Struct,\n\t\tIsForeignKey: structField.IsForeignKey,\n\t}\n\n\tif structField.Relationship != nil {\n\t\trelationship := *structField.Relationship\n\t\tclone.Relationship = &relationship\n\t}\n\n\tfor key, value := range structField.TagSettings {\n\t\tclone.TagSettings[key] = value\n\t}\n\n\treturn clone\n}\n\n// Relationship described the relationship between models\ntype Relationship struct {\n\tKind string\n\tPolymorphicType string\n\tPolymorphicDBName string\n\tPolymorphicValue string\n\tForeignFieldNames []string\n\tForeignDBNames []string\n\tAssociationForeignFieldNames []string\n\tAssociationForeignDBNames []string\n\tJoinTableHandler JoinTableHandlerInterface\n}\n\nfunc getForeignField(column string, fields []*StructField) *StructField {\n\tfor _, field := range fields {\n\t\tif field.Name == column || field.DBName == column || field.DBName == ToDBName(column) {\n\t\t\treturn field\n\t\t}\n\t}\n\treturn nil\n}\n\n// GetModelStruct get value's model struct, relationships based on struct and tag definition\nfunc (scope *Scope) GetModelStruct() *ModelStruct {\n\tvar modelStruct ModelStruct\n\t// Scope value can't be nil\n\tif scope.Value == nil {\n\t\treturn &modelStruct\n\t}\n\n\treflectType := reflect.ValueOf(scope.Value).Type()\n\tfor reflectType.Kind() == reflect.Slice || reflectType.Kind() == reflect.Ptr {\n\t\treflectType = reflectType.Elem()\n\t}\n\n\t// Scope value need to be a struct\n\tif reflectType.Kind() != reflect.Struct {\n\t\treturn &modelStruct\n\t}\n\n\t// Get Cached model struct\n\tif value := modelStructsMap.Get(reflectType); value != nil {\n\t\treturn value\n\t}\n\n\tmodelStruct.ModelType = reflectType\n\n\t// Get all fields\n\tfor i := 0; i < reflectType.NumField(); i++ {\n\t\tif fieldStruct := reflectType.Field(i); ast.IsExported(fieldStruct.Name) {\n\t\t\tfield := &StructField{\n\t\t\t\tStruct: fieldStruct,\n\t\t\t\tName: fieldStruct.Name,\n\t\t\t\tNames: []string{fieldStruct.Name},\n\t\t\t\tTag: fieldStruct.Tag,\n\t\t\t\tTagSettings: parseTagSetting(fieldStruct.Tag),\n\t\t\t}\n\n\t\t\t// is ignored field\n\t\t\tif _, ok := field.TagSettings[\"-\"]; ok {\n\t\t\t\tfield.IsIgnored = true\n\t\t\t} else {\n\t\t\t\tif _, ok := field.TagSettings[\"PRIMARY_KEY\"]; ok {\n\t\t\t\t\tfield.IsPrimaryKey = true\n\t\t\t\t\tmodelStruct.PrimaryFields = append(modelStruct.PrimaryFields, field)\n\t\t\t\t}\n\n\t\t\t\tif _, ok := field.TagSettings[\"DEFAULT\"]; ok {\n\t\t\t\t\tfield.HasDefaultValue = true\n\t\t\t\t}\n\n\t\t\t\tif _, ok := field.TagSettings[\"AUTO_INCREMENT\"]; ok && !field.IsPrimaryKey {\n\t\t\t\t\tfield.HasDefaultValue = true\n\t\t\t\t}\n\n\t\t\t\tindirectType := fieldStruct.Type\n\t\t\t\tfor indirectType.Kind() == reflect.Ptr {\n\t\t\t\t\tindirectType = indirectType.Elem()\n\t\t\t\t}\n\n\t\t\t\tfieldValue := reflect.New(indirectType).Interface()\n\t\t\t\tif _, isScanner := fieldValue.(sql.Scanner); isScanner {\n\t\t\t\t\t// is scanner\n\t\t\t\t\tfield.IsScanner, field.IsNormal = true, true\n\t\t\t\t\tif indirectType.Kind() == reflect.Struct {\n\t\t\t\t\t\tfor i := 0; i < indirectType.NumField(); i++ {\n\t\t\t\t\t\t\tfor key, value := range parseTagSetting(indirectType.Field(i).Tag) {\n\t\t\t\t\t\t\t\tif _, ok := field.TagSettings[key]; !ok {\n\t\t\t\t\t\t\t\t\tfield.TagSettings[key] = value\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if _, isTime := fieldValue.(*time.Time); isTime {\n\t\t\t\t\t// is time\n\t\t\t\t\tfield.IsNormal = true\n\t\t\t\t} else if _, ok := field.TagSettings[\"EMBEDDED\"]; ok || fieldStruct.Anonymous {\n\t\t\t\t\t// is embedded struct\n\t\t\t\t\tfor _, subField := range scope.New(fieldValue).GetModelStruct().StructFields {\n\t\t\t\t\t\tsubField = subField.clone()\n\t\t\t\t\t\tsubField.Names = append([]string{fieldStruct.Name}, subField.Names...)\n\t\t\t\t\t\tif prefix, ok := field.TagSettings[\"EMBEDDED_PREFIX\"]; ok {\n\t\t\t\t\t\t\tsubField.DBName = prefix + subField.DBName\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif subField.IsPrimaryKey {\n\t\t\t\t\t\t\tif _, ok := subField.TagSettings[\"PRIMARY_KEY\"]; ok {\n\t\t\t\t\t\t\t\tmodelStruct.PrimaryFields = append(modelStruct.PrimaryFields, subField)\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tsubField.IsPrimaryKey = false\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif subField.Relationship != nil && subField.Relationship.JoinTableHandler != nil {\n\t\t\t\t\t\t\tif joinTableHandler, ok := subField.Relationship.JoinTableHandler.(*JoinTableHandler); ok {\n\t\t\t\t\t\t\t\tnewJoinTableHandler := &JoinTableHandler{}\n\t\t\t\t\t\t\t\tnewJoinTableHandler.Setup(subField.Relationship, joinTableHandler.TableName, reflectType, joinTableHandler.Destination.ModelType)\n\t\t\t\t\t\t\t\tsubField.Relationship.JoinTableHandler = newJoinTableHandler\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tmodelStruct.StructFields = append(modelStruct.StructFields, subField)\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t} else {\n\t\t\t\t\t// build relationships\n\t\t\t\t\tswitch indirectType.Kind() {\n\t\t\t\t\tcase reflect.Slice:\n\t\t\t\t\t\tdefer func(field *StructField) {\n\t\t\t\t\t\t\tvar (\n\t\t\t\t\t\t\t\trelationship = &Relationship{}\n\t\t\t\t\t\t\t\ttoScope = scope.New(reflect.New(field.Struct.Type).Interface())\n\t\t\t\t\t\t\t\tforeignKeys []string\n\t\t\t\t\t\t\t\tassociationForeignKeys []string\n\t\t\t\t\t\t\t\telemType = field.Struct.Type\n\t\t\t\t\t\t\t)\n\n\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\tforeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"ASSOCIATION_FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\tassociationForeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t} else if foreignKey := field.TagSettings[\"ASSOCIATIONFOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\tassociationForeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tfor elemType.Kind() == reflect.Slice || elemType.Kind() == reflect.Ptr {\n\t\t\t\t\t\t\t\telemType = elemType.Elem()\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif elemType.Kind() == reflect.Struct {\n\t\t\t\t\t\t\t\tif many2many := field.TagSettings[\"MANY2MANY\"]; many2many != \"\" {\n\t\t\t\t\t\t\t\t\trelationship.Kind = \"many_to_many\"\n\n\t\t\t\t\t\t\t\t\t{ // Foreign Keys for Source\n\t\t\t\t\t\t\t\t\t\tjoinTableDBNames := []string{}\n\n\t\t\t\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"JOINTABLE_FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\t\t\t\tjoinTableDBNames = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\t// if no foreign keys defined with tag\n\t\t\t\t\t\t\t\t\t\tif len(foreignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\t\tfor _, field := range modelStruct.PrimaryFields {\n\t\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, field.DBName)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tfor idx, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(foreignKey, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t// source foreign keys (db names)\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignFieldNames = append(relationship.ForeignFieldNames, foreignField.DBName)\n\n\t\t\t\t\t\t\t\t\t\t\t\t// setup join table foreign keys for source\n\t\t\t\t\t\t\t\t\t\t\t\tif len(joinTableDBNames) > idx {\n\t\t\t\t\t\t\t\t\t\t\t\t\t// if defined join table's foreign key\n\t\t\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignDBNames = append(relationship.ForeignDBNames, joinTableDBNames[idx])\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\t\tdefaultJointableForeignKey := ToDBName(reflectType.Name()) + \"_\" + foreignField.DBName\n\t\t\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignDBNames = append(relationship.ForeignDBNames, defaultJointableForeignKey)\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t{ // Foreign Keys for Association (Destination)\n\t\t\t\t\t\t\t\t\t\tassociationJoinTableDBNames := []string{}\n\n\t\t\t\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"ASSOCIATION_JOINTABLE_FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\t\t\t\tassociationJoinTableDBNames = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\t// if no association foreign keys defined with tag\n\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\t\tfor _, field := range toScope.PrimaryFields() {\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, field.DBName)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tfor idx, name := range associationForeignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif field, ok := toScope.FieldByName(name); ok {\n\t\t\t\t\t\t\t\t\t\t\t\t// association foreign keys (db names)\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignFieldNames = append(relationship.AssociationForeignFieldNames, field.DBName)\n\n\t\t\t\t\t\t\t\t\t\t\t\t// setup join table foreign keys for association\n\t\t\t\t\t\t\t\t\t\t\t\tif len(associationJoinTableDBNames) > idx {\n\t\t\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignDBNames = append(relationship.AssociationForeignDBNames, associationJoinTableDBNames[idx])\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\t\t// join table foreign keys for association\n\t\t\t\t\t\t\t\t\t\t\t\t\tjoinTableDBName := ToDBName(elemType.Name()) + \"_\" + field.DBName\n\t\t\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignDBNames = append(relationship.AssociationForeignDBNames, joinTableDBName)\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tjoinTableHandler := JoinTableHandler{}\n\t\t\t\t\t\t\t\t\tjoinTableHandler.Setup(relationship, many2many, reflectType, elemType)\n\t\t\t\t\t\t\t\t\trelationship.JoinTableHandler = &joinTableHandler\n\t\t\t\t\t\t\t\t\tfield.Relationship = relationship\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t// User has many comments, associationType is User, comment use UserID as foreign key\n\t\t\t\t\t\t\t\t\tvar associationType = reflectType.Name()\n\t\t\t\t\t\t\t\t\tvar toFields = toScope.GetStructFields()\n\t\t\t\t\t\t\t\t\trelationship.Kind = \"has_many\"\n\n\t\t\t\t\t\t\t\t\tif polymorphic := field.TagSettings[\"POLYMORPHIC\"]; polymorphic != \"\" {\n\t\t\t\t\t\t\t\t\t\t// Dog has many toys, tag polymorphic is Owner, then associationType is Owner\n\t\t\t\t\t\t\t\t\t\t// Toy use OwnerID, OwnerType ('dogs') as foreign key\n\t\t\t\t\t\t\t\t\t\tif polymorphicType := getForeignField(polymorphic+\"Type\", toFields); polymorphicType != nil {\n\t\t\t\t\t\t\t\t\t\t\tassociationType = polymorphic\n\t\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicType = polymorphicType.Name\n\t\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicDBName = polymorphicType.DBName\n\t\t\t\t\t\t\t\t\t\t\t// if Dog has multiple set of toys set name of the set (instead of default 'dogs')\n\t\t\t\t\t\t\t\t\t\t\tif value, ok := field.TagSettings[\"POLYMORPHIC_VALUE\"]; ok {\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicValue = value\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicValue = scope.TableName()\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tpolymorphicType.IsForeignKey = true\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// if no foreign keys defined with tag\n\t\t\t\t\t\t\t\t\tif len(foreignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\t// if no association foreign keys defined with tag\n\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\t\tfor _, field := range modelStruct.PrimaryFields {\n\t\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, associationType+field.Name)\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, field.Name)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t// generate foreign keys from defined association foreign keys\n\t\t\t\t\t\t\t\t\t\t\tfor _, scopeFieldName := range associationForeignKeys {\n\t\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(scopeFieldName, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, associationType+foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t// generate association foreign keys from foreign keys\n\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\t\tfor _, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\t\t\t\tif strings.HasPrefix(foreignKey, associationType) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKey := strings.TrimPrefix(foreignKey, associationType)\n\t\t\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(associationForeignKey, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, associationForeignKey)\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 && len(foreignKeys) == 1 {\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = []string{scope.PrimaryKey()}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t} else if len(foreignKeys) != len(associationForeignKeys) {\n\t\t\t\t\t\t\t\t\t\t\tscope.Err(errors.New(\"invalid foreign keys, should have same length\"))\n\t\t\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tfor idx, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(foreignKey, toFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\tif associationField := getForeignField(associationForeignKeys[idx], modelStruct.StructFields); associationField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t// source foreign keys\n\t\t\t\t\t\t\t\t\t\t\t\tforeignField.IsForeignKey = true\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignFieldNames = append(relationship.AssociationForeignFieldNames, associationField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignDBNames = append(relationship.AssociationForeignDBNames, associationField.DBName)\n\n\t\t\t\t\t\t\t\t\t\t\t\t// association foreign keys\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignFieldNames = append(relationship.ForeignFieldNames, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignDBNames = append(relationship.ForeignDBNames, foreignField.DBName)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tif len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t\t\t\t\t\tfield.Relationship = relationship\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tfield.IsNormal = true\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}(field)\n\t\t\t\t\tcase reflect.Struct:\n\t\t\t\t\t\tdefer func(field *StructField) {\n\t\t\t\t\t\t\tvar (\n\t\t\t\t\t\t\t\t// user has one profile, associationType is User, profile use UserID as foreign key\n\t\t\t\t\t\t\t\t// user belongs to profile, associationType is Profile, user use ProfileID as foreign key\n\t\t\t\t\t\t\t\tassociationType = reflectType.Name()\n\t\t\t\t\t\t\t\trelationship = &Relationship{}\n\t\t\t\t\t\t\t\ttoScope = scope.New(reflect.New(field.Struct.Type).Interface())\n\t\t\t\t\t\t\t\ttoFields = toScope.GetStructFields()\n\t\t\t\t\t\t\t\ttagForeignKeys []string\n\t\t\t\t\t\t\t\ttagAssociationForeignKeys []string\n\t\t\t\t\t\t\t)\n\n\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\ttagForeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif foreignKey := field.TagSettings[\"ASSOCIATION_FOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\ttagAssociationForeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t} else if foreignKey := field.TagSettings[\"ASSOCIATIONFOREIGNKEY\"]; foreignKey != \"\" {\n\t\t\t\t\t\t\t\ttagAssociationForeignKeys = strings.Split(foreignKey, \",\")\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif polymorphic := field.TagSettings[\"POLYMORPHIC\"]; polymorphic != \"\" {\n\t\t\t\t\t\t\t\t// Cat has one toy, tag polymorphic is Owner, then associationType is Owner\n\t\t\t\t\t\t\t\t// Toy use OwnerID, OwnerType ('cats') as foreign key\n\t\t\t\t\t\t\t\tif polymorphicType := getForeignField(polymorphic+\"Type\", toFields); polymorphicType != nil {\n\t\t\t\t\t\t\t\t\tassociationType = polymorphic\n\t\t\t\t\t\t\t\t\trelationship.PolymorphicType = polymorphicType.Name\n\t\t\t\t\t\t\t\t\trelationship.PolymorphicDBName = polymorphicType.DBName\n\t\t\t\t\t\t\t\t\t// if Cat has several different types of toys set name for each (instead of default 'cats')\n\t\t\t\t\t\t\t\t\tif value, ok := field.TagSettings[\"POLYMORPHIC_VALUE\"]; ok {\n\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicValue = value\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\trelationship.PolymorphicValue = scope.TableName()\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tpolymorphicType.IsForeignKey = true\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Has One\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tvar foreignKeys = tagForeignKeys\n\t\t\t\t\t\t\t\tvar associationForeignKeys = tagAssociationForeignKeys\n\t\t\t\t\t\t\t\t// if no foreign keys defined with tag\n\t\t\t\t\t\t\t\tif len(foreignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t// if no association foreign keys defined with tag\n\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\tfor _, primaryField := range modelStruct.PrimaryFields {\n\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, associationType+primaryField.Name)\n\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, primaryField.Name)\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t// generate foreign keys form association foreign keys\n\t\t\t\t\t\t\t\t\t\tfor _, associationForeignKey := range tagAssociationForeignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(associationForeignKey, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, associationType+foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t// generate association foreign keys from foreign keys\n\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\tfor _, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif strings.HasPrefix(foreignKey, associationType) {\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKey := strings.TrimPrefix(foreignKey, associationType)\n\t\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(associationForeignKey, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, associationForeignKey)\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 && len(foreignKeys) == 1 {\n\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = []string{scope.PrimaryKey()}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else if len(foreignKeys) != len(associationForeignKeys) {\n\t\t\t\t\t\t\t\t\t\tscope.Err(errors.New(\"invalid foreign keys, should have same length\"))\n\t\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor idx, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(foreignKey, toFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\tif scopeField := getForeignField(associationForeignKeys[idx], modelStruct.StructFields); scopeField != nil {\n\t\t\t\t\t\t\t\t\t\t\tforeignField.IsForeignKey = true\n\t\t\t\t\t\t\t\t\t\t\t// source foreign keys\n\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignFieldNames = append(relationship.AssociationForeignFieldNames, scopeField.Name)\n\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignDBNames = append(relationship.AssociationForeignDBNames, scopeField.DBName)\n\n\t\t\t\t\t\t\t\t\t\t\t// association foreign keys\n\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignFieldNames = append(relationship.ForeignFieldNames, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignDBNames = append(relationship.ForeignDBNames, foreignField.DBName)\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t\t\t\trelationship.Kind = \"has_one\"\n\t\t\t\t\t\t\t\tfield.Relationship = relationship\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tvar foreignKeys = tagForeignKeys\n\t\t\t\t\t\t\t\tvar associationForeignKeys = tagAssociationForeignKeys\n\n\t\t\t\t\t\t\t\tif len(foreignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t// generate foreign keys & association foreign keys\n\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\tfor _, primaryField := range toScope.PrimaryFields() {\n\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, field.Name+primaryField.Name)\n\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, primaryField.Name)\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t// generate foreign keys with association foreign keys\n\t\t\t\t\t\t\t\t\t\tfor _, associationForeignKey := range associationForeignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(associationForeignKey, toFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\tforeignKeys = append(foreignKeys, field.Name+foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t// generate foreign keys & association foreign keys\n\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 {\n\t\t\t\t\t\t\t\t\t\tfor _, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\t\t\tif strings.HasPrefix(foreignKey, field.Name) {\n\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKey := strings.TrimPrefix(foreignKey, field.Name)\n\t\t\t\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(associationForeignKey, toFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = append(associationForeignKeys, associationForeignKey)\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tif len(associationForeignKeys) == 0 && len(foreignKeys) == 1 {\n\t\t\t\t\t\t\t\t\t\t\tassociationForeignKeys = []string{toScope.PrimaryKey()}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else if len(foreignKeys) != len(associationForeignKeys) {\n\t\t\t\t\t\t\t\t\t\tscope.Err(errors.New(\"invalid foreign keys, should have same length\"))\n\t\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor idx, foreignKey := range foreignKeys {\n\t\t\t\t\t\t\t\t\tif foreignField := getForeignField(foreignKey, modelStruct.StructFields); foreignField != nil {\n\t\t\t\t\t\t\t\t\t\tif associationField := getForeignField(associationForeignKeys[idx], toFields); associationField != nil {\n\t\t\t\t\t\t\t\t\t\t\tforeignField.IsForeignKey = true\n\n\t\t\t\t\t\t\t\t\t\t\t// association foreign keys\n\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignFieldNames = append(relationship.AssociationForeignFieldNames, associationField.Name)\n\t\t\t\t\t\t\t\t\t\t\trelationship.AssociationForeignDBNames = append(relationship.AssociationForeignDBNames, associationField.DBName)\n\n\t\t\t\t\t\t\t\t\t\t\t// source foreign keys\n\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignFieldNames = append(relationship.ForeignFieldNames, foreignField.Name)\n\t\t\t\t\t\t\t\t\t\t\trelationship.ForeignDBNames = append(relationship.ForeignDBNames, foreignField.DBName)\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif len(relationship.ForeignFieldNames) != 0 {\n\t\t\t\t\t\t\t\t\trelationship.Kind = \"belongs_to\"\n\t\t\t\t\t\t\t\t\tfield.Relationship = relationship\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}(field)\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tfield.IsNormal = true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Even it is ignored, also possible to decode db value into the field\n\t\t\tif value, ok := field.TagSettings[\"COLUMN\"]; ok {\n\t\t\t\tfield.DBName = value\n\t\t\t} else {\n\t\t\t\tfield.DBName = ToDBName(fieldStruct.Name)\n\t\t\t}\n\n\t\t\tmodelStruct.StructFields = append(modelStruct.StructFields, field)\n\t\t}\n\t}\n\n\tif len(modelStruct.PrimaryFields) == 0 {\n\t\tif field := getForeignField(\"id\", modelStruct.StructFields); field != nil {\n\t\t\tfield.IsPrimaryKey = true\n\t\t\tmodelStruct.PrimaryFields = append(modelStruct.PrimaryFields, field)\n\t\t}\n\t}\n\n\tmodelStructsMap.Set(reflectType, &modelStruct)\n\n\treturn &modelStruct\n}\n\n// GetStructFields get model's field structs\nfunc (scope *Scope) GetStructFields() (fields []*StructField) {\n\treturn scope.GetModelStruct().StructFields\n}\n\nfunc parseTagSetting(tags reflect.StructTag) map[string]string {\n\tsetting := map[string]string{}\n\tfor _, str := range []string{tags.Get(\"sql\"), tags.Get(\"gorm\")} {\n\t\ttags := strings.Split(str, \";\")\n\t\tfor _, value := range tags {\n\t\t\tv := strings.Split(value, \":\")\n\t\t\tk := strings.TrimSpace(strings.ToUpper(v[0]))\n\t\t\tif len(v) >= 2 {\n\t\t\t\tsetting[k] = strings.Join(v[1:], \":\")\n\t\t\t} else {\n\t\t\t\tsetting[k] = k\n\t\t\t}\n\t\t}\n\t}\n\treturn setting\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/scope.go", "content": "package gorm\n\nimport (\n\t\"bytes\"\n\t\"database/sql\"\n\t\"database/sql/driver\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"strings\"\n\t\"time\"\n)\n\n// Scope contain current operation's information when you perform any operation on the database\ntype Scope struct {\n\tSearch *search\n\tValue interface{}\n\tSQL string\n\tSQLVars []interface{}\n\tdb *DB\n\tinstanceID string\n\tprimaryKeyField *Field\n\tskipLeft bool\n\tfields *[]*Field\n\tselectAttrs *[]string\n}\n\n// IndirectValue return scope's reflect value's indirect value\nfunc (scope *Scope) IndirectValue() reflect.Value {\n\treturn indirect(reflect.ValueOf(scope.Value))\n}\n\n// New create a new Scope without search information\nfunc (scope *Scope) New(value interface{}) *Scope {\n\treturn &Scope{db: scope.NewDB(), Search: &search{}, Value: value}\n}\n\n////////////////////////////////////////////////////////////////////////////////\n// Scope DB\n////////////////////////////////////////////////////////////////////////////////\n\n// DB return scope's DB connection\nfunc (scope *Scope) DB() *DB {\n\treturn scope.db\n}\n\n// NewDB create a new DB without search information\nfunc (scope *Scope) NewDB() *DB {\n\tif scope.db != nil {\n\t\tdb := scope.db.clone()\n\t\tdb.search = nil\n\t\tdb.Value = nil\n\t\treturn db\n\t}\n\treturn nil\n}\n\n// SQLDB return *sql.DB\nfunc (scope *Scope) SQLDB() SQLCommon {\n\treturn scope.db.db\n}\n\n// Dialect get dialect\nfunc (scope *Scope) Dialect() Dialect {\n\treturn scope.db.parent.dialect\n}\n\n// Quote used to quote string to escape them for database\nfunc (scope *Scope) Quote(str string) string {\n\tif strings.Index(str, \".\") != -1 {\n\t\tnewStrs := []string{}\n\t\tfor _, str := range strings.Split(str, \".\") {\n\t\t\tnewStrs = append(newStrs, scope.Dialect().Quote(str))\n\t\t}\n\t\treturn strings.Join(newStrs, \".\")\n\t}\n\n\treturn scope.Dialect().Quote(str)\n}\n\n// Err add error to Scope\nfunc (scope *Scope) Err(err error) error {\n\tif err != nil {\n\t\tscope.db.AddError(err)\n\t}\n\treturn err\n}\n\n// HasError check if there are any error\nfunc (scope *Scope) HasError() bool {\n\treturn scope.db.Error != nil\n}\n\n// Log print log message\nfunc (scope *Scope) Log(v ...interface{}) {\n\tscope.db.log(v...)\n}\n\n// SkipLeft skip remaining callbacks\nfunc (scope *Scope) SkipLeft() {\n\tscope.skipLeft = true\n}\n\n// Fields get value's fields\nfunc (scope *Scope) Fields() []*Field {\n\tif scope.fields == nil {\n\t\tvar (\n\t\t\tfields []*Field\n\t\t\tindirectScopeValue = scope.IndirectValue()\n\t\t\tisStruct = indirectScopeValue.Kind() == reflect.Struct\n\t\t)\n\n\t\tfor _, structField := range scope.GetModelStruct().StructFields {\n\t\t\tif isStruct {\n\t\t\t\tfieldValue := indirectScopeValue\n\t\t\t\tfor _, name := range structField.Names {\n\t\t\t\t\tif fieldValue.Kind() == reflect.Ptr && fieldValue.IsNil() {\n\t\t\t\t\t\tfieldValue.Set(reflect.New(fieldValue.Type().Elem()))\n\t\t\t\t\t}\n\t\t\t\t\tfieldValue = reflect.Indirect(fieldValue).FieldByName(name)\n\t\t\t\t}\n\t\t\t\tfields = append(fields, &Field{StructField: structField, Field: fieldValue, IsBlank: isBlank(fieldValue)})\n\t\t\t} else {\n\t\t\t\tfields = append(fields, &Field{StructField: structField, IsBlank: true})\n\t\t\t}\n\t\t}\n\t\tscope.fields = &fields\n\t}\n\n\treturn *scope.fields\n}\n\n// FieldByName find `gorm.Field` with field name or db name\nfunc (scope *Scope) FieldByName(name string) (field *Field, ok bool) {\n\tvar (\n\t\tdbName = ToDBName(name)\n\t\tmostMatchedField *Field\n\t)\n\n\tfor _, field := range scope.Fields() {\n\t\tif field.Name == name || field.DBName == name {\n\t\t\treturn field, true\n\t\t}\n\t\tif field.DBName == dbName {\n\t\t\tmostMatchedField = field\n\t\t}\n\t}\n\treturn mostMatchedField, mostMatchedField != nil\n}\n\n// PrimaryFields return scope's primary fields\nfunc (scope *Scope) PrimaryFields() (fields []*Field) {\n\tfor _, field := range scope.Fields() {\n\t\tif field.IsPrimaryKey {\n\t\t\tfields = append(fields, field)\n\t\t}\n\t}\n\treturn fields\n}\n\n// PrimaryField return scope's main primary field, if defined more that one primary fields, will return the one having column name `id` or the first one\nfunc (scope *Scope) PrimaryField() *Field {\n\tif primaryFields := scope.GetModelStruct().PrimaryFields; len(primaryFields) > 0 {\n\t\tif len(primaryFields) > 1 {\n\t\t\tif field, ok := scope.FieldByName(\"id\"); ok {\n\t\t\t\treturn field\n\t\t\t}\n\t\t}\n\t\treturn scope.PrimaryFields()[0]\n\t}\n\treturn nil\n}\n\n// PrimaryKey get main primary field's db name\nfunc (scope *Scope) PrimaryKey() string {\n\tif field := scope.PrimaryField(); field != nil {\n\t\treturn field.DBName\n\t}\n\treturn \"\"\n}\n\n// PrimaryKeyZero check main primary field's value is blank or not\nfunc (scope *Scope) PrimaryKeyZero() bool {\n\tfield := scope.PrimaryField()\n\treturn field == nil || field.IsBlank\n}\n\n// PrimaryKeyValue get the primary key's value\nfunc (scope *Scope) PrimaryKeyValue() interface{} {\n\tif field := scope.PrimaryField(); field != nil && field.Field.IsValid() {\n\t\treturn field.Field.Interface()\n\t}\n\treturn 0\n}\n\n// HasColumn to check if has column\nfunc (scope *Scope) HasColumn(column string) bool {\n\tfor _, field := range scope.GetStructFields() {\n\t\tif field.IsNormal && (field.Name == column || field.DBName == column) {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// SetColumn to set the column's value, column could be field or field's name/dbname\nfunc (scope *Scope) SetColumn(column interface{}, value interface{}) error {\n\tvar updateAttrs = map[string]interface{}{}\n\tif attrs, ok := scope.InstanceGet(\"gorm:update_attrs\"); ok {\n\t\tupdateAttrs = attrs.(map[string]interface{})\n\t\tdefer scope.InstanceSet(\"gorm:update_attrs\", updateAttrs)\n\t}\n\n\tif field, ok := column.(*Field); ok {\n\t\tupdateAttrs[field.DBName] = value\n\t\treturn field.Set(value)\n\t} else if name, ok := column.(string); ok {\n\t\tvar (\n\t\t\tdbName = ToDBName(name)\n\t\t\tmostMatchedField *Field\n\t\t)\n\t\tfor _, field := range scope.Fields() {\n\t\t\tif field.DBName == value {\n\t\t\t\tupdateAttrs[field.DBName] = value\n\t\t\t\treturn field.Set(value)\n\t\t\t}\n\t\t\tif (field.DBName == dbName) || (field.Name == name && mostMatchedField == nil) {\n\t\t\t\tmostMatchedField = field\n\t\t\t}\n\t\t}\n\n\t\tif mostMatchedField != nil {\n\t\t\tupdateAttrs[mostMatchedField.DBName] = value\n\t\t\treturn mostMatchedField.Set(value)\n\t\t}\n\t}\n\treturn errors.New(\"could not convert column to field\")\n}\n\n// CallMethod call scope value's method, if it is a slice, will call its element's method one by one\nfunc (scope *Scope) CallMethod(methodName string) {\n\tif scope.Value == nil {\n\t\treturn\n\t}\n\n\tif indirectScopeValue := scope.IndirectValue(); indirectScopeValue.Kind() == reflect.Slice {\n\t\tfor i := 0; i < indirectScopeValue.Len(); i++ {\n\t\t\tscope.callMethod(methodName, indirectScopeValue.Index(i))\n\t\t}\n\t} else {\n\t\tscope.callMethod(methodName, indirectScopeValue)\n\t}\n}\n\n// AddToVars add value as sql's vars, used to prevent SQL injection\nfunc (scope *Scope) AddToVars(value interface{}) string {\n\t_, skipBindVar := scope.InstanceGet(\"skip_bindvar\")\n\n\tif expr, ok := value.(*expr); ok {\n\t\texp := expr.expr\n\t\tfor _, arg := range expr.args {\n\t\t\tif skipBindVar {\n\t\t\t\tscope.AddToVars(arg)\n\t\t\t} else {\n\t\t\t\texp = strings.Replace(exp, \"?\", scope.AddToVars(arg), 1)\n\t\t\t}\n\t\t}\n\t\treturn exp\n\t}\n\n\tscope.SQLVars = append(scope.SQLVars, value)\n\n\tif skipBindVar {\n\t\treturn \"?\"\n\t}\n\treturn scope.Dialect().BindVar(len(scope.SQLVars))\n}\n\n// SelectAttrs return selected attributes\nfunc (scope *Scope) SelectAttrs() []string {\n\tif scope.selectAttrs == nil {\n\t\tattrs := []string{}\n\t\tfor _, value := range scope.Search.selects {\n\t\t\tif str, ok := value.(string); ok {\n\t\t\t\tattrs = append(attrs, str)\n\t\t\t} else if strs, ok := value.([]string); ok {\n\t\t\t\tattrs = append(attrs, strs...)\n\t\t\t} else if strs, ok := value.([]interface{}); ok {\n\t\t\t\tfor _, str := range strs {\n\t\t\t\t\tattrs = append(attrs, fmt.Sprintf(\"%v\", str))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tscope.selectAttrs = &attrs\n\t}\n\treturn *scope.selectAttrs\n}\n\n// OmitAttrs return omitted attributes\nfunc (scope *Scope) OmitAttrs() []string {\n\treturn scope.Search.omits\n}\n\ntype tabler interface {\n\tTableName() string\n}\n\ntype dbTabler interface {\n\tTableName(*DB) string\n}\n\n// TableName return table name\nfunc (scope *Scope) TableName() string {\n\tif scope.Search != nil && len(scope.Search.tableName) > 0 {\n\t\treturn scope.Search.tableName\n\t}\n\n\tif tabler, ok := scope.Value.(tabler); ok {\n\t\treturn tabler.TableName()\n\t}\n\n\tif tabler, ok := scope.Value.(dbTabler); ok {\n\t\treturn tabler.TableName(scope.db)\n\t}\n\n\treturn scope.GetModelStruct().TableName(scope.db.Model(scope.Value))\n}\n\n// QuotedTableName return quoted table name\nfunc (scope *Scope) QuotedTableName() (name string) {\n\tif scope.Search != nil && len(scope.Search.tableName) > 0 {\n\t\tif strings.Index(scope.Search.tableName, \" \") != -1 {\n\t\t\treturn scope.Search.tableName\n\t\t}\n\t\treturn scope.Quote(scope.Search.tableName)\n\t}\n\n\treturn scope.Quote(scope.TableName())\n}\n\n// CombinedConditionSql return combined condition sql\nfunc (scope *Scope) CombinedConditionSql() string {\n\tjoinSQL := scope.joinsSQL()\n\twhereSQL := scope.whereSQL()\n\tif scope.Search.raw {\n\t\twhereSQL = strings.TrimSuffix(strings.TrimPrefix(whereSQL, \"WHERE (\"), \")\")\n\t}\n\treturn joinSQL + whereSQL + scope.groupSQL() +\n\t\tscope.havingSQL() + scope.orderSQL() + scope.limitAndOffsetSQL()\n}\n\n// Raw set raw sql\nfunc (scope *Scope) Raw(sql string) *Scope {\n\tscope.SQL = strings.Replace(sql, \"$$$\", \"?\", -1)\n\treturn scope\n}\n\n// Exec perform generated SQL\nfunc (scope *Scope) Exec() *Scope {\n\tdefer scope.trace(NowFunc())\n\n\tif !scope.HasError() {\n\t\tif result, err := scope.SQLDB().Exec(scope.SQL, scope.SQLVars...); scope.Err(err) == nil {\n\t\t\tif count, err := result.RowsAffected(); scope.Err(err) == nil {\n\t\t\t\tscope.db.RowsAffected = count\n\t\t\t}\n\t\t}\n\t}\n\treturn scope\n}\n\n// Set set value by name\nfunc (scope *Scope) Set(name string, value interface{}) *Scope {\n\tscope.db.InstantSet(name, value)\n\treturn scope\n}\n\n// Get get setting by name\nfunc (scope *Scope) Get(name string) (interface{}, bool) {\n\treturn scope.db.Get(name)\n}\n\n// InstanceID get InstanceID for scope\nfunc (scope *Scope) InstanceID() string {\n\tif scope.instanceID == \"\" {\n\t\tscope.instanceID = fmt.Sprintf(\"%v%v\", &scope, &scope.db)\n\t}\n\treturn scope.instanceID\n}\n\n// InstanceSet set instance setting for current operation, but not for operations in callbacks, like saving associations callback\nfunc (scope *Scope) InstanceSet(name string, value interface{}) *Scope {\n\treturn scope.Set(name+scope.InstanceID(), value)\n}\n\n// InstanceGet get instance setting from current operation\nfunc (scope *Scope) InstanceGet(name string) (interface{}, bool) {\n\treturn scope.Get(name + scope.InstanceID())\n}\n\n// Begin start a transaction\nfunc (scope *Scope) Begin() *Scope {\n\tif db, ok := scope.SQLDB().(sqlDb); ok {\n\t\tif tx, err := db.Begin(); err == nil {\n\t\t\tscope.db.db = interface{}(tx).(SQLCommon)\n\t\t\tscope.InstanceSet(\"gorm:started_transaction\", true)\n\t\t}\n\t}\n\treturn scope\n}\n\n// CommitOrRollback commit current transaction if no error happened, otherwise will rollback it\nfunc (scope *Scope) CommitOrRollback() *Scope {\n\tif _, ok := scope.InstanceGet(\"gorm:started_transaction\"); ok {\n\t\tif db, ok := scope.db.db.(sqlTx); ok {\n\t\t\tif scope.HasError() {\n\t\t\t\tdb.Rollback()\n\t\t\t} else {\n\t\t\t\tscope.Err(db.Commit())\n\t\t\t}\n\t\t\tscope.db.db = scope.db.parent.db\n\t\t}\n\t}\n\treturn scope\n}\n\n////////////////////////////////////////////////////////////////////////////////\n// Private Methods For *gorm.Scope\n////////////////////////////////////////////////////////////////////////////////\n\nfunc (scope *Scope) callMethod(methodName string, reflectValue reflect.Value) {\n\t// Only get address from non-pointer\n\tif reflectValue.CanAddr() && reflectValue.Kind() != reflect.Ptr {\n\t\treflectValue = reflectValue.Addr()\n\t}\n\n\tif methodValue := reflectValue.MethodByName(methodName); methodValue.IsValid() {\n\t\tswitch method := methodValue.Interface().(type) {\n\t\tcase func():\n\t\t\tmethod()\n\t\tcase func(*Scope):\n\t\t\tmethod(scope)\n\t\tcase func(*DB):\n\t\t\tnewDB := scope.NewDB()\n\t\t\tmethod(newDB)\n\t\t\tscope.Err(newDB.Error)\n\t\tcase func() error:\n\t\t\tscope.Err(method())\n\t\tcase func(*Scope) error:\n\t\t\tscope.Err(method(scope))\n\t\tcase func(*DB) error:\n\t\t\tnewDB := scope.NewDB()\n\t\t\tscope.Err(method(newDB))\n\t\t\tscope.Err(newDB.Error)\n\t\tdefault:\n\t\t\tscope.Err(fmt.Errorf(\"unsupported function %v\", methodName))\n\t\t}\n\t}\n}\n\nvar (\n\tcolumnRegexp = regexp.MustCompile(\"^[a-zA-Z\\\\d]+(\\\\.[a-zA-Z\\\\d]+)*$\") // only match string like `name`, `users.name`\n\tisNumberRegexp = regexp.MustCompile(\"^\\\\s*\\\\d+\\\\s*$\") // match if string is number\n\tcomparisonRegexp = regexp.MustCompile(\"(?i) (=|<>|(>|<)(=?)|LIKE|IS|IN) \")\n\tcountingQueryRegexp = regexp.MustCompile(\"(?i)^count(.+)$\")\n)\n\nfunc (scope *Scope) quoteIfPossible(str string) string {\n\tif columnRegexp.MatchString(str) {\n\t\treturn scope.Quote(str)\n\t}\n\treturn str\n}\n\nfunc (scope *Scope) scan(rows *sql.Rows, columns []string, fields []*Field) {\n\tvar (\n\t\tignored interface{}\n\t\tvalues = make([]interface{}, len(columns))\n\t\tselectFields []*Field\n\t\tselectedColumnsMap = map[string]int{}\n\t\tresetFields = map[int]*Field{}\n\t)\n\n\tfor index, column := range columns {\n\t\tvalues[index] = &ignored\n\n\t\tselectFields = fields\n\t\tif idx, ok := selectedColumnsMap[column]; ok {\n\t\t\tselectFields = selectFields[idx+1:]\n\t\t}\n\n\t\tfor fieldIndex, field := range selectFields {\n\t\t\tif field.DBName == column {\n\t\t\t\tif field.Field.Kind() == reflect.Ptr {\n\t\t\t\t\tvalues[index] = field.Field.Addr().Interface()\n\t\t\t\t} else {\n\t\t\t\t\treflectValue := reflect.New(reflect.PtrTo(field.Struct.Type))\n\t\t\t\t\treflectValue.Elem().Set(field.Field.Addr())\n\t\t\t\t\tvalues[index] = reflectValue.Interface()\n\t\t\t\t\tresetFields[index] = field\n\t\t\t\t}\n\n\t\t\t\tselectedColumnsMap[column] = fieldIndex\n\n\t\t\t\tif field.IsNormal {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tscope.Err(rows.Scan(values...))\n\n\tfor index, field := range resetFields {\n\t\tif v := reflect.ValueOf(values[index]).Elem().Elem(); v.IsValid() {\n\t\t\tfield.Field.Set(v)\n\t\t}\n\t}\n}\n\nfunc (scope *Scope) primaryCondition(value interface{}) string {\n\treturn fmt.Sprintf(\"(%v.%v = %v)\", scope.QuotedTableName(), scope.Quote(scope.PrimaryKey()), value)\n}\n\nfunc (scope *Scope) buildCondition(clause map[string]interface{}, include bool) (str string) {\n\tvar (\n\t\tquotedTableName = scope.QuotedTableName()\n\t\tquotedPrimaryKey = scope.Quote(scope.PrimaryKey())\n\t\tequalSQL = \"=\"\n\t\tinSQL = \"IN\"\n\t)\n\n\t// If building not conditions\n\tif !include {\n\t\tequalSQL = \"<>\"\n\t\tinSQL = \"NOT IN\"\n\t}\n\n\tswitch value := clause[\"query\"].(type) {\n\tcase sql.NullInt64:\n\t\treturn fmt.Sprintf(\"(%v.%v %s %v)\", quotedTableName, quotedPrimaryKey, equalSQL, value.Int64)\n\tcase int, int8, int16, int32, int64, uint, uint8, uint16, uint32, uint64:\n\t\treturn fmt.Sprintf(\"(%v.%v %s %v)\", quotedTableName, quotedPrimaryKey, equalSQL, value)\n\tcase []int, []int8, []int16, []int32, []int64, []uint, []uint8, []uint16, []uint32, []uint64, []string, []interface{}:\n\t\tif !include && reflect.ValueOf(value).Len() == 0 {\n\t\t\treturn\n\t\t}\n\t\tstr = fmt.Sprintf(\"(%v.%v %s (?))\", quotedTableName, quotedPrimaryKey, inSQL)\n\t\tclause[\"args\"] = []interface{}{value}\n\tcase string:\n\t\tif isNumberRegexp.MatchString(value) {\n\t\t\treturn fmt.Sprintf(\"(%v.%v %s %v)\", quotedTableName, quotedPrimaryKey, equalSQL, scope.AddToVars(value))\n\t\t}\n\n\t\tif value != \"\" {\n\t\t\tif !include {\n\t\t\t\tif comparisonRegexp.MatchString(value) {\n\t\t\t\t\tstr = fmt.Sprintf(\"NOT (%v)\", value)\n\t\t\t\t} else {\n\t\t\t\t\tstr = fmt.Sprintf(\"(%v.%v NOT IN (?))\", quotedTableName, scope.Quote(value))\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tstr = fmt.Sprintf(\"(%v)\", value)\n\t\t\t}\n\t\t}\n\tcase map[string]interface{}:\n\t\tvar sqls []string\n\t\tfor key, value := range value {\n\t\t\tif value != nil {\n\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"(%v.%v %s %v)\", quotedTableName, scope.Quote(key), equalSQL, scope.AddToVars(value)))\n\t\t\t} else {\n\t\t\t\tif !include {\n\t\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"(%v.%v IS NOT NULL)\", quotedTableName, scope.Quote(key)))\n\t\t\t\t} else {\n\t\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"(%v.%v IS NULL)\", quotedTableName, scope.Quote(key)))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn strings.Join(sqls, \" AND \")\n\tcase interface{}:\n\t\tvar sqls []string\n\t\tnewScope := scope.New(value)\n\n\t\tif len(newScope.Fields()) == 0 {\n\t\t\tscope.Err(fmt.Errorf(\"invalid query condition: %v\", value))\n\t\t\treturn\n\t\t}\n\n\t\tfor _, field := range newScope.Fields() {\n\t\t\tif !field.IsIgnored && !field.IsBlank {\n\t\t\t\tsqls = append(sqls, fmt.Sprintf(\"(%v.%v %s %v)\", quotedTableName, scope.Quote(field.DBName), equalSQL, scope.AddToVars(field.Field.Interface())))\n\t\t\t}\n\t\t}\n\t\treturn strings.Join(sqls, \" AND \")\n\tdefault:\n\t\tscope.Err(fmt.Errorf(\"invalid query condition: %v\", value))\n\t\treturn\n\t}\n\n\treplacements := []string{}\n\targs := clause[\"args\"].([]interface{})\n\tfor _, arg := range args {\n\t\tvar err error\n\t\tswitch reflect.ValueOf(arg).Kind() {\n\t\tcase reflect.Slice: // For where(\"id in (?)\", []int64{1,2})\n\t\t\tif scanner, ok := interface{}(arg).(driver.Valuer); ok {\n\t\t\t\targ, err = scanner.Value()\n\t\t\t\treplacements = append(replacements, scope.AddToVars(arg))\n\t\t\t} else if b, ok := arg.([]byte); ok {\n\t\t\t\treplacements = append(replacements, scope.AddToVars(b))\n\t\t\t} else if as, ok := arg.([][]interface{}); ok {\n\t\t\t\tvar tempMarks []string\n\t\t\t\tfor _, a := range as {\n\t\t\t\t\tvar arrayMarks []string\n\t\t\t\t\tfor _, v := range a {\n\t\t\t\t\t\tarrayMarks = append(arrayMarks, scope.AddToVars(v))\n\t\t\t\t\t}\n\n\t\t\t\t\tif len(arrayMarks) > 0 {\n\t\t\t\t\t\ttempMarks = append(tempMarks, fmt.Sprintf(\"(%v)\", strings.Join(arrayMarks, \",\")))\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif len(tempMarks) > 0 {\n\t\t\t\t\treplacements = append(replacements, strings.Join(tempMarks, \",\"))\n\t\t\t\t}\n\t\t\t} else if values := reflect.ValueOf(arg); values.Len() > 0 {\n\t\t\t\tvar tempMarks []string\n\t\t\t\tfor i := 0; i < values.Len(); i++ {\n\t\t\t\t\ttempMarks = append(tempMarks, scope.AddToVars(values.Index(i).Interface()))\n\t\t\t\t}\n\t\t\t\treplacements = append(replacements, strings.Join(tempMarks, \",\"))\n\t\t\t} else {\n\t\t\t\treplacements = append(replacements, scope.AddToVars(Expr(\"NULL\")))\n\t\t\t}\n\t\tdefault:\n\t\t\tif valuer, ok := interface{}(arg).(driver.Valuer); ok {\n\t\t\t\targ, err = valuer.Value()\n\t\t\t}\n\n\t\t\treplacements = append(replacements, scope.AddToVars(arg))\n\t\t}\n\n\t\tif err != nil {\n\t\t\tscope.Err(err)\n\t\t}\n\t}\n\n\tbuff := bytes.NewBuffer([]byte{})\n\ti := 0\n\tfor _, s := range str {\n\t\tif s == '?' {\n\t\t\tbuff.WriteString(replacements[i])\n\t\t\ti++\n\t\t} else {\n\t\t\tbuff.WriteRune(s)\n\t\t}\n\t}\n\n\tstr = buff.String()\n\n\treturn\n}\n\nfunc (scope *Scope) buildSelectQuery(clause map[string]interface{}) (str string) {\n\tswitch value := clause[\"query\"].(type) {\n\tcase string:\n\t\tstr = value\n\tcase []string:\n\t\tstr = strings.Join(value, \", \")\n\t}\n\n\targs := clause[\"args\"].([]interface{})\n\treplacements := []string{}\n\tfor _, arg := range args {\n\t\tswitch reflect.ValueOf(arg).Kind() {\n\t\tcase reflect.Slice:\n\t\t\tvalues := reflect.ValueOf(arg)\n\t\t\tvar tempMarks []string\n\t\t\tfor i := 0; i < values.Len(); i++ {\n\t\t\t\ttempMarks = append(tempMarks, scope.AddToVars(values.Index(i).Interface()))\n\t\t\t}\n\t\t\treplacements = append(replacements, strings.Join(tempMarks, \",\"))\n\t\tdefault:\n\t\t\tif valuer, ok := interface{}(arg).(driver.Valuer); ok {\n\t\t\t\targ, _ = valuer.Value()\n\t\t\t}\n\t\t\treplacements = append(replacements, scope.AddToVars(arg))\n\t\t}\n\t}\n\n\tbuff := bytes.NewBuffer([]byte{})\n\ti := 0\n\tfor pos := range str {\n\t\tif str[pos] == '?' {\n\t\t\tbuff.WriteString(replacements[i])\n\t\t\ti++\n\t\t} else {\n\t\t\tbuff.WriteByte(str[pos])\n\t\t}\n\t}\n\n\tstr = buff.String()\n\n\treturn\n}\n\nfunc (scope *Scope) whereSQL() (sql string) {\n\tvar (\n\t\tquotedTableName = scope.QuotedTableName()\n\t\tdeletedAtField, hasDeletedAtField = scope.FieldByName(\"DeletedAt\")\n\t\tprimaryConditions, andConditions, orConditions []string\n\t)\n\n\tif !scope.Search.Unscoped && hasDeletedAtField {\n\t\tsql := fmt.Sprintf(\"%v.%v IS NULL\", quotedTableName, scope.Quote(deletedAtField.DBName))\n\t\tprimaryConditions = append(primaryConditions, sql)\n\t}\n\n\tif !scope.PrimaryKeyZero() {\n\t\tfor _, field := range scope.PrimaryFields() {\n\t\t\tsql := fmt.Sprintf(\"%v.%v = %v\", quotedTableName, scope.Quote(field.DBName), scope.AddToVars(field.Field.Interface()))\n\t\t\tprimaryConditions = append(primaryConditions, sql)\n\t\t}\n\t}\n\n\tfor _, clause := range scope.Search.whereConditions {\n\t\tif sql := scope.buildCondition(clause, true); sql != \"\" {\n\t\t\tandConditions = append(andConditions, sql)\n\t\t}\n\t}\n\n\tfor _, clause := range scope.Search.orConditions {\n\t\tif sql := scope.buildCondition(clause, true); sql != \"\" {\n\t\t\torConditions = append(orConditions, sql)\n\t\t}\n\t}\n\n\tfor _, clause := range scope.Search.notConditions {\n\t\tif sql := scope.buildCondition(clause, false); sql != \"\" {\n\t\t\tandConditions = append(andConditions, sql)\n\t\t}\n\t}\n\n\torSQL := strings.Join(orConditions, \" OR \")\n\tcombinedSQL := strings.Join(andConditions, \" AND \")\n\tif len(combinedSQL) > 0 {\n\t\tif len(orSQL) > 0 {\n\t\t\tcombinedSQL = combinedSQL + \" OR \" + orSQL\n\t\t}\n\t} else {\n\t\tcombinedSQL = orSQL\n\t}\n\n\tif len(primaryConditions) > 0 {\n\t\tsql = \"WHERE \" + strings.Join(primaryConditions, \" AND \")\n\t\tif len(combinedSQL) > 0 {\n\t\t\tsql = sql + \" AND (\" + combinedSQL + \")\"\n\t\t}\n\t} else if len(combinedSQL) > 0 {\n\t\tsql = \"WHERE \" + combinedSQL\n\t}\n\treturn\n}\n\nfunc (scope *Scope) selectSQL() string {\n\tif len(scope.Search.selects) == 0 {\n\t\tif len(scope.Search.joinConditions) > 0 {\n\t\t\treturn fmt.Sprintf(\"%v.*\", scope.QuotedTableName())\n\t\t}\n\t\treturn \"*\"\n\t}\n\treturn scope.buildSelectQuery(scope.Search.selects)\n}\n\nfunc (scope *Scope) orderSQL() string {\n\tif len(scope.Search.orders) == 0 || scope.Search.ignoreOrderQuery {\n\t\treturn \"\"\n\t}\n\n\tvar orders []string\n\tfor _, order := range scope.Search.orders {\n\t\tif str, ok := order.(string); ok {\n\t\t\torders = append(orders, scope.quoteIfPossible(str))\n\t\t} else if expr, ok := order.(*expr); ok {\n\t\t\texp := expr.expr\n\t\t\tfor _, arg := range expr.args {\n\t\t\t\texp = strings.Replace(exp, \"?\", scope.AddToVars(arg), 1)\n\t\t\t}\n\t\t\torders = append(orders, exp)\n\t\t}\n\t}\n\treturn \" ORDER BY \" + strings.Join(orders, \",\")\n}\n\nfunc (scope *Scope) limitAndOffsetSQL() string {\n\treturn scope.Dialect().LimitAndOffsetSQL(scope.Search.limit, scope.Search.offset)\n}\n\nfunc (scope *Scope) groupSQL() string {\n\tif len(scope.Search.group) == 0 {\n\t\treturn \"\"\n\t}\n\treturn \" GROUP BY \" + scope.Search.group\n}\n\nfunc (scope *Scope) havingSQL() string {\n\tif len(scope.Search.havingConditions) == 0 {\n\t\treturn \"\"\n\t}\n\n\tvar andConditions []string\n\tfor _, clause := range scope.Search.havingConditions {\n\t\tif sql := scope.buildCondition(clause, true); sql != \"\" {\n\t\t\tandConditions = append(andConditions, sql)\n\t\t}\n\t}\n\n\tcombinedSQL := strings.Join(andConditions, \" AND \")\n\tif len(combinedSQL) == 0 {\n\t\treturn \"\"\n\t}\n\n\treturn \" HAVING \" + combinedSQL\n}\n\nfunc (scope *Scope) joinsSQL() string {\n\tvar joinConditions []string\n\tfor _, clause := range scope.Search.joinConditions {\n\t\tif sql := scope.buildCondition(clause, true); sql != \"\" {\n\t\t\tjoinConditions = append(joinConditions, strings.TrimSuffix(strings.TrimPrefix(sql, \"(\"), \")\"))\n\t\t}\n\t}\n\n\treturn strings.Join(joinConditions, \" \") + \" \"\n}\n\nfunc (scope *Scope) prepareQuerySQL() {\n\tif scope.Search.raw {\n\t\tscope.Raw(scope.CombinedConditionSql())\n\t} else {\n\t\tscope.Raw(fmt.Sprintf(\"SELECT %v FROM %v %v\", scope.selectSQL(), scope.QuotedTableName(), scope.CombinedConditionSql()))\n\t}\n\treturn\n}\n\nfunc (scope *Scope) inlineCondition(values ...interface{}) *Scope {\n\tif len(values) > 0 {\n\t\tscope.Search.Where(values[0], values[1:]...)\n\t}\n\treturn scope\n}\n\nfunc (scope *Scope) callCallbacks(funcs []*func(s *Scope)) *Scope {\n\tfor _, f := range funcs {\n\t\t(*f)(scope)\n\t\tif scope.skipLeft {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn scope\n}\n\nfunc convertInterfaceToMap(values interface{}, withIgnoredField bool) map[string]interface{} {\n\tvar attrs = map[string]interface{}{}\n\n\tswitch value := values.(type) {\n\tcase map[string]interface{}:\n\t\treturn value\n\tcase []interface{}:\n\t\tfor _, v := range value {\n\t\t\tfor key, value := range convertInterfaceToMap(v, withIgnoredField) {\n\t\t\t\tattrs[key] = value\n\t\t\t}\n\t\t}\n\tcase interface{}:\n\t\treflectValue := reflect.ValueOf(values)\n\n\t\tswitch reflectValue.Kind() {\n\t\tcase reflect.Map:\n\t\t\tfor _, key := range reflectValue.MapKeys() {\n\t\t\t\tattrs[ToDBName(key.Interface().(string))] = reflectValue.MapIndex(key).Interface()\n\t\t\t}\n\t\tdefault:\n\t\t\tfor _, field := range (&Scope{Value: values}).Fields() {\n\t\t\t\tif !field.IsBlank && (withIgnoredField || !field.IsIgnored) {\n\t\t\t\t\tattrs[field.DBName] = field.Field.Interface()\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn attrs\n}\n\nfunc (scope *Scope) updatedAttrsWithValues(value interface{}) (results map[string]interface{}, hasUpdate bool) {\n\tif scope.IndirectValue().Kind() != reflect.Struct {\n\t\treturn convertInterfaceToMap(value, false), true\n\t}\n\n\tresults = map[string]interface{}{}\n\n\tfor key, value := range convertInterfaceToMap(value, true) {\n\t\tif field, ok := scope.FieldByName(key); ok && scope.changeableField(field) {\n\t\t\tif _, ok := value.(*expr); ok {\n\t\t\t\thasUpdate = true\n\t\t\t\tresults[field.DBName] = value\n\t\t\t} else {\n\t\t\t\terr := field.Set(value)\n\t\t\t\tif field.IsNormal {\n\t\t\t\t\thasUpdate = true\n\t\t\t\t\tif err == ErrUnaddressable {\n\t\t\t\t\t\tresults[field.DBName] = value\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresults[field.DBName] = field.Field.Interface()\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc (scope *Scope) row() *sql.Row {\n\tdefer scope.trace(NowFunc())\n\n\tresult := &RowQueryResult{}\n\tscope.InstanceSet(\"row_query_result\", result)\n\tscope.callCallbacks(scope.db.parent.callbacks.rowQueries)\n\n\treturn result.Row\n}\n\nfunc (scope *Scope) rows() (*sql.Rows, error) {\n\tdefer scope.trace(NowFunc())\n\n\tresult := &RowsQueryResult{}\n\tscope.InstanceSet(\"row_query_result\", result)\n\tscope.callCallbacks(scope.db.parent.callbacks.rowQueries)\n\n\treturn result.Rows, result.Error\n}\n\nfunc (scope *Scope) initialize() *Scope {\n\tfor _, clause := range scope.Search.whereConditions {\n\t\tscope.updatedAttrsWithValues(clause[\"query\"])\n\t}\n\tscope.updatedAttrsWithValues(scope.Search.initAttrs)\n\tscope.updatedAttrsWithValues(scope.Search.assignAttrs)\n\treturn scope\n}\n\nfunc (scope *Scope) isQueryForColumn(query interface{}, column string) bool {\n\tqueryStr := strings.ToLower(fmt.Sprint(query))\n\tif queryStr == column {\n\t\treturn true\n\t}\n\n\tif strings.HasSuffix(queryStr, \"as \"+column) {\n\t\treturn true\n\t}\n\n\tif strings.HasSuffix(queryStr, \"as \"+scope.Quote(column)) {\n\t\treturn true\n\t}\n\n\treturn false\n}\n\nfunc (scope *Scope) pluck(column string, value interface{}) *Scope {\n\tdest := reflect.Indirect(reflect.ValueOf(value))\n\tif dest.Kind() != reflect.Slice {\n\t\tscope.Err(fmt.Errorf(\"results should be a slice, not %s\", dest.Kind()))\n\t\treturn scope\n\t}\n\n\tif query, ok := scope.Search.selects[\"query\"]; !ok || !scope.isQueryForColumn(query, column) {\n\t\tscope.Search.Select(column)\n\t}\n\n\trows, err := scope.rows()\n\tif scope.Err(err) == nil {\n\t\tdefer rows.Close()\n\t\tfor rows.Next() {\n\t\t\telem := reflect.New(dest.Type().Elem()).Interface()\n\t\t\tscope.Err(rows.Scan(elem))\n\t\t\tdest.Set(reflect.Append(dest, reflect.ValueOf(elem).Elem()))\n\t\t}\n\n\t\tif err := rows.Err(); err != nil {\n\t\t\tscope.Err(err)\n\t\t}\n\t}\n\treturn scope\n}\n\nfunc (scope *Scope) count(value interface{}) *Scope {\n\tif query, ok := scope.Search.selects[\"query\"]; !ok || !countingQueryRegexp.MatchString(fmt.Sprint(query)) {\n\t\tif len(scope.Search.group) != 0 {\n\t\t\tscope.Search.Select(\"count(*) FROM ( SELECT count(*) as name \")\n\t\t\tscope.Search.group += \" ) AS count_table\"\n\t\t} else {\n\t\t\tscope.Search.Select(\"count(*)\")\n\t\t}\n\t}\n\tscope.Search.ignoreOrderQuery = true\n\tscope.Err(scope.row().Scan(value))\n\treturn scope\n}\n\nfunc (scope *Scope) typeName() string {\n\ttyp := scope.IndirectValue().Type()\n\n\tfor typ.Kind() == reflect.Slice || typ.Kind() == reflect.Ptr {\n\t\ttyp = typ.Elem()\n\t}\n\n\treturn typ.Name()\n}\n\n// trace print sql log\nfunc (scope *Scope) trace(t time.Time) {\n\tif len(scope.SQL) > 0 {\n\t\tscope.db.slog(scope.SQL, t, scope.SQLVars...)\n\t}\n}\n\nfunc (scope *Scope) changeableField(field *Field) bool {\n\tif selectAttrs := scope.SelectAttrs(); len(selectAttrs) > 0 {\n\t\tfor _, attr := range selectAttrs {\n\t\t\tif field.Name == attr || field.DBName == attr {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t\treturn false\n\t}\n\n\tfor _, attr := range scope.OmitAttrs() {\n\t\tif field.Name == attr || field.DBName == attr {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\nfunc (scope *Scope) related(value interface{}, foreignKeys ...string) *Scope {\n\ttoScope := scope.db.NewScope(value)\n\ttx := scope.db.Set(\"gorm:association:source\", scope.Value)\n\n\tfor _, foreignKey := range append(foreignKeys, toScope.typeName()+\"Id\", scope.typeName()+\"Id\") {\n\t\tfromField, _ := scope.FieldByName(foreignKey)\n\t\ttoField, _ := toScope.FieldByName(foreignKey)\n\n\t\tif fromField != nil {\n\t\t\tif relationship := fromField.Relationship; relationship != nil {\n\t\t\t\tif relationship.Kind == \"many_to_many\" {\n\t\t\t\t\tjoinTableHandler := relationship.JoinTableHandler\n\t\t\t\t\tscope.Err(joinTableHandler.JoinWith(joinTableHandler, tx, scope.Value).Find(value).Error)\n\t\t\t\t} else if relationship.Kind == \"belongs_to\" {\n\t\t\t\t\tfor idx, foreignKey := range relationship.ForeignDBNames {\n\t\t\t\t\t\tif field, ok := scope.FieldByName(foreignKey); ok {\n\t\t\t\t\t\t\ttx = tx.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(relationship.AssociationForeignDBNames[idx])), field.Field.Interface())\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tscope.Err(tx.Find(value).Error)\n\t\t\t\t} else if relationship.Kind == \"has_many\" || relationship.Kind == \"has_one\" {\n\t\t\t\t\tfor idx, foreignKey := range relationship.ForeignDBNames {\n\t\t\t\t\t\tif field, ok := scope.FieldByName(relationship.AssociationForeignDBNames[idx]); ok {\n\t\t\t\t\t\t\ttx = tx.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(foreignKey)), field.Field.Interface())\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif relationship.PolymorphicType != \"\" {\n\t\t\t\t\t\ttx = tx.Where(fmt.Sprintf(\"%v = ?\", scope.Quote(relationship.PolymorphicDBName)), relationship.PolymorphicValue)\n\t\t\t\t\t}\n\t\t\t\t\tscope.Err(tx.Find(value).Error)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsql := fmt.Sprintf(\"%v = ?\", scope.Quote(toScope.PrimaryKey()))\n\t\t\t\tscope.Err(tx.Where(sql, fromField.Field.Interface()).Find(value).Error)\n\t\t\t}\n\t\t\treturn scope\n\t\t} else if toField != nil {\n\t\t\tsql := fmt.Sprintf(\"%v = ?\", scope.Quote(toField.DBName))\n\t\t\tscope.Err(tx.Where(sql, scope.PrimaryKeyValue()).Find(value).Error)\n\t\t\treturn scope\n\t\t}\n\t}\n\n\tscope.Err(fmt.Errorf(\"invalid association %v\", foreignKeys))\n\treturn scope\n}\n\n// getTableOptions return the table options string or an empty string if the table options does not exist\nfunc (scope *Scope) getTableOptions() string {\n\ttableOptions, ok := scope.Get(\"gorm:table_options\")\n\tif !ok {\n\t\treturn \"\"\n\t}\n\treturn \" \" + tableOptions.(string)\n}\n\nfunc (scope *Scope) createJoinTable(field *StructField) {\n\tif relationship := field.Relationship; relationship != nil && relationship.JoinTableHandler != nil {\n\t\tjoinTableHandler := relationship.JoinTableHandler\n\t\tjoinTable := joinTableHandler.Table(scope.db)\n\t\tif !scope.Dialect().HasTable(joinTable) {\n\t\t\ttoScope := &Scope{Value: reflect.New(field.Struct.Type).Interface()}\n\n\t\t\tvar sqlTypes, primaryKeys []string\n\t\t\tfor idx, fieldName := range relationship.ForeignFieldNames {\n\t\t\t\tif field, ok := scope.FieldByName(fieldName); ok {\n\t\t\t\t\tforeignKeyStruct := field.clone()\n\t\t\t\t\tforeignKeyStruct.IsPrimaryKey = false\n\t\t\t\t\tforeignKeyStruct.TagSettings[\"IS_JOINTABLE_FOREIGNKEY\"] = \"true\"\n\t\t\t\t\tdelete(foreignKeyStruct.TagSettings, \"AUTO_INCREMENT\")\n\t\t\t\t\tsqlTypes = append(sqlTypes, scope.Quote(relationship.ForeignDBNames[idx])+\" \"+scope.Dialect().DataTypeOf(foreignKeyStruct))\n\t\t\t\t\tprimaryKeys = append(primaryKeys, scope.Quote(relationship.ForeignDBNames[idx]))\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor idx, fieldName := range relationship.AssociationForeignFieldNames {\n\t\t\t\tif field, ok := toScope.FieldByName(fieldName); ok {\n\t\t\t\t\tforeignKeyStruct := field.clone()\n\t\t\t\t\tforeignKeyStruct.IsPrimaryKey = false\n\t\t\t\t\tforeignKeyStruct.TagSettings[\"IS_JOINTABLE_FOREIGNKEY\"] = \"true\"\n\t\t\t\t\tdelete(foreignKeyStruct.TagSettings, \"AUTO_INCREMENT\")\n\t\t\t\t\tsqlTypes = append(sqlTypes, scope.Quote(relationship.AssociationForeignDBNames[idx])+\" \"+scope.Dialect().DataTypeOf(foreignKeyStruct))\n\t\t\t\t\tprimaryKeys = append(primaryKeys, scope.Quote(relationship.AssociationForeignDBNames[idx]))\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tscope.Err(scope.NewDB().Exec(fmt.Sprintf(\"CREATE TABLE %v (%v, PRIMARY KEY (%v))%s\", scope.Quote(joinTable), strings.Join(sqlTypes, \",\"), strings.Join(primaryKeys, \",\"), scope.getTableOptions())).Error)\n\t\t}\n\t\tscope.NewDB().Table(joinTable).AutoMigrate(joinTableHandler)\n\t}\n}\n\nfunc (scope *Scope) createTable() *Scope {\n\tvar tags []string\n\tvar primaryKeys []string\n\tvar primaryKeyInColumnType = false\n\tfor _, field := range scope.GetModelStruct().StructFields {\n\t\tif field.IsNormal {\n\t\t\tsqlTag := scope.Dialect().DataTypeOf(field)\n\n\t\t\t// Check if the primary key constraint was specified as\n\t\t\t// part of the column type. If so, we can only support\n\t\t\t// one column as the primary key.\n\t\t\tif strings.Contains(strings.ToLower(sqlTag), \"primary key\") {\n\t\t\t\tprimaryKeyInColumnType = true\n\t\t\t}\n\n\t\t\ttags = append(tags, scope.Quote(field.DBName)+\" \"+sqlTag)\n\t\t}\n\n\t\tif field.IsPrimaryKey {\n\t\t\tprimaryKeys = append(primaryKeys, scope.Quote(field.DBName))\n\t\t}\n\t\tscope.createJoinTable(field)\n\t}\n\n\tvar primaryKeyStr string\n\tif len(primaryKeys) > 0 && !primaryKeyInColumnType {\n\t\tprimaryKeyStr = fmt.Sprintf(\", PRIMARY KEY (%v)\", strings.Join(primaryKeys, \",\"))\n\t}\n\n\tscope.Raw(fmt.Sprintf(\"CREATE TABLE %v (%v %v)%s\", scope.QuotedTableName(), strings.Join(tags, \",\"), primaryKeyStr, scope.getTableOptions())).Exec()\n\n\tscope.autoIndex()\n\treturn scope\n}\n\nfunc (scope *Scope) dropTable() *Scope {\n\tscope.Raw(fmt.Sprintf(\"DROP TABLE %v%s\", scope.QuotedTableName(), scope.getTableOptions())).Exec()\n\treturn scope\n}\n\nfunc (scope *Scope) modifyColumn(column string, typ string) {\n\tscope.db.AddError(scope.Dialect().ModifyColumn(scope.QuotedTableName(), scope.Quote(column), typ))\n}\n\nfunc (scope *Scope) dropColumn(column string) {\n\tscope.Raw(fmt.Sprintf(\"ALTER TABLE %v DROP COLUMN %v\", scope.QuotedTableName(), scope.Quote(column))).Exec()\n}\n\nfunc (scope *Scope) addIndex(unique bool, indexName string, column ...string) {\n\tif scope.Dialect().HasIndex(scope.TableName(), indexName) {\n\t\treturn\n\t}\n\n\tvar columns []string\n\tfor _, name := range column {\n\t\tcolumns = append(columns, scope.quoteIfPossible(name))\n\t}\n\n\tsqlCreate := \"CREATE INDEX\"\n\tif unique {\n\t\tsqlCreate = \"CREATE UNIQUE INDEX\"\n\t}\n\n\tscope.Raw(fmt.Sprintf(\"%s %v ON %v(%v) %v\", sqlCreate, indexName, scope.QuotedTableName(), strings.Join(columns, \", \"), scope.whereSQL())).Exec()\n}\n\nfunc (scope *Scope) addForeignKey(field string, dest string, onDelete string, onUpdate string) {\n\t// Compatible with old generated key\n\tkeyName := scope.Dialect().BuildKeyName(scope.TableName(), field, dest, \"foreign\")\n\n\tif scope.Dialect().HasForeignKey(scope.TableName(), keyName) {\n\t\treturn\n\t}\n\tvar query = `ALTER TABLE %s ADD CONSTRAINT %s FOREIGN KEY (%s) REFERENCES %s ON DELETE %s ON UPDATE %s;`\n\tscope.Raw(fmt.Sprintf(query, scope.QuotedTableName(), scope.quoteIfPossible(keyName), scope.quoteIfPossible(field), dest, onDelete, onUpdate)).Exec()\n}\n\nfunc (scope *Scope) removeForeignKey(field string, dest string) {\n\tkeyName := scope.Dialect().BuildKeyName(scope.TableName(), field, dest)\n\n\tif !scope.Dialect().HasForeignKey(scope.TableName(), keyName) {\n\t\treturn\n\t}\n\tvar query = `ALTER TABLE %s DROP CONSTRAINT %s;`\n\tscope.Raw(fmt.Sprintf(query, scope.QuotedTableName(), scope.quoteIfPossible(keyName))).Exec()\n}\n\nfunc (scope *Scope) removeIndex(indexName string) {\n\tscope.Dialect().RemoveIndex(scope.TableName(), indexName)\n}\n\nfunc (scope *Scope) autoMigrate() *Scope {\n\ttableName := scope.TableName()\n\tquotedTableName := scope.QuotedTableName()\n\n\tif !scope.Dialect().HasTable(tableName) {\n\t\tscope.createTable()\n\t} else {\n\t\tfor _, field := range scope.GetModelStruct().StructFields {\n\t\t\tif !scope.Dialect().HasColumn(tableName, field.DBName) {\n\t\t\t\tif field.IsNormal {\n\t\t\t\t\tsqlTag := scope.Dialect().DataTypeOf(field)\n\t\t\t\t\tscope.Raw(fmt.Sprintf(\"ALTER TABLE %v ADD %v %v;\", quotedTableName, scope.Quote(field.DBName), sqlTag)).Exec()\n\t\t\t\t}\n\t\t\t}\n\t\t\tscope.createJoinTable(field)\n\t\t}\n\t\tscope.autoIndex()\n\t}\n\treturn scope\n}\n\nfunc (scope *Scope) autoIndex() *Scope {\n\tvar indexes = map[string][]string{}\n\tvar uniqueIndexes = map[string][]string{}\n\n\tfor _, field := range scope.GetStructFields() {\n\t\tif name, ok := field.TagSettings[\"INDEX\"]; ok {\n\t\t\tnames := strings.Split(name, \",\")\n\n\t\t\tfor _, name := range names {\n\t\t\t\tif name == \"INDEX\" || name == \"\" {\n\t\t\t\t\tname = scope.Dialect().BuildKeyName(\"idx\", scope.TableName(), field.DBName)\n\t\t\t\t}\n\t\t\t\tindexes[name] = append(indexes[name], field.DBName)\n\t\t\t}\n\t\t}\n\n\t\tif name, ok := field.TagSettings[\"UNIQUE_INDEX\"]; ok {\n\t\t\tnames := strings.Split(name, \",\")\n\n\t\t\tfor _, name := range names {\n\t\t\t\tif name == \"UNIQUE_INDEX\" || name == \"\" {\n\t\t\t\t\tname = scope.Dialect().BuildKeyName(\"uix\", scope.TableName(), field.DBName)\n\t\t\t\t}\n\t\t\t\tuniqueIndexes[name] = append(uniqueIndexes[name], field.DBName)\n\t\t\t}\n\t\t}\n\t}\n\n\tfor name, columns := range indexes {\n\t\tif db := scope.NewDB().Table(scope.TableName()).Model(scope.Value).AddIndex(name, columns...); db.Error != nil {\n\t\t\tscope.db.AddError(db.Error)\n\t\t}\n\t}\n\n\tfor name, columns := range uniqueIndexes {\n\t\tif db := scope.NewDB().Table(scope.TableName()).Model(scope.Value).AddUniqueIndex(name, columns...); db.Error != nil {\n\t\t\tscope.db.AddError(db.Error)\n\t\t}\n\t}\n\n\treturn scope\n}\n\nfunc (scope *Scope) getColumnAsArray(columns []string, values ...interface{}) (results [][]interface{}) {\n\tfor _, value := range values {\n\t\tindirectValue := indirect(reflect.ValueOf(value))\n\n\t\tswitch indirectValue.Kind() {\n\t\tcase reflect.Slice:\n\t\t\tfor i := 0; i < indirectValue.Len(); i++ {\n\t\t\t\tvar result []interface{}\n\t\t\t\tvar object = indirect(indirectValue.Index(i))\n\t\t\t\tvar hasValue = false\n\t\t\t\tfor _, column := range columns {\n\t\t\t\t\tfield := object.FieldByName(column)\n\t\t\t\t\tif hasValue || !isBlank(field) {\n\t\t\t\t\t\thasValue = true\n\t\t\t\t\t}\n\t\t\t\t\tresult = append(result, field.Interface())\n\t\t\t\t}\n\n\t\t\t\tif hasValue {\n\t\t\t\t\tresults = append(results, result)\n\t\t\t\t}\n\t\t\t}\n\t\tcase reflect.Struct:\n\t\t\tvar result []interface{}\n\t\t\tvar hasValue = false\n\t\t\tfor _, column := range columns {\n\t\t\t\tfield := indirectValue.FieldByName(column)\n\t\t\t\tif hasValue || !isBlank(field) {\n\t\t\t\t\thasValue = true\n\t\t\t\t}\n\t\t\t\tresult = append(result, field.Interface())\n\t\t\t}\n\n\t\t\tif hasValue {\n\t\t\t\tresults = append(results, result)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn\n}\n\nfunc (scope *Scope) getColumnAsScope(column string) *Scope {\n\tindirectScopeValue := scope.IndirectValue()\n\n\tswitch indirectScopeValue.Kind() {\n\tcase reflect.Slice:\n\t\tif fieldStruct, ok := scope.GetModelStruct().ModelType.FieldByName(column); ok {\n\t\t\tfieldType := fieldStruct.Type\n\t\t\tif fieldType.Kind() == reflect.Slice || fieldType.Kind() == reflect.Ptr {\n\t\t\t\tfieldType = fieldType.Elem()\n\t\t\t}\n\n\t\t\tresultsMap := map[interface{}]bool{}\n\t\t\tresults := reflect.New(reflect.SliceOf(reflect.PtrTo(fieldType))).Elem()\n\n\t\t\tfor i := 0; i < indirectScopeValue.Len(); i++ {\n\t\t\t\tresult := indirect(indirect(indirectScopeValue.Index(i)).FieldByName(column))\n\n\t\t\t\tif result.Kind() == reflect.Slice {\n\t\t\t\t\tfor j := 0; j < result.Len(); j++ {\n\t\t\t\t\t\tif elem := result.Index(j); elem.CanAddr() && resultsMap[elem.Addr()] != true {\n\t\t\t\t\t\t\tresultsMap[elem.Addr()] = true\n\t\t\t\t\t\t\tresults = reflect.Append(results, elem.Addr())\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if result.CanAddr() && resultsMap[result.Addr()] != true {\n\t\t\t\t\tresultsMap[result.Addr()] = true\n\t\t\t\t\tresults = reflect.Append(results, result.Addr())\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn scope.New(results.Interface())\n\t\t}\n\tcase reflect.Struct:\n\t\tif field := indirectScopeValue.FieldByName(column); field.CanAddr() {\n\t\t\treturn scope.New(field.Addr().Interface())\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (scope *Scope) hasConditions() bool {\n\treturn !scope.PrimaryKeyZero() ||\n\t\tlen(scope.Search.whereConditions) > 0 ||\n\t\tlen(scope.Search.orConditions) > 0 ||\n\t\tlen(scope.Search.notConditions) > 0\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/search.go", "content": "package gorm\n\nimport (\n\t\"fmt\"\n)\n\ntype search struct {\n\tdb *DB\n\twhereConditions []map[string]interface{}\n\torConditions []map[string]interface{}\n\tnotConditions []map[string]interface{}\n\thavingConditions []map[string]interface{}\n\tjoinConditions []map[string]interface{}\n\tinitAttrs []interface{}\n\tassignAttrs []interface{}\n\tselects map[string]interface{}\n\tomits []string\n\torders []interface{}\n\tpreload []searchPreload\n\toffset interface{}\n\tlimit interface{}\n\tgroup string\n\ttableName string\n\traw bool\n\tUnscoped bool\n\tignoreOrderQuery bool\n}\n\ntype searchPreload struct {\n\tschema string\n\tconditions []interface{}\n}\n\nfunc (s *search) clone() *search {\n\tclone := *s\n\treturn &clone\n}\n\nfunc (s *search) Where(query interface{}, values ...interface{}) *search {\n\ts.whereConditions = append(s.whereConditions, map[string]interface{}{\"query\": query, \"args\": values})\n\treturn s\n}\n\nfunc (s *search) Not(query interface{}, values ...interface{}) *search {\n\ts.notConditions = append(s.notConditions, map[string]interface{}{\"query\": query, \"args\": values})\n\treturn s\n}\n\nfunc (s *search) Or(query interface{}, values ...interface{}) *search {\n\ts.orConditions = append(s.orConditions, map[string]interface{}{\"query\": query, \"args\": values})\n\treturn s\n}\n\nfunc (s *search) Attrs(attrs ...interface{}) *search {\n\ts.initAttrs = append(s.initAttrs, toSearchableMap(attrs...))\n\treturn s\n}\n\nfunc (s *search) Assign(attrs ...interface{}) *search {\n\ts.assignAttrs = append(s.assignAttrs, toSearchableMap(attrs...))\n\treturn s\n}\n\nfunc (s *search) Order(value interface{}, reorder ...bool) *search {\n\tif len(reorder) > 0 && reorder[0] {\n\t\ts.orders = []interface{}{}\n\t}\n\n\tif value != nil && value != \"\" {\n\t\ts.orders = append(s.orders, value)\n\t}\n\treturn s\n}\n\nfunc (s *search) Select(query interface{}, args ...interface{}) *search {\n\ts.selects = map[string]interface{}{\"query\": query, \"args\": args}\n\treturn s\n}\n\nfunc (s *search) Omit(columns ...string) *search {\n\ts.omits = columns\n\treturn s\n}\n\nfunc (s *search) Limit(limit interface{}) *search {\n\ts.limit = limit\n\treturn s\n}\n\nfunc (s *search) Offset(offset interface{}) *search {\n\ts.offset = offset\n\treturn s\n}\n\nfunc (s *search) Group(query string) *search {\n\ts.group = s.getInterfaceAsSQL(query)\n\treturn s\n}\n\nfunc (s *search) Having(query interface{}, values ...interface{}) *search {\n\tif val, ok := query.(*expr); ok {\n\t\ts.havingConditions = append(s.havingConditions, map[string]interface{}{\"query\": val.expr, \"args\": val.args})\n\t} else {\n\t\ts.havingConditions = append(s.havingConditions, map[string]interface{}{\"query\": query, \"args\": values})\n\t}\n\treturn s\n}\n\nfunc (s *search) Joins(query string, values ...interface{}) *search {\n\ts.joinConditions = append(s.joinConditions, map[string]interface{}{\"query\": query, \"args\": values})\n\treturn s\n}\n\nfunc (s *search) Preload(schema string, values ...interface{}) *search {\n\tvar preloads []searchPreload\n\tfor _, preload := range s.preload {\n\t\tif preload.schema != schema {\n\t\t\tpreloads = append(preloads, preload)\n\t\t}\n\t}\n\tpreloads = append(preloads, searchPreload{schema, values})\n\ts.preload = preloads\n\treturn s\n}\n\nfunc (s *search) Raw(b bool) *search {\n\ts.raw = b\n\treturn s\n}\n\nfunc (s *search) unscoped() *search {\n\ts.Unscoped = true\n\treturn s\n}\n\nfunc (s *search) Table(name string) *search {\n\ts.tableName = name\n\treturn s\n}\n\nfunc (s *search) getInterfaceAsSQL(value interface{}) (str string) {\n\tswitch value.(type) {\n\tcase string, int, int8, int16, int32, int64, uint, uint8, uint16, uint32, uint64:\n\t\tstr = fmt.Sprintf(\"%v\", value)\n\tdefault:\n\t\ts.db.AddError(ErrInvalidSQL)\n\t}\n\n\tif str == \"-1\" {\n\t\treturn \"\"\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/test_all.sh", "content": "dialects=(\"postgres\" \"mysql\" \"mssql\" \"sqlite\")\n\nfor dialect in \"${dialects[@]}\" ; do\n DEBUG=false GORM_DIALECT=${dialect} go test\ndone\n" }, { "path": "vendor/github.com/jinzhu/gorm/utils.go", "content": "package gorm\n\nimport (\n\t\"bytes\"\n\t\"database/sql/driver\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"runtime\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n)\n\n// NowFunc returns current time, this function is exported in order to be able\n// to give the flexibility to the developer to customize it according to their\n// needs, e.g:\n// gorm.NowFunc = func() time.Time {\n// return time.Now().UTC()\n// }\nvar NowFunc = func() time.Time {\n\treturn time.Now()\n}\n\n// Copied from golint\nvar commonInitialisms = []string{\"API\", \"ASCII\", \"CPU\", \"CSS\", \"DNS\", \"EOF\", \"GUID\", \"HTML\", \"HTTP\", \"HTTPS\", \"ID\", \"IP\", \"JSON\", \"LHS\", \"QPS\", \"RAM\", \"RHS\", \"RPC\", \"SLA\", \"SMTP\", \"SSH\", \"TLS\", \"TTL\", \"UID\", \"UI\", \"UUID\", \"URI\", \"URL\", \"UTF8\", \"VM\", \"XML\", \"XSRF\", \"XSS\"}\nvar commonInitialismsReplacer *strings.Replacer\n\nvar goSrcRegexp = regexp.MustCompile(`jinzhu/gorm/.*.go`)\nvar goTestRegexp = regexp.MustCompile(`jinzhu/gorm/.*test.go`)\n\nfunc init() {\n\tvar commonInitialismsForReplacer []string\n\tfor _, initialism := range commonInitialisms {\n\t\tcommonInitialismsForReplacer = append(commonInitialismsForReplacer, initialism, strings.Title(strings.ToLower(initialism)))\n\t}\n\tcommonInitialismsReplacer = strings.NewReplacer(commonInitialismsForReplacer...)\n}\n\ntype safeMap struct {\n\tm map[string]string\n\tl *sync.RWMutex\n}\n\nfunc (s *safeMap) Set(key string, value string) {\n\ts.l.Lock()\n\tdefer s.l.Unlock()\n\ts.m[key] = value\n}\n\nfunc (s *safeMap) Get(key string) string {\n\ts.l.RLock()\n\tdefer s.l.RUnlock()\n\treturn s.m[key]\n}\n\nfunc newSafeMap() *safeMap {\n\treturn &safeMap{l: new(sync.RWMutex), m: make(map[string]string)}\n}\n\nvar smap = newSafeMap()\n\ntype strCase bool\n\nconst (\n\tlower strCase = false\n\tupper strCase = true\n)\n\n// ToDBName convert string to db name\nfunc ToDBName(name string) string {\n\tif v := smap.Get(name); v != \"\" {\n\t\treturn v\n\t}\n\n\tif name == \"\" {\n\t\treturn \"\"\n\t}\n\n\tvar (\n\t\tvalue = commonInitialismsReplacer.Replace(name)\n\t\tbuf = bytes.NewBufferString(\"\")\n\t\tlastCase, currCase, nextCase strCase\n\t)\n\n\tfor i, v := range value[:len(value)-1] {\n\t\tnextCase = strCase(value[i+1] >= 'A' && value[i+1] <= 'Z')\n\t\tif i > 0 {\n\t\t\tif currCase == upper {\n\t\t\t\tif lastCase == upper && nextCase == upper {\n\t\t\t\t\tbuf.WriteRune(v)\n\t\t\t\t} else {\n\t\t\t\t\tif value[i-1] != '_' && value[i+1] != '_' {\n\t\t\t\t\t\tbuf.WriteRune('_')\n\t\t\t\t\t}\n\t\t\t\t\tbuf.WriteRune(v)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tbuf.WriteRune(v)\n\t\t\t\tif i == len(value)-2 && nextCase == upper {\n\t\t\t\t\tbuf.WriteRune('_')\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tcurrCase = upper\n\t\t\tbuf.WriteRune(v)\n\t\t}\n\t\tlastCase = currCase\n\t\tcurrCase = nextCase\n\t}\n\n\tbuf.WriteByte(value[len(value)-1])\n\n\ts := strings.ToLower(buf.String())\n\tsmap.Set(name, s)\n\treturn s\n}\n\n// SQL expression\ntype expr struct {\n\texpr string\n\targs []interface{}\n}\n\n// Expr generate raw SQL expression, for example:\n// DB.Model(&product).Update(\"price\", gorm.Expr(\"price * ? + ?\", 2, 100))\nfunc Expr(expression string, args ...interface{}) *expr {\n\treturn &expr{expr: expression, args: args}\n}\n\nfunc indirect(reflectValue reflect.Value) reflect.Value {\n\tfor reflectValue.Kind() == reflect.Ptr {\n\t\treflectValue = reflectValue.Elem()\n\t}\n\treturn reflectValue\n}\n\nfunc toQueryMarks(primaryValues [][]interface{}) string {\n\tvar results []string\n\n\tfor _, primaryValue := range primaryValues {\n\t\tvar marks []string\n\t\tfor range primaryValue {\n\t\t\tmarks = append(marks, \"?\")\n\t\t}\n\n\t\tif len(marks) > 1 {\n\t\t\tresults = append(results, fmt.Sprintf(\"(%v)\", strings.Join(marks, \",\")))\n\t\t} else {\n\t\t\tresults = append(results, strings.Join(marks, \"\"))\n\t\t}\n\t}\n\treturn strings.Join(results, \",\")\n}\n\nfunc toQueryCondition(scope *Scope, columns []string) string {\n\tvar newColumns []string\n\tfor _, column := range columns {\n\t\tnewColumns = append(newColumns, scope.Quote(column))\n\t}\n\n\tif len(columns) > 1 {\n\t\treturn fmt.Sprintf(\"(%v)\", strings.Join(newColumns, \",\"))\n\t}\n\treturn strings.Join(newColumns, \",\")\n}\n\nfunc toQueryValues(values [][]interface{}) (results []interface{}) {\n\tfor _, value := range values {\n\t\tfor _, v := range value {\n\t\t\tresults = append(results, v)\n\t\t}\n\t}\n\treturn\n}\n\nfunc fileWithLineNum() string {\n\tfor i := 2; i < 15; i++ {\n\t\t_, file, line, ok := runtime.Caller(i)\n\t\tif ok && (!goSrcRegexp.MatchString(file) || goTestRegexp.MatchString(file)) {\n\t\t\treturn fmt.Sprintf(\"%v:%v\", file, line)\n\t\t}\n\t}\n\treturn \"\"\n}\n\nfunc isBlank(value reflect.Value) bool {\n\tswitch value.Kind() {\n\tcase reflect.String:\n\t\treturn value.Len() == 0\n\tcase reflect.Bool:\n\t\treturn !value.Bool()\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn value.Int() == 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn value.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn value.Float() == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\treturn value.IsNil()\n\t}\n\n\treturn reflect.DeepEqual(value.Interface(), reflect.Zero(value.Type()).Interface())\n}\n\nfunc toSearchableMap(attrs ...interface{}) (result interface{}) {\n\tif len(attrs) > 1 {\n\t\tif str, ok := attrs[0].(string); ok {\n\t\t\tresult = map[string]interface{}{str: attrs[1]}\n\t\t}\n\t} else if len(attrs) == 1 {\n\t\tif attr, ok := attrs[0].(map[string]interface{}); ok {\n\t\t\tresult = attr\n\t\t}\n\n\t\tif attr, ok := attrs[0].(interface{}); ok {\n\t\t\tresult = attr\n\t\t}\n\t}\n\treturn\n}\n\nfunc equalAsString(a interface{}, b interface{}) bool {\n\treturn toString(a) == toString(b)\n}\n\nfunc toString(str interface{}) string {\n\tif values, ok := str.([]interface{}); ok {\n\t\tvar results []string\n\t\tfor _, value := range values {\n\t\t\tresults = append(results, toString(value))\n\t\t}\n\t\treturn strings.Join(results, \"_\")\n\t} else if bytes, ok := str.([]byte); ok {\n\t\treturn string(bytes)\n\t} else if reflectValue := reflect.Indirect(reflect.ValueOf(str)); reflectValue.IsValid() {\n\t\treturn fmt.Sprintf(\"%v\", reflectValue.Interface())\n\t}\n\treturn \"\"\n}\n\nfunc makeSlice(elemType reflect.Type) interface{} {\n\tif elemType.Kind() == reflect.Slice {\n\t\telemType = elemType.Elem()\n\t}\n\tsliceType := reflect.SliceOf(elemType)\n\tslice := reflect.New(sliceType)\n\tslice.Elem().Set(reflect.MakeSlice(sliceType, 0, 0))\n\treturn slice.Interface()\n}\n\nfunc strInSlice(a string, list []string) bool {\n\tfor _, b := range list {\n\t\tif b == a {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// getValueFromFields return given fields's value\nfunc getValueFromFields(value reflect.Value, fieldNames []string) (results []interface{}) {\n\t// If value is a nil pointer, Indirect returns a zero Value!\n\t// Therefor we need to check for a zero value,\n\t// as FieldByName could panic\n\tif indirectValue := reflect.Indirect(value); indirectValue.IsValid() {\n\t\tfor _, fieldName := range fieldNames {\n\t\t\tif fieldValue := indirectValue.FieldByName(fieldName); fieldValue.IsValid() {\n\t\t\t\tresult := fieldValue.Interface()\n\t\t\t\tif r, ok := result.(driver.Valuer); ok {\n\t\t\t\t\tresult, _ = r.Value()\n\t\t\t\t}\n\t\t\t\tresults = append(results, result)\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc addExtraSpaceIfExist(str string) string {\n\tif str != \"\" {\n\t\treturn \" \" + str\n\t}\n\treturn \"\"\n}\n" }, { "path": "vendor/github.com/jinzhu/gorm/wercker.yml", "content": "# use the default golang container from Docker Hub\nbox: golang\n\nservices:\n - name: mariadb\n id: mariadb:latest\n env:\n MYSQL_DATABASE: gorm\n MYSQL_USER: gorm\n MYSQL_PASSWORD: gorm\n MYSQL_RANDOM_ROOT_PASSWORD: \"yes\"\n - name: mysql\n id: mysql:8\n env:\n MYSQL_DATABASE: gorm\n MYSQL_USER: gorm\n MYSQL_PASSWORD: gorm\n MYSQL_RANDOM_ROOT_PASSWORD: \"yes\"\n - name: mysql57\n id: mysql:5.7\n env:\n MYSQL_DATABASE: gorm\n MYSQL_USER: gorm\n MYSQL_PASSWORD: gorm\n MYSQL_RANDOM_ROOT_PASSWORD: \"yes\"\n - name: mysql56\n id: mysql:5.6\n env:\n MYSQL_DATABASE: gorm\n MYSQL_USER: gorm\n MYSQL_PASSWORD: gorm\n MYSQL_RANDOM_ROOT_PASSWORD: \"yes\"\n - name: mysql55\n id: mysql:5.5\n env:\n MYSQL_DATABASE: gorm\n MYSQL_USER: gorm\n MYSQL_PASSWORD: gorm\n MYSQL_RANDOM_ROOT_PASSWORD: \"yes\"\n - name: postgres\n id: postgres:latest\n env:\n POSTGRES_USER: gorm\n POSTGRES_PASSWORD: gorm\n POSTGRES_DB: gorm\n - name: postgres96\n id: postgres:9.6\n env:\n POSTGRES_USER: gorm\n POSTGRES_PASSWORD: gorm\n POSTGRES_DB: gorm\n - name: postgres95\n id: postgres:9.5\n env:\n POSTGRES_USER: gorm\n POSTGRES_PASSWORD: gorm\n POSTGRES_DB: gorm\n - name: postgres94\n id: postgres:9.4\n env:\n POSTGRES_USER: gorm\n POSTGRES_PASSWORD: gorm\n POSTGRES_DB: gorm\n - name: postgres93\n id: postgres:9.3\n env:\n POSTGRES_USER: gorm\n POSTGRES_PASSWORD: gorm\n POSTGRES_DB: gorm\n - name: mssql\n id: mcmoe/mssqldocker:latest\n env:\n ACCEPT_EULA: Y\n SA_PASSWORD: LoremIpsum86\n MSSQL_DB: gorm\n MSSQL_USER: gorm\n MSSQL_PASSWORD: LoremIpsum86\n\n# The steps that will be executed in the build pipeline\nbuild:\n # The steps that will be executed on build\n steps:\n # Sets the go workspace and places you package\n # at the right place in the workspace tree\n - setup-go-workspace\n\n # Gets the dependencies\n - script:\n name: go get\n code: |\n cd $WERCKER_SOURCE_DIR\n go version\n go get -t ./...\n\n # Build the project\n - script:\n name: go build\n code: |\n go build ./...\n\n # Test the project\n - script:\n name: test sqlite\n code: |\n go test ./...\n\n - script:\n name: test mariadb\n code: |\n GORM_DIALECT=mysql GORM_DSN=\"gorm:gorm@tcp(mariadb:3306)/gorm?charset=utf8&parseTime=True\" go test ./...\n\n - script:\n name: test mysql\n code: |\n GORM_DIALECT=mysql GORM_DSN=\"gorm:gorm@tcp(mysql:3306)/gorm?charset=utf8&parseTime=True\" go test ./...\n\n - script:\n name: test mysql5.7\n code: |\n GORM_DIALECT=mysql GORM_DSN=\"gorm:gorm@tcp(mysql57:3306)/gorm?charset=utf8&parseTime=True\" go test ./...\n\n - script:\n name: test mysql5.6\n code: |\n GORM_DIALECT=mysql GORM_DSN=\"gorm:gorm@tcp(mysql56:3306)/gorm?charset=utf8&parseTime=True\" go test ./...\n\n - script:\n name: test mysql5.5\n code: |\n GORM_DIALECT=mysql GORM_DSN=\"gorm:gorm@tcp(mysql55:3306)/gorm?charset=utf8&parseTime=True\" go test ./...\n\n - script:\n name: test postgres\n code: |\n GORM_DIALECT=postgres GORM_DSN=\"host=postgres user=gorm password=gorm DB.name=gorm port=5432 sslmode=disable\" go test ./...\n\n - script:\n name: test postgres96\n code: |\n GORM_DIALECT=postgres GORM_DSN=\"host=postgres96 user=gorm password=gorm DB.name=gorm port=5432 sslmode=disable\" go test ./...\n\n - script:\n name: test postgres95\n code: |\n GORM_DIALECT=postgres GORM_DSN=\"host=postgres95 user=gorm password=gorm DB.name=gorm port=5432 sslmode=disable\" go test ./...\n\n - script:\n name: test postgres94\n code: |\n GORM_DIALECT=postgres GORM_DSN=\"host=postgres94 user=gorm password=gorm DB.name=gorm port=5432 sslmode=disable\" go test ./...\n\n - script:\n name: test postgres93\n code: |\n GORM_DIALECT=postgres GORM_DSN=\"host=postgres93 user=gorm password=gorm DB.name=gorm port=5432 sslmode=disable\" go test ./...\n\n - script:\n name: test mssql\n code: |\n GORM_DIALECT=mssql GORM_DSN=\"sqlserver://gorm:LoremIpsum86@mssql:1433?database=gorm\" go test ./...\n" }, { "path": "vendor/github.com/jinzhu/inflection/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2015 - Jinzhu\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/jinzhu/inflection/README.md", "content": "Inflection\n=========\n\nInflection pluralizes and singularizes English nouns\n\n## Basic Usage\n\n```go\ninflection.Plural(\"person\") => \"people\"\ninflection.Plural(\"Person\") => \"People\"\ninflection.Plural(\"PERSON\") => \"PEOPLE\"\ninflection.Plural(\"bus\") => \"buses\"\ninflection.Plural(\"BUS\") => \"BUSES\"\ninflection.Plural(\"Bus\") => \"Buses\"\n\ninflection.Singular(\"people\") => \"person\"\ninflection.Singular(\"People\") => \"Person\"\ninflection.Singular(\"PEOPLE\") => \"PERSON\"\ninflection.Singular(\"buses\") => \"bus\"\ninflection.Singular(\"BUSES\") => \"BUS\"\ninflection.Singular(\"Buses\") => \"Bus\"\n\ninflection.Plural(\"FancyPerson\") => \"FancyPeople\"\ninflection.Singular(\"FancyPeople\") => \"FancyPerson\"\n```\n\n## Register Rules\n\nStandard rules are from Rails's ActiveSupport (https://github.com/rails/rails/blob/master/activesupport/lib/active_support/inflections.rb)\n\nIf you want to register more rules, follow:\n\n```\ninflection.AddUncountable(\"fish\")\ninflection.AddIrregular(\"person\", \"people\")\ninflection.AddPlural(\"(bu)s$\", \"${1}ses\") # \"bus\" => \"buses\" / \"BUS\" => \"BUSES\" / \"Bus\" => \"Buses\"\ninflection.AddSingular(\"(bus)(es)?$\", \"${1}\") # \"buses\" => \"bus\" / \"Buses\" => \"Bus\" / \"BUSES\" => \"BUS\"\n```\n\n## Supporting the project\n\n[![http://patreon.com/jinzhu](http://patreon_public_assets.s3.amazonaws.com/sized/becomeAPatronBanner.png)](http://patreon.com/jinzhu)\n\n\n## Author\n\n**jinzhu**\n\n* \n* \n* \n\n## License\n\nReleased under the [MIT License](http://www.opensource.org/licenses/MIT).\n" }, { "path": "vendor/github.com/jinzhu/inflection/inflections.go", "content": "/*\nPackage inflection pluralizes and singularizes English nouns.\n\n\t\tinflection.Plural(\"person\") => \"people\"\n\t\tinflection.Plural(\"Person\") => \"People\"\n\t\tinflection.Plural(\"PERSON\") => \"PEOPLE\"\n\n\t\tinflection.Singular(\"people\") => \"person\"\n\t\tinflection.Singular(\"People\") => \"Person\"\n\t\tinflection.Singular(\"PEOPLE\") => \"PERSON\"\n\n\t\tinflection.Plural(\"FancyPerson\") => \"FancydPeople\"\n\t\tinflection.Singular(\"FancyPeople\") => \"FancydPerson\"\n\nStandard rules are from Rails's ActiveSupport (https://github.com/rails/rails/blob/master/activesupport/lib/active_support/inflections.rb)\n\nIf you want to register more rules, follow:\n\n\t\tinflection.AddUncountable(\"fish\")\n\t\tinflection.AddIrregular(\"person\", \"people\")\n\t\tinflection.AddPlural(\"(bu)s$\", \"${1}ses\") # \"bus\" => \"buses\" / \"BUS\" => \"BUSES\" / \"Bus\" => \"Buses\"\n\t\tinflection.AddSingular(\"(bus)(es)?$\", \"${1}\") # \"buses\" => \"bus\" / \"Buses\" => \"Bus\" / \"BUSES\" => \"BUS\"\n*/\npackage inflection\n\nimport (\n\t\"regexp\"\n\t\"strings\"\n)\n\ntype inflection struct {\n\tregexp *regexp.Regexp\n\treplace string\n}\n\n// Regular is a regexp find replace inflection\ntype Regular struct {\n\tfind string\n\treplace string\n}\n\n// Irregular is a hard replace inflection,\n// containing both singular and plural forms\ntype Irregular struct {\n\tsingular string\n\tplural string\n}\n\n// RegularSlice is a slice of Regular inflections\ntype RegularSlice []Regular\n\n// IrregularSlice is a slice of Irregular inflections\ntype IrregularSlice []Irregular\n\nvar pluralInflections = RegularSlice{\n\t{\"([a-z])$\", \"${1}s\"},\n\t{\"s$\", \"s\"},\n\t{\"^(ax|test)is$\", \"${1}es\"},\n\t{\"(octop|vir)us$\", \"${1}i\"},\n\t{\"(octop|vir)i$\", \"${1}i\"},\n\t{\"(alias|status)$\", \"${1}es\"},\n\t{\"(bu)s$\", \"${1}ses\"},\n\t{\"(buffal|tomat)o$\", \"${1}oes\"},\n\t{\"([ti])um$\", \"${1}a\"},\n\t{\"([ti])a$\", \"${1}a\"},\n\t{\"sis$\", \"ses\"},\n\t{\"(?:([^f])fe|([lr])f)$\", \"${1}${2}ves\"},\n\t{\"(hive)$\", \"${1}s\"},\n\t{\"([^aeiouy]|qu)y$\", \"${1}ies\"},\n\t{\"(x|ch|ss|sh)$\", \"${1}es\"},\n\t{\"(matr|vert|ind)(?:ix|ex)$\", \"${1}ices\"},\n\t{\"^(m|l)ouse$\", \"${1}ice\"},\n\t{\"^(m|l)ice$\", \"${1}ice\"},\n\t{\"^(ox)$\", \"${1}en\"},\n\t{\"^(oxen)$\", \"${1}\"},\n\t{\"(quiz)$\", \"${1}zes\"},\n}\n\nvar singularInflections = RegularSlice{\n\t{\"s$\", \"\"},\n\t{\"(ss)$\", \"${1}\"},\n\t{\"(n)ews$\", \"${1}ews\"},\n\t{\"([ti])a$\", \"${1}um\"},\n\t{\"((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)(sis|ses)$\", \"${1}sis\"},\n\t{\"(^analy)(sis|ses)$\", \"${1}sis\"},\n\t{\"([^f])ves$\", \"${1}fe\"},\n\t{\"(hive)s$\", \"${1}\"},\n\t{\"(tive)s$\", \"${1}\"},\n\t{\"([lr])ves$\", \"${1}f\"},\n\t{\"([^aeiouy]|qu)ies$\", \"${1}y\"},\n\t{\"(s)eries$\", \"${1}eries\"},\n\t{\"(m)ovies$\", \"${1}ovie\"},\n\t{\"(c)ookies$\", \"${1}ookie\"},\n\t{\"(x|ch|ss|sh)es$\", \"${1}\"},\n\t{\"^(m|l)ice$\", \"${1}ouse\"},\n\t{\"(bus)(es)?$\", \"${1}\"},\n\t{\"(o)es$\", \"${1}\"},\n\t{\"(shoe)s$\", \"${1}\"},\n\t{\"(cris|test)(is|es)$\", \"${1}is\"},\n\t{\"^(a)x[ie]s$\", \"${1}xis\"},\n\t{\"(octop|vir)(us|i)$\", \"${1}us\"},\n\t{\"(alias|status)(es)?$\", \"${1}\"},\n\t{\"^(ox)en\", \"${1}\"},\n\t{\"(vert|ind)ices$\", \"${1}ex\"},\n\t{\"(matr)ices$\", \"${1}ix\"},\n\t{\"(quiz)zes$\", \"${1}\"},\n\t{\"(database)s$\", \"${1}\"},\n}\n\nvar irregularInflections = IrregularSlice{\n\t{\"person\", \"people\"},\n\t{\"man\", \"men\"},\n\t{\"child\", \"children\"},\n\t{\"sex\", \"sexes\"},\n\t{\"move\", \"moves\"},\n\t{\"mombie\", \"mombies\"},\n}\n\nvar uncountableInflections = []string{\"equipment\", \"information\", \"rice\", \"money\", \"species\", \"series\", \"fish\", \"sheep\", \"jeans\", \"police\"}\n\nvar compiledPluralMaps []inflection\nvar compiledSingularMaps []inflection\n\nfunc compile() {\n\tcompiledPluralMaps = []inflection{}\n\tcompiledSingularMaps = []inflection{}\n\tfor _, uncountable := range uncountableInflections {\n\t\tinf := inflection{\n\t\t\tregexp: regexp.MustCompile(\"^(?i)(\" + uncountable + \")$\"),\n\t\t\treplace: \"${1}\",\n\t\t}\n\t\tcompiledPluralMaps = append(compiledPluralMaps, inf)\n\t\tcompiledSingularMaps = append(compiledSingularMaps, inf)\n\t}\n\n\tfor _, value := range irregularInflections {\n\t\tinfs := []inflection{\n\t\t\tinflection{regexp: regexp.MustCompile(strings.ToUpper(value.singular) + \"$\"), replace: strings.ToUpper(value.plural)},\n\t\t\tinflection{regexp: regexp.MustCompile(strings.Title(value.singular) + \"$\"), replace: strings.Title(value.plural)},\n\t\t\tinflection{regexp: regexp.MustCompile(value.singular + \"$\"), replace: value.plural},\n\t\t}\n\t\tcompiledPluralMaps = append(compiledPluralMaps, infs...)\n\t}\n\n\tfor _, value := range irregularInflections {\n\t\tinfs := []inflection{\n\t\t\tinflection{regexp: regexp.MustCompile(strings.ToUpper(value.plural) + \"$\"), replace: strings.ToUpper(value.singular)},\n\t\t\tinflection{regexp: regexp.MustCompile(strings.Title(value.plural) + \"$\"), replace: strings.Title(value.singular)},\n\t\t\tinflection{regexp: regexp.MustCompile(value.plural + \"$\"), replace: value.singular},\n\t\t}\n\t\tcompiledSingularMaps = append(compiledSingularMaps, infs...)\n\t}\n\n\tfor i := len(pluralInflections) - 1; i >= 0; i-- {\n\t\tvalue := pluralInflections[i]\n\t\tinfs := []inflection{\n\t\t\tinflection{regexp: regexp.MustCompile(strings.ToUpper(value.find)), replace: strings.ToUpper(value.replace)},\n\t\t\tinflection{regexp: regexp.MustCompile(value.find), replace: value.replace},\n\t\t\tinflection{regexp: regexp.MustCompile(\"(?i)\" + value.find), replace: value.replace},\n\t\t}\n\t\tcompiledPluralMaps = append(compiledPluralMaps, infs...)\n\t}\n\n\tfor i := len(singularInflections) - 1; i >= 0; i-- {\n\t\tvalue := singularInflections[i]\n\t\tinfs := []inflection{\n\t\t\tinflection{regexp: regexp.MustCompile(strings.ToUpper(value.find)), replace: strings.ToUpper(value.replace)},\n\t\t\tinflection{regexp: regexp.MustCompile(value.find), replace: value.replace},\n\t\t\tinflection{regexp: regexp.MustCompile(\"(?i)\" + value.find), replace: value.replace},\n\t\t}\n\t\tcompiledSingularMaps = append(compiledSingularMaps, infs...)\n\t}\n}\n\nfunc init() {\n\tcompile()\n}\n\n// AddPlural adds a plural inflection\nfunc AddPlural(find, replace string) {\n\tpluralInflections = append(pluralInflections, Regular{find, replace})\n\tcompile()\n}\n\n// AddSingular adds a singular inflection\nfunc AddSingular(find, replace string) {\n\tsingularInflections = append(singularInflections, Regular{find, replace})\n\tcompile()\n}\n\n// AddIrregular adds an irregular inflection\nfunc AddIrregular(singular, plural string) {\n\tirregularInflections = append(irregularInflections, Irregular{singular, plural})\n\tcompile()\n}\n\n// AddUncountable adds an uncountable inflection\nfunc AddUncountable(values ...string) {\n\tuncountableInflections = append(uncountableInflections, values...)\n\tcompile()\n}\n\n// GetPlural retrieves the plural inflection values\nfunc GetPlural() RegularSlice {\n\tplurals := make(RegularSlice, len(pluralInflections))\n\tcopy(plurals, pluralInflections)\n\treturn plurals\n}\n\n// GetSingular retrieves the singular inflection values\nfunc GetSingular() RegularSlice {\n\tsingulars := make(RegularSlice, len(singularInflections))\n\tcopy(singulars, singularInflections)\n\treturn singulars\n}\n\n// GetIrregular retrieves the irregular inflection values\nfunc GetIrregular() IrregularSlice {\n\tirregular := make(IrregularSlice, len(irregularInflections))\n\tcopy(irregular, irregularInflections)\n\treturn irregular\n}\n\n// GetUncountable retrieves the uncountable inflection values\nfunc GetUncountable() []string {\n\tuncountables := make([]string, len(uncountableInflections))\n\tcopy(uncountables, uncountableInflections)\n\treturn uncountables\n}\n\n// SetPlural sets the plural inflections slice\nfunc SetPlural(inflections RegularSlice) {\n\tpluralInflections = inflections\n\tcompile()\n}\n\n// SetSingular sets the singular inflections slice\nfunc SetSingular(inflections RegularSlice) {\n\tsingularInflections = inflections\n\tcompile()\n}\n\n// SetIrregular sets the irregular inflections slice\nfunc SetIrregular(inflections IrregularSlice) {\n\tirregularInflections = inflections\n\tcompile()\n}\n\n// SetUncountable sets the uncountable inflections slice\nfunc SetUncountable(inflections []string) {\n\tuncountableInflections = inflections\n\tcompile()\n}\n\n// Plural converts a word to its plural form\nfunc Plural(str string) string {\n\tfor _, inflection := range compiledPluralMaps {\n\t\tif inflection.regexp.MatchString(str) {\n\t\t\treturn inflection.regexp.ReplaceAllString(str, inflection.replace)\n\t\t}\n\t}\n\treturn str\n}\n\n// Singular converts a word to its singular form\nfunc Singular(str string) string {\n\tfor _, inflection := range compiledSingularMaps {\n\t\tif inflection.regexp.MatchString(str) {\n\t\t\treturn inflection.regexp.ReplaceAllString(str, inflection.replace)\n\t\t}\n\t}\n\treturn str\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/LICENSE", "content": "Copyright (c) 2016 Mail.Ru Group\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n" }, { "path": "vendor/github.com/mailru/easyjson/buffer/pool.go", "content": "// Package buffer implements a buffer for serialization, consisting of a chain of []byte-s to\n// reduce copying and to allow reuse of individual chunks.\npackage buffer\n\nimport (\n\t\"io\"\n\t\"sync\"\n)\n\n// PoolConfig contains configuration for the allocation and reuse strategy.\ntype PoolConfig struct {\n\tStartSize int // Minimum chunk size that is allocated.\n\tPooledSize int // Minimum chunk size that is reused, reusing chunks too small will result in overhead.\n\tMaxSize int // Maximum chunk size that will be allocated.\n}\n\nvar config = PoolConfig{\n\tStartSize: 128,\n\tPooledSize: 512,\n\tMaxSize: 32768,\n}\n\n// Reuse pool: chunk size -> pool.\nvar buffers = map[int]*sync.Pool{}\n\nfunc initBuffers() {\n\tfor l := config.PooledSize; l <= config.MaxSize; l *= 2 {\n\t\tbuffers[l] = new(sync.Pool)\n\t}\n}\n\nfunc init() {\n\tinitBuffers()\n}\n\n// Init sets up a non-default pooling and allocation strategy. Should be run before serialization is done.\nfunc Init(cfg PoolConfig) {\n\tconfig = cfg\n\tinitBuffers()\n}\n\n// putBuf puts a chunk to reuse pool if it can be reused.\nfunc putBuf(buf []byte) {\n\tsize := cap(buf)\n\tif size < config.PooledSize {\n\t\treturn\n\t}\n\tif c := buffers[size]; c != nil {\n\t\tc.Put(buf[:0])\n\t}\n}\n\n// getBuf gets a chunk from reuse pool or creates a new one if reuse failed.\nfunc getBuf(size int) []byte {\n\tif size < config.PooledSize {\n\t\treturn make([]byte, 0, size)\n\t}\n\n\tif c := buffers[size]; c != nil {\n\t\tv := c.Get()\n\t\tif v != nil {\n\t\t\treturn v.([]byte)\n\t\t}\n\t}\n\treturn make([]byte, 0, size)\n}\n\n// Buffer is a buffer optimized for serialization without extra copying.\ntype Buffer struct {\n\n\t// Buf is the current chunk that can be used for serialization.\n\tBuf []byte\n\n\ttoPool []byte\n\tbufs [][]byte\n}\n\n// EnsureSpace makes sure that the current chunk contains at least s free bytes,\n// possibly creating a new chunk.\nfunc (b *Buffer) EnsureSpace(s int) {\n\tif cap(b.Buf)-len(b.Buf) >= s {\n\t\treturn\n\t}\n\tl := len(b.Buf)\n\tif l > 0 {\n\t\tif cap(b.toPool) != cap(b.Buf) {\n\t\t\t// Chunk was reallocated, toPool can be pooled.\n\t\t\tputBuf(b.toPool)\n\t\t}\n\t\tif cap(b.bufs) == 0 {\n\t\t\tb.bufs = make([][]byte, 0, 8)\n\t\t}\n\t\tb.bufs = append(b.bufs, b.Buf)\n\t\tl = cap(b.toPool) * 2\n\t} else {\n\t\tl = config.StartSize\n\t}\n\n\tif l > config.MaxSize {\n\t\tl = config.MaxSize\n\t}\n\tb.Buf = getBuf(l)\n\tb.toPool = b.Buf\n}\n\n// AppendByte appends a single byte to buffer.\nfunc (b *Buffer) AppendByte(data byte) {\n\tif cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined.\n\t\tb.EnsureSpace(1)\n\t}\n\tb.Buf = append(b.Buf, data)\n}\n\n// AppendBytes appends a byte slice to buffer.\nfunc (b *Buffer) AppendBytes(data []byte) {\n\tfor len(data) > 0 {\n\t\tif cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined.\n\t\t\tb.EnsureSpace(1)\n\t\t}\n\n\t\tsz := cap(b.Buf) - len(b.Buf)\n\t\tif sz > len(data) {\n\t\t\tsz = len(data)\n\t\t}\n\n\t\tb.Buf = append(b.Buf, data[:sz]...)\n\t\tdata = data[sz:]\n\t}\n}\n\n// AppendBytes appends a string to buffer.\nfunc (b *Buffer) AppendString(data string) {\n\tfor len(data) > 0 {\n\t\tif cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined.\n\t\t\tb.EnsureSpace(1)\n\t\t}\n\n\t\tsz := cap(b.Buf) - len(b.Buf)\n\t\tif sz > len(data) {\n\t\t\tsz = len(data)\n\t\t}\n\n\t\tb.Buf = append(b.Buf, data[:sz]...)\n\t\tdata = data[sz:]\n\t}\n}\n\n// Size computes the size of a buffer by adding sizes of every chunk.\nfunc (b *Buffer) Size() int {\n\tsize := len(b.Buf)\n\tfor _, buf := range b.bufs {\n\t\tsize += len(buf)\n\t}\n\treturn size\n}\n\n// DumpTo outputs the contents of a buffer to a writer and resets the buffer.\nfunc (b *Buffer) DumpTo(w io.Writer) (written int, err error) {\n\tvar n int\n\tfor _, buf := range b.bufs {\n\t\tif err == nil {\n\t\t\tn, err = w.Write(buf)\n\t\t\twritten += n\n\t\t}\n\t\tputBuf(buf)\n\t}\n\n\tif err == nil {\n\t\tn, err = w.Write(b.Buf)\n\t\twritten += n\n\t}\n\tputBuf(b.toPool)\n\n\tb.bufs = nil\n\tb.Buf = nil\n\tb.toPool = nil\n\n\treturn\n}\n\n// BuildBytes creates a single byte slice with all the contents of the buffer. Data is\n// copied if it does not fit in a single chunk. You can optionally provide one byte\n// slice as argument that it will try to reuse.\nfunc (b *Buffer) BuildBytes(reuse ...[]byte) []byte {\n\tif len(b.bufs) == 0 {\n\t\tret := b.Buf\n\t\tb.toPool = nil\n\t\tb.Buf = nil\n\t\treturn ret\n\t}\n\n\tvar ret []byte\n\tsize := b.Size()\n\n\t// If we got a buffer as argument and it is big enought, reuse it.\n\tif len(reuse) == 1 && cap(reuse[0]) >= size {\n\t\tret = reuse[0][:0]\n\t} else {\n\t\tret = make([]byte, 0, size)\n\t}\n\tfor _, buf := range b.bufs {\n\t\tret = append(ret, buf...)\n\t\tputBuf(buf)\n\t}\n\n\tret = append(ret, b.Buf...)\n\tputBuf(b.toPool)\n\n\tb.bufs = nil\n\tb.toPool = nil\n\tb.Buf = nil\n\n\treturn ret\n}\n\ntype readCloser struct {\n\toffset int\n\tbufs [][]byte\n}\n\nfunc (r *readCloser) Read(p []byte) (n int, err error) {\n\tfor _, buf := range r.bufs {\n\t\t// Copy as much as we can.\n\t\tx := copy(p[n:], buf[r.offset:])\n\t\tn += x // Increment how much we filled.\n\n\t\t// Did we empty the whole buffer?\n\t\tif r.offset+x == len(buf) {\n\t\t\t// On to the next buffer.\n\t\t\tr.offset = 0\n\t\t\tr.bufs = r.bufs[1:]\n\n\t\t\t// We can release this buffer.\n\t\t\tputBuf(buf)\n\t\t} else {\n\t\t\tr.offset += x\n\t\t}\n\n\t\tif n == len(p) {\n\t\t\tbreak\n\t\t}\n\t}\n\t// No buffers left or nothing read?\n\tif len(r.bufs) == 0 {\n\t\terr = io.EOF\n\t}\n\treturn\n}\n\nfunc (r *readCloser) Close() error {\n\t// Release all remaining buffers.\n\tfor _, buf := range r.bufs {\n\t\tputBuf(buf)\n\t}\n\t// In case Close gets called multiple times.\n\tr.bufs = nil\n\n\treturn nil\n}\n\n// ReadCloser creates an io.ReadCloser with all the contents of the buffer.\nfunc (b *Buffer) ReadCloser() io.ReadCloser {\n\tret := &readCloser{0, append(b.bufs, b.Buf)}\n\n\tb.bufs = nil\n\tb.toPool = nil\n\tb.Buf = nil\n\n\treturn ret\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/jlexer/bytestostr.go", "content": "// This file will only be included to the build if neither\n// easyjson_nounsafe nor appengine build tag is set. See README notes\n// for more details.\n\n//+build !easyjson_nounsafe\n//+build !appengine\n\npackage jlexer\n\nimport (\n\t\"reflect\"\n\t\"unsafe\"\n)\n\n// bytesToStr creates a string pointing at the slice to avoid copying.\n//\n// Warning: the string returned by the function should be used with care, as the whole input data\n// chunk may be either blocked from being freed by GC because of a single string or the buffer.Data\n// may be garbage-collected even when the string exists.\nfunc bytesToStr(data []byte) string {\n\th := (*reflect.SliceHeader)(unsafe.Pointer(&data))\n\tshdr := reflect.StringHeader{Data: h.Data, Len: h.Len}\n\treturn *(*string)(unsafe.Pointer(&shdr))\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/jlexer/bytestostr_nounsafe.go", "content": "// This file is included to the build if any of the buildtags below\n// are defined. Refer to README notes for more details.\n\n//+build easyjson_nounsafe appengine\n\npackage jlexer\n\n// bytesToStr creates a string normally from []byte\n//\n// Note that this method is roughly 1.5x slower than using the 'unsafe' method.\nfunc bytesToStr(data []byte) string {\n\treturn string(data)\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/jlexer/error.go", "content": "package jlexer\n\nimport \"fmt\"\n\n// LexerError implements the error interface and represents all possible errors that can be\n// generated during parsing the JSON data.\ntype LexerError struct {\n\tReason string\n\tOffset int\n\tData string\n}\n\nfunc (l *LexerError) Error() string {\n\treturn fmt.Sprintf(\"parse error: %s near offset %d of '%s'\", l.Reason, l.Offset, l.Data)\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/jlexer/lexer.go", "content": "// Package jlexer contains a JSON lexer implementation.\n//\n// It is expected that it is mostly used with generated parser code, so the interface is tuned\n// for a parser that knows what kind of data is expected.\npackage jlexer\n\nimport (\n\t\"encoding/base64\"\n\t\"encoding/json\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"strconv\"\n\t\"unicode\"\n\t\"unicode/utf16\"\n\t\"unicode/utf8\"\n)\n\n// tokenKind determines type of a token.\ntype tokenKind byte\n\nconst (\n\ttokenUndef tokenKind = iota // No token.\n\ttokenDelim // Delimiter: one of '{', '}', '[' or ']'.\n\ttokenString // A string literal, e.g. \"abc\\u1234\"\n\ttokenNumber // Number literal, e.g. 1.5e5\n\ttokenBool // Boolean literal: true or false.\n\ttokenNull // null keyword.\n)\n\n// token describes a single token: type, position in the input and value.\ntype token struct {\n\tkind tokenKind // Type of a token.\n\n\tboolValue bool // Value if a boolean literal token.\n\tbyteValue []byte // Raw value of a token.\n\tdelimValue byte\n}\n\n// Lexer is a JSON lexer: it iterates over JSON tokens in a byte slice.\ntype Lexer struct {\n\tData []byte // Input data given to the lexer.\n\n\tstart int // Start of the current token.\n\tpos int // Current unscanned position in the input stream.\n\ttoken token // Last scanned token, if token.kind != tokenUndef.\n\n\tfirstElement bool // Whether current element is the first in array or an object.\n\twantSep byte // A comma or a colon character, which need to occur before a token.\n\n\tUseMultipleErrors bool // If we want to use multiple errors.\n\tfatalError error // Fatal error occurred during lexing. It is usually a syntax error.\n\tmultipleErrors []*LexerError // Semantic errors occurred during lexing. Marshalling will be continued after finding this errors.\n}\n\n// FetchToken scans the input for the next token.\nfunc (r *Lexer) FetchToken() {\n\tr.token.kind = tokenUndef\n\tr.start = r.pos\n\n\t// Check if r.Data has r.pos element\n\t// If it doesn't, it mean corrupted input data\n\tif len(r.Data) < r.pos {\n\t\tr.errParse(\"Unexpected end of data\")\n\t\treturn\n\t}\n\t// Determine the type of a token by skipping whitespace and reading the\n\t// first character.\n\tfor _, c := range r.Data[r.pos:] {\n\t\tswitch c {\n\t\tcase ':', ',':\n\t\t\tif r.wantSep == c {\n\t\t\t\tr.pos++\n\t\t\t\tr.start++\n\t\t\t\tr.wantSep = 0\n\t\t\t} else {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\n\t\tcase ' ', '\\t', '\\r', '\\n':\n\t\t\tr.pos++\n\t\t\tr.start++\n\n\t\tcase '\"':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\n\t\t\tr.token.kind = tokenString\n\t\t\tr.fetchString()\n\t\t\treturn\n\n\t\tcase '{', '[':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\t\t\tr.firstElement = true\n\t\t\tr.token.kind = tokenDelim\n\t\t\tr.token.delimValue = r.Data[r.pos]\n\t\t\tr.pos++\n\t\t\treturn\n\n\t\tcase '}', ']':\n\t\t\tif !r.firstElement && (r.wantSep != ',') {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\t\t\tr.wantSep = 0\n\t\t\tr.token.kind = tokenDelim\n\t\t\tr.token.delimValue = r.Data[r.pos]\n\t\t\tr.pos++\n\t\t\treturn\n\n\t\tcase '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\t\t\tr.token.kind = tokenNumber\n\t\t\tr.fetchNumber()\n\t\t\treturn\n\n\t\tcase 'n':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\n\t\t\tr.token.kind = tokenNull\n\t\t\tr.fetchNull()\n\t\t\treturn\n\n\t\tcase 't':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\n\t\t\tr.token.kind = tokenBool\n\t\t\tr.token.boolValue = true\n\t\t\tr.fetchTrue()\n\t\t\treturn\n\n\t\tcase 'f':\n\t\t\tif r.wantSep != 0 {\n\t\t\t\tr.errSyntax()\n\t\t\t}\n\n\t\t\tr.token.kind = tokenBool\n\t\t\tr.token.boolValue = false\n\t\t\tr.fetchFalse()\n\t\t\treturn\n\n\t\tdefault:\n\t\t\tr.errSyntax()\n\t\t\treturn\n\t\t}\n\t}\n\tr.fatalError = io.EOF\n\treturn\n}\n\n// isTokenEnd returns true if the char can follow a non-delimiter token\nfunc isTokenEnd(c byte) bool {\n\treturn c == ' ' || c == '\\t' || c == '\\r' || c == '\\n' || c == '[' || c == ']' || c == '{' || c == '}' || c == ',' || c == ':'\n}\n\n// fetchNull fetches and checks remaining bytes of null keyword.\nfunc (r *Lexer) fetchNull() {\n\tr.pos += 4\n\tif r.pos > len(r.Data) ||\n\t\tr.Data[r.pos-3] != 'u' ||\n\t\tr.Data[r.pos-2] != 'l' ||\n\t\tr.Data[r.pos-1] != 'l' ||\n\t\t(r.pos != len(r.Data) && !isTokenEnd(r.Data[r.pos])) {\n\n\t\tr.pos -= 4\n\t\tr.errSyntax()\n\t}\n}\n\n// fetchTrue fetches and checks remaining bytes of true keyword.\nfunc (r *Lexer) fetchTrue() {\n\tr.pos += 4\n\tif r.pos > len(r.Data) ||\n\t\tr.Data[r.pos-3] != 'r' ||\n\t\tr.Data[r.pos-2] != 'u' ||\n\t\tr.Data[r.pos-1] != 'e' ||\n\t\t(r.pos != len(r.Data) && !isTokenEnd(r.Data[r.pos])) {\n\n\t\tr.pos -= 4\n\t\tr.errSyntax()\n\t}\n}\n\n// fetchFalse fetches and checks remaining bytes of false keyword.\nfunc (r *Lexer) fetchFalse() {\n\tr.pos += 5\n\tif r.pos > len(r.Data) ||\n\t\tr.Data[r.pos-4] != 'a' ||\n\t\tr.Data[r.pos-3] != 'l' ||\n\t\tr.Data[r.pos-2] != 's' ||\n\t\tr.Data[r.pos-1] != 'e' ||\n\t\t(r.pos != len(r.Data) && !isTokenEnd(r.Data[r.pos])) {\n\n\t\tr.pos -= 5\n\t\tr.errSyntax()\n\t}\n}\n\n// fetchNumber scans a number literal token.\nfunc (r *Lexer) fetchNumber() {\n\thasE := false\n\tafterE := false\n\thasDot := false\n\n\tr.pos++\n\tfor i, c := range r.Data[r.pos:] {\n\t\tswitch {\n\t\tcase c >= '0' && c <= '9':\n\t\t\tafterE = false\n\t\tcase c == '.' && !hasDot:\n\t\t\thasDot = true\n\t\tcase (c == 'e' || c == 'E') && !hasE:\n\t\t\thasE = true\n\t\t\thasDot = true\n\t\t\tafterE = true\n\t\tcase (c == '+' || c == '-') && afterE:\n\t\t\tafterE = false\n\t\tdefault:\n\t\t\tr.pos += i\n\t\t\tif !isTokenEnd(c) {\n\t\t\t\tr.errSyntax()\n\t\t\t} else {\n\t\t\t\tr.token.byteValue = r.Data[r.start:r.pos]\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t}\n\n\tr.pos = len(r.Data)\n\tr.token.byteValue = r.Data[r.start:]\n}\n\n// findStringLen tries to scan into the string literal for ending quote char to determine required size.\n// The size will be exact if no escapes are present and may be inexact if there are escaped chars.\nfunc findStringLen(data []byte) (isValid, hasEscapes bool, length int) {\n\tdelta := 0\n\n\tfor i := 0; i < len(data); i++ {\n\t\tswitch data[i] {\n\t\tcase '\\\\':\n\t\t\ti++\n\t\t\tdelta++\n\t\t\tif i < len(data) && data[i] == 'u' {\n\t\t\t\tdelta++\n\t\t\t}\n\t\tcase '\"':\n\t\t\treturn true, (delta > 0), (i - delta)\n\t\t}\n\t}\n\n\treturn false, false, len(data)\n}\n\n// getu4 decodes \\uXXXX from the beginning of s, returning the hex value,\n// or it returns -1.\nfunc getu4(s []byte) rune {\n\tif len(s) < 6 || s[0] != '\\\\' || s[1] != 'u' {\n\t\treturn -1\n\t}\n\tvar val rune\n\tfor i := 2; i < len(s) && i < 6; i++ {\n\t\tvar v byte\n\t\tc := s[i]\n\t\tswitch c {\n\t\tcase '0', '1', '2', '3', '4', '5', '6', '7', '8', '9':\n\t\t\tv = c - '0'\n\t\tcase 'a', 'b', 'c', 'd', 'e', 'f':\n\t\t\tv = c - 'a' + 10\n\t\tcase 'A', 'B', 'C', 'D', 'E', 'F':\n\t\t\tv = c - 'A' + 10\n\t\tdefault:\n\t\t\treturn -1\n\t\t}\n\n\t\tval <<= 4\n\t\tval |= rune(v)\n\t}\n\treturn val\n}\n\n// processEscape processes a single escape sequence and returns number of bytes processed.\nfunc (r *Lexer) processEscape(data []byte) (int, error) {\n\tif len(data) < 2 {\n\t\treturn 0, fmt.Errorf(\"syntax error at %v\", string(data))\n\t}\n\n\tc := data[1]\n\tswitch c {\n\tcase '\"', '/', '\\\\':\n\t\tr.token.byteValue = append(r.token.byteValue, c)\n\t\treturn 2, nil\n\tcase 'b':\n\t\tr.token.byteValue = append(r.token.byteValue, '\\b')\n\t\treturn 2, nil\n\tcase 'f':\n\t\tr.token.byteValue = append(r.token.byteValue, '\\f')\n\t\treturn 2, nil\n\tcase 'n':\n\t\tr.token.byteValue = append(r.token.byteValue, '\\n')\n\t\treturn 2, nil\n\tcase 'r':\n\t\tr.token.byteValue = append(r.token.byteValue, '\\r')\n\t\treturn 2, nil\n\tcase 't':\n\t\tr.token.byteValue = append(r.token.byteValue, '\\t')\n\t\treturn 2, nil\n\tcase 'u':\n\t\trr := getu4(data)\n\t\tif rr < 0 {\n\t\t\treturn 0, errors.New(\"syntax error\")\n\t\t}\n\n\t\tread := 6\n\t\tif utf16.IsSurrogate(rr) {\n\t\t\trr1 := getu4(data[read:])\n\t\t\tif dec := utf16.DecodeRune(rr, rr1); dec != unicode.ReplacementChar {\n\t\t\t\tread += 6\n\t\t\t\trr = dec\n\t\t\t} else {\n\t\t\t\trr = unicode.ReplacementChar\n\t\t\t}\n\t\t}\n\t\tvar d [4]byte\n\t\ts := utf8.EncodeRune(d[:], rr)\n\t\tr.token.byteValue = append(r.token.byteValue, d[:s]...)\n\t\treturn read, nil\n\t}\n\n\treturn 0, errors.New(\"syntax error\")\n}\n\n// fetchString scans a string literal token.\nfunc (r *Lexer) fetchString() {\n\tr.pos++\n\tdata := r.Data[r.pos:]\n\n\tisValid, hasEscapes, length := findStringLen(data)\n\tif !isValid {\n\t\tr.pos += length\n\t\tr.errParse(\"unterminated string literal\")\n\t\treturn\n\t}\n\tif !hasEscapes {\n\t\tr.token.byteValue = data[:length]\n\t\tr.pos += length + 1\n\t\treturn\n\t}\n\n\tr.token.byteValue = make([]byte, 0, length)\n\tp := 0\n\tfor i := 0; i < len(data); {\n\t\tswitch data[i] {\n\t\tcase '\"':\n\t\t\tr.pos += i + 1\n\t\t\tr.token.byteValue = append(r.token.byteValue, data[p:i]...)\n\t\t\ti++\n\t\t\treturn\n\n\t\tcase '\\\\':\n\t\t\tr.token.byteValue = append(r.token.byteValue, data[p:i]...)\n\t\t\toff, err := r.processEscape(data[i:])\n\t\t\tif err != nil {\n\t\t\t\tr.errParse(err.Error())\n\t\t\t\treturn\n\t\t\t}\n\t\t\ti += off\n\t\t\tp = i\n\n\t\tdefault:\n\t\t\ti++\n\t\t}\n\t}\n\tr.errParse(\"unterminated string literal\")\n}\n\n// scanToken scans the next token if no token is currently available in the lexer.\nfunc (r *Lexer) scanToken() {\n\tif r.token.kind != tokenUndef || r.fatalError != nil {\n\t\treturn\n\t}\n\n\tr.FetchToken()\n}\n\n// consume resets the current token to allow scanning the next one.\nfunc (r *Lexer) consume() {\n\tr.token.kind = tokenUndef\n\tr.token.delimValue = 0\n}\n\n// Ok returns true if no error (including io.EOF) was encountered during scanning.\nfunc (r *Lexer) Ok() bool {\n\treturn r.fatalError == nil\n}\n\nconst maxErrorContextLen = 13\n\nfunc (r *Lexer) errParse(what string) {\n\tif r.fatalError == nil {\n\t\tvar str string\n\t\tif len(r.Data)-r.pos <= maxErrorContextLen {\n\t\t\tstr = string(r.Data)\n\t\t} else {\n\t\t\tstr = string(r.Data[r.pos:r.pos+maxErrorContextLen-3]) + \"...\"\n\t\t}\n\t\tr.fatalError = &LexerError{\n\t\t\tReason: what,\n\t\t\tOffset: r.pos,\n\t\t\tData: str,\n\t\t}\n\t}\n}\n\nfunc (r *Lexer) errSyntax() {\n\tr.errParse(\"syntax error\")\n}\n\nfunc (r *Lexer) errInvalidToken(expected string) {\n\tif r.fatalError != nil {\n\t\treturn\n\t}\n\tif r.UseMultipleErrors {\n\t\tr.pos = r.start\n\t\tr.consume()\n\t\tr.SkipRecursive()\n\t\tswitch expected {\n\t\tcase \"[\":\n\t\t\tr.token.delimValue = ']'\n\t\t\tr.token.kind = tokenDelim\n\t\tcase \"{\":\n\t\t\tr.token.delimValue = '}'\n\t\t\tr.token.kind = tokenDelim\n\t\t}\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tReason: fmt.Sprintf(\"expected %s\", expected),\n\t\t\tOffset: r.start,\n\t\t\tData: string(r.Data[r.start:r.pos]),\n\t\t})\n\t\treturn\n\t}\n\n\tvar str string\n\tif len(r.token.byteValue) <= maxErrorContextLen {\n\t\tstr = string(r.token.byteValue)\n\t} else {\n\t\tstr = string(r.token.byteValue[:maxErrorContextLen-3]) + \"...\"\n\t}\n\tr.fatalError = &LexerError{\n\t\tReason: fmt.Sprintf(\"expected %s\", expected),\n\t\tOffset: r.pos,\n\t\tData: str,\n\t}\n}\n\nfunc (r *Lexer) GetPos() int {\n\treturn r.pos\n}\n\n// Delim consumes a token and verifies that it is the given delimiter.\nfunc (r *Lexer) Delim(c byte) {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\n\tif !r.Ok() || r.token.delimValue != c {\n\t\tr.consume() // errInvalidToken can change token if UseMultipleErrors is enabled.\n\t\tr.errInvalidToken(string([]byte{c}))\n\t} else {\n\t\tr.consume()\n\t}\n}\n\n// IsDelim returns true if there was no scanning error and next token is the given delimiter.\nfunc (r *Lexer) IsDelim(c byte) bool {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\treturn !r.Ok() || r.token.delimValue == c\n}\n\n// Null verifies that the next token is null and consumes it.\nfunc (r *Lexer) Null() {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenNull {\n\t\tr.errInvalidToken(\"null\")\n\t}\n\tr.consume()\n}\n\n// IsNull returns true if the next token is a null keyword.\nfunc (r *Lexer) IsNull() bool {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\treturn r.Ok() && r.token.kind == tokenNull\n}\n\n// Skip skips a single token.\nfunc (r *Lexer) Skip() {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tr.consume()\n}\n\n// SkipRecursive skips next array or object completely, or just skips a single token if not\n// an array/object.\n//\n// Note: no syntax validation is performed on the skipped data.\nfunc (r *Lexer) SkipRecursive() {\n\tr.scanToken()\n\tvar start, end byte\n\n\tif r.token.delimValue == '{' {\n\t\tstart, end = '{', '}'\n\t} else if r.token.delimValue == '[' {\n\t\tstart, end = '[', ']'\n\t} else {\n\t\tr.consume()\n\t\treturn\n\t}\n\n\tr.consume()\n\n\tlevel := 1\n\tinQuotes := false\n\twasEscape := false\n\n\tfor i, c := range r.Data[r.pos:] {\n\t\tswitch {\n\t\tcase c == start && !inQuotes:\n\t\t\tlevel++\n\t\tcase c == end && !inQuotes:\n\t\t\tlevel--\n\t\t\tif level == 0 {\n\t\t\t\tr.pos += i + 1\n\t\t\t\treturn\n\t\t\t}\n\t\tcase c == '\\\\' && inQuotes:\n\t\t\twasEscape = !wasEscape\n\t\t\tcontinue\n\t\tcase c == '\"' && inQuotes:\n\t\t\tinQuotes = wasEscape\n\t\tcase c == '\"':\n\t\t\tinQuotes = true\n\t\t}\n\t\twasEscape = false\n\t}\n\tr.pos = len(r.Data)\n\tr.fatalError = &LexerError{\n\t\tReason: \"EOF reached while skipping array/object or token\",\n\t\tOffset: r.pos,\n\t\tData: string(r.Data[r.pos:]),\n\t}\n}\n\n// Raw fetches the next item recursively as a data slice\nfunc (r *Lexer) Raw() []byte {\n\tr.SkipRecursive()\n\tif !r.Ok() {\n\t\treturn nil\n\t}\n\treturn r.Data[r.start:r.pos]\n}\n\n// IsStart returns whether the lexer is positioned at the start\n// of an input string.\nfunc (r *Lexer) IsStart() bool {\n\treturn r.pos == 0\n}\n\n// Consumed reads all remaining bytes from the input, publishing an error if\n// there is anything but whitespace remaining.\nfunc (r *Lexer) Consumed() {\n\tif r.pos > len(r.Data) || !r.Ok() {\n\t\treturn\n\t}\n\n\tfor _, c := range r.Data[r.pos:] {\n\t\tif c != ' ' && c != '\\t' && c != '\\r' && c != '\\n' {\n\t\t\tr.AddError(&LexerError{\n\t\t\t\tReason: \"invalid character '\" + string(c) + \"' after top-level value\",\n\t\t\t\tOffset: r.pos,\n\t\t\t\tData: string(r.Data[r.pos:]),\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\tr.pos++\n\t\tr.start++\n\t}\n}\n\nfunc (r *Lexer) unsafeString() (string, []byte) {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenString {\n\t\tr.errInvalidToken(\"string\")\n\t\treturn \"\", nil\n\t}\n\tbytes := r.token.byteValue\n\tret := bytesToStr(r.token.byteValue)\n\tr.consume()\n\treturn ret, bytes\n}\n\n// UnsafeString returns the string value if the token is a string literal.\n//\n// Warning: returned string may point to the input buffer, so the string should not outlive\n// the input buffer. Intended pattern of usage is as an argument to a switch statement.\nfunc (r *Lexer) UnsafeString() string {\n\tret, _ := r.unsafeString()\n\treturn ret\n}\n\n// UnsafeBytes returns the byte slice if the token is a string literal.\nfunc (r *Lexer) UnsafeBytes() []byte {\n\t_, ret := r.unsafeString()\n\treturn ret\n}\n\n// String reads a string literal.\nfunc (r *Lexer) String() string {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenString {\n\t\tr.errInvalidToken(\"string\")\n\t\treturn \"\"\n\t}\n\tret := string(r.token.byteValue)\n\tr.consume()\n\treturn ret\n}\n\n// Bytes reads a string literal and base64 decodes it into a byte slice.\nfunc (r *Lexer) Bytes() []byte {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenString {\n\t\tr.errInvalidToken(\"string\")\n\t\treturn nil\n\t}\n\tret := make([]byte, base64.StdEncoding.DecodedLen(len(r.token.byteValue)))\n\tn, err := base64.StdEncoding.Decode(ret, r.token.byteValue)\n\tif err != nil {\n\t\tr.fatalError = &LexerError{\n\t\t\tReason: err.Error(),\n\t\t}\n\t\treturn nil\n\t}\n\n\tr.consume()\n\treturn ret[:n]\n}\n\n// Bool reads a true or false boolean keyword.\nfunc (r *Lexer) Bool() bool {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenBool {\n\t\tr.errInvalidToken(\"bool\")\n\t\treturn false\n\t}\n\tret := r.token.boolValue\n\tr.consume()\n\treturn ret\n}\n\nfunc (r *Lexer) number() string {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() || r.token.kind != tokenNumber {\n\t\tr.errInvalidToken(\"number\")\n\t\treturn \"\"\n\t}\n\tret := bytesToStr(r.token.byteValue)\n\tr.consume()\n\treturn ret\n}\n\nfunc (r *Lexer) Uint8() uint8 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 8)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn uint8(n)\n}\n\nfunc (r *Lexer) Uint16() uint16 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 16)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn uint16(n)\n}\n\nfunc (r *Lexer) Uint32() uint32 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn uint32(n)\n}\n\nfunc (r *Lexer) Uint64() uint64 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) Uint() uint {\n\treturn uint(r.Uint64())\n}\n\nfunc (r *Lexer) Int8() int8 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 8)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn int8(n)\n}\n\nfunc (r *Lexer) Int16() int16 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 16)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn int16(n)\n}\n\nfunc (r *Lexer) Int32() int32 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn int32(n)\n}\n\nfunc (r *Lexer) Int64() int64 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) Int() int {\n\treturn int(r.Int64())\n}\n\nfunc (r *Lexer) Uint8Str() uint8 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 8)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn uint8(n)\n}\n\nfunc (r *Lexer) Uint16Str() uint16 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 16)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn uint16(n)\n}\n\nfunc (r *Lexer) Uint32Str() uint32 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn uint32(n)\n}\n\nfunc (r *Lexer) Uint64Str() uint64 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseUint(s, 10, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) UintStr() uint {\n\treturn uint(r.Uint64Str())\n}\n\nfunc (r *Lexer) UintptrStr() uintptr {\n\treturn uintptr(r.Uint64Str())\n}\n\nfunc (r *Lexer) Int8Str() int8 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 8)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn int8(n)\n}\n\nfunc (r *Lexer) Int16Str() int16 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 16)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn int16(n)\n}\n\nfunc (r *Lexer) Int32Str() int32 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn int32(n)\n}\n\nfunc (r *Lexer) Int64Str() int64 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseInt(s, 10, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) IntStr() int {\n\treturn int(r.Int64Str())\n}\n\nfunc (r *Lexer) Float32() float32 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseFloat(s, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn float32(n)\n}\n\nfunc (r *Lexer) Float32Str() float32 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\tn, err := strconv.ParseFloat(s, 32)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn float32(n)\n}\n\nfunc (r *Lexer) Float64() float64 {\n\ts := r.number()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\n\tn, err := strconv.ParseFloat(s, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: s,\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) Float64Str() float64 {\n\ts, b := r.unsafeString()\n\tif !r.Ok() {\n\t\treturn 0\n\t}\n\tn, err := strconv.ParseFloat(s, 64)\n\tif err != nil {\n\t\tr.addNonfatalError(&LexerError{\n\t\t\tOffset: r.start,\n\t\t\tReason: err.Error(),\n\t\t\tData: string(b),\n\t\t})\n\t}\n\treturn n\n}\n\nfunc (r *Lexer) Error() error {\n\treturn r.fatalError\n}\n\nfunc (r *Lexer) AddError(e error) {\n\tif r.fatalError == nil {\n\t\tr.fatalError = e\n\t}\n}\n\nfunc (r *Lexer) AddNonFatalError(e error) {\n\tr.addNonfatalError(&LexerError{\n\t\tOffset: r.start,\n\t\tData: string(r.Data[r.start:r.pos]),\n\t\tReason: e.Error(),\n\t})\n}\n\nfunc (r *Lexer) addNonfatalError(err *LexerError) {\n\tif r.UseMultipleErrors {\n\t\t// We don't want to add errors with the same offset.\n\t\tif len(r.multipleErrors) != 0 && r.multipleErrors[len(r.multipleErrors)-1].Offset == err.Offset {\n\t\t\treturn\n\t\t}\n\t\tr.multipleErrors = append(r.multipleErrors, err)\n\t\treturn\n\t}\n\tr.fatalError = err\n}\n\nfunc (r *Lexer) GetNonFatalErrors() []*LexerError {\n\treturn r.multipleErrors\n}\n\n// JsonNumber fetches and json.Number from 'encoding/json' package.\n// Both int, float or string, contains them are valid values\nfunc (r *Lexer) JsonNumber() json.Number {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\tif !r.Ok() {\n\t\tr.errInvalidToken(\"json.Number\")\n\t\treturn json.Number(\"\")\n\t}\n\n\tswitch r.token.kind {\n\tcase tokenString:\n\t\treturn json.Number(r.String())\n\tcase tokenNumber:\n\t\treturn json.Number(r.Raw())\n\tcase tokenNull:\n\t\tr.Null()\n\t\treturn json.Number(\"\")\n\tdefault:\n\t\tr.errSyntax()\n\t\treturn json.Number(\"\")\n\t}\n}\n\n// Interface fetches an interface{} analogous to the 'encoding/json' package.\nfunc (r *Lexer) Interface() interface{} {\n\tif r.token.kind == tokenUndef && r.Ok() {\n\t\tr.FetchToken()\n\t}\n\n\tif !r.Ok() {\n\t\treturn nil\n\t}\n\tswitch r.token.kind {\n\tcase tokenString:\n\t\treturn r.String()\n\tcase tokenNumber:\n\t\treturn r.Float64()\n\tcase tokenBool:\n\t\treturn r.Bool()\n\tcase tokenNull:\n\t\tr.Null()\n\t\treturn nil\n\t}\n\n\tif r.token.delimValue == '{' {\n\t\tr.consume()\n\n\t\tret := map[string]interface{}{}\n\t\tfor !r.IsDelim('}') {\n\t\t\tkey := r.String()\n\t\t\tr.WantColon()\n\t\t\tret[key] = r.Interface()\n\t\t\tr.WantComma()\n\t\t}\n\t\tr.Delim('}')\n\n\t\tif r.Ok() {\n\t\t\treturn ret\n\t\t} else {\n\t\t\treturn nil\n\t\t}\n\t} else if r.token.delimValue == '[' {\n\t\tr.consume()\n\n\t\tvar ret []interface{}\n\t\tfor !r.IsDelim(']') {\n\t\t\tret = append(ret, r.Interface())\n\t\t\tr.WantComma()\n\t\t}\n\t\tr.Delim(']')\n\n\t\tif r.Ok() {\n\t\t\treturn ret\n\t\t} else {\n\t\t\treturn nil\n\t\t}\n\t}\n\tr.errSyntax()\n\treturn nil\n}\n\n// WantComma requires a comma to be present before fetching next token.\nfunc (r *Lexer) WantComma() {\n\tr.wantSep = ','\n\tr.firstElement = false\n}\n\n// WantColon requires a colon to be present before fetching next token.\nfunc (r *Lexer) WantColon() {\n\tr.wantSep = ':'\n\tr.firstElement = false\n}\n" }, { "path": "vendor/github.com/mailru/easyjson/jwriter/writer.go", "content": "// Package jwriter contains a JSON writer.\npackage jwriter\n\nimport (\n\t\"io\"\n\t\"strconv\"\n\t\"unicode/utf8\"\n\n\t\"github.com/mailru/easyjson/buffer\"\n)\n\n// Flags describe various encoding options. The behavior may be actually implemented in the encoder, but\n// Flags field in Writer is used to set and pass them around.\ntype Flags int\n\nconst (\n\tNilMapAsEmpty Flags = 1 << iota // Encode nil map as '{}' rather than 'null'.\n\tNilSliceAsEmpty // Encode nil slice as '[]' rather than 'null'.\n)\n\n// Writer is a JSON writer.\ntype Writer struct {\n\tFlags Flags\n\n\tError error\n\tBuffer buffer.Buffer\n\tNoEscapeHTML bool\n}\n\n// Size returns the size of the data that was written out.\nfunc (w *Writer) Size() int {\n\treturn w.Buffer.Size()\n}\n\n// DumpTo outputs the data to given io.Writer, resetting the buffer.\nfunc (w *Writer) DumpTo(out io.Writer) (written int, err error) {\n\treturn w.Buffer.DumpTo(out)\n}\n\n// BuildBytes returns writer data as a single byte slice. You can optionally provide one byte slice\n// as argument that it will try to reuse.\nfunc (w *Writer) BuildBytes(reuse ...[]byte) ([]byte, error) {\n\tif w.Error != nil {\n\t\treturn nil, w.Error\n\t}\n\n\treturn w.Buffer.BuildBytes(reuse...), nil\n}\n\n// ReadCloser returns an io.ReadCloser that can be used to read the data.\n// ReadCloser also resets the buffer.\nfunc (w *Writer) ReadCloser() (io.ReadCloser, error) {\n\tif w.Error != nil {\n\t\treturn nil, w.Error\n\t}\n\n\treturn w.Buffer.ReadCloser(), nil\n}\n\n// RawByte appends raw binary data to the buffer.\nfunc (w *Writer) RawByte(c byte) {\n\tw.Buffer.AppendByte(c)\n}\n\n// RawByte appends raw binary data to the buffer.\nfunc (w *Writer) RawString(s string) {\n\tw.Buffer.AppendString(s)\n}\n\n// Raw appends raw binary data to the buffer or sets the error if it is given. Useful for\n// calling with results of MarshalJSON-like functions.\nfunc (w *Writer) Raw(data []byte, err error) {\n\tswitch {\n\tcase w.Error != nil:\n\t\treturn\n\tcase err != nil:\n\t\tw.Error = err\n\tcase len(data) > 0:\n\t\tw.Buffer.AppendBytes(data)\n\tdefault:\n\t\tw.RawString(\"null\")\n\t}\n}\n\n// RawText encloses raw binary data in quotes and appends in to the buffer.\n// Useful for calling with results of MarshalText-like functions.\nfunc (w *Writer) RawText(data []byte, err error) {\n\tswitch {\n\tcase w.Error != nil:\n\t\treturn\n\tcase err != nil:\n\t\tw.Error = err\n\tcase len(data) > 0:\n\t\tw.String(string(data))\n\tdefault:\n\t\tw.RawString(\"null\")\n\t}\n}\n\n// Base64Bytes appends data to the buffer after base64 encoding it\nfunc (w *Writer) Base64Bytes(data []byte) {\n\tif data == nil {\n\t\tw.Buffer.AppendString(\"null\")\n\t\treturn\n\t}\n\tw.Buffer.AppendByte('\"')\n\tw.base64(data)\n\tw.Buffer.AppendByte('\"')\n}\n\nfunc (w *Writer) Uint8(n uint8) {\n\tw.Buffer.EnsureSpace(3)\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n}\n\nfunc (w *Writer) Uint16(n uint16) {\n\tw.Buffer.EnsureSpace(5)\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n}\n\nfunc (w *Writer) Uint32(n uint32) {\n\tw.Buffer.EnsureSpace(10)\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n}\n\nfunc (w *Writer) Uint(n uint) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n}\n\nfunc (w *Writer) Uint64(n uint64) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, n, 10)\n}\n\nfunc (w *Writer) Int8(n int8) {\n\tw.Buffer.EnsureSpace(4)\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n}\n\nfunc (w *Writer) Int16(n int16) {\n\tw.Buffer.EnsureSpace(6)\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n}\n\nfunc (w *Writer) Int32(n int32) {\n\tw.Buffer.EnsureSpace(11)\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n}\n\nfunc (w *Writer) Int(n int) {\n\tw.Buffer.EnsureSpace(21)\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n}\n\nfunc (w *Writer) Int64(n int64) {\n\tw.Buffer.EnsureSpace(21)\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, n, 10)\n}\n\nfunc (w *Writer) Uint8Str(n uint8) {\n\tw.Buffer.EnsureSpace(3)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Uint16Str(n uint16) {\n\tw.Buffer.EnsureSpace(5)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Uint32Str(n uint32) {\n\tw.Buffer.EnsureSpace(10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) UintStr(n uint) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Uint64Str(n uint64) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, n, 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) UintptrStr(n uintptr) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendUint(w.Buffer.Buf, uint64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Int8Str(n int8) {\n\tw.Buffer.EnsureSpace(4)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Int16Str(n int16) {\n\tw.Buffer.EnsureSpace(6)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Int32Str(n int32) {\n\tw.Buffer.EnsureSpace(11)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) IntStr(n int) {\n\tw.Buffer.EnsureSpace(21)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, int64(n), 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Int64Str(n int64) {\n\tw.Buffer.EnsureSpace(21)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendInt(w.Buffer.Buf, n, 10)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Float32(n float32) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = strconv.AppendFloat(w.Buffer.Buf, float64(n), 'g', -1, 32)\n}\n\nfunc (w *Writer) Float32Str(n float32) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendFloat(w.Buffer.Buf, float64(n), 'g', -1, 32)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Float64(n float64) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = strconv.AppendFloat(w.Buffer.Buf, n, 'g', -1, 64)\n}\n\nfunc (w *Writer) Float64Str(n float64) {\n\tw.Buffer.EnsureSpace(20)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n\tw.Buffer.Buf = strconv.AppendFloat(w.Buffer.Buf, float64(n), 'g', -1, 64)\n\tw.Buffer.Buf = append(w.Buffer.Buf, '\"')\n}\n\nfunc (w *Writer) Bool(v bool) {\n\tw.Buffer.EnsureSpace(5)\n\tif v {\n\t\tw.Buffer.Buf = append(w.Buffer.Buf, \"true\"...)\n\t} else {\n\t\tw.Buffer.Buf = append(w.Buffer.Buf, \"false\"...)\n\t}\n}\n\nconst chars = \"0123456789abcdef\"\n\nfunc isNotEscapedSingleChar(c byte, escapeHTML bool) bool {\n\t// Note: might make sense to use a table if there are more chars to escape. With 4 chars\n\t// it benchmarks the same.\n\tif escapeHTML {\n\t\treturn c != '<' && c != '>' && c != '&' && c != '\\\\' && c != '\"' && c >= 0x20 && c < utf8.RuneSelf\n\t} else {\n\t\treturn c != '\\\\' && c != '\"' && c >= 0x20 && c < utf8.RuneSelf\n\t}\n}\n\nfunc (w *Writer) String(s string) {\n\tw.Buffer.AppendByte('\"')\n\n\t// Portions of the string that contain no escapes are appended as\n\t// byte slices.\n\n\tp := 0 // last non-escape symbol\n\n\tfor i := 0; i < len(s); {\n\t\tc := s[i]\n\n\t\tif isNotEscapedSingleChar(c, !w.NoEscapeHTML) {\n\t\t\t// single-width character, no escaping is required\n\t\t\ti++\n\t\t\tcontinue\n\t\t} else if c < utf8.RuneSelf {\n\t\t\t// single-with character, need to escape\n\t\t\tw.Buffer.AppendString(s[p:i])\n\t\t\tswitch c {\n\t\t\tcase '\\t':\n\t\t\t\tw.Buffer.AppendString(`\\t`)\n\t\t\tcase '\\r':\n\t\t\t\tw.Buffer.AppendString(`\\r`)\n\t\t\tcase '\\n':\n\t\t\t\tw.Buffer.AppendString(`\\n`)\n\t\t\tcase '\\\\':\n\t\t\t\tw.Buffer.AppendString(`\\\\`)\n\t\t\tcase '\"':\n\t\t\t\tw.Buffer.AppendString(`\\\"`)\n\t\t\tdefault:\n\t\t\t\tw.Buffer.AppendString(`\\u00`)\n\t\t\t\tw.Buffer.AppendByte(chars[c>>4])\n\t\t\t\tw.Buffer.AppendByte(chars[c&0xf])\n\t\t\t}\n\n\t\t\ti++\n\t\t\tp = i\n\t\t\tcontinue\n\t\t}\n\n\t\t// broken utf\n\t\truneValue, runeWidth := utf8.DecodeRuneInString(s[i:])\n\t\tif runeValue == utf8.RuneError && runeWidth == 1 {\n\t\t\tw.Buffer.AppendString(s[p:i])\n\t\t\tw.Buffer.AppendString(`\\ufffd`)\n\t\t\ti++\n\t\t\tp = i\n\t\t\tcontinue\n\t\t}\n\n\t\t// jsonp stuff - tab separator and line separator\n\t\tif runeValue == '\\u2028' || runeValue == '\\u2029' {\n\t\t\tw.Buffer.AppendString(s[p:i])\n\t\t\tw.Buffer.AppendString(`\\u202`)\n\t\t\tw.Buffer.AppendByte(chars[runeValue&0xf])\n\t\t\ti += runeWidth\n\t\t\tp = i\n\t\t\tcontinue\n\t\t}\n\t\ti += runeWidth\n\t}\n\tw.Buffer.AppendString(s[p:])\n\tw.Buffer.AppendByte('\"')\n}\n\nconst encode = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"\nconst padChar = '='\n\nfunc (w *Writer) base64(in []byte) {\n\n\tif len(in) == 0 {\n\t\treturn\n\t}\n\n\tw.Buffer.EnsureSpace(((len(in)-1)/3 + 1) * 4)\n\n\tsi := 0\n\tn := (len(in) / 3) * 3\n\n\tfor si < n {\n\t\t// Convert 3x 8bit source bytes into 4 bytes\n\t\tval := uint(in[si+0])<<16 | uint(in[si+1])<<8 | uint(in[si+2])\n\n\t\tw.Buffer.Buf = append(w.Buffer.Buf, encode[val>>18&0x3F], encode[val>>12&0x3F], encode[val>>6&0x3F], encode[val&0x3F])\n\n\t\tsi += 3\n\t}\n\n\tremain := len(in) - si\n\tif remain == 0 {\n\t\treturn\n\t}\n\n\t// Add the remaining small block\n\tval := uint(in[si+0]) << 16\n\tif remain == 2 {\n\t\tval |= uint(in[si+1]) << 8\n\t}\n\n\tw.Buffer.Buf = append(w.Buffer.Buf, encode[val>>18&0x3F], encode[val>>12&0x3F])\n\n\tswitch remain {\n\tcase 2:\n\t\tw.Buffer.Buf = append(w.Buffer.Buf, encode[val>>6&0x3F], byte(padChar))\n\tcase 1:\n\t\tw.Buffer.Buf = append(w.Buffer.Buf, byte(padChar), byte(padChar))\n\t}\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/.travis.yml", "content": "language: go\ngo:\n - tip\n\nos:\n - linux\n - osx\n\nbefore_install:\n - go get github.com/mattn/goveralls\n - go get golang.org/x/tools/cmd/cover\nscript:\n - $HOME/gopath/bin/goveralls -repotoken 3gHdORO5k5ziZcWMBxnd9LrMZaJs8m9x5\n" }, { "path": "vendor/github.com/mattn/go-isatty/LICENSE", "content": "Copyright (c) Yasuhiro MATSUMOTO \n\nMIT License (Expat)\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n" }, { "path": "vendor/github.com/mattn/go-isatty/README.md", "content": "# go-isatty\n\n[![Godoc Reference](https://godoc.org/github.com/mattn/go-isatty?status.svg)](http://godoc.org/github.com/mattn/go-isatty)\n[![Build Status](https://travis-ci.org/mattn/go-isatty.svg?branch=master)](https://travis-ci.org/mattn/go-isatty)\n[![Coverage Status](https://coveralls.io/repos/github/mattn/go-isatty/badge.svg?branch=master)](https://coveralls.io/github/mattn/go-isatty?branch=master)\n[![Go Report Card](https://goreportcard.com/badge/mattn/go-isatty)](https://goreportcard.com/report/mattn/go-isatty)\n\nisatty for golang\n\n## Usage\n\n```go\npackage main\n\nimport (\n\t\"fmt\"\n\t\"github.com/mattn/go-isatty\"\n\t\"os\"\n)\n\nfunc main() {\n\tif isatty.IsTerminal(os.Stdout.Fd()) {\n\t\tfmt.Println(\"Is Terminal\")\n\t} else if isatty.IsCygwinTerminal(os.Stdout.Fd()) {\n\t\tfmt.Println(\"Is Cygwin/MSYS2 Terminal\")\n\t} else {\n\t\tfmt.Println(\"Is Not Terminal\")\n\t}\n}\n```\n\n## Installation\n\n```\n$ go get github.com/mattn/go-isatty\n```\n\n## License\n\nMIT\n\n## Author\n\nYasuhiro Matsumoto (a.k.a mattn)\n\n## Thanks\n\n* k-takata: base idea for IsCygwinTerminal\n\n https://github.com/k-takata/go-iscygpty\n" }, { "path": "vendor/github.com/mattn/go-isatty/doc.go", "content": "// Package isatty implements interface to isatty\npackage isatty\n" }, { "path": "vendor/github.com/mattn/go-isatty/go.mod", "content": "module github.com/mattn/go-isatty\n\nrequire golang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223\n" }, { "path": "vendor/github.com/mattn/go-isatty/go.sum", "content": "golang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223 h1:DH4skfRX4EBpamg7iV4ZlCpblAHI6s6TDM39bFZumv8=\ngolang.org/x/sys v0.0.0-20190222072716-a9d3bda3a223/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_android.go", "content": "// +build android\n\npackage isatty\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nconst ioctlReadTermios = syscall.TCGETS\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar termios syscall.Termios\n\t_, _, err := syscall.Syscall6(syscall.SYS_IOCTL, fd, ioctlReadTermios, uintptr(unsafe.Pointer(&termios)), 0, 0, 0)\n\treturn err == 0\n}\n\n// IsCygwinTerminal return true if the file descriptor is a cygwin or msys2\n// terminal. This is also always false on this environment.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_bsd.go", "content": "// +build darwin freebsd openbsd netbsd dragonfly\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nconst ioctlReadTermios = syscall.TIOCGETA\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar termios syscall.Termios\n\t_, _, err := syscall.Syscall6(syscall.SYS_IOCTL, fd, ioctlReadTermios, uintptr(unsafe.Pointer(&termios)), 0, 0, 0)\n\treturn err == 0\n}\n\n// IsCygwinTerminal return true if the file descriptor is a cygwin or msys2\n// terminal. This is also always false on this environment.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_others.go", "content": "// +build appengine js nacl\n\npackage isatty\n\n// IsTerminal returns true if the file descriptor is terminal which\n// is always false on js and appengine classic which is a sandboxed PaaS.\nfunc IsTerminal(fd uintptr) bool {\n\treturn false\n}\n\n// IsCygwinTerminal() return true if the file descriptor is a cygwin or msys2\n// terminal. This is also always false on this environment.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_solaris.go", "content": "// +build solaris\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"golang.org/x/sys/unix\"\n)\n\n// IsTerminal returns true if the given file descriptor is a terminal.\n// see: http://src.illumos.org/source/xref/illumos-gate/usr/src/lib/libbc/libc/gen/common/isatty.c\nfunc IsTerminal(fd uintptr) bool {\n\tvar termio unix.Termio\n\terr := unix.IoctlSetTermio(int(fd), unix.TCGETA, &termio)\n\treturn err == nil\n}\n\n// IsCygwinTerminal return true if the file descriptor is a cygwin or msys2\n// terminal. This is also always false on this environment.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_tcgets.go", "content": "// +build linux aix\n// +build !appengine\n// +build !android\n\npackage isatty\n\nimport \"golang.org/x/sys/unix\"\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\t_, err := unix.IoctlGetTermios(int(fd), unix.TCGETS)\n\treturn err == nil\n}\n\n// IsCygwinTerminal return true if the file descriptor is a cygwin or msys2\n// terminal. This is also always false on this environment.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/mattn/go-isatty/isatty_windows.go", "content": "// +build windows\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"strings\"\n\t\"syscall\"\n\t\"unicode/utf16\"\n\t\"unsafe\"\n)\n\nconst (\n\tfileNameInfo uintptr = 2\n\tfileTypePipe = 3\n)\n\nvar (\n\tkernel32 = syscall.NewLazyDLL(\"kernel32.dll\")\n\tprocGetConsoleMode = kernel32.NewProc(\"GetConsoleMode\")\n\tprocGetFileInformationByHandleEx = kernel32.NewProc(\"GetFileInformationByHandleEx\")\n\tprocGetFileType = kernel32.NewProc(\"GetFileType\")\n)\n\nfunc init() {\n\t// Check if GetFileInformationByHandleEx is available.\n\tif procGetFileInformationByHandleEx.Find() != nil {\n\t\tprocGetFileInformationByHandleEx = nil\n\t}\n}\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar st uint32\n\tr, _, e := syscall.Syscall(procGetConsoleMode.Addr(), 2, fd, uintptr(unsafe.Pointer(&st)), 0)\n\treturn r != 0 && e == 0\n}\n\n// Check pipe name is used for cygwin/msys2 pty.\n// Cygwin/MSYS2 PTY has a name like:\n// \\{cygwin,msys}-XXXXXXXXXXXXXXXX-ptyN-{from,to}-master\nfunc isCygwinPipeName(name string) bool {\n\ttoken := strings.Split(name, \"-\")\n\tif len(token) < 5 {\n\t\treturn false\n\t}\n\n\tif token[0] != `\\msys` && token[0] != `\\cygwin` {\n\t\treturn false\n\t}\n\n\tif token[1] == \"\" {\n\t\treturn false\n\t}\n\n\tif !strings.HasPrefix(token[2], \"pty\") {\n\t\treturn false\n\t}\n\n\tif token[3] != `from` && token[3] != `to` {\n\t\treturn false\n\t}\n\n\tif token[4] != \"master\" {\n\t\treturn false\n\t}\n\n\treturn true\n}\n\n// IsCygwinTerminal() return true if the file descriptor is a cygwin or msys2\n// terminal.\nfunc IsCygwinTerminal(fd uintptr) bool {\n\tif procGetFileInformationByHandleEx == nil {\n\t\treturn false\n\t}\n\n\t// Cygwin/msys's pty is a pipe.\n\tft, _, e := syscall.Syscall(procGetFileType.Addr(), 1, fd, 0, 0)\n\tif ft != fileTypePipe || e != 0 {\n\t\treturn false\n\t}\n\n\tvar buf [2 + syscall.MAX_PATH]uint16\n\tr, _, e := syscall.Syscall6(procGetFileInformationByHandleEx.Addr(),\n\t\t4, fd, fileNameInfo, uintptr(unsafe.Pointer(&buf)),\n\t\tuintptr(len(buf)*2), 0, 0)\n\tif r == 0 || e != 0 {\n\t\treturn false\n\t}\n\n\tl := *(*uint32)(unsafe.Pointer(&buf))\n\treturn isCygwinPipeName(string(utf16.Decode(buf[2 : 2+l/2])))\n}\n" }, { "path": "vendor/github.com/modern-go/concurrent/.gitignore", "content": "/coverage.txt\n" }, { "path": "vendor/github.com/modern-go/concurrent/.travis.yml", "content": "language: go\n\ngo:\n - 1.8.x\n - 1.x\n\nbefore_install:\n - go get -t -v ./...\n\nscript:\n - ./test.sh\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n" }, { "path": "vendor/github.com/modern-go/concurrent/LICENSE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/modern-go/concurrent/README.md", "content": "# concurrent\n\n[![Sourcegraph](https://sourcegraph.com/github.com/modern-go/concurrent/-/badge.svg)](https://sourcegraph.com/github.com/modern-go/concurrent?badge)\n[![GoDoc](http://img.shields.io/badge/go-documentation-blue.svg?style=flat-square)](http://godoc.org/github.com/modern-go/concurrent)\n[![Build Status](https://travis-ci.org/modern-go/concurrent.svg?branch=master)](https://travis-ci.org/modern-go/concurrent)\n[![codecov](https://codecov.io/gh/modern-go/concurrent/branch/master/graph/badge.svg)](https://codecov.io/gh/modern-go/concurrent)\n[![rcard](https://goreportcard.com/badge/github.com/modern-go/concurrent)](https://goreportcard.com/report/github.com/modern-go/concurrent)\n[![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](https://raw.githubusercontent.com/modern-go/concurrent/master/LICENSE)\n\n* concurrent.Map: backport sync.Map for go below 1.9\n* concurrent.Executor: goroutine with explicit ownership and cancellable\n\n# concurrent.Map\n\nbecause sync.Map is only available in go 1.9, we can use concurrent.Map to make code portable\n\n```go\nm := concurrent.NewMap()\nm.Store(\"hello\", \"world\")\nelem, found := m.Load(\"hello\")\n// elem will be \"world\"\n// found will be true\n```\n\n# concurrent.Executor\n\n```go\nexecutor := concurrent.NewUnboundedExecutor()\nexecutor.Go(func(ctx context.Context) {\n everyMillisecond := time.NewTicker(time.Millisecond)\n for {\n select {\n case <-ctx.Done():\n fmt.Println(\"goroutine exited\")\n return\n case <-everyMillisecond.C:\n // do something\n }\n }\n})\ntime.Sleep(time.Second)\nexecutor.StopAndWaitForever()\nfmt.Println(\"executor stopped\")\n```\n\nattach goroutine to executor instance, so that we can\n\n* cancel it by stop the executor with Stop/StopAndWait/StopAndWaitForever\n* handle panic by callback: the default behavior will no longer crash your application" }, { "path": "vendor/github.com/modern-go/concurrent/executor.go", "content": "package concurrent\n\nimport \"context\"\n\n// Executor replace go keyword to start a new goroutine\n// the goroutine should cancel itself if the context passed in has been cancelled\n// the goroutine started by the executor, is owned by the executor\n// we can cancel all executors owned by the executor just by stop the executor itself\n// however Executor interface does not Stop method, the one starting and owning executor\n// should use the concrete type of executor, instead of this interface.\ntype Executor interface {\n\t// Go starts a new goroutine controlled by the context\n\tGo(handler func(ctx context.Context))\n}\n" }, { "path": "vendor/github.com/modern-go/concurrent/go_above_19.go", "content": "//+build go1.9\n\npackage concurrent\n\nimport \"sync\"\n\n// Map is a wrapper for sync.Map introduced in go1.9\ntype Map struct {\n\tsync.Map\n}\n\n// NewMap creates a thread safe Map\nfunc NewMap() *Map {\n\treturn &Map{}\n}\n" }, { "path": "vendor/github.com/modern-go/concurrent/go_below_19.go", "content": "//+build !go1.9\n\npackage concurrent\n\nimport \"sync\"\n\n// Map implements a thread safe map for go version below 1.9 using mutex\ntype Map struct {\n\tlock sync.RWMutex\n\tdata map[interface{}]interface{}\n}\n\n// NewMap creates a thread safe map\nfunc NewMap() *Map {\n\treturn &Map{\n\t\tdata: make(map[interface{}]interface{}, 32),\n\t}\n}\n\n// Load is same as sync.Map Load\nfunc (m *Map) Load(key interface{}) (elem interface{}, found bool) {\n\tm.lock.RLock()\n\telem, found = m.data[key]\n\tm.lock.RUnlock()\n\treturn\n}\n\n// Load is same as sync.Map Store\nfunc (m *Map) Store(key interface{}, elem interface{}) {\n\tm.lock.Lock()\n\tm.data[key] = elem\n\tm.lock.Unlock()\n}\n" }, { "path": "vendor/github.com/modern-go/concurrent/log.go", "content": "package concurrent\n\nimport (\n\t\"os\"\n\t\"log\"\n\t\"io/ioutil\"\n)\n\n// ErrorLogger is used to print out error, can be set to writer other than stderr\nvar ErrorLogger = log.New(os.Stderr, \"\", 0)\n\n// InfoLogger is used to print informational message, default to off\nvar InfoLogger = log.New(ioutil.Discard, \"\", 0)" }, { "path": "vendor/github.com/modern-go/concurrent/test.sh", "content": "#!/usr/bin/env bash\n\nset -e\necho \"\" > coverage.txt\n\nfor d in $(go list ./... | grep -v vendor); do\n go test -coverprofile=profile.out -coverpkg=github.com/modern-go/concurrent $d\n if [ -f profile.out ]; then\n cat profile.out >> coverage.txt\n rm profile.out\n fi\ndone\n" }, { "path": "vendor/github.com/modern-go/concurrent/unbounded_executor.go", "content": "package concurrent\n\nimport (\n\t\"context\"\n\t\"fmt\"\n\t\"runtime\"\n\t\"runtime/debug\"\n\t\"sync\"\n\t\"time\"\n\t\"reflect\"\n)\n\n// HandlePanic logs goroutine panic by default\nvar HandlePanic = func(recovered interface{}, funcName string) {\n\tErrorLogger.Println(fmt.Sprintf(\"%s panic: %v\", funcName, recovered))\n\tErrorLogger.Println(string(debug.Stack()))\n}\n\n// UnboundedExecutor is a executor without limits on counts of alive goroutines\n// it tracks the goroutine started by it, and can cancel them when shutdown\ntype UnboundedExecutor struct {\n\tctx context.Context\n\tcancel context.CancelFunc\n\tactiveGoroutinesMutex *sync.Mutex\n\tactiveGoroutines map[string]int\n\tHandlePanic func(recovered interface{}, funcName string)\n}\n\n// GlobalUnboundedExecutor has the life cycle of the program itself\n// any goroutine want to be shutdown before main exit can be started from this executor\n// GlobalUnboundedExecutor expects the main function to call stop\n// it does not magically knows the main function exits\nvar GlobalUnboundedExecutor = NewUnboundedExecutor()\n\n// NewUnboundedExecutor creates a new UnboundedExecutor,\n// UnboundedExecutor can not be created by &UnboundedExecutor{}\n// HandlePanic can be set with a callback to override global HandlePanic\nfunc NewUnboundedExecutor() *UnboundedExecutor {\n\tctx, cancel := context.WithCancel(context.TODO())\n\treturn &UnboundedExecutor{\n\t\tctx: ctx,\n\t\tcancel: cancel,\n\t\tactiveGoroutinesMutex: &sync.Mutex{},\n\t\tactiveGoroutines: map[string]int{},\n\t}\n}\n\n// Go starts a new goroutine and tracks its lifecycle.\n// Panic will be recovered and logged automatically, except for StopSignal\nfunc (executor *UnboundedExecutor) Go(handler func(ctx context.Context)) {\n\tpc := reflect.ValueOf(handler).Pointer()\n\tf := runtime.FuncForPC(pc)\n\tfuncName := f.Name()\n\tfile, line := f.FileLine(pc)\n\texecutor.activeGoroutinesMutex.Lock()\n\tdefer executor.activeGoroutinesMutex.Unlock()\n\tstartFrom := fmt.Sprintf(\"%s:%d\", file, line)\n\texecutor.activeGoroutines[startFrom] += 1\n\tgo func() {\n\t\tdefer func() {\n\t\t\trecovered := recover()\n\t\t\t// if you want to quit a goroutine without trigger HandlePanic\n\t\t\t// use runtime.Goexit() to quit\n\t\t\tif recovered != nil {\n\t\t\t\tif executor.HandlePanic == nil {\n\t\t\t\t\tHandlePanic(recovered, funcName)\n\t\t\t\t} else {\n\t\t\t\t\texecutor.HandlePanic(recovered, funcName)\n\t\t\t\t}\n\t\t\t}\n\t\t\texecutor.activeGoroutinesMutex.Lock()\n\t\t\texecutor.activeGoroutines[startFrom] -= 1\n\t\t\texecutor.activeGoroutinesMutex.Unlock()\n\t\t}()\n\t\thandler(executor.ctx)\n\t}()\n}\n\n// Stop cancel all goroutines started by this executor without wait\nfunc (executor *UnboundedExecutor) Stop() {\n\texecutor.cancel()\n}\n\n// StopAndWaitForever cancel all goroutines started by this executor and\n// wait until all goroutines exited\nfunc (executor *UnboundedExecutor) StopAndWaitForever() {\n\texecutor.StopAndWait(context.Background())\n}\n\n// StopAndWait cancel all goroutines started by this executor and wait.\n// Wait can be cancelled by the context passed in.\nfunc (executor *UnboundedExecutor) StopAndWait(ctx context.Context) {\n\texecutor.cancel()\n\tfor {\n\t\toneHundredMilliseconds := time.NewTimer(time.Millisecond * 100)\n\t\tselect {\n\t\tcase <-oneHundredMilliseconds.C:\n\t\t\tif executor.checkNoActiveGoroutines() {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ctx.Done():\n\t\t\treturn\n\t\t}\n\t}\n}\n\nfunc (executor *UnboundedExecutor) checkNoActiveGoroutines() bool {\n\texecutor.activeGoroutinesMutex.Lock()\n\tdefer executor.activeGoroutinesMutex.Unlock()\n\tfor startFrom, count := range executor.activeGoroutines {\n\t\tif count > 0 {\n\t\t\tInfoLogger.Println(\"UnboundedExecutor is still waiting goroutines to quit\",\n\t\t\t\t\"startFrom\", startFrom,\n\t\t\t\t\"count\", count)\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n" }, { "path": "vendor/github.com/pkg/errors/.gitignore", "content": "# Compiled Object files, Static and Dynamic libs (Shared Objects)\n*.o\n*.a\n*.so\n\n# Folders\n_obj\n_test\n\n# Architecture specific extensions/prefixes\n*.[568vq]\n[568vq].out\n\n*.cgo1.go\n*.cgo2.c\n_cgo_defun.c\n_cgo_gotypes.go\n_cgo_export.*\n\n_testmain.go\n\n*.exe\n*.test\n*.prof\n" }, { "path": "vendor/github.com/pkg/errors/.travis.yml", "content": "language: go\ngo_import_path: github.com/pkg/errors\ngo:\n - 1.4.x\n - 1.5.x\n - 1.6.x\n - 1.7.x\n - 1.8.x\n - 1.9.x\n - 1.10.x\n - 1.11.x\n - tip\n\nscript:\n - go test -v ./...\n" }, { "path": "vendor/github.com/pkg/errors/LICENSE", "content": "Copyright (c) 2015, Dave Cheney \nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/pkg/errors/README.md", "content": "# errors [![Travis-CI](https://travis-ci.org/pkg/errors.svg)](https://travis-ci.org/pkg/errors) [![AppVeyor](https://ci.appveyor.com/api/projects/status/b98mptawhudj53ep/branch/master?svg=true)](https://ci.appveyor.com/project/davecheney/errors/branch/master) [![GoDoc](https://godoc.org/github.com/pkg/errors?status.svg)](http://godoc.org/github.com/pkg/errors) [![Report card](https://goreportcard.com/badge/github.com/pkg/errors)](https://goreportcard.com/report/github.com/pkg/errors) [![Sourcegraph](https://sourcegraph.com/github.com/pkg/errors/-/badge.svg)](https://sourcegraph.com/github.com/pkg/errors?badge)\n\nPackage errors provides simple error handling primitives.\n\n`go get github.com/pkg/errors`\n\nThe traditional error handling idiom in Go is roughly akin to\n```go\nif err != nil {\n return err\n}\n```\nwhich applied recursively up the call stack results in error reports without context or debugging information. The errors package allows programmers to add context to the failure path in their code in a way that does not destroy the original value of the error.\n\n## Adding context to an error\n\nThe errors.Wrap function returns a new error that adds context to the original error. For example\n```go\n_, err := ioutil.ReadAll(r)\nif err != nil {\n return errors.Wrap(err, \"read failed\")\n}\n```\n## Retrieving the cause of an error\n\nUsing `errors.Wrap` constructs a stack of errors, adding context to the preceding error. Depending on the nature of the error it may be necessary to reverse the operation of errors.Wrap to retrieve the original error for inspection. Any error value which implements this interface can be inspected by `errors.Cause`.\n```go\ntype causer interface {\n Cause() error\n}\n```\n`errors.Cause` will recursively retrieve the topmost error which does not implement `causer`, which is assumed to be the original cause. For example:\n```go\nswitch err := errors.Cause(err).(type) {\ncase *MyError:\n // handle specifically\ndefault:\n // unknown error\n}\n```\n\n[Read the package documentation for more information](https://godoc.org/github.com/pkg/errors).\n\n## Contributing\n\nWe welcome pull requests, bug fixes and issue reports. With that said, the bar for adding new symbols to this package is intentionally set high.\n\nBefore proposing a change, please discuss your change by raising an issue.\n\n## License\n\nBSD-2-Clause\n" }, { "path": "vendor/github.com/pkg/errors/appveyor.yml", "content": "version: build-{build}.{branch}\n\nclone_folder: C:\\gopath\\src\\github.com\\pkg\\errors\nshallow_clone: true # for startup speed\n\nenvironment:\n GOPATH: C:\\gopath\n\nplatform:\n - x64\n\n# http://www.appveyor.com/docs/installed-software\ninstall:\n # some helpful output for debugging builds\n - go version\n - go env\n # pre-installed MinGW at C:\\MinGW is 32bit only\n # but MSYS2 at C:\\msys64 has mingw64\n - set PATH=C:\\msys64\\mingw64\\bin;%PATH%\n - gcc --version\n - g++ --version\n\nbuild_script:\n - go install -v ./...\n\ntest_script:\n - set PATH=C:\\gopath\\bin;%PATH%\n - go test -v ./...\n\n#artifacts:\n# - path: '%GOPATH%\\bin\\*.exe'\ndeploy: off\n" }, { "path": "vendor/github.com/pkg/errors/errors.go", "content": "// Package errors provides simple error handling primitives.\n//\n// The traditional error handling idiom in Go is roughly akin to\n//\n// if err != nil {\n// return err\n// }\n//\n// which when applied recursively up the call stack results in error reports\n// without context or debugging information. The errors package allows\n// programmers to add context to the failure path in their code in a way\n// that does not destroy the original value of the error.\n//\n// Adding context to an error\n//\n// The errors.Wrap function returns a new error that adds context to the\n// original error by recording a stack trace at the point Wrap is called,\n// together with the supplied message. For example\n//\n// _, err := ioutil.ReadAll(r)\n// if err != nil {\n// return errors.Wrap(err, \"read failed\")\n// }\n//\n// If additional control is required, the errors.WithStack and\n// errors.WithMessage functions destructure errors.Wrap into its component\n// operations: annotating an error with a stack trace and with a message,\n// respectively.\n//\n// Retrieving the cause of an error\n//\n// Using errors.Wrap constructs a stack of errors, adding context to the\n// preceding error. Depending on the nature of the error it may be necessary\n// to reverse the operation of errors.Wrap to retrieve the original error\n// for inspection. Any error value which implements this interface\n//\n// type causer interface {\n// Cause() error\n// }\n//\n// can be inspected by errors.Cause. errors.Cause will recursively retrieve\n// the topmost error that does not implement causer, which is assumed to be\n// the original cause. For example:\n//\n// switch err := errors.Cause(err).(type) {\n// case *MyError:\n// // handle specifically\n// default:\n// // unknown error\n// }\n//\n// Although the causer interface is not exported by this package, it is\n// considered a part of its stable public interface.\n//\n// Formatted printing of errors\n//\n// All error values returned from this package implement fmt.Formatter and can\n// be formatted by the fmt package. The following verbs are supported:\n//\n// %s print the error. If the error has a Cause it will be\n// printed recursively.\n// %v see %s\n// %+v extended format. Each Frame of the error's StackTrace will\n// be printed in detail.\n//\n// Retrieving the stack trace of an error or wrapper\n//\n// New, Errorf, Wrap, and Wrapf record a stack trace at the point they are\n// invoked. This information can be retrieved with the following interface:\n//\n// type stackTracer interface {\n// StackTrace() errors.StackTrace\n// }\n//\n// The returned errors.StackTrace type is defined as\n//\n// type StackTrace []Frame\n//\n// The Frame type represents a call site in the stack trace. Frame supports\n// the fmt.Formatter interface that can be used for printing information about\n// the stack trace of this error. For example:\n//\n// if err, ok := err.(stackTracer); ok {\n// for _, f := range err.StackTrace() {\n// fmt.Printf(\"%+s:%d\", f)\n// }\n// }\n//\n// Although the stackTracer interface is not exported by this package, it is\n// considered a part of its stable public interface.\n//\n// See the documentation for Frame.Format for more details.\npackage errors\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\n// New returns an error with the supplied message.\n// New also records the stack trace at the point it was called.\nfunc New(message string) error {\n\treturn &fundamental{\n\t\tmsg: message,\n\t\tstack: callers(),\n\t}\n}\n\n// Errorf formats according to a format specifier and returns the string\n// as a value that satisfies error.\n// Errorf also records the stack trace at the point it was called.\nfunc Errorf(format string, args ...interface{}) error {\n\treturn &fundamental{\n\t\tmsg: fmt.Sprintf(format, args...),\n\t\tstack: callers(),\n\t}\n}\n\n// fundamental is an error that has a message and a stack, but no caller.\ntype fundamental struct {\n\tmsg string\n\t*stack\n}\n\nfunc (f *fundamental) Error() string { return f.msg }\n\nfunc (f *fundamental) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tio.WriteString(s, f.msg)\n\t\t\tf.stack.Format(s, verb)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's':\n\t\tio.WriteString(s, f.msg)\n\tcase 'q':\n\t\tfmt.Fprintf(s, \"%q\", f.msg)\n\t}\n}\n\n// WithStack annotates err with a stack trace at the point WithStack was called.\n// If err is nil, WithStack returns nil.\nfunc WithStack(err error) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\ntype withStack struct {\n\terror\n\t*stack\n}\n\nfunc (w *withStack) Cause() error { return w.error }\n\nfunc (w *withStack) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tfmt.Fprintf(s, \"%+v\", w.Cause())\n\t\t\tw.stack.Format(s, verb)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's':\n\t\tio.WriteString(s, w.Error())\n\tcase 'q':\n\t\tfmt.Fprintf(s, \"%q\", w.Error())\n\t}\n}\n\n// Wrap returns an error annotating err with a stack trace\n// at the point Wrap is called, and the supplied message.\n// If err is nil, Wrap returns nil.\nfunc Wrap(err error, message string) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\terr = &withMessage{\n\t\tcause: err,\n\t\tmsg: message,\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\n// Wrapf returns an error annotating err with a stack trace\n// at the point Wrapf is called, and the format specifier.\n// If err is nil, Wrapf returns nil.\nfunc Wrapf(err error, format string, args ...interface{}) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\terr = &withMessage{\n\t\tcause: err,\n\t\tmsg: fmt.Sprintf(format, args...),\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\n// WithMessage annotates err with a new message.\n// If err is nil, WithMessage returns nil.\nfunc WithMessage(err error, message string) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withMessage{\n\t\tcause: err,\n\t\tmsg: message,\n\t}\n}\n\n// WithMessagef annotates err with the format specifier.\n// If err is nil, WithMessagef returns nil.\nfunc WithMessagef(err error, format string, args ...interface{}) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withMessage{\n\t\tcause: err,\n\t\tmsg: fmt.Sprintf(format, args...),\n\t}\n}\n\ntype withMessage struct {\n\tcause error\n\tmsg string\n}\n\nfunc (w *withMessage) Error() string { return w.msg + \": \" + w.cause.Error() }\nfunc (w *withMessage) Cause() error { return w.cause }\n\nfunc (w *withMessage) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tfmt.Fprintf(s, \"%+v\\n\", w.Cause())\n\t\t\tio.WriteString(s, w.msg)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's', 'q':\n\t\tio.WriteString(s, w.Error())\n\t}\n}\n\n// Cause returns the underlying cause of the error, if possible.\n// An error value has a cause if it implements the following\n// interface:\n//\n// type causer interface {\n// Cause() error\n// }\n//\n// If the error does not implement Cause, the original error will\n// be returned. If the error is nil, nil will be returned without further\n// investigation.\nfunc Cause(err error) error {\n\ttype causer interface {\n\t\tCause() error\n\t}\n\n\tfor err != nil {\n\t\tcause, ok := err.(causer)\n\t\tif !ok {\n\t\t\tbreak\n\t\t}\n\t\terr = cause.Cause()\n\t}\n\treturn err\n}\n" }, { "path": "vendor/github.com/pkg/errors/stack.go", "content": "package errors\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"path\"\n\t\"runtime\"\n\t\"strings\"\n)\n\n// Frame represents a program counter inside a stack frame.\ntype Frame uintptr\n\n// pc returns the program counter for this frame;\n// multiple frames may have the same PC value.\nfunc (f Frame) pc() uintptr { return uintptr(f) - 1 }\n\n// file returns the full path to the file that contains the\n// function for this Frame's pc.\nfunc (f Frame) file() string {\n\tfn := runtime.FuncForPC(f.pc())\n\tif fn == nil {\n\t\treturn \"unknown\"\n\t}\n\tfile, _ := fn.FileLine(f.pc())\n\treturn file\n}\n\n// line returns the line number of source code of the\n// function for this Frame's pc.\nfunc (f Frame) line() int {\n\tfn := runtime.FuncForPC(f.pc())\n\tif fn == nil {\n\t\treturn 0\n\t}\n\t_, line := fn.FileLine(f.pc())\n\treturn line\n}\n\n// Format formats the frame according to the fmt.Formatter interface.\n//\n// %s source file\n// %d source line\n// %n function name\n// %v equivalent to %s:%d\n//\n// Format accepts flags that alter the printing of some verbs, as follows:\n//\n// %+s function name and path of source file relative to the compile time\n// GOPATH separated by \\n\\t (\\n\\t)\n// %+v equivalent to %+s:%d\nfunc (f Frame) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 's':\n\t\tswitch {\n\t\tcase s.Flag('+'):\n\t\t\tpc := f.pc()\n\t\t\tfn := runtime.FuncForPC(pc)\n\t\t\tif fn == nil {\n\t\t\t\tio.WriteString(s, \"unknown\")\n\t\t\t} else {\n\t\t\t\tfile, _ := fn.FileLine(pc)\n\t\t\t\tfmt.Fprintf(s, \"%s\\n\\t%s\", fn.Name(), file)\n\t\t\t}\n\t\tdefault:\n\t\t\tio.WriteString(s, path.Base(f.file()))\n\t\t}\n\tcase 'd':\n\t\tfmt.Fprintf(s, \"%d\", f.line())\n\tcase 'n':\n\t\tname := runtime.FuncForPC(f.pc()).Name()\n\t\tio.WriteString(s, funcname(name))\n\tcase 'v':\n\t\tf.Format(s, 's')\n\t\tio.WriteString(s, \":\")\n\t\tf.Format(s, 'd')\n\t}\n}\n\n// StackTrace is stack of Frames from innermost (newest) to outermost (oldest).\ntype StackTrace []Frame\n\n// Format formats the stack of Frames according to the fmt.Formatter interface.\n//\n// %s\tlists source files for each Frame in the stack\n// %v\tlists the source file and line number for each Frame in the stack\n//\n// Format accepts flags that alter the printing of some verbs, as follows:\n//\n// %+v Prints filename, function, and line number for each Frame in the stack.\nfunc (st StackTrace) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tswitch {\n\t\tcase s.Flag('+'):\n\t\t\tfor _, f := range st {\n\t\t\t\tfmt.Fprintf(s, \"\\n%+v\", f)\n\t\t\t}\n\t\tcase s.Flag('#'):\n\t\t\tfmt.Fprintf(s, \"%#v\", []Frame(st))\n\t\tdefault:\n\t\t\tfmt.Fprintf(s, \"%v\", []Frame(st))\n\t\t}\n\tcase 's':\n\t\tfmt.Fprintf(s, \"%s\", []Frame(st))\n\t}\n}\n\n// stack represents a stack of program counters.\ntype stack []uintptr\n\nfunc (s *stack) Format(st fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tswitch {\n\t\tcase st.Flag('+'):\n\t\t\tfor _, pc := range *s {\n\t\t\t\tf := Frame(pc)\n\t\t\t\tfmt.Fprintf(st, \"\\n%+v\", f)\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc (s *stack) StackTrace() StackTrace {\n\tf := make([]Frame, len(*s))\n\tfor i := 0; i < len(f); i++ {\n\t\tf[i] = Frame((*s)[i])\n\t}\n\treturn f\n}\n\nfunc callers() *stack {\n\tconst depth = 32\n\tvar pcs [depth]uintptr\n\tn := runtime.Callers(3, pcs[:])\n\tvar st stack = pcs[0:n]\n\treturn &st\n}\n\n// funcname removes the path prefix component of a function's name reported by func.Name().\nfunc funcname(name string) string {\n\ti := strings.LastIndex(name, \"/\")\n\tname = name[i+1:]\n\ti = strings.Index(name, \".\")\n\treturn name[i+1:]\n}\n" }, { "path": "vendor/github.com/swaggo/swag/.gitignore", "content": "dist\ntestdata/simple*/docs\ncover.out\n\n# Test binary, build with `go test -c`\n*.test\n\n# Output of the go coverage tool, specifically when used with LiteIDE\n*.out\n.idea\n.vscode\n\n# Etc\n.DS_Store\n" }, { "path": "vendor/github.com/swaggo/swag/.goreleaser.yml", "content": "build:\n main: cmd/swag/main.go\narchive:\n replacements:\n darwin: Darwin\n linux: Linux\n windows: Windows\n 386: i386\n amd64: x86_64\nchecksum:\n name_template: 'checksums.txt'\nsnapshot:\n name_template: \"{{ .Tag }}-next\"\nchangelog:\n sort: asc\n filters:\n exclude:\n - '^docs:'\n - '^test:'\n" }, { "path": "vendor/github.com/swaggo/swag/.travis.yml", "content": "language: go\nsudo: false\n\ngo:\n - 1.9.x\n - 1.10.x\n - 1.11.x\n - 1.12.x\n\ninstall:\n - make install\n\nscript:\n - make fmt-check\n - make lint\n - make vet\n - make build\n - make test\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n" }, { "path": "vendor/github.com/swaggo/swag/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment include:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or advances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at [gitter.im/swaggo/swag](https://gitter.im/swaggo/swag).The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/swaggo/swag/CONTRIBUTING.md", "content": "# Contributing\n\nWhen contributing to this repository, please first discuss the change you wish to make via issue,\nemail, or any other method with the owners of this repository before making a change. \n\nPlease note we have a code of conduct, please follow it in all your interactions with the project.\n\n## Pull Request Process\n\n1. Fork it\n2. Create your feature branch (`git checkout -b my-new-feature`)\n3. Commit your changes (`git commit -am 'Add some feature'`)\n4. Push to the branch (`git push origin my-new-feature`)\n5. Create new Pull Request\n\nPlease make an issue first if the change is likely to increase.\n" }, { "path": "vendor/github.com/swaggo/swag/Makefile", "content": "GOCMD:=$(shell which go)\nGOLINT:=$(shell which golint)\nGOIMPORT:=$(shell which goimports)\nGOFMT:=$(shell which gofmt)\nGOBUILD:=$(GOCMD) build\nGOCLEAN:=$(GOCMD) clean\nGOTEST:=$(GOCMD) test\nGOGET:=$(GOCMD) get\nGOLIST:=$(GOCMD) list\nGOVET:=$(GOCMD) vet\n\nBINARY_NAME:=swag\nPACKAGES:=$(shell $(GOLIST) github.com/swaggo/swag github.com/swaggo/swag/cmd/swag github.com/swaggo/swag/gen)\nGOFILES:=$(shell find . -name \"*.go\" -type f)\n\nexport GO111MODULE := on\n\nall: test build\n\n.PHONY: build\nbuild:\n\t$(GOBUILD) -o $(BINARY_NAME) -v ./cmd/...\n\n.PHONY: test\ntest:\n\techo \"mode: count\" > coverage.out\n\tfor PKG in $(PACKAGES); do \\\n\t\t$(GOCMD) test -v -covermode=count -coverprofile=profile.out $$PKG > tmp.out; \\\n\t\tcat tmp.out; \\\n\t\tif grep -q \"^--- FAIL\" tmp.out; then \\\n\t\t\trm tmp.out; \\\n\t\t\texit 1; \\\n\t\telif grep -q \"build failed\" tmp.out; then \\\n\t\t\trm tmp.out; \\\n\t\t\texit; \\\n\t\tfi; \\\n\t\tif [ -f profile.out ]; then \\\n\t\t\tcat profile.out | grep -v \"mode:\" >> coverage.out; \\\n\t\t\trm profile.out; \\\n\t\tfi; \\\n\tdone\n\n.PHONY: clean\nclean:\n\t$(GOCLEAN)\n\trm -f $(BINARY_NAME)\n\n.PHONY: install\ninstall:\n\t$(GOGET) -v github.com/swaggo/swag github.com/swaggo/swag/cmd/swag github.com/swaggo/swag/gen\n\t$(GOGET) github.com/stretchr/testify/assert\n\n.PHONY: lint\nlint:\n\twhich golint || $(GOGET) -u golang.org/x/lint/golint\n\tfor PKG in $(PACKAGES); do golint -set_exit_status $$PKG || exit 1; done;\n\n.PHONY: vet\nvet:\n\t$(GOVET) $(PACKAGES)\n\n.PHONY: fmt\nfmt:\n\t$(GOFMT) -s -w $(GOFILES)\n\n.PHONY: fmt-check\nfmt-check:\n\t@diff=$$($(GOFMT) -s -d $(GOFILES)); \\\n\tif [ -n \"$$diff\" ]; then \\\n\t\techo \"Please run 'make fmt' and commit the result:\"; \\\n\t\techo \"$${diff}\"; \\\n\t\texit 1; \\\n\tfi;\n\n.PHONY: view-covered\nview-covered:\n\t$(GOTEST) -coverprofile=cover.out $(TARGET)\n\t$(GOCMD) tool cover -html=cover.out" }, { "path": "vendor/github.com/swaggo/swag/PULL_REQUEST_TEMPLATE.md", "content": "**Describe the PR**\ne.g. add cool parser.\n\n**Relation issue**\ne.g. https://github.com/swaggo/swag/pull/118/files\n\n**Additional context**\nAdd any other context about the problem here.\n" }, { "path": "vendor/github.com/swaggo/swag/README.md", "content": "# swag\n\n\n\n[![Travis Status](https://img.shields.io/travis/swaggo/swag/master.svg)](https://travis-ci.org/swaggo/swag)\n[![Coverage Status](https://img.shields.io/codecov/c/github/swaggo/swag/master.svg)](https://codecov.io/gh/swaggo/swag)\n[![Go Report Card](https://goreportcard.com/badge/github.com/swaggo/swag)](https://goreportcard.com/report/github.com/swaggo/swag)\n[![codebeat badge](https://codebeat.co/badges/71e2f5e5-9e6b-405d-baf9-7cc8b5037330)](https://codebeat.co/projects/github-com-swaggo-swag-master)\n[![Go Doc](https://godoc.org/github.com/swaggo/swagg?status.svg)](https://godoc.org/github.com/swaggo/swag)\n[![Backers on Open Collective](https://opencollective.com/swag/backers/badge.svg)](#backers) \n[![Sponsors on Open Collective](https://opencollective.com/swag/sponsors/badge.svg)](#sponsors) [![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fswaggo%2Fswag.svg?type=shield)](https://app.fossa.io/projects/git%2Bgithub.com%2Fswaggo%2Fswag?ref=badge_shield)\n[![Release](https://img.shields.io/github/release/swaggo/swag.svg?style=flat-square)](https://github.com/swaggo/swag/releases)\n\n\nSwag converts Go annotations to Swagger Documentation 2.0. We've created a variety of plugins for popular [Go web frameworks](#supported-web-frameworks). This allows you to quickly integrate with an existing Go project (using Swagger UI).\n\n## Contents\n - [Getting started](#getting-started)\n - [Supported Web Frameworks](#supported-web-frameworks)\n - [How to use it with Gin](#how-to-use-it-with-gin)\n - [Implementation Status](#implementation-status)\n - [Declarative Comments Format](#declarative-comments-format)\n\t- [General API Info](#general-api-info)\n\t- [API Operation](#api-operation)\n\t- [Security](#security)\n - [Examples](#examples)\n\t- [Descriptions over multiple lines](#descriptions-over-multiple-lines)\n\t- [User defined structure with an array type](#user-defined-structure-with-an-array-type)\n\t- [Add a headers in response](#add-a-headers-in-response) \n\t- [Use multiple path params](#use-multiple-path-params)\n\t- [Example value of struct](#example-value-of-struct)\n\t- [Description of struct](#description-of-struct)\n\t- [Use swaggertype tag to supported custom type](#use-swaggertype-tag-to-supported-custom-type)\n\t- [Add extension info to struct field](#add-extension-info-to-struct-field)\n\t- [How to using security annotations](#how-to-using-security-annotations)\n- [About the Project](#about-the-project)\n\n## Getting started\n\n1. Add comments to your API source code, See [Declarative Comments Format](#declarative-comments-format).\n\n2. Download swag by using:\n```sh\n$ go get -u github.com/swaggo/swag/cmd/swag\n```\nTo build from source you need [Go](https://golang.org/dl/) (1.9 or newer).\n\nOr download the pre-compiled binaries binray form [release page](https://github.com/swaggo/swag/releases).\n\n3. Run `swag init` in the project's root folder which contains the `main.go` file. This will parse your comments and generate the required files (`docs` folder and `docs/docs.go`).\n```sh\n$ swag init\n```\n\n Make sure to import the generated `docs/docs.go` so that your specific configuration gets `init`'ed. If your General API annotations do not live in `main.go`, you can let swag know with `-g` flag.\n ```sh\n swag init -g http/api.go\n ```\n\n## swag cli\n\n```sh\n$ swag init -h\nNAME:\n swag init - Create docs.go\n\nUSAGE:\n swag init [command options] [arguments...]\n\nOPTIONS:\n --generalInfo value, -g value Go file path in which 'swagger general API Info' is written (default: \"main.go\")\n --dir value, -d value Directory you want to parse (default: \"./\")\n --propertyStrategy value, -p value Property Naming Strategy like snakecase,camelcase,pascalcase (default: \"camelcase\")\n --output value, -o value Output directory for al the generated files(swagger.json, swagger.yaml and doc.go) (default: \"./docs\")\n --parseVendor Parse go files in 'vendor' folder, disabled by default\n```\n\n## Supported Web Frameworks\n\n- [gin](http://github.com/swaggo/gin-swagger)\n- [echo](http://github.com/swaggo/echo-swagger)\n- [buffalo](https://github.com/swaggo/buffalo-swagger)\n- [net/http](https://github.com/swaggo/http-swagger)\n\n## How to use it with Gin\n\nFind the example source code [here](https://github.com/swaggo/swag/tree/master/example/celler).\n\n1. After using `swag init` to generate Swagger 2.0 docs, import the following packages:\n```go\nimport \"github.com/swaggo/gin-swagger\" // gin-swagger middleware\nimport \"github.com/swaggo/gin-swagger/swaggerFiles\" // swagger embed files\n```\n\n2. Add [General API](#general-api-info) annotations in `main.go` code:\n\n```go\n// @title Swagger Example API\n// @version 1.0\n// @description This is a sample server celler server.\n// @termsOfService http://swagger.io/terms/\n\n// @contact.name API Support\n// @contact.url http://www.swagger.io/support\n// @contact.email support@swagger.io\n\n// @license.name Apache 2.0\n// @license.url http://www.apache.org/licenses/LICENSE-2.0.html\n\n// @host localhost:8080\n// @BasePath /api/v1\n\n// @securityDefinitions.basic BasicAuth\n\n// @securityDefinitions.apikey ApiKeyAuth\n// @in header\n// @name Authorization\n\n// @securitydefinitions.oauth2.application OAuth2Application\n// @tokenUrl https://example.com/oauth/token\n// @scope.write Grants write access\n// @scope.admin Grants read and write access to administrative information\n\n// @securitydefinitions.oauth2.implicit OAuth2Implicit\n// @authorizationurl https://example.com/oauth/authorize\n// @scope.write Grants write access\n// @scope.admin Grants read and write access to administrative information\n\n// @securitydefinitions.oauth2.password OAuth2Password\n// @tokenUrl https://example.com/oauth/token\n// @scope.read Grants read access\n// @scope.write Grants write access\n// @scope.admin Grants read and write access to administrative information\n\n// @securitydefinitions.oauth2.accessCode OAuth2AccessCode\n// @tokenUrl https://example.com/oauth/token\n// @authorizationurl https://example.com/oauth/authorize\n// @scope.admin Grants read and write access to administrative information\n\nfunc main() {\n\tr := gin.Default()\n\n\tc := controller.NewController()\n\n\tv1 := r.Group(\"/api/v1\")\n\t{\n\t\taccounts := v1.Group(\"/accounts\")\n\t\t{\n\t\t\taccounts.GET(\":id\", c.ShowAccount)\n\t\t\taccounts.GET(\"\", c.ListAccounts)\n\t\t\taccounts.POST(\"\", c.AddAccount)\n\t\t\taccounts.DELETE(\":id\", c.DeleteAccount)\n\t\t\taccounts.PATCH(\":id\", c.UpdateAccount)\n\t\t\taccounts.POST(\":id/images\", c.UploadAccountImage)\n\t\t}\n //...\n\t}\n\tr.GET(\"/swagger/*any\", ginSwagger.WrapHandler(swaggerFiles.Handler))\n\tr.Run(\":8080\")\n}\n//...\n```\n\nAdditionally some general API info can be set dynamically. The generated code package `docs` exports `SwaggerInfo` variable which we can use to set the title, description, version, host and base path programatically. Example using Gin:\n\n```go\npackage main\n\nimport (\n\t\"github.com/gin-gonic/gin\"\n\t\"github.com/swaggo/gin-swagger\"\n\t\"github.com/swaggo/gin-swagger/swaggerFiles\"\n\n\t\"./docs\" // docs is generated by Swag CLI, you have to import it.\n)\n\n// @contact.name API Support\n// @contact.url http://www.swagger.io/support\n// @contact.email support@swagger.io\n\n// @license.name Apache 2.0\n// @license.url http://www.apache.org/licenses/LICENSE-2.0.html\n\n// @termsOfService http://swagger.io/terms/\n\nfunc main() {\n\n\t// programatically set swagger info\n\tdocs.SwaggerInfo.Title = \"Swagger Example API\"\n\tdocs.SwaggerInfo.Description = \"This is a sample server Petstore server.\"\n\tdocs.SwaggerInfo.Version = \"1.0\"\n\tdocs.SwaggerInfo.Host = \"petstore.swagger.io\"\n\tdocs.SwaggerInfo.BasePath = \"/v2\"\n\n\tr := gin.New()\n\n\t// use ginSwagger middleware to serve the API docs\n\tr.GET(\"/swagger/*any\", ginSwagger.WrapHandler(swaggerFiles.Handler))\n\n\tr.Run()\n}\n```\n\n3. Add [API Operation](#api-operation) annotations in `controller` code\n\n``` go\npackage controller\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n\t\"strconv\"\n\n\t\"github.com/gin-gonic/gin\"\n\t\"github.com/swaggo/swag/example/celler/httputil\"\n\t\"github.com/swaggo/swag/example/celler/model\"\n)\n\n// ShowAccount godoc\n// @Summary Show a account\n// @Description get string by ID\n// @ID get-string-by-int\n// @Accept json\n// @Produce json\n// @Param id path int true \"Account ID\"\n// @Success 200 {object} model.Account\n// @Header 200 {string} Token \"qwerty\"\n// @Failure 400 {object} httputil.HTTPError\n// @Failure 404 {object} httputil.HTTPError\n// @Failure 500 {object} httputil.HTTPError\n// @Router /accounts/{id} [get]\nfunc (c *Controller) ShowAccount(ctx *gin.Context) {\n\tid := ctx.Param(\"id\")\n\taid, err := strconv.Atoi(id)\n\tif err != nil {\n\t\thttputil.NewError(ctx, http.StatusBadRequest, err)\n\t\treturn\n\t}\n\taccount, err := model.AccountOne(aid)\n\tif err != nil {\n\t\thttputil.NewError(ctx, http.StatusNotFound, err)\n\t\treturn\n\t}\n\tctx.JSON(http.StatusOK, account)\n}\n\n// ListAccounts godoc\n// @Summary List accounts\n// @Description get accounts\n// @Accept json\n// @Produce json\n// @Param q query string false \"name search by q\"\n// @Success 200 {array} model.Account\n// @Header 200 {string} Token \"qwerty\"\n// @Failure 400 {object} httputil.HTTPError\n// @Failure 404 {object} httputil.HTTPError\n// @Failure 500 {object} httputil.HTTPError\n// @Router /accounts [get]\nfunc (c *Controller) ListAccounts(ctx *gin.Context) {\n\tq := ctx.Request.URL.Query().Get(\"q\")\n\taccounts, err := model.AccountsAll(q)\n\tif err != nil {\n\t\thttputil.NewError(ctx, http.StatusNotFound, err)\n\t\treturn\n\t}\n\tctx.JSON(http.StatusOK, accounts)\n}\n\n//...\n```\n\n```console\n$ swag init\n```\n\n4.Run your app, and browse to http://localhost:8080/swagger/index.html. You will see Swagger 2.0 Api documents as shown below:\n\n![swagger_index.html](https://raw.githubusercontent.com/swaggo/swag/master/assets/swagger-image.png)\n\n## Implementation Status\n\n[Swagger 2.0 document](https://swagger.io/docs/specification/2-0/basic-structure/)\n\n- [x] Basic Structure\n- [x] API Host and Base Path\n- [x] Paths and Operations\n- [x] Describing Parameters\n- [x] Describing Request Body\n- [x] Describing Responses\n- [x] MIME Types\n- [x] Authentication\n - [x] Basic Authentication\n - [x] API Keys\n- [x] Adding Examples\n- [x] File Upload\n- [x] Enums\n- [x] Grouping Operations With Tags\n- [ ] Swagger Extensions\n\n# Declarative Comments Format\n\n## General API Info\n\n**Example**\n[celler/main.go](https://github.com/swaggo/swag/blob/master/example/celler/main.go)\n\n| annotation | description | example |\n|-------------|--------------------------------------------|---------------------------------|\n| title | **Required.** The title of the application.| // @title Swagger Example API |\n| version | **Required.** Provides the version of the application API.| // @version 1.0 |\n| description | A short description of the application. |// @description This is a sample server celler server. \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t |\n| tag.name | Name of a tag.| // @tag.name This is the name of the tag |\n| tag.description | Description of the tag | // @tag.description Cool Description |\n| tag.docs.url | Url of the external Documentation of the tag | // @tag.docs.url https://example.com|\n| tag.docs.descripiton | Description of the external Documentation of the tag| // @tag.docs.descirption Best example documentation |\n| termsOfService | The Terms of Service for the API.| // @termsOfService http://swagger.io/terms/ |\n| contact.name | The contact information for the exposed API.| // @contact.name API Support |\n| contact.url | The URL pointing to the contact information. MUST be in the format of a URL. | // @contact.url http://www.swagger.io/support|\n| contact.email| The email address of the contact person/organization. MUST be in the format of an email address.| // @contact.email support@swagger.io |\n| license.name | **Required.** The license name used for the API.|// @license.name Apache 2.0|\n| license.url | A URL to the license used for the API. MUST be in the format of a URL. | // @license.url http://www.apache.org/licenses/LICENSE-2.0.html |\n| host | The host (name or ip) serving the API. | // @host localhost:8080 |\n| BasePath | The base path on which the API is served. | // @BasePath /api/v1 |\n| schemes | The transfer protocol for the operation that separated by spaces. | // @schemes http https |\n\n## API Operation\n\n**Example**\n[celler/controller](https://github.com/swaggo/swag/tree/master/example/celler/controller)\n\n\n| annotation | description |\n|--------------------|----------------------------------------------------------------------------------------------------------------------------|\n| description | A verbose explanation of the operation behavior. |\n| id | A unique string used to identify the operation. Must be unique among all API operations. |\n| tags | A list of tags to each API operation that separated by commas. |\n| summary | A short summary of what the operation does. |\n| accept | A list of MIME types the APIs can consume. Value MUST be as described under [Mime Types](#mime-types). |\n| produce | A list of MIME types the APIs can produce. Value MUST be as described under [Mime Types](#mime-types). |\n| param | Parameters that separated by spaces. `param name`,`param type`,`data type`,`is mandatory?`,`comment` `attribute(optional)` |\n| security | [Security](#security) to each API operation. |\n| success | Success response that separated by spaces. `return code`,`{param type}`,`data type`,`comment` |\n| failure | Failure response that separated by spaces. `return code`,`{param type}`,`data type`,`comment` |\n| header | Header in response that separated by spaces. `return code`,`{param type}`,`data type`,`comment` |\n| router | Path definition that separated by spaces. `path`,`[httpMethod]` |\n\n## Mime Types\n\n`swag` accepts all MIME Types which are in the correct format, that is, match `*/*`.\nBesides that, `swag` also accepts aliases for some MIME Types as follows:\n\n| Alias | MIME Type |\n|-----------------------|-----------------------------------|\n| json | application/json |\n| xml | text/xml |\n| plain | text/plain |\n| html | text/html |\n| mpfd | multipart/form-data |\n| x-www-form-urlencoded | application/x-www-form-urlencoded |\n| json-api | application/vnd.api+json |\n| json-stream | application/x-json-stream |\n| octet-stream | application/octet-stream |\n| png | image/png |\n| jpeg | image/jpeg |\n| gif | image/gif |\n\n\n\n## Param Type\n\n- query\n- path\n- header\n- body\n- formData\n\n## Data Type\n\n- string (string)\n- integer (int, uint, uint32, uint64)\n- number (float32)\n- boolean (bool)\n- user defined struct\n\n## Security\n| annotation | description | parameters | example |\n|------------|-------------|------------|---------|\n| securitydefinitions.basic | [Basic](https://swagger.io/docs/specification/2-0/authentication/basic-authentication/) auth. | | // @securityDefinitions.basic BasicAuth |\n| securitydefinitions.apikey | [API key](https://swagger.io/docs/specification/2-0/authentication/api-keys/) auth. | in, name | // @securityDefinitions.apikey ApiKeyAuth |\n| securitydefinitions.oauth2.application | [OAuth2 application](https://swagger.io/docs/specification/authentication/oauth2/) auth. | tokenUrl, scope | // @securitydefinitions.oauth2.application OAuth2Application |\n| securitydefinitions.oauth2.implicit | [OAuth2 implicit](https://swagger.io/docs/specification/authentication/oauth2/) auth. | authorizationUrl, scope | // @securitydefinitions.oauth2.implicit OAuth2Implicit |\n| securitydefinitions.oauth2.password | [OAuth2 password](https://swagger.io/docs/specification/authentication/oauth2/) auth. | tokenUrl, scope | // @securitydefinitions.oauth2.password OAuth2Password |\n| securitydefinitions.oauth2.accessCode | [OAuth2 access code](https://swagger.io/docs/specification/authentication/oauth2/) auth. | tokenUrl, authorizationUrl, scope | // @securitydefinitions.oauth2.accessCode OAuth2AccessCode |\n\n\n| parameters annotation | example |\n|-----------------------|----------------------------------------------------------|\n| in | // @in header |\n| name | // @name Authorization |\n| tokenUrl | // @tokenUrl https://example.com/oauth/token |\n| authorizationurl | // @authorizationurl https://example.com/oauth/authorize |\n| scope.hoge | // @scope.write Grants write access |\n\n\n## Attribute\n\n```go\n// @Param enumstring query string false \"string enums\" Enums(A, B, C)\n// @Param enumint query int false \"int enums\" Enums(1, 2, 3)\n// @Param enumnumber query number false \"int enums\" Enums(1.1, 1.2, 1.3)\n// @Param string query string false \"string valid\" minlength(5) maxlength(10)\n// @Param int query int false \"int valid\" mininum(1) maxinum(10)\n// @Param default query string false \"string default\" default(A)\n```\n\nIt also works for the struct fields:\n\n```go\ntype Foo struct {\n Bar string `minLength:\"4\" maxLength:\"16\"`\n Baz int `minimum:\"10\" maximum:\"20\" default:\"15\"`\n Qux []string `enums:\"foo,bar,baz\"`\n}\n```\n\n### Available\n\nField Name | Type | Description\n---|:---:|---\ndefault | * | Declares the value of the parameter that the server will use if none is provided, for example a \"count\" to control the number of results per page might default to 100 if not supplied by the client in the request. (Note: \"default\" has no meaning for required parameters.) See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-6.2. Unlike JSON Schema this value MUST conform to the defined [`type`](#parameterType) for this parameter.\nmaximum | `number` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.1.2.\nminimum | `number` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.1.3.\nmaxLength | `integer` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.2.1.\nminLength | `integer` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.2.2.\nenums | [\\*] | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.5.1.\nformat | `string` | The extending format for the previously mentioned [`type`](#parameterType). See [Data Type Formats](#dataTypeFormat) for further details.\n\n### Future\n\nField Name | Type | Description\n---|:---:|---\nmultipleOf | `number` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.1.1.\npattern | `string` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.2.3.\nmaxItems | `integer` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.3.2.\nminItems | `integer` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.3.3.\nuniqueItems | `boolean` | See https://tools.ietf.org/html/draft-fge-json-schema-validation-00#section-5.3.4.\ncollectionFormat | `string` | Determines the format of the array if type array is used. Possible values are:
  • `csv` - comma separated values `foo,bar`.
  • `ssv` - space separated values `foo bar`.
  • `tsv` - tab separated values `foo\\tbar`.
  • `pipes` - pipe separated values foo|bar.
  • `multi` - corresponds to multiple parameter instances instead of multiple values for a single instance `foo=bar&foo=baz`. This is valid only for parameters [`in`](#parameterIn) \"query\" or \"formData\".
Default value is `csv`.\n\n## Examples\n\n### Descriptions over multiple lines\n\nYou can add descriptions spanning multiple lines in either the general api description or routes definitions like so: \n\n```go\n// @description This is the first line\n// @description This is the second line\n// @description And so forth.\n```\n\n### User defined structure with an array type\n\n```go\n// @Success 200 {array} model.Account <-- This is a user defined struct.\n```\n\n```go\npackage model\n\ntype Account struct {\n ID int `json:\"id\" example:\"1\"`\n Name string `json:\"name\" example:\"account name\"`\n}\n```\n### Add a headers in response\n\n```go\n// @Success 200 {string} string\t\"ok\"\n// @Header 200 {string} Location \"/entity/1\"\n// @Header 200 {string} Token \"qwerty\"\n```\n\n### Use multiple path params\n\n```go\n/// ...\n// @Param group_id path int true \"Group ID\"\n// @Param account_id path int true \"Account ID\"\n// ...\n// @Router /examples/groups/{group_id}/accounts/{account_id} [get]\n```\n\n### Example value of struct\n\n```go\ntype Account struct {\n ID int `json:\"id\" example:\"1\"`\n Name string `json:\"name\" example:\"account name\"`\n PhotoUrls []string `json:\"photo_urls\" example:\"http://test/image/1.jpg,http://test/image/2.jpg\"`\n}\n```\n\n### Description of struct\n\n```go\ntype Account struct {\n\t// ID this is userid\n\tID int `json:\"id\"`\n\tName string `json:\"name\"` // This is Name\n}\n```\n\n### Use swaggertype tag to supported custom type\n[#201](https://github.com/swaggo/swag/issues/201#issuecomment-475479409)\n\n```go\ntype TimestampTime struct {\n time.Time\n}\n\n///implement encoding.JSON.Marshaler interface\nfunc (t *TimestampTime) MarshalJSON() ([]byte, error) {\n bin := make([]byte, 16)\n bin = strconv.AppendInt(bin[:0], t.Time.Unix(), 10)\n return bin, nil\n}\n\nfunc (t *TimestampTime) UnmarshalJSON(bin []byte) error {\n v, err := strconv.ParseInt(string(bin), 10, 64)\n if err != nil {\n return err\n }\n t.Time = time.Unix(v, 0)\n return nil\n}\n///\n\ntype Account struct {\n // Override primitive type by simply specifying it via `swaggertype` tag\n ID sql.NullInt64 `json:\"id\" swaggertype:\"integer\"`\n\n // Override struct type to a primitive type 'integer' by specifying it via `swaggertype` tag\n RegisterTime TimestampTime `json:\"register_time\" swaggertype:\"primitive,integer\"`\n\n // Array types can be overridden using \"array,\" format\n Coeffs []big.Float `json:\"coeffs\" swaggertype:\"array,number\"`\n}\n```\n\n### Add extension info to struct field\n\n```go\ntype Account struct {\n ID int `json:\"id\" extensions:\"x-nullable,x-abc=def\"` // extensions fields must start with \"x-\"\n}\n```\n\ngenerate swagger doc as follows:\n\n```go\n\"Account\": {\n \"type\": \"object\",\n \"properties\": {\n \"id\": {\n \"type\": \"string\",\n \"x-nullable\": true,\n \"x-abc\": \"def\"\n }\n }\n}\n```\n\n### How to using security annotations\n\nGeneral API info.\n\n```go\n// @securityDefinitions.basic BasicAuth\n\n// @securitydefinitions.oauth2.application OAuth2Application\n// @tokenUrl https://example.com/oauth/token\n// @scope.write Grants write access\n// @scope.admin Grants read and write access to administrative information\n```\n\nEach API operation.\n\n```go\n// @Security ApiKeyAuth\n```\n\nMake it AND condition\n\n```go\n// @Security ApiKeyAuth\n// @Security OAuth2Application[write, admin]\n```\n\n## About the Project\nThis project was inspired by [yvasiyarov/swagger](https://github.com/yvasiyarov/swagger) but we simplified the usage and added support a variety of [web frameworks](#supported-web-frameworks). Gopher image source is [tenntenn/gopher-stickers](https://github.com/tenntenn/gopher-stickers). It has licenses [creative commons licensing](http://creativecommons.org/licenses/by/3.0/deed.en).\n## Contributors\n\nThis project exists thanks to all the people who contribute. [[Contribute](CONTRIBUTING.md)].\n\n\n\n## Backers\n\nThank you to all our backers! 🙏 [[Become a backer](https://opencollective.com/swag#backer)]\n\n\n\n\n## Sponsors\n\nSupport this project by becoming a sponsor. Your logo will show up here with a link to your website. [[Become a sponsor](https://opencollective.com/swag#sponsor)]\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n## License\n[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fswaggo%2Fswag.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2Fswaggo%2Fswag?ref=badge_large)\n" }, { "path": "vendor/github.com/swaggo/swag/debug.go", "content": "package swag\n\nimport (\n\t\"log\"\n)\n\nconst (\n\ttest = iota\n\trelease\n)\n\nvar swagMode = release\n\nfunc isRelease() bool {\n\treturn swagMode == release\n}\n\n// Println calls Output to print to the standard logger when release mode.\nfunc Println(v ...interface{}) {\n\tif isRelease() {\n\t\tlog.Println(v...)\n\t}\n}\n\n// Printf calls Output to print to the standard logger when release mode.\nfunc Printf(format string, v ...interface{}) {\n\tif isRelease() {\n\t\tlog.Printf(format, v...)\n\t}\n}\n" }, { "path": "vendor/github.com/swaggo/swag/doc.go", "content": "/*\nPackage swag converts Go annotations to Swagger Documentation 2.0.\nSee https://github.com/swaggo/swag for more information about swag.\n*/\npackage swag // import \"github.com/swaggo/swag\"\n" }, { "path": "vendor/github.com/swaggo/swag/go.mod", "content": "module github.com/swaggo/swag\n\nrequire (\n\tgithub.com/ghodss/yaml v1.0.0\n\tgithub.com/go-openapi/jsonreference v0.19.0\n\tgithub.com/go-openapi/spec v0.19.0\n\tgithub.com/pkg/errors v0.8.1\n\tgithub.com/urfave/cli v1.20.0\n\tgolang.org/x/tools v0.0.0-20190606050223-4d9ae51c2468\n)\n" }, { "path": "vendor/github.com/swaggo/swag/go.sum", "content": "github.com/PuerkitoBio/purell v1.1.0 h1:rmGxhojJlM0tuKtfdvliR84CFHljx9ag64t2xmVkjK4=\ngithub.com/PuerkitoBio/purell v1.1.0/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 h1:d+Bc7a5rLufV/sSk/8dngufqelfh6jnri85riMAaF/M=\ngithub.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578/go.mod h1:uGdkoq3SwY9Y+13GIhn11/XLaGBb4BfwItxLd5jeuXE=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/ghodss/yaml v1.0.0 h1:wQHKEahhL6wmXdzwWG11gIVCkOv05bNOh+Rxn0yngAk=\ngithub.com/ghodss/yaml v1.0.0/go.mod h1:4dBDuWmgqj2HViK6kFavaiC9ZROes6MMH2rRYeMEF04=\ngithub.com/go-openapi/jsonpointer v0.17.0 h1:nH6xp8XdXHx8dqveo0ZuJBluCO2qGrPbDNZ0dwoRHP0=\ngithub.com/go-openapi/jsonpointer v0.17.0/go.mod h1:cOnomiV+CVVwFLk0A/MExoFMjwdsUdVpsRhURCKh+3M=\ngithub.com/go-openapi/jsonreference v0.17.0/go.mod h1:g4xxGn04lDIRh0GJb5QlpE3HfopLOL6uZrK/VgnsK9I=\ngithub.com/go-openapi/jsonreference v0.19.0 h1:BqWKpV1dFd+AuiKlgtddwVIFQsuMpxfBDBHGfM2yNpk=\ngithub.com/go-openapi/jsonreference v0.19.0/go.mod h1:g4xxGn04lDIRh0GJb5QlpE3HfopLOL6uZrK/VgnsK9I=\ngithub.com/go-openapi/spec v0.19.0 h1:A4SZ6IWh3lnjH0rG0Z5lkxazMGBECtrZcbyYQi+64k4=\ngithub.com/go-openapi/spec v0.19.0/go.mod h1:XkF/MOi14NmjsfZ8VtAKf8pIlbZzyoTvZsdfssdxcBI=\ngithub.com/go-openapi/swag v0.17.0 h1:iqrgMg7Q7SvtbWLlltPrkMs0UBJI6oTSs79JFRUi880=\ngithub.com/go-openapi/swag v0.17.0/go.mod h1:AByQ+nYG6gQg71GINrmuDXCPWdL640yX49/kXLo40Tg=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329 h1:2gxZ0XQIU/5z3Z3bUBu+FXuk2pFbkN6tcwi/pjyaDic=\ngithub.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=\ngithub.com/pkg/errors v0.8.1 h1:iURUrRGxPUNPdy5/HRSm+Yj6okJ6UtLINN0Q9M4+h3I=\ngithub.com/pkg/errors v0.8.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=\ngithub.com/urfave/cli v1.20.0 h1:fDqGv3UG/4jbVl/QkFwEdddtEDjh/5Ov6X+0B/3bPaw=\ngithub.com/urfave/cli v1.20.0/go.mod h1:70zkFmudgCuE/ngEzBv17Jvp/497gISqfk5gWijbERA=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/net v0.0.0-20181005035420-146acd28ed58/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20190311183353-d8887717615a h1:oWX7TPOiFAMXLq8o0ikBYfCJVlRHBcsciT5bXOrH628=\ngolang.org/x/net v0.0.0-20190311183353-d8887717615a/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/text v0.3.0 h1:g61tztE5qeGQ89tm6NTjjM9VPIm088od1l6aSorWRWg=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngolang.org/x/tools v0.0.0-20190606050223-4d9ae51c2468 h1:fTfk6GjmihJbK0mSUFgPPgYpsdmApQ86Mcd4GuKax9U=\ngolang.org/x/tools v0.0.0-20190606050223-4d9ae51c2468/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/yaml.v2 v2.2.1 h1:mUhvW9EsL+naU5Q3cakzfE91YhliOondGd6ZrsDBHQE=\ngopkg.in/yaml.v2 v2.2.1/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/swaggo/swag/license", "content": "MIT License\n\nCopyright (c) 2017 Eason Lin\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/swaggo/swag/operation.go", "content": "package swag\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\tgoparser \"go/parser\"\n\t\"go/token\"\n\t\"net/http\"\n\t\"os\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/go-openapi/jsonreference\"\n\t\"github.com/go-openapi/spec\"\n\t\"github.com/pkg/errors\"\n\t\"golang.org/x/tools/go/loader\"\n)\n\n// Operation describes a single API operation on a path.\n// For more information: https://github.com/swaggo/swag#api-operation\ntype Operation struct {\n\tHTTPMethod string\n\tPath string\n\tspec.Operation\n\n\tparser *Parser\n}\n\nvar mimeTypeAliases = map[string]string{\n\t\"json\": \"application/json\",\n\t\"xml\": \"text/xml\",\n\t\"plain\": \"text/plain\",\n\t\"html\": \"text/html\",\n\t\"mpfd\": \"multipart/form-data\",\n\t\"x-www-form-urlencoded\": \"application/x-www-form-urlencoded\",\n\t\"json-api\": \"application/vnd.api+json\",\n\t\"json-stream\": \"application/x-json-stream\",\n\t\"octet-stream\": \"application/octet-stream\",\n\t\"png\": \"image/png\",\n\t\"jpeg\": \"image/jpeg\",\n\t\"gif\": \"image/gif\",\n}\n\nvar mimeTypePattern = regexp.MustCompile(\"^[^/]+/[^/]+$\")\n\n// NewOperation creates a new Operation with default properties.\n// map[int]Response\nfunc NewOperation() *Operation {\n\treturn &Operation{\n\t\tHTTPMethod: \"get\",\n\t\tOperation: spec.Operation{\n\t\t\tOperationProps: spec.OperationProps{},\n\t\t},\n\t}\n}\n\n// ParseComment parses comment for given comment string and returns error if error occurs.\nfunc (operation *Operation) ParseComment(comment string, astFile *ast.File) error {\n\tcommentLine := strings.TrimSpace(strings.TrimLeft(comment, \"//\"))\n\tif len(commentLine) == 0 {\n\t\treturn nil\n\t}\n\n\tattribute := strings.Fields(commentLine)[0]\n\tlineRemainder := strings.TrimSpace(commentLine[len(attribute):])\n\tswitch strings.ToLower(attribute) {\n\tcase \"@description\":\n\t\tif operation.Description == \"\" {\n\t\t\toperation.Description = lineRemainder\n\t\t} else {\n\t\t\toperation.Description += \"\\n\" + lineRemainder\n\t\t}\n\tcase \"@summary\":\n\t\toperation.Summary = lineRemainder\n\tcase \"@id\":\n\t\toperation.ID = lineRemainder\n\tcase \"@tags\":\n\t\toperation.ParseTagsComment(lineRemainder)\n\tcase \"@accept\":\n\t\tif err := operation.ParseAcceptComment(lineRemainder); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase \"@produce\":\n\t\tif err := operation.ParseProduceComment(lineRemainder); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase \"@param\":\n\t\tif err := operation.ParseParamComment(lineRemainder, astFile); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase \"@success\", \"@failure\":\n\t\tif err := operation.ParseResponseComment(lineRemainder, astFile); err != nil {\n\t\t\tif err := operation.ParseEmptyResponseComment(lineRemainder); err != nil {\n\t\t\t\tif err := operation.ParseEmptyResponseOnly(lineRemainder); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tcase \"@header\":\n\t\tif err := operation.ParseResponseHeaderComment(lineRemainder, astFile); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase \"@router\":\n\t\tif err := operation.ParseRouterComment(lineRemainder); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase \"@security\":\n\t\tif err := operation.ParseSecurityComment(lineRemainder); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nvar paramPattern = regexp.MustCompile(`(\\S+)[\\s]+([\\w]+)[\\s]+([\\S.]+)[\\s]+([\\w]+)[\\s]+\"([^\"]+)\"`)\n\n// ParseParamComment parses params return []string of param properties\n// E.g. @Param\tqueryText\t\tform\t string\t true\t\t \"The email for login\"\n// [param name] [paramType] [data type] [is mandatory?] [Comment]\n// E.g. @Param some_id path int true \"Some ID\"\nfunc (operation *Operation) ParseParamComment(commentLine string, astFile *ast.File) error {\n\tmatches := paramPattern.FindStringSubmatch(commentLine)\n\tif len(matches) != 6 {\n\t\treturn fmt.Errorf(\"missing required param comment parameters \\\"%s\\\"\", commentLine)\n\t}\n\tname := matches[1]\n\tparamType := matches[2]\n\n\tschemaType := matches[3]\n\n\trequiredText := strings.ToLower(matches[4])\n\trequired := requiredText == \"true\" || requiredText == \"required\"\n\tdescription := matches[5]\n\n\tvar param spec.Parameter\n\n\t//five possible parameter types.\n\tswitch paramType {\n\tcase \"query\", \"path\", \"header\":\n\t\tparam = createParameter(paramType, description, name, TransToValidSchemeType(schemaType), required)\n\tcase \"body\":\n\t\tparam = createParameter(paramType, description, name, \"object\", required) // TODO: if Parameter types can be objects, but also primitives and arrays\n\t\tif err := operation.registerSchemaType(schemaType, astFile); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tparam.Schema.Ref = spec.Ref{\n\t\t\tRef: jsonreference.MustCreateRef(\"#/definitions/\" + schemaType),\n\t\t}\n\tcase \"formData\":\n\t\tparam = createParameter(paramType, description, name, TransToValidSchemeType(schemaType), required)\n\tdefault:\n\t\treturn fmt.Errorf(\"%s is not supported paramType\", paramType)\n\t}\n\n\tif err := operation.parseAndExtractionParamAttribute(commentLine, schemaType, ¶m); err != nil {\n\t\treturn err\n\t}\n\toperation.Operation.Parameters = append(operation.Operation.Parameters, param)\n\treturn nil\n}\n\nfunc (operation *Operation) registerSchemaType(schemaType string, astFile *ast.File) error {\n\trefSplit := strings.Split(schemaType, \".\")\n\tif len(refSplit) != 2 {\n\t\treturn nil\n\t}\n\tpkgName := refSplit[0]\n\ttypeName := refSplit[1]\n\tif typeSpec, ok := operation.parser.TypeDefinitions[pkgName][typeName]; ok {\n\t\toperation.parser.registerTypes[schemaType] = typeSpec\n\t\treturn nil\n\t}\n\tvar typeSpec *ast.TypeSpec\n\tif astFile == nil {\n\t\treturn fmt.Errorf(\"can not register schema type: %q reason: astFile == nil\", schemaType)\n\t}\n\tfor _, imp := range astFile.Imports {\n\t\tif imp.Name != nil && imp.Name.Name == pkgName { // the import had an alias that matched\n\t\t\tbreak\n\t\t}\n\t\timpPath := strings.Replace(imp.Path.Value, `\"`, ``, -1)\n\t\tif strings.HasSuffix(impPath, \"/\"+pkgName) {\n\t\t\tvar err error\n\t\t\ttypeSpec, err = findTypeDef(impPath, typeName)\n\t\t\tif err != nil {\n\t\t\t\treturn errors.Wrapf(err, \"can not find type def: %q\", schemaType)\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif typeSpec == nil {\n\t\treturn fmt.Errorf(\"can not find schema type: %q\", schemaType)\n\t}\n\n\tif _, ok := operation.parser.TypeDefinitions[pkgName]; !ok {\n\t\toperation.parser.TypeDefinitions[pkgName] = make(map[string]*ast.TypeSpec)\n\t}\n\n\toperation.parser.TypeDefinitions[pkgName][typeName] = typeSpec\n\toperation.parser.registerTypes[schemaType] = typeSpec\n\treturn nil\n}\n\nvar regexAttributes = map[string]*regexp.Regexp{\n\t// for Enums(A, B)\n\t\"enums\": regexp.MustCompile(`(?i)enums\\(.*\\)`),\n\t// for Minimum(0)\n\t\"maxinum\": regexp.MustCompile(`(?i)maxinum\\(.*\\)`),\n\t// for Maximum(0)\n\t\"mininum\": regexp.MustCompile(`(?i)mininum\\(.*\\)`),\n\t// for Maximum(0)\n\t\"default\": regexp.MustCompile(`(?i)default\\(.*\\)`),\n\t// for minlength(0)\n\t\"minlength\": regexp.MustCompile(`(?i)minlength\\(.*\\)`),\n\t// for maxlength(0)\n\t\"maxlength\": regexp.MustCompile(`(?i)maxlength\\(.*\\)`),\n\t// for format(email)\n\t\"format\": regexp.MustCompile(`(?i)format\\(.*\\)`),\n}\n\nfunc (operation *Operation) parseAndExtractionParamAttribute(commentLine, schemaType string, param *spec.Parameter) error {\n\tschemaType = TransToValidSchemeType(schemaType)\n\tfor attrKey, re := range regexAttributes {\n\t\tswitch attrKey {\n\t\tcase \"enums\":\n\t\t\tenums, err := findAttrList(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tfor _, e := range enums {\n\t\t\t\te = strings.TrimSpace(e)\n\n\t\t\t\tvalue, err := defineType(schemaType, e)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tparam.Enum = append(param.Enum, value)\n\t\t\t}\n\t\tcase \"maxinum\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif schemaType != \"integer\" && schemaType != \"number\" {\n\t\t\t\treturn fmt.Errorf(\"maxinum is attribute to set to a number. comment=%s got=%s\", commentLine, schemaType)\n\t\t\t}\n\t\t\tn, err := strconv.ParseFloat(attr, 64)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"maximum is allow only a number. comment=%s got=%s\", commentLine, attr)\n\t\t\t}\n\t\t\tparam.Maximum = &n\n\t\tcase \"mininum\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif schemaType != \"integer\" && schemaType != \"number\" {\n\t\t\t\treturn fmt.Errorf(\"mininum is attribute to set to a number. comment=%s got=%s\", commentLine, schemaType)\n\t\t\t}\n\t\t\tn, err := strconv.ParseFloat(attr, 64)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"mininum is allow only a number got=%s\", attr)\n\t\t\t}\n\t\t\tparam.Minimum = &n\n\t\tcase \"default\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tvalue, err := defineType(schemaType, attr)\n\t\t\tif err != nil {\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tparam.Default = value\n\t\tcase \"maxlength\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif schemaType != \"string\" {\n\t\t\t\treturn fmt.Errorf(\"maxlength is attribute to set to a number. comment=%s got=%s\", commentLine, schemaType)\n\t\t\t}\n\t\t\tn, err := strconv.ParseInt(attr, 10, 64)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"maxlength is allow only a number got=%s\", attr)\n\t\t\t}\n\t\t\tparam.MaxLength = &n\n\t\tcase \"minlength\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif schemaType != \"string\" {\n\t\t\t\treturn fmt.Errorf(\"maxlength is attribute to set to a number. comment=%s got=%s\", commentLine, schemaType)\n\t\t\t}\n\t\t\tn, err := strconv.ParseInt(attr, 10, 64)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"minlength is allow only a number got=%s\", attr)\n\t\t\t}\n\t\t\tparam.MinLength = &n\n\t\tcase \"format\":\n\t\t\tattr, err := findAttr(re, commentLine)\n\t\t\tif err != nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tparam.Format = attr\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc findAttr(re *regexp.Regexp, commentLine string) (string, error) {\n\tattr := re.FindString(commentLine)\n\tl := strings.Index(attr, \"(\")\n\tr := strings.Index(attr, \")\")\n\tif l == -1 || r == -1 {\n\t\treturn \"\", fmt.Errorf(\"can not find regex=%s, comment=%s\", re.String(), commentLine)\n\t}\n\treturn strings.TrimSpace(attr[l+1 : r]), nil\n}\n\nfunc findAttrList(re *regexp.Regexp, commentLine string) ([]string, error) {\n\tattr, err := findAttr(re, commentLine)\n\tif err != nil {\n\t\treturn []string{\"\"}, err\n\t}\n\treturn strings.Split(attr, \",\"), nil\n}\n\n// defineType enum value define the type (object and array unsupported)\nfunc defineType(schemaType string, value string) (interface{}, error) {\n\tschemaType = TransToValidSchemeType(schemaType)\n\tswitch schemaType {\n\tcase \"string\":\n\t\treturn value, nil\n\tcase \"number\":\n\t\tv, err := strconv.ParseFloat(value, 64)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"enum value %s can't convert to %s err: %s\", value, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tcase \"integer\":\n\t\tv, err := strconv.Atoi(value)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"enum value %s can't convert to %s err: %s\", value, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tcase \"boolean\":\n\t\tv, err := strconv.ParseBool(value)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"enum value %s can't convert to %s err: %s\", value, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"%s is unsupported type in enum value\", schemaType)\n\t}\n}\n\n// ParseTagsComment parses comment for given `tag` comment string.\nfunc (operation *Operation) ParseTagsComment(commentLine string) {\n\ttags := strings.Split(commentLine, \",\")\n\tfor _, tag := range tags {\n\t\toperation.Tags = append(operation.Tags, strings.TrimSpace(tag))\n\t}\n}\n\n// ParseAcceptComment parses comment for given `accept` comment string.\nfunc (operation *Operation) ParseAcceptComment(commentLine string) error {\n\treturn parseMimeTypeList(commentLine, &operation.Consumes, \"%v accept type can't be accepted\")\n}\n\n// ParseProduceComment parses comment for given `produce` comment string.\nfunc (operation *Operation) ParseProduceComment(commentLine string) error {\n\treturn parseMimeTypeList(commentLine, &operation.Produces, \"%v produce type can't be accepted\")\n}\n\n// parseMimeTypeList parses a list of MIME Types for a comment like\n// `produce` (`Content-Type:` response header) or\n// `accept` (`Accept:` request header)\nfunc parseMimeTypeList(mimeTypeList string, typeList *[]string, format string) error {\n\tmimeTypes := strings.Split(mimeTypeList, \",\")\n\tfor _, typeName := range mimeTypes {\n\t\tif mimeTypePattern.MatchString(typeName) {\n\t\t\t*typeList = append(*typeList, typeName)\n\t\t\tcontinue\n\t\t}\n\t\tif aliasMimeType, ok := mimeTypeAliases[typeName]; ok {\n\t\t\t*typeList = append(*typeList, aliasMimeType)\n\t\t\tcontinue\n\t\t}\n\t\treturn fmt.Errorf(format, typeName)\n\t}\n\treturn nil\n}\n\nvar routerPattern = regexp.MustCompile(`([\\w\\.\\/\\-{}\\+]+)[^\\[]+\\[([^\\]]+)`)\n\n// ParseRouterComment parses comment for gived `router` comment string.\nfunc (operation *Operation) ParseRouterComment(commentLine string) error {\n\tvar matches []string\n\n\tif matches = routerPattern.FindStringSubmatch(commentLine); len(matches) != 3 {\n\t\treturn fmt.Errorf(\"can not parse router comment \\\"%s\\\"\", commentLine)\n\t}\n\tpath := matches[1]\n\thttpMethod := matches[2]\n\n\toperation.Path = path\n\toperation.HTTPMethod = strings.ToUpper(httpMethod)\n\n\treturn nil\n}\n\n// ParseSecurityComment parses comment for gived `security` comment string.\nfunc (operation *Operation) ParseSecurityComment(commentLine string) error {\n\tsecuritySource := commentLine[strings.Index(commentLine, \"@Security\")+1:]\n\tl := strings.Index(securitySource, \"[\")\n\tr := strings.Index(securitySource, \"]\")\n\t// exists scope\n\tif !(l == -1 && r == -1) {\n\t\tscopes := securitySource[l+1 : r]\n\t\ts := []string{}\n\t\tfor _, scope := range strings.Split(scopes, \",\") {\n\t\t\tscope = strings.TrimSpace(scope)\n\t\t\ts = append(s, scope)\n\t\t}\n\t\tsecurityKey := securitySource[0:l]\n\t\tsecurityMap := map[string][]string{}\n\t\tsecurityMap[securityKey] = append(securityMap[securityKey], s...)\n\t\toperation.Security = append(operation.Security, securityMap)\n\t} else {\n\t\tsecurityKey := strings.TrimSpace(securitySource)\n\t\tsecurityMap := map[string][]string{}\n\t\tsecurityMap[securityKey] = []string{}\n\t\toperation.Security = append(operation.Security, securityMap)\n\t}\n\treturn nil\n}\n\n// findTypeDef attempts to find the *ast.TypeSpec for a specific type given the\n// type's name and the package's import path\n// TODO: improve finding external pkg\nfunc findTypeDef(importPath, typeName string) (*ast.TypeSpec, error) {\n\tcwd, err := os.Getwd()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tconf := loader.Config{\n\t\tParserMode: goparser.SpuriousErrors,\n\t\tCwd: cwd,\n\t}\n\n\tconf.Import(importPath)\n\n\tlprog, err := conf.Load()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// If the pkg is vendored, the actual pkg path is going to resemble\n\t// something like \"{importPath}/vendor/{importPath}\"\n\tfor k := range lprog.AllPackages {\n\t\trealPkgPath := k.Path()\n\n\t\tif strings.Contains(realPkgPath, \"vendor/\"+importPath) {\n\t\t\timportPath = realPkgPath\n\t\t}\n\t}\n\n\tpkgInfo := lprog.Package(importPath)\n\n\tif pkgInfo == nil {\n\t\treturn nil, errors.New(\"package was nil\")\n\t}\n\n\t// TODO: possibly cache pkgInfo since it's an expensive operation\n\n\tfor i := range pkgInfo.Files {\n\t\tfor _, astDeclaration := range pkgInfo.Files[i].Decls {\n\t\t\tif generalDeclaration, ok := astDeclaration.(*ast.GenDecl); ok && generalDeclaration.Tok == token.TYPE {\n\t\t\t\tfor _, astSpec := range generalDeclaration.Specs {\n\t\t\t\t\tif typeSpec, ok := astSpec.(*ast.TypeSpec); ok {\n\t\t\t\t\t\tif typeSpec.Name.String() == typeName {\n\t\t\t\t\t\t\treturn typeSpec, nil\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil, errors.New(\"type spec not found\")\n}\n\nvar responsePattern = regexp.MustCompile(`([\\d]+)[\\s]+([\\w\\{\\}]+)[\\s]+([\\w\\-\\.\\/]+)[^\"]*(.*)?`)\n\n// ParseResponseComment parses comment for gived `response` comment string.\nfunc (operation *Operation) ParseResponseComment(commentLine string, astFile *ast.File) error {\n\tvar matches []string\n\n\tif matches = responsePattern.FindStringSubmatch(commentLine); len(matches) != 5 {\n\t\treturn fmt.Errorf(\"can not parse response comment \\\"%s\\\"\", commentLine)\n\t}\n\n\tresponse := spec.Response{}\n\n\tcode, _ := strconv.Atoi(matches[1])\n\n\tresponseDescription := strings.Trim(matches[4], \"\\\"\")\n\tif responseDescription == \"\" {\n\t\tresponseDescription = http.StatusText(code)\n\t}\n\tresponse.Description = responseDescription\n\n\tschemaType := strings.Trim(matches[2], \"{}\")\n\trefType := matches[3]\n\n\tif operation.parser != nil { // checking refType has existing in 'TypeDefinitions'\n\t\tif err := operation.registerSchemaType(refType, astFile); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\t// so we have to know all type in app\n\t//TODO: we might omitted schema.type if schemaType equals 'object'\n\tresponse.Schema = &spec.Schema{SchemaProps: spec.SchemaProps{Type: []string{schemaType}}}\n\n\tif schemaType == \"object\" {\n\t\tresponse.Schema.Ref = spec.Ref{\n\t\t\tRef: jsonreference.MustCreateRef(\"#/definitions/\" + refType),\n\t\t}\n\t}\n\n\tif schemaType == \"array\" {\n\t\trefType = TransToValidSchemeType(refType)\n\t\tif IsPrimitiveType(refType) {\n\t\t\tresponse.Schema.Items = &spec.SchemaOrArray{\n\t\t\t\tSchema: &spec.Schema{\n\t\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\t\tType: spec.StringOrArray{refType},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t}\n\t\t} else {\n\t\t\tresponse.Schema.Items = &spec.SchemaOrArray{\n\t\t\t\tSchema: &spec.Schema{\n\t\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\t\tRef: spec.Ref{Ref: jsonreference.MustCreateRef(\"#/definitions/\" + refType)},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n\n\tif operation.Responses == nil {\n\t\toperation.Responses = &spec.Responses{\n\t\t\tResponsesProps: spec.ResponsesProps{\n\t\t\t\tStatusCodeResponses: make(map[int]spec.Response),\n\t\t\t},\n\t\t}\n\t}\n\n\toperation.Responses.StatusCodeResponses[code] = response\n\n\treturn nil\n}\n\n// ParseResponseHeaderComment parses comment for gived `response header` comment string.\nfunc (operation *Operation) ParseResponseHeaderComment(commentLine string, astFile *ast.File) error {\n\tvar matches []string\n\n\tif matches = responsePattern.FindStringSubmatch(commentLine); len(matches) != 5 {\n\t\treturn fmt.Errorf(\"can not parse response comment \\\"%s\\\"\", commentLine)\n\t}\n\n\tresponse := spec.Response{}\n\n\tcode, _ := strconv.Atoi(matches[1])\n\n\tresponseDescription := strings.Trim(matches[4], \"\\\"\")\n\tif responseDescription == \"\" {\n\t\tresponseDescription = http.StatusText(code)\n\t}\n\tresponse.Description = responseDescription\n\n\tschemaType := strings.Trim(matches[2], \"{}\")\n\trefType := matches[3]\n\n\tif operation.Responses == nil {\n\t\toperation.Responses = &spec.Responses{\n\t\t\tResponsesProps: spec.ResponsesProps{\n\t\t\t\tStatusCodeResponses: make(map[int]spec.Response),\n\t\t\t},\n\t\t}\n\t}\n\n\tresponse, responseExist := operation.Responses.StatusCodeResponses[code]\n\tif responseExist {\n\t\theader := spec.Header{}\n\t\theader.Description = responseDescription\n\t\theader.Type = schemaType\n\n\t\tif response.Headers == nil {\n\t\t\tresponse.Headers = make(map[string]spec.Header)\n\t\t}\n\t\tresponse.Headers[refType] = header\n\n\t\toperation.Responses.StatusCodeResponses[code] = response\n\t}\n\n\treturn nil\n}\n\nvar emptyResponsePattern = regexp.MustCompile(`([\\d]+)[\\s]+\"(.*)\"`)\n\n// ParseEmptyResponseComment parse only comment out status code and description,eg: @Success 200 \"it's ok\"\nfunc (operation *Operation) ParseEmptyResponseComment(commentLine string) error {\n\tvar matches []string\n\n\tif matches = emptyResponsePattern.FindStringSubmatch(commentLine); len(matches) != 3 {\n\t\treturn fmt.Errorf(\"can not parse response comment \\\"%s\\\"\", commentLine)\n\t}\n\n\tresponse := spec.Response{}\n\n\tcode, _ := strconv.Atoi(matches[1])\n\n\tresponse.Description = strings.Trim(matches[2], \"\")\n\n\tif operation.Responses == nil {\n\t\toperation.Responses = &spec.Responses{\n\t\t\tResponsesProps: spec.ResponsesProps{\n\t\t\t\tStatusCodeResponses: make(map[int]spec.Response),\n\t\t\t},\n\t\t}\n\t}\n\n\toperation.Responses.StatusCodeResponses[code] = response\n\n\treturn nil\n}\n\n//ParseEmptyResponseOnly parse only comment out status code ,eg: @Success 200\nfunc (operation *Operation) ParseEmptyResponseOnly(commentLine string) error {\n\tresponse := spec.Response{}\n\n\tcode, err := strconv.Atoi(commentLine)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"can not parse response comment \\\"%s\\\"\", commentLine)\n\t}\n\tif operation.Responses == nil {\n\t\toperation.Responses = &spec.Responses{\n\t\t\tResponsesProps: spec.ResponsesProps{\n\t\t\t\tStatusCodeResponses: make(map[int]spec.Response),\n\t\t\t},\n\t\t}\n\t}\n\n\toperation.Responses.StatusCodeResponses[code] = response\n\n\treturn nil\n}\n\n// createParameter returns swagger spec.Parameter for gived paramType, description, paramName, schemaType, required\nfunc createParameter(paramType, description, paramName, schemaType string, required bool) spec.Parameter {\n\t// //five possible parameter types. \tquery, path, body, header, form\n\tparamProps := spec.ParamProps{\n\t\tName: paramName,\n\t\tDescription: description,\n\t\tRequired: required,\n\t\tIn: paramType,\n\t}\n\tif paramType == \"body\" {\n\t\tparamProps.Schema = &spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{schemaType},\n\t\t\t},\n\t\t}\n\t\tparameter := spec.Parameter{\n\t\t\tParamProps: paramProps,\n\t\t}\n\t\treturn parameter\n\t}\n\tparameter := spec.Parameter{\n\t\tParamProps: paramProps,\n\t\tSimpleSchema: spec.SimpleSchema{\n\t\t\tType: schemaType,\n\t\t},\n\t}\n\treturn parameter\n}\n" }, { "path": "vendor/github.com/swaggo/swag/parser.go", "content": "package swag\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\tgoparser \"go/parser\"\n\t\"go/token\"\n\t\"net/http\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode\"\n\n\t\"github.com/go-openapi/jsonreference\"\n\t\"github.com/go-openapi/spec\"\n\t\"github.com/pkg/errors\"\n)\n\nconst (\n\t// CamelCase indicates using CamelCase strategy for struct field.\n\tCamelCase = \"camelcase\"\n\n\t// PascalCase indicates using PascalCase strategy for struct field.\n\tPascalCase = \"pascalcase\"\n\n\t// SnakeCase indicates using SnakeCase strategy for struct field.\n\tSnakeCase = \"snakecase\"\n)\n\n// Parser implements a parser for Go source files.\ntype Parser struct {\n\t// swagger represents the root document object for the API specification\n\tswagger *spec.Swagger\n\n\t//files is a map that stores map[real_go_file_path][astFile]\n\tfiles map[string]*ast.File\n\n\t// TypeDefinitions is a map that stores [package name][type name][*ast.TypeSpec]\n\tTypeDefinitions map[string]map[string]*ast.TypeSpec\n\n\t// CustomPrimitiveTypes is a map that stores custom primitive types to actual golang types [type name][string]\n\tCustomPrimitiveTypes map[string]string\n\n\t//registerTypes is a map that stores [refTypeName][*ast.TypeSpec]\n\tregisterTypes map[string]*ast.TypeSpec\n\n\tPropNamingStrategy string\n\n\tParseVendor bool\n\n\t// structStack stores full names of the structures that were already parsed or are being parsed now\n\tstructStack []string\n}\n\n// New creates a new Parser with default properties.\nfunc New() *Parser {\n\tparser := &Parser{\n\t\tswagger: &spec.Swagger{\n\t\t\tSwaggerProps: spec.SwaggerProps{\n\t\t\t\tInfo: &spec.Info{\n\t\t\t\t\tInfoProps: spec.InfoProps{\n\t\t\t\t\t\tContact: &spec.ContactInfo{},\n\t\t\t\t\t\tLicense: &spec.License{},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tPaths: &spec.Paths{\n\t\t\t\t\tPaths: make(map[string]spec.PathItem),\n\t\t\t\t},\n\t\t\t\tDefinitions: make(map[string]spec.Schema),\n\t\t\t},\n\t\t},\n\t\tfiles: make(map[string]*ast.File),\n\t\tTypeDefinitions: make(map[string]map[string]*ast.TypeSpec),\n\t\tCustomPrimitiveTypes: make(map[string]string),\n\t\tregisterTypes: make(map[string]*ast.TypeSpec),\n\t}\n\treturn parser\n}\n\n// ParseAPI parses general api info for gived searchDir and mainAPIFile\nfunc (parser *Parser) ParseAPI(searchDir string, mainAPIFile string) error {\n\tPrintln(\"Generate general API Info\")\n\tif err := parser.getAllGoFileInfo(searchDir); err != nil {\n\t\treturn err\n\t}\n\tparser.ParseGeneralAPIInfo(path.Join(searchDir, mainAPIFile))\n\n\tfor _, astFile := range parser.files {\n\t\tparser.ParseType(astFile)\n\t}\n\n\tfor fileName, astFile := range parser.files {\n\t\tif err := parser.ParseRouterAPIInfo(fileName, astFile); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\tparser.ParseDefinitions()\n\n\treturn nil\n}\n\n// ParseGeneralAPIInfo parses general api info for gived mainAPIFile path\nfunc (parser *Parser) ParseGeneralAPIInfo(mainAPIFile string) error {\n\tfileSet := token.NewFileSet()\n\tfileTree, err := goparser.ParseFile(fileSet, mainAPIFile, nil, goparser.ParseComments)\n\tif err != nil {\n\t\treturn errors.Wrap(err, \"cannot parse soure files\")\n\t}\n\n\tparser.swagger.Swagger = \"2.0\"\n\tsecurityMap := map[string]*spec.SecurityScheme{}\n\n\t// templated defaults\n\tparser.swagger.Info.Version = \"{{.Version}}\"\n\tparser.swagger.Info.Title = \"{{.Title}}\"\n\tparser.swagger.Info.Description = \"{{.Description}}\"\n\tparser.swagger.Host = \"{{.Host}}\"\n\tparser.swagger.BasePath = \"{{.BasePath}}\"\n\n\tif fileTree.Comments != nil {\n\t\tfor _, comment := range fileTree.Comments {\n\t\t\tcomments := strings.Split(comment.Text(), \"\\n\")\n\t\t\tpreviousAttribute := \"\"\n\t\t\tfor _, commentLine := range comments {\n\t\t\t\tattribute := strings.ToLower(strings.Split(commentLine, \" \")[0])\n\t\t\t\tmultilineBlock := false\n\t\t\t\tif previousAttribute == attribute {\n\t\t\t\t\tmultilineBlock = true\n\t\t\t\t}\n\t\t\t\tswitch attribute {\n\t\t\t\tcase \"@version\":\n\t\t\t\t\tparser.swagger.Info.Version = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@title\":\n\t\t\t\t\tparser.swagger.Info.Title = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@description\":\n\t\t\t\t\tif parser.swagger.Info.Description == \"{{.Description}}\" {\n\t\t\t\t\t\tparser.swagger.Info.Description = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\t} else if multilineBlock {\n\t\t\t\t\t\tparser.swagger.Info.Description += \"\\n\" + strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\t}\n\t\t\t\tcase \"@termsofservice\":\n\t\t\t\t\tparser.swagger.Info.TermsOfService = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@contact.name\":\n\t\t\t\t\tparser.swagger.Info.Contact.Name = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@contact.email\":\n\t\t\t\t\tparser.swagger.Info.Contact.Email = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@contact.url\":\n\t\t\t\t\tparser.swagger.Info.Contact.URL = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@license.name\":\n\t\t\t\t\tparser.swagger.Info.License.Name = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@license.url\":\n\t\t\t\t\tparser.swagger.Info.License.URL = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@host\":\n\t\t\t\t\tparser.swagger.Host = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@basepath\":\n\t\t\t\t\tparser.swagger.BasePath = strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\tcase \"@schemes\":\n\t\t\t\t\tparser.swagger.Schemes = getSchemes(commentLine)\n\t\t\t\tcase \"@tag.name\":\n\t\t\t\t\tcommentInfo := strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\tparser.swagger.Tags = append(parser.swagger.Tags, spec.Tag{\n\t\t\t\t\t\tTagProps: spec.TagProps{\n\t\t\t\t\t\t\tName: strings.TrimSpace(commentInfo),\n\t\t\t\t\t\t},\n\t\t\t\t\t})\n\t\t\t\tcase \"@tag.description\":\n\t\t\t\t\tcommentInfo := strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\ttag := parser.swagger.Tags[len(parser.swagger.Tags)-1]\n\t\t\t\t\ttag.TagProps.Description = commentInfo\n\t\t\t\t\treplaceLastTag(parser.swagger.Tags, tag)\n\t\t\t\tcase \"@tag.docs.url\":\n\t\t\t\t\tcommentInfo := strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\ttag := parser.swagger.Tags[len(parser.swagger.Tags)-1]\n\t\t\t\t\ttag.TagProps.ExternalDocs = &spec.ExternalDocumentation{\n\t\t\t\t\t\tURL: commentInfo,\n\t\t\t\t\t}\n\t\t\t\t\treplaceLastTag(parser.swagger.Tags, tag)\n\n\t\t\t\tcase \"@tag.docs.description\":\n\t\t\t\t\tcommentInfo := strings.TrimSpace(commentLine[len(attribute):])\n\t\t\t\t\ttag := parser.swagger.Tags[len(parser.swagger.Tags)-1]\n\t\t\t\t\tif tag.TagProps.ExternalDocs == nil {\n\t\t\t\t\t\treturn errors.New(\"@tag.docs.description needs to come after a @tags.docs.url\")\n\t\t\t\t\t}\n\t\t\t\t\ttag.TagProps.ExternalDocs.Description = commentInfo\n\t\t\t\t\treplaceLastTag(parser.swagger.Tags, tag)\n\t\t\t\t}\n\t\t\t\tpreviousAttribute = attribute\n\t\t\t}\n\n\t\t\tfor i := 0; i < len(comments); i++ {\n\t\t\t\tattribute := strings.ToLower(strings.Split(comments[i], \" \")[0])\n\t\t\t\tswitch attribute {\n\t\t\t\tcase \"@securitydefinitions.basic\":\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = spec.BasicAuth()\n\t\t\t\tcase \"@securitydefinitions.apikey\":\n\t\t\t\t\tattrMap := map[string]string{}\n\t\t\t\t\tfor _, v := range comments[i+1:] {\n\t\t\t\t\t\tsecurityAttr := strings.ToLower(strings.Split(v, \" \")[0])\n\t\t\t\t\t\tif securityAttr == \"@in\" || securityAttr == \"@name\" {\n\t\t\t\t\t\t\tattrMap[securityAttr] = strings.TrimSpace(v[len(securityAttr):])\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// next securityDefinitions\n\t\t\t\t\t\tif strings.Index(securityAttr, \"@securitydefinitions.\") == 0 {\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif len(attrMap) != 2 {\n\t\t\t\t\t\treturn errors.New(\"@securitydefinitions.apikey is @name and @in required\")\n\t\t\t\t\t}\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = spec.APIKeyAuth(attrMap[\"@name\"], attrMap[\"@in\"])\n\t\t\t\tcase \"@securitydefinitions.oauth2.application\":\n\t\t\t\t\tattrMap := map[string]string{}\n\t\t\t\t\tscopes := map[string]string{}\n\t\t\t\t\tfor _, v := range comments[i+1:] {\n\t\t\t\t\t\tsecurityAttr := strings.ToLower(strings.Split(v, \" \")[0])\n\t\t\t\t\t\tif securityAttr == \"@tokenurl\" {\n\t\t\t\t\t\t\tattrMap[securityAttr] = strings.TrimSpace(v[len(securityAttr):])\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tisExists, err := isExistsScope(securityAttr)\n\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif isExists {\n\t\t\t\t\t\t\t\tscopScheme, err := getScopeScheme(securityAttr)\n\t\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tscopes[scopScheme] = v[len(securityAttr):]\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// next securityDefinitions\n\t\t\t\t\t\tif strings.Index(securityAttr, \"@securitydefinitions.\") == 0 {\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif len(attrMap) != 1 {\n\t\t\t\t\t\treturn errors.New(\"@securitydefinitions.oauth2.application is @tokenUrl required\")\n\t\t\t\t\t}\n\t\t\t\t\tsecurityScheme := spec.OAuth2Application(attrMap[\"@tokenurl\"])\n\t\t\t\t\tfor scope, description := range scopes {\n\t\t\t\t\t\tsecurityScheme.AddScope(scope, description)\n\t\t\t\t\t}\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = securityScheme\n\t\t\t\tcase \"@securitydefinitions.oauth2.implicit\":\n\t\t\t\t\tattrMap := map[string]string{}\n\t\t\t\t\tscopes := map[string]string{}\n\t\t\t\t\tfor _, v := range comments[i+1:] {\n\t\t\t\t\t\tsecurityAttr := strings.ToLower(strings.Split(v, \" \")[0])\n\t\t\t\t\t\tif securityAttr == \"@authorizationurl\" {\n\t\t\t\t\t\t\tattrMap[securityAttr] = strings.TrimSpace(v[len(securityAttr):])\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tisExists, err := isExistsScope(securityAttr)\n\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif isExists {\n\t\t\t\t\t\t\t\tscopScheme, err := getScopeScheme(securityAttr)\n\t\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tscopes[scopScheme] = v[len(securityAttr):]\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// next securityDefinitions\n\t\t\t\t\t\tif strings.Index(securityAttr, \"@securitydefinitions.\") == 0 {\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif len(attrMap) != 1 {\n\t\t\t\t\t\treturn errors.New(\"@securitydefinitions.oauth2.implicit is @authorizationUrl required\")\n\t\t\t\t\t}\n\t\t\t\t\tsecurityScheme := spec.OAuth2Implicit(attrMap[\"@authorizationurl\"])\n\t\t\t\t\tfor scope, description := range scopes {\n\t\t\t\t\t\tsecurityScheme.AddScope(scope, description)\n\t\t\t\t\t}\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = securityScheme\n\t\t\t\tcase \"@securitydefinitions.oauth2.password\":\n\t\t\t\t\tattrMap := map[string]string{}\n\t\t\t\t\tscopes := map[string]string{}\n\t\t\t\t\tfor _, v := range comments[i+1:] {\n\t\t\t\t\t\tsecurityAttr := strings.ToLower(strings.Split(v, \" \")[0])\n\t\t\t\t\t\tif securityAttr == \"@tokenurl\" {\n\t\t\t\t\t\t\tattrMap[securityAttr] = strings.TrimSpace(v[len(securityAttr):])\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tisExists, err := isExistsScope(securityAttr)\n\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif isExists {\n\t\t\t\t\t\t\t\tscopScheme, err := getScopeScheme(securityAttr)\n\t\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tscopes[scopScheme] = v[len(securityAttr):]\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// next securityDefinitions\n\t\t\t\t\t\tif strings.Index(securityAttr, \"@securitydefinitions.\") == 0 {\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif len(attrMap) != 1 {\n\t\t\t\t\t\treturn errors.New(\"@securitydefinitions.oauth2.password is @tokenUrl required\")\n\t\t\t\t\t}\n\t\t\t\t\tsecurityScheme := spec.OAuth2Password(attrMap[\"@tokenurl\"])\n\t\t\t\t\tfor scope, description := range scopes {\n\t\t\t\t\t\tsecurityScheme.AddScope(scope, description)\n\t\t\t\t\t}\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = securityScheme\n\t\t\t\tcase \"@securitydefinitions.oauth2.accesscode\":\n\t\t\t\t\tattrMap := map[string]string{}\n\t\t\t\t\tscopes := map[string]string{}\n\t\t\t\t\tfor _, v := range comments[i+1:] {\n\t\t\t\t\t\tsecurityAttr := strings.ToLower(strings.Split(v, \" \")[0])\n\t\t\t\t\t\tif securityAttr == \"@tokenurl\" || securityAttr == \"@authorizationurl\" {\n\t\t\t\t\t\t\tattrMap[securityAttr] = strings.TrimSpace(v[len(securityAttr):])\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tisExists, err := isExistsScope(securityAttr)\n\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif isExists {\n\t\t\t\t\t\t\t\tscopScheme, err := getScopeScheme(securityAttr)\n\t\t\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tscopes[scopScheme] = v[len(securityAttr):]\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// next securityDefinitions\n\t\t\t\t\t\tif strings.Index(securityAttr, \"@securitydefinitions.\") == 0 {\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif len(attrMap) != 2 {\n\t\t\t\t\t\treturn errors.New(\"@securitydefinitions.oauth2.accessCode is @tokenUrl and @authorizationUrl required\")\n\t\t\t\t\t}\n\t\t\t\t\tsecurityScheme := spec.OAuth2AccessToken(attrMap[\"@authorizationurl\"], attrMap[\"@tokenurl\"])\n\t\t\t\t\tfor scope, description := range scopes {\n\t\t\t\t\t\tsecurityScheme.AddScope(scope, description)\n\t\t\t\t\t}\n\t\t\t\t\tsecurityMap[strings.TrimSpace(comments[i][len(attribute):])] = securityScheme\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif len(securityMap) > 0 {\n\t\tparser.swagger.SecurityDefinitions = securityMap\n\t}\n\n\treturn nil\n}\n\nfunc getScopeScheme(scope string) (string, error) {\n\tscopeValue := scope[strings.Index(scope, \"@scope.\"):]\n\tif scopeValue == \"\" {\n\t\treturn \"\", errors.New(\"@scope is empty\")\n\t}\n\treturn scope[len(\"@scope.\"):], nil\n}\n\nfunc isExistsScope(scope string) (bool, error) {\n\ts := strings.Fields(scope)\n\tfor _, v := range s {\n\t\tif strings.Index(v, \"@scope.\") != -1 {\n\t\t\tif strings.Index(v, \",\") != -1 {\n\t\t\t\treturn false, fmt.Errorf(\"@scope can't use comma(,) get=\" + v)\n\t\t\t}\n\t\t}\n\t}\n\treturn strings.Index(scope, \"@scope.\") != -1, nil\n}\n\n// getSchemes parses swagger schemes for given commentLine\nfunc getSchemes(commentLine string) []string {\n\tattribute := strings.ToLower(strings.Split(commentLine, \" \")[0])\n\treturn strings.Split(strings.TrimSpace(commentLine[len(attribute):]), \" \")\n}\n\n// ParseRouterAPIInfo parses router api info for given astFile\nfunc (parser *Parser) ParseRouterAPIInfo(fileName string, astFile *ast.File) error {\n\tfor _, astDescription := range astFile.Decls {\n\t\tswitch astDeclaration := astDescription.(type) {\n\t\tcase *ast.FuncDecl:\n\t\t\tif astDeclaration.Doc != nil && astDeclaration.Doc.List != nil {\n\t\t\t\toperation := NewOperation() //for per 'function' comment, create a new 'Operation' object\n\t\t\t\toperation.parser = parser\n\t\t\t\tfor _, comment := range astDeclaration.Doc.List {\n\t\t\t\t\tif err := operation.ParseComment(comment.Text, astFile); err != nil {\n\t\t\t\t\t\treturn fmt.Errorf(\"ParseComment error in file %s :%+v\", fileName, err)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvar pathItem spec.PathItem\n\t\t\t\tvar ok bool\n\n\t\t\t\tif pathItem, ok = parser.swagger.Paths.Paths[operation.Path]; !ok {\n\t\t\t\t\tpathItem = spec.PathItem{}\n\t\t\t\t}\n\t\t\t\tswitch strings.ToUpper(operation.HTTPMethod) {\n\t\t\t\tcase http.MethodGet:\n\t\t\t\t\tpathItem.Get = &operation.Operation\n\t\t\t\tcase http.MethodPost:\n\t\t\t\t\tpathItem.Post = &operation.Operation\n\t\t\t\tcase http.MethodDelete:\n\t\t\t\t\tpathItem.Delete = &operation.Operation\n\t\t\t\tcase http.MethodPut:\n\t\t\t\t\tpathItem.Put = &operation.Operation\n\t\t\t\tcase http.MethodPatch:\n\t\t\t\t\tpathItem.Patch = &operation.Operation\n\t\t\t\tcase http.MethodHead:\n\t\t\t\t\tpathItem.Head = &operation.Operation\n\t\t\t\tcase http.MethodOptions:\n\t\t\t\t\tpathItem.Options = &operation.Operation\n\t\t\t\t}\n\n\t\t\t\tparser.swagger.Paths.Paths[operation.Path] = pathItem\n\t\t\t}\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// ParseType parses type info for given astFile.\nfunc (parser *Parser) ParseType(astFile *ast.File) {\n\tif _, ok := parser.TypeDefinitions[astFile.Name.String()]; !ok {\n\t\tparser.TypeDefinitions[astFile.Name.String()] = make(map[string]*ast.TypeSpec)\n\t}\n\n\tfor _, astDeclaration := range astFile.Decls {\n\t\tif generalDeclaration, ok := astDeclaration.(*ast.GenDecl); ok && generalDeclaration.Tok == token.TYPE {\n\t\t\tfor _, astSpec := range generalDeclaration.Specs {\n\t\t\t\tif typeSpec, ok := astSpec.(*ast.TypeSpec); ok {\n\t\t\t\t\ttypeName := fmt.Sprintf(\"%v\", typeSpec.Type)\n\t\t\t\t\t// check if its a custom primitive type\n\t\t\t\t\tif IsGolangPrimitiveType(typeName) {\n\t\t\t\t\t\tparser.CustomPrimitiveTypes[typeSpec.Name.String()] = TransToValidSchemeType(typeName)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tparser.TypeDefinitions[astFile.Name.String()][typeSpec.Name.String()] = typeSpec\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc (parser *Parser) isInStructStack(refTypeName string) bool {\n\tfor _, structName := range parser.structStack {\n\t\tif refTypeName == structName {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// ParseDefinitions parses Swagger Api definitions.\nfunc (parser *Parser) ParseDefinitions() {\n\t// sort the typeNames so that parsing definitions is deterministic\n\ttypeNames := make([]string, 0, len(parser.registerTypes))\n\tfor refTypeName := range parser.registerTypes {\n\t\ttypeNames = append(typeNames, refTypeName)\n\t}\n\tsort.Strings(typeNames)\n\n\tfor _, refTypeName := range typeNames {\n\t\ttypeSpec := parser.registerTypes[refTypeName]\n\t\tss := strings.Split(refTypeName, \".\")\n\t\tpkgName := ss[0]\n\t\tparser.structStack = nil\n\t\tparser.ParseDefinition(pkgName, typeSpec.Name.Name, typeSpec)\n\t}\n}\n\n// ParseDefinition parses given type spec that corresponds to the type under\n// given name and package, and populates swagger schema definitions registry\n// with a schema for the given type\nfunc (parser *Parser) ParseDefinition(pkgName, typeName string, typeSpec *ast.TypeSpec) error {\n\trefTypeName := fullTypeName(pkgName, typeName)\n\tif _, isParsed := parser.swagger.Definitions[refTypeName]; isParsed {\n\t\tPrintln(\"Skipping '\" + refTypeName + \"', already parsed.\")\n\t\treturn nil\n\t}\n\n\tif parser.isInStructStack(refTypeName) {\n\t\tPrintln(\"Skipping '\" + refTypeName + \"', recursion detected.\")\n\t\treturn nil\n\t}\n\tparser.structStack = append(parser.structStack, refTypeName)\n\n\tPrintln(\"Generating \" + refTypeName)\n\n\tschema, err := parser.parseTypeExpr(pkgName, typeName, typeSpec.Type)\n\tif err != nil {\n\t\treturn err\n\t}\n\tparser.swagger.Definitions[refTypeName] = schema\n\treturn nil\n}\n\nfunc (parser *Parser) collectRequiredFields(pkgName string, properties map[string]spec.Schema, extraRequired []string) (requiredFields []string) {\n\t// created sorted list of properties keys so when we iterate over them it's deterministic\n\tks := make([]string, 0, len(properties))\n\tfor k := range properties {\n\t\tks = append(ks, k)\n\t}\n\tsort.Strings(ks)\n\n\trequiredFields = make([]string, 0)\n\n\t// iterate over keys list instead of map to avoid the random shuffle of the order that go does for maps\n\tfor _, k := range ks {\n\t\tprop := properties[k]\n\n\t\t// todo find the pkgName of the property type\n\t\ttname := prop.SchemaProps.Type[0]\n\t\tif _, ok := parser.TypeDefinitions[pkgName][tname]; ok {\n\t\t\ttspec := parser.TypeDefinitions[pkgName][tname]\n\t\t\tparser.ParseDefinition(pkgName, tname, tspec)\n\t\t}\n\t\tif tname != \"object\" {\n\t\t\trequiredFields = append(requiredFields, prop.SchemaProps.Required...)\n\t\t}\n\t\tproperties[k] = prop\n\t}\n\n\tif extraRequired != nil {\n\t\trequiredFields = append(requiredFields, extraRequired...)\n\t}\n\n\tsort.Strings(requiredFields)\n\n\treturn\n}\n\nfunc fullTypeName(pkgName, typeName string) string {\n\tif pkgName != \"\" {\n\t\treturn pkgName + \".\" + typeName\n\t}\n\treturn typeName\n}\n\n// parseTypeExpr parses given type expression that corresponds to the type under\n// given name and package, and returns swagger schema for it.\nfunc (parser *Parser) parseTypeExpr(pkgName, typeName string, typeExpr ast.Expr) (spec.Schema, error) {\n\t//TODO: return pointer to spec.Schema\n\n\tswitch expr := typeExpr.(type) {\n\t// type Foo struct {...}\n\tcase *ast.StructType:\n\t\trefTypeName := fullTypeName(pkgName, typeName)\n\t\tif schema, isParsed := parser.swagger.Definitions[refTypeName]; isParsed {\n\t\t\treturn schema, nil\n\t\t}\n\n\t\textraRequired := make([]string, 0)\n\t\tproperties := make(map[string]spec.Schema)\n\t\tfor _, field := range expr.Fields.List {\n\t\t\tvar fieldProps map[string]spec.Schema\n\t\t\tvar requiredFromAnon []string\n\t\t\tif field.Names == nil {\n\t\t\t\tvar err error\n\t\t\t\tfieldProps, requiredFromAnon, err = parser.parseAnonymousField(pkgName, field)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn spec.Schema{}, err\n\t\t\t\t}\n\t\t\t\textraRequired = append(extraRequired, requiredFromAnon...)\n\t\t\t} else {\n\t\t\t\tvar err error\n\t\t\t\tfieldProps, err = parser.parseStruct(pkgName, field)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn spec.Schema{}, err\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor k, v := range fieldProps {\n\t\t\t\tproperties[k] = v\n\t\t\t}\n\t\t}\n\n\t\t// collect requireds from our properties and anonymous fields\n\t\trequired := parser.collectRequiredFields(pkgName, properties, extraRequired)\n\n\t\t// unset required from properties because we've collected them\n\t\tfor k, prop := range properties {\n\t\t\ttname := prop.SchemaProps.Type[0]\n\t\t\tif tname != \"object\" {\n\t\t\t\tprop.SchemaProps.Required = make([]string, 0)\n\t\t\t}\n\t\t\tproperties[k] = prop\n\t\t}\n\n\t\treturn spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{\"object\"},\n\t\t\t\tProperties: properties,\n\t\t\t\tRequired: required,\n\t\t\t}}, nil\n\n\t// type Foo Baz\n\tcase *ast.Ident:\n\t\trefTypeName := fullTypeName(pkgName, expr.Name)\n\t\tif _, isParsed := parser.swagger.Definitions[refTypeName]; !isParsed {\n\t\t\tif typedef, ok := parser.TypeDefinitions[pkgName][expr.Name]; ok {\n\t\t\t\tparser.ParseDefinition(pkgName, expr.Name, typedef)\n\t\t\t}\n\t\t}\n\t\treturn parser.swagger.Definitions[refTypeName], nil\n\n\t// type Foo *Baz\n\tcase *ast.StarExpr:\n\t\treturn parser.parseTypeExpr(pkgName, typeName, expr.X)\n\n\t// type Foo []Baz\n\tcase *ast.ArrayType:\n\t\titemSchema, err := parser.parseTypeExpr(pkgName, \"\", expr.Elt)\n\t\tif err != nil {\n\t\t\treturn spec.Schema{}, err\n\t\t}\n\t\treturn spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{\"array\"},\n\t\t\t\tItems: &spec.SchemaOrArray{\n\t\t\t\t\tSchema: &itemSchema,\n\t\t\t\t},\n\t\t\t},\n\t\t}, nil\n\n\t// type Foo pkg.Bar\n\tcase *ast.SelectorExpr:\n\t\tif xIdent, ok := expr.X.(*ast.Ident); ok {\n\t\t\tpkgName = xIdent.Name\n\t\t\ttypeName = expr.Sel.Name\n\t\t\trefTypeName := fullTypeName(pkgName, typeName)\n\t\t\tif _, isParsed := parser.swagger.Definitions[refTypeName]; !isParsed {\n\t\t\t\ttypedef := parser.TypeDefinitions[pkgName][typeName]\n\t\t\t\tparser.ParseDefinition(pkgName, typeName, typedef)\n\t\t\t}\n\t\t\treturn parser.swagger.Definitions[refTypeName], nil\n\t\t}\n\n\t// type Foo map[string]Bar\n\tcase *ast.MapType:\n\t\titemSchema, err := parser.parseTypeExpr(pkgName, \"\", expr.Value)\n\t\tif err != nil {\n\t\t\treturn spec.Schema{}, err\n\t\t}\n\t\treturn spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{\"object\"},\n\t\t\t\tAdditionalProperties: &spec.SchemaOrBool{\n\t\t\t\t\tSchema: &itemSchema,\n\t\t\t\t},\n\t\t\t},\n\t\t}, nil\n\t// ...\n\tdefault:\n\t\tPrintf(\"Type definition of type '%T' is not supported yet. Using 'object' instead.\\n\", typeExpr)\n\t}\n\n\treturn spec.Schema{\n\t\tSchemaProps: spec.SchemaProps{\n\t\t\tType: []string{\"object\"},\n\t\t},\n\t}, nil\n}\n\ntype structField struct {\n\tname string\n\tschemaType string\n\tarrayType string\n\tformatType string\n\tisRequired bool\n\tcrossPkg string\n\texampleValue interface{}\n\tmaximum *float64\n\tminimum *float64\n\tmaxLength *int64\n\tminLength *int64\n\tenums []interface{}\n\tdefaultValue interface{}\n\textensions map[string]interface{}\n}\n\nfunc (parser *Parser) parseStruct(pkgName string, field *ast.Field) (map[string]spec.Schema, error) {\n\tproperties := map[string]spec.Schema{}\n\tstructField, err := parser.parseField(field)\n\tif err != nil {\n\t\treturn properties, nil\n\t}\n\tif structField.name == \"\" {\n\t\treturn properties, nil\n\t}\n\tvar desc string\n\tif field.Doc != nil {\n\t\tdesc = strings.TrimSpace(field.Doc.Text())\n\t}\n\tif desc == \"\" && field.Comment != nil {\n\t\tdesc = strings.TrimSpace(field.Comment.Text())\n\t}\n\t// TODO: find package of schemaType and/or arrayType\n\n\tif structField.crossPkg != \"\" {\n\t\tpkgName = structField.crossPkg\n\t}\n\tif _, ok := parser.TypeDefinitions[pkgName][structField.schemaType]; ok { // user type field\n\t\t// write definition if not yet present\n\t\tparser.ParseDefinition(pkgName, structField.schemaType,\n\t\t\tparser.TypeDefinitions[pkgName][structField.schemaType])\n\t\tproperties[structField.name] = spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{\"object\"}, // to avoid swagger validation error\n\t\t\t\tDescription: desc,\n\t\t\t\tRef: spec.Ref{\n\t\t\t\t\tRef: jsonreference.MustCreateRef(\"#/definitions/\" + pkgName + \".\" + structField.schemaType),\n\t\t\t\t},\n\t\t\t},\n\t\t}\n\t} else if structField.schemaType == \"array\" { // array field type\n\t\t// if defined -- ref it\n\t\tif _, ok := parser.TypeDefinitions[pkgName][structField.arrayType]; ok { // user type in array\n\t\t\tparser.ParseDefinition(pkgName, structField.arrayType,\n\t\t\t\tparser.TypeDefinitions[pkgName][structField.arrayType])\n\t\t\tproperties[structField.name] = spec.Schema{\n\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\tType: []string{structField.schemaType},\n\t\t\t\t\tDescription: desc,\n\t\t\t\t\tItems: &spec.SchemaOrArray{\n\t\t\t\t\t\tSchema: &spec.Schema{\n\t\t\t\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\t\t\t\tRef: spec.Ref{\n\t\t\t\t\t\t\t\t\tRef: jsonreference.MustCreateRef(\"#/definitions/\" + pkgName + \".\" + structField.arrayType),\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t}\n\t\t} else { // standard type in array\n\t\t\trequired := make([]string, 0)\n\t\t\tif structField.isRequired {\n\t\t\t\trequired = append(required, structField.name)\n\t\t\t}\n\n\t\t\tproperties[structField.name] = spec.Schema{\n\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\tType: []string{structField.schemaType},\n\t\t\t\t\tDescription: desc,\n\t\t\t\t\tFormat: structField.formatType,\n\t\t\t\t\tRequired: required,\n\t\t\t\t\tItems: &spec.SchemaOrArray{\n\t\t\t\t\t\tSchema: &spec.Schema{\n\t\t\t\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\t\t\t\tType: []string{structField.arrayType},\n\t\t\t\t\t\t\t\tMaximum: structField.maximum,\n\t\t\t\t\t\t\t\tMinimum: structField.minimum,\n\t\t\t\t\t\t\t\tMaxLength: structField.maxLength,\n\t\t\t\t\t\t\t\tMinLength: structField.minLength,\n\t\t\t\t\t\t\t\tEnum: structField.enums,\n\t\t\t\t\t\t\t\tDefault: structField.defaultValue,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tSwaggerSchemaProps: spec.SwaggerSchemaProps{\n\t\t\t\t\tExample: structField.exampleValue,\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t} else {\n\t\trequired := make([]string, 0)\n\t\tif structField.isRequired {\n\t\t\trequired = append(required, structField.name)\n\t\t}\n\t\tproperties[structField.name] = spec.Schema{\n\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\tType: []string{structField.schemaType},\n\t\t\t\tDescription: desc,\n\t\t\t\tFormat: structField.formatType,\n\t\t\t\tRequired: required,\n\t\t\t\tMaximum: structField.maximum,\n\t\t\t\tMinimum: structField.minimum,\n\t\t\t\tMaxLength: structField.maxLength,\n\t\t\t\tMinLength: structField.minLength,\n\t\t\t\tEnum: structField.enums,\n\t\t\t\tDefault: structField.defaultValue,\n\t\t\t},\n\t\t\tSwaggerSchemaProps: spec.SwaggerSchemaProps{\n\t\t\t\tExample: structField.exampleValue,\n\t\t\t},\n\t\t\tVendorExtensible: spec.VendorExtensible{\n\t\t\t\tExtensions: structField.extensions,\n\t\t\t},\n\t\t}\n\n\t\tnestStruct, ok := field.Type.(*ast.StructType)\n\t\tif ok {\n\t\t\tprops := map[string]spec.Schema{}\n\t\t\tnestRequired := make([]string, 0)\n\t\t\tfor _, v := range nestStruct.Fields.List {\n\t\t\t\tp, err := parser.parseStruct(pkgName, v)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn properties, err\n\t\t\t\t}\n\t\t\t\tfor k, v := range p {\n\t\t\t\t\tif v.SchemaProps.Type[0] != \"object\" {\n\t\t\t\t\t\tnestRequired = append(nestRequired, v.SchemaProps.Required...)\n\t\t\t\t\t\tv.SchemaProps.Required = make([]string, 0)\n\t\t\t\t\t}\n\t\t\t\t\tprops[k] = v\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tproperties[structField.name] = spec.Schema{\n\t\t\t\tSchemaProps: spec.SchemaProps{\n\t\t\t\t\tType: []string{structField.schemaType},\n\t\t\t\t\tDescription: desc,\n\t\t\t\t\tFormat: structField.formatType,\n\t\t\t\t\tProperties: props,\n\t\t\t\t\tRequired: nestRequired,\n\t\t\t\t\tMaximum: structField.maximum,\n\t\t\t\t\tMinimum: structField.minimum,\n\t\t\t\t\tMaxLength: structField.maxLength,\n\t\t\t\t\tMinLength: structField.minLength,\n\t\t\t\t\tEnum: structField.enums,\n\t\t\t\t\tDefault: structField.defaultValue,\n\t\t\t\t},\n\t\t\t\tSwaggerSchemaProps: spec.SwaggerSchemaProps{\n\t\t\t\t\tExample: structField.exampleValue,\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n\treturn properties, nil\n}\n\nfunc (parser *Parser) parseAnonymousField(pkgName string, field *ast.Field) (map[string]spec.Schema, []string, error) {\n\tproperties := make(map[string]spec.Schema)\n\n\tfullTypeName := \"\"\n\tswitch ftype := field.Type.(type) {\n\tcase *ast.Ident:\n\t\tfullTypeName = ftype.Name\n\tcase *ast.StarExpr:\n\t\tif ftypeX, ok := ftype.X.(*ast.Ident); ok {\n\t\t\tfullTypeName = ftypeX.Name\n\t\t} else if ftypeX, ok := ftype.X.(*ast.SelectorExpr); ok {\n\t\t\tif packageX, ok := ftypeX.X.(*ast.Ident); ok {\n\t\t\t\tfullTypeName = fmt.Sprintf(\"%s.%s\", packageX.Name, ftypeX.Sel.Name)\n\t\t\t}\n\t\t} else {\n\t\t\tPrintf(\"Composite field type of '%T' is unhandle by parser. Skipping\", ftype)\n\t\t\treturn properties, []string{}, nil\n\t\t}\n\tdefault:\n\t\tPrintf(\"Field type of '%T' is unsupported. Skipping\", ftype)\n\t\treturn properties, []string{}, nil\n\t}\n\n\ttypeName := fullTypeName\n\tif splits := strings.Split(fullTypeName, \".\"); len(splits) > 1 {\n\t\tpkgName = splits[0]\n\t\ttypeName = splits[1]\n\t}\n\n\ttypeSpec := parser.TypeDefinitions[pkgName][typeName]\n\tschema, err := parser.parseTypeExpr(pkgName, typeName, typeSpec.Type)\n\tif err != nil {\n\t\treturn properties, []string{}, err\n\t}\n\tschemaType := \"unknown\"\n\tif len(schema.SchemaProps.Type) > 0 {\n\t\tschemaType = schema.SchemaProps.Type[0]\n\t}\n\n\tswitch schemaType {\n\tcase \"object\":\n\t\tfor k, v := range schema.SchemaProps.Properties {\n\t\t\tproperties[k] = v\n\t\t}\n\tcase \"array\":\n\t\tproperties[typeName] = schema\n\tdefault:\n\t\tPrintf(\"Can't extract properties from a schema of type '%s'\", schemaType)\n\t}\n\n\treturn properties, schema.SchemaProps.Required, nil\n}\n\nfunc (parser *Parser) parseField(field *ast.Field) (*structField, error) {\n\tprop, err := getPropertyName(field.Type, parser)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(prop.ArrayType) == 0 {\n\t\tCheckSchemaType(prop.SchemaType)\n\t} else {\n\t\tCheckSchemaType(\"array\")\n\t}\n\tstructField := &structField{\n\t\tname: field.Names[0].Name,\n\t\tschemaType: prop.SchemaType,\n\t\tarrayType: prop.ArrayType,\n\t\tcrossPkg: prop.CrossPkg,\n\t}\n\n\tswitch parser.PropNamingStrategy {\n\tcase SnakeCase:\n\t\tstructField.name = toSnakeCase(structField.name)\n\tcase PascalCase:\n\t\t//use struct field name\n\tcase CamelCase:\n\t\tstructField.name = toLowerCamelCase(structField.name)\n\tdefault:\n\t\tstructField.name = toLowerCamelCase(structField.name)\n\t}\n\n\tif field.Tag == nil {\n\t\treturn structField, nil\n\t}\n\t// `json:\"tag\"` -> json:\"tag\"\n\tstructTag := reflect.StructTag(strings.Replace(field.Tag.Value, \"`\", \"\", -1))\n\tjsonTag := structTag.Get(\"json\")\n\t// json:\"tag,hoge\"\n\tif strings.Contains(jsonTag, \",\") {\n\t\t// json:\",hoge\"\n\t\tif strings.HasPrefix(jsonTag, \",\") {\n\t\t\tjsonTag = \"\"\n\t\t} else {\n\t\t\tjsonTag = strings.SplitN(jsonTag, \",\", 2)[0]\n\t\t}\n\t}\n\tif jsonTag == \"-\" {\n\t\tstructField.name = \"\"\n\t} else if jsonTag != \"\" {\n\t\tstructField.name = jsonTag\n\t}\n\n\tif typeTag := structTag.Get(\"swaggertype\"); typeTag != \"\" {\n\t\tparts := strings.Split(typeTag, \",\")\n\t\tif 0 < len(parts) && len(parts) <= 2 {\n\t\t\tnewSchemaType := parts[0]\n\t\t\tnewArrayType := structField.arrayType\n\t\t\tif len(parts) >= 2 {\n\t\t\t\tif newSchemaType == \"array\" {\n\t\t\t\t\tnewArrayType = parts[1]\n\t\t\t\t} else if newSchemaType == \"primitive\" {\n\t\t\t\t\tnewSchemaType = parts[1]\n\t\t\t\t\tnewArrayType = parts[1]\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tCheckSchemaType(newSchemaType)\n\t\t\tCheckSchemaType(newArrayType)\n\t\t\tstructField.schemaType = newSchemaType\n\t\t\tstructField.arrayType = newArrayType\n\t\t}\n\t}\n\tif exampleTag := structTag.Get(\"example\"); exampleTag != \"\" {\n\t\texample, err := defineTypeOfExample(structField.schemaType, structField.arrayType, exampleTag)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.exampleValue = example\n\t}\n\tif formatTag := structTag.Get(\"format\"); formatTag != \"\" {\n\t\tstructField.formatType = formatTag\n\t}\n\tif bindingTag := structTag.Get(\"binding\"); bindingTag != \"\" {\n\t\tfor _, val := range strings.Split(bindingTag, \",\") {\n\t\t\tif val == \"required\" {\n\t\t\t\tstructField.isRequired = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tif validateTag := structTag.Get(\"validate\"); validateTag != \"\" {\n\t\tfor _, val := range strings.Split(validateTag, \",\") {\n\t\t\tif val == \"required\" {\n\t\t\t\tstructField.isRequired = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tif extensionsTag := structTag.Get(\"extensions\"); extensionsTag != \"\" {\n\t\tstructField.extensions = map[string]interface{}{}\n\t\tfor _, val := range strings.Split(extensionsTag, \",\") {\n\t\t\tparts := strings.SplitN(val, \"=\", 2)\n\t\t\tif len(parts) == 2 {\n\t\t\t\tstructField.extensions[parts[0]] = parts[1]\n\t\t\t} else {\n\t\t\t\tstructField.extensions[parts[0]] = true\n\t\t\t}\n\t\t}\n\t}\n\tif enumsTag := structTag.Get(\"enums\"); enumsTag != \"\" {\n\t\tenumType := structField.schemaType\n\t\tif structField.schemaType == \"array\" {\n\t\t\tenumType = structField.arrayType\n\t\t}\n\n\t\tfor _, e := range strings.Split(enumsTag, \",\") {\n\t\t\tvalue, err := defineType(enumType, e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tstructField.enums = append(structField.enums, value)\n\t\t}\n\t}\n\tif defaultTag := structTag.Get(\"default\"); defaultTag != \"\" {\n\t\tvalue, err := defineType(structField.schemaType, defaultTag)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.defaultValue = value\n\t}\n\n\tif IsNumericType(structField.schemaType) || IsNumericType(structField.arrayType) {\n\t\tmaximum, err := getFloatTag(structTag, \"maximum\")\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.maximum = maximum\n\n\t\tminimum, err := getFloatTag(structTag, \"minimum\")\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.minimum = minimum\n\t}\n\tif structField.schemaType == \"string\" || structField.arrayType == \"string\" {\n\t\tmaxLength, err := getIntTag(structTag, \"maxLength\")\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.maxLength = maxLength\n\n\t\tminLength, err := getIntTag(structTag, \"minLength\")\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructField.minLength = minLength\n\t}\n\n\treturn structField, nil\n}\n\nfunc replaceLastTag(slice []spec.Tag, element spec.Tag) {\n\tslice = slice[:len(slice)-1]\n\tslice = append(slice, element)\n}\n\nfunc getFloatTag(structTag reflect.StructTag, tagName string) (*float64, error) {\n\tstrValue := structTag.Get(tagName)\n\tif strValue == \"\" {\n\t\treturn nil, nil\n\t}\n\n\tvalue, err := strconv.ParseFloat(strValue, 64)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"can't parse numeric value of %q tag: %v\", tagName, err)\n\t}\n\n\treturn &value, nil\n}\n\nfunc getIntTag(structTag reflect.StructTag, tagName string) (*int64, error) {\n\tstrValue := structTag.Get(tagName)\n\tif strValue == \"\" {\n\t\treturn nil, nil\n\t}\n\n\tvalue, err := strconv.ParseInt(strValue, 10, 64)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"can't parse numeric value of %q tag: %v\", tagName, err)\n\t}\n\n\treturn &value, nil\n}\n\nfunc toSnakeCase(in string) string {\n\trunes := []rune(in)\n\tlength := len(runes)\n\n\tvar out []rune\n\tfor i := 0; i < length; i++ {\n\t\tif i > 0 && unicode.IsUpper(runes[i]) && ((i+1 < length && unicode.IsLower(runes[i+1])) || unicode.IsLower(runes[i-1])) {\n\t\t\tout = append(out, '_')\n\t\t}\n\t\tout = append(out, unicode.ToLower(runes[i]))\n\t}\n\treturn string(out)\n}\n\nfunc toLowerCamelCase(in string) string {\n\trunes := []rune(in)\n\n\tvar out []rune\n\tflag := false\n\tfor i, curr := range runes {\n\t\tif (i == 0 && unicode.IsUpper(curr)) || (flag && unicode.IsUpper(curr)) {\n\t\t\tout = append(out, unicode.ToLower(curr))\n\t\t\tflag = true\n\t\t} else {\n\t\t\tout = append(out, curr)\n\t\t\tflag = false\n\t\t}\n\t}\n\n\treturn string(out)\n}\n\n// defineTypeOfExample example value define the type (object and array unsupported)\nfunc defineTypeOfExample(schemaType, arrayType, exampleValue string) (interface{}, error) {\n\tswitch schemaType {\n\tcase \"string\":\n\t\treturn exampleValue, nil\n\tcase \"number\":\n\t\tv, err := strconv.ParseFloat(exampleValue, 64)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"example value %s can't convert to %s err: %s\", exampleValue, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tcase \"integer\":\n\t\tv, err := strconv.Atoi(exampleValue)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"example value %s can't convert to %s err: %s\", exampleValue, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tcase \"boolean\":\n\t\tv, err := strconv.ParseBool(exampleValue)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"example value %s can't convert to %s err: %s\", exampleValue, schemaType, err)\n\t\t}\n\t\treturn v, nil\n\tcase \"array\":\n\t\tvalues := strings.Split(exampleValue, \",\")\n\t\tresult := make([]interface{}, 0)\n\t\tfor _, value := range values {\n\t\t\tv, err := defineTypeOfExample(arrayType, \"\", value)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tresult = append(result, v)\n\t\t}\n\t\treturn result, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"%s is unsupported type in example value\", schemaType)\n\t}\n}\n\n// GetAllGoFileInfo gets all Go source files information for given searchDir.\nfunc (parser *Parser) getAllGoFileInfo(searchDir string) error {\n\treturn filepath.Walk(searchDir, parser.visit)\n}\n\nfunc (parser *Parser) visit(path string, f os.FileInfo, err error) error {\n\tif err := parser.Skip(path, f); err != nil {\n\t\treturn err\n\t}\n\n\tif ext := filepath.Ext(path); ext == \".go\" {\n\t\tfset := token.NewFileSet() // positions are relative to fset\n\t\tastFile, err := goparser.ParseFile(fset, path, nil, goparser.ParseComments)\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"ParseFile error:%+v\", err)\n\t\t}\n\n\t\tparser.files[path] = astFile\n\t}\n\treturn nil\n}\n\n// Skip returns filepath.SkipDir error if match vendor and hidden folder\nfunc (parser *Parser) Skip(path string, f os.FileInfo) error {\n\n\tif !parser.ParseVendor { // ignore vendor\n\t\tif f.IsDir() && f.Name() == \"vendor\" {\n\t\t\treturn filepath.SkipDir\n\t\t}\n\t}\n\n\t// exclude all hidden folder\n\tif f.IsDir() && len(f.Name()) > 1 && f.Name()[0] == '.' {\n\t\treturn filepath.SkipDir\n\t}\n\treturn nil\n}\n\n// GetSwagger returns *spec.Swagger which is the root document object for the API specification.\nfunc (parser *Parser) GetSwagger() *spec.Swagger {\n\treturn parser.swagger\n}\n" }, { "path": "vendor/github.com/swaggo/swag/property.go", "content": "package swag\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"go/ast\"\n\t\"strings\"\n)\n\n// ErrFailedConvertPrimitiveType Failed to convert for swag to interpretable type\nvar ErrFailedConvertPrimitiveType = errors.New(\"swag property: failed convert primitive type\")\n\ntype propertyName struct {\n\tSchemaType string\n\tArrayType string\n\tCrossPkg string\n}\n\ntype propertyNewFunc func(schemeType string, crossPkg string) propertyName\n\nfunc newArrayProperty(schemeType string, crossPkg string) propertyName {\n\treturn propertyName{\n\t\tSchemaType: \"array\",\n\t\tArrayType: schemeType,\n\t\tCrossPkg: crossPkg,\n\t}\n}\n\nfunc newProperty(schemeType string, crossPkg string) propertyName {\n\treturn propertyName{\n\t\tSchemaType: schemeType,\n\t\tArrayType: \"string\",\n\t\tCrossPkg: crossPkg,\n\t}\n}\n\nfunc convertFromSpecificToPrimitive(typeName string) (string, error) {\n\ttypeName = strings.ToUpper(typeName)\n\tswitch typeName {\n\tcase \"TIME\", \"OBJECTID\", \"UUID\":\n\t\treturn \"string\", nil\n\tcase \"DECIMAL\":\n\t\treturn \"number\", nil\n\t}\n\treturn \"\", ErrFailedConvertPrimitiveType\n}\n\nfunc parseFieldSelectorExpr(astTypeSelectorExpr *ast.SelectorExpr, parser *Parser, propertyNewFunc propertyNewFunc) propertyName {\n\tif primitiveType, err := convertFromSpecificToPrimitive(astTypeSelectorExpr.Sel.Name); err == nil {\n\t\treturn propertyNewFunc(primitiveType, \"\")\n\t}\n\n\tif pkgName, ok := astTypeSelectorExpr.X.(*ast.Ident); ok {\n\t\tif typeDefinitions, ok := parser.TypeDefinitions[pkgName.Name][astTypeSelectorExpr.Sel.Name]; ok {\n\t\t\tif expr, ok := typeDefinitions.Type.(*ast.SelectorExpr); ok {\n\t\t\t\tif primitiveType, err := convertFromSpecificToPrimitive(expr.Sel.Name); err == nil {\n\t\t\t\t\treturn propertyNewFunc(primitiveType, \"\")\n\t\t\t\t}\n\t\t\t}\n\t\t\tparser.ParseDefinition(pkgName.Name, astTypeSelectorExpr.Sel.Name, typeDefinitions)\n\t\t\treturn propertyNewFunc(astTypeSelectorExpr.Sel.Name, pkgName.Name)\n\t\t}\n\t\tif actualPrimitiveType, isCustomType := parser.CustomPrimitiveTypes[astTypeSelectorExpr.Sel.Name]; isCustomType {\n\t\t\treturn propertyName{SchemaType: actualPrimitiveType, ArrayType: actualPrimitiveType}\n\t\t}\n\t}\n\treturn propertyName{SchemaType: \"string\", ArrayType: \"string\"}\n}\n\n// getPropertyName returns the string value for the given field if it exists\n// allowedValues: array, boolean, integer, null, number, object, string\nfunc getPropertyName(expr ast.Expr, parser *Parser) (propertyName, error) {\n\tif astTypeSelectorExpr, ok := expr.(*ast.SelectorExpr); ok {\n\t\treturn parseFieldSelectorExpr(astTypeSelectorExpr, parser, newProperty), nil\n\t}\n\n\t// check if it is a custom type\n\ttypeName := fmt.Sprintf(\"%v\", expr)\n\tif actualPrimitiveType, isCustomType := parser.CustomPrimitiveTypes[typeName]; isCustomType {\n\t\treturn propertyName{SchemaType: actualPrimitiveType, ArrayType: actualPrimitiveType}, nil\n\t}\n\n\tif astTypeIdent, ok := expr.(*ast.Ident); ok {\n\t\tname := astTypeIdent.Name\n\t\tschemeType := TransToValidSchemeType(name)\n\t\treturn propertyName{SchemaType: schemeType, ArrayType: schemeType}, nil\n\t}\n\n\tif ptr, ok := expr.(*ast.StarExpr); ok {\n\t\treturn getPropertyName(ptr.X, parser)\n\t}\n\n\tif astTypeArray, ok := expr.(*ast.ArrayType); ok { // if array\n\t\treturn getArrayPropertyName(astTypeArray, parser), nil\n\t}\n\n\tif _, ok := expr.(*ast.MapType); ok { // if map\n\t\treturn propertyName{SchemaType: \"object\", ArrayType: \"object\"}, nil\n\t}\n\n\tif _, ok := expr.(*ast.StructType); ok { // if struct\n\t\treturn propertyName{SchemaType: \"object\", ArrayType: \"object\"}, nil\n\t}\n\n\tif _, ok := expr.(*ast.InterfaceType); ok { // if interface{}\n\t\treturn propertyName{SchemaType: \"object\", ArrayType: \"object\"}, nil\n\t}\n\n\treturn propertyName{}, errors.New(\"not supported\" + fmt.Sprint(expr))\n}\n\nfunc getArrayPropertyName(astTypeArray *ast.ArrayType, parser *Parser) propertyName {\n\tif astTypeArrayExpr, ok := astTypeArray.Elt.(*ast.SelectorExpr); ok {\n\t\treturn parseFieldSelectorExpr(astTypeArrayExpr, parser, newArrayProperty)\n\t}\n\tif astTypeArrayExpr, ok := astTypeArray.Elt.(*ast.StarExpr); ok {\n\t\tif astTypeArraySel, ok := astTypeArrayExpr.X.(*ast.SelectorExpr); ok {\n\t\t\treturn parseFieldSelectorExpr(astTypeArraySel, parser, newArrayProperty)\n\t\t}\n\t\tif astTypeArrayIdent, ok := astTypeArrayExpr.X.(*ast.Ident); ok {\n\t\t\tname := TransToValidSchemeType(astTypeArrayIdent.Name)\n\t\t\treturn propertyName{SchemaType: \"array\", ArrayType: name}\n\t\t}\n\t}\n\titemTypeName := TransToValidSchemeType(fmt.Sprintf(\"%s\", astTypeArray.Elt))\n\tif actualPrimitiveType, isCustomType := parser.CustomPrimitiveTypes[itemTypeName]; isCustomType {\n\t\titemTypeName = actualPrimitiveType\n\t}\n\treturn propertyName{SchemaType: \"array\", ArrayType: itemTypeName}\n}\n" }, { "path": "vendor/github.com/swaggo/swag/schema.go", "content": "package swag\n\nimport \"fmt\"\n\n// CheckSchemaType checks if typeName is not a name of primitive type\nfunc CheckSchemaType(typeName string) error {\n\tif !IsPrimitiveType(typeName) {\n\t\treturn fmt.Errorf(\"%s is not basic types\", typeName)\n\t}\n\treturn nil\n}\n\n// IsPrimitiveType determine whether the type name is a primitive type\nfunc IsPrimitiveType(typeName string) bool {\n\tswitch typeName {\n\tcase \"string\", \"number\", \"integer\", \"boolean\", \"array\", \"object\":\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\n// IsNumericType determines whether the swagger type name is a numeric type\nfunc IsNumericType(typeName string) bool {\n\treturn typeName == \"integer\" || typeName == \"number\"\n}\n\n// TransToValidSchemeType indicates type will transfer golang basic type to swagger supported type.\nfunc TransToValidSchemeType(typeName string) string {\n\tswitch typeName {\n\tcase \"uint\", \"int\", \"uint8\", \"int8\", \"uint16\", \"int16\", \"byte\":\n\t\treturn \"integer\"\n\tcase \"uint32\", \"int32\", \"rune\":\n\t\treturn \"integer\"\n\tcase \"uint64\", \"int64\":\n\t\treturn \"integer\"\n\tcase \"float32\", \"float64\":\n\t\treturn \"number\"\n\tcase \"bool\":\n\t\treturn \"boolean\"\n\tcase \"string\":\n\t\treturn \"string\"\n\tdefault:\n\t\treturn typeName // to support user defined types\n\t}\n}\n\n// IsGolangPrimitiveType determine whether the type name is a golang primitive type\nfunc IsGolangPrimitiveType(typeName string) bool {\n\tswitch typeName {\n\tcase \"uint\",\n\t\t\"int\",\n\t\t\"uint8\",\n\t\t\"int8\",\n\t\t\"uint16\",\n\t\t\"int16\",\n\t\t\"byte\",\n\t\t\"uint32\",\n\t\t\"int32\",\n\t\t\"rune\",\n\t\t\"uint64\",\n\t\t\"int64\",\n\t\t\"float32\",\n\t\t\"float64\",\n\t\t\"bool\",\n\t\t\"string\":\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n" }, { "path": "vendor/github.com/swaggo/swag/swagger.go", "content": "package swag\n\nimport (\n\t\"errors\"\n\t\"sync\"\n)\n\n// Name is a unique name be used to register swag instance.\nconst Name = \"swagger\"\n\nvar (\n\tswaggerMu sync.RWMutex\n\tswag Swagger\n)\n\n// Swagger is a interface to read swagger document.\ntype Swagger interface {\n\tReadDoc() string\n}\n\n// Register registers swagger for given name.\nfunc Register(name string, swagger Swagger) {\n\tswaggerMu.Lock()\n\tdefer swaggerMu.Unlock()\n\tif swagger == nil {\n\t\tpanic(\"swagger is nil\")\n\t}\n\n\tif swag != nil {\n\t\tpanic(\"Register called twice for swag: \" + name)\n\t}\n\tswag = swagger\n}\n\n// ReadDoc reads swagger document.\nfunc ReadDoc() (string, error) {\n\tif swag != nil {\n\t\treturn swag.ReadDoc(), nil\n\t}\n\treturn \"\", errors.New(\"not yet registered swag\")\n}\n" }, { "path": "vendor/github.com/swaggo/swag/version.go", "content": "package swag\n\n// Version of swag\nconst Version = \"v1.5.1\"\n" }, { "path": "vendor/github.com/tealeg/xlsx/.gitignore", "content": ".vscode\n.DS_Store\nxlsx.test\n*.swp\ncoverage.txt\n" }, { "path": "vendor/github.com/tealeg/xlsx/.travis.yml", "content": "language: go\n\ngo:\n - 1.8.x\n - 1.9.x\n\nscript:\n - go vet ./...\n - go test -v -coverprofile=coverage.txt -covermode=atomic .\n\nafter_success:\n - bash <(curl -s https://codecov.io/bash)\n" }, { "path": "vendor/github.com/tealeg/xlsx/AUTHORS.txt", "content": "ACHER \nAndrew Schwartz \nArtem Chernyak \nArtem Chernyak \nblackss2 \nBrandon Mulcahy \nBrian Smith \nbronze1man \nBruno Bigras \nChris Glass \nColin Fox \nColin Fox \ncrahles \nDaniel Upton \nDaniel YC Lin \nDerLinkshaender \nEric \nfrogs \nfzerorubigd \nGeoffrey J. Teale \nGyu-Ho Lee \nHerman Schaaf \nHugh Gao \nIain Lowe \nivnivnch \nJason Hall \nJoshua Baker \nKaur Kuut \nLunny Xiao \nmagician1 \nMathias Fredriksson \nMatt Aimonetti \nMoch. Lutfi \nMoch.Lutfi \nNeoin \nNguyen Nguyen \nNikita Danilov \nOneOfOne \nPeter Waller \nPhilipp Klose \nrichard bucker \nShawn Milochik \nShawn Smith \nShawn Smith \nSHIMADA Koji \nSteven Degutis \ntakuya sato \nThieu Pham \nTormod Erevik Lea \ntrinchan \nU-NORTH_AMERICA\\ACHER \nYAMADA Tsuyoshi \nYoshiki Shibukawa \nzhcy \n" }, { "path": "vendor/github.com/tealeg/xlsx/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment include:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or advances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at tealeg@gmail.com. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": "vendor/github.com/tealeg/xlsx/LICENSE", "content": "BSD 3-Clause License\n\nCopyright (c) 2011-2017, Geoffrey J. Teale\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and/or other materials provided with the distribution.\n\n* Neither the name of the copyright holder nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/tealeg/xlsx/README.org", "content": "* XLSX\n\n[[https://travis-ci.org/tealeg/xlsx][https://img.shields.io/travis/tealeg/xlsx/master.svg?style=flat-square]]\n[[https://codecov.io/gh/tealeg/xlsx][https://codecov.io/gh/tealeg/xlsx/branch/master/graph/badge.svg]]\n[[https://godoc.org/github.com/tealeg/xlsx][https://godoc.org/github.com/tealeg/xlsx?status.svg]]\n[[https://github.com/tealeg/xlsx#license][https://img.shields.io/badge/license-bsd-orange.svg]]\n\n** Introduction\nxlsx is a library to simplify reading and writing the XML format used\nby recent version of Microsoft Excel in Go programs.\n\nThe support for writing XLSX files is currently extremely minimal. It\nwill expand slowly, but in the meantime patches are welcome!\n\n** Full API docs\nThe full API docs can be viewed using go's built in documentation\ntool, or online at [[http://godoc.org/github.com/tealeg/xlsx][godoc.org]].\n\n** Basic Usage\n*** Reading XLSX files\nHere is a minimal example usage that will dump all cell data in a\ngiven XLSX file. A more complete example of this kind of\nfunctionality is contained in [[https://github.com/tealeg/xlsx2csv][the XLSX2CSV program]]:\n\n#+BEGIN_SRC go\n\npackage main\n\nimport (\n \"fmt\"\n \"github.com/tealeg/xlsx\"\n)\n\nfunc main() {\n excelFileName := \"/home/tealeg/foo.xlsx\"\n xlFile, err := xlsx.OpenFile(excelFileName)\n if err != nil {\n ...\n }\n for _, sheet := range xlFile.Sheets {\n for _, row := range sheet.Rows {\n for _, cell := range row.Cells {\n text := cell.String()\n fmt.Printf(\"%s\\n\", text)\n }\n }\n }\n}\n\n#+END_SRC\n\nSome additional information is available from the cell (for example,\nstyle information). For more details see the godoc output for this\npackage.\n\n*** Writing XLSX files\nThe following constitutes the bare minimum required to write an XLSX document.\n\n#+BEGIN_SRC go\n\npackage main\n\nimport (\n \"fmt\"\n \"github.com/tealeg/xlsx\"\n)\n\nfunc main() {\n var file *xlsx.File\n var sheet *xlsx.Sheet\n var row *xlsx.Row\n var cell *xlsx.Cell\n var err error\n\n file = xlsx.NewFile()\n sheet, err = file.AddSheet(\"Sheet1\")\n if err != nil {\n fmt.Printf(err.Error())\n }\n row = sheet.AddRow()\n cell = row.AddCell()\n cell.Value = \"I am a cell!\"\n err = file.Save(\"MyXLSXFile.xlsx\")\n if err != nil {\n fmt.Printf(err.Error())\n }\n}\n\n#+END_SRC\n\n** Contributing\n\nWe're extremely happy to review pull requests. Please be patient, maintaining XLSX doesn't pay anyone's salary (to my knowledge).\n\nIf you'd like to propose a change please ensure the following:\n\n- All existing tests are passing.\n- There are tests in the test suite that cover the changes you're making.\n- You have added documentation strings (in English) to (at least) the public functions you've added or modified.\n- Your use of, or creation of, XML is compliant with [[http://www.ecma-international.org/publications/standards/Ecma-376.htm][part 1 of the 4th edition of the ECMA-376 Standard for Office Open XML]].\n\nEat a peach - Geoff\n" }, { "path": "vendor/github.com/tealeg/xlsx/cell.go", "content": "package xlsx\n\nimport (\n\t\"fmt\"\n\t\"math\"\n\t\"strconv\"\n\t\"time\"\n)\n\nconst (\n\tmaxNonScientificNumber = 1e11\n\tminNonScientificNumber = 1e-9\n)\n\n// CellType is an int type for storing metadata about the data type in the cell.\ntype CellType int\n\n// These are the cell types from the ST_CellType spec\nconst (\n\tCellTypeString CellType = iota\n\t// CellTypeStringFormula is a specific format for formulas that return string values. Formulas that return numbers\n\t// and booleans are stored as those types.\n\tCellTypeStringFormula\n\tCellTypeNumeric\n\tCellTypeBool\n\t// CellTypeInline is not respected on save, all inline string cells will be saved as SharedStrings\n\t// when saving to an XLSX file. This the same behavior as that found in Excel.\n\tCellTypeInline\n\tCellTypeError\n\t// d (Date): Cell contains a date in the ISO 8601 format.\n\t// That is the only mention of this format in the XLSX spec.\n\t// Date seems to be unused by the current version of Excel, it stores dates as Numeric cells with a date format string.\n\t// For now these cells will have their value output directly. It is unclear if the value is supposed to be parsed\n\t// into a number and then formatted using the formatting or not.\n\tCellTypeDate\n)\n\nfunc (ct CellType) Ptr() *CellType {\n\treturn &ct\n}\n\n// Cell is a high level structure intended to provide user access to\n// the contents of Cell within an xlsx.Row.\ntype Cell struct {\n\tRow *Row\n\tValue string\n\tformula string\n\tstyle *Style\n\tNumFmt string\n\tparsedNumFmt *parsedNumberFormat\n\tdate1904 bool\n\tHidden bool\n\tHMerge int\n\tVMerge int\n\tcellType CellType\n}\n\n// CellInterface defines the public API of the Cell.\ntype CellInterface interface {\n\tString() string\n\tFormattedValue() string\n}\n\n// NewCell creates a cell and adds it to a row.\nfunc NewCell(r *Row) *Cell {\n\treturn &Cell{Row: r, NumFmt: \"general\"}\n}\n\n// Merge with other cells, horizontally and/or vertically.\nfunc (c *Cell) Merge(hcells, vcells int) {\n\tc.HMerge = hcells\n\tc.VMerge = vcells\n}\n\n// Type returns the CellType of a cell. See CellType constants for more details.\nfunc (c *Cell) Type() CellType {\n\treturn c.cellType\n}\n\n// SetString sets the value of a cell to a string.\nfunc (c *Cell) SetString(s string) {\n\tc.Value = s\n\tc.formula = \"\"\n\tc.cellType = CellTypeString\n}\n\n// String returns the value of a Cell as a string. If you'd like to\n// see errors returned from formatting then please use\n// Cell.FormattedValue() instead.\nfunc (c *Cell) String() string {\n\t// To preserve the String() interface we'll throw away errors.\n\t// Not that using FormattedValue is therefore strongly\n\t// preferred.\n\tvalue, _ := c.FormattedValue()\n\treturn value\n}\n\n// SetFloat sets the value of a cell to a float.\nfunc (c *Cell) SetFloat(n float64) {\n\tc.SetValue(n)\n}\n\n//GetTime returns the value of a Cell as a time.Time\nfunc (c *Cell) GetTime(date1904 bool) (t time.Time, err error) {\n\tf, err := c.Float()\n\tif err != nil {\n\t\treturn t, err\n\t}\n\treturn TimeFromExcelTime(f, date1904), nil\n}\n\n/*\n\tThe following are samples of format samples.\n\n\t* \"0.00e+00\"\n\t* \"0\", \"#,##0\"\n\t* \"0.00\", \"#,##0.00\", \"@\"\n\t* \"#,##0 ;(#,##0)\", \"#,##0 ;[red](#,##0)\"\n\t* \"#,##0.00;(#,##0.00)\", \"#,##0.00;[red](#,##0.00)\"\n\t* \"0%\", \"0.00%\"\n\t* \"0.00e+00\", \"##0.0e+0\"\n*/\n\n// SetFloatWithFormat sets the value of a cell to a float and applies\n// formatting to the cell.\nfunc (c *Cell) SetFloatWithFormat(n float64, format string) {\n\tc.SetValue(n)\n\tc.NumFmt = format\n\tc.formula = \"\"\n}\n\nvar timeLocationUTC, _ = time.LoadLocation(\"UTC\")\n\nfunc TimeToUTCTime(t time.Time) time.Time {\n\treturn time.Date(t.Year(), t.Month(), t.Day(), t.Hour(), t.Minute(), t.Second(), t.Nanosecond(), timeLocationUTC)\n}\n\nfunc TimeToExcelTime(t time.Time) float64 {\n\treturn float64(t.UnixNano())/8.64e13 + 25569.0\n}\n\n// DateTimeOptions are additional options for exporting times\ntype DateTimeOptions struct {\n\t// Location allows calculating times in other timezones/locations\n\tLocation *time.Location\n\t// ExcelTimeFormat is the string you want excel to use to format the datetime\n\tExcelTimeFormat string\n}\n\nvar (\n\tDefaultDateFormat = builtInNumFmt[14]\n\tDefaultDateTimeFormat = builtInNumFmt[22]\n\n\tDefaultDateOptions = DateTimeOptions{\n\t\tLocation: timeLocationUTC,\n\t\tExcelTimeFormat: DefaultDateFormat,\n\t}\n\n\tDefaultDateTimeOptions = DateTimeOptions{\n\t\tLocation: timeLocationUTC,\n\t\tExcelTimeFormat: DefaultDateTimeFormat,\n\t}\n)\n\n// SetDate sets the value of a cell to a float.\nfunc (c *Cell) SetDate(t time.Time) {\n\tc.SetDateWithOptions(t, DefaultDateOptions)\n}\n\nfunc (c *Cell) SetDateTime(t time.Time) {\n\tc.SetDateWithOptions(t, DefaultDateTimeOptions)\n}\n\n// SetDateWithOptions allows for more granular control when exporting dates and times\nfunc (c *Cell) SetDateWithOptions(t time.Time, options DateTimeOptions) {\n\t_, offset := t.In(options.Location).Zone()\n\tt = time.Unix(t.Unix()+int64(offset), 0)\n\tc.SetDateTimeWithFormat(TimeToExcelTime(t.In(timeLocationUTC)), options.ExcelTimeFormat)\n}\n\nfunc (c *Cell) SetDateTimeWithFormat(n float64, format string) {\n\tc.Value = strconv.FormatFloat(n, 'f', -1, 64)\n\tc.NumFmt = format\n\tc.formula = \"\"\n\tc.cellType = CellTypeNumeric\n}\n\n// Float returns the value of cell as a number.\nfunc (c *Cell) Float() (float64, error) {\n\tf, err := strconv.ParseFloat(c.Value, 64)\n\tif err != nil {\n\t\treturn math.NaN(), err\n\t}\n\treturn f, nil\n}\n\n// SetInt64 sets a cell's value to a 64-bit integer.\nfunc (c *Cell) SetInt64(n int64) {\n\tc.SetValue(n)\n}\n\n// Int64 returns the value of cell as 64-bit integer.\nfunc (c *Cell) Int64() (int64, error) {\n\tf, err := strconv.ParseInt(c.Value, 10, 64)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\treturn f, nil\n}\n\n// GeneralNumeric returns the value of the cell as a string. It is formatted very closely to the the XLSX spec for how\n// to display values when the storage type is Number and the format type is General. It is not 100% identical to the\n// spec but is as close as you can get using the built in Go formatting tools.\nfunc (c *Cell) GeneralNumeric() (string, error) {\n\treturn generalNumericScientific(c.Value, true)\n}\n\n// GeneralNumericWithoutScientific returns numbers that are always formatted as numbers, but it does not follow\n// the rules for when XLSX should switch to scientific notation, since sometimes scientific notation is not desired,\n// even if that is how the document is supposed to be formatted.\nfunc (c *Cell) GeneralNumericWithoutScientific() (string, error) {\n\treturn generalNumericScientific(c.Value, false)\n}\n\n// SetInt sets a cell's value to an integer.\nfunc (c *Cell) SetInt(n int) {\n\tc.SetValue(n)\n}\n\n// SetInt sets a cell's value to an integer.\nfunc (c *Cell) SetValue(n interface{}) {\n\tswitch t := n.(type) {\n\tcase time.Time:\n\t\tc.SetDateTime(t)\n\t\treturn\n\tcase int, int8, int16, int32, int64:\n\t\tc.setNumeric(fmt.Sprintf(\"%d\", n))\n\tcase float64:\n\t\t// When formatting floats, do not use fmt.Sprintf(\"%v\", n), this will cause numbers below 1e-4 to be printed in\n\t\t// scientific notation. Scientific notation is not a valid way to store numbers in XML.\n\t\t// Also not not use fmt.Sprintf(\"%f\", n), this will cause numbers to be stored as X.XXXXXX. Which means that\n\t\t// numbers will lose precision and numbers with fewer significant digits such as 0 will be stored as 0.000000\n\t\t// which causes tests to fail.\n\t\tc.setNumeric(strconv.FormatFloat(t, 'f', -1, 64))\n\tcase float32:\n\t\tc.setNumeric(strconv.FormatFloat(float64(t), 'f', -1, 32))\n\tcase string:\n\t\tc.SetString(t)\n\tcase []byte:\n\t\tc.SetString(string(t))\n\tcase nil:\n\t\tc.SetString(\"\")\n\tdefault:\n\t\tc.SetString(fmt.Sprintf(\"%v\", n))\n\t}\n}\n\n// setNumeric sets a cell's value to a number\nfunc (c *Cell) setNumeric(s string) {\n\tc.Value = s\n\tc.NumFmt = builtInNumFmt[builtInNumFmtIndex_GENERAL]\n\tc.formula = \"\"\n\tc.cellType = CellTypeNumeric\n}\n\n// Int returns the value of cell as integer.\n// Has max 53 bits of precision\n// See: float64(int64(math.MaxInt))\nfunc (c *Cell) Int() (int, error) {\n\tf, err := strconv.ParseFloat(c.Value, 64)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\treturn int(f), nil\n}\n\n// SetBool sets a cell's value to a boolean.\nfunc (c *Cell) SetBool(b bool) {\n\tif b {\n\t\tc.Value = \"1\"\n\t} else {\n\t\tc.Value = \"0\"\n\t}\n\tc.cellType = CellTypeBool\n}\n\n// Bool returns a boolean from a cell's value.\n// TODO: Determine if the current return value is\n// appropriate for types other than CellTypeBool.\nfunc (c *Cell) Bool() bool {\n\t// If bool, just return the value.\n\tif c.cellType == CellTypeBool {\n\t\treturn c.Value == \"1\"\n\t}\n\t// If numeric, base it on a non-zero.\n\tif c.cellType == CellTypeNumeric {\n\t\treturn c.Value != \"0\"\n\t}\n\t// Return whether there's an empty string.\n\treturn c.Value != \"\"\n}\n\n// SetFormula sets the format string for a cell.\nfunc (c *Cell) SetFormula(formula string) {\n\tc.formula = formula\n\tc.cellType = CellTypeNumeric\n}\n\nfunc (c *Cell) SetStringFormula(formula string) {\n\tc.formula = formula\n\tc.cellType = CellTypeStringFormula\n}\n\n// Formula returns the formula string for the cell.\nfunc (c *Cell) Formula() string {\n\treturn c.formula\n}\n\n// GetStyle returns the Style associated with a Cell\nfunc (c *Cell) GetStyle() *Style {\n\tif c.style == nil {\n\t\tc.style = NewStyle()\n\t}\n\treturn c.style\n}\n\n// SetStyle sets the style of a cell.\nfunc (c *Cell) SetStyle(style *Style) {\n\tc.style = style\n}\n\n// GetNumberFormat returns the number format string for a cell.\nfunc (c *Cell) GetNumberFormat() string {\n\treturn c.NumFmt\n}\n\nfunc (c *Cell) formatToFloat(format string) (string, error) {\n\tf, err := strconv.ParseFloat(c.Value, 64)\n\tif err != nil {\n\t\treturn c.Value, err\n\t}\n\treturn fmt.Sprintf(format, f), nil\n}\n\nfunc (c *Cell) formatToInt(format string) (string, error) {\n\tf, err := strconv.ParseFloat(c.Value, 64)\n\tif err != nil {\n\t\treturn c.Value, err\n\t}\n\treturn fmt.Sprintf(format, int(f)), nil\n}\n\n// getNumberFormat will update the parsedNumFmt struct if it has become out of date, since a cell's NumFmt string is a\n// public field that could be edited by clients.\nfunc (c *Cell) getNumberFormat() *parsedNumberFormat {\n\tif c.parsedNumFmt == nil || c.parsedNumFmt.numFmt != c.NumFmt {\n\t\tc.parsedNumFmt = parseFullNumberFormatString(c.NumFmt)\n\t}\n\treturn c.parsedNumFmt\n}\n\n// FormattedValue returns a value, and possibly an error condition\n// from a Cell. If it is possible to apply a format to the cell\n// value, it will do so, if not then an error will be returned, along\n// with the raw value of the Cell.\nfunc (c *Cell) FormattedValue() (string, error) {\n\tfullFormat := c.getNumberFormat()\n\treturnVal, err := fullFormat.FormatValue(c)\n\tif fullFormat.parseEncounteredError != nil {\n\t\treturn returnVal, *fullFormat.parseEncounteredError\n\t}\n\treturn returnVal, err\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/col.go", "content": "package xlsx\n\n// Default column width in excel\nconst ColWidth = 9.5\n\ntype Col struct {\n\tMin int\n\tMax int\n\tHidden bool\n\tWidth float64\n\tCollapsed bool\n\tOutlineLevel uint8\n\tnumFmt string\n\tparsedNumFmt *parsedNumberFormat\n\tstyle *Style\n}\n\n// SetType will set the format string of a column based on the type that you want to set it to.\n// This function does not really make a lot of sense.\nfunc (c *Col) SetType(cellType CellType) {\n\tswitch cellType {\n\tcase CellTypeString:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_STRING]\n\tcase CellTypeNumeric:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_INT]\n\tcase CellTypeBool:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_GENERAL] //TEMP\n\tcase CellTypeInline:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_STRING]\n\tcase CellTypeError:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_GENERAL] //TEMP\n\tcase CellTypeDate:\n\t\t// Cells that are stored as dates are not properly supported in this library.\n\t\t// They should instead be stored as a Numeric with a date format.\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_GENERAL]\n\tcase CellTypeStringFormula:\n\t\tc.numFmt = builtInNumFmt[builtInNumFmtIndex_STRING]\n\t}\n}\n\n// GetStyle returns the Style associated with a Col\nfunc (c *Col) GetStyle() *Style {\n\treturn c.style\n}\n\n// SetStyle sets the style of a Col\nfunc (c *Col) SetStyle(style *Style) {\n\tc.style = style\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/date.go", "content": "package xlsx\n\nimport (\n\t\"math\"\n\t\"time\"\n)\n\nconst MJD_0 float64 = 2400000.5\nconst MJD_JD2000 float64 = 51544.5\n\nfunc shiftJulianToNoon(julianDays, julianFraction float64) (float64, float64) {\n\tswitch {\n\tcase -0.5 < julianFraction && julianFraction < 0.5:\n\t\tjulianFraction += 0.5\n\tcase julianFraction >= 0.5:\n\t\tjulianDays += 1\n\t\tjulianFraction -= 0.5\n\tcase julianFraction <= -0.5:\n\t\tjulianDays -= 1\n\t\tjulianFraction += 1.5\n\t}\n\treturn julianDays, julianFraction\n}\n\n// Return the integer values for hour, minutes, seconds and\n// nanoseconds that comprised a given fraction of a day.\n// values would round to 1 us.\nfunc fractionOfADay(fraction float64) (hours, minutes, seconds, nanoseconds int) {\n\n\tconst (\n\t\tc1us = 1e3\n\t\tc1s = 1e9\n\t\tc1day = 24 * 60 * 60 * c1s\n\t)\n\n\tfrac := int64(c1day*fraction + c1us/2)\n\tnanoseconds = int((frac%c1s)/c1us) * c1us\n\tfrac /= c1s\n\tseconds = int(frac % 60)\n\tfrac /= 60\n\tminutes = int(frac % 60)\n\thours = int(frac / 60)\n\treturn\n}\n\nfunc julianDateToGregorianTime(part1, part2 float64) time.Time {\n\tpart1I, part1F := math.Modf(part1)\n\tpart2I, part2F := math.Modf(part2)\n\tjulianDays := part1I + part2I\n\tjulianFraction := part1F + part2F\n\tjulianDays, julianFraction = shiftJulianToNoon(julianDays, julianFraction)\n\tday, month, year := doTheFliegelAndVanFlandernAlgorithm(int(julianDays))\n\thours, minutes, seconds, nanoseconds := fractionOfADay(julianFraction)\n\treturn time.Date(year, time.Month(month), day, hours, minutes, seconds, nanoseconds, time.UTC)\n}\n\n// By this point generations of programmers have repeated the\n// algorithm sent to the editor of \"Communications of the ACM\" in 1968\n// (published in CACM, volume 11, number 10, October 1968, p.657).\n// None of those programmers seems to have found it necessary to\n// explain the constants or variable names set out by Henry F. Fliegel\n// and Thomas C. Van Flandern. Maybe one day I'll buy that jounal and\n// expand an explanation here - that day is not today.\nfunc doTheFliegelAndVanFlandernAlgorithm(jd int) (day, month, year int) {\n\tl := jd + 68569\n\tn := (4 * l) / 146097\n\tl = l - (146097*n+3)/4\n\ti := (4000 * (l + 1)) / 1461001\n\tl = l - (1461*i)/4 + 31\n\tj := (80 * l) / 2447\n\td := l - (2447*j)/80\n\tl = j / 11\n\tm := j + 2 - (12 * l)\n\ty := 100*(n-49) + i + l\n\treturn d, m, y\n}\n\n// Convert an excelTime representation (stored as a floating point number) to a time.Time.\nfunc TimeFromExcelTime(excelTime float64, date1904 bool) time.Time {\n\tvar date time.Time\n\tvar intPart int64 = int64(excelTime)\n\t// Excel uses Julian dates prior to March 1st 1900, and\n\t// Gregorian thereafter.\n\tif intPart <= 61 {\n\t\tconst OFFSET1900 = 15018.0\n\t\tconst OFFSET1904 = 16480.0\n\t\tvar date time.Time\n\t\tif date1904 {\n\t\t\tdate = julianDateToGregorianTime(MJD_0, excelTime+OFFSET1904)\n\t\t} else {\n\t\t\tdate = julianDateToGregorianTime(MJD_0, excelTime+OFFSET1900)\n\t\t}\n\t\treturn date\n\t}\n\tvar floatPart float64 = excelTime - float64(intPart)\n\tvar dayNanoSeconds float64 = 24 * 60 * 60 * 1000 * 1000 * 1000\n\tif date1904 {\n\t\tdate = time.Date(1904, 1, 1, 0, 0, 0, 0, time.UTC)\n\t} else {\n\t\tdate = time.Date(1899, 12, 30, 0, 0, 0, 0, time.UTC)\n\t}\n\tdurationDays := time.Duration(intPart) * time.Hour * 24\n\tdurationPart := time.Duration(dayNanoSeconds * floatPart)\n\treturn date.Add(durationDays).Add(durationPart)\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/doc.go", "content": "// xslx is a package designed to help with reading data from\n// spreadsheets stored in the XLSX format used in recent versions of\n// Microsoft's Excel spreadsheet.\n//\n// Additionally, xlsx has started to grow some XLSX authoring\n// capabilities too.\n//\n// For a concise example of how to use this library why not check out\n// the source for xlsx2csv here: https://github.com/tealeg/xlsx2csv\n\npackage xlsx\n" }, { "path": "vendor/github.com/tealeg/xlsx/file.go", "content": "package xlsx\n\nimport (\n\t\"archive/zip\"\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\n// File is a high level structure providing a slice of Sheet structs\n// to the user.\ntype File struct {\n\tworksheets map[string]*zip.File\n\treferenceTable *RefTable\n\tDate1904 bool\n\tstyles *xlsxStyleSheet\n\tSheets []*Sheet\n\tSheet map[string]*Sheet\n\ttheme *theme\n\tDefinedNames []*xlsxDefinedName\n}\n\nconst NoRowLimit int = -1\n\n// Create a new File\nfunc NewFile() *File {\n\treturn &File{\n\t\tSheet: make(map[string]*Sheet),\n\t\tSheets: make([]*Sheet, 0),\n\t\tDefinedNames: make([]*xlsxDefinedName, 0),\n\t}\n}\n\n// OpenFile() take the name of an XLSX file and returns a populated\n// xlsx.File struct for it.\nfunc OpenFile(fileName string) (file *File, err error) {\n\treturn OpenFileWithRowLimit(fileName, NoRowLimit)\n}\n\n// OpenFileWithRowLimit() will open the file, but will only read the specified number of rows.\n// If you save this file, it will be truncated to the number of rows specified.\nfunc OpenFileWithRowLimit(fileName string, rowLimit int) (file *File, err error) {\n\tvar z *zip.ReadCloser\n\tz, err = zip.OpenReader(fileName)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn ReadZipWithRowLimit(z, rowLimit)\n}\n\n// OpenBinary() take bytes of an XLSX file and returns a populated\n// xlsx.File struct for it.\nfunc OpenBinary(bs []byte) (*File, error) {\n\treturn OpenBinaryWithRowLimit(bs, NoRowLimit)\n}\n\n// OpenBinaryWithRowLimit() take bytes of an XLSX file and returns a populated\n// xlsx.File struct for it.\nfunc OpenBinaryWithRowLimit(bs []byte, rowLimit int) (*File, error) {\n\tr := bytes.NewReader(bs)\n\treturn OpenReaderAtWithRowLimit(r, int64(r.Len()), rowLimit)\n}\n\n// OpenReaderAt() take io.ReaderAt of an XLSX file and returns a populated\n// xlsx.File struct for it.\nfunc OpenReaderAt(r io.ReaderAt, size int64) (*File, error) {\n\treturn OpenReaderAtWithRowLimit(r, size, NoRowLimit)\n}\n\n// OpenReaderAtWithRowLimit() take io.ReaderAt of an XLSX file and returns a populated\n// xlsx.File struct for it.\nfunc OpenReaderAtWithRowLimit(r io.ReaderAt, size int64, rowLimit int) (*File, error) {\n\tfile, err := zip.NewReader(r, size)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn ReadZipReaderWithRowLimit(file, rowLimit)\n}\n\n// A convenient wrapper around File.ToSlice, FileToSlice will\n// return the raw data contained in an Excel XLSX file as three\n// dimensional slice. The first index represents the sheet number,\n// the second the row number, and the third the cell number.\n//\n// For example:\n//\n// var mySlice [][][]string\n// var value string\n// mySlice = xlsx.FileToSlice(\"myXLSX.xlsx\")\n// value = mySlice[0][0][0]\n//\n// Here, value would be set to the raw value of the cell A1 in the\n// first sheet in the XLSX file.\nfunc FileToSlice(path string) ([][][]string, error) {\n\tf, err := OpenFile(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn f.ToSlice()\n}\n\n// FileToSliceUnmerged is a wrapper around File.ToSliceUnmerged.\n// It returns the raw data contained in an Excel XLSX file as three\n// dimensional slice. Merged cells will be unmerged. Covered cells become the\n// values of theirs origins.\nfunc FileToSliceUnmerged(path string) ([][][]string, error) {\n\tf, err := OpenFile(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn f.ToSliceUnmerged()\n}\n\n// Save the File to an xlsx file at the provided path.\nfunc (f *File) Save(path string) (err error) {\n\ttarget, err := os.Create(path)\n\tif err != nil {\n\t\treturn err\n\t}\n\terr = f.Write(target)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn target.Close()\n}\n\n// Write the File to io.Writer as xlsx\nfunc (f *File) Write(writer io.Writer) (err error) {\n\tparts, err := f.MarshallParts()\n\tif err != nil {\n\t\treturn\n\t}\n\tzipWriter := zip.NewWriter(writer)\n\tfor partName, part := range parts {\n\t\tw, err := zipWriter.Create(partName)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t_, err = w.Write([]byte(part))\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn zipWriter.Close()\n}\n\n// Add a new Sheet, with the provided name, to a File\nfunc (f *File) AddSheet(sheetName string) (*Sheet, error) {\n\tif _, exists := f.Sheet[sheetName]; exists {\n\t\treturn nil, fmt.Errorf(\"duplicate sheet name '%s'.\", sheetName)\n\t}\n\tif utf8.RuneCountInString(sheetName) >= 31 {\n\t\treturn nil, fmt.Errorf(\"sheet name must be less than 31 characters long. It is currently '%d' characters long\", utf8.RuneCountInString(sheetName))\n\t}\n\tsheet := &Sheet{\n\t\tName: sheetName,\n\t\tFile: f,\n\t\tSelected: len(f.Sheets) == 0,\n\t}\n\tf.Sheet[sheetName] = sheet\n\tf.Sheets = append(f.Sheets, sheet)\n\treturn sheet, nil\n}\n\n// Appends an existing Sheet, with the provided name, to a File\nfunc (f *File) AppendSheet(sheet Sheet, sheetName string) (*Sheet, error) {\n\tif _, exists := f.Sheet[sheetName]; exists {\n\t\treturn nil, fmt.Errorf(\"duplicate sheet name '%s'.\", sheetName)\n\t}\n\tsheet.Name = sheetName\n\tsheet.File = f\n\tsheet.Selected = len(f.Sheets) == 0\n\tf.Sheet[sheetName] = &sheet\n\tf.Sheets = append(f.Sheets, &sheet)\n\treturn &sheet, nil\n}\n\nfunc (f *File) makeWorkbook() xlsxWorkbook {\n\treturn xlsxWorkbook{\n\t\tFileVersion: xlsxFileVersion{AppName: \"Go XLSX\"},\n\t\tWorkbookPr: xlsxWorkbookPr{ShowObjects: \"all\"},\n\t\tBookViews: xlsxBookViews{\n\t\t\tWorkBookView: []xlsxWorkBookView{\n\t\t\t\t{\n\t\t\t\t\tShowHorizontalScroll: true,\n\t\t\t\t\tShowSheetTabs: true,\n\t\t\t\t\tShowVerticalScroll: true,\n\t\t\t\t\tTabRatio: 204,\n\t\t\t\t\tWindowHeight: 8192,\n\t\t\t\t\tWindowWidth: 16384,\n\t\t\t\t\tXWindow: \"0\",\n\t\t\t\t\tYWindow: \"0\",\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t\tSheets: xlsxSheets{Sheet: make([]xlsxSheet, len(f.Sheets))},\n\t\tCalcPr: xlsxCalcPr{\n\t\t\tIterateCount: 100,\n\t\t\tRefMode: \"A1\",\n\t\t\tIterate: false,\n\t\t\tIterateDelta: 0.001,\n\t\t},\n\t}\n}\n\n// Some tools that read XLSX files have very strict requirements about\n// the structure of the input XML. In particular both Numbers on the Mac\n// and SAS dislike inline XML namespace declarations, or namespace\n// prefixes that don't match the ones that Excel itself uses. This is a\n// problem because the Go XML library doesn't multiple namespace\n// declarations in a single element of a document. This function is a\n// horrible hack to fix that after the XML marshalling is completed.\nfunc replaceRelationshipsNameSpace(workbookMarshal string) string {\n\tnewWorkbook := strings.Replace(workbookMarshal, `xmlns:relationships=\"http://schemas.openxmlformats.org/officeDocument/2006/relationships\" relationships:id`, `r:id`, -1)\n\t// Dirty hack to fix issues #63 and #91; encoding/xml currently\n\t// \"doesn't allow for additional namespaces to be defined in the\n\t// root element of the document,\" as described by @tealeg in the\n\t// comments for #63.\n\toldXmlns := ``\n\tnewXmlns := ``\n\treturn strings.Replace(newWorkbook, oldXmlns, newXmlns, 1)\n}\n\n// Construct a map of file name to XML content representing the file\n// in terms of the structure of an XLSX file.\nfunc (f *File) MarshallParts() (map[string]string, error) {\n\tvar parts map[string]string\n\tvar refTable *RefTable = NewSharedStringRefTable()\n\trefTable.isWrite = true\n\tvar workbookRels WorkBookRels = make(WorkBookRels)\n\tvar err error\n\tvar workbook xlsxWorkbook\n\tvar types xlsxTypes = MakeDefaultContentTypes()\n\n\tmarshal := func(thing interface{}) (string, error) {\n\t\tbody, err := xml.Marshal(thing)\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\treturn xml.Header + string(body), nil\n\t}\n\n\tparts = make(map[string]string)\n\tworkbook = f.makeWorkbook()\n\tsheetIndex := 1\n\n\tif f.styles == nil {\n\t\tf.styles = newXlsxStyleSheet(f.theme)\n\t}\n\tf.styles.reset()\n\tif len(f.Sheets) == 0 {\n\t\terr := errors.New(\"Workbook must contains atleast one worksheet\")\n\t\treturn nil, err\n\t}\n\tfor _, sheet := range f.Sheets {\n\t\txSheet := sheet.makeXLSXSheet(refTable, f.styles)\n\t\trId := fmt.Sprintf(\"rId%d\", sheetIndex)\n\t\tsheetId := strconv.Itoa(sheetIndex)\n\t\tsheetPath := fmt.Sprintf(\"worksheets/sheet%d.xml\", sheetIndex)\n\t\tpartName := \"xl/\" + sheetPath\n\t\ttypes.Overrides = append(\n\t\t\ttypes.Overrides,\n\t\t\txlsxOverride{\n\t\t\t\tPartName: \"/\" + partName,\n\t\t\t\tContentType: \"application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml\"})\n\t\tworkbookRels[rId] = sheetPath\n\t\tworkbook.Sheets.Sheet[sheetIndex-1] = xlsxSheet{\n\t\t\tName: sheet.Name,\n\t\t\tSheetId: sheetId,\n\t\t\tId: rId,\n\t\t\tState: \"visible\"}\n\t\tparts[partName], err = marshal(xSheet)\n\t\tif err != nil {\n\t\t\treturn parts, err\n\t\t}\n\t\tsheetIndex++\n\t}\n\n\tworkbookMarshal, err := marshal(workbook)\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\tworkbookMarshal = replaceRelationshipsNameSpace(workbookMarshal)\n\tparts[\"xl/workbook.xml\"] = workbookMarshal\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\n\tparts[\"_rels/.rels\"] = TEMPLATE__RELS_DOT_RELS\n\tparts[\"docProps/app.xml\"] = TEMPLATE_DOCPROPS_APP\n\t// TODO - do this properly, modification and revision information\n\tparts[\"docProps/core.xml\"] = TEMPLATE_DOCPROPS_CORE\n\tparts[\"xl/theme/theme1.xml\"] = TEMPLATE_XL_THEME_THEME\n\n\txSST := refTable.makeXLSXSST()\n\tparts[\"xl/sharedStrings.xml\"], err = marshal(xSST)\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\n\txWRel := workbookRels.MakeXLSXWorkbookRels()\n\n\tparts[\"xl/_rels/workbook.xml.rels\"], err = marshal(xWRel)\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\n\tparts[\"[Content_Types].xml\"], err = marshal(types)\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\n\tparts[\"xl/styles.xml\"], err = f.styles.Marshal()\n\tif err != nil {\n\t\treturn parts, err\n\t}\n\n\treturn parts, nil\n}\n\n// Return the raw data contained in the File as three\n// dimensional slice. The first index represents the sheet number,\n// the second the row number, and the third the cell number.\n//\n// For example:\n//\n// var mySlice [][][]string\n// var value string\n// mySlice = xlsx.FileToSlice(\"myXLSX.xlsx\")\n// value = mySlice[0][0][0]\n//\n// Here, value would be set to the raw value of the cell A1 in the\n// first sheet in the XLSX file.\nfunc (f *File) ToSlice() (output [][][]string, err error) {\n\toutput = [][][]string{}\n\tfor _, sheet := range f.Sheets {\n\t\ts := [][]string{}\n\t\tfor _, row := range sheet.Rows {\n\t\t\tif row == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tr := []string{}\n\t\t\tfor _, cell := range row.Cells {\n\t\t\t\tstr, err := cell.FormattedValue()\n\t\t\t\tif err != nil {\n\t\t\t\t\t// Recover from strconv.NumError if the value is an empty string,\n\t\t\t\t\t// and insert an empty string in the output.\n\t\t\t\t\tif numErr, ok := err.(*strconv.NumError); ok && numErr.Num == \"\" {\n\t\t\t\t\t\tstr = \"\"\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn output, err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tr = append(r, str)\n\t\t\t}\n\t\t\ts = append(s, r)\n\t\t}\n\t\toutput = append(output, s)\n\t}\n\treturn output, nil\n}\n\n// ToSliceUnmerged returns the raw data contained in the File as three\n// dimensional slice (s. method ToSlice).\n// A covered cell become the value of its origin cell.\n// Example: table where A1:A2 merged.\n// | 01.01.2011 | Bread | 20 |\n// | | Fish | 70 |\n// This sheet will be converted to the slice:\n// [ [01.01.2011 Bread 20]\n// \t\t[01.01.2011 Fish 70] ]\nfunc (f *File) ToSliceUnmerged() (output [][][]string, err error) {\n\toutput, err = f.ToSlice()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor s, sheet := range f.Sheets {\n\t\tfor r, row := range sheet.Rows {\n\t\t\tfor c, cell := range row.Cells {\n\t\t\t\tif cell.HMerge > 0 {\n\t\t\t\t\tfor i := c + 1; i <= c+cell.HMerge; i++ {\n\t\t\t\t\t\toutput[s][r][i] = output[s][r][c]\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif cell.VMerge > 0 {\n\t\t\t\t\tfor i := r + 1; i <= r+cell.VMerge; i++ {\n\t\t\t\t\t\toutput[s][i][c] = output[s][r][c]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn output, nil\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/format_code.go", "content": "package xlsx\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"math\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Do not edit these attributes once this struct is created. This struct should only be created by\n// parseFullNumberFormatString() from a number format string. If the format for a cell needs to change, change\n// the number format string and getNumberFormat() will invalidate the old struct and re-parse the string.\ntype parsedNumberFormat struct {\n\tnumFmt string\n\tisTimeFormat bool\n\tnegativeFormatExpectsPositive bool\n\tpositiveFormat *formatOptions\n\tnegativeFormat *formatOptions\n\tzeroFormat *formatOptions\n\ttextFormat *formatOptions\n\tparseEncounteredError *error\n}\n\ntype formatOptions struct {\n\tisTimeFormat bool\n\tshowPercent bool\n\tfullFormatString string\n\treducedFormatString string\n\tprefix string\n\tsuffix string\n}\n\n// FormatValue returns a value, and possibly an error condition\n// from a Cell. If it is possible to apply a format to the cell\n// value, it will do so, if not then an error will be returned, along\n// with the raw value of the Cell.\n//\n// This is the documentation of the \"General\" Format in the Office Open XML spec:\n//\n// Numbers\n// The application shall attempt to display the full number up to 11 digits (inc. decimal point). If the number is too\n// large*, the application shall attempt to show exponential format. If the number has too many significant digits, the\n// display shall be truncated. The optimal method of display is based on the available cell width. If the number cannot\n// be displayed using any of these formats in the available width, the application shall show \"#\" across the width of\n// the cell.\n//\n// Conditions for switching to exponential format:\n// 1. The cell value shall have at least five digits for xE-xx\n// 2. If the exponent is bigger than the size allowed, a floating point number cannot fit, so try exponential notation.\n// 3. Similarly, for negative exponents, check if there is space for even one (non-zero) digit in floating point format**.\n// 4. Finally, if there isn't room for all of the significant digits in floating point format (for a negative exponent),\n// exponential format shall display more digits if the exponent is less than -3. (The 3 is because E-xx takes 4\n// characters, and the leading 0 in floating point takes only 1 character. Thus, for an exponent less than -3, there is\n// more than 3 additional leading 0's, more than enough to compensate for the size of the E-xx.)\n//\n// Floating point rule:\n// For general formatting in cells, max overall length for cell display is 11, not including negative sign, but includes\n// leading zeros and decimal separator.***\n//\n// Added Notes:\n// * \"If the number is too large\" can also mean \"if the number has more than 11 digits\", so greater than or equal to\n// 1e11 and less than 1e-9.\n// ** Means that you should switch to scientific if there would be 9 zeros after the decimal (the decimal and first zero\n// count against the 11 character limit), so less than 1e9.\n// *** The way this is written, you can get numbers that are more than 11 characters because the golang Float fmt\n// does not support adjusting the precision while not padding with zeros, while also not switching to scientific\n// notation too early.\nfunc (fullFormat *parsedNumberFormat) FormatValue(cell *Cell) (string, error) {\n\tswitch cell.cellType {\n\tcase CellTypeError:\n\t\t// The error type is what XLSX uses in error cases such as when formulas are invalid.\n\t\t// There will be text in the cell's value that can be shown, something ugly like #NAME? or #######\n\t\treturn cell.Value, nil\n\tcase CellTypeBool:\n\t\tif cell.Value == \"0\" {\n\t\t\treturn \"FALSE\", nil\n\t\t} else if cell.Value == \"1\" {\n\t\t\treturn \"TRUE\", nil\n\t\t} else {\n\t\t\treturn cell.Value, errors.New(\"invalid value in bool cell\")\n\t\t}\n\tcase CellTypeString:\n\t\tfallthrough\n\tcase CellTypeInline:\n\t\tfallthrough\n\tcase CellTypeStringFormula:\n\t\ttextFormat := cell.parsedNumFmt.textFormat\n\t\t// This switch statement is only for String formats\n\t\tswitch textFormat.reducedFormatString {\n\t\tcase builtInNumFmt[builtInNumFmtIndex_GENERAL]: // General is literally \"general\"\n\t\t\treturn cell.Value, nil\n\t\tcase builtInNumFmt[builtInNumFmtIndex_STRING]: // String is \"@\"\n\t\t\treturn textFormat.prefix + cell.Value + textFormat.suffix, nil\n\t\tcase \"\":\n\t\t\t// If cell is not \"General\" and there is not an \"@\" symbol in the format, then the cell's value is not\n\t\t\t// used when determining what to display. It would be completely legal to have a format of \"Error\"\n\t\t\t// for strings, and all values that are not numbers would show up as \"Error\". In that case, this code would\n\t\t\t// have a prefix of \"Error\" and a reduced format string of \"\" (empty string).\n\t\t\treturn textFormat.prefix + textFormat.suffix, nil\n\t\tdefault:\n\t\t\treturn cell.Value, errors.New(\"invalid or unsupported format, unsupported string format\")\n\t\t}\n\tcase CellTypeDate:\n\t\t// These are dates that are stored in date format instead of being stored as numbers with a format to turn them\n\t\t// into a date string.\n\t\treturn cell.Value, nil\n\tcase CellTypeNumeric:\n\t\treturn fullFormat.formatNumericCell(cell)\n\tdefault:\n\t\treturn cell.Value, errors.New(\"unknown cell type\")\n\t}\n}\n\nfunc (fullFormat *parsedNumberFormat) formatNumericCell(cell *Cell) (string, error) {\n\trawValue := strings.TrimSpace(cell.Value)\n\t// If there wasn't a value in the cell, it shouldn't have been marked as Numeric.\n\t// It's better to support this case though.\n\tif rawValue == \"\" {\n\t\treturn \"\", nil\n\t}\n\n\tif fullFormat.isTimeFormat {\n\t\treturn fullFormat.parseTime(rawValue, cell.date1904)\n\t}\n\tvar numberFormat *formatOptions\n\tfloatVal, floatErr := strconv.ParseFloat(rawValue, 64)\n\tif floatErr != nil {\n\t\treturn rawValue, floatErr\n\t}\n\t// Choose the correct format. There can be different formats for positive, negative, and zero numbers.\n\t// Excel only uses the zero format if the value is literally zero, even if the number is so small that it shows\n\t// up as \"0\" when the positive format is used.\n\tif floatVal > 0 {\n\t\tnumberFormat = fullFormat.positiveFormat\n\t} else if floatVal < 0 {\n\t\t// If format string specified a different format for negative numbers, then the number should be made positive\n\t\t// before getting formatted. The format string itself will contain formatting that denotes a negative number and\n\t\t// this formatting will end up in the prefix or suffix. Commonly if there is a negative format specified, the\n\t\t// number will get surrounded by parenthesis instead of showing it with a minus sign.\n\t\tif fullFormat.negativeFormatExpectsPositive {\n\t\t\tfloatVal = math.Abs(floatVal)\n\t\t}\n\t\tnumberFormat = fullFormat.negativeFormat\n\t} else {\n\t\tnumberFormat = fullFormat.zeroFormat\n\t}\n\n\t// When showPercent is true, multiply the number by 100.\n\t// The percent sign will be in the prefix or suffix already, so it does not need to be added in this function.\n\t// The number format itself will be the same as any other number format once the value is multiplied by 100.\n\tif numberFormat.showPercent {\n\t\tfloatVal = 100 * floatVal\n\t}\n\n\t// Only the most common format strings are supported here.\n\t// Eventually this switch needs to be replaced with a more general solution.\n\t// Some of these \"supported\" formats should have thousand separators, but don't get them since Go fmt\n\t// doesn't have a way to request thousands separators.\n\t// The only things that should be supported here are in the array formattingCharacters,\n\t// everything else has been stripped out before and will be placed in the prefix or suffix.\n\t// The formatting characters can have non-formatting characters mixed in with them and those should be maintained.\n\t// However, at this time we fail to parse those formatting codes and they get replaced with \"General\"\n\tvar formattedNum string\n\tswitch numberFormat.reducedFormatString {\n\tcase builtInNumFmt[builtInNumFmtIndex_GENERAL]: // General is literally \"general\"\n\t\t// prefix, showPercent, and suffix cannot apply to the general format\n\t\t// The logic for showing numbers when the format is \"general\" is much more complicated than the rest of these.\n\t\tgeneralFormatted, err := generalNumericScientific(cell.Value, true)\n\t\tif err != nil {\n\t\t\treturn rawValue, nil\n\t\t}\n\t\treturn generalFormatted, nil\n\tcase builtInNumFmt[builtInNumFmtIndex_STRING]: // String is \"@\"\n\t\tformattedNum = cell.Value\n\tcase builtInNumFmt[builtInNumFmtIndex_INT], \"#,##0\": // Int is \"0\"\n\t\t// Previously this case would cast to int and print with %d, but that will not round the value correctly.\n\t\tformattedNum = fmt.Sprintf(\"%.0f\", floatVal)\n\tcase \"0.0\", \"#,##0.0\":\n\t\tformattedNum = fmt.Sprintf(\"%.1f\", floatVal)\n\tcase builtInNumFmt[builtInNumFmtIndex_FLOAT], \"#,##0.00\": // Float is \"0.00\"\n\t\tformattedNum = fmt.Sprintf(\"%.2f\", floatVal)\n\tcase \"0.000\", \"#,##0.000\":\n\t\tformattedNum = fmt.Sprintf(\"%.3f\", floatVal)\n\tcase \"0.0000\", \"#,##0.0000\":\n\t\tformattedNum = fmt.Sprintf(\"%.4f\", floatVal)\n\tcase \"0.00e+00\", \"##0.0e+0\":\n\t\tformattedNum = fmt.Sprintf(\"%e\", floatVal)\n\tcase \"\":\n\t\t// Do nothing.\n\tdefault:\n\t\treturn rawValue, nil\n\t}\n\treturn numberFormat.prefix + formattedNum + numberFormat.suffix, nil\n}\n\nfunc generalNumericScientific(value string, allowScientific bool) (string, error) {\n\tif strings.TrimSpace(value) == \"\" {\n\t\treturn \"\", nil\n\t}\n\tf, err := strconv.ParseFloat(value, 64)\n\tif err != nil {\n\t\treturn value, err\n\t}\n\tif allowScientific {\n\t\tabsF := math.Abs(f)\n\t\t// When using General format, numbers that are less than 1e-9 (0.000000001) and greater than or equal to\n\t\t// 1e11 (100,000,000,000) should be shown in scientific notation.\n\t\t// Numbers less than the number after zero, are assumed to be zero.\n\t\tif (absF >= math.SmallestNonzeroFloat64 && absF < minNonScientificNumber) || absF >= maxNonScientificNumber {\n\t\t\treturn strconv.FormatFloat(f, 'E', -1, 64), nil\n\t\t}\n\t}\n\t// This format (fmt=\"f\", prec=-1) will prevent padding with zeros and will never switch to scientific notation.\n\t// However, it will show more than 11 characters for very precise numbers, and this cannot be changed.\n\t// You could also use fmt=\"g\", prec=11, which doesn't pad with zeros and allows the correct precision,\n\t// but it will use scientific notation on numbers less than 1e-4. That value is hardcoded in Go and cannot be\n\t// configured or disabled.\n\treturn strconv.FormatFloat(f, 'f', -1, 64), nil\n}\n\n// Format strings are a little strange to compare because empty string needs to be taken as general, and general needs\n// to be compared case insensitively.\nfunc compareFormatString(fmt1, fmt2 string) bool {\n\tif fmt1 == fmt2 {\n\t\treturn true\n\t}\n\tif fmt1 == \"\" || strings.EqualFold(fmt1, \"general\") {\n\t\tfmt1 = \"general\"\n\t}\n\tif fmt2 == \"\" || strings.EqualFold(fmt2, \"general\") {\n\t\tfmt2 = \"general\"\n\t}\n\treturn fmt1 == fmt2\n}\n\nfunc parseFullNumberFormatString(numFmt string) *parsedNumberFormat {\n\tparsedNumFmt := &parsedNumberFormat{\n\t\tnumFmt: numFmt,\n\t}\n\tif isTimeFormat(numFmt) {\n\t\t// Time formats cannot have multiple groups separated by semicolons, there is only one format.\n\t\t// Strings are unaffected by the time format.\n\t\tparsedNumFmt.isTimeFormat = true\n\t\tparsedNumFmt.textFormat, _ = parseNumberFormatSection(\"general\")\n\t\treturn parsedNumFmt\n\t}\n\n\tvar fmtOptions []*formatOptions\n\tformats, err := splitFormatOnSemicolon(numFmt)\n\tif err == nil {\n\t\tfor _, formatSection := range formats {\n\t\t\tparsedFormat, err := parseNumberFormatSection(formatSection)\n\t\t\tif err != nil {\n\t\t\t\t// If an invalid number section is found, fall back to general\n\t\t\t\tparsedFormat = fallbackErrorFormat\n\t\t\t\tparsedNumFmt.parseEncounteredError = &err\n\t\t\t}\n\t\t\tfmtOptions = append(fmtOptions, parsedFormat)\n\t\t}\n\t} else {\n\t\tfmtOptions = append(fmtOptions, fallbackErrorFormat)\n\t\tparsedNumFmt.parseEncounteredError = &err\n\t}\n\tif len(fmtOptions) > 4 {\n\t\tfmtOptions = []*formatOptions{fallbackErrorFormat}\n\t\terr = errors.New(\"invalid number format, too many format sections\")\n\t\tparsedNumFmt.parseEncounteredError = &err\n\t}\n\n\tif len(fmtOptions) == 1 {\n\t\t// If there is only one option, it is used for all\n\t\tparsedNumFmt.positiveFormat = fmtOptions[0]\n\t\tparsedNumFmt.negativeFormat = fmtOptions[0]\n\t\tparsedNumFmt.zeroFormat = fmtOptions[0]\n\t\tif strings.Contains(fmtOptions[0].fullFormatString, \"@\") {\n\t\t\tparsedNumFmt.textFormat = fmtOptions[0]\n\t\t} else {\n\t\t\tparsedNumFmt.textFormat, _ = parseNumberFormatSection(\"general\")\n\t\t}\n\t} else if len(fmtOptions) == 2 {\n\t\t// If there are two formats, the first is used for positive and zeros, the second gets used as a negative format,\n\t\t// and strings are not formatted.\n\t\t// When negative numbers now have their own format, they should become positive before having the format applied.\n\t\t// The format will contain a negative sign if it is desired, but they may be colored red or wrapped in\n\t\t// parenthesis instead.\n\t\tparsedNumFmt.negativeFormatExpectsPositive = true\n\t\tparsedNumFmt.positiveFormat = fmtOptions[0]\n\t\tparsedNumFmt.negativeFormat = fmtOptions[1]\n\t\tparsedNumFmt.zeroFormat = fmtOptions[0]\n\t\tparsedNumFmt.textFormat, _ = parseNumberFormatSection(\"general\")\n\t} else if len(fmtOptions) == 3 {\n\t\t// If there are three formats, the first is used for positive, the second gets used as a negative format,\n\t\t// the third is for negative, and strings are not formatted.\n\t\tparsedNumFmt.negativeFormatExpectsPositive = true\n\t\tparsedNumFmt.positiveFormat = fmtOptions[0]\n\t\tparsedNumFmt.negativeFormat = fmtOptions[1]\n\t\tparsedNumFmt.zeroFormat = fmtOptions[2]\n\t\tparsedNumFmt.textFormat, _ = parseNumberFormatSection(\"general\")\n\t} else {\n\t\t// With four options, the first is positive, the second is negative, the third is zero, and the fourth is strings\n\t\t// Negative numbers should be still become positive before having the negative formatting applied.\n\t\tparsedNumFmt.negativeFormatExpectsPositive = true\n\t\tparsedNumFmt.positiveFormat = fmtOptions[0]\n\t\tparsedNumFmt.negativeFormat = fmtOptions[1]\n\t\tparsedNumFmt.zeroFormat = fmtOptions[2]\n\t\tparsedNumFmt.textFormat = fmtOptions[3]\n\t}\n\treturn parsedNumFmt\n}\n\n// splitFormatOnSemicolon will split the format string into the format sections\n// This logic to split the different formats on semicolon is fully correct, and will skip all literal semicolons,\n// and will catch all breaking semicolons.\nfunc splitFormatOnSemicolon(format string) ([]string, error) {\n\tvar formats []string\n\tprevIndex := 0\n\tfor i := 0; i < len(format); i++ {\n\t\tif format[i] == ';' {\n\t\t\tformats = append(formats, format[prevIndex:i])\n\t\t\tprevIndex = i + 1\n\t\t} else if format[i] == '\\\\' {\n\t\t\ti++\n\t\t} else if format[i] == '\"' {\n\t\t\tendQuoteIndex := strings.Index(format[i+1:], \"\\\"\")\n\t\t\tif endQuoteIndex == -1 {\n\t\t\t\t// This is an invalid format string, fall back to general\n\t\t\t\treturn nil, errors.New(\"invalid format string, unmatched double quote\")\n\t\t\t}\n\t\t\ti += endQuoteIndex + 1\n\t\t}\n\t}\n\treturn append(formats, format[prevIndex:]), nil\n}\n\nvar fallbackErrorFormat = &formatOptions{\n\tfullFormatString: \"general\",\n\treducedFormatString: \"general\",\n}\n\n// parseNumberFormatSection takes in individual format and parses out most of the options.\n// Some options are parsed, removed from the string, and set as settings on formatOptions.\n// There remainder of the format string is put in the reducedFormatString attribute, and supported values for these\n// are handled in a switch in the Cell.FormattedValue() function.\n// Ideally more and more of the format string would be parsed out here into settings until there is no remainder string\n// at all.\n// Features that this supports:\n// - Time formats are detected, and marked in the options. Time format strings are handled when doing the formatting.\n// The logic to detect time formats is currently not correct, and can catch formats that are not time formats as well\n// as miss formats that are time formats.\n// - Color formats are detected and removed.\n// - Currency annotations are handled properly.\n// - Literal strings wrapped in quotes are handled and put into prefix or suffix.\n// - Numbers that should be percent are detected and marked in the options.\n// - Conditionals are detected and removed, but they are not obeyed. The conditional groups will be used just like the\n// positive;negative;zero;string format groups. Here is an example of a conditional format: \"[Red][<=100];[Blue][>100]\"\n// Decoding the actual number formatting portion is out of scope, that is placed into reducedFormatString and is used\n// when formatting the string. The string there will be reduced to only the things in the formattingCharacters array.\n// Everything not in that array has been parsed out and put into formatOptions.\nfunc parseNumberFormatSection(fullFormat string) (*formatOptions, error) {\n\treducedFormat := strings.TrimSpace(fullFormat)\n\n\t// general is the only format that does not use the normal format symbols notations\n\tif compareFormatString(reducedFormat, \"general\") {\n\t\treturn &formatOptions{\n\t\t\tfullFormatString: \"general\",\n\t\t\treducedFormatString: \"general\",\n\t\t}, nil\n\t}\n\n\tprefix, reducedFormat, showPercent1, err := parseLiterals(reducedFormat)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treducedFormat, suffixFormat := splitFormatAndSuffixFormat(reducedFormat)\n\n\tsuffix, remaining, showPercent2, err := parseLiterals(suffixFormat)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(remaining) > 0 {\n\t\t// This paradigm of codes consisting of literals, number formats, then more literals is not always correct, they can\n\t\t// actually be intertwined. Though 99% of the time number formats will not do this.\n\t\t// Excel uses this format string for Social Security Numbers: 000\\-00\\-0000\n\t\t// and this for US phone numbers: [<=9999999]###\\-####;\\(###\\)\\ ###\\-####\n\t\treturn nil, errors.New(\"invalid or unsupported format string\")\n\t}\n\n\treturn &formatOptions{\n\t\tfullFormatString: fullFormat,\n\t\tisTimeFormat: false,\n\t\treducedFormatString: reducedFormat,\n\t\tprefix: prefix,\n\t\tsuffix: suffix,\n\t\tshowPercent: showPercent1 || showPercent2,\n\t}, nil\n}\n\n// formattingCharacters will be left in the reducedNumberFormat\n// It is important that these be looked for in order so that the slash cases are handled correctly.\n// / (slash) is a fraction format if preceded by 0, #, or ?, otherwise it is not a formatting character\n// E- E+ e- e+ are scientific notation, but E, e, -, + are not formatting characters independently\n// \\ (back slash) makes the next character a literal (not formatting)\n// \" Anything in double quotes is not a formatting character\n// _ (underscore) skips the width of the next character, so the next character cannot be formatting\nvar formattingCharacters = []string{\"0/\", \"#/\", \"?/\", \"E-\", \"E+\", \"e-\", \"e+\", \"0\", \"#\", \"?\", \".\", \",\", \"@\", \"*\"}\n\n// The following are also time format characters, but since this is only used for detecting, not decoding, they are\n// redundant here: ee, gg, ggg, rr, ss, mm, hh, yyyy, dd, ddd, dddd, mm, mmm, mmmm, mmmmm, ss.0000, ss.000, ss.00, ss.0\n// The .00 type format is very tricky, because it only counts if it comes after ss or s or [ss] or [s]\n// .00 is actually a valid number format by itself.\nvar timeFormatCharacters = []string{\"m\", \"d\", \"yy\", \"h\", \"m\", \"AM/PM\", \"A/P\", \"am/pm\", \"a/p\", \"r\", \"g\", \"e\", \"b1\", \"b2\", \"[hh]\", \"[h]\", \"[mm]\", \"[m]\",\n\t\"s.0000\", \"s.000\", \"s.00\", \"s.0\", \"s\", \"[ss].0000\", \"[ss].000\", \"[ss].00\", \"[ss].0\", \"[ss]\", \"[s].0000\", \"[s].000\", \"[s].00\", \"[s].0\", \"[s]\"}\n\nfunc splitFormatAndSuffixFormat(format string) (string, string) {\n\tvar i int\n\tfor ; i < len(format); i++ {\n\t\tcurReducedFormat := format[i:]\n\t\tvar found bool\n\t\tfor _, special := range formattingCharacters {\n\t\t\tif strings.HasPrefix(curReducedFormat, special) {\n\t\t\t\t// Skip ahead if the special character was longer than length 1\n\t\t\t\ti += len(special) - 1\n\t\t\t\tfound = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif !found {\n\t\t\tbreak\n\t\t}\n\t}\n\tsuffixFormat := format[i:]\n\tformat = format[:i]\n\treturn format, suffixFormat\n}\n\nfunc parseLiterals(format string) (string, string, bool, error) {\n\tvar prefix string\n\tshowPercent := false\n\tfor i := 0; i < len(format); i++ {\n\t\tcurReducedFormat := format[i:]\n\t\tswitch curReducedFormat[0] {\n\t\tcase '\\\\':\n\t\t\t// If there is a slash, skip the next character, and add it to the prefix\n\t\t\tif len(curReducedFormat) > 1 {\n\t\t\t\ti++\n\t\t\t\tprefix += curReducedFormat[1:2]\n\t\t\t}\n\t\tcase '_':\n\t\t\t// If there is an underscore, skip the next character, but don't add it to the prefix\n\t\t\tif len(curReducedFormat) > 1 {\n\t\t\t\ti++\n\t\t\t}\n\t\tcase '*':\n\t\t\t// Asterisks are used to repeat the next character to fill the full cell width.\n\t\t\t// There isn't really a cell size in this context, so this will be ignored.\n\t\tcase '\"':\n\t\t\t// If there is a quote skip to the next quote, and add the quoted characters to the prefix\n\t\t\tendQuoteIndex := strings.Index(curReducedFormat[1:], \"\\\"\")\n\t\t\tif endQuoteIndex == -1 {\n\t\t\t\treturn \"\", \"\", false, errors.New(\"invalid formatting code, unmatched double quote\")\n\t\t\t}\n\t\t\tprefix = prefix + curReducedFormat[1:endQuoteIndex+1]\n\t\t\ti += endQuoteIndex + 1\n\t\tcase '%':\n\t\t\tshowPercent = true\n\t\t\tprefix += \"%\"\n\t\tcase '[':\n\t\t\t// Brackets can be currency annotations (e.g. [$$-409])\n\t\t\t// color formats (e.g. [color1] through [color56], as well as [red] etc.)\n\t\t\t// conditionals (e.g. [>100], the valid conditionals are =, >, <, >=, <=, <>)\n\t\t\tbracketIndex := strings.Index(curReducedFormat, \"]\")\n\t\t\tif bracketIndex == -1 {\n\t\t\t\treturn \"\", \"\", false, errors.New(\"invalid formatting code, invalid brackets\")\n\t\t\t}\n\t\t\t// Currencies in Excel are annotated with this format: [$-]\n\t\t\t// Currency String is something like $, ¥, €, or £\n\t\t\t// Language Info is three hexadecimal characters\n\t\t\tif len(curReducedFormat) > 2 && curReducedFormat[1] == '$' {\n\t\t\t\tdashIndex := strings.Index(curReducedFormat, \"-\")\n\t\t\t\tif dashIndex != -1 && dashIndex < bracketIndex {\n\t\t\t\t\t// Get the currency symbol, and skip to the end of the currency format\n\t\t\t\t\tprefix += curReducedFormat[2:dashIndex]\n\t\t\t\t} else {\n\t\t\t\t\treturn \"\", \"\", false, errors.New(\"invalid formatting code, invalid currency annotation\")\n\t\t\t\t}\n\t\t\t}\n\t\t\ti += bracketIndex\n\t\tcase '$', '-', '+', '/', '(', ')', ':', '!', '^', '&', '\\'', '~', '{', '}', '<', '>', '=', ' ':\n\t\t\t// These symbols are allowed to be used as literal without escaping\n\t\t\tprefix += curReducedFormat[0:1]\n\t\tdefault:\n\t\t\tfor _, special := range formattingCharacters {\n\t\t\t\tif strings.HasPrefix(curReducedFormat, special) {\n\t\t\t\t\t// This means we found the start of the actual number formatting portion, and should return.\n\t\t\t\t\treturn prefix, format[i:], showPercent, nil\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Symbols that don't have meaning and aren't in the exempt literal characters and are not escaped.\n\t\t\treturn \"\", \"\", false, errors.New(\"invalid formatting code: unsupported or unescaped characters\")\n\t\t}\n\t}\n\treturn prefix, \"\", showPercent, nil\n}\n\n// parseTime returns a string parsed using time.Time\nfunc (fullFormat *parsedNumberFormat) parseTime(value string, date1904 bool) (string, error) {\n\tf, err := strconv.ParseFloat(value, 64)\n\tif err != nil {\n\t\treturn value, err\n\t}\n\tval := TimeFromExcelTime(f, date1904)\n\tformat := fullFormat.numFmt\n\t// Replace Excel placeholders with Go time placeholders.\n\t// For example, replace yyyy with 2006. These are in a specific order,\n\t// due to the fact that m is used in month, minute, and am/pm. It would\n\t// be easier to fix that with regular expressions, but if it's possible\n\t// to keep this simple it would be easier to maintain.\n\t// Full-length month and days (e.g. March, Tuesday) have letters in them that would be replaced\n\t// by other characters below (such as the 'h' in March, or the 'd' in Tuesday) below.\n\t// First we convert them to arbitrary characters unused in Excel Date formats, and then at the end,\n\t// turn them to what they should actually be.\n\t// Based off: http://www.ozgrid.com/Excel/CustomFormats.htm\n\treplacements := []struct{ xltime, gotime string }{\n\t\t{\"yyyy\", \"2006\"},\n\t\t{\"yy\", \"06\"},\n\t\t{\"mmmm\", \"%%%%\"},\n\t\t{\"dddd\", \"&&&&\"},\n\t\t{\"dd\", \"02\"},\n\t\t{\"d\", \"2\"},\n\t\t{\"mmm\", \"Jan\"},\n\t\t{\"mmss\", \"0405\"},\n\t\t{\"ss\", \"05\"},\n\t\t{\"mm:\", \"04:\"},\n\t\t{\":mm\", \":04\"},\n\t\t{\"mm\", \"01\"},\n\t\t{\"am/pm\", \"pm\"},\n\t\t{\"m/\", \"1/\"},\n\t\t{\"%%%%\", \"January\"},\n\t\t{\"&&&&\", \"Monday\"},\n\t}\n\t// It is the presence of the \"am/pm\" indicator that determins\n\t// if this is a 12 hour or 24 hours time format, not the\n\t// number of 'h' characters.\n\tif is12HourTime(format) {\n\t\tformat = strings.Replace(format, \"hh\", \"03\", 1)\n\t\tformat = strings.Replace(format, \"h\", \"3\", 1)\n\t} else {\n\t\tformat = strings.Replace(format, \"hh\", \"15\", 1)\n\t\tformat = strings.Replace(format, \"h\", \"15\", 1)\n\t}\n\tfor _, repl := range replacements {\n\t\tformat = strings.Replace(format, repl.xltime, repl.gotime, 1)\n\t}\n\t// If the hour is optional, strip it out, along with the\n\t// possible dangling colon that would remain.\n\tif val.Hour() < 1 {\n\t\tformat = strings.Replace(format, \"]:\", \"]\", 1)\n\t\tformat = strings.Replace(format, \"[03]\", \"\", 1)\n\t\tformat = strings.Replace(format, \"[3]\", \"\", 1)\n\t\tformat = strings.Replace(format, \"[15]\", \"\", 1)\n\t} else {\n\t\tformat = strings.Replace(format, \"[3]\", \"3\", 1)\n\t\tformat = strings.Replace(format, \"[15]\", \"15\", 1)\n\t}\n\treturn val.Format(format), nil\n}\n\n// isTimeFormat checks whether an Excel format string represents a time.Time.\n// This function is now correct, but it can detect time format strings that cannot be correctly handled by parseTime()\nfunc isTimeFormat(format string) bool {\n\tvar foundTimeFormatCharacters bool\n\tfor i := 0; i < len(format); i++ {\n\t\tcurReducedFormat := format[i:]\n\t\tswitch curReducedFormat[0] {\n\t\tcase '\\\\', '_':\n\t\t\t// If there is a slash, skip the next character, and add it to the prefix\n\t\t\t// If there is an underscore, skip the next character, but don't add it to the prefix\n\t\t\tif len(curReducedFormat) > 1 {\n\t\t\t\ti++\n\t\t\t}\n\t\tcase '*':\n\t\t\t// Asterisks are used to repeat the next character to fill the full cell width.\n\t\t\t// There isn't really a cell size in this context, so this will be ignored.\n\t\tcase '\"':\n\t\t\t// If there is a quote skip to the next quote, and add the quoted characters to the prefix\n\t\t\tendQuoteIndex := strings.Index(curReducedFormat[1:], \"\\\"\")\n\t\t\tif endQuoteIndex == -1 {\n\t\t\t\t// This is not any type of valid format.\n\t\t\t\treturn false\n\t\t\t}\n\t\t\ti += endQuoteIndex + 1\n\t\tcase '$', '-', '+', '/', '(', ')', ':', '!', '^', '&', '\\'', '~', '{', '}', '<', '>', '=', ' ':\n\t\t\t// These symbols are allowed to be used as literal without escaping\n\t\tcase ',':\n\t\t\t// This is not documented in the XLSX spec as far as I can tell, but Excel and Numbers will include\n\t\t\t// commas in number formats without escaping them, so this should be supported.\n\t\tdefault:\n\t\t\tfoundInThisLoop := false\n\t\t\tfor _, special := range timeFormatCharacters {\n\t\t\t\tif strings.HasPrefix(curReducedFormat, special) {\n\t\t\t\t\tfoundTimeFormatCharacters = true\n\t\t\t\t\tfoundInThisLoop = true\n\t\t\t\t\ti += len(special) - 1\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif foundInThisLoop {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif curReducedFormat[0] == '[' {\n\t\t\t\t// For number formats, this code would happen above in a case '[': section.\n\t\t\t\t// However, for time formats it must happen after looking for occurrences in timeFormatCharacters\n\t\t\t\t// because there are a few time formats that can be wrapped in brackets.\n\n\t\t\t\t// Brackets can be currency annotations (e.g. [$$-409])\n\t\t\t\t// color formats (e.g. [color1] through [color56], as well as [red] etc.)\n\t\t\t\t// conditionals (e.g. [>100], the valid conditionals are =, >, <, >=, <=, <>)\n\t\t\t\tbracketIndex := strings.Index(curReducedFormat, \"]\")\n\t\t\t\tif bracketIndex == -1 {\n\t\t\t\t\t// This is not any type of valid format.\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\ti += bracketIndex\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// Symbols that don't have meaning, aren't in the exempt literal characters, and aren't escaped are invalid.\n\t\t\t// The string could still be a valid number format string.\n\t\t\treturn false\n\t\t}\n\t}\n\t// If the string doesn't have any time formatting characters, it could technically be a time format, but it\n\t// would be a pretty weak time format. A valid time format with no time formatting symbols will also be a number\n\t// format with no number formatting symbols, which is essentially a constant string that does not depend on the\n\t// cell's value in anyway. The downstream logic will do the right thing in that case if this returns false.\n\treturn foundTimeFormatCharacters\n}\n\n// is12HourTime checks whether an Excel time format string is a 12\n// hours form.\nfunc is12HourTime(format string) bool {\n\treturn strings.Contains(format, \"am/pm\") || strings.Contains(format, \"AM/PM\") || strings.Contains(format, \"a/p\") || strings.Contains(format, \"A/P\")\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/hsl.go", "content": "/*\nCopyright (c) 2012 Rodrigo Moraes. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n\t * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n\t * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n\t * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\npackage xlsx\n\nimport (\n\t\"image/color\"\n\t\"math\"\n)\n\n// HSLModel converts any color.Color to a HSL color.\nvar HSLModel = color.ModelFunc(hslModel)\n\n// HSL represents a cylindrical coordinate of points in an RGB color model.\n//\n// Values are in the range 0 to 1.\ntype HSL struct {\n\tH, S, L float64\n}\n\n// RGBA returns the alpha-premultiplied red, green, blue and alpha values\n// for the HSL.\nfunc (c HSL) RGBA() (uint32, uint32, uint32, uint32) {\n\tr, g, b := HSLToRGB(c.H, c.S, c.L)\n\treturn uint32(r) * 0x101, uint32(g) * 0x101, uint32(b) * 0x101, 0xffff\n}\n\n// hslModel converts a color.Color to HSL.\nfunc hslModel(c color.Color) color.Color {\n\tif _, ok := c.(HSL); ok {\n\t\treturn c\n\t}\n\tr, g, b, _ := c.RGBA()\n\th, s, l := RGBToHSL(uint8(r>>8), uint8(g>>8), uint8(b>>8))\n\treturn HSL{h, s, l}\n}\n\n// RGBToHSL converts an RGB triple to a HSL triple.\n//\n// Ported from http://goo.gl/Vg1h9\nfunc RGBToHSL(r, g, b uint8) (h, s, l float64) {\n\tfR := float64(r) / 255\n\tfG := float64(g) / 255\n\tfB := float64(b) / 255\n\tmax := math.Max(math.Max(fR, fG), fB)\n\tmin := math.Min(math.Min(fR, fG), fB)\n\tl = (max + min) / 2\n\tif max == min {\n\t\t// Achromatic.\n\t\th, s = 0, 0\n\t} else {\n\t\t// Chromatic.\n\t\td := max - min\n\t\tif l > 0.5 {\n\t\t\ts = d / (2.0 - max - min)\n\t\t} else {\n\t\t\ts = d / (max + min)\n\t\t}\n\t\tswitch max {\n\t\tcase fR:\n\t\t\th = (fG - fB) / d\n\t\t\tif fG < fB {\n\t\t\t\th += 6\n\t\t\t}\n\t\tcase fG:\n\t\t\th = (fB-fR)/d + 2\n\t\tcase fB:\n\t\t\th = (fR-fG)/d + 4\n\t\t}\n\t\th /= 6\n\t}\n\treturn\n}\n\n// HSLToRGB converts an HSL triple to a RGB triple.\n//\n// Ported from http://goo.gl/Vg1h9\nfunc HSLToRGB(h, s, l float64) (r, g, b uint8) {\n\tvar fR, fG, fB float64\n\tif s == 0 {\n\t\tfR, fG, fB = l, l, l\n\t} else {\n\t\tvar q float64\n\t\tif l < 0.5 {\n\t\t\tq = l * (1 + s)\n\t\t} else {\n\t\t\tq = l + s - s*l\n\t\t}\n\t\tp := 2*l - q\n\t\tfR = hueToRGB(p, q, h+1.0/3)\n\t\tfG = hueToRGB(p, q, h)\n\t\tfB = hueToRGB(p, q, h-1.0/3)\n\t}\n\tr = uint8((fR * 255) + 0.5)\n\tg = uint8((fG * 255) + 0.5)\n\tb = uint8((fB * 255) + 0.5)\n\treturn\n}\n\n// hueToRGB is a helper function for HSLToRGB.\nfunc hueToRGB(p, q, t float64) float64 {\n\tif t < 0 {\n\t\tt += 1\n\t}\n\tif t > 1 {\n\t\tt -= 1\n\t}\n\tif t < 1.0/6 {\n\t\treturn p + (q-p)*6*t\n\t}\n\tif t < 0.5 {\n\t\treturn q\n\t}\n\tif t < 2.0/3 {\n\t\treturn p + (q-p)*(2.0/3-t)*6\n\t}\n\treturn p\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/lib.go", "content": "package xlsx\n\nimport (\n\t\"archive/zip\"\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"path\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nconst (\n\tsheetEnding = ``\n)\n\n// XLSXReaderError is the standard error type for otherwise undefined\n// errors in the XSLX reading process.\ntype XLSXReaderError struct {\n\tErr string\n}\n\n// Error returns a string value from an XLSXReaderError struct in order\n// that it might comply with the builtin.error interface.\nfunc (e *XLSXReaderError) Error() string {\n\treturn e.Err\n}\n\n// getRangeFromString is an internal helper function that converts\n// XLSX internal range syntax to a pair of integers. For example,\n// the range string \"1:3\" yield the upper and lower integers 1 and 3.\nfunc getRangeFromString(rangeString string) (lower int, upper int, error error) {\n\tvar parts []string\n\tparts = strings.SplitN(rangeString, \":\", 2)\n\tif parts[0] == \"\" {\n\t\terror = errors.New(fmt.Sprintf(\"Invalid range '%s'\\n\", rangeString))\n\t}\n\tif parts[1] == \"\" {\n\t\terror = errors.New(fmt.Sprintf(\"Invalid range '%s'\\n\", rangeString))\n\t}\n\tlower, error = strconv.Atoi(parts[0])\n\tif error != nil {\n\t\terror = errors.New(fmt.Sprintf(\"Invalid range (not integer in lower bound) %s\\n\", rangeString))\n\t}\n\tupper, error = strconv.Atoi(parts[1])\n\tif error != nil {\n\t\terror = errors.New(fmt.Sprintf(\"Invalid range (not integer in upper bound) %s\\n\", rangeString))\n\t}\n\treturn lower, upper, error\n}\n\n// ColLettersToIndex is used to convert a character based column\n// reference to a zero based numeric column identifier.\nfunc ColLettersToIndex(letters string) int {\n\tsum, mul, n := 0, 1, 0\n\tfor i := len(letters) - 1; i >= 0; i, mul, n = i-1, mul*26, 1 {\n\t\tc := letters[i]\n\t\tswitch {\n\t\tcase 'A' <= c && c <= 'Z':\n\t\t\tn += int(c - 'A')\n\t\tcase 'a' <= c && c <= 'z':\n\t\t\tn += int(c - 'a')\n\t\t}\n\t\tsum += n * mul\n\t}\n\treturn sum\n}\n\n// Get the largestDenominator that is a multiple of a basedDenominator\n// and fits at least once into a given numerator.\nfunc getLargestDenominator(numerator, multiple, baseDenominator, power int) (int, int) {\n\tif numerator/multiple == 0 {\n\t\treturn 1, power\n\t}\n\tnext, nextPower := getLargestDenominator(\n\t\tnumerator, multiple*baseDenominator, baseDenominator, power+1)\n\tif next > multiple {\n\t\treturn next, nextPower\n\t}\n\treturn multiple, power\n}\n\n// Convers a list of numbers representing a column into a alphabetic\n// representation, as used in the spreadsheet.\nfunc formatColumnName(colId []int) string {\n\tlastPart := len(colId) - 1\n\n\tresult := \"\"\n\tfor n, part := range colId {\n\t\tif n == lastPart {\n\t\t\t// The least significant number is in the\n\t\t\t// range 0-25, all other numbers are 1-26,\n\t\t\t// hence we use a differente offset for the\n\t\t\t// last part.\n\t\t\tresult += string(part + 65)\n\t\t} else {\n\t\t\t// Don't output leading 0s, as there is no\n\t\t\t// representation of 0 in this format.\n\t\t\tif part > 0 {\n\t\t\t\tresult += string(part + 64)\n\t\t\t}\n\t\t}\n\t}\n\treturn result\n}\n\nfunc smooshBase26Slice(b26 []int) []int {\n\t// Smoosh values together, eliminating 0s from all but the\n\t// least significant part.\n\tlastButOnePart := len(b26) - 2\n\tfor i := lastButOnePart; i > 0; i-- {\n\t\tpart := b26[i]\n\t\tif part == 0 {\n\t\t\tgreaterPart := b26[i-1]\n\t\t\tif greaterPart > 0 {\n\t\t\t\tb26[i-1] = greaterPart - 1\n\t\t\t\tb26[i] = 26\n\t\t\t}\n\t\t}\n\t}\n\treturn b26\n}\n\nfunc intToBase26(x int) (parts []int) {\n\t// Excel column codes are pure evil - in essence they're just\n\t// base26, but they don't represent the number 0.\n\tb26Denominator, _ := getLargestDenominator(x, 1, 26, 0)\n\n\t// This loop terminates because integer division of 1 / 26\n\t// returns 0.\n\tfor d := b26Denominator; d > 0; d = d / 26 {\n\t\tvalue := x / d\n\t\tremainder := x % d\n\t\tparts = append(parts, value)\n\t\tx = remainder\n\t}\n\treturn parts\n}\n\n// ColIndexToLetters is used to convert a zero based, numeric column\n// indentifier into a character code.\nfunc ColIndexToLetters(colRef int) string {\n\tparts := intToBase26(colRef)\n\treturn formatColumnName(smooshBase26Slice(parts))\n}\n\n// letterOnlyMapF is used in conjunction with strings.Map to return\n// only the characters A-Z and a-z in a string\nfunc letterOnlyMapF(rune rune) rune {\n\tswitch {\n\tcase 'A' <= rune && rune <= 'Z':\n\t\treturn rune\n\tcase 'a' <= rune && rune <= 'z':\n\t\treturn rune - 32\n\t}\n\treturn -1\n}\n\n// intOnlyMapF is used in conjunction with strings.Map to return only\n// the numeric portions of a string.\nfunc intOnlyMapF(rune rune) rune {\n\tif rune >= 48 && rune < 58 {\n\t\treturn rune\n\t}\n\treturn -1\n}\n\n// GetCoordsFromCellIDString returns the zero based cartesian\n// coordinates from a cell name in Excel format, e.g. the cellIDString\n// \"A1\" returns 0, 0 and the \"B3\" return 1, 2.\nfunc GetCoordsFromCellIDString(cellIDString string) (x, y int, error error) {\n\tvar letterPart string = strings.Map(letterOnlyMapF, cellIDString)\n\ty, error = strconv.Atoi(strings.Map(intOnlyMapF, cellIDString))\n\tif error != nil {\n\t\treturn x, y, error\n\t}\n\ty -= 1 // Zero based\n\tx = ColLettersToIndex(letterPart)\n\treturn x, y, error\n}\n\n// GetCellIDStringFromCoords returns the Excel format cell name that\n// represents a pair of zero based cartesian coordinates.\nfunc GetCellIDStringFromCoords(x, y int) string {\n\tletterPart := ColIndexToLetters(x)\n\tnumericPart := y + 1\n\treturn fmt.Sprintf(\"%s%d\", letterPart, numericPart)\n}\n\n// getMaxMinFromDimensionRef return the zero based cartesian maximum\n// and minimum coordinates from the dimension reference embedded in a\n// XLSX worksheet. For example, the dimension reference \"A1:B2\"\n// returns \"0,0\", \"1,1\".\nfunc getMaxMinFromDimensionRef(ref string) (minx, miny, maxx, maxy int, err error) {\n\tvar parts []string\n\tparts = strings.Split(ref, \":\")\n\tminx, miny, err = GetCoordsFromCellIDString(parts[0])\n\tif err != nil {\n\t\treturn -1, -1, -1, -1, err\n\t}\n\tmaxx, maxy, err = GetCoordsFromCellIDString(parts[1])\n\tif err != nil {\n\t\treturn -1, -1, -1, -1, err\n\t}\n\treturn\n}\n\n// calculateMaxMinFromWorkSheet works out the dimensions of a spreadsheet\n// that doesn't have a DimensionRef set. The only case currently\n// known where this is true is with XLSX exported from Google Docs.\n// This is also true for XLSX files created through the streaming APIs.\nfunc calculateMaxMinFromWorksheet(worksheet *xlsxWorksheet) (minx, miny, maxx, maxy int, err error) {\n\t// Note, this method could be very slow for large spreadsheets.\n\tvar x, y int\n\tvar maxVal int\n\tmaxVal = int(^uint(0) >> 1)\n\tminx = maxVal\n\tminy = maxVal\n\tmaxy = 0\n\tmaxx = 0\n\tfor _, row := range worksheet.SheetData.Row {\n\t\tfor _, cell := range row.C {\n\t\t\tx, y, err = GetCoordsFromCellIDString(cell.R)\n\t\t\tif err != nil {\n\t\t\t\treturn -1, -1, -1, -1, err\n\t\t\t}\n\t\t\tif x < minx {\n\t\t\t\tminx = x\n\t\t\t}\n\t\t\tif x > maxx {\n\t\t\t\tmaxx = x\n\t\t\t}\n\t\t\tif y < miny {\n\t\t\t\tminy = y\n\t\t\t}\n\t\t\tif y > maxy {\n\t\t\t\tmaxy = y\n\t\t\t}\n\t\t}\n\t}\n\tif minx == maxVal {\n\t\tminx = 0\n\t}\n\tif miny == maxVal {\n\t\tminy = 0\n\t}\n\treturn\n}\n\n// makeRowFromSpan will, when given a span expressed as a string,\n// return an empty Row large enough to encompass that span and\n// populate it with empty cells. All rows start from cell 1 -\n// regardless of the lower bound of the span.\nfunc makeRowFromSpan(spans string, sheet *Sheet) *Row {\n\tvar error error\n\tvar upper int\n\tvar row *Row\n\tvar cell *Cell\n\n\trow = new(Row)\n\trow.Sheet = sheet\n\t_, upper, error = getRangeFromString(spans)\n\tif error != nil {\n\t\tpanic(error)\n\t}\n\terror = nil\n\trow.Cells = make([]*Cell, upper)\n\tfor i := 0; i < upper; i++ {\n\t\tcell = new(Cell)\n\t\tcell.Value = \"\"\n\t\trow.Cells[i] = cell\n\t}\n\treturn row\n}\n\n// makeRowFromRaw returns the Row representation of the xlsxRow.\nfunc makeRowFromRaw(rawrow xlsxRow, sheet *Sheet) *Row {\n\tvar upper int\n\tvar row *Row\n\tvar cell *Cell\n\n\trow = new(Row)\n\trow.Sheet = sheet\n\tupper = -1\n\n\tfor _, rawcell := range rawrow.C {\n\t\tif rawcell.R != \"\" {\n\t\t\tx, _, error := GetCoordsFromCellIDString(rawcell.R)\n\t\t\tif error != nil {\n\t\t\t\tpanic(fmt.Sprintf(\"Invalid Cell Coord, %s\\n\", rawcell.R))\n\t\t\t}\n\t\t\tif x > upper {\n\t\t\t\tupper = x\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tupper++\n\t}\n\tupper++\n\n\trow.OutlineLevel = rawrow.OutlineLevel\n\n\trow.Cells = make([]*Cell, upper)\n\tfor i := 0; i < upper; i++ {\n\t\tcell = new(Cell)\n\t\tcell.Value = \"\"\n\t\trow.Cells[i] = cell\n\t}\n\treturn row\n}\n\nfunc makeEmptyRow(sheet *Sheet) *Row {\n\trow := new(Row)\n\trow.Cells = make([]*Cell, 0)\n\trow.Sheet = sheet\n\treturn row\n}\n\ntype sharedFormula struct {\n\tx, y int\n\tformula string\n}\n\nfunc formulaForCell(rawcell xlsxC, sharedFormulas map[int]sharedFormula) string {\n\tvar res string\n\n\tf := rawcell.F\n\tif f == nil {\n\t\treturn \"\"\n\t}\n\tif f.T == \"shared\" {\n\t\tx, y, err := GetCoordsFromCellIDString(rawcell.R)\n\t\tif err != nil {\n\t\t\tres = f.Content\n\t\t} else {\n\t\t\tif f.Ref != \"\" {\n\t\t\t\tres = f.Content\n\t\t\t\tsharedFormulas[f.Si] = sharedFormula{x, y, res}\n\t\t\t} else {\n\t\t\t\tsharedFormula := sharedFormulas[f.Si]\n\t\t\t\tdx := x - sharedFormula.x\n\t\t\t\tdy := y - sharedFormula.y\n\t\t\t\torig := []byte(sharedFormula.formula)\n\t\t\t\tvar start, end int\n\t\t\t\tvar stringLiteral bool\n\t\t\t\tfor end = 0; end < len(orig); end++ {\n\t\t\t\t\tc := orig[end]\n\n\t\t\t\t\tif c == '\"' {\n\t\t\t\t\t\tstringLiteral = !stringLiteral\n\t\t\t\t\t}\n\n\t\t\t\t\tif stringLiteral {\n\t\t\t\t\t\tcontinue // Skip characters in quotes\n\t\t\t\t\t}\n\n\t\t\t\t\tif c >= 'A' && c <= 'Z' || c == '$' {\n\t\t\t\t\t\tres += string(orig[start:end])\n\t\t\t\t\t\tstart = end\n\t\t\t\t\t\tend++\n\t\t\t\t\t\tfoundNum := false\n\t\t\t\t\t\tfor ; end < len(orig); end++ {\n\t\t\t\t\t\t\tidc := orig[end]\n\t\t\t\t\t\t\tif idc >= '0' && idc <= '9' || idc == '$' {\n\t\t\t\t\t\t\t\tfoundNum = true\n\t\t\t\t\t\t\t} else if idc >= 'A' && idc <= 'Z' {\n\t\t\t\t\t\t\t\tif foundNum {\n\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif foundNum {\n\t\t\t\t\t\t\tcellID := string(orig[start:end])\n\t\t\t\t\t\t\tres += shiftCell(cellID, dx, dy)\n\t\t\t\t\t\t\tstart = end\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif start < len(orig) {\n\t\t\t\t\tres += string(orig[start:])\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\tres = f.Content\n\t}\n\treturn strings.Trim(res, \" \\t\\n\\r\")\n}\n\n// shiftCell returns the cell shifted according to dx and dy taking into consideration of absolute\n// references with dollar sign ($)\nfunc shiftCell(cellID string, dx, dy int) string {\n\tfx, fy, _ := GetCoordsFromCellIDString(cellID)\n\n\t// Is fixed column?\n\tfixedCol := strings.Index(cellID, \"$\") == 0\n\n\t// Is fixed row?\n\tfixedRow := strings.LastIndex(cellID, \"$\") > 0\n\n\tif !fixedCol {\n\t\t// Shift column\n\t\tfx += dx\n\t}\n\n\tif !fixedRow {\n\t\t// Shift row\n\t\tfy += dy\n\t}\n\n\t// New shifted cell\n\tshiftedCellID := GetCellIDStringFromCoords(fx, fy)\n\n\tif !fixedCol && !fixedRow {\n\t\treturn shiftedCellID\n\t}\n\n\t// There are absolute references, need to put the $ back into the formula.\n\tletterPart := strings.Map(letterOnlyMapF, shiftedCellID)\n\tnumberPart := strings.Map(intOnlyMapF, shiftedCellID)\n\n\tresult := \"\"\n\n\tif fixedCol {\n\t\tresult += \"$\"\n\t}\n\n\tresult += letterPart\n\n\tif fixedRow {\n\t\tresult += \"$\"\n\t}\n\n\tresult += numberPart\n\n\treturn result\n}\n\n// fillCellData attempts to extract a valid value, usable in\n// CSV form from the raw cell value. Note - this is not actually\n// general enough - we should support retaining tabs and newlines.\nfunc fillCellData(rawCell xlsxC, refTable *RefTable, sharedFormulas map[int]sharedFormula, cell *Cell) {\n\tval := strings.Trim(rawCell.V, \" \\t\\n\\r\")\n\tcell.formula = formulaForCell(rawCell, sharedFormulas)\n\tswitch rawCell.T {\n\tcase \"s\": // Shared String\n\t\tcell.cellType = CellTypeString\n\t\tif val != \"\" {\n\t\t\tref, err := strconv.Atoi(val)\n\t\t\tif err != nil {\n\t\t\t\tpanic(err)\n\t\t\t}\n\t\t\tcell.Value = refTable.ResolveSharedString(ref)\n\t\t}\n\tcase \"inlineStr\":\n\t\tcell.cellType = CellTypeInline\n\t\tfillCellDataFromInlineString(rawCell, cell)\n\tcase \"b\": // Boolean\n\t\tcell.Value = val\n\t\tcell.cellType = CellTypeBool\n\tcase \"e\": // Error\n\t\tcell.Value = val\n\t\tcell.cellType = CellTypeError\n\tcase \"str\":\n\t\t// String Formula (special type for cells with formulas that return a string value)\n\t\t// Unlike the other string cell types, the string is stored directly in the value.\n\t\tcell.Value = val\n\t\tcell.cellType = CellTypeStringFormula\n\tcase \"d\": // Date: Cell contains a date in the ISO 8601 format.\n\t\tcell.Value = val\n\t\tcell.cellType = CellTypeDate\n\tcase \"\": // Numeric is the default\n\t\tfallthrough\n\tcase \"n\": // Numeric\n\t\tcell.Value = val\n\t\tcell.cellType = CellTypeNumeric\n\tdefault:\n\t\tpanic(errors.New(\"invalid cell type\"))\n\t}\n}\n\n// fillCellDataFromInlineString attempts to get inline string data and put it into a Cell.\nfunc fillCellDataFromInlineString(rawcell xlsxC, cell *Cell) {\n\tcell.Value = \"\"\n\tif rawcell.Is != nil {\n\t\tif rawcell.Is.T != \"\" {\n\t\t\tcell.Value = strings.Trim(rawcell.Is.T, \" \\t\\n\\r\")\n\t\t} else {\n\t\t\tfor _, r := range rawcell.Is.R {\n\t\t\t\tcell.Value += r.T\n\t\t\t}\n\t\t}\n\t}\n}\n\n// readRowsFromSheet is an internal helper function that extracts the\n// rows from a XSLXWorksheet, populates them with Cells and resolves\n// the value references from the reference table and stores them in\n// the rows and columns.\nfunc readRowsFromSheet(Worksheet *xlsxWorksheet, file *File, sheet *Sheet, rowLimit int) ([]*Row, []*Col, int, int) {\n\tvar rows []*Row\n\tvar cols []*Col\n\tvar row *Row\n\tvar minCol, maxCol, maxRow, colCount, rowCount int\n\tvar reftable *RefTable\n\tvar err error\n\tvar insertRowIndex, insertColIndex int\n\tsharedFormulas := map[int]sharedFormula{}\n\n\tif len(Worksheet.SheetData.Row) == 0 {\n\t\treturn nil, nil, 0, 0\n\t}\n\treftable = file.referenceTable\n\tif len(Worksheet.Dimension.Ref) > 0 && len(strings.Split(Worksheet.Dimension.Ref, \":\")) == 2 && rowLimit == NoRowLimit {\n\t\tminCol, _, maxCol, maxRow, err = getMaxMinFromDimensionRef(Worksheet.Dimension.Ref)\n\t} else {\n\t\tminCol, _, maxCol, maxRow, err = calculateMaxMinFromWorksheet(Worksheet)\n\t}\n\tif err != nil {\n\t\tpanic(err.Error())\n\t}\n\n\trowCount = maxRow + 1\n\tcolCount = maxCol + 1\n\trows = make([]*Row, rowCount)\n\tcols = make([]*Col, colCount)\n\tfor i := range cols {\n\t\tcols[i] = &Col{\n\t\t\tHidden: false,\n\t\t}\n\t}\n\n\tif Worksheet.Cols != nil {\n\t\t// Columns can apply to a range, for convenience we expand the\n\t\t// ranges out into individual column definitions.\n\t\tfor _, rawcol := range Worksheet.Cols.Col {\n\t\t\t// Note, below, that sometimes column definitions can\n\t\t\t// exist outside the defined dimensions of the\n\t\t\t// spreadsheet - we deliberately exclude these\n\t\t\t// columns.\n\t\t\tfor i := rawcol.Min; i <= rawcol.Max && i <= colCount; i++ {\n\t\t\t\tcol := &Col{\n\t\t\t\t\tMin: rawcol.Min,\n\t\t\t\t\tMax: rawcol.Max,\n\t\t\t\t\tHidden: rawcol.Hidden,\n\t\t\t\t\tWidth: rawcol.Width,\n\t\t\t\t\tOutlineLevel: rawcol.OutlineLevel}\n\t\t\t\tcols[i-1] = col\n\t\t\t\tif file.styles != nil {\n\t\t\t\t\tcol.style = file.styles.getStyle(rawcol.Style)\n\t\t\t\t\tcol.numFmt, col.parsedNumFmt = file.styles.getNumberFormat(rawcol.Style)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tnumRows := len(rows)\n\tfor rowIndex := 0; rowIndex < len(Worksheet.SheetData.Row); rowIndex++ {\n\t\trawrow := Worksheet.SheetData.Row[rowIndex]\n\t\t// Some spreadsheets will omit blank rows from the\n\t\t// stored data\n\t\tfor rawrow.R > (insertRowIndex + 1) {\n\t\t\t// Put an empty Row into the array\n\t\t\tif insertRowIndex < numRows {\n\t\t\t\trows[insertRowIndex] = makeEmptyRow(sheet)\n\t\t\t}\n\t\t\tinsertRowIndex++\n\t\t}\n\t\t// range is not empty and only one range exist\n\t\tif len(rawrow.Spans) != 0 && strings.Count(rawrow.Spans, \":\") == 1 {\n\t\t\trow = makeRowFromSpan(rawrow.Spans, sheet)\n\t\t} else {\n\t\t\trow = makeRowFromRaw(rawrow, sheet)\n\t\t}\n\n\t\trow.Hidden = rawrow.Hidden\n\t\theight, err := strconv.ParseFloat(rawrow.Ht, 64)\n\t\tif err == nil {\n\t\t\trow.Height = height\n\t\t}\n\t\trow.isCustom = rawrow.CustomHeight\n\t\trow.OutlineLevel = rawrow.OutlineLevel\n\n\t\tinsertColIndex = minCol\n\t\tfor _, rawcell := range rawrow.C {\n\t\t\th, v, err := Worksheet.MergeCells.getExtent(rawcell.R)\n\t\t\tif err != nil {\n\t\t\t\tpanic(err.Error())\n\t\t\t}\n\t\t\tx, _, _ := GetCoordsFromCellIDString(rawcell.R)\n\n\t\t\t// K1000000: Prevent panic when the range specified in the spreadsheet\n\t\t\t// view exceeds the actual number of columns in the dataset.\n\n\t\t\t// Some spreadsheets will omit blank cells\n\t\t\t// from the data.\n\t\t\tfor x > insertColIndex {\n\t\t\t\t// Put an empty Cell into the array\n\t\t\t\tif insertColIndex < len(row.Cells) {\n\t\t\t\t\trow.Cells[insertColIndex] = new(Cell)\n\t\t\t\t}\n\t\t\t\tinsertColIndex++\n\t\t\t}\n\t\t\tcellX := insertColIndex\n\n\t\t\tif cellX < len(row.Cells) {\n\t\t\t\tcell := row.Cells[cellX]\n\t\t\t\tcell.HMerge = h\n\t\t\t\tcell.VMerge = v\n\t\t\t\tfillCellData(rawcell, reftable, sharedFormulas, cell)\n\t\t\t\tif file.styles != nil {\n\t\t\t\t\tcell.style = file.styles.getStyle(rawcell.S)\n\t\t\t\t\tcell.NumFmt, cell.parsedNumFmt = file.styles.getNumberFormat(rawcell.S)\n\t\t\t\t}\n\t\t\t\tcell.date1904 = file.Date1904\n\t\t\t\t// Cell is considered hidden if the row or the column of this cell is hidden\n\t\t\t\tcell.Hidden = rawrow.Hidden || (len(cols) > cellX && cols[cellX].Hidden)\n\t\t\t\tinsertColIndex++\n\t\t\t}\n\t\t}\n\t\tif len(rows) > insertRowIndex {\n\t\t\trows[insertRowIndex] = row\n\t\t}\n\t\tinsertRowIndex++\n\t}\n\n\t// insert trailing empty rows for the rest of the file\n\tfor ; insertRowIndex < rowCount; insertRowIndex++ {\n\t\trows[insertRowIndex] = makeEmptyRow(sheet)\n\t}\n\treturn rows, cols, colCount, rowCount\n}\n\ntype indexedSheet struct {\n\tIndex int\n\tSheet *Sheet\n\tError error\n}\n\nfunc readSheetViews(xSheetViews xlsxSheetViews) []SheetView {\n\tif xSheetViews.SheetView == nil || len(xSheetViews.SheetView) == 0 {\n\t\treturn nil\n\t}\n\tsheetViews := []SheetView{}\n\tfor _, xSheetView := range xSheetViews.SheetView {\n\t\tsheetView := SheetView{}\n\t\tif xSheetView.Pane != nil {\n\t\t\txlsxPane := xSheetView.Pane\n\t\t\tpane := &Pane{}\n\t\t\tpane.XSplit = xlsxPane.XSplit\n\t\t\tpane.YSplit = xlsxPane.YSplit\n\t\t\tpane.TopLeftCell = xlsxPane.TopLeftCell\n\t\t\tpane.ActivePane = xlsxPane.ActivePane\n\t\t\tpane.State = xlsxPane.State\n\t\t\tsheetView.Pane = pane\n\t\t}\n\t\tsheetViews = append(sheetViews, sheetView)\n\t}\n\treturn sheetViews\n}\n\n// readSheetFromFile is the logic of converting a xlsxSheet struct\n// into a Sheet struct. This work can be done in parallel and so\n// readSheetsFromZipFile will spawn an instance of this function per\n// sheet and get the results back on the provided channel.\nfunc readSheetFromFile(sc chan *indexedSheet, index int, rsheet xlsxSheet, fi *File, sheetXMLMap map[string]string, rowLimit int) (errRes error) {\n\tresult := &indexedSheet{Index: index, Sheet: nil, Error: nil}\n\tdefer func() {\n\t\tif e := recover(); e != nil {\n\t\t\tswitch e.(type) {\n\t\t\tcase error:\n\t\t\t\tresult.Error = e.(error)\n\t\t\t\terrRes = e.(error)\n\t\t\tdefault:\n\t\t\t\tresult.Error = errors.New(\"unexpected error\")\n\t\t\t}\n\t\t\t// The only thing here, is if one close the channel. but its not the case\n\t\t\tsc <- result\n\t\t}\n\t}()\n\n\tworksheet, err := getWorksheetFromSheet(rsheet, fi.worksheets, sheetXMLMap, rowLimit)\n\tif err != nil {\n\t\tresult.Error = err\n\t\tsc <- result\n\t\treturn err\n\t}\n\tsheet := new(Sheet)\n\tsheet.File = fi\n\tsheet.Rows, sheet.Cols, sheet.MaxCol, sheet.MaxRow = readRowsFromSheet(worksheet, fi, sheet, rowLimit)\n\tsheet.Hidden = rsheet.State == sheetStateHidden || rsheet.State == sheetStateVeryHidden\n\tsheet.SheetViews = readSheetViews(worksheet.SheetViews)\n\n\tsheet.SheetFormat.DefaultColWidth = worksheet.SheetFormatPr.DefaultColWidth\n\tsheet.SheetFormat.DefaultRowHeight = worksheet.SheetFormatPr.DefaultRowHeight\n\tsheet.SheetFormat.OutlineLevelCol = worksheet.SheetFormatPr.OutlineLevelCol\n\tsheet.SheetFormat.OutlineLevelRow = worksheet.SheetFormatPr.OutlineLevelRow\n\n\tresult.Sheet = sheet\n\tsc <- result\n\treturn nil\n}\n\n// readSheetsFromZipFile is an internal helper function that loops\n// over the Worksheets defined in the XSLXWorkbook and loads them into\n// Sheet objects stored in the Sheets slice of a xlsx.File struct.\nfunc readSheetsFromZipFile(f *zip.File, file *File, sheetXMLMap map[string]string, rowLimit int) (map[string]*Sheet, []*Sheet, error) {\n\tvar workbook *xlsxWorkbook\n\tvar err error\n\tvar rc io.ReadCloser\n\tvar decoder *xml.Decoder\n\tvar sheetCount int\n\tworkbook = new(xlsxWorkbook)\n\trc, err = f.Open()\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\tdecoder = xml.NewDecoder(rc)\n\terr = decoder.Decode(workbook)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\tfile.Date1904 = workbook.WorkbookPr.Date1904\n\n\tfor entryNum := range workbook.DefinedNames.DefinedName {\n\t\tfile.DefinedNames = append(file.DefinedNames, &workbook.DefinedNames.DefinedName[entryNum])\n\t}\n\n\t// Only try and read sheets that have corresponding files.\n\t// Notably this excludes chartsheets don't right now\n\tvar workbookSheets []xlsxSheet\n\tfor _, sheet := range workbook.Sheets.Sheet {\n\t\tif f := worksheetFileForSheet(sheet, file.worksheets, sheetXMLMap); f != nil {\n\t\t\tworkbookSheets = append(workbookSheets, sheet)\n\t\t}\n\t}\n\tsheetCount = len(workbookSheets)\n\tsheetsByName := make(map[string]*Sheet, sheetCount)\n\tsheets := make([]*Sheet, sheetCount)\n\tsheetChan := make(chan *indexedSheet, sheetCount)\n\n\tgo func() {\n\t\tdefer close(sheetChan)\n\t\terr = nil\n\t\tfor i, rawsheet := range workbookSheets {\n\t\t\tif err := readSheetFromFile(sheetChan, i, rawsheet, file, sheetXMLMap, rowLimit); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}()\n\n\tfor j := 0; j < sheetCount; j++ {\n\t\tsheet := <-sheetChan\n\t\tif sheet.Error != nil {\n\t\t\treturn nil, nil, sheet.Error\n\t\t}\n\t\tsheetName := workbookSheets[sheet.Index].Name\n\t\tsheetsByName[sheetName] = sheet.Sheet\n\t\tsheet.Sheet.Name = sheetName\n\t\tsheets[sheet.Index] = sheet.Sheet\n\t}\n\treturn sheetsByName, sheets, nil\n}\n\n// readSharedStringsFromZipFile() is an internal helper function to\n// extract a reference table from the sharedStrings.xml file within\n// the XLSX zip file.\nfunc readSharedStringsFromZipFile(f *zip.File) (*RefTable, error) {\n\tvar sst *xlsxSST\n\tvar error error\n\tvar rc io.ReadCloser\n\tvar decoder *xml.Decoder\n\tvar reftable *RefTable\n\n\t// In a file with no strings it's possible that\n\t// sharedStrings.xml doesn't exist. In this case the value\n\t// passed as f will be nil.\n\tif f == nil {\n\t\treturn nil, nil\n\t}\n\trc, error = f.Open()\n\tif error != nil {\n\t\treturn nil, error\n\t}\n\tsst = new(xlsxSST)\n\tdecoder = xml.NewDecoder(rc)\n\terror = decoder.Decode(sst)\n\tif error != nil {\n\t\treturn nil, error\n\t}\n\treftable = MakeSharedStringRefTable(sst)\n\treturn reftable, nil\n}\n\n// readStylesFromZipFile() is an internal helper function to\n// extract a style table from the style.xml file within\n// the XLSX zip file.\nfunc readStylesFromZipFile(f *zip.File, theme *theme) (*xlsxStyleSheet, error) {\n\tvar style *xlsxStyleSheet\n\tvar error error\n\tvar rc io.ReadCloser\n\tvar decoder *xml.Decoder\n\trc, error = f.Open()\n\tif error != nil {\n\t\treturn nil, error\n\t}\n\tstyle = newXlsxStyleSheet(theme)\n\tdecoder = xml.NewDecoder(rc)\n\terror = decoder.Decode(style)\n\tif error != nil {\n\t\treturn nil, error\n\t}\n\tbuildNumFmtRefTable(style)\n\treturn style, nil\n}\n\nfunc buildNumFmtRefTable(style *xlsxStyleSheet) {\n\tfor _, numFmt := range style.NumFmts.NumFmt {\n\t\t// We do this for the side effect of populating the NumFmtRefTable.\n\t\tstyle.addNumFmt(numFmt)\n\t}\n}\n\nfunc readThemeFromZipFile(f *zip.File) (*theme, error) {\n\trc, err := f.Open()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar themeXml xlsxTheme\n\terr = xml.NewDecoder(rc).Decode(&themeXml)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn newTheme(themeXml), nil\n}\n\ntype WorkBookRels map[string]string\n\nfunc (w *WorkBookRels) MakeXLSXWorkbookRels() xlsxWorkbookRels {\n\trelCount := len(*w)\n\txWorkbookRels := xlsxWorkbookRels{}\n\txWorkbookRels.Relationships = make([]xlsxWorkbookRelation, relCount+3)\n\tfor k, v := range *w {\n\t\tindex, err := strconv.Atoi(k[3:])\n\t\tif err != nil {\n\t\t\tpanic(err.Error())\n\t\t}\n\t\txWorkbookRels.Relationships[index-1] = xlsxWorkbookRelation{\n\t\t\tId: k,\n\t\t\tTarget: v,\n\t\t\tType: \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\"}\n\t}\n\n\trelCount++\n\tsheetId := fmt.Sprintf(\"rId%d\", relCount)\n\txWorkbookRels.Relationships[relCount-1] = xlsxWorkbookRelation{\n\t\tId: sheetId,\n\t\tTarget: \"sharedStrings.xml\",\n\t\tType: \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/sharedStrings\"}\n\n\trelCount++\n\tsheetId = fmt.Sprintf(\"rId%d\", relCount)\n\txWorkbookRels.Relationships[relCount-1] = xlsxWorkbookRelation{\n\t\tId: sheetId,\n\t\tTarget: \"theme/theme1.xml\",\n\t\tType: \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/theme\"}\n\n\trelCount++\n\tsheetId = fmt.Sprintf(\"rId%d\", relCount)\n\txWorkbookRels.Relationships[relCount-1] = xlsxWorkbookRelation{\n\t\tId: sheetId,\n\t\tTarget: \"styles.xml\",\n\t\tType: \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/styles\"}\n\n\treturn xWorkbookRels\n}\n\n// readWorkbookRelationsFromZipFile is an internal helper function to\n// extract a map of relationship ID strings to the name of the\n// worksheet.xml file they refer to. The resulting map can be used to\n// reliably derefence the worksheets in the XLSX file.\nfunc readWorkbookRelationsFromZipFile(workbookRels *zip.File) (WorkBookRels, error) {\n\tvar sheetXMLMap WorkBookRels\n\tvar wbRelationships *xlsxWorkbookRels\n\tvar rc io.ReadCloser\n\tvar decoder *xml.Decoder\n\tvar err error\n\n\trc, err = workbookRels.Open()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdecoder = xml.NewDecoder(rc)\n\twbRelationships = new(xlsxWorkbookRels)\n\terr = decoder.Decode(wbRelationships)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tsheetXMLMap = make(WorkBookRels)\n\tfor _, rel := range wbRelationships.Relationships {\n\t\tif strings.HasSuffix(rel.Target, \".xml\") && rel.Type == \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\" {\n\t\t\t_, filename := path.Split(rel.Target)\n\t\t\tsheetXMLMap[rel.Id] = strings.Replace(filename, \".xml\", \"\", 1)\n\t\t}\n\t}\n\treturn sheetXMLMap, nil\n}\n\n// ReadZip() takes a pointer to a zip.ReadCloser and returns a\n// xlsx.File struct populated with its contents. In most cases\n// ReadZip is not used directly, but is called internally by OpenFile.\nfunc ReadZip(f *zip.ReadCloser) (*File, error) {\n\treturn ReadZipWithRowLimit(f, NoRowLimit)\n}\n\n// ReadZipWithRowLimit() takes a pointer to a zip.ReadCloser and returns a\n// xlsx.File struct populated with its contents. In most cases\n// ReadZip is not used directly, but is called internally by OpenFile.\nfunc ReadZipWithRowLimit(f *zip.ReadCloser, rowLimit int) (*File, error) {\n\tdefer f.Close()\n\treturn ReadZipReaderWithRowLimit(&f.Reader, rowLimit)\n}\n\n// ReadZipReader() can be used to read an XLSX in memory without\n// touching the filesystem.\nfunc ReadZipReader(r *zip.Reader) (*File, error) {\n\treturn ReadZipReaderWithRowLimit(r, NoRowLimit)\n}\n\n// ReadZipReaderWithRowLimit() can be used to read an XLSX in memory without\n// touching the filesystem.\n// rowLimit is the number of rows that should be read from the file. If rowLimit is -1, no limit is applied.\n// You can specify this with the constant NoRowLimit.\nfunc ReadZipReaderWithRowLimit(r *zip.Reader, rowLimit int) (*File, error) {\n\tvar err error\n\tvar file *File\n\tvar reftable *RefTable\n\tvar sharedStrings *zip.File\n\tvar sheetXMLMap map[string]string\n\tvar sheetsByName map[string]*Sheet\n\tvar sheets []*Sheet\n\tvar style *xlsxStyleSheet\n\tvar styles *zip.File\n\tvar themeFile *zip.File\n\tvar v *zip.File\n\tvar workbook *zip.File\n\tvar workbookRels *zip.File\n\tvar worksheets map[string]*zip.File\n\n\tfile = NewFile()\n\t// file.numFmtRefTable = make(map[int]xlsxNumFmt, 1)\n\tworksheets = make(map[string]*zip.File, len(r.File))\n\tfor _, v = range r.File {\n\t\tswitch v.Name {\n\t\tcase \"xl/sharedStrings.xml\":\n\t\t\tsharedStrings = v\n\t\tcase \"xl/workbook.xml\":\n\t\t\tworkbook = v\n\t\tcase \"xl/_rels/workbook.xml.rels\":\n\t\t\tworkbookRels = v\n\t\tcase \"xl/styles.xml\":\n\t\t\tstyles = v\n\t\tcase \"xl/theme/theme1.xml\":\n\t\t\tthemeFile = v\n\t\tdefault:\n\t\t\tif len(v.Name) > 17 {\n\t\t\t\tif v.Name[0:13] == \"xl/worksheets\" {\n\t\t\t\t\tworksheets[v.Name[14:len(v.Name)-4]] = v\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif workbookRels == nil {\n\t\treturn nil, fmt.Errorf(\"xl/_rels/workbook.xml.rels not found in input xlsx.\")\n\t}\n\tsheetXMLMap, err = readWorkbookRelationsFromZipFile(workbookRels)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(worksheets) == 0 {\n\t\treturn nil, fmt.Errorf(\"Input xlsx contains no worksheets.\")\n\t}\n\tfile.worksheets = worksheets\n\treftable, err = readSharedStringsFromZipFile(sharedStrings)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tfile.referenceTable = reftable\n\tif themeFile != nil {\n\t\ttheme, err := readThemeFromZipFile(themeFile)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tfile.theme = theme\n\t}\n\tif styles != nil {\n\t\tstyle, err = readStylesFromZipFile(styles, file.theme)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tfile.styles = style\n\t}\n\tsheetsByName, sheets, err = readSheetsFromZipFile(workbook, file, sheetXMLMap, rowLimit)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif sheets == nil {\n\t\treaderErr := new(XLSXReaderError)\n\t\treaderErr.Err = \"No sheets found in XLSX File\"\n\t\treturn nil, readerErr\n\t}\n\tfile.Sheet = sheetsByName\n\tfile.Sheets = sheets\n\treturn file, nil\n}\n\n// truncateSheetXML will take in a reader to an XML sheet file and will return a reader that will read an equivalent\n// XML sheet file with only the number of rows specified. This greatly speeds up XML unmarshalling when only\n// a few rows need to be read from a large sheet.\n// When sheets are truncated, all formatting present after the sheetData tag will be lost, but all of this formatting\n// is related to printing and visibility, and is out of scope for most purposes of this library.\nfunc truncateSheetXML(r io.Reader, rowLimit int) (io.Reader, error) {\n\tvar rowCount int\n\tvar token xml.Token\n\tvar readErr error\n\n\toutput := new(bytes.Buffer)\n\tr = io.TeeReader(r, output)\n\tdecoder := xml.NewDecoder(r)\n\n\tfor {\n\t\ttoken, readErr = decoder.Token()\n\t\tif readErr == io.EOF {\n\t\t\tbreak\n\t\t} else if readErr != nil {\n\t\t\treturn nil, readErr\n\t\t}\n\t\tend, ok := token.(xml.EndElement)\n\t\tif ok && end.Name.Local == \"row\" {\n\t\t\trowCount++\n\t\t\tif rowCount >= rowLimit {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\toffset := decoder.InputOffset()\n\toutput.Truncate(int(offset))\n\n\tif readErr != io.EOF {\n\t\t_, err := output.Write([]byte(sheetEnding))\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn output, nil\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/read.go", "content": "package xlsx\n\nimport (\n\t\"errors\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"time\"\n)\n\nvar (\n\terrNilInterface = errors.New(\"nil pointer is not a valid argument\")\n\terrNotStructPointer = errors.New(\"argument must be a pointer to struct\")\n\terrInvalidTag = errors.New(`invalid tag: must have the format xlsx:idx`)\n)\n\n//XLSXUnmarshaler is the interface implemented for types that can unmarshal a Row\n//as a representation of themselves.\ntype XLSXUnmarshaler interface {\n\tUnmarshal(*Row) error\n}\n\n//ReadStruct reads a struct from r to ptr. Accepts a ptr\n//to struct. This code expects a tag xlsx:\"N\", where N is the index\n//of the cell to be used. Basic types like int,string,float64 and bool\n//are supported\nfunc (r *Row) ReadStruct(ptr interface{}) error {\n\tif ptr == nil {\n\t\treturn errNilInterface\n\t}\n\t//check if the type implements XLSXUnmarshaler. If so,\n\t//just let it do the work.\n\tunmarshaller, ok := ptr.(XLSXUnmarshaler)\n\tif ok {\n\t\treturn unmarshaller.Unmarshal(r)\n\t}\n\tv := reflect.ValueOf(ptr)\n\tif v.Kind() != reflect.Ptr {\n\t\treturn errNotStructPointer\n\t}\n\tv = v.Elem()\n\tif v.Kind() != reflect.Struct {\n\t\treturn errNotStructPointer\n\t}\n\tn := v.NumField()\n\tfor i := 0; i < n; i++ {\n\t\tfield := v.Type().Field(i)\n\t\tidx := field.Tag.Get(\"xlsx\")\n\t\t//do a recursive check for the field if it is a struct or a pointer\n\t\t//even if it doesn't have a tag\n\t\t//ignore if it has a - or empty tag\n\t\tisTime := false\n\t\tswitch {\n\t\tcase idx == \"-\":\n\t\t\tcontinue\n\t\tcase field.Type.Kind() == reflect.Ptr || field.Type.Kind() == reflect.Struct:\n\t\t\tvar structPtr interface{}\n\t\t\tif !v.Field(i).CanSet() {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif field.Type.Kind() == reflect.Struct {\n\t\t\t\tstructPtr = v.Field(i).Addr().Interface()\n\t\t\t} else {\n\t\t\t\tstructPtr = v.Field(i).Interface()\n\t\t\t}\n\t\t\t//check if the container is a time.Time\n\t\t\t_, isTime = structPtr.(*time.Time)\n\t\t\tif isTime {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\terr := r.ReadStruct(structPtr)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\tcase len(idx) == 0:\n\t\t\tcontinue\n\t\t}\n\t\tpos, err := strconv.Atoi(idx)\n\t\tif err != nil {\n\t\t\treturn errInvalidTag\n\t\t}\n\n\t\t//check if desired position is not out of bounds\n\t\tif pos > len(r.Cells)-1 {\n\t\t\tcontinue\n\t\t}\n\t\tcell := r.Cells[pos]\n\t\tfieldV := v.Field(i)\n\t\t//continue if the field is not settable\n\t\tif !fieldV.CanSet() {\n\t\t\tcontinue\n\t\t}\n\t\tif isTime {\n\t\t\tt, err := cell.GetTime(false)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif field.Type.Kind() == reflect.Ptr {\n\t\t\t\tfieldV.Set(reflect.ValueOf(&t))\n\t\t\t} else {\n\t\t\t\tfieldV.Set(reflect.ValueOf(t))\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tswitch field.Type.Kind() {\n\t\tcase reflect.String:\n\t\t\tvalue, err := cell.FormattedValue()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tfieldV.SetString(value)\n\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\t\tvalue, err := cell.Int64()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tfieldV.SetInt(value)\n\t\tcase reflect.Float64:\n\t\t\tvalue, err := cell.Float()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tfieldV.SetFloat(value)\n\t\tcase reflect.Bool:\n\t\t\tvalue := cell.Bool()\n\t\t\tfieldV.SetBool(value)\n\t\t}\n\t}\n\tvalue := v.Interface()\n\tptr = &value\n\treturn nil\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/reftable.go", "content": "package xlsx\n\ntype RefTable struct {\n\tindexedStrings []string\n\tknownStrings map[string]int\n\tisWrite bool\n}\n\n// NewSharedStringRefTable() creates a new, empty RefTable.\nfunc NewSharedStringRefTable() *RefTable {\n\trt := RefTable{}\n\trt.knownStrings = make(map[string]int)\n\treturn &rt\n}\n\n// MakeSharedStringRefTable() takes an xlsxSST struct and converts\n// it's contents to an slice of strings used to refer to string values\n// by numeric index - this is the model used within XLSX worksheet (a\n// numeric reference is stored to a shared cell value).\nfunc MakeSharedStringRefTable(source *xlsxSST) *RefTable {\n\treftable := NewSharedStringRefTable()\n\treftable.isWrite = false\n\tfor _, si := range source.SI {\n\t\tif len(si.R) > 0 {\n\t\t\tnewString := \"\"\n\t\t\tfor j := 0; j < len(si.R); j++ {\n\t\t\t\tnewString = newString + si.R[j].T\n\t\t\t}\n\t\t\treftable.AddString(newString)\n\t\t} else {\n\t\t\treftable.AddString(si.T)\n\t\t}\n\t}\n\treturn reftable\n}\n\n// makeXlsxSST() takes a RefTable and returns and\n// equivalent xlsxSST representation.\nfunc (rt *RefTable) makeXLSXSST() xlsxSST {\n\tsst := xlsxSST{}\n\tsst.Count = len(rt.indexedStrings)\n\tsst.UniqueCount = sst.Count\n\tfor _, ref := range rt.indexedStrings {\n\t\tsi := xlsxSI{}\n\t\tsi.T = ref\n\t\tsst.SI = append(sst.SI, si)\n\t}\n\treturn sst\n}\n\n// Resolvesharedstring() looks up a string value by numeric index from\n// a provided reference table (just a slice of strings in the correct\n// order). This function only exists to provide clarity or purpose\n// via it's name.\nfunc (rt *RefTable) ResolveSharedString(index int) string {\n\treturn rt.indexedStrings[index]\n}\n\n// AddString adds a string to the reference table and return it's\n// numeric index. If the string already exists then it simply returns\n// the existing index.\nfunc (rt *RefTable) AddString(str string) int {\n\tif rt.isWrite {\n\t\tindex, ok := rt.knownStrings[str]\n\t\tif ok {\n\t\t\treturn index\n\t\t}\n\t}\n\trt.indexedStrings = append(rt.indexedStrings, str)\n\tindex := len(rt.indexedStrings) - 1\n\trt.knownStrings[str] = index\n\treturn index\n}\n\nfunc (rt *RefTable) Length() int {\n\treturn len(rt.indexedStrings)\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/row.go", "content": "package xlsx\n\ntype Row struct {\n\tCells []*Cell\n\tHidden bool\n\tSheet *Sheet\n\tHeight float64\n\tOutlineLevel uint8\n\tisCustom bool\n}\n\nfunc (r *Row) SetHeight(ht float64) {\n\tr.Height = ht\n\tr.isCustom = true\n}\n\nfunc (r *Row) SetHeightCM(ht float64) {\n\tr.Height = ht * 28.3464567 // Convert CM to postscript points\n\tr.isCustom = true\n}\n\nfunc (r *Row) AddCell() *Cell {\n\tcell := NewCell(r)\n\tr.Cells = append(r.Cells, cell)\n\tr.Sheet.maybeAddCol(len(r.Cells))\n\treturn cell\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/sheet.go", "content": "package xlsx\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"strconv\"\n)\n\n// Sheet is a high level structure intended to provide user access to\n// the contents of a particular sheet within an XLSX file.\ntype Sheet struct {\n\tName string\n\tFile *File\n\tRows []*Row\n\tCols []*Col\n\tMaxRow int\n\tMaxCol int\n\tHidden bool\n\tSelected bool\n\tSheetViews []SheetView\n\tSheetFormat SheetFormat\n\tAutoFilter *AutoFilter\n}\n\ntype SheetView struct {\n\tPane *Pane\n}\n\ntype Pane struct {\n\tXSplit float64\n\tYSplit float64\n\tTopLeftCell string\n\tActivePane string\n\tState string // Either \"split\" or \"frozen\"\n}\n\ntype SheetFormat struct {\n\tDefaultColWidth float64\n\tDefaultRowHeight float64\n\tOutlineLevelCol uint8\n\tOutlineLevelRow uint8\n}\n\ntype AutoFilter struct {\n\tTopLeftCell string\n\tBottomRightCell string\n}\n\n// Add a new Row to a Sheet\nfunc (s *Sheet) AddRow() *Row {\n\trow := &Row{Sheet: s}\n\ts.Rows = append(s.Rows, row)\n\tif len(s.Rows) > s.MaxRow {\n\t\ts.MaxRow = len(s.Rows)\n\t}\n\treturn row\n}\n\n// Make sure we always have as many Cols as we do cells.\nfunc (s *Sheet) maybeAddCol(cellCount int) {\n\tif cellCount > s.MaxCol {\n\t\tcol := &Col{\n\t\t\tstyle: NewStyle(),\n\t\t\tMin: cellCount,\n\t\t\tMax: cellCount,\n\t\t\tHidden: false,\n\t\t\tCollapsed: false}\n\t\ts.Cols = append(s.Cols, col)\n\t\ts.MaxCol = cellCount\n\t}\n}\n\n// Make sure we always have as many Cols as we do cells.\nfunc (s *Sheet) Col(idx int) *Col {\n\ts.maybeAddCol(idx + 1)\n\treturn s.Cols[idx]\n}\n\n// Get a Cell by passing it's cartesian coordinates (zero based) as\n// row and column integer indexes.\n//\n// For example:\n//\n// cell := sheet.Cell(0,0)\n//\n// ... would set the variable \"cell\" to contain a Cell struct\n// containing the data from the field \"A1\" on the spreadsheet.\nfunc (sh *Sheet) Cell(row, col int) *Cell {\n\n\t// If the user requests a row beyond what we have, then extend.\n\tfor len(sh.Rows) <= row {\n\t\tsh.AddRow()\n\t}\n\n\tr := sh.Rows[row]\n\tfor len(r.Cells) <= col {\n\t\tr.AddCell()\n\t}\n\n\treturn r.Cells[col]\n}\n\n//Set the width of a single column or multiple columns.\nfunc (s *Sheet) SetColWidth(startcol, endcol int, width float64) error {\n\tif startcol > endcol {\n\t\treturn fmt.Errorf(\"Could not set width for range %d-%d: startcol must be less than endcol.\", startcol, endcol)\n\t}\n\tcol := &Col{\n\t\tstyle: NewStyle(),\n\t\tMin: startcol + 1,\n\t\tMax: endcol + 1,\n\t\tHidden: false,\n\t\tCollapsed: false,\n\t\tWidth: width}\n\ts.Cols = append(s.Cols, col)\n\tif endcol+1 > s.MaxCol {\n\t\ts.MaxCol = endcol + 1\n\t}\n\treturn nil\n}\n\n// When merging cells, the cell may be the 'original' or the 'covered'.\n// First, figure out which cells are merge starting points. Then create\n// the necessary cells underlying the merge area.\n// Then go through all the underlying cells and apply the appropriate\n// border, based on the original cell.\nfunc (s *Sheet) handleMerged() {\n\tmerged := make(map[string]*Cell)\n\n\tfor r, row := range s.Rows {\n\t\tfor c, cell := range row.Cells {\n\t\t\tif cell.HMerge > 0 || cell.VMerge > 0 {\n\t\t\t\tcoord := GetCellIDStringFromCoords(c, r)\n\t\t\t\tmerged[coord] = cell\n\t\t\t}\n\t\t}\n\t}\n\n\t// This loop iterates over all cells that should be merged and applies the correct\n\t// borders to them depending on their position. If any cells required by the merge\n\t// are missing, they will be allocated by s.Cell().\n\tfor key, cell := range merged {\n\t\tmainstyle := cell.GetStyle()\n\n\t\ttop := mainstyle.Border.Top\n\t\tleft := mainstyle.Border.Left\n\t\tright := mainstyle.Border.Right\n\t\tbottom := mainstyle.Border.Bottom\n\n\t\t// When merging cells, the upper left cell does not maintain\n\t\t// the original borders\n\t\tmainstyle.Border.Top = \"none\"\n\t\tmainstyle.Border.Left = \"none\"\n\t\tmainstyle.Border.Right = \"none\"\n\t\tmainstyle.Border.Bottom = \"none\"\n\n\t\tmaincol, mainrow, _ := GetCoordsFromCellIDString(key)\n\t\tfor rownum := 0; rownum <= cell.VMerge; rownum++ {\n\t\t\tfor colnum := 0; colnum <= cell.HMerge; colnum++ {\n\t\t\t\ttmpcell := s.Cell(mainrow+rownum, maincol+colnum)\n\t\t\t\tstyle := tmpcell.GetStyle()\n\t\t\t\tstyle.ApplyBorder = true\n\n\t\t\t\tif rownum == 0 {\n\t\t\t\t\tstyle.Border.Top = top\n\t\t\t\t}\n\n\t\t\t\tif rownum == (cell.VMerge) {\n\t\t\t\t\tstyle.Border.Bottom = bottom\n\t\t\t\t}\n\n\t\t\t\tif colnum == 0 {\n\t\t\t\t\tstyle.Border.Left = left\n\t\t\t\t}\n\n\t\t\t\tif colnum == (cell.HMerge) {\n\t\t\t\t\tstyle.Border.Right = right\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// Dump sheet to its XML representation, intended for internal use only\nfunc (s *Sheet) makeXLSXSheet(refTable *RefTable, styles *xlsxStyleSheet) *xlsxWorksheet {\n\tworksheet := newXlsxWorksheet()\n\txSheet := xlsxSheetData{}\n\tmaxRow := 0\n\tmaxCell := 0\n\tvar maxLevelCol, maxLevelRow uint8\n\n\t// Scan through the sheet and see if there are any merged cells. If there\n\t// are, we may need to extend the size of the sheet. There needs to be\n\t// phantom cells underlying the area covered by the merged cell\n\ts.handleMerged()\n\n\tfor index, sheetView := range s.SheetViews {\n\t\tif sheetView.Pane != nil {\n\t\t\tworksheet.SheetViews.SheetView[index].Pane = &xlsxPane{\n\t\t\t\tXSplit: sheetView.Pane.XSplit,\n\t\t\t\tYSplit: sheetView.Pane.YSplit,\n\t\t\t\tTopLeftCell: sheetView.Pane.TopLeftCell,\n\t\t\t\tActivePane: sheetView.Pane.ActivePane,\n\t\t\t\tState: sheetView.Pane.State,\n\t\t\t}\n\n\t\t}\n\t}\n\n\tif s.Selected {\n\t\tworksheet.SheetViews.SheetView[0].TabSelected = true\n\t}\n\n\tif s.SheetFormat.DefaultRowHeight != 0 {\n\t\tworksheet.SheetFormatPr.DefaultRowHeight = s.SheetFormat.DefaultRowHeight\n\t}\n\tworksheet.SheetFormatPr.DefaultColWidth = s.SheetFormat.DefaultColWidth\n\n\tcolsXfIdList := make([]int, len(s.Cols))\n\tworksheet.Cols = &xlsxCols{Col: []xlsxCol{}}\n\tfor c, col := range s.Cols {\n\t\tXfId := 0\n\t\tif col.Min == 0 {\n\t\t\tcol.Min = 1\n\t\t}\n\t\tif col.Max == 0 {\n\t\t\tcol.Max = 1\n\t\t}\n\t\tstyle := col.GetStyle()\n\t\t//col's style always not nil\n\t\tif style != nil {\n\t\t\txNumFmt := styles.newNumFmt(col.numFmt)\n\t\t\tXfId = handleStyleForXLSX(style, xNumFmt.NumFmtId, styles)\n\t\t}\n\t\tcolsXfIdList[c] = XfId\n\n\t\tvar customWidth bool\n\t\tif col.Width == 0 {\n\t\t\tcol.Width = ColWidth\n\t\t\tcustomWidth = false\n\n\t\t} else {\n\t\t\tcustomWidth = true\n\t\t}\n\t\tworksheet.Cols.Col = append(worksheet.Cols.Col,\n\t\t\txlsxCol{Min: col.Min,\n\t\t\t\tMax: col.Max,\n\t\t\t\tHidden: col.Hidden,\n\t\t\t\tWidth: col.Width,\n\t\t\t\tCustomWidth: customWidth,\n\t\t\t\tCollapsed: col.Collapsed,\n\t\t\t\tOutlineLevel: col.OutlineLevel,\n\t\t\t\tStyle: XfId,\n\t\t\t})\n\n\t\tif col.OutlineLevel > maxLevelCol {\n\t\t\tmaxLevelCol = col.OutlineLevel\n\t\t}\n\t}\n\n\tfor r, row := range s.Rows {\n\t\tif r > maxRow {\n\t\t\tmaxRow = r\n\t\t}\n\t\txRow := xlsxRow{}\n\t\txRow.R = r + 1\n\t\tif row.isCustom {\n\t\t\txRow.CustomHeight = true\n\t\t\txRow.Ht = fmt.Sprintf(\"%g\", row.Height)\n\t\t}\n\t\txRow.OutlineLevel = row.OutlineLevel\n\t\tif row.OutlineLevel > maxLevelRow {\n\t\t\tmaxLevelRow = row.OutlineLevel\n\t\t}\n\t\tfor c, cell := range row.Cells {\n\t\t\tXfId := colsXfIdList[c]\n\n\t\t\t// generate NumFmtId and add new NumFmt\n\t\t\txNumFmt := styles.newNumFmt(cell.NumFmt)\n\n\t\t\tstyle := cell.style\n\t\t\tif style != nil {\n\t\t\t\tXfId = handleStyleForXLSX(style, xNumFmt.NumFmtId, styles)\n\t\t\t} else if len(cell.NumFmt) > 0 && !compareFormatString(s.Cols[c].numFmt, cell.NumFmt) {\n\t\t\t\tXfId = handleNumFmtIdForXLSX(xNumFmt.NumFmtId, styles)\n\t\t\t}\n\n\t\t\tif c > maxCell {\n\t\t\t\tmaxCell = c\n\t\t\t}\n\t\t\txC := xlsxC{\n\t\t\t\tS: XfId,\n\t\t\t\tR: GetCellIDStringFromCoords(c, r),\n\t\t\t}\n\t\t\tif cell.formula != \"\" {\n\t\t\t\txC.F = &xlsxF{Content: cell.formula}\n\t\t\t}\n\t\t\tswitch cell.cellType {\n\t\t\tcase CellTypeInline:\n\t\t\t\t// Inline strings are turned into shared strings since they are more efficient.\n\t\t\t\t// This is what Excel does as well.\n\t\t\t\tfallthrough\n\t\t\tcase CellTypeString:\n\t\t\t\tif len(cell.Value) > 0 {\n\t\t\t\t\txC.V = strconv.Itoa(refTable.AddString(cell.Value))\n\t\t\t\t}\n\t\t\t\txC.T = \"s\"\n\t\t\tcase CellTypeNumeric:\n\t\t\t\t// Numeric is the default, so the type can be left blank\n\t\t\t\txC.V = cell.Value\n\t\t\tcase CellTypeBool:\n\t\t\t\txC.V = cell.Value\n\t\t\t\txC.T = \"b\"\n\t\t\tcase CellTypeError:\n\t\t\t\txC.V = cell.Value\n\t\t\t\txC.T = \"e\"\n\t\t\tcase CellTypeDate:\n\t\t\t\txC.V = cell.Value\n\t\t\t\txC.T = \"d\"\n\t\t\tcase CellTypeStringFormula:\n\t\t\t\txC.V = cell.Value\n\t\t\t\txC.T = \"str\"\n\t\t\tdefault:\n\t\t\t\tpanic(errors.New(\"unknown cell type cannot be marshaled\"))\n\t\t\t}\n\n\t\t\txRow.C = append(xRow.C, xC)\n\n\t\t\tif cell.HMerge > 0 || cell.VMerge > 0 {\n\t\t\t\t// r == rownum, c == colnum\n\t\t\t\tmc := xlsxMergeCell{}\n\t\t\t\tstart := GetCellIDStringFromCoords(c, r)\n\t\t\t\tendCol := c + cell.HMerge\n\t\t\t\tendRow := r + cell.VMerge\n\t\t\t\tend := GetCellIDStringFromCoords(endCol, endRow)\n\t\t\t\tmc.Ref = start + \":\" + end\n\t\t\t\tif worksheet.MergeCells == nil {\n\t\t\t\t\tworksheet.MergeCells = &xlsxMergeCells{}\n\t\t\t\t}\n\t\t\t\tworksheet.MergeCells.Cells = append(worksheet.MergeCells.Cells, mc)\n\t\t\t}\n\t\t}\n\t\txSheet.Row = append(xSheet.Row, xRow)\n\t}\n\n\t// Update sheet format with the freshly determined max levels\n\ts.SheetFormat.OutlineLevelCol = maxLevelCol\n\ts.SheetFormat.OutlineLevelRow = maxLevelRow\n\t// .. and then also apply this to the xml worksheet\n\tworksheet.SheetFormatPr.OutlineLevelCol = s.SheetFormat.OutlineLevelCol\n\tworksheet.SheetFormatPr.OutlineLevelRow = s.SheetFormat.OutlineLevelRow\n\n\tif worksheet.MergeCells != nil {\n\t\tworksheet.MergeCells.Count = len(worksheet.MergeCells.Cells)\n\t}\n\n\tif s.AutoFilter != nil {\n\t\tworksheet.AutoFilter = &xlsxAutoFilter{Ref: fmt.Sprintf(\"%v:%v\", s.AutoFilter.TopLeftCell, s.AutoFilter.BottomRightCell)}\n\t}\n\n\tworksheet.SheetData = xSheet\n\tdimension := xlsxDimension{}\n\tdimension.Ref = \"A1:\" + GetCellIDStringFromCoords(maxCell, maxRow)\n\tif dimension.Ref == \"A1:A1\" {\n\t\tdimension.Ref = \"A1\"\n\t}\n\tworksheet.Dimension = dimension\n\treturn worksheet\n}\n\nfunc handleStyleForXLSX(style *Style, NumFmtId int, styles *xlsxStyleSheet) (XfId int) {\n\txFont, xFill, xBorder, xCellXf := style.makeXLSXStyleElements()\n\tfontId := styles.addFont(xFont)\n\tfillId := styles.addFill(xFill)\n\n\t// HACK - adding light grey fill, as in OO and Google\n\tgreyfill := xlsxFill{}\n\tgreyfill.PatternFill.PatternType = \"lightGray\"\n\tstyles.addFill(greyfill)\n\n\tborderId := styles.addBorder(xBorder)\n\txCellXf.FontId = fontId\n\txCellXf.FillId = fillId\n\txCellXf.BorderId = borderId\n\txCellXf.NumFmtId = NumFmtId\n\t// apply the numFmtId when it is not the default cellxf\n\tif xCellXf.NumFmtId > 0 {\n\t\txCellXf.ApplyNumberFormat = true\n\t}\n\n\txCellXf.Alignment.Horizontal = style.Alignment.Horizontal\n\txCellXf.Alignment.Indent = style.Alignment.Indent\n\txCellXf.Alignment.ShrinkToFit = style.Alignment.ShrinkToFit\n\txCellXf.Alignment.TextRotation = style.Alignment.TextRotation\n\txCellXf.Alignment.Vertical = style.Alignment.Vertical\n\txCellXf.Alignment.WrapText = style.Alignment.WrapText\n\n\tXfId = styles.addCellXf(xCellXf)\n\treturn\n}\n\nfunc handleNumFmtIdForXLSX(NumFmtId int, styles *xlsxStyleSheet) (XfId int) {\n\txCellXf := makeXLSXCellElement()\n\txCellXf.NumFmtId = NumFmtId\n\tif xCellXf.NumFmtId > 0 {\n\t\txCellXf.ApplyNumberFormat = true\n\t}\n\tXfId = styles.addCellXf(xCellXf)\n\treturn\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/stream_file.go", "content": "package xlsx\n\nimport (\n\t\"archive/zip\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"io\"\n\t\"strconv\"\n)\n\ntype StreamFile struct {\n\txlsxFile *File\n\tsheetXmlPrefix []string\n\tsheetXmlSuffix []string\n\tzipWriter *zip.Writer\n\tcurrentSheet *streamSheet\n\tstyleIds [][]int\n\terr error\n}\n\ntype streamSheet struct {\n\t// sheetIndex is the XLSX sheet index, which starts at 1\n\tindex int\n\t// The number of rows that have been written to the sheet so far\n\trowCount int\n\t// The number of columns in the sheet\n\tcolumnCount int\n\t// The writer to write to this sheet's file in the XLSX Zip file\n\twriter io.Writer\n\tstyleIds []int\n}\n\nvar (\n\tNoCurrentSheetError = errors.New(\"no Current Sheet\")\n\tWrongNumberOfRowsError = errors.New(\"invalid number of cells passed to Write. All calls to Write on the same sheet must have the same number of cells\")\n\tAlreadyOnLastSheetError = errors.New(\"NextSheet() called, but already on last sheet\")\n)\n\n// Write will write a row of cells to the current sheet. Every call to Write on the same sheet must contain the\n// same number of cells as the header provided when the sheet was created or an error will be returned. This function\n// will always trigger a flush on success. Currently the only supported data type is string data.\nfunc (sf *StreamFile) Write(cells []string) error {\n\tif sf.err != nil {\n\t\treturn sf.err\n\t}\n\terr := sf.write(cells)\n\tif err != nil {\n\t\tsf.err = err\n\t\treturn err\n\t}\n\treturn sf.zipWriter.Flush()\n}\n\nfunc (sf *StreamFile) WriteAll(records [][]string) error {\n\tif sf.err != nil {\n\t\treturn sf.err\n\t}\n\tfor _, row := range records {\n\t\terr := sf.write(row)\n\t\tif err != nil {\n\t\t\tsf.err = err\n\t\t\treturn err\n\t\t}\n\t}\n\treturn sf.zipWriter.Flush()\n}\n\nfunc (sf *StreamFile) write(cells []string) error {\n\tif sf.currentSheet == nil {\n\t\treturn NoCurrentSheetError\n\t}\n\tif len(cells) != sf.currentSheet.columnCount {\n\t\treturn WrongNumberOfRowsError\n\t}\n\tsf.currentSheet.rowCount++\n\tif err := sf.currentSheet.write(``); err != nil {\n\t\treturn err\n\t}\n\tfor colIndex, cellData := range cells {\n\t\t// documentation for the c.t (cell.Type) attribute:\n\t\t// b (Boolean): Cell containing a boolean.\n\t\t// d (Date): Cell contains a date in the ISO 8601 format.\n\t\t// e (Error): Cell containing an error.\n\t\t// inlineStr (Inline String): Cell containing an (inline) rich string, i.e., one not in the shared string table.\n\t\t// If this cell type is used, then the cell value is in the is element rather than the v element in the cell (c element).\n\t\t// n (Number): Cell containing a number.\n\t\t// s (Shared String): Cell containing a shared string.\n\t\t// str (String): Cell containing a formula string.\n\t\tcellCoordinate := GetCellIDStringFromCoords(colIndex, sf.currentSheet.rowCount-1)\n\t\tcellType := \"inlineStr\"\n\t\tcellOpen := ``\n\t\tcellClose := ``\n\n\t\tif err := sf.currentSheet.write(cellOpen); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err := xml.EscapeText(sf.currentSheet.writer, []byte(cellData)); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err := sf.currentSheet.write(cellClose); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tif err := sf.currentSheet.write(``); err != nil {\n\t\treturn err\n\t}\n\treturn sf.zipWriter.Flush()\n}\n\n// Error reports any error that has occurred during a previous Write or Flush.\nfunc (sf *StreamFile) Error() error {\n\treturn sf.err\n}\n\nfunc (sf *StreamFile) Flush() {\n\tif sf.err != nil {\n\t\tsf.err = sf.zipWriter.Flush()\n\t}\n}\n\n// NextSheet will switch to the next sheet. Sheets are selected in the same order they were added.\n// Once you leave a sheet, you cannot return to it.\nfunc (sf *StreamFile) NextSheet() error {\n\tif sf.err != nil {\n\t\treturn sf.err\n\t}\n\tvar sheetIndex int\n\tif sf.currentSheet != nil {\n\t\tif sf.currentSheet.index >= len(sf.xlsxFile.Sheets) {\n\t\t\tsf.err = AlreadyOnLastSheetError\n\t\t\treturn AlreadyOnLastSheetError\n\t\t}\n\t\tif err := sf.writeSheetEnd(); err != nil {\n\t\t\tsf.currentSheet = nil\n\t\t\tsf.err = err\n\t\t\treturn err\n\t\t}\n\t\tsheetIndex = sf.currentSheet.index\n\t}\n\tsheetIndex++\n\tsf.currentSheet = &streamSheet{\n\t\tindex: sheetIndex,\n\t\tcolumnCount: len(sf.xlsxFile.Sheets[sheetIndex-1].Cols),\n\t\tstyleIds: sf.styleIds[sheetIndex-1],\n\t\trowCount: 1,\n\t}\n\tsheetPath := sheetFilePathPrefix + strconv.Itoa(sf.currentSheet.index) + sheetFilePathSuffix\n\tfileWriter, err := sf.zipWriter.Create(sheetPath)\n\tif err != nil {\n\t\tsf.err = err\n\t\treturn err\n\t}\n\tsf.currentSheet.writer = fileWriter\n\n\tif err := sf.writeSheetStart(); err != nil {\n\t\tsf.err = err\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// Close closes the Stream File.\n// Any sheets that have not yet been written to will have an empty sheet created for them.\nfunc (sf *StreamFile) Close() error {\n\tif sf.err != nil {\n\t\treturn sf.err\n\t}\n\t// If there are sheets that have not been written yet, call NextSheet() which will add files to the zip for them.\n\t// XLSX readers may error if the sheets registered in the metadata are not present in the file.\n\tif sf.currentSheet != nil {\n\t\tfor sf.currentSheet.index < len(sf.xlsxFile.Sheets) {\n\t\t\tif err := sf.NextSheet(); err != nil {\n\t\t\t\tsf.err = err\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\t// Write the end of the last sheet.\n\t\tif err := sf.writeSheetEnd(); err != nil {\n\t\t\tsf.err = err\n\t\t\treturn err\n\t\t}\n\t}\n\terr := sf.zipWriter.Close()\n\tif err != nil {\n\t\tsf.err = err\n\t}\n\treturn err\n}\n\n// writeSheetStart will write the start of the Sheet's XML\nfunc (sf *StreamFile) writeSheetStart() error {\n\tif sf.currentSheet == nil {\n\t\treturn NoCurrentSheetError\n\t}\n\treturn sf.currentSheet.write(sf.sheetXmlPrefix[sf.currentSheet.index-1])\n}\n\n// writeSheetEnd will write the end of the Sheet's XML\nfunc (sf *StreamFile) writeSheetEnd() error {\n\tif sf.currentSheet == nil {\n\t\treturn NoCurrentSheetError\n\t}\n\tif err := sf.currentSheet.write(endSheetDataTag); err != nil {\n\t\treturn err\n\t}\n\treturn sf.currentSheet.write(sf.sheetXmlSuffix[sf.currentSheet.index-1])\n}\n\nfunc (ss *streamSheet) write(data string) error {\n\t_, err := ss.writer.Write([]byte(data))\n\treturn err\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/stream_file_builder.go", "content": "// Authors: Ryan Hollis (ryanh@)\n\n// The purpose of StreamFileBuilder and StreamFile is to allow streamed writing of XLSX files.\n// Directions:\n// 1. Create a StreamFileBuilder with NewStreamFileBuilder() or NewStreamFileBuilderForPath().\n// 2. Add the sheets and their first row of data by calling AddSheet().\n// 3. Call Build() to get a StreamFile. Once built, all functions on the builder will return an error.\n// 4. Write to the StreamFile with Write(). Writes begin on the first sheet. New rows are always written and flushed\n// to the io. All rows written to the same sheet must have the same number of cells as the header provided when the sheet\n// was created or an error will be returned.\n// 5. Call NextSheet() to proceed to the next sheet. Once NextSheet() is called, the previous sheet can not be edited.\n// 6. Call Close() to finish.\n\n// Future work suggestions:\n// Currently the only supported cell type is string, since the main reason this library was written was to prevent\n// strings from being interpreted as numbers. It would be nice to have support for numbers and money so that the exported\n// files could better take advantage of XLSX's features.\n// All text is written with the same text style. Support for additional text styles could be added to highlight certain\n// data in the file.\n// The current default style uses fonts that are not on Macs by default so opening the XLSX files in Numbers causes a\n// pop up that says there are missing fonts. The font could be changed to something that is usually found on Mac and PC.\n\npackage xlsx\n\nimport (\n\t\"archive/zip\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n)\n\ntype StreamFileBuilder struct {\n\tbuilt bool\n\txlsxFile *File\n\tzipWriter *zip.Writer\n\tcellTypeToStyleIds map[CellType]int\n\tmaxStyleId int\n\tstyleIds [][]int\n}\n\nconst (\n\tsheetFilePathPrefix = \"xl/worksheets/sheet\"\n\tsheetFilePathSuffix = \".xml\"\n\tendSheetDataTag = \"\"\n\tdimensionTag = ``\n\t// This is the index of the max style that this library will insert into XLSX sheets by default.\n\t// This allows us to predict what the style id of styles that we add will be.\n\t// TestXlsxStyleBehavior tests that this behavior continues to be what we expect.\n\tinitMaxStyleId = 1\n)\n\nvar BuiltStreamFileBuilderError = errors.New(\"StreamFileBuilder has already been built, functions may no longer be used\")\n\n// NewStreamFileBuilder creates an StreamFileBuilder that will write to the the provided io.writer\nfunc NewStreamFileBuilder(writer io.Writer) *StreamFileBuilder {\n\treturn &StreamFileBuilder{\n\t\tzipWriter: zip.NewWriter(writer),\n\t\txlsxFile: NewFile(),\n\t\tcellTypeToStyleIds: make(map[CellType]int),\n\t\tmaxStyleId: initMaxStyleId,\n\t}\n}\n\n// NewStreamFileBuilderForPath takes the name of an XLSX file and returns a builder for it.\n// The file will be created if it does not exist, or truncated if it does.\nfunc NewStreamFileBuilderForPath(path string) (*StreamFileBuilder, error) {\n\tfile, err := os.Create(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn NewStreamFileBuilder(file), nil\n}\n\n// AddSheet will add sheets with the given name with the provided headers. The headers cannot be edited later, and all\n// rows written to the sheet must contain the same number of cells as the header. Sheet names must be unique, or an\n// error will be thrown.\nfunc (sb *StreamFileBuilder) AddSheet(name string, headers []string, cellTypes []*CellType) error {\n\tif sb.built {\n\t\treturn BuiltStreamFileBuilderError\n\t}\n\tif len(cellTypes) > len(headers) {\n\t\treturn errors.New(\"cellTypes is longer than headers\")\n\t}\n\tsheet, err := sb.xlsxFile.AddSheet(name)\n\tif err != nil {\n\t\t// Set built on error so that all subsequent calls to the builder will also fail.\n\t\tsb.built = true\n\t\treturn err\n\t}\n\tsb.styleIds = append(sb.styleIds, []int{})\n\trow := sheet.AddRow()\n\tif count := row.WriteSlice(&headers, -1); count != len(headers) {\n\t\t// Set built on error so that all subsequent calls to the builder will also fail.\n\t\tsb.built = true\n\t\treturn errors.New(\"failed to write headers\")\n\t}\n\tfor i, cellType := range cellTypes {\n\t\tvar cellStyleIndex int\n\t\tvar ok bool\n\t\tif cellType != nil {\n\t\t\t// The cell type is one of the attributes of a Style.\n\t\t\t// Since it is the only attribute of Style that we use, we can assume that cell types\n\t\t\t// map one to one with Styles and their Style ID.\n\t\t\t// If a new cell type is used, a new style gets created with an increased id, if an existing cell type is\n\t\t\t// used, the pre-existing style will also be used.\n\t\t\tcellStyleIndex, ok = sb.cellTypeToStyleIds[*cellType]\n\t\t\tif !ok {\n\t\t\t\tsb.maxStyleId++\n\t\t\t\tcellStyleIndex = sb.maxStyleId\n\t\t\t\tsb.cellTypeToStyleIds[*cellType] = sb.maxStyleId\n\t\t\t}\n\t\t\tsheet.Cols[i].SetType(*cellType)\n\t\t}\n\t\tsb.styleIds[len(sb.styleIds)-1] = append(sb.styleIds[len(sb.styleIds)-1], cellStyleIndex)\n\t}\n\treturn nil\n}\n\n// Build begins streaming the XLSX file to the io, by writing all the XLSX metadata. It creates a StreamFile struct\n// that can be used to write the rows to the sheets.\nfunc (sb *StreamFileBuilder) Build() (*StreamFile, error) {\n\tif sb.built {\n\t\treturn nil, BuiltStreamFileBuilderError\n\t}\n\tsb.built = true\n\tparts, err := sb.xlsxFile.MarshallParts()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tes := &StreamFile{\n\t\tzipWriter: sb.zipWriter,\n\t\txlsxFile: sb.xlsxFile,\n\t\tsheetXmlPrefix: make([]string, len(sb.xlsxFile.Sheets)),\n\t\tsheetXmlSuffix: make([]string, len(sb.xlsxFile.Sheets)),\n\t\tstyleIds: sb.styleIds,\n\t}\n\tfor path, data := range parts {\n\t\t// If the part is a sheet, don't write it yet. We only want to write the XLSX metadata files, since at this\n\t\t// point the sheets are still empty. The sheet files will be written later as their rows come in.\n\t\tif strings.HasPrefix(path, sheetFilePathPrefix) {\n\t\t\tif err := sb.processEmptySheetXML(es, path, data); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmetadataFile, err := sb.zipWriter.Create(path)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\t_, err = metadataFile.Write([]byte(data))\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tif err := es.NextSheet(); err != nil {\n\t\treturn nil, err\n\t}\n\treturn es, nil\n}\n\n// processEmptySheetXML will take in the path and XML data of an empty sheet, and will save the beginning and end of the\n// XML file so that these can be written at the right time.\nfunc (sb *StreamFileBuilder) processEmptySheetXML(sf *StreamFile, path, data string) error {\n\t// Get the sheet index from the path\n\tsheetIndex, err := getSheetIndex(sf, path)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Remove the Dimension tag. Since more rows are going to be written to the sheet, it will be wrong.\n\t// It is valid to for a sheet to be missing a Dimension tag, but it is not valid for it to be wrong.\n\tdata, err = removeDimensionTag(data, sf.xlsxFile.Sheets[sheetIndex])\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Split the sheet at the end of its SheetData tag so that more rows can be added inside.\n\tprefix, suffix, err := splitSheetIntoPrefixAndSuffix(data)\n\tif err != nil {\n\t\treturn err\n\t}\n\tsf.sheetXmlPrefix[sheetIndex] = prefix\n\tsf.sheetXmlSuffix[sheetIndex] = suffix\n\treturn nil\n}\n\n// getSheetIndex parses the path to the XLSX sheet data and returns the index\n// The files that store the data for each sheet must have the format:\n// xl/worksheets/sheet123.xml\n// where 123 is the index of the sheet. This file path format is part of the XLSX file standard.\nfunc getSheetIndex(sf *StreamFile, path string) (int, error) {\n\tindexString := path[len(sheetFilePathPrefix) : len(path)-len(sheetFilePathSuffix)]\n\tsheetXLSXIndex, err := strconv.Atoi(indexString)\n\tif err != nil {\n\t\treturn -1, errors.New(\"Unexpected sheet file name from xlsx package\")\n\t}\n\tif sheetXLSXIndex < 1 || len(sf.sheetXmlPrefix) < sheetXLSXIndex ||\n\t\tlen(sf.sheetXmlSuffix) < sheetXLSXIndex || len(sf.xlsxFile.Sheets) < sheetXLSXIndex {\n\t\treturn -1, errors.New(\"Unexpected sheet index\")\n\t}\n\tsheetArrayIndex := sheetXLSXIndex - 1\n\treturn sheetArrayIndex, nil\n}\n\n// removeDimensionTag will return the passed in XLSX Spreadsheet XML with the dimension tag removed.\n// data is the XML data for the sheet\n// sheet is the Sheet struct that the XML was created from.\n// Can return an error if the XML's dimension tag does not match was is expected based on the provided Sheet\nfunc removeDimensionTag(data string, sheet *Sheet) (string, error) {\n\tx := len(sheet.Cols) - 1\n\ty := len(sheet.Rows) - 1\n\tif x < 0 {\n\t\tx = 0\n\t}\n\tif y < 0 {\n\t\ty = 0\n\t}\n\tvar dimensionRef string\n\tif x == 0 && y == 0 {\n\t\tdimensionRef = \"A1\"\n\t} else {\n\t\tendCoordinate := GetCellIDStringFromCoords(x, y)\n\t\tdimensionRef = \"A1:\" + endCoordinate\n\t}\n\tdataParts := strings.Split(data, fmt.Sprintf(dimensionTag, dimensionRef))\n\tif len(dataParts) != 2 {\n\t\treturn \"\", errors.New(\"unexpected Sheet XML: dimension tag not found\")\n\t}\n\treturn dataParts[0] + dataParts[1], nil\n}\n\n// splitSheetIntoPrefixAndSuffix will split the provided XML sheet into a prefix and a suffix so that\n// more spreadsheet rows can be inserted in between.\nfunc splitSheetIntoPrefixAndSuffix(data string) (string, string, error) {\n\t// Split the sheet at the end of its SheetData tag so that more rows can be added inside.\n\tsheetParts := strings.Split(data, endSheetDataTag)\n\tif len(sheetParts) != 2 {\n\t\treturn \"\", \"\", errors.New(\"unexpected Sheet XML: SheetData close tag not found\")\n\t}\n\treturn sheetParts[0], sheetParts[1], nil\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/style.go", "content": "package xlsx\n\nimport \"strconv\"\n\n// Style is a high level structure intended to provide user access to\n// the contents of Style within an XLSX file.\ntype Style struct {\n\tBorder Border\n\tFill Fill\n\tFont Font\n\tApplyBorder bool\n\tApplyFill bool\n\tApplyFont bool\n\tApplyAlignment bool\n\tAlignment Alignment\n\tNamedStyleIndex *int\n}\n\n// Return a new Style structure initialised with the default values.\nfunc NewStyle() *Style {\n\treturn &Style{\n\t\tAlignment: *DefaultAlignment(),\n\t\tBorder: *DefaultBorder(),\n\t\tFill: *DefaultFill(),\n\t\tFont: *DefaultFont(),\n\t}\n}\n\n// Generate the underlying XLSX style elements that correspond to the Style.\nfunc (style *Style) makeXLSXStyleElements() (xFont xlsxFont, xFill xlsxFill, xBorder xlsxBorder, xCellXf xlsxXf) {\n\txFont = xlsxFont{}\n\txFill = xlsxFill{}\n\txBorder = xlsxBorder{}\n\txCellXf = xlsxXf{}\n\txFont.Sz.Val = strconv.Itoa(style.Font.Size)\n\txFont.Name.Val = style.Font.Name\n\txFont.Family.Val = strconv.Itoa(style.Font.Family)\n\txFont.Charset.Val = strconv.Itoa(style.Font.Charset)\n\txFont.Color.RGB = style.Font.Color\n\tif style.Font.Bold {\n\t\txFont.B = &xlsxVal{}\n\t} else {\n\t\txFont.B = nil\n\t}\n\tif style.Font.Italic {\n\t\txFont.I = &xlsxVal{}\n\t} else {\n\t\txFont.I = nil\n\t}\n\tif style.Font.Underline {\n\t\txFont.U = &xlsxVal{}\n\t} else {\n\t\txFont.U = nil\n\t}\n\txPatternFill := xlsxPatternFill{}\n\txPatternFill.PatternType = style.Fill.PatternType\n\txPatternFill.FgColor.RGB = style.Fill.FgColor\n\txPatternFill.BgColor.RGB = style.Fill.BgColor\n\txFill.PatternFill = xPatternFill\n\txBorder.Left = xlsxLine{\n\t\tStyle: style.Border.Left,\n\t\tColor: xlsxColor{RGB: style.Border.LeftColor},\n\t}\n\txBorder.Right = xlsxLine{\n\t\tStyle: style.Border.Right,\n\t\tColor: xlsxColor{RGB: style.Border.RightColor},\n\t}\n\txBorder.Top = xlsxLine{\n\t\tStyle: style.Border.Top,\n\t\tColor: xlsxColor{RGB: style.Border.TopColor},\n\t}\n\txBorder.Bottom = xlsxLine{\n\t\tStyle: style.Border.Bottom,\n\t\tColor: xlsxColor{RGB: style.Border.BottomColor},\n\t}\n\txCellXf = makeXLSXCellElement()\n\txCellXf.ApplyBorder = style.ApplyBorder\n\txCellXf.ApplyFill = style.ApplyFill\n\txCellXf.ApplyFont = style.ApplyFont\n\txCellXf.ApplyAlignment = style.ApplyAlignment\n\tif style.NamedStyleIndex != nil {\n\t\txCellXf.XfId = style.NamedStyleIndex\n\t}\n\treturn\n}\n\nfunc makeXLSXCellElement() (xCellXf xlsxXf) {\n\txCellXf.NumFmtId = 0\n\treturn\n}\n\n// Border is a high level structure intended to provide user access to\n// the contents of Border Style within an Sheet.\ntype Border struct {\n\tLeft string\n\tLeftColor string\n\tRight string\n\tRightColor string\n\tTop string\n\tTopColor string\n\tBottom string\n\tBottomColor string\n}\n\nfunc NewBorder(left, right, top, bottom string) *Border {\n\treturn &Border{\n\t\tLeft: left,\n\t\tRight: right,\n\t\tTop: top,\n\t\tBottom: bottom,\n\t}\n}\n\n// Fill is a high level structure intended to provide user access to\n// the contents of background and foreground color index within an Sheet.\ntype Fill struct {\n\tPatternType string\n\tBgColor string\n\tFgColor string\n}\n\nfunc NewFill(patternType, fgColor, bgColor string) *Fill {\n\treturn &Fill{\n\t\tPatternType: patternType,\n\t\tFgColor: fgColor,\n\t\tBgColor: bgColor,\n\t}\n}\n\ntype Font struct {\n\tSize int\n\tName string\n\tFamily int\n\tCharset int\n\tColor string\n\tBold bool\n\tItalic bool\n\tUnderline bool\n}\n\nfunc NewFont(size int, name string) *Font {\n\treturn &Font{Size: size, Name: name}\n}\n\ntype Alignment struct {\n\tHorizontal string\n\tIndent int\n\tShrinkToFit bool\n\tTextRotation int\n\tVertical string\n\tWrapText bool\n}\n\nvar defaultFontSize = 12\nvar defaultFontName = \"Verdana\"\n\nfunc SetDefaultFont(size int, name string) {\n\tdefaultFontSize = size\n\tdefaultFontName = name\n}\n\nfunc DefaultFont() *Font {\n\treturn NewFont(defaultFontSize, defaultFontName)\n}\n\nfunc DefaultFill() *Fill {\n\treturn NewFill(\"none\", \"FFFFFFFF\", \"00000000\")\n\n}\n\nfunc DefaultBorder() *Border {\n\treturn NewBorder(\"none\", \"none\", \"none\", \"none\")\n}\n\nfunc DefaultAlignment() *Alignment {\n\treturn &Alignment{\n\t\tHorizontal: \"general\",\n\t\tVertical: \"bottom\",\n\t}\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/templates.go", "content": "// This file contains default templates for XML files we don't yet\n// populated based on content.\n\npackage xlsx\n\nconst TEMPLATE__RELS_DOT_RELS = `\n\n \n \n \n`\n\nconst TEMPLATE_DOCPROPS_APP = `\n\n 0\n Go XLSX\n`\n\nconst TEMPLATE_DOCPROPS_CORE = `\n`\n\nconst TEMPLATE_XL_THEME_THEME = `\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n`\n" }, { "path": "vendor/github.com/tealeg/xlsx/theme.go", "content": "package xlsx\n\nimport (\n\t\"fmt\"\n\t\"strconv\"\n)\n\ntype theme struct {\n\tcolors []string\n}\n\nfunc newTheme(themeXml xlsxTheme) *theme {\n\tclrMap := map[string]string{}\n\tclrSchemes := themeXml.ThemeElements.ClrScheme.Children\n\tfor _, scheme := range clrSchemes {\n\t\tvar rgbColor string\n\t\tif scheme.SysClr != nil {\n\t\t\trgbColor = scheme.SysClr.LastClr\n\t\t} else {\n\t\t\trgbColor = scheme.SrgbClr.Val\n\t\t}\n\t\tclrMap[scheme.XMLName.Local] = rgbColor\n\t}\n\tcolors := []string{clrMap[\"lt1\"], clrMap[\"dk1\"], clrMap[\"lt2\"], clrMap[\"dk2\"], clrMap[\"accent1\"],\n\t\tclrMap[\"accent2\"], clrMap[\"accent3\"], clrMap[\"accent4\"], clrMap[\"accent5\"],\n\t\tclrMap[\"accent6\"], clrMap[\"hlink\"], clrMap[\"folHlink\"]}\n\treturn &theme{colors}\n}\n\nfunc (t *theme) themeColor(index int64, tint float64) string {\n\tbaseColor := t.colors[index]\n\tif tint == 0 {\n\t\treturn \"FF\" + baseColor\n\t} else {\n\t\tr, _ := strconv.ParseInt(baseColor[0:2], 16, 64)\n\t\tg, _ := strconv.ParseInt(baseColor[2:4], 16, 64)\n\t\tb, _ := strconv.ParseInt(baseColor[4:6], 16, 64)\n\t\th, s, l := RGBToHSL(uint8(r), uint8(g), uint8(b))\n\t\tif tint < 0 {\n\t\t\tl *= (1 + tint)\n\t\t} else {\n\t\t\tl = l*(1-tint) + (1 - (1 - tint))\n\t\t}\n\t\tbr, bg, bb := HSLToRGB(h, s, l)\n\t\treturn fmt.Sprintf(\"FF%02X%02X%02X\", br, bg, bb)\n\t}\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/write.go", "content": "package xlsx\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"time\"\n)\n\n// Writes an array to row r. Accepts a pointer to array type 'e',\n// and writes the number of columns to write, 'cols'. If 'cols' is < 0,\n// the entire array will be written if possible. Returns -1 if the 'e'\n// doesn't point to an array, otherwise the number of columns written.\nfunc (r *Row) WriteSlice(e interface{}, cols int) int {\n\tif cols == 0 {\n\t\treturn cols\n\t}\n\n\t// make sure 'e' is a Ptr to Slice\n\tv := reflect.ValueOf(e)\n\tif v.Kind() != reflect.Ptr {\n\t\treturn -1\n\t}\n\n\tv = v.Elem()\n\tif v.Kind() != reflect.Slice {\n\t\treturn -1\n\t}\n\n\t// it's a slice, so open up its values\n\tn := v.Len()\n\tif cols < n && cols > 0 {\n\t\tn = cols\n\t}\n\n\tvar setCell func(reflect.Value)\n\tsetCell = func(val reflect.Value) {\n\t\tswitch t := val.Interface().(type) {\n\t\tcase time.Time:\n\t\t\tcell := r.AddCell()\n\t\t\tcell.SetValue(t)\n\t\tcase fmt.Stringer: // check Stringer first\n\t\t\tcell := r.AddCell()\n\t\t\tcell.SetString(t.String())\n\t\tdefault:\n\t\t\tswitch val.Kind() { // underlying type of slice\n\t\t\tcase reflect.String, reflect.Int, reflect.Int8,\n\t\t\t\treflect.Int16, reflect.Int32, reflect.Int64, reflect.Float64, reflect.Float32:\n\t\t\t\tcell := r.AddCell()\n\t\t\t\tcell.SetValue(val.Interface())\n\t\t\tcase reflect.Bool:\n\t\t\t\tcell := r.AddCell()\n\t\t\t\tcell.SetBool(t.(bool))\n\t\t\tcase reflect.Interface:\n\t\t\t\tsetCell(reflect.ValueOf(t))\n\t\t\t}\n\t\t}\n\t}\n\n\tvar i int\n\tfor i = 0; i < n; i++ {\n\t\tsetCell(v.Index(i))\n\t}\n\treturn i\n}\n\n// Writes a struct to row r. Accepts a pointer to struct type 'e',\n// and the number of columns to write, `cols`. If 'cols' is < 0,\n// the entire struct will be written if possible. Returns -1 if the 'e'\n// doesn't point to a struct, otherwise the number of columns written\nfunc (r *Row) WriteStruct(e interface{}, cols int) int {\n\tif cols == 0 {\n\t\treturn cols\n\t}\n\n\tv := reflect.ValueOf(e).Elem()\n\tif v.Kind() != reflect.Struct {\n\t\treturn -1 // bail if it's not a struct\n\t}\n\n\tn := v.NumField() // number of fields in struct\n\tif cols < n && cols > 0 {\n\t\tn = cols\n\t}\n\n\tvar k int\n\tfor i := 0; i < n; i, k = i+1, k+1 {\n\t\tf := v.Field(i)\n\n\t\tswitch t := f.Interface().(type) {\n\t\tcase time.Time:\n\t\t\tcell := r.AddCell()\n\t\t\tcell.SetValue(t)\n\t\tcase fmt.Stringer: // check Stringer first\n\t\t\tcell := r.AddCell()\n\t\t\tcell.SetString(t.String())\n\t\tdefault:\n\t\t\tswitch f.Kind() {\n\t\t\tcase reflect.String, reflect.Int, reflect.Int8,\n\t\t\t\treflect.Int16, reflect.Int32, reflect.Int64, reflect.Float64, reflect.Float32:\n\t\t\t\tcell := r.AddCell()\n\t\t\t\tcell.SetValue(f.Interface())\n\t\t\tcase reflect.Bool:\n\t\t\t\tcell := r.AddCell()\n\t\t\t\tcell.SetBool(t.(bool))\n\t\t\tdefault:\n\t\t\t\tk-- // nothing set so reset to previous\n\t\t\t}\n\t\t}\n\t}\n\n\treturn k\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlContentTypes.go", "content": "package xlsx\n\nimport (\n\t\"encoding/xml\"\n)\n\ntype xlsxTypes struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/package/2006/content-types Types\"`\n\n\tOverrides []xlsxOverride `xml:\"Override\"`\n\tDefaults []xlsxDefault `xml:\"Default\"`\n}\n\ntype xlsxOverride struct {\n\tPartName string `xml:\",attr\"`\n\tContentType string `xml:\",attr\"`\n}\n\ntype xlsxDefault struct {\n\tExtension string `xml:\",attr\"`\n\tContentType string `xml:\",attr\"`\n}\n\nfunc MakeDefaultContentTypes() (types xlsxTypes) {\n\ttypes.Overrides = make([]xlsxOverride, 8)\n\ttypes.Defaults = make([]xlsxDefault, 2)\n\n\ttypes.Overrides[0].PartName = \"/_rels/.rels\"\n\ttypes.Overrides[0].ContentType = \"application/vnd.openxmlformats-package.relationships+xml\"\n\ttypes.Overrides[1].PartName = \"/docProps/app.xml\"\n\ttypes.Overrides[1].ContentType = \"application/vnd.openxmlformats-officedocument.extended-properties+xml\"\n\ttypes.Overrides[2].PartName = \"/docProps/core.xml\"\n\ttypes.Overrides[2].ContentType = \"application/vnd.openxmlformats-package.core-properties+xml\"\n\ttypes.Overrides[3].PartName = \"/xl/_rels/workbook.xml.rels\"\n\ttypes.Overrides[3].ContentType = \"application/vnd.openxmlformats-package.relationships+xml\"\n\ttypes.Overrides[4].PartName = \"/xl/sharedStrings.xml\"\n\ttypes.Overrides[4].ContentType = \"application/vnd.openxmlformats-officedocument.spreadsheetml.sharedStrings+xml\"\n\ttypes.Overrides[5].PartName = \"/xl/styles.xml\"\n\ttypes.Overrides[5].ContentType = \"application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml\"\n\ttypes.Overrides[6].PartName = \"/xl/workbook.xml\"\n\ttypes.Overrides[6].ContentType = \"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml\"\n\ttypes.Overrides[7].PartName = \"/xl/theme/theme1.xml\"\n\ttypes.Overrides[7].ContentType = \"application/vnd.openxmlformats-officedocument.theme+xml\"\n\n\ttypes.Defaults[0].Extension = \"rels\"\n\ttypes.Defaults[0].ContentType = \"application/vnd.openxmlformats-package.relationships+xml\"\n\ttypes.Defaults[1].Extension = \"xml\"\n\ttypes.Defaults[1].ContentType = \"application/xml\"\n\treturn\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlSharedStrings.go", "content": "package xlsx\n\nimport (\n\t\"encoding/xml\"\n)\n\n// xlsxSST directly maps the sst element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main currently\n// I have not checked this for completeness - it does as much as I need.\ntype xlsxSST struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main sst\"`\n\tCount int `xml:\"count,attr\"`\n\tUniqueCount int `xml:\"uniqueCount,attr\"`\n\tSI []xlsxSI `xml:\"si\"`\n}\n\n// xlsxSI directly maps the si element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked this for completeness - it does as\n// much as I need.\ntype xlsxSI struct {\n\tT string `xml:\"t\"`\n\tR []xlsxR `xml:\"r\"`\n}\n\n// xlsxR directly maps the r element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked this for completeness - it does as\n// much as I need.\ntype xlsxR struct {\n\tT string `xml:\"t\"`\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlStyle.go", "content": "// xslx is a package designed to help with reading data from\n// spreadsheets stored in the XLSX format used in recent versions of\n// Microsoft's Excel spreadsheet.\n//\n// For a concise example of how to use this library why not check out\n// the source for xlsx2csv here: https://github.com/tealeg/xlsx2csv\n\npackage xlsx\n\nimport (\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"strconv\"\n\t\"sync\"\n)\n\n// Excel styles can reference number formats that are built-in, all of which\n// have an id less than 164.\nconst builtinNumFmtsCount = 163\n\n// Excel styles can reference number formats that are built-in, all of which\n// have an id less than 164. This is a possibly incomplete list comprised of as\n// many of them as I could find.\nvar builtInNumFmt = map[int]string{\n\t0: \"general\",\n\t1: \"0\",\n\t2: \"0.00\",\n\t3: \"#,##0\",\n\t4: \"#,##0.00\",\n\t9: \"0%\",\n\t10: \"0.00%\",\n\t11: \"0.00e+00\",\n\t12: \"# ?/?\",\n\t13: \"# ??/??\",\n\t14: \"mm-dd-yy\",\n\t15: \"d-mmm-yy\",\n\t16: \"d-mmm\",\n\t17: \"mmm-yy\",\n\t18: \"h:mm am/pm\",\n\t19: \"h:mm:ss am/pm\",\n\t20: \"h:mm\",\n\t21: \"h:mm:ss\",\n\t22: \"m/d/yy h:mm\",\n\t37: \"#,##0 ;(#,##0)\",\n\t38: \"#,##0 ;[red](#,##0)\",\n\t39: \"#,##0.00;(#,##0.00)\",\n\t40: \"#,##0.00;[red](#,##0.00)\",\n\t41: `_(* #,##0_);_(* \\(#,##0\\);_(* \"-\"_);_(@_)`,\n\t42: `_(\"$\"* #,##0_);_(\"$* \\(#,##0\\);_(\"$\"* \"-\"_);_(@_)`,\n\t43: `_(* #,##0.00_);_(* \\(#,##0.00\\);_(* \"-\"??_);_(@_)`,\n\t44: `_(\"$\"* #,##0.00_);_(\"$\"* \\(#,##0.00\\);_(\"$\"* \"-\"??_);_(@_)`,\n\t45: \"mm:ss\",\n\t46: \"[h]:mm:ss\",\n\t47: \"mmss.0\",\n\t48: \"##0.0e+0\",\n\t49: \"@\",\n}\n\n// These are the color annotations from number format codes that contain color names.\n// Also possible are [color1] through [color56]\nvar numFmtColorCodes = []string{\n\t\"[red]\",\n\t\"[black]\",\n\t\"[green]\",\n\t\"[white]\",\n\t\"[blue]\",\n\t\"[magenta]\",\n\t\"[yellow]\",\n\t\"[cyan]\",\n}\n\nvar builtInNumFmtInv = make(map[string]int, 40)\n\nfunc init() {\n\tfor k, v := range builtInNumFmt {\n\t\tbuiltInNumFmtInv[v] = k\n\t}\n}\n\nconst (\n\tbuiltInNumFmtIndex_GENERAL = int(0)\n\tbuiltInNumFmtIndex_INT = int(1)\n\tbuiltInNumFmtIndex_FLOAT = int(2)\n\tbuiltInNumFmtIndex_DATE = int(14)\n\tbuiltInNumFmtIndex_STRING = int(49)\n)\n\n// xlsxStyle directly maps the styleSheet element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxStyleSheet struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main styleSheet\"`\n\n\tFonts xlsxFonts `xml:\"fonts,omitempty\"`\n\tFills xlsxFills `xml:\"fills,omitempty\"`\n\tBorders xlsxBorders `xml:\"borders,omitempty\"`\n\tCellStyles *xlsxCellStyles `xml:\"cellStyles,omitempty\"`\n\tCellStyleXfs *xlsxCellStyleXfs `xml:\"cellStyleXfs,omitempty\"`\n\tCellXfs xlsxCellXfs `xml:\"cellXfs,omitempty\"`\n\tNumFmts xlsxNumFmts `xml:\"numFmts,omitempty\"`\n\n\ttheme *theme\n\n\tsync.RWMutex // protects the following\n\tstyleCache map[int]*Style\n\tnumFmtRefTable map[int]xlsxNumFmt\n\tparsedNumFmtTable map[string]*parsedNumberFormat\n}\n\nfunc newXlsxStyleSheet(t *theme) *xlsxStyleSheet {\n\treturn &xlsxStyleSheet{\n\t\ttheme: t,\n\t\tstyleCache: make(map[int]*Style),\n\t}\n}\n\nfunc (styles *xlsxStyleSheet) reset() {\n\tstyles.Fonts = xlsxFonts{}\n\tstyles.Fills = xlsxFills{}\n\tstyles.Borders = xlsxBorders{}\n\n\t// Microsoft seems to want an emtpy border to start with\n\tstyles.addBorder(\n\t\txlsxBorder{\n\t\t\tLeft: xlsxLine{Style: \"none\"},\n\t\t\tRight: xlsxLine{Style: \"none\"},\n\t\t\tTop: xlsxLine{Style: \"none\"},\n\t\t\tBottom: xlsxLine{Style: \"none\"},\n\t\t})\n\n\tstyles.CellStyleXfs = &xlsxCellStyleXfs{}\n\n\t// add default xf\n\tstyles.CellXfs = xlsxCellXfs{Count: 1, Xf: []xlsxXf{{}}}\n\tstyles.NumFmts = xlsxNumFmts{}\n}\n\nfunc (styles *xlsxStyleSheet) getStyle(styleIndex int) *Style {\n\tstyles.RLock()\n\tstyle, ok := styles.styleCache[styleIndex]\n\tstyles.RUnlock()\n\tif ok {\n\t\treturn style\n\t}\n\n\tstyle = new(Style)\n\n\tvar namedStyleXf xlsxXf\n\n\txfCount := styles.CellXfs.Count\n\tif styleIndex > -1 && xfCount > 0 && styleIndex <= xfCount {\n\t\txf := styles.CellXfs.Xf[styleIndex]\n\n\t\tif xf.XfId != nil && styles.CellStyleXfs != nil {\n\t\t\tnamedStyleXf = styles.CellStyleXfs.Xf[*xf.XfId]\n\t\t\tstyle.NamedStyleIndex = xf.XfId\n\t\t} else {\n\t\t\tnamedStyleXf = xlsxXf{}\n\t\t}\n\n\t\tstyle.ApplyBorder = xf.ApplyBorder || namedStyleXf.ApplyBorder\n\t\tstyle.ApplyFill = xf.ApplyFill || namedStyleXf.ApplyFill\n\t\tstyle.ApplyFont = xf.ApplyFont || namedStyleXf.ApplyFont\n\t\tstyle.ApplyAlignment = xf.ApplyAlignment || namedStyleXf.ApplyAlignment\n\n\t\tif xf.BorderId > -1 && xf.BorderId < styles.Borders.Count {\n\t\t\tvar border xlsxBorder\n\t\t\tborder = styles.Borders.Border[xf.BorderId]\n\t\t\tstyle.Border.Left = border.Left.Style\n\t\t\tstyle.Border.LeftColor = border.Left.Color.RGB\n\t\t\tstyle.Border.Right = border.Right.Style\n\t\t\tstyle.Border.RightColor = border.Right.Color.RGB\n\t\t\tstyle.Border.Top = border.Top.Style\n\t\t\tstyle.Border.TopColor = border.Top.Color.RGB\n\t\t\tstyle.Border.Bottom = border.Bottom.Style\n\t\t\tstyle.Border.BottomColor = border.Bottom.Color.RGB\n\t\t}\n\n\t\tif xf.FillId > -1 && xf.FillId < styles.Fills.Count {\n\t\t\txFill := styles.Fills.Fill[xf.FillId]\n\t\t\tstyle.Fill.PatternType = xFill.PatternFill.PatternType\n\t\t\tstyle.Fill.FgColor = styles.argbValue(xFill.PatternFill.FgColor)\n\t\t\tstyle.Fill.BgColor = styles.argbValue(xFill.PatternFill.BgColor)\n\t\t}\n\n\t\tif xf.FontId > -1 && xf.FontId < styles.Fonts.Count {\n\t\t\txfont := styles.Fonts.Font[xf.FontId]\n\t\t\tstyle.Font.Size, _ = strconv.Atoi(xfont.Sz.Val)\n\t\t\tstyle.Font.Name = xfont.Name.Val\n\t\t\tstyle.Font.Family, _ = strconv.Atoi(xfont.Family.Val)\n\t\t\tstyle.Font.Charset, _ = strconv.Atoi(xfont.Charset.Val)\n\t\t\tstyle.Font.Color = styles.argbValue(xfont.Color)\n\n\t\t\tif bold := xfont.B; bold != nil && bold.Val != \"0\" {\n\t\t\t\tstyle.Font.Bold = true\n\t\t\t}\n\t\t\tif italic := xfont.I; italic != nil && italic.Val != \"0\" {\n\t\t\t\tstyle.Font.Italic = true\n\t\t\t}\n\t\t\tif underline := xfont.U; underline != nil && underline.Val != \"0\" {\n\t\t\t\tstyle.Font.Underline = true\n\t\t\t}\n\t\t}\n\t\tif xf.Alignment.Horizontal != \"\" {\n\t\t\tstyle.Alignment.Horizontal = xf.Alignment.Horizontal\n\t\t}\n\n\t\tif xf.Alignment.Vertical != \"\" {\n\t\t\tstyle.Alignment.Vertical = xf.Alignment.Vertical\n\t\t}\n\t\tstyle.Alignment.WrapText = xf.Alignment.WrapText\n \tstyle.Alignment.TextRotation = xf.Alignment.TextRotation\n\t\t\n \tstyles.Lock()\n\t\tstyles.styleCache[styleIndex] = style\n\t\tstyles.Unlock()\n\t}\n\treturn style\n}\n\nfunc (styles *xlsxStyleSheet) argbValue(color xlsxColor) string {\n\tif color.Theme != nil && styles.theme != nil {\n\t\treturn styles.theme.themeColor(int64(*color.Theme), color.Tint)\n\t}\n\treturn color.RGB\n}\n\n// Excel styles can reference number formats that are built-in, all of which\n// have an id less than 164. This is a possibly incomplete list comprised of as\n// many of them as I could find.\nfunc getBuiltinNumberFormat(numFmtId int) string {\n\treturn builtInNumFmt[numFmtId]\n}\n\nfunc (styles *xlsxStyleSheet) getNumberFormat(styleIndex int) (string, *parsedNumberFormat) {\n\tvar numberFormat string = \"general\"\n\tif styles.CellXfs.Xf != nil {\n\t\tif styleIndex > -1 && styleIndex <= styles.CellXfs.Count {\n\t\t\txf := styles.CellXfs.Xf[styleIndex]\n\t\t\tif builtin := getBuiltinNumberFormat(xf.NumFmtId); builtin != \"\" {\n\t\t\t\tnumberFormat = builtin\n\t\t\t} else {\n\t\t\t\tif styles.numFmtRefTable != nil {\n\t\t\t\t\tnumFmt := styles.numFmtRefTable[xf.NumFmtId]\n\t\t\t\t\tnumberFormat = numFmt.FormatCode\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tparsedFmt, ok := styles.parsedNumFmtTable[numberFormat]\n\tif !ok {\n\t\tif styles.parsedNumFmtTable == nil {\n\t\t\tstyles.parsedNumFmtTable = map[string]*parsedNumberFormat{}\n\t\t}\n\t\tparsedFmt = parseFullNumberFormatString(numberFormat)\n\t\tstyles.parsedNumFmtTable[numberFormat] = parsedFmt\n\t}\n\treturn numberFormat, parsedFmt\n}\n\nfunc (styles *xlsxStyleSheet) addFont(xFont xlsxFont) (index int) {\n\tvar font xlsxFont\n\tif xFont.Name.Val == \"\" {\n\t\treturn 0\n\t}\n\tfor index, font = range styles.Fonts.Font {\n\t\tif font.Equals(xFont) {\n\t\t\treturn index\n\t\t}\n\t}\n\tstyles.Fonts.Font = append(styles.Fonts.Font, xFont)\n\tindex = styles.Fonts.Count\n\tstyles.Fonts.Count++\n\treturn\n}\n\nfunc (styles *xlsxStyleSheet) addFill(xFill xlsxFill) (index int) {\n\tvar fill xlsxFill\n\tfor index, fill = range styles.Fills.Fill {\n\t\tif fill.Equals(xFill) {\n\t\t\treturn index\n\t\t}\n\t}\n\tstyles.Fills.Fill = append(styles.Fills.Fill, xFill)\n\tindex = styles.Fills.Count\n\tstyles.Fills.Count++\n\treturn\n}\n\nfunc (styles *xlsxStyleSheet) addBorder(xBorder xlsxBorder) (index int) {\n\tvar border xlsxBorder\n\tfor index, border = range styles.Borders.Border {\n\t\tif border.Equals(xBorder) {\n\t\t\treturn index\n\t\t}\n\t}\n\tstyles.Borders.Border = append(styles.Borders.Border, xBorder)\n\tindex = styles.Borders.Count\n\n\tstyles.Borders.Count++\n\treturn\n}\n\nfunc (styles *xlsxStyleSheet) addCellStyleXf(xCellStyleXf xlsxXf) (index int) {\n\tvar cellStyleXf xlsxXf\n\tif styles.CellStyleXfs == nil {\n\t\tstyles.CellStyleXfs = &xlsxCellStyleXfs{Count: 0}\n\t}\n\tfor index, cellStyleXf = range styles.CellStyleXfs.Xf {\n\t\tif cellStyleXf.Equals(xCellStyleXf) {\n\t\t\treturn index\n\t\t}\n\t}\n\tstyles.CellStyleXfs.Xf = append(styles.CellStyleXfs.Xf, xCellStyleXf)\n\tindex = styles.CellStyleXfs.Count\n\tstyles.CellStyleXfs.Count++\n\treturn\n}\n\nfunc (styles *xlsxStyleSheet) addCellXf(xCellXf xlsxXf) (index int) {\n\tvar cellXf xlsxXf\n\tfor index, cellXf = range styles.CellXfs.Xf {\n\t\tif cellXf.Equals(xCellXf) {\n\t\t\treturn index\n\t\t}\n\t}\n\n\tstyles.CellXfs.Xf = append(styles.CellXfs.Xf, xCellXf)\n\tindex = styles.CellXfs.Count\n\tstyles.CellXfs.Count++\n\treturn\n}\n\n// newNumFmt generate a xlsxNumFmt according the format code. When the FormatCode is built in, it will return a xlsxNumFmt with the NumFmtId defined in ECMA document, otherwise it will generate a new NumFmtId greater than 164.\nfunc (styles *xlsxStyleSheet) newNumFmt(formatCode string) xlsxNumFmt {\n\tif compareFormatString(formatCode, \"general\") {\n\t\treturn xlsxNumFmt{NumFmtId: 0, FormatCode: \"general\"}\n\t}\n\t// built in NumFmts in xmlStyle.go, traverse from the const.\n\tnumFmtId, ok := builtInNumFmtInv[formatCode]\n\tif ok {\n\t\treturn xlsxNumFmt{NumFmtId: numFmtId, FormatCode: formatCode}\n\t}\n\n\t// find the exist xlsxNumFmt\n\tfor _, numFmt := range styles.NumFmts.NumFmt {\n\t\tif formatCode == numFmt.FormatCode {\n\t\t\treturn numFmt\n\t\t}\n\t}\n\n\t// The user define NumFmtId. The one less than 164 in built in.\n\tnumFmtId = builtinNumFmtsCount + 1\n\tstyles.Lock()\n\tdefer styles.Unlock()\n\tfor {\n\t\t// get a unused NumFmtId\n\t\tif _, ok = styles.numFmtRefTable[numFmtId]; ok {\n\t\t\tnumFmtId++\n\t\t} else {\n\t\t\tstyles.addNumFmt(xlsxNumFmt{NumFmtId: numFmtId, FormatCode: formatCode})\n\t\t\tbreak\n\t\t}\n\t}\n\treturn xlsxNumFmt{NumFmtId: numFmtId, FormatCode: formatCode}\n}\n\n// addNumFmt add xlsxNumFmt if its not exist.\nfunc (styles *xlsxStyleSheet) addNumFmt(xNumFmt xlsxNumFmt) {\n\t// don't add built in NumFmt\n\tif xNumFmt.NumFmtId <= builtinNumFmtsCount {\n\t\treturn\n\t}\n\t_, ok := styles.numFmtRefTable[xNumFmt.NumFmtId]\n\tif !ok {\n\t\tif styles.numFmtRefTable == nil {\n\t\t\tstyles.numFmtRefTable = make(map[int]xlsxNumFmt)\n\t\t}\n\t\tstyles.NumFmts.NumFmt = append(styles.NumFmts.NumFmt, xNumFmt)\n\t\tstyles.numFmtRefTable[xNumFmt.NumFmtId] = xNumFmt\n\t\tstyles.NumFmts.Count++\n\t}\n}\n\nfunc (styles *xlsxStyleSheet) Marshal() (string, error) {\n\tresult := xml.Header + ``\n\n\txNumFmts, err := styles.NumFmts.Marshal()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult += xNumFmts\n\n\toutputFontMap := make(map[int]int)\n\txfonts, err := styles.Fonts.Marshal(outputFontMap)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult += xfonts\n\n\toutputFillMap := make(map[int]int)\n\txfills, err := styles.Fills.Marshal(outputFillMap)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult += xfills\n\n\toutputBorderMap := make(map[int]int)\n\txborders, err := styles.Borders.Marshal(outputBorderMap)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult += xborders\n\n\tif styles.CellStyleXfs != nil {\n\t\txcellStyleXfs, err := styles.CellStyleXfs.Marshal(outputBorderMap, outputFillMap, outputFontMap)\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tresult += xcellStyleXfs\n\t}\n\n\txcellXfs, err := styles.CellXfs.Marshal(outputBorderMap, outputFillMap, outputFontMap)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult += xcellXfs\n\n\tif styles.CellStyles != nil {\n\t\txcellStyles, err := styles.CellStyles.Marshal()\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tresult += xcellStyles\n\t}\n\n\treturn result + \"\", nil\n}\n\n// xlsxNumFmts directly maps the numFmts element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxNumFmts struct {\n\tCount int `xml:\"count,attr\"`\n\tNumFmt []xlsxNumFmt `xml:\"numFmt,omitempty\"`\n}\n\nfunc (numFmts *xlsxNumFmts) Marshal() (result string, err error) {\n\tif numFmts.Count > 0 {\n\t\tresult = fmt.Sprintf(``, numFmts.Count)\n\t\tfor _, numFmt := range numFmts.NumFmt {\n\t\t\tvar xNumFmt string\n\t\t\txNumFmt, err = numFmt.Marshal()\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tresult += xNumFmt\n\t\t}\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxNumFmt directly maps the numFmt element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxNumFmt struct {\n\tNumFmtId int `xml:\"numFmtId,attr,omitempty\"`\n\tFormatCode string `xml:\"formatCode,attr,omitempty\"`\n}\n\nfunc (numFmt *xlsxNumFmt) Marshal() (result string, err error) {\n\tformatCode := &bytes.Buffer{}\n\tif err := xml.EscapeText(formatCode, []byte(numFmt.FormatCode)); err != nil {\n\t\treturn \"\", err\n\t}\n\n\treturn fmt.Sprintf(``, numFmt.NumFmtId, formatCode), nil\n}\n\n// xlsxFonts directly maps the fonts element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxFonts struct {\n\tXMLName xml.Name `xml:\"fonts\"`\n\n\tCount int `xml:\"count,attr\"`\n\tFont []xlsxFont `xml:\"font,omitempty\"`\n}\n\nfunc (fonts *xlsxFonts) Marshal(outputFontMap map[int]int) (result string, err error) {\n\temittedCount := 0\n\tsubparts := \"\"\n\n\tfor i, font := range fonts.Font {\n\t\tvar xfont string\n\t\txfont, err = font.Marshal()\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tif xfont != \"\" {\n\t\t\toutputFontMap[i] = emittedCount\n\t\t\temittedCount++\n\t\t\tsubparts += xfont\n\t\t}\n\t}\n\tif emittedCount > 0 {\n\t\tresult = fmt.Sprintf(``, fonts.Count)\n\t\tresult += subparts\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxFont directly maps the font element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxFont struct {\n\tSz xlsxVal `xml:\"sz,omitempty\"`\n\tName xlsxVal `xml:\"name,omitempty\"`\n\tFamily xlsxVal `xml:\"family,omitempty\"`\n\tCharset xlsxVal `xml:\"charset,omitempty\"`\n\tColor xlsxColor `xml:\"color,omitempty\"`\n\tB *xlsxVal `xml:\"b,omitempty\"`\n\tI *xlsxVal `xml:\"i,omitempty\"`\n\tU *xlsxVal `xml:\"u,omitempty\"`\n}\n\nfunc (font *xlsxFont) Equals(other xlsxFont) bool {\n\tif (font.B == nil && other.B != nil) || (font.B != nil && other.B == nil) {\n\t\treturn false\n\t}\n\tif (font.I == nil && other.I != nil) || (font.I != nil && other.I == nil) {\n\t\treturn false\n\t}\n\tif (font.U == nil && other.U != nil) || (font.U != nil && other.U == nil) {\n\t\treturn false\n\t}\n\treturn font.Sz.Equals(other.Sz) && font.Name.Equals(other.Name) && font.Family.Equals(other.Family) && font.Charset.Equals(other.Charset) && font.Color.Equals(other.Color)\n}\n\nfunc (font *xlsxFont) Marshal() (result string, err error) {\n\tresult = \"\"\n\tif font.Sz.Val != \"\" {\n\t\tresult += fmt.Sprintf(``, font.Sz.Val)\n\t}\n\tif font.Name.Val != \"\" {\n\t\tresult += fmt.Sprintf(``, font.Name.Val)\n\t}\n\tif font.Family.Val != \"\" {\n\t\tresult += fmt.Sprintf(``, font.Family.Val)\n\t}\n\tif font.Charset.Val != \"\" {\n\t\tresult += fmt.Sprintf(``, font.Charset.Val)\n\t}\n\tif font.Color.RGB != \"\" {\n\t\tresult += fmt.Sprintf(``, font.Color.RGB)\n\t}\n\tif font.B != nil {\n\t\tresult += \"\"\n\t}\n\tif font.I != nil {\n\t\tresult += \"\"\n\t}\n\tif font.U != nil {\n\t\tresult += \"\"\n\t}\n\treturn result + \"\", nil\n}\n\n// xlsxVal directly maps the val element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxVal struct {\n\tVal string `xml:\"val,attr,omitempty\"`\n}\n\nfunc (val *xlsxVal) Equals(other xlsxVal) bool {\n\treturn val.Val == other.Val\n}\n\n// xlsxFills directly maps the fills element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxFills struct {\n\tCount int `xml:\"count,attr\"`\n\tFill []xlsxFill `xml:\"fill,omitempty\"`\n}\n\nfunc (fills *xlsxFills) Marshal(outputFillMap map[int]int) (string, error) {\n\tvar subparts string\n\tvar emittedCount int\n\tfor i, fill := range fills.Fill {\n\t\txfill, err := fill.Marshal()\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tif xfill != \"\" {\n\t\t\toutputFillMap[i] = emittedCount\n\t\t\temittedCount++\n\t\t\tsubparts += xfill\n\t\t}\n\t}\n\tvar result string\n\tif emittedCount > 0 {\n\t\tresult = fmt.Sprintf(``, emittedCount)\n\t\tresult += subparts\n\t\tresult += ``\n\t}\n\treturn result, nil\n}\n\n// xlsxFill directly maps the fill element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxFill struct {\n\tPatternFill xlsxPatternFill `xml:\"patternFill,omitempty\"`\n}\n\nfunc (fill *xlsxFill) Equals(other xlsxFill) bool {\n\treturn fill.PatternFill.Equals(other.PatternFill)\n}\n\nfunc (fill *xlsxFill) Marshal() (result string, err error) {\n\tif fill.PatternFill.PatternType != \"\" {\n\t\tvar xpatternFill string\n\t\tresult = ``\n\n\t\txpatternFill, err = fill.PatternFill.Marshal()\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tresult += xpatternFill\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxPatternFill directly maps the patternFill element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPatternFill struct {\n\tPatternType string `xml:\"patternType,attr,omitempty\"`\n\tFgColor xlsxColor `xml:\"fgColor,omitempty\"`\n\tBgColor xlsxColor `xml:\"bgColor,omitempty\"`\n}\n\nfunc (patternFill *xlsxPatternFill) Equals(other xlsxPatternFill) bool {\n\treturn patternFill.PatternType == other.PatternType && patternFill.FgColor.Equals(other.FgColor) && patternFill.BgColor.Equals(other.BgColor)\n}\n\nfunc (patternFill *xlsxPatternFill) Marshal() (result string, err error) {\n\tresult = fmt.Sprintf(``\n\tterminator := \"\"\n\tsubparts := \"\"\n\tif patternFill.FgColor.RGB != \"\" {\n\t\tending = `>`\n\t\tterminator = \"\"\n\t\tsubparts += fmt.Sprintf(``, patternFill.FgColor.RGB)\n\t}\n\tif patternFill.BgColor.RGB != \"\" {\n\t\tending = `>`\n\t\tterminator = \"\"\n\t\tsubparts += fmt.Sprintf(``, patternFill.BgColor.RGB)\n\t}\n\tresult += ending\n\tresult += subparts\n\tresult += terminator\n\treturn\n}\n\n// xlsxColor is a common mapping used for both the fgColor and bgColor\n// elements in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxColor struct {\n\tRGB string `xml:\"rgb,attr,omitempty\"`\n\tTheme *int `xml:\"theme,attr,omitempty\"`\n\tTint float64 `xml:\"tint,attr,omitempty\"`\n}\n\nfunc (color *xlsxColor) Equals(other xlsxColor) bool {\n\treturn color.RGB == other.RGB\n}\n\n// xlsxBorders directly maps the borders element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxBorders struct {\n\tCount int `xml:\"count,attr\"`\n\tBorder []xlsxBorder `xml:\"border\"`\n}\n\nfunc (borders *xlsxBorders) Marshal(outputBorderMap map[int]int) (result string, err error) {\n\tresult = \"\"\n\temittedCount := 0\n\tsubparts := \"\"\n\tfor i, border := range borders.Border {\n\t\tvar xborder string\n\t\txborder, err = border.Marshal()\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tif xborder != \"\" {\n\t\t\toutputBorderMap[i] = emittedCount\n\t\t\temittedCount++\n\t\t\tsubparts += xborder\n\t\t}\n\t}\n\tif emittedCount > 0 {\n\t\tresult += fmt.Sprintf(``, emittedCount)\n\t\tresult += subparts\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxBorder directly maps the border element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxBorder struct {\n\tLeft xlsxLine `xml:\"left,omitempty\"`\n\tRight xlsxLine `xml:\"right,omitempty\"`\n\tTop xlsxLine `xml:\"top,omitempty\"`\n\tBottom xlsxLine `xml:\"bottom,omitempty\"`\n}\n\nfunc (border *xlsxBorder) Equals(other xlsxBorder) bool {\n\treturn border.Left.Equals(other.Left) && border.Right.Equals(other.Right) && border.Top.Equals(other.Top) && border.Bottom.Equals(other.Bottom)\n}\n\n// To get borders to work correctly in Excel, you have to always start with an\n// empty set of borders. There was logic in this function that would strip out\n// empty elements, but unfortunately that would cause the border to fail.\n\nfunc (border *xlsxBorder) Marshal() (result string, err error) {\n\tsubparts := \"\"\n\tsubparts += fmt.Sprintf(``, border.Left.Style)\n\tif border.Left.Color.RGB != \"\" {\n\t\tsubparts += fmt.Sprintf(``, border.Left.Color.RGB)\n\t}\n\tsubparts += ``\n\n\tsubparts += fmt.Sprintf(``, border.Right.Style)\n\tif border.Right.Color.RGB != \"\" {\n\t\tsubparts += fmt.Sprintf(``, border.Right.Color.RGB)\n\t}\n\tsubparts += ``\n\n\tsubparts += fmt.Sprintf(``, border.Top.Style)\n\tif border.Top.Color.RGB != \"\" {\n\t\tsubparts += fmt.Sprintf(``, border.Top.Color.RGB)\n\t}\n\tsubparts += ``\n\n\tsubparts += fmt.Sprintf(``, border.Bottom.Style)\n\tif border.Bottom.Color.RGB != \"\" {\n\t\tsubparts += fmt.Sprintf(``, border.Bottom.Color.RGB)\n\t}\n\tsubparts += ``\n\n\tresult += ``\n\tresult += subparts\n\tresult += ``\n\treturn\n}\n\n// xlsxLine directly maps the line style element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxLine struct {\n\tStyle string `xml:\"style,attr,omitempty\"`\n\tColor xlsxColor `xml:\"color,omitempty\"`\n}\n\nfunc (line *xlsxLine) Equals(other xlsxLine) bool {\n\treturn line.Style == other.Style && line.Color.Equals(other.Color)\n}\n\ntype xlsxCellStyles struct {\n\tXMLName xml.Name `xml:\"cellStyles\"`\n\tCount int `xml:\"count,attr\"`\n\tCellStyle []xlsxCellStyle `xml:\"cellStyle,omitempty\"`\n}\n\nfunc (cellStyles *xlsxCellStyles) Marshal() (result string, err error) {\n\tif cellStyles.Count > 0 {\n\t\tresult = fmt.Sprintf(``, cellStyles.Count)\n\t\tfor _, cellStyle := range cellStyles.CellStyle {\n\t\t\tvar xCellStyle []byte\n\t\t\txCellStyle, err = xml.Marshal(cellStyle)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tresult += string(xCellStyle)\n\t\t}\n\t\tresult += ``\n\t}\n\treturn\n\n}\n\ntype xlsxCellStyle struct {\n\tXMLName xml.Name `xml:\"cellStyle\"`\n\tBuiltInId *int `xml:\"builtInId,attr,omitempty\"`\n\tCustomBuiltIn *bool `xml:\"customBuiltIn,attr,omitempty\"`\n\tHidden *bool `xml:\"hidden,attr,omitempty\"`\n\tILevel *bool `xml:\"iLevel,attr,omitempty\"`\n\tName string `xml:\"name,attr\"`\n\tXfId int `xml:\"xfId,attr\"`\n}\n\n// xlsxCellStyleXfs directly maps the cellStyleXfs element in the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxCellStyleXfs struct {\n\tCount int `xml:\"count,attr\"`\n\tXf []xlsxXf `xml:\"xf,omitempty\"`\n}\n\nfunc (cellStyleXfs *xlsxCellStyleXfs) Marshal(outputBorderMap, outputFillMap, outputFontMap map[int]int) (result string, err error) {\n\tif cellStyleXfs.Count > 0 {\n\t\tresult = fmt.Sprintf(``, cellStyleXfs.Count)\n\t\tfor _, xf := range cellStyleXfs.Xf {\n\t\t\tvar xxf string\n\t\t\txxf, err = xf.Marshal(outputBorderMap, outputFillMap, outputFontMap)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tresult += xxf\n\t\t}\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxCellXfs directly maps the cellXfs element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxCellXfs struct {\n\tCount int `xml:\"count,attr\"`\n\tXf []xlsxXf `xml:\"xf,omitempty\"`\n}\n\nfunc (cellXfs *xlsxCellXfs) Marshal(outputBorderMap, outputFillMap, outputFontMap map[int]int) (result string, err error) {\n\tif cellXfs.Count > 0 {\n\t\tresult = fmt.Sprintf(``, cellXfs.Count)\n\t\tfor _, xf := range cellXfs.Xf {\n\t\t\tvar xxf string\n\t\t\txxf, err = xf.Marshal(outputBorderMap, outputFillMap, outputFontMap)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tresult += xxf\n\t\t}\n\t\tresult += ``\n\t}\n\treturn\n}\n\n// xlsxXf directly maps the xf element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxXf struct {\n\tApplyAlignment bool `xml:\"applyAlignment,attr\"`\n\tApplyBorder bool `xml:\"applyBorder,attr\"`\n\tApplyFont bool `xml:\"applyFont,attr\"`\n\tApplyFill bool `xml:\"applyFill,attr\"`\n\tApplyNumberFormat bool `xml:\"applyNumberFormat,attr\"`\n\tApplyProtection bool `xml:\"applyProtection,attr\"`\n\tBorderId int `xml:\"borderId,attr\"`\n\tFillId int `xml:\"fillId,attr\"`\n\tFontId int `xml:\"fontId,attr\"`\n\tNumFmtId int `xml:\"numFmtId,attr\"`\n\tXfId *int `xml:\"xfId,attr,omitempty\"`\n\tAlignment xlsxAlignment `xml:\"alignment\"`\n}\n\nfunc (xf *xlsxXf) Equals(other xlsxXf) bool {\n\treturn xf.ApplyAlignment == other.ApplyAlignment &&\n\t\txf.ApplyBorder == other.ApplyBorder &&\n\t\txf.ApplyFont == other.ApplyFont &&\n\t\txf.ApplyFill == other.ApplyFill &&\n\t\txf.ApplyProtection == other.ApplyProtection &&\n\t\txf.BorderId == other.BorderId &&\n\t\txf.FillId == other.FillId &&\n\t\txf.FontId == other.FontId &&\n\t\txf.NumFmtId == other.NumFmtId &&\n\t\t(xf.XfId == other.XfId ||\n\t\t\t((xf.XfId != nil && other.XfId != nil) &&\n\t\t\t\t*xf.XfId == *other.XfId)) &&\n\t\txf.Alignment.Equals(other.Alignment)\n}\n\nfunc (xf *xlsxXf) Marshal(outputBorderMap, outputFillMap, outputFontMap map[int]int) (result string, err error) {\n\tresult = fmt.Sprintf(`\"\n\txAlignment, err := xf.Alignment.Marshal()\n\tif err != nil {\n\t\treturn result, err\n\t}\n\treturn result + xAlignment + \"\", nil\n}\n\ntype xlsxAlignment struct {\n\tHorizontal string `xml:\"horizontal,attr\"`\n\tIndent int `xml:\"indent,attr\"`\n\tShrinkToFit bool `xml:\"shrinkToFit,attr\"`\n\tTextRotation int `xml:\"textRotation,attr\"`\n\tVertical string `xml:\"vertical,attr\"`\n\tWrapText bool `xml:\"wrapText,attr\"`\n}\n\nfunc (alignment *xlsxAlignment) Equals(other xlsxAlignment) bool {\n\treturn alignment.Horizontal == other.Horizontal &&\n\t\talignment.Indent == other.Indent &&\n\t\talignment.ShrinkToFit == other.ShrinkToFit &&\n\t\talignment.TextRotation == other.TextRotation &&\n\t\talignment.Vertical == other.Vertical &&\n\t\talignment.WrapText == other.WrapText\n}\n\nfunc (alignment *xlsxAlignment) Marshal() (result string, err error) {\n\tif alignment.Horizontal == \"\" {\n\t\talignment.Horizontal = \"general\"\n\t}\n\tif alignment.Vertical == \"\" {\n\t\talignment.Vertical = \"bottom\"\n\t}\n\treturn fmt.Sprintf(``, alignment.Horizontal, alignment.Indent, bool2Int(alignment.ShrinkToFit), alignment.TextRotation, alignment.Vertical, bool2Int(alignment.WrapText)), nil\n}\n\nfunc bool2Int(b bool) int {\n\tif b {\n\t\treturn 1\n\t}\n\treturn 0\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlTheme.go", "content": "package xlsx\n\nimport \"encoding/xml\"\n\n// xlsxTheme directly maps the theme element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxTheme struct {\n\tThemeElements xlsxThemeElements `xml:\"themeElements\"`\n}\n\n// xlsxThemeElements directly maps the themeElements element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxThemeElements struct {\n\tClrScheme xlsxClrScheme `xml:\"clrScheme\"`\n}\n\n// xlsxClrScheme directly maps the clrScheme element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxClrScheme struct {\n\tName string `xml:\"name,attr\"`\n\tChildren []xlsxClrSchemeEl `xml:\",any\"`\n}\n\n// xlsxClrScheme maps to children of the clrScheme element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxClrSchemeEl struct {\n\tXMLName xml.Name\n\tSysClr *xlsxSysClr `xml:\"sysClr\"`\n\tSrgbClr *xlsxSrgbClr `xml:\"srgbClr\"`\n}\n\n// xlsxSysClr directly maps the sysClr element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSysClr struct {\n\tVal string `xml:\"val,attr\"`\n\tLastClr string `xml:\"lastClr,attr\"`\n}\n\n// xlsxSrgbClr directly maps the srgbClr element in the namespace\n// http://schemas.openxmlformats.org/drawingml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSrgbClr struct {\n\tVal string `xml:\"val,attr\"`\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlWorkbook.go", "content": "package xlsx\n\nimport (\n\t\"archive/zip\"\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"io\"\n)\n\nconst (\n\t// sheet state values as defined by\n\t// http://msdn.microsoft.com/en-us/library/office/documentformat.openxml.spreadsheet.sheetstatevalues.aspx\n\tsheetStateVisible = \"visible\"\n\tsheetStateHidden = \"hidden\"\n\tsheetStateVeryHidden = \"veryHidden\"\n)\n\n// xmlxWorkbookRels contains xmlxWorkbookRelations\n// which maps sheet id and sheet XML\ntype xlsxWorkbookRels struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/package/2006/relationships Relationships\"`\n\tRelationships []xlsxWorkbookRelation `xml:\"Relationship\"`\n}\n\n// xmlxWorkbookRelation maps sheet id and xl/worksheets/sheet%d.xml\ntype xlsxWorkbookRelation struct {\n\tId string `xml:\",attr\"`\n\tTarget string `xml:\",attr\"`\n\tType string `xml:\",attr\"`\n}\n\n// xlsxWorkbook directly maps the workbook element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxWorkbook struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main workbook\"`\n\tFileVersion xlsxFileVersion `xml:\"fileVersion\"`\n\tWorkbookPr xlsxWorkbookPr `xml:\"workbookPr\"`\n\tWorkbookProtection xlsxWorkbookProtection `xml:\"workbookProtection\"`\n\tBookViews xlsxBookViews `xml:\"bookViews\"`\n\tSheets xlsxSheets `xml:\"sheets\"`\n\tDefinedNames xlsxDefinedNames `xml:\"definedNames\"`\n\tCalcPr xlsxCalcPr `xml:\"calcPr\"`\n}\n\n// xlsxWorkbookProtection directly maps the workbookProtection element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxWorkbookProtection struct {\n\t// We don't need this, yet.\n}\n\n// xlsxFileVersion directly maps the fileVersion element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxFileVersion struct {\n\tAppName string `xml:\"appName,attr,omitempty\"`\n\tLastEdited string `xml:\"lastEdited,attr,omitempty\"`\n\tLowestEdited string `xml:\"lowestEdited,attr,omitempty\"`\n\tRupBuild string `xml:\"rupBuild,attr,omitempty\"`\n}\n\n// xlsxWorkbookPr directly maps the workbookPr element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxWorkbookPr struct {\n\tDefaultThemeVersion string `xml:\"defaultThemeVersion,attr,omitempty\"`\n\tBackupFile bool `xml:\"backupFile,attr,omitempty\"`\n\tShowObjects string `xml:\"showObjects,attr,omitempty\"`\n\tDate1904 bool `xml:\"date1904,attr\"`\n}\n\n// xlsxBookViews directly maps the bookViews element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxBookViews struct {\n\tWorkBookView []xlsxWorkBookView `xml:\"workbookView\"`\n}\n\n// xlsxWorkBookView directly maps the workbookView element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxWorkBookView struct {\n\tActiveTab int `xml:\"activeTab,attr,omitempty\"`\n\tFirstSheet int `xml:\"firstSheet,attr,omitempty\"`\n\tShowHorizontalScroll bool `xml:\"showHorizontalScroll,attr,omitempty\"`\n\tShowVerticalScroll bool `xml:\"showVerticalScroll,attr,omitempty\"`\n\tShowSheetTabs bool `xml:\"showSheetTabs,attr,omitempty\"`\n\tTabRatio int `xml:\"tabRatio,attr,omitempty\"`\n\tWindowHeight int `xml:\"windowHeight,attr,omitempty\"`\n\tWindowWidth int `xml:\"windowWidth,attr,omitempty\"`\n\tXWindow string `xml:\"xWindow,attr,omitempty\"`\n\tYWindow string `xml:\"yWindow,attr,omitempty\"`\n}\n\n// xlsxSheets directly maps the sheets element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheets struct {\n\tSheet []xlsxSheet `xml:\"sheet\"`\n}\n\n// xlsxSheet directly maps the sheet element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheet struct {\n\tName string `xml:\"name,attr,omitempty\"`\n\tSheetId string `xml:\"sheetId,attr,omitempty\"`\n\tId string `xml:\"http://schemas.openxmlformats.org/officeDocument/2006/relationships id,attr,omitempty\"`\n\tState string `xml:\"state,attr,omitempty\"`\n}\n\n// xlsxDefinedNames directly maps the definedNames element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\ntype xlsxDefinedNames struct {\n\tDefinedName []xlsxDefinedName `xml:\"definedName\"`\n}\n\n// xlsxDefinedName directly maps the definedName element from the\n// namespace http://schemas.openxmlformats.org/spreadsheetml/2006/main\n// - currently I have not checked it for completeness - it does as\n// much as I need.\n// for a descriptions of the attributes see\n// https://msdn.microsoft.com/en-us/library/office/documentformat.openxml.spreadsheet.definedname.aspx\ntype xlsxDefinedName struct {\n\tData string `xml:\",chardata\"`\n\tName string `xml:\"name,attr\"`\n\tComment string `xml:\"comment,attr,omitempty\"`\n\tCustomMenu string `xml:\"customMenu,attr,omitempty\"`\n\tDescription string `xml:\"description,attr,omitempty\"`\n\tHelp string `xml:\"help,attr,omitempty\"`\n\tShortcutKey string `xml:\"shortcutKey,attr,omitempty\"`\n\tStatusBar string `xml:\"statusBar,attr,omitempty\"`\n\tLocalSheetID int `xml:\"localSheetId,attr,omitempty\"`\n\tFunctionGroupID int `xml:\"functionGroupId,attr,omitempty\"`\n\tFunction bool `xml:\"function,attr,omitempty\"`\n\tHidden bool `xml:\"hidden,attr,omitempty\"`\n\tVbProcedure bool `xml:\"vbProcedure,attr,omitempty\"`\n\tPublishToServer bool `xml:\"publishToServer,attr,omitempty\"`\n\tWorkbookParameter bool `xml:\"workbookParameter,attr,omitempty\"`\n\tXlm bool `xml:\"xml,attr,omitempty\"`\n}\n\n// xlsxCalcPr directly maps the calcPr element from the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxCalcPr struct {\n\tCalcId string `xml:\"calcId,attr,omitempty\"`\n\tIterateCount int `xml:\"iterateCount,attr,omitempty\"`\n\tRefMode string `xml:\"refMode,attr,omitempty\"`\n\tIterate bool `xml:\"iterate,attr,omitempty\"`\n\tIterateDelta float64 `xml:\"iterateDelta,attr,omitempty\"`\n}\n\n// Helper function to lookup the file corresponding to a xlsxSheet object in the worksheets map\nfunc worksheetFileForSheet(sheet xlsxSheet, worksheets map[string]*zip.File, sheetXMLMap map[string]string) *zip.File {\n\tsheetName, ok := sheetXMLMap[sheet.Id]\n\tif !ok {\n\t\tif sheet.SheetId != \"\" {\n\t\t\tsheetName = fmt.Sprintf(\"sheet%s\", sheet.SheetId)\n\t\t} else {\n\t\t\tsheetName = fmt.Sprintf(\"sheet%s\", sheet.Id)\n\t\t}\n\t}\n\treturn worksheets[sheetName]\n}\n\n// getWorksheetFromSheet() is an internal helper function to open a\n// sheetN.xml file, referred to by an xlsx.xlsxSheet struct, from the XLSX\n// file and unmarshal it an xlsx.xlsxWorksheet struct\nfunc getWorksheetFromSheet(sheet xlsxSheet, worksheets map[string]*zip.File, sheetXMLMap map[string]string, rowLimit int) (*xlsxWorksheet, error) {\n\tvar r io.Reader\n\tvar decoder *xml.Decoder\n\tvar worksheet *xlsxWorksheet\n\tvar err error\n\tworksheet = new(xlsxWorksheet)\n\n\tf := worksheetFileForSheet(sheet, worksheets, sheetXMLMap)\n\tif f == nil {\n\t\treturn nil, fmt.Errorf(\"Unable to find sheet '%s'\", sheet)\n\t}\n\tif rc, err := f.Open(); err != nil {\n\t\treturn nil, err\n\t} else {\n\t\tdefer rc.Close()\n\t\tr = rc\n\t}\n\n\tif rowLimit != NoRowLimit {\n\t\tr, err = truncateSheetXML(r, rowLimit)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tdecoder = xml.NewDecoder(r)\n\terr = decoder.Decode(worksheet)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn worksheet, nil\n}\n" }, { "path": "vendor/github.com/tealeg/xlsx/xmlWorksheet.go", "content": "package xlsx\n\nimport (\n\t\"encoding/xml\"\n\t\"strings\"\n)\n\n// xlsxWorksheet directly maps the worksheet element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxWorksheet struct {\n\tXMLName xml.Name `xml:\"http://schemas.openxmlformats.org/spreadsheetml/2006/main worksheet\"`\n\tSheetPr xlsxSheetPr `xml:\"sheetPr\"`\n\tDimension xlsxDimension `xml:\"dimension\"`\n\tSheetViews xlsxSheetViews `xml:\"sheetViews\"`\n\tSheetFormatPr xlsxSheetFormatPr `xml:\"sheetFormatPr\"`\n\tCols *xlsxCols `xml:\"cols,omitempty\"`\n\tSheetData xlsxSheetData `xml:\"sheetData\"`\n\tAutoFilter *xlsxAutoFilter `xml:\"autoFilter,omitempty\"`\n\tMergeCells *xlsxMergeCells `xml:\"mergeCells,omitempty\"`\n\tPrintOptions xlsxPrintOptions `xml:\"printOptions\"`\n\tPageMargins xlsxPageMargins `xml:\"pageMargins\"`\n\tPageSetUp xlsxPageSetUp `xml:\"pageSetup\"`\n\tHeaderFooter xlsxHeaderFooter `xml:\"headerFooter\"`\n}\n\n// xlsxHeaderFooter directly maps the headerFooter element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxHeaderFooter struct {\n\tDifferentFirst bool `xml:\"differentFirst,attr\"`\n\tDifferentOddEven bool `xml:\"differentOddEven,attr\"`\n\tOddHeader []xlsxOddHeader `xml:\"oddHeader\"`\n\tOddFooter []xlsxOddFooter `xml:\"oddFooter\"`\n}\n\n// xlsxOddHeader directly maps the oddHeader element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxOddHeader struct {\n\tContent string `xml:\",chardata\"`\n}\n\n// xlsxOddFooter directly maps the oddFooter element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxOddFooter struct {\n\tContent string `xml:\",chardata\"`\n}\n\n// xlsxPageSetUp directly maps the pageSetup element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPageSetUp struct {\n\tPaperSize string `xml:\"paperSize,attr\"`\n\tScale int `xml:\"scale,attr\"`\n\tFirstPageNumber int `xml:\"firstPageNumber,attr\"`\n\tFitToWidth int `xml:\"fitToWidth,attr\"`\n\tFitToHeight int `xml:\"fitToHeight,attr\"`\n\tPageOrder string `xml:\"pageOrder,attr\"`\n\tOrientation string `xml:\"orientation,attr\"`\n\tUsePrinterDefaults bool `xml:\"usePrinterDefaults,attr\"`\n\tBlackAndWhite bool `xml:\"blackAndWhite,attr\"`\n\tDraft bool `xml:\"draft,attr\"`\n\tCellComments string `xml:\"cellComments,attr\"`\n\tUseFirstPageNumber bool `xml:\"useFirstPageNumber,attr\"`\n\tHorizontalDPI float32 `xml:\"horizontalDpi,attr\"`\n\tVerticalDPI float32 `xml:\"verticalDpi,attr\"`\n\tCopies int `xml:\"copies,attr\"`\n}\n\n// xlsxPrintOptions directly maps the printOptions element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPrintOptions struct {\n\tHeadings bool `xml:\"headings,attr\"`\n\tGridLines bool `xml:\"gridLines,attr\"`\n\tGridLinesSet bool `xml:\"gridLinesSet,attr\"`\n\tHorizontalCentered bool `xml:\"horizontalCentered,attr\"`\n\tVerticalCentered bool `xml:\"verticalCentered,attr\"`\n}\n\n// xlsxPageMargins directly maps the pageMargins element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPageMargins struct {\n\tLeft float64 `xml:\"left,attr\"`\n\tRight float64 `xml:\"right,attr\"`\n\tTop float64 `xml:\"top,attr\"`\n\tBottom float64 `xml:\"bottom,attr\"`\n\tHeader float64 `xml:\"header,attr\"`\n\tFooter float64 `xml:\"footer,attr\"`\n}\n\n// xlsxSheetFormatPr directly maps the sheetFormatPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheetFormatPr struct {\n\tDefaultColWidth float64 `xml:\"defaultColWidth,attr,omitempty\"`\n\tDefaultRowHeight float64 `xml:\"defaultRowHeight,attr\"`\n\tOutlineLevelCol uint8 `xml:\"outlineLevelCol,attr,omitempty\"`\n\tOutlineLevelRow uint8 `xml:\"outlineLevelRow,attr,omitempty\"`\n}\n\n// xlsxSheetViews directly maps the sheetViews element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheetViews struct {\n\tSheetView []xlsxSheetView `xml:\"sheetView\"`\n}\n\n// xlsxSheetView directly maps the sheetView element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheetView struct {\n\tWindowProtection bool `xml:\"windowProtection,attr\"`\n\tShowFormulas bool `xml:\"showFormulas,attr\"`\n\tShowGridLines bool `xml:\"showGridLines,attr\"`\n\tShowRowColHeaders bool `xml:\"showRowColHeaders,attr\"`\n\tShowZeros bool `xml:\"showZeros,attr\"`\n\tRightToLeft bool `xml:\"rightToLeft,attr\"`\n\tTabSelected bool `xml:\"tabSelected,attr\"`\n\tShowOutlineSymbols bool `xml:\"showOutlineSymbols,attr\"`\n\tDefaultGridColor bool `xml:\"defaultGridColor,attr\"`\n\tView string `xml:\"view,attr\"`\n\tTopLeftCell string `xml:\"topLeftCell,attr\"`\n\tColorId int `xml:\"colorId,attr\"`\n\tZoomScale float64 `xml:\"zoomScale,attr\"`\n\tZoomScaleNormal float64 `xml:\"zoomScaleNormal,attr\"`\n\tZoomScalePageLayoutView float64 `xml:\"zoomScalePageLayoutView,attr\"`\n\tWorkbookViewId int `xml:\"workbookViewId,attr\"`\n\tPane *xlsxPane `xml:\"pane\"`\n\tSelection []xlsxSelection `xml:\"selection\"`\n}\n\n// xlsxSelection directly maps the selection element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSelection struct {\n\tPane string `xml:\"pane,attr\"`\n\tActiveCell string `xml:\"activeCell,attr\"`\n\tActiveCellId int `xml:\"activeCellId,attr\"`\n\tSQRef string `xml:\"sqref,attr\"`\n}\n\n// xlsxSelection directly maps the selection element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPane struct {\n\tXSplit float64 `xml:\"xSplit,attr\"`\n\tYSplit float64 `xml:\"ySplit,attr\"`\n\tTopLeftCell string `xml:\"topLeftCell,attr\"`\n\tActivePane string `xml:\"activePane,attr\"`\n\tState string `xml:\"state,attr\"` // Either \"split\" or \"frozen\"\n}\n\n// xlsxSheetPr directly maps the sheetPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheetPr struct {\n\tFilterMode bool `xml:\"filterMode,attr\"`\n\tPageSetUpPr []xlsxPageSetUpPr `xml:\"pageSetUpPr\"`\n}\n\n// xlsxPageSetUpPr directly maps the pageSetupPr element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxPageSetUpPr struct {\n\tFitToPage bool `xml:\"fitToPage,attr\"`\n}\n\n// xlsxCols directly maps the cols element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxCols struct {\n\tCol []xlsxCol `xml:\"col\"`\n}\n\n// xlsxCol directly maps the col element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxCol struct {\n\tCollapsed bool `xml:\"collapsed,attr\"`\n\tHidden bool `xml:\"hidden,attr\"`\n\tMax int `xml:\"max,attr\"`\n\tMin int `xml:\"min,attr\"`\n\tStyle int `xml:\"style,attr\"`\n\tWidth float64 `xml:\"width,attr\"`\n\tCustomWidth bool `xml:\"customWidth,attr,omitempty\"`\n\tOutlineLevel uint8 `xml:\"outlineLevel,attr,omitempty\"`\n}\n\n// xlsxDimension directly maps the dimension element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxDimension struct {\n\tRef string `xml:\"ref,attr\"`\n}\n\n// xlsxSheetData directly maps the sheetData element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxSheetData struct {\n\tXMLName xml.Name `xml:\"sheetData\"`\n\tRow []xlsxRow `xml:\"row\"`\n}\n\n// xlsxRow directly maps the row element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxRow struct {\n\tR int `xml:\"r,attr\"`\n\tSpans string `xml:\"spans,attr,omitempty\"`\n\tHidden bool `xml:\"hidden,attr,omitempty\"`\n\tC []xlsxC `xml:\"c\"`\n\tHt string `xml:\"ht,attr,omitempty\"`\n\tCustomHeight bool `xml:\"customHeight,attr,omitempty\"`\n\tOutlineLevel uint8 `xml:\"outlineLevel,attr,omitempty\"`\n}\n\ntype xlsxAutoFilter struct {\n\tRef string `xml:\"ref,attr\"`\n}\n\ntype xlsxMergeCell struct {\n\tRef string `xml:\"ref,attr\"` // ref: horiz \"A1:C1\", vert \"B3:B6\", both \"D3:G4\"\n}\n\ntype xlsxMergeCells struct {\n\tXMLName xml.Name //`xml:\"mergeCells,omitempty\"`\n\tCount int `xml:\"count,attr,omitempty\"`\n\tCells []xlsxMergeCell `xml:\"mergeCell,omitempty\"`\n}\n\n// Return the cartesian extent of a merged cell range from its origin\n// cell (the closest merged cell to the to left of the sheet.\nfunc (mc *xlsxMergeCells) getExtent(cellRef string) (int, int, error) {\n\tif mc == nil {\n\t\treturn 0, 0, nil\n\t}\n\tfor _, cell := range mc.Cells {\n\t\tif strings.HasPrefix(cell.Ref, cellRef+\":\") {\n\t\t\tparts := strings.Split(cell.Ref, \":\")\n\t\t\tstartx, starty, err := GetCoordsFromCellIDString(parts[0])\n\t\t\tif err != nil {\n\t\t\t\treturn -1, -1, err\n\t\t\t}\n\t\t\tendx, endy, err := GetCoordsFromCellIDString(parts[1])\n\t\t\tif err != nil {\n\t\t\t\treturn -2, -2, err\n\t\t\t}\n\t\t\treturn endx - startx, endy - starty, nil\n\t\t}\n\t}\n\treturn 0, 0, nil\n}\n\n// xlsxC directly maps the c element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxC struct {\n\tR string `xml:\"r,attr\"` // Cell ID, e.g. A1\n\tS int `xml:\"s,attr,omitempty\"` // Style reference.\n\tT string `xml:\"t,attr,omitempty\"` // Type.\n\tF *xlsxF `xml:\"f,omitempty\"` // Formula\n\tV string `xml:\"v,omitempty\"` // Value\n\tIs *xlsxSI `xml:\"is,omitempty\"` // Inline String.\n}\n\n// xlsxF directly maps the f element in the namespace\n// http://schemas.openxmlformats.org/spreadsheetml/2006/main -\n// currently I have not checked it for completeness - it does as much\n// as I need.\ntype xlsxF struct {\n\tContent string `xml:\",chardata\"`\n\tT string `xml:\"t,attr,omitempty\"` // Formula type\n\tRef string `xml:\"ref,attr,omitempty\"` // Shared formula ref\n\tSi int `xml:\"si,attr,omitempty\"` // Shared formula index\n}\n\n// Create a new XLSX Worksheet with default values populated.\n// Strictly for internal use only!\nfunc newXlsxWorksheet() (worksheet *xlsxWorksheet) {\n\tworksheet = &xlsxWorksheet{}\n\tworksheet.SheetPr.FilterMode = false\n\tworksheet.SheetPr.PageSetUpPr = make([]xlsxPageSetUpPr, 1)\n\tworksheet.SheetPr.PageSetUpPr[0] = xlsxPageSetUpPr{FitToPage: false}\n\tworksheet.SheetViews.SheetView = make([]xlsxSheetView, 1)\n\tworksheet.SheetViews.SheetView[0] = xlsxSheetView{\n\t\tColorId: 64,\n\t\tDefaultGridColor: true,\n\t\tRightToLeft: false,\n\t\tSelection: make([]xlsxSelection, 1),\n\t\tShowFormulas: false,\n\t\tShowGridLines: true,\n\t\tShowOutlineSymbols: true,\n\t\tShowRowColHeaders: true,\n\t\tShowZeros: true,\n\t\tTabSelected: false,\n\t\tTopLeftCell: \"A1\",\n\t\tView: \"normal\",\n\t\tWindowProtection: false,\n\t\tWorkbookViewId: 0,\n\t\tZoomScale: 100,\n\t\tZoomScaleNormal: 100,\n\t\tZoomScalePageLayoutView: 100}\n\tworksheet.SheetViews.SheetView[0].Selection[0] = xlsxSelection{\n\t\tPane: \"topLeft\",\n\t\tActiveCell: \"A1\",\n\t\tActiveCellId: 0,\n\t\tSQRef: \"A1\"}\n\tworksheet.SheetFormatPr.DefaultRowHeight = 12.85\n\tworksheet.PrintOptions.Headings = false\n\tworksheet.PrintOptions.GridLines = false\n\tworksheet.PrintOptions.GridLinesSet = true\n\tworksheet.PrintOptions.HorizontalCentered = false\n\tworksheet.PrintOptions.VerticalCentered = false\n\tworksheet.PageMargins.Left = 0.7875\n\tworksheet.PageMargins.Right = 0.7875\n\tworksheet.PageMargins.Top = 1.05277777777778\n\tworksheet.PageMargins.Bottom = 1.05277777777778\n\tworksheet.PageMargins.Header = 0.7875\n\tworksheet.PageMargins.Footer = 0.7875\n\tworksheet.PageSetUp.PaperSize = \"9\"\n\tworksheet.PageSetUp.Scale = 100\n\tworksheet.PageSetUp.FirstPageNumber = 1\n\tworksheet.PageSetUp.FitToWidth = 1\n\tworksheet.PageSetUp.FitToHeight = 1\n\tworksheet.PageSetUp.PageOrder = \"downThenOver\"\n\tworksheet.PageSetUp.Orientation = \"portrait\"\n\tworksheet.PageSetUp.UsePrinterDefaults = false\n\tworksheet.PageSetUp.BlackAndWhite = false\n\tworksheet.PageSetUp.Draft = false\n\tworksheet.PageSetUp.CellComments = \"none\"\n\tworksheet.PageSetUp.UseFirstPageNumber = true\n\tworksheet.PageSetUp.HorizontalDPI = 300\n\tworksheet.PageSetUp.VerticalDPI = 300\n\tworksheet.PageSetUp.Copies = 1\n\tworksheet.HeaderFooter.OddHeader = make([]xlsxOddHeader, 1)\n\tworksheet.HeaderFooter.OddHeader[0] = xlsxOddHeader{Content: `&C&\"Times New Roman,Regular\"&12&A`}\n\tworksheet.HeaderFooter.OddFooter = make([]xlsxOddFooter, 1)\n\tworksheet.HeaderFooter.OddFooter[0] = xlsxOddFooter{Content: `&C&\"Times New Roman,Regular\"&12Page &P`}\n\n\treturn\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/0_importpath.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec // import \"github.com/ugorji/go/codec\"\n\n// This establishes that this package must be imported as github.com/ugorji/go/codec.\n// It makes forking easier, and plays well with pre-module releases of go.\n" }, { "path": "vendor/github.com/ugorji/go/codec/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2012-2015 Ugorji Nwoke.\nAll rights reserved.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/ugorji/go/codec/binc.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"math\"\n\t\"reflect\"\n\t\"time\"\n)\n\nconst bincDoPrune = true // No longer needed. Needed before as C lib did not support pruning.\n\n// vd as low 4 bits (there are 16 slots)\nconst (\n\tbincVdSpecial byte = iota\n\tbincVdPosInt\n\tbincVdNegInt\n\tbincVdFloat\n\n\tbincVdString\n\tbincVdByteArray\n\tbincVdArray\n\tbincVdMap\n\n\tbincVdTimestamp\n\tbincVdSmallInt\n\tbincVdUnicodeOther\n\tbincVdSymbol\n\n\tbincVdDecimal\n\t_ // open slot\n\t_ // open slot\n\tbincVdCustomExt = 0x0f\n)\n\nconst (\n\tbincSpNil byte = iota\n\tbincSpFalse\n\tbincSpTrue\n\tbincSpNan\n\tbincSpPosInf\n\tbincSpNegInf\n\tbincSpZeroFloat\n\tbincSpZero\n\tbincSpNegOne\n)\n\nconst (\n\tbincFlBin16 byte = iota\n\tbincFlBin32\n\t_ // bincFlBin32e\n\tbincFlBin64\n\t_ // bincFlBin64e\n\t// others not currently supported\n)\n\nfunc bincdesc(vd, vs byte) string {\n\tswitch vd {\n\tcase bincVdSpecial:\n\t\tswitch vs {\n\t\tcase bincSpNil:\n\t\t\treturn \"nil\"\n\t\tcase bincSpFalse:\n\t\t\treturn \"false\"\n\t\tcase bincSpTrue:\n\t\t\treturn \"true\"\n\t\tcase bincSpNan, bincSpPosInf, bincSpNegInf, bincSpZeroFloat:\n\t\t\treturn \"float\"\n\t\tcase bincSpZero:\n\t\t\treturn \"uint\"\n\t\tcase bincSpNegOne:\n\t\t\treturn \"int\"\n\t\tdefault:\n\t\t\treturn \"unknown\"\n\t\t}\n\tcase bincVdSmallInt, bincVdPosInt:\n\t\treturn \"uint\"\n\tcase bincVdNegInt:\n\t\treturn \"int\"\n\tcase bincVdFloat:\n\t\treturn \"float\"\n\tcase bincVdSymbol:\n\t\treturn \"string\"\n\tcase bincVdString:\n\t\treturn \"string\"\n\tcase bincVdByteArray:\n\t\treturn \"bytes\"\n\tcase bincVdTimestamp:\n\t\treturn \"time\"\n\tcase bincVdCustomExt:\n\t\treturn \"ext\"\n\tcase bincVdArray:\n\t\treturn \"array\"\n\tcase bincVdMap:\n\t\treturn \"map\"\n\tdefault:\n\t\treturn \"unknown\"\n\t}\n}\n\ntype bincEncDriver struct {\n\tencDriverNoopContainerWriter\n\te *Encoder\n\th *BincHandle\n\tw *encWriterSwitch\n\tm map[string]uint16 // symbols\n\tb [16]byte // scratch, used for encoding numbers - bigendian style\n\ts uint16 // symbols sequencer\n\t// c containerState\n\t// encDriverTrackContainerWriter\n\tnoBuiltInTypes\n\t// encNoSeparator\n\t// _ [1]uint64 // padding\n}\n\nfunc (e *bincEncDriver) EncodeNil() {\n\te.w.writen1(bincVdSpecial<<4 | bincSpNil)\n}\n\nfunc (e *bincEncDriver) EncodeTime(t time.Time) {\n\tif t.IsZero() {\n\t\te.EncodeNil()\n\t} else {\n\t\tbs := bincEncodeTime(t)\n\t\te.w.writen1(bincVdTimestamp<<4 | uint8(len(bs)))\n\t\te.w.writeb(bs)\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeBool(b bool) {\n\tif b {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpTrue)\n\t} else {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpFalse)\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeFloat32(f float32) {\n\tif f == 0 {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpZeroFloat)\n\t\treturn\n\t}\n\te.w.writen1(bincVdFloat<<4 | bincFlBin32)\n\tbigenHelper{e.b[:4], e.w}.writeUint32(math.Float32bits(f))\n}\n\nfunc (e *bincEncDriver) EncodeFloat64(f float64) {\n\tif f == 0 {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpZeroFloat)\n\t\treturn\n\t}\n\tbigen.PutUint64(e.b[:8], math.Float64bits(f))\n\tif bincDoPrune {\n\t\ti := 7\n\t\tfor ; i >= 0 && (e.b[i] == 0); i-- {\n\t\t}\n\t\ti++\n\t\tif i <= 6 {\n\t\t\te.w.writen1(bincVdFloat<<4 | 0x8 | bincFlBin64)\n\t\t\te.w.writen1(byte(i))\n\t\t\te.w.writeb(e.b[:i])\n\t\t\treturn\n\t\t}\n\t}\n\te.w.writen1(bincVdFloat<<4 | bincFlBin64)\n\te.w.writeb(e.b[:8])\n}\n\nfunc (e *bincEncDriver) encIntegerPrune(bd byte, pos bool, v uint64, lim uint8) {\n\tif lim == 4 {\n\t\tbigen.PutUint32(e.b[:lim], uint32(v))\n\t} else {\n\t\tbigen.PutUint64(e.b[:lim], v)\n\t}\n\tif bincDoPrune {\n\t\ti := pruneSignExt(e.b[:lim], pos)\n\t\te.w.writen1(bd | lim - 1 - byte(i))\n\t\te.w.writeb(e.b[i:lim])\n\t} else {\n\t\te.w.writen1(bd | lim - 1)\n\t\te.w.writeb(e.b[:lim])\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeInt(v int64) {\n\t// const nbd byte = bincVdNegInt << 4\n\tif v >= 0 {\n\t\te.encUint(bincVdPosInt<<4, true, uint64(v))\n\t} else if v == -1 {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpNegOne)\n\t} else {\n\t\te.encUint(bincVdNegInt<<4, false, uint64(-v))\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeUint(v uint64) {\n\te.encUint(bincVdPosInt<<4, true, v)\n}\n\nfunc (e *bincEncDriver) encUint(bd byte, pos bool, v uint64) {\n\tif v == 0 {\n\t\te.w.writen1(bincVdSpecial<<4 | bincSpZero)\n\t} else if pos && v >= 1 && v <= 16 {\n\t\te.w.writen1(bincVdSmallInt<<4 | byte(v-1))\n\t} else if v <= math.MaxUint8 {\n\t\te.w.writen2(bd|0x0, byte(v))\n\t} else if v <= math.MaxUint16 {\n\t\te.w.writen1(bd | 0x01)\n\t\tbigenHelper{e.b[:2], e.w}.writeUint16(uint16(v))\n\t} else if v <= math.MaxUint32 {\n\t\te.encIntegerPrune(bd, pos, v, 4)\n\t} else {\n\t\te.encIntegerPrune(bd, pos, v, 8)\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeExt(rv interface{}, xtag uint64, ext Ext, _ *Encoder) {\n\tbs := ext.WriteExt(rv)\n\tif bs == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.encodeExtPreamble(uint8(xtag), len(bs))\n\te.w.writeb(bs)\n}\n\nfunc (e *bincEncDriver) EncodeRawExt(re *RawExt, _ *Encoder) {\n\te.encodeExtPreamble(uint8(re.Tag), len(re.Data))\n\te.w.writeb(re.Data)\n}\n\nfunc (e *bincEncDriver) encodeExtPreamble(xtag byte, length int) {\n\te.encLen(bincVdCustomExt<<4, uint64(length))\n\te.w.writen1(xtag)\n}\n\nfunc (e *bincEncDriver) WriteArrayStart(length int) {\n\te.encLen(bincVdArray<<4, uint64(length))\n}\n\nfunc (e *bincEncDriver) WriteMapStart(length int) {\n\te.encLen(bincVdMap<<4, uint64(length))\n}\n\nfunc (e *bincEncDriver) EncodeSymbol(v string) {\n\t// if WriteSymbolsNoRefs {\n\t// \te.encodeString(cUTF8, v)\n\t// \treturn\n\t// }\n\n\t//symbols only offer benefit when string length > 1.\n\t//This is because strings with length 1 take only 2 bytes to store\n\t//(bd with embedded length, and single byte for string val).\n\n\tl := len(v)\n\tif l == 0 {\n\t\te.encBytesLen(cUTF8, 0)\n\t\treturn\n\t} else if l == 1 {\n\t\te.encBytesLen(cUTF8, 1)\n\t\te.w.writen1(v[0])\n\t\treturn\n\t}\n\tif e.m == nil {\n\t\te.m = make(map[string]uint16, 16)\n\t}\n\tui, ok := e.m[v]\n\tif ok {\n\t\tif ui <= math.MaxUint8 {\n\t\t\te.w.writen2(bincVdSymbol<<4, byte(ui))\n\t\t} else {\n\t\t\te.w.writen1(bincVdSymbol<<4 | 0x8)\n\t\t\tbigenHelper{e.b[:2], e.w}.writeUint16(ui)\n\t\t}\n\t} else {\n\t\te.s++\n\t\tui = e.s\n\t\t//ui = uint16(atomic.AddUint32(&e.s, 1))\n\t\te.m[v] = ui\n\t\tvar lenprec uint8\n\t\tif l <= math.MaxUint8 {\n\t\t\t// lenprec = 0\n\t\t} else if l <= math.MaxUint16 {\n\t\t\tlenprec = 1\n\t\t} else if int64(l) <= math.MaxUint32 {\n\t\t\tlenprec = 2\n\t\t} else {\n\t\t\tlenprec = 3\n\t\t}\n\t\tif ui <= math.MaxUint8 {\n\t\t\te.w.writen2(bincVdSymbol<<4|0x0|0x4|lenprec, byte(ui))\n\t\t} else {\n\t\t\te.w.writen1(bincVdSymbol<<4 | 0x8 | 0x4 | lenprec)\n\t\t\tbigenHelper{e.b[:2], e.w}.writeUint16(ui)\n\t\t}\n\t\tif lenprec == 0 {\n\t\t\te.w.writen1(byte(l))\n\t\t} else if lenprec == 1 {\n\t\t\tbigenHelper{e.b[:2], e.w}.writeUint16(uint16(l))\n\t\t} else if lenprec == 2 {\n\t\t\tbigenHelper{e.b[:4], e.w}.writeUint32(uint32(l))\n\t\t} else {\n\t\t\tbigenHelper{e.b[:8], e.w}.writeUint64(uint64(l))\n\t\t}\n\t\te.w.writestr(v)\n\t}\n}\n\nfunc (e *bincEncDriver) EncodeStringEnc(c charEncoding, v string) {\n\tif e.e.c == containerMapKey && c == cUTF8 && (e.h.AsSymbols == 0 || e.h.AsSymbols == 1) {\n\t\te.EncodeSymbol(v)\n\t\treturn\n\t}\n\tl := uint64(len(v))\n\te.encLen(bincVdString<<4, l) // e.encBytesLen(c, l)\n\tif l > 0 {\n\t\te.w.writestr(v)\n\t}\n\n}\n\nfunc (e *bincEncDriver) EncodeStringBytesRaw(v []byte) {\n\tif v == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tl := uint64(len(v))\n\te.encLen(bincVdByteArray<<4, l) // e.encBytesLen(c, l)\n\tif l > 0 {\n\t\te.w.writeb(v)\n\t}\n}\n\nfunc (e *bincEncDriver) encBytesLen(c charEncoding, length uint64) {\n\t//TODO: support bincUnicodeOther (for now, just use string or bytearray)\n\tif c == cRAW {\n\t\te.encLen(bincVdByteArray<<4, length)\n\t} else {\n\t\te.encLen(bincVdString<<4, length)\n\t}\n}\n\nfunc (e *bincEncDriver) encLen(bd byte, l uint64) {\n\tif l < 12 {\n\t\te.w.writen1(bd | uint8(l+4))\n\t} else {\n\t\te.encLenNumber(bd, l)\n\t}\n}\n\nfunc (e *bincEncDriver) encLenNumber(bd byte, v uint64) {\n\tif v <= math.MaxUint8 {\n\t\te.w.writen2(bd, byte(v))\n\t} else if v <= math.MaxUint16 {\n\t\te.w.writen1(bd | 0x01)\n\t\tbigenHelper{e.b[:2], e.w}.writeUint16(uint16(v))\n\t} else if v <= math.MaxUint32 {\n\t\te.w.writen1(bd | 0x02)\n\t\tbigenHelper{e.b[:4], e.w}.writeUint32(uint32(v))\n\t} else {\n\t\te.w.writen1(bd | 0x03)\n\t\tbigenHelper{e.b[:8], e.w}.writeUint64(uint64(v))\n\t}\n}\n\n//------------------------------------\n\ntype bincDecSymbol struct {\n\ts string\n\tb []byte\n\ti uint16\n}\n\ntype bincDecDriver struct {\n\tdecDriverNoopContainerReader\n\tnoBuiltInTypes\n\n\td *Decoder\n\th *BincHandle\n\tr *decReaderSwitch\n\tbr bool // bytes reader\n\tbdRead bool\n\tbd byte\n\tvd byte\n\tvs byte\n\t// _ [3]byte // padding\n\t// linear searching on this slice is ok,\n\t// because we typically expect < 32 symbols in each stream.\n\ts []bincDecSymbol\n\n\t// noStreamingCodec\n\t// decNoSeparator\n\n\tb [(8 + 1) * 8]byte // scratch\n}\n\nfunc (d *bincDecDriver) readNextBd() {\n\td.bd = d.r.readn1()\n\td.vd = d.bd >> 4\n\td.vs = d.bd & 0x0f\n\td.bdRead = true\n}\n\nfunc (d *bincDecDriver) uncacheRead() {\n\tif d.bdRead {\n\t\td.r.unreadn1()\n\t\td.bdRead = false\n\t}\n}\n\nfunc (d *bincDecDriver) ContainerType() (vt valueType) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.vd == bincVdSpecial && d.vs == bincSpNil {\n\t\treturn valueTypeNil\n\t} else if d.vd == bincVdByteArray {\n\t\treturn valueTypeBytes\n\t} else if d.vd == bincVdString {\n\t\treturn valueTypeString\n\t} else if d.vd == bincVdArray {\n\t\treturn valueTypeArray\n\t} else if d.vd == bincVdMap {\n\t\treturn valueTypeMap\n\t}\n\t// else {\n\t// d.d.errorf(\"isContainerType: unsupported parameter: %v\", vt)\n\t// }\n\treturn valueTypeUnset\n}\n\nfunc (d *bincDecDriver) TryDecodeAsNil() bool {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == bincVdSpecial<<4|bincSpNil {\n\t\td.bdRead = false\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *bincDecDriver) DecodeTime() (t time.Time) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == bincVdSpecial<<4|bincSpNil {\n\t\td.bdRead = false\n\t\treturn\n\t}\n\tif d.vd != bincVdTimestamp {\n\t\td.d.errorf(\"cannot decode time - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\tt, err := bincDecodeTime(d.r.readx(uint(d.vs)))\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) decFloatPre(vs, defaultLen byte) {\n\tif vs&0x8 == 0 {\n\t\td.r.readb(d.b[0:defaultLen])\n\t} else {\n\t\tl := d.r.readn1()\n\t\tif l > 8 {\n\t\t\td.d.errorf(\"cannot read float - at most 8 bytes used to represent float - received %v bytes\", l)\n\t\t\treturn\n\t\t}\n\t\tfor i := l; i < 8; i++ {\n\t\t\td.b[i] = 0\n\t\t}\n\t\td.r.readb(d.b[0:l])\n\t}\n}\n\nfunc (d *bincDecDriver) decFloat() (f float64) {\n\t//if true { f = math.Float64frombits(bigen.Uint64(d.r.readx(8))); break; }\n\tif x := d.vs & 0x7; x == bincFlBin32 {\n\t\td.decFloatPre(d.vs, 4)\n\t\tf = float64(math.Float32frombits(bigen.Uint32(d.b[0:4])))\n\t} else if x == bincFlBin64 {\n\t\td.decFloatPre(d.vs, 8)\n\t\tf = math.Float64frombits(bigen.Uint64(d.b[0:8]))\n\t} else {\n\t\td.d.errorf(\"read float - only float32 and float64 are supported - %s %x-%x/%s\",\n\t\t\tmsgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *bincDecDriver) decUint() (v uint64) {\n\t// need to inline the code (interface conversion and type assertion expensive)\n\tswitch d.vs {\n\tcase 0:\n\t\tv = uint64(d.r.readn1())\n\tcase 1:\n\t\td.r.readb(d.b[6:8])\n\t\tv = uint64(bigen.Uint16(d.b[6:8]))\n\tcase 2:\n\t\td.b[4] = 0\n\t\td.r.readb(d.b[5:8])\n\t\tv = uint64(bigen.Uint32(d.b[4:8]))\n\tcase 3:\n\t\td.r.readb(d.b[4:8])\n\t\tv = uint64(bigen.Uint32(d.b[4:8]))\n\tcase 4, 5, 6:\n\t\tlim := 7 - d.vs\n\t\td.r.readb(d.b[lim:8])\n\t\tfor i := uint8(0); i < lim; i++ {\n\t\t\td.b[i] = 0\n\t\t}\n\t\tv = uint64(bigen.Uint64(d.b[:8]))\n\tcase 7:\n\t\td.r.readb(d.b[:8])\n\t\tv = uint64(bigen.Uint64(d.b[:8]))\n\tdefault:\n\t\td.d.errorf(\"unsigned integers with greater than 64 bits of precision not supported\")\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *bincDecDriver) decCheckInteger() (ui uint64, neg bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tvd, vs := d.vd, d.vs\n\tif vd == bincVdPosInt {\n\t\tui = d.decUint()\n\t} else if vd == bincVdNegInt {\n\t\tui = d.decUint()\n\t\tneg = true\n\t} else if vd == bincVdSmallInt {\n\t\tui = uint64(d.vs) + 1\n\t} else if vd == bincVdSpecial {\n\t\tif vs == bincSpZero {\n\t\t\t//i = 0\n\t\t} else if vs == bincSpNegOne {\n\t\t\tneg = true\n\t\t\tui = 1\n\t\t} else {\n\t\t\td.d.errorf(\"integer decode fails - invalid special value from descriptor %x-%x/%s\",\n\t\t\t\td.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\t\treturn\n\t\t}\n\t} else {\n\t\td.d.errorf(\"integer can only be decoded from int/uint. d.bd: 0x%x, d.vd: 0x%x\", d.bd, d.vd)\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeInt64() (i int64) {\n\tui, neg := d.decCheckInteger()\n\ti = chkOvf.SignedIntV(ui)\n\tif neg {\n\t\ti = -i\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeUint64() (ui uint64) {\n\tui, neg := d.decCheckInteger()\n\tif neg {\n\t\td.d.errorf(\"assigning negative signed value to unsigned integer type\")\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeFloat64() (f float64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tvd, vs := d.vd, d.vs\n\tif vd == bincVdSpecial {\n\t\td.bdRead = false\n\t\tif vs == bincSpNan {\n\t\t\treturn math.NaN()\n\t\t} else if vs == bincSpPosInf {\n\t\t\treturn math.Inf(1)\n\t\t} else if vs == bincSpZeroFloat || vs == bincSpZero {\n\t\t\treturn\n\t\t} else if vs == bincSpNegInf {\n\t\t\treturn math.Inf(-1)\n\t\t} else {\n\t\t\td.d.errorf(\"float - invalid special value from descriptor %x-%x/%s\",\n\t\t\t\td.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\t\treturn\n\t\t}\n\t} else if vd == bincVdFloat {\n\t\tf = d.decFloat()\n\t} else {\n\t\tf = float64(d.DecodeInt64())\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// bool can be decoded from bool only (single byte).\nfunc (d *bincDecDriver) DecodeBool() (b bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif bd := d.bd; bd == (bincVdSpecial | bincSpFalse) {\n\t\t// b = false\n\t} else if bd == (bincVdSpecial | bincSpTrue) {\n\t\tb = true\n\t} else {\n\t\td.d.errorf(\"bool - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) ReadMapStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.vd != bincVdMap {\n\t\td.d.errorf(\"map - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\tlength = d.decLen()\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) ReadArrayStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.vd != bincVdArray {\n\t\td.d.errorf(\"array - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\tlength = d.decLen()\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) decLen() int {\n\tif d.vs > 3 {\n\t\treturn int(d.vs - 4)\n\t}\n\treturn int(d.decLenNumber())\n}\n\nfunc (d *bincDecDriver) decLenNumber() (v uint64) {\n\tif x := d.vs; x == 0 {\n\t\tv = uint64(d.r.readn1())\n\t} else if x == 1 {\n\t\td.r.readb(d.b[6:8])\n\t\tv = uint64(bigen.Uint16(d.b[6:8]))\n\t} else if x == 2 {\n\t\td.r.readb(d.b[4:8])\n\t\tv = uint64(bigen.Uint32(d.b[4:8]))\n\t} else {\n\t\td.r.readb(d.b[:8])\n\t\tv = bigen.Uint64(d.b[:8])\n\t}\n\treturn\n}\n\nfunc (d *bincDecDriver) decStringAndBytes(bs []byte, withString, zerocopy bool) (\n\tbs2 []byte, s string) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == bincVdSpecial<<4|bincSpNil {\n\t\td.bdRead = false\n\t\treturn\n\t}\n\tvar slen = -1\n\t// var ok bool\n\tswitch d.vd {\n\tcase bincVdString, bincVdByteArray:\n\t\tslen = d.decLen()\n\t\tif zerocopy {\n\t\t\tif d.br {\n\t\t\t\tbs2 = d.r.readx(uint(slen))\n\t\t\t} else if len(bs) == 0 {\n\t\t\t\tbs2 = decByteSlice(d.r, slen, d.d.h.MaxInitLen, d.b[:])\n\t\t\t} else {\n\t\t\t\tbs2 = decByteSlice(d.r, slen, d.d.h.MaxInitLen, bs)\n\t\t\t}\n\t\t} else {\n\t\t\tbs2 = decByteSlice(d.r, slen, d.d.h.MaxInitLen, bs)\n\t\t}\n\t\tif withString {\n\t\t\ts = string(bs2)\n\t\t}\n\tcase bincVdSymbol:\n\t\t// zerocopy doesn't apply for symbols,\n\t\t// as the values must be stored in a table for later use.\n\t\t//\n\t\t//from vs: extract numSymbolBytes, containsStringVal, strLenPrecision,\n\t\t//extract symbol\n\t\t//if containsStringVal, read it and put in map\n\t\t//else look in map for string value\n\t\tvar symbol uint16\n\t\tvs := d.vs\n\t\tif vs&0x8 == 0 {\n\t\t\tsymbol = uint16(d.r.readn1())\n\t\t} else {\n\t\t\tsymbol = uint16(bigen.Uint16(d.r.readx(2)))\n\t\t}\n\t\tif d.s == nil {\n\t\t\td.s = make([]bincDecSymbol, 0, 16)\n\t\t}\n\n\t\tif vs&0x4 == 0 {\n\t\t\tfor i := range d.s {\n\t\t\t\tj := &d.s[i]\n\t\t\t\tif j.i == symbol {\n\t\t\t\t\tbs2 = j.b\n\t\t\t\t\tif withString {\n\t\t\t\t\t\tif j.s == \"\" && bs2 != nil {\n\t\t\t\t\t\t\tj.s = string(bs2)\n\t\t\t\t\t\t}\n\t\t\t\t\t\ts = j.s\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tswitch vs & 0x3 {\n\t\t\tcase 0:\n\t\t\t\tslen = int(d.r.readn1())\n\t\t\tcase 1:\n\t\t\t\tslen = int(bigen.Uint16(d.r.readx(2)))\n\t\t\tcase 2:\n\t\t\t\tslen = int(bigen.Uint32(d.r.readx(4)))\n\t\t\tcase 3:\n\t\t\t\tslen = int(bigen.Uint64(d.r.readx(8)))\n\t\t\t}\n\t\t\t// since using symbols, do not store any part of\n\t\t\t// the parameter bs in the map, as it might be a shared buffer.\n\t\t\t// bs2 = decByteSlice(d.r, slen, bs)\n\t\t\tbs2 = decByteSlice(d.r, slen, d.d.h.MaxInitLen, nil)\n\t\t\tif withString {\n\t\t\t\ts = string(bs2)\n\t\t\t}\n\t\t\td.s = append(d.s, bincDecSymbol{i: symbol, s: s, b: bs2})\n\t\t}\n\tdefault:\n\t\td.d.errorf(\"string/bytes - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeString() (s string) {\n\t// DecodeBytes does not accommodate symbols, whose impl stores string version in map.\n\t// Use decStringAndBytes directly.\n\t// return string(d.DecodeBytes(d.b[:], true, true))\n\t_, s = d.decStringAndBytes(d.b[:], true, true)\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeStringAsBytes() (s []byte) {\n\ts, _ = d.decStringAndBytes(d.b[:], false, true)\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeBytes(bs []byte, zerocopy bool) (bsOut []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == bincVdSpecial<<4|bincSpNil {\n\t\td.bdRead = false\n\t\treturn nil\n\t}\n\t// check if an \"array\" of uint8's (see ContainerType for how to infer if an array)\n\tif d.vd == bincVdArray {\n\t\tbsOut, _ = fastpathTV.DecSliceUint8V(bs, true, d.d)\n\t\treturn\n\t}\n\tvar clen int\n\tif d.vd == bincVdString || d.vd == bincVdByteArray {\n\t\tclen = d.decLen()\n\t} else {\n\t\td.d.errorf(\"bytes - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\td.bdRead = false\n\tif zerocopy {\n\t\tif d.br {\n\t\t\treturn d.r.readx(uint(clen))\n\t\t} else if len(bs) == 0 {\n\t\t\tbs = d.b[:]\n\t\t}\n\t}\n\treturn decByteSlice(d.r, clen, d.d.h.MaxInitLen, bs)\n}\n\nfunc (d *bincDecDriver) DecodeExt(rv interface{}, xtag uint64, ext Ext) (realxtag uint64) {\n\tif xtag > 0xff {\n\t\td.d.errorf(\"ext: tag must be <= 0xff; got: %v\", xtag)\n\t\treturn\n\t}\n\trealxtag1, xbs := d.decodeExtV(ext != nil, uint8(xtag))\n\trealxtag = uint64(realxtag1)\n\tif ext == nil {\n\t\tre := rv.(*RawExt)\n\t\tre.Tag = realxtag\n\t\tre.Data = detachZeroCopyBytes(d.br, re.Data, xbs)\n\t} else {\n\t\text.ReadExt(rv, xbs)\n\t}\n\treturn\n}\n\nfunc (d *bincDecDriver) decodeExtV(verifyTag bool, tag byte) (xtag byte, xbs []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.vd == bincVdCustomExt {\n\t\tl := d.decLen()\n\t\txtag = d.r.readn1()\n\t\tif verifyTag && xtag != tag {\n\t\t\td.d.errorf(\"wrong extension tag - got %b, expecting: %v\", xtag, tag)\n\t\t\treturn\n\t\t}\n\t\tif d.br {\n\t\t\txbs = d.r.readx(uint(l))\n\t\t} else {\n\t\t\txbs = decByteSlice(d.r, l, d.d.h.MaxInitLen, d.d.b[:])\n\t\t}\n\t} else if d.vd == bincVdByteArray {\n\t\txbs = d.DecodeBytes(nil, true)\n\t} else {\n\t\td.d.errorf(\"ext - expecting extensions or byte array - %s %x-%x/%s\",\n\t\t\tmsgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *bincDecDriver) DecodeNaked() {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\n\tn := d.d.naked()\n\tvar decodeFurther bool\n\n\tswitch d.vd {\n\tcase bincVdSpecial:\n\t\tswitch d.vs {\n\t\tcase bincSpNil:\n\t\t\tn.v = valueTypeNil\n\t\tcase bincSpFalse:\n\t\t\tn.v = valueTypeBool\n\t\t\tn.b = false\n\t\tcase bincSpTrue:\n\t\t\tn.v = valueTypeBool\n\t\t\tn.b = true\n\t\tcase bincSpNan:\n\t\t\tn.v = valueTypeFloat\n\t\t\tn.f = math.NaN()\n\t\tcase bincSpPosInf:\n\t\t\tn.v = valueTypeFloat\n\t\t\tn.f = math.Inf(1)\n\t\tcase bincSpNegInf:\n\t\t\tn.v = valueTypeFloat\n\t\t\tn.f = math.Inf(-1)\n\t\tcase bincSpZeroFloat:\n\t\t\tn.v = valueTypeFloat\n\t\t\tn.f = float64(0)\n\t\tcase bincSpZero:\n\t\t\tn.v = valueTypeUint\n\t\t\tn.u = uint64(0) // int8(0)\n\t\tcase bincSpNegOne:\n\t\t\tn.v = valueTypeInt\n\t\t\tn.i = int64(-1) // int8(-1)\n\t\tdefault:\n\t\t\td.d.errorf(\"cannot infer value - unrecognized special value from descriptor %x-%x/%s\",\n\t\t\t\td.vd, d.vs, bincdesc(d.vd, d.vs))\n\t\t}\n\tcase bincVdSmallInt:\n\t\tn.v = valueTypeUint\n\t\tn.u = uint64(int8(d.vs)) + 1 // int8(d.vs) + 1\n\tcase bincVdPosInt:\n\t\tn.v = valueTypeUint\n\t\tn.u = d.decUint()\n\tcase bincVdNegInt:\n\t\tn.v = valueTypeInt\n\t\tn.i = -(int64(d.decUint()))\n\tcase bincVdFloat:\n\t\tn.v = valueTypeFloat\n\t\tn.f = d.decFloat()\n\tcase bincVdSymbol:\n\t\tn.v = valueTypeSymbol\n\t\tn.s = d.DecodeString()\n\tcase bincVdString:\n\t\tn.v = valueTypeString\n\t\tn.s = d.DecodeString()\n\tcase bincVdByteArray:\n\t\tdecNakedReadRawBytes(d, d.d, n, d.h.RawToString)\n\tcase bincVdTimestamp:\n\t\tn.v = valueTypeTime\n\t\ttt, err := bincDecodeTime(d.r.readx(uint(d.vs)))\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tn.t = tt\n\tcase bincVdCustomExt:\n\t\tn.v = valueTypeExt\n\t\tl := d.decLen()\n\t\tn.u = uint64(d.r.readn1())\n\t\tif d.br {\n\t\t\tn.l = d.r.readx(uint(l))\n\t\t} else {\n\t\t\tn.l = decByteSlice(d.r, l, d.d.h.MaxInitLen, d.d.b[:])\n\t\t}\n\tcase bincVdArray:\n\t\tn.v = valueTypeArray\n\t\tdecodeFurther = true\n\tcase bincVdMap:\n\t\tn.v = valueTypeMap\n\t\tdecodeFurther = true\n\tdefault:\n\t\td.d.errorf(\"cannot infer value - %s %x-%x/%s\", msgBadDesc, d.vd, d.vs, bincdesc(d.vd, d.vs))\n\t}\n\n\tif !decodeFurther {\n\t\td.bdRead = false\n\t}\n\tif n.v == valueTypeUint && d.h.SignedInteger {\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(n.u)\n\t}\n}\n\n//------------------------------------\n\n//BincHandle is a Handle for the Binc Schema-Free Encoding Format\n//defined at https://github.com/ugorji/binc .\n//\n//BincHandle currently supports all Binc features with the following EXCEPTIONS:\n// - only integers up to 64 bits of precision are supported.\n// big integers are unsupported.\n// - Only IEEE 754 binary32 and binary64 floats are supported (ie Go float32 and float64 types).\n// extended precision and decimal IEEE 754 floats are unsupported.\n// - Only UTF-8 strings supported.\n// Unicode_Other Binc types (UTF16, UTF32) are currently unsupported.\n//\n//Note that these EXCEPTIONS are temporary and full support is possible and may happen soon.\ntype BincHandle struct {\n\tBasicHandle\n\tbinaryEncodingType\n\tnoElemSeparators\n\n\t// AsSymbols defines what should be encoded as symbols.\n\t//\n\t// Encoding as symbols can reduce the encoded size significantly.\n\t//\n\t// However, during decoding, each string to be encoded as a symbol must\n\t// be checked to see if it has been seen before. Consequently, encoding time\n\t// will increase if using symbols, because string comparisons has a clear cost.\n\t//\n\t// Values:\n\t// - 0: default: library uses best judgement\n\t// - 1: use symbols\n\t// - 2: do not use symbols\n\tAsSymbols uint8\n\n\t// AsSymbols: may later on introduce more options ...\n\t// - m: map keys\n\t// - s: struct fields\n\t// - n: none\n\t// - a: all: same as m, s, ...\n\n\t_ [1]uint64 // padding (cache-aligned)\n}\n\n// Name returns the name of the handle: binc\nfunc (h *BincHandle) Name() string { return \"binc\" }\n\n// SetBytesExt sets an extension\nfunc (h *BincHandle) SetBytesExt(rt reflect.Type, tag uint64, ext BytesExt) (err error) {\n\treturn h.SetExt(rt, tag, &bytesExtWrapper{BytesExt: ext})\n}\n\nfunc (h *BincHandle) newEncDriver(e *Encoder) encDriver {\n\treturn &bincEncDriver{e: e, h: h, w: e.w()}\n}\n\nfunc (h *BincHandle) newDecDriver(d *Decoder) decDriver {\n\treturn &bincDecDriver{d: d, h: h, r: d.r(), br: d.bytes}\n}\n\nfunc (e *bincEncDriver) reset() {\n\te.w = e.e.w()\n\te.s = 0\n\te.m = nil\n}\n\nfunc (d *bincDecDriver) reset() {\n\td.r, d.br = d.d.r(), d.d.bytes\n\td.s = nil\n\td.bd, d.bdRead, d.vd, d.vs = 0, false, 0, 0\n}\n\n// var timeDigits = [...]byte{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}\n\n// EncodeTime encodes a time.Time as a []byte, including\n// information on the instant in time and UTC offset.\n//\n// Format Description\n//\n// A timestamp is composed of 3 components:\n//\n// - secs: signed integer representing seconds since unix epoch\n// - nsces: unsigned integer representing fractional seconds as a\n// nanosecond offset within secs, in the range 0 <= nsecs < 1e9\n// - tz: signed integer representing timezone offset in minutes east of UTC,\n// and a dst (daylight savings time) flag\n//\n// When encoding a timestamp, the first byte is the descriptor, which\n// defines which components are encoded and how many bytes are used to\n// encode secs and nsecs components. *If secs/nsecs is 0 or tz is UTC, it\n// is not encoded in the byte array explicitly*.\n//\n// Descriptor 8 bits are of the form `A B C DDD EE`:\n// A: Is secs component encoded? 1 = true\n// B: Is nsecs component encoded? 1 = true\n// C: Is tz component encoded? 1 = true\n// DDD: Number of extra bytes for secs (range 0-7).\n// If A = 1, secs encoded in DDD+1 bytes.\n// If A = 0, secs is not encoded, and is assumed to be 0.\n// If A = 1, then we need at least 1 byte to encode secs.\n// DDD says the number of extra bytes beyond that 1.\n// E.g. if DDD=0, then secs is represented in 1 byte.\n// if DDD=2, then secs is represented in 3 bytes.\n// EE: Number of extra bytes for nsecs (range 0-3).\n// If B = 1, nsecs encoded in EE+1 bytes (similar to secs/DDD above)\n//\n// Following the descriptor bytes, subsequent bytes are:\n//\n// secs component encoded in `DDD + 1` bytes (if A == 1)\n// nsecs component encoded in `EE + 1` bytes (if B == 1)\n// tz component encoded in 2 bytes (if C == 1)\n//\n// secs and nsecs components are integers encoded in a BigEndian\n// 2-complement encoding format.\n//\n// tz component is encoded as 2 bytes (16 bits). Most significant bit 15 to\n// Least significant bit 0 are described below:\n//\n// Timezone offset has a range of -12:00 to +14:00 (ie -720 to +840 minutes).\n// Bit 15 = have\\_dst: set to 1 if we set the dst flag.\n// Bit 14 = dst\\_on: set to 1 if dst is in effect at the time, or 0 if not.\n// Bits 13..0 = timezone offset in minutes. It is a signed integer in Big Endian format.\n//\nfunc bincEncodeTime(t time.Time) []byte {\n\t//t := rv.Interface().(time.Time)\n\ttsecs, tnsecs := t.Unix(), t.Nanosecond()\n\tvar (\n\t\tbd byte\n\t\tbtmp [8]byte\n\t\tbs [16]byte\n\t\ti int = 1\n\t)\n\tl := t.Location()\n\tif l == time.UTC {\n\t\tl = nil\n\t}\n\tif tsecs != 0 {\n\t\tbd = bd | 0x80\n\t\tbigen.PutUint64(btmp[:], uint64(tsecs))\n\t\tf := pruneSignExt(btmp[:], tsecs >= 0)\n\t\tbd = bd | (byte(7-f) << 2)\n\t\tcopy(bs[i:], btmp[f:])\n\t\ti = i + (8 - f)\n\t}\n\tif tnsecs != 0 {\n\t\tbd = bd | 0x40\n\t\tbigen.PutUint32(btmp[:4], uint32(tnsecs))\n\t\tf := pruneSignExt(btmp[:4], true)\n\t\tbd = bd | byte(3-f)\n\t\tcopy(bs[i:], btmp[f:4])\n\t\ti = i + (4 - f)\n\t}\n\tif l != nil {\n\t\tbd = bd | 0x20\n\t\t// Note that Go Libs do not give access to dst flag.\n\t\t_, zoneOffset := t.Zone()\n\t\t//zoneName, zoneOffset := t.Zone()\n\t\tzoneOffset /= 60\n\t\tz := uint16(zoneOffset)\n\t\tbigen.PutUint16(btmp[:2], z)\n\t\t// clear dst flags\n\t\tbs[i] = btmp[0] & 0x3f\n\t\tbs[i+1] = btmp[1]\n\t\ti = i + 2\n\t}\n\tbs[0] = bd\n\treturn bs[0:i]\n}\n\n// bincDecodeTime decodes a []byte into a time.Time.\nfunc bincDecodeTime(bs []byte) (tt time.Time, err error) {\n\tbd := bs[0]\n\tvar (\n\t\ttsec int64\n\t\ttnsec uint32\n\t\ttz uint16\n\t\ti byte = 1\n\t\ti2 byte\n\t\tn byte\n\t)\n\tif bd&(1<<7) != 0 {\n\t\tvar btmp [8]byte\n\t\tn = ((bd >> 2) & 0x7) + 1\n\t\ti2 = i + n\n\t\tcopy(btmp[8-n:], bs[i:i2])\n\t\t//if first bit of bs[i] is set, then fill btmp[0..8-n] with 0xff (ie sign extend it)\n\t\tif bs[i]&(1<<7) != 0 {\n\t\t\tcopy(btmp[0:8-n], bsAll0xff)\n\t\t\t//for j,k := byte(0), 8-n; j < k; j++ {\tbtmp[j] = 0xff }\n\t\t}\n\t\ti = i2\n\t\ttsec = int64(bigen.Uint64(btmp[:]))\n\t}\n\tif bd&(1<<6) != 0 {\n\t\tvar btmp [4]byte\n\t\tn = (bd & 0x3) + 1\n\t\ti2 = i + n\n\t\tcopy(btmp[4-n:], bs[i:i2])\n\t\ti = i2\n\t\ttnsec = bigen.Uint32(btmp[:])\n\t}\n\tif bd&(1<<5) == 0 {\n\t\ttt = time.Unix(tsec, int64(tnsec)).UTC()\n\t\treturn\n\t}\n\t// In stdlib time.Parse, when a date is parsed without a zone name, it uses \"\" as zone name.\n\t// However, we need name here, so it can be shown when time is printf.d.\n\t// Zone name is in form: UTC-08:00.\n\t// Note that Go Libs do not give access to dst flag, so we ignore dst bits\n\n\ti2 = i + 2\n\ttz = bigen.Uint16(bs[i:i2])\n\t// i = i2\n\t// sign extend sign bit into top 2 MSB (which were dst bits):\n\tif tz&(1<<13) == 0 { // positive\n\t\ttz = tz & 0x3fff //clear 2 MSBs: dst bits\n\t} else { // negative\n\t\ttz = tz | 0xc000 //set 2 MSBs: dst bits\n\t}\n\ttzint := int16(tz)\n\tif tzint == 0 {\n\t\ttt = time.Unix(tsec, int64(tnsec)).UTC()\n\t} else {\n\t\t// For Go Time, do not use a descriptive timezone.\n\t\t// It's unnecessary, and makes it harder to do a reflect.DeepEqual.\n\t\t// The Offset already tells what the offset should be, if not on UTC and unknown zone name.\n\t\t// var zoneName = timeLocUTCName(tzint)\n\t\ttt = time.Unix(tsec, int64(tnsec)).In(time.FixedZone(\"\", int(tzint)*60))\n\t}\n\treturn\n}\n\nvar _ decDriver = (*bincDecDriver)(nil)\nvar _ encDriver = (*bincEncDriver)(nil)\n" }, { "path": "vendor/github.com/ugorji/go/codec/build.sh", "content": "#!/bin/bash\n\n# Run all the different permutations of all the tests and other things\n# This helps ensure that nothing gets broken.\n\n_tests() {\n local gover=$( go version | cut -f 3 -d ' ' )\n # note that codecgen requires fastpath, so you cannot do \"codecgen notfastpath\"\n local a=( \"\" \"safe\" \"notfastpath\" \"notfastpath safe\" \"codecgen\" \"codecgen safe\" )\n for i in \"${a[@]}\"\n do\n echo \">>>> TAGS: $i\"\n local i2=${i:-default}\n case $gover in\n go1.[0-6]*) go vet -printfuncs \"errorf\" \"$@\" &&\n go test ${zargs[*]} -vet off -tags \"$i\" \"$@\" ;;\n *) go vet -printfuncs \"errorf\" \"$@\" &&\n go test ${zargs[*]} -vet off -tags \"alltests $i\" -run \"Suite\" -coverprofile \"${i2// /-}.cov.out\" \"$@\" ;;\n esac\n if [[ \"$?\" != 0 ]]; then return 1; fi \n done\n echo \"++++++++ TEST SUITES ALL PASSED ++++++++\"\n}\n\n\n# is a generation needed?\n_ng() {\n local a=\"$1\"\n if [[ ! -e \"$a\" ]]; then echo 1; return; fi \n for i in `ls -1 *.go.tmpl gen.go values_test.go`\n do\n if [[ \"$a\" -ot \"$i\" ]]; then echo 1; return; fi \n done\n}\n\n_prependbt() {\n cat > ${2} <> ${2}\n rm -f ${1}\n}\n\n# _build generates fast-path.go and gen-helper.go.\n_build() {\n if ! [[ \"${zforce}\" || $(_ng \"fast-path.generated.go\") || $(_ng \"gen-helper.generated.go\") || $(_ng \"gen.generated.go\") ]]; then return 0; fi \n \n if [ \"${zbak}\" ]; then\n _zts=`date '+%m%d%Y_%H%M%S'`\n _gg=\".generated.go\"\n [ -e \"gen-helper${_gg}\" ] && mv gen-helper${_gg} gen-helper${_gg}__${_zts}.bak\n [ -e \"fast-path${_gg}\" ] && mv fast-path${_gg} fast-path${_gg}__${_zts}.bak\n [ -e \"gen${_gg}\" ] && mv gen${_gg} gen${_gg}__${_zts}.bak\n fi \n rm -f gen-helper.generated.go fast-path.generated.go gen.generated.go \\\n *safe.generated.go *_generated_test.go *.generated_ffjson_expose.go \n\n cat > gen.generated.go <> gen.generated.go < gen-dec-map.go.tmpl\n cat >> gen.generated.go <> gen.generated.go < gen-dec-array.go.tmpl\n cat >> gen.generated.go <> gen.generated.go < gen-enc-chan.go.tmpl\n cat >> gen.generated.go < gen-from-tmpl.codec.generated.go < gen-from-tmpl.generated.go < \" + fnameOut + \" ______\")\nfin, err := os.Open(fnameIn)\nif err != nil { panic(err) }\ndefer fin.Close()\nfout, err := os.Create(fnameOut)\nif err != nil { panic(err) }\ndefer fout.Close()\nerr = codec.GenInternalGoFile(fin, fout)\nif err != nil { panic(err) }\n}\n\nfunc main() {\nrun(\"fast-path.go.tmpl\", \"fast-path.generated.go\")\nrun(\"gen-helper.go.tmpl\", \"gen-helper.generated.go\")\nrun(\"mammoth-test.go.tmpl\", \"mammoth_generated_test.go\")\nrun(\"mammoth2-test.go.tmpl\", \"mammoth2_generated_test.go\")\n// run(\"sort-slice.go.tmpl\", \"sort-slice.generated.go\")\n}\nEOF\n\n sed -e 's+// __DO_NOT_REMOVE__NEEDED_FOR_REPLACING__IMPORT_PATH__FOR_CODEC_BENCH__+import . \"github.com/ugorji/go/codec\"+' \\\n shared_test.go > bench/shared_test.go\n\n # explicitly return 0 if this passes, else return 1\n go run -tags \"prebuild\" prebuild.go || return 1\n go run -tags \"notfastpath safe codecgen.exec\" gen-from-tmpl.generated.go || return 1\n rm -f gen-from-tmpl.*generated.go\n return 0\n}\n\n_codegenerators() {\n local c5=\"_generated_test.go\"\n local c7=\"$PWD/codecgen\"\n local c8=\"$c7/__codecgen\"\n local c9=\"codecgen-scratch.go\"\n\n if ! [[ $zforce || $(_ng \"values_codecgen${c5}\") ]]; then return 0; fi\n \n # Note: ensure you run the codecgen for this codebase/directory i.e. ./codecgen/codecgen\n true &&\n echo \"codecgen ... \" &&\n if [[ $zforce || ! -f \"$c8\" || \"$c7/gen.go\" -nt \"$c8\" ]]; then\n echo \"rebuilding codecgen ... \" && ( cd codecgen && go build -o $c8 ${zargs[*]} . )\n fi &&\n $c8 -rt codecgen -t 'codecgen generated' -o values_codecgen${c5} -d 19780 $zfin $zfin2 &&\n cp mammoth2_generated_test.go $c9 &&\n $c8 -t 'codecgen,!notfastpath generated,!notfastpath' -o mammoth2_codecgen${c5} -d 19781 mammoth2_generated_test.go &&\n rm -f $c9 &&\n echo \"generators done!\" \n}\n\n_prebuild() {\n echo \"prebuild: zforce: $zforce\"\n local d=\"$PWD\"\n local zfin=\"test_values.generated.go\"\n local zfin2=\"test_values_flex.generated.go\"\n local zpkg=\"github.com/ugorji/go/codec\"\n # zpkg=${d##*/src/}\n # zgobase=${d%%/src/*}\n # rm -f *_generated_test.go \n rm -f codecgen-*.go &&\n _build &&\n cp $d/values_test.go $d/$zfin &&\n cp $d/values_flex_test.go $d/$zfin2 &&\n _codegenerators &&\n if [[ \"$(type -t _codegenerators_external )\" = \"function\" ]]; then _codegenerators_external ; fi &&\n if [[ $zforce ]]; then go install ${zargs[*]} .; fi &&\n echo \"prebuild done successfully\"\n rm -f $d/$zfin $d/$zfin2\n # unset zfin zfin2 zpkg\n}\n\n_make() {\n local makeforce=${zforce}\n zforce=1\n (cd codecgen && go install ${zargs[*]} .) && _prebuild && go install ${zargs[*]} .\n zforce=${makeforce}\n}\n\n_clean() {\n rm -f gen-from-tmpl.*generated.go \\\n codecgen-*.go \\\n test_values.generated.go test_values_flex.generated.go\n}\n\n_release() {\n local reply\n read -p \"Pre-release validation takes a few minutes and MUST be run from within GOPATH/src. Confirm y/n? \" -n 1 -r reply\n echo\n if [[ ! $reply =~ ^[Yy]$ ]]; then return 1; fi\n\n # expects GOROOT, GOROOT_BOOTSTRAP to have been set.\n if [[ -z \"${GOROOT// }\" || -z \"${GOROOT_BOOTSTRAP// }\" ]]; then return 1; fi\n # (cd $GOROOT && git checkout -f master && git pull && git reset --hard)\n (cd $GOROOT && git pull)\n local f=`pwd`/make.release.out\n cat > $f <>$f\n if [[ \"$i\" != \"master\" ]]; then i=\"release-branch.go$i\"; fi\n (false ||\n (echo \"===== BUILDING GO SDK for branch: $i ... =====\" &&\n cd $GOROOT &&\n git checkout -f $i && git reset --hard && git clean -f . &&\n cd src && ./make.bash >>$f 2>&1 && sleep 1 ) ) &&\n echo \"===== GO SDK BUILD DONE =====\" &&\n _prebuild &&\n echo \"===== PREBUILD DONE with exit: $? =====\" &&\n _tests \"$@\"\n if [[ \"$?\" != 0 ]]; then return 1; fi\n done\n zforce=${makeforce}\n echo \"++++++++ RELEASE TEST SUITES ALL PASSED ++++++++\"\n}\n\n_usage() {\n cat < [tests, make, prebuild (force) (external), inlining diagnostics, mid-stack inlining, race detector]\n -v -> verbose\nEOF\n if [[ \"$(type -t _usage_run)\" = \"function\" ]]; then _usage_run ; fi\n}\n\n_main() {\n if [[ -z \"$1\" ]]; then _usage; return 1; fi\n local x\n local zforce\n local zargs=()\n local zverbose=()\n local zbenchflags\n # unset zforce\n zargs=()\n zbenchflags=\"\"\n OPTIND=1\n while getopts \":ctmnrgpfvlzdb:\" flag\n do\n case \"x$flag\" in\n 'xf') zforce=1 ;;\n 'xv') zverbose+=(1) ;;\n 'xl') zargs+=(\"-gcflags\"); zargs+=(\"-l=4\") ;;\n 'xn') zargs+=(\"-gcflags\"); zargs+=(\"-m=2\") ;;\n 'xd') zargs+=(\"-race\") ;;\n 'xb') x='b'; zbenchflags=${OPTARG} ;;\n x\\?) _usage; return 1 ;;\n *) x=$flag ;;\n esac\n done\n shift $((OPTIND-1))\n # echo \">>>> _main: extra args: $@\"\n case \"x$x\" in\n 'xt') _tests \"$@\" ;;\n 'xm') _make \"$@\" ;;\n 'xr') _release \"$@\" ;;\n 'xg') _go ;;\n 'xp') _prebuild \"$@\" ;;\n 'xc') _clean \"$@\" ;;\n 'xz') _analyze \"$@\" ;;\n 'xb') _bench \"$@\" ;;\n esac\n # unset zforce zargs zbenchflags\n}\n\n[ \".\" = `dirname $0` ] && _main \"$@\"\n\n" }, { "path": "vendor/github.com/ugorji/go/codec/cbor.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"math\"\n\t\"reflect\"\n\t\"time\"\n)\n\nconst (\n\tcborMajorUint byte = iota\n\tcborMajorNegInt\n\tcborMajorBytes\n\tcborMajorText\n\tcborMajorArray\n\tcborMajorMap\n\tcborMajorTag\n\tcborMajorOther\n)\n\nconst (\n\tcborBdFalse byte = 0xf4 + iota\n\tcborBdTrue\n\tcborBdNil\n\tcborBdUndefined\n\tcborBdExt\n\tcborBdFloat16\n\tcborBdFloat32\n\tcborBdFloat64\n)\n\nconst (\n\tcborBdIndefiniteBytes byte = 0x5f\n\tcborBdIndefiniteString byte = 0x7f\n\tcborBdIndefiniteArray byte = 0x9f\n\tcborBdIndefiniteMap byte = 0xbf\n\tcborBdBreak byte = 0xff\n)\n\n// These define some in-stream descriptors for\n// manual encoding e.g. when doing explicit indefinite-length\nconst (\n\tCborStreamBytes byte = 0x5f\n\tCborStreamString byte = 0x7f\n\tCborStreamArray byte = 0x9f\n\tCborStreamMap byte = 0xbf\n\tCborStreamBreak byte = 0xff\n)\n\nconst (\n\tcborBaseUint byte = 0x00\n\tcborBaseNegInt byte = 0x20\n\tcborBaseBytes byte = 0x40\n\tcborBaseString byte = 0x60\n\tcborBaseArray byte = 0x80\n\tcborBaseMap byte = 0xa0\n\tcborBaseTag byte = 0xc0\n\tcborBaseSimple byte = 0xe0\n)\n\nfunc cbordesc(bd byte) string {\n\tswitch bd {\n\tcase cborBdNil:\n\t\treturn \"nil\"\n\tcase cborBdFalse:\n\t\treturn \"false\"\n\tcase cborBdTrue:\n\t\treturn \"true\"\n\tcase cborBdFloat16, cborBdFloat32, cborBdFloat64:\n\t\treturn \"float\"\n\tcase cborBdIndefiniteBytes:\n\t\treturn \"bytes*\"\n\tcase cborBdIndefiniteString:\n\t\treturn \"string*\"\n\tcase cborBdIndefiniteArray:\n\t\treturn \"array*\"\n\tcase cborBdIndefiniteMap:\n\t\treturn \"map*\"\n\tdefault:\n\t\tswitch {\n\t\tcase bd >= cborBaseUint && bd < cborBaseNegInt:\n\t\t\treturn \"(u)int\"\n\t\tcase bd >= cborBaseNegInt && bd < cborBaseBytes:\n\t\t\treturn \"int\"\n\t\tcase bd >= cborBaseBytes && bd < cborBaseString:\n\t\t\treturn \"bytes\"\n\t\tcase bd >= cborBaseString && bd < cborBaseArray:\n\t\t\treturn \"string\"\n\t\tcase bd >= cborBaseArray && bd < cborBaseMap:\n\t\t\treturn \"array\"\n\t\tcase bd >= cborBaseMap && bd < cborBaseTag:\n\t\t\treturn \"map\"\n\t\tcase bd >= cborBaseTag && bd < cborBaseSimple:\n\t\t\treturn \"ext\"\n\t\tdefault:\n\t\t\treturn \"unknown\"\n\t\t}\n\t}\n}\n\n// -------------------\n\ntype cborEncDriver struct {\n\tnoBuiltInTypes\n\tencDriverNoopContainerWriter\n\te *Encoder\n\tw *encWriterSwitch\n\th *CborHandle\n\tx [8]byte\n\t// _ [3]uint64 // padding\n}\n\nfunc (e *cborEncDriver) EncodeNil() {\n\te.w.writen1(cborBdNil)\n}\n\nfunc (e *cborEncDriver) EncodeBool(b bool) {\n\tif b {\n\t\te.w.writen1(cborBdTrue)\n\t} else {\n\t\te.w.writen1(cborBdFalse)\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeFloat32(f float32) {\n\te.w.writen1(cborBdFloat32)\n\tbigenHelper{e.x[:4], e.w}.writeUint32(math.Float32bits(f))\n}\n\nfunc (e *cborEncDriver) EncodeFloat64(f float64) {\n\te.w.writen1(cborBdFloat64)\n\tbigenHelper{e.x[:8], e.w}.writeUint64(math.Float64bits(f))\n}\n\nfunc (e *cborEncDriver) encUint(v uint64, bd byte) {\n\tif v <= 0x17 {\n\t\te.w.writen1(byte(v) + bd)\n\t} else if v <= math.MaxUint8 {\n\t\te.w.writen2(bd+0x18, uint8(v))\n\t} else if v <= math.MaxUint16 {\n\t\te.w.writen1(bd + 0x19)\n\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(v))\n\t} else if v <= math.MaxUint32 {\n\t\te.w.writen1(bd + 0x1a)\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(v))\n\t} else { // if v <= math.MaxUint64 {\n\t\te.w.writen1(bd + 0x1b)\n\t\tbigenHelper{e.x[:8], e.w}.writeUint64(v)\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeInt(v int64) {\n\tif v < 0 {\n\t\te.encUint(uint64(-1-v), cborBaseNegInt)\n\t} else {\n\t\te.encUint(uint64(v), cborBaseUint)\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeUint(v uint64) {\n\te.encUint(v, cborBaseUint)\n}\n\nfunc (e *cborEncDriver) encLen(bd byte, length int) {\n\te.encUint(uint64(length), bd)\n}\n\nfunc (e *cborEncDriver) EncodeTime(t time.Time) {\n\tif t.IsZero() {\n\t\te.EncodeNil()\n\t} else if e.h.TimeRFC3339 {\n\t\te.encUint(0, cborBaseTag)\n\t\te.EncodeStringEnc(cUTF8, t.Format(time.RFC3339Nano))\n\t} else {\n\t\te.encUint(1, cborBaseTag)\n\t\tt = t.UTC().Round(time.Microsecond)\n\t\tsec, nsec := t.Unix(), uint64(t.Nanosecond())\n\t\tif nsec == 0 {\n\t\t\te.EncodeInt(sec)\n\t\t} else {\n\t\t\te.EncodeFloat64(float64(sec) + float64(nsec)/1e9)\n\t\t}\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeExt(rv interface{}, xtag uint64, ext Ext, en *Encoder) {\n\te.encUint(uint64(xtag), cborBaseTag)\n\tif v := ext.ConvertExt(rv); v == nil {\n\t\te.EncodeNil()\n\t} else {\n\t\ten.encode(v)\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeRawExt(re *RawExt, en *Encoder) {\n\te.encUint(uint64(re.Tag), cborBaseTag)\n\t// only encodes re.Value (never re.Data)\n\t// if false && re.Data != nil {\n\t// \ten.encode(re.Data)\n\t// } else if re.Value != nil {\n\tif re.Value != nil {\n\t\ten.encode(re.Value)\n\t} else {\n\t\te.EncodeNil()\n\t}\n}\n\nfunc (e *cborEncDriver) WriteArrayStart(length int) {\n\tif e.h.IndefiniteLength {\n\t\te.w.writen1(cborBdIndefiniteArray)\n\t} else {\n\t\te.encLen(cborBaseArray, length)\n\t}\n}\n\nfunc (e *cborEncDriver) WriteMapStart(length int) {\n\tif e.h.IndefiniteLength {\n\t\te.w.writen1(cborBdIndefiniteMap)\n\t} else {\n\t\te.encLen(cborBaseMap, length)\n\t}\n}\n\nfunc (e *cborEncDriver) WriteMapEnd() {\n\tif e.h.IndefiniteLength {\n\t\te.w.writen1(cborBdBreak)\n\t}\n}\n\nfunc (e *cborEncDriver) WriteArrayEnd() {\n\tif e.h.IndefiniteLength {\n\t\te.w.writen1(cborBdBreak)\n\t}\n}\n\nfunc (e *cborEncDriver) EncodeStringEnc(c charEncoding, v string) {\n\te.encStringBytesS(cborBaseString, v)\n}\n\nfunc (e *cborEncDriver) EncodeStringBytesRaw(v []byte) {\n\tif v == nil {\n\t\te.EncodeNil()\n\t} else {\n\t\te.encStringBytesS(cborBaseBytes, stringView(v))\n\t}\n}\n\nfunc (e *cborEncDriver) encStringBytesS(bb byte, v string) {\n\tif e.h.IndefiniteLength {\n\t\tif bb == cborBaseBytes {\n\t\t\te.w.writen1(cborBdIndefiniteBytes)\n\t\t} else {\n\t\t\te.w.writen1(cborBdIndefiniteString)\n\t\t}\n\t\tvar vlen uint = uint(len(v))\n\t\tblen := vlen / 4\n\t\tif blen == 0 {\n\t\t\tblen = 64\n\t\t} else if blen > 1024 {\n\t\t\tblen = 1024\n\t\t}\n\t\tfor i := uint(0); i < vlen; {\n\t\t\tvar v2 string\n\t\t\ti2 := i + blen\n\t\t\tif i2 < vlen {\n\t\t\t\tv2 = v[i:i2]\n\t\t\t} else {\n\t\t\t\tv2 = v[i:]\n\t\t\t}\n\t\t\te.encLen(bb, len(v2))\n\t\t\te.w.writestr(v2)\n\t\t\ti = i2\n\t\t}\n\t\te.w.writen1(cborBdBreak)\n\t} else {\n\t\te.encLen(bb, len(v))\n\t\te.w.writestr(v)\n\t}\n}\n\n// ----------------------\n\ntype cborDecDriver struct {\n\td *Decoder\n\th *CborHandle\n\tr *decReaderSwitch\n\tbr bool // bytes reader\n\tbdRead bool\n\tbd byte\n\tnoBuiltInTypes\n\t// decNoSeparator\n\tdecDriverNoopContainerReader\n\t// _ [3]uint64 // padding\n}\n\nfunc (d *cborDecDriver) readNextBd() {\n\td.bd = d.r.readn1()\n\td.bdRead = true\n}\n\nfunc (d *cborDecDriver) uncacheRead() {\n\tif d.bdRead {\n\t\td.r.unreadn1()\n\t\td.bdRead = false\n\t}\n}\n\nfunc (d *cborDecDriver) ContainerType() (vt valueType) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == cborBdNil {\n\t\treturn valueTypeNil\n\t} else if d.bd == cborBdIndefiniteBytes || (d.bd >= cborBaseBytes && d.bd < cborBaseString) {\n\t\treturn valueTypeBytes\n\t} else if d.bd == cborBdIndefiniteString || (d.bd >= cborBaseString && d.bd < cborBaseArray) {\n\t\treturn valueTypeString\n\t} else if d.bd == cborBdIndefiniteArray || (d.bd >= cborBaseArray && d.bd < cborBaseMap) {\n\t\treturn valueTypeArray\n\t} else if d.bd == cborBdIndefiniteMap || (d.bd >= cborBaseMap && d.bd < cborBaseTag) {\n\t\treturn valueTypeMap\n\t}\n\t// else {\n\t// d.d.errorf(\"isContainerType: unsupported parameter: %v\", vt)\n\t// }\n\treturn valueTypeUnset\n}\n\nfunc (d *cborDecDriver) TryDecodeAsNil() bool {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\t// treat Nil and Undefined as nil values\n\tif d.bd == cborBdNil || d.bd == cborBdUndefined {\n\t\td.bdRead = false\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *cborDecDriver) CheckBreak() bool {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == cborBdBreak {\n\t\td.bdRead = false\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *cborDecDriver) decUint() (ui uint64) {\n\tv := d.bd & 0x1f\n\tif v <= 0x17 {\n\t\tui = uint64(v)\n\t} else {\n\t\tif v == 0x18 {\n\t\t\tui = uint64(d.r.readn1())\n\t\t} else if v == 0x19 {\n\t\t\tui = uint64(bigen.Uint16(d.r.readx(2)))\n\t\t} else if v == 0x1a {\n\t\t\tui = uint64(bigen.Uint32(d.r.readx(4)))\n\t\t} else if v == 0x1b {\n\t\t\tui = uint64(bigen.Uint64(d.r.readx(8)))\n\t\t} else {\n\t\t\td.d.errorf(\"invalid descriptor decoding uint: %x/%s\", d.bd, cbordesc(d.bd))\n\t\t\treturn\n\t\t}\n\t}\n\treturn\n}\n\nfunc (d *cborDecDriver) decCheckInteger() (neg bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tmajor := d.bd >> 5\n\tif major == cborMajorUint {\n\t} else if major == cborMajorNegInt {\n\t\tneg = true\n\t} else {\n\t\td.d.errorf(\"not an integer - invalid major %v from descriptor %x/%s\",\n\t\t\tmajor, d.bd, cbordesc(d.bd))\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *cborDecDriver) DecodeInt64() (i int64) {\n\tneg := d.decCheckInteger()\n\tui := d.decUint()\n\t// check if this number can be converted to an int without overflow\n\tif neg {\n\t\ti = -(chkOvf.SignedIntV(ui + 1))\n\t} else {\n\t\ti = chkOvf.SignedIntV(ui)\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *cborDecDriver) DecodeUint64() (ui uint64) {\n\tif d.decCheckInteger() {\n\t\td.d.errorf(\"assigning negative signed value to unsigned type\")\n\t\treturn\n\t}\n\tui = d.decUint()\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *cborDecDriver) DecodeFloat64() (f float64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif bd := d.bd; bd == cborBdFloat16 {\n\t\tf = float64(math.Float32frombits(halfFloatToFloatBits(bigen.Uint16(d.r.readx(2)))))\n\t} else if bd == cborBdFloat32 {\n\t\tf = float64(math.Float32frombits(bigen.Uint32(d.r.readx(4))))\n\t} else if bd == cborBdFloat64 {\n\t\tf = math.Float64frombits(bigen.Uint64(d.r.readx(8)))\n\t} else if bd >= cborBaseUint && bd < cborBaseBytes {\n\t\tf = float64(d.DecodeInt64())\n\t} else {\n\t\td.d.errorf(\"float only valid from float16/32/64 - invalid descriptor %x/%s\", bd, cbordesc(bd))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// bool can be decoded from bool only (single byte).\nfunc (d *cborDecDriver) DecodeBool() (b bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif bd := d.bd; bd == cborBdTrue {\n\t\tb = true\n\t} else if bd == cborBdFalse {\n\t} else {\n\t\td.d.errorf(\"not bool - %s %x/%s\", msgBadDesc, d.bd, cbordesc(d.bd))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *cborDecDriver) ReadMapStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\td.bdRead = false\n\tif d.bd == cborBdIndefiniteMap {\n\t\treturn -1\n\t}\n\treturn d.decLen()\n}\n\nfunc (d *cborDecDriver) ReadArrayStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\td.bdRead = false\n\tif d.bd == cborBdIndefiniteArray {\n\t\treturn -1\n\t}\n\treturn d.decLen()\n}\n\nfunc (d *cborDecDriver) decLen() int {\n\treturn int(d.decUint())\n}\n\nfunc (d *cborDecDriver) decAppendIndefiniteBytes(bs []byte) []byte {\n\td.bdRead = false\n\tfor {\n\t\tif d.CheckBreak() {\n\t\t\tbreak\n\t\t}\n\t\tif major := d.bd >> 5; major != cborMajorBytes && major != cborMajorText {\n\t\t\td.d.errorf(\"expect bytes/string major type in indefinite string/bytes;\"+\n\t\t\t\t\" got major %v from descriptor %x/%x\", major, d.bd, cbordesc(d.bd))\n\t\t\treturn nil\n\t\t}\n\t\tn := d.decLen()\n\t\toldLen := len(bs)\n\t\tnewLen := oldLen + n\n\t\tif newLen > cap(bs) {\n\t\t\tbs2 := make([]byte, newLen, 2*cap(bs)+n)\n\t\t\tcopy(bs2, bs)\n\t\t\tbs = bs2\n\t\t} else {\n\t\t\tbs = bs[:newLen]\n\t\t}\n\t\td.r.readb(bs[oldLen:newLen])\n\t\t// bs = append(bs, d.r.readn()...)\n\t\td.bdRead = false\n\t}\n\td.bdRead = false\n\treturn bs\n}\n\nfunc (d *cborDecDriver) DecodeBytes(bs []byte, zerocopy bool) (bsOut []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == cborBdNil || d.bd == cborBdUndefined {\n\t\td.bdRead = false\n\t\treturn nil\n\t}\n\tif d.bd == cborBdIndefiniteBytes || d.bd == cborBdIndefiniteString {\n\t\td.bdRead = false\n\t\tif bs == nil {\n\t\t\tif zerocopy {\n\t\t\t\treturn d.decAppendIndefiniteBytes(d.d.b[:0])\n\t\t\t}\n\t\t\treturn d.decAppendIndefiniteBytes(zeroByteSlice)\n\t\t}\n\t\treturn d.decAppendIndefiniteBytes(bs[:0])\n\t}\n\t// check if an \"array\" of uint8's (see ContainerType for how to infer if an array)\n\tif d.bd == cborBdIndefiniteArray || (d.bd >= cborBaseArray && d.bd < cborBaseMap) {\n\t\tbsOut, _ = fastpathTV.DecSliceUint8V(bs, true, d.d)\n\t\treturn\n\t}\n\tclen := d.decLen()\n\td.bdRead = false\n\tif zerocopy {\n\t\tif d.br {\n\t\t\treturn d.r.readx(uint(clen))\n\t\t} else if len(bs) == 0 {\n\t\t\tbs = d.d.b[:]\n\t\t}\n\t}\n\treturn decByteSlice(d.r, clen, d.h.MaxInitLen, bs)\n}\n\nfunc (d *cborDecDriver) DecodeString() (s string) {\n\treturn string(d.DecodeBytes(d.d.b[:], true))\n}\n\nfunc (d *cborDecDriver) DecodeStringAsBytes() (s []byte) {\n\treturn d.DecodeBytes(d.d.b[:], true)\n}\n\nfunc (d *cborDecDriver) DecodeTime() (t time.Time) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == cborBdNil || d.bd == cborBdUndefined {\n\t\td.bdRead = false\n\t\treturn\n\t}\n\txtag := d.decUint()\n\td.bdRead = false\n\treturn d.decodeTime(xtag)\n}\n\nfunc (d *cborDecDriver) decodeTime(xtag uint64) (t time.Time) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch xtag {\n\tcase 0:\n\t\tvar err error\n\t\tif t, err = time.Parse(time.RFC3339, stringView(d.DecodeStringAsBytes())); err != nil {\n\t\t\td.d.errorv(err)\n\t\t}\n\tcase 1:\n\t\t// decode an int64 or a float, and infer time.Time from there.\n\t\t// for floats, round to microseconds, as that is what is guaranteed to fit well.\n\t\tswitch {\n\t\tcase d.bd == cborBdFloat16, d.bd == cborBdFloat32:\n\t\t\tf1, f2 := math.Modf(d.DecodeFloat64())\n\t\t\tt = time.Unix(int64(f1), int64(f2*1e9))\n\t\tcase d.bd == cborBdFloat64:\n\t\t\tf1, f2 := math.Modf(d.DecodeFloat64())\n\t\t\tt = time.Unix(int64(f1), int64(f2*1e9))\n\t\tcase d.bd >= cborBaseUint && d.bd < cborBaseNegInt,\n\t\t\td.bd >= cborBaseNegInt && d.bd < cborBaseBytes:\n\t\t\tt = time.Unix(d.DecodeInt64(), 0)\n\t\tdefault:\n\t\t\td.d.errorf(\"time.Time can only be decoded from a number (or RFC3339 string)\")\n\t\t}\n\tdefault:\n\t\td.d.errorf(\"invalid tag for time.Time - expecting 0 or 1, got 0x%x\", xtag)\n\t}\n\tt = t.UTC().Round(time.Microsecond)\n\treturn\n}\n\nfunc (d *cborDecDriver) DecodeExt(rv interface{}, xtag uint64, ext Ext) (realxtag uint64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tu := d.decUint()\n\td.bdRead = false\n\trealxtag = u\n\tif ext == nil {\n\t\tre := rv.(*RawExt)\n\t\tre.Tag = realxtag\n\t\td.d.decode(&re.Value)\n\t} else if xtag != realxtag {\n\t\td.d.errorf(\"Wrong extension tag. Got %b. Expecting: %v\", realxtag, xtag)\n\t\treturn\n\t} else {\n\t\tvar v interface{}\n\t\td.d.decode(&v)\n\t\text.UpdateExt(rv, v)\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *cborDecDriver) DecodeNaked() {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\n\tn := d.d.naked()\n\tvar decodeFurther bool\n\n\tswitch d.bd {\n\tcase cborBdNil:\n\t\tn.v = valueTypeNil\n\tcase cborBdFalse:\n\t\tn.v = valueTypeBool\n\t\tn.b = false\n\tcase cborBdTrue:\n\t\tn.v = valueTypeBool\n\t\tn.b = true\n\tcase cborBdFloat16, cborBdFloat32, cborBdFloat64:\n\t\tn.v = valueTypeFloat\n\t\tn.f = d.DecodeFloat64()\n\tcase cborBdIndefiniteBytes:\n\t\tdecNakedReadRawBytes(d, d.d, n, d.h.RawToString)\n\tcase cborBdIndefiniteString:\n\t\tn.v = valueTypeString\n\t\tn.s = d.DecodeString()\n\tcase cborBdIndefiniteArray:\n\t\tn.v = valueTypeArray\n\t\tdecodeFurther = true\n\tcase cborBdIndefiniteMap:\n\t\tn.v = valueTypeMap\n\t\tdecodeFurther = true\n\tdefault:\n\t\tswitch {\n\t\tcase d.bd >= cborBaseUint && d.bd < cborBaseNegInt:\n\t\t\tif d.h.SignedInteger {\n\t\t\t\tn.v = valueTypeInt\n\t\t\t\tn.i = d.DecodeInt64()\n\t\t\t} else {\n\t\t\t\tn.v = valueTypeUint\n\t\t\t\tn.u = d.DecodeUint64()\n\t\t\t}\n\t\tcase d.bd >= cborBaseNegInt && d.bd < cborBaseBytes:\n\t\t\tn.v = valueTypeInt\n\t\t\tn.i = d.DecodeInt64()\n\t\tcase d.bd >= cborBaseBytes && d.bd < cborBaseString:\n\t\t\tdecNakedReadRawBytes(d, d.d, n, d.h.RawToString)\n\t\tcase d.bd >= cborBaseString && d.bd < cborBaseArray:\n\t\t\tn.v = valueTypeString\n\t\t\tn.s = d.DecodeString()\n\t\tcase d.bd >= cborBaseArray && d.bd < cborBaseMap:\n\t\t\tn.v = valueTypeArray\n\t\t\tdecodeFurther = true\n\t\tcase d.bd >= cborBaseMap && d.bd < cborBaseTag:\n\t\t\tn.v = valueTypeMap\n\t\t\tdecodeFurther = true\n\t\tcase d.bd >= cborBaseTag && d.bd < cborBaseSimple:\n\t\t\tn.v = valueTypeExt\n\t\t\tn.u = d.decUint()\n\t\t\tn.l = nil\n\t\t\tif n.u == 0 || n.u == 1 {\n\t\t\t\td.bdRead = false\n\t\t\t\tn.v = valueTypeTime\n\t\t\t\tn.t = d.decodeTime(n.u)\n\t\t\t}\n\t\t\t// d.bdRead = false\n\t\t\t// d.d.decode(&re.Value) // handled by decode itself.\n\t\t\t// decodeFurther = true\n\t\tdefault:\n\t\t\td.d.errorf(\"decodeNaked: Unrecognized d.bd: 0x%x\", d.bd)\n\t\t\treturn\n\t\t}\n\t}\n\n\tif !decodeFurther {\n\t\td.bdRead = false\n\t}\n}\n\n// -------------------------\n\n// CborHandle is a Handle for the CBOR encoding format,\n// defined at http://tools.ietf.org/html/rfc7049 and documented further at http://cbor.io .\n//\n// CBOR is comprehensively supported, including support for:\n// - indefinite-length arrays/maps/bytes/strings\n// - (extension) tags in range 0..0xffff (0 .. 65535)\n// - half, single and double-precision floats\n// - all numbers (1, 2, 4 and 8-byte signed and unsigned integers)\n// - nil, true, false, ...\n// - arrays and maps, bytes and text strings\n//\n// None of the optional extensions (with tags) defined in the spec are supported out-of-the-box.\n// Users can implement them as needed (using SetExt), including spec-documented ones:\n// - timestamp, BigNum, BigFloat, Decimals,\n// - Encoded Text (e.g. URL, regexp, base64, MIME Message), etc.\ntype CborHandle struct {\n\tbinaryEncodingType\n\tnoElemSeparators\n\tBasicHandle\n\n\t// IndefiniteLength=true, means that we encode using indefinitelength\n\tIndefiniteLength bool\n\n\t// TimeRFC3339 says to encode time.Time using RFC3339 format.\n\t// If unset, we encode time.Time using seconds past epoch.\n\tTimeRFC3339 bool\n\n\t_ [1]uint64 // padding (cache-aligned)\n}\n\n// Name returns the name of the handle: cbor\nfunc (h *CborHandle) Name() string { return \"cbor\" }\n\n// SetInterfaceExt sets an extension\nfunc (h *CborHandle) SetInterfaceExt(rt reflect.Type, tag uint64, ext InterfaceExt) (err error) {\n\treturn h.SetExt(rt, tag, &interfaceExtWrapper{InterfaceExt: ext})\n}\n\nfunc (h *CborHandle) newEncDriver(e *Encoder) encDriver {\n\treturn &cborEncDriver{e: e, w: e.w(), h: h}\n}\n\nfunc (h *CborHandle) newDecDriver(d *Decoder) decDriver {\n\treturn &cborDecDriver{d: d, h: h, r: d.r(), br: d.bytes}\n}\n\nfunc (e *cborEncDriver) reset() {\n\te.w = e.e.w()\n}\n\nfunc (d *cborDecDriver) reset() {\n\td.r, d.br = d.d.r(), d.d.bytes\n\td.bd, d.bdRead = 0, false\n}\n\nvar _ decDriver = (*cborDecDriver)(nil)\nvar _ encDriver = (*cborEncDriver)(nil)\n" }, { "path": "vendor/github.com/ugorji/go/codec/codecgen.go", "content": "// +build codecgen generated\n\npackage codec\n\n// this file is here, to set the codecgen variable to true\n// when the build tag codecgen is set.\n//\n// this allows us do specific things e.g. skip missing fields tests,\n// when running in codecgen mode.\n\nfunc init() {\n\tcodecgen = true\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/decode.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"encoding\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"runtime\"\n\t\"strconv\"\n\t\"time\"\n)\n\n// Some tagging information for error messages.\nconst (\n\tmsgBadDesc = \"unrecognized descriptor byte\"\n\t// msgDecCannotExpandArr = \"cannot expand go array from %v to stream length: %v\"\n)\n\nconst (\n\tdecDefMaxDepth = 1024 // maximum depth\n\tdecDefSliceCap = 8\n\tdecDefChanCap = 64 // should be large, as cap cannot be expanded\n\tdecScratchByteArrayLen = cacheLineSize // - 5 // + (8 * 2) // - (8 * 1)\n)\n\nvar (\n\terrstrOnlyMapOrArrayCanDecodeIntoStruct = \"only encoded map or array can be decoded into a struct\"\n\terrstrCannotDecodeIntoNil = \"cannot decode into nil\"\n\n\terrmsgExpandSliceOverflow = \"expand slice: slice overflow\"\n\terrmsgExpandSliceCannotChange = \"expand slice: cannot change\"\n\n\terrDecoderNotInitialized = errors.New(\"Decoder not initialized\")\n\n\terrDecUnreadByteNothingToRead = errors.New(\"cannot unread - nothing has been read\")\n\terrDecUnreadByteLastByteNotRead = errors.New(\"cannot unread - last byte has not been read\")\n\terrDecUnreadByteUnknown = errors.New(\"cannot unread - reason unknown\")\n\terrMaxDepthExceeded = errors.New(\"maximum decoding depth exceeded\")\n)\n\n/*\n\n// decReader abstracts the reading source, allowing implementations that can\n// read from an io.Reader or directly off a byte slice with zero-copying.\n//\n// Deprecated: Use decReaderSwitch instead.\ntype decReader interface {\n\tunreadn1()\n\t// readx will use the implementation scratch buffer if possible i.e. n < len(scratchbuf), OR\n\t// just return a view of the []byte being decoded from.\n\t// Ensure you call detachZeroCopyBytes later if this needs to be sent outside codec control.\n\treadx(n int) []byte\n\treadb([]byte)\n\treadn1() uint8\n\tnumread() uint // number of bytes read\n\ttrack()\n\tstopTrack() []byte\n\n\t// skip will skip any byte that matches, and return the first non-matching byte\n\tskip(accept *bitset256) (token byte)\n\t// readTo will read any byte that matches, stopping once no-longer matching.\n\treadTo(in []byte, accept *bitset256) (out []byte)\n\t// readUntil will read, only stopping once it matches the 'stop' byte.\n\treadUntil(in []byte, stop byte) (out []byte)\n}\n\n*/\n\ntype decDriver interface {\n\t// this will check if the next token is a break.\n\tCheckBreak() bool\n\t// TryDecodeAsNil tries to decode as nil.\n\t// Note: TryDecodeAsNil should be careful not to share any temporary []byte with\n\t// the rest of the decDriver. This is because sometimes, we optimize by holding onto\n\t// a transient []byte, and ensuring the only other call we make to the decDriver\n\t// during that time is maybe a TryDecodeAsNil() call.\n\tTryDecodeAsNil() bool\n\t// ContainerType returns one of: Bytes, String, Nil, Slice or Map. Return unSet if not known.\n\tContainerType() (vt valueType)\n\t// IsBuiltinType(rt uintptr) bool\n\n\t// DecodeNaked will decode primitives (number, bool, string, []byte) and RawExt.\n\t// For maps and arrays, it will not do the decoding in-band, but will signal\n\t// the decoder, so that is done later, by setting the decNaked.valueType field.\n\t//\n\t// Note: Numbers are decoded as int64, uint64, float64 only (no smaller sized number types).\n\t// for extensions, DecodeNaked must read the tag and the []byte if it exists.\n\t// if the []byte is not read, then kInterfaceNaked will treat it as a Handle\n\t// that stores the subsequent value in-band, and complete reading the RawExt.\n\t//\n\t// extensions should also use readx to decode them, for efficiency.\n\t// kInterface will extract the detached byte slice if it has to pass it outside its realm.\n\tDecodeNaked()\n\n\tDecodeInt64() (i int64)\n\tDecodeUint64() (ui uint64)\n\n\tDecodeFloat64() (f float64)\n\tDecodeBool() (b bool)\n\t// DecodeString can also decode symbols.\n\t// It looks redundant as DecodeBytes is available.\n\t// However, some codecs (e.g. binc) support symbols and can\n\t// return a pre-stored string value, meaning that it can bypass\n\t// the cost of []byte->string conversion.\n\tDecodeString() (s string)\n\tDecodeStringAsBytes() (v []byte)\n\n\t// DecodeBytes may be called directly, without going through reflection.\n\t// Consequently, it must be designed to handle possible nil.\n\tDecodeBytes(bs []byte, zerocopy bool) (bsOut []byte)\n\t// DecodeBytes(bs []byte, isstring, zerocopy bool) (bsOut []byte)\n\n\t// decodeExt will decode into a *RawExt or into an extension.\n\tDecodeExt(v interface{}, xtag uint64, ext Ext) (realxtag uint64)\n\t// decodeExt(verifyTag bool, tag byte) (xtag byte, xbs []byte)\n\n\tDecodeTime() (t time.Time)\n\n\tReadArrayStart() int\n\tReadArrayEnd()\n\tReadMapStart() int\n\tReadMapEnd()\n\n\treset()\n\tuncacheRead()\n}\n\ntype decDriverContainerTracker interface {\n\tReadArrayElem()\n\tReadMapElemKey()\n\tReadMapElemValue()\n}\n\ntype decodeError struct {\n\tcodecError\n\tpos int\n}\n\nfunc (d decodeError) Error() string {\n\treturn fmt.Sprintf(\"%s decode error [pos %d]: %v\", d.name, d.pos, d.err)\n}\n\ntype decDriverNoopContainerReader struct{}\n\nfunc (x decDriverNoopContainerReader) ReadArrayStart() (v int) { return }\nfunc (x decDriverNoopContainerReader) ReadArrayEnd() {}\nfunc (x decDriverNoopContainerReader) ReadMapStart() (v int) { return }\nfunc (x decDriverNoopContainerReader) ReadMapEnd() {}\nfunc (x decDriverNoopContainerReader) CheckBreak() (v bool) { return }\n\n// func (x decDriverNoopContainerReader) ReadArrayElem() {}\n// func (x decDriverNoopContainerReader) ReadMapElemKey() {}\n// func (x decDriverNoopContainerReader) ReadMapElemValue() {}\n\n// func (x decNoSeparator) uncacheRead() {}\n\n// DecodeOptions captures configuration options during decode.\ntype DecodeOptions struct {\n\t// MapType specifies type to use during schema-less decoding of a map in the stream.\n\t// If nil (unset), we default to map[string]interface{} iff json handle and MapStringAsKey=true,\n\t// else map[interface{}]interface{}.\n\tMapType reflect.Type\n\n\t// SliceType specifies type to use during schema-less decoding of an array in the stream.\n\t// If nil (unset), we default to []interface{} for all formats.\n\tSliceType reflect.Type\n\n\t// MaxInitLen defines the maxinum initial length that we \"make\" a collection\n\t// (string, slice, map, chan). If 0 or negative, we default to a sensible value\n\t// based on the size of an element in the collection.\n\t//\n\t// For example, when decoding, a stream may say that it has 2^64 elements.\n\t// We should not auto-matically provision a slice of that size, to prevent Out-Of-Memory crash.\n\t// Instead, we provision up to MaxInitLen, fill that up, and start appending after that.\n\tMaxInitLen int\n\n\t// ReaderBufferSize is the size of the buffer used when reading.\n\t//\n\t// if > 0, we use a smart buffer internally for performance purposes.\n\tReaderBufferSize int\n\n\t// MaxDepth defines the maximum depth when decoding nested\n\t// maps and slices. If 0 or negative, we default to a suitably large number (currently 1024).\n\tMaxDepth int16\n\n\t// If ErrorIfNoField, return an error when decoding a map\n\t// from a codec stream into a struct, and no matching struct field is found.\n\tErrorIfNoField bool\n\n\t// If ErrorIfNoArrayExpand, return an error when decoding a slice/array that cannot be expanded.\n\t// For example, the stream contains an array of 8 items, but you are decoding into a [4]T array,\n\t// or you are decoding into a slice of length 4 which is non-addressable (and so cannot be set).\n\tErrorIfNoArrayExpand bool\n\n\t// If SignedInteger, use the int64 during schema-less decoding of unsigned values (not uint64).\n\tSignedInteger bool\n\n\t// MapValueReset controls how we decode into a map value.\n\t//\n\t// By default, we MAY retrieve the mapping for a key, and then decode into that.\n\t// However, especially with big maps, that retrieval may be expensive and unnecessary\n\t// if the stream already contains all that is necessary to recreate the value.\n\t//\n\t// If true, we will never retrieve the previous mapping,\n\t// but rather decode into a new value and set that in the map.\n\t//\n\t// If false, we will retrieve the previous mapping if necessary e.g.\n\t// the previous mapping is a pointer, or is a struct or array with pre-set state,\n\t// or is an interface.\n\tMapValueReset bool\n\n\t// SliceElementReset: on decoding a slice, reset the element to a zero value first.\n\t//\n\t// concern: if the slice already contained some garbage, we will decode into that garbage.\n\tSliceElementReset bool\n\n\t// InterfaceReset controls how we decode into an interface.\n\t//\n\t// By default, when we see a field that is an interface{...},\n\t// or a map with interface{...} value, we will attempt decoding into the\n\t// \"contained\" value.\n\t//\n\t// However, this prevents us from reading a string into an interface{}\n\t// that formerly contained a number.\n\t//\n\t// If true, we will decode into a new \"blank\" value, and set that in the interface.\n\t// If false, we will decode into whatever is contained in the interface.\n\tInterfaceReset bool\n\n\t// InternString controls interning of strings during decoding.\n\t//\n\t// Some handles, e.g. json, typically will read map keys as strings.\n\t// If the set of keys are finite, it may help reduce allocation to\n\t// look them up from a map (than to allocate them afresh).\n\t//\n\t// Note: Handles will be smart when using the intern functionality.\n\t// Every string should not be interned.\n\t// An excellent use-case for interning is struct field names,\n\t// or map keys where key type is string.\n\tInternString bool\n\n\t// PreferArrayOverSlice controls whether to decode to an array or a slice.\n\t//\n\t// This only impacts decoding into a nil interface{}.\n\t// Consequently, it has no effect on codecgen.\n\t//\n\t// *Note*: This only applies if using go1.5 and above,\n\t// as it requires reflect.ArrayOf support which was absent before go1.5.\n\tPreferArrayOverSlice bool\n\n\t// DeleteOnNilMapValue controls how to decode a nil value in the stream.\n\t//\n\t// If true, we will delete the mapping of the key.\n\t// Else, just set the mapping to the zero value of the type.\n\tDeleteOnNilMapValue bool\n\n\t// RawToString controls how raw bytes in a stream are decoded into a nil interface{}.\n\t// By default, they are decoded as []byte, but can be decoded as string (if configured).\n\tRawToString bool\n}\n\n// ------------------------------------------------\n\ntype unreadByteStatus uint8\n\n// unreadByteStatus goes from\n// undefined (when initialized) -- (read) --> canUnread -- (unread) --> canRead ...\nconst (\n\tunreadByteUndefined unreadByteStatus = iota\n\tunreadByteCanRead\n\tunreadByteCanUnread\n)\n\ntype ioDecReaderCommon struct {\n\tr io.Reader // the reader passed in\n\n\tn uint // num read\n\n\tl byte // last byte\n\tls unreadByteStatus // last byte status\n\ttrb bool // tracking bytes turned on\n\t_ bool\n\tb [4]byte // tiny buffer for reading single bytes\n\n\ttr []byte // tracking bytes read\n}\n\nfunc (z *ioDecReaderCommon) reset(r io.Reader) {\n\tz.r = r\n\tz.ls = unreadByteUndefined\n\tz.l, z.n = 0, 0\n\tz.trb = false\n\tif z.tr != nil {\n\t\tz.tr = z.tr[:0]\n\t}\n}\n\nfunc (z *ioDecReaderCommon) numread() uint {\n\treturn z.n\n}\n\nfunc (z *ioDecReaderCommon) track() {\n\tif z.tr != nil {\n\t\tz.tr = z.tr[:0]\n\t}\n\tz.trb = true\n}\n\nfunc (z *ioDecReaderCommon) stopTrack() (bs []byte) {\n\tz.trb = false\n\treturn z.tr\n}\n\n// ------------------------------------------\n\n// ioDecReader is a decReader that reads off an io.Reader.\n//\n// It also has a fallback implementation of ByteScanner if needed.\ntype ioDecReader struct {\n\tioDecReaderCommon\n\n\trr io.Reader\n\tbr io.ByteScanner\n\n\tx [scratchByteArrayLen + 8]byte // for: get struct field name, swallow valueTypeBytes, etc\n\t// _ [1]uint64 // padding\n}\n\nfunc (z *ioDecReader) reset(r io.Reader) {\n\tz.ioDecReaderCommon.reset(r)\n\n\tvar ok bool\n\tz.rr = r\n\tz.br, ok = r.(io.ByteScanner)\n\tif !ok {\n\t\tz.br = z\n\t\tz.rr = z\n\t}\n}\n\nfunc (z *ioDecReader) Read(p []byte) (n int, err error) {\n\tif len(p) == 0 {\n\t\treturn\n\t}\n\tvar firstByte bool\n\tif z.ls == unreadByteCanRead {\n\t\tz.ls = unreadByteCanUnread\n\t\tp[0] = z.l\n\t\tif len(p) == 1 {\n\t\t\tn = 1\n\t\t\treturn\n\t\t}\n\t\tfirstByte = true\n\t\tp = p[1:]\n\t}\n\tn, err = z.r.Read(p)\n\tif n > 0 {\n\t\tif err == io.EOF && n == len(p) {\n\t\t\terr = nil // read was successful, so postpone EOF (till next time)\n\t\t}\n\t\tz.l = p[n-1]\n\t\tz.ls = unreadByteCanUnread\n\t}\n\tif firstByte {\n\t\tn++\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) ReadByte() (c byte, err error) {\n\tn, err := z.Read(z.b[:1])\n\tif n == 1 {\n\t\tc = z.b[0]\n\t\tif err == io.EOF {\n\t\t\terr = nil // read was successful, so postpone EOF (till next time)\n\t\t}\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) UnreadByte() (err error) {\n\tswitch z.ls {\n\tcase unreadByteCanUnread:\n\t\tz.ls = unreadByteCanRead\n\tcase unreadByteCanRead:\n\t\terr = errDecUnreadByteLastByteNotRead\n\tcase unreadByteUndefined:\n\t\terr = errDecUnreadByteNothingToRead\n\tdefault:\n\t\terr = errDecUnreadByteUnknown\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) readx(n uint) (bs []byte) {\n\tif n == 0 {\n\t\treturn\n\t}\n\tif n < uint(len(z.x)) {\n\t\tbs = z.x[:n]\n\t} else {\n\t\tbs = make([]byte, n)\n\t}\n\tif _, err := decReadFull(z.rr, bs); err != nil {\n\t\tpanic(err)\n\t}\n\tz.n += uint(len(bs))\n\tif z.trb {\n\t\tz.tr = append(z.tr, bs...)\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) readb(bs []byte) {\n\tif len(bs) == 0 {\n\t\treturn\n\t}\n\tif _, err := decReadFull(z.rr, bs); err != nil {\n\t\tpanic(err)\n\t}\n\tz.n += uint(len(bs))\n\tif z.trb {\n\t\tz.tr = append(z.tr, bs...)\n\t}\n}\n\nfunc (z *ioDecReader) readn1eof() (b uint8, eof bool) {\n\tb, err := z.br.ReadByte()\n\tif err == nil {\n\t\tz.n++\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, b)\n\t\t}\n\t} else if err == io.EOF {\n\t\teof = true\n\t} else {\n\t\tpanic(err)\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) readn1() (b uint8) {\n\tb, err := z.br.ReadByte()\n\tif err == nil {\n\t\tz.n++\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, b)\n\t\t}\n\t\treturn\n\t}\n\tpanic(err)\n}\n\nfunc (z *ioDecReader) skip(accept *bitset256) (token byte) {\n\tvar eof bool\n\t// for {\n\t// \ttoken, eof = z.readn1eof()\n\t// \tif eof {\n\t// \t\treturn\n\t// \t}\n\t// \tif accept.isset(token) {\n\t// \t\tcontinue\n\t// \t}\n\t// \treturn\n\t// }\nLOOP:\n\ttoken, eof = z.readn1eof()\n\tif eof {\n\t\treturn\n\t}\n\tif accept.isset(token) {\n\t\tgoto LOOP\n\t}\n\treturn\n}\n\nfunc (z *ioDecReader) readTo(in []byte, accept *bitset256) []byte {\n\t// out = in\n\n\t// for {\n\t// \ttoken, eof := z.readn1eof()\n\t// \tif eof {\n\t// \t\treturn\n\t// \t}\n\t// \tif accept.isset(token) {\n\t// \t\tout = append(out, token)\n\t// \t} else {\n\t// \t\tz.unreadn1()\n\t// \t\treturn\n\t// \t}\n\t// }\nLOOP:\n\ttoken, eof := z.readn1eof()\n\tif eof {\n\t\treturn in\n\t}\n\tif accept.isset(token) {\n\t\t// out = append(out, token)\n\t\tin = append(in, token)\n\t\tgoto LOOP\n\t}\n\tz.unreadn1()\n\treturn in\n}\n\nfunc (z *ioDecReader) readUntil(in []byte, stop byte) (out []byte) {\n\tout = in\n\t// for {\n\t// \ttoken, eof := z.readn1eof()\n\t// \tif eof {\n\t// \t\tpanic(io.EOF)\n\t// \t}\n\t// \tout = append(out, token)\n\t// \tif token == stop {\n\t// \t\treturn\n\t// \t}\n\t// }\nLOOP:\n\ttoken, eof := z.readn1eof()\n\tif eof {\n\t\tpanic(io.EOF)\n\t}\n\tout = append(out, token)\n\tif token == stop {\n\t\treturn\n\t}\n\tgoto LOOP\n}\n\n//go:noinline\nfunc (z *ioDecReader) unreadn1() {\n\terr := z.br.UnreadByte()\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tz.n--\n\tif z.trb {\n\t\tif l := len(z.tr) - 1; l >= 0 {\n\t\t\tz.tr = z.tr[:l]\n\t\t}\n\t}\n}\n\n// ------------------------------------\n\ntype bufioDecReader struct {\n\tioDecReaderCommon\n\t_ uint64 // padding (cache-aligned)\n\n\tc uint // cursor\n\tbuf []byte\n\n\tbytesBufPooler\n\n\t// err error\n\n\t// Extensions can call Decode() within a current Decode() call.\n\t// We need to know when the top level Decode() call returns,\n\t// so we can decide whether to Release() or not.\n\tcalls uint16 // what depth in mustDecode are we in now.\n\n\t_ [6]uint8 // padding\n}\n\nfunc (z *bufioDecReader) reset(r io.Reader, bufsize int) {\n\tz.ioDecReaderCommon.reset(r)\n\tz.c = 0\n\tz.calls = 0\n\tif cap(z.buf) >= bufsize {\n\t\tz.buf = z.buf[:0]\n\t} else {\n\t\tz.buf = z.bytesBufPooler.get(bufsize)[:0]\n\t\t// z.buf = make([]byte, 0, bufsize)\n\t}\n}\n\nfunc (z *bufioDecReader) release() {\n\tz.buf = nil\n\tz.bytesBufPooler.end()\n}\n\nfunc (z *bufioDecReader) readb(p []byte) {\n\tvar n = uint(copy(p, z.buf[z.c:]))\n\tz.n += n\n\tz.c += n\n\tif len(p) == int(n) {\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, p...) // cost=9\n\t\t}\n\t} else {\n\t\tz.readbFill(p, n)\n\t}\n}\n\n//go:noinline - fallback when z.buf is consumed\nfunc (z *bufioDecReader) readbFill(p0 []byte, n uint) {\n\t// at this point, there's nothing in z.buf to read (z.buf is fully consumed)\n\tp := p0[n:]\n\tvar n2 uint\n\tvar err error\n\tif len(p) > cap(z.buf) {\n\t\tn2, err = decReadFull(z.r, p)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tn += n2\n\t\tz.n += n2\n\t\t// always keep last byte in z.buf\n\t\tz.buf = z.buf[:1]\n\t\tz.buf[0] = p[len(p)-1]\n\t\tz.c = 1\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, p0[:n]...)\n\t\t}\n\t\treturn\n\t}\n\t// z.c is now 0, and len(p) <= cap(z.buf)\nLOOP:\n\t// for len(p) > 0 && z.err == nil {\n\tif len(p) > 0 {\n\t\tz.buf = z.buf[0:cap(z.buf)]\n\t\tvar n1 int\n\t\tn1, err = z.r.Read(z.buf)\n\t\tn2 = uint(n1)\n\t\tif n2 == 0 && err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tz.buf = z.buf[:n2]\n\t\tn2 = uint(copy(p, z.buf))\n\t\tz.c = n2\n\t\tn += n2\n\t\tz.n += n2\n\t\tp = p[n2:]\n\t\tgoto LOOP\n\t}\n\tif z.c == 0 {\n\t\tz.buf = z.buf[:1]\n\t\tz.buf[0] = p[len(p)-1]\n\t\tz.c = 1\n\t}\n\tif z.trb {\n\t\tz.tr = append(z.tr, p0[:n]...)\n\t}\n}\n\nfunc (z *bufioDecReader) readn1() (b byte) {\n\t// fast-path, so we elide calling into Read() most of the time\n\tif z.c < uint(len(z.buf)) {\n\t\tb = z.buf[z.c]\n\t\tz.c++\n\t\tz.n++\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, b)\n\t\t}\n\t} else { // meaning z.c == len(z.buf) or greater ... so need to fill\n\t\tz.readbFill(z.b[:1], 0)\n\t\tb = z.b[0]\n\t}\n\treturn\n}\n\nfunc (z *bufioDecReader) unreadn1() {\n\tif z.c == 0 {\n\t\tpanic(errDecUnreadByteNothingToRead)\n\t}\n\tz.c--\n\tz.n--\n\tif z.trb {\n\t\tz.tr = z.tr[:len(z.tr)-1]\n\t}\n}\n\nfunc (z *bufioDecReader) readx(n uint) (bs []byte) {\n\tif n == 0 {\n\t\t// return\n\t} else if z.c+n <= uint(len(z.buf)) {\n\t\tbs = z.buf[z.c : z.c+n]\n\t\tz.n += n\n\t\tz.c += n\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, bs...)\n\t\t}\n\t} else {\n\t\tbs = make([]byte, n)\n\t\t// n no longer used - can reuse\n\t\tn = uint(copy(bs, z.buf[z.c:]))\n\t\tz.n += n\n\t\tz.c += n\n\t\tz.readbFill(bs, n)\n\t}\n\treturn\n}\n\n//go:noinline - track called by Decoder.nextValueBytes() (called by jsonUnmarshal,rawBytes)\nfunc (z *bufioDecReader) doTrack(y uint) {\n\tz.tr = append(z.tr, z.buf[z.c:y]...) // cost=14???\n}\n\nfunc (z *bufioDecReader) skipLoopFn(i uint) {\n\tz.n += (i - z.c) - 1\n\ti++\n\tif z.trb {\n\t\t// z.tr = append(z.tr, z.buf[z.c:i]...)\n\t\tz.doTrack(i)\n\t}\n\tz.c = i\n}\n\nfunc (z *bufioDecReader) skip(accept *bitset256) (token byte) {\n\t// token, _ = z.search(nil, accept, 0, 1); return\n\n\t// for i := z.c; i < len(z.buf); i++ {\n\t// \tif token = z.buf[i]; !accept.isset(token) {\n\t// \t\tz.skipLoopFn(i)\n\t// \t\treturn\n\t// \t}\n\t// }\n\n\ti := z.c\nLOOP:\n\tif i < uint(len(z.buf)) {\n\t\t// inline z.skipLoopFn(i) and refactor, so cost is within inline budget\n\t\ttoken = z.buf[i]\n\t\ti++\n\t\tif accept.isset(token) {\n\t\t\tgoto LOOP\n\t\t}\n\t\tz.n += i - 2 - z.c\n\t\tif z.trb {\n\t\t\tz.doTrack(i)\n\t\t}\n\t\tz.c = i\n\t\treturn\n\t}\n\treturn z.skipFill(accept)\n}\n\nfunc (z *bufioDecReader) skipFill(accept *bitset256) (token byte) {\n\tz.n += uint(len(z.buf)) - z.c\n\tif z.trb {\n\t\tz.tr = append(z.tr, z.buf[z.c:]...)\n\t}\n\tvar n2 int\n\tvar err error\n\tfor {\n\t\tz.c = 0\n\t\tz.buf = z.buf[0:cap(z.buf)]\n\t\tn2, err = z.r.Read(z.buf)\n\t\tif n2 == 0 && err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tz.buf = z.buf[:n2]\n\t\tvar i int\n\t\tfor i, token = range z.buf {\n\t\t\tif !accept.isset(token) {\n\t\t\t\tz.skipLoopFn(uint(i))\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t\t// for i := 0; i < n2; i++ {\n\t\t// \tif token = z.buf[i]; !accept.isset(token) {\n\t\t// \t\tz.skipLoopFn(i)\n\t\t// \t\treturn\n\t\t// \t}\n\t\t// }\n\t\tz.n += uint(n2)\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, z.buf...)\n\t\t}\n\t}\n}\n\nfunc (z *bufioDecReader) readToLoopFn(i uint, out0 []byte) (out []byte) {\n\t// out0 is never nil\n\tz.n += (i - z.c) - 1\n\tout = append(out0, z.buf[z.c:i]...)\n\tif z.trb {\n\t\tz.doTrack(i)\n\t}\n\tz.c = i\n\treturn\n}\n\nfunc (z *bufioDecReader) readTo(in []byte, accept *bitset256) (out []byte) {\n\t// _, out = z.search(in, accept, 0, 2); return\n\n\t// for i := z.c; i < len(z.buf); i++ {\n\t// \tif !accept.isset(z.buf[i]) {\n\t// \t\treturn z.readToLoopFn(i, nil)\n\t// \t}\n\t// }\n\n\ti := z.c\nLOOP:\n\tif i < uint(len(z.buf)) {\n\t\tif !accept.isset(z.buf[i]) {\n\t\t\t// return z.readToLoopFn(i, nil)\n\t\t\t// inline readToLoopFn here (for performance)\n\t\t\tz.n += (i - z.c) - 1\n\t\t\tout = z.buf[z.c:i]\n\t\t\tif z.trb {\n\t\t\t\tz.doTrack(i)\n\t\t\t}\n\t\t\tz.c = i\n\t\t\treturn\n\t\t}\n\t\ti++\n\t\tgoto LOOP\n\t}\n\treturn z.readToFill(in, accept)\n}\n\nfunc (z *bufioDecReader) readToFill(in []byte, accept *bitset256) (out []byte) {\n\tz.n += uint(len(z.buf)) - z.c\n\tout = append(in, z.buf[z.c:]...)\n\tif z.trb {\n\t\tz.tr = append(z.tr, z.buf[z.c:]...)\n\t}\n\tvar n2 int\n\tvar err error\n\tfor {\n\t\tz.c = 0\n\t\tz.buf = z.buf[0:cap(z.buf)]\n\t\tn2, err = z.r.Read(z.buf)\n\t\tif n2 == 0 && err != nil {\n\t\t\tif err == io.EOF {\n\t\t\t\treturn // readTo should read until it matches or end is reached\n\t\t\t}\n\t\t\tpanic(err)\n\t\t}\n\t\tz.buf = z.buf[:n2]\n\t\tfor i, token := range z.buf {\n\t\t\tif !accept.isset(token) {\n\t\t\t\treturn z.readToLoopFn(uint(i), out)\n\t\t\t}\n\t\t}\n\t\t// for i := 0; i < n2; i++ {\n\t\t// \tif !accept.isset(z.buf[i]) {\n\t\t// \t\treturn z.readToLoopFn(i, out)\n\t\t// \t}\n\t\t// }\n\t\tout = append(out, z.buf...)\n\t\tz.n += uint(n2)\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, z.buf...)\n\t\t}\n\t}\n}\n\nfunc (z *bufioDecReader) readUntilLoopFn(i uint, out0 []byte) (out []byte) {\n\tz.n += (i - z.c) - 1\n\ti++\n\tout = append(out0, z.buf[z.c:i]...)\n\tif z.trb {\n\t\t// z.tr = append(z.tr, z.buf[z.c:i]...)\n\t\tz.doTrack(i)\n\t}\n\tz.c = i\n\treturn\n}\n\nfunc (z *bufioDecReader) readUntil(in []byte, stop byte) (out []byte) {\n\t// _, out = z.search(in, nil, stop, 4); return\n\n\t// for i := z.c; i < len(z.buf); i++ {\n\t// \tif z.buf[i] == stop {\n\t// \t\treturn z.readUntilLoopFn(i, nil)\n\t// \t}\n\t// }\n\n\ti := z.c\nLOOP:\n\tif i < uint(len(z.buf)) {\n\t\tif z.buf[i] == stop {\n\t\t\t// inline readUntilLoopFn\n\t\t\t// return z.readUntilLoopFn(i, nil)\n\t\t\tz.n += (i - z.c) - 1\n\t\t\ti++\n\t\t\tout = z.buf[z.c:i]\n\t\t\tif z.trb {\n\t\t\t\tz.doTrack(i)\n\t\t\t}\n\t\t\tz.c = i\n\t\t\treturn\n\t\t}\n\t\ti++\n\t\tgoto LOOP\n\t}\n\treturn z.readUntilFill(in, stop)\n}\n\nfunc (z *bufioDecReader) readUntilFill(in []byte, stop byte) (out []byte) {\n\tz.n += uint(len(z.buf)) - z.c\n\tout = append(in, z.buf[z.c:]...)\n\tif z.trb {\n\t\tz.tr = append(z.tr, z.buf[z.c:]...)\n\t}\n\tvar n1 int\n\tvar n2 uint\n\tvar err error\n\tfor {\n\t\tz.c = 0\n\t\tz.buf = z.buf[0:cap(z.buf)]\n\t\tn1, err = z.r.Read(z.buf)\n\t\tn2 = uint(n1)\n\t\tif n2 == 0 && err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tz.buf = z.buf[:n2]\n\t\tfor i, token := range z.buf {\n\t\t\tif token == stop {\n\t\t\t\treturn z.readUntilLoopFn(uint(i), out)\n\t\t\t}\n\t\t}\n\t\t// for i := 0; i < n2; i++ {\n\t\t// \tif z.buf[i] == stop {\n\t\t// \t\treturn z.readUntilLoopFn(i, out)\n\t\t// \t}\n\t\t// }\n\t\tout = append(out, z.buf...)\n\t\tz.n += n2\n\t\tif z.trb {\n\t\t\tz.tr = append(z.tr, z.buf...)\n\t\t}\n\t}\n}\n\n// ------------------------------------\n\nvar errBytesDecReaderCannotUnread = errors.New(\"cannot unread last byte read\")\n\n// bytesDecReader is a decReader that reads off a byte slice with zero copying\ntype bytesDecReader struct {\n\tb []byte // data\n\tc uint // cursor\n\tt uint // track start\n\t// a int // available\n}\n\nfunc (z *bytesDecReader) reset(in []byte) {\n\tz.b = in\n\t// z.a = len(in)\n\tz.c = 0\n\tz.t = 0\n}\n\nfunc (z *bytesDecReader) numread() uint {\n\treturn z.c\n}\n\nfunc (z *bytesDecReader) unreadn1() {\n\tif z.c == 0 || len(z.b) == 0 {\n\t\tpanic(errBytesDecReaderCannotUnread)\n\t}\n\tz.c--\n\t// z.a++\n}\n\nfunc (z *bytesDecReader) readx(n uint) (bs []byte) {\n\t// slicing from a non-constant start position is more expensive,\n\t// as more computation is required to decipher the pointer start position.\n\t// However, we do it only once, and it's better than reslicing both z.b and return value.\n\n\t// if n <= 0 {\n\t// } else if z.a == 0 {\n\t// \tpanic(io.EOF)\n\t// } else if n > z.a {\n\t// \tpanic(io.ErrUnexpectedEOF)\n\t// } else {\n\t// \tc0 := z.c\n\t// \tz.c = c0 + n\n\t// \tz.a = z.a - n\n\t// \tbs = z.b[c0:z.c]\n\t// }\n\t// return\n\n\tif n != 0 {\n\t\tz.c += n\n\t\tif z.c > uint(len(z.b)) {\n\t\t\tz.c = uint(len(z.b))\n\t\t\tpanic(io.EOF)\n\t\t}\n\t\tbs = z.b[z.c-n : z.c]\n\t}\n\treturn\n\n\t// if n == 0 {\n\t// } else if z.c+n > uint(len(z.b)) {\n\t// \tz.c = uint(len(z.b))\n\t// \tpanic(io.EOF)\n\t// } else {\n\t// \tz.c += n\n\t// \tbs = z.b[z.c-n : z.c]\n\t// }\n\t// return\n\n\t// if n == 0 {\n\t// \treturn\n\t// }\n\t// if z.c == uint(len(z.b)) {\n\t// \tpanic(io.EOF)\n\t// }\n\t// if z.c+n > uint(len(z.b)) {\n\t// \tpanic(io.ErrUnexpectedEOF)\n\t// }\n\t// // z.a -= n\n\t// z.c += n\n\t// return z.b[z.c-n : z.c]\n}\n\nfunc (z *bytesDecReader) readb(bs []byte) {\n\tcopy(bs, z.readx(uint(len(bs))))\n}\n\nfunc (z *bytesDecReader) readn1() (v uint8) {\n\tif z.c == uint(len(z.b)) {\n\t\tpanic(io.EOF)\n\t}\n\tv = z.b[z.c]\n\tz.c++\n\t// z.a--\n\treturn\n}\n\n// func (z *bytesDecReader) readn1eof() (v uint8, eof bool) {\n// \tif z.a == 0 {\n// \t\teof = true\n// \t\treturn\n// \t}\n// \tv = z.b[z.c]\n// \tz.c++\n// \tz.a--\n// \treturn\n// }\n\nfunc (z *bytesDecReader) skip(accept *bitset256) (token byte) {\n\ti := z.c\n\t// if i == len(z.b) {\n\t// \tgoto END\n\t// \t// panic(io.EOF)\n\t// }\n\n\t// Replace loop with goto construct, so that this can be inlined\n\t// for i := z.c; i < blen; i++ {\n\t// \tif !accept.isset(z.b[i]) {\n\t// \t\ttoken = z.b[i]\n\t// \t\ti++\n\t// \t\tz.a -= (i - z.c)\n\t// \t\tz.c = i\n\t// \t\treturn\n\t// \t}\n\t// }\n\n\t// i := z.c\nLOOP:\n\tif i < uint(len(z.b)) {\n\t\ttoken = z.b[i]\n\t\ti++\n\t\tif accept.isset(token) {\n\t\t\tgoto LOOP\n\t\t}\n\t\t// z.a -= (i - z.c)\n\t\tz.c = i\n\t\treturn\n\t}\n\t// END:\n\tpanic(io.EOF)\n\t// // z.a = 0\n\t// z.c = blen\n\t// return\n}\n\nfunc (z *bytesDecReader) readTo(_ []byte, accept *bitset256) (out []byte) {\n\treturn z.readToNoInput(accept)\n}\n\nfunc (z *bytesDecReader) readToNoInput(accept *bitset256) (out []byte) {\n\ti := z.c\n\tif i == uint(len(z.b)) {\n\t\tpanic(io.EOF)\n\t}\n\n\t// Replace loop with goto construct, so that this can be inlined\n\t// for i := z.c; i < blen; i++ {\n\t// \tif !accept.isset(z.b[i]) {\n\t// \t\tout = z.b[z.c:i]\n\t// \t\tz.a -= (i - z.c)\n\t// \t\tz.c = i\n\t// \t\treturn\n\t// \t}\n\t// }\n\t// out = z.b[z.c:]\n\t// z.a, z.c = 0, blen\n\t// return\n\n\t// \ti := z.c\n\t// LOOP:\n\t// \tif i < blen {\n\t// \t\tif accept.isset(z.b[i]) {\n\t// \t\t\ti++\n\t// \t\t\tgoto LOOP\n\t// \t\t}\n\t// \t\tout = z.b[z.c:i]\n\t// \t\tz.a -= (i - z.c)\n\t// \t\tz.c = i\n\t// \t\treturn\n\t// \t}\n\t// \tout = z.b[z.c:]\n\t// \t// z.a, z.c = 0, blen\n\t// \tz.a = 0\n\t// \tz.c = blen\n\t// \treturn\n\n\t// c := i\nLOOP:\n\tif i < uint(len(z.b)) {\n\t\tif accept.isset(z.b[i]) {\n\t\t\ti++\n\t\t\tgoto LOOP\n\t\t}\n\t}\n\n\tout = z.b[z.c:i]\n\t// z.a -= (i - z.c)\n\tz.c = i\n\treturn // z.b[c:i]\n\t// z.c, i = i, z.c\n\t// return z.b[i:z.c]\n}\n\nfunc (z *bytesDecReader) readUntil(_ []byte, stop byte) (out []byte) {\n\treturn z.readUntilNoInput(stop)\n}\n\nfunc (z *bytesDecReader) readUntilNoInput(stop byte) (out []byte) {\n\ti := z.c\n\t// if i == len(z.b) {\n\t// \tpanic(io.EOF)\n\t// }\n\n\t// Replace loop with goto construct, so that this can be inlined\n\t// for i := z.c; i < blen; i++ {\n\t// \tif z.b[i] == stop {\n\t// \t\ti++\n\t// \t\tout = z.b[z.c:i]\n\t// \t\tz.a -= (i - z.c)\n\t// \t\tz.c = i\n\t// \t\treturn\n\t// \t}\n\t// }\nLOOP:\n\tif i < uint(len(z.b)) {\n\t\tif z.b[i] == stop {\n\t\t\ti++\n\t\t\tout = z.b[z.c:i]\n\t\t\t// z.a -= (i - z.c)\n\t\t\tz.c = i\n\t\t\treturn\n\t\t}\n\t\ti++\n\t\tgoto LOOP\n\t}\n\t// z.a = 0\n\t// z.c = blen\n\tpanic(io.EOF)\n}\n\nfunc (z *bytesDecReader) track() {\n\tz.t = z.c\n}\n\nfunc (z *bytesDecReader) stopTrack() (bs []byte) {\n\treturn z.b[z.t:z.c]\n}\n\n// ----------------------------------------\n\n// func (d *Decoder) builtin(f *codecFnInfo, rv reflect.Value) {\n// \td.d.DecodeBuiltin(f.ti.rtid, rv2i(rv))\n// }\n\nfunc (d *Decoder) rawExt(f *codecFnInfo, rv reflect.Value) {\n\td.d.DecodeExt(rv2i(rv), 0, nil)\n}\n\nfunc (d *Decoder) ext(f *codecFnInfo, rv reflect.Value) {\n\td.d.DecodeExt(rv2i(rv), f.xfTag, f.xfFn)\n}\n\nfunc (d *Decoder) selferUnmarshal(f *codecFnInfo, rv reflect.Value) {\n\trv2i(rv).(Selfer).CodecDecodeSelf(d)\n}\n\nfunc (d *Decoder) binaryUnmarshal(f *codecFnInfo, rv reflect.Value) {\n\tbm := rv2i(rv).(encoding.BinaryUnmarshaler)\n\txbs := d.d.DecodeBytes(nil, true)\n\tif fnerr := bm.UnmarshalBinary(xbs); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\nfunc (d *Decoder) textUnmarshal(f *codecFnInfo, rv reflect.Value) {\n\ttm := rv2i(rv).(encoding.TextUnmarshaler)\n\tfnerr := tm.UnmarshalText(d.d.DecodeStringAsBytes())\n\tif fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\nfunc (d *Decoder) jsonUnmarshal(f *codecFnInfo, rv reflect.Value) {\n\ttm := rv2i(rv).(jsonUnmarshaler)\n\t// bs := d.d.DecodeBytes(d.b[:], true, true)\n\t// grab the bytes to be read, as UnmarshalJSON needs the full JSON so as to unmarshal it itself.\n\tfnerr := tm.UnmarshalJSON(d.nextValueBytes())\n\tif fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\nfunc (d *Decoder) kErr(f *codecFnInfo, rv reflect.Value) {\n\td.errorf(\"no decoding function defined for kind %v\", rv.Kind())\n}\n\n// var kIntfCtr uint64\n\nfunc (d *Decoder) kInterfaceNaked(f *codecFnInfo) (rvn reflect.Value) {\n\t// nil interface:\n\t// use some hieristics to decode it appropriately\n\t// based on the detected next value in the stream.\n\tn := d.naked()\n\td.d.DecodeNaked()\n\tif n.v == valueTypeNil {\n\t\treturn\n\t}\n\t// We cannot decode non-nil stream value into nil interface with methods (e.g. io.Reader).\n\tif f.ti.numMeth > 0 {\n\t\td.errorf(\"cannot decode non-nil codec value into nil %v (%v methods)\", f.ti.rt, f.ti.numMeth)\n\t\treturn\n\t}\n\t// var useRvn bool\n\tswitch n.v {\n\tcase valueTypeMap:\n\t\t// if json, default to a map type with string keys\n\t\tmtid := d.mtid\n\t\tif mtid == 0 {\n\t\t\tif d.jsms {\n\t\t\t\tmtid = mapStrIntfTypId\n\t\t\t} else {\n\t\t\t\tmtid = mapIntfIntfTypId\n\t\t\t}\n\t\t}\n\t\tif mtid == mapIntfIntfTypId {\n\t\t\tvar v2 map[interface{}]interface{}\n\t\t\td.decode(&v2)\n\t\t\trvn = reflect.ValueOf(&v2).Elem()\n\t\t} else if mtid == mapStrIntfTypId { // for json performance\n\t\t\tvar v2 map[string]interface{}\n\t\t\td.decode(&v2)\n\t\t\trvn = reflect.ValueOf(&v2).Elem()\n\t\t} else {\n\t\t\tif d.mtr {\n\t\t\t\trvn = reflect.New(d.h.MapType)\n\t\t\t\td.decode(rv2i(rvn))\n\t\t\t\trvn = rvn.Elem()\n\t\t\t} else {\n\t\t\t\trvn = reflect.New(d.h.MapType).Elem()\n\t\t\t\td.decodeValue(rvn, nil, true)\n\t\t\t}\n\t\t}\n\tcase valueTypeArray:\n\t\tif d.stid == 0 || d.stid == intfSliceTypId {\n\t\t\tvar v2 []interface{}\n\t\t\td.decode(&v2)\n\t\t\trvn = reflect.ValueOf(&v2).Elem()\n\t\t\tif reflectArrayOfSupported && d.stid == 0 && d.h.PreferArrayOverSlice {\n\t\t\t\trvn2 := reflect.New(reflectArrayOf(rvn.Len(), intfTyp)).Elem()\n\t\t\t\treflect.Copy(rvn2, rvn)\n\t\t\t\trvn = rvn2\n\t\t\t}\n\t\t} else {\n\t\t\tif d.str {\n\t\t\t\trvn = reflect.New(d.h.SliceType)\n\t\t\t\td.decode(rv2i(rvn))\n\t\t\t\trvn = rvn.Elem()\n\t\t\t} else {\n\t\t\t\trvn = reflect.New(d.h.SliceType).Elem()\n\t\t\t\td.decodeValue(rvn, nil, true)\n\t\t\t}\n\t\t}\n\tcase valueTypeExt:\n\t\tvar v interface{}\n\t\ttag, bytes := n.u, n.l // calling decode below might taint the values\n\t\tif bytes == nil {\n\t\t\td.decode(&v)\n\t\t}\n\t\tbfn := d.h.getExtForTag(tag)\n\t\tif bfn == nil {\n\t\t\tvar re RawExt\n\t\t\tre.Tag = tag\n\t\t\tre.Data = detachZeroCopyBytes(d.bytes, nil, bytes)\n\t\t\tre.Value = v\n\t\t\trvn = reflect.ValueOf(&re).Elem()\n\t\t} else {\n\t\t\trvnA := reflect.New(bfn.rt)\n\t\t\tif bytes != nil {\n\t\t\t\tbfn.ext.ReadExt(rv2i(rvnA), bytes)\n\t\t\t} else {\n\t\t\t\tbfn.ext.UpdateExt(rv2i(rvnA), v)\n\t\t\t}\n\t\t\trvn = rvnA.Elem()\n\t\t}\n\tcase valueTypeNil:\n\t\t// no-op\n\tcase valueTypeInt:\n\t\trvn = n.ri()\n\tcase valueTypeUint:\n\t\trvn = n.ru()\n\tcase valueTypeFloat:\n\t\trvn = n.rf()\n\tcase valueTypeBool:\n\t\trvn = n.rb()\n\tcase valueTypeString, valueTypeSymbol:\n\t\trvn = n.rs()\n\tcase valueTypeBytes:\n\t\trvn = n.rl()\n\tcase valueTypeTime:\n\t\trvn = n.rt()\n\tdefault:\n\t\tpanicv.errorf(\"kInterfaceNaked: unexpected valueType: %d\", n.v)\n\t}\n\treturn\n}\n\nfunc (d *Decoder) kInterface(f *codecFnInfo, rv reflect.Value) {\n\t// Note:\n\t// A consequence of how kInterface works, is that\n\t// if an interface already contains something, we try\n\t// to decode into what was there before.\n\t// We do not replace with a generic value (as got from decodeNaked).\n\n\t// every interface passed here MUST be settable.\n\tvar rvn reflect.Value\n\tif rv.IsNil() || d.h.InterfaceReset {\n\t\t// check if mapping to a type: if so, initialize it and move on\n\t\trvn = d.h.intf2impl(f.ti.rtid)\n\t\tif rvn.IsValid() {\n\t\t\trv.Set(rvn)\n\t\t} else {\n\t\t\trvn = d.kInterfaceNaked(f)\n\t\t\tif rvn.IsValid() {\n\t\t\t\trv.Set(rvn)\n\t\t\t} else if d.h.InterfaceReset {\n\t\t\t\t// reset to zero value based on current type in there.\n\t\t\t\trv.Set(reflect.Zero(rv.Elem().Type()))\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t} else {\n\t\t// now we have a non-nil interface value, meaning it contains a type\n\t\trvn = rv.Elem()\n\t}\n\tif d.d.TryDecodeAsNil() {\n\t\trv.Set(reflect.Zero(rvn.Type()))\n\t\treturn\n\t}\n\n\t// Note: interface{} is settable, but underlying type may not be.\n\t// Consequently, we MAY have to create a decodable value out of the underlying value,\n\t// decode into it, and reset the interface itself.\n\t// fmt.Printf(\">>>> kInterface: rvn type: %v, rv type: %v\\n\", rvn.Type(), rv.Type())\n\n\trvn2, canDecode := isDecodeable(rvn)\n\tif canDecode {\n\t\td.decodeValue(rvn2, nil, true)\n\t\treturn\n\t}\n\n\trvn2 = reflect.New(rvn.Type()).Elem()\n\trvn2.Set(rvn)\n\td.decodeValue(rvn2, nil, true)\n\trv.Set(rvn2)\n}\n\nfunc decStructFieldKey(dd decDriver, keyType valueType, b *[decScratchByteArrayLen]byte) (rvkencname []byte) {\n\t// use if-else-if, not switch (which compiles to binary-search)\n\t// since keyType is typically valueTypeString, branch prediction is pretty good.\n\n\tif keyType == valueTypeString {\n\t\trvkencname = dd.DecodeStringAsBytes()\n\t} else if keyType == valueTypeInt {\n\t\trvkencname = strconv.AppendInt(b[:0], dd.DecodeInt64(), 10)\n\t} else if keyType == valueTypeUint {\n\t\trvkencname = strconv.AppendUint(b[:0], dd.DecodeUint64(), 10)\n\t} else if keyType == valueTypeFloat {\n\t\trvkencname = strconv.AppendFloat(b[:0], dd.DecodeFloat64(), 'f', -1, 64)\n\t} else {\n\t\trvkencname = dd.DecodeStringAsBytes()\n\t}\n\treturn rvkencname\n}\n\nfunc (d *Decoder) kStruct(f *codecFnInfo, rv reflect.Value) {\n\tfti := f.ti\n\tdd := d.d\n\tsfn := structFieldNode{v: rv, update: true}\n\tctyp := dd.ContainerType()\n\tvar mf MissingFielder\n\tif fti.mf {\n\t\tmf = rv2i(rv).(MissingFielder)\n\t} else if fti.mfp {\n\t\tmf = rv2i(rv.Addr()).(MissingFielder)\n\t}\n\tif ctyp == valueTypeMap {\n\t\tcontainerLen := d.mapStart()\n\t\tif containerLen == 0 {\n\t\t\td.mapEnd()\n\t\t\treturn\n\t\t}\n\t\ttisfi := fti.sfiSort\n\t\thasLen := containerLen >= 0\n\n\t\tvar rvkencname []byte\n\t\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || dd.CheckBreak()); j++ {\n\t\t\td.mapElemKey()\n\t\t\trvkencname = decStructFieldKey(dd, fti.keyType, &d.b)\n\t\t\td.mapElemValue()\n\t\t\tif k := fti.indexForEncName(rvkencname); k > -1 {\n\t\t\t\tsi := tisfi[k]\n\t\t\t\tif dd.TryDecodeAsNil() {\n\t\t\t\t\tsi.setToZeroValue(rv)\n\t\t\t\t} else {\n\t\t\t\t\td.decodeValue(sfn.field(si), nil, true)\n\t\t\t\t}\n\t\t\t} else if mf != nil {\n\t\t\t\t// store rvkencname in new []byte, as it previously shares Decoder.b, which is used in decode\n\t\t\t\tname2 := rvkencname\n\t\t\t\trvkencname = make([]byte, len(rvkencname))\n\t\t\t\tcopy(rvkencname, name2)\n\n\t\t\t\tvar f interface{}\n\t\t\t\t// xdebugf(\"kStruct: mf != nil: before decode: rvkencname: %s\", rvkencname)\n\t\t\t\td.decode(&f)\n\t\t\t\t// xdebugf(\"kStruct: mf != nil: after decode: rvkencname: %s\", rvkencname)\n\t\t\t\tif !mf.CodecMissingField(rvkencname, f) && d.h.ErrorIfNoField {\n\t\t\t\t\td.errorf(\"no matching struct field found when decoding stream map with key: %s \",\n\t\t\t\t\t\tstringView(rvkencname))\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\td.structFieldNotFound(-1, stringView(rvkencname))\n\t\t\t}\n\t\t\t// keepAlive4StringView(rvkencnameB) // not needed, as reference is outside loop\n\t\t}\n\t\td.mapEnd()\n\t} else if ctyp == valueTypeArray {\n\t\tcontainerLen := d.arrayStart()\n\t\tif containerLen == 0 {\n\t\t\td.arrayEnd()\n\t\t\treturn\n\t\t}\n\t\t// Not much gain from doing it two ways for array.\n\t\t// Arrays are not used as much for structs.\n\t\thasLen := containerLen >= 0\n\t\tvar checkbreak bool\n\t\tfor j, si := range fti.sfiSrc {\n\t\t\tif hasLen && j == containerLen {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif !hasLen && dd.CheckBreak() {\n\t\t\t\tcheckbreak = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t\td.arrayElem()\n\t\t\tif dd.TryDecodeAsNil() {\n\t\t\t\tsi.setToZeroValue(rv)\n\t\t\t} else {\n\t\t\t\td.decodeValue(sfn.field(si), nil, true)\n\t\t\t}\n\t\t}\n\t\tif (hasLen && containerLen > len(fti.sfiSrc)) || (!hasLen && !checkbreak) {\n\t\t\t// read remaining values and throw away\n\t\t\tfor j := len(fti.sfiSrc); ; j++ {\n\t\t\t\tif (hasLen && j == containerLen) || (!hasLen && dd.CheckBreak()) {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\td.arrayElem()\n\t\t\t\td.structFieldNotFound(j, \"\")\n\t\t\t}\n\t\t}\n\t\td.arrayEnd()\n\t} else {\n\t\td.errorstr(errstrOnlyMapOrArrayCanDecodeIntoStruct)\n\t\treturn\n\t}\n}\n\nfunc (d *Decoder) kSlice(f *codecFnInfo, rv reflect.Value) {\n\t// A slice can be set from a map or array in stream.\n\t// This way, the order can be kept (as order is lost with map).\n\n\tfrt := f.ti.rt\n\tif f.seq == seqTypeChan && f.ti.chandir&uint8(reflect.SendDir) == 0 {\n\t\td.errorf(\"receive-only channel cannot be decoded\")\n\t}\n\tdd := d.d\n\trtelem0 := f.ti.elem\n\tctyp := dd.ContainerType()\n\tif ctyp == valueTypeBytes || ctyp == valueTypeString {\n\t\t// you can only decode bytes or string in the stream into a slice or array of bytes\n\t\tif !(f.ti.rtid == uint8SliceTypId || rtelem0.Kind() == reflect.Uint8) {\n\t\t\td.errorf(\"bytes/string in stream must decode into slice/array of bytes, not %v\", frt)\n\t\t}\n\t\tif f.seq == seqTypeChan {\n\t\t\tbs2 := dd.DecodeBytes(nil, true)\n\t\t\tirv := rv2i(rv)\n\t\t\tch, ok := irv.(chan<- byte)\n\t\t\tif !ok {\n\t\t\t\tch = irv.(chan byte)\n\t\t\t}\n\t\t\tfor _, b := range bs2 {\n\t\t\t\tch <- b\n\t\t\t}\n\t\t} else {\n\t\t\trvbs := rv.Bytes()\n\t\t\tbs2 := dd.DecodeBytes(rvbs, false)\n\t\t\t// if rvbs == nil && bs2 != nil || rvbs != nil && bs2 == nil || len(bs2) != len(rvbs) {\n\t\t\tif !(len(bs2) > 0 && len(bs2) == len(rvbs) && &bs2[0] == &rvbs[0]) {\n\t\t\t\tif rv.CanSet() {\n\t\t\t\t\trv.SetBytes(bs2)\n\t\t\t\t} else if len(rvbs) > 0 && len(bs2) > 0 {\n\t\t\t\t\tcopy(rvbs, bs2)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn\n\t}\n\n\t// array := f.seq == seqTypeChan\n\n\tslh, containerLenS := d.decSliceHelperStart() // only expects valueType(Array|Map)\n\n\t// an array can never return a nil slice. so no need to check f.array here.\n\tif containerLenS == 0 {\n\t\tif rv.CanSet() {\n\t\t\tif f.seq == seqTypeSlice {\n\t\t\t\tif rv.IsNil() {\n\t\t\t\t\trv.Set(reflect.MakeSlice(frt, 0, 0))\n\t\t\t\t} else {\n\t\t\t\t\trv.SetLen(0)\n\t\t\t\t}\n\t\t\t} else if f.seq == seqTypeChan {\n\t\t\t\tif rv.IsNil() {\n\t\t\t\t\trv.Set(reflect.MakeChan(frt, 0))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tslh.End()\n\t\treturn\n\t}\n\n\trtelem0Size := int(rtelem0.Size())\n\trtElem0Kind := rtelem0.Kind()\n\trtelem0Mut := !isImmutableKind(rtElem0Kind)\n\trtelem := rtelem0\n\trtelemkind := rtelem.Kind()\n\tfor rtelemkind == reflect.Ptr {\n\t\trtelem = rtelem.Elem()\n\t\trtelemkind = rtelem.Kind()\n\t}\n\n\tvar fn *codecFn\n\n\tvar rvCanset = rv.CanSet()\n\tvar rvChanged bool\n\tvar rv0 = rv\n\tvar rv9 reflect.Value\n\n\trvlen := rv.Len()\n\trvcap := rv.Cap()\n\thasLen := containerLenS > 0\n\tif hasLen && f.seq == seqTypeSlice {\n\t\tif containerLenS > rvcap {\n\t\t\toldRvlenGtZero := rvlen > 0\n\t\t\trvlen = decInferLen(containerLenS, d.h.MaxInitLen, int(rtelem0.Size()))\n\t\t\tif rvlen <= rvcap {\n\t\t\t\tif rvCanset {\n\t\t\t\t\trv.SetLen(rvlen)\n\t\t\t\t}\n\t\t\t} else if rvCanset {\n\t\t\t\trv = reflect.MakeSlice(frt, rvlen, rvlen)\n\t\t\t\trvcap = rvlen\n\t\t\t\trvChanged = true\n\t\t\t} else {\n\t\t\t\td.errorf(\"cannot decode into non-settable slice\")\n\t\t\t}\n\t\t\tif rvChanged && oldRvlenGtZero && !isImmutableKind(rtelem0.Kind()) {\n\t\t\t\treflect.Copy(rv, rv0) // only copy up to length NOT cap i.e. rv0.Slice(0, rvcap)\n\t\t\t}\n\t\t} else if containerLenS != rvlen {\n\t\t\trvlen = containerLenS\n\t\t\tif rvCanset {\n\t\t\t\trv.SetLen(rvlen)\n\t\t\t}\n\t\t\t// else {\n\t\t\t// rv = rv.Slice(0, rvlen)\n\t\t\t// rvChanged = true\n\t\t\t// d.errorf(\"cannot decode into non-settable slice\")\n\t\t\t// }\n\t\t}\n\t}\n\n\t// consider creating new element once, and just decoding into it.\n\tvar rtelem0Zero reflect.Value\n\tvar rtelem0ZeroValid bool\n\tvar decodeAsNil bool\n\tvar j int\n\n\tfor ; (hasLen && j < containerLenS) || !(hasLen || dd.CheckBreak()); j++ {\n\t\tif j == 0 && (f.seq == seqTypeSlice || f.seq == seqTypeChan) && rv.IsNil() {\n\t\t\tif hasLen {\n\t\t\t\trvlen = decInferLen(containerLenS, d.h.MaxInitLen, rtelem0Size)\n\t\t\t} else if f.seq == seqTypeSlice {\n\t\t\t\trvlen = decDefSliceCap\n\t\t\t} else {\n\t\t\t\trvlen = decDefChanCap\n\t\t\t}\n\t\t\tif rvCanset {\n\t\t\t\tif f.seq == seqTypeSlice {\n\t\t\t\t\trv = reflect.MakeSlice(frt, rvlen, rvlen)\n\t\t\t\t\trvChanged = true\n\t\t\t\t} else { // chan\n\t\t\t\t\trv = reflect.MakeChan(frt, rvlen)\n\t\t\t\t\trvChanged = true\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\td.errorf(\"cannot decode into non-settable slice\")\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tdecodeAsNil = dd.TryDecodeAsNil()\n\t\tif f.seq == seqTypeChan {\n\t\t\tif decodeAsNil {\n\t\t\t\trv.Send(reflect.Zero(rtelem0))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif rtelem0Mut || !rv9.IsValid() { // || (rtElem0Kind == reflect.Ptr && rv9.IsNil()) {\n\t\t\t\trv9 = reflect.New(rtelem0).Elem()\n\t\t\t}\n\t\t\tif fn == nil {\n\t\t\t\tfn = d.h.fn(rtelem, true, true)\n\t\t\t}\n\t\t\td.decodeValue(rv9, fn, true)\n\t\t\trv.Send(rv9)\n\t\t} else {\n\t\t\t// if indefinite, etc, then expand the slice if necessary\n\t\t\tvar decodeIntoBlank bool\n\t\t\tif j >= rvlen {\n\t\t\t\tif f.seq == seqTypeArray {\n\t\t\t\t\td.arrayCannotExpand(rvlen, j+1)\n\t\t\t\t\tdecodeIntoBlank = true\n\t\t\t\t} else { // if f.seq == seqTypeSlice\n\t\t\t\t\t// rv = reflect.Append(rv, reflect.Zero(rtelem0)) // append logic + varargs\n\t\t\t\t\tvar rvcap2 int\n\t\t\t\t\tvar rvErrmsg2 string\n\t\t\t\t\trv9, rvcap2, rvChanged, rvErrmsg2 =\n\t\t\t\t\t\texpandSliceRV(rv, frt, rvCanset, rtelem0Size, 1, rvlen, rvcap)\n\t\t\t\t\tif rvErrmsg2 != \"\" {\n\t\t\t\t\t\td.errorf(rvErrmsg2)\n\t\t\t\t\t}\n\t\t\t\t\trvlen++\n\t\t\t\t\tif rvChanged {\n\t\t\t\t\t\trv = rv9\n\t\t\t\t\t\trvcap = rvcap2\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif decodeIntoBlank {\n\t\t\t\tif !decodeAsNil {\n\t\t\t\t\td.swallow()\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\trv9 = rv.Index(j)\n\t\t\t\tif d.h.SliceElementReset || decodeAsNil {\n\t\t\t\t\tif !rtelem0ZeroValid {\n\t\t\t\t\t\trtelem0ZeroValid = true\n\t\t\t\t\t\trtelem0Zero = reflect.Zero(rtelem0)\n\t\t\t\t\t}\n\t\t\t\t\trv9.Set(rtelem0Zero)\n\t\t\t\t\tif decodeAsNil {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif fn == nil {\n\t\t\t\t\tfn = d.h.fn(rtelem, true, true)\n\t\t\t\t}\n\t\t\t\td.decodeValue(rv9, fn, true)\n\t\t\t}\n\t\t}\n\t}\n\tif f.seq == seqTypeSlice {\n\t\tif j < rvlen {\n\t\t\tif rv.CanSet() {\n\t\t\t\trv.SetLen(j)\n\t\t\t} else if rvCanset {\n\t\t\t\trv = rv.Slice(0, j)\n\t\t\t\trvChanged = true\n\t\t\t} // else { d.errorf(\"kSlice: cannot change non-settable slice\") }\n\t\t\trvlen = j\n\t\t} else if j == 0 && rv.IsNil() {\n\t\t\tif rvCanset {\n\t\t\t\trv = reflect.MakeSlice(frt, 0, 0)\n\t\t\t\trvChanged = true\n\t\t\t} // else { d.errorf(\"kSlice: cannot change non-settable slice\") }\n\t\t}\n\t}\n\tslh.End()\n\n\tif rvChanged { // infers rvCanset=true, so it can be reset\n\t\trv0.Set(rv)\n\t}\n\n}\n\n// func (d *Decoder) kArray(f *codecFnInfo, rv reflect.Value) {\n// \t// d.decodeValueFn(rv.Slice(0, rv.Len()))\n// \tf.kSlice(rv.Slice(0, rv.Len()))\n// }\n\nfunc (d *Decoder) kMap(f *codecFnInfo, rv reflect.Value) {\n\tdd := d.d\n\tcontainerLen := d.mapStart()\n\tti := f.ti\n\tif rv.IsNil() {\n\t\trvlen := decInferLen(containerLen, d.h.MaxInitLen, int(ti.key.Size()+ti.elem.Size()))\n\t\trv.Set(makeMapReflect(ti.rt, rvlen))\n\t}\n\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn\n\t}\n\n\tktype, vtype := ti.key, ti.elem\n\tktypeId := rt2id(ktype)\n\tvtypeKind := vtype.Kind()\n\n\tvar keyFn, valFn *codecFn\n\tvar ktypeLo, vtypeLo reflect.Type\n\n\tfor ktypeLo = ktype; ktypeLo.Kind() == reflect.Ptr; ktypeLo = ktypeLo.Elem() {\n\t}\n\n\tfor vtypeLo = vtype; vtypeLo.Kind() == reflect.Ptr; vtypeLo = vtypeLo.Elem() {\n\t}\n\n\tvar mapGet, mapSet bool\n\trvvImmut := isImmutableKind(vtypeKind)\n\tif !d.h.MapValueReset {\n\t\t// if pointer, mapGet = true\n\t\t// if interface, mapGet = true if !DecodeNakedAlways (else false)\n\t\t// if builtin, mapGet = false\n\t\t// else mapGet = true\n\t\tif vtypeKind == reflect.Ptr {\n\t\t\tmapGet = true\n\t\t} else if vtypeKind == reflect.Interface {\n\t\t\tif !d.h.InterfaceReset {\n\t\t\t\tmapGet = true\n\t\t\t}\n\t\t} else if !rvvImmut {\n\t\t\tmapGet = true\n\t\t}\n\t}\n\n\tvar rvk, rvkp, rvv, rvz reflect.Value\n\trvkMut := !isImmutableKind(ktype.Kind()) // if ktype is immutable, then re-use the same rvk.\n\tktypeIsString := ktypeId == stringTypId\n\tktypeIsIntf := ktypeId == intfTypId\n\thasLen := containerLen > 0\n\tvar kstrbs []byte\n\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || dd.CheckBreak()); j++ {\n\t\tif rvkMut || !rvkp.IsValid() {\n\t\t\trvkp = reflect.New(ktype)\n\t\t\trvk = rvkp.Elem()\n\t\t}\n\t\td.mapElemKey()\n\t\t// if false && dd.TryDecodeAsNil() { // nil cannot be a map key, so disregard this block\n\t\t// \t// Previously, if a nil key, we just ignored the mapped value and continued.\n\t\t// \t// However, that makes the result of encoding and then decoding map[intf]intf{nil:nil}\n\t\t// \t// to be an empty map.\n\t\t// \t// Instead, we treat a nil key as the zero value of the type.\n\t\t// \trvk.Set(reflect.Zero(ktype))\n\t\t// } else if ktypeIsString {\n\t\tif ktypeIsString {\n\t\t\tkstrbs = dd.DecodeStringAsBytes()\n\t\t\trvk.SetString(stringView(kstrbs))\n\t\t\t// NOTE: if doing an insert, you MUST use a real string (not stringview)\n\t\t} else {\n\t\t\tif keyFn == nil {\n\t\t\t\tkeyFn = d.h.fn(ktypeLo, true, true)\n\t\t\t}\n\t\t\td.decodeValue(rvk, keyFn, true)\n\t\t}\n\t\t// special case if a byte array.\n\t\tif ktypeIsIntf {\n\t\t\tif rvk2 := rvk.Elem(); rvk2.IsValid() {\n\t\t\t\tif rvk2.Type() == uint8SliceTyp {\n\t\t\t\t\trvk = reflect.ValueOf(d.string(rvk2.Bytes()))\n\t\t\t\t} else {\n\t\t\t\t\trvk = rvk2\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\td.mapElemValue()\n\n\t\t// Brittle, but OK per TryDecodeAsNil() contract.\n\t\t// i.e. TryDecodeAsNil never shares slices with other decDriver procedures\n\t\tif dd.TryDecodeAsNil() {\n\t\t\tif ktypeIsString {\n\t\t\t\trvk.SetString(d.string(kstrbs))\n\t\t\t}\n\t\t\tif d.h.DeleteOnNilMapValue {\n\t\t\t\trv.SetMapIndex(rvk, reflect.Value{})\n\t\t\t} else {\n\t\t\t\trv.SetMapIndex(rvk, reflect.Zero(vtype))\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tmapSet = true // set to false if u do a get, and its a non-nil pointer\n\t\tif mapGet {\n\t\t\t// mapGet true only in case where kind=Ptr|Interface or kind is otherwise mutable.\n\t\t\trvv = rv.MapIndex(rvk)\n\t\t\tif !rvv.IsValid() {\n\t\t\t\trvv = reflect.New(vtype).Elem()\n\t\t\t} else if vtypeKind == reflect.Ptr {\n\t\t\t\tif rvv.IsNil() {\n\t\t\t\t\trvv = reflect.New(vtype).Elem()\n\t\t\t\t} else {\n\t\t\t\t\tmapSet = false\n\t\t\t\t}\n\t\t\t} else if vtypeKind == reflect.Interface {\n\t\t\t\t// not addressable, and thus not settable.\n\t\t\t\t// e MUST create a settable/addressable variant\n\t\t\t\trvv2 := reflect.New(rvv.Type()).Elem()\n\t\t\t\tif !rvv.IsNil() {\n\t\t\t\t\trvv2.Set(rvv)\n\t\t\t\t}\n\t\t\t\trvv = rvv2\n\t\t\t}\n\t\t\t// else it is ~mutable, and we can just decode into it directly\n\t\t} else if rvvImmut {\n\t\t\tif !rvz.IsValid() {\n\t\t\t\trvz = reflect.New(vtype).Elem()\n\t\t\t}\n\t\t\trvv = rvz\n\t\t} else {\n\t\t\trvv = reflect.New(vtype).Elem()\n\t\t}\n\n\t\t// We MUST be done with the stringview of the key, before decoding the value\n\t\t// so that we don't bastardize the reused byte array.\n\t\tif mapSet && ktypeIsString {\n\t\t\trvk.SetString(d.string(kstrbs))\n\t\t}\n\t\tif valFn == nil {\n\t\t\tvalFn = d.h.fn(vtypeLo, true, true)\n\t\t}\n\t\td.decodeValue(rvv, valFn, true)\n\t\t// d.decodeValueFn(rvv, valFn)\n\t\tif mapSet {\n\t\t\trv.SetMapIndex(rvk, rvv)\n\t\t}\n\t\t// if ktypeIsString {\n\t\t// \t// keepAlive4StringView(kstrbs) // not needed, as reference is outside loop\n\t\t// }\n\t}\n\n\td.mapEnd()\n\n}\n\n// decNaked is used to keep track of the primitives decoded.\n// Without it, we would have to decode each primitive and wrap it\n// in an interface{}, causing an allocation.\n// In this model, the primitives are decoded in a \"pseudo-atomic\" fashion,\n// so we can rest assured that no other decoding happens while these\n// primitives are being decoded.\n//\n// maps and arrays are not handled by this mechanism.\n// However, RawExt is, and we accommodate for extensions that decode\n// RawExt from DecodeNaked, but need to decode the value subsequently.\n// kInterfaceNaked and swallow, which call DecodeNaked, handle this caveat.\n//\n// However, decNaked also keeps some arrays of default maps and slices\n// used in DecodeNaked. This way, we can get a pointer to it\n// without causing a new heap allocation.\n//\n// kInterfaceNaked will ensure that there is no allocation for the common\n// uses.\n\ntype decNaked struct {\n\t// r RawExt // used for RawExt, uint, []byte.\n\n\t// primitives below\n\tu uint64\n\ti int64\n\tf float64\n\tl []byte\n\ts string\n\n\t// ---- cpu cache line boundary?\n\tt time.Time\n\tb bool\n\n\t// state\n\tv valueType\n\t// _ [6]bool // padding\n\n\t// ru, ri, rf, rl, rs, rb, rt reflect.Value // mapping to the primitives above\n\t//\n\t// _ [3]uint64 // padding\n}\n\n// func (n *decNaked) init() {\n// \tn.ru = reflect.ValueOf(&n.u).Elem()\n// \tn.ri = reflect.ValueOf(&n.i).Elem()\n// \tn.rf = reflect.ValueOf(&n.f).Elem()\n// \tn.rl = reflect.ValueOf(&n.l).Elem()\n// \tn.rs = reflect.ValueOf(&n.s).Elem()\n// \tn.rt = reflect.ValueOf(&n.t).Elem()\n// \tn.rb = reflect.ValueOf(&n.b).Elem()\n// \t// n.rr[] = reflect.ValueOf(&n.)\n// }\n\n// type decNakedPooler struct {\n// \tn *decNaked\n// \tnsp *sync.Pool\n// }\n\n// // naked must be called before each call to .DecodeNaked, as they will use it.\n// func (d *decNakedPooler) naked() *decNaked {\n// \tif d.n == nil {\n// \t\t// consider one of:\n// \t\t// - get from sync.Pool (if GC is frequent, there's no value here)\n// \t\t// - new alloc (safest. only init'ed if it a naked decode will be done)\n// \t\t// - field in Decoder (makes the Decoder struct very big)\n// \t\t// To support using a decoder where a DecodeNaked is not needed,\n// \t\t// we prefer #1 or #2.\n// \t\t// d.n = new(decNaked) // &d.nv // new(decNaked) // grab from a sync.Pool\n// \t\t// d.n.init()\n// \t\tvar v interface{}\n// \t\td.nsp, v = pool.decNaked()\n// \t\td.n = v.(*decNaked)\n// \t}\n// \treturn d.n\n// }\n\n// func (d *decNakedPooler) end() {\n// \tif d.n != nil {\n// \t\t// if n != nil, then nsp != nil (they are always set together)\n// \t\td.nsp.Put(d.n)\n// \t\td.n, d.nsp = nil, nil\n// \t}\n// }\n\n// type rtid2rv struct {\n// \trtid uintptr\n// \trv reflect.Value\n// }\n\n// --------------\n\ntype decReaderSwitch struct {\n\tesep bool // has elem separators\n\tmtr, str bool // whether maptype or slicetype are known types\n\n\tbe bool // is binary encoding\n\tjs bool // is json handle\n\tjsms bool // is json handle, and MapKeyAsString\n\n\t// typ entryType\n\tbytes bool // is bytes reader\n\tbufio bool // is this a bufioDecReader?\n\n\trb bytesDecReader\n\tri *ioDecReader\n\tbi *bufioDecReader\n}\n\n// numread, track and stopTrack are always inlined, as they just check int fields, etc.\n\n/*\nfunc (z *decReaderSwitch) numread() int {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.numread()\n\tcase entryTypeIo:\n\t\treturn z.ri.numread()\n\tdefault:\n\t\treturn z.bi.numread()\n\t}\n}\nfunc (z *decReaderSwitch) track() {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.rb.track()\n\tcase entryTypeIo:\n\t\tz.ri.track()\n\tdefault:\n\t\tz.bi.track()\n\t}\n}\nfunc (z *decReaderSwitch) stopTrack() []byte {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.stopTrack()\n\tcase entryTypeIo:\n\t\treturn z.ri.stopTrack()\n\tdefault:\n\t\treturn z.bi.stopTrack()\n\t}\n}\n\nfunc (z *decReaderSwitch) unreadn1() {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.rb.unreadn1()\n\tcase entryTypeIo:\n\t\tz.ri.unreadn1()\n\tdefault:\n\t\tz.bi.unreadn1()\n\t}\n}\nfunc (z *decReaderSwitch) readx(n int) []byte {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.readx(n)\n\tcase entryTypeIo:\n\t\treturn z.ri.readx(n)\n\tdefault:\n\t\treturn z.bi.readx(n)\n\t}\n}\nfunc (z *decReaderSwitch) readb(s []byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.rb.readb(s)\n\tcase entryTypeIo:\n\t\tz.ri.readb(s)\n\tdefault:\n\t\tz.bi.readb(s)\n\t}\n}\nfunc (z *decReaderSwitch) readn1() uint8 {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.readn1()\n\tcase entryTypeIo:\n\t\treturn z.ri.readn1()\n\tdefault:\n\t\treturn z.bi.readn1()\n\t}\n}\nfunc (z *decReaderSwitch) skip(accept *bitset256) (token byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.skip(accept)\n\tcase entryTypeIo:\n\t\treturn z.ri.skip(accept)\n\tdefault:\n\t\treturn z.bi.skip(accept)\n\t}\n}\nfunc (z *decReaderSwitch) readTo(in []byte, accept *bitset256) (out []byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.readTo(in, accept)\n\tcase entryTypeIo:\n\t\treturn z.ri.readTo(in, accept)\n\tdefault:\n\t\treturn z.bi.readTo(in, accept)\n\t}\n}\nfunc (z *decReaderSwitch) readUntil(in []byte, stop byte) (out []byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\treturn z.rb.readUntil(in, stop)\n\tcase entryTypeIo:\n\t\treturn z.ri.readUntil(in, stop)\n\tdefault:\n\t\treturn z.bi.readUntil(in, stop)\n\t}\n}\n\n*/\n\n// the if/else-if/else block is expensive to inline.\n// Each node of this construct costs a lot and dominates the budget.\n// Best to only do an if fast-path else block (so fast-path is inlined).\n// This is irrespective of inlineExtraCallCost set in $GOROOT/src/cmd/compile/internal/gc/inl.go\n//\n// In decReaderSwitch methods below, we delegate all IO functions into their own methods.\n// This allows for the inlining of the common path when z.bytes=true.\n// Go 1.12+ supports inlining methods with up to 1 inlined function (or 2 if no other constructs).\n\nfunc (z *decReaderSwitch) numread() uint {\n\tif z.bytes {\n\t\treturn z.rb.numread()\n\t} else if z.bufio {\n\t\treturn z.bi.numread()\n\t} else {\n\t\treturn z.ri.numread()\n\t}\n}\nfunc (z *decReaderSwitch) track() {\n\tif z.bytes {\n\t\tz.rb.track()\n\t} else if z.bufio {\n\t\tz.bi.track()\n\t} else {\n\t\tz.ri.track()\n\t}\n}\nfunc (z *decReaderSwitch) stopTrack() []byte {\n\tif z.bytes {\n\t\treturn z.rb.stopTrack()\n\t} else if z.bufio {\n\t\treturn z.bi.stopTrack()\n\t} else {\n\t\treturn z.ri.stopTrack()\n\t}\n}\n\n// func (z *decReaderSwitch) unreadn1() {\n// \tif z.bytes {\n// \t\tz.rb.unreadn1()\n// \t} else {\n// \t\tz.unreadn1IO()\n// \t}\n// }\n// func (z *decReaderSwitch) unreadn1IO() {\n// \tif z.bufio {\n// \t\tz.bi.unreadn1()\n// \t} else {\n// \t\tz.ri.unreadn1()\n// \t}\n// }\n\nfunc (z *decReaderSwitch) unreadn1() {\n\tif z.bytes {\n\t\tz.rb.unreadn1()\n\t} else if z.bufio {\n\t\tz.bi.unreadn1()\n\t} else {\n\t\tz.ri.unreadn1() // not inlined\n\t}\n}\n\nfunc (z *decReaderSwitch) readx(n uint) []byte {\n\tif z.bytes {\n\t\treturn z.rb.readx(n)\n\t}\n\treturn z.readxIO(n)\n}\nfunc (z *decReaderSwitch) readxIO(n uint) []byte {\n\tif z.bufio {\n\t\treturn z.bi.readx(n)\n\t}\n\treturn z.ri.readx(n)\n}\n\nfunc (z *decReaderSwitch) readb(s []byte) {\n\tif z.bytes {\n\t\tz.rb.readb(s)\n\t} else {\n\t\tz.readbIO(s)\n\t}\n}\n\n//go:noinline - fallback for io, ensures z.bytes path is inlined\nfunc (z *decReaderSwitch) readbIO(s []byte) {\n\tif z.bufio {\n\t\tz.bi.readb(s)\n\t} else {\n\t\tz.ri.readb(s)\n\t}\n}\n\nfunc (z *decReaderSwitch) readn1() uint8 {\n\tif z.bytes {\n\t\treturn z.rb.readn1()\n\t}\n\treturn z.readn1IO()\n}\nfunc (z *decReaderSwitch) readn1IO() uint8 {\n\tif z.bufio {\n\t\treturn z.bi.readn1()\n\t}\n\treturn z.ri.readn1()\n}\n\nfunc (z *decReaderSwitch) skip(accept *bitset256) (token byte) {\n\tif z.bytes {\n\t\treturn z.rb.skip(accept)\n\t}\n\treturn z.skipIO(accept)\n}\nfunc (z *decReaderSwitch) skipIO(accept *bitset256) (token byte) {\n\tif z.bufio {\n\t\treturn z.bi.skip(accept)\n\t}\n\treturn z.ri.skip(accept)\n}\n\nfunc (z *decReaderSwitch) readTo(in []byte, accept *bitset256) (out []byte) {\n\tif z.bytes {\n\t\treturn z.rb.readToNoInput(accept) // z.rb.readTo(in, accept)\n\t}\n\treturn z.readToIO(in, accept)\n}\n\n//go:noinline - fallback for io, ensures z.bytes path is inlined\nfunc (z *decReaderSwitch) readToIO(in []byte, accept *bitset256) (out []byte) {\n\tif z.bufio {\n\t\treturn z.bi.readTo(in, accept)\n\t}\n\treturn z.ri.readTo(in, accept)\n}\nfunc (z *decReaderSwitch) readUntil(in []byte, stop byte) (out []byte) {\n\tif z.bytes {\n\t\treturn z.rb.readUntilNoInput(stop)\n\t}\n\treturn z.readUntilIO(in, stop)\n}\n\nfunc (z *decReaderSwitch) readUntilIO(in []byte, stop byte) (out []byte) {\n\tif z.bufio {\n\t\treturn z.bi.readUntil(in, stop)\n\t}\n\treturn z.ri.readUntil(in, stop)\n}\n\n// Decoder reads and decodes an object from an input stream in a supported format.\n//\n// Decoder is NOT safe for concurrent use i.e. a Decoder cannot be used\n// concurrently in multiple goroutines.\n//\n// However, as Decoder could be allocation heavy to initialize, a Reset method is provided\n// so its state can be reused to decode new input streams repeatedly.\n// This is the idiomatic way to use.\ntype Decoder struct {\n\tpanicHdl\n\t// hopefully, reduce derefencing cost by laying the decReader inside the Decoder.\n\t// Try to put things that go together to fit within a cache line (8 words).\n\n\td decDriver\n\n\t// NOTE: Decoder shouldn't call its read methods,\n\t// as the handler MAY need to do some coordination.\n\t// r *decReaderSwitch\n\n\t// bi *bufioDecReader\n\t// cache the mapTypeId and sliceTypeId for faster comparisons\n\tmtid uintptr\n\tstid uintptr\n\n\tjdec *jsonDecDriver\n\th *BasicHandle\n\thh Handle\n\n\t// ---- cpu cache line boundary?\n\tdecReaderSwitch\n\n\t// ---- cpu cache line boundary?\n\tn decNaked\n\n\t// cr containerStateRecv\n\n\t// _ [4]uint8 // padding\n\n\tis map[string]string // used for interning strings\n\n\terr error\n\n\t// ---- cpu cache line boundary?\n\t// ---- writable fields during execution --- *try* to keep in sep cache line\n\tmaxdepth int16\n\tdepth int16\n\tc containerState\n\t_ [3]byte // padding\n\tb [decScratchByteArrayLen]byte // scratch buffer, used by Decoder and xxxEncDrivers\n\n\t// padding - false sharing help // modify 232 if Decoder struct changes.\n\t// _ [cacheLineSize - 232%cacheLineSize]byte\n}\n\n// NewDecoder returns a Decoder for decoding a stream of bytes from an io.Reader.\n//\n// For efficiency, Users are encouraged to configure ReaderBufferSize on the handle\n// OR pass in a memory buffered reader (eg bufio.Reader, bytes.Buffer).\nfunc NewDecoder(r io.Reader, h Handle) *Decoder {\n\td := newDecoder(h)\n\td.Reset(r)\n\treturn d\n}\n\n// NewDecoderBytes returns a Decoder which efficiently decodes directly\n// from a byte slice with zero copying.\nfunc NewDecoderBytes(in []byte, h Handle) *Decoder {\n\td := newDecoder(h)\n\td.ResetBytes(in)\n\treturn d\n}\n\n// var defaultDecNaked decNaked\n\nfunc newDecoder(h Handle) *Decoder {\n\td := &Decoder{h: basicHandle(h), err: errDecoderNotInitialized}\n\td.bytes = true\n\tif useFinalizers {\n\t\truntime.SetFinalizer(d, (*Decoder).finalize)\n\t\t// xdebugf(\">>>> new(Decoder) with finalizer\")\n\t}\n\t// d.r = &d.decReaderSwitch\n\td.hh = h\n\td.be = h.isBinary()\n\t// NOTE: do not initialize d.n here. It is lazily initialized in d.naked()\n\tvar jh *JsonHandle\n\tjh, d.js = h.(*JsonHandle)\n\td.jdec = nil\n\tif d.js {\n\t\td.jsms = jh.MapKeyAsString\n\t}\n\td.esep = d.hh.hasElemSeparators()\n\tif d.h.InternString {\n\t\td.is = make(map[string]string, 32)\n\t}\n\td.d = h.newDecDriver(d)\n\tif d.js {\n\t\td.jdec = d.d.(*jsonDecDriver)\n\t}\n\t// d.cr, _ = d.d.(containerStateRecv)\n\treturn d\n}\n\nfunc (d *Decoder) r() *decReaderSwitch {\n\treturn &d.decReaderSwitch\n}\n\nfunc (d *Decoder) resetCommon() {\n\t// d.r = &d.decReaderSwitch\n\td.d.reset()\n\td.err = nil\n\td.depth = 0\n\td.maxdepth = d.h.MaxDepth\n\tif d.maxdepth <= 0 {\n\t\td.maxdepth = decDefMaxDepth\n\t}\n\t// reset all things which were cached from the Handle, but could change\n\td.mtid, d.stid = 0, 0\n\td.mtr, d.str = false, false\n\tif d.h.MapType != nil {\n\t\td.mtid = rt2id(d.h.MapType)\n\t\td.mtr = fastpathAV.index(d.mtid) != -1\n\t}\n\tif d.h.SliceType != nil {\n\t\td.stid = rt2id(d.h.SliceType)\n\t\td.str = fastpathAV.index(d.stid) != -1\n\t}\n}\n\n// Reset the Decoder with a new Reader to decode from,\n// clearing all state from last run(s).\nfunc (d *Decoder) Reset(r io.Reader) {\n\tif r == nil {\n\t\treturn\n\t}\n\td.bytes = false\n\t// d.typ = entryTypeUnset\n\tif d.h.ReaderBufferSize > 0 {\n\t\tif d.bi == nil {\n\t\t\td.bi = new(bufioDecReader)\n\t\t}\n\t\td.bi.reset(r, d.h.ReaderBufferSize)\n\t\t// d.r = d.bi\n\t\t// d.typ = entryTypeBufio\n\t\td.bufio = true\n\t} else {\n\t\t// d.ri.x = &d.b\n\t\t// d.s = d.sa[:0]\n\t\tif d.ri == nil {\n\t\t\td.ri = new(ioDecReader)\n\t\t}\n\t\td.ri.reset(r)\n\t\t// d.r = d.ri\n\t\t// d.typ = entryTypeIo\n\t\td.bufio = false\n\t}\n\td.resetCommon()\n}\n\n// ResetBytes resets the Decoder with a new []byte to decode from,\n// clearing all state from last run(s).\nfunc (d *Decoder) ResetBytes(in []byte) {\n\tif in == nil {\n\t\treturn\n\t}\n\td.bytes = true\n\td.bufio = false\n\t// d.typ = entryTypeBytes\n\td.rb.reset(in)\n\t// d.r = &d.rb\n\td.resetCommon()\n}\n\nfunc (d *Decoder) naked() *decNaked {\n\treturn &d.n\n}\n\n// Decode decodes the stream from reader and stores the result in the\n// value pointed to by v. v cannot be a nil pointer. v can also be\n// a reflect.Value of a pointer.\n//\n// Note that a pointer to a nil interface is not a nil pointer.\n// If you do not know what type of stream it is, pass in a pointer to a nil interface.\n// We will decode and store a value in that nil interface.\n//\n// Sample usages:\n// // Decoding into a non-nil typed value\n// var f float32\n// err = codec.NewDecoder(r, handle).Decode(&f)\n//\n// // Decoding into nil interface\n// var v interface{}\n// dec := codec.NewDecoder(r, handle)\n// err = dec.Decode(&v)\n//\n// When decoding into a nil interface{}, we will decode into an appropriate value based\n// on the contents of the stream:\n// - Numbers are decoded as float64, int64 or uint64.\n// - Other values are decoded appropriately depending on the type:\n// bool, string, []byte, time.Time, etc\n// - Extensions are decoded as RawExt (if no ext function registered for the tag)\n// Configurations exist on the Handle to override defaults\n// (e.g. for MapType, SliceType and how to decode raw bytes).\n//\n// When decoding into a non-nil interface{} value, the mode of encoding is based on the\n// type of the value. When a value is seen:\n// - If an extension is registered for it, call that extension function\n// - If it implements BinaryUnmarshaler, call its UnmarshalBinary(data []byte) error\n// - Else decode it based on its reflect.Kind\n//\n// There are some special rules when decoding into containers (slice/array/map/struct).\n// Decode will typically use the stream contents to UPDATE the container i.e. the values\n// in these containers will not be zero'ed before decoding.\n// - A map can be decoded from a stream map, by updating matching keys.\n// - A slice can be decoded from a stream array,\n// by updating the first n elements, where n is length of the stream.\n// - A slice can be decoded from a stream map, by decoding as if\n// it contains a sequence of key-value pairs.\n// - A struct can be decoded from a stream map, by updating matching fields.\n// - A struct can be decoded from a stream array,\n// by updating fields as they occur in the struct (by index).\n//\n// This in-place update maintains consistency in the decoding philosophy (i.e. we ALWAYS update\n// in place by default). However, the consequence of this is that values in slices or maps\n// which are not zero'ed before hand, will have part of the prior values in place after decode\n// if the stream doesn't contain an update for those parts.\n//\n// This in-place update can be disabled by configuring the MapValueReset and SliceElementReset\n// decode options available on every handle.\n//\n// Furthermore, when decoding a stream map or array with length of 0 into a nil map or slice,\n// we reset the destination map or slice to a zero-length value.\n//\n// However, when decoding a stream nil, we reset the destination container\n// to its \"zero\" value (e.g. nil for slice/map, etc).\n//\n// Note: we allow nil values in the stream anywhere except for map keys.\n// A nil value in the encoded stream where a map key is expected is treated as an error.\nfunc (d *Decoder) Decode(v interface{}) (err error) {\n\t// tried to use closure, as runtime optimizes defer with no params.\n\t// This seemed to be causing weird issues (like circular reference found, unexpected panic, etc).\n\t// Also, see https://github.com/golang/go/issues/14939#issuecomment-417836139\n\t// defer func() { d.deferred(&err) }()\n\t// { x, y := d, &err; defer func() { x.deferred(y) }() }\n\tif d.err != nil {\n\t\treturn d.err\n\t}\n\tif recoverPanicToErr {\n\t\tdefer func() {\n\t\t\tif x := recover(); x != nil {\n\t\t\t\tpanicValToErr(d, x, &d.err)\n\t\t\t\tif d.err != err {\n\t\t\t\t\terr = d.err\n\t\t\t\t}\n\t\t\t}\n\t\t}()\n\t}\n\n\t// defer d.deferred(&err)\n\td.mustDecode(v)\n\treturn\n}\n\n// MustDecode is like Decode, but panics if unable to Decode.\n// This provides insight to the code location that triggered the error.\nfunc (d *Decoder) MustDecode(v interface{}) {\n\tif d.err != nil {\n\t\tpanic(d.err)\n\t}\n\td.mustDecode(v)\n}\n\n// MustDecode is like Decode, but panics if unable to Decode.\n// This provides insight to the code location that triggered the error.\nfunc (d *Decoder) mustDecode(v interface{}) {\n\t// TODO: Top-level: ensure that v is a pointer and not nil.\n\tif d.d.TryDecodeAsNil() {\n\t\tsetZero(v)\n\t\treturn\n\t}\n\tif d.bi == nil {\n\t\td.decode(v)\n\t\treturn\n\t}\n\n\td.bi.calls++\n\td.decode(v)\n\t// xprintf.(\">>>>>>>> >>>>>>>> num decFns: %v\\n\", d.cf.sn)\n\td.bi.calls--\n\tif !d.h.ExplicitRelease && d.bi.calls == 0 {\n\t\td.bi.release()\n\t}\n}\n\n// func (d *Decoder) deferred(err1 *error) {\n// \tif recoverPanicToErr {\n// \t\tif x := recover(); x != nil {\n// \t\t\tpanicValToErr(d, x, err1)\n// \t\t\tpanicValToErr(d, x, &d.err)\n// \t\t}\n// \t}\n// }\n\n//go:noinline -- as it is run by finalizer\nfunc (d *Decoder) finalize() {\n\t// xdebugf(\"finalizing Decoder\")\n\td.Release()\n}\n\n// Release releases shared (pooled) resources.\n//\n// It is important to call Release() when done with a Decoder, so those resources\n// are released instantly for use by subsequently created Decoders.\n//\n// By default, Release() is automatically called unless the option ExplicitRelease is set.\nfunc (d *Decoder) Release() {\n\tif d.bi != nil {\n\t\td.bi.release()\n\t}\n\t// d.decNakedPooler.end()\n}\n\n// // this is not a smart swallow, as it allocates objects and does unnecessary work.\n// func (d *Decoder) swallowViaHammer() {\n// \tvar blank interface{}\n// \td.decodeValueNoFn(reflect.ValueOf(&blank).Elem())\n// }\n\nfunc (d *Decoder) swallow() {\n\t// smarter decode that just swallows the content\n\tdd := d.d\n\tif dd.TryDecodeAsNil() {\n\t\treturn\n\t}\n\tswitch dd.ContainerType() {\n\tcase valueTypeMap:\n\t\tcontainerLen := d.mapStart()\n\t\thasLen := containerLen >= 0\n\t\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || dd.CheckBreak()); j++ {\n\t\t\t// if clenGtEqualZero {if j >= containerLen {break} } else if dd.CheckBreak() {break}\n\t\t\td.mapElemKey()\n\t\t\td.swallow()\n\t\t\td.mapElemValue()\n\t\t\td.swallow()\n\t\t}\n\t\td.mapEnd()\n\tcase valueTypeArray:\n\t\tcontainerLen := d.arrayStart()\n\t\thasLen := containerLen >= 0\n\t\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || dd.CheckBreak()); j++ {\n\t\t\td.arrayElem()\n\t\t\td.swallow()\n\t\t}\n\t\td.arrayEnd()\n\tcase valueTypeBytes:\n\t\tdd.DecodeBytes(d.b[:], true)\n\tcase valueTypeString:\n\t\tdd.DecodeStringAsBytes()\n\tdefault:\n\t\t// these are all primitives, which we can get from decodeNaked\n\t\t// if RawExt using Value, complete the processing.\n\t\tn := d.naked()\n\t\tdd.DecodeNaked()\n\t\tif n.v == valueTypeExt && n.l == nil {\n\t\t\tvar v2 interface{}\n\t\t\td.decode(&v2)\n\t\t}\n\t}\n}\n\nfunc setZero(iv interface{}) {\n\tif iv == nil || definitelyNil(iv) {\n\t\treturn\n\t}\n\tvar canDecode bool\n\tswitch v := iv.(type) {\n\tcase *string:\n\t\t*v = \"\"\n\tcase *bool:\n\t\t*v = false\n\tcase *int:\n\t\t*v = 0\n\tcase *int8:\n\t\t*v = 0\n\tcase *int16:\n\t\t*v = 0\n\tcase *int32:\n\t\t*v = 0\n\tcase *int64:\n\t\t*v = 0\n\tcase *uint:\n\t\t*v = 0\n\tcase *uint8:\n\t\t*v = 0\n\tcase *uint16:\n\t\t*v = 0\n\tcase *uint32:\n\t\t*v = 0\n\tcase *uint64:\n\t\t*v = 0\n\tcase *float32:\n\t\t*v = 0\n\tcase *float64:\n\t\t*v = 0\n\tcase *[]uint8:\n\t\t*v = nil\n\tcase *Raw:\n\t\t*v = nil\n\tcase *time.Time:\n\t\t*v = time.Time{}\n\tcase reflect.Value:\n\t\tif v, canDecode = isDecodeable(v); canDecode && v.CanSet() {\n\t\t\tv.Set(reflect.Zero(v.Type()))\n\t\t} // TODO: else drain if chan, clear if map, set all to nil if slice???\n\tdefault:\n\t\tif !fastpathDecodeSetZeroTypeSwitch(iv) {\n\t\t\tv := reflect.ValueOf(iv)\n\t\t\tif v, canDecode = isDecodeable(v); canDecode && v.CanSet() {\n\t\t\t\tv.Set(reflect.Zero(v.Type()))\n\t\t\t} // TODO: else drain if chan, clear if map, set all to nil if slice???\n\t\t}\n\t}\n}\n\nfunc (d *Decoder) decode(iv interface{}) {\n\t// a switch with only concrete types can be optimized.\n\t// consequently, we deal with nil and interfaces outside the switch.\n\n\tif iv == nil {\n\t\td.errorstr(errstrCannotDecodeIntoNil)\n\t\treturn\n\t}\n\n\tswitch v := iv.(type) {\n\t// case nil:\n\t// case Selfer:\n\tcase reflect.Value:\n\t\tv = d.ensureDecodeable(v)\n\t\td.decodeValue(v, nil, true)\n\n\tcase *string:\n\t\t*v = d.d.DecodeString()\n\tcase *bool:\n\t\t*v = d.d.DecodeBool()\n\tcase *int:\n\t\t*v = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\tcase *int8:\n\t\t*v = int8(chkOvf.IntV(d.d.DecodeInt64(), 8))\n\tcase *int16:\n\t\t*v = int16(chkOvf.IntV(d.d.DecodeInt64(), 16))\n\tcase *int32:\n\t\t*v = int32(chkOvf.IntV(d.d.DecodeInt64(), 32))\n\tcase *int64:\n\t\t*v = d.d.DecodeInt64()\n\tcase *uint:\n\t\t*v = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\tcase *uint8:\n\t\t*v = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\tcase *uint16:\n\t\t*v = uint16(chkOvf.UintV(d.d.DecodeUint64(), 16))\n\tcase *uint32:\n\t\t*v = uint32(chkOvf.UintV(d.d.DecodeUint64(), 32))\n\tcase *uint64:\n\t\t*v = d.d.DecodeUint64()\n\tcase *float32:\n\t\t*v = float32(d.decodeFloat32())\n\tcase *float64:\n\t\t*v = d.d.DecodeFloat64()\n\tcase *[]uint8:\n\t\t*v = d.d.DecodeBytes(*v, false)\n\tcase []uint8:\n\t\tb := d.d.DecodeBytes(v, false)\n\t\tif !(len(b) > 0 && len(b) == len(v) && &b[0] == &v[0]) {\n\t\t\tcopy(v, b)\n\t\t}\n\tcase *time.Time:\n\t\t*v = d.d.DecodeTime()\n\tcase *Raw:\n\t\t*v = d.rawBytes()\n\n\tcase *interface{}:\n\t\td.decodeValue(reflect.ValueOf(iv).Elem(), nil, true)\n\t\t// d.decodeValueNotNil(reflect.ValueOf(iv).Elem())\n\n\tdefault:\n\t\tif v, ok := iv.(Selfer); ok {\n\t\t\tv.CodecDecodeSelf(d)\n\t\t} else if !fastpathDecodeTypeSwitch(iv, d) {\n\t\t\tv := reflect.ValueOf(iv)\n\t\t\tv = d.ensureDecodeable(v)\n\t\t\td.decodeValue(v, nil, false)\n\t\t\t// d.decodeValueFallback(v)\n\t\t}\n\t}\n}\n\nfunc (d *Decoder) decodeValue(rv reflect.Value, fn *codecFn, chkAll bool) {\n\t// If stream is not containing a nil value, then we can deref to the base\n\t// non-pointer value, and decode into that.\n\tvar rvp reflect.Value\n\tvar rvpValid bool\n\tif rv.Kind() == reflect.Ptr {\n\t\trvpValid = true\n\t\tfor {\n\t\t\tif rv.IsNil() {\n\t\t\t\trv.Set(reflect.New(rv.Type().Elem()))\n\t\t\t}\n\t\t\trvp = rv\n\t\t\trv = rv.Elem()\n\t\t\tif rv.Kind() != reflect.Ptr {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tif fn == nil {\n\t\t// always pass checkCodecSelfer=true, in case T or ****T is passed, where *T is a Selfer\n\t\tfn = d.h.fn(rv.Type(), chkAll, true) // chkAll, chkAll)\n\t}\n\tif fn.i.addrD {\n\t\tif rvpValid {\n\t\t\tfn.fd(d, &fn.i, rvp)\n\t\t} else if rv.CanAddr() {\n\t\t\tfn.fd(d, &fn.i, rv.Addr())\n\t\t} else if !fn.i.addrF {\n\t\t\tfn.fd(d, &fn.i, rv)\n\t\t} else {\n\t\t\td.errorf(\"cannot decode into a non-pointer value\")\n\t\t}\n\t} else {\n\t\tfn.fd(d, &fn.i, rv)\n\t}\n\t// return rv\n}\n\nfunc (d *Decoder) structFieldNotFound(index int, rvkencname string) {\n\t// NOTE: rvkencname may be a stringView, so don't pass it to another function.\n\tif d.h.ErrorIfNoField {\n\t\tif index >= 0 {\n\t\t\td.errorf(\"no matching struct field found when decoding stream array at index %v\", index)\n\t\t\treturn\n\t\t} else if rvkencname != \"\" {\n\t\t\td.errorf(\"no matching struct field found when decoding stream map with key \" + rvkencname)\n\t\t\treturn\n\t\t}\n\t}\n\td.swallow()\n}\n\nfunc (d *Decoder) arrayCannotExpand(sliceLen, streamLen int) {\n\tif d.h.ErrorIfNoArrayExpand {\n\t\td.errorf(\"cannot expand array len during decode from %v to %v\", sliceLen, streamLen)\n\t}\n}\n\nfunc isDecodeable(rv reflect.Value) (rv2 reflect.Value, canDecode bool) {\n\tswitch rv.Kind() {\n\tcase reflect.Array:\n\t\treturn rv, rv.CanAddr()\n\tcase reflect.Ptr:\n\t\tif !rv.IsNil() {\n\t\t\treturn rv.Elem(), true\n\t\t}\n\tcase reflect.Slice, reflect.Chan, reflect.Map:\n\t\tif !rv.IsNil() {\n\t\t\treturn rv, true\n\t\t}\n\t}\n\treturn\n}\n\nfunc (d *Decoder) ensureDecodeable(rv reflect.Value) (rv2 reflect.Value) {\n\t// decode can take any reflect.Value that is a inherently addressable i.e.\n\t// - array\n\t// - non-nil chan (we will SEND to it)\n\t// - non-nil slice (we will set its elements)\n\t// - non-nil map (we will put into it)\n\t// - non-nil pointer (we can \"update\" it)\n\trv2, canDecode := isDecodeable(rv)\n\tif canDecode {\n\t\treturn\n\t}\n\tif !rv.IsValid() {\n\t\td.errorstr(errstrCannotDecodeIntoNil)\n\t\treturn\n\t}\n\tif !rv.CanInterface() {\n\t\td.errorf(\"cannot decode into a value without an interface: %v\", rv)\n\t\treturn\n\t}\n\trvi := rv2i(rv)\n\trvk := rv.Kind()\n\td.errorf(\"cannot decode into value of kind: %v, type: %T, %v\", rvk, rvi, rvi)\n\treturn\n}\n\nfunc (d *Decoder) depthIncr() {\n\td.depth++\n\tif d.depth >= d.maxdepth {\n\t\tpanic(errMaxDepthExceeded)\n\t}\n}\n\nfunc (d *Decoder) depthDecr() {\n\td.depth--\n}\n\n// Possibly get an interned version of a string\n//\n// This should mostly be used for map keys, where the key type is string.\n// This is because keys of a map/struct are typically reused across many objects.\nfunc (d *Decoder) string(v []byte) (s string) {\n\tif d.is == nil {\n\t\treturn string(v) // don't return stringView, as we need a real string here.\n\t}\n\ts, ok := d.is[string(v)] // no allocation here, per go implementation\n\tif !ok {\n\t\ts = string(v) // new allocation here\n\t\td.is[s] = s\n\t}\n\treturn s\n}\n\n// nextValueBytes returns the next value in the stream as a set of bytes.\nfunc (d *Decoder) nextValueBytes() (bs []byte) {\n\td.d.uncacheRead()\n\td.r().track()\n\td.swallow()\n\tbs = d.r().stopTrack()\n\treturn\n}\n\nfunc (d *Decoder) rawBytes() []byte {\n\t// ensure that this is not a view into the bytes\n\t// i.e. make new copy always.\n\tbs := d.nextValueBytes()\n\tbs2 := make([]byte, len(bs))\n\tcopy(bs2, bs)\n\treturn bs2\n}\n\nfunc (d *Decoder) wrapErr(v interface{}, err *error) {\n\t*err = decodeError{codecError: codecError{name: d.hh.Name(), err: v}, pos: int(d.r().numread())}\n}\n\n// NumBytesRead returns the number of bytes read\nfunc (d *Decoder) NumBytesRead() int {\n\treturn int(d.r().numread())\n}\n\n// decodeFloat32 will delegate to an appropriate DecodeFloat32 implementation (if exists),\n// else if will call DecodeFloat64 and ensure the value doesn't overflow.\n//\n// Note that we return float64 to reduce unnecessary conversions\nfunc (d *Decoder) decodeFloat32() float64 {\n\tif d.js {\n\t\treturn d.jdec.DecodeFloat32() // custom implementation for 32-bit\n\t}\n\treturn chkOvf.Float32V(d.d.DecodeFloat64())\n}\n\n// ---- container tracking\n// Note: We update the .c after calling the callback.\n// This way, the callback can know what the last status was.\n\nfunc (d *Decoder) mapStart() (v int) {\n\tv = d.d.ReadMapStart()\n\td.depthIncr()\n\td.c = containerMapStart\n\treturn\n}\n\nfunc (d *Decoder) mapElemKey() {\n\tif d.js {\n\t\td.jdec.ReadMapElemKey()\n\t}\n\td.c = containerMapKey\n}\n\nfunc (d *Decoder) mapElemValue() {\n\tif d.js {\n\t\td.jdec.ReadMapElemValue()\n\t}\n\td.c = containerMapValue\n}\n\nfunc (d *Decoder) mapEnd() {\n\td.d.ReadMapEnd()\n\td.depthDecr()\n\td.c = containerMapEnd\n\td.c = 0\n}\n\nfunc (d *Decoder) arrayStart() (v int) {\n\tv = d.d.ReadArrayStart()\n\td.depthIncr()\n\td.c = containerArrayStart\n\treturn\n}\n\nfunc (d *Decoder) arrayElem() {\n\tif d.js {\n\t\td.jdec.ReadArrayElem()\n\t}\n\td.c = containerArrayElem\n}\n\nfunc (d *Decoder) arrayEnd() {\n\td.d.ReadArrayEnd()\n\td.depthDecr()\n\td.c = containerArrayEnd\n\td.c = 0\n}\n\n// --------------------------------------------------\n\n// decSliceHelper assists when decoding into a slice, from a map or an array in the stream.\n// A slice can be set from a map or array in stream. This supports the MapBySlice interface.\ntype decSliceHelper struct {\n\td *Decoder\n\tct valueType\n\tarray bool\n}\n\nfunc (d *Decoder) decSliceHelperStart() (x decSliceHelper, clen int) {\n\tx.ct = d.d.ContainerType()\n\tx.d = d\n\tswitch x.ct {\n\tcase valueTypeArray:\n\t\tx.array = true\n\t\tclen = d.arrayStart()\n\tcase valueTypeMap:\n\t\tclen = d.mapStart() * 2\n\tdefault:\n\t\td.errorf(\"only encoded map or array can be decoded into a slice (%d)\", x.ct)\n\t}\n\treturn\n}\n\nfunc (x decSliceHelper) End() {\n\tif x.array {\n\t\tx.d.arrayEnd()\n\t} else {\n\t\tx.d.mapEnd()\n\t}\n}\n\nfunc (x decSliceHelper) ElemContainerState(index int) {\n\tif x.array {\n\t\tx.d.arrayElem()\n\t} else if index%2 == 0 {\n\t\tx.d.mapElemKey()\n\t} else {\n\t\tx.d.mapElemValue()\n\t}\n}\n\nfunc decByteSlice(r *decReaderSwitch, clen, maxInitLen int, bs []byte) (bsOut []byte) {\n\tif clen == 0 {\n\t\treturn zeroByteSlice\n\t}\n\tif len(bs) == clen {\n\t\tbsOut = bs\n\t\tr.readb(bsOut)\n\t} else if cap(bs) >= clen {\n\t\tbsOut = bs[:clen]\n\t\tr.readb(bsOut)\n\t} else {\n\t\t// bsOut = make([]byte, clen)\n\t\tlen2 := decInferLen(clen, maxInitLen, 1)\n\t\tbsOut = make([]byte, len2)\n\t\tr.readb(bsOut)\n\t\tfor len2 < clen {\n\t\t\tlen3 := decInferLen(clen-len2, maxInitLen, 1)\n\t\t\tbs3 := bsOut\n\t\t\tbsOut = make([]byte, len2+len3)\n\t\t\tcopy(bsOut, bs3)\n\t\t\tr.readb(bsOut[len2:])\n\t\t\tlen2 += len3\n\t\t}\n\t}\n\treturn\n}\n\n// func decByteSliceZeroCopy(r decReader, clen, maxInitLen int, bs []byte) (bsOut []byte) {\n// \tif _, ok := r.(*bytesDecReader); ok && clen <= maxInitLen {\n// \t\treturn r.readx(clen)\n// \t}\n// \treturn decByteSlice(r, clen, maxInitLen, bs)\n// }\n\nfunc detachZeroCopyBytes(isBytesReader bool, dest []byte, in []byte) (out []byte) {\n\tif xlen := len(in); xlen > 0 {\n\t\tif isBytesReader || xlen <= scratchByteArrayLen {\n\t\t\tif cap(dest) >= xlen {\n\t\t\t\tout = dest[:xlen]\n\t\t\t} else {\n\t\t\t\tout = make([]byte, xlen)\n\t\t\t}\n\t\t\tcopy(out, in)\n\t\t\treturn\n\t\t}\n\t}\n\treturn in\n}\n\n// decInferLen will infer a sensible length, given the following:\n// - clen: length wanted.\n// - maxlen: max length to be returned.\n// if <= 0, it is unset, and we infer it based on the unit size\n// - unit: number of bytes for each element of the collection\nfunc decInferLen(clen, maxlen, unit int) (rvlen int) {\n\t// handle when maxlen is not set i.e. <= 0\n\tif clen <= 0 {\n\t\treturn\n\t}\n\tif unit == 0 {\n\t\treturn clen\n\t}\n\tif maxlen <= 0 {\n\t\t// no maxlen defined. Use maximum of 256K memory, with a floor of 4K items.\n\t\t// maxlen = 256 * 1024 / unit\n\t\t// if maxlen < (4 * 1024) {\n\t\t// \tmaxlen = 4 * 1024\n\t\t// }\n\t\tif unit < (256 / 4) {\n\t\t\tmaxlen = 256 * 1024 / unit\n\t\t} else {\n\t\t\tmaxlen = 4 * 1024\n\t\t}\n\t}\n\tif clen > maxlen {\n\t\trvlen = maxlen\n\t} else {\n\t\trvlen = clen\n\t}\n\treturn\n}\n\nfunc expandSliceRV(s reflect.Value, st reflect.Type, canChange bool, stElemSize, num, slen, scap int) (\n\ts2 reflect.Value, scap2 int, changed bool, err string) {\n\tl1 := slen + num // new slice length\n\tif l1 < slen {\n\t\terr = errmsgExpandSliceOverflow\n\t\treturn\n\t}\n\tif l1 <= scap {\n\t\tif s.CanSet() {\n\t\t\ts.SetLen(l1)\n\t\t} else if canChange {\n\t\t\ts2 = s.Slice(0, l1)\n\t\t\tscap2 = scap\n\t\t\tchanged = true\n\t\t} else {\n\t\t\terr = errmsgExpandSliceCannotChange\n\t\t\treturn\n\t\t}\n\t\treturn\n\t}\n\tif !canChange {\n\t\terr = errmsgExpandSliceCannotChange\n\t\treturn\n\t}\n\tscap2 = growCap(scap, stElemSize, num)\n\ts2 = reflect.MakeSlice(st, l1, scap2)\n\tchanged = true\n\treflect.Copy(s2, s)\n\treturn\n}\n\nfunc decReadFull(r io.Reader, bs []byte) (n uint, err error) {\n\tvar nn int\n\tfor n < uint(len(bs)) && err == nil {\n\t\tnn, err = r.Read(bs[n:])\n\t\tif nn > 0 {\n\t\t\tif err == io.EOF {\n\t\t\t\t// leave EOF for next time\n\t\t\t\terr = nil\n\t\t\t}\n\t\t\tn += uint(nn)\n\t\t}\n\t}\n\t// xdebugf(\"decReadFull: len(bs): %v, n: %v, err: %v\", len(bs), n, err)\n\t// do not do this - it serves no purpose\n\t// if n != len(bs) && err == io.EOF { err = io.ErrUnexpectedEOF }\n\treturn\n}\n\nfunc decNakedReadRawBytes(dr decDriver, d *Decoder, n *decNaked, rawToString bool) {\n\tif rawToString {\n\t\tn.v = valueTypeString\n\t\tn.s = string(dr.DecodeBytes(d.b[:], true))\n\t} else {\n\t\tn.v = valueTypeBytes\n\t\tn.l = dr.DecodeBytes(nil, false)\n\t}\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/doc.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n/*\nPackage codec provides a\nHigh Performance, Feature-Rich Idiomatic Go 1.4+ codec/encoding library\nfor binc, msgpack, cbor, json.\n\nSupported Serialization formats are:\n\n - msgpack: https://github.com/msgpack/msgpack\n - binc: http://github.com/ugorji/binc\n - cbor: http://cbor.io http://tools.ietf.org/html/rfc7049\n - json: http://json.org http://tools.ietf.org/html/rfc7159\n - simple:\n\nThis package will carefully use 'package unsafe' for performance reasons in specific places.\nYou can build without unsafe use by passing the safe or appengine tag\ni.e. 'go install -tags=safe ...'. Note that unsafe is only supported for the last 4\ngo releases e.g. current go release is go 1.12, so we support unsafe use only from\ngo 1.9+ . This is because supporting unsafe requires knowledge of implementation details.\n\nFor detailed usage information, read the primer at http://ugorji.net/blog/go-codec-primer .\n\nThe idiomatic Go support is as seen in other encoding packages in\nthe standard library (ie json, xml, gob, etc).\n\nRich Feature Set includes:\n\n - Simple but extremely powerful and feature-rich API\n - Support for go1.4 and above, while selectively using newer APIs for later releases\n - Excellent code coverage ( > 90% )\n - Very High Performance.\n Our extensive benchmarks show us outperforming Gob, Json, Bson, etc by 2-4X.\n - Careful selected use of 'unsafe' for targeted performance gains.\n 100% mode exists where 'unsafe' is not used at all.\n - Lock-free (sans mutex) concurrency for scaling to 100's of cores\n - In-place updates during decode, with option to zero value in maps and slices prior to decode\n - Coerce types where appropriate\n e.g. decode an int in the stream into a float, decode numbers from formatted strings, etc\n - Corner Cases:\n Overflows, nil maps/slices, nil values in streams are handled correctly\n - Standard field renaming via tags\n - Support for omitting empty fields during an encoding\n - Encoding from any value and decoding into pointer to any value\n (struct, slice, map, primitives, pointers, interface{}, etc)\n - Extensions to support efficient encoding/decoding of any named types\n - Support encoding.(Binary|Text)(M|Unm)arshaler interfaces\n - Support IsZero() bool to determine if a value is a zero value.\n Analogous to time.Time.IsZero() bool.\n - Decoding without a schema (into a interface{}).\n Includes Options to configure what specific map or slice type to use\n when decoding an encoded list or map into a nil interface{}\n - Mapping a non-interface type to an interface, so we can decode appropriately\n into any interface type with a correctly configured non-interface value.\n - Encode a struct as an array, and decode struct from an array in the data stream\n - Option to encode struct keys as numbers (instead of strings)\n (to support structured streams with fields encoded as numeric codes)\n - Comprehensive support for anonymous fields\n - Fast (no-reflection) encoding/decoding of common maps and slices\n - Code-generation for faster performance.\n - Support binary (e.g. messagepack, cbor) and text (e.g. json) formats\n - Support indefinite-length formats to enable true streaming\n (for formats which support it e.g. json, cbor)\n - Support canonical encoding, where a value is ALWAYS encoded as same sequence of bytes.\n This mostly applies to maps, where iteration order is non-deterministic.\n - NIL in data stream decoded as zero value\n - Never silently skip data when decoding.\n User decides whether to return an error or silently skip data when keys or indexes\n in the data stream do not map to fields in the struct.\n - Detect and error when encoding a cyclic reference (instead of stack overflow shutdown)\n - Encode/Decode from/to chan types (for iterative streaming support)\n - Drop-in replacement for encoding/json. `json:` key in struct tag supported.\n - Provides a RPC Server and Client Codec for net/rpc communication protocol.\n - Handle unique idiosyncrasies of codecs e.g.\n - For messagepack, configure how ambiguities in handling raw bytes are resolved\n - For messagepack, provide rpc server/client codec to support\n msgpack-rpc protocol defined at:\n https://github.com/msgpack-rpc/msgpack-rpc/blob/master/spec.md\n\nExtension Support\n\nUsers can register a function to handle the encoding or decoding of\ntheir custom types.\n\nThere are no restrictions on what the custom type can be. Some examples:\n\n type BisSet []int\n type BitSet64 uint64\n type UUID string\n type MyStructWithUnexportedFields struct { a int; b bool; c []int; }\n type GifImage struct { ... }\n\nAs an illustration, MyStructWithUnexportedFields would normally be\nencoded as an empty map because it has no exported fields, while UUID\nwould be encoded as a string. However, with extension support, you can\nencode any of these however you like.\n\nCustom Encoding and Decoding\n\nThis package maintains symmetry in the encoding and decoding halfs.\nWe determine how to encode or decode by walking this decision tree\n\n - is type a codec.Selfer?\n - is there an extension registered for the type?\n - is format binary, and is type a encoding.BinaryMarshaler and BinaryUnmarshaler?\n - is format specifically json, and is type a encoding/json.Marshaler and Unmarshaler?\n - is format text-based, and type an encoding.TextMarshaler and TextUnmarshaler?\n - else we use a pair of functions based on the \"kind\" of the type e.g. map, slice, int64, etc\n\nThis symmetry is important to reduce chances of issues happening because the\nencoding and decoding sides are out of sync e.g. decoded via very specific\nencoding.TextUnmarshaler but encoded via kind-specific generalized mode.\n\nConsequently, if a type only defines one-half of the symmetry\n(e.g. it implements UnmarshalJSON() but not MarshalJSON() ),\nthen that type doesn't satisfy the check and we will continue walking down the\ndecision tree.\n\nRPC\n\nRPC Client and Server Codecs are implemented, so the codecs can be used\nwith the standard net/rpc package.\n\nUsage\n\nThe Handle is SAFE for concurrent READ, but NOT SAFE for concurrent modification.\n\nThe Encoder and Decoder are NOT safe for concurrent use.\n\nConsequently, the usage model is basically:\n\n - Create and initialize the Handle before any use.\n Once created, DO NOT modify it.\n - Multiple Encoders or Decoders can now use the Handle concurrently.\n They only read information off the Handle (never write).\n - However, each Encoder or Decoder MUST not be used concurrently\n - To re-use an Encoder/Decoder, call Reset(...) on it first.\n This allows you use state maintained on the Encoder/Decoder.\n\nSample usage model:\n\n // create and configure Handle\n var (\n bh codec.BincHandle\n mh codec.MsgpackHandle\n ch codec.CborHandle\n )\n\n mh.MapType = reflect.TypeOf(map[string]interface{}(nil))\n\n // configure extensions\n // e.g. for msgpack, define functions and enable Time support for tag 1\n // mh.SetExt(reflect.TypeOf(time.Time{}), 1, myExt)\n\n // create and use decoder/encoder\n var (\n r io.Reader\n w io.Writer\n b []byte\n h = &bh // or mh to use msgpack\n )\n\n dec = codec.NewDecoder(r, h)\n dec = codec.NewDecoderBytes(b, h)\n err = dec.Decode(&v)\n\n enc = codec.NewEncoder(w, h)\n enc = codec.NewEncoderBytes(&b, h)\n err = enc.Encode(v)\n\n //RPC Server\n go func() {\n for {\n conn, err := listener.Accept()\n rpcCodec := codec.GoRpc.ServerCodec(conn, h)\n //OR rpcCodec := codec.MsgpackSpecRpc.ServerCodec(conn, h)\n rpc.ServeCodec(rpcCodec)\n }\n }()\n\n //RPC Communication (client side)\n conn, err = net.Dial(\"tcp\", \"localhost:5555\")\n rpcCodec := codec.GoRpc.ClientCodec(conn, h)\n //OR rpcCodec := codec.MsgpackSpecRpc.ClientCodec(conn, h)\n client := rpc.NewClientWithCodec(rpcCodec)\n\nRunning Tests\n\nTo run tests, use the following:\n\n go test\n\nTo run the full suite of tests, use the following:\n\n go test -tags alltests -run Suite\n\nYou can run the tag 'safe' to run tests or build in safe mode. e.g.\n\n go test -tags safe -run Json\n go test -tags \"alltests safe\" -run Suite\n\nRunning Benchmarks\n\n cd bench\n go test -bench . -benchmem -benchtime 1s\n \nPlease see http://github.com/ugorji/go-codec-bench .\n\nManaging Binary Size\n\nThis package adds some size to any binary that depends on it.\nThis is because we include an auto-generated file: `fast-path.generated.go`\nto help with performance when encoding/decoding slices and maps of\nbuilt in numeric, boolean, string and interface{} types.\n\nPrior to 2019-05-16, this package could add about 11MB to the size of your binaries.\nWe have now trimmed that in half, and the package contributes about 5.5MB.\n\nYou can override this by building (or running tests and benchmarks)\nwith the tag: `notfastpath`.\n\n go install -tags notfastpath\n go build -tags notfastpath\n go test -tags notfastpath\n\nWith the tag `notfastpath`, we trim that size to about 2.9MB.\n\nBe aware that, at least in our representative microbenchmarks for cbor (for example),\npassing `notfastpath` tag causes up to 33% increase in decoding and\n50% increase in encoding speeds.\nYMMV.\n\nCaveats\n\nStruct fields matching the following are ignored during encoding and decoding\n - struct tag value set to -\n - func, complex numbers, unsafe pointers\n - unexported and not embedded\n - unexported and embedded and not struct kind\n - unexported and embedded pointers (from go1.10)\n\nEvery other field in a struct will be encoded/decoded.\n\nEmbedded fields are encoded as if they exist in the top-level struct,\nwith some caveats. See Encode documentation.\n\n*/\npackage codec\n\n" }, { "path": "vendor/github.com/ugorji/go/codec/encode.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"encoding\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"runtime\"\n\t\"sort\"\n\t\"strconv\"\n\t\"time\"\n)\n\n// defEncByteBufSize is the default size of []byte used\n// for bufio buffer or []byte (when nil passed)\nconst defEncByteBufSize = 1 << 10 // 4:16, 6:64, 8:256, 10:1024\n\nvar errEncoderNotInitialized = errors.New(\"Encoder not initialized\")\n\n/*\n\n// encWriter abstracts writing to a byte array or to an io.Writer.\n//\n//\n// Deprecated: Use encWriterSwitch instead.\ntype encWriter interface {\n\twriteb([]byte)\n\twritestr(string)\n\twriteqstr(string) // write string wrapped in quotes ie \"...\"\n\twriten1(byte)\n\twriten2(byte, byte)\n\tend()\n}\n\n*/\n\n// encDriver abstracts the actual codec (binc vs msgpack, etc)\ntype encDriver interface {\n\tEncodeNil()\n\tEncodeInt(i int64)\n\tEncodeUint(i uint64)\n\tEncodeBool(b bool)\n\tEncodeFloat32(f float32)\n\tEncodeFloat64(f float64)\n\t// encodeExtPreamble(xtag byte, length int)\n\tEncodeRawExt(re *RawExt, e *Encoder)\n\tEncodeExt(v interface{}, xtag uint64, ext Ext, e *Encoder)\n\tEncodeStringEnc(c charEncoding, v string) // c cannot be cRAW\n\t// EncodeSymbol(v string)\n\tEncodeStringBytesRaw(v []byte)\n\tEncodeTime(time.Time)\n\t//encBignum(f *big.Int)\n\t//encStringRunes(c charEncoding, v []rune)\n\tWriteArrayStart(length int)\n\tWriteArrayEnd()\n\tWriteMapStart(length int)\n\tWriteMapEnd()\n\n\treset()\n\tatEndOfEncode()\n}\n\ntype encDriverContainerTracker interface {\n\tWriteArrayElem()\n\tWriteMapElemKey()\n\tWriteMapElemValue()\n}\n\ntype encDriverAsis interface {\n\tEncodeAsis(v []byte)\n}\n\ntype encodeError struct {\n\tcodecError\n}\n\nfunc (e encodeError) Error() string {\n\treturn fmt.Sprintf(\"%s encode error: %v\", e.name, e.err)\n}\n\ntype encDriverNoopContainerWriter struct{}\n\nfunc (encDriverNoopContainerWriter) WriteArrayStart(length int) {}\nfunc (encDriverNoopContainerWriter) WriteArrayEnd() {}\nfunc (encDriverNoopContainerWriter) WriteMapStart(length int) {}\nfunc (encDriverNoopContainerWriter) WriteMapEnd() {}\nfunc (encDriverNoopContainerWriter) atEndOfEncode() {}\n\n// func (encDriverNoopContainerWriter) WriteArrayElem() {}\n// func (encDriverNoopContainerWriter) WriteMapElemKey() {}\n// func (encDriverNoopContainerWriter) WriteMapElemValue() {}\n\n// type encDriverTrackContainerWriter struct {\n// \tc containerState\n// }\n\n// func (e *encDriverTrackContainerWriter) WriteArrayStart(length int) { e.c = containerArrayStart }\n// func (e *encDriverTrackContainerWriter) WriteArrayElem() { e.c = containerArrayElem }\n// func (e *encDriverTrackContainerWriter) WriteArrayEnd() { e.c = containerArrayEnd }\n// func (e *encDriverTrackContainerWriter) WriteMapStart(length int) { e.c = containerMapStart }\n// func (e *encDriverTrackContainerWriter) WriteMapElemKey() { e.c = containerMapKey }\n// func (e *encDriverTrackContainerWriter) WriteMapElemValue() { e.c = containerMapValue }\n// func (e *encDriverTrackContainerWriter) WriteMapEnd() { e.c = containerMapEnd }\n// func (e *encDriverTrackContainerWriter) atEndOfEncode() {}\n\n// type ioEncWriterWriter interface {\n// \tWriteByte(c byte) error\n// \tWriteString(s string) (n int, err error)\n// \tWrite(p []byte) (n int, err error)\n// }\n\n// EncodeOptions captures configuration options during encode.\ntype EncodeOptions struct {\n\t// WriterBufferSize is the size of the buffer used when writing.\n\t//\n\t// if > 0, we use a smart buffer internally for performance purposes.\n\tWriterBufferSize int\n\n\t// ChanRecvTimeout is the timeout used when selecting from a chan.\n\t//\n\t// Configuring this controls how we receive from a chan during the encoding process.\n\t// - If ==0, we only consume the elements currently available in the chan.\n\t// - if <0, we consume until the chan is closed.\n\t// - If >0, we consume until this timeout.\n\tChanRecvTimeout time.Duration\n\n\t// StructToArray specifies to encode a struct as an array, and not as a map\n\tStructToArray bool\n\n\t// Canonical representation means that encoding a value will always result in the same\n\t// sequence of bytes.\n\t//\n\t// This only affects maps, as the iteration order for maps is random.\n\t//\n\t// The implementation MAY use the natural sort order for the map keys if possible:\n\t//\n\t// - If there is a natural sort order (ie for number, bool, string or []byte keys),\n\t// then the map keys are first sorted in natural order and then written\n\t// with corresponding map values to the strema.\n\t// - If there is no natural sort order, then the map keys will first be\n\t// encoded into []byte, and then sorted,\n\t// before writing the sorted keys and the corresponding map values to the stream.\n\t//\n\tCanonical bool\n\n\t// CheckCircularRef controls whether we check for circular references\n\t// and error fast during an encode.\n\t//\n\t// If enabled, an error is received if a pointer to a struct\n\t// references itself either directly or through one of its fields (iteratively).\n\t//\n\t// This is opt-in, as there may be a performance hit to checking circular references.\n\tCheckCircularRef bool\n\n\t// RecursiveEmptyCheck controls whether we descend into interfaces, structs and pointers\n\t// when checking if a value is empty.\n\t//\n\t// Note that this may make OmitEmpty more expensive, as it incurs a lot more reflect calls.\n\tRecursiveEmptyCheck bool\n\n\t// Raw controls whether we encode Raw values.\n\t// This is a \"dangerous\" option and must be explicitly set.\n\t// If set, we blindly encode Raw values as-is, without checking\n\t// if they are a correct representation of a value in that format.\n\t// If unset, we error out.\n\tRaw bool\n\n\t// StringToRaw controls how strings are encoded.\n\t//\n\t// As a go string is just an (immutable) sequence of bytes,\n\t// it can be encoded either as raw bytes or as a UTF string.\n\t//\n\t// By default, strings are encoded as UTF-8.\n\t// but can be treated as []byte during an encode.\n\t//\n\t// Note that things which we know (by definition) to be UTF-8\n\t// are ALWAYS encoded as UTF-8 strings.\n\t// These include encoding.TextMarshaler, time.Format calls, struct field names, etc.\n\tStringToRaw bool\n\n\t// // AsSymbols defines what should be encoded as symbols.\n\t// //\n\t// // Encoding as symbols can reduce the encoded size significantly.\n\t// //\n\t// // However, during decoding, each string to be encoded as a symbol must\n\t// // be checked to see if it has been seen before. Consequently, encoding time\n\t// // will increase if using symbols, because string comparisons has a clear cost.\n\t// //\n\t// // Sample values:\n\t// // AsSymbolNone\n\t// // AsSymbolAll\n\t// // AsSymbolMapStringKeys\n\t// // AsSymbolMapStringKeysFlag | AsSymbolStructFieldNameFlag\n\t// AsSymbols AsSymbolFlag\n}\n\n// ---------------------------------------------\n\n/*\n\ntype ioEncStringWriter interface {\n\tWriteString(s string) (n int, err error)\n}\n\n// ioEncWriter implements encWriter and can write to an io.Writer implementation\ntype ioEncWriter struct {\n\tw io.Writer\n\tww io.Writer\n\tbw io.ByteWriter\n\tsw ioEncStringWriter\n\tfw ioFlusher\n\tb [8]byte\n}\n\nfunc (z *ioEncWriter) reset(w io.Writer) {\n\tz.w = w\n\tvar ok bool\n\tif z.bw, ok = w.(io.ByteWriter); !ok {\n\t\tz.bw = z\n\t}\n\tif z.sw, ok = w.(ioEncStringWriter); !ok {\n\t\tz.sw = z\n\t}\n\tz.fw, _ = w.(ioFlusher)\n\tz.ww = w\n}\n\nfunc (z *ioEncWriter) WriteByte(b byte) (err error) {\n\tz.b[0] = b\n\t_, err = z.w.Write(z.b[:1])\n\treturn\n}\n\nfunc (z *ioEncWriter) WriteString(s string) (n int, err error) {\n\treturn z.w.Write(bytesView(s))\n}\n\nfunc (z *ioEncWriter) writeb(bs []byte) {\n\tif _, err := z.ww.Write(bs); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (z *ioEncWriter) writestr(s string) {\n\tif _, err := z.sw.WriteString(s); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (z *ioEncWriter) writeqstr(s string) {\n\twritestr(\"\\\"\" + s + \"\\\"\")\n}\n\nfunc (z *ioEncWriter) writen1(b byte) {\n\tif err := z.bw.WriteByte(b); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (z *ioEncWriter) writen2(b1, b2 byte) {\n\tvar err error\n\tif err = z.bw.WriteByte(b1); err == nil {\n\t\tif err = z.bw.WriteByte(b2); err == nil {\n\t\t\treturn\n\t\t}\n\t}\n\tpanic(err)\n}\n\n// func (z *ioEncWriter) writen5(b1, b2, b3, b4, b5 byte) {\n// \tz.b[0], z.b[1], z.b[2], z.b[3], z.b[4] = b1, b2, b3, b4, b5\n// \tif _, err := z.ww.Write(z.b[:5]); err != nil {\n// \t\tpanic(err)\n// \t}\n// }\n\n//go:noinline - so *encWriterSwitch.XXX has the bytesEncAppender.XXX inlined\nfunc (z *ioEncWriter) end() {\n\tif z.fw != nil {\n\t\tif err := z.fw.Flush(); err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t}\n}\n\n*/\n\n// ---------------------------------------------\n\n// bufioEncWriter\ntype bufioEncWriter struct {\n\tw io.Writer\n\n\tbuf []byte\n\n\tn int\n\n\t// Extensions can call Encode() within a current Encode() call.\n\t// We need to know when the top level Encode() call returns,\n\t// so we can decide whether to Release() or not.\n\tcalls uint16 // what depth in mustDecode are we in now.\n\n\tsz int // buf size\n\t// _ uint64 // padding (cache-aligned)\n\n\t// ---- cache line\n\n\t// write-most fields below\n\n\t// less used fields\n\tbytesBufPooler\n\n\tb [40]byte // scratch buffer and padding (cache-aligned)\n\t// a int\n\t// b [4]byte\n\t// err\n}\n\nfunc (z *bufioEncWriter) reset(w io.Writer, bufsize int) {\n\tz.w = w\n\tz.n = 0\n\tz.calls = 0\n\tif bufsize <= 0 {\n\t\tbufsize = defEncByteBufSize\n\t}\n\tz.sz = bufsize\n\tif cap(z.buf) >= bufsize {\n\t\tz.buf = z.buf[:cap(z.buf)]\n\t} else if bufsize <= len(z.b) {\n\t\tz.buf = z.b[:]\n\t} else {\n\t\tz.buf = z.bytesBufPooler.get(bufsize)\n\t\t// z.buf = make([]byte, bufsize)\n\t}\n}\n\nfunc (z *bufioEncWriter) release() {\n\tz.buf = nil\n\tz.bytesBufPooler.end()\n}\n\n//go:noinline - flush only called intermittently\nfunc (z *bufioEncWriter) flushErr() (err error) {\n\tn, err := z.w.Write(z.buf[:z.n])\n\tz.n -= n\n\tif z.n > 0 && err == nil {\n\t\terr = io.ErrShortWrite\n\t}\n\tif n > 0 && z.n > 0 {\n\t\tcopy(z.buf, z.buf[n:z.n+n])\n\t}\n\treturn err\n}\n\nfunc (z *bufioEncWriter) flush() {\n\tif err := z.flushErr(); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (z *bufioEncWriter) writeb(s []byte) {\nLOOP:\n\ta := len(z.buf) - z.n\n\tif len(s) > a {\n\t\tz.n += copy(z.buf[z.n:], s[:a])\n\t\ts = s[a:]\n\t\tz.flush()\n\t\tgoto LOOP\n\t}\n\tz.n += copy(z.buf[z.n:], s)\n}\n\nfunc (z *bufioEncWriter) writestr(s string) {\n\t// z.writeb(bytesView(s)) // inlined below\nLOOP:\n\ta := len(z.buf) - z.n\n\tif len(s) > a {\n\t\tz.n += copy(z.buf[z.n:], s[:a])\n\t\ts = s[a:]\n\t\tz.flush()\n\t\tgoto LOOP\n\t}\n\tz.n += copy(z.buf[z.n:], s)\n}\n\nfunc (z *bufioEncWriter) writeqstr(s string) {\n\t// z.writen1('\"')\n\t// z.writestr(s)\n\t// z.writen1('\"')\n\n\tif z.n+len(s)+2 > len(z.buf) {\n\t\tz.flush()\n\t}\n\tz.buf[z.n] = '\"'\n\tz.n++\nLOOP:\n\ta := len(z.buf) - z.n\n\tif len(s)+1 > a {\n\t\tz.n += copy(z.buf[z.n:], s[:a])\n\t\ts = s[a:]\n\t\tz.flush()\n\t\tgoto LOOP\n\t}\n\tz.n += copy(z.buf[z.n:], s)\n\tz.buf[z.n] = '\"'\n\tz.n++\n}\n\nfunc (z *bufioEncWriter) writen1(b1 byte) {\n\tif 1 > len(z.buf)-z.n {\n\t\tz.flush()\n\t}\n\tz.buf[z.n] = b1\n\tz.n++\n}\n\nfunc (z *bufioEncWriter) writen2(b1, b2 byte) {\n\tif 2 > len(z.buf)-z.n {\n\t\tz.flush()\n\t}\n\tz.buf[z.n+1] = b2\n\tz.buf[z.n] = b1\n\tz.n += 2\n}\n\nfunc (z *bufioEncWriter) endErr() (err error) {\n\tif z.n > 0 {\n\t\terr = z.flushErr()\n\t}\n\treturn\n}\n\n// ---------------------------------------------\n\n// bytesEncAppender implements encWriter and can write to an byte slice.\ntype bytesEncAppender struct {\n\tb []byte\n\tout *[]byte\n}\n\nfunc (z *bytesEncAppender) writeb(s []byte) {\n\tz.b = append(z.b, s...)\n}\nfunc (z *bytesEncAppender) writestr(s string) {\n\tz.b = append(z.b, s...)\n}\nfunc (z *bytesEncAppender) writeqstr(s string) {\n\t// z.writen1('\"')\n\t// z.writestr(s)\n\t// z.writen1('\"')\n\tz.b = append(append(append(z.b, '\"'), s...), '\"')\n\t// z.b = append(z.b, '\"')\n\t// z.b = append(z.b, s...)\n\t// z.b = append(z.b, '\"')\n}\nfunc (z *bytesEncAppender) writen1(b1 byte) {\n\tz.b = append(z.b, b1)\n}\nfunc (z *bytesEncAppender) writen2(b1, b2 byte) {\n\tz.b = append(z.b, b1, b2)\n}\nfunc (z *bytesEncAppender) endErr() error {\n\t*(z.out) = z.b\n\treturn nil\n}\nfunc (z *bytesEncAppender) reset(in []byte, out *[]byte) {\n\tz.b = in[:0]\n\tz.out = out\n}\n\n// ---------------------------------------------\n\nfunc (e *Encoder) rawExt(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeRawExt(rv2i(rv).(*RawExt), e)\n}\n\nfunc (e *Encoder) ext(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeExt(rv2i(rv), f.xfTag, f.xfFn, e)\n}\n\nfunc (e *Encoder) selferMarshal(f *codecFnInfo, rv reflect.Value) {\n\trv2i(rv).(Selfer).CodecEncodeSelf(e)\n}\n\nfunc (e *Encoder) binaryMarshal(f *codecFnInfo, rv reflect.Value) {\n\tbs, fnerr := rv2i(rv).(encoding.BinaryMarshaler).MarshalBinary()\n\te.marshalRaw(bs, fnerr)\n}\n\nfunc (e *Encoder) textMarshal(f *codecFnInfo, rv reflect.Value) {\n\tbs, fnerr := rv2i(rv).(encoding.TextMarshaler).MarshalText()\n\te.marshalUtf8(bs, fnerr)\n}\n\nfunc (e *Encoder) jsonMarshal(f *codecFnInfo, rv reflect.Value) {\n\tbs, fnerr := rv2i(rv).(jsonMarshaler).MarshalJSON()\n\te.marshalAsis(bs, fnerr)\n}\n\nfunc (e *Encoder) raw(f *codecFnInfo, rv reflect.Value) {\n\te.rawBytes(rv2i(rv).(Raw))\n}\n\nfunc (e *Encoder) kInvalid(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeNil()\n}\n\nfunc (e *Encoder) kErr(f *codecFnInfo, rv reflect.Value) {\n\te.errorf(\"unsupported kind %s, for %#v\", rv.Kind(), rv)\n}\n\nfunc (e *Encoder) kSlice(f *codecFnInfo, rv reflect.Value) {\n\t// array may be non-addressable, so we have to manage with care\n\t// (don't call rv.Bytes, rv.Slice, etc).\n\t// E.g. type struct S{B [2]byte};\n\t// Encode(S{}) will bomb on \"panic: slice of unaddressable array\".\n\tif f.seq != seqTypeArray {\n\t\tif rv.IsNil() {\n\t\t\te.e.EncodeNil()\n\t\t\treturn\n\t\t}\n\t\t// If in this method, then there was no extension function defined.\n\t\t// So it's okay to treat as []byte.\n\t\tif f.ti.rtid == uint8SliceTypId {\n\t\t\te.e.EncodeStringBytesRaw(rv.Bytes())\n\t\t\treturn\n\t\t}\n\t}\n\tif f.seq == seqTypeChan && f.ti.chandir&uint8(reflect.RecvDir) == 0 {\n\t\te.errorf(\"send-only channel cannot be encoded\")\n\t}\n\tmbs := f.ti.mbs\n\trtelem := f.ti.elem\n\t// if a slice, array or chan of bytes, treat specially\n\tif !mbs && uint8TypId == rt2id(rtelem) { // NOT rtelem.Kind() == reflect.Uint8\n\t\te.kSliceBytes(rv, f.seq)\n\t\treturn\n\t}\n\n\t// if chan, consume chan into a slice, and work off that slice.\n\tif f.seq == seqTypeChan {\n\t\trvcs := reflect.Zero(reflect.SliceOf(rtelem))\n\t\ttimeout := e.h.ChanRecvTimeout\n\t\tif timeout < 0 { // consume until close\n\t\t\tfor {\n\t\t\t\trecv, recvOk := rv.Recv()\n\t\t\t\tif !recvOk {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\trvcs = reflect.Append(rvcs, recv)\n\t\t\t}\n\t\t} else {\n\t\t\tcases := make([]reflect.SelectCase, 2)\n\t\t\tcases[0] = reflect.SelectCase{Dir: reflect.SelectRecv, Chan: rv}\n\t\t\tif timeout == 0 {\n\t\t\t\tcases[1] = reflect.SelectCase{Dir: reflect.SelectDefault}\n\t\t\t} else {\n\t\t\t\ttt := time.NewTimer(timeout)\n\t\t\t\tcases[1] = reflect.SelectCase{Dir: reflect.SelectRecv, Chan: reflect.ValueOf(tt.C)}\n\t\t\t}\n\t\t\tfor {\n\t\t\t\tchosen, recv, recvOk := reflect.Select(cases)\n\t\t\t\tif chosen == 1 || !recvOk {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\trvcs = reflect.Append(rvcs, recv)\n\t\t\t}\n\t\t}\n\t\trv = rvcs // TODO: ensure this doesn't mess up anywhere that rv of kind chan is expected\n\t}\n\n\tvar l = rv.Len()\n\tif mbs {\n\t\tif l%2 == 1 {\n\t\t\te.errorf(\"mapBySlice requires even slice length, but got %v\", l)\n\t\t\treturn\n\t\t}\n\t\te.mapStart(l / 2)\n\t} else {\n\t\te.arrayStart(l)\n\t}\n\n\tif l > 0 {\n\t\tvar fn *codecFn\n\t\tfor rtelem.Kind() == reflect.Ptr {\n\t\t\trtelem = rtelem.Elem()\n\t\t}\n\t\t// if kind is reflect.Interface, do not pre-determine the\n\t\t// encoding type, because preEncodeValue may break it down to\n\t\t// a concrete type and kInterface will bomb.\n\t\tif rtelem.Kind() != reflect.Interface {\n\t\t\tfn = e.h.fn(rtelem, true, true)\n\t\t}\n\t\tfor j := 0; j < l; j++ {\n\t\t\tif mbs {\n\t\t\t\tif j%2 == 0 {\n\t\t\t\t\te.mapElemKey()\n\t\t\t\t} else {\n\t\t\t\t\te.mapElemValue()\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\te.arrayElem()\n\t\t\t}\n\t\t\te.encodeValue(rv.Index(j), fn, true)\n\t\t}\n\t}\n\n\tif mbs {\n\t\te.mapEnd()\n\t} else {\n\t\te.arrayEnd()\n\t}\n}\n\nfunc (e *Encoder) kSliceBytes(rv reflect.Value, seq seqType) {\n\t// xdebugf(\"kSliceBytes: seq: %d, rvType: %v\", seq, rv.Type())\n\tswitch seq {\n\tcase seqTypeSlice:\n\t\te.e.EncodeStringBytesRaw(rv.Bytes())\n\tcase seqTypeArray:\n\t\tvar l = rv.Len()\n\t\tif rv.CanAddr() {\n\t\t\te.e.EncodeStringBytesRaw(rv.Slice(0, l).Bytes())\n\t\t} else {\n\t\t\tvar bs []byte\n\t\t\tif l <= cap(e.b) {\n\t\t\t\tbs = e.b[:l]\n\t\t\t} else {\n\t\t\t\tbs = make([]byte, l)\n\t\t\t}\n\t\t\treflect.Copy(reflect.ValueOf(bs), rv)\n\t\t\te.e.EncodeStringBytesRaw(bs)\n\t\t}\n\tcase seqTypeChan:\n\t\t// do not use range, so that the number of elements encoded\n\t\t// does not change, and encoding does not hang waiting on someone to close chan.\n\t\t// for b := range rv2i(rv).(<-chan byte) { bs = append(bs, b) }\n\t\t// ch := rv2i(rv).(<-chan byte) // fix error - that this is a chan byte, not a <-chan byte.\n\n\t\tif rv.IsNil() {\n\t\t\te.e.EncodeNil()\n\t\t\tbreak\n\t\t}\n\t\tbs := e.b[:0]\n\t\tirv := rv2i(rv)\n\t\tch, ok := irv.(<-chan byte)\n\t\tif !ok {\n\t\t\tch = irv.(chan byte)\n\t\t}\n\n\tL1:\n\t\tswitch timeout := e.h.ChanRecvTimeout; {\n\t\tcase timeout == 0: // only consume available\n\t\t\tfor {\n\t\t\t\tselect {\n\t\t\t\tcase b := <-ch:\n\t\t\t\t\tbs = append(bs, b)\n\t\t\t\tdefault:\n\t\t\t\t\tbreak L1\n\t\t\t\t}\n\t\t\t}\n\t\tcase timeout > 0: // consume until timeout\n\t\t\ttt := time.NewTimer(timeout)\n\t\t\tfor {\n\t\t\t\tselect {\n\t\t\t\tcase b := <-ch:\n\t\t\t\t\tbs = append(bs, b)\n\t\t\t\tcase <-tt.C:\n\t\t\t\t\t// close(tt.C)\n\t\t\t\t\tbreak L1\n\t\t\t\t}\n\t\t\t}\n\t\tdefault: // consume until close\n\t\t\tfor b := range ch {\n\t\t\t\tbs = append(bs, b)\n\t\t\t}\n\t\t}\n\n\t\te.e.EncodeStringBytesRaw(bs)\n\t}\n}\n\nfunc (e *Encoder) kStructNoOmitempty(f *codecFnInfo, rv reflect.Value) {\n\tsfn := structFieldNode{v: rv, update: false}\n\tif f.ti.toArray || e.h.StructToArray { // toArray\n\t\te.arrayStart(len(f.ti.sfiSrc))\n\t\tfor _, si := range f.ti.sfiSrc {\n\t\t\te.arrayElem()\n\t\t\te.encodeValue(sfn.field(si), nil, true)\n\t\t}\n\t\te.arrayEnd()\n\t} else {\n\t\te.mapStart(len(f.ti.sfiSort))\n\t\tfor _, si := range f.ti.sfiSort {\n\t\t\te.mapElemKey()\n\t\t\te.kStructFieldKey(f.ti.keyType, si.encNameAsciiAlphaNum, si.encName)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(sfn.field(si), nil, true)\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) kStructFieldKey(keyType valueType, encNameAsciiAlphaNum bool, encName string) {\n\tencStructFieldKey(encName, e.e, e.w(), keyType, encNameAsciiAlphaNum, e.js)\n}\n\nfunc (e *Encoder) kStruct(f *codecFnInfo, rv reflect.Value) {\n\tvar newlen int\n\ttoMap := !(f.ti.toArray || e.h.StructToArray)\n\tvar mf map[string]interface{}\n\tif f.ti.mf {\n\t\tmf = rv2i(rv).(MissingFielder).CodecMissingFields()\n\t\ttoMap = true\n\t\tnewlen += len(mf)\n\t} else if f.ti.mfp {\n\t\tif rv.CanAddr() {\n\t\t\tmf = rv2i(rv.Addr()).(MissingFielder).CodecMissingFields()\n\t\t} else {\n\t\t\t// make a new addressable value of same one, and use it\n\t\t\trv2 := reflect.New(rv.Type())\n\t\t\trv2.Elem().Set(rv)\n\t\t\tmf = rv2i(rv2).(MissingFielder).CodecMissingFields()\n\t\t}\n\t\ttoMap = true\n\t\tnewlen += len(mf)\n\t}\n\tnewlen += len(f.ti.sfiSrc)\n\n\t// Use sync.Pool to reduce allocating slices unnecessarily.\n\t// The cost of sync.Pool is less than the cost of new allocation.\n\t//\n\t// Each element of the array pools one of encStructPool(8|16|32|64).\n\t// It allows the re-use of slices up to 64 in length.\n\t// A performance cost of encoding structs was collecting\n\t// which values were empty and should be omitted.\n\t// We needed slices of reflect.Value and string to collect them.\n\t// This shared pool reduces the amount of unnecessary creation we do.\n\t// The cost is that of locking sometimes, but sync.Pool is efficient\n\t// enough to reduce thread contention.\n\n\t// fmt.Printf(\">>>>>>>>>>>>>> encode.kStruct: newlen: %d\\n\", newlen)\n\tvar spool sfiRvPooler\n\tvar fkvs = spool.get(newlen)\n\n\trecur := e.h.RecursiveEmptyCheck\n\tsfn := structFieldNode{v: rv, update: false}\n\n\tvar kv sfiRv\n\tvar j int\n\tif toMap {\n\t\tnewlen = 0\n\t\tfor _, si := range f.ti.sfiSort { // use sorted array\n\t\t\t// kv.r = si.field(rv, false)\n\t\t\tkv.r = sfn.field(si)\n\t\t\tif si.omitEmpty() && isEmptyValue(kv.r, e.h.TypeInfos, recur, recur) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tkv.v = si // si.encName\n\t\t\tfkvs[newlen] = kv\n\t\t\tnewlen++\n\t\t}\n\t\tvar mflen int\n\t\tfor k, v := range mf {\n\t\t\tif k == \"\" {\n\t\t\t\tdelete(mf, k)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.ti.infoFieldOmitempty && isEmptyValue(reflect.ValueOf(v), e.h.TypeInfos, recur, recur) {\n\t\t\t\tdelete(mf, k)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tmflen++\n\t\t}\n\t\t// encode it all\n\t\te.mapStart(newlen + mflen)\n\t\tfor j = 0; j < newlen; j++ {\n\t\t\tkv = fkvs[j]\n\t\t\te.mapElemKey()\n\t\t\te.kStructFieldKey(f.ti.keyType, kv.v.encNameAsciiAlphaNum, kv.v.encName)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(kv.r, nil, true)\n\t\t}\n\t\t// now, add the others\n\t\tfor k, v := range mf {\n\t\t\te.mapElemKey()\n\t\t\te.kStructFieldKey(f.ti.keyType, false, k)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v)\n\t\t}\n\t\te.mapEnd()\n\t} else {\n\t\tnewlen = len(f.ti.sfiSrc)\n\t\t// kv.v = nil\n\t\tfor i, si := range f.ti.sfiSrc { // use unsorted array (to match sequence in struct)\n\t\t\t// kv.r = si.field(rv, false)\n\t\t\tkv.r = sfn.field(si)\n\t\t\t// use the zero value.\n\t\t\t// if a reference or struct, set to nil (so you do not output too much)\n\t\t\tif si.omitEmpty() && isEmptyValue(kv.r, e.h.TypeInfos, recur, recur) {\n\t\t\t\tswitch kv.r.Kind() {\n\t\t\t\tcase reflect.Struct, reflect.Interface, reflect.Ptr, reflect.Array, reflect.Map, reflect.Slice:\n\t\t\t\t\tkv.r = reflect.Value{} //encode as nil\n\t\t\t\t}\n\t\t\t}\n\t\t\tfkvs[i] = kv\n\t\t}\n\t\t// encode it all\n\t\te.arrayStart(newlen)\n\t\tfor j = 0; j < newlen; j++ {\n\t\t\te.arrayElem()\n\t\t\te.encodeValue(fkvs[j].r, nil, true)\n\t\t}\n\t\te.arrayEnd()\n\t}\n\n\t// do not use defer. Instead, use explicit pool return at end of function.\n\t// defer has a cost we are trying to avoid.\n\t// If there is a panic and these slices are not returned, it is ok.\n\tspool.end()\n}\n\nfunc (e *Encoder) kMap(f *codecFnInfo, rv reflect.Value) {\n\tif rv.IsNil() {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\n\tl := rv.Len()\n\te.mapStart(l)\n\tif l == 0 {\n\t\te.mapEnd()\n\t\treturn\n\t}\n\t// var asSymbols bool\n\t// determine the underlying key and val encFn's for the map.\n\t// This eliminates some work which is done for each loop iteration i.e.\n\t// rv.Type(), ref.ValueOf(rt).Pointer(), then check map/list for fn.\n\t//\n\t// However, if kind is reflect.Interface, do not pre-determine the\n\t// encoding type, because preEncodeValue may break it down to\n\t// a concrete type and kInterface will bomb.\n\tvar keyFn, valFn *codecFn\n\trtval := f.ti.elem\n\t// rtkeyid := rt2id(f.ti.key)\n\tfor rtval.Kind() == reflect.Ptr {\n\t\trtval = rtval.Elem()\n\t}\n\tif rtval.Kind() != reflect.Interface {\n\t\tvalFn = e.h.fn(rtval, true, true)\n\t}\n\tmks := rv.MapKeys()\n\n\tif e.h.Canonical {\n\t\te.kMapCanonical(f.ti.key, rv, mks, valFn)\n\t\te.mapEnd()\n\t\treturn\n\t}\n\n\trtkey := f.ti.key\n\tvar keyTypeIsString = stringTypId == rt2id(rtkey) // rtkeyid\n\tif !keyTypeIsString {\n\t\tfor rtkey.Kind() == reflect.Ptr {\n\t\t\trtkey = rtkey.Elem()\n\t\t}\n\t\tif rtkey.Kind() != reflect.Interface {\n\t\t\t// rtkeyid = rt2id(rtkey)\n\t\t\tkeyFn = e.h.fn(rtkey, true, true)\n\t\t}\n\t}\n\n\t// for j, lmks := 0, len(mks); j < lmks; j++ {\n\tfor j := range mks {\n\t\te.mapElemKey()\n\t\tif keyTypeIsString {\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(mks[j].String()))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, mks[j].String())\n\t\t\t}\n\t\t} else {\n\t\t\te.encodeValue(mks[j], keyFn, true)\n\t\t}\n\t\te.mapElemValue()\n\t\te.encodeValue(rv.MapIndex(mks[j]), valFn, true)\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) kMapCanonical(rtkey reflect.Type, rv reflect.Value, mks []reflect.Value, valFn *codecFn) {\n\t// we previously did out-of-band if an extension was registered.\n\t// This is not necessary, as the natural kind is sufficient for ordering.\n\n\tswitch rtkey.Kind() {\n\tcase reflect.Bool:\n\t\tmksv := make([]boolRv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.Bool()\n\t\t}\n\t\tsort.Sort(boolRvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeBool(mksv[i].v)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.String:\n\t\tmksv := make([]stringRv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.String()\n\t\t}\n\t\tsort.Sort(stringRvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(mksv[i].v))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, mksv[i].v)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uint, reflect.Uintptr:\n\t\tmksv := make([]uint64Rv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.Uint()\n\t\t}\n\t\tsort.Sort(uint64RvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(mksv[i].v)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Int:\n\t\tmksv := make([]int64Rv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.Int()\n\t\t}\n\t\tsort.Sort(int64RvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(mksv[i].v)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.Float32:\n\t\tmksv := make([]float64Rv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.Float()\n\t\t}\n\t\tsort.Sort(float64RvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeFloat32(float32(mksv[i].v))\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.Float64:\n\t\tmksv := make([]float64Rv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksv[i]\n\t\t\tv.r = k\n\t\t\tv.v = k.Float()\n\t\t}\n\t\tsort.Sort(float64RvSlice(mksv))\n\t\tfor i := range mksv {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeFloat64(mksv[i].v)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t}\n\tcase reflect.Struct:\n\t\tif rv.Type() == timeTyp {\n\t\t\tmksv := make([]timeRv, len(mks))\n\t\t\tfor i, k := range mks {\n\t\t\t\tv := &mksv[i]\n\t\t\t\tv.r = k\n\t\t\t\tv.v = rv2i(k).(time.Time)\n\t\t\t}\n\t\t\tsort.Sort(timeRvSlice(mksv))\n\t\t\tfor i := range mksv {\n\t\t\t\te.mapElemKey()\n\t\t\t\te.e.EncodeTime(mksv[i].v)\n\t\t\t\te.mapElemValue()\n\t\t\t\te.encodeValue(rv.MapIndex(mksv[i].r), valFn, true)\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t\tfallthrough\n\tdefault:\n\t\t// out-of-band\n\t\t// first encode each key to a []byte first, then sort them, then record\n\t\tvar mksv []byte = make([]byte, 0, len(mks)*16) // temporary byte slice for the encoding\n\t\te2 := NewEncoderBytes(&mksv, e.hh)\n\t\tmksbv := make([]bytesRv, len(mks))\n\t\tfor i, k := range mks {\n\t\t\tv := &mksbv[i]\n\t\t\tl := len(mksv)\n\t\t\te2.MustEncode(k)\n\t\t\tv.r = k\n\t\t\tv.v = mksv[l:]\n\t\t}\n\t\tsort.Sort(bytesRvSlice(mksbv))\n\t\tfor j := range mksbv {\n\t\t\te.mapElemKey()\n\t\t\te.asis(mksbv[j].v)\n\t\t\te.mapElemValue()\n\t\t\te.encodeValue(rv.MapIndex(mksbv[j].r), valFn, true)\n\t\t}\n\t}\n}\n\n// // --------------------------------------------------\n\ntype encWriterSwitch struct {\n\tesep bool // whether it has elem separators\n\tbytes bool // encoding to []byte\n\tisas bool // whether e.as != nil\n\tjs bool // is json encoder?\n\tbe bool // is binary encoder?\n\n\tc containerState\n\t// _ [3]byte // padding\n\t// _ [2]uint64 // padding\n\t// _ uint64 // padding\n\t// wi *ioEncWriter\n\twb bytesEncAppender\n\twf *bufioEncWriter\n\t// typ entryType\n}\n\nfunc (z *encWriterSwitch) writeb(s []byte) {\n\tif z.bytes {\n\t\tz.wb.writeb(s)\n\t} else {\n\t\tz.wf.writeb(s)\n\t}\n}\nfunc (z *encWriterSwitch) writeqstr(s string) {\n\tif z.bytes {\n\t\tz.wb.writeqstr(s)\n\t} else {\n\t\tz.wf.writeqstr(s)\n\t}\n}\nfunc (z *encWriterSwitch) writestr(s string) {\n\tif z.bytes {\n\t\tz.wb.writestr(s)\n\t} else {\n\t\tz.wf.writestr(s)\n\t}\n}\nfunc (z *encWriterSwitch) writen1(b1 byte) {\n\tif z.bytes {\n\t\tz.wb.writen1(b1)\n\t} else {\n\t\tz.wf.writen1(b1)\n\t}\n}\nfunc (z *encWriterSwitch) writen2(b1, b2 byte) {\n\tif z.bytes {\n\t\tz.wb.writen2(b1, b2)\n\t} else {\n\t\tz.wf.writen2(b1, b2)\n\t}\n}\nfunc (z *encWriterSwitch) endErr() error {\n\tif z.bytes {\n\t\treturn z.wb.endErr()\n\t}\n\treturn z.wf.endErr()\n}\n\nfunc (z *encWriterSwitch) end() {\n\tif err := z.endErr(); err != nil {\n\t\tpanic(err)\n\t}\n}\n\n/*\n\n// ------------------------------------------\nfunc (z *encWriterSwitch) writeb(s []byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.wb.writeb(s)\n\tcase entryTypeIo:\n\t\tz.wi.writeb(s)\n\tdefault:\n\t\tz.wf.writeb(s)\n\t}\n}\nfunc (z *encWriterSwitch) writestr(s string) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.wb.writestr(s)\n\tcase entryTypeIo:\n\t\tz.wi.writestr(s)\n\tdefault:\n\t\tz.wf.writestr(s)\n\t}\n}\nfunc (z *encWriterSwitch) writen1(b1 byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.wb.writen1(b1)\n\tcase entryTypeIo:\n\t\tz.wi.writen1(b1)\n\tdefault:\n\t\tz.wf.writen1(b1)\n\t}\n}\nfunc (z *encWriterSwitch) writen2(b1, b2 byte) {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.wb.writen2(b1, b2)\n\tcase entryTypeIo:\n\t\tz.wi.writen2(b1, b2)\n\tdefault:\n\t\tz.wf.writen2(b1, b2)\n\t}\n}\nfunc (z *encWriterSwitch) end() {\n\tswitch z.typ {\n\tcase entryTypeBytes:\n\t\tz.wb.end()\n\tcase entryTypeIo:\n\t\tz.wi.end()\n\tdefault:\n\t\tz.wf.end()\n\t}\n}\n\n// ------------------------------------------\nfunc (z *encWriterSwitch) writeb(s []byte) {\n\tif z.bytes {\n\t\tz.wb.writeb(s)\n\t} else {\n\t\tz.wi.writeb(s)\n\t}\n}\nfunc (z *encWriterSwitch) writestr(s string) {\n\tif z.bytes {\n\t\tz.wb.writestr(s)\n\t} else {\n\t\tz.wi.writestr(s)\n\t}\n}\nfunc (z *encWriterSwitch) writen1(b1 byte) {\n\tif z.bytes {\n\t\tz.wb.writen1(b1)\n\t} else {\n\t\tz.wi.writen1(b1)\n\t}\n}\nfunc (z *encWriterSwitch) writen2(b1, b2 byte) {\n\tif z.bytes {\n\t\tz.wb.writen2(b1, b2)\n\t} else {\n\t\tz.wi.writen2(b1, b2)\n\t}\n}\nfunc (z *encWriterSwitch) end() {\n\tif z.bytes {\n\t\tz.wb.end()\n\t} else {\n\t\tz.wi.end()\n\t}\n}\n\n*/\n\n// Encoder writes an object to an output stream in a supported format.\n//\n// Encoder is NOT safe for concurrent use i.e. a Encoder cannot be used\n// concurrently in multiple goroutines.\n//\n// However, as Encoder could be allocation heavy to initialize, a Reset method is provided\n// so its state can be reused to decode new input streams repeatedly.\n// This is the idiomatic way to use.\ntype Encoder struct {\n\tpanicHdl\n\t// hopefully, reduce derefencing cost by laying the encWriter inside the Encoder\n\te encDriver\n\n\t// NOTE: Encoder shouldn't call it's write methods,\n\t// as the handler MAY need to do some coordination.\n\t// w *encWriterSwitch\n\n\t// bw *bufio.Writer\n\tas encDriverAsis\n\n\tjenc *jsonEncDriver\n\th *BasicHandle\n\thh Handle\n\n\t// ---- cpu cache line boundary\n\tencWriterSwitch\n\n\terr error\n\n\t// ---- cpu cache line boundary\n\t// ---- writable fields during execution --- *try* to keep in sep cache line\n\tci set // holds set of addresses found during an encoding (if CheckCircularRef=true)\n\tcidef [1]uintptr // default ci\n\n\tb [(4 * 8)]byte // for encoding chan byte, (non-addressable) [N]byte, etc\n\n\t// ---- cpu cache line boundary?\n\t// b [scratchByteArrayLen]byte\n\t// _ [cacheLineSize - scratchByteArrayLen]byte // padding\n\t// b [cacheLineSize - (8 * 0)]byte // used for encoding a chan or (non-addressable) array of bytes\n}\n\n// NewEncoder returns an Encoder for encoding into an io.Writer.\n//\n// For efficiency, Users are encouraged to configure WriterBufferSize on the handle\n// OR pass in a memory buffered writer (eg bufio.Writer, bytes.Buffer).\nfunc NewEncoder(w io.Writer, h Handle) *Encoder {\n\te := newEncoder(h)\n\te.Reset(w)\n\treturn e\n}\n\n// NewEncoderBytes returns an encoder for encoding directly and efficiently\n// into a byte slice, using zero-copying to temporary slices.\n//\n// It will potentially replace the output byte slice pointed to.\n// After encoding, the out parameter contains the encoded contents.\nfunc NewEncoderBytes(out *[]byte, h Handle) *Encoder {\n\te := newEncoder(h)\n\te.ResetBytes(out)\n\treturn e\n}\n\nfunc newEncoder(h Handle) *Encoder {\n\te := &Encoder{h: basicHandle(h), err: errEncoderNotInitialized}\n\te.bytes = true\n\tif useFinalizers {\n\t\truntime.SetFinalizer(e, (*Encoder).finalize)\n\t\t// xdebugf(\">>>> new(Encoder) with finalizer\")\n\t}\n\t// e.w = &e.encWriterSwitch\n\te.hh = h\n\te.esep = h.hasElemSeparators()\n\n\treturn e\n}\n\nfunc (e *Encoder) w() *encWriterSwitch {\n\treturn &e.encWriterSwitch\n}\n\nfunc (e *Encoder) resetCommon() {\n\t// e.w = &e.encWriterSwitch\n\tif e.e == nil || e.hh.recreateEncDriver(e.e) {\n\t\te.e = e.hh.newEncDriver(e)\n\t\te.as, e.isas = e.e.(encDriverAsis)\n\t\t// e.cr, _ = e.e.(containerStateRecv)\n\t}\n\n\tif e.ci == nil {\n\t\te.ci = (set)(e.cidef[:0])\n\t} else {\n\t\te.ci = e.ci[:0]\n\t}\n\n\te.be = e.hh.isBinary()\n\te.jenc = nil\n\t_, e.js = e.hh.(*JsonHandle)\n\tif e.js {\n\t\te.jenc = e.e.(interface{ getJsonEncDriver() *jsonEncDriver }).getJsonEncDriver()\n\t}\n\te.e.reset()\n\te.c = 0\n\te.err = nil\n}\n\n// Reset resets the Encoder with a new output stream.\n//\n// This accommodates using the state of the Encoder,\n// where it has \"cached\" information about sub-engines.\nfunc (e *Encoder) Reset(w io.Writer) {\n\tif w == nil {\n\t\treturn\n\t}\n\t// var ok bool\n\te.bytes = false\n\tif e.wf == nil {\n\t\te.wf = new(bufioEncWriter)\n\t}\n\t// e.typ = entryTypeUnset\n\t// if e.h.WriterBufferSize > 0 {\n\t// \t// bw := bufio.NewWriterSize(w, e.h.WriterBufferSize)\n\t// \t// e.wi.bw = bw\n\t// \t// e.wi.sw = bw\n\t// \t// e.wi.fw = bw\n\t// \t// e.wi.ww = bw\n\t// \tif e.wf == nil {\n\t// \t\te.wf = new(bufioEncWriter)\n\t// \t}\n\t// \te.wf.reset(w, e.h.WriterBufferSize)\n\t// \te.typ = entryTypeBufio\n\t// } else {\n\t// \tif e.wi == nil {\n\t// \t\te.wi = new(ioEncWriter)\n\t// \t}\n\t// \te.wi.reset(w)\n\t// \te.typ = entryTypeIo\n\t// }\n\te.wf.reset(w, e.h.WriterBufferSize)\n\t// e.typ = entryTypeBufio\n\n\t// e.w = e.wi\n\te.resetCommon()\n}\n\n// ResetBytes resets the Encoder with a new destination output []byte.\nfunc (e *Encoder) ResetBytes(out *[]byte) {\n\tif out == nil {\n\t\treturn\n\t}\n\tvar in []byte = *out\n\tif in == nil {\n\t\tin = make([]byte, defEncByteBufSize)\n\t}\n\te.bytes = true\n\t// e.typ = entryTypeBytes\n\te.wb.reset(in, out)\n\t// e.w = &e.wb\n\te.resetCommon()\n}\n\n// Encode writes an object into a stream.\n//\n// Encoding can be configured via the struct tag for the fields.\n// The key (in the struct tags) that we look at is configurable.\n//\n// By default, we look up the \"codec\" key in the struct field's tags,\n// and fall bak to the \"json\" key if \"codec\" is absent.\n// That key in struct field's tag value is the key name,\n// followed by an optional comma and options.\n//\n// To set an option on all fields (e.g. omitempty on all fields), you\n// can create a field called _struct, and set flags on it. The options\n// which can be set on _struct are:\n// - omitempty: so all fields are omitted if empty\n// - toarray: so struct is encoded as an array\n// - int: so struct key names are encoded as signed integers (instead of strings)\n// - uint: so struct key names are encoded as unsigned integers (instead of strings)\n// - float: so struct key names are encoded as floats (instead of strings)\n// More details on these below.\n//\n// Struct values \"usually\" encode as maps. Each exported struct field is encoded unless:\n// - the field's tag is \"-\", OR\n// - the field is empty (empty or the zero value) and its tag specifies the \"omitempty\" option.\n//\n// When encoding as a map, the first string in the tag (before the comma)\n// is the map key string to use when encoding.\n// ...\n// This key is typically encoded as a string.\n// However, there are instances where the encoded stream has mapping keys encoded as numbers.\n// For example, some cbor streams have keys as integer codes in the stream, but they should map\n// to fields in a structured object. Consequently, a struct is the natural representation in code.\n// For these, configure the struct to encode/decode the keys as numbers (instead of string).\n// This is done with the int,uint or float option on the _struct field (see above).\n//\n// However, struct values may encode as arrays. This happens when:\n// - StructToArray Encode option is set, OR\n// - the tag on the _struct field sets the \"toarray\" option\n// Note that omitempty is ignored when encoding struct values as arrays,\n// as an entry must be encoded for each field, to maintain its position.\n//\n// Values with types that implement MapBySlice are encoded as stream maps.\n//\n// The empty values (for omitempty option) are false, 0, any nil pointer\n// or interface value, and any array, slice, map, or string of length zero.\n//\n// Anonymous fields are encoded inline except:\n// - the struct tag specifies a replacement name (first value)\n// - the field is of an interface type\n//\n// Examples:\n//\n// // NOTE: 'json:' can be used as struct tag key, in place 'codec:' below.\n// type MyStruct struct {\n// _struct bool `codec:\",omitempty\"` //set omitempty for every field\n// Field1 string `codec:\"-\"` //skip this field\n// Field2 int `codec:\"myName\"` //Use key \"myName\" in encode stream\n// Field3 int32 `codec:\",omitempty\"` //use key \"Field3\". Omit if empty.\n// Field4 bool `codec:\"f4,omitempty\"` //use key \"f4\". Omit if empty.\n// io.Reader //use key \"Reader\".\n// MyStruct `codec:\"my1\" //use key \"my1\".\n// MyStruct //inline it\n// ...\n// }\n//\n// type MyStruct struct {\n// _struct bool `codec:\",toarray\"` //encode struct as an array\n// }\n//\n// type MyStruct struct {\n// _struct bool `codec:\",uint\"` //encode struct with \"unsigned integer\" keys\n// Field1 string `codec:\"1\"` //encode Field1 key using: EncodeInt(1)\n// Field2 string `codec:\"2\"` //encode Field2 key using: EncodeInt(2)\n// }\n//\n// The mode of encoding is based on the type of the value. When a value is seen:\n// - If a Selfer, call its CodecEncodeSelf method\n// - If an extension is registered for it, call that extension function\n// - If implements encoding.(Binary|Text|JSON)Marshaler, call Marshal(Binary|Text|JSON) method\n// - Else encode it based on its reflect.Kind\n//\n// Note that struct field names and keys in map[string]XXX will be treated as symbols.\n// Some formats support symbols (e.g. binc) and will properly encode the string\n// only once in the stream, and use a tag to refer to it thereafter.\nfunc (e *Encoder) Encode(v interface{}) (err error) {\n\t// tried to use closure, as runtime optimizes defer with no params.\n\t// This seemed to be causing weird issues (like circular reference found, unexpected panic, etc).\n\t// Also, see https://github.com/golang/go/issues/14939#issuecomment-417836139\n\t// defer func() { e.deferred(&err) }() }\n\t// { x, y := e, &err; defer func() { x.deferred(y) }() }\n\tif e.err != nil {\n\t\treturn e.err\n\t}\n\tif recoverPanicToErr {\n\t\tdefer func() {\n\t\t\t// if error occurred during encoding, return that error;\n\t\t\t// else if error occurred on end'ing (i.e. during flush), return that error.\n\t\t\terr = e.w().endErr()\n\t\t\tx := recover()\n\t\t\tif x == nil {\n\t\t\t\tif e.err != err {\n\t\t\t\t\te.err = err\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tpanicValToErr(e, x, &e.err)\n\t\t\t\tif e.err != err {\n\t\t\t\t\terr = e.err\n\t\t\t\t}\n\t\t\t}\n\t\t}()\n\t}\n\n\t// defer e.deferred(&err)\n\te.mustEncode(v)\n\treturn\n}\n\n// MustEncode is like Encode, but panics if unable to Encode.\n// This provides insight to the code location that triggered the error.\nfunc (e *Encoder) MustEncode(v interface{}) {\n\tif e.err != nil {\n\t\tpanic(e.err)\n\t}\n\te.mustEncode(v)\n}\n\nfunc (e *Encoder) mustEncode(v interface{}) {\n\tif e.wf == nil {\n\t\te.encode(v)\n\t\te.e.atEndOfEncode()\n\t\te.w().end()\n\t\treturn\n\t}\n\n\tif e.wf.buf == nil {\n\t\te.wf.buf = e.wf.bytesBufPooler.get(e.wf.sz)\n\t}\n\te.wf.calls++\n\n\te.encode(v)\n\n\te.wf.calls--\n\n\tif e.wf.calls == 0 {\n\t\te.e.atEndOfEncode()\n\t\te.w().end()\n\t\tif !e.h.ExplicitRelease {\n\t\t\te.wf.release()\n\t\t}\n\t}\n}\n\n// func (e *Encoder) deferred(err1 *error) {\n// \te.w().end()\n// \tif recoverPanicToErr {\n// \t\tif x := recover(); x != nil {\n// \t\t\tpanicValToErr(e, x, err1)\n// \t\t\tpanicValToErr(e, x, &e.err)\n// \t\t}\n// \t}\n// }\n\n//go:noinline -- as it is run by finalizer\nfunc (e *Encoder) finalize() {\n\t// xdebugf(\"finalizing Encoder\")\n\te.Release()\n}\n\n// Release releases shared (pooled) resources.\n//\n// It is important to call Release() when done with an Encoder, so those resources\n// are released instantly for use by subsequently created Encoders.\nfunc (e *Encoder) Release() {\n\tif e.wf != nil {\n\t\te.wf.release()\n\t}\n}\n\nfunc (e *Encoder) encode(iv interface{}) {\n\t// a switch with only concrete types can be optimized.\n\t// consequently, we deal with nil and interfaces outside the switch.\n\n\tif iv == nil || definitelyNil(iv) {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\n\tswitch v := iv.(type) {\n\t// case nil:\n\t// case Selfer:\n\tcase Raw:\n\t\te.rawBytes(v)\n\tcase reflect.Value:\n\t\te.encodeValue(v, nil, true)\n\n\tcase string:\n\t\tif e.h.StringToRaw {\n\t\t\te.e.EncodeStringBytesRaw(bytesView(v))\n\t\t} else {\n\t\t\te.e.EncodeStringEnc(cUTF8, v)\n\t\t}\n\tcase bool:\n\t\te.e.EncodeBool(v)\n\tcase int:\n\t\te.e.EncodeInt(int64(v))\n\tcase int8:\n\t\te.e.EncodeInt(int64(v))\n\tcase int16:\n\t\te.e.EncodeInt(int64(v))\n\tcase int32:\n\t\te.e.EncodeInt(int64(v))\n\tcase int64:\n\t\te.e.EncodeInt(v)\n\tcase uint:\n\t\te.e.EncodeUint(uint64(v))\n\tcase uint8:\n\t\te.e.EncodeUint(uint64(v))\n\tcase uint16:\n\t\te.e.EncodeUint(uint64(v))\n\tcase uint32:\n\t\te.e.EncodeUint(uint64(v))\n\tcase uint64:\n\t\te.e.EncodeUint(v)\n\tcase uintptr:\n\t\te.e.EncodeUint(uint64(v))\n\tcase float32:\n\t\te.e.EncodeFloat32(v)\n\tcase float64:\n\t\te.e.EncodeFloat64(v)\n\tcase time.Time:\n\t\te.e.EncodeTime(v)\n\tcase []uint8:\n\t\te.e.EncodeStringBytesRaw(v)\n\n\tcase *Raw:\n\t\te.rawBytes(*v)\n\n\tcase *string:\n\t\tif e.h.StringToRaw {\n\t\t\te.e.EncodeStringBytesRaw(bytesView(*v))\n\t\t} else {\n\t\t\te.e.EncodeStringEnc(cUTF8, *v)\n\t\t}\n\tcase *bool:\n\t\te.e.EncodeBool(*v)\n\tcase *int:\n\t\te.e.EncodeInt(int64(*v))\n\tcase *int8:\n\t\te.e.EncodeInt(int64(*v))\n\tcase *int16:\n\t\te.e.EncodeInt(int64(*v))\n\tcase *int32:\n\t\te.e.EncodeInt(int64(*v))\n\tcase *int64:\n\t\te.e.EncodeInt(*v)\n\tcase *uint:\n\t\te.e.EncodeUint(uint64(*v))\n\tcase *uint8:\n\t\te.e.EncodeUint(uint64(*v))\n\tcase *uint16:\n\t\te.e.EncodeUint(uint64(*v))\n\tcase *uint32:\n\t\te.e.EncodeUint(uint64(*v))\n\tcase *uint64:\n\t\te.e.EncodeUint(*v)\n\tcase *uintptr:\n\t\te.e.EncodeUint(uint64(*v))\n\tcase *float32:\n\t\te.e.EncodeFloat32(*v)\n\tcase *float64:\n\t\te.e.EncodeFloat64(*v)\n\tcase *time.Time:\n\t\te.e.EncodeTime(*v)\n\n\tcase *[]uint8:\n\t\te.e.EncodeStringBytesRaw(*v)\n\n\tdefault:\n\t\tif v, ok := iv.(Selfer); ok {\n\t\t\tv.CodecEncodeSelf(e)\n\t\t} else if !fastpathEncodeTypeSwitch(iv, e) {\n\t\t\t// checkfastpath=true (not false), as underlying slice/map type may be fast-path\n\t\t\te.encodeValue(reflect.ValueOf(iv), nil, true)\n\t\t}\n\t}\n}\n\nfunc (e *Encoder) encodeValue(rv reflect.Value, fn *codecFn, checkFastpath bool) {\n\t// if a valid fn is passed, it MUST BE for the dereferenced type of rv\n\tvar sptr uintptr\n\tvar rvp reflect.Value\n\tvar rvpValid bool\nTOP:\n\tswitch rv.Kind() {\n\tcase reflect.Ptr:\n\t\tif rv.IsNil() {\n\t\t\te.e.EncodeNil()\n\t\t\treturn\n\t\t}\n\t\trvpValid = true\n\t\trvp = rv\n\t\trv = rv.Elem()\n\t\tif e.h.CheckCircularRef && rv.Kind() == reflect.Struct {\n\t\t\t// TODO: Movable pointers will be an issue here. Future problem.\n\t\t\tsptr = rv.UnsafeAddr()\n\t\t\tbreak TOP\n\t\t}\n\t\tgoto TOP\n\tcase reflect.Interface:\n\t\tif rv.IsNil() {\n\t\t\te.e.EncodeNil()\n\t\t\treturn\n\t\t}\n\t\trv = rv.Elem()\n\t\tgoto TOP\n\tcase reflect.Slice, reflect.Map:\n\t\tif rv.IsNil() {\n\t\t\te.e.EncodeNil()\n\t\t\treturn\n\t\t}\n\tcase reflect.Invalid, reflect.Func:\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\n\tif sptr != 0 && (&e.ci).add(sptr) {\n\t\te.errorf(\"circular reference found: # %d\", sptr)\n\t}\n\n\tif fn == nil {\n\t\trt := rv.Type()\n\t\t// always pass checkCodecSelfer=true, in case T or ****T is passed, where *T is a Selfer\n\t\tfn = e.h.fn(rt, checkFastpath, true)\n\t}\n\tif fn.i.addrE {\n\t\tif rvpValid {\n\t\t\tfn.fe(e, &fn.i, rvp)\n\t\t} else if rv.CanAddr() {\n\t\t\tfn.fe(e, &fn.i, rv.Addr())\n\t\t} else {\n\t\t\trv2 := reflect.New(rv.Type())\n\t\t\trv2.Elem().Set(rv)\n\t\t\tfn.fe(e, &fn.i, rv2)\n\t\t}\n\t} else {\n\t\tfn.fe(e, &fn.i, rv)\n\t}\n\tif sptr != 0 {\n\t\t(&e.ci).remove(sptr)\n\t}\n}\n\n// func (e *Encoder) marshal(bs []byte, fnerr error, asis bool, c charEncoding) {\n// \tif fnerr != nil {\n// \t\tpanic(fnerr)\n// \t}\n// \tif bs == nil {\n// \t\te.e.EncodeNil()\n// \t} else if asis {\n// \t\te.asis(bs)\n// \t} else {\n// \t\te.e.EncodeStringBytesRaw(bs)\n// \t}\n// }\n\nfunc (e *Encoder) marshalUtf8(bs []byte, fnerr error) {\n\tif fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n\tif bs == nil {\n\t\te.e.EncodeNil()\n\t} else {\n\t\te.e.EncodeStringEnc(cUTF8, stringView(bs))\n\t}\n}\n\nfunc (e *Encoder) marshalAsis(bs []byte, fnerr error) {\n\tif fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n\tif bs == nil {\n\t\te.e.EncodeNil()\n\t} else {\n\t\te.asis(bs)\n\t}\n}\n\nfunc (e *Encoder) marshalRaw(bs []byte, fnerr error) {\n\tif fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n\tif bs == nil {\n\t\te.e.EncodeNil()\n\t} else {\n\t\te.e.EncodeStringBytesRaw(bs)\n\t}\n}\n\nfunc (e *Encoder) asis(v []byte) {\n\tif e.isas {\n\t\te.as.EncodeAsis(v)\n\t} else {\n\t\te.w().writeb(v)\n\t}\n}\n\nfunc (e *Encoder) rawBytes(vv Raw) {\n\tv := []byte(vv)\n\tif !e.h.Raw {\n\t\te.errorf(\"Raw values cannot be encoded: %v\", v)\n\t}\n\te.asis(v)\n}\n\nfunc (e *Encoder) wrapErr(v interface{}, err *error) {\n\t*err = encodeError{codecError{name: e.hh.Name(), err: v}}\n}\n\n// ---- container tracker methods\n// Note: We update the .c after calling the callback.\n// This way, the callback can know what the last status was.\n\nfunc (e *Encoder) mapStart(length int) {\n\te.e.WriteMapStart(length)\n\te.c = containerMapStart\n}\n\nfunc (e *Encoder) mapElemKey() {\n\tif e.js {\n\t\te.jenc.WriteMapElemKey()\n\t}\n\te.c = containerMapKey\n}\n\nfunc (e *Encoder) mapElemValue() {\n\tif e.js {\n\t\te.jenc.WriteMapElemValue()\n\t}\n\te.c = containerMapValue\n}\n\nfunc (e *Encoder) mapEnd() {\n\te.e.WriteMapEnd()\n\te.c = containerMapEnd\n\te.c = 0\n}\n\nfunc (e *Encoder) arrayStart(length int) {\n\te.e.WriteArrayStart(length)\n\te.c = containerArrayStart\n}\n\nfunc (e *Encoder) arrayElem() {\n\tif e.js {\n\t\te.jenc.WriteArrayElem()\n\t}\n\te.c = containerArrayElem\n}\n\nfunc (e *Encoder) arrayEnd() {\n\te.e.WriteArrayEnd()\n\te.c = 0\n\te.c = containerArrayEnd\n}\n\nfunc encStructFieldKey(encName string, ee encDriver, w *encWriterSwitch,\n\tkeyType valueType, encNameAsciiAlphaNum bool, js bool) {\n\tvar m must\n\t// use if-else-if, not switch (which compiles to binary-search)\n\t// since keyType is typically valueTypeString, branch prediction is pretty good.\n\tif keyType == valueTypeString {\n\t\tif js && encNameAsciiAlphaNum { // keyType == valueTypeString\n\t\t\tw.writeqstr(encName)\n\t\t\t// ----\n\t\t\t// w.writen1('\"')\n\t\t\t// w.writestr(encName)\n\t\t\t// w.writen1('\"')\n\t\t\t// ----\n\t\t\t// w.writestr(`\"` + encName + `\"`)\n\t\t\t// ----\n\t\t\t// // do concat myself, so it is faster than the generic string concat\n\t\t\t// b := make([]byte, len(encName)+2)\n\t\t\t// copy(b[1:], encName)\n\t\t\t// b[0] = '\"'\n\t\t\t// b[len(b)-1] = '\"'\n\t\t\t// w.writeb(b)\n\t\t} else { // keyType == valueTypeString\n\t\t\tee.EncodeStringEnc(cUTF8, encName)\n\t\t}\n\t} else if keyType == valueTypeInt {\n\t\tee.EncodeInt(m.Int(strconv.ParseInt(encName, 10, 64)))\n\t} else if keyType == valueTypeUint {\n\t\tee.EncodeUint(m.Uint(strconv.ParseUint(encName, 10, 64)))\n\t} else if keyType == valueTypeFloat {\n\t\tee.EncodeFloat64(m.Float(strconv.ParseFloat(encName, 64)))\n\t}\n}\n\n// func encStringAsRawBytesMaybe(ee encDriver, s string, stringToRaw bool) {\n// \tif stringToRaw {\n// \t\tee.EncodeStringBytesRaw(bytesView(s))\n// \t} else {\n// \t\tee.EncodeStringEnc(cUTF8, s)\n// \t}\n// }\n" }, { "path": "vendor/github.com/ugorji/go/codec/fast-path.generated.go", "content": "// +build !notfastpath\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from fast-path.go.tmpl - DO NOT EDIT.\n\npackage codec\n\n// Fast path functions try to create a fast path encode or decode implementation\n// for common maps and slices.\n//\n// We define the functions and register them in this single file\n// so as not to pollute the encode.go and decode.go, and create a dependency in there.\n// This file can be omitted without causing a build failure.\n//\n// The advantage of fast paths is:\n//\t - Many calls bypass reflection altogether\n//\n// Currently support\n//\t - slice of all builtin types (numeric, bool, string, []byte)\n// - maps of builtin types to builtin or interface{} type, EXCEPT FOR\n// keys of type uintptr, int8/16/32, uint16/32, float32/64, bool, interface{}\n// AND values of type type int8/16/32, uint16/32\n// This should provide adequate \"typical\" implementations.\n//\n// Note that fast track decode functions must handle values for which an address cannot be obtained.\n// For example:\n//\t m2 := map[string]int{}\n//\t p2 := []interface{}{m2}\n//\t // decoding into p2 will bomb if fast track functions do not treat like unaddressable.\n//\n\nimport (\n\t\"reflect\"\n\t\"sort\"\n)\n\nconst fastpathEnabled = true\n\nconst fastpathMapBySliceErrMsg = \"mapBySlice requires even slice length, but got %v\"\n\ntype fastpathT struct{}\n\nvar fastpathTV fastpathT\n\ntype fastpathE struct {\n\trtid uintptr\n\trt reflect.Type\n\tencfn func(*Encoder, *codecFnInfo, reflect.Value)\n\tdecfn func(*Decoder, *codecFnInfo, reflect.Value)\n}\n\ntype fastpathA [88]fastpathE\n\nfunc (x *fastpathA) index(rtid uintptr) int {\n\t// use binary search to grab the index (adapted from sort/search.go)\n\t// Note: we use goto (instead of for loop) so this can be inlined.\n\t// h, i, j := 0, 0, len(x)\n\tvar h, i uint\n\tvar j = uint(len(x))\nLOOP:\n\tif i < j {\n\t\th = i + (j-i)/2\n\t\tif x[h].rtid < rtid {\n\t\t\ti = h + 1\n\t\t} else {\n\t\t\tj = h\n\t\t}\n\t\tgoto LOOP\n\t}\n\tif i < uint(len(x)) && x[i].rtid == rtid {\n\t\treturn int(i)\n\t}\n\treturn -1\n}\n\ntype fastpathAslice []fastpathE\n\nfunc (x fastpathAslice) Len() int { return len(x) }\nfunc (x fastpathAslice) Less(i, j int) bool { return x[uint(i)].rtid < x[uint(j)].rtid }\nfunc (x fastpathAslice) Swap(i, j int) { x[uint(i)], x[uint(j)] = x[uint(j)], x[uint(i)] }\n\nvar fastpathAV fastpathA\n\n// due to possible initialization loop error, make fastpath in an init()\nfunc init() {\n\tvar i uint = 0\n\tfn := func(v interface{},\n\t\tfe func(*Encoder, *codecFnInfo, reflect.Value),\n\t\tfd func(*Decoder, *codecFnInfo, reflect.Value)) {\n\t\txrt := reflect.TypeOf(v)\n\t\txptr := rt2id(xrt)\n\t\tfastpathAV[i] = fastpathE{xptr, xrt, fe, fd}\n\t\ti++\n\t}\n\n\tfn([]interface{}(nil), (*Encoder).fastpathEncSliceIntfR, (*Decoder).fastpathDecSliceIntfR)\n\tfn([]string(nil), (*Encoder).fastpathEncSliceStringR, (*Decoder).fastpathDecSliceStringR)\n\tfn([][]byte(nil), (*Encoder).fastpathEncSliceBytesR, (*Decoder).fastpathDecSliceBytesR)\n\tfn([]float32(nil), (*Encoder).fastpathEncSliceFloat32R, (*Decoder).fastpathDecSliceFloat32R)\n\tfn([]float64(nil), (*Encoder).fastpathEncSliceFloat64R, (*Decoder).fastpathDecSliceFloat64R)\n\tfn([]uint(nil), (*Encoder).fastpathEncSliceUintR, (*Decoder).fastpathDecSliceUintR)\n\tfn([]uint16(nil), (*Encoder).fastpathEncSliceUint16R, (*Decoder).fastpathDecSliceUint16R)\n\tfn([]uint32(nil), (*Encoder).fastpathEncSliceUint32R, (*Decoder).fastpathDecSliceUint32R)\n\tfn([]uint64(nil), (*Encoder).fastpathEncSliceUint64R, (*Decoder).fastpathDecSliceUint64R)\n\tfn([]uintptr(nil), (*Encoder).fastpathEncSliceUintptrR, (*Decoder).fastpathDecSliceUintptrR)\n\tfn([]int(nil), (*Encoder).fastpathEncSliceIntR, (*Decoder).fastpathDecSliceIntR)\n\tfn([]int8(nil), (*Encoder).fastpathEncSliceInt8R, (*Decoder).fastpathDecSliceInt8R)\n\tfn([]int16(nil), (*Encoder).fastpathEncSliceInt16R, (*Decoder).fastpathDecSliceInt16R)\n\tfn([]int32(nil), (*Encoder).fastpathEncSliceInt32R, (*Decoder).fastpathDecSliceInt32R)\n\tfn([]int64(nil), (*Encoder).fastpathEncSliceInt64R, (*Decoder).fastpathDecSliceInt64R)\n\tfn([]bool(nil), (*Encoder).fastpathEncSliceBoolR, (*Decoder).fastpathDecSliceBoolR)\n\n\tfn(map[string]interface{}(nil), (*Encoder).fastpathEncMapStringIntfR, (*Decoder).fastpathDecMapStringIntfR)\n\tfn(map[string]string(nil), (*Encoder).fastpathEncMapStringStringR, (*Decoder).fastpathDecMapStringStringR)\n\tfn(map[string][]byte(nil), (*Encoder).fastpathEncMapStringBytesR, (*Decoder).fastpathDecMapStringBytesR)\n\tfn(map[string]uint(nil), (*Encoder).fastpathEncMapStringUintR, (*Decoder).fastpathDecMapStringUintR)\n\tfn(map[string]uint8(nil), (*Encoder).fastpathEncMapStringUint8R, (*Decoder).fastpathDecMapStringUint8R)\n\tfn(map[string]uint64(nil), (*Encoder).fastpathEncMapStringUint64R, (*Decoder).fastpathDecMapStringUint64R)\n\tfn(map[string]uintptr(nil), (*Encoder).fastpathEncMapStringUintptrR, (*Decoder).fastpathDecMapStringUintptrR)\n\tfn(map[string]int(nil), (*Encoder).fastpathEncMapStringIntR, (*Decoder).fastpathDecMapStringIntR)\n\tfn(map[string]int64(nil), (*Encoder).fastpathEncMapStringInt64R, (*Decoder).fastpathDecMapStringInt64R)\n\tfn(map[string]float32(nil), (*Encoder).fastpathEncMapStringFloat32R, (*Decoder).fastpathDecMapStringFloat32R)\n\tfn(map[string]float64(nil), (*Encoder).fastpathEncMapStringFloat64R, (*Decoder).fastpathDecMapStringFloat64R)\n\tfn(map[string]bool(nil), (*Encoder).fastpathEncMapStringBoolR, (*Decoder).fastpathDecMapStringBoolR)\n\tfn(map[uint]interface{}(nil), (*Encoder).fastpathEncMapUintIntfR, (*Decoder).fastpathDecMapUintIntfR)\n\tfn(map[uint]string(nil), (*Encoder).fastpathEncMapUintStringR, (*Decoder).fastpathDecMapUintStringR)\n\tfn(map[uint][]byte(nil), (*Encoder).fastpathEncMapUintBytesR, (*Decoder).fastpathDecMapUintBytesR)\n\tfn(map[uint]uint(nil), (*Encoder).fastpathEncMapUintUintR, (*Decoder).fastpathDecMapUintUintR)\n\tfn(map[uint]uint8(nil), (*Encoder).fastpathEncMapUintUint8R, (*Decoder).fastpathDecMapUintUint8R)\n\tfn(map[uint]uint64(nil), (*Encoder).fastpathEncMapUintUint64R, (*Decoder).fastpathDecMapUintUint64R)\n\tfn(map[uint]uintptr(nil), (*Encoder).fastpathEncMapUintUintptrR, (*Decoder).fastpathDecMapUintUintptrR)\n\tfn(map[uint]int(nil), (*Encoder).fastpathEncMapUintIntR, (*Decoder).fastpathDecMapUintIntR)\n\tfn(map[uint]int64(nil), (*Encoder).fastpathEncMapUintInt64R, (*Decoder).fastpathDecMapUintInt64R)\n\tfn(map[uint]float32(nil), (*Encoder).fastpathEncMapUintFloat32R, (*Decoder).fastpathDecMapUintFloat32R)\n\tfn(map[uint]float64(nil), (*Encoder).fastpathEncMapUintFloat64R, (*Decoder).fastpathDecMapUintFloat64R)\n\tfn(map[uint]bool(nil), (*Encoder).fastpathEncMapUintBoolR, (*Decoder).fastpathDecMapUintBoolR)\n\tfn(map[uint8]interface{}(nil), (*Encoder).fastpathEncMapUint8IntfR, (*Decoder).fastpathDecMapUint8IntfR)\n\tfn(map[uint8]string(nil), (*Encoder).fastpathEncMapUint8StringR, (*Decoder).fastpathDecMapUint8StringR)\n\tfn(map[uint8][]byte(nil), (*Encoder).fastpathEncMapUint8BytesR, (*Decoder).fastpathDecMapUint8BytesR)\n\tfn(map[uint8]uint(nil), (*Encoder).fastpathEncMapUint8UintR, (*Decoder).fastpathDecMapUint8UintR)\n\tfn(map[uint8]uint8(nil), (*Encoder).fastpathEncMapUint8Uint8R, (*Decoder).fastpathDecMapUint8Uint8R)\n\tfn(map[uint8]uint64(nil), (*Encoder).fastpathEncMapUint8Uint64R, (*Decoder).fastpathDecMapUint8Uint64R)\n\tfn(map[uint8]uintptr(nil), (*Encoder).fastpathEncMapUint8UintptrR, (*Decoder).fastpathDecMapUint8UintptrR)\n\tfn(map[uint8]int(nil), (*Encoder).fastpathEncMapUint8IntR, (*Decoder).fastpathDecMapUint8IntR)\n\tfn(map[uint8]int64(nil), (*Encoder).fastpathEncMapUint8Int64R, (*Decoder).fastpathDecMapUint8Int64R)\n\tfn(map[uint8]float32(nil), (*Encoder).fastpathEncMapUint8Float32R, (*Decoder).fastpathDecMapUint8Float32R)\n\tfn(map[uint8]float64(nil), (*Encoder).fastpathEncMapUint8Float64R, (*Decoder).fastpathDecMapUint8Float64R)\n\tfn(map[uint8]bool(nil), (*Encoder).fastpathEncMapUint8BoolR, (*Decoder).fastpathDecMapUint8BoolR)\n\tfn(map[uint64]interface{}(nil), (*Encoder).fastpathEncMapUint64IntfR, (*Decoder).fastpathDecMapUint64IntfR)\n\tfn(map[uint64]string(nil), (*Encoder).fastpathEncMapUint64StringR, (*Decoder).fastpathDecMapUint64StringR)\n\tfn(map[uint64][]byte(nil), (*Encoder).fastpathEncMapUint64BytesR, (*Decoder).fastpathDecMapUint64BytesR)\n\tfn(map[uint64]uint(nil), (*Encoder).fastpathEncMapUint64UintR, (*Decoder).fastpathDecMapUint64UintR)\n\tfn(map[uint64]uint8(nil), (*Encoder).fastpathEncMapUint64Uint8R, (*Decoder).fastpathDecMapUint64Uint8R)\n\tfn(map[uint64]uint64(nil), (*Encoder).fastpathEncMapUint64Uint64R, (*Decoder).fastpathDecMapUint64Uint64R)\n\tfn(map[uint64]uintptr(nil), (*Encoder).fastpathEncMapUint64UintptrR, (*Decoder).fastpathDecMapUint64UintptrR)\n\tfn(map[uint64]int(nil), (*Encoder).fastpathEncMapUint64IntR, (*Decoder).fastpathDecMapUint64IntR)\n\tfn(map[uint64]int64(nil), (*Encoder).fastpathEncMapUint64Int64R, (*Decoder).fastpathDecMapUint64Int64R)\n\tfn(map[uint64]float32(nil), (*Encoder).fastpathEncMapUint64Float32R, (*Decoder).fastpathDecMapUint64Float32R)\n\tfn(map[uint64]float64(nil), (*Encoder).fastpathEncMapUint64Float64R, (*Decoder).fastpathDecMapUint64Float64R)\n\tfn(map[uint64]bool(nil), (*Encoder).fastpathEncMapUint64BoolR, (*Decoder).fastpathDecMapUint64BoolR)\n\tfn(map[int]interface{}(nil), (*Encoder).fastpathEncMapIntIntfR, (*Decoder).fastpathDecMapIntIntfR)\n\tfn(map[int]string(nil), (*Encoder).fastpathEncMapIntStringR, (*Decoder).fastpathDecMapIntStringR)\n\tfn(map[int][]byte(nil), (*Encoder).fastpathEncMapIntBytesR, (*Decoder).fastpathDecMapIntBytesR)\n\tfn(map[int]uint(nil), (*Encoder).fastpathEncMapIntUintR, (*Decoder).fastpathDecMapIntUintR)\n\tfn(map[int]uint8(nil), (*Encoder).fastpathEncMapIntUint8R, (*Decoder).fastpathDecMapIntUint8R)\n\tfn(map[int]uint64(nil), (*Encoder).fastpathEncMapIntUint64R, (*Decoder).fastpathDecMapIntUint64R)\n\tfn(map[int]uintptr(nil), (*Encoder).fastpathEncMapIntUintptrR, (*Decoder).fastpathDecMapIntUintptrR)\n\tfn(map[int]int(nil), (*Encoder).fastpathEncMapIntIntR, (*Decoder).fastpathDecMapIntIntR)\n\tfn(map[int]int64(nil), (*Encoder).fastpathEncMapIntInt64R, (*Decoder).fastpathDecMapIntInt64R)\n\tfn(map[int]float32(nil), (*Encoder).fastpathEncMapIntFloat32R, (*Decoder).fastpathDecMapIntFloat32R)\n\tfn(map[int]float64(nil), (*Encoder).fastpathEncMapIntFloat64R, (*Decoder).fastpathDecMapIntFloat64R)\n\tfn(map[int]bool(nil), (*Encoder).fastpathEncMapIntBoolR, (*Decoder).fastpathDecMapIntBoolR)\n\tfn(map[int64]interface{}(nil), (*Encoder).fastpathEncMapInt64IntfR, (*Decoder).fastpathDecMapInt64IntfR)\n\tfn(map[int64]string(nil), (*Encoder).fastpathEncMapInt64StringR, (*Decoder).fastpathDecMapInt64StringR)\n\tfn(map[int64][]byte(nil), (*Encoder).fastpathEncMapInt64BytesR, (*Decoder).fastpathDecMapInt64BytesR)\n\tfn(map[int64]uint(nil), (*Encoder).fastpathEncMapInt64UintR, (*Decoder).fastpathDecMapInt64UintR)\n\tfn(map[int64]uint8(nil), (*Encoder).fastpathEncMapInt64Uint8R, (*Decoder).fastpathDecMapInt64Uint8R)\n\tfn(map[int64]uint64(nil), (*Encoder).fastpathEncMapInt64Uint64R, (*Decoder).fastpathDecMapInt64Uint64R)\n\tfn(map[int64]uintptr(nil), (*Encoder).fastpathEncMapInt64UintptrR, (*Decoder).fastpathDecMapInt64UintptrR)\n\tfn(map[int64]int(nil), (*Encoder).fastpathEncMapInt64IntR, (*Decoder).fastpathDecMapInt64IntR)\n\tfn(map[int64]int64(nil), (*Encoder).fastpathEncMapInt64Int64R, (*Decoder).fastpathDecMapInt64Int64R)\n\tfn(map[int64]float32(nil), (*Encoder).fastpathEncMapInt64Float32R, (*Decoder).fastpathDecMapInt64Float32R)\n\tfn(map[int64]float64(nil), (*Encoder).fastpathEncMapInt64Float64R, (*Decoder).fastpathDecMapInt64Float64R)\n\tfn(map[int64]bool(nil), (*Encoder).fastpathEncMapInt64BoolR, (*Decoder).fastpathDecMapInt64BoolR)\n\n\tsort.Sort(fastpathAslice(fastpathAV[:]))\n}\n\n// -- encode\n\n// -- -- fast path type switch\nfunc fastpathEncodeTypeSwitch(iv interface{}, e *Encoder) bool {\n\tswitch v := iv.(type) {\n\n\tcase []interface{}:\n\t\tfastpathTV.EncSliceIntfV(v, e)\n\tcase *[]interface{}:\n\t\tfastpathTV.EncSliceIntfV(*v, e)\n\tcase []string:\n\t\tfastpathTV.EncSliceStringV(v, e)\n\tcase *[]string:\n\t\tfastpathTV.EncSliceStringV(*v, e)\n\tcase [][]byte:\n\t\tfastpathTV.EncSliceBytesV(v, e)\n\tcase *[][]byte:\n\t\tfastpathTV.EncSliceBytesV(*v, e)\n\tcase []float32:\n\t\tfastpathTV.EncSliceFloat32V(v, e)\n\tcase *[]float32:\n\t\tfastpathTV.EncSliceFloat32V(*v, e)\n\tcase []float64:\n\t\tfastpathTV.EncSliceFloat64V(v, e)\n\tcase *[]float64:\n\t\tfastpathTV.EncSliceFloat64V(*v, e)\n\tcase []uint:\n\t\tfastpathTV.EncSliceUintV(v, e)\n\tcase *[]uint:\n\t\tfastpathTV.EncSliceUintV(*v, e)\n\tcase []uint16:\n\t\tfastpathTV.EncSliceUint16V(v, e)\n\tcase *[]uint16:\n\t\tfastpathTV.EncSliceUint16V(*v, e)\n\tcase []uint32:\n\t\tfastpathTV.EncSliceUint32V(v, e)\n\tcase *[]uint32:\n\t\tfastpathTV.EncSliceUint32V(*v, e)\n\tcase []uint64:\n\t\tfastpathTV.EncSliceUint64V(v, e)\n\tcase *[]uint64:\n\t\tfastpathTV.EncSliceUint64V(*v, e)\n\tcase []uintptr:\n\t\tfastpathTV.EncSliceUintptrV(v, e)\n\tcase *[]uintptr:\n\t\tfastpathTV.EncSliceUintptrV(*v, e)\n\tcase []int:\n\t\tfastpathTV.EncSliceIntV(v, e)\n\tcase *[]int:\n\t\tfastpathTV.EncSliceIntV(*v, e)\n\tcase []int8:\n\t\tfastpathTV.EncSliceInt8V(v, e)\n\tcase *[]int8:\n\t\tfastpathTV.EncSliceInt8V(*v, e)\n\tcase []int16:\n\t\tfastpathTV.EncSliceInt16V(v, e)\n\tcase *[]int16:\n\t\tfastpathTV.EncSliceInt16V(*v, e)\n\tcase []int32:\n\t\tfastpathTV.EncSliceInt32V(v, e)\n\tcase *[]int32:\n\t\tfastpathTV.EncSliceInt32V(*v, e)\n\tcase []int64:\n\t\tfastpathTV.EncSliceInt64V(v, e)\n\tcase *[]int64:\n\t\tfastpathTV.EncSliceInt64V(*v, e)\n\tcase []bool:\n\t\tfastpathTV.EncSliceBoolV(v, e)\n\tcase *[]bool:\n\t\tfastpathTV.EncSliceBoolV(*v, e)\n\n\tcase map[string]interface{}:\n\t\tfastpathTV.EncMapStringIntfV(v, e)\n\tcase *map[string]interface{}:\n\t\tfastpathTV.EncMapStringIntfV(*v, e)\n\tcase map[string]string:\n\t\tfastpathTV.EncMapStringStringV(v, e)\n\tcase *map[string]string:\n\t\tfastpathTV.EncMapStringStringV(*v, e)\n\tcase map[string][]byte:\n\t\tfastpathTV.EncMapStringBytesV(v, e)\n\tcase *map[string][]byte:\n\t\tfastpathTV.EncMapStringBytesV(*v, e)\n\tcase map[string]uint:\n\t\tfastpathTV.EncMapStringUintV(v, e)\n\tcase *map[string]uint:\n\t\tfastpathTV.EncMapStringUintV(*v, e)\n\tcase map[string]uint8:\n\t\tfastpathTV.EncMapStringUint8V(v, e)\n\tcase *map[string]uint8:\n\t\tfastpathTV.EncMapStringUint8V(*v, e)\n\tcase map[string]uint64:\n\t\tfastpathTV.EncMapStringUint64V(v, e)\n\tcase *map[string]uint64:\n\t\tfastpathTV.EncMapStringUint64V(*v, e)\n\tcase map[string]uintptr:\n\t\tfastpathTV.EncMapStringUintptrV(v, e)\n\tcase *map[string]uintptr:\n\t\tfastpathTV.EncMapStringUintptrV(*v, e)\n\tcase map[string]int:\n\t\tfastpathTV.EncMapStringIntV(v, e)\n\tcase *map[string]int:\n\t\tfastpathTV.EncMapStringIntV(*v, e)\n\tcase map[string]int64:\n\t\tfastpathTV.EncMapStringInt64V(v, e)\n\tcase *map[string]int64:\n\t\tfastpathTV.EncMapStringInt64V(*v, e)\n\tcase map[string]float32:\n\t\tfastpathTV.EncMapStringFloat32V(v, e)\n\tcase *map[string]float32:\n\t\tfastpathTV.EncMapStringFloat32V(*v, e)\n\tcase map[string]float64:\n\t\tfastpathTV.EncMapStringFloat64V(v, e)\n\tcase *map[string]float64:\n\t\tfastpathTV.EncMapStringFloat64V(*v, e)\n\tcase map[string]bool:\n\t\tfastpathTV.EncMapStringBoolV(v, e)\n\tcase *map[string]bool:\n\t\tfastpathTV.EncMapStringBoolV(*v, e)\n\tcase map[uint]interface{}:\n\t\tfastpathTV.EncMapUintIntfV(v, e)\n\tcase *map[uint]interface{}:\n\t\tfastpathTV.EncMapUintIntfV(*v, e)\n\tcase map[uint]string:\n\t\tfastpathTV.EncMapUintStringV(v, e)\n\tcase *map[uint]string:\n\t\tfastpathTV.EncMapUintStringV(*v, e)\n\tcase map[uint][]byte:\n\t\tfastpathTV.EncMapUintBytesV(v, e)\n\tcase *map[uint][]byte:\n\t\tfastpathTV.EncMapUintBytesV(*v, e)\n\tcase map[uint]uint:\n\t\tfastpathTV.EncMapUintUintV(v, e)\n\tcase *map[uint]uint:\n\t\tfastpathTV.EncMapUintUintV(*v, e)\n\tcase map[uint]uint8:\n\t\tfastpathTV.EncMapUintUint8V(v, e)\n\tcase *map[uint]uint8:\n\t\tfastpathTV.EncMapUintUint8V(*v, e)\n\tcase map[uint]uint64:\n\t\tfastpathTV.EncMapUintUint64V(v, e)\n\tcase *map[uint]uint64:\n\t\tfastpathTV.EncMapUintUint64V(*v, e)\n\tcase map[uint]uintptr:\n\t\tfastpathTV.EncMapUintUintptrV(v, e)\n\tcase *map[uint]uintptr:\n\t\tfastpathTV.EncMapUintUintptrV(*v, e)\n\tcase map[uint]int:\n\t\tfastpathTV.EncMapUintIntV(v, e)\n\tcase *map[uint]int:\n\t\tfastpathTV.EncMapUintIntV(*v, e)\n\tcase map[uint]int64:\n\t\tfastpathTV.EncMapUintInt64V(v, e)\n\tcase *map[uint]int64:\n\t\tfastpathTV.EncMapUintInt64V(*v, e)\n\tcase map[uint]float32:\n\t\tfastpathTV.EncMapUintFloat32V(v, e)\n\tcase *map[uint]float32:\n\t\tfastpathTV.EncMapUintFloat32V(*v, e)\n\tcase map[uint]float64:\n\t\tfastpathTV.EncMapUintFloat64V(v, e)\n\tcase *map[uint]float64:\n\t\tfastpathTV.EncMapUintFloat64V(*v, e)\n\tcase map[uint]bool:\n\t\tfastpathTV.EncMapUintBoolV(v, e)\n\tcase *map[uint]bool:\n\t\tfastpathTV.EncMapUintBoolV(*v, e)\n\tcase map[uint8]interface{}:\n\t\tfastpathTV.EncMapUint8IntfV(v, e)\n\tcase *map[uint8]interface{}:\n\t\tfastpathTV.EncMapUint8IntfV(*v, e)\n\tcase map[uint8]string:\n\t\tfastpathTV.EncMapUint8StringV(v, e)\n\tcase *map[uint8]string:\n\t\tfastpathTV.EncMapUint8StringV(*v, e)\n\tcase map[uint8][]byte:\n\t\tfastpathTV.EncMapUint8BytesV(v, e)\n\tcase *map[uint8][]byte:\n\t\tfastpathTV.EncMapUint8BytesV(*v, e)\n\tcase map[uint8]uint:\n\t\tfastpathTV.EncMapUint8UintV(v, e)\n\tcase *map[uint8]uint:\n\t\tfastpathTV.EncMapUint8UintV(*v, e)\n\tcase map[uint8]uint8:\n\t\tfastpathTV.EncMapUint8Uint8V(v, e)\n\tcase *map[uint8]uint8:\n\t\tfastpathTV.EncMapUint8Uint8V(*v, e)\n\tcase map[uint8]uint64:\n\t\tfastpathTV.EncMapUint8Uint64V(v, e)\n\tcase *map[uint8]uint64:\n\t\tfastpathTV.EncMapUint8Uint64V(*v, e)\n\tcase map[uint8]uintptr:\n\t\tfastpathTV.EncMapUint8UintptrV(v, e)\n\tcase *map[uint8]uintptr:\n\t\tfastpathTV.EncMapUint8UintptrV(*v, e)\n\tcase map[uint8]int:\n\t\tfastpathTV.EncMapUint8IntV(v, e)\n\tcase *map[uint8]int:\n\t\tfastpathTV.EncMapUint8IntV(*v, e)\n\tcase map[uint8]int64:\n\t\tfastpathTV.EncMapUint8Int64V(v, e)\n\tcase *map[uint8]int64:\n\t\tfastpathTV.EncMapUint8Int64V(*v, e)\n\tcase map[uint8]float32:\n\t\tfastpathTV.EncMapUint8Float32V(v, e)\n\tcase *map[uint8]float32:\n\t\tfastpathTV.EncMapUint8Float32V(*v, e)\n\tcase map[uint8]float64:\n\t\tfastpathTV.EncMapUint8Float64V(v, e)\n\tcase *map[uint8]float64:\n\t\tfastpathTV.EncMapUint8Float64V(*v, e)\n\tcase map[uint8]bool:\n\t\tfastpathTV.EncMapUint8BoolV(v, e)\n\tcase *map[uint8]bool:\n\t\tfastpathTV.EncMapUint8BoolV(*v, e)\n\tcase map[uint64]interface{}:\n\t\tfastpathTV.EncMapUint64IntfV(v, e)\n\tcase *map[uint64]interface{}:\n\t\tfastpathTV.EncMapUint64IntfV(*v, e)\n\tcase map[uint64]string:\n\t\tfastpathTV.EncMapUint64StringV(v, e)\n\tcase *map[uint64]string:\n\t\tfastpathTV.EncMapUint64StringV(*v, e)\n\tcase map[uint64][]byte:\n\t\tfastpathTV.EncMapUint64BytesV(v, e)\n\tcase *map[uint64][]byte:\n\t\tfastpathTV.EncMapUint64BytesV(*v, e)\n\tcase map[uint64]uint:\n\t\tfastpathTV.EncMapUint64UintV(v, e)\n\tcase *map[uint64]uint:\n\t\tfastpathTV.EncMapUint64UintV(*v, e)\n\tcase map[uint64]uint8:\n\t\tfastpathTV.EncMapUint64Uint8V(v, e)\n\tcase *map[uint64]uint8:\n\t\tfastpathTV.EncMapUint64Uint8V(*v, e)\n\tcase map[uint64]uint64:\n\t\tfastpathTV.EncMapUint64Uint64V(v, e)\n\tcase *map[uint64]uint64:\n\t\tfastpathTV.EncMapUint64Uint64V(*v, e)\n\tcase map[uint64]uintptr:\n\t\tfastpathTV.EncMapUint64UintptrV(v, e)\n\tcase *map[uint64]uintptr:\n\t\tfastpathTV.EncMapUint64UintptrV(*v, e)\n\tcase map[uint64]int:\n\t\tfastpathTV.EncMapUint64IntV(v, e)\n\tcase *map[uint64]int:\n\t\tfastpathTV.EncMapUint64IntV(*v, e)\n\tcase map[uint64]int64:\n\t\tfastpathTV.EncMapUint64Int64V(v, e)\n\tcase *map[uint64]int64:\n\t\tfastpathTV.EncMapUint64Int64V(*v, e)\n\tcase map[uint64]float32:\n\t\tfastpathTV.EncMapUint64Float32V(v, e)\n\tcase *map[uint64]float32:\n\t\tfastpathTV.EncMapUint64Float32V(*v, e)\n\tcase map[uint64]float64:\n\t\tfastpathTV.EncMapUint64Float64V(v, e)\n\tcase *map[uint64]float64:\n\t\tfastpathTV.EncMapUint64Float64V(*v, e)\n\tcase map[uint64]bool:\n\t\tfastpathTV.EncMapUint64BoolV(v, e)\n\tcase *map[uint64]bool:\n\t\tfastpathTV.EncMapUint64BoolV(*v, e)\n\tcase map[int]interface{}:\n\t\tfastpathTV.EncMapIntIntfV(v, e)\n\tcase *map[int]interface{}:\n\t\tfastpathTV.EncMapIntIntfV(*v, e)\n\tcase map[int]string:\n\t\tfastpathTV.EncMapIntStringV(v, e)\n\tcase *map[int]string:\n\t\tfastpathTV.EncMapIntStringV(*v, e)\n\tcase map[int][]byte:\n\t\tfastpathTV.EncMapIntBytesV(v, e)\n\tcase *map[int][]byte:\n\t\tfastpathTV.EncMapIntBytesV(*v, e)\n\tcase map[int]uint:\n\t\tfastpathTV.EncMapIntUintV(v, e)\n\tcase *map[int]uint:\n\t\tfastpathTV.EncMapIntUintV(*v, e)\n\tcase map[int]uint8:\n\t\tfastpathTV.EncMapIntUint8V(v, e)\n\tcase *map[int]uint8:\n\t\tfastpathTV.EncMapIntUint8V(*v, e)\n\tcase map[int]uint64:\n\t\tfastpathTV.EncMapIntUint64V(v, e)\n\tcase *map[int]uint64:\n\t\tfastpathTV.EncMapIntUint64V(*v, e)\n\tcase map[int]uintptr:\n\t\tfastpathTV.EncMapIntUintptrV(v, e)\n\tcase *map[int]uintptr:\n\t\tfastpathTV.EncMapIntUintptrV(*v, e)\n\tcase map[int]int:\n\t\tfastpathTV.EncMapIntIntV(v, e)\n\tcase *map[int]int:\n\t\tfastpathTV.EncMapIntIntV(*v, e)\n\tcase map[int]int64:\n\t\tfastpathTV.EncMapIntInt64V(v, e)\n\tcase *map[int]int64:\n\t\tfastpathTV.EncMapIntInt64V(*v, e)\n\tcase map[int]float32:\n\t\tfastpathTV.EncMapIntFloat32V(v, e)\n\tcase *map[int]float32:\n\t\tfastpathTV.EncMapIntFloat32V(*v, e)\n\tcase map[int]float64:\n\t\tfastpathTV.EncMapIntFloat64V(v, e)\n\tcase *map[int]float64:\n\t\tfastpathTV.EncMapIntFloat64V(*v, e)\n\tcase map[int]bool:\n\t\tfastpathTV.EncMapIntBoolV(v, e)\n\tcase *map[int]bool:\n\t\tfastpathTV.EncMapIntBoolV(*v, e)\n\tcase map[int64]interface{}:\n\t\tfastpathTV.EncMapInt64IntfV(v, e)\n\tcase *map[int64]interface{}:\n\t\tfastpathTV.EncMapInt64IntfV(*v, e)\n\tcase map[int64]string:\n\t\tfastpathTV.EncMapInt64StringV(v, e)\n\tcase *map[int64]string:\n\t\tfastpathTV.EncMapInt64StringV(*v, e)\n\tcase map[int64][]byte:\n\t\tfastpathTV.EncMapInt64BytesV(v, e)\n\tcase *map[int64][]byte:\n\t\tfastpathTV.EncMapInt64BytesV(*v, e)\n\tcase map[int64]uint:\n\t\tfastpathTV.EncMapInt64UintV(v, e)\n\tcase *map[int64]uint:\n\t\tfastpathTV.EncMapInt64UintV(*v, e)\n\tcase map[int64]uint8:\n\t\tfastpathTV.EncMapInt64Uint8V(v, e)\n\tcase *map[int64]uint8:\n\t\tfastpathTV.EncMapInt64Uint8V(*v, e)\n\tcase map[int64]uint64:\n\t\tfastpathTV.EncMapInt64Uint64V(v, e)\n\tcase *map[int64]uint64:\n\t\tfastpathTV.EncMapInt64Uint64V(*v, e)\n\tcase map[int64]uintptr:\n\t\tfastpathTV.EncMapInt64UintptrV(v, e)\n\tcase *map[int64]uintptr:\n\t\tfastpathTV.EncMapInt64UintptrV(*v, e)\n\tcase map[int64]int:\n\t\tfastpathTV.EncMapInt64IntV(v, e)\n\tcase *map[int64]int:\n\t\tfastpathTV.EncMapInt64IntV(*v, e)\n\tcase map[int64]int64:\n\t\tfastpathTV.EncMapInt64Int64V(v, e)\n\tcase *map[int64]int64:\n\t\tfastpathTV.EncMapInt64Int64V(*v, e)\n\tcase map[int64]float32:\n\t\tfastpathTV.EncMapInt64Float32V(v, e)\n\tcase *map[int64]float32:\n\t\tfastpathTV.EncMapInt64Float32V(*v, e)\n\tcase map[int64]float64:\n\t\tfastpathTV.EncMapInt64Float64V(v, e)\n\tcase *map[int64]float64:\n\t\tfastpathTV.EncMapInt64Float64V(*v, e)\n\tcase map[int64]bool:\n\t\tfastpathTV.EncMapInt64BoolV(v, e)\n\tcase *map[int64]bool:\n\t\tfastpathTV.EncMapInt64BoolV(*v, e)\n\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\n// -- -- fast path functions\n\nfunc (e *Encoder) fastpathEncSliceIntfR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceIntfV(rv2i(rv).([]interface{}), e)\n\t} else {\n\t\tfastpathTV.EncSliceIntfV(rv2i(rv).([]interface{}), e)\n\t}\n}\nfunc (fastpathT) EncSliceIntfV(v []interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.encode(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceIntfV(v []interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.encode(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceStringR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceStringV(rv2i(rv).([]string), e)\n\t} else {\n\t\tfastpathTV.EncSliceStringV(rv2i(rv).([]string), e)\n\t}\n}\nfunc (fastpathT) EncSliceStringV(v []string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\tif e.h.StringToRaw {\n\t\t\te.e.EncodeStringBytesRaw(bytesView(v[j]))\n\t\t} else {\n\t\t\te.e.EncodeStringEnc(cUTF8, v[j])\n\t\t}\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceStringV(v []string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[j]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[j])\n\t\t\t}\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceBytesR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceBytesV(rv2i(rv).([][]byte), e)\n\t} else {\n\t\tfastpathTV.EncSliceBytesV(rv2i(rv).([][]byte), e)\n\t}\n}\nfunc (fastpathT) EncSliceBytesV(v [][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeStringBytesRaw(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceBytesV(v [][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeStringBytesRaw(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceFloat32V(rv2i(rv).([]float32), e)\n\t} else {\n\t\tfastpathTV.EncSliceFloat32V(rv2i(rv).([]float32), e)\n\t}\n}\nfunc (fastpathT) EncSliceFloat32V(v []float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeFloat32(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceFloat32V(v []float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeFloat32(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceFloat64V(rv2i(rv).([]float64), e)\n\t} else {\n\t\tfastpathTV.EncSliceFloat64V(rv2i(rv).([]float64), e)\n\t}\n}\nfunc (fastpathT) EncSliceFloat64V(v []float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeFloat64(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceFloat64V(v []float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeFloat64(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUintR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUintV(rv2i(rv).([]uint), e)\n\t} else {\n\t\tfastpathTV.EncSliceUintV(rv2i(rv).([]uint), e)\n\t}\n}\nfunc (fastpathT) EncSliceUintV(v []uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeUint(uint64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUintV(v []uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeUint(uint64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUint8R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUint8V(rv2i(rv).([]uint8), e)\n\t} else {\n\t\tfastpathTV.EncSliceUint8V(rv2i(rv).([]uint8), e)\n\t}\n}\nfunc (fastpathT) EncSliceUint8V(v []uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeUint(uint64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUint8V(v []uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeUint(uint64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUint16R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUint16V(rv2i(rv).([]uint16), e)\n\t} else {\n\t\tfastpathTV.EncSliceUint16V(rv2i(rv).([]uint16), e)\n\t}\n}\nfunc (fastpathT) EncSliceUint16V(v []uint16, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeUint(uint64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUint16V(v []uint16, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeUint(uint64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUint32R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUint32V(rv2i(rv).([]uint32), e)\n\t} else {\n\t\tfastpathTV.EncSliceUint32V(rv2i(rv).([]uint32), e)\n\t}\n}\nfunc (fastpathT) EncSliceUint32V(v []uint32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeUint(uint64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUint32V(v []uint32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeUint(uint64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUint64R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUint64V(rv2i(rv).([]uint64), e)\n\t} else {\n\t\tfastpathTV.EncSliceUint64V(rv2i(rv).([]uint64), e)\n\t}\n}\nfunc (fastpathT) EncSliceUint64V(v []uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeUint(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUint64V(v []uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeUint(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceUintptrV(rv2i(rv).([]uintptr), e)\n\t} else {\n\t\tfastpathTV.EncSliceUintptrV(rv2i(rv).([]uintptr), e)\n\t}\n}\nfunc (fastpathT) EncSliceUintptrV(v []uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.encode(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceUintptrV(v []uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.encode(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceIntR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceIntV(rv2i(rv).([]int), e)\n\t} else {\n\t\tfastpathTV.EncSliceIntV(rv2i(rv).([]int), e)\n\t}\n}\nfunc (fastpathT) EncSliceIntV(v []int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeInt(int64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceIntV(v []int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeInt(int64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceInt8R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceInt8V(rv2i(rv).([]int8), e)\n\t} else {\n\t\tfastpathTV.EncSliceInt8V(rv2i(rv).([]int8), e)\n\t}\n}\nfunc (fastpathT) EncSliceInt8V(v []int8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeInt(int64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceInt8V(v []int8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeInt(int64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceInt16R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceInt16V(rv2i(rv).([]int16), e)\n\t} else {\n\t\tfastpathTV.EncSliceInt16V(rv2i(rv).([]int16), e)\n\t}\n}\nfunc (fastpathT) EncSliceInt16V(v []int16, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeInt(int64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceInt16V(v []int16, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeInt(int64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceInt32R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceInt32V(rv2i(rv).([]int32), e)\n\t} else {\n\t\tfastpathTV.EncSliceInt32V(rv2i(rv).([]int32), e)\n\t}\n}\nfunc (fastpathT) EncSliceInt32V(v []int32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeInt(int64(v[j]))\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceInt32V(v []int32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeInt(int64(v[j]))\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceInt64R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceInt64V(rv2i(rv).([]int64), e)\n\t} else {\n\t\tfastpathTV.EncSliceInt64V(rv2i(rv).([]int64), e)\n\t}\n}\nfunc (fastpathT) EncSliceInt64V(v []int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeInt(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceInt64V(v []int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeInt(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncSliceBoolR(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.EncAsMapSliceBoolV(rv2i(rv).([]bool), e)\n\t} else {\n\t\tfastpathTV.EncSliceBoolV(rv2i(rv).([]bool), e)\n\t}\n}\nfunc (fastpathT) EncSliceBoolV(v []bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\te.e.EncodeBool(v[j])\n\t}\n\te.arrayEnd()\n}\nfunc (fastpathT) EncAsMapSliceBoolV(v []bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t} else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\te.e.EncodeBool(v[j])\n\t\t}\n\t\te.mapEnd()\n\t}\n}\n\nfunc (e *Encoder) fastpathEncMapStringIntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringIntfV(rv2i(rv).(map[string]interface{}), e)\n}\nfunc (fastpathT) EncMapStringIntfV(v map[string]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringStringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringStringV(rv2i(rv).(map[string]string), e)\n}\nfunc (fastpathT) EncMapStringStringV(v map[string]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[k2]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[k2])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringBytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringBytesV(rv2i(rv).(map[string][]byte), e)\n}\nfunc (fastpathT) EncMapStringBytesV(v map[string][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringUintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringUintV(rv2i(rv).(map[string]uint), e)\n}\nfunc (fastpathT) EncMapStringUintV(v map[string]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringUint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringUint8V(rv2i(rv).(map[string]uint8), e)\n}\nfunc (fastpathT) EncMapStringUint8V(v map[string]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringUint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringUint64V(rv2i(rv).(map[string]uint64), e)\n}\nfunc (fastpathT) EncMapStringUint64V(v map[string]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringUintptrV(rv2i(rv).(map[string]uintptr), e)\n}\nfunc (fastpathT) EncMapStringUintptrV(v map[string]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringIntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringIntV(rv2i(rv).(map[string]int), e)\n}\nfunc (fastpathT) EncMapStringIntV(v map[string]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringInt64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringInt64V(rv2i(rv).(map[string]int64), e)\n}\nfunc (fastpathT) EncMapStringInt64V(v map[string]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringFloat32V(rv2i(rv).(map[string]float32), e)\n}\nfunc (fastpathT) EncMapStringFloat32V(v map[string]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringFloat64V(rv2i(rv).(map[string]float64), e)\n}\nfunc (fastpathT) EncMapStringFloat64V(v map[string]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapStringBoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapStringBoolV(rv2i(rv).(map[string]bool), e)\n}\nfunc (fastpathT) EncMapStringBoolV(v map[string]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]string, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(stringSlice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(k2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, k2)\n\t\t\t}\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintIntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintIntfV(rv2i(rv).(map[uint]interface{}), e)\n}\nfunc (fastpathT) EncMapUintIntfV(v map[uint]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintStringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintStringV(rv2i(rv).(map[uint]string), e)\n}\nfunc (fastpathT) EncMapUintStringV(v map[uint]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[uint(k2)]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[uint(k2)])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintBytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintBytesV(rv2i(rv).(map[uint][]byte), e)\n}\nfunc (fastpathT) EncMapUintBytesV(v map[uint][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintUintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintUintV(rv2i(rv).(map[uint]uint), e)\n}\nfunc (fastpathT) EncMapUintUintV(v map[uint]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[uint(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintUint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintUint8V(rv2i(rv).(map[uint]uint8), e)\n}\nfunc (fastpathT) EncMapUintUint8V(v map[uint]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[uint(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintUint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintUint64V(rv2i(rv).(map[uint]uint64), e)\n}\nfunc (fastpathT) EncMapUintUint64V(v map[uint]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintUintptrV(rv2i(rv).(map[uint]uintptr), e)\n}\nfunc (fastpathT) EncMapUintUintptrV(v map[uint]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintIntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintIntV(rv2i(rv).(map[uint]int), e)\n}\nfunc (fastpathT) EncMapUintIntV(v map[uint]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[uint(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintInt64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintInt64V(rv2i(rv).(map[uint]int64), e)\n}\nfunc (fastpathT) EncMapUintInt64V(v map[uint]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintFloat32V(rv2i(rv).(map[uint]float32), e)\n}\nfunc (fastpathT) EncMapUintFloat32V(v map[uint]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintFloat64V(rv2i(rv).(map[uint]float64), e)\n}\nfunc (fastpathT) EncMapUintFloat64V(v map[uint]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUintBoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUintBoolV(rv2i(rv).(map[uint]bool), e)\n}\nfunc (fastpathT) EncMapUintBoolV(v map[uint]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[uint(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8IntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8IntfV(rv2i(rv).(map[uint8]interface{}), e)\n}\nfunc (fastpathT) EncMapUint8IntfV(v map[uint8]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8StringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8StringV(rv2i(rv).(map[uint8]string), e)\n}\nfunc (fastpathT) EncMapUint8StringV(v map[uint8]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[uint8(k2)]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[uint8(k2)])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8BytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8BytesV(rv2i(rv).(map[uint8][]byte), e)\n}\nfunc (fastpathT) EncMapUint8BytesV(v map[uint8][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8UintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8UintV(rv2i(rv).(map[uint8]uint), e)\n}\nfunc (fastpathT) EncMapUint8UintV(v map[uint8]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[uint8(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8Uint8V(rv2i(rv).(map[uint8]uint8), e)\n}\nfunc (fastpathT) EncMapUint8Uint8V(v map[uint8]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[uint8(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8Uint64V(rv2i(rv).(map[uint8]uint64), e)\n}\nfunc (fastpathT) EncMapUint8Uint64V(v map[uint8]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8UintptrV(rv2i(rv).(map[uint8]uintptr), e)\n}\nfunc (fastpathT) EncMapUint8UintptrV(v map[uint8]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8IntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8IntV(rv2i(rv).(map[uint8]int), e)\n}\nfunc (fastpathT) EncMapUint8IntV(v map[uint8]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[uint8(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8Int64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8Int64V(rv2i(rv).(map[uint8]int64), e)\n}\nfunc (fastpathT) EncMapUint8Int64V(v map[uint8]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8Float32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8Float32V(rv2i(rv).(map[uint8]float32), e)\n}\nfunc (fastpathT) EncMapUint8Float32V(v map[uint8]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8Float64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8Float64V(rv2i(rv).(map[uint8]float64), e)\n}\nfunc (fastpathT) EncMapUint8Float64V(v map[uint8]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint8BoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint8BoolV(rv2i(rv).(map[uint8]bool), e)\n}\nfunc (fastpathT) EncMapUint8BoolV(v map[uint8]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = uint64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(uint8(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[uint8(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(uint64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64IntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64IntfV(rv2i(rv).(map[uint64]interface{}), e)\n}\nfunc (fastpathT) EncMapUint64IntfV(v map[uint64]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64StringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64StringV(rv2i(rv).(map[uint64]string), e)\n}\nfunc (fastpathT) EncMapUint64StringV(v map[uint64]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[k2]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[k2])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64BytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64BytesV(rv2i(rv).(map[uint64][]byte), e)\n}\nfunc (fastpathT) EncMapUint64BytesV(v map[uint64][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64UintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64UintV(rv2i(rv).(map[uint64]uint), e)\n}\nfunc (fastpathT) EncMapUint64UintV(v map[uint64]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64Uint8V(rv2i(rv).(map[uint64]uint8), e)\n}\nfunc (fastpathT) EncMapUint64Uint8V(v map[uint64]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64Uint64V(rv2i(rv).(map[uint64]uint64), e)\n}\nfunc (fastpathT) EncMapUint64Uint64V(v map[uint64]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64UintptrV(rv2i(rv).(map[uint64]uintptr), e)\n}\nfunc (fastpathT) EncMapUint64UintptrV(v map[uint64]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64IntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64IntV(rv2i(rv).(map[uint64]int), e)\n}\nfunc (fastpathT) EncMapUint64IntV(v map[uint64]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64Int64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64Int64V(rv2i(rv).(map[uint64]int64), e)\n}\nfunc (fastpathT) EncMapUint64Int64V(v map[uint64]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64Float32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64Float32V(rv2i(rv).(map[uint64]float32), e)\n}\nfunc (fastpathT) EncMapUint64Float32V(v map[uint64]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64Float64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64Float64V(rv2i(rv).(map[uint64]float64), e)\n}\nfunc (fastpathT) EncMapUint64Float64V(v map[uint64]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapUint64BoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapUint64BoolV(rv2i(rv).(map[uint64]bool), e)\n}\nfunc (fastpathT) EncMapUint64BoolV(v map[uint64]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]uint64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(uint64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeUint(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntIntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntIntfV(rv2i(rv).(map[int]interface{}), e)\n}\nfunc (fastpathT) EncMapIntIntfV(v map[int]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntStringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntStringV(rv2i(rv).(map[int]string), e)\n}\nfunc (fastpathT) EncMapIntStringV(v map[int]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[int(k2)]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[int(k2)])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntBytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntBytesV(rv2i(rv).(map[int][]byte), e)\n}\nfunc (fastpathT) EncMapIntBytesV(v map[int][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntUintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntUintV(rv2i(rv).(map[int]uint), e)\n}\nfunc (fastpathT) EncMapIntUintV(v map[int]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[int(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntUint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntUint8V(rv2i(rv).(map[int]uint8), e)\n}\nfunc (fastpathT) EncMapIntUint8V(v map[int]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[int(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntUint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntUint64V(rv2i(rv).(map[int]uint64), e)\n}\nfunc (fastpathT) EncMapIntUint64V(v map[int]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntUintptrV(rv2i(rv).(map[int]uintptr), e)\n}\nfunc (fastpathT) EncMapIntUintptrV(v map[int]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntIntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntIntV(rv2i(rv).(map[int]int), e)\n}\nfunc (fastpathT) EncMapIntIntV(v map[int]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[int(k2)]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntInt64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntInt64V(rv2i(rv).(map[int]int64), e)\n}\nfunc (fastpathT) EncMapIntInt64V(v map[int]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntFloat32V(rv2i(rv).(map[int]float32), e)\n}\nfunc (fastpathT) EncMapIntFloat32V(v map[int]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntFloat64V(rv2i(rv).(map[int]float64), e)\n}\nfunc (fastpathT) EncMapIntFloat64V(v map[int]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapIntBoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapIntBoolV(rv2i(rv).(map[int]bool), e)\n}\nfunc (fastpathT) EncMapIntBoolV(v map[int]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = int64(k)\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(int(k2)))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[int(k2)])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(int64(k2))\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64IntfR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64IntfV(rv2i(rv).(map[int64]interface{}), e)\n}\nfunc (fastpathT) EncMapInt64IntfV(v map[int64]interface{}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64StringR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64StringV(rv2i(rv).(map[int64]string), e)\n}\nfunc (fastpathT) EncMapInt64StringV(v map[int64]string, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v[k2]))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v[k2])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\tif e.h.StringToRaw {\n\t\t\t\te.e.EncodeStringBytesRaw(bytesView(v2))\n\t\t\t} else {\n\t\t\t\te.e.EncodeStringEnc(cUTF8, v2)\n\t\t\t}\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64BytesR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64BytesV(rv2i(rv).(map[int64][]byte), e)\n}\nfunc (fastpathT) EncMapInt64BytesV(v map[int64][]byte, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeStringBytesRaw(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64UintR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64UintV(rv2i(rv).(map[int64]uint), e)\n}\nfunc (fastpathT) EncMapInt64UintV(v map[int64]uint, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64Uint8V(rv2i(rv).(map[int64]uint8), e)\n}\nfunc (fastpathT) EncMapInt64Uint8V(v map[int64]uint8, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(uint64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64Uint64V(rv2i(rv).(map[int64]uint64), e)\n}\nfunc (fastpathT) EncMapInt64Uint64V(v map[int64]uint64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeUint(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64UintptrV(rv2i(rv).(map[int64]uintptr), e)\n}\nfunc (fastpathT) EncMapInt64UintptrV(v map[int64]uintptr, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64IntR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64IntV(rv2i(rv).(map[int64]int), e)\n}\nfunc (fastpathT) EncMapInt64IntV(v map[int64]int, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v[k2]))\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(int64(v2))\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64Int64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64Int64V(rv2i(rv).(map[int64]int64), e)\n}\nfunc (fastpathT) EncMapInt64Int64V(v map[int64]int64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeInt(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64Float32R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64Float32V(rv2i(rv).(map[int64]float32), e)\n}\nfunc (fastpathT) EncMapInt64Float32V(v map[int64]float32, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat32(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64Float64R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64Float64V(rv2i(rv).(map[int64]float64), e)\n}\nfunc (fastpathT) EncMapInt64Float64V(v map[int64]float64, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeFloat64(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\nfunc (e *Encoder) fastpathEncMapInt64BoolR(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.EncMapInt64BoolV(rv2i(rv).(map[int64]bool), e)\n}\nfunc (fastpathT) EncMapInt64BoolV(v map[int64]bool, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.mapStart(len(v))\n\tif e.h.Canonical {\n\t\tv2 := make([]int64, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = k\n\t\t\ti++\n\t\t}\n\t\tsort.Sort(int64Slice(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v[k2])\n\t\t}\n\t} else {\n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\te.e.EncodeInt(k2)\n\t\t\te.mapElemValue()\n\t\t\te.e.EncodeBool(v2)\n\t\t}\n\t}\n\te.mapEnd()\n}\n\n// -- decode\n\n// -- -- fast path type switch\nfunc fastpathDecodeTypeSwitch(iv interface{}, d *Decoder) bool {\n\tvar changed bool\n\tswitch v := iv.(type) {\n\n\tcase []interface{}:\n\t\tvar v2 []interface{}\n\t\tv2, changed = fastpathTV.DecSliceIntfV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]interface{}:\n\t\tvar v2 []interface{}\n\t\tv2, changed = fastpathTV.DecSliceIntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []string:\n\t\tvar v2 []string\n\t\tv2, changed = fastpathTV.DecSliceStringV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]string:\n\t\tvar v2 []string\n\t\tv2, changed = fastpathTV.DecSliceStringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase [][]byte:\n\t\tvar v2 [][]byte\n\t\tv2, changed = fastpathTV.DecSliceBytesV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[][]byte:\n\t\tvar v2 [][]byte\n\t\tv2, changed = fastpathTV.DecSliceBytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []float32:\n\t\tvar v2 []float32\n\t\tv2, changed = fastpathTV.DecSliceFloat32V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]float32:\n\t\tvar v2 []float32\n\t\tv2, changed = fastpathTV.DecSliceFloat32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []float64:\n\t\tvar v2 []float64\n\t\tv2, changed = fastpathTV.DecSliceFloat64V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]float64:\n\t\tvar v2 []float64\n\t\tv2, changed = fastpathTV.DecSliceFloat64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []uint:\n\t\tvar v2 []uint\n\t\tv2, changed = fastpathTV.DecSliceUintV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]uint:\n\t\tvar v2 []uint\n\t\tv2, changed = fastpathTV.DecSliceUintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []uint16:\n\t\tvar v2 []uint16\n\t\tv2, changed = fastpathTV.DecSliceUint16V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]uint16:\n\t\tvar v2 []uint16\n\t\tv2, changed = fastpathTV.DecSliceUint16V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []uint32:\n\t\tvar v2 []uint32\n\t\tv2, changed = fastpathTV.DecSliceUint32V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]uint32:\n\t\tvar v2 []uint32\n\t\tv2, changed = fastpathTV.DecSliceUint32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []uint64:\n\t\tvar v2 []uint64\n\t\tv2, changed = fastpathTV.DecSliceUint64V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]uint64:\n\t\tvar v2 []uint64\n\t\tv2, changed = fastpathTV.DecSliceUint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []uintptr:\n\t\tvar v2 []uintptr\n\t\tv2, changed = fastpathTV.DecSliceUintptrV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]uintptr:\n\t\tvar v2 []uintptr\n\t\tv2, changed = fastpathTV.DecSliceUintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []int:\n\t\tvar v2 []int\n\t\tv2, changed = fastpathTV.DecSliceIntV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]int:\n\t\tvar v2 []int\n\t\tv2, changed = fastpathTV.DecSliceIntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []int8:\n\t\tvar v2 []int8\n\t\tv2, changed = fastpathTV.DecSliceInt8V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]int8:\n\t\tvar v2 []int8\n\t\tv2, changed = fastpathTV.DecSliceInt8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []int16:\n\t\tvar v2 []int16\n\t\tv2, changed = fastpathTV.DecSliceInt16V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]int16:\n\t\tvar v2 []int16\n\t\tv2, changed = fastpathTV.DecSliceInt16V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []int32:\n\t\tvar v2 []int32\n\t\tv2, changed = fastpathTV.DecSliceInt32V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]int32:\n\t\tvar v2 []int32\n\t\tv2, changed = fastpathTV.DecSliceInt32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []int64:\n\t\tvar v2 []int64\n\t\tv2, changed = fastpathTV.DecSliceInt64V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]int64:\n\t\tvar v2 []int64\n\t\tv2, changed = fastpathTV.DecSliceInt64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase []bool:\n\t\tvar v2 []bool\n\t\tv2, changed = fastpathTV.DecSliceBoolV(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]bool:\n\t\tvar v2 []bool\n\t\tv2, changed = fastpathTV.DecSliceBoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\n\tcase map[string]interface{}:\n\t\tfastpathTV.DecMapStringIntfV(v, false, d)\n\tcase *map[string]interface{}:\n\t\tvar v2 map[string]interface{}\n\t\tv2, changed = fastpathTV.DecMapStringIntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]string:\n\t\tfastpathTV.DecMapStringStringV(v, false, d)\n\tcase *map[string]string:\n\t\tvar v2 map[string]string\n\t\tv2, changed = fastpathTV.DecMapStringStringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string][]byte:\n\t\tfastpathTV.DecMapStringBytesV(v, false, d)\n\tcase *map[string][]byte:\n\t\tvar v2 map[string][]byte\n\t\tv2, changed = fastpathTV.DecMapStringBytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]uint:\n\t\tfastpathTV.DecMapStringUintV(v, false, d)\n\tcase *map[string]uint:\n\t\tvar v2 map[string]uint\n\t\tv2, changed = fastpathTV.DecMapStringUintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]uint8:\n\t\tfastpathTV.DecMapStringUint8V(v, false, d)\n\tcase *map[string]uint8:\n\t\tvar v2 map[string]uint8\n\t\tv2, changed = fastpathTV.DecMapStringUint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]uint64:\n\t\tfastpathTV.DecMapStringUint64V(v, false, d)\n\tcase *map[string]uint64:\n\t\tvar v2 map[string]uint64\n\t\tv2, changed = fastpathTV.DecMapStringUint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]uintptr:\n\t\tfastpathTV.DecMapStringUintptrV(v, false, d)\n\tcase *map[string]uintptr:\n\t\tvar v2 map[string]uintptr\n\t\tv2, changed = fastpathTV.DecMapStringUintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]int:\n\t\tfastpathTV.DecMapStringIntV(v, false, d)\n\tcase *map[string]int:\n\t\tvar v2 map[string]int\n\t\tv2, changed = fastpathTV.DecMapStringIntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]int64:\n\t\tfastpathTV.DecMapStringInt64V(v, false, d)\n\tcase *map[string]int64:\n\t\tvar v2 map[string]int64\n\t\tv2, changed = fastpathTV.DecMapStringInt64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]float32:\n\t\tfastpathTV.DecMapStringFloat32V(v, false, d)\n\tcase *map[string]float32:\n\t\tvar v2 map[string]float32\n\t\tv2, changed = fastpathTV.DecMapStringFloat32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]float64:\n\t\tfastpathTV.DecMapStringFloat64V(v, false, d)\n\tcase *map[string]float64:\n\t\tvar v2 map[string]float64\n\t\tv2, changed = fastpathTV.DecMapStringFloat64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[string]bool:\n\t\tfastpathTV.DecMapStringBoolV(v, false, d)\n\tcase *map[string]bool:\n\t\tvar v2 map[string]bool\n\t\tv2, changed = fastpathTV.DecMapStringBoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]interface{}:\n\t\tfastpathTV.DecMapUintIntfV(v, false, d)\n\tcase *map[uint]interface{}:\n\t\tvar v2 map[uint]interface{}\n\t\tv2, changed = fastpathTV.DecMapUintIntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]string:\n\t\tfastpathTV.DecMapUintStringV(v, false, d)\n\tcase *map[uint]string:\n\t\tvar v2 map[uint]string\n\t\tv2, changed = fastpathTV.DecMapUintStringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint][]byte:\n\t\tfastpathTV.DecMapUintBytesV(v, false, d)\n\tcase *map[uint][]byte:\n\t\tvar v2 map[uint][]byte\n\t\tv2, changed = fastpathTV.DecMapUintBytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]uint:\n\t\tfastpathTV.DecMapUintUintV(v, false, d)\n\tcase *map[uint]uint:\n\t\tvar v2 map[uint]uint\n\t\tv2, changed = fastpathTV.DecMapUintUintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]uint8:\n\t\tfastpathTV.DecMapUintUint8V(v, false, d)\n\tcase *map[uint]uint8:\n\t\tvar v2 map[uint]uint8\n\t\tv2, changed = fastpathTV.DecMapUintUint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]uint64:\n\t\tfastpathTV.DecMapUintUint64V(v, false, d)\n\tcase *map[uint]uint64:\n\t\tvar v2 map[uint]uint64\n\t\tv2, changed = fastpathTV.DecMapUintUint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]uintptr:\n\t\tfastpathTV.DecMapUintUintptrV(v, false, d)\n\tcase *map[uint]uintptr:\n\t\tvar v2 map[uint]uintptr\n\t\tv2, changed = fastpathTV.DecMapUintUintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]int:\n\t\tfastpathTV.DecMapUintIntV(v, false, d)\n\tcase *map[uint]int:\n\t\tvar v2 map[uint]int\n\t\tv2, changed = fastpathTV.DecMapUintIntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]int64:\n\t\tfastpathTV.DecMapUintInt64V(v, false, d)\n\tcase *map[uint]int64:\n\t\tvar v2 map[uint]int64\n\t\tv2, changed = fastpathTV.DecMapUintInt64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]float32:\n\t\tfastpathTV.DecMapUintFloat32V(v, false, d)\n\tcase *map[uint]float32:\n\t\tvar v2 map[uint]float32\n\t\tv2, changed = fastpathTV.DecMapUintFloat32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]float64:\n\t\tfastpathTV.DecMapUintFloat64V(v, false, d)\n\tcase *map[uint]float64:\n\t\tvar v2 map[uint]float64\n\t\tv2, changed = fastpathTV.DecMapUintFloat64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint]bool:\n\t\tfastpathTV.DecMapUintBoolV(v, false, d)\n\tcase *map[uint]bool:\n\t\tvar v2 map[uint]bool\n\t\tv2, changed = fastpathTV.DecMapUintBoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]interface{}:\n\t\tfastpathTV.DecMapUint8IntfV(v, false, d)\n\tcase *map[uint8]interface{}:\n\t\tvar v2 map[uint8]interface{}\n\t\tv2, changed = fastpathTV.DecMapUint8IntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]string:\n\t\tfastpathTV.DecMapUint8StringV(v, false, d)\n\tcase *map[uint8]string:\n\t\tvar v2 map[uint8]string\n\t\tv2, changed = fastpathTV.DecMapUint8StringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8][]byte:\n\t\tfastpathTV.DecMapUint8BytesV(v, false, d)\n\tcase *map[uint8][]byte:\n\t\tvar v2 map[uint8][]byte\n\t\tv2, changed = fastpathTV.DecMapUint8BytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]uint:\n\t\tfastpathTV.DecMapUint8UintV(v, false, d)\n\tcase *map[uint8]uint:\n\t\tvar v2 map[uint8]uint\n\t\tv2, changed = fastpathTV.DecMapUint8UintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]uint8:\n\t\tfastpathTV.DecMapUint8Uint8V(v, false, d)\n\tcase *map[uint8]uint8:\n\t\tvar v2 map[uint8]uint8\n\t\tv2, changed = fastpathTV.DecMapUint8Uint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]uint64:\n\t\tfastpathTV.DecMapUint8Uint64V(v, false, d)\n\tcase *map[uint8]uint64:\n\t\tvar v2 map[uint8]uint64\n\t\tv2, changed = fastpathTV.DecMapUint8Uint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]uintptr:\n\t\tfastpathTV.DecMapUint8UintptrV(v, false, d)\n\tcase *map[uint8]uintptr:\n\t\tvar v2 map[uint8]uintptr\n\t\tv2, changed = fastpathTV.DecMapUint8UintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]int:\n\t\tfastpathTV.DecMapUint8IntV(v, false, d)\n\tcase *map[uint8]int:\n\t\tvar v2 map[uint8]int\n\t\tv2, changed = fastpathTV.DecMapUint8IntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]int64:\n\t\tfastpathTV.DecMapUint8Int64V(v, false, d)\n\tcase *map[uint8]int64:\n\t\tvar v2 map[uint8]int64\n\t\tv2, changed = fastpathTV.DecMapUint8Int64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]float32:\n\t\tfastpathTV.DecMapUint8Float32V(v, false, d)\n\tcase *map[uint8]float32:\n\t\tvar v2 map[uint8]float32\n\t\tv2, changed = fastpathTV.DecMapUint8Float32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]float64:\n\t\tfastpathTV.DecMapUint8Float64V(v, false, d)\n\tcase *map[uint8]float64:\n\t\tvar v2 map[uint8]float64\n\t\tv2, changed = fastpathTV.DecMapUint8Float64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint8]bool:\n\t\tfastpathTV.DecMapUint8BoolV(v, false, d)\n\tcase *map[uint8]bool:\n\t\tvar v2 map[uint8]bool\n\t\tv2, changed = fastpathTV.DecMapUint8BoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]interface{}:\n\t\tfastpathTV.DecMapUint64IntfV(v, false, d)\n\tcase *map[uint64]interface{}:\n\t\tvar v2 map[uint64]interface{}\n\t\tv2, changed = fastpathTV.DecMapUint64IntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]string:\n\t\tfastpathTV.DecMapUint64StringV(v, false, d)\n\tcase *map[uint64]string:\n\t\tvar v2 map[uint64]string\n\t\tv2, changed = fastpathTV.DecMapUint64StringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64][]byte:\n\t\tfastpathTV.DecMapUint64BytesV(v, false, d)\n\tcase *map[uint64][]byte:\n\t\tvar v2 map[uint64][]byte\n\t\tv2, changed = fastpathTV.DecMapUint64BytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]uint:\n\t\tfastpathTV.DecMapUint64UintV(v, false, d)\n\tcase *map[uint64]uint:\n\t\tvar v2 map[uint64]uint\n\t\tv2, changed = fastpathTV.DecMapUint64UintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]uint8:\n\t\tfastpathTV.DecMapUint64Uint8V(v, false, d)\n\tcase *map[uint64]uint8:\n\t\tvar v2 map[uint64]uint8\n\t\tv2, changed = fastpathTV.DecMapUint64Uint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]uint64:\n\t\tfastpathTV.DecMapUint64Uint64V(v, false, d)\n\tcase *map[uint64]uint64:\n\t\tvar v2 map[uint64]uint64\n\t\tv2, changed = fastpathTV.DecMapUint64Uint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]uintptr:\n\t\tfastpathTV.DecMapUint64UintptrV(v, false, d)\n\tcase *map[uint64]uintptr:\n\t\tvar v2 map[uint64]uintptr\n\t\tv2, changed = fastpathTV.DecMapUint64UintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]int:\n\t\tfastpathTV.DecMapUint64IntV(v, false, d)\n\tcase *map[uint64]int:\n\t\tvar v2 map[uint64]int\n\t\tv2, changed = fastpathTV.DecMapUint64IntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]int64:\n\t\tfastpathTV.DecMapUint64Int64V(v, false, d)\n\tcase *map[uint64]int64:\n\t\tvar v2 map[uint64]int64\n\t\tv2, changed = fastpathTV.DecMapUint64Int64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]float32:\n\t\tfastpathTV.DecMapUint64Float32V(v, false, d)\n\tcase *map[uint64]float32:\n\t\tvar v2 map[uint64]float32\n\t\tv2, changed = fastpathTV.DecMapUint64Float32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]float64:\n\t\tfastpathTV.DecMapUint64Float64V(v, false, d)\n\tcase *map[uint64]float64:\n\t\tvar v2 map[uint64]float64\n\t\tv2, changed = fastpathTV.DecMapUint64Float64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[uint64]bool:\n\t\tfastpathTV.DecMapUint64BoolV(v, false, d)\n\tcase *map[uint64]bool:\n\t\tvar v2 map[uint64]bool\n\t\tv2, changed = fastpathTV.DecMapUint64BoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]interface{}:\n\t\tfastpathTV.DecMapIntIntfV(v, false, d)\n\tcase *map[int]interface{}:\n\t\tvar v2 map[int]interface{}\n\t\tv2, changed = fastpathTV.DecMapIntIntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]string:\n\t\tfastpathTV.DecMapIntStringV(v, false, d)\n\tcase *map[int]string:\n\t\tvar v2 map[int]string\n\t\tv2, changed = fastpathTV.DecMapIntStringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int][]byte:\n\t\tfastpathTV.DecMapIntBytesV(v, false, d)\n\tcase *map[int][]byte:\n\t\tvar v2 map[int][]byte\n\t\tv2, changed = fastpathTV.DecMapIntBytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]uint:\n\t\tfastpathTV.DecMapIntUintV(v, false, d)\n\tcase *map[int]uint:\n\t\tvar v2 map[int]uint\n\t\tv2, changed = fastpathTV.DecMapIntUintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]uint8:\n\t\tfastpathTV.DecMapIntUint8V(v, false, d)\n\tcase *map[int]uint8:\n\t\tvar v2 map[int]uint8\n\t\tv2, changed = fastpathTV.DecMapIntUint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]uint64:\n\t\tfastpathTV.DecMapIntUint64V(v, false, d)\n\tcase *map[int]uint64:\n\t\tvar v2 map[int]uint64\n\t\tv2, changed = fastpathTV.DecMapIntUint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]uintptr:\n\t\tfastpathTV.DecMapIntUintptrV(v, false, d)\n\tcase *map[int]uintptr:\n\t\tvar v2 map[int]uintptr\n\t\tv2, changed = fastpathTV.DecMapIntUintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]int:\n\t\tfastpathTV.DecMapIntIntV(v, false, d)\n\tcase *map[int]int:\n\t\tvar v2 map[int]int\n\t\tv2, changed = fastpathTV.DecMapIntIntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]int64:\n\t\tfastpathTV.DecMapIntInt64V(v, false, d)\n\tcase *map[int]int64:\n\t\tvar v2 map[int]int64\n\t\tv2, changed = fastpathTV.DecMapIntInt64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]float32:\n\t\tfastpathTV.DecMapIntFloat32V(v, false, d)\n\tcase *map[int]float32:\n\t\tvar v2 map[int]float32\n\t\tv2, changed = fastpathTV.DecMapIntFloat32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]float64:\n\t\tfastpathTV.DecMapIntFloat64V(v, false, d)\n\tcase *map[int]float64:\n\t\tvar v2 map[int]float64\n\t\tv2, changed = fastpathTV.DecMapIntFloat64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int]bool:\n\t\tfastpathTV.DecMapIntBoolV(v, false, d)\n\tcase *map[int]bool:\n\t\tvar v2 map[int]bool\n\t\tv2, changed = fastpathTV.DecMapIntBoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]interface{}:\n\t\tfastpathTV.DecMapInt64IntfV(v, false, d)\n\tcase *map[int64]interface{}:\n\t\tvar v2 map[int64]interface{}\n\t\tv2, changed = fastpathTV.DecMapInt64IntfV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]string:\n\t\tfastpathTV.DecMapInt64StringV(v, false, d)\n\tcase *map[int64]string:\n\t\tvar v2 map[int64]string\n\t\tv2, changed = fastpathTV.DecMapInt64StringV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64][]byte:\n\t\tfastpathTV.DecMapInt64BytesV(v, false, d)\n\tcase *map[int64][]byte:\n\t\tvar v2 map[int64][]byte\n\t\tv2, changed = fastpathTV.DecMapInt64BytesV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]uint:\n\t\tfastpathTV.DecMapInt64UintV(v, false, d)\n\tcase *map[int64]uint:\n\t\tvar v2 map[int64]uint\n\t\tv2, changed = fastpathTV.DecMapInt64UintV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]uint8:\n\t\tfastpathTV.DecMapInt64Uint8V(v, false, d)\n\tcase *map[int64]uint8:\n\t\tvar v2 map[int64]uint8\n\t\tv2, changed = fastpathTV.DecMapInt64Uint8V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]uint64:\n\t\tfastpathTV.DecMapInt64Uint64V(v, false, d)\n\tcase *map[int64]uint64:\n\t\tvar v2 map[int64]uint64\n\t\tv2, changed = fastpathTV.DecMapInt64Uint64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]uintptr:\n\t\tfastpathTV.DecMapInt64UintptrV(v, false, d)\n\tcase *map[int64]uintptr:\n\t\tvar v2 map[int64]uintptr\n\t\tv2, changed = fastpathTV.DecMapInt64UintptrV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]int:\n\t\tfastpathTV.DecMapInt64IntV(v, false, d)\n\tcase *map[int64]int:\n\t\tvar v2 map[int64]int\n\t\tv2, changed = fastpathTV.DecMapInt64IntV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]int64:\n\t\tfastpathTV.DecMapInt64Int64V(v, false, d)\n\tcase *map[int64]int64:\n\t\tvar v2 map[int64]int64\n\t\tv2, changed = fastpathTV.DecMapInt64Int64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]float32:\n\t\tfastpathTV.DecMapInt64Float32V(v, false, d)\n\tcase *map[int64]float32:\n\t\tvar v2 map[int64]float32\n\t\tv2, changed = fastpathTV.DecMapInt64Float32V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]float64:\n\t\tfastpathTV.DecMapInt64Float64V(v, false, d)\n\tcase *map[int64]float64:\n\t\tvar v2 map[int64]float64\n\t\tv2, changed = fastpathTV.DecMapInt64Float64V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tcase map[int64]bool:\n\t\tfastpathTV.DecMapInt64BoolV(v, false, d)\n\tcase *map[int64]bool:\n\t\tvar v2 map[int64]bool\n\t\tv2, changed = fastpathTV.DecMapInt64BoolV(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2\n\t\t}\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\nfunc fastpathDecodeSetZeroTypeSwitch(iv interface{}) bool {\n\tswitch v := iv.(type) {\n\n\tcase *[]interface{}:\n\t\t*v = nil\n\tcase *[]string:\n\t\t*v = nil\n\tcase *[][]byte:\n\t\t*v = nil\n\tcase *[]float32:\n\t\t*v = nil\n\tcase *[]float64:\n\t\t*v = nil\n\tcase *[]uint:\n\t\t*v = nil\n\tcase *[]uint8:\n\t\t*v = nil\n\tcase *[]uint16:\n\t\t*v = nil\n\tcase *[]uint32:\n\t\t*v = nil\n\tcase *[]uint64:\n\t\t*v = nil\n\tcase *[]uintptr:\n\t\t*v = nil\n\tcase *[]int:\n\t\t*v = nil\n\tcase *[]int8:\n\t\t*v = nil\n\tcase *[]int16:\n\t\t*v = nil\n\tcase *[]int32:\n\t\t*v = nil\n\tcase *[]int64:\n\t\t*v = nil\n\tcase *[]bool:\n\t\t*v = nil\n\n\tcase *map[string]interface{}:\n\t\t*v = nil\n\tcase *map[string]string:\n\t\t*v = nil\n\tcase *map[string][]byte:\n\t\t*v = nil\n\tcase *map[string]uint:\n\t\t*v = nil\n\tcase *map[string]uint8:\n\t\t*v = nil\n\tcase *map[string]uint64:\n\t\t*v = nil\n\tcase *map[string]uintptr:\n\t\t*v = nil\n\tcase *map[string]int:\n\t\t*v = nil\n\tcase *map[string]int64:\n\t\t*v = nil\n\tcase *map[string]float32:\n\t\t*v = nil\n\tcase *map[string]float64:\n\t\t*v = nil\n\tcase *map[string]bool:\n\t\t*v = nil\n\tcase *map[uint]interface{}:\n\t\t*v = nil\n\tcase *map[uint]string:\n\t\t*v = nil\n\tcase *map[uint][]byte:\n\t\t*v = nil\n\tcase *map[uint]uint:\n\t\t*v = nil\n\tcase *map[uint]uint8:\n\t\t*v = nil\n\tcase *map[uint]uint64:\n\t\t*v = nil\n\tcase *map[uint]uintptr:\n\t\t*v = nil\n\tcase *map[uint]int:\n\t\t*v = nil\n\tcase *map[uint]int64:\n\t\t*v = nil\n\tcase *map[uint]float32:\n\t\t*v = nil\n\tcase *map[uint]float64:\n\t\t*v = nil\n\tcase *map[uint]bool:\n\t\t*v = nil\n\tcase *map[uint8]interface{}:\n\t\t*v = nil\n\tcase *map[uint8]string:\n\t\t*v = nil\n\tcase *map[uint8][]byte:\n\t\t*v = nil\n\tcase *map[uint8]uint:\n\t\t*v = nil\n\tcase *map[uint8]uint8:\n\t\t*v = nil\n\tcase *map[uint8]uint64:\n\t\t*v = nil\n\tcase *map[uint8]uintptr:\n\t\t*v = nil\n\tcase *map[uint8]int:\n\t\t*v = nil\n\tcase *map[uint8]int64:\n\t\t*v = nil\n\tcase *map[uint8]float32:\n\t\t*v = nil\n\tcase *map[uint8]float64:\n\t\t*v = nil\n\tcase *map[uint8]bool:\n\t\t*v = nil\n\tcase *map[uint64]interface{}:\n\t\t*v = nil\n\tcase *map[uint64]string:\n\t\t*v = nil\n\tcase *map[uint64][]byte:\n\t\t*v = nil\n\tcase *map[uint64]uint:\n\t\t*v = nil\n\tcase *map[uint64]uint8:\n\t\t*v = nil\n\tcase *map[uint64]uint64:\n\t\t*v = nil\n\tcase *map[uint64]uintptr:\n\t\t*v = nil\n\tcase *map[uint64]int:\n\t\t*v = nil\n\tcase *map[uint64]int64:\n\t\t*v = nil\n\tcase *map[uint64]float32:\n\t\t*v = nil\n\tcase *map[uint64]float64:\n\t\t*v = nil\n\tcase *map[uint64]bool:\n\t\t*v = nil\n\tcase *map[int]interface{}:\n\t\t*v = nil\n\tcase *map[int]string:\n\t\t*v = nil\n\tcase *map[int][]byte:\n\t\t*v = nil\n\tcase *map[int]uint:\n\t\t*v = nil\n\tcase *map[int]uint8:\n\t\t*v = nil\n\tcase *map[int]uint64:\n\t\t*v = nil\n\tcase *map[int]uintptr:\n\t\t*v = nil\n\tcase *map[int]int:\n\t\t*v = nil\n\tcase *map[int]int64:\n\t\t*v = nil\n\tcase *map[int]float32:\n\t\t*v = nil\n\tcase *map[int]float64:\n\t\t*v = nil\n\tcase *map[int]bool:\n\t\t*v = nil\n\tcase *map[int64]interface{}:\n\t\t*v = nil\n\tcase *map[int64]string:\n\t\t*v = nil\n\tcase *map[int64][]byte:\n\t\t*v = nil\n\tcase *map[int64]uint:\n\t\t*v = nil\n\tcase *map[int64]uint8:\n\t\t*v = nil\n\tcase *map[int64]uint64:\n\t\t*v = nil\n\tcase *map[int64]uintptr:\n\t\t*v = nil\n\tcase *map[int64]int:\n\t\t*v = nil\n\tcase *map[int64]int64:\n\t\t*v = nil\n\tcase *map[int64]float32:\n\t\t*v = nil\n\tcase *map[int64]float64:\n\t\t*v = nil\n\tcase *map[int64]bool:\n\t\t*v = nil\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\n// -- -- fast path functions\n\nfunc (d *Decoder) fastpathDecSliceIntfR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]interface{})\n\t\tif v, changed := fastpathTV.DecSliceIntfV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]interface{})\n\t\tv2, changed := fastpathTV.DecSliceIntfV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceIntfX(vp *[]interface{}, d *Decoder) {\n\tif v, changed := f.DecSliceIntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceIntfV(v []interface{}, canChange bool, d *Decoder) (_ []interface{}, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []interface{}{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 16)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]interface{}, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 16)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]interface{}, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, nil)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = nil\n\t\t} else {\n\t\t\td.decode(&v[uint(j)])\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]interface{}, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceStringR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]string)\n\t\tif v, changed := fastpathTV.DecSliceStringV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]string)\n\t\tv2, changed := fastpathTV.DecSliceStringV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceStringX(vp *[]string, d *Decoder) {\n\tif v, changed := f.DecSliceStringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceStringV(v []string, canChange bool, d *Decoder) (_ []string, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []string{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 16)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]string, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 16)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]string, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, \"\")\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = \"\"\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeString()\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]string, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceBytesR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[][]byte)\n\t\tif v, changed := fastpathTV.DecSliceBytesV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([][]byte)\n\t\tv2, changed := fastpathTV.DecSliceBytesV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceBytesX(vp *[][]byte, d *Decoder) {\n\tif v, changed := f.DecSliceBytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceBytesV(v [][]byte, canChange bool, d *Decoder) (_ [][]byte, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = [][]byte{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 24)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([][]byte, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 24)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([][]byte, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, nil)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = nil\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeBytes(nil, false)\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([][]byte, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]float32)\n\t\tif v, changed := fastpathTV.DecSliceFloat32V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]float32)\n\t\tv2, changed := fastpathTV.DecSliceFloat32V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceFloat32X(vp *[]float32, d *Decoder) {\n\tif v, changed := f.DecSliceFloat32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceFloat32V(v []float32, canChange bool, d *Decoder) (_ []float32, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []float32{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]float32, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]float32, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = float32(d.decodeFloat32())\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]float32, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]float64)\n\t\tif v, changed := fastpathTV.DecSliceFloat64V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]float64)\n\t\tv2, changed := fastpathTV.DecSliceFloat64V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceFloat64X(vp *[]float64, d *Decoder) {\n\tif v, changed := f.DecSliceFloat64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceFloat64V(v []float64, canChange bool, d *Decoder) (_ []float64, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []float64{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]float64, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]float64, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeFloat64()\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]float64, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUintR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uint)\n\t\tif v, changed := fastpathTV.DecSliceUintV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uint)\n\t\tv2, changed := fastpathTV.DecSliceUintV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUintX(vp *[]uint, d *Decoder) {\n\tif v, changed := f.DecSliceUintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUintV(v []uint, canChange bool, d *Decoder) (_ []uint, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uint{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uint, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uint, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uint, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUint8R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uint8)\n\t\tif v, changed := fastpathTV.DecSliceUint8V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uint8)\n\t\tv2, changed := fastpathTV.DecSliceUint8V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUint8X(vp *[]uint8, d *Decoder) {\n\tif v, changed := f.DecSliceUint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUint8V(v []uint8, canChange bool, d *Decoder) (_ []uint8, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uint8{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uint8, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uint8, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uint8, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUint16R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uint16)\n\t\tif v, changed := fastpathTV.DecSliceUint16V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uint16)\n\t\tv2, changed := fastpathTV.DecSliceUint16V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUint16X(vp *[]uint16, d *Decoder) {\n\tif v, changed := f.DecSliceUint16V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUint16V(v []uint16, canChange bool, d *Decoder) (_ []uint16, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uint16{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 2)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uint16, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 2)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uint16, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = uint16(chkOvf.UintV(d.d.DecodeUint64(), 16))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uint16, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUint32R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uint32)\n\t\tif v, changed := fastpathTV.DecSliceUint32V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uint32)\n\t\tv2, changed := fastpathTV.DecSliceUint32V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUint32X(vp *[]uint32, d *Decoder) {\n\tif v, changed := f.DecSliceUint32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUint32V(v []uint32, canChange bool, d *Decoder) (_ []uint32, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uint32{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uint32, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uint32, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = uint32(chkOvf.UintV(d.d.DecodeUint64(), 32))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uint32, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUint64R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uint64)\n\t\tif v, changed := fastpathTV.DecSliceUint64V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uint64)\n\t\tv2, changed := fastpathTV.DecSliceUint64V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUint64X(vp *[]uint64, d *Decoder) {\n\tif v, changed := f.DecSliceUint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUint64V(v []uint64, canChange bool, d *Decoder) (_ []uint64, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uint64{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uint64, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uint64, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeUint64()\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uint64, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]uintptr)\n\t\tif v, changed := fastpathTV.DecSliceUintptrV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]uintptr)\n\t\tv2, changed := fastpathTV.DecSliceUintptrV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceUintptrX(vp *[]uintptr, d *Decoder) {\n\tif v, changed := f.DecSliceUintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceUintptrV(v []uintptr, canChange bool, d *Decoder) (_ []uintptr, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []uintptr{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]uintptr, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]uintptr, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]uintptr, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceIntR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]int)\n\t\tif v, changed := fastpathTV.DecSliceIntV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]int)\n\t\tv2, changed := fastpathTV.DecSliceIntV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceIntX(vp *[]int, d *Decoder) {\n\tif v, changed := f.DecSliceIntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceIntV(v []int, canChange bool, d *Decoder) (_ []int, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []int{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]int, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]int, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]int, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceInt8R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]int8)\n\t\tif v, changed := fastpathTV.DecSliceInt8V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]int8)\n\t\tv2, changed := fastpathTV.DecSliceInt8V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceInt8X(vp *[]int8, d *Decoder) {\n\tif v, changed := f.DecSliceInt8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceInt8V(v []int8, canChange bool, d *Decoder) (_ []int8, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []int8{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]int8, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]int8, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = int8(chkOvf.IntV(d.d.DecodeInt64(), 8))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]int8, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceInt16R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]int16)\n\t\tif v, changed := fastpathTV.DecSliceInt16V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]int16)\n\t\tv2, changed := fastpathTV.DecSliceInt16V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceInt16X(vp *[]int16, d *Decoder) {\n\tif v, changed := f.DecSliceInt16V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceInt16V(v []int16, canChange bool, d *Decoder) (_ []int16, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []int16{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 2)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]int16, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 2)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]int16, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = int16(chkOvf.IntV(d.d.DecodeInt64(), 16))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]int16, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceInt32R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]int32)\n\t\tif v, changed := fastpathTV.DecSliceInt32V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]int32)\n\t\tv2, changed := fastpathTV.DecSliceInt32V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceInt32X(vp *[]int32, d *Decoder) {\n\tif v, changed := f.DecSliceInt32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceInt32V(v []int32, canChange bool, d *Decoder) (_ []int32, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []int32{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]int32, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 4)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]int32, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = int32(chkOvf.IntV(d.d.DecodeInt64(), 32))\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]int32, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceInt64R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]int64)\n\t\tif v, changed := fastpathTV.DecSliceInt64V(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]int64)\n\t\tv2, changed := fastpathTV.DecSliceInt64V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceInt64X(vp *[]int64, d *Decoder) {\n\tif v, changed := f.DecSliceInt64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceInt64V(v []int64, canChange bool, d *Decoder) (_ []int64, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []int64{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]int64, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 8)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]int64, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, 0)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = 0\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeInt64()\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]int64, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecSliceBoolR(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]bool)\n\t\tif v, changed := fastpathTV.DecSliceBoolV(*vp, !array, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tv := rv2i(rv).([]bool)\n\t\tv2, changed := fastpathTV.DecSliceBoolV(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) DecSliceBoolX(vp *[]bool, d *Decoder) {\n\tif v, changed := f.DecSliceBoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecSliceBoolV(v []bool, canChange bool, d *Decoder) (_ []bool, changed bool) {\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil {\n\t\t\t\tv = []bool{}\n\t\t\t} else if len(v) != 0 {\n\t\t\t\tv = v[:0]\n\t\t\t}\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int\n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]bool, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true\n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, 1)\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]bool, uint(xlen))\n\t\t\tchanged = true\n\t\t}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, false)\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t}\n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = false\n\t\t} else {\n\t\t\tv[uint(j)] = d.d.DecodeBool()\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]bool, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringIntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]interface{})\n\t\tif v, changed := fastpathTV.DecMapStringIntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringIntfV(rv2i(rv).(map[string]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringIntfX(vp *map[string]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapStringIntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringIntfV(v map[string]interface{}, canChange bool,\n\td *Decoder) (_ map[string]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk string\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringStringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]string)\n\t\tif v, changed := fastpathTV.DecMapStringStringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringStringV(rv2i(rv).(map[string]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringStringX(vp *map[string]string, d *Decoder) {\n\tif v, changed := f.DecMapStringStringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringStringV(v map[string]string, canChange bool,\n\td *Decoder) (_ map[string]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]string, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringBytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string][]byte)\n\t\tif v, changed := fastpathTV.DecMapStringBytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringBytesV(rv2i(rv).(map[string][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringBytesX(vp *map[string][]byte, d *Decoder) {\n\tif v, changed := f.DecMapStringBytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringBytesV(v map[string][]byte, canChange bool,\n\td *Decoder) (_ map[string][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string][]byte, decInferLen(containerLen, d.h.MaxInitLen, 40))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk string\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringUintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]uint)\n\t\tif v, changed := fastpathTV.DecMapStringUintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringUintV(rv2i(rv).(map[string]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringUintX(vp *map[string]uint, d *Decoder) {\n\tif v, changed := f.DecMapStringUintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringUintV(v map[string]uint, canChange bool,\n\td *Decoder) (_ map[string]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]uint, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringUint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]uint8)\n\t\tif v, changed := fastpathTV.DecMapStringUint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringUint8V(rv2i(rv).(map[string]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringUint8X(vp *map[string]uint8, d *Decoder) {\n\tif v, changed := f.DecMapStringUint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringUint8V(v map[string]uint8, canChange bool,\n\td *Decoder) (_ map[string]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]uint8, decInferLen(containerLen, d.h.MaxInitLen, 17))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringUint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]uint64)\n\t\tif v, changed := fastpathTV.DecMapStringUint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringUint64V(rv2i(rv).(map[string]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringUint64X(vp *map[string]uint64, d *Decoder) {\n\tif v, changed := f.DecMapStringUint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringUint64V(v map[string]uint64, canChange bool,\n\td *Decoder) (_ map[string]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]uint64, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]uintptr)\n\t\tif v, changed := fastpathTV.DecMapStringUintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringUintptrV(rv2i(rv).(map[string]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringUintptrX(vp *map[string]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapStringUintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringUintptrV(v map[string]uintptr, canChange bool,\n\td *Decoder) (_ map[string]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringIntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]int)\n\t\tif v, changed := fastpathTV.DecMapStringIntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringIntV(rv2i(rv).(map[string]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringIntX(vp *map[string]int, d *Decoder) {\n\tif v, changed := f.DecMapStringIntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringIntV(v map[string]int, canChange bool,\n\td *Decoder) (_ map[string]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]int, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringInt64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]int64)\n\t\tif v, changed := fastpathTV.DecMapStringInt64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringInt64V(rv2i(rv).(map[string]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringInt64X(vp *map[string]int64, d *Decoder) {\n\tif v, changed := f.DecMapStringInt64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringInt64V(v map[string]int64, canChange bool,\n\td *Decoder) (_ map[string]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]int64, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]float32)\n\t\tif v, changed := fastpathTV.DecMapStringFloat32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringFloat32V(rv2i(rv).(map[string]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringFloat32X(vp *map[string]float32, d *Decoder) {\n\tif v, changed := f.DecMapStringFloat32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringFloat32V(v map[string]float32, canChange bool,\n\td *Decoder) (_ map[string]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]float32, decInferLen(containerLen, d.h.MaxInitLen, 20))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]float64)\n\t\tif v, changed := fastpathTV.DecMapStringFloat64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringFloat64V(rv2i(rv).(map[string]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringFloat64X(vp *map[string]float64, d *Decoder) {\n\tif v, changed := f.DecMapStringFloat64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringFloat64V(v map[string]float64, canChange bool,\n\td *Decoder) (_ map[string]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]float64, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapStringBoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[string]bool)\n\t\tif v, changed := fastpathTV.DecMapStringBoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapStringBoolV(rv2i(rv).(map[string]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapStringBoolX(vp *map[string]bool, d *Decoder) {\n\tif v, changed := f.DecMapStringBoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapStringBoolV(v map[string]bool, canChange bool,\n\td *Decoder) (_ map[string]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[string]bool, decInferLen(containerLen, d.h.MaxInitLen, 17))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk string\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeString()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintIntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]interface{})\n\t\tif v, changed := fastpathTV.DecMapUintIntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintIntfV(rv2i(rv).(map[uint]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintIntfX(vp *map[uint]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapUintIntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintIntfV(v map[uint]interface{}, canChange bool,\n\td *Decoder) (_ map[uint]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk uint\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintStringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]string)\n\t\tif v, changed := fastpathTV.DecMapUintStringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintStringV(rv2i(rv).(map[uint]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintStringX(vp *map[uint]string, d *Decoder) {\n\tif v, changed := f.DecMapUintStringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintStringV(v map[uint]string, canChange bool,\n\td *Decoder) (_ map[uint]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]string, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintBytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint][]byte)\n\t\tif v, changed := fastpathTV.DecMapUintBytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintBytesV(rv2i(rv).(map[uint][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintBytesX(vp *map[uint][]byte, d *Decoder) {\n\tif v, changed := f.DecMapUintBytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintBytesV(v map[uint][]byte, canChange bool,\n\td *Decoder) (_ map[uint][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint][]byte, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk uint\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintUintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]uint)\n\t\tif v, changed := fastpathTV.DecMapUintUintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintUintV(rv2i(rv).(map[uint]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintUintX(vp *map[uint]uint, d *Decoder) {\n\tif v, changed := f.DecMapUintUintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintUintV(v map[uint]uint, canChange bool,\n\td *Decoder) (_ map[uint]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]uint, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintUint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]uint8)\n\t\tif v, changed := fastpathTV.DecMapUintUint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintUint8V(rv2i(rv).(map[uint]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintUint8X(vp *map[uint]uint8, d *Decoder) {\n\tif v, changed := f.DecMapUintUint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintUint8V(v map[uint]uint8, canChange bool,\n\td *Decoder) (_ map[uint]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]uint8, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintUint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]uint64)\n\t\tif v, changed := fastpathTV.DecMapUintUint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintUint64V(rv2i(rv).(map[uint]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintUint64X(vp *map[uint]uint64, d *Decoder) {\n\tif v, changed := f.DecMapUintUint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintUint64V(v map[uint]uint64, canChange bool,\n\td *Decoder) (_ map[uint]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]uint64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]uintptr)\n\t\tif v, changed := fastpathTV.DecMapUintUintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintUintptrV(rv2i(rv).(map[uint]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintUintptrX(vp *map[uint]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapUintUintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintUintptrV(v map[uint]uintptr, canChange bool,\n\td *Decoder) (_ map[uint]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintIntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]int)\n\t\tif v, changed := fastpathTV.DecMapUintIntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintIntV(rv2i(rv).(map[uint]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintIntX(vp *map[uint]int, d *Decoder) {\n\tif v, changed := f.DecMapUintIntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintIntV(v map[uint]int, canChange bool,\n\td *Decoder) (_ map[uint]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]int, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintInt64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]int64)\n\t\tif v, changed := fastpathTV.DecMapUintInt64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintInt64V(rv2i(rv).(map[uint]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintInt64X(vp *map[uint]int64, d *Decoder) {\n\tif v, changed := f.DecMapUintInt64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintInt64V(v map[uint]int64, canChange bool,\n\td *Decoder) (_ map[uint]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]int64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]float32)\n\t\tif v, changed := fastpathTV.DecMapUintFloat32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintFloat32V(rv2i(rv).(map[uint]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintFloat32X(vp *map[uint]float32, d *Decoder) {\n\tif v, changed := f.DecMapUintFloat32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintFloat32V(v map[uint]float32, canChange bool,\n\td *Decoder) (_ map[uint]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]float32, decInferLen(containerLen, d.h.MaxInitLen, 12))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]float64)\n\t\tif v, changed := fastpathTV.DecMapUintFloat64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintFloat64V(rv2i(rv).(map[uint]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintFloat64X(vp *map[uint]float64, d *Decoder) {\n\tif v, changed := f.DecMapUintFloat64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintFloat64V(v map[uint]float64, canChange bool,\n\td *Decoder) (_ map[uint]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]float64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUintBoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint]bool)\n\t\tif v, changed := fastpathTV.DecMapUintBoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUintBoolV(rv2i(rv).(map[uint]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUintBoolX(vp *map[uint]bool, d *Decoder) {\n\tif v, changed := f.DecMapUintBoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUintBoolV(v map[uint]bool, canChange bool,\n\td *Decoder) (_ map[uint]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint]bool, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8IntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]interface{})\n\t\tif v, changed := fastpathTV.DecMapUint8IntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8IntfV(rv2i(rv).(map[uint8]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8IntfX(vp *map[uint8]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapUint8IntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8IntfV(v map[uint8]interface{}, canChange bool,\n\td *Decoder) (_ map[uint8]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 17))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk uint8\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8StringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]string)\n\t\tif v, changed := fastpathTV.DecMapUint8StringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8StringV(rv2i(rv).(map[uint8]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8StringX(vp *map[uint8]string, d *Decoder) {\n\tif v, changed := f.DecMapUint8StringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8StringV(v map[uint8]string, canChange bool,\n\td *Decoder) (_ map[uint8]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]string, decInferLen(containerLen, d.h.MaxInitLen, 17))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8BytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8][]byte)\n\t\tif v, changed := fastpathTV.DecMapUint8BytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8BytesV(rv2i(rv).(map[uint8][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8BytesX(vp *map[uint8][]byte, d *Decoder) {\n\tif v, changed := f.DecMapUint8BytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8BytesV(v map[uint8][]byte, canChange bool,\n\td *Decoder) (_ map[uint8][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8][]byte, decInferLen(containerLen, d.h.MaxInitLen, 25))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk uint8\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8UintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]uint)\n\t\tif v, changed := fastpathTV.DecMapUint8UintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8UintV(rv2i(rv).(map[uint8]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8UintX(vp *map[uint8]uint, d *Decoder) {\n\tif v, changed := f.DecMapUint8UintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8UintV(v map[uint8]uint, canChange bool,\n\td *Decoder) (_ map[uint8]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]uint, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]uint8)\n\t\tif v, changed := fastpathTV.DecMapUint8Uint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8Uint8V(rv2i(rv).(map[uint8]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8Uint8X(vp *map[uint8]uint8, d *Decoder) {\n\tif v, changed := f.DecMapUint8Uint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8Uint8V(v map[uint8]uint8, canChange bool,\n\td *Decoder) (_ map[uint8]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]uint8, decInferLen(containerLen, d.h.MaxInitLen, 2))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]uint64)\n\t\tif v, changed := fastpathTV.DecMapUint8Uint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8Uint64V(rv2i(rv).(map[uint8]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8Uint64X(vp *map[uint8]uint64, d *Decoder) {\n\tif v, changed := f.DecMapUint8Uint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8Uint64V(v map[uint8]uint64, canChange bool,\n\td *Decoder) (_ map[uint8]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]uint64, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]uintptr)\n\t\tif v, changed := fastpathTV.DecMapUint8UintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8UintptrV(rv2i(rv).(map[uint8]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8UintptrX(vp *map[uint8]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapUint8UintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8UintptrV(v map[uint8]uintptr, canChange bool,\n\td *Decoder) (_ map[uint8]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8IntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]int)\n\t\tif v, changed := fastpathTV.DecMapUint8IntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8IntV(rv2i(rv).(map[uint8]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8IntX(vp *map[uint8]int, d *Decoder) {\n\tif v, changed := f.DecMapUint8IntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8IntV(v map[uint8]int, canChange bool,\n\td *Decoder) (_ map[uint8]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]int, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8Int64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]int64)\n\t\tif v, changed := fastpathTV.DecMapUint8Int64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8Int64V(rv2i(rv).(map[uint8]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8Int64X(vp *map[uint8]int64, d *Decoder) {\n\tif v, changed := f.DecMapUint8Int64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8Int64V(v map[uint8]int64, canChange bool,\n\td *Decoder) (_ map[uint8]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]int64, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8Float32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]float32)\n\t\tif v, changed := fastpathTV.DecMapUint8Float32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8Float32V(rv2i(rv).(map[uint8]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8Float32X(vp *map[uint8]float32, d *Decoder) {\n\tif v, changed := f.DecMapUint8Float32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8Float32V(v map[uint8]float32, canChange bool,\n\td *Decoder) (_ map[uint8]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]float32, decInferLen(containerLen, d.h.MaxInitLen, 5))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8Float64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]float64)\n\t\tif v, changed := fastpathTV.DecMapUint8Float64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8Float64V(rv2i(rv).(map[uint8]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8Float64X(vp *map[uint8]float64, d *Decoder) {\n\tif v, changed := f.DecMapUint8Float64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8Float64V(v map[uint8]float64, canChange bool,\n\td *Decoder) (_ map[uint8]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]float64, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint8BoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint8]bool)\n\t\tif v, changed := fastpathTV.DecMapUint8BoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint8BoolV(rv2i(rv).(map[uint8]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint8BoolX(vp *map[uint8]bool, d *Decoder) {\n\tif v, changed := f.DecMapUint8BoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint8BoolV(v map[uint8]bool, canChange bool,\n\td *Decoder) (_ map[uint8]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint8]bool, decInferLen(containerLen, d.h.MaxInitLen, 2))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint8\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64IntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]interface{})\n\t\tif v, changed := fastpathTV.DecMapUint64IntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64IntfV(rv2i(rv).(map[uint64]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64IntfX(vp *map[uint64]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapUint64IntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64IntfV(v map[uint64]interface{}, canChange bool,\n\td *Decoder) (_ map[uint64]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk uint64\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64StringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]string)\n\t\tif v, changed := fastpathTV.DecMapUint64StringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64StringV(rv2i(rv).(map[uint64]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64StringX(vp *map[uint64]string, d *Decoder) {\n\tif v, changed := f.DecMapUint64StringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64StringV(v map[uint64]string, canChange bool,\n\td *Decoder) (_ map[uint64]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]string, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64BytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64][]byte)\n\t\tif v, changed := fastpathTV.DecMapUint64BytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64BytesV(rv2i(rv).(map[uint64][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64BytesX(vp *map[uint64][]byte, d *Decoder) {\n\tif v, changed := f.DecMapUint64BytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64BytesV(v map[uint64][]byte, canChange bool,\n\td *Decoder) (_ map[uint64][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64][]byte, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk uint64\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64UintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]uint)\n\t\tif v, changed := fastpathTV.DecMapUint64UintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64UintV(rv2i(rv).(map[uint64]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64UintX(vp *map[uint64]uint, d *Decoder) {\n\tif v, changed := f.DecMapUint64UintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64UintV(v map[uint64]uint, canChange bool,\n\td *Decoder) (_ map[uint64]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]uint, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]uint8)\n\t\tif v, changed := fastpathTV.DecMapUint64Uint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64Uint8V(rv2i(rv).(map[uint64]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64Uint8X(vp *map[uint64]uint8, d *Decoder) {\n\tif v, changed := f.DecMapUint64Uint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64Uint8V(v map[uint64]uint8, canChange bool,\n\td *Decoder) (_ map[uint64]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]uint8, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]uint64)\n\t\tif v, changed := fastpathTV.DecMapUint64Uint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64Uint64V(rv2i(rv).(map[uint64]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64Uint64X(vp *map[uint64]uint64, d *Decoder) {\n\tif v, changed := f.DecMapUint64Uint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64Uint64V(v map[uint64]uint64, canChange bool,\n\td *Decoder) (_ map[uint64]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]uint64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]uintptr)\n\t\tif v, changed := fastpathTV.DecMapUint64UintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64UintptrV(rv2i(rv).(map[uint64]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64UintptrX(vp *map[uint64]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapUint64UintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64UintptrV(v map[uint64]uintptr, canChange bool,\n\td *Decoder) (_ map[uint64]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64IntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]int)\n\t\tif v, changed := fastpathTV.DecMapUint64IntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64IntV(rv2i(rv).(map[uint64]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64IntX(vp *map[uint64]int, d *Decoder) {\n\tif v, changed := f.DecMapUint64IntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64IntV(v map[uint64]int, canChange bool,\n\td *Decoder) (_ map[uint64]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]int, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64Int64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]int64)\n\t\tif v, changed := fastpathTV.DecMapUint64Int64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64Int64V(rv2i(rv).(map[uint64]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64Int64X(vp *map[uint64]int64, d *Decoder) {\n\tif v, changed := f.DecMapUint64Int64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64Int64V(v map[uint64]int64, canChange bool,\n\td *Decoder) (_ map[uint64]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]int64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64Float32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]float32)\n\t\tif v, changed := fastpathTV.DecMapUint64Float32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64Float32V(rv2i(rv).(map[uint64]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64Float32X(vp *map[uint64]float32, d *Decoder) {\n\tif v, changed := f.DecMapUint64Float32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64Float32V(v map[uint64]float32, canChange bool,\n\td *Decoder) (_ map[uint64]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]float32, decInferLen(containerLen, d.h.MaxInitLen, 12))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64Float64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]float64)\n\t\tif v, changed := fastpathTV.DecMapUint64Float64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64Float64V(rv2i(rv).(map[uint64]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64Float64X(vp *map[uint64]float64, d *Decoder) {\n\tif v, changed := f.DecMapUint64Float64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64Float64V(v map[uint64]float64, canChange bool,\n\td *Decoder) (_ map[uint64]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]float64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapUint64BoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[uint64]bool)\n\t\tif v, changed := fastpathTV.DecMapUint64BoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapUint64BoolV(rv2i(rv).(map[uint64]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapUint64BoolX(vp *map[uint64]bool, d *Decoder) {\n\tif v, changed := f.DecMapUint64BoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapUint64BoolV(v map[uint64]bool, canChange bool,\n\td *Decoder) (_ map[uint64]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[uint64]bool, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk uint64\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeUint64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntIntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]interface{})\n\t\tif v, changed := fastpathTV.DecMapIntIntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntIntfV(rv2i(rv).(map[int]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntIntfX(vp *map[int]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapIntIntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntIntfV(v map[int]interface{}, canChange bool,\n\td *Decoder) (_ map[int]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk int\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntStringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]string)\n\t\tif v, changed := fastpathTV.DecMapIntStringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntStringV(rv2i(rv).(map[int]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntStringX(vp *map[int]string, d *Decoder) {\n\tif v, changed := f.DecMapIntStringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntStringV(v map[int]string, canChange bool,\n\td *Decoder) (_ map[int]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]string, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntBytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int][]byte)\n\t\tif v, changed := fastpathTV.DecMapIntBytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntBytesV(rv2i(rv).(map[int][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntBytesX(vp *map[int][]byte, d *Decoder) {\n\tif v, changed := f.DecMapIntBytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntBytesV(v map[int][]byte, canChange bool,\n\td *Decoder) (_ map[int][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int][]byte, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk int\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntUintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]uint)\n\t\tif v, changed := fastpathTV.DecMapIntUintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntUintV(rv2i(rv).(map[int]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntUintX(vp *map[int]uint, d *Decoder) {\n\tif v, changed := f.DecMapIntUintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntUintV(v map[int]uint, canChange bool,\n\td *Decoder) (_ map[int]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]uint, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntUint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]uint8)\n\t\tif v, changed := fastpathTV.DecMapIntUint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntUint8V(rv2i(rv).(map[int]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntUint8X(vp *map[int]uint8, d *Decoder) {\n\tif v, changed := f.DecMapIntUint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntUint8V(v map[int]uint8, canChange bool,\n\td *Decoder) (_ map[int]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]uint8, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntUint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]uint64)\n\t\tif v, changed := fastpathTV.DecMapIntUint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntUint64V(rv2i(rv).(map[int]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntUint64X(vp *map[int]uint64, d *Decoder) {\n\tif v, changed := f.DecMapIntUint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntUint64V(v map[int]uint64, canChange bool,\n\td *Decoder) (_ map[int]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]uint64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntUintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]uintptr)\n\t\tif v, changed := fastpathTV.DecMapIntUintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntUintptrV(rv2i(rv).(map[int]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntUintptrX(vp *map[int]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapIntUintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntUintptrV(v map[int]uintptr, canChange bool,\n\td *Decoder) (_ map[int]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntIntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]int)\n\t\tif v, changed := fastpathTV.DecMapIntIntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntIntV(rv2i(rv).(map[int]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntIntX(vp *map[int]int, d *Decoder) {\n\tif v, changed := f.DecMapIntIntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntIntV(v map[int]int, canChange bool,\n\td *Decoder) (_ map[int]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]int, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntInt64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]int64)\n\t\tif v, changed := fastpathTV.DecMapIntInt64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntInt64V(rv2i(rv).(map[int]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntInt64X(vp *map[int]int64, d *Decoder) {\n\tif v, changed := f.DecMapIntInt64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntInt64V(v map[int]int64, canChange bool,\n\td *Decoder) (_ map[int]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]int64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntFloat32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]float32)\n\t\tif v, changed := fastpathTV.DecMapIntFloat32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntFloat32V(rv2i(rv).(map[int]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntFloat32X(vp *map[int]float32, d *Decoder) {\n\tif v, changed := f.DecMapIntFloat32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntFloat32V(v map[int]float32, canChange bool,\n\td *Decoder) (_ map[int]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]float32, decInferLen(containerLen, d.h.MaxInitLen, 12))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntFloat64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]float64)\n\t\tif v, changed := fastpathTV.DecMapIntFloat64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntFloat64V(rv2i(rv).(map[int]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntFloat64X(vp *map[int]float64, d *Decoder) {\n\tif v, changed := f.DecMapIntFloat64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntFloat64V(v map[int]float64, canChange bool,\n\td *Decoder) (_ map[int]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]float64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapIntBoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int]bool)\n\t\tif v, changed := fastpathTV.DecMapIntBoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapIntBoolV(rv2i(rv).(map[int]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapIntBoolX(vp *map[int]bool, d *Decoder) {\n\tif v, changed := f.DecMapIntBoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapIntBoolV(v map[int]bool, canChange bool,\n\td *Decoder) (_ map[int]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int]bool, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64IntfR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]interface{})\n\t\tif v, changed := fastpathTV.DecMapInt64IntfV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64IntfV(rv2i(rv).(map[int64]interface{}), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64IntfX(vp *map[int64]interface{}, d *Decoder) {\n\tif v, changed := f.DecMapInt64IntfV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64IntfV(v map[int64]interface{}, canChange bool,\n\td *Decoder) (_ map[int64]interface{}, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]interface{}, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n\tvar mk int64\n\tvar mv interface{}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\td.decode(&mv)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64StringR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]string)\n\t\tif v, changed := fastpathTV.DecMapInt64StringV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64StringV(rv2i(rv).(map[int64]string), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64StringX(vp *map[int64]string, d *Decoder) {\n\tif v, changed := f.DecMapInt64StringV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64StringV(v map[int64]string, canChange bool,\n\td *Decoder) (_ map[int64]string, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]string, decInferLen(containerLen, d.h.MaxInitLen, 24))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv string\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = \"\"\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeString()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64BytesR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64][]byte)\n\t\tif v, changed := fastpathTV.DecMapInt64BytesV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64BytesV(rv2i(rv).(map[int64][]byte), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64BytesX(vp *map[int64][]byte, d *Decoder) {\n\tif v, changed := f.DecMapInt64BytesV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64BytesV(v map[int64][]byte, canChange bool,\n\td *Decoder) (_ map[int64][]byte, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64][]byte, decInferLen(containerLen, d.h.MaxInitLen, 32))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tmapGet := v != nil && !d.h.MapValueReset\n\tvar mk int64\n\tvar mv []byte\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = nil\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif mapGet {\n\t\t\tmv = v[mk]\n\t\t} else {\n\t\t\tmv = nil\n\t\t}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64UintR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]uint)\n\t\tif v, changed := fastpathTV.DecMapInt64UintV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64UintV(rv2i(rv).(map[int64]uint), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64UintX(vp *map[int64]uint, d *Decoder) {\n\tif v, changed := f.DecMapInt64UintV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64UintV(v map[int64]uint, canChange bool,\n\td *Decoder) (_ map[int64]uint, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]uint, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv uint\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64Uint8R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]uint8)\n\t\tif v, changed := fastpathTV.DecMapInt64Uint8V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64Uint8V(rv2i(rv).(map[int64]uint8), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64Uint8X(vp *map[int64]uint8, d *Decoder) {\n\tif v, changed := f.DecMapInt64Uint8V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64Uint8V(v map[int64]uint8, canChange bool,\n\td *Decoder) (_ map[int64]uint8, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]uint8, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv uint8\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64Uint64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]uint64)\n\t\tif v, changed := fastpathTV.DecMapInt64Uint64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64Uint64V(rv2i(rv).(map[int64]uint64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64Uint64X(vp *map[int64]uint64, d *Decoder) {\n\tif v, changed := f.DecMapInt64Uint64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64Uint64V(v map[int64]uint64, canChange bool,\n\td *Decoder) (_ map[int64]uint64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]uint64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv uint64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeUint64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64UintptrR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]uintptr)\n\t\tif v, changed := fastpathTV.DecMapInt64UintptrV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64UintptrV(rv2i(rv).(map[int64]uintptr), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64UintptrX(vp *map[int64]uintptr, d *Decoder) {\n\tif v, changed := f.DecMapInt64UintptrV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64UintptrV(v map[int64]uintptr, canChange bool,\n\td *Decoder) (_ map[int64]uintptr, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]uintptr, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv uintptr\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64IntR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]int)\n\t\tif v, changed := fastpathTV.DecMapInt64IntV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64IntV(rv2i(rv).(map[int64]int), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64IntX(vp *map[int64]int, d *Decoder) {\n\tif v, changed := f.DecMapInt64IntV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64IntV(v map[int64]int, canChange bool,\n\td *Decoder) (_ map[int64]int, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]int, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv int\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64Int64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]int64)\n\t\tif v, changed := fastpathTV.DecMapInt64Int64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64Int64V(rv2i(rv).(map[int64]int64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64Int64X(vp *map[int64]int64, d *Decoder) {\n\tif v, changed := f.DecMapInt64Int64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64Int64V(v map[int64]int64, canChange bool,\n\td *Decoder) (_ map[int64]int64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]int64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv int64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeInt64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64Float32R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]float32)\n\t\tif v, changed := fastpathTV.DecMapInt64Float32V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64Float32V(rv2i(rv).(map[int64]float32), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64Float32X(vp *map[int64]float32, d *Decoder) {\n\tif v, changed := f.DecMapInt64Float32V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64Float32V(v map[int64]float32, canChange bool,\n\td *Decoder) (_ map[int64]float32, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]float32, decInferLen(containerLen, d.h.MaxInitLen, 12))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv float32\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = float32(d.decodeFloat32())\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64Float64R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]float64)\n\t\tif v, changed := fastpathTV.DecMapInt64Float64V(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64Float64V(rv2i(rv).(map[int64]float64), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64Float64X(vp *map[int64]float64, d *Decoder) {\n\tif v, changed := f.DecMapInt64Float64V(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64Float64V(v map[int64]float64, canChange bool,\n\td *Decoder) (_ map[int64]float64, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]float64, decInferLen(containerLen, d.h.MaxInitLen, 16))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv float64\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = 0\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeFloat64()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n\nfunc (d *Decoder) fastpathDecMapInt64BoolR(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[int64]bool)\n\t\tif v, changed := fastpathTV.DecMapInt64BoolV(*vp, true, d); changed {\n\t\t\t*vp = v\n\t\t}\n\t} else {\n\t\tfastpathTV.DecMapInt64BoolV(rv2i(rv).(map[int64]bool), false, d)\n\t}\n}\nfunc (f fastpathT) DecMapInt64BoolX(vp *map[int64]bool, d *Decoder) {\n\tif v, changed := f.DecMapInt64BoolV(*vp, true, d); changed {\n\t\t*vp = v\n\t}\n}\nfunc (fastpathT) DecMapInt64BoolV(v map[int64]bool, canChange bool,\n\td *Decoder) (_ map[int64]bool, changed bool) {\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[int64]bool, decInferLen(containerLen, d.h.MaxInitLen, 9))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\tvar mk int64\n\tvar mv bool\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\tmk = d.d.DecodeInt64()\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {\n\t\t\t} else if d.h.DeleteOnNilMapValue {\n\t\t\t\tdelete(v, mk)\n\t\t\t} else {\n\t\t\t\tv[mk] = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tmv = d.d.DecodeBool()\n\t\tif v != nil {\n\t\t\tv[mk] = mv\n\t\t}\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/fast-path.go.tmpl", "content": "// +build !notfastpath\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from fast-path.go.tmpl - DO NOT EDIT.\n\npackage codec\n\n// Fast path functions try to create a fast path encode or decode implementation\n// for common maps and slices.\n//\n// We define the functions and register them in this single file\n// so as not to pollute the encode.go and decode.go, and create a dependency in there.\n// This file can be omitted without causing a build failure.\n//\n// The advantage of fast paths is:\n//\t - Many calls bypass reflection altogether\n// \n// Currently support\n//\t - slice of all builtin types (numeric, bool, string, []byte)\n// - maps of builtin types to builtin or interface{} type, EXCEPT FOR\n// keys of type uintptr, int8/16/32, uint16/32, float32/64, bool, interface{}\n// AND values of type type int8/16/32, uint16/32\n// This should provide adequate \"typical\" implementations.\n// \n// Note that fast track decode functions must handle values for which an address cannot be obtained.\n// For example: \n//\t m2 := map[string]int{}\n//\t p2 := []interface{}{m2}\n//\t // decoding into p2 will bomb if fast track functions do not treat like unaddressable.\n// \n\nimport (\n\t\"reflect\"\n\t\"sort\"\n)\n\nconst fastpathEnabled = true\n\nconst fastpathMapBySliceErrMsg = \"mapBySlice requires even slice length, but got %v\"\n\ntype fastpathT struct {}\n\nvar fastpathTV fastpathT\n\ntype fastpathE struct {\n\trtid uintptr\n\trt reflect.Type \n\tencfn func(*Encoder, *codecFnInfo, reflect.Value)\n\tdecfn func(*Decoder, *codecFnInfo, reflect.Value)\n}\n\ntype fastpathA [{{ .FastpathLen }}]fastpathE\n\nfunc (x *fastpathA) index(rtid uintptr) int {\n\t// use binary search to grab the index (adapted from sort/search.go)\n\t// Note: we use goto (instead of for loop) so this can be inlined.\n \t// h, i, j := 0, 0, len(x)\n\tvar h, i uint\n\tvar j = uint(len(x))\nLOOP:\n\tif i < j {\n\t\th = i + (j-i)/2\n\t\tif x[h].rtid < rtid {\n\t\t\ti = h + 1\n\t\t} else {\n\t\t\tj = h\n\t\t}\n\t\tgoto LOOP\n\t}\n\tif i < uint(len(x)) && x[i].rtid == rtid {\n\t\treturn int(i)\n\t}\n\treturn -1\n}\n\ntype fastpathAslice []fastpathE\n\nfunc (x fastpathAslice) Len() int { return len(x) }\nfunc (x fastpathAslice) Less(i, j int) bool { return x[uint(i)].rtid < x[uint(j)].rtid }\nfunc (x fastpathAslice) Swap(i, j int) { x[uint(i)], x[uint(j)] = x[uint(j)], x[uint(i)] }\n\nvar fastpathAV fastpathA\n\n// due to possible initialization loop error, make fastpath in an init()\nfunc init() {\n\tvar i uint = 0\n\tfn := func(v interface{},\n\t\tfe func(*Encoder, *codecFnInfo, reflect.Value),\n\t\tfd func(*Decoder, *codecFnInfo, reflect.Value)) {\n\t\txrt := reflect.TypeOf(v)\n\t\txptr := rt2id(xrt)\n\t\tfastpathAV[i] = fastpathE{xptr, xrt, fe, fd}\n\t\ti++\n\t}\n\t{{/* do not register []uint8 in fast-path */}}\n\t{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}{{if ne .Elem \"uint8\"}}\n\tfn([]{{ .Elem }}(nil), (*Encoder).{{ .MethodNamePfx \"fastpathEnc\" false }}R, (*Decoder).{{ .MethodNamePfx \"fastpathDec\" false }}R){{end}}{{end}}{{end}}{{end}}\n\t\n\t{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\n\tfn(map[{{ .MapKey }}]{{ .Elem }}(nil), (*Encoder).{{ .MethodNamePfx \"fastpathEnc\" false }}R, (*Decoder).{{ .MethodNamePfx \"fastpathDec\" false }}R){{end}}{{end}}{{end}}\n\t\n\tsort.Sort(fastpathAslice(fastpathAV[:]))\n}\n\n// -- encode\n\n// -- -- fast path type switch\nfunc fastpathEncodeTypeSwitch(iv interface{}, e *Encoder) bool {\n\tswitch v := iv.(type) {\n\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}{{if ne .Elem \"uint8\"}}\n\tcase []{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(v, e)\n\tcase *[]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(*v, e){{/*\n*/}}{{end}}{{end}}{{end}}{{end}}\n\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\n\tcase map[{{ .MapKey }}]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(v, e)\n\tcase *map[{{ .MapKey }}]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(*v, e){{/*\n*/}}{{end}}{{end}}{{end}}\n\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\n{{/*\n**** removing this block, as they are never called directly ****\n\n\n\n**** removing this block, as they are never called directly ****\n\n\n\nfunc fastpathEncodeTypeSwitchSlice(iv interface{}, e *Encoder) bool {\n\tswitch v := iv.(type) {\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}\n\tcase []{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(v, e)\n\tcase *[]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(*v, e)\n{{end}}{{end}}{{end}}\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\nfunc fastpathEncodeTypeSwitchMap(iv interface{}, e *Encoder) bool {\n\tswitch v := iv.(type) {\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\n\tcase map[{{ .MapKey }}]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(v, e)\n\tcase *map[{{ .MapKey }}]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(*v, e)\n{{end}}{{end}}{{end}}\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\n\n\n**** removing this block, as they are never called directly ****\n\n\n\n**** removing this block, as they are never called directly ****\n*/}}\n\n// -- -- fast path functions\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }} \nfunc (e *Encoder) {{ .MethodNamePfx \"fastpathEnc\" false }}R(f *codecFnInfo, rv reflect.Value) {\n\tif f.ti.mbs {\n\t\tfastpathTV.{{ .MethodNamePfx \"EncAsMap\" false }}V(rv2i(rv).([]{{ .Elem }}), e)\n\t} else {\n\t\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(rv2i(rv).([]{{ .Elem }}), e)\n\t}\n}\nfunc (fastpathT) {{ .MethodNamePfx \"Enc\" false }}V(v []{{ .Elem }}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n\t\treturn\n\t}\n\te.arrayStart(len(v))\n\tfor j := range v {\n\t\te.arrayElem()\n\t\t{{ encmd .Elem \"v[j]\"}}\n\t} \n\te.arrayEnd()\n}\nfunc (fastpathT) {{ .MethodNamePfx \"EncAsMap\" false }}V(v []{{ .Elem }}, e *Encoder) {\n\tif v == nil {\n\t\te.e.EncodeNil()\n } else if len(v)%2 == 1 {\n\t\te.errorf(fastpathMapBySliceErrMsg, len(v))\n\t} else {\n\t\te.mapStart(len(v) / 2)\n\t\tfor j := range v {\n\t\t\tif j%2 == 0 {\n\t\t\t\te.mapElemKey()\n\t\t\t} else {\n\t\t\t\te.mapElemValue()\n\t\t\t}\n\t\t\t{{ encmd .Elem \"v[j]\"}}\n \t\t}\n\t\te.mapEnd()\n\t}\n}\n{{end}}{{end}}{{end}}\n\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\nfunc (e *Encoder) {{ .MethodNamePfx \"fastpathEnc\" false }}R(f *codecFnInfo, rv reflect.Value) {\n\tfastpathTV.{{ .MethodNamePfx \"Enc\" false }}V(rv2i(rv).(map[{{ .MapKey }}]{{ .Elem }}), e)\n}\nfunc (fastpathT) {{ .MethodNamePfx \"Enc\" false }}V(v map[{{ .MapKey }}]{{ .Elem }}, e *Encoder) {\n\tif v == nil { e.e.EncodeNil(); return }\n\te.mapStart(len(v))\n\tif e.h.Canonical { {{/* need to figure out .NoCanonical */}}\n\t\t{{if eq .MapKey \"interface{}\"}}{{/* out of band */ -}}\n\t\tvar mksv []byte = make([]byte, 0, len(v)*16) // temporary byte slice for the encoding\n\t\te2 := NewEncoderBytes(&mksv, e.hh)\n\t\tv2 := make([]bytesIntf, len(v))\n\t\tvar i, l uint\n\t\tvar vp *bytesIntf {{/* put loop variables outside. seems currently needed for better perf */}}\n\t\tfor k2 := range v {\n\t\t\tl = uint(len(mksv))\n\t\t\te2.MustEncode(k2)\n\t\t\tvp = &v2[i]\n\t\t\tvp.v = mksv[l:]\n\t\t\tvp.i = k2 \n\t\t\ti++\n\t\t}\n\t\tsort.Sort(bytesIntfSlice(v2))\n\t\tfor j := range v2 {\n\t\t\te.mapElemKey()\n\t\t\te.asis(v2[j].v)\n\t\t\te.mapElemValue()\n\t\t\te.encode(v[v2[j].i])\n\t\t} {{else}}{{ $x := sorttype .MapKey true}}v2 := make([]{{ $x }}, len(v))\n\t\tvar i uint\n\t\tfor k := range v {\n\t\t\tv2[i] = {{if eq $x .MapKey}}k{{else}}{{ $x }}(k){{end}}\n\t\t\ti++\n\t\t}\n\t\tsort.Sort({{ sorttype .MapKey false}}(v2))\n\t\tfor _, k2 := range v2 {\n\t\t\te.mapElemKey()\n\t\t\t{{if eq .MapKey \"string\"}} if e.h.StringToRaw {e.e.EncodeStringBytesRaw(bytesView(k2))} else {e.e.EncodeStringEnc(cUTF8, k2)} {{else}}{{ $y := printf \"%s(k2)\" .MapKey }}{{if eq $x .MapKey }}{{ $y = \"k2\" }}{{end}}{{ encmd .MapKey $y }}{{end}}\n\t\t\te.mapElemValue()\n\t\t\t{{ $y := printf \"v[%s(k2)]\" .MapKey }}{{if eq $x .MapKey }}{{ $y = \"v[k2]\" }}{{end}}{{ encmd .Elem $y }}\n\t\t} {{end}}\n\t} else { \n\t\tfor k2, v2 := range v {\n\t\t\te.mapElemKey()\n\t\t\t{{if eq .MapKey \"string\"}} if e.h.StringToRaw {e.e.EncodeStringBytesRaw(bytesView(k2))} else {e.e.EncodeStringEnc(cUTF8, k2)} {{else}}{{ encmd .MapKey \"k2\"}}{{end}}\n\t\t\te.mapElemValue()\n\t\t\t{{ encmd .Elem \"v2\"}}\n\t\t}\n\t}\n\te.mapEnd()\n}\n{{end}}{{end}}{{end}}\n\n// -- decode\n\n// -- -- fast path type switch\nfunc fastpathDecodeTypeSwitch(iv interface{}, d *Decoder) bool {\n\t var changed bool\n\tswitch v := iv.(type) {\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}{{if ne .Elem \"uint8\"}}\n\tcase []{{ .Elem }}:\n\t\tvar v2 []{{ .Elem }}\n\t\tv2, changed = fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(v, false, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t\tcopy(v, v2)\n\t\t}\n\tcase *[]{{ .Elem }}:\n\t\tvar v2 []{{ .Elem }}\n\t\tv2, changed = fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2 \n\t\t}{{/*\n*/}}{{end}}{{end}}{{end}}{{end}}\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}{{/*\n// maps only change if nil, and in that case, there's no point copying\n*/}}\n\tcase map[{{ .MapKey }}]{{ .Elem }}:\n\t\tfastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(v, false, d)\n\tcase *map[{{ .MapKey }}]{{ .Elem }}:\n\t\t var v2 map[{{ .MapKey }}]{{ .Elem }}\n\t\tv2, changed = fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(*v, true, d)\n\t\tif changed {\n\t\t\t*v = v2 \n\t\t}{{/*\n*/}}{{end}}{{end}}{{end}}\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\nfunc fastpathDecodeSetZeroTypeSwitch(iv interface{}) bool {\n\tswitch v := iv.(type) {\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}\n\tcase *[]{{ .Elem }}: \n\t\t*v = nil {{/*\n*/}}{{end}}{{end}}{{end}}\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\n\tcase *map[{{ .MapKey }}]{{ .Elem }}: \n\t\t*v = nil {{/*\n*/}}{{end}}{{end}}{{end}}\n\tdefault:\n\t\t_ = v // workaround https://github.com/golang/go/issues/12927 seen in go1.4\n\t\treturn false\n\t}\n\treturn true\n}\n\n// -- -- fast path functions\n{{range .Values}}{{if not .Primitive}}{{if not .MapKey }}\n{{/*\nSlices can change if they \n- did not come from an array\n- are addressable (from a ptr)\n- are settable (e.g. contained in an interface{})\n*/}}\nfunc (d *Decoder) {{ .MethodNamePfx \"fastpathDec\" false }}R(f *codecFnInfo, rv reflect.Value) {\n\tif array := f.seq == seqTypeArray; !array && rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*[]{{ .Elem }})\n\t\tif v, changed := fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(*vp, !array, d); changed { *vp = v }\n\t} else {\n\t\tv := rv2i(rv).([]{{ .Elem }})\n\t\tv2, changed := fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(v, !array, d)\n\t\tif changed && len(v) > 0 && len(v2) > 0 && !(len(v2) == len(v) && &v2[0] == &v[0]) {\n\t\t copy(v, v2)\n\t\t}\n\t}\n}\nfunc (f fastpathT) {{ .MethodNamePfx \"Dec\" false }}X(vp *[]{{ .Elem }}, d *Decoder) {\n\tif v, changed := f.{{ .MethodNamePfx \"Dec\" false }}V(*vp, true, d); changed { *vp = v }\n}\nfunc (fastpathT) {{ .MethodNamePfx \"Dec\" false }}V(v []{{ .Elem }}, canChange bool, d *Decoder) (_ []{{ .Elem }}, changed bool) {\n\t{{/* dd := d.d\n\t\t// if d.d.isContainerType(valueTypeNil) { d.d.TryDecodeAsNil() }\n\t */ -}}\n\tslh, containerLenS := d.decSliceHelperStart()\n\tif containerLenS == 0 {\n\t\tif canChange {\n\t\t\tif v == nil { v = []{{ .Elem }}{} } else if len(v) != 0 { v = v[:0] }\n\t\t\tchanged = true\n\t\t}\n\t\tslh.End()\n\t\treturn v, changed\n\t}\n\thasLen := containerLenS > 0\n\tvar xlen int \n\tif hasLen && canChange {\n\t\tif containerLenS > cap(v) {\n\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, {{ .Size }})\n\t\t\tif xlen <= cap(v) {\n\t\t\t\tv = v[:uint(xlen)]\n\t\t\t} else {\n\t\t\t\tv = make([]{{ .Elem }}, uint(xlen))\n\t\t\t}\n\t\t\tchanged = true \n\t\t} else if containerLenS != len(v) {\n\t\t\tv = v[:containerLenS]\n\t\t\tchanged = true\n\t\t}\n\t}\n\tvar j int\n\tfor j = 0; (hasLen && j < containerLenS) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\tif j == 0 && len(v) == 0 && canChange {\n\t\t\tif hasLen {\n\t\t\t\txlen = decInferLen(containerLenS, d.h.MaxInitLen, {{ .Size }})\n\t\t\t} else {\n\t\t\t\txlen = 8\n\t\t\t}\n\t\t\tv = make([]{{ .Elem }}, uint(xlen))\n\t\t\tchanged = true \n\t\t}\n\t\t{{/* // if indefinite, etc, then expand the slice if necessary */ -}}\n\t\tvar decodeIntoBlank bool\n\t\tif j >= len(v) {\n\t\t\tif canChange {\n\t\t\t\tv = append(v, {{ zerocmd .Elem }})\n\t\t\t\tchanged = true\n\t\t\t} else {\n\t\t\t\td.arrayCannotExpand(len(v), j+1)\n\t\t\t\tdecodeIntoBlank = true\n\t\t\t}\n\t\t} \n\t\tslh.ElemContainerState(j)\n\t\tif decodeIntoBlank {\n\t\t\td.swallow()\n\t\t} else if d.d.TryDecodeAsNil() {\n\t\t\tv[uint(j)] = {{ zerocmd .Elem }}\n\t\t} else {\n\t\t\t{{ if eq .Elem \"interface{}\" }}d.decode(&v[uint(j)]){{ else }}v[uint(j)] = {{ decmd .Elem }}{{ end }}\n\t\t}\n\t}\n\tif canChange {\n\t\tif j < len(v) {\n\t\t\tv = v[:uint(j)]\n\t\t\tchanged = true\n\t\t} else if j == 0 && v == nil {\n\t\t\tv = make([]{{ .Elem }}, 0)\n\t\t\tchanged = true\n\t\t}\n\t}\n\tslh.End()\n\treturn v, changed \n}\n{{end}}{{end}}{{end}}\n\n{{range .Values}}{{if not .Primitive}}{{if .MapKey }}\n{{/*\nMaps can change if they are\n- addressable (from a ptr)\n- settable (e.g. contained in an interface{})\n*/}}\nfunc (d *Decoder) {{ .MethodNamePfx \"fastpathDec\" false }}R(f *codecFnInfo, rv reflect.Value) {\n\tif rv.Kind() == reflect.Ptr {\n\t\tvp := rv2i(rv).(*map[{{ .MapKey }}]{{ .Elem }})\n\t\tif v, changed := fastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(*vp, true, d); changed { *vp = v }\n\t} else {\n\t\tfastpathTV.{{ .MethodNamePfx \"Dec\" false }}V(rv2i(rv).(map[{{ .MapKey }}]{{ .Elem }}), false, d)\n\t}\n}\nfunc (f fastpathT) {{ .MethodNamePfx \"Dec\" false }}X(vp *map[{{ .MapKey }}]{{ .Elem }}, d *Decoder) {\n\tif v, changed := f.{{ .MethodNamePfx \"Dec\" false }}V(*vp, true, d); changed { *vp = v }\n}\nfunc (fastpathT) {{ .MethodNamePfx \"Dec\" false }}V(v map[{{ .MapKey }}]{{ .Elem }}, canChange bool, \n\td *Decoder) (_ map[{{ .MapKey }}]{{ .Elem }}, changed bool) {\n {{/*\n\t\t// if d.d.isContainerType(valueTypeNil) {d.d.TryDecodeAsNil()\n\t*/ -}}\n\tcontainerLen := d.mapStart()\n\tif canChange && v == nil {\n\t\tv = make(map[{{ .MapKey }}]{{ .Elem }}, decInferLen(containerLen, d.h.MaxInitLen, {{ .Size }}))\n\t\tchanged = true\n\t}\n\tif containerLen == 0 {\n\t\td.mapEnd()\n\t\treturn v, changed\n\t}\n\t{{if eq .Elem \"interface{}\" }}mapGet := v != nil && !d.h.MapValueReset && !d.h.InterfaceReset\n {{else if eq .Elem \"bytes\" \"[]byte\" }}mapGet := v != nil && !d.h.MapValueReset\n {{end -}}\n var mk {{ .MapKey }}\n\tvar mv {{ .Elem }}\n\thasLen := containerLen > 0\n\tfor j := 0; (hasLen && j < containerLen) || !(hasLen || d.d.CheckBreak()); j++ {\n\t\td.mapElemKey()\n\t\t{{ if eq .MapKey \"interface{}\" }}mk = nil \n\t\td.decode(&mk)\n\t\tif bv, bok := mk.([]byte); bok {\n\t\t\tmk = d.string(bv) {{/* // maps cannot have []byte as key. switch to string. */}}\n\t\t}{{ else }}mk = {{ decmd .MapKey }}{{ end }}\n\t\td.mapElemValue()\n\t\tif d.d.TryDecodeAsNil() {\n\t\t\tif v == nil {} else if d.h.DeleteOnNilMapValue { delete(v, mk) } else { v[mk] = {{ zerocmd .Elem }} }\n\t\t\tcontinue \n\t\t}\n\t\t{{ if eq .Elem \"interface{}\" \"[]byte\" \"bytes\" -}}\n\t\tif mapGet { mv = v[mk] } else { mv = nil }\n\t\t{{ end -}}\n\t\t{{ if eq .Elem \"interface{}\" -}}\n\t\td.decode(&mv)\n\t\t{{ else if eq .Elem \"[]byte\" \"bytes\" -}}\n\t\tmv = d.d.DecodeBytes(mv, false)\n\t\t{{ else -}}\n\t\tmv = {{ decmd .Elem }}\n\t\t{{ end -}}\n\t\tif v != nil { v[mk] = mv }\n\t}\n\td.mapEnd()\n\treturn v, changed\n}\n{{end}}{{end}}{{end}}\n" }, { "path": "vendor/github.com/ugorji/go/codec/fast-path.not.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build notfastpath\n\npackage codec\n\nimport \"reflect\"\n\nconst fastpathEnabled = false\n\n// The generated fast-path code is very large, and adds a few seconds to the build time.\n// This causes test execution, execution of small tools which use codec, etc\n// to take a long time.\n//\n// To mitigate, we now support the notfastpath tag.\n// This tag disables fastpath during build, allowing for faster build, test execution,\n// short-program runs, etc.\n\nfunc fastpathDecodeTypeSwitch(iv interface{}, d *Decoder) bool { return false }\nfunc fastpathEncodeTypeSwitch(iv interface{}, e *Encoder) bool { return false }\nfunc fastpathEncodeTypeSwitchSlice(iv interface{}, e *Encoder) bool { return false }\nfunc fastpathEncodeTypeSwitchMap(iv interface{}, e *Encoder) bool { return false }\nfunc fastpathDecodeSetZeroTypeSwitch(iv interface{}) bool { return false }\n\ntype fastpathT struct{}\ntype fastpathE struct {\n\trtid uintptr\n\trt reflect.Type\n\tencfn func(*Encoder, *codecFnInfo, reflect.Value)\n\tdecfn func(*Decoder, *codecFnInfo, reflect.Value)\n}\ntype fastpathA [0]fastpathE\n\nfunc (x fastpathA) index(rtid uintptr) int { return -1 }\n\nfunc (_ fastpathT) DecSliceUint8V(v []uint8, canChange bool, d *Decoder) (_ []uint8, changed bool) {\n\tfn := d.h.fn(uint8SliceTyp, true, true)\n\td.kSlice(&fn.i, reflect.ValueOf(&v).Elem())\n\treturn v, true\n}\n\nvar fastpathAV fastpathA\nvar fastpathTV fastpathT\n\n// ----\ntype TestMammoth2Wrapper struct{} // to allow testMammoth work in notfastpath mode\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen-dec-array.go.tmpl", "content": "{{var \"v\"}} := {{if not isArray}}*{{end}}{{ .Varname }}\n{{var \"h\"}}, {{var \"l\"}} := z.DecSliceHelperStart() {{/* // helper, containerLenS */}}{{if not isArray}}\nvar {{var \"c\"}} bool {{/* // changed */}}\n_ = {{var \"c\"}}{{end}}\nif {{var \"l\"}} == 0 {\n\t{{if isSlice }}if {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = []{{ .Typ }}{}\n\t\t{{var \"c\"}} = true\n\t} else if len({{var \"v\"}}) != 0 {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:0]\n\t\t{{var \"c\"}} = true\n\t} {{else if isChan }}if {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = make({{ .CTyp }}, 0)\n\t\t{{var \"c\"}} = true\n\t}\n {{end -}}\n} else {\n\t{{var \"hl\"}} := {{var \"l\"}} > 0\n\tvar {{var \"rl\"}} int\n\t_ = {{var \"rl\"}}\n\t{{if isSlice }} if {{var \"hl\"}} {\n\tif {{var \"l\"}} > cap({{var \"v\"}}) {\n\t\t{{var \"rl\"}} = z.DecInferLen({{var \"l\"}}, z.DecBasicHandle().MaxInitLen, {{ .Size }})\n\t\tif {{var \"rl\"}} <= cap({{var \"v\"}}) {\n\t\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"rl\"}}]\n\t\t} else {\n\t\t\t{{var \"v\"}} = make([]{{ .Typ }}, {{var \"rl\"}})\n\t\t}\n\t\t{{var \"c\"}} = true\n\t} else if {{var \"l\"}} != len({{var \"v\"}}) {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"l\"}}]\n\t\t{{var \"c\"}} = true\n\t}\n\t}\n {{end -}}\n\tvar {{var \"j\"}} int \n {{/* // var {{var \"dn\"}} bool */ -}}\n\tfor {{var \"j\"}} = 0; ({{var \"hl\"}} && {{var \"j\"}} < {{var \"l\"}}) || !({{var \"hl\"}} || r.CheckBreak()); {{var \"j\"}}++ { // bounds-check-elimination\n\t\t{{if not isArray}} if {{var \"j\"}} == 0 && {{var \"v\"}} == nil {\n\t\t\tif {{var \"hl\"}} {\n\t\t\t\t{{var \"rl\"}} = z.DecInferLen({{var \"l\"}}, z.DecBasicHandle().MaxInitLen, {{ .Size }})\n\t\t\t} else {\n\t\t\t\t{{var \"rl\"}} = {{if isSlice}}8{{else if isChan}}64{{end}}\n\t\t\t}\n\t\t\t{{var \"v\"}} = make({{if isSlice}}[]{{ .Typ }}{{else if isChan}}{{.CTyp}}{{end}}, {{var \"rl\"}})\n\t\t\t{{var \"c\"}} = true \n\t\t}\n {{end -}}\n\t\t{{var \"h\"}}.ElemContainerState({{var \"j\"}})\n {{/* {{var \"dn\"}} = r.TryDecodeAsNil() */}}{{/* commented out, as decLineVar handles this already each time */ -}}\n {{if isChan}}{{ $x := printf \"%[1]vvcx%[2]v\" .TempVar .Rand }}var {{$x}} {{ .Typ }}\n\t\t{{ decLineVar $x -}}\n\t\t{{var \"v\"}} <- {{ $x }}\n // println(\">>>> sending \", {{ $x }}, \" into \", {{var \"v\"}}) // TODO: remove this\n {{else}}{{/* // if indefinite, etc, then expand the slice if necessary */ -}}\n\t\tvar {{var \"db\"}} bool\n\t\tif {{var \"j\"}} >= len({{var \"v\"}}) {\n\t\t\t{{if isSlice }} {{var \"v\"}} = append({{var \"v\"}}, {{ zero }})\n\t\t\t{{var \"c\"}} = true\n\t\t\t{{else}} z.DecArrayCannotExpand(len(v), {{var \"j\"}}+1); {{var \"db\"}} = true\n\t\t\t{{end -}}\n\t\t}\n\t\tif {{var \"db\"}} {\n\t\t\tz.DecSwallow()\n\t\t} else {\n\t\t\t{{ $x := printf \"%[1]vv%[2]v[%[1]vj%[2]v]\" .TempVar .Rand }}{{ decLineVar $x -}}\n\t\t}\n {{end -}}\n\t}\n\t{{if isSlice}} if {{var \"j\"}} < len({{var \"v\"}}) {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"j\"}}]\n\t\t{{var \"c\"}} = true\n\t} else if {{var \"j\"}} == 0 && {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = make([]{{ .Typ }}, 0)\n\t\t{{var \"c\"}} = true\n\t}\n {{end -}}\n}\n{{var \"h\"}}.End()\n{{if not isArray }}if {{var \"c\"}} { \n\t*{{ .Varname }} = {{var \"v\"}}\n}\n{{end -}}\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen-dec-map.go.tmpl", "content": "{{var \"v\"}} := *{{ .Varname }}\n{{var \"l\"}} := z.DecReadMapStart()\n{{var \"bh\"}} := z.DecBasicHandle()\nif {{var \"v\"}} == nil {\n\t{{var \"rl\"}} := z.DecInferLen({{var \"l\"}}, {{var \"bh\"}}.MaxInitLen, {{ .Size }})\n\t{{var \"v\"}} = make(map[{{ .KTyp }}]{{ .Typ }}, {{var \"rl\"}})\n\t*{{ .Varname }} = {{var \"v\"}}\n}\nvar {{var \"mk\"}} {{ .KTyp }}\nvar {{var \"mv\"}} {{ .Typ }}\nvar {{var \"mg\"}}, {{var \"mdn\"}} {{if decElemKindPtr}}, {{var \"ms\"}}, {{var \"mok\"}}{{end}} bool\nif {{var \"bh\"}}.MapValueReset {\n\t{{if decElemKindPtr}}{{var \"mg\"}} = true\n\t{{else if decElemKindIntf}}if !{{var \"bh\"}}.InterfaceReset { {{var \"mg\"}} = true }\n\t{{else if not decElemKindImmutable}}{{var \"mg\"}} = true\n\t{{end}} }\nif {{var \"l\"}} != 0 {\n{{var \"hl\"}} := {{var \"l\"}} > 0 \n\tfor {{var \"j\"}} := 0; ({{var \"hl\"}} && {{var \"j\"}} < {{var \"l\"}}) || !({{var \"hl\"}} || r.CheckBreak()); {{var \"j\"}}++ {\n\tz.DecReadMapElemKey() {{/* z.DecSendContainerState(codecSelfer_containerMapKey{{ .Sfx }}) */}}\n\t{{ $x := printf \"%vmk%v\" .TempVar .Rand }}{{ decLineVarK $x -}}\n\t{{ if eq .KTyp \"interface{}\" }}{{/* // special case if a byte array. */ -}}\n if {{var \"bv\"}}, {{var \"bok\"}} := {{var \"mk\"}}.([]byte); {{var \"bok\"}} {\n\t\t{{var \"mk\"}} = string({{var \"bv\"}})\n\t}\n {{ end -}}\n {{if decElemKindPtr -}}\n\t{{var \"ms\"}} = true\n {{end -}}\n\tif {{var \"mg\"}} {\n\t\t{{if decElemKindPtr -}}\n {{var \"mv\"}}, {{var \"mok\"}} = {{var \"v\"}}[{{var \"mk\"}}] \n\t\tif {{var \"mok\"}} {\n\t\t\t{{var \"ms\"}} = false\n\t\t}\n {{else -}}\n {{var \"mv\"}} = {{var \"v\"}}[{{var \"mk\"}}]\n {{end -}}\n\t} {{if not decElemKindImmutable}}else { {{var \"mv\"}} = {{decElemZero}} }{{end}}\n\tz.DecReadMapElemValue() {{/* z.DecSendContainerState(codecSelfer_containerMapValue{{ .Sfx }}) */}}\n\t{{var \"mdn\"}} = false\n\t{{ $x := printf \"%vmv%v\" .TempVar .Rand }}{{ $y := printf \"%vmdn%v\" .TempVar .Rand }}{{ decLineVar $x $y -}}\n\tif {{var \"mdn\"}} {\n\t\tif {{ var \"bh\" }}.DeleteOnNilMapValue { delete({{var \"v\"}}, {{var \"mk\"}}) } else { {{var \"v\"}}[{{var \"mk\"}}] = {{decElemZero}} }\n\t} else if {{if decElemKindPtr}} {{var \"ms\"}} && {{end}} {{var \"v\"}} != nil {\n\t\t{{var \"v\"}}[{{var \"mk\"}}] = {{var \"mv\"}}\n\t}\n}\n} // else len==0: TODO: Should we clear map entries?\nz.DecReadMapEnd() {{/* z.DecSendContainerState(codecSelfer_containerMapEnd{{ .Sfx }}) */}}\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen-enc-chan.go.tmpl", "content": "{{.Label}}:\nswitch timeout{{.Sfx}} := z.EncBasicHandle().ChanRecvTimeout; {\ncase timeout{{.Sfx}} == 0: // only consume available\n\tfor {\n\t\tselect {\n\t\tcase b{{.Sfx}} := <-{{.Chan}}:\n\t\t\t{{ .Slice }} = append({{.Slice}}, b{{.Sfx}})\n\t\tdefault:\n\t\t\tbreak {{.Label}}\n\t\t}\n\t}\ncase timeout{{.Sfx}} > 0: // consume until timeout\n\ttt{{.Sfx}} := time.NewTimer(timeout{{.Sfx}})\n\tfor {\n\t\tselect {\n\t\tcase b{{.Sfx}} := <-{{.Chan}}:\n\t\t\t{{.Slice}} = append({{.Slice}}, b{{.Sfx}})\n\t\tcase <-tt{{.Sfx}}.C:\n\t\t\t// close(tt.C)\n\t\t\tbreak {{.Label}}\n\t\t}\n\t}\ndefault: // consume until close\n\tfor b{{.Sfx}} := range {{.Chan}} {\n\t\t{{.Slice}} = append({{.Slice}}, b{{.Sfx}})\n\t}\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen-helper.generated.go", "content": "// comment this out // + build ignore\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from gen-helper.go.tmpl - DO NOT EDIT.\n\npackage codec\n\nimport (\n\t\"encoding\"\n\t\"reflect\"\n)\n\n// GenVersion is the current version of codecgen.\nconst GenVersion = 12\n\n// This file is used to generate helper code for codecgen.\n// The values here i.e. genHelper(En|De)coder are not to be used directly by\n// library users. They WILL change continuously and without notice.\n\n// GenHelperEncoder is exported so that it can be used externally by codecgen.\n//\n// Library users: DO NOT USE IT DIRECTLY. IT WILL CHANGE CONTINOUSLY WITHOUT NOTICE.\nfunc GenHelperEncoder(e *Encoder) (ge genHelperEncoder, ee genHelperEncDriver) {\n\tge = genHelperEncoder{e: e}\n\tee = genHelperEncDriver{encDriver: e.e}\n\treturn\n}\n\n// GenHelperDecoder is exported so that it can be used externally by codecgen.\n//\n// Library users: DO NOT USE IT DIRECTLY. IT WILL CHANGE CONTINOUSLY WITHOUT NOTICE.\nfunc GenHelperDecoder(d *Decoder) (gd genHelperDecoder, dd genHelperDecDriver) {\n\tgd = genHelperDecoder{d: d}\n\tdd = genHelperDecDriver{decDriver: d.d}\n\treturn\n}\n\ntype genHelperEncDriver struct {\n\tencDriver\n}\n\ntype genHelperDecDriver struct {\n\tdecDriver\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\ntype genHelperEncoder struct {\n\tM must\n\tF fastpathT\n\te *Encoder\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\ntype genHelperDecoder struct {\n\tC checkOverflow\n\tF fastpathT\n\td *Decoder\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBasicHandle() *BasicHandle {\n\treturn f.e.h\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBinary() bool {\n\treturn f.e.be // f.e.hh.isBinaryEncoding()\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) IsJSONHandle() bool {\n\treturn f.e.js\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncFallback(iv interface{}) {\n\t// f.e.encodeI(iv, false, false)\n\tf.e.encodeValue(reflect.ValueOf(iv), nil, false)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncTextMarshal(iv encoding.TextMarshaler) {\n\tbs, fnerr := iv.MarshalText()\n\tf.e.marshalUtf8(bs, fnerr)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncJSONMarshal(iv jsonMarshaler) {\n\tbs, fnerr := iv.MarshalJSON()\n\tf.e.marshalAsis(bs, fnerr)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBinaryMarshal(iv encoding.BinaryMarshaler) {\n\tbs, fnerr := iv.MarshalBinary()\n\tf.e.marshalRaw(bs, fnerr)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncRaw(iv Raw) { f.e.rawBytes(iv) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) I2Rtid(v interface{}) uintptr {\n\treturn i2rtid(v)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) Extension(rtid uintptr) (xfn *extTypeTagFn) {\n\treturn f.e.h.getExt(rtid)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncExtension(v interface{}, xfFn *extTypeTagFn) {\n\tf.e.e.EncodeExt(v, xfFn.tag, xfFn.ext, f.e)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) WriteStr(s string) {\n\tf.e.w().writestr(s)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) BytesView(v string) []byte { return bytesView(v) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapStart(length int) { f.e.mapStart(length) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapEnd() { f.e.mapEnd() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayStart(length int) { f.e.arrayStart(length) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayEnd() { f.e.arrayEnd() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayElem() { f.e.arrayElem() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapElemKey() { f.e.mapElemKey() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapElemValue() { f.e.mapElemValue() }\n\n// ---------------- DECODER FOLLOWS -----------------\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBasicHandle() *BasicHandle {\n\treturn f.d.h\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBinary() bool {\n\treturn f.d.be // f.d.hh.isBinaryEncoding()\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecSwallow() { f.d.swallow() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecScratchBuffer() []byte {\n\treturn f.d.b[:]\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecScratchArrayBuffer() *[decScratchByteArrayLen]byte {\n\treturn &f.d.b\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecFallback(iv interface{}, chkPtr bool) {\n\trv := reflect.ValueOf(iv)\n\tif chkPtr {\n\t\trv = f.d.ensureDecodeable(rv)\n\t}\n\tf.d.decodeValue(rv, nil, false)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecSliceHelperStart() (decSliceHelper, int) {\n\treturn f.d.decSliceHelperStart()\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecStructFieldNotFound(index int, name string) {\n\tf.d.structFieldNotFound(index, name)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecArrayCannotExpand(sliceLen, streamLen int) {\n\tf.d.arrayCannotExpand(sliceLen, streamLen)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecTextUnmarshal(tm encoding.TextUnmarshaler) {\n\tif fnerr := tm.UnmarshalText(f.d.d.DecodeStringAsBytes()); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecJSONUnmarshal(tm jsonUnmarshaler) {\n\t// bs := f.dd.DecodeStringAsBytes()\n\t// grab the bytes to be read, as UnmarshalJSON needs the full JSON so as to unmarshal it itself.\n\tif fnerr := tm.UnmarshalJSON(f.d.nextValueBytes()); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBinaryUnmarshal(bm encoding.BinaryUnmarshaler) {\n\tif fnerr := bm.UnmarshalBinary(f.d.d.DecodeBytes(nil, true)); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecRaw() []byte { return f.d.rawBytes() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) IsJSONHandle() bool {\n\treturn f.d.js\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) I2Rtid(v interface{}) uintptr {\n\treturn i2rtid(v)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) Extension(rtid uintptr) (xfn *extTypeTagFn) {\n\treturn f.d.h.getExt(rtid)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecExtension(v interface{}, xfFn *extTypeTagFn) {\n\tf.d.d.DecodeExt(v, xfFn.tag, xfFn.ext)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecInferLen(clen, maxlen, unit int) (rvlen int) {\n\treturn decInferLen(clen, maxlen, unit)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) StringView(v []byte) string { return stringView(v) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapStart() int { return f.d.mapStart() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapEnd() { f.d.mapEnd() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayStart() int { return f.d.arrayStart() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayEnd() { f.d.arrayEnd() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayElem() { f.d.arrayElem() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapElemKey() { f.d.mapElemKey() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapElemValue() { f.d.mapElemValue() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecDecodeFloat32() float64 { return f.d.decodeFloat32() }\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen-helper.go.tmpl", "content": "// comment this out // + build ignore\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from gen-helper.go.tmpl - DO NOT EDIT.\n\npackage codec\n\nimport (\n\t\"encoding\"\n\t\"reflect\"\n)\n\n// GenVersion is the current version of codecgen.\nconst GenVersion = {{ .Version }} \n\n// This file is used to generate helper code for codecgen. \n// The values here i.e. genHelper(En|De)coder are not to be used directly by \n// library users. They WILL change continuously and without notice.\n\n{{/*\n// To help enforce this, we create an unexported type with exported members.\n// The only way to get the type is via the one exported type that we control (somewhat).\n//\n// When static codecs are created for types, they will use this value\n// to perform encoding or decoding of primitives or known slice or map types.\n*/ -}}\n\n// GenHelperEncoder is exported so that it can be used externally by codecgen.\n//\n// Library users: DO NOT USE IT DIRECTLY. IT WILL CHANGE CONTINOUSLY WITHOUT NOTICE.\nfunc GenHelperEncoder(e *Encoder) (ge genHelperEncoder, ee genHelperEncDriver) {\n\tge = genHelperEncoder{e: e}\n\tee = genHelperEncDriver{encDriver: e.e}\n\treturn \n}\n\n// GenHelperDecoder is exported so that it can be used externally by codecgen.\n//\n// Library users: DO NOT USE IT DIRECTLY. IT WILL CHANGE CONTINOUSLY WITHOUT NOTICE.\nfunc GenHelperDecoder(d *Decoder) (gd genHelperDecoder, dd genHelperDecDriver) {\n\tgd = genHelperDecoder{d: d}\n\tdd = genHelperDecDriver{decDriver: d.d}\n\treturn\n}\n\ntype genHelperEncDriver struct {\n\tencDriver\n}\n\ntype genHelperDecDriver struct {\n\tdecDriver\n}\n\n{{/*\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (x genHelperEncDriver) EncStructFieldKey(keyType valueType, s string) {\n\tencStructFieldKey(s, x.encDriver, nil, keyType, false, false)\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (x genHelperDecDriver) DecStructFieldKey(keyType valueType, buf *[decScratchByteArrayLen]byte) []byte {\n\treturn decStructFieldKey(x.decDriver, keyType, buf)\n}\n*/ -}}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\ntype genHelperEncoder struct {\n\tM must\n\tF fastpathT \n\te *Encoder\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\ntype genHelperDecoder struct {\n\tC checkOverflow\n\tF fastpathT \n\td *Decoder\n}\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBasicHandle() *BasicHandle {\n\treturn f.e.h\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBinary() bool {\n\treturn f.e.be // f.e.hh.isBinaryEncoding()\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) IsJSONHandle() bool {\n\treturn f.e.js\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncFallback(iv interface{}) {\n\t// f.e.encodeI(iv, false, false)\n\tf.e.encodeValue(reflect.ValueOf(iv), nil, false)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncTextMarshal(iv encoding.TextMarshaler) {\n\tbs, fnerr := iv.MarshalText()\n\tf.e.marshalUtf8(bs, fnerr)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncJSONMarshal(iv jsonMarshaler) {\n\tbs, fnerr := iv.MarshalJSON()\n\tf.e.marshalAsis(bs, fnerr)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncBinaryMarshal(iv encoding.BinaryMarshaler) {\n\tbs, fnerr := iv.MarshalBinary()\n\tf.e.marshalRaw(bs, fnerr)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncRaw(iv Raw) { f.e.rawBytes(iv) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) I2Rtid(v interface{}) uintptr {\n\treturn i2rtid(v)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) Extension(rtid uintptr) (xfn *extTypeTagFn) {\n\treturn f.e.h.getExt(rtid)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncExtension(v interface{}, xfFn *extTypeTagFn) {\n\tf.e.e.EncodeExt(v, xfFn.tag, xfFn.ext, f.e)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) WriteStr(s string) {\n\tf.e.w().writestr(s)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) BytesView(v string) []byte { return bytesView(v) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapStart(length int) { f.e.mapStart(length) }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapEnd() { f.e.mapEnd() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayStart(length int) { f.e.arrayStart(length) }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayEnd() { f.e.arrayEnd() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteArrayElem() { f.e.arrayElem() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapElemKey() { f.e.mapElemKey() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperEncoder) EncWriteMapElemValue() { f.e.mapElemValue() }\n\n// ---------------- DECODER FOLLOWS -----------------\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBasicHandle() *BasicHandle {\n\treturn f.d.h\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBinary() bool {\n return f.d.be // f.d.hh.isBinaryEncoding()\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecSwallow() { f.d.swallow() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecScratchBuffer() []byte {\n\treturn f.d.b[:]\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecScratchArrayBuffer() *[decScratchByteArrayLen]byte {\n\treturn &f.d.b\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecFallback(iv interface{}, chkPtr bool) {\n\trv := reflect.ValueOf(iv)\n\tif chkPtr {\n\t\trv = f.d.ensureDecodeable(rv)\n\t}\n\tf.d.decodeValue(rv, nil, false)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecSliceHelperStart() (decSliceHelper, int) {\n\treturn f.d.decSliceHelperStart()\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecStructFieldNotFound(index int, name string) {\n\tf.d.structFieldNotFound(index, name)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecArrayCannotExpand(sliceLen, streamLen int) {\n\tf.d.arrayCannotExpand(sliceLen, streamLen)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecTextUnmarshal(tm encoding.TextUnmarshaler) {\n\tif fnerr := tm.UnmarshalText(f.d.d.DecodeStringAsBytes()); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecJSONUnmarshal(tm jsonUnmarshaler) {\n\t// bs := f.dd.DecodeStringAsBytes()\n\t// grab the bytes to be read, as UnmarshalJSON needs the full JSON so as to unmarshal it itself.\n\tif fnerr := tm.UnmarshalJSON(f.d.nextValueBytes()); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecBinaryUnmarshal(bm encoding.BinaryUnmarshaler) {\n\tif fnerr := bm.UnmarshalBinary(f.d.d.DecodeBytes(nil, true)); fnerr != nil {\n\t\tpanic(fnerr)\n\t}\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecRaw() []byte {\treturn f.d.rawBytes() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) IsJSONHandle() bool {\n\treturn f.d.js \n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) I2Rtid(v interface{}) uintptr {\n\treturn i2rtid(v)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) Extension(rtid uintptr) (xfn *extTypeTagFn) {\n\treturn f.d.h.getExt(rtid)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecExtension(v interface{}, xfFn *extTypeTagFn) {\n\tf.d.d.DecodeExt(v, xfFn.tag, xfFn.ext)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecInferLen(clen, maxlen, unit int) (rvlen int) {\n\treturn decInferLen(clen, maxlen, unit)\n}\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) StringView(v []byte) string { return stringView(v) }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapStart() int { return f.d.mapStart() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapEnd() { f.d.mapEnd() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayStart() int { return f.d.arrayStart() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayEnd() { f.d.arrayEnd() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadArrayElem() { f.d.arrayElem() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapElemKey() { f.d.mapElemKey() }\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecReadMapElemValue() { f.d.mapElemValue() }\n\n// FOR USE BY CODECGEN ONLY. IT *WILL* CHANGE WITHOUT NOTICE. *DO NOT USE*\nfunc (f genHelperDecoder) DecDecodeFloat32() float64 { return f.d.decodeFloat32() }\n\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen.generated.go", "content": "// +build codecgen.exec\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\n// DO NOT EDIT. THIS FILE IS AUTO-GENERATED FROM gen-dec-(map|array).go.tmpl\n\nconst genDecMapTmpl = `\n{{var \"v\"}} := *{{ .Varname }}\n{{var \"l\"}} := z.DecReadMapStart()\n{{var \"bh\"}} := z.DecBasicHandle()\nif {{var \"v\"}} == nil {\n\t{{var \"rl\"}} := z.DecInferLen({{var \"l\"}}, {{var \"bh\"}}.MaxInitLen, {{ .Size }})\n\t{{var \"v\"}} = make(map[{{ .KTyp }}]{{ .Typ }}, {{var \"rl\"}})\n\t*{{ .Varname }} = {{var \"v\"}}\n}\nvar {{var \"mk\"}} {{ .KTyp }}\nvar {{var \"mv\"}} {{ .Typ }}\nvar {{var \"mg\"}}, {{var \"mdn\"}} {{if decElemKindPtr}}, {{var \"ms\"}}, {{var \"mok\"}}{{end}} bool\nif {{var \"bh\"}}.MapValueReset {\n\t{{if decElemKindPtr}}{{var \"mg\"}} = true\n\t{{else if decElemKindIntf}}if !{{var \"bh\"}}.InterfaceReset { {{var \"mg\"}} = true }\n\t{{else if not decElemKindImmutable}}{{var \"mg\"}} = true\n\t{{end}} }\nif {{var \"l\"}} != 0 {\n{{var \"hl\"}} := {{var \"l\"}} > 0 \n\tfor {{var \"j\"}} := 0; ({{var \"hl\"}} && {{var \"j\"}} < {{var \"l\"}}) || !({{var \"hl\"}} || r.CheckBreak()); {{var \"j\"}}++ {\n\tz.DecReadMapElemKey() {{/* z.DecSendContainerState(codecSelfer_containerMapKey{{ .Sfx }}) */}}\n\t{{ $x := printf \"%vmk%v\" .TempVar .Rand }}{{ decLineVarK $x -}}\n\t{{ if eq .KTyp \"interface{}\" }}{{/* // special case if a byte array. */ -}}\n if {{var \"bv\"}}, {{var \"bok\"}} := {{var \"mk\"}}.([]byte); {{var \"bok\"}} {\n\t\t{{var \"mk\"}} = string({{var \"bv\"}})\n\t}\n {{ end -}}\n {{if decElemKindPtr -}}\n\t{{var \"ms\"}} = true\n {{end -}}\n\tif {{var \"mg\"}} {\n\t\t{{if decElemKindPtr -}}\n {{var \"mv\"}}, {{var \"mok\"}} = {{var \"v\"}}[{{var \"mk\"}}] \n\t\tif {{var \"mok\"}} {\n\t\t\t{{var \"ms\"}} = false\n\t\t}\n {{else -}}\n {{var \"mv\"}} = {{var \"v\"}}[{{var \"mk\"}}]\n {{end -}}\n\t} {{if not decElemKindImmutable}}else { {{var \"mv\"}} = {{decElemZero}} }{{end}}\n\tz.DecReadMapElemValue() {{/* z.DecSendContainerState(codecSelfer_containerMapValue{{ .Sfx }}) */}}\n\t{{var \"mdn\"}} = false\n\t{{ $x := printf \"%vmv%v\" .TempVar .Rand }}{{ $y := printf \"%vmdn%v\" .TempVar .Rand }}{{ decLineVar $x $y -}}\n\tif {{var \"mdn\"}} {\n\t\tif {{ var \"bh\" }}.DeleteOnNilMapValue { delete({{var \"v\"}}, {{var \"mk\"}}) } else { {{var \"v\"}}[{{var \"mk\"}}] = {{decElemZero}} }\n\t} else if {{if decElemKindPtr}} {{var \"ms\"}} && {{end}} {{var \"v\"}} != nil {\n\t\t{{var \"v\"}}[{{var \"mk\"}}] = {{var \"mv\"}}\n\t}\n}\n} // else len==0: TODO: Should we clear map entries?\nz.DecReadMapEnd() {{/* z.DecSendContainerState(codecSelfer_containerMapEnd{{ .Sfx }}) */}}\n`\n\nconst genDecListTmpl = `\n{{var \"v\"}} := {{if not isArray}}*{{end}}{{ .Varname }}\n{{var \"h\"}}, {{var \"l\"}} := z.DecSliceHelperStart() {{/* // helper, containerLenS */}}{{if not isArray}}\nvar {{var \"c\"}} bool {{/* // changed */}}\n_ = {{var \"c\"}}{{end}}\nif {{var \"l\"}} == 0 {\n\t{{if isSlice }}if {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = []{{ .Typ }}{}\n\t\t{{var \"c\"}} = true\n\t} else if len({{var \"v\"}}) != 0 {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:0]\n\t\t{{var \"c\"}} = true\n\t} {{else if isChan }}if {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = make({{ .CTyp }}, 0)\n\t\t{{var \"c\"}} = true\n\t}\n {{end -}}\n} else {\n\t{{var \"hl\"}} := {{var \"l\"}} > 0\n\tvar {{var \"rl\"}} int\n\t_ = {{var \"rl\"}}\n\t{{if isSlice }} if {{var \"hl\"}} {\n\tif {{var \"l\"}} > cap({{var \"v\"}}) {\n\t\t{{var \"rl\"}} = z.DecInferLen({{var \"l\"}}, z.DecBasicHandle().MaxInitLen, {{ .Size }})\n\t\tif {{var \"rl\"}} <= cap({{var \"v\"}}) {\n\t\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"rl\"}}]\n\t\t} else {\n\t\t\t{{var \"v\"}} = make([]{{ .Typ }}, {{var \"rl\"}})\n\t\t}\n\t\t{{var \"c\"}} = true\n\t} else if {{var \"l\"}} != len({{var \"v\"}}) {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"l\"}}]\n\t\t{{var \"c\"}} = true\n\t}\n\t}\n {{end -}}\n\tvar {{var \"j\"}} int \n {{/* // var {{var \"dn\"}} bool */ -}}\n\tfor {{var \"j\"}} = 0; ({{var \"hl\"}} && {{var \"j\"}} < {{var \"l\"}}) || !({{var \"hl\"}} || r.CheckBreak()); {{var \"j\"}}++ { // bounds-check-elimination\n\t\t{{if not isArray}} if {{var \"j\"}} == 0 && {{var \"v\"}} == nil {\n\t\t\tif {{var \"hl\"}} {\n\t\t\t\t{{var \"rl\"}} = z.DecInferLen({{var \"l\"}}, z.DecBasicHandle().MaxInitLen, {{ .Size }})\n\t\t\t} else {\n\t\t\t\t{{var \"rl\"}} = {{if isSlice}}8{{else if isChan}}64{{end}}\n\t\t\t}\n\t\t\t{{var \"v\"}} = make({{if isSlice}}[]{{ .Typ }}{{else if isChan}}{{.CTyp}}{{end}}, {{var \"rl\"}})\n\t\t\t{{var \"c\"}} = true \n\t\t}\n {{end -}}\n\t\t{{var \"h\"}}.ElemContainerState({{var \"j\"}})\n {{/* {{var \"dn\"}} = r.TryDecodeAsNil() */}}{{/* commented out, as decLineVar handles this already each time */ -}}\n {{if isChan}}{{ $x := printf \"%[1]vvcx%[2]v\" .TempVar .Rand }}var {{$x}} {{ .Typ }}\n\t\t{{ decLineVar $x -}}\n\t\t{{var \"v\"}} <- {{ $x }}\n // println(\">>>> sending \", {{ $x }}, \" into \", {{var \"v\"}}) // TODO: remove this\n {{else}}{{/* // if indefinite, etc, then expand the slice if necessary */ -}}\n\t\tvar {{var \"db\"}} bool\n\t\tif {{var \"j\"}} >= len({{var \"v\"}}) {\n\t\t\t{{if isSlice }} {{var \"v\"}} = append({{var \"v\"}}, {{ zero }})\n\t\t\t{{var \"c\"}} = true\n\t\t\t{{else}} z.DecArrayCannotExpand(len(v), {{var \"j\"}}+1); {{var \"db\"}} = true\n\t\t\t{{end -}}\n\t\t}\n\t\tif {{var \"db\"}} {\n\t\t\tz.DecSwallow()\n\t\t} else {\n\t\t\t{{ $x := printf \"%[1]vv%[2]v[%[1]vj%[2]v]\" .TempVar .Rand }}{{ decLineVar $x -}}\n\t\t}\n {{end -}}\n\t}\n\t{{if isSlice}} if {{var \"j\"}} < len({{var \"v\"}}) {\n\t\t{{var \"v\"}} = {{var \"v\"}}[:{{var \"j\"}}]\n\t\t{{var \"c\"}} = true\n\t} else if {{var \"j\"}} == 0 && {{var \"v\"}} == nil {\n\t\t{{var \"v\"}} = make([]{{ .Typ }}, 0)\n\t\t{{var \"c\"}} = true\n\t}\n {{end -}}\n}\n{{var \"h\"}}.End()\n{{if not isArray }}if {{var \"c\"}} { \n\t*{{ .Varname }} = {{var \"v\"}}\n}\n{{end -}}\n`\n\nconst genEncChanTmpl = `\n{{.Label}}:\nswitch timeout{{.Sfx}} := z.EncBasicHandle().ChanRecvTimeout; {\ncase timeout{{.Sfx}} == 0: // only consume available\n\tfor {\n\t\tselect {\n\t\tcase b{{.Sfx}} := <-{{.Chan}}:\n\t\t\t{{ .Slice }} = append({{.Slice}}, b{{.Sfx}})\n\t\tdefault:\n\t\t\tbreak {{.Label}}\n\t\t}\n\t}\ncase timeout{{.Sfx}} > 0: // consume until timeout\n\ttt{{.Sfx}} := time.NewTimer(timeout{{.Sfx}})\n\tfor {\n\t\tselect {\n\t\tcase b{{.Sfx}} := <-{{.Chan}}:\n\t\t\t{{.Slice}} = append({{.Slice}}, b{{.Sfx}})\n\t\tcase <-tt{{.Sfx}}.C:\n\t\t\t// close(tt.C)\n\t\t\tbreak {{.Label}}\n\t\t}\n\t}\ndefault: // consume until close\n\tfor b{{.Sfx}} := range {{.Chan}} {\n\t\t{{.Slice}} = append({{.Slice}}, b{{.Sfx}})\n\t}\n}\n`\n" }, { "path": "vendor/github.com/ugorji/go/codec/gen.go", "content": "// +build codecgen.exec\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"bytes\"\n\t\"encoding/base64\"\n\t\"errors\"\n\t\"fmt\"\n\t\"go/format\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"math/rand\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"text/template\"\n\t\"time\"\n\t\"unicode\"\n\t\"unicode/utf8\"\n)\n\n// ---------------------------------------------------\n// codecgen supports the full cycle of reflection-based codec:\n// - RawExt\n// - Raw\n// - Extensions\n// - (Binary|Text|JSON)(Unm|M)arshal\n// - generic by-kind\n//\n// This means that, for dynamic things, we MUST use reflection to at least get the reflect.Type.\n// In those areas, we try to only do reflection or interface-conversion when NECESSARY:\n// - Extensions, only if Extensions are configured.\n//\n// However, codecgen doesn't support the following:\n// - Canonical option. (codecgen IGNORES it currently)\n// This is just because it has not been implemented.\n// - MissingFielder implementation.\n// If a type implements MissingFielder, it is completely ignored by codecgen.\n//\n// During encode/decode, Selfer takes precedence.\n// A type implementing Selfer will know how to encode/decode itself statically.\n//\n// The following field types are supported:\n// array: [n]T\n// slice: []T\n// map: map[K]V\n// primitive: [u]int[n], float(32|64), bool, string\n// struct\n//\n// ---------------------------------------------------\n// Note that a Selfer cannot call (e|d).(En|De)code on itself,\n// as this will cause a circular reference, as (En|De)code will call Selfer methods.\n// Any type that implements Selfer must implement completely and not fallback to (En|De)code.\n//\n// In addition, code in this file manages the generation of fast-path implementations of\n// encode/decode of slices/maps of primitive keys/values.\n//\n// Users MUST re-generate their implementations whenever the code shape changes.\n// The generated code will panic if it was generated with a version older than the supporting library.\n// ---------------------------------------------------\n//\n// codec framework is very feature rich.\n// When encoding or decoding into an interface, it depends on the runtime type of the interface.\n// The type of the interface may be a named type, an extension, etc.\n// Consequently, we fallback to runtime codec for encoding/decoding interfaces.\n// In addition, we fallback for any value which cannot be guaranteed at runtime.\n// This allows us support ANY value, including any named types, specifically those which\n// do not implement our interfaces (e.g. Selfer).\n//\n// This explains some slowness compared to other code generation codecs (e.g. msgp).\n// This reduction in speed is only seen when your refers to interfaces,\n// e.g. type T struct { A interface{}; B []interface{}; C map[string]interface{} }\n//\n// codecgen will panic if the file was generated with an old version of the library in use.\n//\n// Note:\n// It was a conscious decision to have gen.go always explicitly call EncodeNil or TryDecodeAsNil.\n// This way, there isn't a function call overhead just to see that we should not enter a block of code.\n//\n// Note:\n// codecgen-generated code depends on the variables defined by fast-path.generated.go.\n// consequently, you cannot run with tags \"codecgen notfastpath\".\n\n// GenVersion is the current version of codecgen.\n//\n// NOTE: Increment this value each time codecgen changes fundamentally.\n// Fundamental changes are:\n// - helper methods change (signature change, new ones added, some removed, etc)\n// - codecgen command line changes\n//\n// v1: Initial Version\n// v2:\n// v3: Changes for Kubernetes:\n// changes in signature of some unpublished helper methods and codecgen cmdline arguments.\n// v4: Removed separator support from (en|de)cDriver, and refactored codec(gen)\n// v5: changes to support faster json decoding. Let encoder/decoder maintain state of collections.\n// v6: removed unsafe from gen, and now uses codecgen.exec tag\n// v7:\n// v8: current - we now maintain compatibility with old generated code.\n// v9: skipped\n// v10: modified encDriver and decDriver interfaces.\n// v11: remove deprecated methods of encDriver and decDriver.\n// v12: removed deprecated methods from genHelper and changed container tracking logic\nconst genVersion = 12\n\nconst (\n\tgenCodecPkg = \"codec1978\"\n\tgenTempVarPfx = \"yy\"\n\tgenTopLevelVarName = \"x\"\n\n\t// ignore canBeNil parameter, and always set to true.\n\t// This is because nil can appear anywhere, so we should always check.\n\tgenAnythingCanBeNil = true\n\n\t// if genUseOneFunctionForDecStructMap, make a single codecDecodeSelferFromMap function;\n\t// else make codecDecodeSelferFromMap{LenPrefix,CheckBreak} so that conditionals\n\t// are not executed a lot.\n\t//\n\t// From testing, it didn't make much difference in runtime, so keep as true (one function only)\n\tgenUseOneFunctionForDecStructMap = true\n\n\t// genFastpathCanonical configures whether we support Canonical in fast path.\n\t// The savings is not much.\n\t//\n\t// NOTE: This MUST ALWAYS BE TRUE. fast-path.go.tmp doesn't handle it being false.\n\tgenFastpathCanonical = true // MUST be true\n\n\t// genFastpathTrimTypes configures whether we trim uncommon fastpath types.\n\tgenFastpathTrimTypes = true\n)\n\ntype genStructMapStyle uint8\n\nconst (\n\tgenStructMapStyleConsolidated genStructMapStyle = iota\n\tgenStructMapStyleLenPrefix\n\tgenStructMapStyleCheckBreak\n)\n\nvar (\n\terrGenAllTypesSamePkg = errors.New(\"All types must be in the same package\")\n\terrGenExpectArrayOrMap = errors.New(\"unexpected type. Expecting array/map/slice\")\n\n\tgenBase64enc = base64.NewEncoding(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789__\")\n\tgenQNameRegex = regexp.MustCompile(`[A-Za-z_.]+`)\n)\n\ntype genBuf struct {\n\tbuf []byte\n}\n\nfunc (x *genBuf) s(s string) *genBuf { x.buf = append(x.buf, s...); return x }\nfunc (x *genBuf) b(s []byte) *genBuf { x.buf = append(x.buf, s...); return x }\nfunc (x *genBuf) v() string { return string(x.buf) }\nfunc (x *genBuf) f(s string, args ...interface{}) { x.s(fmt.Sprintf(s, args...)) }\nfunc (x *genBuf) reset() {\n\tif x.buf != nil {\n\t\tx.buf = x.buf[:0]\n\t}\n}\n\n// genRunner holds some state used during a Gen run.\ntype genRunner struct {\n\tw io.Writer // output\n\tc uint64 // counter used for generating varsfx\n\tf uint64 // counter used for saying false\n\n\tt []reflect.Type // list of types to run selfer on\n\ttc reflect.Type // currently running selfer on this type\n\tte map[uintptr]bool // types for which the encoder has been created\n\ttd map[uintptr]bool // types for which the decoder has been created\n\tcp string // codec import path\n\n\tim map[string]reflect.Type // imports to add\n\timn map[string]string // package names of imports to add\n\timc uint64 // counter for import numbers\n\n\tis map[reflect.Type]struct{} // types seen during import search\n\tbp string // base PkgPath, for which we are generating for\n\n\tcpfx string // codec package prefix\n\n\ttm map[reflect.Type]struct{} // types for which enc/dec must be generated\n\tts []reflect.Type // types for which enc/dec must be generated\n\n\txs string // top level variable/constant suffix\n\thn string // fn helper type name\n\n\tti *TypeInfos\n\t// rr *rand.Rand // random generator for file-specific types\n\n\tnx bool // no extensions\n}\n\ntype genIfClause struct {\n\thasIf bool\n}\n\nfunc (g *genIfClause) end(x *genRunner) {\n\tif g.hasIf {\n\t\tx.line(\"}\")\n\t}\n}\n\nfunc (g *genIfClause) c(last bool) (v string) {\n\tif last {\n\t\tif g.hasIf {\n\t\t\tv = \" } else { \"\n\t\t}\n\t} else if g.hasIf {\n\t\tv = \" } else if \"\n\t} else {\n\t\tv = \"if \"\n\t\tg.hasIf = true\n\t}\n\treturn\n}\n\n// Gen will write a complete go file containing Selfer implementations for each\n// type passed. All the types must be in the same package.\n//\n// Library users: DO NOT USE IT DIRECTLY. IT WILL CHANGE CONTINUOUSLY WITHOUT NOTICE.\nfunc Gen(w io.Writer, buildTags, pkgName, uid string, noExtensions bool,\n\tti *TypeInfos, typ ...reflect.Type) {\n\t// All types passed to this method do not have a codec.Selfer method implemented directly.\n\t// codecgen already checks the AST and skips any types that define the codec.Selfer methods.\n\t// Consequently, there's no need to check and trim them if they implement codec.Selfer\n\n\tif len(typ) == 0 {\n\t\treturn\n\t}\n\tx := genRunner{\n\t\tw: w,\n\t\tt: typ,\n\t\tte: make(map[uintptr]bool),\n\t\ttd: make(map[uintptr]bool),\n\t\tim: make(map[string]reflect.Type),\n\t\timn: make(map[string]string),\n\t\tis: make(map[reflect.Type]struct{}),\n\t\ttm: make(map[reflect.Type]struct{}),\n\t\tts: []reflect.Type{},\n\t\tbp: genImportPath(typ[0]),\n\t\txs: uid,\n\t\tti: ti,\n\t\tnx: noExtensions,\n\t}\n\tif x.ti == nil {\n\t\tx.ti = defTypeInfos\n\t}\n\tif x.xs == \"\" {\n\t\trr := rand.New(rand.NewSource(time.Now().UnixNano()))\n\t\tx.xs = strconv.FormatInt(rr.Int63n(9999), 10)\n\t}\n\n\t// gather imports first:\n\tx.cp = genImportPath(reflect.TypeOf(x))\n\tx.imn[x.cp] = genCodecPkg\n\tfor _, t := range typ {\n\t\t// fmt.Printf(\"###########: PkgPath: '%v', Name: '%s'\\n\", genImportPath(t), t.Name())\n\t\tif genImportPath(t) != x.bp {\n\t\t\tpanic(errGenAllTypesSamePkg)\n\t\t}\n\t\tx.genRefPkgs(t)\n\t}\n\tif buildTags != \"\" {\n\t\tx.line(\"// +build \" + buildTags)\n\t\tx.line(\"\")\n\t}\n\tx.line(`\n\n// Code generated by codecgen - DO NOT EDIT.\n\n`)\n\tx.line(\"package \" + pkgName)\n\tx.line(\"\")\n\tx.line(\"import (\")\n\tif x.cp != x.bp {\n\t\tx.cpfx = genCodecPkg + \".\"\n\t\tx.linef(\"%s \\\"%s\\\"\", genCodecPkg, x.cp)\n\t}\n\t// use a sorted set of im keys, so that we can get consistent output\n\timKeys := make([]string, 0, len(x.im))\n\tfor k := range x.im {\n\t\timKeys = append(imKeys, k)\n\t}\n\tsort.Strings(imKeys)\n\tfor _, k := range imKeys { // for k, _ := range x.im {\n\t\tif k == x.imn[k] {\n\t\t\tx.linef(\"\\\"%s\\\"\", k)\n\t\t} else {\n\t\t\tx.linef(\"%s \\\"%s\\\"\", x.imn[k], k)\n\t\t}\n\t}\n\t// add required packages\n\tfor _, k := range [...]string{\"runtime\", \"errors\", \"strconv\"} { // \"reflect\", \"fmt\"\n\t\tif _, ok := x.im[k]; !ok {\n\t\t\tx.line(\"\\\"\" + k + \"\\\"\")\n\t\t}\n\t}\n\tx.line(\")\")\n\tx.line(\"\")\n\n\tx.line(\"const (\")\n\tx.linef(\"// ----- content types ----\")\n\tx.linef(\"codecSelferCcUTF8%s = %v\", x.xs, int64(cUTF8))\n\tx.linef(\"codecSelferCcRAW%s = %v\", x.xs, int64(cRAW))\n\tx.linef(\"// ----- value types used ----\")\n\tfor _, vt := range [...]valueType{\n\t\tvalueTypeArray, valueTypeMap, valueTypeString,\n\t\tvalueTypeInt, valueTypeUint, valueTypeFloat} {\n\t\tx.linef(\"codecSelferValueType%s%s = %v\", vt.String(), x.xs, int64(vt))\n\t}\n\n\tx.linef(\"codecSelferBitsize%s = uint8(32 << (^uint(0) >> 63))\", x.xs)\n\tx.line(\")\")\n\tx.line(\"var (\")\n\tx.line(\"errCodecSelferOnlyMapOrArrayEncodeToStruct\" + x.xs + \" = \" + \"\\nerrors.New(`only encoded map or array can be decoded into a struct`)\")\n\tx.line(\")\")\n\tx.line(\"\")\n\n\tx.hn = \"codecSelfer\" + x.xs\n\tx.line(\"type \" + x.hn + \" struct{}\")\n\tx.line(\"\")\n\tx.linef(\"func %sFalse() bool { return false }\", x.hn)\n\tx.line(\"\")\n\tx.varsfxreset()\n\tx.line(\"func init() {\")\n\tx.linef(\"if %sGenVersion != %v {\", x.cpfx, genVersion)\n\tx.line(\"_, file, _, _ := runtime.Caller(0)\")\n\tx.linef(\"ver := strconv.FormatInt(int64(%sGenVersion), 10)\", x.cpfx)\n\tx.outf(`panic(\"codecgen version mismatch: current: %v, need \" + ver + \". Re-generate file: \" + file)`, genVersion)\n\t// x.out(`panic(fmt.Errorf(\"codecgen version mismatch: current: %v, need %v. Re-generate file: %v\", `)\n\t// x.linef(`%v, %sGenVersion, file))`, genVersion, x.cpfx)\n\tx.linef(\"}\")\n\tif len(imKeys) > 0 {\n\t\tx.line(\"if false { // reference the types, but skip this branch at build/run time\")\n\t\tx.line(\"var _ byte\")\n\t\t// x.line(\"_ = strconv.ParseInt\")\n\t\t// var n int\n\t\t// for k, t := range x.im {\n\t\tfor _, k := range imKeys {\n\t\t\tt := x.im[k]\n\t\t\t// x.linef(\"var v%v %s.%s\", n, x.imn[k], t.Name())\n\t\t\t// n++\n\t\t\tx.linef(\"var _ %s.%s\", x.imn[k], t.Name())\n\t\t}\n\t\t// if n > 0 {\n\t\t// \tx.out(\"_\")\n\t\t// \tfor i := 1; i < n; i++ {\n\t\t// \t\tx.out(\", _\")\n\t\t// \t}\n\t\t// \tx.out(\" = v0\")\n\t\t// \tfor i := 1; i < n; i++ {\n\t\t// \t\tx.outf(\", v%v\", i)\n\t\t// \t}\n\t\t// }\n\t\tx.line(\"} \") // close if false\n\t}\n\tx.line(\"}\") // close init\n\tx.line(\"\")\n\n\t// generate rest of type info\n\tfor _, t := range typ {\n\t\tx.tc = t\n\t\tx.selfer(true)\n\t\tx.selfer(false)\n\t}\n\n\tfor _, t := range x.ts {\n\t\trtid := rt2id(t)\n\t\t// generate enc functions for all these slice/map types.\n\t\tx.varsfxreset()\n\t\tx.linef(\"func (x %s) enc%s(v %s%s, e *%sEncoder) {\", x.hn, x.genMethodNameT(t), x.arr2str(t, \"*\"), x.genTypeName(t), x.cpfx)\n\t\tx.genRequiredMethodVars(true)\n\t\tswitch t.Kind() {\n\t\tcase reflect.Array, reflect.Slice, reflect.Chan:\n\t\t\tx.encListFallback(\"v\", t)\n\t\tcase reflect.Map:\n\t\t\tx.encMapFallback(\"v\", t)\n\t\tdefault:\n\t\t\tpanic(errGenExpectArrayOrMap)\n\t\t}\n\t\tx.line(\"}\")\n\t\tx.line(\"\")\n\n\t\t// generate dec functions for all these slice/map types.\n\t\tx.varsfxreset()\n\t\tx.linef(\"func (x %s) dec%s(v *%s, d *%sDecoder) {\", x.hn, x.genMethodNameT(t), x.genTypeName(t), x.cpfx)\n\t\tx.genRequiredMethodVars(false)\n\t\tswitch t.Kind() {\n\t\tcase reflect.Array, reflect.Slice, reflect.Chan:\n\t\t\tx.decListFallback(\"v\", rtid, t)\n\t\tcase reflect.Map:\n\t\t\tx.decMapFallback(\"v\", rtid, t)\n\t\tdefault:\n\t\t\tpanic(errGenExpectArrayOrMap)\n\t\t}\n\t\tx.line(\"}\")\n\t\tx.line(\"\")\n\t}\n\n\tx.line(\"\")\n}\n\nfunc (x *genRunner) checkForSelfer(t reflect.Type, varname string) bool {\n\t// return varname != genTopLevelVarName && t != x.tc\n\t// the only time we checkForSelfer is if we are not at the TOP of the generated code.\n\treturn varname != genTopLevelVarName\n}\n\nfunc (x *genRunner) arr2str(t reflect.Type, s string) string {\n\tif t.Kind() == reflect.Array {\n\t\treturn s\n\t}\n\treturn \"\"\n}\n\nfunc (x *genRunner) genRequiredMethodVars(encode bool) {\n\tx.line(\"var h \" + x.hn)\n\tif encode {\n\t\tx.line(\"z, r := \" + x.cpfx + \"GenHelperEncoder(e)\")\n\t} else {\n\t\tx.line(\"z, r := \" + x.cpfx + \"GenHelperDecoder(d)\")\n\t}\n\tx.line(\"_, _, _ = h, z, r\")\n}\n\nfunc (x *genRunner) genRefPkgs(t reflect.Type) {\n\tif _, ok := x.is[t]; ok {\n\t\treturn\n\t}\n\tx.is[t] = struct{}{}\n\ttpkg, tname := genImportPath(t), t.Name()\n\tif tpkg != \"\" && tpkg != x.bp && tpkg != x.cp && tname != \"\" && tname[0] >= 'A' && tname[0] <= 'Z' {\n\t\tif _, ok := x.im[tpkg]; !ok {\n\t\t\tx.im[tpkg] = t\n\t\t\tif idx := strings.LastIndex(tpkg, \"/\"); idx < 0 {\n\t\t\t\tx.imn[tpkg] = tpkg\n\t\t\t} else {\n\t\t\t\tx.imc++\n\t\t\t\tx.imn[tpkg] = \"pkg\" + strconv.FormatUint(x.imc, 10) + \"_\" + genGoIdentifier(tpkg[idx+1:], false)\n\t\t\t}\n\t\t}\n\t}\n\tswitch t.Kind() {\n\tcase reflect.Array, reflect.Slice, reflect.Ptr, reflect.Chan:\n\t\tx.genRefPkgs(t.Elem())\n\tcase reflect.Map:\n\t\tx.genRefPkgs(t.Elem())\n\t\tx.genRefPkgs(t.Key())\n\tcase reflect.Struct:\n\t\tfor i := 0; i < t.NumField(); i++ {\n\t\t\tif fname := t.Field(i).Name; fname != \"\" && fname[0] >= 'A' && fname[0] <= 'Z' {\n\t\t\t\tx.genRefPkgs(t.Field(i).Type)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// sayFalse will either say \"false\" or use a function call that returns false.\nfunc (x *genRunner) sayFalse() string {\n\tx.f++\n\tif x.f%2 == 0 {\n\t\treturn x.hn + \"False()\"\n\t}\n\treturn \"false\"\n}\n\nfunc (x *genRunner) varsfx() string {\n\tx.c++\n\treturn strconv.FormatUint(x.c, 10)\n}\n\nfunc (x *genRunner) varsfxreset() {\n\tx.c = 0\n}\n\nfunc (x *genRunner) out(s string) {\n\t_, err := io.WriteString(x.w, s)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (x *genRunner) outf(s string, params ...interface{}) {\n\t_, err := fmt.Fprintf(x.w, s, params...)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (x *genRunner) line(s string) {\n\tx.out(s)\n\tif len(s) == 0 || s[len(s)-1] != '\\n' {\n\t\tx.out(\"\\n\")\n\t}\n}\n\nfunc (x *genRunner) lineIf(s string) {\n\tif s != \"\" {\n\t\tx.line(s)\n\t}\n}\n\nfunc (x *genRunner) linef(s string, params ...interface{}) {\n\tx.outf(s, params...)\n\tif len(s) == 0 || s[len(s)-1] != '\\n' {\n\t\tx.out(\"\\n\")\n\t}\n}\n\nfunc (x *genRunner) genTypeName(t reflect.Type) (n string) {\n\t// defer func() { fmt.Printf(\">>>> ####: genTypeName: t: %v, name: '%s'\\n\", t, n) }()\n\n\t// if the type has a PkgPath, which doesn't match the current package,\n\t// then include it.\n\t// We cannot depend on t.String() because it includes current package,\n\t// or t.PkgPath because it includes full import path,\n\t//\n\tvar ptrPfx string\n\tfor t.Kind() == reflect.Ptr {\n\t\tptrPfx += \"*\"\n\t\tt = t.Elem()\n\t}\n\tif tn := t.Name(); tn != \"\" {\n\t\treturn ptrPfx + x.genTypeNamePrim(t)\n\t}\n\tswitch t.Kind() {\n\tcase reflect.Map:\n\t\treturn ptrPfx + \"map[\" + x.genTypeName(t.Key()) + \"]\" + x.genTypeName(t.Elem())\n\tcase reflect.Slice:\n\t\treturn ptrPfx + \"[]\" + x.genTypeName(t.Elem())\n\tcase reflect.Array:\n\t\treturn ptrPfx + \"[\" + strconv.FormatInt(int64(t.Len()), 10) + \"]\" + x.genTypeName(t.Elem())\n\tcase reflect.Chan:\n\t\treturn ptrPfx + t.ChanDir().String() + \" \" + x.genTypeName(t.Elem())\n\tdefault:\n\t\tif t == intfTyp {\n\t\t\treturn ptrPfx + \"interface{}\"\n\t\t} else {\n\t\t\treturn ptrPfx + x.genTypeNamePrim(t)\n\t\t}\n\t}\n}\n\nfunc (x *genRunner) genTypeNamePrim(t reflect.Type) (n string) {\n\tif t.Name() == \"\" {\n\t\treturn t.String()\n\t} else if genImportPath(t) == \"\" || genImportPath(t) == genImportPath(x.tc) {\n\t\treturn t.Name()\n\t} else {\n\t\treturn x.imn[genImportPath(t)] + \".\" + t.Name()\n\t\t// return t.String() // best way to get the package name inclusive\n\t}\n}\n\nfunc (x *genRunner) genZeroValueR(t reflect.Type) string {\n\t// if t is a named type, w\n\tswitch t.Kind() {\n\tcase reflect.Ptr, reflect.Interface, reflect.Chan, reflect.Func,\n\t\treflect.Slice, reflect.Map, reflect.Invalid:\n\t\treturn \"nil\"\n\tcase reflect.Bool:\n\t\treturn \"false\"\n\tcase reflect.String:\n\t\treturn `\"\"`\n\tcase reflect.Struct, reflect.Array:\n\t\treturn x.genTypeName(t) + \"{}\"\n\tdefault: // all numbers\n\t\treturn \"0\"\n\t}\n}\n\nfunc (x *genRunner) genMethodNameT(t reflect.Type) (s string) {\n\treturn genMethodNameT(t, x.tc)\n}\n\nfunc (x *genRunner) selfer(encode bool) {\n\tt := x.tc\n\tt0 := t\n\t// always make decode use a pointer receiver,\n\t// and structs/arrays always use a ptr receiver (encode|decode)\n\tisptr := !encode || t.Kind() == reflect.Array || (t.Kind() == reflect.Struct && t != timeTyp)\n\tx.varsfxreset()\n\n\tfnSigPfx := \"func (\" + genTopLevelVarName + \" \"\n\tif isptr {\n\t\tfnSigPfx += \"*\"\n\t}\n\tfnSigPfx += x.genTypeName(t)\n\tx.out(fnSigPfx)\n\n\tif isptr {\n\t\tt = reflect.PtrTo(t)\n\t}\n\tif encode {\n\t\tx.line(\") CodecEncodeSelf(e *\" + x.cpfx + \"Encoder) {\")\n\t\tx.genRequiredMethodVars(true)\n\t\tx.encVar(genTopLevelVarName, t)\n\t} else {\n\t\tx.line(\") CodecDecodeSelf(d *\" + x.cpfx + \"Decoder) {\")\n\t\tx.genRequiredMethodVars(false)\n\t\t// do not use decVar, as there is no need to check TryDecodeAsNil\n\t\t// or way to elegantly handle that, and also setting it to a\n\t\t// non-nil value doesn't affect the pointer passed.\n\t\t// x.decVar(genTopLevelVarName, t, false)\n\t\tx.dec(genTopLevelVarName, t0, true)\n\t}\n\tx.line(\"}\")\n\tx.line(\"\")\n\n\tif encode || t0.Kind() != reflect.Struct {\n\t\treturn\n\t}\n\n\t// write is containerMap\n\tif genUseOneFunctionForDecStructMap {\n\t\tx.out(fnSigPfx)\n\t\tx.line(\") codecDecodeSelfFromMap(l int, d *\" + x.cpfx + \"Decoder) {\")\n\t\tx.genRequiredMethodVars(false)\n\t\tx.decStructMap(genTopLevelVarName, \"l\", rt2id(t0), t0, genStructMapStyleConsolidated)\n\t\tx.line(\"}\")\n\t\tx.line(\"\")\n\t} else {\n\t\tx.out(fnSigPfx)\n\t\tx.line(\") codecDecodeSelfFromMapLenPrefix(l int, d *\" + x.cpfx + \"Decoder) {\")\n\t\tx.genRequiredMethodVars(false)\n\t\tx.decStructMap(genTopLevelVarName, \"l\", rt2id(t0), t0, genStructMapStyleLenPrefix)\n\t\tx.line(\"}\")\n\t\tx.line(\"\")\n\n\t\tx.out(fnSigPfx)\n\t\tx.line(\") codecDecodeSelfFromMapCheckBreak(l int, d *\" + x.cpfx + \"Decoder) {\")\n\t\tx.genRequiredMethodVars(false)\n\t\tx.decStructMap(genTopLevelVarName, \"l\", rt2id(t0), t0, genStructMapStyleCheckBreak)\n\t\tx.line(\"}\")\n\t\tx.line(\"\")\n\t}\n\n\t// write containerArray\n\tx.out(fnSigPfx)\n\tx.line(\") codecDecodeSelfFromArray(l int, d *\" + x.cpfx + \"Decoder) {\")\n\tx.genRequiredMethodVars(false)\n\tx.decStructArray(genTopLevelVarName, \"l\", \"return\", rt2id(t0), t0)\n\tx.line(\"}\")\n\tx.line(\"\")\n\n}\n\n// used for chan, array, slice, map\nfunc (x *genRunner) xtraSM(varname string, t reflect.Type, encode, isptr bool) {\n\tvar ptrPfx, addrPfx string\n\tif isptr {\n\t\tptrPfx = \"*\"\n\t} else {\n\t\taddrPfx = \"&\"\n\t}\n\tif encode {\n\t\tx.linef(\"h.enc%s((%s%s)(%s), e)\", x.genMethodNameT(t), ptrPfx, x.genTypeName(t), varname)\n\t} else {\n\t\tx.linef(\"h.dec%s((*%s)(%s%s), d)\", x.genMethodNameT(t), x.genTypeName(t), addrPfx, varname)\n\t}\n\tx.registerXtraT(t)\n}\n\nfunc (x *genRunner) registerXtraT(t reflect.Type) {\n\t// recursively register the types\n\tif _, ok := x.tm[t]; ok {\n\t\treturn\n\t}\n\tvar tkey reflect.Type\n\tswitch t.Kind() {\n\tcase reflect.Chan, reflect.Slice, reflect.Array:\n\tcase reflect.Map:\n\t\ttkey = t.Key()\n\tdefault:\n\t\treturn\n\t}\n\tx.tm[t] = struct{}{}\n\tx.ts = append(x.ts, t)\n\t// check if this refers to any xtra types eg. a slice of array: add the array\n\tx.registerXtraT(t.Elem())\n\tif tkey != nil {\n\t\tx.registerXtraT(tkey)\n\t}\n}\n\n// encVar will encode a variable.\n// The parameter, t, is the reflect.Type of the variable itself\nfunc (x *genRunner) encVar(varname string, t reflect.Type) {\n\t// xdebugf(\"varname: %s, t: %v\", varname, t)\n\tvar checkNil bool\n\tswitch t.Kind() {\n\tcase reflect.Ptr, reflect.Interface, reflect.Slice, reflect.Map, reflect.Chan:\n\t\tcheckNil = true\n\t}\n\tx.encVarChkNil(varname, t, checkNil)\n}\n\nfunc (x *genRunner) encVarChkNil(varname string, t reflect.Type, checkNil bool) {\n\tif checkNil {\n\t\tx.linef(\"if %s == nil { r.EncodeNil() } else { \", varname)\n\t}\n\n\tswitch t.Kind() {\n\tcase reflect.Ptr:\n\t\ttelem := t.Elem()\n\t\ttek := telem.Kind()\n\t\tif tek == reflect.Array || (tek == reflect.Struct && telem != timeTyp) {\n\t\t\tx.enc(varname, genNonPtr(t))\n\t\t\tbreak\n\t\t}\n\t\ti := x.varsfx()\n\t\tx.line(genTempVarPfx + i + \" := *\" + varname)\n\t\tx.enc(genTempVarPfx+i, genNonPtr(t))\n\tcase reflect.Struct, reflect.Array:\n\t\tif t == timeTyp {\n\t\t\tx.enc(varname, t)\n\t\t\tbreak\n\t\t}\n\t\ti := x.varsfx()\n\t\tx.line(genTempVarPfx + i + \" := &\" + varname)\n\t\tx.enc(genTempVarPfx+i, t)\n\tdefault:\n\t\tx.enc(varname, t)\n\t}\n\n\tif checkNil {\n\t\tx.line(\"}\")\n\t}\n}\n\n// enc will encode a variable (varname) of type t, where t represents T.\n// if t is !time.Time and t is of kind reflect.Struct or reflect.Array, varname is of type *T\n// (to prevent copying),\n// else t is of type T\nfunc (x *genRunner) enc(varname string, t reflect.Type) {\n\trtid := rt2id(t)\n\tti2 := x.ti.get(rtid, t)\n\t// We call CodecEncodeSelf if one of the following are honored:\n\t// - the type already implements Selfer, call that\n\t// - the type has a Selfer implementation just created, use that\n\t// - the type is in the list of the ones we will generate for, but it is not currently being generated\n\n\tmi := x.varsfx()\n\t// tptr := reflect.PtrTo(t)\n\ttk := t.Kind()\n\tif x.checkForSelfer(t, varname) {\n\t\tif tk == reflect.Array || (tk == reflect.Struct && rtid != timeTypId) { // varname is of type *T\n\t\t\t// if tptr.Implements(selferTyp) || t.Implements(selferTyp) {\n\t\t\tif ti2.isFlag(typeInfoFlagIsZeroerPtr) || ti2.isFlag(typeInfoFlagIsZeroer) {\n\t\t\t\tx.line(varname + \".CodecEncodeSelf(e)\")\n\t\t\t\treturn\n\t\t\t}\n\t\t} else { // varname is of type T\n\t\t\tif ti2.cs { // t.Implements(selferTyp) {\n\t\t\t\tx.line(varname + \".CodecEncodeSelf(e)\")\n\t\t\t\treturn\n\t\t\t} else if ti2.csp { // tptr.Implements(selferTyp) {\n\t\t\t\tx.linef(\"%ssf%s := &%s\", genTempVarPfx, mi, varname)\n\t\t\t\tx.linef(\"%ssf%s.CodecEncodeSelf(e)\", genTempVarPfx, mi)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\n\t\tif _, ok := x.te[rtid]; ok {\n\t\t\tx.line(varname + \".CodecEncodeSelf(e)\")\n\t\t\treturn\n\t\t}\n\t}\n\n\tinlist := false\n\tfor _, t0 := range x.t {\n\t\tif t == t0 {\n\t\t\tinlist = true\n\t\t\tif x.checkForSelfer(t, varname) {\n\t\t\t\tx.line(varname + \".CodecEncodeSelf(e)\")\n\t\t\t\treturn\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\n\tvar rtidAdded bool\n\tif t == x.tc {\n\t\tx.te[rtid] = true\n\t\trtidAdded = true\n\t}\n\n\t// check if\n\t// - type is time.Time, RawExt, Raw\n\t// - the type implements (Text|JSON|Binary)(Unm|M)arshal\n\n\tvar hasIf genIfClause\n\tdefer hasIf.end(x) // end if block (if necessary)\n\n\tif t == timeTyp {\n\t\tx.linef(\"%s !z.EncBasicHandle().TimeNotBuiltin { r.EncodeTime(%s)\", hasIf.c(false), varname)\n\t\t// return\n\t}\n\tif t == rawTyp {\n\t\tx.linef(\"%s z.EncRaw(%s)\", hasIf.c(true), varname)\n\t\treturn\n\t}\n\tif t == rawExtTyp {\n\t\tx.linef(\"%s r.EncodeRawExt(%s, e)\", hasIf.c(true), varname)\n\t\treturn\n\t}\n\t// only check for extensions if the type is named, and has a packagePath.\n\tvar arrayOrStruct = tk == reflect.Array || tk == reflect.Struct // meaning varname if of type *T\n\tif !x.nx && genImportPath(t) != \"\" && t.Name() != \"\" {\n\t\tyy := fmt.Sprintf(\"%sxt%s\", genTempVarPfx, mi)\n\t\tx.linef(\"%s %s := z.Extension(z.I2Rtid(%s)); %s != nil { z.EncExtension(%s, %s) \",\n\t\t\thasIf.c(false), yy, varname, yy, varname, yy)\n\t}\n\tif arrayOrStruct { // varname is of type *T\n\t\tif ti2.bm || ti2.bmp { // t.Implements(binaryMarshalerTyp) || tptr.Implements(binaryMarshalerTyp) {\n\t\t\tx.linef(\"%s z.EncBinary() { z.EncBinaryMarshal(%v) \", hasIf.c(false), varname)\n\t\t}\n\t\tif ti2.jm || ti2.jmp { // t.Implements(jsonMarshalerTyp) || tptr.Implements(jsonMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() && z.IsJSONHandle() { z.EncJSONMarshal(%v) \", hasIf.c(false), varname)\n\t\t} else if ti2.tm || ti2.tmp { // t.Implements(textMarshalerTyp) || tptr.Implements(textMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() { z.EncTextMarshal(%v) \", hasIf.c(false), varname)\n\t\t}\n\t} else { // varname is of type T\n\t\tif ti2.bm { // t.Implements(binaryMarshalerTyp) {\n\t\t\tx.linef(\"%s z.EncBinary() { z.EncBinaryMarshal(%v) \", hasIf.c(false), varname)\n\t\t} else if ti2.bmp { // tptr.Implements(binaryMarshalerTyp) {\n\t\t\tx.linef(\"%s z.EncBinary() { z.EncBinaryMarshal(&%v) \", hasIf.c(false), varname)\n\t\t}\n\t\tif ti2.jm { // t.Implements(jsonMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() && z.IsJSONHandle() { z.EncJSONMarshal(%v) \", hasIf.c(false), varname)\n\t\t} else if ti2.jmp { // tptr.Implements(jsonMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() && z.IsJSONHandle() { z.EncJSONMarshal(&%v) \", hasIf.c(false), varname)\n\t\t} else if ti2.tm { // t.Implements(textMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() { z.EncTextMarshal(%v) \", hasIf.c(false), varname)\n\t\t} else if ti2.tmp { // tptr.Implements(textMarshalerTyp) {\n\t\t\tx.linef(\"%s !z.EncBinary() { z.EncTextMarshal(&%v) \", hasIf.c(false), varname)\n\t\t}\n\t}\n\tx.lineIf(hasIf.c(true))\n\n\tswitch t.Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tx.line(\"r.EncodeInt(int64(\" + varname + \"))\")\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tx.line(\"r.EncodeUint(uint64(\" + varname + \"))\")\n\tcase reflect.Float32:\n\t\tx.line(\"r.EncodeFloat32(float32(\" + varname + \"))\")\n\tcase reflect.Float64:\n\t\tx.line(\"r.EncodeFloat64(float64(\" + varname + \"))\")\n\tcase reflect.Bool:\n\t\tx.line(\"r.EncodeBool(bool(\" + varname + \"))\")\n\tcase reflect.String:\n\t\tx.linef(\"if z.EncBasicHandle().StringToRaw { r.EncodeStringBytesRaw(z.BytesView(string(%s))) } else { r.EncodeStringEnc(codecSelferCcUTF8%s, string(%s)) }\", varname, x.xs, varname)\n\tcase reflect.Chan:\n\t\tx.xtraSM(varname, t, true, false)\n\t\t// x.encListFallback(varname, rtid, t)\n\tcase reflect.Array:\n\t\tx.xtraSM(varname, t, true, true)\n\tcase reflect.Slice:\n\t\t// if nil, call dedicated function\n\t\t// if a []uint8, call dedicated function\n\t\t// if a known fastpath slice, call dedicated function\n\t\t// else write encode function in-line.\n\t\t// - if elements are primitives or Selfers, call dedicated function on each member.\n\t\t// - else call Encoder.encode(XXX) on it.\n\t\tif rtid == uint8SliceTypId {\n\t\t\tx.line(\"r.EncodeStringBytesRaw([]byte(\" + varname + \"))\")\n\t\t} else if fastpathAV.index(rtid) != -1 {\n\t\t\tg := x.newFastpathGenV(t)\n\t\t\tx.line(\"z.F.\" + g.MethodNamePfx(\"Enc\", false) + \"V(\" + varname + \", e)\")\n\t\t} else {\n\t\t\tx.xtraSM(varname, t, true, false)\n\t\t\t// x.encListFallback(varname, rtid, t)\n\t\t}\n\tcase reflect.Map:\n\t\t// if nil, call dedicated function\n\t\t// if a known fastpath map, call dedicated function\n\t\t// else write encode function in-line.\n\t\t// - if elements are primitives or Selfers, call dedicated function on each member.\n\t\t// - else call Encoder.encode(XXX) on it.\n\t\t// x.line(\"if \" + varname + \" == nil { \\nr.EncodeNil()\\n } else { \")\n\t\tif fastpathAV.index(rtid) != -1 {\n\t\t\tg := x.newFastpathGenV(t)\n\t\t\tx.line(\"z.F.\" + g.MethodNamePfx(\"Enc\", false) + \"V(\" + varname + \", e)\")\n\t\t} else {\n\t\t\tx.xtraSM(varname, t, true, false)\n\t\t\t// x.encMapFallback(varname, rtid, t)\n\t\t}\n\tcase reflect.Struct:\n\t\tif !inlist {\n\t\t\tdelete(x.te, rtid)\n\t\t\tx.line(\"z.EncFallback(\" + varname + \")\")\n\t\t\tbreak\n\t\t}\n\t\tx.encStruct(varname, rtid, t)\n\tdefault:\n\t\tif rtidAdded {\n\t\t\tdelete(x.te, rtid)\n\t\t}\n\t\tx.line(\"z.EncFallback(\" + varname + \")\")\n\t}\n}\n\nfunc (x *genRunner) encZero(t reflect.Type) {\n\tswitch t.Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tx.line(\"r.EncodeInt(0)\")\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tx.line(\"r.EncodeUint(0)\")\n\tcase reflect.Float32:\n\t\tx.line(\"r.EncodeFloat32(0)\")\n\tcase reflect.Float64:\n\t\tx.line(\"r.EncodeFloat64(0)\")\n\tcase reflect.Bool:\n\t\tx.line(\"r.EncodeBool(false)\")\n\tcase reflect.String:\n\t\tx.linef(`if z.EncBasicHandle().StringToRaw { r.EncodeStringBytesRaw([]byte{}) } else { r.EncodeStringEnc(codecSelferCcUTF8%s, \"\") }`, x.xs)\n\tdefault:\n\t\tx.line(\"r.EncodeNil()\")\n\t}\n}\n\nfunc (x *genRunner) doEncOmitEmptyLine(t2 reflect.StructField, varname string, buf *genBuf) {\n\tx.f = 0\n\tx.encOmitEmptyLine(t2, varname, buf)\n}\n\nfunc (x *genRunner) encOmitEmptyLine(t2 reflect.StructField, varname string, buf *genBuf) {\n\t// smartly check omitEmpty on a struct type, as it may contain uncomparable map/slice/etc.\n\t// also, for maps/slices/arrays, check if len ! 0 (not if == zero value)\n\tvarname2 := varname + \".\" + t2.Name\n\tswitch t2.Type.Kind() {\n\tcase reflect.Struct:\n\t\trtid2 := rt2id(t2.Type)\n\t\tti2 := x.ti.get(rtid2, t2.Type)\n\t\t// fmt.Printf(\">>>> structfield: omitempty: type: %s, field: %s\\n\", t2.Type.Name(), t2.Name)\n\t\tif ti2.rtid == timeTypId {\n\t\t\tbuf.s(\"!(\").s(varname2).s(\".IsZero())\")\n\t\t\tbreak\n\t\t}\n\t\tif ti2.isFlag(typeInfoFlagIsZeroerPtr) || ti2.isFlag(typeInfoFlagIsZeroer) {\n\t\t\tbuf.s(\"!(\").s(varname2).s(\".IsZero())\")\n\t\t\tbreak\n\t\t}\n\t\tif ti2.isFlag(typeInfoFlagComparable) {\n\t\t\tbuf.s(varname2).s(\" != \").s(x.genZeroValueR(t2.Type))\n\t\t\tbreak\n\t\t}\n\t\t// buf.s(\"(\")\n\t\tbuf.s(x.sayFalse()) // buf.s(\"false\")\n\t\tfor i, n := 0, t2.Type.NumField(); i < n; i++ {\n\t\t\tf := t2.Type.Field(i)\n\t\t\tif f.PkgPath != \"\" { // unexported\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tbuf.s(\" || \")\n\t\t\tx.encOmitEmptyLine(f, varname2, buf)\n\t\t}\n\t\t//buf.s(\")\")\n\tcase reflect.Bool:\n\t\tbuf.s(varname2)\n\tcase reflect.Map, reflect.Slice, reflect.Array, reflect.Chan:\n\t\tbuf.s(\"len(\").s(varname2).s(\") != 0\")\n\tdefault:\n\t\tbuf.s(varname2).s(\" != \").s(x.genZeroValueR(t2.Type))\n\t}\n}\n\nfunc (x *genRunner) encStruct(varname string, rtid uintptr, t reflect.Type) {\n\t// xdebug2f(\"encStruct, varname: %s, t: %s\", varname, t)\n\t// Use knowledge from structfieldinfo (mbs, encodable fields. Ignore omitempty. )\n\t// replicate code in kStruct i.e. for each field, deref type to non-pointer, and call x.enc on it\n\n\t// if t === type currently running selfer on, do for all\n\tti := x.ti.get(rtid, t)\n\ti := x.varsfx()\n\tsepVarname := genTempVarPfx + \"sep\" + i\n\tnumfieldsvar := genTempVarPfx + \"q\" + i\n\tti2arrayvar := genTempVarPfx + \"r\" + i\n\tstruct2arrvar := genTempVarPfx + \"2arr\" + i\n\t// firstvar := genTempVarPfx + \"2first\" + i\n\n\tx.line(sepVarname + \" := !z.EncBinary()\")\n\tx.linef(\"%s := z.EncBasicHandle().StructToArray\", struct2arrvar)\n\tx.linef(\"_, _ = %s, %s\", sepVarname, struct2arrvar)\n\tx.linef(\"const %s bool = %v // struct tag has 'toArray'\", ti2arrayvar, ti.toArray)\n\t// x.linef(\"var %s bool = true\", firstvar)\n\n\ttisfi := ti.sfiSrc // always use sequence from file. decStruct expects same thing.\n\n\t// var nn int\n\t// due to omitEmpty, we need to calculate the\n\t// number of non-empty things we write out first.\n\t// This is required as we need to pre-determine the size of the container,\n\t// to support length-prefixing.\n\tif ti.anyOmitEmpty {\n\t\tx.linef(\"var %s = [%v]bool{ // should field at this index be written?\", numfieldsvar, len(tisfi))\n\n\t\tfor j, si := range tisfi {\n\t\t\t_ = j\n\t\t\tif !si.omitEmpty() {\n\t\t\t\t// x.linef(\"%s[%v] = true // %s\", numfieldsvar, j, si.fieldName)\n\t\t\t\tx.linef(\"true, // %s\", si.fieldName)\n\t\t\t\t// nn++\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tvar t2 reflect.StructField\n\t\t\tvar omitline genBuf\n\t\t\t{\n\t\t\t\tt2typ := t\n\t\t\t\tvarname3 := varname\n\t\t\t\t// go through the loop, record the t2 field explicitly,\n\t\t\t\t// and gather the omit line if embedded in pointers.\n\t\t\t\tfor ij, ix := range si.is {\n\t\t\t\t\tif uint8(ij) == si.nis {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t\tfor t2typ.Kind() == reflect.Ptr {\n\t\t\t\t\t\tt2typ = t2typ.Elem()\n\t\t\t\t\t}\n\t\t\t\t\tt2 = t2typ.Field(int(ix))\n\t\t\t\t\tt2typ = t2.Type\n\t\t\t\t\tvarname3 = varname3 + \".\" + t2.Name\n\t\t\t\t\t// do not include actual field in the omit line.\n\t\t\t\t\t// that is done subsequently (right after - below).\n\t\t\t\t\tif uint8(ij+1) < si.nis && t2typ.Kind() == reflect.Ptr {\n\t\t\t\t\t\tomitline.s(varname3).s(\" != nil && \")\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tx.doEncOmitEmptyLine(t2, varname, &omitline)\n\t\t\tx.linef(\"%s, // %s\", omitline.v(), si.fieldName)\n\t\t}\n\t\tx.line(\"}\")\n\t\tx.linef(\"_ = %s\", numfieldsvar)\n\t}\n\t// x.linef(\"var %snn%s int\", genTempVarPfx, i)\n\n\ttype genFQN struct {\n\t\ti string\n\t\tfqname string\n\t\tnilLine genBuf\n\t\tnilVar string\n\t\tcanNil bool\n\t\tsf reflect.StructField\n\t}\n\n\tgenFQNs := make([]genFQN, len(tisfi))\n\tfor j, si := range tisfi {\n\t\tq := &genFQNs[j]\n\t\tq.i = x.varsfx()\n\t\tq.nilVar = genTempVarPfx + \"n\" + q.i\n\t\tq.canNil = false\n\t\tq.fqname = varname\n\t\t{\n\t\t\tt2typ := t\n\t\t\tfor ij, ix := range si.is {\n\t\t\t\tif uint8(ij) == si.nis {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tfor t2typ.Kind() == reflect.Ptr {\n\t\t\t\t\tt2typ = t2typ.Elem()\n\t\t\t\t}\n\t\t\t\tq.sf = t2typ.Field(int(ix))\n\t\t\t\tt2typ = q.sf.Type\n\t\t\t\tq.fqname += \".\" + q.sf.Name\n\t\t\t\tif t2typ.Kind() == reflect.Ptr {\n\t\t\t\t\tif !q.canNil {\n\t\t\t\t\t\tq.nilLine.f(\"%s == nil\", q.fqname)\n\t\t\t\t\t\tq.canNil = true\n\t\t\t\t\t} else {\n\t\t\t\t\t\tq.nilLine.f(\" || %s == nil\", q.fqname)\n\t\t\t\t\t}\n\t\t\t\t\t// x.linef(\"if %s == nil { %s = true; goto LABEL%d }\", varname3, isNilVarName, i)\n\t\t\t\t\t// \"varname3 = new(\" + x.genTypeName(t3.Elem()) + \") }\")\n\t\t\t\t}\n\t\t\t}\n\t\t\t// t2 = t.FieldByIndex(si.is)\n\t\t}\n\t}\n\n\tfor j := range genFQNs {\n\t\tq := &genFQNs[j]\n\t\tif q.canNil {\n\t\t\tx.linef(\"var %s bool = %s\", q.nilVar, q.nilLine.v())\n\t\t\t// x.linef(\"if %s { %s = true }\", q.nilLine.v(), q.nilVar)\n\t\t}\n\t}\n\n\tx.linef(\"if %s || %s {\", ti2arrayvar, struct2arrvar) // if ti.toArray\n\tx.linef(\"z.EncWriteArrayStart(%d)\", len(tisfi))\n\n\tfor j, si := range tisfi {\n\t\tq := &genFQNs[j]\n\t\t// if the type of the field is a Selfer, or one of the ones\n\t\tif q.canNil {\n\t\t\tx.linef(\"if %s { z.EncWriteArrayElem(); r.EncodeNil() } else { \", q.nilVar)\n\t\t}\n\t\tx.linef(\"z.EncWriteArrayElem()\")\n\t\tif si.omitEmpty() {\n\t\t\tx.linef(\"if %s[%v] {\", numfieldsvar, j)\n\t\t}\n\t\t// xdebug2f(\"varname: %s, t2.Type: %s\", varname3, t2.Type)\n\t\tx.encVarChkNil(q.fqname, q.sf.Type, false)\n\t\tif si.omitEmpty() {\n\t\t\tx.linef(\"} else {\")\n\t\t\tx.encZero(q.sf.Type)\n\t\t\tx.linef(\"}\")\n\t\t}\n\t\tif q.canNil {\n\t\t\tx.line(\"}\")\n\t\t}\n\t}\n\n\tx.line(\"z.EncWriteArrayEnd()\")\n\tx.linef(\"} else {\") // if not ti.toArray\n\tif ti.anyOmitEmpty {\n\t\t// nn = 0\n\t\t// x.linef(\"var %snn%s = %v\", genTempVarPfx, i, nn)\n\t\tx.linef(\"var %snn%s int\", genTempVarPfx, i)\n\t\tx.linef(\"for _, b := range %s { if b { %snn%s++ } }\", numfieldsvar, genTempVarPfx, i)\n\t\tx.linef(\"z.EncWriteMapStart(%snn%s)\", genTempVarPfx, i)\n\t\tx.linef(\"%snn%s = %v\", genTempVarPfx, i, 0)\n\t} else {\n\t\tx.linef(\"z.EncWriteMapStart(%d)\", len(tisfi))\n\t}\n\n\tfor j, si := range tisfi {\n\t\tq := &genFQNs[j]\n\t\tif si.omitEmpty() {\n\t\t\tx.linef(\"if %s[%v] {\", numfieldsvar, j)\n\t\t}\n\t\tx.linef(\"z.EncWriteMapElemKey()\")\n\n\t\t// emulate EncStructFieldKey\n\t\tswitch ti.keyType {\n\t\tcase valueTypeInt:\n\t\t\tx.linef(\"r.EncodeInt(z.M.Int(strconv.ParseInt(`%s`, 10, 64)))\", si.encName)\n\t\tcase valueTypeUint:\n\t\t\tx.linef(\"r.EncodeUint(z.M.Uint(strconv.ParseUint(`%s`, 10, 64)))\", si.encName)\n\t\tcase valueTypeFloat:\n\t\t\tx.linef(\"r.EncodeFloat64(z.M.Float(strconv.ParseFloat(`%s`, 64)))\", si.encName)\n\t\tdefault: // string\n\t\t\tif si.encNameAsciiAlphaNum {\n\t\t\t\tx.linef(`if z.IsJSONHandle() { z.WriteStr(\"\\\"%s\\\"\") } else { `, si.encName)\n\t\t\t}\n\t\t\tx.linef(\"r.EncodeStringEnc(codecSelferCcUTF8%s, `%s`)\", x.xs, si.encName)\n\t\t\tif si.encNameAsciiAlphaNum {\n\t\t\t\tx.linef(\"}\")\n\t\t\t}\n\t\t}\n\t\t// x.linef(\"r.EncStructFieldKey(codecSelferValueType%s%s, `%s`)\", ti.keyType.String(), x.xs, si.encName)\n\t\tx.line(\"z.EncWriteMapElemValue()\")\n\t\tif q.canNil {\n\t\t\tx.line(\"if \" + q.nilVar + \" { r.EncodeNil() } else { \")\n\t\t\tx.encVarChkNil(q.fqname, q.sf.Type, false)\n\t\t\tx.line(\"}\")\n\t\t} else {\n\t\t\tx.encVarChkNil(q.fqname, q.sf.Type, false)\n\t\t}\n\t\tif si.omitEmpty() {\n\t\t\tx.line(\"}\")\n\t\t}\n\t}\n\tx.line(\"z.EncWriteMapEnd()\")\n\tx.linef(\"} \") // end if/else ti.toArray\n}\n\nfunc (x *genRunner) encListFallback(varname string, t reflect.Type) {\n\telemBytes := t.Elem().Kind() == reflect.Uint8\n\tif t.AssignableTo(uint8SliceTyp) {\n\t\tx.linef(\"r.EncodeStringBytesRaw([]byte(%s))\", varname)\n\t\treturn\n\t}\n\tif t.Kind() == reflect.Array && elemBytes {\n\t\tx.linef(\"r.EncodeStringBytesRaw(((*[%d]byte)(%s))[:])\", t.Len(), varname)\n\t\treturn\n\t}\n\ti := x.varsfx()\n\tif t.Kind() == reflect.Chan {\n\t\ttype ts struct {\n\t\t\tLabel, Chan, Slice, Sfx string\n\t\t}\n\t\ttm, err := template.New(\"\").Parse(genEncChanTmpl)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tx.linef(\"if %s == nil { r.EncodeNil() } else { \", varname)\n\t\tx.linef(\"var sch%s []%s\", i, x.genTypeName(t.Elem()))\n\t\terr = tm.Execute(x.w, &ts{\"Lsch\" + i, varname, \"sch\" + i, i})\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\t// x.linef(\"%s = sch%s\", varname, i)\n\t\tif elemBytes {\n\t\t\tx.linef(\"r.EncodeStringBytesRaw([]byte(%s))\", \"sch\"+i)\n\t\t\tx.line(\"}\")\n\t\t\treturn\n\t\t}\n\t\tvarname = \"sch\" + i\n\t}\n\n\tx.line(\"z.EncWriteArrayStart(len(\" + varname + \"))\")\n\tx.linef(\"for _, %sv%s := range %s {\", genTempVarPfx, i, varname)\n\tx.linef(\"z.EncWriteArrayElem()\")\n\n\tx.encVar(genTempVarPfx+\"v\"+i, t.Elem())\n\tx.line(\"}\")\n\tx.line(\"z.EncWriteArrayEnd()\")\n\tif t.Kind() == reflect.Chan {\n\t\tx.line(\"}\")\n\t}\n}\n\nfunc (x *genRunner) encMapFallback(varname string, t reflect.Type) {\n\t// TODO: expand this to handle canonical.\n\ti := x.varsfx()\n\tx.line(\"z.EncWriteMapStart(len(\" + varname + \"))\")\n\t// x.linef(\"var %sfirst%s = true\", genTempVarPfx, i)\n\tx.linef(\"for %sk%s, %sv%s := range %s {\", genTempVarPfx, i, genTempVarPfx, i, varname)\n\tx.linef(\"z.EncWriteMapElemKey()\")\n\t// x.linef(\"%sfirst%s = false\", genTempVarPfx, i)\n\tx.encVar(genTempVarPfx+\"k\"+i, t.Key())\n\tx.line(\"z.EncWriteMapElemValue()\")\n\tx.encVar(genTempVarPfx+\"v\"+i, t.Elem())\n\tx.line(\"}\")\n\tx.line(\"z.EncWriteMapEnd()\")\n}\n\nfunc (x *genRunner) decVarInitPtr(varname, nilvar string, t reflect.Type, si *structFieldInfo,\n\tnewbuf, nilbuf *genBuf) (varname3 string, t2 reflect.StructField) {\n\t//we must accommodate anonymous fields, where the embedded field is a nil pointer in the value.\n\t// t2 = t.FieldByIndex(si.is)\n\tvarname3 = varname\n\tt2typ := t\n\tt2kind := t2typ.Kind()\n\tvar nilbufed bool\n\tif si != nil {\n\t\tfor ij, ix := range si.is {\n\t\t\tif uint8(ij) == si.nis {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tfor t2typ.Kind() == reflect.Ptr {\n\t\t\t\tt2typ = t2typ.Elem()\n\t\t\t}\n\t\t\tt2 = t2typ.Field(int(ix))\n\t\t\tt2typ = t2.Type\n\t\t\tvarname3 = varname3 + \".\" + t2.Name\n\t\t\tt2kind = t2typ.Kind()\n\t\t\tif t2kind != reflect.Ptr {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif newbuf != nil {\n\t\t\t\tnewbuf.f(\"if %s == nil { %s = new(%s) }\\n\", varname3, varname3, x.genTypeName(t2typ.Elem()))\n\t\t\t}\n\t\t\tif nilbuf != nil {\n\t\t\t\tif !nilbufed {\n\t\t\t\t\tnilbuf.s(\"if \").s(varname3).s(\" != nil\")\n\t\t\t\t\tnilbufed = true\n\t\t\t\t} else {\n\t\t\t\t\tnilbuf.s(\" && \").s(varname3).s(\" != nil\")\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// if t2typ.Kind() == reflect.Ptr {\n\t// \tvarname3 = varname3 + t2.Name\n\t// }\n\tif nilbuf != nil {\n\t\tif nilbufed {\n\t\t\tnilbuf.s(\" { \").s(\"// remove the if-true\\n\")\n\t\t}\n\t\tif nilvar != \"\" {\n\t\t\tnilbuf.s(nilvar).s(\" = true\")\n\t\t} else if tk := t2typ.Kind(); tk == reflect.Ptr {\n\t\t\tif strings.IndexByte(varname3, '.') != -1 || strings.IndexByte(varname3, '[') != -1 {\n\t\t\t\tnilbuf.s(varname3).s(\" = nil\")\n\t\t\t} else {\n\t\t\t\tnilbuf.s(\"*\").s(varname3).s(\" = \").s(x.genZeroValueR(t2typ.Elem()))\n\t\t\t}\n\t\t} else {\n\t\t\tnilbuf.s(varname3).s(\" = \").s(x.genZeroValueR(t2typ))\n\t\t}\n\t\tif nilbufed {\n\t\t\tnilbuf.s(\"}\")\n\t\t}\n\t}\n\treturn\n}\n\n// decVar takes a variable called varname, of type t\nfunc (x *genRunner) decVarMain(varname, rand string, t reflect.Type, checkNotNil bool) {\n\t// We only encode as nil if a nillable value.\n\t// This removes some of the wasted checks for TryDecodeAsNil.\n\t// We need to think about this more, to see what happens if omitempty, etc\n\t// cause a nil value to be stored when something is expected.\n\t// This could happen when decoding from a struct encoded as an array.\n\t// For that, decVar should be called with canNil=true, to force true as its value.\n\tvar varname2 string\n\tif t.Kind() != reflect.Ptr {\n\t\tif t.PkgPath() != \"\" || !x.decTryAssignPrimitive(varname, t, false) {\n\t\t\tx.dec(varname, t, false)\n\t\t}\n\t} else {\n\t\tif checkNotNil {\n\t\t\tx.linef(\"if %s == nil { %s = new(%s) }\", varname, varname, x.genTypeName(t.Elem()))\n\t\t}\n\t\t// Ensure we set underlying ptr to a non-nil value (so we can deref to it later).\n\t\t// There's a chance of a **T in here which is nil.\n\t\tvar ptrPfx string\n\t\tfor t = t.Elem(); t.Kind() == reflect.Ptr; t = t.Elem() {\n\t\t\tptrPfx += \"*\"\n\t\t\tif checkNotNil {\n\t\t\t\tx.linef(\"if %s%s == nil { %s%s = new(%s)}\",\n\t\t\t\t\tptrPfx, varname, ptrPfx, varname, x.genTypeName(t))\n\t\t\t}\n\t\t}\n\t\t// Should we create temp var if a slice/map indexing? No. dec(...) can now handle it.\n\n\t\tif ptrPfx == \"\" {\n\t\t\tx.dec(varname, t, true)\n\t\t} else {\n\t\t\tvarname2 = genTempVarPfx + \"z\" + rand\n\t\t\tx.line(varname2 + \" := \" + ptrPfx + varname)\n\t\t\tx.dec(varname2, t, true)\n\t\t}\n\t}\n}\n\n// decVar takes a variable called varname, of type t\nfunc (x *genRunner) decVar(varname, nilvar string, t reflect.Type, canBeNil, checkNotNil bool) {\n\ti := x.varsfx()\n\n\t// We only encode as nil if a nillable value.\n\t// This removes some of the wasted checks for TryDecodeAsNil.\n\t// We need to think about this more, to see what happens if omitempty, etc\n\t// cause a nil value to be stored when something is expected.\n\t// This could happen when decoding from a struct encoded as an array.\n\t// For that, decVar should be called with canNil=true, to force true as its value.\n\n\tif !canBeNil {\n\t\tcanBeNil = genAnythingCanBeNil || !genIsImmutable(t)\n\t}\n\n\tif canBeNil {\n\t\tvar buf genBuf\n\t\tx.decVarInitPtr(varname, nilvar, t, nil, nil, &buf)\n\t\tx.linef(\"if r.TryDecodeAsNil() { %s } else {\", buf.buf)\n\t} else {\n\t\tx.line(\"// cannot be nil\")\n\t}\n\n\tx.decVarMain(varname, i, t, checkNotNil)\n\n\tif canBeNil {\n\t\tx.line(\"} \")\n\t}\n}\n\n// dec will decode a variable (varname) of type t or ptrTo(t) if isptr==true.\n// t is always a basetype (i.e. not of kind reflect.Ptr).\nfunc (x *genRunner) dec(varname string, t reflect.Type, isptr bool) {\n\t// assumptions:\n\t// - the varname is to a pointer already. No need to take address of it\n\t// - t is always a baseType T (not a *T, etc).\n\trtid := rt2id(t)\n\tti2 := x.ti.get(rtid, t)\n\t// tptr := reflect.PtrTo(t)\n\tif x.checkForSelfer(t, varname) {\n\t\tif ti2.cs || ti2.csp { // t.Implements(selferTyp) || tptr.Implements(selferTyp) {\n\t\t\tx.line(varname + \".CodecDecodeSelf(d)\")\n\t\t\treturn\n\t\t}\n\t\tif _, ok := x.td[rtid]; ok {\n\t\t\tx.line(varname + \".CodecDecodeSelf(d)\")\n\t\t\treturn\n\t\t}\n\t}\n\n\tinlist := false\n\tfor _, t0 := range x.t {\n\t\tif t == t0 {\n\t\t\tinlist = true\n\t\t\tif x.checkForSelfer(t, varname) {\n\t\t\t\tx.line(varname + \".CodecDecodeSelf(d)\")\n\t\t\t\treturn\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\n\tvar rtidAdded bool\n\tif t == x.tc {\n\t\tx.td[rtid] = true\n\t\trtidAdded = true\n\t}\n\n\t// check if\n\t// - type is time.Time, Raw, RawExt\n\t// - the type implements (Text|JSON|Binary)(Unm|M)arshal\n\n\tmi := x.varsfx()\n\t// x.linef(\"%sm%s := z.DecBinary()\", genTempVarPfx, mi)\n\t// x.linef(\"_ = %sm%s\", genTempVarPfx, mi)\n\n\tvar hasIf genIfClause\n\tdefer hasIf.end(x)\n\n\tvar ptrPfx, addrPfx string\n\tif isptr {\n\t\tptrPfx = \"*\"\n\t} else {\n\t\taddrPfx = \"&\"\n\t}\n\tif t == timeTyp {\n\t\tx.linef(\"%s !z.DecBasicHandle().TimeNotBuiltin { %s%v = r.DecodeTime()\", hasIf.c(false), ptrPfx, varname)\n\t\t// return\n\t}\n\tif t == rawTyp {\n\t\tx.linef(\"%s %s%v = z.DecRaw()\", hasIf.c(true), ptrPfx, varname)\n\t\treturn\n\t}\n\n\tif t == rawExtTyp {\n\t\tx.linef(\"%s r.DecodeExt(%s%v, 0, nil)\", hasIf.c(true), addrPfx, varname)\n\t\treturn\n\t}\n\n\t// only check for extensions if the type is named, and has a packagePath.\n\tif !x.nx && genImportPath(t) != \"\" && t.Name() != \"\" {\n\t\t// first check if extensions are configued, before doing the interface conversion\n\t\t// x.linef(\"} else if z.HasExtensions() && z.DecExt(%s) {\", varname)\n\t\tyy := fmt.Sprintf(\"%sxt%s\", genTempVarPfx, mi)\n\t\tx.linef(\"%s %s := z.Extension(z.I2Rtid(%s)); %s != nil { z.DecExtension(%s, %s) \", hasIf.c(false), yy, varname, yy, varname, yy)\n\t}\n\n\tif ti2.bu || ti2.bup { // t.Implements(binaryUnmarshalerTyp) || tptr.Implements(binaryUnmarshalerTyp) {\n\t\tx.linef(\"%s z.DecBinary() { z.DecBinaryUnmarshal(%s%v) \", hasIf.c(false), addrPfx, varname)\n\t}\n\tif ti2.ju || ti2.jup { // t.Implements(jsonUnmarshalerTyp) || tptr.Implements(jsonUnmarshalerTyp) {\n\t\tx.linef(\"%s !z.DecBinary() && z.IsJSONHandle() { z.DecJSONUnmarshal(%s%v)\", hasIf.c(false), addrPfx, varname)\n\t} else if ti2.tu || ti2.tup { // t.Implements(textUnmarshalerTyp) || tptr.Implements(textUnmarshalerTyp) {\n\t\tx.linef(\"%s !z.DecBinary() { z.DecTextUnmarshal(%s%v)\", hasIf.c(false), addrPfx, varname)\n\t}\n\n\tx.lineIf(hasIf.c(true))\n\n\tif x.decTryAssignPrimitive(varname, t, isptr) {\n\t\treturn\n\t}\n\n\tswitch t.Kind() {\n\tcase reflect.Array, reflect.Chan:\n\t\tx.xtraSM(varname, t, false, isptr)\n\tcase reflect.Slice:\n\t\t// if a []uint8, call dedicated function\n\t\t// if a known fastpath slice, call dedicated function\n\t\t// else write encode function in-line.\n\t\t// - if elements are primitives or Selfers, call dedicated function on each member.\n\t\t// - else call Encoder.encode(XXX) on it.\n\t\tif rtid == uint8SliceTypId {\n\t\t\tx.linef(\"%s%s = r.DecodeBytes(%s(%s[]byte)(%s), false)\",\n\t\t\t\tptrPfx, varname, ptrPfx, ptrPfx, varname)\n\t\t} else if fastpathAV.index(rtid) != -1 {\n\t\t\tg := x.newFastpathGenV(t)\n\t\t\tx.linef(\"z.F.%sX(%s%s, d)\", g.MethodNamePfx(\"Dec\", false), addrPfx, varname)\n\t\t} else {\n\t\t\tx.xtraSM(varname, t, false, isptr)\n\t\t\t// x.decListFallback(varname, rtid, false, t)\n\t\t}\n\tcase reflect.Map:\n\t\t// if a known fastpath map, call dedicated function\n\t\t// else write encode function in-line.\n\t\t// - if elements are primitives or Selfers, call dedicated function on each member.\n\t\t// - else call Encoder.encode(XXX) on it.\n\t\tif fastpathAV.index(rtid) != -1 {\n\t\t\tg := x.newFastpathGenV(t)\n\t\t\tx.linef(\"z.F.%sX(%s%s, d)\", g.MethodNamePfx(\"Dec\", false), addrPfx, varname)\n\t\t} else {\n\t\t\tx.xtraSM(varname, t, false, isptr)\n\t\t\t// x.decMapFallback(varname, rtid, t)\n\t\t}\n\tcase reflect.Struct:\n\t\tif inlist {\n\t\t\t// no need to create temp variable if isptr, or x.F or x[F]\n\t\t\tif isptr || strings.IndexByte(varname, '.') != -1 || strings.IndexByte(varname, '[') != -1 {\n\t\t\t\tx.decStruct(varname, rtid, t)\n\t\t\t} else {\n\t\t\t\tvarname2 := genTempVarPfx + \"j\" + mi\n\t\t\t\tx.line(varname2 + \" := &\" + varname)\n\t\t\t\tx.decStruct(varname2, rtid, t)\n\t\t\t}\n\t\t} else {\n\t\t\t// delete(x.td, rtid)\n\t\t\tx.line(\"z.DecFallback(\" + addrPfx + varname + \", false)\")\n\t\t}\n\tdefault:\n\t\tif rtidAdded {\n\t\t\tdelete(x.te, rtid)\n\t\t}\n\t\tx.line(\"z.DecFallback(\" + addrPfx + varname + \", true)\")\n\t}\n}\n\nfunc (x *genRunner) decTryAssignPrimitive(varname string, t reflect.Type, isptr bool) (done bool) {\n\t// This should only be used for exact primitives (ie un-named types).\n\t// Named types may be implementations of Selfer, Unmarshaler, etc.\n\t// They should be handled by dec(...)\n\n\tvar ptr string\n\tif isptr {\n\t\tptr = \"*\"\n\t}\n\tswitch t.Kind() {\n\tcase reflect.Int:\n\t\tx.linef(\"%s%s = (%s)(z.C.IntV(r.DecodeInt64(), codecSelferBitsize%s))\", ptr, varname, x.genTypeName(t), x.xs)\n\tcase reflect.Int8:\n\t\tx.linef(\"%s%s = (%s)(z.C.IntV(r.DecodeInt64(), 8))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Int16:\n\t\tx.linef(\"%s%s = (%s)(z.C.IntV(r.DecodeInt64(), 16))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Int32:\n\t\tx.linef(\"%s%s = (%s)(z.C.IntV(r.DecodeInt64(), 32))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Int64:\n\t\tx.linef(\"%s%s = (%s)(r.DecodeInt64())\", ptr, varname, x.genTypeName(t))\n\n\tcase reflect.Uint:\n\t\tx.linef(\"%s%s = (%s)(z.C.UintV(r.DecodeUint64(), codecSelferBitsize%s))\", ptr, varname, x.genTypeName(t), x.xs)\n\tcase reflect.Uint8:\n\t\tx.linef(\"%s%s = (%s)(z.C.UintV(r.DecodeUint64(), 8))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Uint16:\n\t\tx.linef(\"%s%s = (%s)(z.C.UintV(r.DecodeUint64(), 16))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Uint32:\n\t\tx.linef(\"%s%s = (%s)(z.C.UintV(r.DecodeUint64(), 32))\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Uint64:\n\t\tx.linef(\"%s%s = (%s)(r.DecodeUint64())\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Uintptr:\n\t\tx.linef(\"%s%s = (%s)(z.C.UintV(r.DecodeUint64(), codecSelferBitsize%s))\", ptr, varname, x.genTypeName(t), x.xs)\n\n\tcase reflect.Float32:\n\t\tx.linef(\"%s%s = (%s)(z.DecDecodeFloat32())\", ptr, varname, x.genTypeName(t))\n\tcase reflect.Float64:\n\t\tx.linef(\"%s%s = (%s)(r.DecodeFloat64())\", ptr, varname, x.genTypeName(t))\n\n\tcase reflect.Bool:\n\t\tx.linef(\"%s%s = (%s)(r.DecodeBool())\", ptr, varname, x.genTypeName(t))\n\tcase reflect.String:\n\t\tx.linef(\"%s%s = (%s)(r.DecodeString())\", ptr, varname, x.genTypeName(t))\n\tdefault:\n\t\treturn false\n\t}\n\treturn true\n}\n\nfunc (x *genRunner) decListFallback(varname string, rtid uintptr, t reflect.Type) {\n\tif t.AssignableTo(uint8SliceTyp) {\n\t\tx.line(\"*\" + varname + \" = r.DecodeBytes(*((*[]byte)(\" + varname + \")), false)\")\n\t\treturn\n\t}\n\tif t.Kind() == reflect.Array && t.Elem().Kind() == reflect.Uint8 {\n\t\tx.linef(\"r.DecodeBytes( ((*[%d]byte)(%s))[:], true)\", t.Len(), varname)\n\t\treturn\n\t}\n\ttype tstruc struct {\n\t\tTempVar string\n\t\tRand string\n\t\tVarname string\n\t\tCTyp string\n\t\tTyp string\n\t\tImmutable bool\n\t\tSize int\n\t}\n\ttelem := t.Elem()\n\tts := tstruc{genTempVarPfx, x.varsfx(), varname, x.genTypeName(t), x.genTypeName(telem), genIsImmutable(telem), int(telem.Size())}\n\n\tfuncs := make(template.FuncMap)\n\n\tfuncs[\"decLineVar\"] = func(varname string) string {\n\t\tx.decVar(varname, \"\", telem, false, true)\n\t\treturn \"\"\n\t}\n\tfuncs[\"var\"] = func(s string) string {\n\t\treturn ts.TempVar + s + ts.Rand\n\t}\n\tfuncs[\"zero\"] = func() string {\n\t\treturn x.genZeroValueR(telem)\n\t}\n\tfuncs[\"isArray\"] = func() bool {\n\t\treturn t.Kind() == reflect.Array\n\t}\n\tfuncs[\"isSlice\"] = func() bool {\n\t\treturn t.Kind() == reflect.Slice\n\t}\n\tfuncs[\"isChan\"] = func() bool {\n\t\treturn t.Kind() == reflect.Chan\n\t}\n\ttm, err := template.New(\"\").Funcs(funcs).Parse(genDecListTmpl)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tif err = tm.Execute(x.w, &ts); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (x *genRunner) decMapFallback(varname string, rtid uintptr, t reflect.Type) {\n\ttype tstruc struct {\n\t\tTempVar string\n\t\tSfx string\n\t\tRand string\n\t\tVarname string\n\t\tKTyp string\n\t\tTyp string\n\t\tSize int\n\t}\n\ttelem := t.Elem()\n\ttkey := t.Key()\n\tts := tstruc{\n\t\tgenTempVarPfx, x.xs, x.varsfx(), varname, x.genTypeName(tkey),\n\t\tx.genTypeName(telem), int(telem.Size() + tkey.Size()),\n\t}\n\n\tfuncs := make(template.FuncMap)\n\tfuncs[\"decElemZero\"] = func() string {\n\t\treturn x.genZeroValueR(telem)\n\t}\n\tfuncs[\"decElemKindImmutable\"] = func() bool {\n\t\treturn genIsImmutable(telem)\n\t}\n\tfuncs[\"decElemKindPtr\"] = func() bool {\n\t\treturn telem.Kind() == reflect.Ptr\n\t}\n\tfuncs[\"decElemKindIntf\"] = func() bool {\n\t\treturn telem.Kind() == reflect.Interface\n\t}\n\tfuncs[\"decLineVarK\"] = func(varname string) string {\n\t\tx.decVar(varname, \"\", tkey, false, true)\n\t\treturn \"\"\n\t}\n\tfuncs[\"decLineVar\"] = func(varname, decodedNilVarname string) string {\n\t\tx.decVar(varname, decodedNilVarname, telem, false, true)\n\t\treturn \"\"\n\t}\n\tfuncs[\"var\"] = func(s string) string {\n\t\treturn ts.TempVar + s + ts.Rand\n\t}\n\n\ttm, err := template.New(\"\").Funcs(funcs).Parse(genDecMapTmpl)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tif err = tm.Execute(x.w, &ts); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (x *genRunner) decStructMapSwitch(kName string, varname string, rtid uintptr, t reflect.Type) {\n\tti := x.ti.get(rtid, t)\n\ttisfi := ti.sfiSrc // always use sequence from file. decStruct expects same thing.\n\tx.line(\"switch (\" + kName + \") {\")\n\tvar newbuf, nilbuf genBuf\n\tfor _, si := range tisfi {\n\t\tx.line(\"case \\\"\" + si.encName + \"\\\":\")\n\t\tnewbuf.reset()\n\t\tnilbuf.reset()\n\t\tvarname3, t2 := x.decVarInitPtr(varname, \"\", t, si, &newbuf, &nilbuf)\n\t\tx.linef(\"if r.TryDecodeAsNil() { %s } else { %s\", nilbuf.buf, newbuf.buf)\n\t\tx.decVarMain(varname3, x.varsfx(), t2.Type, false)\n\t\tx.line(\"}\")\n\t}\n\tx.line(\"default:\")\n\t// pass the slice here, so that the string will not escape, and maybe save allocation\n\tx.line(\"z.DecStructFieldNotFound(-1, \" + kName + \")\")\n\tx.line(\"} // end switch \" + kName)\n}\n\nfunc (x *genRunner) decStructMap(varname, lenvarname string, rtid uintptr, t reflect.Type, style genStructMapStyle) {\n\ttpfx := genTempVarPfx\n\tti := x.ti.get(rtid, t)\n\ti := x.varsfx()\n\tkName := tpfx + \"s\" + i\n\n\tswitch style {\n\tcase genStructMapStyleLenPrefix:\n\t\tx.linef(\"for %sj%s := 0; %sj%s < %s; %sj%s++ {\", tpfx, i, tpfx, i, lenvarname, tpfx, i)\n\tcase genStructMapStyleCheckBreak:\n\t\tx.linef(\"for %sj%s := 0; !r.CheckBreak(); %sj%s++ {\", tpfx, i, tpfx, i)\n\tdefault: // 0, otherwise.\n\t\tx.linef(\"var %shl%s bool = %s >= 0\", tpfx, i, lenvarname) // has length\n\t\tx.linef(\"for %sj%s := 0; ; %sj%s++ {\", tpfx, i, tpfx, i)\n\t\tx.linef(\"if %shl%s { if %sj%s >= %s { break }\", tpfx, i, tpfx, i, lenvarname)\n\t\tx.line(\"} else { if r.CheckBreak() { break }; }\")\n\t}\n\tx.line(\"z.DecReadMapElemKey()\")\n\n\t// emulate decstructfieldkey\n\tswitch ti.keyType {\n\tcase valueTypeInt:\n\t\tx.linef(\"%s := z.StringView(strconv.AppendInt(z.DecScratchArrayBuffer()[:0], r.DecodeInt64(), 10))\", kName)\n\tcase valueTypeUint:\n\t\tx.linef(\"%s := z.StringView(strconv.AppendUint(z.DecScratchArrayBuffer()[:0], r.DecodeUint64(), 10))\", kName)\n\tcase valueTypeFloat:\n\t\tx.linef(\"%s := z.StringView(strconv.AppendFloat(z.DecScratchArrayBuffer()[:0], r.DecodeFloat64(), 'f', -1, 64))\", kName)\n\tdefault: // string\n\t\tx.linef(\"%s := z.StringView(r.DecodeStringAsBytes())\", kName)\n\t}\n\t// x.linef(\"%s := z.StringView(r.DecStructFieldKey(codecSelferValueType%s%s, z.DecScratchArrayBuffer()))\", kName, ti.keyType.String(), x.xs)\n\n\tx.line(\"z.DecReadMapElemValue()\")\n\tx.decStructMapSwitch(kName, varname, rtid, t)\n\n\tx.line(\"} // end for \" + tpfx + \"j\" + i)\n\tx.line(\"z.DecReadMapEnd()\")\n}\n\nfunc (x *genRunner) decStructArray(varname, lenvarname, breakString string, rtid uintptr, t reflect.Type) {\n\ttpfx := genTempVarPfx\n\ti := x.varsfx()\n\tti := x.ti.get(rtid, t)\n\ttisfi := ti.sfiSrc // always use sequence from file. decStruct expects same thing.\n\tx.linef(\"var %sj%s int\", tpfx, i)\n\tx.linef(\"var %sb%s bool\", tpfx, i) // break\n\tx.linef(\"var %shl%s bool = %s >= 0\", tpfx, i, lenvarname) // has length\n\tvar newbuf, nilbuf genBuf\n\tfor _, si := range tisfi {\n\t\tx.linef(\"%sj%s++; if %shl%s { %sb%s = %sj%s > %s } else { %sb%s = r.CheckBreak() }\",\n\t\t\ttpfx, i, tpfx, i, tpfx, i,\n\t\t\ttpfx, i, lenvarname, tpfx, i)\n\t\tx.linef(\"if %sb%s { z.DecReadArrayEnd(); %s }\", tpfx, i, breakString)\n\t\tx.line(\"z.DecReadArrayElem()\")\n\t\tnewbuf.reset()\n\t\tnilbuf.reset()\n\t\tvarname3, t2 := x.decVarInitPtr(varname, \"\", t, si, &newbuf, &nilbuf)\n\t\tx.linef(\"if r.TryDecodeAsNil() { %s } else { %s\", nilbuf.buf, newbuf.buf)\n\t\tx.decVarMain(varname3, x.varsfx(), t2.Type, false)\n\t\tx.line(\"}\")\n\t}\n\t// read remaining values and throw away.\n\tx.line(\"for {\")\n\tx.linef(\"%sj%s++; if %shl%s { %sb%s = %sj%s > %s } else { %sb%s = r.CheckBreak() }\",\n\t\ttpfx, i, tpfx, i, tpfx, i,\n\t\ttpfx, i, lenvarname, tpfx, i)\n\tx.linef(\"if %sb%s { break }\", tpfx, i)\n\tx.line(\"z.DecReadArrayElem()\")\n\tx.linef(`z.DecStructFieldNotFound(%sj%s - 1, \"\")`, tpfx, i)\n\tx.line(\"}\")\n\tx.line(\"z.DecReadArrayEnd()\")\n}\n\nfunc (x *genRunner) decStruct(varname string, rtid uintptr, t reflect.Type) {\n\t// varname MUST be a ptr, or a struct field or a slice element.\n\ti := x.varsfx()\n\tx.linef(\"%sct%s := r.ContainerType()\", genTempVarPfx, i)\n\tx.linef(\"if %sct%s == codecSelferValueTypeMap%s {\", genTempVarPfx, i, x.xs)\n\tx.line(genTempVarPfx + \"l\" + i + \" := z.DecReadMapStart()\")\n\tx.linef(\"if %sl%s == 0 {\", genTempVarPfx, i)\n\tx.line(\"z.DecReadMapEnd()\")\n\tif genUseOneFunctionForDecStructMap {\n\t\tx.line(\"} else { \")\n\t\tx.linef(\"%s.codecDecodeSelfFromMap(%sl%s, d)\", varname, genTempVarPfx, i)\n\t} else {\n\t\tx.line(\"} else if \" + genTempVarPfx + \"l\" + i + \" > 0 { \")\n\t\tx.line(varname + \".codecDecodeSelfFromMapLenPrefix(\" + genTempVarPfx + \"l\" + i + \", d)\")\n\t\tx.line(\"} else {\")\n\t\tx.line(varname + \".codecDecodeSelfFromMapCheckBreak(\" + genTempVarPfx + \"l\" + i + \", d)\")\n\t}\n\tx.line(\"}\")\n\n\t// else if container is array\n\tx.linef(\"} else if %sct%s == codecSelferValueTypeArray%s {\", genTempVarPfx, i, x.xs)\n\tx.line(genTempVarPfx + \"l\" + i + \" := z.DecReadArrayStart()\")\n\tx.linef(\"if %sl%s == 0 {\", genTempVarPfx, i)\n\tx.line(\"z.DecReadArrayEnd()\")\n\tx.line(\"} else { \")\n\tx.linef(\"%s.codecDecodeSelfFromArray(%sl%s, d)\", varname, genTempVarPfx, i)\n\tx.line(\"}\")\n\t// else panic\n\tx.line(\"} else { \")\n\tx.line(\"panic(errCodecSelferOnlyMapOrArrayEncodeToStruct\" + x.xs + \")\")\n\tx.line(\"} \")\n}\n\n// --------\n\ntype fastpathGenV struct {\n\t// fastpathGenV is either a primitive (Primitive != \"\") or a map (MapKey != \"\") or a slice\n\tMapKey string\n\tElem string\n\tPrimitive string\n\tSize int\n\tNoCanonical bool\n}\n\nfunc (x *genRunner) newFastpathGenV(t reflect.Type) (v fastpathGenV) {\n\tv.NoCanonical = !genFastpathCanonical\n\tswitch t.Kind() {\n\tcase reflect.Slice, reflect.Array:\n\t\tte := t.Elem()\n\t\tv.Elem = x.genTypeName(te)\n\t\tv.Size = int(te.Size())\n\tcase reflect.Map:\n\t\tte, tk := t.Elem(), t.Key()\n\t\tv.Elem = x.genTypeName(te)\n\t\tv.MapKey = x.genTypeName(tk)\n\t\tv.Size = int(te.Size() + tk.Size())\n\tdefault:\n\t\tpanic(\"unexpected type for newFastpathGenV. Requires map or slice type\")\n\t}\n\treturn\n}\n\nfunc (x *fastpathGenV) MethodNamePfx(prefix string, prim bool) string {\n\tvar name []byte\n\tif prefix != \"\" {\n\t\tname = append(name, prefix...)\n\t}\n\tif prim {\n\t\tname = append(name, genTitleCaseName(x.Primitive)...)\n\t} else {\n\t\tif x.MapKey == \"\" {\n\t\t\tname = append(name, \"Slice\"...)\n\t\t} else {\n\t\t\tname = append(name, \"Map\"...)\n\t\t\tname = append(name, genTitleCaseName(x.MapKey)...)\n\t\t}\n\t\tname = append(name, genTitleCaseName(x.Elem)...)\n\t}\n\treturn string(name)\n}\n\n// genImportPath returns import path of a non-predeclared named typed, or an empty string otherwise.\n//\n// This handles the misbehaviour that occurs when 1.5-style vendoring is enabled,\n// where PkgPath returns the full path, including the vendoring pre-fix that should have been stripped.\n// We strip it here.\nfunc genImportPath(t reflect.Type) (s string) {\n\ts = t.PkgPath()\n\tif genCheckVendor {\n\t\t// HACK: always handle vendoring. It should be typically on in go 1.6, 1.7\n\t\ts = genStripVendor(s)\n\t}\n\treturn\n}\n\n// A go identifier is (letter|_)[letter|number|_]*\nfunc genGoIdentifier(s string, checkFirstChar bool) string {\n\tb := make([]byte, 0, len(s))\n\tt := make([]byte, 4)\n\tvar n int\n\tfor i, r := range s {\n\t\tif checkFirstChar && i == 0 && !unicode.IsLetter(r) {\n\t\t\tb = append(b, '_')\n\t\t}\n\t\t// r must be unicode_letter, unicode_digit or _\n\t\tif unicode.IsLetter(r) || unicode.IsDigit(r) {\n\t\t\tn = utf8.EncodeRune(t, r)\n\t\t\tb = append(b, t[:n]...)\n\t\t} else {\n\t\t\tb = append(b, '_')\n\t\t}\n\t}\n\treturn string(b)\n}\n\nfunc genNonPtr(t reflect.Type) reflect.Type {\n\tfor t.Kind() == reflect.Ptr {\n\t\tt = t.Elem()\n\t}\n\treturn t\n}\n\nfunc genTitleCaseName(s string) string {\n\tswitch s {\n\tcase \"interface{}\", \"interface {}\":\n\t\treturn \"Intf\"\n\tcase \"[]byte\", \"[]uint8\", \"bytes\":\n\t\treturn \"Bytes\"\n\tdefault:\n\t\treturn strings.ToUpper(s[0:1]) + s[1:]\n\t}\n}\n\nfunc genMethodNameT(t reflect.Type, tRef reflect.Type) (n string) {\n\tvar ptrPfx string\n\tfor t.Kind() == reflect.Ptr {\n\t\tptrPfx += \"Ptrto\"\n\t\tt = t.Elem()\n\t}\n\ttstr := t.String()\n\tif tn := t.Name(); tn != \"\" {\n\t\tif tRef != nil && genImportPath(t) == genImportPath(tRef) {\n\t\t\treturn ptrPfx + tn\n\t\t} else {\n\t\t\tif genQNameRegex.MatchString(tstr) {\n\t\t\t\treturn ptrPfx + strings.Replace(tstr, \".\", \"_\", 1000)\n\t\t\t} else {\n\t\t\t\treturn ptrPfx + genCustomTypeName(tstr)\n\t\t\t}\n\t\t}\n\t}\n\tswitch t.Kind() {\n\tcase reflect.Map:\n\t\treturn ptrPfx + \"Map\" + genMethodNameT(t.Key(), tRef) + genMethodNameT(t.Elem(), tRef)\n\tcase reflect.Slice:\n\t\treturn ptrPfx + \"Slice\" + genMethodNameT(t.Elem(), tRef)\n\tcase reflect.Array:\n\t\treturn ptrPfx + \"Array\" + strconv.FormatInt(int64(t.Len()), 10) + genMethodNameT(t.Elem(), tRef)\n\tcase reflect.Chan:\n\t\tvar cx string\n\t\tswitch t.ChanDir() {\n\t\tcase reflect.SendDir:\n\t\t\tcx = \"ChanSend\"\n\t\tcase reflect.RecvDir:\n\t\t\tcx = \"ChanRecv\"\n\t\tdefault:\n\t\t\tcx = \"Chan\"\n\t\t}\n\t\treturn ptrPfx + cx + genMethodNameT(t.Elem(), tRef)\n\tdefault:\n\t\tif t == intfTyp {\n\t\t\treturn ptrPfx + \"Interface\"\n\t\t} else {\n\t\t\tif tRef != nil && genImportPath(t) == genImportPath(tRef) {\n\t\t\t\tif t.Name() != \"\" {\n\t\t\t\t\treturn ptrPfx + t.Name()\n\t\t\t\t} else {\n\t\t\t\t\treturn ptrPfx + genCustomTypeName(tstr)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// best way to get the package name inclusive\n\t\t\t\t// return ptrPfx + strings.Replace(tstr, \".\", \"_\", 1000)\n\t\t\t\t// return ptrPfx + genBase64enc.EncodeToString([]byte(tstr))\n\t\t\t\tif t.Name() != \"\" && genQNameRegex.MatchString(tstr) {\n\t\t\t\t\treturn ptrPfx + strings.Replace(tstr, \".\", \"_\", 1000)\n\t\t\t\t} else {\n\t\t\t\t\treturn ptrPfx + genCustomTypeName(tstr)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n// genCustomNameForType base64encodes the t.String() value in such a way\n// that it can be used within a function name.\nfunc genCustomTypeName(tstr string) string {\n\tlen2 := genBase64enc.EncodedLen(len(tstr))\n\tbufx := make([]byte, len2)\n\tgenBase64enc.Encode(bufx, []byte(tstr))\n\tfor i := len2 - 1; i >= 0; i-- {\n\t\tif bufx[i] == '=' {\n\t\t\tlen2--\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn string(bufx[:len2])\n}\n\nfunc genIsImmutable(t reflect.Type) (v bool) {\n\treturn isImmutableKind(t.Kind())\n}\n\ntype genInternal struct {\n\tVersion int\n\tValues []fastpathGenV\n}\n\nfunc (x genInternal) FastpathLen() (l int) {\n\tfor _, v := range x.Values {\n\t\tif v.Primitive == \"\" && !(v.MapKey == \"\" && v.Elem == \"uint8\") {\n\t\t\tl++\n\t\t}\n\t}\n\treturn\n}\n\nfunc genInternalZeroValue(s string) string {\n\tswitch s {\n\tcase \"interface{}\", \"interface {}\":\n\t\treturn \"nil\"\n\tcase \"[]byte\", \"[]uint8\", \"bytes\":\n\t\treturn \"nil\"\n\tcase \"bool\":\n\t\treturn \"false\"\n\tcase \"string\":\n\t\treturn `\"\"`\n\tdefault:\n\t\treturn \"0\"\n\t}\n}\n\nvar genInternalNonZeroValueIdx [6]uint64\nvar genInternalNonZeroValueStrs = [2][6]string{\n\t{`\"string-is-an-interface\"`, \"true\", `\"some-string\"`, `[]byte(\"some-string\")`, \"11.1\", \"33\"},\n\t{`\"string-is-an-interface-2\"`, \"true\", `\"some-string-2\"`, `[]byte(\"some-string-2\")`, \"22.2\", \"44\"},\n}\n\nfunc genInternalNonZeroValue(s string) string {\n\tvar i int\n\tswitch s {\n\tcase \"interface{}\", \"interface {}\":\n\t\ti = 0\n\tcase \"bool\":\n\t\ti = 1\n\tcase \"string\":\n\t\ti = 2\n\tcase \"bytes\", \"[]byte\", \"[]uint8\":\n\t\ti = 3\n\tcase \"float32\", \"float64\", \"float\", \"double\":\n\t\ti = 4\n\tdefault:\n\t\ti = 5\n\t}\n\tgenInternalNonZeroValueIdx[i]++\n\treturn genInternalNonZeroValueStrs[genInternalNonZeroValueIdx[i]%2][i] // return string, to remove ambiguity\n}\n\nfunc genInternalEncCommandAsString(s string, vname string) string {\n\tswitch s {\n\tcase \"uint64\":\n\t\treturn \"e.e.EncodeUint(\" + vname + \")\"\n\tcase \"uint\", \"uint8\", \"uint16\", \"uint32\":\n\t\treturn \"e.e.EncodeUint(uint64(\" + vname + \"))\"\n\tcase \"int64\":\n\t\treturn \"e.e.EncodeInt(\" + vname + \")\"\n\tcase \"int\", \"int8\", \"int16\", \"int32\":\n\t\treturn \"e.e.EncodeInt(int64(\" + vname + \"))\"\n\tcase \"[]byte\", \"[]uint8\", \"bytes\":\n\t\treturn \"e.e.EncodeStringBytesRaw(\" + vname + \")\"\n\tcase \"string\":\n\t\treturn \"if e.h.StringToRaw { e.e.EncodeStringBytesRaw(bytesView(\" + vname + \")) \" +\n\t\t\t\"} else { e.e.EncodeStringEnc(cUTF8, \" + vname + \") }\"\n\tcase \"float32\":\n\t\treturn \"e.e.EncodeFloat32(\" + vname + \")\"\n\tcase \"float64\":\n\t\treturn \"e.e.EncodeFloat64(\" + vname + \")\"\n\tcase \"bool\":\n\t\treturn \"e.e.EncodeBool(\" + vname + \")\"\n\t// case \"symbol\":\n\t// \treturn \"e.e.EncodeSymbol(\" + vname + \")\"\n\tdefault:\n\t\treturn \"e.encode(\" + vname + \")\"\n\t}\n}\n\nfunc genInternalDecCommandAsString(s string) string {\n\tswitch s {\n\tcase \"uint\":\n\t\treturn \"uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\"\n\tcase \"uint8\":\n\t\treturn \"uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\"\n\tcase \"uint16\":\n\t\treturn \"uint16(chkOvf.UintV(d.d.DecodeUint64(), 16))\"\n\tcase \"uint32\":\n\t\treturn \"uint32(chkOvf.UintV(d.d.DecodeUint64(), 32))\"\n\tcase \"uint64\":\n\t\treturn \"d.d.DecodeUint64()\"\n\tcase \"uintptr\":\n\t\treturn \"uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\"\n\tcase \"int\":\n\t\treturn \"int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\"\n\tcase \"int8\":\n\t\treturn \"int8(chkOvf.IntV(d.d.DecodeInt64(), 8))\"\n\tcase \"int16\":\n\t\treturn \"int16(chkOvf.IntV(d.d.DecodeInt64(), 16))\"\n\tcase \"int32\":\n\t\treturn \"int32(chkOvf.IntV(d.d.DecodeInt64(), 32))\"\n\tcase \"int64\":\n\t\treturn \"d.d.DecodeInt64()\"\n\n\tcase \"string\":\n\t\treturn \"d.d.DecodeString()\"\n\tcase \"[]byte\", \"[]uint8\", \"bytes\":\n\t\treturn \"d.d.DecodeBytes(nil, false)\"\n\tcase \"float32\":\n\t\treturn \"float32(d.decodeFloat32())\"\n\tcase \"float64\":\n\t\treturn \"d.d.DecodeFloat64()\"\n\tcase \"bool\":\n\t\treturn \"d.d.DecodeBool()\"\n\tdefault:\n\t\tpanic(errors.New(\"gen internal: unknown type for decode: \" + s))\n\t}\n}\n\nfunc genInternalSortType(s string, elem bool) string {\n\tfor _, v := range [...]string{\n\t\t\"int\", \"uint\", \"float\",\n\t\t\"bool\",\n\t\t\"string\", \"bytes\", \"[]uint8\", \"[]byte\",\n\t} {\n\t\tif v == \"[]byte\" || v == \"[]uint8\" {\n\t\t\tv = \"bytes\"\n\t\t}\n\t\tif strings.HasPrefix(s, v) {\n\t\t\tif v == \"int\" || v == \"uint\" || v == \"float\" {\n\t\t\t\tv += \"64\"\n\t\t\t}\n\t\t\tif elem {\n\t\t\t\treturn v\n\t\t\t}\n\t\t\treturn v + \"Slice\"\n\t\t}\n\t}\n\tpanic(\"sorttype: unexpected type: \" + s)\n}\n\nfunc genStripVendor(s string) string {\n\t// HACK: Misbehaviour occurs in go 1.5. May have to re-visit this later.\n\t// if s contains /vendor/ OR startsWith vendor/, then return everything after it.\n\tconst vendorStart = \"vendor/\"\n\tconst vendorInline = \"/vendor/\"\n\tif i := strings.LastIndex(s, vendorInline); i >= 0 {\n\t\ts = s[i+len(vendorInline):]\n\t} else if strings.HasPrefix(s, vendorStart) {\n\t\ts = s[len(vendorStart):]\n\t}\n\treturn s\n}\n\n// var genInternalMu sync.Mutex\nvar genInternalV = genInternal{Version: genVersion}\nvar genInternalTmplFuncs template.FuncMap\nvar genInternalOnce sync.Once\n\nfunc genInternalInit() {\n\twordSizeBytes := int(intBitsize) / 8\n\n\ttypesizes := map[string]int{\n\t\t\"interface{}\": 2 * wordSizeBytes,\n\t\t\"string\": 2 * wordSizeBytes,\n\t\t\"[]byte\": 3 * wordSizeBytes,\n\t\t\"uint\": 1 * wordSizeBytes,\n\t\t\"uint8\": 1,\n\t\t\"uint16\": 2,\n\t\t\"uint32\": 4,\n\t\t\"uint64\": 8,\n\t\t\"uintptr\": 1 * wordSizeBytes,\n\t\t\"int\": 1 * wordSizeBytes,\n\t\t\"int8\": 1,\n\t\t\"int16\": 2,\n\t\t\"int32\": 4,\n\t\t\"int64\": 8,\n\t\t\"float32\": 4,\n\t\t\"float64\": 8,\n\t\t\"bool\": 1,\n\t}\n\n\t// keep as slice, so it is in specific iteration order.\n\t// Initial order was uint64, string, interface{}, int, int64, ...\n\n\tvar types = [...]string{\n\t\t\"interface{}\",\n\t\t\"string\",\n\t\t\"[]byte\",\n\t\t\"float32\",\n\t\t\"float64\",\n\t\t\"uint\",\n\t\t\"uint8\",\n\t\t\"uint16\",\n\t\t\"uint32\",\n\t\t\"uint64\",\n\t\t\"uintptr\",\n\t\t\"int\",\n\t\t\"int8\",\n\t\t\"int16\",\n\t\t\"int32\",\n\t\t\"int64\",\n\t\t\"bool\",\n\t}\n\n\tvar primitivetypes, slicetypes, mapkeytypes, mapvaltypes []string\n\n\tprimitivetypes = types[:]\n\tslicetypes = types[:]\n\tmapkeytypes = types[:]\n\tmapvaltypes = types[:]\n\n\tif genFastpathTrimTypes {\n\t\tmapkeytypes = []string{\n\t\t\t//\"interface{}\",\n\t\t\t\"string\",\n\t\t\t//\"[]byte\",\n\t\t\t//\"float32\",\n\t\t\t//\"float64\",\n\t\t\t\"uint\",\n\t\t\t\"uint8\",\n\t\t\t//\"uint16\",\n\t\t\t//\"uint32\",\n\t\t\t\"uint64\",\n\t\t\t//\"uintptr\",\n\t\t\t\"int\",\n\t\t\t//\"int8\",\n\t\t\t//\"int16\",\n\t\t\t//\"int32\",\n\t\t\t\"int64\",\n\t\t\t// \"bool\",\n\t\t}\n\n\t\tmapvaltypes = []string{\n\t\t\t\"interface{}\",\n\t\t\t\"string\",\n\t\t\t\"[]byte\",\n\t\t\t\"uint\",\n\t\t\t\"uint8\",\n\t\t\t//\"uint16\",\n\t\t\t//\"uint32\",\n\t\t\t\"uint64\",\n\t\t\t\"uintptr\",\n\t\t\t\"int\",\n\t\t\t//\"int8\",\n\t\t\t//\"int16\",\n\t\t\t//\"int32\",\n\t\t\t\"int64\",\n\t\t\t\"float32\",\n\t\t\t\"float64\",\n\t\t\t\"bool\",\n\t\t}\n\t}\n\n\t// var mapkeytypes [len(&types) - 1]string // skip bool\n\t// copy(mapkeytypes[:], types[:])\n\n\t// var mb []byte\n\t// mb = append(mb, '|')\n\t// for _, s := range mapkeytypes {\n\t// \tmb = append(mb, s...)\n\t// \tmb = append(mb, '|')\n\t// }\n\t// var mapkeytypestr = string(mb)\n\n\tvar gt = genInternal{Version: genVersion}\n\n\t// For each slice or map type, there must be a (symmetrical) Encode and Decode fast-path function\n\n\tfor _, s := range primitivetypes {\n\t\tgt.Values = append(gt.Values,\n\t\t\tfastpathGenV{Primitive: s, Size: typesizes[s], NoCanonical: !genFastpathCanonical})\n\t}\n\tfor _, s := range slicetypes {\n\t\t// if s != \"uint8\" { // do not generate fast path for slice of bytes. Treat specially already.\n\t\t// \tgt.Values = append(gt.Values, fastpathGenV{Elem: s, Size: typesizes[s]})\n\t\t// }\n\t\tgt.Values = append(gt.Values,\n\t\t\tfastpathGenV{Elem: s, Size: typesizes[s], NoCanonical: !genFastpathCanonical})\n\t}\n\tfor _, s := range mapkeytypes {\n\t\t// if _, ok := typesizes[s]; !ok {\n\t\t// if strings.Contains(mapkeytypestr, \"|\"+s+\"|\") {\n\t\t// \tgt.Values = append(gt.Values, fastpathGenV{MapKey: s, Elem: s, Size: 2 * typesizes[s]})\n\t\t// }\n\t\tfor _, ms := range mapvaltypes {\n\t\t\tgt.Values = append(gt.Values,\n\t\t\t\tfastpathGenV{MapKey: s, Elem: ms, Size: typesizes[s] + typesizes[ms], NoCanonical: !genFastpathCanonical})\n\t\t}\n\t}\n\n\tfuncs := make(template.FuncMap)\n\t// funcs[\"haspfx\"] = strings.HasPrefix\n\tfuncs[\"encmd\"] = genInternalEncCommandAsString\n\tfuncs[\"decmd\"] = genInternalDecCommandAsString\n\tfuncs[\"zerocmd\"] = genInternalZeroValue\n\tfuncs[\"nonzerocmd\"] = genInternalNonZeroValue\n\tfuncs[\"hasprefix\"] = strings.HasPrefix\n\tfuncs[\"sorttype\"] = genInternalSortType\n\n\tgenInternalV = gt\n\tgenInternalTmplFuncs = funcs\n}\n\n// genInternalGoFile is used to generate source files from templates.\n// It is run by the program author alone.\n// Unfortunately, it has to be exported so that it can be called from a command line tool.\n// *** DO NOT USE ***\nfunc genInternalGoFile(r io.Reader, w io.Writer) (err error) {\n\tgenInternalOnce.Do(genInternalInit)\n\n\tgt := genInternalV\n\n\tt := template.New(\"\").Funcs(genInternalTmplFuncs)\n\n\ttmplstr, err := ioutil.ReadAll(r)\n\tif err != nil {\n\t\treturn\n\t}\n\n\tif t, err = t.Parse(string(tmplstr)); err != nil {\n\t\treturn\n\t}\n\n\tvar out bytes.Buffer\n\terr = t.Execute(&out, gt)\n\tif err != nil {\n\t\treturn\n\t}\n\n\tbout, err := format.Source(out.Bytes())\n\tif err != nil {\n\t\tw.Write(out.Bytes()) // write out if error, so we can still see.\n\t\t// w.Write(bout) // write out if error, as much as possible, so we can still see.\n\t\treturn\n\t}\n\tw.Write(bout)\n\treturn\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/go.mod", "content": "module github.com/ugorji/go/codec\n\nrequire (\n\tgithub.com/ugorji/go v1.1.5-pre\n)\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_arrayof_gte_go15.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.5\n\npackage codec\n\nimport \"reflect\"\n\nconst reflectArrayOfSupported = true\n\nfunc reflectArrayOf(count int, elem reflect.Type) reflect.Type {\n\treturn reflect.ArrayOf(count, elem)\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_arrayof_lt_go15.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build !go1.5\n\npackage codec\n\nimport \"reflect\"\n\nconst reflectArrayOfSupported = false\n\nfunc reflectArrayOf(count int, elem reflect.Type) reflect.Type {\n\tpanic(\"codec: reflect.ArrayOf unsupported in this go version\")\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_makemap_gte_go19.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.9\n\npackage codec\n\nimport \"reflect\"\n\nfunc makeMapReflect(t reflect.Type, size int) reflect.Value {\n\tif size < 0 {\n\t\treturn reflect.MakeMapWithSize(t, 4)\n\t}\n\treturn reflect.MakeMapWithSize(t, size)\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_makemap_lt_go19.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build !go1.9\n\npackage codec\n\nimport \"reflect\"\n\nfunc makeMapReflect(t reflect.Type, size int) reflect.Value {\n\treturn reflect.MakeMap(t)\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_unexportedembeddedptr_gte_go110.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.10\n\npackage codec\n\nconst allowSetUnexportedEmbeddedPtr = false\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_unexportedembeddedptr_lt_go110.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build !go1.10\n\npackage codec\n\nconst allowSetUnexportedEmbeddedPtr = true\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_unsupported_lt_go14.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build !go1.4\n\npackage codec\n\n// This codec package will only work for go1.4 and above.\n// This is for the following reasons:\n// - go 1.4 was released in 2014\n// - go runtime is written fully in go\n// - interface only holds pointers\n// - reflect.Value is stabilized as 3 words\n\nfunc init() {\n\tpanic(\"codec: go 1.3 and below are not supported\")\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_vendor_eq_go15.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.5,!go1.6\n\npackage codec\n\nimport \"os\"\n\nvar genCheckVendor = os.Getenv(\"GO15VENDOREXPERIMENT\") == \"1\"\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_vendor_eq_go16.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.6,!go1.7\n\npackage codec\n\nimport \"os\"\n\nvar genCheckVendor = os.Getenv(\"GO15VENDOREXPERIMENT\") != \"0\"\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_vendor_gte_go17.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build go1.7\n\npackage codec\n\nconst genCheckVendor = true\n" }, { "path": "vendor/github.com/ugorji/go/codec/goversion_vendor_lt_go15.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// +build !go1.5\n\npackage codec\n\nvar genCheckVendor = false\n" }, { "path": "vendor/github.com/ugorji/go/codec/helper.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\n// Contains code shared by both encode and decode.\n\n// Some shared ideas around encoding/decoding\n// ------------------------------------------\n//\n// If an interface{} is passed, we first do a type assertion to see if it is\n// a primitive type or a map/slice of primitive types, and use a fastpath to handle it.\n//\n// If we start with a reflect.Value, we are already in reflect.Value land and\n// will try to grab the function for the underlying Type and directly call that function.\n// This is more performant than calling reflect.Value.Interface().\n//\n// This still helps us bypass many layers of reflection, and give best performance.\n//\n// Containers\n// ------------\n// Containers in the stream are either associative arrays (key-value pairs) or\n// regular arrays (indexed by incrementing integers).\n//\n// Some streams support indefinite-length containers, and use a breaking\n// byte-sequence to denote that the container has come to an end.\n//\n// Some streams also are text-based, and use explicit separators to denote the\n// end/beginning of different values.\n//\n// During encode, we use a high-level condition to determine how to iterate through\n// the container. That decision is based on whether the container is text-based (with\n// separators) or binary (without separators). If binary, we do not even call the\n// encoding of separators.\n//\n// During decode, we use a different high-level condition to determine how to iterate\n// through the containers. That decision is based on whether the stream contained\n// a length prefix, or if it used explicit breaks. If length-prefixed, we assume that\n// it has to be binary, and we do not even try to read separators.\n//\n// Philosophy\n// ------------\n// On decode, this codec will update containers appropriately:\n// - If struct, update fields from stream into fields of struct.\n// If field in stream not found in struct, handle appropriately (based on option).\n// If a struct field has no corresponding value in the stream, leave it AS IS.\n// If nil in stream, set value to nil/zero value.\n// - If map, update map from stream.\n// If the stream value is NIL, set the map to nil.\n// - if slice, try to update up to length of array in stream.\n// if container len is less than stream array length,\n// and container cannot be expanded, handled (based on option).\n// This means you can decode 4-element stream array into 1-element array.\n//\n// ------------------------------------\n// On encode, user can specify omitEmpty. This means that the value will be omitted\n// if the zero value. The problem may occur during decode, where omitted values do not affect\n// the value being decoded into. This means that if decoding into a struct with an\n// int field with current value=5, and the field is omitted in the stream, then after\n// decoding, the value will still be 5 (not 0).\n// omitEmpty only works if you guarantee that you always decode into zero-values.\n//\n// ------------------------------------\n// We could have truncated a map to remove keys not available in the stream,\n// or set values in the struct which are not in the stream to their zero values.\n// We decided against it because there is no efficient way to do it.\n// We may introduce it as an option later.\n// However, that will require enabling it for both runtime and code generation modes.\n//\n// To support truncate, we need to do 2 passes over the container:\n// map\n// - first collect all keys (e.g. in k1)\n// - for each key in stream, mark k1 that the key should not be removed\n// - after updating map, do second pass and call delete for all keys in k1 which are not marked\n// struct:\n// - for each field, track the *typeInfo s1\n// - iterate through all s1, and for each one not marked, set value to zero\n// - this involves checking the possible anonymous fields which are nil ptrs.\n// too much work.\n//\n// ------------------------------------------\n// Error Handling is done within the library using panic.\n//\n// This way, the code doesn't have to keep checking if an error has happened,\n// and we don't have to keep sending the error value along with each call\n// or storing it in the En|Decoder and checking it constantly along the way.\n//\n// The disadvantage is that small functions which use panics cannot be inlined.\n// The code accounts for that by only using panics behind an interface;\n// since interface calls cannot be inlined, this is irrelevant.\n//\n// We considered storing the error is En|Decoder.\n// - once it has its err field set, it cannot be used again.\n// - panicing will be optional, controlled by const flag.\n// - code should always check error first and return early.\n// We eventually decided against it as it makes the code clumsier to always\n// check for these error conditions.\n\nimport (\n\t\"bytes\"\n\t\"encoding\"\n\t\"encoding/binary\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"time\"\n)\n\nconst (\n\tscratchByteArrayLen = 32\n\t// initCollectionCap = 16 // 32 is defensive. 16 is preferred.\n\n\t// Support encoding.(Binary|Text)(Unm|M)arshaler.\n\t// This constant flag will enable or disable it.\n\tsupportMarshalInterfaces = true\n\n\t// for debugging, set this to false, to catch panic traces.\n\t// Note that this will always cause rpc tests to fail, since they need io.EOF sent via panic.\n\trecoverPanicToErr = true\n\n\t// arrayCacheLen is the length of the cache used in encoder or decoder for\n\t// allowing zero-alloc initialization.\n\t// arrayCacheLen = 8\n\n\t// size of the cacheline: defaulting to value for archs: amd64, arm64, 386\n\t// should use \"runtime/internal/sys\".CacheLineSize, but that is not exposed.\n\tcacheLineSize = 64\n\n\twordSizeBits = 32 << (^uint(0) >> 63) // strconv.IntSize\n\twordSize = wordSizeBits / 8\n\n\t// so structFieldInfo fits into 8 bytes\n\tmaxLevelsEmbedding = 14\n\n\t// useFinalizers=true configures finalizers to release pool'ed resources\n\t// acquired by Encoder/Decoder during their GC.\n\t//\n\t// Note that calling SetFinalizer is always expensive,\n\t// as code must be run on the systemstack even for SetFinalizer(t, nil).\n\t//\n\t// We document that folks SHOULD call Release() when done, or they can\n\t// explicitly call SetFinalizer themselves e.g.\n\t// runtime.SetFinalizer(e, (*Encoder).Release)\n\t// runtime.SetFinalizer(d, (*Decoder).Release)\n\tuseFinalizers = false\n)\n\nvar oneByteArr [1]byte\nvar zeroByteSlice = oneByteArr[:0:0]\n\nvar codecgen bool\n\nvar refBitset bitset256\nvar pool pooler\nvar panicv panicHdl\n\nfunc init() {\n\tpool.init()\n\n\trefBitset.set(byte(reflect.Map))\n\trefBitset.set(byte(reflect.Ptr))\n\trefBitset.set(byte(reflect.Func))\n\trefBitset.set(byte(reflect.Chan))\n}\n\ntype handleFlag uint8\n\nconst (\n\tinitedHandleFlag handleFlag = 1 << iota\n\tbinaryHandleFlag\n\tjsonHandleFlag\n)\n\ntype clsErr struct {\n\tclosed bool // is it closed?\n\terrClosed error // error on closing\n}\n\n// type entryType uint8\n\n// const (\n// \tentryTypeBytes entryType = iota // make this 0, so a comparison is cheap\n// \tentryTypeIo\n// \tentryTypeBufio\n// \tentryTypeUnset = 255\n// )\n\ntype charEncoding uint8\n\nconst (\n\t_ charEncoding = iota // make 0 unset\n\tcUTF8\n\tcUTF16LE\n\tcUTF16BE\n\tcUTF32LE\n\tcUTF32BE\n\t// Deprecated: not a true char encoding value\n\tcRAW charEncoding = 255\n)\n\n// valueType is the stream type\ntype valueType uint8\n\nconst (\n\tvalueTypeUnset valueType = iota\n\tvalueTypeNil\n\tvalueTypeInt\n\tvalueTypeUint\n\tvalueTypeFloat\n\tvalueTypeBool\n\tvalueTypeString\n\tvalueTypeSymbol\n\tvalueTypeBytes\n\tvalueTypeMap\n\tvalueTypeArray\n\tvalueTypeTime\n\tvalueTypeExt\n\n\t// valueTypeInvalid = 0xff\n)\n\nvar valueTypeStrings = [...]string{\n\t\"Unset\",\n\t\"Nil\",\n\t\"Int\",\n\t\"Uint\",\n\t\"Float\",\n\t\"Bool\",\n\t\"String\",\n\t\"Symbol\",\n\t\"Bytes\",\n\t\"Map\",\n\t\"Array\",\n\t\"Timestamp\",\n\t\"Ext\",\n}\n\nfunc (x valueType) String() string {\n\tif int(x) < len(valueTypeStrings) {\n\t\treturn valueTypeStrings[x]\n\t}\n\treturn strconv.FormatInt(int64(x), 10)\n}\n\ntype seqType uint8\n\nconst (\n\t_ seqType = iota\n\tseqTypeArray\n\tseqTypeSlice\n\tseqTypeChan\n)\n\n// note that containerMapStart and containerArraySend are not sent.\n// This is because the ReadXXXStart and EncodeXXXStart already does these.\ntype containerState uint8\n\nconst (\n\t_ containerState = iota\n\n\tcontainerMapStart\n\tcontainerMapKey\n\tcontainerMapValue\n\tcontainerMapEnd\n\tcontainerArrayStart\n\tcontainerArrayElem\n\tcontainerArrayEnd\n)\n\n// // sfiIdx used for tracking where a (field/enc)Name is seen in a []*structFieldInfo\n// type sfiIdx struct {\n// \tname string\n// \tindex int\n// }\n\n// do not recurse if a containing type refers to an embedded type\n// which refers back to its containing type (via a pointer).\n// The second time this back-reference happens, break out,\n// so as not to cause an infinite loop.\nconst rgetMaxRecursion = 2\n\n// Anecdotally, we believe most types have <= 12 fields.\n// - even Java's PMD rules set TooManyFields threshold to 15.\n// However, go has embedded fields, which should be regarded as\n// top level, allowing structs to possibly double or triple.\n// In addition, we don't want to keep creating transient arrays,\n// especially for the sfi index tracking, and the evtypes tracking.\n//\n// So - try to keep typeInfoLoadArray within 2K bytes\nconst (\n\ttypeInfoLoadArraySfisLen = 16\n\ttypeInfoLoadArraySfiidxLen = 8 * 112\n\ttypeInfoLoadArrayEtypesLen = 12\n\ttypeInfoLoadArrayBLen = 8 * 4\n)\n\n// typeInfoLoad is a transient object used while loading up a typeInfo.\ntype typeInfoLoad struct {\n\t// fNames []string\n\t// encNames []string\n\tetypes []uintptr\n\tsfis []structFieldInfo\n}\n\n// typeInfoLoadArray is a cache object used to efficiently load up a typeInfo without\n// much allocation.\ntype typeInfoLoadArray struct {\n\t// fNames [typeInfoLoadArrayLen]string\n\t// encNames [typeInfoLoadArrayLen]string\n\tsfis [typeInfoLoadArraySfisLen]structFieldInfo\n\tsfiidx [typeInfoLoadArraySfiidxLen]byte\n\tetypes [typeInfoLoadArrayEtypesLen]uintptr\n\tb [typeInfoLoadArrayBLen]byte // scratch - used for struct field names\n}\n\n// // cacheLineSafer denotes that a type is safe for cache-line access.\n// // This could mean that\n// type cacheLineSafer interface {\n// \tcacheLineSafe()\n// }\n\n// mirror json.Marshaler and json.Unmarshaler here,\n// so we don't import the encoding/json package\n\ntype jsonMarshaler interface {\n\tMarshalJSON() ([]byte, error)\n}\ntype jsonUnmarshaler interface {\n\tUnmarshalJSON([]byte) error\n}\n\ntype isZeroer interface {\n\tIsZero() bool\n}\n\ntype codecError struct {\n\tname string\n\terr interface{}\n}\n\nfunc (e codecError) Cause() error {\n\tswitch xerr := e.err.(type) {\n\tcase nil:\n\t\treturn nil\n\tcase error:\n\t\treturn xerr\n\tcase string:\n\t\treturn errors.New(xerr)\n\tcase fmt.Stringer:\n\t\treturn errors.New(xerr.String())\n\tdefault:\n\t\treturn fmt.Errorf(\"%v\", e.err)\n\t}\n}\n\nfunc (e codecError) Error() string {\n\treturn fmt.Sprintf(\"%s error: %v\", e.name, e.err)\n}\n\n// type byteAccepter func(byte) bool\n\nvar (\n\tbigen = binary.BigEndian\n\tstructInfoFieldName = \"_struct\"\n\n\tmapStrIntfTyp = reflect.TypeOf(map[string]interface{}(nil))\n\tmapIntfIntfTyp = reflect.TypeOf(map[interface{}]interface{}(nil))\n\tintfSliceTyp = reflect.TypeOf([]interface{}(nil))\n\tintfTyp = intfSliceTyp.Elem()\n\n\treflectValTyp = reflect.TypeOf((*reflect.Value)(nil)).Elem()\n\n\tstringTyp = reflect.TypeOf(\"\")\n\ttimeTyp = reflect.TypeOf(time.Time{})\n\trawExtTyp = reflect.TypeOf(RawExt{})\n\trawTyp = reflect.TypeOf(Raw{})\n\tuintptrTyp = reflect.TypeOf(uintptr(0))\n\tuint8Typ = reflect.TypeOf(uint8(0))\n\tuint8SliceTyp = reflect.TypeOf([]uint8(nil))\n\tuintTyp = reflect.TypeOf(uint(0))\n\tintTyp = reflect.TypeOf(int(0))\n\n\tmapBySliceTyp = reflect.TypeOf((*MapBySlice)(nil)).Elem()\n\n\tbinaryMarshalerTyp = reflect.TypeOf((*encoding.BinaryMarshaler)(nil)).Elem()\n\tbinaryUnmarshalerTyp = reflect.TypeOf((*encoding.BinaryUnmarshaler)(nil)).Elem()\n\n\ttextMarshalerTyp = reflect.TypeOf((*encoding.TextMarshaler)(nil)).Elem()\n\ttextUnmarshalerTyp = reflect.TypeOf((*encoding.TextUnmarshaler)(nil)).Elem()\n\n\tjsonMarshalerTyp = reflect.TypeOf((*jsonMarshaler)(nil)).Elem()\n\tjsonUnmarshalerTyp = reflect.TypeOf((*jsonUnmarshaler)(nil)).Elem()\n\n\tselferTyp = reflect.TypeOf((*Selfer)(nil)).Elem()\n\tmissingFielderTyp = reflect.TypeOf((*MissingFielder)(nil)).Elem()\n\tiszeroTyp = reflect.TypeOf((*isZeroer)(nil)).Elem()\n\n\tuint8TypId = rt2id(uint8Typ)\n\tuint8SliceTypId = rt2id(uint8SliceTyp)\n\trawExtTypId = rt2id(rawExtTyp)\n\trawTypId = rt2id(rawTyp)\n\tintfTypId = rt2id(intfTyp)\n\ttimeTypId = rt2id(timeTyp)\n\tstringTypId = rt2id(stringTyp)\n\n\tmapStrIntfTypId = rt2id(mapStrIntfTyp)\n\tmapIntfIntfTypId = rt2id(mapIntfIntfTyp)\n\tintfSliceTypId = rt2id(intfSliceTyp)\n\t// mapBySliceTypId = rt2id(mapBySliceTyp)\n\n\tintBitsize = uint8(intTyp.Bits())\n\tuintBitsize = uint8(uintTyp.Bits())\n\n\t// bsAll0x00 = []byte{0, 0, 0, 0, 0, 0, 0, 0}\n\tbsAll0xff = []byte{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}\n\n\tchkOvf checkOverflow\n\n\terrNoFieldNameToStructFieldInfo = errors.New(\"no field name passed to parseStructFieldInfo\")\n)\n\nvar defTypeInfos = NewTypeInfos([]string{\"codec\", \"json\"})\n\nvar immutableKindsSet = [32]bool{\n\t// reflect.Invalid: ,\n\treflect.Bool: true,\n\treflect.Int: true,\n\treflect.Int8: true,\n\treflect.Int16: true,\n\treflect.Int32: true,\n\treflect.Int64: true,\n\treflect.Uint: true,\n\treflect.Uint8: true,\n\treflect.Uint16: true,\n\treflect.Uint32: true,\n\treflect.Uint64: true,\n\treflect.Uintptr: true,\n\treflect.Float32: true,\n\treflect.Float64: true,\n\treflect.Complex64: true,\n\treflect.Complex128: true,\n\t// reflect.Array\n\t// reflect.Chan\n\t// reflect.Func: true,\n\t// reflect.Interface\n\t// reflect.Map\n\t// reflect.Ptr\n\t// reflect.Slice\n\treflect.String: true,\n\t// reflect.Struct\n\t// reflect.UnsafePointer\n}\n\n// Selfer defines methods by which a value can encode or decode itself.\n//\n// Any type which implements Selfer will be able to encode or decode itself.\n// Consequently, during (en|de)code, this takes precedence over\n// (text|binary)(M|Unm)arshal or extension support.\n//\n// By definition, it is not allowed for a Selfer to directly call Encode or Decode on itself.\n// If that is done, Encode/Decode will rightfully fail with a Stack Overflow style error.\n// For example, the snippet below will cause such an error.\n// type testSelferRecur struct{}\n// func (s *testSelferRecur) CodecEncodeSelf(e *Encoder) { e.MustEncode(s) }\n// func (s *testSelferRecur) CodecDecodeSelf(d *Decoder) { d.MustDecode(s) }\n//\n// Note: *the first set of bytes of any value MUST NOT represent nil in the format*.\n// This is because, during each decode, we first check the the next set of bytes\n// represent nil, and if so, we just set the value to nil.\ntype Selfer interface {\n\tCodecEncodeSelf(*Encoder)\n\tCodecDecodeSelf(*Decoder)\n}\n\n// MissingFielder defines the interface allowing structs to internally decode or encode\n// values which do not map to struct fields.\n//\n// We expect that this interface is bound to a pointer type (so the mutation function works).\n//\n// A use-case is if a version of a type unexports a field, but you want compatibility between\n// both versions during encoding and decoding.\n//\n// Note that the interface is completely ignored during codecgen.\ntype MissingFielder interface {\n\t// CodecMissingField is called to set a missing field and value pair.\n\t//\n\t// It returns true if the missing field was set on the struct.\n\tCodecMissingField(field []byte, value interface{}) bool\n\n\t// CodecMissingFields returns the set of fields which are not struct fields\n\tCodecMissingFields() map[string]interface{}\n}\n\n// MapBySlice is a tag interface that denotes wrapped slice should encode as a map in the stream.\n// The slice contains a sequence of key-value pairs.\n// This affords storing a map in a specific sequence in the stream.\n//\n// Example usage:\n// type T1 []string // or []int or []Point or any other \"slice\" type\n// func (_ T1) MapBySlice{} // T1 now implements MapBySlice, and will be encoded as a map\n// type T2 struct { KeyValues T1 }\n//\n// var kvs = []string{\"one\", \"1\", \"two\", \"2\", \"three\", \"3\"}\n// var v2 = T2{ KeyValues: T1(kvs) }\n// // v2 will be encoded like the map: {\"KeyValues\": {\"one\": \"1\", \"two\": \"2\", \"three\": \"3\"} }\n//\n// The support of MapBySlice affords the following:\n// - A slice type which implements MapBySlice will be encoded as a map\n// - A slice can be decoded from a map in the stream\n// - It MUST be a slice type (not a pointer receiver) that implements MapBySlice\ntype MapBySlice interface {\n\tMapBySlice()\n}\n\n// BasicHandle encapsulates the common options and extension functions.\n//\n// Deprecated: DO NOT USE DIRECTLY. EXPORTED FOR GODOC BENEFIT. WILL BE REMOVED.\ntype BasicHandle struct {\n\t// BasicHandle is always a part of a different type.\n\t// It doesn't have to fit into it own cache lines.\n\n\t// TypeInfos is used to get the type info for any type.\n\t//\n\t// If not configured, the default TypeInfos is used, which uses struct tag keys: codec, json\n\tTypeInfos *TypeInfos\n\n\t// Note: BasicHandle is not comparable, due to these slices here (extHandle, intf2impls).\n\t// If *[]T is used instead, this becomes comparable, at the cost of extra indirection.\n\t// Thses slices are used all the time, so keep as slices (not pointers).\n\n\textHandle\n\n\tintf2impls\n\n\tEncodeOptions\n\n\tDecodeOptions\n\n\tRPCOptions\n\n\t// TimeNotBuiltin configures whether time.Time should be treated as a builtin type.\n\t//\n\t// All Handlers should know how to encode/decode time.Time as part of the core\n\t// format specification, or as a standard extension defined by the format.\n\t//\n\t// However, users can elect to handle time.Time as a custom extension, or via the\n\t// standard library's encoding.Binary(M|Unm)arshaler or Text(M|Unm)arshaler interface.\n\t// To elect this behavior, users can set TimeNotBuiltin=true.\n\t// Note: Setting TimeNotBuiltin=true can be used to enable the legacy behavior\n\t// (for Cbor and Msgpack), where time.Time was not a builtin supported type.\n\tTimeNotBuiltin bool\n\n\t// ExplicitRelease configures whether Release() is implicitly called after an encode or\n\t// decode call.\n\t//\n\t// If you will hold onto an Encoder or Decoder for re-use, by calling Reset(...)\n\t// on it or calling (Must)Encode repeatedly into a given []byte or io.Writer,\n\t// then you do not want it to be implicitly closed after each Encode/Decode call.\n\t// Doing so will unnecessarily return resources to the shared pool, only for you to\n\t// grab them right after again to do another Encode/Decode call.\n\t//\n\t// Instead, you configure ExplicitRelease=true, and you explicitly call Release() when\n\t// you are truly done.\n\t//\n\t// As an alternative, you can explicitly set a finalizer - so its resources\n\t// are returned to the shared pool before it is garbage-collected. Do it as below:\n\t// runtime.SetFinalizer(e, (*Encoder).Release)\n\t// runtime.SetFinalizer(d, (*Decoder).Release)\n\tExplicitRelease bool\n\n\t// flags handleFlag // holds flag for if binaryEncoding, jsonHandler, etc\n\t// be bool // is handle a binary encoding?\n\t// js bool // is handle javascript handler?\n\t// n byte // first letter of handle name\n\t// _ uint16 // padding\n\n\t// ---- cache line\n\n\t// noBuiltInTypeChecker\n\n\tinited uint32 // holds if inited, and also handle flags (binary encoding, json handler, etc)\n\tmu sync.Mutex\n\t// _ uint32 // padding\n\trtidFns atomicRtidFnSlice\n\n\t// r []uintptr // rtids mapped to s above\n}\n\n// basicHandle returns an initialized BasicHandle from the Handle.\nfunc basicHandle(hh Handle) (x *BasicHandle) {\n\tx = hh.getBasicHandle()\n\t// ** We need to simulate once.Do, to ensure no data race within the block.\n\t// ** Consequently, below would not work.\n\t// if atomic.CompareAndSwapUint32(&x.inited, 0, 1) {\n\t// \tx.be = hh.isBinary()\n\t// \t_, x.js = hh.(*JsonHandle)\n\t// \tx.n = hh.Name()[0]\n\t// }\n\n\t// simulate once.Do using our own stored flag and mutex as a CompareAndSwap\n\t// is not sufficient, since a race condition can occur within init(Handle) function.\n\t// init is made noinline, so that this function can be inlined by its caller.\n\tif atomic.LoadUint32(&x.inited) == 0 {\n\t\tx.init(hh)\n\t}\n\treturn\n}\n\nfunc (x *BasicHandle) isJs() bool {\n\treturn handleFlag(x.inited)&jsonHandleFlag != 0\n}\n\nfunc (x *BasicHandle) isBe() bool {\n\treturn handleFlag(x.inited)&binaryHandleFlag != 0\n}\n\n//go:noinline\nfunc (x *BasicHandle) init(hh Handle) {\n\t// make it uninlineable, as it is called at most once\n\tx.mu.Lock()\n\tif x.inited == 0 {\n\t\tvar f = initedHandleFlag\n\t\tif hh.isBinary() {\n\t\t\tf |= binaryHandleFlag\n\t\t}\n\t\tif _, b := hh.(*JsonHandle); b {\n\t\t\tf |= jsonHandleFlag\n\t\t}\n\t\t// _, x.js = hh.(*JsonHandle)\n\t\t// x.n = hh.Name()[0]\n\t\tatomic.StoreUint32(&x.inited, uint32(f))\n\t}\n\tx.mu.Unlock()\n}\n\nfunc (x *BasicHandle) getBasicHandle() *BasicHandle {\n\treturn x\n}\n\nfunc (x *BasicHandle) getTypeInfo(rtid uintptr, rt reflect.Type) (pti *typeInfo) {\n\tif x.TypeInfos == nil {\n\t\treturn defTypeInfos.get(rtid, rt)\n\t}\n\treturn x.TypeInfos.get(rtid, rt)\n}\n\nfunc findFn(s []codecRtidFn, rtid uintptr) (i uint, fn *codecFn) {\n\t// binary search. adapted from sort/search.go.\n\t// Note: we use goto (instead of for loop) so this can be inlined.\n\n\t// h, i, j := 0, 0, len(s)\n\tvar h uint // var h, i uint\n\tvar j = uint(len(s))\nLOOP:\n\tif i < j {\n\t\th = i + (j-i)/2\n\t\tif s[h].rtid < rtid {\n\t\t\ti = h + 1\n\t\t} else {\n\t\t\tj = h\n\t\t}\n\t\tgoto LOOP\n\t}\n\tif i < uint(len(s)) && s[i].rtid == rtid {\n\t\tfn = s[i].fn\n\t}\n\treturn\n}\n\nfunc (x *BasicHandle) fn(rt reflect.Type, checkFastpath, checkCodecSelfer bool) (fn *codecFn) {\n\trtid := rt2id(rt)\n\tsp := x.rtidFns.load()\n\tif sp != nil {\n\t\tif _, fn = findFn(sp, rtid); fn != nil {\n\t\t\t// xdebugf(\"<<<< %c: found fn for %v in rtidfns of size: %v\", c.n, rt, len(sp))\n\t\t\treturn\n\t\t}\n\t}\n\tc := x\n\t// xdebugf(\"#### for %c: load fn for %v in rtidfns of size: %v\", c.n, rt, len(sp))\n\tfn = new(codecFn)\n\tfi := &(fn.i)\n\tti := c.getTypeInfo(rtid, rt)\n\tfi.ti = ti\n\n\trk := reflect.Kind(ti.kind)\n\n\tif checkCodecSelfer && (ti.cs || ti.csp) {\n\t\tfn.fe = (*Encoder).selferMarshal\n\t\tfn.fd = (*Decoder).selferUnmarshal\n\t\tfi.addrF = true\n\t\tfi.addrD = ti.csp\n\t\tfi.addrE = ti.csp\n\t} else if rtid == timeTypId && !c.TimeNotBuiltin {\n\t\tfn.fe = (*Encoder).kTime\n\t\tfn.fd = (*Decoder).kTime\n\t} else if rtid == rawTypId {\n\t\tfn.fe = (*Encoder).raw\n\t\tfn.fd = (*Decoder).raw\n\t} else if rtid == rawExtTypId {\n\t\tfn.fe = (*Encoder).rawExt\n\t\tfn.fd = (*Decoder).rawExt\n\t\tfi.addrF = true\n\t\tfi.addrD = true\n\t\tfi.addrE = true\n\t} else if xfFn := c.getExt(rtid); xfFn != nil {\n\t\tfi.xfTag, fi.xfFn = xfFn.tag, xfFn.ext\n\t\tfn.fe = (*Encoder).ext\n\t\tfn.fd = (*Decoder).ext\n\t\tfi.addrF = true\n\t\tfi.addrD = true\n\t\tif rk == reflect.Struct || rk == reflect.Array {\n\t\t\tfi.addrE = true\n\t\t}\n\t} else if supportMarshalInterfaces && c.isBe() && (ti.bm || ti.bmp) && (ti.bu || ti.bup) {\n\t\tfn.fe = (*Encoder).binaryMarshal\n\t\tfn.fd = (*Decoder).binaryUnmarshal\n\t\tfi.addrF = true\n\t\tfi.addrD = ti.bup\n\t\tfi.addrE = ti.bmp\n\t} else if supportMarshalInterfaces && !c.isBe() && c.isJs() &&\n\t\t(ti.jm || ti.jmp) && (ti.ju || ti.jup) {\n\t\t//If JSON, we should check JSONMarshal before textMarshal\n\t\tfn.fe = (*Encoder).jsonMarshal\n\t\tfn.fd = (*Decoder).jsonUnmarshal\n\t\tfi.addrF = true\n\t\tfi.addrD = ti.jup\n\t\tfi.addrE = ti.jmp\n\t} else if supportMarshalInterfaces && !c.isBe() && (ti.tm || ti.tmp) && (ti.tu || ti.tup) {\n\t\tfn.fe = (*Encoder).textMarshal\n\t\tfn.fd = (*Decoder).textUnmarshal\n\t\tfi.addrF = true\n\t\tfi.addrD = ti.tup\n\t\tfi.addrE = ti.tmp\n\t} else {\n\t\tif fastpathEnabled && checkFastpath && (rk == reflect.Map || rk == reflect.Slice) {\n\t\t\tif ti.pkgpath == \"\" { // un-named slice or map\n\t\t\t\tif idx := fastpathAV.index(rtid); idx != -1 {\n\t\t\t\t\tfn.fe = fastpathAV[idx].encfn\n\t\t\t\t\tfn.fd = fastpathAV[idx].decfn\n\t\t\t\t\tfi.addrD = true\n\t\t\t\t\tfi.addrF = false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// use mapping for underlying type if there\n\t\t\t\tvar rtu reflect.Type\n\t\t\t\tif rk == reflect.Map {\n\t\t\t\t\trtu = reflect.MapOf(ti.key, ti.elem)\n\t\t\t\t} else {\n\t\t\t\t\trtu = reflect.SliceOf(ti.elem)\n\t\t\t\t}\n\t\t\t\trtuid := rt2id(rtu)\n\t\t\t\tif idx := fastpathAV.index(rtuid); idx != -1 {\n\t\t\t\t\txfnf := fastpathAV[idx].encfn\n\t\t\t\t\txrt := fastpathAV[idx].rt\n\t\t\t\t\tfn.fe = func(e *Encoder, xf *codecFnInfo, xrv reflect.Value) {\n\t\t\t\t\t\txfnf(e, xf, xrv.Convert(xrt))\n\t\t\t\t\t}\n\t\t\t\t\tfi.addrD = true\n\t\t\t\t\tfi.addrF = false // meaning it can be an address(ptr) or a value\n\t\t\t\t\txfnf2 := fastpathAV[idx].decfn\n\t\t\t\t\tfn.fd = func(d *Decoder, xf *codecFnInfo, xrv reflect.Value) {\n\t\t\t\t\t\tif xrv.Kind() == reflect.Ptr {\n\t\t\t\t\t\t\txfnf2(d, xf, xrv.Convert(reflect.PtrTo(xrt)))\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\txfnf2(d, xf, xrv.Convert(xrt))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif fn.fe == nil && fn.fd == nil {\n\t\t\tswitch rk {\n\t\t\tcase reflect.Bool:\n\t\t\t\tfn.fe = (*Encoder).kBool\n\t\t\t\tfn.fd = (*Decoder).kBool\n\t\t\tcase reflect.String:\n\t\t\t\tfn.fe = (*Encoder).kString\n\t\t\t\tfn.fd = (*Decoder).kString\n\t\t\tcase reflect.Int:\n\t\t\t\tfn.fd = (*Decoder).kInt\n\t\t\t\tfn.fe = (*Encoder).kInt\n\t\t\tcase reflect.Int8:\n\t\t\t\tfn.fe = (*Encoder).kInt8\n\t\t\t\tfn.fd = (*Decoder).kInt8\n\t\t\tcase reflect.Int16:\n\t\t\t\tfn.fe = (*Encoder).kInt16\n\t\t\t\tfn.fd = (*Decoder).kInt16\n\t\t\tcase reflect.Int32:\n\t\t\t\tfn.fe = (*Encoder).kInt32\n\t\t\t\tfn.fd = (*Decoder).kInt32\n\t\t\tcase reflect.Int64:\n\t\t\t\tfn.fe = (*Encoder).kInt64\n\t\t\t\tfn.fd = (*Decoder).kInt64\n\t\t\tcase reflect.Uint:\n\t\t\t\tfn.fd = (*Decoder).kUint\n\t\t\t\tfn.fe = (*Encoder).kUint\n\t\t\tcase reflect.Uint8:\n\t\t\t\tfn.fe = (*Encoder).kUint8\n\t\t\t\tfn.fd = (*Decoder).kUint8\n\t\t\tcase reflect.Uint16:\n\t\t\t\tfn.fe = (*Encoder).kUint16\n\t\t\t\tfn.fd = (*Decoder).kUint16\n\t\t\tcase reflect.Uint32:\n\t\t\t\tfn.fe = (*Encoder).kUint32\n\t\t\t\tfn.fd = (*Decoder).kUint32\n\t\t\tcase reflect.Uint64:\n\t\t\t\tfn.fe = (*Encoder).kUint64\n\t\t\t\tfn.fd = (*Decoder).kUint64\n\t\t\tcase reflect.Uintptr:\n\t\t\t\tfn.fe = (*Encoder).kUintptr\n\t\t\t\tfn.fd = (*Decoder).kUintptr\n\t\t\tcase reflect.Float32:\n\t\t\t\tfn.fe = (*Encoder).kFloat32\n\t\t\t\tfn.fd = (*Decoder).kFloat32\n\t\t\tcase reflect.Float64:\n\t\t\t\tfn.fe = (*Encoder).kFloat64\n\t\t\t\tfn.fd = (*Decoder).kFloat64\n\t\t\tcase reflect.Invalid:\n\t\t\t\tfn.fe = (*Encoder).kInvalid\n\t\t\t\tfn.fd = (*Decoder).kErr\n\t\t\tcase reflect.Chan:\n\t\t\t\tfi.seq = seqTypeChan\n\t\t\t\tfn.fe = (*Encoder).kSlice\n\t\t\t\tfn.fd = (*Decoder).kSlice\n\t\t\tcase reflect.Slice:\n\t\t\t\tfi.seq = seqTypeSlice\n\t\t\t\tfn.fe = (*Encoder).kSlice\n\t\t\t\tfn.fd = (*Decoder).kSlice\n\t\t\tcase reflect.Array:\n\t\t\t\tfi.seq = seqTypeArray\n\t\t\t\tfn.fe = (*Encoder).kSlice\n\t\t\t\tfi.addrF = false\n\t\t\t\tfi.addrD = false\n\t\t\t\trt2 := reflect.SliceOf(ti.elem)\n\t\t\t\tfn.fd = func(d *Decoder, xf *codecFnInfo, xrv reflect.Value) {\n\t\t\t\t\td.h.fn(rt2, true, false).fd(d, xf, xrv.Slice(0, xrv.Len()))\n\t\t\t\t}\n\t\t\t\t// fn.fd = (*Decoder).kArray\n\t\t\tcase reflect.Struct:\n\t\t\t\tif ti.anyOmitEmpty || ti.mf || ti.mfp {\n\t\t\t\t\tfn.fe = (*Encoder).kStruct\n\t\t\t\t} else {\n\t\t\t\t\tfn.fe = (*Encoder).kStructNoOmitempty\n\t\t\t\t}\n\t\t\t\tfn.fd = (*Decoder).kStruct\n\t\t\tcase reflect.Map:\n\t\t\t\tfn.fe = (*Encoder).kMap\n\t\t\t\tfn.fd = (*Decoder).kMap\n\t\t\tcase reflect.Interface:\n\t\t\t\t// encode: reflect.Interface are handled already by preEncodeValue\n\t\t\t\tfn.fd = (*Decoder).kInterface\n\t\t\t\tfn.fe = (*Encoder).kErr\n\t\t\tdefault:\n\t\t\t\t// reflect.Ptr and reflect.Interface are handled already by preEncodeValue\n\t\t\t\tfn.fe = (*Encoder).kErr\n\t\t\t\tfn.fd = (*Decoder).kErr\n\t\t\t}\n\t\t}\n\t}\n\n\tc.mu.Lock()\n\tvar sp2 []codecRtidFn\n\tsp = c.rtidFns.load()\n\tif sp == nil {\n\t\tsp2 = []codecRtidFn{{rtid, fn}}\n\t\tc.rtidFns.store(sp2)\n\t\t// xdebugf(\">>>> adding rt: %v to rtidfns of size: %v\", rt, len(sp2))\n\t\t// xdebugf(\">>>> loading stored rtidfns of size: %v\", len(c.rtidFns.load()))\n\t} else {\n\t\tidx, fn2 := findFn(sp, rtid)\n\t\tif fn2 == nil {\n\t\t\tsp2 = make([]codecRtidFn, len(sp)+1)\n\t\t\tcopy(sp2, sp[:idx])\n\t\t\tcopy(sp2[idx+1:], sp[idx:])\n\t\t\tsp2[idx] = codecRtidFn{rtid, fn}\n\t\t\tc.rtidFns.store(sp2)\n\t\t\t// xdebugf(\">>>> adding rt: %v to rtidfns of size: %v\", rt, len(sp2))\n\n\t\t}\n\t}\n\tc.mu.Unlock()\n\treturn\n}\n\n// Handle defines a specific encoding format. It also stores any runtime state\n// used during an Encoding or Decoding session e.g. stored state about Types, etc.\n//\n// Once a handle is configured, it can be shared across multiple Encoders and Decoders.\n//\n// Note that a Handle is NOT safe for concurrent modification.\n// Consequently, do not modify it after it is configured if shared among\n// multiple Encoders and Decoders in different goroutines.\n//\n// Consequently, the typical usage model is that a Handle is pre-configured\n// before first time use, and not modified while in use.\n// Such a pre-configured Handle is safe for concurrent access.\ntype Handle interface {\n\tName() string\n\t// return the basic handle. It may not have been inited.\n\t// Prefer to use basicHandle() helper function that ensures it has been inited.\n\tgetBasicHandle() *BasicHandle\n\trecreateEncDriver(encDriver) bool\n\tnewEncDriver(w *Encoder) encDriver\n\tnewDecDriver(r *Decoder) decDriver\n\tisBinary() bool\n\thasElemSeparators() bool\n\t// IsBuiltinType(rtid uintptr) bool\n}\n\n// Raw represents raw formatted bytes.\n// We \"blindly\" store it during encode and retrieve the raw bytes during decode.\n// Note: it is dangerous during encode, so we may gate the behaviour\n// behind an Encode flag which must be explicitly set.\ntype Raw []byte\n\n// RawExt represents raw unprocessed extension data.\n// Some codecs will decode extension data as a *RawExt\n// if there is no registered extension for the tag.\n//\n// Only one of Data or Value is nil.\n// If Data is nil, then the content of the RawExt is in the Value.\ntype RawExt struct {\n\tTag uint64\n\t// Data is the []byte which represents the raw ext. If nil, ext is exposed in Value.\n\t// Data is used by codecs (e.g. binc, msgpack, simple) which do custom serialization of types\n\tData []byte\n\t// Value represents the extension, if Data is nil.\n\t// Value is used by codecs (e.g. cbor, json) which leverage the format to do\n\t// custom serialization of the types.\n\tValue interface{}\n}\n\n// BytesExt handles custom (de)serialization of types to/from []byte.\n// It is used by codecs (e.g. binc, msgpack, simple) which do custom serialization of the types.\ntype BytesExt interface {\n\t// WriteExt converts a value to a []byte.\n\t//\n\t// Note: v is a pointer iff the registered extension type is a struct or array kind.\n\tWriteExt(v interface{}) []byte\n\n\t// ReadExt updates a value from a []byte.\n\t//\n\t// Note: dst is always a pointer kind to the registered extension type.\n\tReadExt(dst interface{}, src []byte)\n}\n\n// InterfaceExt handles custom (de)serialization of types to/from another interface{} value.\n// The Encoder or Decoder will then handle the further (de)serialization of that known type.\n//\n// It is used by codecs (e.g. cbor, json) which use the format to do custom serialization of types.\ntype InterfaceExt interface {\n\t// ConvertExt converts a value into a simpler interface for easy encoding\n\t// e.g. convert time.Time to int64.\n\t//\n\t// Note: v is a pointer iff the registered extension type is a struct or array kind.\n\tConvertExt(v interface{}) interface{}\n\n\t// UpdateExt updates a value from a simpler interface for easy decoding\n\t// e.g. convert int64 to time.Time.\n\t//\n\t// Note: dst is always a pointer kind to the registered extension type.\n\tUpdateExt(dst interface{}, src interface{})\n}\n\n// Ext handles custom (de)serialization of custom types / extensions.\ntype Ext interface {\n\tBytesExt\n\tInterfaceExt\n}\n\n// addExtWrapper is a wrapper implementation to support former AddExt exported method.\ntype addExtWrapper struct {\n\tencFn func(reflect.Value) ([]byte, error)\n\tdecFn func(reflect.Value, []byte) error\n}\n\nfunc (x addExtWrapper) WriteExt(v interface{}) []byte {\n\tbs, err := x.encFn(reflect.ValueOf(v))\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn bs\n}\n\nfunc (x addExtWrapper) ReadExt(v interface{}, bs []byte) {\n\tif err := x.decFn(reflect.ValueOf(v), bs); err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (x addExtWrapper) ConvertExt(v interface{}) interface{} {\n\treturn x.WriteExt(v)\n}\n\nfunc (x addExtWrapper) UpdateExt(dest interface{}, v interface{}) {\n\tx.ReadExt(dest, v.([]byte))\n}\n\ntype bytesExtFailer struct{}\n\nfunc (bytesExtFailer) WriteExt(v interface{}) []byte {\n\tpanicv.errorstr(\"BytesExt.WriteExt is not supported\")\n\treturn nil\n}\nfunc (bytesExtFailer) ReadExt(v interface{}, bs []byte) {\n\tpanicv.errorstr(\"BytesExt.ReadExt is not supported\")\n}\n\ntype interfaceExtFailer struct{}\n\nfunc (interfaceExtFailer) ConvertExt(v interface{}) interface{} {\n\tpanicv.errorstr(\"InterfaceExt.ConvertExt is not supported\")\n\treturn nil\n}\nfunc (interfaceExtFailer) UpdateExt(dest interface{}, v interface{}) {\n\tpanicv.errorstr(\"InterfaceExt.UpdateExt is not supported\")\n}\n\n// type extWrapper struct {\n// \tBytesExt\n// \tInterfaceExt\n// }\n\ntype bytesExtWrapper struct {\n\tinterfaceExtFailer\n\tBytesExt\n}\n\ntype interfaceExtWrapper struct {\n\tbytesExtFailer\n\tInterfaceExt\n}\n\ntype binaryEncodingType struct{}\n\nfunc (binaryEncodingType) isBinary() bool { return true }\n\ntype textEncodingType struct{}\n\nfunc (textEncodingType) isBinary() bool { return false }\n\n// noBuiltInTypes is embedded into many types which do not support builtins\n// e.g. msgpack, simple, cbor.\n\n// type noBuiltInTypeChecker struct{}\n// func (noBuiltInTypeChecker) IsBuiltinType(rt uintptr) bool { return false }\n// type noBuiltInTypes struct{ noBuiltInTypeChecker }\n\ntype noBuiltInTypes struct{}\n\nfunc (noBuiltInTypes) EncodeBuiltin(rt uintptr, v interface{}) {}\nfunc (noBuiltInTypes) DecodeBuiltin(rt uintptr, v interface{}) {}\n\n// type noStreamingCodec struct{}\n// func (noStreamingCodec) CheckBreak() bool { return false }\n// func (noStreamingCodec) hasElemSeparators() bool { return false }\n\ntype noElemSeparators struct{}\n\nfunc (noElemSeparators) hasElemSeparators() (v bool) { return }\nfunc (noElemSeparators) recreateEncDriver(e encDriver) (v bool) { return }\n\n// bigenHelper.\n// Users must already slice the x completely, because we will not reslice.\ntype bigenHelper struct {\n\tx []byte // must be correctly sliced to appropriate len. slicing is a cost.\n\tw *encWriterSwitch\n}\n\nfunc (z bigenHelper) writeUint16(v uint16) {\n\tbigen.PutUint16(z.x, v)\n\tz.w.writeb(z.x)\n}\n\nfunc (z bigenHelper) writeUint32(v uint32) {\n\tbigen.PutUint32(z.x, v)\n\tz.w.writeb(z.x)\n}\n\nfunc (z bigenHelper) writeUint64(v uint64) {\n\tbigen.PutUint64(z.x, v)\n\tz.w.writeb(z.x)\n}\n\ntype extTypeTagFn struct {\n\trtid uintptr\n\trtidptr uintptr\n\trt reflect.Type\n\ttag uint64\n\text Ext\n\t// _ [1]uint64 // padding\n}\n\ntype extHandle []extTypeTagFn\n\n// AddExt registes an encode and decode function for a reflect.Type.\n// To deregister an Ext, call AddExt with nil encfn and/or nil decfn.\n//\n// Deprecated: Use SetBytesExt or SetInterfaceExt on the Handle instead.\nfunc (o *extHandle) AddExt(rt reflect.Type, tag byte,\n\tencfn func(reflect.Value) ([]byte, error),\n\tdecfn func(reflect.Value, []byte) error) (err error) {\n\tif encfn == nil || decfn == nil {\n\t\treturn o.SetExt(rt, uint64(tag), nil)\n\t}\n\treturn o.SetExt(rt, uint64(tag), addExtWrapper{encfn, decfn})\n}\n\n// SetExt will set the extension for a tag and reflect.Type.\n// Note that the type must be a named type, and specifically not a pointer or Interface.\n// An error is returned if that is not honored.\n// To Deregister an ext, call SetExt with nil Ext.\n//\n// Deprecated: Use SetBytesExt or SetInterfaceExt on the Handle instead.\nfunc (o *extHandle) SetExt(rt reflect.Type, tag uint64, ext Ext) (err error) {\n\t// o is a pointer, because we may need to initialize it\n\trk := rt.Kind()\n\tfor rk == reflect.Ptr {\n\t\trt = rt.Elem()\n\t\trk = rt.Kind()\n\t}\n\n\tif rt.PkgPath() == \"\" || rk == reflect.Interface { // || rk == reflect.Ptr {\n\t\treturn fmt.Errorf(\"codec.Handle.SetExt: Takes named type, not a pointer or interface: %v\", rt)\n\t}\n\n\trtid := rt2id(rt)\n\tswitch rtid {\n\tcase timeTypId, rawTypId, rawExtTypId:\n\t\t// all natively supported type, so cannot have an extension\n\t\treturn // TODO: should we silently ignore, or return an error???\n\t}\n\t// if o == nil {\n\t// \treturn errors.New(\"codec.Handle.SetExt: extHandle not initialized\")\n\t// }\n\to2 := *o\n\t// if o2 == nil {\n\t// \treturn errors.New(\"codec.Handle.SetExt: extHandle not initialized\")\n\t// }\n\tfor i := range o2 {\n\t\tv := &o2[i]\n\t\tif v.rtid == rtid {\n\t\t\tv.tag, v.ext = tag, ext\n\t\t\treturn\n\t\t}\n\t}\n\trtidptr := rt2id(reflect.PtrTo(rt))\n\t*o = append(o2, extTypeTagFn{rtid, rtidptr, rt, tag, ext}) // , [1]uint64{}})\n\treturn\n}\n\nfunc (o extHandle) getExt(rtid uintptr) (v *extTypeTagFn) {\n\tfor i := range o {\n\t\tv = &o[i]\n\t\tif v.rtid == rtid || v.rtidptr == rtid {\n\t\t\treturn\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (o extHandle) getExtForTag(tag uint64) (v *extTypeTagFn) {\n\tfor i := range o {\n\t\tv = &o[i]\n\t\tif v.tag == tag {\n\t\t\treturn\n\t\t}\n\t}\n\treturn nil\n}\n\ntype intf2impl struct {\n\trtid uintptr // for intf\n\timpl reflect.Type\n\t// _ [1]uint64 // padding // not-needed, as *intf2impl is never returned.\n}\n\ntype intf2impls []intf2impl\n\n// Intf2Impl maps an interface to an implementing type.\n// This allows us support infering the concrete type\n// and populating it when passed an interface.\n// e.g. var v io.Reader can be decoded as a bytes.Buffer, etc.\n//\n// Passing a nil impl will clear the mapping.\nfunc (o *intf2impls) Intf2Impl(intf, impl reflect.Type) (err error) {\n\tif impl != nil && !impl.Implements(intf) {\n\t\treturn fmt.Errorf(\"Intf2Impl: %v does not implement %v\", impl, intf)\n\t}\n\trtid := rt2id(intf)\n\to2 := *o\n\tfor i := range o2 {\n\t\tv := &o2[i]\n\t\tif v.rtid == rtid {\n\t\t\tv.impl = impl\n\t\t\treturn\n\t\t}\n\t}\n\t*o = append(o2, intf2impl{rtid, impl})\n\treturn\n}\n\nfunc (o intf2impls) intf2impl(rtid uintptr) (rv reflect.Value) {\n\tfor i := range o {\n\t\tv := &o[i]\n\t\tif v.rtid == rtid {\n\t\t\tif v.impl == nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif v.impl.Kind() == reflect.Ptr {\n\t\t\t\treturn reflect.New(v.impl.Elem())\n\t\t\t}\n\t\t\treturn reflect.New(v.impl).Elem()\n\t\t}\n\t}\n\treturn\n}\n\ntype structFieldInfoFlag uint8\n\nconst (\n\t_ structFieldInfoFlag = 1 << iota\n\tstructFieldInfoFlagReady\n\tstructFieldInfoFlagOmitEmpty\n)\n\nfunc (x *structFieldInfoFlag) flagSet(f structFieldInfoFlag) {\n\t*x = *x | f\n}\n\nfunc (x *structFieldInfoFlag) flagClr(f structFieldInfoFlag) {\n\t*x = *x &^ f\n}\n\nfunc (x structFieldInfoFlag) flagGet(f structFieldInfoFlag) bool {\n\treturn x&f != 0\n}\n\nfunc (x structFieldInfoFlag) omitEmpty() bool {\n\treturn x.flagGet(structFieldInfoFlagOmitEmpty)\n}\n\nfunc (x structFieldInfoFlag) ready() bool {\n\treturn x.flagGet(structFieldInfoFlagReady)\n}\n\ntype structFieldInfo struct {\n\tencName string // encode name\n\tfieldName string // field name\n\n\tis [maxLevelsEmbedding]uint16 // (recursive/embedded) field index in struct\n\tnis uint8 // num levels of embedding. if 1, then it's not embedded.\n\n\tencNameAsciiAlphaNum bool // the encName only contains ascii alphabet and numbers\n\tstructFieldInfoFlag\n\t// _ [1]byte // padding\n}\n\nfunc (si *structFieldInfo) setToZeroValue(v reflect.Value) {\n\tif v, valid := si.field(v, false); valid {\n\t\tv.Set(reflect.Zero(v.Type()))\n\t}\n}\n\n// rv returns the field of the struct.\n// If anonymous, it returns an Invalid\nfunc (si *structFieldInfo) field(v reflect.Value, update bool) (rv2 reflect.Value, valid bool) {\n\t// replicate FieldByIndex\n\tfor i, x := range si.is {\n\t\tif uint8(i) == si.nis {\n\t\t\tbreak\n\t\t}\n\t\tif v, valid = baseStructRv(v, update); !valid {\n\t\t\treturn\n\t\t}\n\t\tv = v.Field(int(x))\n\t}\n\n\treturn v, true\n}\n\n// func (si *structFieldInfo) fieldval(v reflect.Value, update bool) reflect.Value {\n// \tv, _ = si.field(v, update)\n// \treturn v\n// }\n\nfunc parseStructInfo(stag string) (toArray, omitEmpty bool, keytype valueType) {\n\tkeytype = valueTypeString // default\n\tif stag == \"\" {\n\t\treturn\n\t}\n\tfor i, s := range strings.Split(stag, \",\") {\n\t\tif i == 0 {\n\t\t} else {\n\t\t\tswitch s {\n\t\t\tcase \"omitempty\":\n\t\t\t\tomitEmpty = true\n\t\t\tcase \"toarray\":\n\t\t\t\ttoArray = true\n\t\t\tcase \"int\":\n\t\t\t\tkeytype = valueTypeInt\n\t\t\tcase \"uint\":\n\t\t\t\tkeytype = valueTypeUint\n\t\t\tcase \"float\":\n\t\t\t\tkeytype = valueTypeFloat\n\t\t\t\t// case \"bool\":\n\t\t\t\t// \tkeytype = valueTypeBool\n\t\t\tcase \"string\":\n\t\t\t\tkeytype = valueTypeString\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc (si *structFieldInfo) parseTag(stag string) {\n\t// if fname == \"\" {\n\t// \tpanic(errNoFieldNameToStructFieldInfo)\n\t// }\n\n\tif stag == \"\" {\n\t\treturn\n\t}\n\tfor i, s := range strings.Split(stag, \",\") {\n\t\tif i == 0 {\n\t\t\tif s != \"\" {\n\t\t\t\tsi.encName = s\n\t\t\t}\n\t\t} else {\n\t\t\tswitch s {\n\t\t\tcase \"omitempty\":\n\t\t\t\tsi.flagSet(structFieldInfoFlagOmitEmpty)\n\t\t\t\t// si.omitEmpty = true\n\t\t\t\t// case \"toarray\":\n\t\t\t\t// \tsi.toArray = true\n\t\t\t}\n\t\t}\n\t}\n}\n\ntype sfiSortedByEncName []*structFieldInfo\n\nfunc (p sfiSortedByEncName) Len() int { return len(p) }\nfunc (p sfiSortedByEncName) Less(i, j int) bool { return p[uint(i)].encName < p[uint(j)].encName }\nfunc (p sfiSortedByEncName) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\n\nconst structFieldNodeNumToCache = 4\n\ntype structFieldNodeCache struct {\n\trv [structFieldNodeNumToCache]reflect.Value\n\tidx [structFieldNodeNumToCache]uint32\n\tnum uint8\n}\n\nfunc (x *structFieldNodeCache) get(key uint32) (fv reflect.Value, valid bool) {\n\tfor i, k := range &x.idx {\n\t\tif uint8(i) == x.num {\n\t\t\treturn // break\n\t\t}\n\t\tif key == k {\n\t\t\treturn x.rv[i], true\n\t\t}\n\t}\n\treturn\n}\n\nfunc (x *structFieldNodeCache) tryAdd(fv reflect.Value, key uint32) {\n\tif x.num < structFieldNodeNumToCache {\n\t\tx.rv[x.num] = fv\n\t\tx.idx[x.num] = key\n\t\tx.num++\n\t\treturn\n\t}\n}\n\ntype structFieldNode struct {\n\tv reflect.Value\n\tcache2 structFieldNodeCache\n\tcache3 structFieldNodeCache\n\tupdate bool\n}\n\nfunc (x *structFieldNode) field(si *structFieldInfo) (fv reflect.Value) {\n\t// return si.fieldval(x.v, x.update)\n\t// Note: we only cache if nis=2 or nis=3 i.e. up to 2 levels of embedding\n\t// This mostly saves us time on the repeated calls to v.Elem, v.Field, etc.\n\tvar valid bool\n\tswitch si.nis {\n\tcase 1:\n\t\tfv = x.v.Field(int(si.is[0]))\n\tcase 2:\n\t\tif fv, valid = x.cache2.get(uint32(si.is[0])); valid {\n\t\t\tfv = fv.Field(int(si.is[1]))\n\t\t\treturn\n\t\t}\n\t\tfv = x.v.Field(int(si.is[0]))\n\t\tif fv, valid = baseStructRv(fv, x.update); !valid {\n\t\t\treturn\n\t\t}\n\t\tx.cache2.tryAdd(fv, uint32(si.is[0]))\n\t\tfv = fv.Field(int(si.is[1]))\n\tcase 3:\n\t\tvar key uint32 = uint32(si.is[0])<<16 | uint32(si.is[1])\n\t\tif fv, valid = x.cache3.get(key); valid {\n\t\t\tfv = fv.Field(int(si.is[2]))\n\t\t\treturn\n\t\t}\n\t\tfv = x.v.Field(int(si.is[0]))\n\t\tif fv, valid = baseStructRv(fv, x.update); !valid {\n\t\t\treturn\n\t\t}\n\t\tfv = fv.Field(int(si.is[1]))\n\t\tif fv, valid = baseStructRv(fv, x.update); !valid {\n\t\t\treturn\n\t\t}\n\t\tx.cache3.tryAdd(fv, key)\n\t\tfv = fv.Field(int(si.is[2]))\n\tdefault:\n\t\tfv, _ = si.field(x.v, x.update)\n\t}\n\treturn\n}\n\nfunc baseStructRv(v reflect.Value, update bool) (v2 reflect.Value, valid bool) {\n\tfor v.Kind() == reflect.Ptr {\n\t\tif v.IsNil() {\n\t\t\tif !update {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tv.Set(reflect.New(v.Type().Elem()))\n\t\t}\n\t\tv = v.Elem()\n\t}\n\treturn v, true\n}\n\ntype typeInfoFlag uint8\n\nconst (\n\ttypeInfoFlagComparable = 1 << iota\n\ttypeInfoFlagIsZeroer\n\ttypeInfoFlagIsZeroerPtr\n)\n\n// typeInfo keeps static (non-changing readonly)information\n// about each (non-ptr) type referenced in the encode/decode sequence.\n//\n// During an encode/decode sequence, we work as below:\n// - If base is a built in type, en/decode base value\n// - If base is registered as an extension, en/decode base value\n// - If type is binary(M/Unm)arshaler, call Binary(M/Unm)arshal method\n// - If type is text(M/Unm)arshaler, call Text(M/Unm)arshal method\n// - Else decode appropriately based on the reflect.Kind\ntype typeInfo struct {\n\trt reflect.Type\n\telem reflect.Type\n\tpkgpath string\n\n\trtid uintptr\n\t// rv0 reflect.Value // saved zero value, used if immutableKind\n\n\tnumMeth uint16 // number of methods\n\tkind uint8\n\tchandir uint8\n\n\tanyOmitEmpty bool // true if a struct, and any of the fields are tagged \"omitempty\"\n\ttoArray bool // whether this (struct) type should be encoded as an array\n\tkeyType valueType // if struct, how is the field name stored in a stream? default is string\n\tmbs bool // base type (T or *T) is a MapBySlice\n\n\t// ---- cpu cache line boundary?\n\tsfiSort []*structFieldInfo // sorted. Used when enc/dec struct to map.\n\tsfiSrc []*structFieldInfo // unsorted. Used when enc/dec struct to array.\n\n\tkey reflect.Type\n\n\t// ---- cpu cache line boundary?\n\t// sfis []structFieldInfo // all sfi, in src order, as created.\n\tsfiNamesSort []byte // all names, with indexes into the sfiSort\n\n\t// format of marshal type fields below: [btj][mu]p? OR csp?\n\n\tbm bool // T is a binaryMarshaler\n\tbmp bool // *T is a binaryMarshaler\n\tbu bool // T is a binaryUnmarshaler\n\tbup bool // *T is a binaryUnmarshaler\n\ttm bool // T is a textMarshaler\n\ttmp bool // *T is a textMarshaler\n\ttu bool // T is a textUnmarshaler\n\ttup bool // *T is a textUnmarshaler\n\n\tjm bool // T is a jsonMarshaler\n\tjmp bool // *T is a jsonMarshaler\n\tju bool // T is a jsonUnmarshaler\n\tjup bool // *T is a jsonUnmarshaler\n\tcs bool // T is a Selfer\n\tcsp bool // *T is a Selfer\n\tmf bool // T is a MissingFielder\n\tmfp bool // *T is a MissingFielder\n\n\t// other flags, with individual bits representing if set.\n\tflags typeInfoFlag\n\tinfoFieldOmitempty bool\n\n\t// _ [6]byte // padding\n\t// _ [2]uint64 // padding\n}\n\nfunc (ti *typeInfo) isFlag(f typeInfoFlag) bool {\n\treturn ti.flags&f != 0\n}\n\nfunc (ti *typeInfo) indexForEncName(name []byte) (index int16) {\n\tvar sn []byte\n\tif len(name)+2 <= 32 {\n\t\tvar buf [32]byte // should not escape to heap\n\t\tsn = buf[:len(name)+2]\n\t} else {\n\t\tsn = make([]byte, len(name)+2)\n\t}\n\tcopy(sn[1:], name)\n\tsn[0], sn[len(sn)-1] = tiSep2(name), 0xff\n\tj := bytes.Index(ti.sfiNamesSort, sn)\n\tif j < 0 {\n\t\treturn -1\n\t}\n\tindex = int16(uint16(ti.sfiNamesSort[j+len(sn)+1]) | uint16(ti.sfiNamesSort[j+len(sn)])<<8)\n\treturn\n}\n\ntype rtid2ti struct {\n\trtid uintptr\n\tti *typeInfo\n}\n\n// TypeInfos caches typeInfo for each type on first inspection.\n//\n// It is configured with a set of tag keys, which are used to get\n// configuration for the type.\ntype TypeInfos struct {\n\t// infos: formerly map[uintptr]*typeInfo, now *[]rtid2ti, 2 words expected\n\tinfos atomicTypeInfoSlice\n\tmu sync.Mutex\n\t_ uint64 // padding (cache-aligned)\n\ttags []string\n\t_ uint64 // padding (cache-aligned)\n}\n\n// NewTypeInfos creates a TypeInfos given a set of struct tags keys.\n//\n// This allows users customize the struct tag keys which contain configuration\n// of their types.\nfunc NewTypeInfos(tags []string) *TypeInfos {\n\treturn &TypeInfos{tags: tags}\n}\n\nfunc (x *TypeInfos) structTag(t reflect.StructTag) (s string) {\n\t// check for tags: codec, json, in that order.\n\t// this allows seamless support for many configured structs.\n\tfor _, x := range x.tags {\n\t\ts = t.Get(x)\n\t\tif s != \"\" {\n\t\t\treturn s\n\t\t}\n\t}\n\treturn\n}\n\nfunc findTypeInfo(s []rtid2ti, rtid uintptr) (i uint, ti *typeInfo) {\n\t// binary search. adapted from sort/search.go.\n\t// Note: we use goto (instead of for loop) so this can be inlined.\n\n\t// if sp == nil {\n\t// \treturn -1, nil\n\t// }\n\t// s := *sp\n\n\t// h, i, j := 0, 0, len(s)\n\tvar h uint // var h, i uint\n\tvar j = uint(len(s))\nLOOP:\n\tif i < j {\n\t\th = i + (j-i)/2\n\t\tif s[h].rtid < rtid {\n\t\t\ti = h + 1\n\t\t} else {\n\t\t\tj = h\n\t\t}\n\t\tgoto LOOP\n\t}\n\tif i < uint(len(s)) && s[i].rtid == rtid {\n\t\tti = s[i].ti\n\t}\n\treturn\n}\n\nfunc (x *TypeInfos) get(rtid uintptr, rt reflect.Type) (pti *typeInfo) {\n\tsp := x.infos.load()\n\tif sp != nil {\n\t\t_, pti = findTypeInfo(sp, rtid)\n\t\tif pti != nil {\n\t\t\treturn\n\t\t}\n\t}\n\n\trk := rt.Kind()\n\n\tif rk == reflect.Ptr { // || (rk == reflect.Interface && rtid != intfTypId) {\n\t\tpanicv.errorf(\"invalid kind passed to TypeInfos.get: %v - %v\", rk, rt)\n\t}\n\n\t// do not hold lock while computing this.\n\t// it may lead to duplication, but that's ok.\n\tti := typeInfo{\n\t\trt: rt,\n\t\trtid: rtid,\n\t\tkind: uint8(rk),\n\t\tpkgpath: rt.PkgPath(),\n\t\tkeyType: valueTypeString, // default it - so it's never 0\n\t}\n\t// ti.rv0 = reflect.Zero(rt)\n\n\t// ti.comparable = rt.Comparable()\n\tti.numMeth = uint16(rt.NumMethod())\n\n\tti.bm, ti.bmp = implIntf(rt, binaryMarshalerTyp)\n\tti.bu, ti.bup = implIntf(rt, binaryUnmarshalerTyp)\n\tti.tm, ti.tmp = implIntf(rt, textMarshalerTyp)\n\tti.tu, ti.tup = implIntf(rt, textUnmarshalerTyp)\n\tti.jm, ti.jmp = implIntf(rt, jsonMarshalerTyp)\n\tti.ju, ti.jup = implIntf(rt, jsonUnmarshalerTyp)\n\tti.cs, ti.csp = implIntf(rt, selferTyp)\n\tti.mf, ti.mfp = implIntf(rt, missingFielderTyp)\n\n\tb1, b2 := implIntf(rt, iszeroTyp)\n\tif b1 {\n\t\tti.flags |= typeInfoFlagIsZeroer\n\t}\n\tif b2 {\n\t\tti.flags |= typeInfoFlagIsZeroerPtr\n\t}\n\tif rt.Comparable() {\n\t\tti.flags |= typeInfoFlagComparable\n\t}\n\n\tswitch rk {\n\tcase reflect.Struct:\n\t\tvar omitEmpty bool\n\t\tif f, ok := rt.FieldByName(structInfoFieldName); ok {\n\t\t\tti.toArray, omitEmpty, ti.keyType = parseStructInfo(x.structTag(f.Tag))\n\t\t\tti.infoFieldOmitempty = omitEmpty\n\t\t} else {\n\t\t\tti.keyType = valueTypeString\n\t\t}\n\t\tpp, pi := &pool.tiload, pool.tiload.Get() // pool.tiLoad()\n\t\tpv := pi.(*typeInfoLoadArray)\n\t\tpv.etypes[0] = ti.rtid\n\t\t// vv := typeInfoLoad{pv.fNames[:0], pv.encNames[:0], pv.etypes[:1], pv.sfis[:0]}\n\t\tvv := typeInfoLoad{pv.etypes[:1], pv.sfis[:0]}\n\t\tx.rget(rt, rtid, omitEmpty, nil, &vv)\n\t\t// ti.sfis = vv.sfis\n\t\tti.sfiSrc, ti.sfiSort, ti.sfiNamesSort, ti.anyOmitEmpty = rgetResolveSFI(rt, vv.sfis, pv)\n\t\tpp.Put(pi)\n\tcase reflect.Map:\n\t\tti.elem = rt.Elem()\n\t\tti.key = rt.Key()\n\tcase reflect.Slice:\n\t\tti.mbs, _ = implIntf(rt, mapBySliceTyp)\n\t\tti.elem = rt.Elem()\n\tcase reflect.Chan:\n\t\tti.elem = rt.Elem()\n\t\tti.chandir = uint8(rt.ChanDir())\n\tcase reflect.Array, reflect.Ptr:\n\t\tti.elem = rt.Elem()\n\t}\n\t// sfi = sfiSrc\n\n\tx.mu.Lock()\n\tsp = x.infos.load()\n\tvar sp2 []rtid2ti\n\tif sp == nil {\n\t\tpti = &ti\n\t\tsp2 = []rtid2ti{{rtid, pti}}\n\t\tx.infos.store(sp2)\n\t} else {\n\t\tvar idx uint\n\t\tidx, pti = findTypeInfo(sp, rtid)\n\t\tif pti == nil {\n\t\t\tpti = &ti\n\t\t\tsp2 = make([]rtid2ti, len(sp)+1)\n\t\t\tcopy(sp2, sp[:idx])\n\t\t\tcopy(sp2[idx+1:], sp[idx:])\n\t\t\tsp2[idx] = rtid2ti{rtid, pti}\n\t\t\tx.infos.store(sp2)\n\t\t}\n\t}\n\tx.mu.Unlock()\n\treturn\n}\n\nfunc (x *TypeInfos) rget(rt reflect.Type, rtid uintptr, omitEmpty bool,\n\tindexstack []uint16, pv *typeInfoLoad) {\n\t// Read up fields and store how to access the value.\n\t//\n\t// It uses go's rules for message selectors,\n\t// which say that the field with the shallowest depth is selected.\n\t//\n\t// Note: we consciously use slices, not a map, to simulate a set.\n\t// Typically, types have < 16 fields,\n\t// and iteration using equals is faster than maps there\n\tflen := rt.NumField()\n\tif flen > (1< %v fields are not supported - has %v fields\",\n\t\t\t(1<= 0; i-- { // bounds-check elimination\n\t\t\tb := si.encName[i]\n\t\t\tif (b >= '0' && b <= '9') || (b >= 'a' && b <= 'z') || (b >= 'A' && b <= 'Z') {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tsi.encNameAsciiAlphaNum = false\n\t\t\tbreak\n\t\t}\n\t\tsi.fieldName = f.Name\n\t\tsi.flagSet(structFieldInfoFlagReady)\n\n\t\t// pv.encNames = append(pv.encNames, si.encName)\n\n\t\t// si.ikind = int(f.Type.Kind())\n\t\tif len(indexstack) > maxLevelsEmbedding-1 {\n\t\t\tpanicv.errorf(\"codec: only supports up to %v depth of embedding - type has %v depth\",\n\t\t\t\tmaxLevelsEmbedding-1, len(indexstack))\n\t\t}\n\t\tsi.nis = uint8(len(indexstack)) + 1\n\t\tcopy(si.is[:], indexstack)\n\t\tsi.is[len(indexstack)] = j\n\n\t\tif omitEmpty {\n\t\t\tsi.flagSet(structFieldInfoFlagOmitEmpty)\n\t\t}\n\t\tpv.sfis = append(pv.sfis, si)\n\t}\n}\n\nfunc tiSep(name string) uint8 {\n\t// (xn[0]%64) // (between 192-255 - outside ascii BMP)\n\t// return 0xfe - (name[0] & 63)\n\t// return 0xfe - (name[0] & 63) - uint8(len(name))\n\t// return 0xfe - (name[0] & 63) - uint8(len(name)&63)\n\t// return ((0xfe - (name[0] & 63)) & 0xf8) | (uint8(len(name) & 0x07))\n\treturn 0xfe - (name[0] & 63) - uint8(len(name)&63)\n}\n\nfunc tiSep2(name []byte) uint8 {\n\treturn 0xfe - (name[0] & 63) - uint8(len(name)&63)\n}\n\n// resolves the struct field info got from a call to rget.\n// Returns a trimmed, unsorted and sorted []*structFieldInfo.\nfunc rgetResolveSFI(rt reflect.Type, x []structFieldInfo, pv *typeInfoLoadArray) (\n\ty, z []*structFieldInfo, ss []byte, anyOmitEmpty bool) {\n\tsa := pv.sfiidx[:0]\n\tsn := pv.b[:]\n\tn := len(x)\n\n\tvar xn string\n\tvar ui uint16\n\tvar sep byte\n\n\tfor i := range x {\n\t\tui = uint16(i)\n\t\txn = x[i].encName // fieldName or encName? use encName for now.\n\t\tif len(xn)+2 > cap(sn) {\n\t\t\tsn = make([]byte, len(xn)+2)\n\t\t} else {\n\t\t\tsn = sn[:len(xn)+2]\n\t\t}\n\t\t// use a custom sep, so that misses are less frequent,\n\t\t// since the sep (first char in search) is as unique as first char in field name.\n\t\tsep = tiSep(xn)\n\t\tsn[0], sn[len(sn)-1] = sep, 0xff\n\t\tcopy(sn[1:], xn)\n\t\tj := bytes.Index(sa, sn)\n\t\tif j == -1 {\n\t\t\tsa = append(sa, sep)\n\t\t\tsa = append(sa, xn...)\n\t\t\tsa = append(sa, 0xff, byte(ui>>8), byte(ui))\n\t\t} else {\n\t\t\tindex := uint16(sa[j+len(sn)+1]) | uint16(sa[j+len(sn)])<<8\n\t\t\t// one of them must be cleared (reset to nil),\n\t\t\t// and the index updated appropriately\n\t\t\ti2clear := ui // index to be cleared\n\t\t\tif x[i].nis < x[index].nis { // this one is shallower\n\t\t\t\t// update the index to point to this later one.\n\t\t\t\tsa[j+len(sn)], sa[j+len(sn)+1] = byte(ui>>8), byte(ui)\n\t\t\t\t// clear the earlier one, as this later one is shallower.\n\t\t\t\ti2clear = index\n\t\t\t}\n\t\t\tif x[i2clear].ready() {\n\t\t\t\tx[i2clear].flagClr(structFieldInfoFlagReady)\n\t\t\t\tn--\n\t\t\t}\n\t\t}\n\t}\n\n\tvar w []structFieldInfo\n\tsharingArray := len(x) <= typeInfoLoadArraySfisLen // sharing array with typeInfoLoadArray\n\tif sharingArray {\n\t\tw = make([]structFieldInfo, n)\n\t}\n\n\t// remove all the nils (non-ready)\n\ty = make([]*structFieldInfo, n)\n\tn = 0\n\tvar sslen int\n\tfor i := range x {\n\t\tif !x[i].ready() {\n\t\t\tcontinue\n\t\t}\n\t\tif !anyOmitEmpty && x[i].omitEmpty() {\n\t\t\tanyOmitEmpty = true\n\t\t}\n\t\tif sharingArray {\n\t\t\tw[n] = x[i]\n\t\t\ty[n] = &w[n]\n\t\t} else {\n\t\t\ty[n] = &x[i]\n\t\t}\n\t\tsslen = sslen + len(x[i].encName) + 4\n\t\tn++\n\t}\n\tif n != len(y) {\n\t\tpanicv.errorf(\"failure reading struct %v - expecting %d of %d valid fields, got %d\",\n\t\t\trt, len(y), len(x), n)\n\t}\n\n\tz = make([]*structFieldInfo, len(y))\n\tcopy(z, y)\n\tsort.Sort(sfiSortedByEncName(z))\n\n\tsharingArray = len(sa) <= typeInfoLoadArraySfiidxLen\n\tif sharingArray {\n\t\tss = make([]byte, 0, sslen)\n\t} else {\n\t\tss = sa[:0] // reuse the newly made sa array if necessary\n\t}\n\tfor i := range z {\n\t\txn = z[i].encName\n\t\tsep = tiSep(xn)\n\t\tui = uint16(i)\n\t\tss = append(ss, sep)\n\t\tss = append(ss, xn...)\n\t\tss = append(ss, 0xff, byte(ui>>8), byte(ui))\n\t}\n\treturn\n}\n\nfunc implIntf(rt, iTyp reflect.Type) (base bool, indir bool) {\n\treturn rt.Implements(iTyp), reflect.PtrTo(rt).Implements(iTyp)\n}\n\n// isEmptyStruct is only called from isEmptyValue, and checks if a struct is empty:\n// - does it implement IsZero() bool\n// - is it comparable, and can i compare directly using ==\n// - if checkStruct, then walk through the encodable fields\n// and check if they are empty or not.\nfunc isEmptyStruct(v reflect.Value, tinfos *TypeInfos, deref, checkStruct bool) bool {\n\t// v is a struct kind - no need to check again.\n\t// We only check isZero on a struct kind, to reduce the amount of times\n\t// that we lookup the rtid and typeInfo for each type as we walk the tree.\n\n\tvt := v.Type()\n\trtid := rt2id(vt)\n\tif tinfos == nil {\n\t\ttinfos = defTypeInfos\n\t}\n\tti := tinfos.get(rtid, vt)\n\tif ti.rtid == timeTypId {\n\t\treturn rv2i(v).(time.Time).IsZero()\n\t}\n\tif ti.isFlag(typeInfoFlagIsZeroerPtr) && v.CanAddr() {\n\t\treturn rv2i(v.Addr()).(isZeroer).IsZero()\n\t}\n\tif ti.isFlag(typeInfoFlagIsZeroer) {\n\t\treturn rv2i(v).(isZeroer).IsZero()\n\t}\n\tif ti.isFlag(typeInfoFlagComparable) {\n\t\treturn rv2i(v) == rv2i(reflect.Zero(vt))\n\t}\n\tif !checkStruct {\n\t\treturn false\n\t}\n\t// We only care about what we can encode/decode,\n\t// so that is what we use to check omitEmpty.\n\tfor _, si := range ti.sfiSrc {\n\t\tsfv, valid := si.field(v, false)\n\t\tif valid && !isEmptyValue(sfv, tinfos, deref, checkStruct) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// func roundFloat(x float64) float64 {\n// \tt := math.Trunc(x)\n// \tif math.Abs(x-t) >= 0.5 {\n// \t\treturn t + math.Copysign(1, x)\n// \t}\n// \treturn t\n// }\n\nfunc panicToErr(h errDecorator, err *error) {\n\t// Note: This method MUST be called directly from defer i.e. defer panicToErr ...\n\t// else it seems the recover is not fully handled\n\tif recoverPanicToErr {\n\t\tif x := recover(); x != nil {\n\t\t\t// fmt.Printf(\"panic'ing with: %v\\n\", x)\n\t\t\t// debug.PrintStack()\n\t\t\tpanicValToErr(h, x, err)\n\t\t}\n\t}\n}\n\nfunc panicValToErr(h errDecorator, v interface{}, err *error) {\n\tswitch xerr := v.(type) {\n\tcase nil:\n\tcase error:\n\t\tswitch xerr {\n\t\tcase nil:\n\t\tcase io.EOF, io.ErrUnexpectedEOF, errEncoderNotInitialized, errDecoderNotInitialized:\n\t\t\t// treat as special (bubble up)\n\t\t\t*err = xerr\n\t\tdefault:\n\t\t\th.wrapErr(xerr, err)\n\t\t}\n\tcase string:\n\t\tif xerr != \"\" {\n\t\t\th.wrapErr(xerr, err)\n\t\t}\n\tcase fmt.Stringer:\n\t\tif xerr != nil {\n\t\t\th.wrapErr(xerr, err)\n\t\t}\n\tdefault:\n\t\th.wrapErr(v, err)\n\t}\n}\n\nfunc isImmutableKind(k reflect.Kind) (v bool) {\n\t// return immutableKindsSet[k]\n\t// since we know reflect.Kind is in range 0..31, then use the k%32 == k constraint\n\treturn immutableKindsSet[k%reflect.Kind(len(immutableKindsSet))] // bounds-check-elimination\n}\n\n// ----\n\ntype codecFnInfo struct {\n\tti *typeInfo\n\txfFn Ext\n\txfTag uint64\n\tseq seqType\n\taddrD bool\n\taddrF bool // if addrD, this says whether decode function can take a value or a ptr\n\taddrE bool\n}\n\n// codecFn encapsulates the captured variables and the encode function.\n// This way, we only do some calculations one times, and pass to the\n// code block that should be called (encapsulated in a function)\n// instead of executing the checks every time.\ntype codecFn struct {\n\ti codecFnInfo\n\tfe func(*Encoder, *codecFnInfo, reflect.Value)\n\tfd func(*Decoder, *codecFnInfo, reflect.Value)\n\t_ [1]uint64 // padding (cache-aligned)\n}\n\ntype codecRtidFn struct {\n\trtid uintptr\n\tfn *codecFn\n}\n\n// ----\n\n// these \"checkOverflow\" functions must be inlinable, and not call anybody.\n// Overflow means that the value cannot be represented without wrapping/overflow.\n// Overflow=false does not mean that the value can be represented without losing precision\n// (especially for floating point).\n\ntype checkOverflow struct{}\n\n// func (checkOverflow) Float16(f float64) (overflow bool) {\n// \tpanicv.errorf(\"unimplemented\")\n// \tif f < 0 {\n// \t\tf = -f\n// \t}\n// \treturn math.MaxFloat32 < f && f <= math.MaxFloat64\n// }\n\nfunc (checkOverflow) Float32(v float64) (overflow bool) {\n\tif v < 0 {\n\t\tv = -v\n\t}\n\treturn math.MaxFloat32 < v && v <= math.MaxFloat64\n}\nfunc (checkOverflow) Uint(v uint64, bitsize uint8) (overflow bool) {\n\tif bitsize == 0 || bitsize >= 64 || v == 0 {\n\t\treturn\n\t}\n\tif trunc := (v << (64 - bitsize)) >> (64 - bitsize); v != trunc {\n\t\toverflow = true\n\t}\n\treturn\n}\nfunc (checkOverflow) Int(v int64, bitsize uint8) (overflow bool) {\n\tif bitsize == 0 || bitsize >= 64 || v == 0 {\n\t\treturn\n\t}\n\tif trunc := (v << (64 - bitsize)) >> (64 - bitsize); v != trunc {\n\t\toverflow = true\n\t}\n\treturn\n}\nfunc (checkOverflow) SignedInt(v uint64) (overflow bool) {\n\t//e.g. -127 to 128 for int8\n\tpos := (v >> 63) == 0\n\tui2 := v & 0x7fffffffffffffff\n\tif pos {\n\t\tif ui2 > math.MaxInt64 {\n\t\t\toverflow = true\n\t\t}\n\t} else {\n\t\tif ui2 > math.MaxInt64-1 {\n\t\t\toverflow = true\n\t\t}\n\t}\n\treturn\n}\n\nfunc (x checkOverflow) Float32V(v float64) float64 {\n\tif x.Float32(v) {\n\t\tpanicv.errorf(\"float32 overflow: %v\", v)\n\t}\n\treturn v\n}\nfunc (x checkOverflow) UintV(v uint64, bitsize uint8) uint64 {\n\tif x.Uint(v, bitsize) {\n\t\tpanicv.errorf(\"uint64 overflow: %v\", v)\n\t}\n\treturn v\n}\nfunc (x checkOverflow) IntV(v int64, bitsize uint8) int64 {\n\tif x.Int(v, bitsize) {\n\t\tpanicv.errorf(\"int64 overflow: %v\", v)\n\t}\n\treturn v\n}\nfunc (x checkOverflow) SignedIntV(v uint64) int64 {\n\tif x.SignedInt(v) {\n\t\tpanicv.errorf(\"uint64 to int64 overflow: %v\", v)\n\t}\n\treturn int64(v)\n}\n\n// ------------------ FLOATING POINT -----------------\n\nfunc isNaN64(f float64) bool { return f != f }\nfunc isNaN32(f float32) bool { return f != f }\nfunc abs32(f float32) float32 {\n\treturn math.Float32frombits(math.Float32bits(f) &^ (1 << 31))\n}\n\n// Per go spec, floats are represented in memory as\n// IEEE single or double precision floating point values.\n//\n// We also looked at the source for stdlib math/modf.go,\n// reviewed https://github.com/chewxy/math32\n// and read wikipedia documents describing the formats.\n//\n// It became clear that we could easily look at the bits to determine\n// whether any fraction exists.\n//\n// This is all we need for now.\n\nfunc noFrac64(f float64) (v bool) {\n\tx := math.Float64bits(f)\n\te := uint64(x>>52)&0x7FF - 1023 // uint(x>>shift)&mask - bias\n\t// clear top 12+e bits, the integer part; if the rest is 0, then no fraction.\n\tif e < 52 {\n\t\t// return x&((1<<64-1)>>(12+e)) == 0\n\t\treturn x<<(12+e) == 0\n\t}\n\treturn\n}\nfunc noFrac32(f float32) (v bool) {\n\tx := math.Float32bits(f)\n\te := uint32(x>>23)&0xFF - 127 // uint(x>>shift)&mask - bias\n\t// clear top 9+e bits, the integer part; if the rest is 0, then no fraction.\n\tif e < 23 {\n\t\t// return x&((1<<32-1)>>(9+e)) == 0\n\t\treturn x<<(9+e) == 0\n\t}\n\treturn\n}\n\n// func noFrac(f float64) bool {\n// \t_, frac := math.Modf(float64(f))\n// \treturn frac == 0\n// }\n\n// -----------------------\n\ntype ioFlusher interface {\n\tFlush() error\n}\n\ntype ioPeeker interface {\n\tPeek(int) ([]byte, error)\n}\n\ntype ioBuffered interface {\n\tBuffered() int\n}\n\n// -----------------------\n\ntype sfiRv struct {\n\tv *structFieldInfo\n\tr reflect.Value\n}\n\n// -----------------\n\ntype set []uintptr\n\nfunc (s *set) add(v uintptr) (exists bool) {\n\t// e.ci is always nil, or len >= 1\n\tx := *s\n\t// defer func() { xdebugf(\"set.add: len: %d\", len(x)) }()\n\n\tif x == nil {\n\t\tx = make([]uintptr, 1, 8)\n\t\tx[0] = v\n\t\t*s = x\n\t\treturn\n\t}\n\t// typically, length will be 1. make this perform.\n\tif len(x) == 1 {\n\t\tif j := x[0]; j == 0 {\n\t\t\tx[0] = v\n\t\t} else if j == v {\n\t\t\texists = true\n\t\t} else {\n\t\t\tx = append(x, v)\n\t\t\t*s = x\n\t\t}\n\t\treturn\n\t}\n\t// check if it exists\n\tfor _, j := range x {\n\t\tif j == v {\n\t\t\texists = true\n\t\t\treturn\n\t\t}\n\t}\n\t// try to replace a \"deleted\" slot\n\tfor i, j := range x {\n\t\tif j == 0 {\n\t\t\tx[i] = v\n\t\t\treturn\n\t\t}\n\t}\n\t// if unable to replace deleted slot, just append it.\n\tx = append(x, v)\n\t*s = x\n\treturn\n}\n\nfunc (s *set) remove(v uintptr) (exists bool) {\n\tx := *s\n\tif len(x) == 0 {\n\t\treturn\n\t}\n\tif len(x) == 1 {\n\t\tif x[0] == v {\n\t\t\tx[0] = 0\n\t\t}\n\t\treturn\n\t}\n\tfor i, j := range x {\n\t\tif j == v {\n\t\t\texists = true\n\t\t\tx[i] = 0 // set it to 0, as way to delete it.\n\t\t\t// copy(x[i:], x[i+1:])\n\t\t\t// x = x[:len(x)-1]\n\t\t\treturn\n\t\t}\n\t}\n\treturn\n}\n\n// ------\n\n// bitset types are better than [256]bool, because they permit the whole\n// bitset array being on a single cache line and use less memory.\n//\n// Also, since pos is a byte (0-255), there's no bounds checks on indexing (cheap).\n//\n// We previously had bitset128 [16]byte, and bitset32 [4]byte, but those introduces\n// bounds checking, so we discarded them, and everyone uses bitset256.\n//\n// given x > 0 and n > 0 and x is exactly 2^n, then pos/x === pos>>n AND pos%x === pos&(x-1).\n// consequently, pos/32 === pos>>5, pos/16 === pos>>4, pos/8 === pos>>3, pos%8 == pos&7\n\ntype bitset256 [32]byte\n\nfunc (x *bitset256) isset(pos byte) bool {\n\treturn x[pos>>3]&(1<<(pos&7)) != 0\n}\n\n// func (x *bitset256) issetv(pos byte) byte {\n// \treturn x[pos>>3] & (1 << (pos & 7))\n// }\n\nfunc (x *bitset256) set(pos byte) {\n\tx[pos>>3] |= (1 << (pos & 7))\n}\n\n// func (x *bitset256) unset(pos byte) {\n// \tx[pos>>3] &^= (1 << (pos & 7))\n// }\n\n// type bit2set256 [64]byte\n\n// func (x *bit2set256) set(pos byte, v1, v2 bool) {\n// \tvar pos2 uint8 = (pos & 3) << 1 // returning 0, 2, 4 or 6\n// \tif v1 {\n// \t\tx[pos>>2] |= 1 << (pos2 + 1)\n// \t}\n// \tif v2 {\n// \t\tx[pos>>2] |= 1 << pos2\n// \t}\n// }\n// func (x *bit2set256) get(pos byte) uint8 {\n// \tvar pos2 uint8 = (pos & 3) << 1 // returning 0, 2, 4 or 6\n// \treturn x[pos>>2] << (6 - pos2) >> 6 // 11000000 -> 00000011\n// }\n\n// ------------\n\ntype pooler struct {\n\t// function-scoped pooled resources\n\ttiload sync.Pool // for type info loading\n\tsfiRv8, sfiRv16, sfiRv32, sfiRv64, sfiRv128 sync.Pool // for struct encoding\n\n\t// lifetime-scoped pooled resources\n\t// dn sync.Pool // for decNaked\n\tbuf1k, buf2k, buf4k, buf8k, buf16k, buf32k, buf64k sync.Pool // for [N]byte\n}\n\nfunc (p *pooler) init() {\n\tp.tiload.New = func() interface{} { return new(typeInfoLoadArray) }\n\n\tp.sfiRv8.New = func() interface{} { return new([8]sfiRv) }\n\tp.sfiRv16.New = func() interface{} { return new([16]sfiRv) }\n\tp.sfiRv32.New = func() interface{} { return new([32]sfiRv) }\n\tp.sfiRv64.New = func() interface{} { return new([64]sfiRv) }\n\tp.sfiRv128.New = func() interface{} { return new([128]sfiRv) }\n\n\t// p.dn.New = func() interface{} { x := new(decNaked); x.init(); return x }\n\n\tp.buf1k.New = func() interface{} { return new([1 * 1024]byte) }\n\tp.buf2k.New = func() interface{} { return new([2 * 1024]byte) }\n\tp.buf4k.New = func() interface{} { return new([4 * 1024]byte) }\n\tp.buf8k.New = func() interface{} { return new([8 * 1024]byte) }\n\tp.buf16k.New = func() interface{} { return new([16 * 1024]byte) }\n\tp.buf32k.New = func() interface{} { return new([32 * 1024]byte) }\n\tp.buf64k.New = func() interface{} { return new([64 * 1024]byte) }\n\n}\n\n// func (p *pooler) sfiRv8() (sp *sync.Pool, v interface{}) {\n// \treturn &p.strRv8, p.strRv8.Get()\n// }\n// func (p *pooler) sfiRv16() (sp *sync.Pool, v interface{}) {\n// \treturn &p.strRv16, p.strRv16.Get()\n// }\n// func (p *pooler) sfiRv32() (sp *sync.Pool, v interface{}) {\n// \treturn &p.strRv32, p.strRv32.Get()\n// }\n// func (p *pooler) sfiRv64() (sp *sync.Pool, v interface{}) {\n// \treturn &p.strRv64, p.strRv64.Get()\n// }\n// func (p *pooler) sfiRv128() (sp *sync.Pool, v interface{}) {\n// \treturn &p.strRv128, p.strRv128.Get()\n// }\n\n// func (p *pooler) bytes1k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf1k, p.buf1k.Get()\n// }\n// func (p *pooler) bytes2k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf2k, p.buf2k.Get()\n// }\n// func (p *pooler) bytes4k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf4k, p.buf4k.Get()\n// }\n// func (p *pooler) bytes8k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf8k, p.buf8k.Get()\n// }\n// func (p *pooler) bytes16k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf16k, p.buf16k.Get()\n// }\n// func (p *pooler) bytes32k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf32k, p.buf32k.Get()\n// }\n// func (p *pooler) bytes64k() (sp *sync.Pool, v interface{}) {\n// \treturn &p.buf64k, p.buf64k.Get()\n// }\n\n// func (p *pooler) tiLoad() (sp *sync.Pool, v interface{}) {\n// \treturn &p.tiload, p.tiload.Get()\n// }\n\n// func (p *pooler) decNaked() (sp *sync.Pool, v interface{}) {\n// \treturn &p.dn, p.dn.Get()\n// }\n\n// func (p *pooler) decNaked() (v *decNaked, f func(*decNaked) ) {\n// \tsp := &(p.dn)\n// \tvv := sp.Get()\n// \treturn vv.(*decNaked), func(x *decNaked) { sp.Put(vv) }\n// }\n// func (p *pooler) decNakedGet() (v interface{}) {\n// \treturn p.dn.Get()\n// }\n// func (p *pooler) tiLoadGet() (v interface{}) {\n// \treturn p.tiload.Get()\n// }\n// func (p *pooler) decNakedPut(v interface{}) {\n// \tp.dn.Put(v)\n// }\n// func (p *pooler) tiLoadPut(v interface{}) {\n// \tp.tiload.Put(v)\n// }\n\n// ----------------------------------------------------\n\ntype panicHdl struct{}\n\nfunc (panicHdl) errorv(err error) {\n\tif err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc (panicHdl) errorstr(message string) {\n\tif message != \"\" {\n\t\tpanic(message)\n\t}\n}\n\nfunc (panicHdl) errorf(format string, params ...interface{}) {\n\tif format == \"\" {\n\t} else if len(params) == 0 {\n\t\tpanic(format)\n\t} else {\n\t\tpanic(fmt.Sprintf(format, params...))\n\t}\n}\n\n// ----------------------------------------------------\n\ntype errDecorator interface {\n\twrapErr(in interface{}, out *error)\n}\n\ntype errDecoratorDef struct{}\n\nfunc (errDecoratorDef) wrapErr(v interface{}, e *error) { *e = fmt.Errorf(\"%v\", v) }\n\n// ----------------------------------------------------\n\ntype must struct{}\n\nfunc (must) String(s string, err error) string {\n\tif err != nil {\n\t\tpanicv.errorv(err)\n\t}\n\treturn s\n}\nfunc (must) Int(s int64, err error) int64 {\n\tif err != nil {\n\t\tpanicv.errorv(err)\n\t}\n\treturn s\n}\nfunc (must) Uint(s uint64, err error) uint64 {\n\tif err != nil {\n\t\tpanicv.errorv(err)\n\t}\n\treturn s\n}\nfunc (must) Float(s float64, err error) float64 {\n\tif err != nil {\n\t\tpanicv.errorv(err)\n\t}\n\treturn s\n}\n\n// -------------------\n\ntype bytesBufPooler struct {\n\tpool *sync.Pool\n\tpoolbuf interface{}\n}\n\nfunc (z *bytesBufPooler) end() {\n\tif z.pool != nil {\n\t\tz.pool.Put(z.poolbuf)\n\t\tz.pool, z.poolbuf = nil, nil\n\t}\n}\n\nfunc (z *bytesBufPooler) get(bufsize int) (buf []byte) {\n\t// ensure an end is called first (if necessary)\n\tif z.pool != nil {\n\t\tz.pool.Put(z.poolbuf)\n\t\tz.pool, z.poolbuf = nil, nil\n\t}\n\n\t// // Try to use binary search.\n\t// // This is not optimal, as most folks select 1k or 2k buffers\n\t// // so a linear search is better (sequence of if/else blocks)\n\t// if bufsize < 1 {\n\t// \tbufsize = 0\n\t// } else {\n\t// \tbufsize--\n\t// \tbufsize /= 1024\n\t// }\n\t// switch bufsize {\n\t// case 0:\n\t// \tz.pool, z.poolbuf = pool.bytes1k()\n\t// \tbuf = z.poolbuf.(*[1 * 1024]byte)[:]\n\t// case 1:\n\t// \tz.pool, z.poolbuf = pool.bytes2k()\n\t// \tbuf = z.poolbuf.(*[2 * 1024]byte)[:]\n\t// case 2, 3:\n\t// \tz.pool, z.poolbuf = pool.bytes4k()\n\t// \tbuf = z.poolbuf.(*[4 * 1024]byte)[:]\n\t// case 4, 5, 6, 7:\n\t// \tz.pool, z.poolbuf = pool.bytes8k()\n\t// \tbuf = z.poolbuf.(*[8 * 1024]byte)[:]\n\t// case 8, 9, 10, 11, 12, 13, 14, 15:\n\t// \tz.pool, z.poolbuf = pool.bytes16k()\n\t// \tbuf = z.poolbuf.(*[16 * 1024]byte)[:]\n\t// case 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31:\n\t// \tz.pool, z.poolbuf = pool.bytes32k()\n\t// \tbuf = z.poolbuf.(*[32 * 1024]byte)[:]\n\t// default:\n\t// \tz.pool, z.poolbuf = pool.bytes64k()\n\t// \tbuf = z.poolbuf.(*[64 * 1024]byte)[:]\n\t// }\n\t// return\n\n\tif bufsize <= 1*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf1k, pool.buf1k.Get() // pool.bytes1k()\n\t\tbuf = z.poolbuf.(*[1 * 1024]byte)[:]\n\t} else if bufsize <= 2*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf2k, pool.buf2k.Get() // pool.bytes2k()\n\t\tbuf = z.poolbuf.(*[2 * 1024]byte)[:]\n\t} else if bufsize <= 4*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf4k, pool.buf4k.Get() // pool.bytes4k()\n\t\tbuf = z.poolbuf.(*[4 * 1024]byte)[:]\n\t} else if bufsize <= 8*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf8k, pool.buf8k.Get() // pool.bytes8k()\n\t\tbuf = z.poolbuf.(*[8 * 1024]byte)[:]\n\t} else if bufsize <= 16*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf16k, pool.buf16k.Get() // pool.bytes16k()\n\t\tbuf = z.poolbuf.(*[16 * 1024]byte)[:]\n\t} else if bufsize <= 32*1024 {\n\t\tz.pool, z.poolbuf = &pool.buf32k, pool.buf32k.Get() // pool.bytes32k()\n\t\tbuf = z.poolbuf.(*[32 * 1024]byte)[:]\n\t} else {\n\t\tz.pool, z.poolbuf = &pool.buf64k, pool.buf64k.Get() // pool.bytes64k()\n\t\tbuf = z.poolbuf.(*[64 * 1024]byte)[:]\n\t}\n\treturn\n}\n\n// ----------------\n\ntype sfiRvPooler struct {\n\tpool *sync.Pool\n\tpoolv interface{}\n}\n\nfunc (z *sfiRvPooler) end() {\n\tif z.pool != nil {\n\t\tz.pool.Put(z.poolv)\n\t\tz.pool, z.poolv = nil, nil\n\t}\n}\n\nfunc (z *sfiRvPooler) get(newlen int) (fkvs []sfiRv) {\n\tif newlen < 0 { // bounds-check-elimination\n\t\t// cannot happen // here for bounds-check-elimination\n\t} else if newlen <= 8 {\n\t\tz.pool, z.poolv = &pool.sfiRv8, pool.sfiRv8.Get() // pool.sfiRv8()\n\t\tfkvs = z.poolv.(*[8]sfiRv)[:newlen]\n\t} else if newlen <= 16 {\n\t\tz.pool, z.poolv = &pool.sfiRv16, pool.sfiRv16.Get() // pool.sfiRv16()\n\t\tfkvs = z.poolv.(*[16]sfiRv)[:newlen]\n\t} else if newlen <= 32 {\n\t\tz.pool, z.poolv = &pool.sfiRv32, pool.sfiRv32.Get() // pool.sfiRv32()\n\t\tfkvs = z.poolv.(*[32]sfiRv)[:newlen]\n\t} else if newlen <= 64 {\n\t\tz.pool, z.poolv = &pool.sfiRv64, pool.sfiRv64.Get() // pool.sfiRv64()\n\t\tfkvs = z.poolv.(*[64]sfiRv)[:newlen]\n\t} else if newlen <= 128 {\n\t\tz.pool, z.poolv = &pool.sfiRv128, pool.sfiRv128.Get() // pool.sfiRv128()\n\t\tfkvs = z.poolv.(*[128]sfiRv)[:newlen]\n\t} else {\n\t\tfkvs = make([]sfiRv, newlen)\n\t}\n\treturn\n}\n\n// xdebugf printf. the message in red on the terminal.\n// Use it in place of fmt.Printf (which it calls internally)\nfunc xdebugf(pattern string, args ...interface{}) {\n\tvar delim string\n\tif len(pattern) > 0 && pattern[len(pattern)-1] != '\\n' {\n\t\tdelim = \"\\n\"\n\t}\n\tfmt.Printf(\"\\033[1;31m\"+pattern+delim+\"\\033[0m\", args...)\n}\n\n// xdebug2f printf. the message in blue on the terminal.\n// Use it in place of fmt.Printf (which it calls internally)\nfunc xdebug2f(pattern string, args ...interface{}) {\n\tvar delim string\n\tif len(pattern) > 0 && pattern[len(pattern)-1] != '\\n' {\n\t\tdelim = \"\\n\"\n\t}\n\tfmt.Printf(\"\\033[1;34m\"+pattern+delim+\"\\033[0m\", args...)\n}\n\n// func isImmutableKind(k reflect.Kind) (v bool) {\n// \treturn false ||\n// \t\tk == reflect.Int ||\n// \t\tk == reflect.Int8 ||\n// \t\tk == reflect.Int16 ||\n// \t\tk == reflect.Int32 ||\n// \t\tk == reflect.Int64 ||\n// \t\tk == reflect.Uint ||\n// \t\tk == reflect.Uint8 ||\n// \t\tk == reflect.Uint16 ||\n// \t\tk == reflect.Uint32 ||\n// \t\tk == reflect.Uint64 ||\n// \t\tk == reflect.Uintptr ||\n// \t\tk == reflect.Float32 ||\n// \t\tk == reflect.Float64 ||\n// \t\tk == reflect.Bool ||\n// \t\tk == reflect.String\n// }\n\n// func timeLocUTCName(tzint int16) string {\n// \tif tzint == 0 {\n// \t\treturn \"UTC\"\n// \t}\n// \tvar tzname = []byte(\"UTC+00:00\")\n// \t//tzname := fmt.Sprintf(\"UTC%s%02d:%02d\", tzsign, tz/60, tz%60) //perf issue using Sprintf.. inline below.\n// \t//tzhr, tzmin := tz/60, tz%60 //faster if u convert to int first\n// \tvar tzhr, tzmin int16\n// \tif tzint < 0 {\n// \t\ttzname[3] = '-' // (TODO: verify. this works here)\n// \t\ttzhr, tzmin = -tzint/60, (-tzint)%60\n// \t} else {\n// \t\ttzhr, tzmin = tzint/60, tzint%60\n// \t}\n// \ttzname[4] = timeDigits[tzhr/10]\n// \ttzname[5] = timeDigits[tzhr%10]\n// \ttzname[7] = timeDigits[tzmin/10]\n// \ttzname[8] = timeDigits[tzmin%10]\n// \treturn string(tzname)\n// \t//return time.FixedZone(string(tzname), int(tzint)*60)\n// }\n" }, { "path": "vendor/github.com/ugorji/go/codec/helper_internal.go", "content": "// Copyright (c) 2012-2015 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\n// All non-std package dependencies live in this file,\n// so porting to different environment is easy (just update functions).\n\nfunc pruneSignExt(v []byte, pos bool) (n int) {\n\tif len(v) < 2 {\n\t} else if pos && v[0] == 0 {\n\t\tfor ; v[n] == 0 && n+1 < len(v) && (v[n+1]&(1<<7) == 0); n++ {\n\t\t}\n\t} else if !pos && v[0] == 0xff {\n\t\tfor ; v[n] == 0xff && n+1 < len(v) && (v[n+1]&(1<<7) != 0); n++ {\n\t\t}\n\t}\n\treturn\n}\n\n// validate that this function is correct ...\n// culled from OGRE (Object-Oriented Graphics Rendering Engine)\n// function: halfToFloatI (http://stderr.org/doc/ogre-doc/api/OgreBitwise_8h-source.html)\nfunc halfFloatToFloatBits(yy uint16) (d uint32) {\n\ty := uint32(yy)\n\ts := (y >> 15) & 0x01\n\te := (y >> 10) & 0x1f\n\tm := y & 0x03ff\n\n\tif e == 0 {\n\t\tif m == 0 { // plu or minus 0\n\t\t\treturn s << 31\n\t\t}\n\t\t// Denormalized number -- renormalize it\n\t\tfor (m & 0x00000400) == 0 {\n\t\t\tm <<= 1\n\t\t\te -= 1\n\t\t}\n\t\te += 1\n\t\tconst zz uint32 = 0x0400\n\t\tm &= ^zz\n\t} else if e == 31 {\n\t\tif m == 0 { // Inf\n\t\t\treturn (s << 31) | 0x7f800000\n\t\t}\n\t\treturn (s << 31) | 0x7f800000 | (m << 13) // NaN\n\t}\n\te = e + (127 - 15)\n\tm = m << 13\n\treturn (s << 31) | (e << 23) | m\n}\n\n// GrowCap will return a new capacity for a slice, given the following:\n// - oldCap: current capacity\n// - unit: in-memory size of an element\n// - num: number of elements to add\nfunc growCap(oldCap, unit, num int) (newCap int) {\n\t// appendslice logic (if cap < 1024, *2, else *1.25):\n\t// leads to many copy calls, especially when copying bytes.\n\t// bytes.Buffer model (2*cap + n): much better for bytes.\n\t// smarter way is to take the byte-size of the appended element(type) into account\n\n\t// maintain 3 thresholds:\n\t// t1: if cap <= t1, newcap = 2x\n\t// t2: if cap <= t2, newcap = 1.75x\n\t// t3: if cap <= t3, newcap = 1.5x\n\t// else newcap = 1.25x\n\t//\n\t// t1, t2, t3 >= 1024 always.\n\t// i.e. if unit size >= 16, then always do 2x or 1.25x (ie t1, t2, t3 are all same)\n\t//\n\t// With this, appending for bytes increase by:\n\t// 100% up to 4K\n\t// 75% up to 8K\n\t// 50% up to 16K\n\t// 25% beyond that\n\n\t// unit can be 0 e.g. for struct{}{}; handle that appropriately\n\tvar t1, t2, t3 int // thresholds\n\tif unit <= 1 {\n\t\tt1, t2, t3 = 4*1024, 8*1024, 16*1024\n\t} else if unit < 16 {\n\t\tt3 = 16 / unit * 1024\n\t\tt1 = t3 * 1 / 4\n\t\tt2 = t3 * 2 / 4\n\t} else {\n\t\tt1, t2, t3 = 1024, 1024, 1024\n\t}\n\n\tvar x int // temporary variable\n\n\t// x is multiplier here: one of 5, 6, 7 or 8; incr of 25%, 50%, 75% or 100% respectively\n\tif oldCap <= t1 { // [0,t1]\n\t\tx = 8\n\t} else if oldCap > t3 { // (t3,infinity]\n\t\tx = 5\n\t} else if oldCap <= t2 { // (t1,t2]\n\t\tx = 7\n\t} else { // (t2,t3]\n\t\tx = 6\n\t}\n\tnewCap = x * oldCap / 4\n\n\tif num > 0 {\n\t\tnewCap += num\n\t}\n\n\t// ensure newCap is a multiple of 64 (if it is > 64) or 16.\n\tif newCap > 64 {\n\t\tif x = newCap % 64; x != 0 {\n\t\t\tx = newCap / 64\n\t\t\tnewCap = 64 * (x + 1)\n\t\t}\n\t} else {\n\t\tif x = newCap % 16; x != 0 {\n\t\t\tx = newCap / 16\n\t\t\tnewCap = 16 * (x + 1)\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/helper_not_unsafe.go", "content": "// +build !go1.7 safe appengine\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"reflect\"\n\t\"sync/atomic\"\n\t\"time\"\n)\n\nconst safeMode = true\n\n// stringView returns a view of the []byte as a string.\n// In unsafe mode, it doesn't incur allocation and copying caused by conversion.\n// In regular safe mode, it is an allocation and copy.\n//\n// Usage: Always maintain a reference to v while result of this call is in use,\n// and call keepAlive4BytesView(v) at point where done with view.\nfunc stringView(v []byte) string {\n\treturn string(v)\n}\n\n// bytesView returns a view of the string as a []byte.\n// In unsafe mode, it doesn't incur allocation and copying caused by conversion.\n// In regular safe mode, it is an allocation and copy.\n//\n// Usage: Always maintain a reference to v while result of this call is in use,\n// and call keepAlive4BytesView(v) at point where done with view.\nfunc bytesView(v string) []byte {\n\treturn []byte(v)\n}\n\nfunc definitelyNil(v interface{}) bool {\n\t// this is a best-effort option.\n\t// We just return false, so we don't unnecessarily incur the cost of reflection this early.\n\treturn false\n}\n\nfunc rv2i(rv reflect.Value) interface{} {\n\treturn rv.Interface()\n}\n\nfunc rt2id(rt reflect.Type) uintptr {\n\treturn reflect.ValueOf(rt).Pointer()\n}\n\n// func rv2rtid(rv reflect.Value) uintptr {\n// \treturn reflect.ValueOf(rv.Type()).Pointer()\n// }\n\nfunc i2rtid(i interface{}) uintptr {\n\treturn reflect.ValueOf(reflect.TypeOf(i)).Pointer()\n}\n\n// --------------------------\n\nfunc isEmptyValue(v reflect.Value, tinfos *TypeInfos, deref, checkStruct bool) bool {\n\tswitch v.Kind() {\n\tcase reflect.Invalid:\n\t\treturn true\n\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\treturn v.Len() == 0\n\tcase reflect.Bool:\n\t\treturn !v.Bool()\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn v.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\tif deref {\n\t\t\tif v.IsNil() {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn isEmptyValue(v.Elem(), tinfos, deref, checkStruct)\n\t\t}\n\t\treturn v.IsNil()\n\tcase reflect.Struct:\n\t\treturn isEmptyStruct(v, tinfos, deref, checkStruct)\n\t}\n\treturn false\n}\n\n// --------------------------\n// type ptrToRvMap struct{}\n\n// func (*ptrToRvMap) init() {}\n// func (*ptrToRvMap) get(i interface{}) reflect.Value {\n// \treturn reflect.ValueOf(i).Elem()\n// }\n\n// --------------------------\ntype atomicClsErr struct {\n\tv atomic.Value\n}\n\nfunc (x *atomicClsErr) load() (e clsErr) {\n\tif i := x.v.Load(); i != nil {\n\t\te = i.(clsErr)\n\t}\n\treturn\n}\n\nfunc (x *atomicClsErr) store(p clsErr) {\n\tx.v.Store(p)\n}\n\n// --------------------------\ntype atomicTypeInfoSlice struct { // expected to be 2 words\n\tv atomic.Value\n}\n\nfunc (x *atomicTypeInfoSlice) load() (e []rtid2ti) {\n\tif i := x.v.Load(); i != nil {\n\t\te = i.([]rtid2ti)\n\t}\n\treturn\n}\n\nfunc (x *atomicTypeInfoSlice) store(p []rtid2ti) {\n\tx.v.Store(p)\n}\n\n// --------------------------\ntype atomicRtidFnSlice struct { // expected to be 2 words\n\tv atomic.Value\n}\n\nfunc (x *atomicRtidFnSlice) load() (e []codecRtidFn) {\n\tif i := x.v.Load(); i != nil {\n\t\te = i.([]codecRtidFn)\n\t}\n\treturn\n}\n\nfunc (x *atomicRtidFnSlice) store(p []codecRtidFn) {\n\tx.v.Store(p)\n}\n\n// --------------------------\nfunc (n *decNaked) ru() reflect.Value {\n\treturn reflect.ValueOf(&n.u).Elem()\n}\nfunc (n *decNaked) ri() reflect.Value {\n\treturn reflect.ValueOf(&n.i).Elem()\n}\nfunc (n *decNaked) rf() reflect.Value {\n\treturn reflect.ValueOf(&n.f).Elem()\n}\nfunc (n *decNaked) rl() reflect.Value {\n\treturn reflect.ValueOf(&n.l).Elem()\n}\nfunc (n *decNaked) rs() reflect.Value {\n\treturn reflect.ValueOf(&n.s).Elem()\n}\nfunc (n *decNaked) rt() reflect.Value {\n\treturn reflect.ValueOf(&n.t).Elem()\n}\nfunc (n *decNaked) rb() reflect.Value {\n\treturn reflect.ValueOf(&n.b).Elem()\n}\n\n// --------------------------\nfunc (d *Decoder) raw(f *codecFnInfo, rv reflect.Value) {\n\trv.SetBytes(d.rawBytes())\n}\n\nfunc (d *Decoder) kString(f *codecFnInfo, rv reflect.Value) {\n\trv.SetString(d.d.DecodeString())\n}\n\nfunc (d *Decoder) kBool(f *codecFnInfo, rv reflect.Value) {\n\trv.SetBool(d.d.DecodeBool())\n}\n\nfunc (d *Decoder) kTime(f *codecFnInfo, rv reflect.Value) {\n\trv.Set(reflect.ValueOf(d.d.DecodeTime()))\n}\n\nfunc (d *Decoder) kFloat32(f *codecFnInfo, rv reflect.Value) {\n\trv.SetFloat(d.decodeFloat32())\n}\n\nfunc (d *Decoder) kFloat64(f *codecFnInfo, rv reflect.Value) {\n\trv.SetFloat(d.d.DecodeFloat64())\n}\n\nfunc (d *Decoder) kInt(f *codecFnInfo, rv reflect.Value) {\n\trv.SetInt(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n}\n\nfunc (d *Decoder) kInt8(f *codecFnInfo, rv reflect.Value) {\n\trv.SetInt(chkOvf.IntV(d.d.DecodeInt64(), 8))\n}\n\nfunc (d *Decoder) kInt16(f *codecFnInfo, rv reflect.Value) {\n\trv.SetInt(chkOvf.IntV(d.d.DecodeInt64(), 16))\n}\n\nfunc (d *Decoder) kInt32(f *codecFnInfo, rv reflect.Value) {\n\trv.SetInt(chkOvf.IntV(d.d.DecodeInt64(), 32))\n}\n\nfunc (d *Decoder) kInt64(f *codecFnInfo, rv reflect.Value) {\n\trv.SetInt(d.d.DecodeInt64())\n}\n\nfunc (d *Decoder) kUint(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n}\n\nfunc (d *Decoder) kUintptr(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n}\n\nfunc (d *Decoder) kUint8(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(chkOvf.UintV(d.d.DecodeUint64(), 8))\n}\n\nfunc (d *Decoder) kUint16(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(chkOvf.UintV(d.d.DecodeUint64(), 16))\n}\n\nfunc (d *Decoder) kUint32(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(chkOvf.UintV(d.d.DecodeUint64(), 32))\n}\n\nfunc (d *Decoder) kUint64(f *codecFnInfo, rv reflect.Value) {\n\trv.SetUint(d.d.DecodeUint64())\n}\n\n// ----------------\n\nfunc (e *Encoder) kBool(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeBool(rv.Bool())\n}\n\nfunc (e *Encoder) kTime(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeTime(rv2i(rv).(time.Time))\n}\n\nfunc (e *Encoder) kString(f *codecFnInfo, rv reflect.Value) {\n\ts := rv.String()\n\tif e.h.StringToRaw {\n\t\te.e.EncodeStringBytesRaw(bytesView(s))\n\t} else {\n\t\te.e.EncodeStringEnc(cUTF8, s)\n\t}\n}\n\nfunc (e *Encoder) kFloat64(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeFloat64(rv.Float())\n}\n\nfunc (e *Encoder) kFloat32(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeFloat32(float32(rv.Float()))\n}\n\nfunc (e *Encoder) kInt(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeInt(rv.Int())\n}\n\nfunc (e *Encoder) kInt8(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeInt(rv.Int())\n}\n\nfunc (e *Encoder) kInt16(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeInt(rv.Int())\n}\n\nfunc (e *Encoder) kInt32(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeInt(rv.Int())\n}\n\nfunc (e *Encoder) kInt64(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeInt(rv.Int())\n}\n\nfunc (e *Encoder) kUint(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\nfunc (e *Encoder) kUint8(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\nfunc (e *Encoder) kUint16(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\nfunc (e *Encoder) kUint32(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\nfunc (e *Encoder) kUint64(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\nfunc (e *Encoder) kUintptr(f *codecFnInfo, rv reflect.Value) {\n\te.e.EncodeUint(rv.Uint())\n}\n\n// // keepAlive4BytesView maintains a reference to the input parameter for bytesView.\n// //\n// // Usage: call this at point where done with the bytes view.\n// func keepAlive4BytesView(v string) {}\n\n// // keepAlive4BytesView maintains a reference to the input parameter for stringView.\n// //\n// // Usage: call this at point where done with the string view.\n// func keepAlive4StringView(v []byte) {}\n\n// func definitelyNil(v interface{}) bool {\n// \trv := reflect.ValueOf(v)\n// \tswitch rv.Kind() {\n// \tcase reflect.Invalid:\n// \t\treturn true\n// \tcase reflect.Ptr, reflect.Interface, reflect.Chan, reflect.Slice, reflect.Map, reflect.Func:\n// \t\treturn rv.IsNil()\n// \tdefault:\n// \t\treturn false\n// \t}\n// }\n" }, { "path": "vendor/github.com/ugorji/go/codec/helper_unsafe.go", "content": "// +build !safe\n// +build !appengine\n// +build go1.7\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"reflect\"\n\t\"sync/atomic\"\n\t\"time\"\n\t\"unsafe\"\n)\n\n// This file has unsafe variants of some helper methods.\n// NOTE: See helper_not_unsafe.go for the usage information.\n\n// var zeroRTv [4]uintptr\n\nconst safeMode = false\nconst unsafeFlagIndir = 1 << 7 // keep in sync with GO_ROOT/src/reflect/value.go\n\ntype unsafeString struct {\n\tData unsafe.Pointer\n\tLen int\n}\n\ntype unsafeSlice struct {\n\tData unsafe.Pointer\n\tLen int\n\tCap int\n}\n\ntype unsafeIntf struct {\n\ttyp unsafe.Pointer\n\tword unsafe.Pointer\n}\n\ntype unsafeReflectValue struct {\n\ttyp unsafe.Pointer\n\tptr unsafe.Pointer\n\tflag uintptr\n}\n\nfunc stringView(v []byte) string {\n\tif len(v) == 0 {\n\t\treturn \"\"\n\t}\n\tbx := (*unsafeSlice)(unsafe.Pointer(&v))\n\treturn *(*string)(unsafe.Pointer(&unsafeString{bx.Data, bx.Len}))\n}\n\nfunc bytesView(v string) []byte {\n\tif len(v) == 0 {\n\t\treturn zeroByteSlice\n\t}\n\tsx := (*unsafeString)(unsafe.Pointer(&v))\n\treturn *(*[]byte)(unsafe.Pointer(&unsafeSlice{sx.Data, sx.Len, sx.Len}))\n}\n\nfunc definitelyNil(v interface{}) bool {\n\t// There is no global way of checking if an interface is nil.\n\t// For true references (map, ptr, func, chan), you can just look\n\t// at the word of the interface. However, for slices, you have to dereference\n\t// the word, and get a pointer to the 3-word interface value.\n\t//\n\t// However, the following are cheap calls\n\t// - TypeOf(interface): cheap 2-line call.\n\t// - ValueOf(interface{}): expensive\n\t// - type.Kind: cheap call through an interface\n\t// - Value.Type(): cheap call\n\t// except it's a method value (e.g. r.Read, which implies that it is a Func)\n\n\treturn ((*unsafeIntf)(unsafe.Pointer(&v))).word == nil\n}\n\nfunc rv2i(rv reflect.Value) interface{} {\n\t// TODO: consider a more generally-known optimization for reflect.Value ==> Interface\n\t//\n\t// Currently, we use this fragile method that taps into implememtation details from\n\t// the source go stdlib reflect/value.go, and trims the implementation.\n\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t// true references (map, func, chan, ptr - NOT slice) may be double-referenced as flagIndir\n\tvar ptr unsafe.Pointer\n\tif refBitset.isset(byte(urv.flag&(1<<5-1))) && urv.flag&unsafeFlagIndir != 0 {\n\t\tptr = *(*unsafe.Pointer)(urv.ptr)\n\t} else {\n\t\tptr = urv.ptr\n\t}\n\treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{typ: urv.typ, word: ptr}))\n}\n\nfunc rt2id(rt reflect.Type) uintptr {\n\treturn uintptr(((*unsafeIntf)(unsafe.Pointer(&rt))).word)\n}\n\n// func rv2rtid(rv reflect.Value) uintptr {\n// \treturn uintptr((*unsafeReflectValue)(unsafe.Pointer(&rv)).typ)\n// }\n\nfunc i2rtid(i interface{}) uintptr {\n\treturn uintptr(((*unsafeIntf)(unsafe.Pointer(&i))).typ)\n}\n\n// --------------------------\n\nfunc isEmptyValue(v reflect.Value, tinfos *TypeInfos, deref, checkStruct bool) bool {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&v))\n\tif urv.flag == 0 {\n\t\treturn true\n\t}\n\tswitch v.Kind() {\n\tcase reflect.Invalid:\n\t\treturn true\n\tcase reflect.String:\n\t\treturn (*unsafeString)(urv.ptr).Len == 0\n\tcase reflect.Slice:\n\t\treturn (*unsafeSlice)(urv.ptr).Len == 0\n\tcase reflect.Bool:\n\t\treturn !*(*bool)(urv.ptr)\n\tcase reflect.Int:\n\t\treturn *(*int)(urv.ptr) == 0\n\tcase reflect.Int8:\n\t\treturn *(*int8)(urv.ptr) == 0\n\tcase reflect.Int16:\n\t\treturn *(*int16)(urv.ptr) == 0\n\tcase reflect.Int32:\n\t\treturn *(*int32)(urv.ptr) == 0\n\tcase reflect.Int64:\n\t\treturn *(*int64)(urv.ptr) == 0\n\tcase reflect.Uint:\n\t\treturn *(*uint)(urv.ptr) == 0\n\tcase reflect.Uint8:\n\t\treturn *(*uint8)(urv.ptr) == 0\n\tcase reflect.Uint16:\n\t\treturn *(*uint16)(urv.ptr) == 0\n\tcase reflect.Uint32:\n\t\treturn *(*uint32)(urv.ptr) == 0\n\tcase reflect.Uint64:\n\t\treturn *(*uint64)(urv.ptr) == 0\n\tcase reflect.Uintptr:\n\t\treturn *(*uintptr)(urv.ptr) == 0\n\tcase reflect.Float32:\n\t\treturn *(*float32)(urv.ptr) == 0\n\tcase reflect.Float64:\n\t\treturn *(*float64)(urv.ptr) == 0\n\tcase reflect.Interface:\n\t\tisnil := urv.ptr == nil || *(*unsafe.Pointer)(urv.ptr) == nil\n\t\tif deref {\n\t\t\tif isnil {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn isEmptyValue(v.Elem(), tinfos, deref, checkStruct)\n\t\t}\n\t\treturn isnil\n\tcase reflect.Ptr:\n\t\t// isnil := urv.ptr == nil (not sufficient, as a pointer value encodes the type)\n\t\tisnil := urv.ptr == nil || *(*unsafe.Pointer)(urv.ptr) == nil\n\t\tif deref {\n\t\t\tif isnil {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn isEmptyValue(v.Elem(), tinfos, deref, checkStruct)\n\t\t}\n\t\treturn isnil\n\tcase reflect.Struct:\n\t\treturn isEmptyStruct(v, tinfos, deref, checkStruct)\n\tcase reflect.Map, reflect.Array, reflect.Chan:\n\t\treturn v.Len() == 0\n\t}\n\treturn false\n}\n\n// --------------------------\n\n// atomicXXX is expected to be 2 words (for symmetry with atomic.Value)\n//\n// Note that we do not atomically load/store length and data pointer separately,\n// as this could lead to some races. Instead, we atomically load/store cappedSlice.\n//\n// Note: with atomic.(Load|Store)Pointer, we MUST work with an unsafe.Pointer directly.\n\n// ----------------------\ntype atomicTypeInfoSlice struct {\n\tv unsafe.Pointer // *[]rtid2ti\n\t_ uint64 // padding (atomicXXX expected to be 2 words)\n}\n\nfunc (x *atomicTypeInfoSlice) load() (s []rtid2ti) {\n\tx2 := atomic.LoadPointer(&x.v)\n\tif x2 != nil {\n\t\ts = *(*[]rtid2ti)(x2)\n\t}\n\treturn\n}\n\nfunc (x *atomicTypeInfoSlice) store(p []rtid2ti) {\n\tatomic.StorePointer(&x.v, unsafe.Pointer(&p))\n}\n\n// --------------------------\ntype atomicRtidFnSlice struct {\n\tv unsafe.Pointer // *[]codecRtidFn\n\t// _ uint64 // padding (atomicXXX expected to be 2 words) (make 1 word so JsonHandle fits)\n}\n\nfunc (x *atomicRtidFnSlice) load() (s []codecRtidFn) {\n\tx2 := atomic.LoadPointer(&x.v)\n\tif x2 != nil {\n\t\ts = *(*[]codecRtidFn)(x2)\n\t}\n\treturn\n}\n\nfunc (x *atomicRtidFnSlice) store(p []codecRtidFn) {\n\tatomic.StorePointer(&x.v, unsafe.Pointer(&p))\n}\n\n// --------------------------\ntype atomicClsErr struct {\n\tv unsafe.Pointer // *clsErr\n\t_ uint64 // padding (atomicXXX expected to be 2 words)\n}\n\nfunc (x *atomicClsErr) load() (e clsErr) {\n\tx2 := (*clsErr)(atomic.LoadPointer(&x.v))\n\tif x2 != nil {\n\t\te = *x2\n\t}\n\treturn\n}\n\nfunc (x *atomicClsErr) store(p clsErr) {\n\tatomic.StorePointer(&x.v, unsafe.Pointer(&p))\n}\n\n// --------------------------\n\n// to create a reflect.Value for each member field of decNaked,\n// we first create a global decNaked, and create reflect.Value\n// for them all.\n// This way, we have the flags and type in the reflect.Value.\n// Then, when a reflect.Value is called, we just copy it,\n// update the ptr to the decNaked's, and return it.\n\ntype unsafeDecNakedWrapper struct {\n\tdecNaked\n\tru, ri, rf, rl, rs, rb, rt reflect.Value // mapping to the primitives above\n}\n\nfunc (n *unsafeDecNakedWrapper) init() {\n\tn.ru = reflect.ValueOf(&n.u).Elem()\n\tn.ri = reflect.ValueOf(&n.i).Elem()\n\tn.rf = reflect.ValueOf(&n.f).Elem()\n\tn.rl = reflect.ValueOf(&n.l).Elem()\n\tn.rs = reflect.ValueOf(&n.s).Elem()\n\tn.rt = reflect.ValueOf(&n.t).Elem()\n\tn.rb = reflect.ValueOf(&n.b).Elem()\n\t// n.rr[] = reflect.ValueOf(&n.)\n}\n\nvar defUnsafeDecNakedWrapper unsafeDecNakedWrapper\n\nfunc init() {\n\tdefUnsafeDecNakedWrapper.init()\n}\n\nfunc (n *decNaked) ru() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.ru\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.u)\n\treturn\n}\nfunc (n *decNaked) ri() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.ri\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.i)\n\treturn\n}\nfunc (n *decNaked) rf() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.rf\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.f)\n\treturn\n}\nfunc (n *decNaked) rl() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.rl\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.l)\n\treturn\n}\nfunc (n *decNaked) rs() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.rs\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.s)\n\treturn\n}\nfunc (n *decNaked) rt() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.rt\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.t)\n\treturn\n}\nfunc (n *decNaked) rb() (v reflect.Value) {\n\tv = defUnsafeDecNakedWrapper.rb\n\t((*unsafeReflectValue)(unsafe.Pointer(&v))).ptr = unsafe.Pointer(&n.b)\n\treturn\n}\n\n// --------------------------\nfunc (d *Decoder) raw(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*[]byte)(urv.ptr) = d.rawBytes()\n}\n\nfunc (d *Decoder) kString(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*string)(urv.ptr) = d.d.DecodeString()\n}\n\nfunc (d *Decoder) kBool(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*bool)(urv.ptr) = d.d.DecodeBool()\n}\n\nfunc (d *Decoder) kTime(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*time.Time)(urv.ptr) = d.d.DecodeTime()\n}\n\nfunc (d *Decoder) kFloat32(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*float32)(urv.ptr) = float32(d.decodeFloat32())\n}\n\nfunc (d *Decoder) kFloat64(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*float64)(urv.ptr) = d.d.DecodeFloat64()\n}\n\nfunc (d *Decoder) kInt(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*int)(urv.ptr) = int(chkOvf.IntV(d.d.DecodeInt64(), intBitsize))\n}\n\nfunc (d *Decoder) kInt8(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*int8)(urv.ptr) = int8(chkOvf.IntV(d.d.DecodeInt64(), 8))\n}\n\nfunc (d *Decoder) kInt16(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*int16)(urv.ptr) = int16(chkOvf.IntV(d.d.DecodeInt64(), 16))\n}\n\nfunc (d *Decoder) kInt32(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*int32)(urv.ptr) = int32(chkOvf.IntV(d.d.DecodeInt64(), 32))\n}\n\nfunc (d *Decoder) kInt64(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*int64)(urv.ptr) = d.d.DecodeInt64()\n}\n\nfunc (d *Decoder) kUint(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uint)(urv.ptr) = uint(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n}\n\nfunc (d *Decoder) kUintptr(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uintptr)(urv.ptr) = uintptr(chkOvf.UintV(d.d.DecodeUint64(), uintBitsize))\n}\n\nfunc (d *Decoder) kUint8(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uint8)(urv.ptr) = uint8(chkOvf.UintV(d.d.DecodeUint64(), 8))\n}\n\nfunc (d *Decoder) kUint16(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uint16)(urv.ptr) = uint16(chkOvf.UintV(d.d.DecodeUint64(), 16))\n}\n\nfunc (d *Decoder) kUint32(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uint32)(urv.ptr) = uint32(chkOvf.UintV(d.d.DecodeUint64(), 32))\n}\n\nfunc (d *Decoder) kUint64(f *codecFnInfo, rv reflect.Value) {\n\turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\t*(*uint64)(urv.ptr) = d.d.DecodeUint64()\n}\n\n// ------------\n\nfunc (e *Encoder) kBool(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeBool(*(*bool)(v.ptr))\n}\n\nfunc (e *Encoder) kTime(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeTime(*(*time.Time)(v.ptr))\n}\n\nfunc (e *Encoder) kString(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\ts := *(*string)(v.ptr)\n\tif e.h.StringToRaw {\n\t\te.e.EncodeStringBytesRaw(bytesView(s))\n\t} else {\n\t\te.e.EncodeStringEnc(cUTF8, s)\n\t}\n}\n\nfunc (e *Encoder) kFloat64(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeFloat64(*(*float64)(v.ptr))\n}\n\nfunc (e *Encoder) kFloat32(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeFloat32(*(*float32)(v.ptr))\n}\n\nfunc (e *Encoder) kInt(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeInt(int64(*(*int)(v.ptr)))\n}\n\nfunc (e *Encoder) kInt8(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeInt(int64(*(*int8)(v.ptr)))\n}\n\nfunc (e *Encoder) kInt16(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeInt(int64(*(*int16)(v.ptr)))\n}\n\nfunc (e *Encoder) kInt32(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeInt(int64(*(*int32)(v.ptr)))\n}\n\nfunc (e *Encoder) kInt64(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeInt(int64(*(*int64)(v.ptr)))\n}\n\nfunc (e *Encoder) kUint(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uint)(v.ptr)))\n}\n\nfunc (e *Encoder) kUint8(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uint8)(v.ptr)))\n}\n\nfunc (e *Encoder) kUint16(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uint16)(v.ptr)))\n}\n\nfunc (e *Encoder) kUint32(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uint32)(v.ptr)))\n}\n\nfunc (e *Encoder) kUint64(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uint64)(v.ptr)))\n}\n\nfunc (e *Encoder) kUintptr(f *codecFnInfo, rv reflect.Value) {\n\tv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\te.e.EncodeUint(uint64(*(*uintptr)(v.ptr)))\n}\n\n// ------------\n\n// func (d *Decoder) raw(f *codecFnInfo, rv reflect.Value) {\n// \turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n// \t// if urv.flag&unsafeFlagIndir != 0 {\n// \t// \turv.ptr = *(*unsafe.Pointer)(urv.ptr)\n// \t// }\n// \t*(*[]byte)(urv.ptr) = d.rawBytes()\n// }\n\n// func rv0t(rt reflect.Type) reflect.Value {\n// \tut := (*unsafeIntf)(unsafe.Pointer(&rt))\n// \t// we need to determine whether ifaceIndir, and then whether to just pass 0 as the ptr\n// \tuv := unsafeReflectValue{ut.word, &zeroRTv, flag(rt.Kind())}\n// \treturn *(*reflect.Value)(unsafe.Pointer(&uv})\n// }\n\n// func rv2i(rv reflect.Value) interface{} {\n// \turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n// \t// true references (map, func, chan, ptr - NOT slice) may be double-referenced as flagIndir\n// \tvar ptr unsafe.Pointer\n// \t// kk := reflect.Kind(urv.flag & (1<<5 - 1))\n// \t// if (kk == reflect.Map || kk == reflect.Ptr || kk == reflect.Chan || kk == reflect.Func) && urv.flag&unsafeFlagIndir != 0 {\n// \tif refBitset.isset(byte(urv.flag&(1<<5-1))) && urv.flag&unsafeFlagIndir != 0 {\n// \t\tptr = *(*unsafe.Pointer)(urv.ptr)\n// \t} else {\n// \t\tptr = urv.ptr\n// \t}\n// \treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{typ: urv.typ, word: ptr}))\n// \t// return *(*interface{})(unsafe.Pointer(&unsafeIntf{word: *(*unsafe.Pointer)(urv.ptr), typ: urv.typ}))\n// \t// return *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// }\n\n// func definitelyNil(v interface{}) bool {\n// \tvar ui *unsafeIntf = (*unsafeIntf)(unsafe.Pointer(&v))\n// \tif ui.word == nil {\n// \t\treturn true\n// \t}\n// \tvar tk = reflect.TypeOf(v).Kind()\n// \treturn (tk == reflect.Interface || tk == reflect.Slice) && *(*unsafe.Pointer)(ui.word) == nil\n// \tfmt.Printf(\">>>> definitely nil: isnil: %v, TYPE: \\t%T, word: %v, *word: %v, type: %v, nil: %v\\n\",\n// \tv == nil, v, word, *((*unsafe.Pointer)(word)), ui.typ, nil)\n// }\n\n// func keepAlive4BytesView(v string) {\n// \truntime.KeepAlive(v)\n// }\n\n// func keepAlive4StringView(v []byte) {\n// \truntime.KeepAlive(v)\n// }\n\n// func rt2id(rt reflect.Type) uintptr {\n// \treturn uintptr(((*unsafeIntf)(unsafe.Pointer(&rt))).word)\n// \t// var i interface{} = rt\n// \t// // ui := (*unsafeIntf)(unsafe.Pointer(&i))\n// \t// return ((*unsafeIntf)(unsafe.Pointer(&i))).word\n// }\n\n// func rv2i(rv reflect.Value) interface{} {\n// \turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n// \t// non-reference type: already indir\n// \t// reference type: depend on flagIndir property ('cos maybe was double-referenced)\n// \t// const (unsafeRvFlagKindMask = 1<<5 - 1 , unsafeRvFlagIndir = 1 << 7 )\n// \t// rvk := reflect.Kind(urv.flag & (1<<5 - 1))\n// \t// if (rvk == reflect.Chan ||\n// \t// \trvk == reflect.Func ||\n// \t// \trvk == reflect.Interface ||\n// \t// \trvk == reflect.Map ||\n// \t// \trvk == reflect.Ptr ||\n// \t// \trvk == reflect.UnsafePointer) && urv.flag&(1<<8) != 0 {\n// \t// \tfmt.Printf(\">>>>> ---- double indirect reference: %v, %v\\n\", rvk, rv.Type())\n// \t// \treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: *(*unsafe.Pointer)(urv.ptr), typ: urv.typ}))\n// \t// }\n// \tif urv.flag&(1<<5-1) == uintptr(reflect.Map) && urv.flag&(1<<7) != 0 {\n// \t\t// fmt.Printf(\">>>>> ---- double indirect reference: %v, %v\\n\", rvk, rv.Type())\n// \t\treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: *(*unsafe.Pointer)(urv.ptr), typ: urv.typ}))\n// \t}\n// \t// fmt.Printf(\">>>>> ++++ direct reference: %v, %v\\n\", rvk, rv.Type())\n// \treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// }\n\n// const (\n// \tunsafeRvFlagKindMask = 1<<5 - 1\n// \tunsafeRvKindDirectIface = 1 << 5\n// \tunsafeRvFlagIndir = 1 << 7\n// \tunsafeRvFlagAddr = 1 << 8\n// \tunsafeRvFlagMethod = 1 << 9\n\n// \t_USE_RV_INTERFACE bool = false\n// \t_UNSAFE_RV_DEBUG = true\n// )\n\n// type unsafeRtype struct {\n// \t_ [2]uintptr\n// \t_ uint32\n// \t_ uint8\n// \t_ uint8\n// \t_ uint8\n// \tkind uint8\n// \t_ [2]uintptr\n// \t_ int32\n// }\n\n// func _rv2i(rv reflect.Value) interface{} {\n// \t// Note: From use,\n// \t// - it's never an interface\n// \t// - the only calls here are for ifaceIndir types.\n// \t// (though that conditional is wrong)\n// \t// To know for sure, we need the value of t.kind (which is not exposed).\n// \t//\n// \t// Need to validate the path: type is indirect ==> only value is indirect ==> default (value is direct)\n// \t// - Type indirect, Value indirect: ==> numbers, boolean, slice, struct, array, string\n// \t// - Type Direct, Value indirect: ==> map???\n// \t// - Type Direct, Value direct: ==> pointers, unsafe.Pointer, func, chan, map\n// \t//\n// \t// TRANSLATES TO:\n// \t// if typeIndirect { } else if valueIndirect { } else { }\n// \t//\n// \t// Since we don't deal with funcs, then \"flagNethod\" is unset, and can be ignored.\n\n// \tif _USE_RV_INTERFACE {\n// \t\treturn rv.Interface()\n// \t}\n// \turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n\n// \t// if urv.flag&unsafeRvFlagMethod != 0 || urv.flag&unsafeRvFlagKindMask == uintptr(reflect.Interface) {\n// \t// \tprintln(\"***** IS flag method or interface: delegating to rv.Interface()\")\n// \t// \treturn rv.Interface()\n// \t// }\n\n// \t// if urv.flag&unsafeRvFlagKindMask == uintptr(reflect.Interface) {\n// \t// \tprintln(\"***** IS Interface: delegate to rv.Interface\")\n// \t// \treturn rv.Interface()\n// \t// }\n// \t// if urv.flag&unsafeRvFlagKindMask&unsafeRvKindDirectIface == 0 {\n// \t// \tif urv.flag&unsafeRvFlagAddr == 0 {\n// \t// \t\tprintln(\"***** IS ifaceIndir typ\")\n// \t// \t\t// ui := unsafeIntf{word: urv.ptr, typ: urv.typ}\n// \t// \t\t// return *(*interface{})(unsafe.Pointer(&ui))\n// \t// \t\t// return *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// \t// \t}\n// \t// } else if urv.flag&unsafeRvFlagIndir != 0 {\n// \t// \tprintln(\"***** IS flagindir\")\n// \t// \t// return *(*interface{})(unsafe.Pointer(&unsafeIntf{word: *(*unsafe.Pointer)(urv.ptr), typ: urv.typ}))\n// \t// } else {\n// \t// \tprintln(\"***** NOT flagindir\")\n// \t// \treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// \t// }\n// \t// println(\"***** default: delegate to rv.Interface\")\n\n// \turt := (*unsafeRtype)(unsafe.Pointer(urv.typ))\n// \tif _UNSAFE_RV_DEBUG {\n// \t\tfmt.Printf(\">>>> start: %v: \", rv.Type())\n// \t\tfmt.Printf(\"%v - %v\\n\", *urv, *urt)\n// \t}\n// \tif urt.kind&unsafeRvKindDirectIface == 0 {\n// \t\tif _UNSAFE_RV_DEBUG {\n// \t\t\tfmt.Printf(\"**** +ifaceIndir type: %v\\n\", rv.Type())\n// \t\t}\n// \t\t// println(\"***** IS ifaceIndir typ\")\n// \t\t// if true || urv.flag&unsafeRvFlagAddr == 0 {\n// \t\t// \t// println(\" ***** IS NOT addr\")\n// \t\treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// \t\t// }\n// \t} else if urv.flag&unsafeRvFlagIndir != 0 {\n// \t\tif _UNSAFE_RV_DEBUG {\n// \t\t\tfmt.Printf(\"**** +flagIndir type: %v\\n\", rv.Type())\n// \t\t}\n// \t\t// println(\"***** IS flagindir\")\n// \t\treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: *(*unsafe.Pointer)(urv.ptr), typ: urv.typ}))\n// \t} else {\n// \t\tif _UNSAFE_RV_DEBUG {\n// \t\t\tfmt.Printf(\"**** -flagIndir type: %v\\n\", rv.Type())\n// \t\t}\n// \t\t// println(\"***** NOT flagindir\")\n// \t\treturn *(*interface{})(unsafe.Pointer(&unsafeIntf{word: urv.ptr, typ: urv.typ}))\n// \t}\n// \t// println(\"***** default: delegating to rv.Interface()\")\n// \t// return rv.Interface()\n// }\n\n// var staticM0 = make(map[string]uint64)\n// var staticI0 = (int32)(-5)\n\n// func staticRv2iTest() {\n// \ti0 := (int32)(-5)\n// \tm0 := make(map[string]uint16)\n// \tm0[\"1\"] = 1\n// \tfor _, i := range []interface{}{\n// \t\t(int)(7),\n// \t\t(uint)(8),\n// \t\t(int16)(-9),\n// \t\t(uint16)(19),\n// \t\t(uintptr)(77),\n// \t\t(bool)(true),\n// \t\tfloat32(-32.7),\n// \t\tfloat64(64.9),\n// \t\tcomplex(float32(19), 5),\n// \t\tcomplex(float64(-32), 7),\n// \t\t[4]uint64{1, 2, 3, 4},\n// \t\t(chan<- int)(nil), // chan,\n// \t\trv2i, // func\n// \t\tio.Writer(ioutil.Discard),\n// \t\tmake(map[string]uint),\n// \t\t(map[string]uint)(nil),\n// \t\tstaticM0,\n// \t\tm0,\n// \t\t&m0,\n// \t\ti0,\n// \t\t&i0,\n// \t\t&staticI0,\n// \t\t&staticM0,\n// \t\t[]uint32{6, 7, 8},\n// \t\t\"abc\",\n// \t\tRaw{},\n// \t\tRawExt{},\n// \t\t&Raw{},\n// \t\t&RawExt{},\n// \t\tunsafe.Pointer(&i0),\n// \t} {\n// \t\ti2 := rv2i(reflect.ValueOf(i))\n// \t\teq := reflect.DeepEqual(i, i2)\n// \t\tfmt.Printf(\">>>> %v == %v? %v\\n\", i, i2, eq)\n// \t}\n// \t// os.Exit(0)\n// }\n\n// func init() {\n// \tstaticRv2iTest()\n// }\n\n// func rv2i(rv reflect.Value) interface{} {\n// \tif _USE_RV_INTERFACE || rv.Kind() == reflect.Interface || rv.CanAddr() {\n// \t\treturn rv.Interface()\n// \t}\n// \t// var i interface{}\n// \t// ui := (*unsafeIntf)(unsafe.Pointer(&i))\n// \tvar ui unsafeIntf\n// \turv := (*unsafeReflectValue)(unsafe.Pointer(&rv))\n// \t// fmt.Printf(\"urv: flag: %b, typ: %b, ptr: %b\\n\", urv.flag, uintptr(urv.typ), uintptr(urv.ptr))\n// \tif (urv.flag&unsafeRvFlagKindMask)&unsafeRvKindDirectIface == 0 {\n// \t\tif urv.flag&unsafeRvFlagAddr != 0 {\n// \t\t\tprintln(\"***** indirect and addressable! Needs typed move - delegate to rv.Interface()\")\n// \t\t\treturn rv.Interface()\n// \t\t}\n// \t\tprintln(\"****** indirect type/kind\")\n// \t\tui.word = urv.ptr\n// \t} else if urv.flag&unsafeRvFlagIndir != 0 {\n// \t\tprintln(\"****** unsafe rv flag indir\")\n// \t\tui.word = *(*unsafe.Pointer)(urv.ptr)\n// \t} else {\n// \t\tprintln(\"****** default: assign prt to word directly\")\n// \t\tui.word = urv.ptr\n// \t}\n// \t// ui.word = urv.ptr\n// \tui.typ = urv.typ\n// \t// fmt.Printf(\"(pointers) ui.typ: %p, word: %p\\n\", ui.typ, ui.word)\n// \t// fmt.Printf(\"(binary) ui.typ: %b, word: %b\\n\", uintptr(ui.typ), uintptr(ui.word))\n// \treturn *(*interface{})(unsafe.Pointer(&ui))\n// \t// return i\n// }\n" }, { "path": "vendor/github.com/ugorji/go/codec/json.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\n// By default, this json support uses base64 encoding for bytes, because you cannot\n// store and read any arbitrary string in json (only unicode).\n// However, the user can configre how to encode/decode bytes.\n//\n// This library specifically supports UTF-8 for encoding and decoding only.\n//\n// Note that the library will happily encode/decode things which are not valid\n// json e.g. a map[int64]string. We do it for consistency. With valid json,\n// we will encode and decode appropriately.\n// Users can specify their map type if necessary to force it.\n//\n// Note:\n// - we cannot use strconv.Quote and strconv.Unquote because json quotes/unquotes differently.\n// We implement it here.\n\n// Top-level methods of json(End|Dec)Driver (which are implementations of (en|de)cDriver\n// MUST not call one-another.\n\nimport (\n\t\"bytes\"\n\t\"encoding/base64\"\n\t\"math\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"time\"\n\t\"unicode\"\n\t\"unicode/utf16\"\n\t\"unicode/utf8\"\n)\n\n//--------------------------------\n\nvar jsonLiterals = [...]byte{\n\t'\"', 't', 'r', 'u', 'e', '\"',\n\t'\"', 'f', 'a', 'l', 's', 'e', '\"',\n\t'\"', 'n', 'u', 'l', 'l', '\"',\n}\n\nconst (\n\tjsonLitTrueQ = 0\n\tjsonLitTrue = 1\n\tjsonLitFalseQ = 6\n\tjsonLitFalse = 7\n\t// jsonLitNullQ = 13\n\tjsonLitNull = 14\n)\n\nvar (\n\tjsonLiteral4True = jsonLiterals[jsonLitTrue+1 : jsonLitTrue+4]\n\tjsonLiteral4False = jsonLiterals[jsonLitFalse+1 : jsonLitFalse+5]\n\tjsonLiteral4Null = jsonLiterals[jsonLitNull+1 : jsonLitNull+4]\n)\n\nconst (\n\tjsonU4Chk2 = '0'\n\tjsonU4Chk1 = 'a' - 10\n\tjsonU4Chk0 = 'A' - 10\n\n\tjsonScratchArrayLen = cacheLineSize // 64\n)\n\nconst (\n\t// If !jsonValidateSymbols, decoding will be faster, by skipping some checks:\n\t// - If we see first character of null, false or true,\n\t// do not validate subsequent characters.\n\t// - e.g. if we see a n, assume null and skip next 3 characters,\n\t// and do not validate they are ull.\n\t// P.S. Do not expect a significant decoding boost from this.\n\tjsonValidateSymbols = true\n\n\tjsonSpacesOrTabsLen = 128\n\n\tjsonAlwaysReturnInternString = false\n)\n\nvar (\n\t// jsonTabs and jsonSpaces are used as caches for indents\n\tjsonTabs, jsonSpaces [jsonSpacesOrTabsLen]byte\n\n\tjsonCharHtmlSafeSet bitset256\n\tjsonCharSafeSet bitset256\n\tjsonCharWhitespaceSet bitset256\n\tjsonNumSet bitset256\n)\n\nfunc init() {\n\tvar i byte\n\tfor i = 0; i < jsonSpacesOrTabsLen; i++ {\n\t\tjsonSpaces[i] = ' '\n\t\tjsonTabs[i] = '\\t'\n\t}\n\n\t// populate the safe values as true: note: ASCII control characters are (0-31)\n\t// jsonCharSafeSet: all true except (0-31) \" \\\n\t// jsonCharHtmlSafeSet: all true except (0-31) \" \\ < > &\n\tfor i = 32; i < utf8.RuneSelf; i++ {\n\t\tswitch i {\n\t\tcase '\"', '\\\\':\n\t\tcase '<', '>', '&':\n\t\t\tjsonCharSafeSet.set(i) // = true\n\t\tdefault:\n\t\t\tjsonCharSafeSet.set(i)\n\t\t\tjsonCharHtmlSafeSet.set(i)\n\t\t}\n\t}\n\tfor i = 0; i <= utf8.RuneSelf; i++ {\n\t\tswitch i {\n\t\tcase ' ', '\\t', '\\r', '\\n':\n\t\t\tjsonCharWhitespaceSet.set(i)\n\t\tcase '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'e', 'E', '.', '+', '-':\n\t\t\tjsonNumSet.set(i)\n\t\t}\n\t}\n}\n\n// ----------------\n\ntype jsonEncDriverTypical struct {\n\tjsonEncDriver\n}\n\nfunc (e *jsonEncDriverTypical) WriteArrayStart(length int) {\n\te.w.writen1('[')\n}\n\nfunc (e *jsonEncDriverTypical) WriteArrayElem() {\n\tif e.e.c != containerArrayStart {\n\t\te.w.writen1(',')\n\t}\n}\n\nfunc (e *jsonEncDriverTypical) WriteArrayEnd() {\n\te.w.writen1(']')\n}\n\nfunc (e *jsonEncDriverTypical) WriteMapStart(length int) {\n\te.w.writen1('{')\n}\n\nfunc (e *jsonEncDriverTypical) WriteMapElemKey() {\n\tif e.e.c != containerMapStart {\n\t\te.w.writen1(',')\n\t}\n}\n\nfunc (e *jsonEncDriverTypical) WriteMapElemValue() {\n\te.w.writen1(':')\n}\n\nfunc (e *jsonEncDriverTypical) WriteMapEnd() {\n\te.w.writen1('}')\n}\n\nfunc (e *jsonEncDriverTypical) EncodeBool(b bool) {\n\tif b {\n\t\te.w.writeb(jsonLiterals[jsonLitTrue : jsonLitTrue+4])\n\t} else {\n\t\te.w.writeb(jsonLiterals[jsonLitFalse : jsonLitFalse+5])\n\t}\n}\n\nfunc (e *jsonEncDriverTypical) EncodeInt(v int64) {\n\te.w.writeb(strconv.AppendInt(e.b[:0], v, 10))\n}\n\nfunc (e *jsonEncDriverTypical) EncodeUint(v uint64) {\n\te.w.writeb(strconv.AppendUint(e.b[:0], v, 10))\n}\n\nfunc (e *jsonEncDriverTypical) EncodeFloat64(f float64) {\n\tfmt, prec := jsonFloatStrconvFmtPrec64(f)\n\te.w.writeb(strconv.AppendFloat(e.b[:0], f, fmt, int(prec), 64))\n\t// e.w.writeb(strconv.AppendFloat(e.b[:0], f, jsonFloatStrconvFmtPrec64(f), 64))\n}\n\nfunc (e *jsonEncDriverTypical) EncodeFloat32(f float32) {\n\tfmt, prec := jsonFloatStrconvFmtPrec32(f)\n\te.w.writeb(strconv.AppendFloat(e.b[:0], float64(f), fmt, int(prec), 32))\n}\n\n// func (e *jsonEncDriverTypical) encodeFloat(f float64, bitsize uint8) {\n// \tfmt, prec := jsonFloatStrconvFmtPrec(f, bitsize == 32)\n// \te.w.writeb(strconv.AppendFloat(e.b[:0], f, fmt, prec, int(bitsize)))\n// }\n\n// func (e *jsonEncDriverTypical) atEndOfEncode() {\n// \tif e.tw {\n// \t\te.w.writen1(' ')\n// \t}\n// }\n\n// ----------------\n\ntype jsonEncDriverGeneric struct {\n\tjsonEncDriver\n}\n\n// indent is done as below:\n// - newline and indent are added before each mapKey or arrayElem\n// - newline and indent are added before each ending,\n// except there was no entry (so we can have {} or [])\n\nfunc (e *jsonEncDriverGeneric) reset() {\n\te.jsonEncDriver.reset()\n\te.d, e.dl, e.di = false, 0, 0\n\tif e.h.Indent != 0 {\n\t\te.d = true\n\t\te.di = int8(e.h.Indent)\n\t}\n\t// if e.h.Indent > 0 {\n\t// \te.d = true\n\t// \te.di = int8(e.h.Indent)\n\t// } else if e.h.Indent < 0 {\n\t// \te.d = true\n\t// \t// e.dt = true\n\t// \te.di = int8(-e.h.Indent)\n\t// }\n\te.ks = e.h.MapKeyAsString\n\te.is = e.h.IntegerAsString\n}\n\nfunc (e *jsonEncDriverGeneric) WriteArrayStart(length int) {\n\tif e.d {\n\t\te.dl++\n\t}\n\te.w.writen1('[')\n}\n\nfunc (e *jsonEncDriverGeneric) WriteArrayEnd() {\n\tif e.d {\n\t\te.dl--\n\t\te.writeIndent()\n\t}\n\te.w.writen1(']')\n}\n\nfunc (e *jsonEncDriverGeneric) WriteMapStart(length int) {\n\tif e.d {\n\t\te.dl++\n\t}\n\te.w.writen1('{')\n}\n\nfunc (e *jsonEncDriverGeneric) WriteMapEnd() {\n\tif e.d {\n\t\te.dl--\n\t\tif e.e.c != containerMapStart {\n\t\t\te.writeIndent()\n\t\t}\n\t}\n\te.w.writen1('}')\n}\n\nfunc (e *jsonEncDriverGeneric) EncodeBool(b bool) {\n\tif e.ks && e.e.c == containerMapKey {\n\t\tif b {\n\t\t\te.w.writeb(jsonLiterals[jsonLitTrueQ : jsonLitTrueQ+6])\n\t\t} else {\n\t\t\te.w.writeb(jsonLiterals[jsonLitFalseQ : jsonLitFalseQ+7])\n\t\t}\n\t} else {\n\t\tif b {\n\t\t\te.w.writeb(jsonLiterals[jsonLitTrue : jsonLitTrue+4])\n\t\t} else {\n\t\t\te.w.writeb(jsonLiterals[jsonLitFalse : jsonLitFalse+5])\n\t\t}\n\t}\n}\n\nfunc (e *jsonEncDriverGeneric) encodeFloat(f float64, bitsize, fmt byte, prec int8) {\n\tvar blen int\n\tif e.ks && e.e.c == containerMapKey {\n\t\tblen = 2 + len(strconv.AppendFloat(e.b[1:1], f, fmt, int(prec), int(bitsize)))\n\t\te.b[0] = '\"'\n\t\te.b[blen-1] = '\"'\n\t} else {\n\t\tblen = len(strconv.AppendFloat(e.b[:0], f, fmt, int(prec), int(bitsize)))\n\t}\n\te.w.writeb(e.b[:blen])\n}\n\nfunc (e *jsonEncDriverGeneric) EncodeFloat64(f float64) {\n\tfmt, prec := jsonFloatStrconvFmtPrec64(f)\n\te.encodeFloat(f, 64, fmt, prec)\n}\n\nfunc (e *jsonEncDriverGeneric) EncodeFloat32(f float32) {\n\tfmt, prec := jsonFloatStrconvFmtPrec32(f)\n\te.encodeFloat(float64(f), 32, fmt, prec)\n}\n\nfunc (e *jsonEncDriverGeneric) EncodeInt(v int64) {\n\tx := e.is\n\tif x == 'A' || x == 'L' && (v > 1<<53 || v < -(1<<53)) || (e.ks && e.e.c == containerMapKey) {\n\t\tblen := 2 + len(strconv.AppendInt(e.b[1:1], v, 10))\n\t\te.b[0] = '\"'\n\t\te.b[blen-1] = '\"'\n\t\te.w.writeb(e.b[:blen])\n\t\treturn\n\t}\n\te.w.writeb(strconv.AppendInt(e.b[:0], v, 10))\n}\n\nfunc (e *jsonEncDriverGeneric) EncodeUint(v uint64) {\n\tx := e.is\n\tif x == 'A' || x == 'L' && v > 1<<53 || (e.ks && e.e.c == containerMapKey) {\n\t\tblen := 2 + len(strconv.AppendUint(e.b[1:1], v, 10))\n\t\te.b[0] = '\"'\n\t\te.b[blen-1] = '\"'\n\t\te.w.writeb(e.b[:blen])\n\t\treturn\n\t}\n\te.w.writeb(strconv.AppendUint(e.b[:0], v, 10))\n}\n\n// func (e *jsonEncDriverGeneric) EncodeFloat32(f float32) {\n// \t// e.encodeFloat(float64(f), 32)\n// \t// always encode all floats as IEEE 64-bit floating point.\n// \t// It also ensures that we can decode in full precision even if into a float32,\n// \t// as what is written is always to float64 precision.\n// \te.EncodeFloat64(float64(f))\n// }\n\n// func (e *jsonEncDriverGeneric) atEndOfEncode() {\n// \tif e.tw {\n// \t\tif e.d {\n// \t\t\te.w.writen1('\\n')\n// \t\t} else {\n// \t\t\te.w.writen1(' ')\n// \t\t}\n// \t}\n// }\n\n// --------------------\n\ntype jsonEncDriver struct {\n\tnoBuiltInTypes\n\tw *encWriterSwitch\n\te *Encoder\n\th *JsonHandle\n\n\tbs []byte // for encoding strings\n\tse interfaceExtWrapper\n\n\t// ---- cpu cache line boundary?\n\t// ds string // indent string\n\tdi int8 // indent per: if negative, use tabs\n\td bool // indenting?\n\t// dt bool // indent using tabs\n\tdl uint16 // indent level\n\tks bool // map key as string\n\tis byte // integer as string\n\n\ts *bitset256 // safe set for characters (taking h.HTMLAsIs into consideration)\n\t// scratch: encode time, numbers, etc. Note: leave 1 byte for containerState\n\tb [jsonScratchArrayLen - 16]byte // leave space for bs(len,cap), containerState\n}\n\n// Keep writeIndent, WriteArrayElem, WriteMapElemKey, WriteMapElemValue\n// in jsonEncDriver, so that *Encoder can directly call them\n\nfunc (e *jsonEncDriver) getJsonEncDriver() *jsonEncDriver { return e }\n\nfunc (e *jsonEncDriver) writeIndent() {\n\te.w.writen1('\\n')\n\tx := int(e.di) * int(e.dl)\n\tif e.di < 0 {\n\t\tx = -x\n\t\tfor x > jsonSpacesOrTabsLen {\n\t\t\te.w.writeb(jsonTabs[:])\n\t\t\tx -= jsonSpacesOrTabsLen\n\t\t}\n\t\te.w.writeb(jsonTabs[:x])\n\t} else {\n\t\tfor x > jsonSpacesOrTabsLen {\n\t\t\te.w.writeb(jsonSpaces[:])\n\t\t\tx -= jsonSpacesOrTabsLen\n\t\t}\n\t\te.w.writeb(jsonSpaces[:x])\n\t}\n}\n\nfunc (e *jsonEncDriver) WriteArrayElem() {\n\t// xdebugf(\"WriteArrayElem: e.e.c: %d\", e.e.c)\n\tif e.e.c != containerArrayStart {\n\t\te.w.writen1(',')\n\t}\n\tif e.d {\n\t\te.writeIndent()\n\t}\n}\n\nfunc (e *jsonEncDriver) WriteMapElemKey() {\n\tif e.e.c != containerMapStart {\n\t\te.w.writen1(',')\n\t}\n\tif e.d {\n\t\te.writeIndent()\n\t}\n}\n\nfunc (e *jsonEncDriver) WriteMapElemValue() {\n\tif e.d {\n\t\te.w.writen2(':', ' ')\n\t} else {\n\t\te.w.writen1(':')\n\t}\n}\n\nfunc (e *jsonEncDriver) EncodeNil() {\n\t// We always encode nil as just null (never in quotes)\n\t// This allows us to easily decode if a nil in the json stream\n\t// ie if initial token is n.\n\te.w.writeb(jsonLiterals[jsonLitNull : jsonLitNull+4])\n\n\t// if e.h.MapKeyAsString && e.e.c == containerMapKey {\n\t// \te.w.writeb(jsonLiterals[jsonLitNullQ : jsonLitNullQ+6])\n\t// } else {\n\t// \te.w.writeb(jsonLiterals[jsonLitNull : jsonLitNull+4])\n\t// }\n}\n\nfunc (e *jsonEncDriver) EncodeTime(t time.Time) {\n\t// Do NOT use MarshalJSON, as it allocates internally.\n\t// instead, we call AppendFormat directly, using our scratch buffer (e.b)\n\tif t.IsZero() {\n\t\te.EncodeNil()\n\t} else {\n\t\te.b[0] = '\"'\n\t\tb := t.AppendFormat(e.b[1:1], time.RFC3339Nano)\n\t\te.b[len(b)+1] = '\"'\n\t\te.w.writeb(e.b[:len(b)+2])\n\t}\n\t// v, err := t.MarshalJSON(); if err != nil { e.e.error(err) } e.w.writeb(v)\n}\n\nfunc (e *jsonEncDriver) EncodeExt(rv interface{}, xtag uint64, ext Ext, en *Encoder) {\n\tif v := ext.ConvertExt(rv); v == nil {\n\t\te.EncodeNil()\n\t} else {\n\t\ten.encode(v)\n\t}\n}\n\nfunc (e *jsonEncDriver) EncodeRawExt(re *RawExt, en *Encoder) {\n\t// only encodes re.Value (never re.Data)\n\tif re.Value == nil {\n\t\te.EncodeNil()\n\t} else {\n\t\ten.encode(re.Value)\n\t}\n}\n\nfunc (e *jsonEncDriver) EncodeStringEnc(c charEncoding, v string) {\n\te.quoteStr(v)\n}\n\nfunc (e *jsonEncDriver) EncodeStringBytesRaw(v []byte) {\n\t// if encoding raw bytes and RawBytesExt is configured, use it to encode\n\tif v == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tif e.se.InterfaceExt != nil {\n\t\te.EncodeExt(v, 0, &e.se, e.e)\n\t\treturn\n\t}\n\n\tslen := base64.StdEncoding.EncodedLen(len(v)) + 2\n\tif cap(e.bs) >= slen {\n\t\te.bs = e.bs[:slen]\n\t} else {\n\t\te.bs = make([]byte, slen)\n\t}\n\te.bs[0] = '\"'\n\tbase64.StdEncoding.Encode(e.bs[1:], v)\n\te.bs[slen-1] = '\"'\n\te.w.writeb(e.bs)\n}\n\nfunc (e *jsonEncDriver) EncodeAsis(v []byte) {\n\te.w.writeb(v)\n}\n\nfunc (e *jsonEncDriver) quoteStr(s string) {\n\t// adapted from std pkg encoding/json\n\tconst hex = \"0123456789abcdef\"\n\tw := e.w\n\tw.writen1('\"')\n\tvar start int\n\tfor i := 0; i < len(s); {\n\t\t// encode all bytes < 0x20 (except \\r, \\n).\n\t\t// also encode < > & to prevent security holes when served to some browsers.\n\n\t\t// We optimize for ascii, by assumining that most characters are in the BMP\n\t\t// and natively consumed by json without much computation.\n\n\t\t// if 0x20 <= b && b != '\\\\' && b != '\"' && b != '<' && b != '>' && b != '&' {\n\t\t// if (htmlasis && jsonCharSafeSet.isset(b)) || jsonCharHtmlSafeSet.isset(b) {\n\t\tif e.s.isset(s[i]) {\n\t\t\ti++\n\t\t\tcontinue\n\t\t}\n\t\tif b := s[i]; b < utf8.RuneSelf {\n\t\t\tif start < i {\n\t\t\t\tw.writestr(s[start:i])\n\t\t\t}\n\t\t\tswitch b {\n\t\t\tcase '\\\\', '\"':\n\t\t\t\tw.writen2('\\\\', b)\n\t\t\tcase '\\n':\n\t\t\t\tw.writen2('\\\\', 'n')\n\t\t\tcase '\\r':\n\t\t\t\tw.writen2('\\\\', 'r')\n\t\t\tcase '\\b':\n\t\t\t\tw.writen2('\\\\', 'b')\n\t\t\tcase '\\f':\n\t\t\t\tw.writen2('\\\\', 'f')\n\t\t\tcase '\\t':\n\t\t\t\tw.writen2('\\\\', 't')\n\t\t\tdefault:\n\t\t\t\tw.writestr(`\\u00`)\n\t\t\t\tw.writen2(hex[b>>4], hex[b&0xF])\n\t\t\t}\n\t\t\ti++\n\t\t\tstart = i\n\t\t\tcontinue\n\t\t}\n\t\tc, size := utf8.DecodeRuneInString(s[i:])\n\t\tif c == utf8.RuneError {\n\t\t\tif size == 1 {\n\t\t\t\tif start < i {\n\t\t\t\t\tw.writestr(s[start:i])\n\t\t\t\t}\n\t\t\t\tw.writestr(`\\ufffd`)\n\t\t\t\ti++\n\t\t\t\tstart = i\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\t// U+2028 is LINE SEPARATOR. U+2029 is PARAGRAPH SEPARATOR.\n\t\t// Both technically valid JSON, but bomb on JSONP, so fix here unconditionally.\n\t\tif c == '\\u2028' || c == '\\u2029' {\n\t\t\tif start < i {\n\t\t\t\tw.writestr(s[start:i])\n\t\t\t}\n\t\t\tw.writestr(`\\u202`)\n\t\t\tw.writen1(hex[c&0xF])\n\t\t\ti += size\n\t\t\tstart = i\n\t\t\tcontinue\n\t\t}\n\t\ti += size\n\t}\n\tif start < len(s) {\n\t\tw.writestr(s[start:])\n\t}\n\tw.writen1('\"')\n}\n\nfunc (e *jsonEncDriver) atEndOfEncode() {\n\t// if e.e.c == 0 { // scalar written, output space\n\t// \te.w.writen1(' ')\n\t// } else if e.h.TermWhitespace { // container written, output new-line\n\t// \te.w.writen1('\\n')\n\t// }\n\tif e.h.TermWhitespace {\n\t\tif e.e.c == 0 { // scalar written, output space\n\t\t\te.w.writen1(' ')\n\t\t} else { // container written, output new-line\n\t\t\te.w.writen1('\\n')\n\t\t}\n\t}\n\n}\n\ntype jsonDecDriver struct {\n\tnoBuiltInTypes\n\td *Decoder\n\th *JsonHandle\n\tr *decReaderSwitch\n\tse interfaceExtWrapper\n\n\tbs []byte // scratch, initialized from b. For parsing strings or numbers.\n\t// ---- writable fields during execution --- *try* to keep in sep cache line\n\n\t// ---- cpu cache line boundary?\n\tb [jsonScratchArrayLen]byte // scratch 1, used for parsing strings or numbers or time.Time\n\t// ---- cpu cache line boundary?\n\t// c containerState\n\ttok uint8 // used to store the token read right after skipWhiteSpace\n\tfnull bool // found null from appendStringAsBytes\n\t_ [2]byte // padding\n\tbstr [4]byte // scratch used for string \\UXXX parsing\n\tb2 [jsonScratchArrayLen - 8]byte // scratch 2, used only for readUntil, decNumBytes\n\n\t// _ [3]uint64 // padding\n\t// n jsonNum\n}\n\n// func jsonIsWS(b byte) bool {\n// \t// return b == ' ' || b == '\\t' || b == '\\r' || b == '\\n'\n// \treturn jsonCharWhitespaceSet.isset(b)\n// }\n\nfunc (d *jsonDecDriver) uncacheRead() {\n\tif d.tok != 0 {\n\t\td.r.unreadn1()\n\t\td.tok = 0\n\t}\n}\n\nfunc (d *jsonDecDriver) ReadMapStart() int {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tconst xc uint8 = '{'\n\tif d.tok != xc {\n\t\td.d.errorf(\"read map - expect char '%c' but got char '%c'\", xc, d.tok)\n\t}\n\td.tok = 0\n\treturn -1\n}\n\nfunc (d *jsonDecDriver) ReadArrayStart() int {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tconst xc uint8 = '['\n\tif d.tok != xc {\n\t\td.d.errorf(\"read array - expect char '%c' but got char '%c'\", xc, d.tok)\n\t}\n\td.tok = 0\n\treturn -1\n}\n\nfunc (d *jsonDecDriver) CheckBreak() bool {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\treturn d.tok == '}' || d.tok == ']'\n}\n\n// For the ReadXXX methods below, we could just delegate to helper functions\n// readContainerState(c containerState, xc uint8, check bool)\n// - ReadArrayElem would become:\n// readContainerState(containerArrayElem, ',', d.d.c != containerArrayStart)\n//\n// However, until mid-stack inlining comes in go1.11 which supports inlining of\n// one-liners, we explicitly write them all 5 out to elide the extra func call.\n//\n// TODO: For Go 1.11, if inlined, consider consolidating these.\n\nfunc (d *jsonDecDriver) ReadArrayElem() {\n\tconst xc uint8 = ','\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\t// xdebugf(\"ReadArrayElem: d.d.c: %d, token: %c\", d.d.c, d.tok)\n\tif d.d.c != containerArrayStart {\n\t\tif d.tok != xc {\n\t\t\td.d.errorf(\"read array element - expect char '%c' but got char '%c'\", xc, d.tok)\n\t\t}\n\t\td.tok = 0\n\t}\n}\n\nfunc (d *jsonDecDriver) ReadArrayEnd() {\n\tconst xc uint8 = ']'\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tif d.tok != xc {\n\t\td.d.errorf(\"read array end - expect char '%c' but got char '%c'\", xc, d.tok)\n\t}\n\td.tok = 0\n}\n\nfunc (d *jsonDecDriver) ReadMapElemKey() {\n\tconst xc uint8 = ','\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tif d.d.c != containerMapStart {\n\t\tif d.tok != xc {\n\t\t\td.d.errorf(\"read map key - expect char '%c' but got char '%c'\", xc, d.tok)\n\t\t}\n\t\td.tok = 0\n\t}\n}\n\nfunc (d *jsonDecDriver) ReadMapElemValue() {\n\tconst xc uint8 = ':'\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tif d.tok != xc {\n\t\td.d.errorf(\"read map value - expect char '%c' but got char '%c'\", xc, d.tok)\n\t}\n\td.tok = 0\n}\n\nfunc (d *jsonDecDriver) ReadMapEnd() {\n\tconst xc uint8 = '}'\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tif d.tok != xc {\n\t\td.d.errorf(\"read map end - expect char '%c' but got char '%c'\", xc, d.tok)\n\t}\n\td.tok = 0\n}\n\n// func (d *jsonDecDriver) readLit(length, fromIdx uint8) {\n// \t// length here is always less than 8 (literals are: null, true, false)\n// \tbs := d.r.readx(int(length))\n// \td.tok = 0\n// \tif jsonValidateSymbols && !bytes.Equal(bs, jsonLiterals[fromIdx:fromIdx+length]) {\n// \t\td.d.errorf(\"expecting %s: got %s\", jsonLiterals[fromIdx:fromIdx+length], bs)\n// \t}\n// }\n\nfunc (d *jsonDecDriver) readLit4True() {\n\tbs := d.r.readx(3)\n\td.tok = 0\n\tif jsonValidateSymbols && !bytes.Equal(bs, jsonLiteral4True) {\n\t\td.d.errorf(\"expecting %s: got %s\", jsonLiteral4True, bs)\n\t}\n}\n\nfunc (d *jsonDecDriver) readLit4False() {\n\tbs := d.r.readx(4)\n\td.tok = 0\n\tif jsonValidateSymbols && !bytes.Equal(bs, jsonLiteral4False) {\n\t\td.d.errorf(\"expecting %s: got %s\", jsonLiteral4False, bs)\n\t}\n}\n\nfunc (d *jsonDecDriver) readLit4Null() {\n\tbs := d.r.readx(3)\n\td.tok = 0\n\tif jsonValidateSymbols && !bytes.Equal(bs, jsonLiteral4Null) {\n\t\td.d.errorf(\"expecting %s: got %s\", jsonLiteral4Null, bs)\n\t}\n}\n\nfunc (d *jsonDecDriver) TryDecodeAsNil() bool {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\t// we shouldn't try to see if \"null\" was here, right?\n\t// only the plain string: `null` denotes a nil (ie not quotes)\n\tif d.tok == 'n' {\n\t\td.readLit4Null()\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *jsonDecDriver) DecodeBool() (v bool) {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tfquot := d.d.c == containerMapKey && d.tok == '\"'\n\tif fquot {\n\t\td.tok = d.r.readn1()\n\t}\n\tswitch d.tok {\n\tcase 'f':\n\t\td.readLit4False()\n\t\t// v = false\n\tcase 't':\n\t\td.readLit4True()\n\t\tv = true\n\tdefault:\n\t\td.d.errorf(\"decode bool: got first char %c\", d.tok)\n\t\t// v = false // \"unreachable\"\n\t}\n\tif fquot {\n\t\td.r.readn1()\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) DecodeTime() (t time.Time) {\n\t// read string, and pass the string into json.unmarshal\n\td.appendStringAsBytes()\n\tif d.fnull {\n\t\treturn\n\t}\n\tt, err := time.Parse(time.RFC3339, stringView(d.bs))\n\tif err != nil {\n\t\td.d.errorv(err)\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) ContainerType() (vt valueType) {\n\t// check container type by checking the first char\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\n\t// optimize this, so we don't do 4 checks but do one computation.\n\t// return jsonContainerSet[d.tok]\n\n\t// ContainerType is mostly called for Map and Array,\n\t// so this conditional is good enough (max 2 checks typically)\n\tif b := d.tok; b == '{' {\n\t\treturn valueTypeMap\n\t} else if b == '[' {\n\t\treturn valueTypeArray\n\t} else if b == 'n' {\n\t\treturn valueTypeNil\n\t} else if b == '\"' {\n\t\treturn valueTypeString\n\t}\n\treturn valueTypeUnset\n}\n\nfunc (d *jsonDecDriver) decNumBytes() (bs []byte) {\n\t// stores num bytes in d.bs\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tif d.tok == '\"' {\n\t\tbs = d.r.readUntil(d.b2[:0], '\"')\n\t\tbs = bs[:len(bs)-1]\n\t} else {\n\t\td.r.unreadn1()\n\t\tbs = d.r.readTo(d.bs[:0], &jsonNumSet)\n\t}\n\td.tok = 0\n\treturn bs\n}\n\nfunc (d *jsonDecDriver) DecodeUint64() (u uint64) {\n\tbs := d.decNumBytes()\n\tif len(bs) == 0 {\n\t\treturn\n\t}\n\tn, neg, badsyntax, overflow := jsonParseInteger(bs)\n\tif overflow {\n\t\td.d.errorf(\"overflow parsing unsigned integer: %s\", bs)\n\t} else if neg {\n\t\td.d.errorf(\"minus found parsing unsigned integer: %s\", bs)\n\t} else if badsyntax {\n\t\t// fallback: try to decode as float, and cast\n\t\tn = d.decUint64ViaFloat(stringView(bs))\n\t}\n\treturn n\n}\n\nfunc (d *jsonDecDriver) DecodeInt64() (i int64) {\n\tconst cutoff = uint64(1 << uint(64-1))\n\tbs := d.decNumBytes()\n\tif len(bs) == 0 {\n\t\treturn\n\t}\n\tn, neg, badsyntax, overflow := jsonParseInteger(bs)\n\tif overflow {\n\t\td.d.errorf(\"overflow parsing integer: %s\", bs)\n\t} else if badsyntax {\n\t\t// d.d.errorf(\"invalid syntax for integer: %s\", bs)\n\t\t// fallback: try to decode as float, and cast\n\t\tif neg {\n\t\t\tn = d.decUint64ViaFloat(stringView(bs[1:]))\n\t\t} else {\n\t\t\tn = d.decUint64ViaFloat(stringView(bs))\n\t\t}\n\t}\n\tif neg {\n\t\tif n > cutoff {\n\t\t\td.d.errorf(\"overflow parsing integer: %s\", bs)\n\t\t}\n\t\ti = -(int64(n))\n\t} else {\n\t\tif n >= cutoff {\n\t\t\td.d.errorf(\"overflow parsing integer: %s\", bs)\n\t\t}\n\t\ti = int64(n)\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) decUint64ViaFloat(s string) (u uint64) {\n\tif len(s) == 0 {\n\t\treturn\n\t}\n\tf, err := strconv.ParseFloat(s, 64)\n\tif err != nil {\n\t\td.d.errorf(\"invalid syntax for integer: %s\", s)\n\t\t// d.d.errorv(err)\n\t}\n\tfi, ff := math.Modf(f)\n\tif ff > 0 {\n\t\td.d.errorf(\"fractional part found parsing integer: %s\", s)\n\t} else if fi > float64(math.MaxUint64) {\n\t\td.d.errorf(\"overflow parsing integer: %s\", s)\n\t}\n\treturn uint64(fi)\n}\n\nfunc (d *jsonDecDriver) decodeFloat(bitsize int) (f float64) {\n\tbs := d.decNumBytes()\n\tif len(bs) == 0 {\n\t\treturn\n\t}\n\tf, err := strconv.ParseFloat(stringView(bs), bitsize)\n\tif err != nil {\n\t\td.d.errorv(err)\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) DecodeFloat64() (f float64) {\n\treturn d.decodeFloat(64)\n}\n\nfunc (d *jsonDecDriver) DecodeFloat32() (f float64) {\n\treturn d.decodeFloat(32)\n}\n\nfunc (d *jsonDecDriver) DecodeExt(rv interface{}, xtag uint64, ext Ext) (realxtag uint64) {\n\tif ext == nil {\n\t\tre := rv.(*RawExt)\n\t\tre.Tag = xtag\n\t\td.d.decode(&re.Value)\n\t} else {\n\t\tvar v interface{}\n\t\td.d.decode(&v)\n\t\text.UpdateExt(rv, v)\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) DecodeBytes(bs []byte, zerocopy bool) (bsOut []byte) {\n\t// if decoding into raw bytes, and the RawBytesExt is configured, use it to decode.\n\tif d.se.InterfaceExt != nil {\n\t\tbsOut = bs\n\t\td.DecodeExt(&bsOut, 0, &d.se)\n\t\treturn\n\t}\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\t// check if an \"array\" of uint8's (see ContainerType for how to infer if an array)\n\tif d.tok == '[' {\n\t\tbsOut, _ = fastpathTV.DecSliceUint8V(bs, true, d.d)\n\t\treturn\n\t}\n\td.appendStringAsBytes()\n\t// base64 encodes []byte{} as \"\", and we encode nil []byte as null.\n\t// Consequently, base64 should decode null as a nil []byte, and \"\" as an empty []byte{}.\n\t// appendStringAsBytes returns a zero-len slice for both, so as not to reset d.bs.\n\t// However, it sets a fnull field to true, so we can check if a null was found.\n\tif len(d.bs) == 0 {\n\t\tif d.fnull {\n\t\t\treturn nil\n\t\t}\n\t\treturn []byte{}\n\t}\n\tbs0 := d.bs\n\tslen := base64.StdEncoding.DecodedLen(len(bs0))\n\tif slen <= cap(bs) {\n\t\tbsOut = bs[:slen]\n\t} else if zerocopy && slen <= cap(d.b2) {\n\t\tbsOut = d.b2[:slen]\n\t} else {\n\t\tbsOut = make([]byte, slen)\n\t}\n\tslen2, err := base64.StdEncoding.Decode(bsOut, bs0)\n\tif err != nil {\n\t\td.d.errorf(\"error decoding base64 binary '%s': %v\", bs0, err)\n\t\treturn nil\n\t}\n\tif slen != slen2 {\n\t\tbsOut = bsOut[:slen2]\n\t}\n\treturn\n}\n\nfunc (d *jsonDecDriver) DecodeString() (s string) {\n\td.appendStringAsBytes()\n\treturn d.bsToString()\n}\n\nfunc (d *jsonDecDriver) DecodeStringAsBytes() (s []byte) {\n\td.appendStringAsBytes()\n\treturn d.bs\n}\n\nfunc (d *jsonDecDriver) appendStringAsBytes() {\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\n\td.fnull = false\n\tif d.tok != '\"' {\n\t\t// d.d.errorf(\"expect char '%c' but got char '%c'\", '\"', d.tok)\n\t\t// handle non-string scalar: null, true, false or a number\n\t\tswitch d.tok {\n\t\tcase 'n':\n\t\t\td.readLit4Null()\n\t\t\td.bs = d.bs[:0]\n\t\t\td.fnull = true\n\t\tcase 'f':\n\t\t\td.readLit4False()\n\t\t\td.bs = d.bs[:5]\n\t\t\tcopy(d.bs, \"false\")\n\t\tcase 't':\n\t\t\td.readLit4True()\n\t\t\td.bs = d.bs[:4]\n\t\t\tcopy(d.bs, \"true\")\n\t\tdefault:\n\t\t\t// try to parse a valid number\n\t\t\tbs := d.decNumBytes()\n\t\t\tif len(bs) <= cap(d.bs) {\n\t\t\t\td.bs = d.bs[:len(bs)]\n\t\t\t} else {\n\t\t\t\td.bs = make([]byte, len(bs))\n\t\t\t}\n\t\t\tcopy(d.bs, bs)\n\t\t}\n\t\treturn\n\t}\n\n\td.tok = 0\n\tr := d.r\n\tvar cs = r.readUntil(d.b2[:0], '\"')\n\tvar cslen = uint(len(cs))\n\tvar c uint8\n\tv := d.bs[:0]\n\t// append on each byte seen can be expensive, so we just\n\t// keep track of where we last read a contiguous set of\n\t// non-special bytes (using cursor variable),\n\t// and when we see a special byte\n\t// e.g. end-of-slice, \" or \\,\n\t// we will append the full range into the v slice before proceeding\n\tvar i, cursor uint\n\tfor {\n\t\tif i == cslen {\n\t\t\tv = append(v, cs[cursor:]...)\n\t\t\tcs = r.readUntil(d.b2[:0], '\"')\n\t\t\tcslen = uint(len(cs))\n\t\t\ti, cursor = 0, 0\n\t\t}\n\t\tc = cs[i]\n\t\tif c == '\"' {\n\t\t\tv = append(v, cs[cursor:i]...)\n\t\t\tbreak\n\t\t}\n\t\tif c != '\\\\' {\n\t\t\ti++\n\t\t\tcontinue\n\t\t}\n\t\tv = append(v, cs[cursor:i]...)\n\t\ti++\n\t\tc = cs[i]\n\t\tswitch c {\n\t\tcase '\"', '\\\\', '/', '\\'':\n\t\t\tv = append(v, c)\n\t\tcase 'b':\n\t\t\tv = append(v, '\\b')\n\t\tcase 'f':\n\t\t\tv = append(v, '\\f')\n\t\tcase 'n':\n\t\t\tv = append(v, '\\n')\n\t\tcase 'r':\n\t\t\tv = append(v, '\\r')\n\t\tcase 't':\n\t\t\tv = append(v, '\\t')\n\t\tcase 'u':\n\t\t\tvar r rune\n\t\t\tvar rr uint32\n\t\t\tif cslen < i+4 {\n\t\t\t\td.d.errorf(\"need at least 4 more bytes for unicode sequence\")\n\t\t\t}\n\t\t\tvar j uint\n\t\t\tfor _, c = range cs[i+1 : i+5] { // bounds-check-elimination\n\t\t\t\t// best to use explicit if-else\n\t\t\t\t// - not a table, etc which involve memory loads, array lookup with bounds checks, etc\n\t\t\t\tif c >= '0' && c <= '9' {\n\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk2)\n\t\t\t\t} else if c >= 'a' && c <= 'f' {\n\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk1)\n\t\t\t\t} else if c >= 'A' && c <= 'F' {\n\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk0)\n\t\t\t\t} else {\n\t\t\t\t\tr = unicode.ReplacementChar\n\t\t\t\t\ti += 4\n\t\t\t\t\tgoto encode_rune\n\t\t\t\t}\n\t\t\t}\n\t\t\tr = rune(rr)\n\t\t\ti += 4\n\t\t\tif utf16.IsSurrogate(r) {\n\t\t\t\tif len(cs) >= int(i+6) {\n\t\t\t\t\tvar cx = cs[i+1:][:6:6] // [:6] affords bounds-check-elimination\n\t\t\t\t\tif cx[0] == '\\\\' && cx[1] == 'u' {\n\t\t\t\t\t\ti += 2\n\t\t\t\t\t\tvar rr1 uint32\n\t\t\t\t\t\tfor j = 2; j < 6; j++ {\n\t\t\t\t\t\t\tc = cx[j]\n\t\t\t\t\t\t\tif c >= '0' && c <= '9' {\n\t\t\t\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk2)\n\t\t\t\t\t\t\t} else if c >= 'a' && c <= 'f' {\n\t\t\t\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk1)\n\t\t\t\t\t\t\t} else if c >= 'A' && c <= 'F' {\n\t\t\t\t\t\t\t\trr = rr*16 + uint32(c-jsonU4Chk0)\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tr = unicode.ReplacementChar\n\t\t\t\t\t\t\t\ti += 4\n\t\t\t\t\t\t\t\tgoto encode_rune\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tr = utf16.DecodeRune(r, rune(rr1))\n\t\t\t\t\t\ti += 4\n\t\t\t\t\t\tgoto encode_rune\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tr = unicode.ReplacementChar\n\t\t\t}\n\t\tencode_rune:\n\t\t\tw2 := utf8.EncodeRune(d.bstr[:], r)\n\t\t\tv = append(v, d.bstr[:w2]...)\n\t\tdefault:\n\t\t\td.d.errorf(\"unsupported escaped value: %c\", c)\n\t\t}\n\t\ti++\n\t\tcursor = i\n\t}\n\td.bs = v\n}\n\nfunc (d *jsonDecDriver) nakedNum(z *decNaked, bs []byte) (err error) {\n\tconst cutoff = uint64(1 << uint(64-1))\n\n\tvar n uint64\n\tvar neg, badsyntax, overflow bool\n\n\tif len(bs) == 0 {\n\t\tif d.h.PreferFloat {\n\t\t\tz.v = valueTypeFloat\n\t\t\tz.f = 0\n\t\t} else if d.h.SignedInteger {\n\t\t\tz.v = valueTypeInt\n\t\t\tz.i = 0\n\t\t} else {\n\t\t\tz.v = valueTypeUint\n\t\t\tz.u = 0\n\t\t}\n\t\treturn\n\t}\n\tif d.h.PreferFloat {\n\t\tgoto F\n\t}\n\tn, neg, badsyntax, overflow = jsonParseInteger(bs)\n\tif badsyntax || overflow {\n\t\tgoto F\n\t}\n\tif neg {\n\t\tif n > cutoff {\n\t\t\tgoto F\n\t\t}\n\t\tz.v = valueTypeInt\n\t\tz.i = -(int64(n))\n\t} else if d.h.SignedInteger {\n\t\tif n >= cutoff {\n\t\t\tgoto F\n\t\t}\n\t\tz.v = valueTypeInt\n\t\tz.i = int64(n)\n\t} else {\n\t\tz.v = valueTypeUint\n\t\tz.u = n\n\t}\n\treturn\nF:\n\tz.v = valueTypeFloat\n\tz.f, err = strconv.ParseFloat(stringView(bs), 64)\n\treturn\n}\n\nfunc (d *jsonDecDriver) bsToString() string {\n\t// if x := d.s.sc; x != nil && x.so && x.st == '}' { // map key\n\tif jsonAlwaysReturnInternString || d.d.c == containerMapKey {\n\t\treturn d.d.string(d.bs)\n\t}\n\treturn string(d.bs)\n}\n\nfunc (d *jsonDecDriver) DecodeNaked() {\n\tz := d.d.naked()\n\t// var decodeFurther bool\n\n\tif d.tok == 0 {\n\t\td.tok = d.r.skip(&jsonCharWhitespaceSet)\n\t}\n\tswitch d.tok {\n\tcase 'n':\n\t\td.readLit4Null()\n\t\tz.v = valueTypeNil\n\tcase 'f':\n\t\td.readLit4False()\n\t\tz.v = valueTypeBool\n\t\tz.b = false\n\tcase 't':\n\t\td.readLit4True()\n\t\tz.v = valueTypeBool\n\t\tz.b = true\n\tcase '{':\n\t\tz.v = valueTypeMap // don't consume. kInterfaceNaked will call ReadMapStart\n\tcase '[':\n\t\tz.v = valueTypeArray // don't consume. kInterfaceNaked will call ReadArrayStart\n\tcase '\"':\n\t\t// if a string, and MapKeyAsString, then try to decode it as a nil, bool or number first\n\t\td.appendStringAsBytes()\n\t\tif len(d.bs) > 0 && d.d.c == containerMapKey && d.h.MapKeyAsString {\n\t\t\tswitch stringView(d.bs) {\n\t\t\tcase \"null\":\n\t\t\t\tz.v = valueTypeNil\n\t\t\tcase \"true\":\n\t\t\t\tz.v = valueTypeBool\n\t\t\t\tz.b = true\n\t\t\tcase \"false\":\n\t\t\t\tz.v = valueTypeBool\n\t\t\t\tz.b = false\n\t\t\tdefault:\n\t\t\t\t// check if a number: float, int or uint\n\t\t\t\tif err := d.nakedNum(z, d.bs); err != nil {\n\t\t\t\t\tz.v = valueTypeString\n\t\t\t\t\tz.s = d.bsToString()\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tz.v = valueTypeString\n\t\t\tz.s = d.bsToString()\n\t\t}\n\tdefault: // number\n\t\tbs := d.decNumBytes()\n\t\tif len(bs) == 0 {\n\t\t\td.d.errorf(\"decode number from empty string\")\n\t\t\treturn\n\t\t}\n\t\tif err := d.nakedNum(z, bs); err != nil {\n\t\t\td.d.errorf(\"decode number from %s: %v\", bs, err)\n\t\t\treturn\n\t\t}\n\t}\n\t// if decodeFurther {\n\t// \td.s.sc.retryRead()\n\t// }\n}\n\n//----------------------\n\n// JsonHandle is a handle for JSON encoding format.\n//\n// Json is comprehensively supported:\n// - decodes numbers into interface{} as int, uint or float64\n// based on how the number looks and some config parameters e.g. PreferFloat, SignedInt, etc.\n// - decode integers from float formatted numbers e.g. 1.27e+8\n// - decode any json value (numbers, bool, etc) from quoted strings\n// - configurable way to encode/decode []byte .\n// by default, encodes and decodes []byte using base64 Std Encoding\n// - UTF-8 support for encoding and decoding\n//\n// It has better performance than the json library in the standard library,\n// by leveraging the performance improvements of the codec library.\n//\n// In addition, it doesn't read more bytes than necessary during a decode, which allows\n// reading multiple values from a stream containing json and non-json content.\n// For example, a user can read a json value, then a cbor value, then a msgpack value,\n// all from the same stream in sequence.\n//\n// Note that, when decoding quoted strings, invalid UTF-8 or invalid UTF-16 surrogate pairs are\n// not treated as an error. Instead, they are replaced by the Unicode replacement character U+FFFD.\ntype JsonHandle struct {\n\ttextEncodingType\n\tBasicHandle\n\n\t// Indent indicates how a value is encoded.\n\t// - If positive, indent by that number of spaces.\n\t// - If negative, indent by that number of tabs.\n\tIndent int8\n\n\t// IntegerAsString controls how integers (signed and unsigned) are encoded.\n\t//\n\t// Per the JSON Spec, JSON numbers are 64-bit floating point numbers.\n\t// Consequently, integers > 2^53 cannot be represented as a JSON number without losing precision.\n\t// This can be mitigated by configuring how to encode integers.\n\t//\n\t// IntegerAsString interpretes the following values:\n\t// - if 'L', then encode integers > 2^53 as a json string.\n\t// - if 'A', then encode all integers as a json string\n\t// containing the exact integer representation as a decimal.\n\t// - else encode all integers as a json number (default)\n\tIntegerAsString byte\n\n\t// HTMLCharsAsIs controls how to encode some special characters to html: < > &\n\t//\n\t// By default, we encode them as \\uXXX\n\t// to prevent security holes when served from some browsers.\n\tHTMLCharsAsIs bool\n\n\t// PreferFloat says that we will default to decoding a number as a float.\n\t// If not set, we will examine the characters of the number and decode as an\n\t// integer type if it doesn't have any of the characters [.eE].\n\tPreferFloat bool\n\n\t// TermWhitespace says that we add a whitespace character\n\t// at the end of an encoding.\n\t//\n\t// The whitespace is important, especially if using numbers in a context\n\t// where multiple items are written to a stream.\n\tTermWhitespace bool\n\n\t// MapKeyAsString says to encode all map keys as strings.\n\t//\n\t// Use this to enforce strict json output.\n\t// The only caveat is that nil value is ALWAYS written as null (never as \"null\")\n\tMapKeyAsString bool\n\n\t// _ uint64 // padding (cache line)\n\n\t// Note: below, we store hardly-used items\n\t// e.g. RawBytesExt (which is already cached in the (en|de)cDriver).\n\n\t// RawBytesExt, if configured, is used to encode and decode raw bytes in a custom way.\n\t// If not configured, raw bytes are encoded to/from base64 text.\n\tRawBytesExt InterfaceExt\n\n\t// _ [2]uint64 // padding\n}\n\n// Name returns the name of the handle: json\nfunc (h *JsonHandle) Name() string { return \"json\" }\nfunc (h *JsonHandle) hasElemSeparators() bool { return true }\nfunc (h *JsonHandle) typical() bool {\n\treturn h.Indent == 0 && !h.MapKeyAsString && h.IntegerAsString != 'A' && h.IntegerAsString != 'L'\n}\n\nfunc (h *JsonHandle) recreateEncDriver(ed encDriver) (v bool) {\n\t_, v = ed.(*jsonEncDriverTypical)\n\treturn v != h.typical()\n}\n\n// SetInterfaceExt sets an extension\nfunc (h *JsonHandle) SetInterfaceExt(rt reflect.Type, tag uint64, ext InterfaceExt) (err error) {\n\treturn h.SetExt(rt, tag, &interfaceExtWrapper{InterfaceExt: ext})\n}\n\nfunc (h *JsonHandle) newEncDriver(e *Encoder) (ee encDriver) {\n\tvar hd *jsonEncDriver\n\tif h.typical() {\n\t\tvar v jsonEncDriverTypical\n\t\tee = &v\n\t\thd = &v.jsonEncDriver\n\t} else {\n\t\tvar v jsonEncDriverGeneric\n\t\tee = &v\n\t\thd = &v.jsonEncDriver\n\t}\n\thd.e, hd.h, hd.bs = e, h, hd.b[:0]\n\tee.reset()\n\treturn\n}\n\nfunc (h *JsonHandle) newDecDriver(d *Decoder) decDriver {\n\t// d := jsonDecDriver{r: r.(*bytesDecReader), h: h}\n\thd := jsonDecDriver{d: d, h: h}\n\thd.bs = hd.b[:0]\n\thd.reset()\n\treturn &hd\n}\n\nfunc (e *jsonEncDriver) reset() {\n\te.w = e.e.w()\n\t// (htmlasis && jsonCharSafeSet.isset(b)) || jsonCharHtmlSafeSet.isset(b)\n\tif e.h.HTMLCharsAsIs {\n\t\te.s = &jsonCharSafeSet\n\t} else {\n\t\te.s = &jsonCharHtmlSafeSet\n\t}\n\te.se.InterfaceExt = e.h.RawBytesExt\n\tif e.bs == nil {\n\t\te.bs = e.b[:0]\n\t} else {\n\t\te.bs = e.bs[:0]\n\t}\n}\n\nfunc (d *jsonDecDriver) reset() {\n\td.r = d.d.r()\n\td.se.InterfaceExt = d.h.RawBytesExt\n\tif d.bs != nil {\n\t\td.bs = d.bs[:0]\n\t}\n\td.tok = 0\n\t// d.n.reset()\n}\n\n// jsonFloatStrconvFmtPrec ...\n//\n// ensure that every float has an 'e' or '.' in it,/ for easy differentiation from integers.\n// this is better/faster than checking if encoded value has [e.] and appending if needed.\n\n// func jsonFloatStrconvFmtPrec(f float64, bits32 bool) (fmt byte, prec int) {\n// \tfmt = 'f'\n// \tprec = -1\n// \tvar abs = math.Abs(f)\n// \tif abs == 0 || abs == 1 {\n// \t\tprec = 1\n// \t} else if !bits32 && (abs < 1e-6 || abs >= 1e21) ||\n// \t\tbits32 && (float32(abs) < 1e-6 || float32(abs) >= 1e21) {\n// \t\tfmt = 'e'\n// \t} else if _, frac := math.Modf(abs); frac == 0 {\n// \t\t// ensure that floats have a .0 at the end, for easy identification as floats\n// \t\tprec = 1\n// \t}\n// \treturn\n// }\n\nfunc jsonFloatStrconvFmtPrec64(f float64) (fmt byte, prec int8) {\n\tfmt = 'f'\n\tprec = -1\n\tvar abs = math.Abs(f)\n\tif abs == 0 || abs == 1 {\n\t\tprec = 1\n\t} else if abs < 1e-6 || abs >= 1e21 {\n\t\tfmt = 'e'\n\t} else if noFrac64(abs) { // _, frac := math.Modf(abs); frac == 0 {\n\t\tprec = 1\n\t}\n\treturn\n}\n\nfunc jsonFloatStrconvFmtPrec32(f float32) (fmt byte, prec int8) {\n\tfmt = 'f'\n\tprec = -1\n\tvar abs = abs32(f)\n\tif abs == 0 || abs == 1 {\n\t\tprec = 1\n\t} else if abs < 1e-6 || abs >= 1e21 {\n\t\tfmt = 'e'\n\t} else if noFrac32(abs) { // _, frac := math.Modf(abs); frac == 0 {\n\t\tprec = 1\n\t}\n\treturn\n}\n\n// custom-fitted version of strconv.Parse(Ui|I)nt.\n// Also ensures we don't have to search for .eE to determine if a float or not.\n// Note: s CANNOT be a zero-length slice.\nfunc jsonParseInteger(s []byte) (n uint64, neg, badSyntax, overflow bool) {\n\tconst maxUint64 = (1<<64 - 1)\n\tconst cutoff = maxUint64/10 + 1\n\n\tif len(s) == 0 { // bounds-check-elimination\n\t\t// treat empty string as zero value\n\t\t// badSyntax = true\n\t\treturn\n\t}\n\tswitch s[0] {\n\tcase '+':\n\t\ts = s[1:]\n\tcase '-':\n\t\ts = s[1:]\n\t\tneg = true\n\t}\n\tfor _, c := range s {\n\t\tif c < '0' || c > '9' {\n\t\t\tbadSyntax = true\n\t\t\treturn\n\t\t}\n\t\t// unsigned integers don't overflow well on multiplication, so check cutoff here\n\t\t// e.g. (maxUint64-5)*10 doesn't overflow well ...\n\t\tif n >= cutoff {\n\t\t\toverflow = true\n\t\t\treturn\n\t\t}\n\t\tn *= 10\n\t\tn1 := n + uint64(c-'0')\n\t\tif n1 < n || n1 > maxUint64 {\n\t\t\toverflow = true\n\t\t\treturn\n\t\t}\n\t\tn = n1\n\t}\n\treturn\n}\n\nvar _ decDriverContainerTracker = (*jsonDecDriver)(nil)\nvar _ encDriverContainerTracker = (*jsonEncDriver)(nil)\nvar _ decDriver = (*jsonDecDriver)(nil)\nvar _ encDriver = (*jsonEncDriverGeneric)(nil)\nvar _ encDriver = (*jsonEncDriverTypical)(nil)\nvar _ (interface{ getJsonEncDriver() *jsonEncDriver }) = (*jsonEncDriverTypical)(nil)\nvar _ (interface{ getJsonEncDriver() *jsonEncDriver }) = (*jsonEncDriverGeneric)(nil)\nvar _ (interface{ getJsonEncDriver() *jsonEncDriver }) = (*jsonEncDriver)(nil)\n\n// var _ encDriver = (*jsonEncDriver)(nil)\n" }, { "path": "vendor/github.com/ugorji/go/codec/mammoth-test.go.tmpl", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from mammoth-test.go.tmpl - DO NOT EDIT.\n\npackage codec\n\nimport \"testing\"\nimport \"fmt\"\nimport \"reflect\"\n\n// TestMammoth has all the different paths optimized in fast-path\n// It has all the primitives, slices and maps.\n// \n// For each of those types, it has a pointer and a non-pointer field.\n\nfunc init() { _ = fmt.Printf } // so we can include fmt as needed\n\ntype TestMammoth struct {\n\n{{range .Values }}{{if .Primitive }}{{/*\n*/}}{{ .MethodNamePfx \"F\" true }} {{ .Primitive }}\n{{ .MethodNamePfx \"Fptr\" true }} *{{ .Primitive }}\n{{end}}{{end}}\n\n{{range .Values }}{{if not .Primitive }}{{if not .MapKey }}{{/*\n*/}}{{ .MethodNamePfx \"F\" false }} []{{ .Elem }}\n{{ .MethodNamePfx \"Fptr\" false }} *[]{{ .Elem }}\n{{end}}{{end}}{{end}}\n\n{{range .Values }}{{if not .Primitive }}{{if .MapKey }}{{/*\n*/}}{{ .MethodNamePfx \"F\" false }} map[{{ .MapKey }}]{{ .Elem }}\n{{ .MethodNamePfx \"Fptr\" false }} *map[{{ .MapKey }}]{{ .Elem }}\n{{end}}{{end}}{{end}}\n\n}\n\n{{range .Values }}{{if not .Primitive }}{{if not .MapKey }}{{/*\n*/}} type {{ .MethodNamePfx \"typMbs\" false }} []{{ .Elem }}\nfunc (_ {{ .MethodNamePfx \"typMbs\" false }}) MapBySlice() { }\n{{end}}{{end}}{{end}}\n\n{{range .Values }}{{if not .Primitive }}{{if .MapKey }}{{/*\n*/}} type {{ .MethodNamePfx \"typMap\" false }} map[{{ .MapKey }}]{{ .Elem }}\n{{end}}{{end}}{{end}}\n\nfunc doTestMammothSlices(t *testing.T, h Handle) {\n{{range $i, $e := .Values }}{{if not .Primitive }}{{if not .MapKey }}{{/*\n*/}}\n var v{{$i}}va [8]{{ .Elem }}\n for _, v := range [][]{{ .Elem }}{ nil, {}, { {{ nonzerocmd .Elem }}, {{ zerocmd .Elem }}, {{ zerocmd .Elem }}, {{ nonzerocmd .Elem }} } } { {{/*\n // fmt.Printf(\">>>> running mammoth slice v{{$i}}: %v\\n\", v)\n // - encode value to some []byte\n // - decode into a length-wise-equal []byte\n // - check if equal to initial slice\n // - encode ptr to the value\n // - check if encode bytes are same\n // - decode into ptrs to: nil, then 1-elem slice, equal-length, then large len slice\n // - decode into non-addressable slice of equal length, then larger len \n // - for each decode, compare elem-by-elem to the original slice\n // - \n // - rinse and repeat for a MapBySlice version\n // - \n */}}\n var v{{$i}}v1, v{{$i}}v2 []{{ .Elem }}\n\tv{{$i}}v1 = v\n\tbs{{$i}} := testMarshalErr(v{{$i}}v1, h, t, \"enc-slice-v{{$i}}\")\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make([]{{ .Elem }}, len(v)) }\n\ttestUnmarshalErr(v{{$i}}v2, bs{{$i}}, h, t, \"dec-slice-v{{$i}}\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}\")\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make([]{{ .Elem }}, len(v)) }\n\ttestUnmarshalErr(reflect.ValueOf(v{{$i}}v2), bs{{$i}}, h, t, \"dec-slice-v{{$i}}-noaddr\") // non-addressable value\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}-noaddr\")\n\t// ...\n\tbs{{$i}} = testMarshalErr(&v{{$i}}v1, h, t, \"enc-slice-v{{$i}}-p\")\n\tv{{$i}}v2 = nil\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}-p\")\n\tv{{$i}}va = [8]{{ .Elem }}{} // clear the array\n\tv{{$i}}v2 = v{{$i}}va[:1:1]\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p-1\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}-p-1\")\n\tv{{$i}}va = [8]{{ .Elem }}{} // clear the array\n\tv{{$i}}v2 = v{{$i}}va[:len(v{{$i}}v1):len(v{{$i}}v1)]\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p-len\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}-p-len\")\n\tv{{$i}}va = [8]{{ .Elem }}{} // clear the array\n\tv{{$i}}v2 = v{{$i}}va[:]\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p-cap\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-slice-v{{$i}}-p-cap\")\n\tif len(v{{$i}}v1) > 1 {\n\tv{{$i}}va = [8]{{ .Elem }}{} // clear the array\n\ttestUnmarshalErr((&v{{$i}}va)[:len(v{{$i}}v1)], bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p-len-noaddr\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}va[:len(v{{$i}}v1)], t, \"equal-slice-v{{$i}}-p-len-noaddr\")\n\tv{{$i}}va = [8]{{ .Elem }}{} // clear the array\n\ttestUnmarshalErr((&v{{$i}}va)[:], bs{{$i}}, h, t, \"dec-slice-v{{$i}}-p-cap-noaddr\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}va[:len(v{{$i}}v1)], t, \"equal-slice-v{{$i}}-p-cap-noaddr\")\n }\n // ...\n var v{{$i}}v3, v{{$i}}v4 {{ .MethodNamePfx \"typMbs\" false }}\n\tv{{$i}}v2 = nil\n if v != nil { v{{$i}}v2 = make([]{{ .Elem }}, len(v)) }\n v{{$i}}v3 = {{ .MethodNamePfx \"typMbs\" false }}(v{{$i}}v1)\n v{{$i}}v4 = {{ .MethodNamePfx \"typMbs\" false }}(v{{$i}}v2)\n bs{{$i}} = testMarshalErr(v{{$i}}v3, h, t, \"enc-slice-v{{$i}}-custom\")\n testUnmarshalErr(v{{$i}}v4, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-custom\")\n testDeepEqualErr(v{{$i}}v3, v{{$i}}v4, t, \"equal-slice-v{{$i}}-custom\")\n bs{{$i}} = testMarshalErr(&v{{$i}}v3, h, t, \"enc-slice-v{{$i}}-custom-p\")\n v{{$i}}v2 = nil\n v{{$i}}v4 = {{ .MethodNamePfx \"typMbs\" false }}(v{{$i}}v2)\n testUnmarshalErr(&v{{$i}}v4, bs{{$i}}, h, t, \"dec-slice-v{{$i}}-custom-p\")\n testDeepEqualErr(v{{$i}}v3, v{{$i}}v4, t, \"equal-slice-v{{$i}}-custom-p\")\n }\n{{end}}{{end}}{{end}}\n}\n\nfunc doTestMammothMaps(t *testing.T, h Handle) {\n{{range $i, $e := .Values }}{{if not .Primitive }}{{if .MapKey }}{{/*\n*/}}\n for _, v := range []map[{{ .MapKey }}]{{ .Elem }}{ nil, {}, { {{ nonzerocmd .MapKey }}:{{ zerocmd .Elem }} {{if ne \"bool\" .MapKey}}, {{ nonzerocmd .MapKey }}:{{ nonzerocmd .Elem }} {{end}} } } {\n // fmt.Printf(\">>>> running mammoth map v{{$i}}: %v\\n\", v)\n var v{{$i}}v1, v{{$i}}v2 map[{{ .MapKey }}]{{ .Elem }}\n\tv{{$i}}v1 = v\n\tbs{{$i}} := testMarshalErr(v{{$i}}v1, h, t, \"enc-map-v{{$i}}\")\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make(map[{{ .MapKey }}]{{ .Elem }}, len(v)) } // reset map\n\ttestUnmarshalErr(v{{$i}}v2, bs{{$i}}, h, t, \"dec-map-v{{$i}}\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-map-v{{$i}}\")\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make(map[{{ .MapKey }}]{{ .Elem }}, len(v)) } // reset map\n\ttestUnmarshalErr(reflect.ValueOf(v{{$i}}v2), bs{{$i}}, h, t, \"dec-map-v{{$i}}-noaddr\") // decode into non-addressable map value\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-map-v{{$i}}-noaddr\")\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make(map[{{ .MapKey }}]{{ .Elem }}, len(v)) } // reset map\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-map-v{{$i}}-p-len\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-map-v{{$i}}-p-len\")\n\tbs{{$i}} = testMarshalErr(&v{{$i}}v1, h, t, \"enc-map-v{{$i}}-p\")\n\tv{{$i}}v2 = nil\n\ttestUnmarshalErr(&v{{$i}}v2, bs{{$i}}, h, t, \"dec-map-v{{$i}}-p-nil\")\n\ttestDeepEqualErr(v{{$i}}v1, v{{$i}}v2, t, \"equal-map-v{{$i}}-p-nil\")\n // ...\n\tif v == nil { v{{$i}}v2 = nil } else { v{{$i}}v2 = make(map[{{ .MapKey }}]{{ .Elem }}, len(v)) } // reset map\n var v{{$i}}v3, v{{$i}}v4 {{ .MethodNamePfx \"typMap\" false }}\n\tv{{$i}}v3 = {{ .MethodNamePfx \"typMap\" false }}(v{{$i}}v1)\n\tv{{$i}}v4 = {{ .MethodNamePfx \"typMap\" false }}(v{{$i}}v2)\n bs{{$i}} = testMarshalErr(v{{$i}}v3, h, t, \"enc-map-v{{$i}}-custom\")\n\ttestUnmarshalErr(v{{$i}}v4, bs{{$i}}, h, t, \"dec-map-v{{$i}}-p-len\")\n\ttestDeepEqualErr(v{{$i}}v3, v{{$i}}v4, t, \"equal-map-v{{$i}}-p-len\")\n }\n{{end}}{{end}}{{end}}\n\n}\n\nfunc doTestMammothMapsAndSlices(t *testing.T, h Handle) {\n doTestMammothSlices(t, h)\n doTestMammothMaps(t, h)\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/mammoth2-test.go.tmpl", "content": "// +build !notfastpath\n\n// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from mammoth2-test.go.tmpl - DO NOT EDIT.\n\npackage codec\n\n// Increase codecoverage by covering all the codecgen paths, in fast-path and gen-helper.go....\n//\n// Add:\n// - test file for creating a mammoth generated file as _mammoth_generated.go\n// - generate a second mammoth files in a different file: mammoth2_generated_test.go\n// - mammoth-test.go.tmpl will do this\n// - run codecgen on it, into mammoth2_codecgen_generated_test.go (no build tags)\n// - as part of TestMammoth, run it also\n// - this will cover all the codecgen, gen-helper, etc in one full run\n// - check in mammoth* files into github also\n// - then\n//\n// Now, add some types:\n// - some that implement BinaryMarshal, TextMarshal, JSONMarshal, and one that implements none of it\n// - create a wrapper type that includes TestMammoth2, with it in slices, and maps, and the custom types\n// - this wrapper object is what we work encode/decode (so that the codecgen methods are called)\n\n\n// import \"encoding/binary\"\nimport \"fmt\"\n\ntype TestMammoth2 struct {\n\n{{range .Values }}{{if .Primitive }}{{/*\n*/}}{{ .MethodNamePfx \"F\" true }} {{ .Primitive }}\n{{ .MethodNamePfx \"Fptr\" true }} *{{ .Primitive }}\n{{end}}{{end}}\n\n{{range .Values }}{{if not .Primitive }}{{if not .MapKey }}{{/*\n*/}}{{ .MethodNamePfx \"F\" false }} []{{ .Elem }}\n{{ .MethodNamePfx \"Fptr\" false }} *[]{{ .Elem }}\n{{end}}{{end}}{{end}}\n\n{{range .Values }}{{if not .Primitive }}{{if .MapKey }}{{/*\n*/}}{{ .MethodNamePfx \"F\" false }} map[{{ .MapKey }}]{{ .Elem }}\n{{ .MethodNamePfx \"Fptr\" false }} *map[{{ .MapKey }}]{{ .Elem }}\n{{end}}{{end}}{{end}}\n\n}\n\n// -----------\n\ntype testMammoth2Binary uint64\nfunc (x testMammoth2Binary) MarshalBinary() (data []byte, err error) {\ndata = make([]byte, 8)\nbigen.PutUint64(data, uint64(x))\nreturn\n}\nfunc (x *testMammoth2Binary) UnmarshalBinary(data []byte) (err error) {\n*x = testMammoth2Binary(bigen.Uint64(data))\nreturn\n}\n\ntype testMammoth2Text uint64\nfunc (x testMammoth2Text) MarshalText() (data []byte, err error) {\ndata = []byte(fmt.Sprintf(\"%b\", uint64(x)))\nreturn\n}\nfunc (x *testMammoth2Text) UnmarshalText(data []byte) (err error) {\n_, err = fmt.Sscanf(string(data), \"%b\", (*uint64)(x))\nreturn\n}\n\ntype testMammoth2Json uint64\nfunc (x testMammoth2Json) MarshalJSON() (data []byte, err error) {\ndata = []byte(fmt.Sprintf(\"%v\", uint64(x)))\nreturn\n}\nfunc (x *testMammoth2Json) UnmarshalJSON(data []byte) (err error) {\n_, err = fmt.Sscanf(string(data), \"%v\", (*uint64)(x))\nreturn\n}\n\ntype testMammoth2Basic [4]uint64\n\ntype TestMammoth2Wrapper struct {\n V TestMammoth2\n T testMammoth2Text\n B testMammoth2Binary\n J testMammoth2Json\n C testMammoth2Basic\n M map[testMammoth2Basic]TestMammoth2\n L []TestMammoth2\n A [4]int64\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/msgpack.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n/*\nMSGPACK\n\nMsgpack-c implementation powers the c, c++, python, ruby, etc libraries.\nWe need to maintain compatibility with it and how it encodes integer values\nwithout caring about the type.\n\nFor compatibility with behaviour of msgpack-c reference implementation:\n - Go intX (>0) and uintX\n IS ENCODED AS\n msgpack +ve fixnum, unsigned\n - Go intX (<0)\n IS ENCODED AS\n msgpack -ve fixnum, signed\n*/\n\npackage codec\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"net/rpc\"\n\t\"reflect\"\n\t\"time\"\n)\n\nconst (\n\tmpPosFixNumMin byte = 0x00\n\tmpPosFixNumMax byte = 0x7f\n\tmpFixMapMin byte = 0x80\n\tmpFixMapMax byte = 0x8f\n\tmpFixArrayMin byte = 0x90\n\tmpFixArrayMax byte = 0x9f\n\tmpFixStrMin byte = 0xa0\n\tmpFixStrMax byte = 0xbf\n\tmpNil byte = 0xc0\n\t_ byte = 0xc1\n\tmpFalse byte = 0xc2\n\tmpTrue byte = 0xc3\n\tmpFloat byte = 0xca\n\tmpDouble byte = 0xcb\n\tmpUint8 byte = 0xcc\n\tmpUint16 byte = 0xcd\n\tmpUint32 byte = 0xce\n\tmpUint64 byte = 0xcf\n\tmpInt8 byte = 0xd0\n\tmpInt16 byte = 0xd1\n\tmpInt32 byte = 0xd2\n\tmpInt64 byte = 0xd3\n\n\t// extensions below\n\tmpBin8 byte = 0xc4\n\tmpBin16 byte = 0xc5\n\tmpBin32 byte = 0xc6\n\tmpExt8 byte = 0xc7\n\tmpExt16 byte = 0xc8\n\tmpExt32 byte = 0xc9\n\tmpFixExt1 byte = 0xd4\n\tmpFixExt2 byte = 0xd5\n\tmpFixExt4 byte = 0xd6\n\tmpFixExt8 byte = 0xd7\n\tmpFixExt16 byte = 0xd8\n\n\tmpStr8 byte = 0xd9 // new\n\tmpStr16 byte = 0xda\n\tmpStr32 byte = 0xdb\n\n\tmpArray16 byte = 0xdc\n\tmpArray32 byte = 0xdd\n\n\tmpMap16 byte = 0xde\n\tmpMap32 byte = 0xdf\n\n\tmpNegFixNumMin byte = 0xe0\n\tmpNegFixNumMax byte = 0xff\n)\n\nvar mpTimeExtTag int8 = -1\nvar mpTimeExtTagU = uint8(mpTimeExtTag)\n\n// var mpdesc = map[byte]string{\n// \tmpPosFixNumMin: \"PosFixNumMin\",\n// \tmpPosFixNumMax: \"PosFixNumMax\",\n// \tmpFixMapMin: \"FixMapMin\",\n// \tmpFixMapMax: \"FixMapMax\",\n// \tmpFixArrayMin: \"FixArrayMin\",\n// \tmpFixArrayMax: \"FixArrayMax\",\n// \tmpFixStrMin: \"FixStrMin\",\n// \tmpFixStrMax: \"FixStrMax\",\n// \tmpNil: \"Nil\",\n// \tmpFalse: \"False\",\n// \tmpTrue: \"True\",\n// \tmpFloat: \"Float\",\n// \tmpDouble: \"Double\",\n// \tmpUint8: \"Uint8\",\n// \tmpUint16: \"Uint16\",\n// \tmpUint32: \"Uint32\",\n// \tmpUint64: \"Uint64\",\n// \tmpInt8: \"Int8\",\n// \tmpInt16: \"Int16\",\n// \tmpInt32: \"Int32\",\n// \tmpInt64: \"Int64\",\n// \tmpBin8: \"Bin8\",\n// \tmpBin16: \"Bin16\",\n// \tmpBin32: \"Bin32\",\n// \tmpExt8: \"Ext8\",\n// \tmpExt16: \"Ext16\",\n// \tmpExt32: \"Ext32\",\n// \tmpFixExt1: \"FixExt1\",\n// \tmpFixExt2: \"FixExt2\",\n// \tmpFixExt4: \"FixExt4\",\n// \tmpFixExt8: \"FixExt8\",\n// \tmpFixExt16: \"FixExt16\",\n// \tmpStr8: \"Str8\",\n// \tmpStr16: \"Str16\",\n// \tmpStr32: \"Str32\",\n// \tmpArray16: \"Array16\",\n// \tmpArray32: \"Array32\",\n// \tmpMap16: \"Map16\",\n// \tmpMap32: \"Map32\",\n// \tmpNegFixNumMin: \"NegFixNumMin\",\n// \tmpNegFixNumMax: \"NegFixNumMax\",\n// }\n\nfunc mpdesc(bd byte) string {\n\tswitch bd {\n\tcase mpNil:\n\t\treturn \"nil\"\n\tcase mpFalse:\n\t\treturn \"false\"\n\tcase mpTrue:\n\t\treturn \"true\"\n\tcase mpFloat, mpDouble:\n\t\treturn \"float\"\n\tcase mpUint8, mpUint16, mpUint32, mpUint64:\n\t\treturn \"uint\"\n\tcase mpInt8, mpInt16, mpInt32, mpInt64:\n\t\treturn \"int\"\n\tdefault:\n\t\tswitch {\n\t\tcase bd >= mpPosFixNumMin && bd <= mpPosFixNumMax:\n\t\t\treturn \"int\"\n\t\tcase bd >= mpNegFixNumMin && bd <= mpNegFixNumMax:\n\t\t\treturn \"int\"\n\t\tcase bd == mpStr8, bd == mpStr16, bd == mpStr32, bd >= mpFixStrMin && bd <= mpFixStrMax:\n\t\t\treturn \"string|bytes\"\n\t\tcase bd == mpBin8, bd == mpBin16, bd == mpBin32:\n\t\t\treturn \"bytes\"\n\t\tcase bd == mpArray16, bd == mpArray32, bd >= mpFixArrayMin && bd <= mpFixArrayMax:\n\t\t\treturn \"array\"\n\t\tcase bd == mpMap16, bd == mpMap32, bd >= mpFixMapMin && bd <= mpFixMapMax:\n\t\t\treturn \"map\"\n\t\tcase bd >= mpFixExt1 && bd <= mpFixExt16, bd >= mpExt8 && bd <= mpExt32:\n\t\t\treturn \"ext\"\n\t\tdefault:\n\t\t\treturn \"unknown\"\n\t\t}\n\t}\n}\n\n// MsgpackSpecRpcMultiArgs is a special type which signifies to the MsgpackSpecRpcCodec\n// that the backend RPC service takes multiple arguments, which have been arranged\n// in sequence in the slice.\n//\n// The Codec then passes it AS-IS to the rpc service (without wrapping it in an\n// array of 1 element).\ntype MsgpackSpecRpcMultiArgs []interface{}\n\n// A MsgpackContainer type specifies the different types of msgpackContainers.\ntype msgpackContainerType struct {\n\tfixCutoff uint8\n\tbFixMin, b8, b16, b32 byte\n\t// hasFixMin, has8, has8Always bool\n}\n\nvar (\n\tmsgpackContainerRawLegacy = msgpackContainerType{\n\t\t32, mpFixStrMin, 0, mpStr16, mpStr32,\n\t}\n\tmsgpackContainerStr = msgpackContainerType{\n\t\t32, mpFixStrMin, mpStr8, mpStr16, mpStr32, // true, true, false,\n\t}\n\tmsgpackContainerBin = msgpackContainerType{\n\t\t0, 0, mpBin8, mpBin16, mpBin32, // false, true, true,\n\t}\n\tmsgpackContainerList = msgpackContainerType{\n\t\t16, mpFixArrayMin, 0, mpArray16, mpArray32, // true, false, false,\n\t}\n\tmsgpackContainerMap = msgpackContainerType{\n\t\t16, mpFixMapMin, 0, mpMap16, mpMap32, // true, false, false,\n\t}\n)\n\n//---------------------------------------------\n\ntype msgpackEncDriver struct {\n\tnoBuiltInTypes\n\tencDriverNoopContainerWriter\n\t// encNoSeparator\n\te *Encoder\n\tw *encWriterSwitch\n\th *MsgpackHandle\n\tx [8]byte\n\t// _ [3]uint64 // padding\n}\n\nfunc (e *msgpackEncDriver) EncodeNil() {\n\te.w.writen1(mpNil)\n}\n\nfunc (e *msgpackEncDriver) EncodeInt(i int64) {\n\tif e.h.PositiveIntUnsigned && i >= 0 {\n\t\te.EncodeUint(uint64(i))\n\t} else if i > math.MaxInt8 {\n\t\tif i <= math.MaxInt16 {\n\t\t\te.w.writen1(mpInt16)\n\t\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(i))\n\t\t} else if i <= math.MaxInt32 {\n\t\t\te.w.writen1(mpInt32)\n\t\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(i))\n\t\t} else {\n\t\t\te.w.writen1(mpInt64)\n\t\t\tbigenHelper{e.x[:8], e.w}.writeUint64(uint64(i))\n\t\t}\n\t} else if i >= -32 {\n\t\tif e.h.NoFixedNum {\n\t\t\te.w.writen2(mpInt8, byte(i))\n\t\t} else {\n\t\t\te.w.writen1(byte(i))\n\t\t}\n\t} else if i >= math.MinInt8 {\n\t\te.w.writen2(mpInt8, byte(i))\n\t} else if i >= math.MinInt16 {\n\t\te.w.writen1(mpInt16)\n\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(i))\n\t} else if i >= math.MinInt32 {\n\t\te.w.writen1(mpInt32)\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(i))\n\t} else {\n\t\te.w.writen1(mpInt64)\n\t\tbigenHelper{e.x[:8], e.w}.writeUint64(uint64(i))\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeUint(i uint64) {\n\tif i <= math.MaxInt8 {\n\t\tif e.h.NoFixedNum {\n\t\t\te.w.writen2(mpUint8, byte(i))\n\t\t} else {\n\t\t\te.w.writen1(byte(i))\n\t\t}\n\t} else if i <= math.MaxUint8 {\n\t\te.w.writen2(mpUint8, byte(i))\n\t} else if i <= math.MaxUint16 {\n\t\te.w.writen1(mpUint16)\n\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(i))\n\t} else if i <= math.MaxUint32 {\n\t\te.w.writen1(mpUint32)\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(i))\n\t} else {\n\t\te.w.writen1(mpUint64)\n\t\tbigenHelper{e.x[:8], e.w}.writeUint64(uint64(i))\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeBool(b bool) {\n\tif b {\n\t\te.w.writen1(mpTrue)\n\t} else {\n\t\te.w.writen1(mpFalse)\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeFloat32(f float32) {\n\te.w.writen1(mpFloat)\n\tbigenHelper{e.x[:4], e.w}.writeUint32(math.Float32bits(f))\n}\n\nfunc (e *msgpackEncDriver) EncodeFloat64(f float64) {\n\te.w.writen1(mpDouble)\n\tbigenHelper{e.x[:8], e.w}.writeUint64(math.Float64bits(f))\n}\n\nfunc (e *msgpackEncDriver) EncodeTime(t time.Time) {\n\tif t.IsZero() {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tt = t.UTC()\n\tsec, nsec := t.Unix(), uint64(t.Nanosecond())\n\tvar data64 uint64\n\tvar l = 4\n\tif sec >= 0 && sec>>34 == 0 {\n\t\tdata64 = (nsec << 34) | uint64(sec)\n\t\tif data64&0xffffffff00000000 != 0 {\n\t\t\tl = 8\n\t\t}\n\t} else {\n\t\tl = 12\n\t}\n\tif e.h.WriteExt {\n\t\te.encodeExtPreamble(mpTimeExtTagU, l)\n\t} else {\n\t\te.writeContainerLen(msgpackContainerRawLegacy, l)\n\t}\n\tswitch l {\n\tcase 4:\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(data64))\n\tcase 8:\n\t\tbigenHelper{e.x[:8], e.w}.writeUint64(data64)\n\tcase 12:\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(nsec))\n\t\tbigenHelper{e.x[:8], e.w}.writeUint64(uint64(sec))\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeExt(v interface{}, xtag uint64, ext Ext, _ *Encoder) {\n\tbs := ext.WriteExt(v)\n\tif bs == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tif e.h.WriteExt {\n\t\te.encodeExtPreamble(uint8(xtag), len(bs))\n\t\te.w.writeb(bs)\n\t} else {\n\t\te.EncodeStringBytesRaw(bs)\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeRawExt(re *RawExt, _ *Encoder) {\n\te.encodeExtPreamble(uint8(re.Tag), len(re.Data))\n\te.w.writeb(re.Data)\n}\n\nfunc (e *msgpackEncDriver) encodeExtPreamble(xtag byte, l int) {\n\tif l == 1 {\n\t\te.w.writen2(mpFixExt1, xtag)\n\t} else if l == 2 {\n\t\te.w.writen2(mpFixExt2, xtag)\n\t} else if l == 4 {\n\t\te.w.writen2(mpFixExt4, xtag)\n\t} else if l == 8 {\n\t\te.w.writen2(mpFixExt8, xtag)\n\t} else if l == 16 {\n\t\te.w.writen2(mpFixExt16, xtag)\n\t} else if l < 256 {\n\t\te.w.writen2(mpExt8, byte(l))\n\t\te.w.writen1(xtag)\n\t} else if l < 65536 {\n\t\te.w.writen1(mpExt16)\n\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(l))\n\t\te.w.writen1(xtag)\n\t} else {\n\t\te.w.writen1(mpExt32)\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(l))\n\t\te.w.writen1(xtag)\n\t}\n}\n\nfunc (e *msgpackEncDriver) WriteArrayStart(length int) {\n\te.writeContainerLen(msgpackContainerList, length)\n}\n\nfunc (e *msgpackEncDriver) WriteMapStart(length int) {\n\te.writeContainerLen(msgpackContainerMap, length)\n}\n\nfunc (e *msgpackEncDriver) EncodeStringEnc(c charEncoding, s string) {\n\tslen := len(s)\n\tif e.h.WriteExt {\n\t\te.writeContainerLen(msgpackContainerStr, slen)\n\t} else {\n\t\te.writeContainerLen(msgpackContainerRawLegacy, slen)\n\t}\n\tif slen > 0 {\n\t\te.w.writestr(s)\n\t}\n}\n\nfunc (e *msgpackEncDriver) EncodeStringBytesRaw(bs []byte) {\n\tif bs == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tslen := len(bs)\n\tif e.h.WriteExt {\n\t\te.writeContainerLen(msgpackContainerBin, slen)\n\t} else {\n\t\te.writeContainerLen(msgpackContainerRawLegacy, slen)\n\t}\n\tif slen > 0 {\n\t\te.w.writeb(bs)\n\t}\n}\n\nfunc (e *msgpackEncDriver) writeContainerLen(ct msgpackContainerType, l int) {\n\tif ct.fixCutoff > 0 && l < int(ct.fixCutoff) {\n\t\te.w.writen1(ct.bFixMin | byte(l))\n\t} else if ct.b8 > 0 && l < 256 {\n\t\te.w.writen2(ct.b8, uint8(l))\n\t} else if l < 65536 {\n\t\te.w.writen1(ct.b16)\n\t\tbigenHelper{e.x[:2], e.w}.writeUint16(uint16(l))\n\t} else {\n\t\te.w.writen1(ct.b32)\n\t\tbigenHelper{e.x[:4], e.w}.writeUint32(uint32(l))\n\t}\n}\n\n//---------------------------------------------\n\ntype msgpackDecDriver struct {\n\td *Decoder\n\tr *decReaderSwitch\n\th *MsgpackHandle\n\t// b [scratchByteArrayLen]byte\n\tbd byte\n\tbdRead bool\n\tbr bool // bytes reader\n\tnoBuiltInTypes\n\t// noStreamingCodec\n\t// decNoSeparator\n\tdecDriverNoopContainerReader\n\t// _ [3]uint64 // padding\n}\n\n// Note: This returns either a primitive (int, bool, etc) for non-containers,\n// or a containerType, or a specific type denoting nil or extension.\n// It is called when a nil interface{} is passed, leaving it up to the DecDriver\n// to introspect the stream and decide how best to decode.\n// It deciphers the value by looking at the stream first.\nfunc (d *msgpackDecDriver) DecodeNaked() {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tbd := d.bd\n\tn := d.d.naked()\n\tvar decodeFurther bool\n\n\tswitch bd {\n\tcase mpNil:\n\t\tn.v = valueTypeNil\n\t\td.bdRead = false\n\tcase mpFalse:\n\t\tn.v = valueTypeBool\n\t\tn.b = false\n\tcase mpTrue:\n\t\tn.v = valueTypeBool\n\t\tn.b = true\n\n\tcase mpFloat:\n\t\tn.v = valueTypeFloat\n\t\tn.f = float64(math.Float32frombits(bigen.Uint32(d.r.readx(4))))\n\tcase mpDouble:\n\t\tn.v = valueTypeFloat\n\t\tn.f = math.Float64frombits(bigen.Uint64(d.r.readx(8)))\n\n\tcase mpUint8:\n\t\tn.v = valueTypeUint\n\t\tn.u = uint64(d.r.readn1())\n\tcase mpUint16:\n\t\tn.v = valueTypeUint\n\t\tn.u = uint64(bigen.Uint16(d.r.readx(2)))\n\tcase mpUint32:\n\t\tn.v = valueTypeUint\n\t\tn.u = uint64(bigen.Uint32(d.r.readx(4)))\n\tcase mpUint64:\n\t\tn.v = valueTypeUint\n\t\tn.u = uint64(bigen.Uint64(d.r.readx(8)))\n\n\tcase mpInt8:\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(int8(d.r.readn1()))\n\tcase mpInt16:\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(int16(bigen.Uint16(d.r.readx(2))))\n\tcase mpInt32:\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(int32(bigen.Uint32(d.r.readx(4))))\n\tcase mpInt64:\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(int64(bigen.Uint64(d.r.readx(8))))\n\n\tdefault:\n\t\tswitch {\n\t\tcase bd >= mpPosFixNumMin && bd <= mpPosFixNumMax:\n\t\t\t// positive fixnum (always signed)\n\t\t\tn.v = valueTypeInt\n\t\t\tn.i = int64(int8(bd))\n\t\tcase bd >= mpNegFixNumMin && bd <= mpNegFixNumMax:\n\t\t\t// negative fixnum\n\t\t\tn.v = valueTypeInt\n\t\t\tn.i = int64(int8(bd))\n\t\tcase bd == mpStr8, bd == mpStr16, bd == mpStr32, bd >= mpFixStrMin && bd <= mpFixStrMax:\n\t\t\tif d.h.WriteExt || d.h.RawToString {\n\t\t\t\tn.v = valueTypeString\n\t\t\t\tn.s = d.DecodeString()\n\t\t\t} else {\n\t\t\t\tn.v = valueTypeBytes\n\t\t\t\tn.l = d.DecodeBytes(nil, false)\n\t\t\t}\n\t\tcase bd == mpBin8, bd == mpBin16, bd == mpBin32:\n\t\t\tdecNakedReadRawBytes(d, d.d, n, d.h.RawToString)\n\t\tcase bd == mpArray16, bd == mpArray32, bd >= mpFixArrayMin && bd <= mpFixArrayMax:\n\t\t\tn.v = valueTypeArray\n\t\t\tdecodeFurther = true\n\t\tcase bd == mpMap16, bd == mpMap32, bd >= mpFixMapMin && bd <= mpFixMapMax:\n\t\t\tn.v = valueTypeMap\n\t\t\tdecodeFurther = true\n\t\tcase bd >= mpFixExt1 && bd <= mpFixExt16, bd >= mpExt8 && bd <= mpExt32:\n\t\t\tn.v = valueTypeExt\n\t\t\tclen := d.readExtLen()\n\t\t\tn.u = uint64(d.r.readn1())\n\t\t\tif n.u == uint64(mpTimeExtTagU) {\n\t\t\t\tn.v = valueTypeTime\n\t\t\t\tn.t = d.decodeTime(clen)\n\t\t\t} else if d.br {\n\t\t\t\tn.l = d.r.readx(uint(clen))\n\t\t\t} else {\n\t\t\t\tn.l = decByteSlice(d.r, clen, d.d.h.MaxInitLen, d.d.b[:])\n\t\t\t}\n\t\tdefault:\n\t\t\td.d.errorf(\"cannot infer value: %s: Ox%x/%d/%s\", msgBadDesc, bd, bd, mpdesc(bd))\n\t\t}\n\t}\n\tif !decodeFurther {\n\t\td.bdRead = false\n\t}\n\tif n.v == valueTypeUint && d.h.SignedInteger {\n\t\tn.v = valueTypeInt\n\t\tn.i = int64(n.u)\n\t}\n}\n\n// int can be decoded from msgpack type: intXXX or uintXXX\nfunc (d *msgpackDecDriver) DecodeInt64() (i int64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch d.bd {\n\tcase mpUint8:\n\t\ti = int64(uint64(d.r.readn1()))\n\tcase mpUint16:\n\t\ti = int64(uint64(bigen.Uint16(d.r.readx(2))))\n\tcase mpUint32:\n\t\ti = int64(uint64(bigen.Uint32(d.r.readx(4))))\n\tcase mpUint64:\n\t\ti = int64(bigen.Uint64(d.r.readx(8)))\n\tcase mpInt8:\n\t\ti = int64(int8(d.r.readn1()))\n\tcase mpInt16:\n\t\ti = int64(int16(bigen.Uint16(d.r.readx(2))))\n\tcase mpInt32:\n\t\ti = int64(int32(bigen.Uint32(d.r.readx(4))))\n\tcase mpInt64:\n\t\ti = int64(bigen.Uint64(d.r.readx(8)))\n\tdefault:\n\t\tswitch {\n\t\tcase d.bd >= mpPosFixNumMin && d.bd <= mpPosFixNumMax:\n\t\t\ti = int64(int8(d.bd))\n\t\tcase d.bd >= mpNegFixNumMin && d.bd <= mpNegFixNumMax:\n\t\t\ti = int64(int8(d.bd))\n\t\tdefault:\n\t\t\td.d.errorf(\"cannot decode signed integer: %s: %x/%s\", msgBadDesc, d.bd, mpdesc(d.bd))\n\t\t\treturn\n\t\t}\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// uint can be decoded from msgpack type: intXXX or uintXXX\nfunc (d *msgpackDecDriver) DecodeUint64() (ui uint64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch d.bd {\n\tcase mpUint8:\n\t\tui = uint64(d.r.readn1())\n\tcase mpUint16:\n\t\tui = uint64(bigen.Uint16(d.r.readx(2)))\n\tcase mpUint32:\n\t\tui = uint64(bigen.Uint32(d.r.readx(4)))\n\tcase mpUint64:\n\t\tui = bigen.Uint64(d.r.readx(8))\n\tcase mpInt8:\n\t\tif i := int64(int8(d.r.readn1())); i >= 0 {\n\t\t\tui = uint64(i)\n\t\t} else {\n\t\t\td.d.errorf(\"assigning negative signed value: %v, to unsigned type\", i)\n\t\t\treturn\n\t\t}\n\tcase mpInt16:\n\t\tif i := int64(int16(bigen.Uint16(d.r.readx(2)))); i >= 0 {\n\t\t\tui = uint64(i)\n\t\t} else {\n\t\t\td.d.errorf(\"assigning negative signed value: %v, to unsigned type\", i)\n\t\t\treturn\n\t\t}\n\tcase mpInt32:\n\t\tif i := int64(int32(bigen.Uint32(d.r.readx(4)))); i >= 0 {\n\t\t\tui = uint64(i)\n\t\t} else {\n\t\t\td.d.errorf(\"assigning negative signed value: %v, to unsigned type\", i)\n\t\t\treturn\n\t\t}\n\tcase mpInt64:\n\t\tif i := int64(bigen.Uint64(d.r.readx(8))); i >= 0 {\n\t\t\tui = uint64(i)\n\t\t} else {\n\t\t\td.d.errorf(\"assigning negative signed value: %v, to unsigned type\", i)\n\t\t\treturn\n\t\t}\n\tdefault:\n\t\tswitch {\n\t\tcase d.bd >= mpPosFixNumMin && d.bd <= mpPosFixNumMax:\n\t\t\tui = uint64(d.bd)\n\t\tcase d.bd >= mpNegFixNumMin && d.bd <= mpNegFixNumMax:\n\t\t\td.d.errorf(\"assigning negative signed value: %v, to unsigned type\", int(d.bd))\n\t\t\treturn\n\t\tdefault:\n\t\t\td.d.errorf(\"cannot decode unsigned integer: %s: %x/%s\", msgBadDesc, d.bd, mpdesc(d.bd))\n\t\t\treturn\n\t\t}\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// float can either be decoded from msgpack type: float, double or intX\nfunc (d *msgpackDecDriver) DecodeFloat64() (f float64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == mpFloat {\n\t\tf = float64(math.Float32frombits(bigen.Uint32(d.r.readx(4))))\n\t} else if d.bd == mpDouble {\n\t\tf = math.Float64frombits(bigen.Uint64(d.r.readx(8)))\n\t} else {\n\t\tf = float64(d.DecodeInt64())\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// bool can be decoded from bool, fixnum 0 or 1.\nfunc (d *msgpackDecDriver) DecodeBool() (b bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == mpFalse || d.bd == 0 {\n\t\t// b = false\n\t} else if d.bd == mpTrue || d.bd == 1 {\n\t\tb = true\n\t} else {\n\t\td.d.errorf(\"cannot decode bool: %s: %x/%s\", msgBadDesc, d.bd, mpdesc(d.bd))\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *msgpackDecDriver) DecodeBytes(bs []byte, zerocopy bool) (bsOut []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\n\tbd := d.bd\n\tvar clen int\n\tif bd == mpNil {\n\t\td.bdRead = false\n\t\treturn\n\t} else if bd == mpBin8 || bd == mpBin16 || bd == mpBin32 {\n\t\tclen = d.readContainerLen(msgpackContainerBin) // binary\n\t} else if bd == mpStr8 || bd == mpStr16 || bd == mpStr32 ||\n\t\t(bd >= mpFixStrMin && bd <= mpFixStrMax) {\n\t\tclen = d.readContainerLen(msgpackContainerStr) // string/raw\n\t} else if bd == mpArray16 || bd == mpArray32 ||\n\t\t(bd >= mpFixArrayMin && bd <= mpFixArrayMax) {\n\t\t// check if an \"array\" of uint8's\n\t\tif zerocopy && len(bs) == 0 {\n\t\t\tbs = d.d.b[:]\n\t\t}\n\t\tbsOut, _ = fastpathTV.DecSliceUint8V(bs, true, d.d)\n\t\treturn\n\t} else {\n\t\td.d.errorf(\"invalid byte descriptor for decoding bytes, got: 0x%x\", d.bd)\n\t\treturn\n\t}\n\n\td.bdRead = false\n\tif zerocopy {\n\t\tif d.br {\n\t\t\treturn d.r.readx(uint(clen))\n\t\t} else if len(bs) == 0 {\n\t\t\tbs = d.d.b[:]\n\t\t}\n\t}\n\treturn decByteSlice(d.r, clen, d.h.MaxInitLen, bs)\n}\n\nfunc (d *msgpackDecDriver) DecodeString() (s string) {\n\treturn string(d.DecodeBytes(d.d.b[:], true))\n}\n\nfunc (d *msgpackDecDriver) DecodeStringAsBytes() (s []byte) {\n\treturn d.DecodeBytes(d.d.b[:], true)\n}\n\nfunc (d *msgpackDecDriver) readNextBd() {\n\td.bd = d.r.readn1()\n\td.bdRead = true\n}\n\nfunc (d *msgpackDecDriver) uncacheRead() {\n\tif d.bdRead {\n\t\td.r.unreadn1()\n\t\td.bdRead = false\n\t}\n}\n\nfunc (d *msgpackDecDriver) ContainerType() (vt valueType) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tbd := d.bd\n\t// if bd == mpNil {\n\t// \t// nil\n\t// } else if bd == mpBin8 || bd == mpBin16 || bd == mpBin32 {\n\t// \t// binary\n\t// } else if bd == mpStr8 || bd == mpStr16 || bd == mpStr32 ||\n\t// (bd >= mpFixStrMin && bd <= mpFixStrMax) {\n\t// \t// string/raw\n\t// } else if bd == mpArray16 || bd == mpArray32 ||\n\t// (bd >= mpFixArrayMin && bd <= mpFixArrayMax) {\n\t// \t// array\n\t// } else if bd == mpMap16 || bd == mpMap32 || (bd >= mpFixMapMin && bd <= mpFixMapMax) {\n\t// \t// map\n\t// }\n\tif bd == mpNil {\n\t\treturn valueTypeNil\n\t} else if bd == mpBin8 || bd == mpBin16 || bd == mpBin32 {\n\t\treturn valueTypeBytes\n\t} else if bd == mpStr8 || bd == mpStr16 || bd == mpStr32 ||\n\t\t(bd >= mpFixStrMin && bd <= mpFixStrMax) {\n\t\tif d.h.WriteExt || d.h.RawToString { // UTF-8 string (new spec)\n\t\t\treturn valueTypeString\n\t\t}\n\t\treturn valueTypeBytes // raw (old spec)\n\t} else if bd == mpArray16 || bd == mpArray32 || (bd >= mpFixArrayMin && bd <= mpFixArrayMax) {\n\t\treturn valueTypeArray\n\t} else if bd == mpMap16 || bd == mpMap32 || (bd >= mpFixMapMin && bd <= mpFixMapMax) {\n\t\treturn valueTypeMap\n\t}\n\t// else {\n\t// d.d.errorf(\"isContainerType: unsupported parameter: %v\", vt)\n\t// }\n\treturn valueTypeUnset\n}\n\nfunc (d *msgpackDecDriver) TryDecodeAsNil() (v bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == mpNil {\n\t\td.bdRead = false\n\t\treturn true\n\t}\n\treturn\n}\n\nfunc (d *msgpackDecDriver) readContainerLen(ct msgpackContainerType) (clen int) {\n\tbd := d.bd\n\tif bd == mpNil {\n\t\tclen = -1 // to represent nil\n\t} else if bd == ct.b8 {\n\t\tclen = int(d.r.readn1())\n\t} else if bd == ct.b16 {\n\t\tclen = int(bigen.Uint16(d.r.readx(2)))\n\t} else if bd == ct.b32 {\n\t\tclen = int(bigen.Uint32(d.r.readx(4)))\n\t} else if (ct.bFixMin & bd) == ct.bFixMin {\n\t\tclen = int(ct.bFixMin ^ bd)\n\t} else {\n\t\td.d.errorf(\"cannot read container length: %s: hex: %x, decimal: %d\", msgBadDesc, bd, bd)\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *msgpackDecDriver) ReadMapStart() int {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\treturn d.readContainerLen(msgpackContainerMap)\n}\n\nfunc (d *msgpackDecDriver) ReadArrayStart() int {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\treturn d.readContainerLen(msgpackContainerList)\n}\n\nfunc (d *msgpackDecDriver) readExtLen() (clen int) {\n\tswitch d.bd {\n\tcase mpNil:\n\t\tclen = -1 // to represent nil\n\tcase mpFixExt1:\n\t\tclen = 1\n\tcase mpFixExt2:\n\t\tclen = 2\n\tcase mpFixExt4:\n\t\tclen = 4\n\tcase mpFixExt8:\n\t\tclen = 8\n\tcase mpFixExt16:\n\t\tclen = 16\n\tcase mpExt8:\n\t\tclen = int(d.r.readn1())\n\tcase mpExt16:\n\t\tclen = int(bigen.Uint16(d.r.readx(2)))\n\tcase mpExt32:\n\t\tclen = int(bigen.Uint32(d.r.readx(4)))\n\tdefault:\n\t\td.d.errorf(\"decoding ext bytes: found unexpected byte: %x\", d.bd)\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *msgpackDecDriver) DecodeTime() (t time.Time) {\n\t// decode time from string bytes or ext\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tbd := d.bd\n\tvar clen int\n\tif bd == mpNil {\n\t\td.bdRead = false\n\t\treturn\n\t} else if bd == mpBin8 || bd == mpBin16 || bd == mpBin32 {\n\t\tclen = d.readContainerLen(msgpackContainerBin) // binary\n\t} else if bd == mpStr8 || bd == mpStr16 || bd == mpStr32 ||\n\t\t(bd >= mpFixStrMin && bd <= mpFixStrMax) {\n\t\tclen = d.readContainerLen(msgpackContainerStr) // string/raw\n\t} else {\n\t\t// expect to see mpFixExt4,-1 OR mpFixExt8,-1 OR mpExt8,12,-1\n\t\td.bdRead = false\n\t\tb2 := d.r.readn1()\n\t\tif d.bd == mpFixExt4 && b2 == mpTimeExtTagU {\n\t\t\tclen = 4\n\t\t} else if d.bd == mpFixExt8 && b2 == mpTimeExtTagU {\n\t\t\tclen = 8\n\t\t} else if d.bd == mpExt8 && b2 == 12 && d.r.readn1() == mpTimeExtTagU {\n\t\t\tclen = 12\n\t\t} else {\n\t\t\td.d.errorf(\"invalid stream for decoding time as extension: got 0x%x, 0x%x\", d.bd, b2)\n\t\t\treturn\n\t\t}\n\t}\n\treturn d.decodeTime(clen)\n}\n\nfunc (d *msgpackDecDriver) decodeTime(clen int) (t time.Time) {\n\t// bs = d.r.readx(clen)\n\td.bdRead = false\n\tswitch clen {\n\tcase 4:\n\t\tt = time.Unix(int64(bigen.Uint32(d.r.readx(4))), 0).UTC()\n\tcase 8:\n\t\ttv := bigen.Uint64(d.r.readx(8))\n\t\tt = time.Unix(int64(tv&0x00000003ffffffff), int64(tv>>34)).UTC()\n\tcase 12:\n\t\tnsec := bigen.Uint32(d.r.readx(4))\n\t\tsec := bigen.Uint64(d.r.readx(8))\n\t\tt = time.Unix(int64(sec), int64(nsec)).UTC()\n\tdefault:\n\t\td.d.errorf(\"invalid length of bytes for decoding time - expecting 4 or 8 or 12, got %d\", clen)\n\t\treturn\n\t}\n\treturn\n}\n\nfunc (d *msgpackDecDriver) DecodeExt(rv interface{}, xtag uint64, ext Ext) (realxtag uint64) {\n\tif xtag > 0xff {\n\t\td.d.errorf(\"ext: tag must be <= 0xff; got: %v\", xtag)\n\t\treturn\n\t}\n\trealxtag1, xbs := d.decodeExtV(ext != nil, uint8(xtag))\n\trealxtag = uint64(realxtag1)\n\tif ext == nil {\n\t\tre := rv.(*RawExt)\n\t\tre.Tag = realxtag\n\t\tre.Data = detachZeroCopyBytes(d.br, re.Data, xbs)\n\t} else {\n\t\text.ReadExt(rv, xbs)\n\t}\n\treturn\n}\n\nfunc (d *msgpackDecDriver) decodeExtV(verifyTag bool, tag byte) (xtag byte, xbs []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\txbd := d.bd\n\tif xbd == mpBin8 || xbd == mpBin16 || xbd == mpBin32 {\n\t\txbs = d.DecodeBytes(nil, true)\n\t} else if xbd == mpStr8 || xbd == mpStr16 || xbd == mpStr32 ||\n\t\t(xbd >= mpFixStrMin && xbd <= mpFixStrMax) {\n\t\txbs = d.DecodeStringAsBytes()\n\t} else {\n\t\tclen := d.readExtLen()\n\t\txtag = d.r.readn1()\n\t\tif verifyTag && xtag != tag {\n\t\t\td.d.errorf(\"wrong extension tag - got %b, expecting %v\", xtag, tag)\n\t\t\treturn\n\t\t}\n\t\tif d.br {\n\t\t\txbs = d.r.readx(uint(clen))\n\t\t} else {\n\t\t\txbs = decByteSlice(d.r, clen, d.d.h.MaxInitLen, d.d.b[:])\n\t\t}\n\t}\n\td.bdRead = false\n\treturn\n}\n\n//--------------------------------------------------\n\n//MsgpackHandle is a Handle for the Msgpack Schema-Free Encoding Format.\ntype MsgpackHandle struct {\n\tBasicHandle\n\n\t// NoFixedNum says to output all signed integers as 2-bytes, never as 1-byte fixednum.\n\tNoFixedNum bool\n\n\t// WriteExt controls whether the new spec is honored.\n\t//\n\t// With WriteExt=true, we can encode configured extensions with extension tags\n\t// and encode string/[]byte/extensions in a way compatible with the new spec\n\t// but incompatible with the old spec.\n\t//\n\t// For compatibility with the old spec, set WriteExt=false.\n\t//\n\t// With WriteExt=false:\n\t// configured extensions are serialized as raw bytes (not msgpack extensions).\n\t// reserved byte descriptors like Str8 and those enabling the new msgpack Binary type\n\t// are not encoded.\n\tWriteExt bool\n\n\t// PositiveIntUnsigned says to encode positive integers as unsigned.\n\tPositiveIntUnsigned bool\n\n\tbinaryEncodingType\n\tnoElemSeparators\n\n\t_ [1]uint64 // padding (cache-aligned)\n}\n\n// Name returns the name of the handle: msgpack\nfunc (h *MsgpackHandle) Name() string { return \"msgpack\" }\n\n// SetBytesExt sets an extension\nfunc (h *MsgpackHandle) SetBytesExt(rt reflect.Type, tag uint64, ext BytesExt) (err error) {\n\treturn h.SetExt(rt, tag, &bytesExtWrapper{BytesExt: ext})\n}\n\nfunc (h *MsgpackHandle) newEncDriver(e *Encoder) encDriver {\n\treturn &msgpackEncDriver{e: e, w: e.w(), h: h}\n}\n\nfunc (h *MsgpackHandle) newDecDriver(d *Decoder) decDriver {\n\treturn &msgpackDecDriver{d: d, h: h, r: d.r(), br: d.bytes}\n}\n\nfunc (e *msgpackEncDriver) reset() {\n\te.w = e.e.w()\n}\n\nfunc (d *msgpackDecDriver) reset() {\n\td.r, d.br = d.d.r(), d.d.bytes\n\td.bd, d.bdRead = 0, false\n}\n\n//--------------------------------------------------\n\ntype msgpackSpecRpcCodec struct {\n\trpcCodec\n}\n\n// /////////////// Spec RPC Codec ///////////////////\nfunc (c *msgpackSpecRpcCodec) WriteRequest(r *rpc.Request, body interface{}) error {\n\t// WriteRequest can write to both a Go service, and other services that do\n\t// not abide by the 1 argument rule of a Go service.\n\t// We discriminate based on if the body is a MsgpackSpecRpcMultiArgs\n\tvar bodyArr []interface{}\n\tif m, ok := body.(MsgpackSpecRpcMultiArgs); ok {\n\t\tbodyArr = ([]interface{})(m)\n\t} else {\n\t\tbodyArr = []interface{}{body}\n\t}\n\tr2 := []interface{}{0, uint32(r.Seq), r.ServiceMethod, bodyArr}\n\treturn c.write(r2, nil, false)\n}\n\nfunc (c *msgpackSpecRpcCodec) WriteResponse(r *rpc.Response, body interface{}) error {\n\tvar moe interface{}\n\tif r.Error != \"\" {\n\t\tmoe = r.Error\n\t}\n\tif moe != nil && body != nil {\n\t\tbody = nil\n\t}\n\tr2 := []interface{}{1, uint32(r.Seq), moe, body}\n\treturn c.write(r2, nil, false)\n}\n\nfunc (c *msgpackSpecRpcCodec) ReadResponseHeader(r *rpc.Response) error {\n\treturn c.parseCustomHeader(1, &r.Seq, &r.Error)\n}\n\nfunc (c *msgpackSpecRpcCodec) ReadRequestHeader(r *rpc.Request) error {\n\treturn c.parseCustomHeader(0, &r.Seq, &r.ServiceMethod)\n}\n\nfunc (c *msgpackSpecRpcCodec) ReadRequestBody(body interface{}) error {\n\tif body == nil { // read and discard\n\t\treturn c.read(nil)\n\t}\n\tbodyArr := []interface{}{body}\n\treturn c.read(&bodyArr)\n}\n\nfunc (c *msgpackSpecRpcCodec) parseCustomHeader(expectTypeByte byte, msgid *uint64, methodOrError *string) (err error) {\n\tif cls := c.cls.load(); cls.closed {\n\t\treturn io.EOF\n\t}\n\n\t// We read the response header by hand\n\t// so that the body can be decoded on its own from the stream at a later time.\n\n\tconst fia byte = 0x94 //four item array descriptor value\n\t// Not sure why the panic of EOF is swallowed above.\n\t// if bs1 := c.dec.r.readn1(); bs1 != fia {\n\t// \terr = fmt.Errorf(\"Unexpected value for array descriptor: Expecting %v. Received %v\", fia, bs1)\n\t// \treturn\n\t// }\n\tvar ba [1]byte\n\tvar n int\n\tfor {\n\t\tn, err = c.r.Read(ba[:])\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tif n == 1 {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tvar b = ba[0]\n\tif b != fia {\n\t\terr = fmt.Errorf(\"not array - %s %x/%s\", msgBadDesc, b, mpdesc(b))\n\t} else {\n\t\terr = c.read(&b)\n\t\tif err == nil {\n\t\t\tif b != expectTypeByte {\n\t\t\t\terr = fmt.Errorf(\"%s - expecting %v but got %x/%s\",\n\t\t\t\t\tmsgBadDesc, expectTypeByte, b, mpdesc(b))\n\t\t\t} else {\n\t\t\t\terr = c.read(msgid)\n\t\t\t\tif err == nil {\n\t\t\t\t\terr = c.read(methodOrError)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\n//--------------------------------------------------\n\n// msgpackSpecRpc is the implementation of Rpc that uses custom communication protocol\n// as defined in the msgpack spec at https://github.com/msgpack-rpc/msgpack-rpc/blob/master/spec.md\ntype msgpackSpecRpc struct{}\n\n// MsgpackSpecRpc implements Rpc using the communication protocol defined in\n// the msgpack spec at https://github.com/msgpack-rpc/msgpack-rpc/blob/master/spec.md .\n//\n// See GoRpc documentation, for information on buffering for better performance.\nvar MsgpackSpecRpc msgpackSpecRpc\n\nfunc (x msgpackSpecRpc) ServerCodec(conn io.ReadWriteCloser, h Handle) rpc.ServerCodec {\n\treturn &msgpackSpecRpcCodec{newRPCCodec(conn, h)}\n}\n\nfunc (x msgpackSpecRpc) ClientCodec(conn io.ReadWriteCloser, h Handle) rpc.ClientCodec {\n\treturn &msgpackSpecRpcCodec{newRPCCodec(conn, h)}\n}\n\nvar _ decDriver = (*msgpackDecDriver)(nil)\nvar _ encDriver = (*msgpackEncDriver)(nil)\n" }, { "path": "vendor/github.com/ugorji/go/codec/prebuild.go", "content": "// +build prebuild\n\npackage main\n\nimport (\n\t\"bytes\"\n\t\"go/format\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"strings\"\n\t\"text/template\"\n)\n\nfunc genInternalSortableTypes() []string {\n\treturn []string{\n\t\t\"string\",\n\t\t\"float32\",\n\t\t\"float64\",\n\t\t\"uint\",\n\t\t\"uint8\",\n\t\t\"uint16\",\n\t\t\"uint32\",\n\t\t\"uint64\",\n\t\t\"uintptr\",\n\t\t\"int\",\n\t\t\"int8\",\n\t\t\"int16\",\n\t\t\"int32\",\n\t\t\"int64\",\n\t\t\"bool\",\n\t\t\"time\",\n\t\t\"bytes\",\n\t}\n}\n\nfunc genInternalSortablePlusTypes() []string {\n\treturn []string{\n\t\t\"string\",\n\t\t\"float64\",\n\t\t\"uint64\",\n\t\t\"uintptr\",\n\t\t\"int64\",\n\t\t\"bool\",\n\t\t\"time\",\n\t\t\"bytes\",\n\t}\n}\n\nfunc genTypeForShortName(s string) string {\n\tswitch s {\n\tcase \"time\":\n\t\treturn \"time.Time\"\n\tcase \"bytes\":\n\t\treturn \"[]byte\"\n\t}\n\treturn s\n}\n\nfunc genArgs(args ...interface{}) map[string]interface{} {\n\tm := make(map[string]interface{}, len(args)/2)\n\tfor i := 0; i < len(args); {\n\t\tm[args[i].(string)] = args[i+1]\n\t\ti += 2\n\t}\n\treturn m\n}\n\nfunc genEndsWith(s0 string, sn ...string) bool {\n\tfor _, s := range sn {\n\t\tif strings.HasSuffix(s0, s) {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc chkerr(err error) {\n\tif err != nil {\n\t\tpanic(err)\n\t}\n}\n\nfunc run(fnameIn, fnameOut string) {\n\tvar err error\n\n\tfuncs := make(template.FuncMap)\n\tfuncs[\"sortables\"] = genInternalSortableTypes\n\tfuncs[\"sortablesplus\"] = genInternalSortablePlusTypes\n\tfuncs[\"tshort\"] = genTypeForShortName\n\tfuncs[\"endswith\"] = genEndsWith\n\tfuncs[\"args\"] = genArgs\n\n\tt := template.New(\"\").Funcs(funcs)\n\tfin, err := os.Open(fnameIn)\n\tchkerr(err)\n\tdefer fin.Close()\n\tfout, err := os.Create(fnameOut)\n\tchkerr(err)\n\tdefer fout.Close()\n\ttmplstr, err := ioutil.ReadAll(fin)\n\tchkerr(err)\n\tt, err = t.Parse(string(tmplstr))\n\tchkerr(err)\n\tvar out bytes.Buffer\n\terr = t.Execute(&out, 0)\n\tchkerr(err)\n\tbout, err := format.Source(out.Bytes())\n\tif err != nil {\n\t\tfout.Write(out.Bytes()) // write out if error, so we can still see.\n\t\t// w.Write(bout) // write out if error, as much as possible, so we can still see.\n\t}\n\tchkerr(err)\n\t_, err = fout.Write(bout)\n\tchkerr(err)\n}\n\nfunc main() {\n\trun(\"sort-slice.go.tmpl\", \"sort-slice.generated.go\")\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/rpc.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"bufio\"\n\t\"errors\"\n\t\"io\"\n\t\"net/rpc\"\n)\n\nvar errRpcJsonNeedsTermWhitespace = errors.New(\"rpc requires JsonHandle with TermWhitespace=true\")\n\n// Rpc provides a rpc Server or Client Codec for rpc communication.\ntype Rpc interface {\n\tServerCodec(conn io.ReadWriteCloser, h Handle) rpc.ServerCodec\n\tClientCodec(conn io.ReadWriteCloser, h Handle) rpc.ClientCodec\n}\n\n// RPCOptions holds options specific to rpc functionality\ntype RPCOptions struct {\n\t// RPCNoBuffer configures whether we attempt to buffer reads and writes during RPC calls.\n\t//\n\t// Set RPCNoBuffer=true to turn buffering off.\n\t// Buffering can still be done if buffered connections are passed in, or\n\t// buffering is configured on the handle.\n\tRPCNoBuffer bool\n}\n\n// rpcCodec defines the struct members and common methods.\ntype rpcCodec struct {\n\tc io.Closer\n\tr io.Reader\n\tw io.Writer\n\tf ioFlusher\n\n\tdec *Decoder\n\tenc *Encoder\n\t// bw *bufio.Writer\n\t// br *bufio.Reader\n\th Handle\n\n\tcls atomicClsErr\n}\n\nfunc newRPCCodec(conn io.ReadWriteCloser, h Handle) rpcCodec {\n\t// return newRPCCodec2(bufio.NewReader(conn), bufio.NewWriter(conn), conn, h)\n\treturn newRPCCodec2(conn, conn, conn, h)\n}\n\nfunc newRPCCodec2(r io.Reader, w io.Writer, c io.Closer, h Handle) rpcCodec {\n\t// defensive: ensure that jsonH has TermWhitespace turned on.\n\tif jsonH, ok := h.(*JsonHandle); ok && !jsonH.TermWhitespace {\n\t\tpanic(errRpcJsonNeedsTermWhitespace)\n\t}\n\t// always ensure that we use a flusher, and always flush what was written to the connection.\n\t// we lose nothing by using a buffered writer internally.\n\tf, ok := w.(ioFlusher)\n\tbh := basicHandle(h)\n\tif !bh.RPCNoBuffer {\n\t\tif bh.WriterBufferSize <= 0 {\n\t\t\tif !ok {\n\t\t\t\tbw := bufio.NewWriter(w)\n\t\t\t\tf, w = bw, bw\n\t\t\t}\n\t\t}\n\t\tif bh.ReaderBufferSize <= 0 {\n\t\t\tif _, ok = w.(ioPeeker); !ok {\n\t\t\t\tif _, ok = w.(ioBuffered); !ok {\n\t\t\t\t\tbr := bufio.NewReader(r)\n\t\t\t\t\tr = br\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn rpcCodec{\n\t\tc: c,\n\t\tw: w,\n\t\tr: r,\n\t\tf: f,\n\t\th: h,\n\t\tenc: NewEncoder(w, h),\n\t\tdec: NewDecoder(r, h),\n\t}\n}\n\nfunc (c *rpcCodec) write(obj1, obj2 interface{}, writeObj2 bool) (err error) {\n\tif c.c != nil {\n\t\tcls := c.cls.load()\n\t\tif cls.closed {\n\t\t\treturn cls.errClosed\n\t\t}\n\t}\n\terr = c.enc.Encode(obj1)\n\tif err == nil {\n\t\tif writeObj2 {\n\t\t\terr = c.enc.Encode(obj2)\n\t\t}\n\t\t// if err == nil && c.f != nil {\n\t\t// \terr = c.f.Flush()\n\t\t// }\n\t}\n\tif c.f != nil {\n\t\tif err == nil {\n\t\t\terr = c.f.Flush()\n\t\t} else {\n\t\t\t_ = c.f.Flush() // swallow flush error, so we maintain prior error on write\n\t\t}\n\t}\n\treturn\n}\n\nfunc (c *rpcCodec) swallow(err *error) {\n\tdefer panicToErr(c.dec, err)\n\tc.dec.swallow()\n}\n\nfunc (c *rpcCodec) read(obj interface{}) (err error) {\n\tif c.c != nil {\n\t\tcls := c.cls.load()\n\t\tif cls.closed {\n\t\t\treturn cls.errClosed\n\t\t}\n\t}\n\t//If nil is passed in, we should read and discard\n\tif obj == nil {\n\t\t// var obj2 interface{}\n\t\t// return c.dec.Decode(&obj2)\n\t\tc.swallow(&err)\n\t\treturn\n\t}\n\treturn c.dec.Decode(obj)\n}\n\nfunc (c *rpcCodec) Close() error {\n\tif c.c == nil {\n\t\treturn nil\n\t}\n\tcls := c.cls.load()\n\tif cls.closed {\n\t\treturn cls.errClosed\n\t}\n\tcls.errClosed = c.c.Close()\n\tcls.closed = true\n\tc.cls.store(cls)\n\treturn cls.errClosed\n}\n\nfunc (c *rpcCodec) ReadResponseBody(body interface{}) error {\n\treturn c.read(body)\n}\n\n// -------------------------------------\n\ntype goRpcCodec struct {\n\trpcCodec\n}\n\nfunc (c *goRpcCodec) WriteRequest(r *rpc.Request, body interface{}) error {\n\treturn c.write(r, body, true)\n}\n\nfunc (c *goRpcCodec) WriteResponse(r *rpc.Response, body interface{}) error {\n\treturn c.write(r, body, true)\n}\n\nfunc (c *goRpcCodec) ReadResponseHeader(r *rpc.Response) error {\n\treturn c.read(r)\n}\n\nfunc (c *goRpcCodec) ReadRequestHeader(r *rpc.Request) error {\n\treturn c.read(r)\n}\n\nfunc (c *goRpcCodec) ReadRequestBody(body interface{}) error {\n\treturn c.read(body)\n}\n\n// -------------------------------------\n\n// goRpc is the implementation of Rpc that uses the communication protocol\n// as defined in net/rpc package.\ntype goRpc struct{}\n\n// GoRpc implements Rpc using the communication protocol defined in net/rpc package.\n//\n// Note: network connection (from net.Dial, of type io.ReadWriteCloser) is not buffered.\n//\n// For performance, you should configure WriterBufferSize and ReaderBufferSize on the handle.\n// This ensures we use an adequate buffer during reading and writing.\n// If not configured, we will internally initialize and use a buffer during reads and writes.\n// This can be turned off via the RPCNoBuffer option on the Handle.\n// var handle codec.JsonHandle\n// handle.RPCNoBuffer = true // turns off attempt by rpc module to initialize a buffer\n//\n// Example 1: one way of configuring buffering explicitly:\n// var handle codec.JsonHandle // codec handle\n// handle.ReaderBufferSize = 1024\n// handle.WriterBufferSize = 1024\n// var conn io.ReadWriteCloser // connection got from a socket\n// var serverCodec = GoRpc.ServerCodec(conn, handle)\n// var clientCodec = GoRpc.ClientCodec(conn, handle)\n//\n// Example 2: you can also explicitly create a buffered connection yourself,\n// and not worry about configuring the buffer sizes in the Handle.\n// var handle codec.Handle // codec handle\n// var conn io.ReadWriteCloser // connection got from a socket\n// var bufconn = struct { // bufconn here is a buffered io.ReadWriteCloser\n// io.Closer\n// *bufio.Reader\n// *bufio.Writer\n// }{conn, bufio.NewReader(conn), bufio.NewWriter(conn)}\n// var serverCodec = GoRpc.ServerCodec(bufconn, handle)\n// var clientCodec = GoRpc.ClientCodec(bufconn, handle)\n//\nvar GoRpc goRpc\n\nfunc (x goRpc) ServerCodec(conn io.ReadWriteCloser, h Handle) rpc.ServerCodec {\n\treturn &goRpcCodec{newRPCCodec(conn, h)}\n}\n\nfunc (x goRpc) ClientCodec(conn io.ReadWriteCloser, h Handle) rpc.ClientCodec {\n\treturn &goRpcCodec{newRPCCodec(conn, h)}\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/simple.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\npackage codec\n\nimport (\n\t\"math\"\n\t\"reflect\"\n\t\"time\"\n)\n\nconst (\n\t_ uint8 = iota\n\tsimpleVdNil = 1\n\tsimpleVdFalse = 2\n\tsimpleVdTrue = 3\n\tsimpleVdFloat32 = 4\n\tsimpleVdFloat64 = 5\n\n\t// each lasts for 4 (ie n, n+1, n+2, n+3)\n\tsimpleVdPosInt = 8\n\tsimpleVdNegInt = 12\n\n\tsimpleVdTime = 24\n\n\t// containers: each lasts for 4 (ie n, n+1, n+2, ... n+7)\n\tsimpleVdString = 216\n\tsimpleVdByteArray = 224\n\tsimpleVdArray = 232\n\tsimpleVdMap = 240\n\tsimpleVdExt = 248\n)\n\ntype simpleEncDriver struct {\n\tnoBuiltInTypes\n\tencDriverNoopContainerWriter\n\t// encNoSeparator\n\te *Encoder\n\th *SimpleHandle\n\tw *encWriterSwitch\n\tb [8]byte\n\t// c containerState\n\t// encDriverTrackContainerWriter\n\t_ [2]uint64 // padding (cache-aligned)\n}\n\nfunc (e *simpleEncDriver) EncodeNil() {\n\te.w.writen1(simpleVdNil)\n}\n\nfunc (e *simpleEncDriver) EncodeBool(b bool) {\n\tif e.h.EncZeroValuesAsNil && e.e.c != containerMapKey && !b {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tif b {\n\t\te.w.writen1(simpleVdTrue)\n\t} else {\n\t\te.w.writen1(simpleVdFalse)\n\t}\n}\n\nfunc (e *simpleEncDriver) EncodeFloat32(f float32) {\n\tif e.h.EncZeroValuesAsNil && e.e.c != containerMapKey && f == 0.0 {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.w.writen1(simpleVdFloat32)\n\tbigenHelper{e.b[:4], e.w}.writeUint32(math.Float32bits(f))\n}\n\nfunc (e *simpleEncDriver) EncodeFloat64(f float64) {\n\tif e.h.EncZeroValuesAsNil && e.e.c != containerMapKey && f == 0.0 {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.w.writen1(simpleVdFloat64)\n\tbigenHelper{e.b[:8], e.w}.writeUint64(math.Float64bits(f))\n}\n\nfunc (e *simpleEncDriver) EncodeInt(v int64) {\n\tif v < 0 {\n\t\te.encUint(uint64(-v), simpleVdNegInt)\n\t} else {\n\t\te.encUint(uint64(v), simpleVdPosInt)\n\t}\n}\n\nfunc (e *simpleEncDriver) EncodeUint(v uint64) {\n\te.encUint(v, simpleVdPosInt)\n}\n\nfunc (e *simpleEncDriver) encUint(v uint64, bd uint8) {\n\tif e.h.EncZeroValuesAsNil && e.e.c != containerMapKey && v == 0 {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tif v <= math.MaxUint8 {\n\t\te.w.writen2(bd, uint8(v))\n\t} else if v <= math.MaxUint16 {\n\t\te.w.writen1(bd + 1)\n\t\tbigenHelper{e.b[:2], e.w}.writeUint16(uint16(v))\n\t} else if v <= math.MaxUint32 {\n\t\te.w.writen1(bd + 2)\n\t\tbigenHelper{e.b[:4], e.w}.writeUint32(uint32(v))\n\t} else { // if v <= math.MaxUint64 {\n\t\te.w.writen1(bd + 3)\n\t\tbigenHelper{e.b[:8], e.w}.writeUint64(v)\n\t}\n}\n\nfunc (e *simpleEncDriver) encLen(bd byte, length int) {\n\tif length == 0 {\n\t\te.w.writen1(bd)\n\t} else if length <= math.MaxUint8 {\n\t\te.w.writen1(bd + 1)\n\t\te.w.writen1(uint8(length))\n\t} else if length <= math.MaxUint16 {\n\t\te.w.writen1(bd + 2)\n\t\tbigenHelper{e.b[:2], e.w}.writeUint16(uint16(length))\n\t} else if int64(length) <= math.MaxUint32 {\n\t\te.w.writen1(bd + 3)\n\t\tbigenHelper{e.b[:4], e.w}.writeUint32(uint32(length))\n\t} else {\n\t\te.w.writen1(bd + 4)\n\t\tbigenHelper{e.b[:8], e.w}.writeUint64(uint64(length))\n\t}\n}\n\nfunc (e *simpleEncDriver) EncodeExt(rv interface{}, xtag uint64, ext Ext, _ *Encoder) {\n\tbs := ext.WriteExt(rv)\n\tif bs == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.encodeExtPreamble(uint8(xtag), len(bs))\n\te.w.writeb(bs)\n}\n\nfunc (e *simpleEncDriver) EncodeRawExt(re *RawExt, _ *Encoder) {\n\te.encodeExtPreamble(uint8(re.Tag), len(re.Data))\n\te.w.writeb(re.Data)\n}\n\nfunc (e *simpleEncDriver) encodeExtPreamble(xtag byte, length int) {\n\te.encLen(simpleVdExt, length)\n\te.w.writen1(xtag)\n}\n\nfunc (e *simpleEncDriver) WriteArrayStart(length int) {\n\te.encLen(simpleVdArray, length)\n}\n\nfunc (e *simpleEncDriver) WriteMapStart(length int) {\n\te.encLen(simpleVdMap, length)\n}\n\n// func (e *simpleEncDriver) EncodeSymbol(v string) {\n// \te.EncodeStringEnc(cUTF8, v)\n// }\n\nfunc (e *simpleEncDriver) EncodeStringEnc(c charEncoding, v string) {\n\tif false && e.h.EncZeroValuesAsNil && e.e.c != containerMapKey && v == \"\" {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.encLen(simpleVdString, len(v))\n\te.w.writestr(v)\n}\n\nfunc (e *simpleEncDriver) EncodeStringBytesRaw(v []byte) {\n\t// if e.h.EncZeroValuesAsNil && e.c != containerMapKey && v == nil {\n\tif v == nil {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\te.encLen(simpleVdByteArray, len(v))\n\te.w.writeb(v)\n}\n\nfunc (e *simpleEncDriver) EncodeTime(t time.Time) {\n\t// if e.h.EncZeroValuesAsNil && e.c != containerMapKey && t.IsZero() {\n\tif t.IsZero() {\n\t\te.EncodeNil()\n\t\treturn\n\t}\n\tv, err := t.MarshalBinary()\n\tif err != nil {\n\t\te.e.errorv(err)\n\t\treturn\n\t}\n\t// time.Time marshalbinary takes about 14 bytes.\n\te.w.writen2(simpleVdTime, uint8(len(v)))\n\te.w.writeb(v)\n}\n\n//------------------------------------\n\ntype simpleDecDriver struct {\n\td *Decoder\n\th *SimpleHandle\n\tr *decReaderSwitch\n\tbdRead bool\n\tbd byte\n\tbr bool // a bytes reader?\n\t// c containerState\n\t// b [scratchByteArrayLen]byte\n\tnoBuiltInTypes\n\t// noStreamingCodec\n\tdecDriverNoopContainerReader\n\t// _ [3]uint64 // padding\n}\n\nfunc (d *simpleDecDriver) readNextBd() {\n\td.bd = d.r.readn1()\n\td.bdRead = true\n}\n\nfunc (d *simpleDecDriver) uncacheRead() {\n\tif d.bdRead {\n\t\td.r.unreadn1()\n\t\td.bdRead = false\n\t}\n}\n\nfunc (d *simpleDecDriver) ContainerType() (vt valueType) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch d.bd {\n\tcase simpleVdNil:\n\t\treturn valueTypeNil\n\tcase simpleVdByteArray, simpleVdByteArray + 1,\n\t\tsimpleVdByteArray + 2, simpleVdByteArray + 3, simpleVdByteArray + 4:\n\t\treturn valueTypeBytes\n\tcase simpleVdString, simpleVdString + 1,\n\t\tsimpleVdString + 2, simpleVdString + 3, simpleVdString + 4:\n\t\treturn valueTypeString\n\tcase simpleVdArray, simpleVdArray + 1,\n\t\tsimpleVdArray + 2, simpleVdArray + 3, simpleVdArray + 4:\n\t\treturn valueTypeArray\n\tcase simpleVdMap, simpleVdMap + 1,\n\t\tsimpleVdMap + 2, simpleVdMap + 3, simpleVdMap + 4:\n\t\treturn valueTypeMap\n\t\t// case simpleVdTime:\n\t\t// \treturn valueTypeTime\n\t}\n\t// else {\n\t// d.d.errorf(\"isContainerType: unsupported parameter: %v\", vt)\n\t// }\n\treturn valueTypeUnset\n}\n\nfunc (d *simpleDecDriver) TryDecodeAsNil() bool {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == simpleVdNil {\n\t\td.bdRead = false\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *simpleDecDriver) decCheckInteger() (ui uint64, neg bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch d.bd {\n\tcase simpleVdPosInt:\n\t\tui = uint64(d.r.readn1())\n\tcase simpleVdPosInt + 1:\n\t\tui = uint64(bigen.Uint16(d.r.readx(2)))\n\tcase simpleVdPosInt + 2:\n\t\tui = uint64(bigen.Uint32(d.r.readx(4)))\n\tcase simpleVdPosInt + 3:\n\t\tui = uint64(bigen.Uint64(d.r.readx(8)))\n\tcase simpleVdNegInt:\n\t\tui = uint64(d.r.readn1())\n\t\tneg = true\n\tcase simpleVdNegInt + 1:\n\t\tui = uint64(bigen.Uint16(d.r.readx(2)))\n\t\tneg = true\n\tcase simpleVdNegInt + 2:\n\t\tui = uint64(bigen.Uint32(d.r.readx(4)))\n\t\tneg = true\n\tcase simpleVdNegInt + 3:\n\t\tui = uint64(bigen.Uint64(d.r.readx(8)))\n\t\tneg = true\n\tdefault:\n\t\td.d.errorf(\"integer only valid from pos/neg integer1..8. Invalid descriptor: %v\", d.bd)\n\t\treturn\n\t}\n\t// don't do this check, because callers may only want the unsigned value.\n\t// if ui > math.MaxInt64 {\n\t// \td.d.errorf(\"decIntAny: Integer out of range for signed int64: %v\", ui)\n\t//\t\treturn\n\t// }\n\treturn\n}\n\nfunc (d *simpleDecDriver) DecodeInt64() (i int64) {\n\tui, neg := d.decCheckInteger()\n\ti = chkOvf.SignedIntV(ui)\n\tif neg {\n\t\ti = -i\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *simpleDecDriver) DecodeUint64() (ui uint64) {\n\tui, neg := d.decCheckInteger()\n\tif neg {\n\t\td.d.errorf(\"assigning negative signed value to unsigned type\")\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *simpleDecDriver) DecodeFloat64() (f float64) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == simpleVdFloat32 {\n\t\tf = float64(math.Float32frombits(bigen.Uint32(d.r.readx(4))))\n\t} else if d.bd == simpleVdFloat64 {\n\t\tf = math.Float64frombits(bigen.Uint64(d.r.readx(8)))\n\t} else {\n\t\tif d.bd >= simpleVdPosInt && d.bd <= simpleVdNegInt+3 {\n\t\t\tf = float64(d.DecodeInt64())\n\t\t} else {\n\t\t\td.d.errorf(\"float only valid from float32/64: Invalid descriptor: %v\", d.bd)\n\t\t\treturn\n\t\t}\n\t}\n\td.bdRead = false\n\treturn\n}\n\n// bool can be decoded from bool only (single byte).\nfunc (d *simpleDecDriver) DecodeBool() (b bool) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == simpleVdTrue {\n\t\tb = true\n\t} else if d.bd == simpleVdFalse {\n\t} else {\n\t\td.d.errorf(\"cannot decode bool - %s: %x\", msgBadDesc, d.bd)\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *simpleDecDriver) ReadMapStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\td.bdRead = false\n\treturn d.decLen()\n}\n\nfunc (d *simpleDecDriver) ReadArrayStart() (length int) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\td.bdRead = false\n\treturn d.decLen()\n}\n\nfunc (d *simpleDecDriver) decLen() int {\n\tswitch d.bd % 8 {\n\tcase 0:\n\t\treturn 0\n\tcase 1:\n\t\treturn int(d.r.readn1())\n\tcase 2:\n\t\treturn int(bigen.Uint16(d.r.readx(2)))\n\tcase 3:\n\t\tui := uint64(bigen.Uint32(d.r.readx(4)))\n\t\tif chkOvf.Uint(ui, intBitsize) {\n\t\t\td.d.errorf(\"overflow integer: %v\", ui)\n\t\t\treturn 0\n\t\t}\n\t\treturn int(ui)\n\tcase 4:\n\t\tui := bigen.Uint64(d.r.readx(8))\n\t\tif chkOvf.Uint(ui, intBitsize) {\n\t\t\td.d.errorf(\"overflow integer: %v\", ui)\n\t\t\treturn 0\n\t\t}\n\t\treturn int(ui)\n\t}\n\td.d.errorf(\"cannot read length: bd%%8 must be in range 0..4. Got: %d\", d.bd%8)\n\treturn -1\n}\n\nfunc (d *simpleDecDriver) DecodeString() (s string) {\n\treturn string(d.DecodeBytes(d.d.b[:], true))\n}\n\nfunc (d *simpleDecDriver) DecodeStringAsBytes() (s []byte) {\n\treturn d.DecodeBytes(d.d.b[:], true)\n}\n\nfunc (d *simpleDecDriver) DecodeBytes(bs []byte, zerocopy bool) (bsOut []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == simpleVdNil {\n\t\td.bdRead = false\n\t\treturn\n\t}\n\t// check if an \"array\" of uint8's (see ContainerType for how to infer if an array)\n\tif d.bd >= simpleVdArray && d.bd <= simpleVdMap+4 {\n\t\tif len(bs) == 0 && zerocopy {\n\t\t\tbs = d.d.b[:]\n\t\t}\n\t\tbsOut, _ = fastpathTV.DecSliceUint8V(bs, true, d.d)\n\t\treturn\n\t}\n\n\tclen := d.decLen()\n\td.bdRead = false\n\tif zerocopy {\n\t\tif d.br {\n\t\t\treturn d.r.readx(uint(clen))\n\t\t} else if len(bs) == 0 {\n\t\t\tbs = d.d.b[:]\n\t\t}\n\t}\n\treturn decByteSlice(d.r, clen, d.d.h.MaxInitLen, bs)\n}\n\nfunc (d *simpleDecDriver) DecodeTime() (t time.Time) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tif d.bd == simpleVdNil {\n\t\td.bdRead = false\n\t\treturn\n\t}\n\tif d.bd != simpleVdTime {\n\t\td.d.errorf(\"invalid descriptor for time.Time - expect 0x%x, received 0x%x\", simpleVdTime, d.bd)\n\t\treturn\n\t}\n\td.bdRead = false\n\tclen := int(d.r.readn1())\n\tb := d.r.readx(uint(clen))\n\tif err := (&t).UnmarshalBinary(b); err != nil {\n\t\td.d.errorv(err)\n\t}\n\treturn\n}\n\nfunc (d *simpleDecDriver) DecodeExt(rv interface{}, xtag uint64, ext Ext) (realxtag uint64) {\n\tif xtag > 0xff {\n\t\td.d.errorf(\"ext: tag must be <= 0xff; got: %v\", xtag)\n\t\treturn\n\t}\n\trealxtag1, xbs := d.decodeExtV(ext != nil, uint8(xtag))\n\trealxtag = uint64(realxtag1)\n\tif ext == nil {\n\t\tre := rv.(*RawExt)\n\t\tre.Tag = realxtag\n\t\tre.Data = detachZeroCopyBytes(d.br, re.Data, xbs)\n\t} else {\n\t\text.ReadExt(rv, xbs)\n\t}\n\treturn\n}\n\nfunc (d *simpleDecDriver) decodeExtV(verifyTag bool, tag byte) (xtag byte, xbs []byte) {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\tswitch d.bd {\n\tcase simpleVdExt, simpleVdExt + 1, simpleVdExt + 2, simpleVdExt + 3, simpleVdExt + 4:\n\t\tl := d.decLen()\n\t\txtag = d.r.readn1()\n\t\tif verifyTag && xtag != tag {\n\t\t\td.d.errorf(\"wrong extension tag. Got %b. Expecting: %v\", xtag, tag)\n\t\t\treturn\n\t\t}\n\t\tif d.br {\n\t\t\txbs = d.r.readx(uint(l))\n\t\t} else {\n\t\t\txbs = decByteSlice(d.r, l, d.d.h.MaxInitLen, d.d.b[:])\n\t\t}\n\tcase simpleVdByteArray, simpleVdByteArray + 1,\n\t\tsimpleVdByteArray + 2, simpleVdByteArray + 3, simpleVdByteArray + 4:\n\t\txbs = d.DecodeBytes(nil, true)\n\tdefault:\n\t\td.d.errorf(\"ext - %s - expecting extensions/bytearray, got: 0x%x\", msgBadDesc, d.bd)\n\t\treturn\n\t}\n\td.bdRead = false\n\treturn\n}\n\nfunc (d *simpleDecDriver) DecodeNaked() {\n\tif !d.bdRead {\n\t\td.readNextBd()\n\t}\n\n\tn := d.d.naked()\n\tvar decodeFurther bool\n\n\tswitch d.bd {\n\tcase simpleVdNil:\n\t\tn.v = valueTypeNil\n\tcase simpleVdFalse:\n\t\tn.v = valueTypeBool\n\t\tn.b = false\n\tcase simpleVdTrue:\n\t\tn.v = valueTypeBool\n\t\tn.b = true\n\tcase simpleVdPosInt, simpleVdPosInt + 1, simpleVdPosInt + 2, simpleVdPosInt + 3:\n\t\tif d.h.SignedInteger {\n\t\t\tn.v = valueTypeInt\n\t\t\tn.i = d.DecodeInt64()\n\t\t} else {\n\t\t\tn.v = valueTypeUint\n\t\t\tn.u = d.DecodeUint64()\n\t\t}\n\tcase simpleVdNegInt, simpleVdNegInt + 1, simpleVdNegInt + 2, simpleVdNegInt + 3:\n\t\tn.v = valueTypeInt\n\t\tn.i = d.DecodeInt64()\n\tcase simpleVdFloat32:\n\t\tn.v = valueTypeFloat\n\t\tn.f = d.DecodeFloat64()\n\tcase simpleVdFloat64:\n\t\tn.v = valueTypeFloat\n\t\tn.f = d.DecodeFloat64()\n\tcase simpleVdTime:\n\t\tn.v = valueTypeTime\n\t\tn.t = d.DecodeTime()\n\tcase simpleVdString, simpleVdString + 1,\n\t\tsimpleVdString + 2, simpleVdString + 3, simpleVdString + 4:\n\t\tn.v = valueTypeString\n\t\tn.s = d.DecodeString()\n\tcase simpleVdByteArray, simpleVdByteArray + 1,\n\t\tsimpleVdByteArray + 2, simpleVdByteArray + 3, simpleVdByteArray + 4:\n\t\tdecNakedReadRawBytes(d, d.d, n, d.h.RawToString)\n\tcase simpleVdExt, simpleVdExt + 1, simpleVdExt + 2, simpleVdExt + 3, simpleVdExt + 4:\n\t\tn.v = valueTypeExt\n\t\tl := d.decLen()\n\t\tn.u = uint64(d.r.readn1())\n\t\tif d.br {\n\t\t\tn.l = d.r.readx(uint(l))\n\t\t} else {\n\t\t\tn.l = decByteSlice(d.r, l, d.d.h.MaxInitLen, d.d.b[:])\n\t\t}\n\tcase simpleVdArray, simpleVdArray + 1, simpleVdArray + 2,\n\t\tsimpleVdArray + 3, simpleVdArray + 4:\n\t\tn.v = valueTypeArray\n\t\tdecodeFurther = true\n\tcase simpleVdMap, simpleVdMap + 1, simpleVdMap + 2, simpleVdMap + 3, simpleVdMap + 4:\n\t\tn.v = valueTypeMap\n\t\tdecodeFurther = true\n\tdefault:\n\t\td.d.errorf(\"cannot infer value - %s 0x%x\", msgBadDesc, d.bd)\n\t}\n\n\tif !decodeFurther {\n\t\td.bdRead = false\n\t}\n}\n\n//------------------------------------\n\n// SimpleHandle is a Handle for a very simple encoding format.\n//\n// simple is a simplistic codec similar to binc, but not as compact.\n// - Encoding of a value is always preceded by the descriptor byte (bd)\n// - True, false, nil are encoded fully in 1 byte (the descriptor)\n// - Integers (intXXX, uintXXX) are encoded in 1, 2, 4 or 8 bytes (plus a descriptor byte).\n// There are positive (uintXXX and intXXX >= 0) and negative (intXXX < 0) integers.\n// - Floats are encoded in 4 or 8 bytes (plus a descriptor byte)\n// - Length of containers (strings, bytes, array, map, extensions)\n// are encoded in 0, 1, 2, 4 or 8 bytes.\n// Zero-length containers have no length encoded.\n// For others, the number of bytes is given by pow(2, bd%3)\n// - maps are encoded as [bd] [length] [[key][value]]...\n// - arrays are encoded as [bd] [length] [value]...\n// - extensions are encoded as [bd] [length] [tag] [byte]...\n// - strings/bytearrays are encoded as [bd] [length] [byte]...\n// - time.Time are encoded as [bd] [length] [byte]...\n//\n// The full spec will be published soon.\ntype SimpleHandle struct {\n\tBasicHandle\n\tbinaryEncodingType\n\tnoElemSeparators\n\t// EncZeroValuesAsNil says to encode zero values for numbers, bool, string, etc as nil\n\tEncZeroValuesAsNil bool\n\n\t_ [1]uint64 // padding (cache-aligned)\n}\n\n// Name returns the name of the handle: simple\nfunc (h *SimpleHandle) Name() string { return \"simple\" }\n\n// SetBytesExt sets an extension\nfunc (h *SimpleHandle) SetBytesExt(rt reflect.Type, tag uint64, ext BytesExt) (err error) {\n\treturn h.SetExt(rt, tag, &bytesExtWrapper{BytesExt: ext})\n}\n\n// func (h *SimpleHandle) hasElemSeparators() bool { return true } // as it implements Write(Map|Array)XXX\n\nfunc (h *SimpleHandle) newEncDriver(e *Encoder) encDriver {\n\treturn &simpleEncDriver{e: e, w: e.w(), h: h}\n}\n\nfunc (h *SimpleHandle) newDecDriver(d *Decoder) decDriver {\n\treturn &simpleDecDriver{d: d, h: h, r: d.r(), br: d.bytes}\n}\n\nfunc (e *simpleEncDriver) reset() {\n\te.w = e.e.w()\n}\n\nfunc (d *simpleDecDriver) reset() {\n\td.r, d.br = d.d.r(), d.d.bytes\n\td.bd, d.bdRead = 0, false\n}\n\nvar _ decDriver = (*simpleDecDriver)(nil)\nvar _ encDriver = (*simpleEncDriver)(nil)\n" }, { "path": "vendor/github.com/ugorji/go/codec/sort-slice.generated.go", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from sort-slice.go.tmpl - DO NOT EDIT.\n\npackage codec\n\nimport \"time\"\nimport \"reflect\"\nimport \"bytes\"\n\ntype stringSlice []string\n\nfunc (p stringSlice) Len() int { return len(p) }\nfunc (p stringSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p stringSlice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype float32Slice []float32\n\nfunc (p float32Slice) Len() int { return len(p) }\nfunc (p float32Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p float32Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)] || isNaN32(p[uint(i)]) && !isNaN32(p[uint(j)])\n}\n\ntype float64Slice []float64\n\nfunc (p float64Slice) Len() int { return len(p) }\nfunc (p float64Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p float64Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)] || isNaN64(p[uint(i)]) && !isNaN64(p[uint(j)])\n}\n\ntype uintSlice []uint\n\nfunc (p uintSlice) Len() int { return len(p) }\nfunc (p uintSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uintSlice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype uint8Slice []uint8\n\nfunc (p uint8Slice) Len() int { return len(p) }\nfunc (p uint8Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint8Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype uint16Slice []uint16\n\nfunc (p uint16Slice) Len() int { return len(p) }\nfunc (p uint16Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint16Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype uint32Slice []uint32\n\nfunc (p uint32Slice) Len() int { return len(p) }\nfunc (p uint32Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint32Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype uint64Slice []uint64\n\nfunc (p uint64Slice) Len() int { return len(p) }\nfunc (p uint64Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint64Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype uintptrSlice []uintptr\n\nfunc (p uintptrSlice) Len() int { return len(p) }\nfunc (p uintptrSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uintptrSlice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype intSlice []int\n\nfunc (p intSlice) Len() int { return len(p) }\nfunc (p intSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p intSlice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype int8Slice []int8\n\nfunc (p int8Slice) Len() int { return len(p) }\nfunc (p int8Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int8Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype int16Slice []int16\n\nfunc (p int16Slice) Len() int { return len(p) }\nfunc (p int16Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int16Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype int32Slice []int32\n\nfunc (p int32Slice) Len() int { return len(p) }\nfunc (p int32Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int32Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype int64Slice []int64\n\nfunc (p int64Slice) Len() int { return len(p) }\nfunc (p int64Slice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int64Slice) Less(i, j int) bool {\n\treturn p[uint(i)] < p[uint(j)]\n}\n\ntype boolSlice []bool\n\nfunc (p boolSlice) Len() int { return len(p) }\nfunc (p boolSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p boolSlice) Less(i, j int) bool {\n\treturn !p[uint(i)] && p[uint(j)]\n}\n\ntype timeSlice []time.Time\n\nfunc (p timeSlice) Len() int { return len(p) }\nfunc (p timeSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p timeSlice) Less(i, j int) bool {\n\treturn p[uint(i)].Before(p[uint(j)])\n}\n\ntype bytesSlice [][]byte\n\nfunc (p bytesSlice) Len() int { return len(p) }\nfunc (p bytesSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p bytesSlice) Less(i, j int) bool {\n\treturn bytes.Compare(p[uint(i)], p[uint(j)]) == -1\n}\n\ntype stringRv struct {\n\tv string\n\tr reflect.Value\n}\ntype stringRvSlice []stringRv\n\nfunc (p stringRvSlice) Len() int { return len(p) }\nfunc (p stringRvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p stringRvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype stringIntf struct {\n\tv string\n\ti interface{}\n}\ntype stringIntfSlice []stringIntf\n\nfunc (p stringIntfSlice) Len() int { return len(p) }\nfunc (p stringIntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p stringIntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype float64Rv struct {\n\tv float64\n\tr reflect.Value\n}\ntype float64RvSlice []float64Rv\n\nfunc (p float64RvSlice) Len() int { return len(p) }\nfunc (p float64RvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p float64RvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v || isNaN64(p[uint(i)].v) && !isNaN64(p[uint(j)].v)\n}\n\ntype float64Intf struct {\n\tv float64\n\ti interface{}\n}\ntype float64IntfSlice []float64Intf\n\nfunc (p float64IntfSlice) Len() int { return len(p) }\nfunc (p float64IntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p float64IntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v || isNaN64(p[uint(i)].v) && !isNaN64(p[uint(j)].v)\n}\n\ntype uint64Rv struct {\n\tv uint64\n\tr reflect.Value\n}\ntype uint64RvSlice []uint64Rv\n\nfunc (p uint64RvSlice) Len() int { return len(p) }\nfunc (p uint64RvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint64RvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype uint64Intf struct {\n\tv uint64\n\ti interface{}\n}\ntype uint64IntfSlice []uint64Intf\n\nfunc (p uint64IntfSlice) Len() int { return len(p) }\nfunc (p uint64IntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uint64IntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype uintptrRv struct {\n\tv uintptr\n\tr reflect.Value\n}\ntype uintptrRvSlice []uintptrRv\n\nfunc (p uintptrRvSlice) Len() int { return len(p) }\nfunc (p uintptrRvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uintptrRvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype uintptrIntf struct {\n\tv uintptr\n\ti interface{}\n}\ntype uintptrIntfSlice []uintptrIntf\n\nfunc (p uintptrIntfSlice) Len() int { return len(p) }\nfunc (p uintptrIntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p uintptrIntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype int64Rv struct {\n\tv int64\n\tr reflect.Value\n}\ntype int64RvSlice []int64Rv\n\nfunc (p int64RvSlice) Len() int { return len(p) }\nfunc (p int64RvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int64RvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype int64Intf struct {\n\tv int64\n\ti interface{}\n}\ntype int64IntfSlice []int64Intf\n\nfunc (p int64IntfSlice) Len() int { return len(p) }\nfunc (p int64IntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p int64IntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v < p[uint(j)].v\n}\n\ntype boolRv struct {\n\tv bool\n\tr reflect.Value\n}\ntype boolRvSlice []boolRv\n\nfunc (p boolRvSlice) Len() int { return len(p) }\nfunc (p boolRvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p boolRvSlice) Less(i, j int) bool {\n\treturn !p[uint(i)].v && p[uint(j)].v\n}\n\ntype boolIntf struct {\n\tv bool\n\ti interface{}\n}\ntype boolIntfSlice []boolIntf\n\nfunc (p boolIntfSlice) Len() int { return len(p) }\nfunc (p boolIntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p boolIntfSlice) Less(i, j int) bool {\n\treturn !p[uint(i)].v && p[uint(j)].v\n}\n\ntype timeRv struct {\n\tv time.Time\n\tr reflect.Value\n}\ntype timeRvSlice []timeRv\n\nfunc (p timeRvSlice) Len() int { return len(p) }\nfunc (p timeRvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p timeRvSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v.Before(p[uint(j)].v)\n}\n\ntype timeIntf struct {\n\tv time.Time\n\ti interface{}\n}\ntype timeIntfSlice []timeIntf\n\nfunc (p timeIntfSlice) Len() int { return len(p) }\nfunc (p timeIntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p timeIntfSlice) Less(i, j int) bool {\n\treturn p[uint(i)].v.Before(p[uint(j)].v)\n}\n\ntype bytesRv struct {\n\tv []byte\n\tr reflect.Value\n}\ntype bytesRvSlice []bytesRv\n\nfunc (p bytesRvSlice) Len() int { return len(p) }\nfunc (p bytesRvSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p bytesRvSlice) Less(i, j int) bool {\n\treturn bytes.Compare(p[uint(i)].v, p[uint(j)].v) == -1\n}\n\ntype bytesIntf struct {\n\tv []byte\n\ti interface{}\n}\ntype bytesIntfSlice []bytesIntf\n\nfunc (p bytesIntfSlice) Len() int { return len(p) }\nfunc (p bytesIntfSlice) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p bytesIntfSlice) Less(i, j int) bool {\n\treturn bytes.Compare(p[uint(i)].v, p[uint(j)].v) == -1\n}\n" }, { "path": "vendor/github.com/ugorji/go/codec/sort-slice.go.tmpl", "content": "// Copyright (c) 2012-2018 Ugorji Nwoke. All rights reserved.\n// Use of this source code is governed by a MIT license found in the LICENSE file.\n\n// Code generated from sort-slice.go.tmpl - DO NOT EDIT.\n\n{{/*\nxxxSlice\nxxxIntf\nxxxIntfSlice\nxxxRv\nxxxRvSlice\n\nI'm not going to create them for\n- sortables\n- sortablesplus\n\nWith the parameters passed in sortables or sortablesplus,\n'time, 'bytes' are special, and correspond to time.Time and []byte respectively.\n*/}}\n\npackage codec\n\nimport \"time\"\nimport \"reflect\"\nimport \"bytes\"\n\n{{/* func init() { _ = time.Unix } */}}\n\n{{define \"T\"}}\nfunc (p {{ .Type }}) Len() int { return len(p) }\nfunc (p {{ .Type }}) Swap(i, j int) { p[uint(i)], p[uint(j)] = p[uint(j)], p[uint(i)] }\nfunc (p {{ .Type }}) Less(i, j int) bool {\n\t{{ if eq .Kind \"bool\" }} return !p[uint(i)]{{.V}} && p[uint(j)]{{.V}}\n {{ else if eq .Kind \"float32\" }} return p[uint(i)]{{.V}} < p[uint(j)]{{.V}} || isNaN32(p[uint(i)]{{.V}}) && !isNaN32(p[uint(j)]{{.V}})\n {{ else if eq .Kind \"float64\" }} return p[uint(i)]{{.V}} < p[uint(j)]{{.V}} || isNaN64(p[uint(i)]{{.V}}) && !isNaN64(p[uint(j)]{{.V}})\n {{ else if eq .Kind \"time\" }} return p[uint(i)]{{.V}}.Before(p[uint(j)]{{.V}})\n {{ else if eq .Kind \"bytes\" }} return bytes.Compare(p[uint(i)]{{.V}}, p[uint(j)]{{.V}}) == -1\n {{ else }} return p[uint(i)]{{.V}} < p[uint(j)]{{.V}}\n {{ end -}}\n}\n{{end}}\n\n{{range $i, $v := sortables }}{{ $t := tshort $v }}\ntype {{ $v }}Slice []{{ $t }}\n{{template \"T\" args \"Kind\" $v \"Type\" (print $v \"Slice\") \"V\" \"\"}}\n{{end}}\n\n{{range $i, $v := sortablesplus }}{{ $t := tshort $v }}\n\ntype {{ $v }}Rv struct {\n\tv {{ $t }}\n\tr reflect.Value\n}\ntype {{ $v }}RvSlice []{{ $v }}Rv\n{{template \"T\" args \"Kind\" $v \"Type\" (print $v \"RvSlice\") \"V\" \".v\"}}\n\ntype {{ $v }}Intf struct {\n\tv {{ $t }}\n\ti interface{}\n}\ntype {{ $v }}IntfSlice []{{ $v }}Intf\n{{template \"T\" args \"Kind\" $v \"Type\" (print $v \"IntfSlice\") \"V\" \".v\"}}\n\n{{end}}\n" }, { "path": "vendor/github.com/ugorji/go/codec/test-cbor-goldens.json", "content": "[\n {\n \"cbor\": \"AA==\",\n \"hex\": \"00\",\n \"roundtrip\": true,\n \"decoded\": 0\n },\n {\n \"cbor\": \"AQ==\",\n \"hex\": \"01\",\n \"roundtrip\": true,\n \"decoded\": 1\n },\n {\n \"cbor\": \"Cg==\",\n \"hex\": \"0a\",\n \"roundtrip\": true,\n \"decoded\": 10\n },\n {\n \"cbor\": \"Fw==\",\n \"hex\": \"17\",\n \"roundtrip\": true,\n \"decoded\": 23\n },\n {\n \"cbor\": \"GBg=\",\n \"hex\": \"1818\",\n \"roundtrip\": true,\n \"decoded\": 24\n },\n {\n \"cbor\": \"GBk=\",\n \"hex\": \"1819\",\n \"roundtrip\": true,\n \"decoded\": 25\n },\n {\n \"cbor\": \"GGQ=\",\n \"hex\": \"1864\",\n \"roundtrip\": true,\n \"decoded\": 100\n },\n {\n \"cbor\": \"GQPo\",\n \"hex\": \"1903e8\",\n \"roundtrip\": true,\n \"decoded\": 1000\n },\n {\n \"cbor\": \"GgAPQkA=\",\n \"hex\": \"1a000f4240\",\n \"roundtrip\": true,\n \"decoded\": 1000000\n },\n {\n \"cbor\": \"GwAAAOjUpRAA\",\n \"hex\": \"1b000000e8d4a51000\",\n \"roundtrip\": true,\n \"decoded\": 1000000000000\n },\n {\n \"cbor\": \"G///////////\",\n \"hex\": \"1bffffffffffffffff\",\n \"roundtrip\": true,\n \"decoded\": 18446744073709551615\n },\n {\n \"cbor\": \"wkkBAAAAAAAAAAA=\",\n \"hex\": \"c249010000000000000000\",\n \"roundtrip\": true,\n \"decoded\": 18446744073709551616\n },\n {\n \"cbor\": \"O///////////\",\n \"hex\": \"3bffffffffffffffff\",\n \"roundtrip\": true,\n \"decoded\": -18446744073709551616,\n \"skip\": true\n },\n {\n \"cbor\": \"w0kBAAAAAAAAAAA=\",\n \"hex\": \"c349010000000000000000\",\n \"roundtrip\": true,\n \"decoded\": -18446744073709551617\n },\n {\n \"cbor\": \"IA==\",\n \"hex\": \"20\",\n \"roundtrip\": true,\n \"decoded\": -1\n },\n {\n \"cbor\": \"KQ==\",\n \"hex\": \"29\",\n \"roundtrip\": true,\n \"decoded\": -10\n },\n {\n \"cbor\": \"OGM=\",\n \"hex\": \"3863\",\n \"roundtrip\": true,\n \"decoded\": -100\n },\n {\n \"cbor\": \"OQPn\",\n \"hex\": \"3903e7\",\n \"roundtrip\": true,\n \"decoded\": -1000\n },\n {\n \"cbor\": \"+QAA\",\n \"hex\": \"f90000\",\n \"roundtrip\": true,\n \"decoded\": 0.0\n },\n {\n \"cbor\": \"+YAA\",\n \"hex\": \"f98000\",\n \"roundtrip\": true,\n \"decoded\": -0.0\n },\n {\n \"cbor\": \"+TwA\",\n \"hex\": \"f93c00\",\n \"roundtrip\": true,\n \"decoded\": 1.0\n },\n {\n \"cbor\": \"+z/xmZmZmZma\",\n \"hex\": \"fb3ff199999999999a\",\n \"roundtrip\": true,\n \"decoded\": 1.1\n },\n {\n \"cbor\": \"+T4A\",\n \"hex\": \"f93e00\",\n \"roundtrip\": true,\n \"decoded\": 1.5\n },\n {\n \"cbor\": \"+Xv/\",\n \"hex\": \"f97bff\",\n \"roundtrip\": true,\n \"decoded\": 65504.0\n },\n {\n \"cbor\": \"+kfDUAA=\",\n \"hex\": \"fa47c35000\",\n \"roundtrip\": true,\n \"decoded\": 100000.0\n },\n {\n \"cbor\": \"+n9///8=\",\n \"hex\": \"fa7f7fffff\",\n \"roundtrip\": true,\n \"decoded\": 3.4028234663852886e+38\n },\n {\n \"cbor\": \"+3435DyIAHWc\",\n \"hex\": \"fb7e37e43c8800759c\",\n \"roundtrip\": true,\n \"decoded\": 1.0e+300\n },\n {\n \"cbor\": \"+QAB\",\n \"hex\": \"f90001\",\n \"roundtrip\": true,\n \"decoded\": 5.960464477539063e-08\n },\n {\n \"cbor\": \"+QQA\",\n \"hex\": \"f90400\",\n \"roundtrip\": true,\n \"decoded\": 6.103515625e-05\n },\n {\n \"cbor\": \"+cQA\",\n \"hex\": \"f9c400\",\n \"roundtrip\": true,\n \"decoded\": -4.0\n },\n {\n \"cbor\": \"+8AQZmZmZmZm\",\n \"hex\": \"fbc010666666666666\",\n \"roundtrip\": true,\n \"decoded\": -4.1\n },\n {\n \"cbor\": \"+XwA\",\n \"hex\": \"f97c00\",\n \"roundtrip\": true,\n \"diagnostic\": \"Infinity\"\n },\n {\n \"cbor\": \"+X4A\",\n \"hex\": \"f97e00\",\n \"roundtrip\": true,\n \"diagnostic\": \"NaN\"\n },\n {\n \"cbor\": \"+fwA\",\n \"hex\": \"f9fc00\",\n \"roundtrip\": true,\n \"diagnostic\": \"-Infinity\"\n },\n {\n \"cbor\": \"+n+AAAA=\",\n \"hex\": \"fa7f800000\",\n \"roundtrip\": false,\n \"diagnostic\": \"Infinity\"\n },\n {\n \"cbor\": \"+n/AAAA=\",\n \"hex\": \"fa7fc00000\",\n \"roundtrip\": false,\n \"diagnostic\": \"NaN\"\n },\n {\n \"cbor\": \"+v+AAAA=\",\n \"hex\": \"faff800000\",\n \"roundtrip\": false,\n \"diagnostic\": \"-Infinity\"\n },\n {\n \"cbor\": \"+3/wAAAAAAAA\",\n \"hex\": \"fb7ff0000000000000\",\n \"roundtrip\": false,\n \"diagnostic\": \"Infinity\"\n },\n {\n \"cbor\": \"+3/4AAAAAAAA\",\n \"hex\": \"fb7ff8000000000000\",\n \"roundtrip\": false,\n \"diagnostic\": \"NaN\"\n },\n {\n \"cbor\": \"+//wAAAAAAAA\",\n \"hex\": \"fbfff0000000000000\",\n \"roundtrip\": false,\n \"diagnostic\": \"-Infinity\"\n },\n {\n \"cbor\": \"9A==\",\n \"hex\": \"f4\",\n \"roundtrip\": true,\n \"decoded\": false\n },\n {\n \"cbor\": \"9Q==\",\n \"hex\": \"f5\",\n \"roundtrip\": true,\n \"decoded\": true\n },\n {\n \"cbor\": \"9g==\",\n \"hex\": \"f6\",\n \"roundtrip\": true,\n \"decoded\": null\n },\n {\n \"cbor\": \"9w==\",\n \"hex\": \"f7\",\n \"roundtrip\": true,\n \"diagnostic\": \"undefined\"\n },\n {\n \"cbor\": \"8A==\",\n \"hex\": \"f0\",\n \"roundtrip\": true,\n \"diagnostic\": \"simple(16)\"\n },\n {\n \"cbor\": \"+Bg=\",\n \"hex\": \"f818\",\n \"roundtrip\": true,\n \"diagnostic\": \"simple(24)\"\n },\n {\n \"cbor\": \"+P8=\",\n \"hex\": \"f8ff\",\n \"roundtrip\": true,\n \"diagnostic\": \"simple(255)\"\n },\n {\n \"cbor\": \"wHQyMDEzLTAzLTIxVDIwOjA0OjAwWg==\",\n \"hex\": \"c074323031332d30332d32315432303a30343a30305a\",\n \"roundtrip\": true,\n \"diagnostic\": \"0(\\\"2013-03-21T20:04:00Z\\\")\"\n },\n {\n \"cbor\": \"wRpRS2ew\",\n \"hex\": \"c11a514b67b0\",\n \"roundtrip\": true,\n \"diagnostic\": \"1(1363896240)\"\n },\n {\n \"cbor\": \"wftB1FLZ7CAAAA==\",\n \"hex\": \"c1fb41d452d9ec200000\",\n \"roundtrip\": true,\n \"diagnostic\": \"1(1363896240.5)\"\n },\n {\n \"cbor\": \"10QBAgME\",\n \"hex\": \"d74401020304\",\n \"roundtrip\": true,\n \"diagnostic\": \"23(h'01020304')\"\n },\n {\n \"cbor\": \"2BhFZElFVEY=\",\n \"hex\": \"d818456449455446\",\n \"roundtrip\": true,\n \"diagnostic\": \"24(h'6449455446')\"\n },\n {\n \"cbor\": \"2CB2aHR0cDovL3d3dy5leGFtcGxlLmNvbQ==\",\n \"hex\": \"d82076687474703a2f2f7777772e6578616d706c652e636f6d\",\n \"roundtrip\": true,\n \"diagnostic\": \"32(\\\"http://www.example.com\\\")\"\n },\n {\n \"cbor\": \"QA==\",\n \"hex\": \"40\",\n \"roundtrip\": true,\n \"diagnostic\": \"h''\"\n },\n {\n \"cbor\": \"RAECAwQ=\",\n \"hex\": \"4401020304\",\n \"roundtrip\": true,\n \"diagnostic\": \"h'01020304'\"\n },\n {\n \"cbor\": \"YA==\",\n \"hex\": \"60\",\n \"roundtrip\": true,\n \"decoded\": \"\"\n },\n {\n \"cbor\": \"YWE=\",\n \"hex\": \"6161\",\n \"roundtrip\": true,\n \"decoded\": \"a\"\n },\n {\n \"cbor\": \"ZElFVEY=\",\n \"hex\": \"6449455446\",\n \"roundtrip\": true,\n \"decoded\": \"IETF\"\n },\n {\n \"cbor\": \"YiJc\",\n \"hex\": \"62225c\",\n \"roundtrip\": true,\n \"decoded\": \"\\\"\\\\\"\n },\n {\n \"cbor\": \"YsO8\",\n \"hex\": \"62c3bc\",\n \"roundtrip\": true,\n \"decoded\": \"ü\"\n },\n {\n \"cbor\": \"Y+awtA==\",\n \"hex\": \"63e6b0b4\",\n \"roundtrip\": true,\n \"decoded\": \"水\"\n },\n {\n \"cbor\": \"ZPCQhZE=\",\n \"hex\": \"64f0908591\",\n \"roundtrip\": true,\n \"decoded\": \"𐅑\"\n },\n {\n \"cbor\": \"gA==\",\n \"hex\": \"80\",\n \"roundtrip\": true,\n \"decoded\": [\n\n ]\n },\n {\n \"cbor\": \"gwECAw==\",\n \"hex\": \"83010203\",\n \"roundtrip\": true,\n \"decoded\": [\n 1,\n 2,\n 3\n ]\n },\n {\n \"cbor\": \"gwGCAgOCBAU=\",\n \"hex\": \"8301820203820405\",\n \"roundtrip\": true,\n \"decoded\": [\n 1,\n [\n 2,\n 3\n ],\n [\n 4,\n 5\n ]\n ]\n },\n {\n \"cbor\": \"mBkBAgMEBQYHCAkKCwwNDg8QERITFBUWFxgYGBk=\",\n \"hex\": \"98190102030405060708090a0b0c0d0e0f101112131415161718181819\",\n \"roundtrip\": true,\n \"decoded\": [\n 1,\n 2,\n 3,\n 4,\n 5,\n 6,\n 7,\n 8,\n 9,\n 10,\n 11,\n 12,\n 13,\n 14,\n 15,\n 16,\n 17,\n 18,\n 19,\n 20,\n 21,\n 22,\n 23,\n 24,\n 25\n ]\n },\n {\n \"cbor\": \"oA==\",\n \"hex\": \"a0\",\n \"roundtrip\": true,\n \"decoded\": {\n }\n },\n {\n \"cbor\": \"ogECAwQ=\",\n \"hex\": \"a201020304\",\n \"roundtrip\": true,\n \"skip\": true,\n \"diagnostic\": \"{1: 2, 3: 4}\"\n },\n {\n \"cbor\": \"omFhAWFiggID\",\n \"hex\": \"a26161016162820203\",\n \"roundtrip\": true,\n \"decoded\": {\n \"a\": 1,\n \"b\": [\n 2,\n 3\n ]\n }\n },\n {\n \"cbor\": \"gmFhoWFiYWM=\",\n \"hex\": \"826161a161626163\",\n \"roundtrip\": true,\n \"decoded\": [\n \"a\",\n {\n \"b\": \"c\"\n }\n ]\n },\n {\n \"cbor\": \"pWFhYUFhYmFCYWNhQ2FkYURhZWFF\",\n \"hex\": \"a56161614161626142616361436164614461656145\",\n \"roundtrip\": true,\n \"decoded\": {\n \"a\": \"A\",\n \"b\": \"B\",\n \"c\": \"C\",\n \"d\": \"D\",\n \"e\": \"E\"\n }\n },\n {\n \"cbor\": \"X0IBAkMDBAX/\",\n \"hex\": \"5f42010243030405ff\",\n \"roundtrip\": false,\n \"skip\": true,\n \"diagnostic\": \"(_ h'0102', h'030405')\"\n },\n {\n \"cbor\": \"f2VzdHJlYWRtaW5n/w==\",\n \"hex\": \"7f657374726561646d696e67ff\",\n \"roundtrip\": false,\n \"decoded\": \"streaming\"\n },\n {\n \"cbor\": \"n/8=\",\n \"hex\": \"9fff\",\n \"roundtrip\": false,\n \"decoded\": [\n\n ]\n },\n {\n \"cbor\": \"nwGCAgOfBAX//w==\",\n \"hex\": \"9f018202039f0405ffff\",\n \"roundtrip\": false,\n \"decoded\": [\n 1,\n [\n 2,\n 3\n ],\n [\n 4,\n 5\n ]\n ]\n },\n {\n \"cbor\": \"nwGCAgOCBAX/\",\n \"hex\": \"9f01820203820405ff\",\n \"roundtrip\": false,\n \"decoded\": [\n 1,\n [\n 2,\n 3\n ],\n [\n 4,\n 5\n ]\n ]\n },\n {\n \"cbor\": \"gwGCAgOfBAX/\",\n \"hex\": \"83018202039f0405ff\",\n \"roundtrip\": false,\n \"decoded\": [\n 1,\n [\n 2,\n 3\n ],\n [\n 4,\n 5\n ]\n ]\n },\n {\n \"cbor\": \"gwGfAgP/ggQF\",\n \"hex\": \"83019f0203ff820405\",\n \"roundtrip\": false,\n \"decoded\": [\n 1,\n [\n 2,\n 3\n ],\n [\n 4,\n 5\n ]\n ]\n },\n {\n \"cbor\": \"nwECAwQFBgcICQoLDA0ODxAREhMUFRYXGBgYGf8=\",\n \"hex\": \"9f0102030405060708090a0b0c0d0e0f101112131415161718181819ff\",\n \"roundtrip\": false,\n \"decoded\": [\n 1,\n 2,\n 3,\n 4,\n 5,\n 6,\n 7,\n 8,\n 9,\n 10,\n 11,\n 12,\n 13,\n 14,\n 15,\n 16,\n 17,\n 18,\n 19,\n 20,\n 21,\n 22,\n 23,\n 24,\n 25\n ]\n },\n {\n \"cbor\": \"v2FhAWFinwID//8=\",\n \"hex\": \"bf61610161629f0203ffff\",\n \"roundtrip\": false,\n \"decoded\": {\n \"a\": 1,\n \"b\": [\n 2,\n 3\n ]\n }\n },\n {\n \"cbor\": \"gmFhv2FiYWP/\",\n \"hex\": \"826161bf61626163ff\",\n \"roundtrip\": false,\n \"decoded\": [\n \"a\",\n {\n \"b\": \"c\"\n }\n ]\n },\n {\n \"cbor\": \"v2NGdW71Y0FtdCH/\",\n \"hex\": \"bf6346756ef563416d7421ff\",\n \"roundtrip\": false,\n \"decoded\": {\n \"Fun\": true,\n \"Amt\": -2\n }\n }\n]\n" }, { "path": "vendor/github.com/ugorji/go/codec/test.py", "content": "#!/usr/bin/env python\n\n# This will create golden files in a directory passed to it.\n# A Test calls this internally to create the golden files\n# So it can process them (so we don't have to checkin the files).\n\n# Ensure msgpack-python and cbor are installed first, using:\n# sudo apt-get install python-dev\n# sudo apt-get install python-pip\n# pip install --user msgpack-python msgpack-rpc-python cbor\n\n# Ensure all \"string\" keys are utf strings (else encoded as bytes)\n\nimport cbor, msgpack, msgpackrpc, sys, os, threading\n\ndef get_test_data_list():\n # get list with all primitive types, and a combo type\n l0 = [ \n -8,\n -1616,\n -32323232,\n -6464646464646464,\n 192,\n 1616,\n 32323232,\n 6464646464646464,\n 192,\n -3232.0,\n -6464646464.0,\n 3232.0,\n 6464.0,\n 6464646464.0,\n False,\n True,\n u\"null\",\n None,\n u\"some&day>some 0\n if stopTimeSec > 0:\n def myStopRpcServer():\n server.stop()\n t = threading.Timer(stopTimeSec, myStopRpcServer)\n t.start()\n server.start()\n\ndef doRpcClientToPythonSvc(port):\n address = msgpackrpc.Address('127.0.0.1', port)\n client = msgpackrpc.Client(address, unpack_encoding='utf-8')\n print client.call(\"Echo123\", \"A1\", \"B2\", \"C3\")\n print client.call(\"EchoStruct\", {\"A\" :\"Aa\", \"B\":\"Bb\", \"C\":\"Cc\"})\n \ndef doRpcClientToGoSvc(port):\n # print \">>>> port: \", port, \" <<<<<\"\n address = msgpackrpc.Address('127.0.0.1', port)\n client = msgpackrpc.Client(address, unpack_encoding='utf-8')\n print client.call(\"TestRpcInt.Echo123\", [\"A1\", \"B2\", \"C3\"])\n print client.call(\"TestRpcInt.EchoStruct\", {\"A\" :\"Aa\", \"B\":\"Bb\", \"C\":\"Cc\"})\n\ndef doMain(args):\n if len(args) == 2 and args[0] == \"testdata\":\n build_test_data(args[1])\n elif len(args) == 3 and args[0] == \"rpc-server\":\n doRpcServer(int(args[1]), int(args[2]))\n elif len(args) == 2 and args[0] == \"rpc-client-python-service\":\n doRpcClientToPythonSvc(int(args[1]))\n elif len(args) == 2 and args[0] == \"rpc-client-go-service\":\n doRpcClientToGoSvc(int(args[1]))\n else:\n print(\"Usage: test.py \" + \n \"[testdata|rpc-server|rpc-client-python-service|rpc-client-go-service] ...\")\n \nif __name__ == \"__main__\":\n doMain(sys.argv[1:])\n\n" }, { "path": "vendor/github.com/unknwon/com/go.mod", "content": "module github.com/unknwon/com\n\nrequire (\n\tgithub.com/gopherjs/gopherjs v0.0.0-20181103185306-d547d1d9531e // indirect\n\tgithub.com/jtolds/gls v4.2.1+incompatible // indirect\n\tgithub.com/smartystreets/assertions v0.0.0-20190116191733-b6c0e53d7304 // indirect\n\tgithub.com/smartystreets/goconvey v0.0.0-20181108003508-044398e4856c\n)\n" }, { "path": "vendor/github.com/unknwon/com/go.sum", "content": "github.com/gopherjs/gopherjs v0.0.0-20181103185306-d547d1d9531e h1:JKmoR8x90Iww1ks85zJ1lfDGgIiMDuIptTOhJq+zKyg=\ngithub.com/gopherjs/gopherjs v0.0.0-20181103185306-d547d1d9531e/go.mod h1:wJfORRmW1u3UXTncJ5qlYoELFm8eSnnEO6hX4iZ3EWY=\ngithub.com/jtolds/gls v4.2.1+incompatible h1:fSuqC+Gmlu6l/ZYAoZzx2pyucC8Xza35fpRVWLVmUEE=\ngithub.com/jtolds/gls v4.2.1+incompatible/go.mod h1:QJZ7F/aHp+rZTRtaJ1ow/lLfFfVYBRgL+9YlvaHOwJU=\ngithub.com/smartystreets/assertions v0.0.0-20190116191733-b6c0e53d7304 h1:Jpy1PXuP99tXNrhbq2BaPz9B+jNAvH1JPQQpG/9GCXY=\ngithub.com/smartystreets/assertions v0.0.0-20190116191733-b6c0e53d7304/go.mod h1:OnSkiWE9lh6wB0YB77sQom3nweQdgAjqCqsofrRNTgc=\ngithub.com/smartystreets/goconvey v0.0.0-20181108003508-044398e4856c h1:Ho+uVpkel/udgjbwB5Lktg9BtvJSh2DT0Hi6LPSyI2w=\ngithub.com/smartystreets/goconvey v0.0.0-20181108003508-044398e4856c/go.mod h1:XDJAKZRPZ1CvBcN2aX5YOUTYGHki24fSF0Iv48Ibg0s=\n" }, { "path": "vendor/golang.org/x/image/AUTHORS", "content": "# This source code refers to The Go Authors for copyright purposes.\n# The master list of authors is in the main Go distribution,\n# visible at http://tip.golang.org/AUTHORS.\n" }, { "path": "vendor/golang.org/x/image/CONTRIBUTORS", "content": "# This source code was written by the Go contributors.\n# The master list of contributors is in the main Go distribution,\n# visible at http://tip.golang.org/CONTRIBUTORS.\n" }, { "path": "vendor/golang.org/x/image/LICENSE", "content": "Copyright (c) 2009 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/golang.org/x/image/PATENTS", "content": "Additional IP Rights Grant (Patents)\n\n\"This implementation\" means the copyrightable works distributed by\nGoogle as part of the Go project.\n\nGoogle hereby grants to You a perpetual, worldwide, non-exclusive,\nno-charge, royalty-free, irrevocable (except as stated in this section)\npatent license to make, have made, use, offer to sell, sell, import,\ntransfer and otherwise run, modify and propagate the contents of this\nimplementation of Go, where such license applies only to those patent\nclaims, both currently owned or controlled by Google and acquired in\nthe future, licensable by Google that are necessarily infringed by this\nimplementation of Go. This grant does not include claims that would be\ninfringed only as a consequence of further modification of this\nimplementation. If you or your agent or exclusive licensee institute or\norder or agree to the institution of patent litigation against any\nentity (including a cross-claim or counterclaim in a lawsuit) alleging\nthat this implementation of Go or any code incorporated within this\nimplementation of Go constitutes direct or contributory patent\ninfringement, or inducement of patent infringement, then any patent\nrights granted to you under this License for this implementation of Go\nshall terminate as of the date such litigation is filed.\n" }, { "path": "vendor/golang.org/x/image/font/font.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package font defines an interface for font faces, for drawing text on an\n// image.\n//\n// Other packages provide font face implementations. For example, a truetype\n// package would provide one based on .ttf font files.\npackage font // import \"golang.org/x/image/font\"\n\nimport (\n\t\"image\"\n\t\"image/draw\"\n\t\"io\"\n\t\"unicode/utf8\"\n\n\t\"golang.org/x/image/math/fixed\"\n)\n\n// TODO: who is responsible for caches (glyph images, glyph indices, kerns)?\n// The Drawer or the Face?\n\n// Face is a font face. Its glyphs are often derived from a font file, such as\n// \"Comic_Sans_MS.ttf\", but a face has a specific size, style, weight and\n// hinting. For example, the 12pt and 18pt versions of Comic Sans are two\n// different faces, even if derived from the same font file.\n//\n// A Face is not safe for concurrent use by multiple goroutines, as its methods\n// may re-use implementation-specific caches and mask image buffers.\n//\n// To create a Face, look to other packages that implement specific font file\n// formats.\ntype Face interface {\n\tio.Closer\n\n\t// Glyph returns the draw.DrawMask parameters (dr, mask, maskp) to draw r's\n\t// glyph at the sub-pixel destination location dot, and that glyph's\n\t// advance width.\n\t//\n\t// It returns !ok if the face does not contain a glyph for r.\n\t//\n\t// The contents of the mask image returned by one Glyph call may change\n\t// after the next Glyph call. Callers that want to cache the mask must make\n\t// a copy.\n\tGlyph(dot fixed.Point26_6, r rune) (\n\t\tdr image.Rectangle, mask image.Image, maskp image.Point, advance fixed.Int26_6, ok bool)\n\n\t// GlyphBounds returns the bounding box of r's glyph, drawn at a dot equal\n\t// to the origin, and that glyph's advance width.\n\t//\n\t// It returns !ok if the face does not contain a glyph for r.\n\t//\n\t// The glyph's ascent and descent equal -bounds.Min.Y and +bounds.Max.Y. A\n\t// visual depiction of what these metrics are is at\n\t// https://developer.apple.com/library/mac/documentation/TextFonts/Conceptual/CocoaTextArchitecture/Art/glyph_metrics_2x.png\n\tGlyphBounds(r rune) (bounds fixed.Rectangle26_6, advance fixed.Int26_6, ok bool)\n\n\t// GlyphAdvance returns the advance width of r's glyph.\n\t//\n\t// It returns !ok if the face does not contain a glyph for r.\n\tGlyphAdvance(r rune) (advance fixed.Int26_6, ok bool)\n\n\t// Kern returns the horizontal adjustment for the kerning pair (r0, r1). A\n\t// positive kern means to move the glyphs further apart.\n\tKern(r0, r1 rune) fixed.Int26_6\n\n\t// Metrics returns the metrics for this Face.\n\tMetrics() Metrics\n\n\t// TODO: ColoredGlyph for various emoji?\n\t// TODO: Ligatures? Shaping?\n}\n\n// Metrics holds the metrics for a Face. A visual depiction is at\n// https://developer.apple.com/library/mac/documentation/TextFonts/Conceptual/CocoaTextArchitecture/Art/glyph_metrics_2x.png\ntype Metrics struct {\n\t// Height is the recommended amount of vertical space between two lines of\n\t// text.\n\tHeight fixed.Int26_6\n\n\t// Ascent is the distance from the top of a line to its baseline.\n\tAscent fixed.Int26_6\n\n\t// Descent is the distance from the bottom of a line to its baseline. The\n\t// value is typically positive, even though a descender goes below the\n\t// baseline.\n\tDescent fixed.Int26_6\n}\n\n// Drawer draws text on a destination image.\n//\n// A Drawer is not safe for concurrent use by multiple goroutines, since its\n// Face is not.\ntype Drawer struct {\n\t// Dst is the destination image.\n\tDst draw.Image\n\t// Src is the source image.\n\tSrc image.Image\n\t// Face provides the glyph mask images.\n\tFace Face\n\t// Dot is the baseline location to draw the next glyph. The majority of the\n\t// affected pixels will be above and to the right of the dot, but some may\n\t// be below or to the left. For example, drawing a 'j' in an italic face\n\t// may affect pixels below and to the left of the dot.\n\tDot fixed.Point26_6\n\n\t// TODO: Clip image.Image?\n\t// TODO: SrcP image.Point for Src images other than *image.Uniform? How\n\t// does it get updated during DrawString?\n}\n\n// TODO: should DrawString return the last rune drawn, so the next DrawString\n// call can kern beforehand? Or should that be the responsibility of the caller\n// if they really want to do that, since they have to explicitly shift d.Dot\n// anyway? What if ligatures span more than two runes? What if grapheme\n// clusters span multiple runes?\n//\n// TODO: do we assume that the input is in any particular Unicode Normalization\n// Form?\n//\n// TODO: have DrawRunes(s []rune)? DrawRuneReader(io.RuneReader)?? If we take\n// io.RuneReader, we can't assume that we can rewind the stream.\n//\n// TODO: how does this work with line breaking: drawing text up until a\n// vertical line? Should DrawString return the number of runes drawn?\n\n// DrawBytes draws s at the dot and advances the dot's location.\n//\n// It is equivalent to DrawString(string(s)) but may be more efficient.\nfunc (d *Drawer) DrawBytes(s []byte) {\n\tprevC := rune(-1)\n\tfor len(s) > 0 {\n\t\tc, size := utf8.DecodeRune(s)\n\t\ts = s[size:]\n\t\tif prevC >= 0 {\n\t\t\td.Dot.X += d.Face.Kern(prevC, c)\n\t\t}\n\t\tdr, mask, maskp, advance, ok := d.Face.Glyph(d.Dot, c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tdraw.DrawMask(d.Dst, dr, d.Src, image.Point{}, mask, maskp, draw.Over)\n\t\td.Dot.X += advance\n\t\tprevC = c\n\t}\n}\n\n// DrawString draws s at the dot and advances the dot's location.\nfunc (d *Drawer) DrawString(s string) {\n\tprevC := rune(-1)\n\tfor _, c := range s {\n\t\tif prevC >= 0 {\n\t\t\td.Dot.X += d.Face.Kern(prevC, c)\n\t\t}\n\t\tdr, mask, maskp, advance, ok := d.Face.Glyph(d.Dot, c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tdraw.DrawMask(d.Dst, dr, d.Src, image.Point{}, mask, maskp, draw.Over)\n\t\td.Dot.X += advance\n\t\tprevC = c\n\t}\n}\n\n// BoundBytes returns the bounding box of s, drawn at the drawer dot, as well as\n// the advance.\n//\n// It is equivalent to BoundBytes(string(s)) but may be more efficient.\nfunc (d *Drawer) BoundBytes(s []byte) (bounds fixed.Rectangle26_6, advance fixed.Int26_6) {\n\tbounds, advance = BoundBytes(d.Face, s)\n\tbounds.Min = bounds.Min.Add(d.Dot)\n\tbounds.Max = bounds.Max.Add(d.Dot)\n\treturn\n}\n\n// BoundString returns the bounding box of s, drawn at the drawer dot, as well\n// as the advance.\nfunc (d *Drawer) BoundString(s string) (bounds fixed.Rectangle26_6, advance fixed.Int26_6) {\n\tbounds, advance = BoundString(d.Face, s)\n\tbounds.Min = bounds.Min.Add(d.Dot)\n\tbounds.Max = bounds.Max.Add(d.Dot)\n\treturn\n}\n\n// MeasureBytes returns how far dot would advance by drawing s.\n//\n// It is equivalent to MeasureString(string(s)) but may be more efficient.\nfunc (d *Drawer) MeasureBytes(s []byte) (advance fixed.Int26_6) {\n\treturn MeasureBytes(d.Face, s)\n}\n\n// MeasureString returns how far dot would advance by drawing s.\nfunc (d *Drawer) MeasureString(s string) (advance fixed.Int26_6) {\n\treturn MeasureString(d.Face, s)\n}\n\n// BoundBytes returns the bounding box of s with f, drawn at a dot equal to the\n// origin, as well as the advance.\n//\n// It is equivalent to BoundString(string(s)) but may be more efficient.\nfunc BoundBytes(f Face, s []byte) (bounds fixed.Rectangle26_6, advance fixed.Int26_6) {\n\tprevC := rune(-1)\n\tfor len(s) > 0 {\n\t\tc, size := utf8.DecodeRune(s)\n\t\ts = s[size:]\n\t\tif prevC >= 0 {\n\t\t\tadvance += f.Kern(prevC, c)\n\t\t}\n\t\tb, a, ok := f.GlyphBounds(c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tb.Min.X += advance\n\t\tb.Max.X += advance\n\t\tbounds = bounds.Union(b)\n\t\tadvance += a\n\t\tprevC = c\n\t}\n\treturn\n}\n\n// BoundString returns the bounding box of s with f, drawn at a dot equal to the\n// origin, as well as the advance.\nfunc BoundString(f Face, s string) (bounds fixed.Rectangle26_6, advance fixed.Int26_6) {\n\tprevC := rune(-1)\n\tfor _, c := range s {\n\t\tif prevC >= 0 {\n\t\t\tadvance += f.Kern(prevC, c)\n\t\t}\n\t\tb, a, ok := f.GlyphBounds(c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tb.Min.X += advance\n\t\tb.Max.X += advance\n\t\tbounds = bounds.Union(b)\n\t\tadvance += a\n\t\tprevC = c\n\t}\n\treturn\n}\n\n// MeasureBytes returns how far dot would advance by drawing s with f.\n//\n// It is equivalent to MeasureString(string(s)) but may be more efficient.\nfunc MeasureBytes(f Face, s []byte) (advance fixed.Int26_6) {\n\tprevC := rune(-1)\n\tfor len(s) > 0 {\n\t\tc, size := utf8.DecodeRune(s)\n\t\ts = s[size:]\n\t\tif prevC >= 0 {\n\t\t\tadvance += f.Kern(prevC, c)\n\t\t}\n\t\ta, ok := f.GlyphAdvance(c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tadvance += a\n\t\tprevC = c\n\t}\n\treturn advance\n}\n\n// MeasureString returns how far dot would advance by drawing s with f.\nfunc MeasureString(f Face, s string) (advance fixed.Int26_6) {\n\tprevC := rune(-1)\n\tfor _, c := range s {\n\t\tif prevC >= 0 {\n\t\t\tadvance += f.Kern(prevC, c)\n\t\t}\n\t\ta, ok := f.GlyphAdvance(c)\n\t\tif !ok {\n\t\t\t// TODO: is falling back on the U+FFFD glyph the responsibility of\n\t\t\t// the Drawer or the Face?\n\t\t\t// TODO: set prevC = '\\ufffd'?\n\t\t\tcontinue\n\t\t}\n\t\tadvance += a\n\t\tprevC = c\n\t}\n\treturn advance\n}\n\n// Hinting selects how to quantize a vector font's glyph nodes.\n//\n// Not all fonts support hinting.\ntype Hinting int\n\nconst (\n\tHintingNone Hinting = iota\n\tHintingVertical\n\tHintingFull\n)\n\n// Stretch selects a normal, condensed, or expanded face.\n//\n// Not all fonts support stretches.\ntype Stretch int\n\nconst (\n\tStretchUltraCondensed Stretch = -4\n\tStretchExtraCondensed Stretch = -3\n\tStretchCondensed Stretch = -2\n\tStretchSemiCondensed Stretch = -1\n\tStretchNormal Stretch = +0\n\tStretchSemiExpanded Stretch = +1\n\tStretchExpanded Stretch = +2\n\tStretchExtraExpanded Stretch = +3\n\tStretchUltraExpanded Stretch = +4\n)\n\n// Style selects a normal, italic, or oblique face.\n//\n// Not all fonts support styles.\ntype Style int\n\nconst (\n\tStyleNormal Style = iota\n\tStyleItalic\n\tStyleOblique\n)\n\n// Weight selects a normal, light or bold face.\n//\n// Not all fonts support weights.\n//\n// The named Weight constants (e.g. WeightBold) correspond to CSS' common\n// weight names (e.g. \"Bold\"), but the numerical values differ, so that in Go,\n// the zero value means to use a normal weight. For the CSS names and values,\n// see https://developer.mozilla.org/en/docs/Web/CSS/font-weight\ntype Weight int\n\nconst (\n\tWeightThin Weight = -3 // CSS font-weight value 100.\n\tWeightExtraLight Weight = -2 // CSS font-weight value 200.\n\tWeightLight Weight = -1 // CSS font-weight value 300.\n\tWeightNormal Weight = +0 // CSS font-weight value 400.\n\tWeightMedium Weight = +1 // CSS font-weight value 500.\n\tWeightSemiBold Weight = +2 // CSS font-weight value 600.\n\tWeightBold Weight = +3 // CSS font-weight value 700.\n\tWeightExtraBold Weight = +4 // CSS font-weight value 800.\n\tWeightBlack Weight = +5 // CSS font-weight value 900.\n)\n" }, { "path": "vendor/golang.org/x/image/math/fixed/fixed.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package fixed implements fixed-point integer types.\npackage fixed // import \"golang.org/x/image/math/fixed\"\n\nimport (\n\t\"fmt\"\n)\n\n// TODO: implement fmt.Formatter for %f and %g.\n\n// I returns the integer value i as an Int26_6.\n//\n// For example, passing the integer value 2 yields Int26_6(128).\nfunc I(i int) Int26_6 {\n\treturn Int26_6(i << 6)\n}\n\n// Int26_6 is a signed 26.6 fixed-point number.\n//\n// The integer part ranges from -33554432 to 33554431, inclusive. The\n// fractional part has 6 bits of precision.\n//\n// For example, the number one-and-a-quarter is Int26_6(1<<6 + 1<<4).\ntype Int26_6 int32\n\n// String returns a human-readable representation of a 26.6 fixed-point number.\n//\n// For example, the number one-and-a-quarter becomes \"1:16\".\nfunc (x Int26_6) String() string {\n\tconst shift, mask = 6, 1<<6 - 1\n\tif x >= 0 {\n\t\treturn fmt.Sprintf(\"%d:%02d\", int32(x>>shift), int32(x&mask))\n\t}\n\tx = -x\n\tif x >= 0 {\n\t\treturn fmt.Sprintf(\"-%d:%02d\", int32(x>>shift), int32(x&mask))\n\t}\n\treturn \"-33554432:00\" // The minimum value is -(1<<25).\n}\n\n// Floor returns the greatest integer value less than or equal to x.\n//\n// Its return type is int, not Int26_6.\nfunc (x Int26_6) Floor() int { return int((x + 0x00) >> 6) }\n\n// Round returns the nearest integer value to x. Ties are rounded up.\n//\n// Its return type is int, not Int26_6.\nfunc (x Int26_6) Round() int { return int((x + 0x20) >> 6) }\n\n// Ceil returns the least integer value greater than or equal to x.\n//\n// Its return type is int, not Int26_6.\nfunc (x Int26_6) Ceil() int { return int((x + 0x3f) >> 6) }\n\n// Mul returns x*y in 26.6 fixed-point arithmetic.\nfunc (x Int26_6) Mul(y Int26_6) Int26_6 {\n\treturn Int26_6((int64(x)*int64(y) + 1<<5) >> 6)\n}\n\n// Int52_12 is a signed 52.12 fixed-point number.\n//\n// The integer part ranges from -2251799813685248 to 2251799813685247,\n// inclusive. The fractional part has 12 bits of precision.\n//\n// For example, the number one-and-a-quarter is Int52_12(1<<12 + 1<<10).\ntype Int52_12 int64\n\n// String returns a human-readable representation of a 52.12 fixed-point\n// number.\n//\n// For example, the number one-and-a-quarter becomes \"1:1024\".\nfunc (x Int52_12) String() string {\n\tconst shift, mask = 12, 1<<12 - 1\n\tif x >= 0 {\n\t\treturn fmt.Sprintf(\"%d:%04d\", int64(x>>shift), int64(x&mask))\n\t}\n\tx = -x\n\tif x >= 0 {\n\t\treturn fmt.Sprintf(\"-%d:%04d\", int64(x>>shift), int64(x&mask))\n\t}\n\treturn \"-2251799813685248:0000\" // The minimum value is -(1<<51).\n}\n\n// Floor returns the greatest integer value less than or equal to x.\n//\n// Its return type is int, not Int52_12.\nfunc (x Int52_12) Floor() int { return int((x + 0x000) >> 12) }\n\n// Round returns the nearest integer value to x. Ties are rounded up.\n//\n// Its return type is int, not Int52_12.\nfunc (x Int52_12) Round() int { return int((x + 0x800) >> 12) }\n\n// Ceil returns the least integer value greater than or equal to x.\n//\n// Its return type is int, not Int52_12.\nfunc (x Int52_12) Ceil() int { return int((x + 0xfff) >> 12) }\n\n// Mul returns x*y in 52.12 fixed-point arithmetic.\nfunc (x Int52_12) Mul(y Int52_12) Int52_12 {\n\tconst M, N = 52, 12\n\tlo, hi := muli64(int64(x), int64(y))\n\tret := Int52_12(hi<>N)\n\tret += Int52_12((lo >> (N - 1)) & 1) // Round to nearest, instead of rounding down.\n\treturn ret\n}\n\n// muli64 multiplies two int64 values, returning the 128-bit signed integer\n// result as two uint64 values.\n//\n// This implementation is similar to $GOROOT/src/runtime/softfloat64.go's mullu\n// function, which is in turn adapted from Hacker's Delight.\nfunc muli64(u, v int64) (lo, hi uint64) {\n\tconst (\n\t\ts = 32\n\t\tmask = 1<> s)\n\tu0 := uint64(u & mask)\n\tv1 := uint64(v >> s)\n\tv0 := uint64(v & mask)\n\n\tw0 := u0 * v0\n\tt := u1*v0 + w0>>s\n\tw1 := t & mask\n\tw2 := uint64(int64(t) >> s)\n\tw1 += u0 * v1\n\treturn uint64(u) * uint64(v), u1*v1 + w2 + uint64(int64(w1)>>s)\n}\n\n// P returns the integer values x and y as a Point26_6.\n//\n// For example, passing the integer values (2, -3) yields Point26_6{128, -192}.\nfunc P(x, y int) Point26_6 {\n\treturn Point26_6{Int26_6(x << 6), Int26_6(y << 6)}\n}\n\n// Point26_6 is a 26.6 fixed-point coordinate pair.\n//\n// It is analogous to the image.Point type in the standard library.\ntype Point26_6 struct {\n\tX, Y Int26_6\n}\n\n// Add returns the vector p+q.\nfunc (p Point26_6) Add(q Point26_6) Point26_6 {\n\treturn Point26_6{p.X + q.X, p.Y + q.Y}\n}\n\n// Sub returns the vector p-q.\nfunc (p Point26_6) Sub(q Point26_6) Point26_6 {\n\treturn Point26_6{p.X - q.X, p.Y - q.Y}\n}\n\n// Mul returns the vector p*k.\nfunc (p Point26_6) Mul(k Int26_6) Point26_6 {\n\treturn Point26_6{p.X * k / 64, p.Y * k / 64}\n}\n\n// Div returns the vector p/k.\nfunc (p Point26_6) Div(k Int26_6) Point26_6 {\n\treturn Point26_6{p.X * 64 / k, p.Y * 64 / k}\n}\n\n// In returns whether p is in r.\nfunc (p Point26_6) In(r Rectangle26_6) bool {\n\treturn r.Min.X <= p.X && p.X < r.Max.X && r.Min.Y <= p.Y && p.Y < r.Max.Y\n}\n\n// Point52_12 is a 52.12 fixed-point coordinate pair.\n//\n// It is analogous to the image.Point type in the standard library.\ntype Point52_12 struct {\n\tX, Y Int52_12\n}\n\n// Add returns the vector p+q.\nfunc (p Point52_12) Add(q Point52_12) Point52_12 {\n\treturn Point52_12{p.X + q.X, p.Y + q.Y}\n}\n\n// Sub returns the vector p-q.\nfunc (p Point52_12) Sub(q Point52_12) Point52_12 {\n\treturn Point52_12{p.X - q.X, p.Y - q.Y}\n}\n\n// Mul returns the vector p*k.\nfunc (p Point52_12) Mul(k Int52_12) Point52_12 {\n\treturn Point52_12{p.X * k / 4096, p.Y * k / 4096}\n}\n\n// Div returns the vector p/k.\nfunc (p Point52_12) Div(k Int52_12) Point52_12 {\n\treturn Point52_12{p.X * 4096 / k, p.Y * 4096 / k}\n}\n\n// In returns whether p is in r.\nfunc (p Point52_12) In(r Rectangle52_12) bool {\n\treturn r.Min.X <= p.X && p.X < r.Max.X && r.Min.Y <= p.Y && p.Y < r.Max.Y\n}\n\n// R returns the integer values minX, minY, maxX, maxY as a Rectangle26_6.\n//\n// For example, passing the integer values (0, 1, 2, 3) yields\n// Rectangle26_6{Point26_6{0, 64}, Point26_6{128, 192}}.\n//\n// Like the image.Rect function in the standard library, the returned rectangle\n// has minimum and maximum coordinates swapped if necessary so that it is\n// well-formed.\nfunc R(minX, minY, maxX, maxY int) Rectangle26_6 {\n\tif minX > maxX {\n\t\tminX, maxX = maxX, minX\n\t}\n\tif minY > maxY {\n\t\tminY, maxY = maxY, minY\n\t}\n\treturn Rectangle26_6{\n\t\tPoint26_6{\n\t\t\tInt26_6(minX << 6),\n\t\t\tInt26_6(minY << 6),\n\t\t},\n\t\tPoint26_6{\n\t\t\tInt26_6(maxX << 6),\n\t\t\tInt26_6(maxY << 6),\n\t\t},\n\t}\n}\n\n// Rectangle26_6 is a 26.6 fixed-point coordinate rectangle. The Min bound is\n// inclusive and the Max bound is exclusive. It is well-formed if Min.X <=\n// Max.X and likewise for Y.\n//\n// It is analogous to the image.Rectangle type in the standard library.\ntype Rectangle26_6 struct {\n\tMin, Max Point26_6\n}\n\n// Add returns the rectangle r translated by p.\nfunc (r Rectangle26_6) Add(p Point26_6) Rectangle26_6 {\n\treturn Rectangle26_6{\n\t\tPoint26_6{r.Min.X + p.X, r.Min.Y + p.Y},\n\t\tPoint26_6{r.Max.X + p.X, r.Max.Y + p.Y},\n\t}\n}\n\n// Sub returns the rectangle r translated by -p.\nfunc (r Rectangle26_6) Sub(p Point26_6) Rectangle26_6 {\n\treturn Rectangle26_6{\n\t\tPoint26_6{r.Min.X - p.X, r.Min.Y - p.Y},\n\t\tPoint26_6{r.Max.X - p.X, r.Max.Y - p.Y},\n\t}\n}\n\n// Intersect returns the largest rectangle contained by both r and s. If the\n// two rectangles do not overlap then the zero rectangle will be returned.\nfunc (r Rectangle26_6) Intersect(s Rectangle26_6) Rectangle26_6 {\n\tif r.Min.X < s.Min.X {\n\t\tr.Min.X = s.Min.X\n\t}\n\tif r.Min.Y < s.Min.Y {\n\t\tr.Min.Y = s.Min.Y\n\t}\n\tif r.Max.X > s.Max.X {\n\t\tr.Max.X = s.Max.X\n\t}\n\tif r.Max.Y > s.Max.Y {\n\t\tr.Max.Y = s.Max.Y\n\t}\n\t// Letting r0 and s0 be the values of r and s at the time that the method\n\t// is called, this next line is equivalent to:\n\t//\n\t// if max(r0.Min.X, s0.Min.X) >= min(r0.Max.X, s0.Max.X) || likewiseForY { etc }\n\tif r.Empty() {\n\t\treturn Rectangle26_6{}\n\t}\n\treturn r\n}\n\n// Union returns the smallest rectangle that contains both r and s.\nfunc (r Rectangle26_6) Union(s Rectangle26_6) Rectangle26_6 {\n\tif r.Empty() {\n\t\treturn s\n\t}\n\tif s.Empty() {\n\t\treturn r\n\t}\n\tif r.Min.X > s.Min.X {\n\t\tr.Min.X = s.Min.X\n\t}\n\tif r.Min.Y > s.Min.Y {\n\t\tr.Min.Y = s.Min.Y\n\t}\n\tif r.Max.X < s.Max.X {\n\t\tr.Max.X = s.Max.X\n\t}\n\tif r.Max.Y < s.Max.Y {\n\t\tr.Max.Y = s.Max.Y\n\t}\n\treturn r\n}\n\n// Empty returns whether the rectangle contains no points.\nfunc (r Rectangle26_6) Empty() bool {\n\treturn r.Min.X >= r.Max.X || r.Min.Y >= r.Max.Y\n}\n\n// In returns whether every point in r is in s.\nfunc (r Rectangle26_6) In(s Rectangle26_6) bool {\n\tif r.Empty() {\n\t\treturn true\n\t}\n\t// Note that r.Max is an exclusive bound for r, so that r.In(s)\n\t// does not require that r.Max.In(s).\n\treturn s.Min.X <= r.Min.X && r.Max.X <= s.Max.X &&\n\t\ts.Min.Y <= r.Min.Y && r.Max.Y <= s.Max.Y\n}\n\n// Rectangle52_12 is a 52.12 fixed-point coordinate rectangle. The Min bound is\n// inclusive and the Max bound is exclusive. It is well-formed if Min.X <=\n// Max.X and likewise for Y.\n//\n// It is analogous to the image.Rectangle type in the standard library.\ntype Rectangle52_12 struct {\n\tMin, Max Point52_12\n}\n\n// Add returns the rectangle r translated by p.\nfunc (r Rectangle52_12) Add(p Point52_12) Rectangle52_12 {\n\treturn Rectangle52_12{\n\t\tPoint52_12{r.Min.X + p.X, r.Min.Y + p.Y},\n\t\tPoint52_12{r.Max.X + p.X, r.Max.Y + p.Y},\n\t}\n}\n\n// Sub returns the rectangle r translated by -p.\nfunc (r Rectangle52_12) Sub(p Point52_12) Rectangle52_12 {\n\treturn Rectangle52_12{\n\t\tPoint52_12{r.Min.X - p.X, r.Min.Y - p.Y},\n\t\tPoint52_12{r.Max.X - p.X, r.Max.Y - p.Y},\n\t}\n}\n\n// Intersect returns the largest rectangle contained by both r and s. If the\n// two rectangles do not overlap then the zero rectangle will be returned.\nfunc (r Rectangle52_12) Intersect(s Rectangle52_12) Rectangle52_12 {\n\tif r.Min.X < s.Min.X {\n\t\tr.Min.X = s.Min.X\n\t}\n\tif r.Min.Y < s.Min.Y {\n\t\tr.Min.Y = s.Min.Y\n\t}\n\tif r.Max.X > s.Max.X {\n\t\tr.Max.X = s.Max.X\n\t}\n\tif r.Max.Y > s.Max.Y {\n\t\tr.Max.Y = s.Max.Y\n\t}\n\t// Letting r0 and s0 be the values of r and s at the time that the method\n\t// is called, this next line is equivalent to:\n\t//\n\t// if max(r0.Min.X, s0.Min.X) >= min(r0.Max.X, s0.Max.X) || likewiseForY { etc }\n\tif r.Empty() {\n\t\treturn Rectangle52_12{}\n\t}\n\treturn r\n}\n\n// Union returns the smallest rectangle that contains both r and s.\nfunc (r Rectangle52_12) Union(s Rectangle52_12) Rectangle52_12 {\n\tif r.Empty() {\n\t\treturn s\n\t}\n\tif s.Empty() {\n\t\treturn r\n\t}\n\tif r.Min.X > s.Min.X {\n\t\tr.Min.X = s.Min.X\n\t}\n\tif r.Min.Y > s.Min.Y {\n\t\tr.Min.Y = s.Min.Y\n\t}\n\tif r.Max.X < s.Max.X {\n\t\tr.Max.X = s.Max.X\n\t}\n\tif r.Max.Y < s.Max.Y {\n\t\tr.Max.Y = s.Max.Y\n\t}\n\treturn r\n}\n\n// Empty returns whether the rectangle contains no points.\nfunc (r Rectangle52_12) Empty() bool {\n\treturn r.Min.X >= r.Max.X || r.Min.Y >= r.Max.Y\n}\n\n// In returns whether every point in r is in s.\nfunc (r Rectangle52_12) In(s Rectangle52_12) bool {\n\tif r.Empty() {\n\t\treturn true\n\t}\n\t// Note that r.Max is an exclusive bound for r, so that r.In(s)\n\t// does not require that r.Max.In(s).\n\treturn s.Min.X <= r.Min.X && r.Max.X <= s.Max.X &&\n\t\ts.Min.Y <= r.Min.Y && r.Max.Y <= s.Max.Y\n}\n" }, { "path": "vendor/golang.org/x/net/AUTHORS", "content": "# This source code refers to The Go Authors for copyright purposes.\n# The master list of authors is in the main Go distribution,\n# visible at http://tip.golang.org/AUTHORS.\n" }, { "path": "vendor/golang.org/x/net/CONTRIBUTORS", "content": "# This source code was written by the Go contributors.\n# The master list of contributors is in the main Go distribution,\n# visible at http://tip.golang.org/CONTRIBUTORS.\n" }, { "path": "vendor/golang.org/x/net/LICENSE", "content": "Copyright (c) 2009 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/golang.org/x/net/PATENTS", "content": "Additional IP Rights Grant (Patents)\n\n\"This implementation\" means the copyrightable works distributed by\nGoogle as part of the Go project.\n\nGoogle hereby grants to You a perpetual, worldwide, non-exclusive,\nno-charge, royalty-free, irrevocable (except as stated in this section)\npatent license to make, have made, use, offer to sell, sell, import,\ntransfer and otherwise run, modify and propagate the contents of this\nimplementation of Go, where such license applies only to those patent\nclaims, both currently owned or controlled by Google and acquired in\nthe future, licensable by Google that are necessarily infringed by this\nimplementation of Go. This grant does not include claims that would be\ninfringed only as a consequence of further modification of this\nimplementation. If you or your agent or exclusive licensee institute or\norder or agree to the institution of patent litigation against any\nentity (including a cross-claim or counterclaim in a lawsuit) alleging\nthat this implementation of Go or any code incorporated within this\nimplementation of Go constitutes direct or contributory patent\ninfringement, or inducement of patent infringement, then any patent\nrights granted to you under this License for this implementation of Go\nshall terminate as of the date such litigation is filed.\n" }, { "path": "vendor/golang.org/x/net/context/context.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package context defines the Context type, which carries deadlines,\n// cancelation signals, and other request-scoped values across API boundaries\n// and between processes.\n// As of Go 1.7 this package is available in the standard library under the\n// name context. https://golang.org/pkg/context.\n//\n// Incoming requests to a server should create a Context, and outgoing calls to\n// servers should accept a Context. The chain of function calls between must\n// propagate the Context, optionally replacing it with a modified copy created\n// using WithDeadline, WithTimeout, WithCancel, or WithValue.\n//\n// Programs that use Contexts should follow these rules to keep interfaces\n// consistent across packages and enable static analysis tools to check context\n// propagation:\n//\n// Do not store Contexts inside a struct type; instead, pass a Context\n// explicitly to each function that needs it. The Context should be the first\n// parameter, typically named ctx:\n//\n// \tfunc DoSomething(ctx context.Context, arg Arg) error {\n// \t\t// ... use ctx ...\n// \t}\n//\n// Do not pass a nil Context, even if a function permits it. Pass context.TODO\n// if you are unsure about which Context to use.\n//\n// Use context Values only for request-scoped data that transits processes and\n// APIs, not for passing optional parameters to functions.\n//\n// The same Context may be passed to functions running in different goroutines;\n// Contexts are safe for simultaneous use by multiple goroutines.\n//\n// See http://blog.golang.org/context for example code for a server that uses\n// Contexts.\npackage context // import \"golang.org/x/net/context\"\n\n// Background returns a non-nil, empty Context. It is never canceled, has no\n// values, and has no deadline. It is typically used by the main function,\n// initialization, and tests, and as the top-level Context for incoming\n// requests.\nfunc Background() Context {\n\treturn background\n}\n\n// TODO returns a non-nil, empty Context. Code should use context.TODO when\n// it's unclear which Context to use or it is not yet available (because the\n// surrounding function has not yet been extended to accept a Context\n// parameter). TODO is recognized by static analysis tools that determine\n// whether Contexts are propagated correctly in a program.\nfunc TODO() Context {\n\treturn todo\n}\n" }, { "path": "vendor/golang.org/x/net/context/go17.go", "content": "// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build go1.7\n\npackage context\n\nimport (\n\t\"context\" // standard library's context, as of Go 1.7\n\t\"time\"\n)\n\nvar (\n\ttodo = context.TODO()\n\tbackground = context.Background()\n)\n\n// Canceled is the error returned by Context.Err when the context is canceled.\nvar Canceled = context.Canceled\n\n// DeadlineExceeded is the error returned by Context.Err when the context's\n// deadline passes.\nvar DeadlineExceeded = context.DeadlineExceeded\n\n// WithCancel returns a copy of parent with a new Done channel. The returned\n// context's Done channel is closed when the returned cancel function is called\n// or when the parent context's Done channel is closed, whichever happens first.\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete.\nfunc WithCancel(parent Context) (ctx Context, cancel CancelFunc) {\n\tctx, f := context.WithCancel(parent)\n\treturn ctx, CancelFunc(f)\n}\n\n// WithDeadline returns a copy of the parent context with the deadline adjusted\n// to be no later than d. If the parent's deadline is already earlier than d,\n// WithDeadline(parent, d) is semantically equivalent to parent. The returned\n// context's Done channel is closed when the deadline expires, when the returned\n// cancel function is called, or when the parent context's Done channel is\n// closed, whichever happens first.\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete.\nfunc WithDeadline(parent Context, deadline time.Time) (Context, CancelFunc) {\n\tctx, f := context.WithDeadline(parent, deadline)\n\treturn ctx, CancelFunc(f)\n}\n\n// WithTimeout returns WithDeadline(parent, time.Now().Add(timeout)).\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete:\n//\n// \tfunc slowOperationWithTimeout(ctx context.Context) (Result, error) {\n// \t\tctx, cancel := context.WithTimeout(ctx, 100*time.Millisecond)\n// \t\tdefer cancel() // releases resources if slowOperation completes before timeout elapses\n// \t\treturn slowOperation(ctx)\n// \t}\nfunc WithTimeout(parent Context, timeout time.Duration) (Context, CancelFunc) {\n\treturn WithDeadline(parent, time.Now().Add(timeout))\n}\n\n// WithValue returns a copy of parent in which the value associated with key is\n// val.\n//\n// Use context Values only for request-scoped data that transits processes and\n// APIs, not for passing optional parameters to functions.\nfunc WithValue(parent Context, key interface{}, val interface{}) Context {\n\treturn context.WithValue(parent, key, val)\n}\n" }, { "path": "vendor/golang.org/x/net/context/go19.go", "content": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build go1.9\n\npackage context\n\nimport \"context\" // standard library's context, as of Go 1.7\n\n// A Context carries a deadline, a cancelation signal, and other values across\n// API boundaries.\n//\n// Context's methods may be called by multiple goroutines simultaneously.\ntype Context = context.Context\n\n// A CancelFunc tells an operation to abandon its work.\n// A CancelFunc does not wait for the work to stop.\n// After the first call, subsequent calls to a CancelFunc do nothing.\ntype CancelFunc = context.CancelFunc\n" }, { "path": "vendor/golang.org/x/net/context/pre_go17.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build !go1.7\n\npackage context\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"sync\"\n\t\"time\"\n)\n\n// An emptyCtx is never canceled, has no values, and has no deadline. It is not\n// struct{}, since vars of this type must have distinct addresses.\ntype emptyCtx int\n\nfunc (*emptyCtx) Deadline() (deadline time.Time, ok bool) {\n\treturn\n}\n\nfunc (*emptyCtx) Done() <-chan struct{} {\n\treturn nil\n}\n\nfunc (*emptyCtx) Err() error {\n\treturn nil\n}\n\nfunc (*emptyCtx) Value(key interface{}) interface{} {\n\treturn nil\n}\n\nfunc (e *emptyCtx) String() string {\n\tswitch e {\n\tcase background:\n\t\treturn \"context.Background\"\n\tcase todo:\n\t\treturn \"context.TODO\"\n\t}\n\treturn \"unknown empty Context\"\n}\n\nvar (\n\tbackground = new(emptyCtx)\n\ttodo = new(emptyCtx)\n)\n\n// Canceled is the error returned by Context.Err when the context is canceled.\nvar Canceled = errors.New(\"context canceled\")\n\n// DeadlineExceeded is the error returned by Context.Err when the context's\n// deadline passes.\nvar DeadlineExceeded = errors.New(\"context deadline exceeded\")\n\n// WithCancel returns a copy of parent with a new Done channel. The returned\n// context's Done channel is closed when the returned cancel function is called\n// or when the parent context's Done channel is closed, whichever happens first.\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete.\nfunc WithCancel(parent Context) (ctx Context, cancel CancelFunc) {\n\tc := newCancelCtx(parent)\n\tpropagateCancel(parent, c)\n\treturn c, func() { c.cancel(true, Canceled) }\n}\n\n// newCancelCtx returns an initialized cancelCtx.\nfunc newCancelCtx(parent Context) *cancelCtx {\n\treturn &cancelCtx{\n\t\tContext: parent,\n\t\tdone: make(chan struct{}),\n\t}\n}\n\n// propagateCancel arranges for child to be canceled when parent is.\nfunc propagateCancel(parent Context, child canceler) {\n\tif parent.Done() == nil {\n\t\treturn // parent is never canceled\n\t}\n\tif p, ok := parentCancelCtx(parent); ok {\n\t\tp.mu.Lock()\n\t\tif p.err != nil {\n\t\t\t// parent has already been canceled\n\t\t\tchild.cancel(false, p.err)\n\t\t} else {\n\t\t\tif p.children == nil {\n\t\t\t\tp.children = make(map[canceler]bool)\n\t\t\t}\n\t\t\tp.children[child] = true\n\t\t}\n\t\tp.mu.Unlock()\n\t} else {\n\t\tgo func() {\n\t\t\tselect {\n\t\t\tcase <-parent.Done():\n\t\t\t\tchild.cancel(false, parent.Err())\n\t\t\tcase <-child.Done():\n\t\t\t}\n\t\t}()\n\t}\n}\n\n// parentCancelCtx follows a chain of parent references until it finds a\n// *cancelCtx. This function understands how each of the concrete types in this\n// package represents its parent.\nfunc parentCancelCtx(parent Context) (*cancelCtx, bool) {\n\tfor {\n\t\tswitch c := parent.(type) {\n\t\tcase *cancelCtx:\n\t\t\treturn c, true\n\t\tcase *timerCtx:\n\t\t\treturn c.cancelCtx, true\n\t\tcase *valueCtx:\n\t\t\tparent = c.Context\n\t\tdefault:\n\t\t\treturn nil, false\n\t\t}\n\t}\n}\n\n// removeChild removes a context from its parent.\nfunc removeChild(parent Context, child canceler) {\n\tp, ok := parentCancelCtx(parent)\n\tif !ok {\n\t\treturn\n\t}\n\tp.mu.Lock()\n\tif p.children != nil {\n\t\tdelete(p.children, child)\n\t}\n\tp.mu.Unlock()\n}\n\n// A canceler is a context type that can be canceled directly. The\n// implementations are *cancelCtx and *timerCtx.\ntype canceler interface {\n\tcancel(removeFromParent bool, err error)\n\tDone() <-chan struct{}\n}\n\n// A cancelCtx can be canceled. When canceled, it also cancels any children\n// that implement canceler.\ntype cancelCtx struct {\n\tContext\n\n\tdone chan struct{} // closed by the first cancel call.\n\n\tmu sync.Mutex\n\tchildren map[canceler]bool // set to nil by the first cancel call\n\terr error // set to non-nil by the first cancel call\n}\n\nfunc (c *cancelCtx) Done() <-chan struct{} {\n\treturn c.done\n}\n\nfunc (c *cancelCtx) Err() error {\n\tc.mu.Lock()\n\tdefer c.mu.Unlock()\n\treturn c.err\n}\n\nfunc (c *cancelCtx) String() string {\n\treturn fmt.Sprintf(\"%v.WithCancel\", c.Context)\n}\n\n// cancel closes c.done, cancels each of c's children, and, if\n// removeFromParent is true, removes c from its parent's children.\nfunc (c *cancelCtx) cancel(removeFromParent bool, err error) {\n\tif err == nil {\n\t\tpanic(\"context: internal error: missing cancel error\")\n\t}\n\tc.mu.Lock()\n\tif c.err != nil {\n\t\tc.mu.Unlock()\n\t\treturn // already canceled\n\t}\n\tc.err = err\n\tclose(c.done)\n\tfor child := range c.children {\n\t\t// NOTE: acquiring the child's lock while holding parent's lock.\n\t\tchild.cancel(false, err)\n\t}\n\tc.children = nil\n\tc.mu.Unlock()\n\n\tif removeFromParent {\n\t\tremoveChild(c.Context, c)\n\t}\n}\n\n// WithDeadline returns a copy of the parent context with the deadline adjusted\n// to be no later than d. If the parent's deadline is already earlier than d,\n// WithDeadline(parent, d) is semantically equivalent to parent. The returned\n// context's Done channel is closed when the deadline expires, when the returned\n// cancel function is called, or when the parent context's Done channel is\n// closed, whichever happens first.\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete.\nfunc WithDeadline(parent Context, deadline time.Time) (Context, CancelFunc) {\n\tif cur, ok := parent.Deadline(); ok && cur.Before(deadline) {\n\t\t// The current deadline is already sooner than the new one.\n\t\treturn WithCancel(parent)\n\t}\n\tc := &timerCtx{\n\t\tcancelCtx: newCancelCtx(parent),\n\t\tdeadline: deadline,\n\t}\n\tpropagateCancel(parent, c)\n\td := deadline.Sub(time.Now())\n\tif d <= 0 {\n\t\tc.cancel(true, DeadlineExceeded) // deadline has already passed\n\t\treturn c, func() { c.cancel(true, Canceled) }\n\t}\n\tc.mu.Lock()\n\tdefer c.mu.Unlock()\n\tif c.err == nil {\n\t\tc.timer = time.AfterFunc(d, func() {\n\t\t\tc.cancel(true, DeadlineExceeded)\n\t\t})\n\t}\n\treturn c, func() { c.cancel(true, Canceled) }\n}\n\n// A timerCtx carries a timer and a deadline. It embeds a cancelCtx to\n// implement Done and Err. It implements cancel by stopping its timer then\n// delegating to cancelCtx.cancel.\ntype timerCtx struct {\n\t*cancelCtx\n\ttimer *time.Timer // Under cancelCtx.mu.\n\n\tdeadline time.Time\n}\n\nfunc (c *timerCtx) Deadline() (deadline time.Time, ok bool) {\n\treturn c.deadline, true\n}\n\nfunc (c *timerCtx) String() string {\n\treturn fmt.Sprintf(\"%v.WithDeadline(%s [%s])\", c.cancelCtx.Context, c.deadline, c.deadline.Sub(time.Now()))\n}\n\nfunc (c *timerCtx) cancel(removeFromParent bool, err error) {\n\tc.cancelCtx.cancel(false, err)\n\tif removeFromParent {\n\t\t// Remove this timerCtx from its parent cancelCtx's children.\n\t\tremoveChild(c.cancelCtx.Context, c)\n\t}\n\tc.mu.Lock()\n\tif c.timer != nil {\n\t\tc.timer.Stop()\n\t\tc.timer = nil\n\t}\n\tc.mu.Unlock()\n}\n\n// WithTimeout returns WithDeadline(parent, time.Now().Add(timeout)).\n//\n// Canceling this context releases resources associated with it, so code should\n// call cancel as soon as the operations running in this Context complete:\n//\n// \tfunc slowOperationWithTimeout(ctx context.Context) (Result, error) {\n// \t\tctx, cancel := context.WithTimeout(ctx, 100*time.Millisecond)\n// \t\tdefer cancel() // releases resources if slowOperation completes before timeout elapses\n// \t\treturn slowOperation(ctx)\n// \t}\nfunc WithTimeout(parent Context, timeout time.Duration) (Context, CancelFunc) {\n\treturn WithDeadline(parent, time.Now().Add(timeout))\n}\n\n// WithValue returns a copy of parent in which the value associated with key is\n// val.\n//\n// Use context Values only for request-scoped data that transits processes and\n// APIs, not for passing optional parameters to functions.\nfunc WithValue(parent Context, key interface{}, val interface{}) Context {\n\treturn &valueCtx{parent, key, val}\n}\n\n// A valueCtx carries a key-value pair. It implements Value for that key and\n// delegates all other calls to the embedded Context.\ntype valueCtx struct {\n\tContext\n\tkey, val interface{}\n}\n\nfunc (c *valueCtx) String() string {\n\treturn fmt.Sprintf(\"%v.WithValue(%#v, %#v)\", c.Context, c.key, c.val)\n}\n\nfunc (c *valueCtx) Value(key interface{}) interface{} {\n\tif c.key == key {\n\t\treturn c.val\n\t}\n\treturn c.Context.Value(key)\n}\n" }, { "path": "vendor/golang.org/x/net/context/pre_go19.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build !go1.9\n\npackage context\n\nimport \"time\"\n\n// A Context carries a deadline, a cancelation signal, and other values across\n// API boundaries.\n//\n// Context's methods may be called by multiple goroutines simultaneously.\ntype Context interface {\n\t// Deadline returns the time when work done on behalf of this context\n\t// should be canceled. Deadline returns ok==false when no deadline is\n\t// set. Successive calls to Deadline return the same results.\n\tDeadline() (deadline time.Time, ok bool)\n\n\t// Done returns a channel that's closed when work done on behalf of this\n\t// context should be canceled. Done may return nil if this context can\n\t// never be canceled. Successive calls to Done return the same value.\n\t//\n\t// WithCancel arranges for Done to be closed when cancel is called;\n\t// WithDeadline arranges for Done to be closed when the deadline\n\t// expires; WithTimeout arranges for Done to be closed when the timeout\n\t// elapses.\n\t//\n\t// Done is provided for use in select statements:\n\t//\n\t// // Stream generates values with DoSomething and sends them to out\n\t// // until DoSomething returns an error or ctx.Done is closed.\n\t// func Stream(ctx context.Context, out chan<- Value) error {\n\t// \tfor {\n\t// \t\tv, err := DoSomething(ctx)\n\t// \t\tif err != nil {\n\t// \t\t\treturn err\n\t// \t\t}\n\t// \t\tselect {\n\t// \t\tcase <-ctx.Done():\n\t// \t\t\treturn ctx.Err()\n\t// \t\tcase out <- v:\n\t// \t\t}\n\t// \t}\n\t// }\n\t//\n\t// See http://blog.golang.org/pipelines for more examples of how to use\n\t// a Done channel for cancelation.\n\tDone() <-chan struct{}\n\n\t// Err returns a non-nil error value after Done is closed. Err returns\n\t// Canceled if the context was canceled or DeadlineExceeded if the\n\t// context's deadline passed. No other values for Err are defined.\n\t// After Done is closed, successive calls to Err return the same value.\n\tErr() error\n\n\t// Value returns the value associated with this context for key, or nil\n\t// if no value is associated with key. Successive calls to Value with\n\t// the same key returns the same result.\n\t//\n\t// Use context values only for request-scoped data that transits\n\t// processes and API boundaries, not for passing optional parameters to\n\t// functions.\n\t//\n\t// A key identifies a specific value in a Context. Functions that wish\n\t// to store values in Context typically allocate a key in a global\n\t// variable then use that key as the argument to context.WithValue and\n\t// Context.Value. A key can be any type that supports equality;\n\t// packages should define keys as an unexported type to avoid\n\t// collisions.\n\t//\n\t// Packages that define a Context key should provide type-safe accessors\n\t// for the values stores using that key:\n\t//\n\t// \t// Package user defines a User type that's stored in Contexts.\n\t// \tpackage user\n\t//\n\t// \timport \"golang.org/x/net/context\"\n\t//\n\t// \t// User is the type of value stored in the Contexts.\n\t// \ttype User struct {...}\n\t//\n\t// \t// key is an unexported type for keys defined in this package.\n\t// \t// This prevents collisions with keys defined in other packages.\n\t// \ttype key int\n\t//\n\t// \t// userKey is the key for user.User values in Contexts. It is\n\t// \t// unexported; clients use user.NewContext and user.FromContext\n\t// \t// instead of using this key directly.\n\t// \tvar userKey key = 0\n\t//\n\t// \t// NewContext returns a new Context that carries value u.\n\t// \tfunc NewContext(ctx context.Context, u *User) context.Context {\n\t// \t\treturn context.WithValue(ctx, userKey, u)\n\t// \t}\n\t//\n\t// \t// FromContext returns the User value stored in ctx, if any.\n\t// \tfunc FromContext(ctx context.Context) (*User, bool) {\n\t// \t\tu, ok := ctx.Value(userKey).(*User)\n\t// \t\treturn u, ok\n\t// \t}\n\tValue(key interface{}) interface{}\n}\n\n// A CancelFunc tells an operation to abandon its work.\n// A CancelFunc does not wait for the work to stop.\n// After the first call, subsequent calls to a CancelFunc do nothing.\ntype CancelFunc func()\n" }, { "path": "vendor/golang.org/x/net/idna/idna10.0.0.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build go1.10\n\n// Package idna implements IDNA2008 using the compatibility processing\n// defined by UTS (Unicode Technical Standard) #46, which defines a standard to\n// deal with the transition from IDNA2003.\n//\n// IDNA2008 (Internationalized Domain Names for Applications), is defined in RFC\n// 5890, RFC 5891, RFC 5892, RFC 5893 and RFC 5894.\n// UTS #46 is defined in https://www.unicode.org/reports/tr46.\n// See https://unicode.org/cldr/utility/idna.jsp for a visualization of the\n// differences between these two standards.\npackage idna // import \"golang.org/x/net/idna\"\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\t\"unicode/utf8\"\n\n\t\"golang.org/x/text/secure/bidirule\"\n\t\"golang.org/x/text/unicode/bidi\"\n\t\"golang.org/x/text/unicode/norm\"\n)\n\n// NOTE: Unlike common practice in Go APIs, the functions will return a\n// sanitized domain name in case of errors. Browsers sometimes use a partially\n// evaluated string as lookup.\n// TODO: the current error handling is, in my opinion, the least opinionated.\n// Other strategies are also viable, though:\n// Option 1) Return an empty string in case of error, but allow the user to\n// specify explicitly which errors to ignore.\n// Option 2) Return the partially evaluated string if it is itself a valid\n// string, otherwise return the empty string in case of error.\n// Option 3) Option 1 and 2.\n// Option 4) Always return an empty string for now and implement Option 1 as\n// needed, and document that the return string may not be empty in case of\n// error in the future.\n// I think Option 1 is best, but it is quite opinionated.\n\n// ToASCII is a wrapper for Punycode.ToASCII.\nfunc ToASCII(s string) (string, error) {\n\treturn Punycode.process(s, true)\n}\n\n// ToUnicode is a wrapper for Punycode.ToUnicode.\nfunc ToUnicode(s string) (string, error) {\n\treturn Punycode.process(s, false)\n}\n\n// An Option configures a Profile at creation time.\ntype Option func(*options)\n\n// Transitional sets a Profile to use the Transitional mapping as defined in UTS\n// #46. This will cause, for example, \"ß\" to be mapped to \"ss\". Using the\n// transitional mapping provides a compromise between IDNA2003 and IDNA2008\n// compatibility. It is used by most browsers when resolving domain names. This\n// option is only meaningful if combined with MapForLookup.\nfunc Transitional(transitional bool) Option {\n\treturn func(o *options) { o.transitional = true }\n}\n\n// VerifyDNSLength sets whether a Profile should fail if any of the IDN parts\n// are longer than allowed by the RFC.\nfunc VerifyDNSLength(verify bool) Option {\n\treturn func(o *options) { o.verifyDNSLength = verify }\n}\n\n// RemoveLeadingDots removes leading label separators. Leading runes that map to\n// dots, such as U+3002 IDEOGRAPHIC FULL STOP, are removed as well.\n//\n// This is the behavior suggested by the UTS #46 and is adopted by some\n// browsers.\nfunc RemoveLeadingDots(remove bool) Option {\n\treturn func(o *options) { o.removeLeadingDots = remove }\n}\n\n// ValidateLabels sets whether to check the mandatory label validation criteria\n// as defined in Section 5.4 of RFC 5891. This includes testing for correct use\n// of hyphens ('-'), normalization, validity of runes, and the context rules.\nfunc ValidateLabels(enable bool) Option {\n\treturn func(o *options) {\n\t\t// Don't override existing mappings, but set one that at least checks\n\t\t// normalization if it is not set.\n\t\tif o.mapping == nil && enable {\n\t\t\to.mapping = normalize\n\t\t}\n\t\to.trie = trie\n\t\to.validateLabels = enable\n\t\to.fromPuny = validateFromPunycode\n\t}\n}\n\n// StrictDomainName limits the set of permissible ASCII characters to those\n// allowed in domain names as defined in RFC 1034 (A-Z, a-z, 0-9 and the\n// hyphen). This is set by default for MapForLookup and ValidateForRegistration.\n//\n// This option is useful, for instance, for browsers that allow characters\n// outside this range, for example a '_' (U+005F LOW LINE). See\n// http://www.rfc-editor.org/std/std3.txt for more details This option\n// corresponds to the UseSTD3ASCIIRules option in UTS #46.\nfunc StrictDomainName(use bool) Option {\n\treturn func(o *options) {\n\t\to.trie = trie\n\t\to.useSTD3Rules = use\n\t\to.fromPuny = validateFromPunycode\n\t}\n}\n\n// NOTE: the following options pull in tables. The tables should not be linked\n// in as long as the options are not used.\n\n// BidiRule enables the Bidi rule as defined in RFC 5893. Any application\n// that relies on proper validation of labels should include this rule.\nfunc BidiRule() Option {\n\treturn func(o *options) { o.bidirule = bidirule.ValidString }\n}\n\n// ValidateForRegistration sets validation options to verify that a given IDN is\n// properly formatted for registration as defined by Section 4 of RFC 5891.\nfunc ValidateForRegistration() Option {\n\treturn func(o *options) {\n\t\to.mapping = validateRegistration\n\t\tStrictDomainName(true)(o)\n\t\tValidateLabels(true)(o)\n\t\tVerifyDNSLength(true)(o)\n\t\tBidiRule()(o)\n\t}\n}\n\n// MapForLookup sets validation and mapping options such that a given IDN is\n// transformed for domain name lookup according to the requirements set out in\n// Section 5 of RFC 5891. The mappings follow the recommendations of RFC 5894,\n// RFC 5895 and UTS 46. It does not add the Bidi Rule. Use the BidiRule option\n// to add this check.\n//\n// The mappings include normalization and mapping case, width and other\n// compatibility mappings.\nfunc MapForLookup() Option {\n\treturn func(o *options) {\n\t\to.mapping = validateAndMap\n\t\tStrictDomainName(true)(o)\n\t\tValidateLabels(true)(o)\n\t}\n}\n\ntype options struct {\n\ttransitional bool\n\tuseSTD3Rules bool\n\tvalidateLabels bool\n\tverifyDNSLength bool\n\tremoveLeadingDots bool\n\n\ttrie *idnaTrie\n\n\t// fromPuny calls validation rules when converting A-labels to U-labels.\n\tfromPuny func(p *Profile, s string) error\n\n\t// mapping implements a validation and mapping step as defined in RFC 5895\n\t// or UTS 46, tailored to, for example, domain registration or lookup.\n\tmapping func(p *Profile, s string) (mapped string, isBidi bool, err error)\n\n\t// bidirule, if specified, checks whether s conforms to the Bidi Rule\n\t// defined in RFC 5893.\n\tbidirule func(s string) bool\n}\n\n// A Profile defines the configuration of an IDNA mapper.\ntype Profile struct {\n\toptions\n}\n\nfunc apply(o *options, opts []Option) {\n\tfor _, f := range opts {\n\t\tf(o)\n\t}\n}\n\n// New creates a new Profile.\n//\n// With no options, the returned Profile is the most permissive and equals the\n// Punycode Profile. Options can be passed to further restrict the Profile. The\n// MapForLookup and ValidateForRegistration options set a collection of options,\n// for lookup and registration purposes respectively, which can be tailored by\n// adding more fine-grained options, where later options override earlier\n// options.\nfunc New(o ...Option) *Profile {\n\tp := &Profile{}\n\tapply(&p.options, o)\n\treturn p\n}\n\n// ToASCII converts a domain or domain label to its ASCII form. For example,\n// ToASCII(\"bücher.example.com\") is \"xn--bcher-kva.example.com\", and\n// ToASCII(\"golang\") is \"golang\". If an error is encountered it will return\n// an error and a (partially) processed result.\nfunc (p *Profile) ToASCII(s string) (string, error) {\n\treturn p.process(s, true)\n}\n\n// ToUnicode converts a domain or domain label to its Unicode form. For example,\n// ToUnicode(\"xn--bcher-kva.example.com\") is \"bücher.example.com\", and\n// ToUnicode(\"golang\") is \"golang\". If an error is encountered it will return\n// an error and a (partially) processed result.\nfunc (p *Profile) ToUnicode(s string) (string, error) {\n\tpp := *p\n\tpp.transitional = false\n\treturn pp.process(s, false)\n}\n\n// String reports a string with a description of the profile for debugging\n// purposes. The string format may change with different versions.\nfunc (p *Profile) String() string {\n\ts := \"\"\n\tif p.transitional {\n\t\ts = \"Transitional\"\n\t} else {\n\t\ts = \"NonTransitional\"\n\t}\n\tif p.useSTD3Rules {\n\t\ts += \":UseSTD3Rules\"\n\t}\n\tif p.validateLabels {\n\t\ts += \":ValidateLabels\"\n\t}\n\tif p.verifyDNSLength {\n\t\ts += \":VerifyDNSLength\"\n\t}\n\treturn s\n}\n\nvar (\n\t// Punycode is a Profile that does raw punycode processing with a minimum\n\t// of validation.\n\tPunycode *Profile = punycode\n\n\t// Lookup is the recommended profile for looking up domain names, according\n\t// to Section 5 of RFC 5891. The exact configuration of this profile may\n\t// change over time.\n\tLookup *Profile = lookup\n\n\t// Display is the recommended profile for displaying domain names.\n\t// The configuration of this profile may change over time.\n\tDisplay *Profile = display\n\n\t// Registration is the recommended profile for checking whether a given\n\t// IDN is valid for registration, according to Section 4 of RFC 5891.\n\tRegistration *Profile = registration\n\n\tpunycode = &Profile{}\n\tlookup = &Profile{options{\n\t\ttransitional: true,\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateAndMap,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\tdisplay = &Profile{options{\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateAndMap,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\tregistration = &Profile{options{\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\tverifyDNSLength: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateRegistration,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\n\t// TODO: profiles\n\t// Register: recommended for approving domain names: don't do any mappings\n\t// but rather reject on invalid input. Bundle or block deviation characters.\n)\n\ntype labelError struct{ label, code_ string }\n\nfunc (e labelError) code() string { return e.code_ }\nfunc (e labelError) Error() string {\n\treturn fmt.Sprintf(\"idna: invalid label %q\", e.label)\n}\n\ntype runeError rune\n\nfunc (e runeError) code() string { return \"P1\" }\nfunc (e runeError) Error() string {\n\treturn fmt.Sprintf(\"idna: disallowed rune %U\", e)\n}\n\n// process implements the algorithm described in section 4 of UTS #46,\n// see https://www.unicode.org/reports/tr46.\nfunc (p *Profile) process(s string, toASCII bool) (string, error) {\n\tvar err error\n\tvar isBidi bool\n\tif p.mapping != nil {\n\t\ts, isBidi, err = p.mapping(p, s)\n\t}\n\t// Remove leading empty labels.\n\tif p.removeLeadingDots {\n\t\tfor ; len(s) > 0 && s[0] == '.'; s = s[1:] {\n\t\t}\n\t}\n\t// TODO: allow for a quick check of the tables data.\n\t// It seems like we should only create this error on ToASCII, but the\n\t// UTS 46 conformance tests suggests we should always check this.\n\tif err == nil && p.verifyDNSLength && s == \"\" {\n\t\terr = &labelError{s, \"A4\"}\n\t}\n\tlabels := labelIter{orig: s}\n\tfor ; !labels.done(); labels.next() {\n\t\tlabel := labels.label()\n\t\tif label == \"\" {\n\t\t\t// Empty labels are not okay. The label iterator skips the last\n\t\t\t// label if it is empty.\n\t\t\tif err == nil && p.verifyDNSLength {\n\t\t\t\terr = &labelError{s, \"A4\"}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif strings.HasPrefix(label, acePrefix) {\n\t\t\tu, err2 := decode(label[len(acePrefix):])\n\t\t\tif err2 != nil {\n\t\t\t\tif err == nil {\n\t\t\t\t\terr = err2\n\t\t\t\t}\n\t\t\t\t// Spec says keep the old label.\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tisBidi = isBidi || bidirule.DirectionString(u) != bidi.LeftToRight\n\t\t\tlabels.set(u)\n\t\t\tif err == nil && p.validateLabels {\n\t\t\t\terr = p.fromPuny(p, u)\n\t\t\t}\n\t\t\tif err == nil {\n\t\t\t\t// This should be called on NonTransitional, according to the\n\t\t\t\t// spec, but that currently does not have any effect. Use the\n\t\t\t\t// original profile to preserve options.\n\t\t\t\terr = p.validateLabel(u)\n\t\t\t}\n\t\t} else if err == nil {\n\t\t\terr = p.validateLabel(label)\n\t\t}\n\t}\n\tif isBidi && p.bidirule != nil && err == nil {\n\t\tfor labels.reset(); !labels.done(); labels.next() {\n\t\t\tif !p.bidirule(labels.label()) {\n\t\t\t\terr = &labelError{s, \"B\"}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tif toASCII {\n\t\tfor labels.reset(); !labels.done(); labels.next() {\n\t\t\tlabel := labels.label()\n\t\t\tif !ascii(label) {\n\t\t\t\ta, err2 := encode(acePrefix, label)\n\t\t\t\tif err == nil {\n\t\t\t\t\terr = err2\n\t\t\t\t}\n\t\t\t\tlabel = a\n\t\t\t\tlabels.set(a)\n\t\t\t}\n\t\t\tn := len(label)\n\t\t\tif p.verifyDNSLength && err == nil && (n == 0 || n > 63) {\n\t\t\t\terr = &labelError{label, \"A4\"}\n\t\t\t}\n\t\t}\n\t}\n\ts = labels.result()\n\tif toASCII && p.verifyDNSLength && err == nil {\n\t\t// Compute the length of the domain name minus the root label and its dot.\n\t\tn := len(s)\n\t\tif n > 0 && s[n-1] == '.' {\n\t\t\tn--\n\t\t}\n\t\tif len(s) < 1 || n > 253 {\n\t\t\terr = &labelError{s, \"A4\"}\n\t\t}\n\t}\n\treturn s, err\n}\n\nfunc normalize(p *Profile, s string) (mapped string, isBidi bool, err error) {\n\t// TODO: consider first doing a quick check to see if any of these checks\n\t// need to be done. This will make it slower in the general case, but\n\t// faster in the common case.\n\tmapped = norm.NFC.String(s)\n\tisBidi = bidirule.DirectionString(mapped) == bidi.RightToLeft\n\treturn mapped, isBidi, nil\n}\n\nfunc validateRegistration(p *Profile, s string) (idem string, bidi bool, err error) {\n\t// TODO: filter need for normalization in loop below.\n\tif !norm.NFC.IsNormalString(s) {\n\t\treturn s, false, &labelError{s, \"V1\"}\n\t}\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\tif sz == 0 {\n\t\t\treturn s, bidi, runeError(utf8.RuneError)\n\t\t}\n\t\tbidi = bidi || info(v).isBidi(s[i:])\n\t\t// Copy bytes not copied so far.\n\t\tswitch p.simplify(info(v).category()) {\n\t\t// TODO: handle the NV8 defined in the Unicode idna data set to allow\n\t\t// for strict conformance to IDNA2008.\n\t\tcase valid, deviation:\n\t\tcase disallowed, mapped, unknown, ignored:\n\t\t\tr, _ := utf8.DecodeRuneInString(s[i:])\n\t\t\treturn s, bidi, runeError(r)\n\t\t}\n\t\ti += sz\n\t}\n\treturn s, bidi, nil\n}\n\nfunc (c info) isBidi(s string) bool {\n\tif !c.isMapped() {\n\t\treturn c&attributesMask == rtl\n\t}\n\t// TODO: also store bidi info for mapped data. This is possible, but a bit\n\t// cumbersome and not for the common case.\n\tp, _ := bidi.LookupString(s)\n\tswitch p.Class() {\n\tcase bidi.R, bidi.AL, bidi.AN:\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc validateAndMap(p *Profile, s string) (vm string, bidi bool, err error) {\n\tvar (\n\t\tb []byte\n\t\tk int\n\t)\n\t// combinedInfoBits contains the or-ed bits of all runes. We use this\n\t// to derive the mayNeedNorm bit later. This may trigger normalization\n\t// overeagerly, but it will not do so in the common case. The end result\n\t// is another 10% saving on BenchmarkProfile for the common case.\n\tvar combinedInfoBits info\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\tif sz == 0 {\n\t\t\tb = append(b, s[k:i]...)\n\t\t\tb = append(b, \"\\ufffd\"...)\n\t\t\tk = len(s)\n\t\t\tif err == nil {\n\t\t\t\terr = runeError(utf8.RuneError)\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t\tcombinedInfoBits |= info(v)\n\t\tbidi = bidi || info(v).isBidi(s[i:])\n\t\tstart := i\n\t\ti += sz\n\t\t// Copy bytes not copied so far.\n\t\tswitch p.simplify(info(v).category()) {\n\t\tcase valid:\n\t\t\tcontinue\n\t\tcase disallowed:\n\t\t\tif err == nil {\n\t\t\t\tr, _ := utf8.DecodeRuneInString(s[start:])\n\t\t\t\terr = runeError(r)\n\t\t\t}\n\t\t\tcontinue\n\t\tcase mapped, deviation:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\tb = info(v).appendMapping(b, s[start:i])\n\t\tcase ignored:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\t// drop the rune\n\t\tcase unknown:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\tb = append(b, \"\\ufffd\"...)\n\t\t}\n\t\tk = i\n\t}\n\tif k == 0 {\n\t\t// No changes so far.\n\t\tif combinedInfoBits&mayNeedNorm != 0 {\n\t\t\ts = norm.NFC.String(s)\n\t\t}\n\t} else {\n\t\tb = append(b, s[k:]...)\n\t\tif norm.NFC.QuickSpan(b) != len(b) {\n\t\t\tb = norm.NFC.Bytes(b)\n\t\t}\n\t\t// TODO: the punycode converters require strings as input.\n\t\ts = string(b)\n\t}\n\treturn s, bidi, err\n}\n\n// A labelIter allows iterating over domain name labels.\ntype labelIter struct {\n\torig string\n\tslice []string\n\tcurStart int\n\tcurEnd int\n\ti int\n}\n\nfunc (l *labelIter) reset() {\n\tl.curStart = 0\n\tl.curEnd = 0\n\tl.i = 0\n}\n\nfunc (l *labelIter) done() bool {\n\treturn l.curStart >= len(l.orig)\n}\n\nfunc (l *labelIter) result() string {\n\tif l.slice != nil {\n\t\treturn strings.Join(l.slice, \".\")\n\t}\n\treturn l.orig\n}\n\nfunc (l *labelIter) label() string {\n\tif l.slice != nil {\n\t\treturn l.slice[l.i]\n\t}\n\tp := strings.IndexByte(l.orig[l.curStart:], '.')\n\tl.curEnd = l.curStart + p\n\tif p == -1 {\n\t\tl.curEnd = len(l.orig)\n\t}\n\treturn l.orig[l.curStart:l.curEnd]\n}\n\n// next sets the value to the next label. It skips the last label if it is empty.\nfunc (l *labelIter) next() {\n\tl.i++\n\tif l.slice != nil {\n\t\tif l.i >= len(l.slice) || l.i == len(l.slice)-1 && l.slice[l.i] == \"\" {\n\t\t\tl.curStart = len(l.orig)\n\t\t}\n\t} else {\n\t\tl.curStart = l.curEnd + 1\n\t\tif l.curStart == len(l.orig)-1 && l.orig[l.curStart] == '.' {\n\t\t\tl.curStart = len(l.orig)\n\t\t}\n\t}\n}\n\nfunc (l *labelIter) set(s string) {\n\tif l.slice == nil {\n\t\tl.slice = strings.Split(l.orig, \".\")\n\t}\n\tl.slice[l.i] = s\n}\n\n// acePrefix is the ASCII Compatible Encoding prefix.\nconst acePrefix = \"xn--\"\n\nfunc (p *Profile) simplify(cat category) category {\n\tswitch cat {\n\tcase disallowedSTD3Mapped:\n\t\tif p.useSTD3Rules {\n\t\t\tcat = disallowed\n\t\t} else {\n\t\t\tcat = mapped\n\t\t}\n\tcase disallowedSTD3Valid:\n\t\tif p.useSTD3Rules {\n\t\t\tcat = disallowed\n\t\t} else {\n\t\t\tcat = valid\n\t\t}\n\tcase deviation:\n\t\tif !p.transitional {\n\t\t\tcat = valid\n\t\t}\n\tcase validNV8, validXV8:\n\t\t// TODO: handle V2008\n\t\tcat = valid\n\t}\n\treturn cat\n}\n\nfunc validateFromPunycode(p *Profile, s string) error {\n\tif !norm.NFC.IsNormalString(s) {\n\t\treturn &labelError{s, \"V1\"}\n\t}\n\t// TODO: detect whether string may have to be normalized in the following\n\t// loop.\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\tif sz == 0 {\n\t\t\treturn runeError(utf8.RuneError)\n\t\t}\n\t\tif c := p.simplify(info(v).category()); c != valid && c != deviation {\n\t\t\treturn &labelError{s, \"V6\"}\n\t\t}\n\t\ti += sz\n\t}\n\treturn nil\n}\n\nconst (\n\tzwnj = \"\\u200c\"\n\tzwj = \"\\u200d\"\n)\n\ntype joinState int8\n\nconst (\n\tstateStart joinState = iota\n\tstateVirama\n\tstateBefore\n\tstateBeforeVirama\n\tstateAfter\n\tstateFAIL\n)\n\nvar joinStates = [][numJoinTypes]joinState{\n\tstateStart: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateVirama,\n\t},\n\tstateVirama: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t},\n\tstateBefore: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateBefore,\n\t\tjoinZWNJ: stateAfter,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateBeforeVirama,\n\t},\n\tstateBeforeVirama: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateBefore,\n\t},\n\tstateAfter: {\n\t\tjoiningL: stateFAIL,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateAfter,\n\t\tjoiningR: stateStart,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateAfter, // no-op as we can't accept joiners here\n\t},\n\tstateFAIL: {\n\t\t0: stateFAIL,\n\t\tjoiningL: stateFAIL,\n\t\tjoiningD: stateFAIL,\n\t\tjoiningT: stateFAIL,\n\t\tjoiningR: stateFAIL,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateFAIL,\n\t},\n}\n\n// validateLabel validates the criteria from Section 4.1. Item 1, 4, and 6 are\n// already implicitly satisfied by the overall implementation.\nfunc (p *Profile) validateLabel(s string) (err error) {\n\tif s == \"\" {\n\t\tif p.verifyDNSLength {\n\t\t\treturn &labelError{s, \"A4\"}\n\t\t}\n\t\treturn nil\n\t}\n\tif !p.validateLabels {\n\t\treturn nil\n\t}\n\ttrie := p.trie // p.validateLabels is only set if trie is set.\n\tif len(s) > 4 && s[2] == '-' && s[3] == '-' {\n\t\treturn &labelError{s, \"V2\"}\n\t}\n\tif s[0] == '-' || s[len(s)-1] == '-' {\n\t\treturn &labelError{s, \"V3\"}\n\t}\n\t// TODO: merge the use of this in the trie.\n\tv, sz := trie.lookupString(s)\n\tx := info(v)\n\tif x.isModifier() {\n\t\treturn &labelError{s, \"V5\"}\n\t}\n\t// Quickly return in the absence of zero-width (non) joiners.\n\tif strings.Index(s, zwj) == -1 && strings.Index(s, zwnj) == -1 {\n\t\treturn nil\n\t}\n\tst := stateStart\n\tfor i := 0; ; {\n\t\tjt := x.joinType()\n\t\tif s[i:i+sz] == zwj {\n\t\t\tjt = joinZWJ\n\t\t} else if s[i:i+sz] == zwnj {\n\t\t\tjt = joinZWNJ\n\t\t}\n\t\tst = joinStates[st][jt]\n\t\tif x.isViramaModifier() {\n\t\t\tst = joinStates[st][joinVirama]\n\t\t}\n\t\tif i += sz; i == len(s) {\n\t\t\tbreak\n\t\t}\n\t\tv, sz = trie.lookupString(s[i:])\n\t\tx = info(v)\n\t}\n\tif st == stateFAIL || st == stateAfter {\n\t\treturn &labelError{s, \"C\"}\n\t}\n\treturn nil\n}\n\nfunc ascii(s string) bool {\n\tfor i := 0; i < len(s); i++ {\n\t\tif s[i] >= utf8.RuneSelf {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n" }, { "path": "vendor/golang.org/x/net/idna/idna9.0.0.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build !go1.10\n\n// Package idna implements IDNA2008 using the compatibility processing\n// defined by UTS (Unicode Technical Standard) #46, which defines a standard to\n// deal with the transition from IDNA2003.\n//\n// IDNA2008 (Internationalized Domain Names for Applications), is defined in RFC\n// 5890, RFC 5891, RFC 5892, RFC 5893 and RFC 5894.\n// UTS #46 is defined in https://www.unicode.org/reports/tr46.\n// See https://unicode.org/cldr/utility/idna.jsp for a visualization of the\n// differences between these two standards.\npackage idna // import \"golang.org/x/net/idna\"\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\t\"unicode/utf8\"\n\n\t\"golang.org/x/text/secure/bidirule\"\n\t\"golang.org/x/text/unicode/norm\"\n)\n\n// NOTE: Unlike common practice in Go APIs, the functions will return a\n// sanitized domain name in case of errors. Browsers sometimes use a partially\n// evaluated string as lookup.\n// TODO: the current error handling is, in my opinion, the least opinionated.\n// Other strategies are also viable, though:\n// Option 1) Return an empty string in case of error, but allow the user to\n// specify explicitly which errors to ignore.\n// Option 2) Return the partially evaluated string if it is itself a valid\n// string, otherwise return the empty string in case of error.\n// Option 3) Option 1 and 2.\n// Option 4) Always return an empty string for now and implement Option 1 as\n// needed, and document that the return string may not be empty in case of\n// error in the future.\n// I think Option 1 is best, but it is quite opinionated.\n\n// ToASCII is a wrapper for Punycode.ToASCII.\nfunc ToASCII(s string) (string, error) {\n\treturn Punycode.process(s, true)\n}\n\n// ToUnicode is a wrapper for Punycode.ToUnicode.\nfunc ToUnicode(s string) (string, error) {\n\treturn Punycode.process(s, false)\n}\n\n// An Option configures a Profile at creation time.\ntype Option func(*options)\n\n// Transitional sets a Profile to use the Transitional mapping as defined in UTS\n// #46. This will cause, for example, \"ß\" to be mapped to \"ss\". Using the\n// transitional mapping provides a compromise between IDNA2003 and IDNA2008\n// compatibility. It is used by most browsers when resolving domain names. This\n// option is only meaningful if combined with MapForLookup.\nfunc Transitional(transitional bool) Option {\n\treturn func(o *options) { o.transitional = true }\n}\n\n// VerifyDNSLength sets whether a Profile should fail if any of the IDN parts\n// are longer than allowed by the RFC.\nfunc VerifyDNSLength(verify bool) Option {\n\treturn func(o *options) { o.verifyDNSLength = verify }\n}\n\n// RemoveLeadingDots removes leading label separators. Leading runes that map to\n// dots, such as U+3002 IDEOGRAPHIC FULL STOP, are removed as well.\n//\n// This is the behavior suggested by the UTS #46 and is adopted by some\n// browsers.\nfunc RemoveLeadingDots(remove bool) Option {\n\treturn func(o *options) { o.removeLeadingDots = remove }\n}\n\n// ValidateLabels sets whether to check the mandatory label validation criteria\n// as defined in Section 5.4 of RFC 5891. This includes testing for correct use\n// of hyphens ('-'), normalization, validity of runes, and the context rules.\nfunc ValidateLabels(enable bool) Option {\n\treturn func(o *options) {\n\t\t// Don't override existing mappings, but set one that at least checks\n\t\t// normalization if it is not set.\n\t\tif o.mapping == nil && enable {\n\t\t\to.mapping = normalize\n\t\t}\n\t\to.trie = trie\n\t\to.validateLabels = enable\n\t\to.fromPuny = validateFromPunycode\n\t}\n}\n\n// StrictDomainName limits the set of permissable ASCII characters to those\n// allowed in domain names as defined in RFC 1034 (A-Z, a-z, 0-9 and the\n// hyphen). This is set by default for MapForLookup and ValidateForRegistration.\n//\n// This option is useful, for instance, for browsers that allow characters\n// outside this range, for example a '_' (U+005F LOW LINE). See\n// http://www.rfc-editor.org/std/std3.txt for more details This option\n// corresponds to the UseSTD3ASCIIRules option in UTS #46.\nfunc StrictDomainName(use bool) Option {\n\treturn func(o *options) {\n\t\to.trie = trie\n\t\to.useSTD3Rules = use\n\t\to.fromPuny = validateFromPunycode\n\t}\n}\n\n// NOTE: the following options pull in tables. The tables should not be linked\n// in as long as the options are not used.\n\n// BidiRule enables the Bidi rule as defined in RFC 5893. Any application\n// that relies on proper validation of labels should include this rule.\nfunc BidiRule() Option {\n\treturn func(o *options) { o.bidirule = bidirule.ValidString }\n}\n\n// ValidateForRegistration sets validation options to verify that a given IDN is\n// properly formatted for registration as defined by Section 4 of RFC 5891.\nfunc ValidateForRegistration() Option {\n\treturn func(o *options) {\n\t\to.mapping = validateRegistration\n\t\tStrictDomainName(true)(o)\n\t\tValidateLabels(true)(o)\n\t\tVerifyDNSLength(true)(o)\n\t\tBidiRule()(o)\n\t}\n}\n\n// MapForLookup sets validation and mapping options such that a given IDN is\n// transformed for domain name lookup according to the requirements set out in\n// Section 5 of RFC 5891. The mappings follow the recommendations of RFC 5894,\n// RFC 5895 and UTS 46. It does not add the Bidi Rule. Use the BidiRule option\n// to add this check.\n//\n// The mappings include normalization and mapping case, width and other\n// compatibility mappings.\nfunc MapForLookup() Option {\n\treturn func(o *options) {\n\t\to.mapping = validateAndMap\n\t\tStrictDomainName(true)(o)\n\t\tValidateLabels(true)(o)\n\t\tRemoveLeadingDots(true)(o)\n\t}\n}\n\ntype options struct {\n\ttransitional bool\n\tuseSTD3Rules bool\n\tvalidateLabels bool\n\tverifyDNSLength bool\n\tremoveLeadingDots bool\n\n\ttrie *idnaTrie\n\n\t// fromPuny calls validation rules when converting A-labels to U-labels.\n\tfromPuny func(p *Profile, s string) error\n\n\t// mapping implements a validation and mapping step as defined in RFC 5895\n\t// or UTS 46, tailored to, for example, domain registration or lookup.\n\tmapping func(p *Profile, s string) (string, error)\n\n\t// bidirule, if specified, checks whether s conforms to the Bidi Rule\n\t// defined in RFC 5893.\n\tbidirule func(s string) bool\n}\n\n// A Profile defines the configuration of a IDNA mapper.\ntype Profile struct {\n\toptions\n}\n\nfunc apply(o *options, opts []Option) {\n\tfor _, f := range opts {\n\t\tf(o)\n\t}\n}\n\n// New creates a new Profile.\n//\n// With no options, the returned Profile is the most permissive and equals the\n// Punycode Profile. Options can be passed to further restrict the Profile. The\n// MapForLookup and ValidateForRegistration options set a collection of options,\n// for lookup and registration purposes respectively, which can be tailored by\n// adding more fine-grained options, where later options override earlier\n// options.\nfunc New(o ...Option) *Profile {\n\tp := &Profile{}\n\tapply(&p.options, o)\n\treturn p\n}\n\n// ToASCII converts a domain or domain label to its ASCII form. For example,\n// ToASCII(\"bücher.example.com\") is \"xn--bcher-kva.example.com\", and\n// ToASCII(\"golang\") is \"golang\". If an error is encountered it will return\n// an error and a (partially) processed result.\nfunc (p *Profile) ToASCII(s string) (string, error) {\n\treturn p.process(s, true)\n}\n\n// ToUnicode converts a domain or domain label to its Unicode form. For example,\n// ToUnicode(\"xn--bcher-kva.example.com\") is \"bücher.example.com\", and\n// ToUnicode(\"golang\") is \"golang\". If an error is encountered it will return\n// an error and a (partially) processed result.\nfunc (p *Profile) ToUnicode(s string) (string, error) {\n\tpp := *p\n\tpp.transitional = false\n\treturn pp.process(s, false)\n}\n\n// String reports a string with a description of the profile for debugging\n// purposes. The string format may change with different versions.\nfunc (p *Profile) String() string {\n\ts := \"\"\n\tif p.transitional {\n\t\ts = \"Transitional\"\n\t} else {\n\t\ts = \"NonTransitional\"\n\t}\n\tif p.useSTD3Rules {\n\t\ts += \":UseSTD3Rules\"\n\t}\n\tif p.validateLabels {\n\t\ts += \":ValidateLabels\"\n\t}\n\tif p.verifyDNSLength {\n\t\ts += \":VerifyDNSLength\"\n\t}\n\treturn s\n}\n\nvar (\n\t// Punycode is a Profile that does raw punycode processing with a minimum\n\t// of validation.\n\tPunycode *Profile = punycode\n\n\t// Lookup is the recommended profile for looking up domain names, according\n\t// to Section 5 of RFC 5891. The exact configuration of this profile may\n\t// change over time.\n\tLookup *Profile = lookup\n\n\t// Display is the recommended profile for displaying domain names.\n\t// The configuration of this profile may change over time.\n\tDisplay *Profile = display\n\n\t// Registration is the recommended profile for checking whether a given\n\t// IDN is valid for registration, according to Section 4 of RFC 5891.\n\tRegistration *Profile = registration\n\n\tpunycode = &Profile{}\n\tlookup = &Profile{options{\n\t\ttransitional: true,\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\tremoveLeadingDots: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateAndMap,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\tdisplay = &Profile{options{\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\tremoveLeadingDots: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateAndMap,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\tregistration = &Profile{options{\n\t\tuseSTD3Rules: true,\n\t\tvalidateLabels: true,\n\t\tverifyDNSLength: true,\n\t\ttrie: trie,\n\t\tfromPuny: validateFromPunycode,\n\t\tmapping: validateRegistration,\n\t\tbidirule: bidirule.ValidString,\n\t}}\n\n\t// TODO: profiles\n\t// Register: recommended for approving domain names: don't do any mappings\n\t// but rather reject on invalid input. Bundle or block deviation characters.\n)\n\ntype labelError struct{ label, code_ string }\n\nfunc (e labelError) code() string { return e.code_ }\nfunc (e labelError) Error() string {\n\treturn fmt.Sprintf(\"idna: invalid label %q\", e.label)\n}\n\ntype runeError rune\n\nfunc (e runeError) code() string { return \"P1\" }\nfunc (e runeError) Error() string {\n\treturn fmt.Sprintf(\"idna: disallowed rune %U\", e)\n}\n\n// process implements the algorithm described in section 4 of UTS #46,\n// see https://www.unicode.org/reports/tr46.\nfunc (p *Profile) process(s string, toASCII bool) (string, error) {\n\tvar err error\n\tif p.mapping != nil {\n\t\ts, err = p.mapping(p, s)\n\t}\n\t// Remove leading empty labels.\n\tif p.removeLeadingDots {\n\t\tfor ; len(s) > 0 && s[0] == '.'; s = s[1:] {\n\t\t}\n\t}\n\t// It seems like we should only create this error on ToASCII, but the\n\t// UTS 46 conformance tests suggests we should always check this.\n\tif err == nil && p.verifyDNSLength && s == \"\" {\n\t\terr = &labelError{s, \"A4\"}\n\t}\n\tlabels := labelIter{orig: s}\n\tfor ; !labels.done(); labels.next() {\n\t\tlabel := labels.label()\n\t\tif label == \"\" {\n\t\t\t// Empty labels are not okay. The label iterator skips the last\n\t\t\t// label if it is empty.\n\t\t\tif err == nil && p.verifyDNSLength {\n\t\t\t\terr = &labelError{s, \"A4\"}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif strings.HasPrefix(label, acePrefix) {\n\t\t\tu, err2 := decode(label[len(acePrefix):])\n\t\t\tif err2 != nil {\n\t\t\t\tif err == nil {\n\t\t\t\t\terr = err2\n\t\t\t\t}\n\t\t\t\t// Spec says keep the old label.\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tlabels.set(u)\n\t\t\tif err == nil && p.validateLabels {\n\t\t\t\terr = p.fromPuny(p, u)\n\t\t\t}\n\t\t\tif err == nil {\n\t\t\t\t// This should be called on NonTransitional, according to the\n\t\t\t\t// spec, but that currently does not have any effect. Use the\n\t\t\t\t// original profile to preserve options.\n\t\t\t\terr = p.validateLabel(u)\n\t\t\t}\n\t\t} else if err == nil {\n\t\t\terr = p.validateLabel(label)\n\t\t}\n\t}\n\tif toASCII {\n\t\tfor labels.reset(); !labels.done(); labels.next() {\n\t\t\tlabel := labels.label()\n\t\t\tif !ascii(label) {\n\t\t\t\ta, err2 := encode(acePrefix, label)\n\t\t\t\tif err == nil {\n\t\t\t\t\terr = err2\n\t\t\t\t}\n\t\t\t\tlabel = a\n\t\t\t\tlabels.set(a)\n\t\t\t}\n\t\t\tn := len(label)\n\t\t\tif p.verifyDNSLength && err == nil && (n == 0 || n > 63) {\n\t\t\t\terr = &labelError{label, \"A4\"}\n\t\t\t}\n\t\t}\n\t}\n\ts = labels.result()\n\tif toASCII && p.verifyDNSLength && err == nil {\n\t\t// Compute the length of the domain name minus the root label and its dot.\n\t\tn := len(s)\n\t\tif n > 0 && s[n-1] == '.' {\n\t\t\tn--\n\t\t}\n\t\tif len(s) < 1 || n > 253 {\n\t\t\terr = &labelError{s, \"A4\"}\n\t\t}\n\t}\n\treturn s, err\n}\n\nfunc normalize(p *Profile, s string) (string, error) {\n\treturn norm.NFC.String(s), nil\n}\n\nfunc validateRegistration(p *Profile, s string) (string, error) {\n\tif !norm.NFC.IsNormalString(s) {\n\t\treturn s, &labelError{s, \"V1\"}\n\t}\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\t// Copy bytes not copied so far.\n\t\tswitch p.simplify(info(v).category()) {\n\t\t// TODO: handle the NV8 defined in the Unicode idna data set to allow\n\t\t// for strict conformance to IDNA2008.\n\t\tcase valid, deviation:\n\t\tcase disallowed, mapped, unknown, ignored:\n\t\t\tr, _ := utf8.DecodeRuneInString(s[i:])\n\t\t\treturn s, runeError(r)\n\t\t}\n\t\ti += sz\n\t}\n\treturn s, nil\n}\n\nfunc validateAndMap(p *Profile, s string) (string, error) {\n\tvar (\n\t\terr error\n\t\tb []byte\n\t\tk int\n\t)\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\tstart := i\n\t\ti += sz\n\t\t// Copy bytes not copied so far.\n\t\tswitch p.simplify(info(v).category()) {\n\t\tcase valid:\n\t\t\tcontinue\n\t\tcase disallowed:\n\t\t\tif err == nil {\n\t\t\t\tr, _ := utf8.DecodeRuneInString(s[start:])\n\t\t\t\terr = runeError(r)\n\t\t\t}\n\t\t\tcontinue\n\t\tcase mapped, deviation:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\tb = info(v).appendMapping(b, s[start:i])\n\t\tcase ignored:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\t// drop the rune\n\t\tcase unknown:\n\t\t\tb = append(b, s[k:start]...)\n\t\t\tb = append(b, \"\\ufffd\"...)\n\t\t}\n\t\tk = i\n\t}\n\tif k == 0 {\n\t\t// No changes so far.\n\t\ts = norm.NFC.String(s)\n\t} else {\n\t\tb = append(b, s[k:]...)\n\t\tif norm.NFC.QuickSpan(b) != len(b) {\n\t\t\tb = norm.NFC.Bytes(b)\n\t\t}\n\t\t// TODO: the punycode converters require strings as input.\n\t\ts = string(b)\n\t}\n\treturn s, err\n}\n\n// A labelIter allows iterating over domain name labels.\ntype labelIter struct {\n\torig string\n\tslice []string\n\tcurStart int\n\tcurEnd int\n\ti int\n}\n\nfunc (l *labelIter) reset() {\n\tl.curStart = 0\n\tl.curEnd = 0\n\tl.i = 0\n}\n\nfunc (l *labelIter) done() bool {\n\treturn l.curStart >= len(l.orig)\n}\n\nfunc (l *labelIter) result() string {\n\tif l.slice != nil {\n\t\treturn strings.Join(l.slice, \".\")\n\t}\n\treturn l.orig\n}\n\nfunc (l *labelIter) label() string {\n\tif l.slice != nil {\n\t\treturn l.slice[l.i]\n\t}\n\tp := strings.IndexByte(l.orig[l.curStart:], '.')\n\tl.curEnd = l.curStart + p\n\tif p == -1 {\n\t\tl.curEnd = len(l.orig)\n\t}\n\treturn l.orig[l.curStart:l.curEnd]\n}\n\n// next sets the value to the next label. It skips the last label if it is empty.\nfunc (l *labelIter) next() {\n\tl.i++\n\tif l.slice != nil {\n\t\tif l.i >= len(l.slice) || l.i == len(l.slice)-1 && l.slice[l.i] == \"\" {\n\t\t\tl.curStart = len(l.orig)\n\t\t}\n\t} else {\n\t\tl.curStart = l.curEnd + 1\n\t\tif l.curStart == len(l.orig)-1 && l.orig[l.curStart] == '.' {\n\t\t\tl.curStart = len(l.orig)\n\t\t}\n\t}\n}\n\nfunc (l *labelIter) set(s string) {\n\tif l.slice == nil {\n\t\tl.slice = strings.Split(l.orig, \".\")\n\t}\n\tl.slice[l.i] = s\n}\n\n// acePrefix is the ASCII Compatible Encoding prefix.\nconst acePrefix = \"xn--\"\n\nfunc (p *Profile) simplify(cat category) category {\n\tswitch cat {\n\tcase disallowedSTD3Mapped:\n\t\tif p.useSTD3Rules {\n\t\t\tcat = disallowed\n\t\t} else {\n\t\t\tcat = mapped\n\t\t}\n\tcase disallowedSTD3Valid:\n\t\tif p.useSTD3Rules {\n\t\t\tcat = disallowed\n\t\t} else {\n\t\t\tcat = valid\n\t\t}\n\tcase deviation:\n\t\tif !p.transitional {\n\t\t\tcat = valid\n\t\t}\n\tcase validNV8, validXV8:\n\t\t// TODO: handle V2008\n\t\tcat = valid\n\t}\n\treturn cat\n}\n\nfunc validateFromPunycode(p *Profile, s string) error {\n\tif !norm.NFC.IsNormalString(s) {\n\t\treturn &labelError{s, \"V1\"}\n\t}\n\tfor i := 0; i < len(s); {\n\t\tv, sz := trie.lookupString(s[i:])\n\t\tif c := p.simplify(info(v).category()); c != valid && c != deviation {\n\t\t\treturn &labelError{s, \"V6\"}\n\t\t}\n\t\ti += sz\n\t}\n\treturn nil\n}\n\nconst (\n\tzwnj = \"\\u200c\"\n\tzwj = \"\\u200d\"\n)\n\ntype joinState int8\n\nconst (\n\tstateStart joinState = iota\n\tstateVirama\n\tstateBefore\n\tstateBeforeVirama\n\tstateAfter\n\tstateFAIL\n)\n\nvar joinStates = [][numJoinTypes]joinState{\n\tstateStart: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateVirama,\n\t},\n\tstateVirama: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t},\n\tstateBefore: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateBefore,\n\t\tjoinZWNJ: stateAfter,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateBeforeVirama,\n\t},\n\tstateBeforeVirama: {\n\t\tjoiningL: stateBefore,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateBefore,\n\t},\n\tstateAfter: {\n\t\tjoiningL: stateFAIL,\n\t\tjoiningD: stateBefore,\n\t\tjoiningT: stateAfter,\n\t\tjoiningR: stateStart,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateAfter, // no-op as we can't accept joiners here\n\t},\n\tstateFAIL: {\n\t\t0: stateFAIL,\n\t\tjoiningL: stateFAIL,\n\t\tjoiningD: stateFAIL,\n\t\tjoiningT: stateFAIL,\n\t\tjoiningR: stateFAIL,\n\t\tjoinZWNJ: stateFAIL,\n\t\tjoinZWJ: stateFAIL,\n\t\tjoinVirama: stateFAIL,\n\t},\n}\n\n// validateLabel validates the criteria from Section 4.1. Item 1, 4, and 6 are\n// already implicitly satisfied by the overall implementation.\nfunc (p *Profile) validateLabel(s string) error {\n\tif s == \"\" {\n\t\tif p.verifyDNSLength {\n\t\t\treturn &labelError{s, \"A4\"}\n\t\t}\n\t\treturn nil\n\t}\n\tif p.bidirule != nil && !p.bidirule(s) {\n\t\treturn &labelError{s, \"B\"}\n\t}\n\tif !p.validateLabels {\n\t\treturn nil\n\t}\n\ttrie := p.trie // p.validateLabels is only set if trie is set.\n\tif len(s) > 4 && s[2] == '-' && s[3] == '-' {\n\t\treturn &labelError{s, \"V2\"}\n\t}\n\tif s[0] == '-' || s[len(s)-1] == '-' {\n\t\treturn &labelError{s, \"V3\"}\n\t}\n\t// TODO: merge the use of this in the trie.\n\tv, sz := trie.lookupString(s)\n\tx := info(v)\n\tif x.isModifier() {\n\t\treturn &labelError{s, \"V5\"}\n\t}\n\t// Quickly return in the absence of zero-width (non) joiners.\n\tif strings.Index(s, zwj) == -1 && strings.Index(s, zwnj) == -1 {\n\t\treturn nil\n\t}\n\tst := stateStart\n\tfor i := 0; ; {\n\t\tjt := x.joinType()\n\t\tif s[i:i+sz] == zwj {\n\t\t\tjt = joinZWJ\n\t\t} else if s[i:i+sz] == zwnj {\n\t\t\tjt = joinZWNJ\n\t\t}\n\t\tst = joinStates[st][jt]\n\t\tif x.isViramaModifier() {\n\t\t\tst = joinStates[st][joinVirama]\n\t\t}\n\t\tif i += sz; i == len(s) {\n\t\t\tbreak\n\t\t}\n\t\tv, sz = trie.lookupString(s[i:])\n\t\tx = info(v)\n\t}\n\tif st == stateFAIL || st == stateAfter {\n\t\treturn &labelError{s, \"C\"}\n\t}\n\treturn nil\n}\n\nfunc ascii(s string) bool {\n\tfor i := 0; i < len(s); i++ {\n\t\tif s[i] >= utf8.RuneSelf {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n" }, { "path": "vendor/golang.org/x/net/idna/punycode.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage idna\n\n// This file implements the Punycode algorithm from RFC 3492.\n\nimport (\n\t\"math\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\n// These parameter values are specified in section 5.\n//\n// All computation is done with int32s, so that overflow behavior is identical\n// regardless of whether int is 32-bit or 64-bit.\nconst (\n\tbase int32 = 36\n\tdamp int32 = 700\n\tinitialBias int32 = 72\n\tinitialN int32 = 128\n\tskew int32 = 38\n\ttmax int32 = 26\n\ttmin int32 = 1\n)\n\nfunc punyError(s string) error { return &labelError{s, \"A3\"} }\n\n// decode decodes a string as specified in section 6.2.\nfunc decode(encoded string) (string, error) {\n\tif encoded == \"\" {\n\t\treturn \"\", nil\n\t}\n\tpos := 1 + strings.LastIndex(encoded, \"-\")\n\tif pos == 1 {\n\t\treturn \"\", punyError(encoded)\n\t}\n\tif pos == len(encoded) {\n\t\treturn encoded[:len(encoded)-1], nil\n\t}\n\toutput := make([]rune, 0, len(encoded))\n\tif pos != 0 {\n\t\tfor _, r := range encoded[:pos-1] {\n\t\t\toutput = append(output, r)\n\t\t}\n\t}\n\ti, n, bias := int32(0), initialN, initialBias\n\tfor pos < len(encoded) {\n\t\toldI, w := i, int32(1)\n\t\tfor k := base; ; k += base {\n\t\t\tif pos == len(encoded) {\n\t\t\t\treturn \"\", punyError(encoded)\n\t\t\t}\n\t\t\tdigit, ok := decodeDigit(encoded[pos])\n\t\t\tif !ok {\n\t\t\t\treturn \"\", punyError(encoded)\n\t\t\t}\n\t\t\tpos++\n\t\t\ti += digit * w\n\t\t\tif i < 0 {\n\t\t\t\treturn \"\", punyError(encoded)\n\t\t\t}\n\t\t\tt := k - bias\n\t\t\tif t < tmin {\n\t\t\t\tt = tmin\n\t\t\t} else if t > tmax {\n\t\t\t\tt = tmax\n\t\t\t}\n\t\t\tif digit < t {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tw *= base - t\n\t\t\tif w >= math.MaxInt32/base {\n\t\t\t\treturn \"\", punyError(encoded)\n\t\t\t}\n\t\t}\n\t\tx := int32(len(output) + 1)\n\t\tbias = adapt(i-oldI, x, oldI == 0)\n\t\tn += i / x\n\t\ti %= x\n\t\tif n > utf8.MaxRune || len(output) >= 1024 {\n\t\t\treturn \"\", punyError(encoded)\n\t\t}\n\t\toutput = append(output, 0)\n\t\tcopy(output[i+1:], output[i:])\n\t\toutput[i] = n\n\t\ti++\n\t}\n\treturn string(output), nil\n}\n\n// encode encodes a string as specified in section 6.3 and prepends prefix to\n// the result.\n//\n// The \"while h < length(input)\" line in the specification becomes \"for\n// remaining != 0\" in the Go code, because len(s) in Go is in bytes, not runes.\nfunc encode(prefix, s string) (string, error) {\n\toutput := make([]byte, len(prefix), len(prefix)+1+2*len(s))\n\tcopy(output, prefix)\n\tdelta, n, bias := int32(0), initialN, initialBias\n\tb, remaining := int32(0), int32(0)\n\tfor _, r := range s {\n\t\tif r < 0x80 {\n\t\t\tb++\n\t\t\toutput = append(output, byte(r))\n\t\t} else {\n\t\t\tremaining++\n\t\t}\n\t}\n\th := b\n\tif b > 0 {\n\t\toutput = append(output, '-')\n\t}\n\tfor remaining != 0 {\n\t\tm := int32(0x7fffffff)\n\t\tfor _, r := range s {\n\t\t\tif m > r && r >= n {\n\t\t\t\tm = r\n\t\t\t}\n\t\t}\n\t\tdelta += (m - n) * (h + 1)\n\t\tif delta < 0 {\n\t\t\treturn \"\", punyError(s)\n\t\t}\n\t\tn = m\n\t\tfor _, r := range s {\n\t\t\tif r < n {\n\t\t\t\tdelta++\n\t\t\t\tif delta < 0 {\n\t\t\t\t\treturn \"\", punyError(s)\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif r > n {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tq := delta\n\t\t\tfor k := base; ; k += base {\n\t\t\t\tt := k - bias\n\t\t\t\tif t < tmin {\n\t\t\t\t\tt = tmin\n\t\t\t\t} else if t > tmax {\n\t\t\t\t\tt = tmax\n\t\t\t\t}\n\t\t\t\tif q < t {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\toutput = append(output, encodeDigit(t+(q-t)%(base-t)))\n\t\t\t\tq = (q - t) / (base - t)\n\t\t\t}\n\t\t\toutput = append(output, encodeDigit(q))\n\t\t\tbias = adapt(delta, h+1, h == b)\n\t\t\tdelta = 0\n\t\t\th++\n\t\t\tremaining--\n\t\t}\n\t\tdelta++\n\t\tn++\n\t}\n\treturn string(output), nil\n}\n\nfunc decodeDigit(x byte) (digit int32, ok bool) {\n\tswitch {\n\tcase '0' <= x && x <= '9':\n\t\treturn int32(x - ('0' - 26)), true\n\tcase 'A' <= x && x <= 'Z':\n\t\treturn int32(x - 'A'), true\n\tcase 'a' <= x && x <= 'z':\n\t\treturn int32(x - 'a'), true\n\t}\n\treturn 0, false\n}\n\nfunc encodeDigit(digit int32) byte {\n\tswitch {\n\tcase 0 <= digit && digit < 26:\n\t\treturn byte(digit + 'a')\n\tcase 26 <= digit && digit < 36:\n\t\treturn byte(digit + ('0' - 26))\n\t}\n\tpanic(\"idna: internal error in punycode encoding\")\n}\n\n// adapt is the bias adaptation function specified in section 6.1.\nfunc adapt(delta, numPoints int32, firstTime bool) int32 {\n\tif firstTime {\n\t\tdelta /= damp\n\t} else {\n\t\tdelta /= 2\n\t}\n\tdelta += delta / numPoints\n\tk := int32(0)\n\tfor delta > ((base-tmin)*tmax)/2 {\n\t\tdelta /= base - tmin\n\t\tk += base\n\t}\n\treturn k + (base-tmin+1)*delta/(delta+skew)\n}\n" }, { "path": "vendor/golang.org/x/net/idna/tables10.0.0.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// +build go1.10,!go1.13\n\npackage idna\n\n// UnicodeVersion is the Unicode version from which the tables in this package are derived.\nconst UnicodeVersion = \"10.0.0\"\n\nvar mappings string = \"\" + // Size: 8175 bytes\n\t\"\\x00\\x01 \\x03 ̈\\x01a\\x03 ̄\\x012\\x013\\x03 ́\\x03 ̧\\x011\\x01o\\x051⁄4\\x051⁄2\" +\n\t\"\\x053⁄4\\x03i̇\\x03l·\\x03ʼn\\x01s\\x03dž\\x03ⱥ\\x03ⱦ\\x01h\\x01j\\x01r\\x01w\\x01y\" +\n\t\"\\x03 ̆\\x03 ̇\\x03 ̊\\x03 ̨\\x03 ̃\\x03 ̋\\x01l\\x01x\\x04̈́\\x03 ι\\x01;\\x05 ̈́\" +\n\t\"\\x04եւ\\x04اٴ\\x04وٴ\\x04ۇٴ\\x04يٴ\\x06क़\\x06ख़\\x06ग़\\x06ज़\\x06ड़\\x06ढ़\\x06फ़\" +\n\t\"\\x06य़\\x06ড়\\x06ঢ়\\x06য়\\x06ਲ਼\\x06ਸ਼\\x06ਖ਼\\x06ਗ਼\\x06ਜ਼\\x06ਫ਼\\x06ଡ଼\\x06ଢ଼\" +\n\t\"\\x06ํา\\x06ໍາ\\x06ຫນ\\x06ຫມ\\x06གྷ\\x06ཌྷ\\x06དྷ\\x06བྷ\\x06ཛྷ\\x06ཀྵ\\x06ཱི\\x06ཱུ\" +\n\t\"\\x06ྲྀ\\x09ྲཱྀ\\x06ླྀ\\x09ླཱྀ\\x06ཱྀ\\x06ྒྷ\\x06ྜྷ\\x06ྡྷ\\x06ྦྷ\\x06ྫྷ\\x06ྐྵ\\x02\" +\n\t\"в\\x02д\\x02о\\x02с\\x02т\\x02ъ\\x02ѣ\\x02æ\\x01b\\x01d\\x01e\\x02ǝ\\x01g\\x01i\\x01k\" +\n\t\"\\x01m\\x01n\\x02ȣ\\x01p\\x01t\\x01u\\x02ɐ\\x02ɑ\\x02ə\\x02ɛ\\x02ɜ\\x02ŋ\\x02ɔ\\x02ɯ\" +\n\t\"\\x01v\\x02β\\x02γ\\x02δ\\x02φ\\x02χ\\x02ρ\\x02н\\x02ɒ\\x01c\\x02ɕ\\x02ð\\x01f\\x02ɟ\" +\n\t\"\\x02ɡ\\x02ɥ\\x02ɨ\\x02ɩ\\x02ɪ\\x02ʝ\\x02ɭ\\x02ʟ\\x02ɱ\\x02ɰ\\x02ɲ\\x02ɳ\\x02ɴ\\x02ɵ\" +\n\t\"\\x02ɸ\\x02ʂ\\x02ʃ\\x02ƫ\\x02ʉ\\x02ʊ\\x02ʋ\\x02ʌ\\x01z\\x02ʐ\\x02ʑ\\x02ʒ\\x02θ\\x02ss\" +\n\t\"\\x02ά\\x02έ\\x02ή\\x02ί\\x02ό\\x02ύ\\x02ώ\\x05ἀι\\x05ἁι\\x05ἂι\\x05ἃι\\x05ἄι\\x05ἅι\" +\n\t\"\\x05ἆι\\x05ἇι\\x05ἠι\\x05ἡι\\x05ἢι\\x05ἣι\\x05ἤι\\x05ἥι\\x05ἦι\\x05ἧι\\x05ὠι\\x05ὡι\" +\n\t\"\\x05ὢι\\x05ὣι\\x05ὤι\\x05ὥι\\x05ὦι\\x05ὧι\\x05ὰι\\x04αι\\x04άι\\x05ᾶι\\x02ι\\x05 ̈͂\" +\n\t\"\\x05ὴι\\x04ηι\\x04ήι\\x05ῆι\\x05 ̓̀\\x05 ̓́\\x05 ̓͂\\x02ΐ\\x05 ̔̀\\x05 ̔́\\x05 ̔͂\" +\n\t\"\\x02ΰ\\x05 ̈̀\\x01`\\x05ὼι\\x04ωι\\x04ώι\\x05ῶι\\x06′′\\x09′′′\\x06‵‵\\x09‵‵‵\\x02!\" +\n\t\"!\\x02??\\x02?!\\x02!?\\x0c′′′′\\x010\\x014\\x015\\x016\\x017\\x018\\x019\\x01+\\x01=\" +\n\t\"\\x01(\\x01)\\x02rs\\x02ħ\\x02no\\x01q\\x02sm\\x02tm\\x02ω\\x02å\\x02א\\x02ב\\x02ג\" +\n\t\"\\x02ד\\x02π\\x051⁄7\\x051⁄9\\x061⁄10\\x051⁄3\\x052⁄3\\x051⁄5\\x052⁄5\\x053⁄5\\x054\" +\n\t\"⁄5\\x051⁄6\\x055⁄6\\x051⁄8\\x053⁄8\\x055⁄8\\x057⁄8\\x041⁄\\x02ii\\x02iv\\x02vi\" +\n\t\"\\x04viii\\x02ix\\x02xi\\x050⁄3\\x06∫∫\\x09∫∫∫\\x06∮∮\\x09∮∮∮\\x0210\\x0211\\x0212\" +\n\t\"\\x0213\\x0214\\x0215\\x0216\\x0217\\x0218\\x0219\\x0220\\x04(10)\\x04(11)\\x04(12)\" +\n\t\"\\x04(13)\\x04(14)\\x04(15)\\x04(16)\\x04(17)\\x04(18)\\x04(19)\\x04(20)\\x0c∫∫∫∫\" +\n\t\"\\x02==\\x05⫝̸\\x02ɫ\\x02ɽ\\x02ȿ\\x02ɀ\\x01.\\x04 ゙\\x04 ゚\\x06より\\x06コト\\x05(ᄀ)\\x05\" +\n\t\"(ᄂ)\\x05(ᄃ)\\x05(ᄅ)\\x05(ᄆ)\\x05(ᄇ)\\x05(ᄉ)\\x05(ᄋ)\\x05(ᄌ)\\x05(ᄎ)\\x05(ᄏ)\\x05(ᄐ\" +\n\t\")\\x05(ᄑ)\\x05(ᄒ)\\x05(가)\\x05(나)\\x05(다)\\x05(라)\\x05(마)\\x05(바)\\x05(사)\\x05(아)\" +\n\t\"\\x05(자)\\x05(차)\\x05(카)\\x05(타)\\x05(파)\\x05(하)\\x05(주)\\x08(오전)\\x08(오후)\\x05(一)\" +\n\t\"\\x05(二)\\x05(三)\\x05(四)\\x05(五)\\x05(六)\\x05(七)\\x05(八)\\x05(九)\\x05(十)\\x05(月)\" +\n\t\"\\x05(火)\\x05(水)\\x05(木)\\x05(金)\\x05(土)\\x05(日)\\x05(株)\\x05(有)\\x05(社)\\x05(名)\" +\n\t\"\\x05(特)\\x05(財)\\x05(祝)\\x05(労)\\x05(代)\\x05(呼)\\x05(学)\\x05(監)\\x05(企)\\x05(資)\" +\n\t\"\\x05(協)\\x05(祭)\\x05(休)\\x05(自)\\x05(至)\\x0221\\x0222\\x0223\\x0224\\x0225\\x0226\" +\n\t\"\\x0227\\x0228\\x0229\\x0230\\x0231\\x0232\\x0233\\x0234\\x0235\\x06참고\\x06주의\\x0236\" +\n\t\"\\x0237\\x0238\\x0239\\x0240\\x0241\\x0242\\x0243\\x0244\\x0245\\x0246\\x0247\\x0248\" +\n\t\"\\x0249\\x0250\\x041月\\x042月\\x043月\\x044月\\x045月\\x046月\\x047月\\x048月\\x049月\\x0510\" +\n\t\"月\\x0511月\\x0512月\\x02hg\\x02ev\\x0cアパート\\x0cアルファ\\x0cアンペア\\x09アール\\x0cイニング\\x09\" +\n\t\"インチ\\x09ウォン\\x0fエスクード\\x0cエーカー\\x09オンス\\x09オーム\\x09カイリ\\x0cカラット\\x0cカロリー\\x09ガロ\" +\n\t\"ン\\x09ガンマ\\x06ギガ\\x09ギニー\\x0cキュリー\\x0cギルダー\\x06キロ\\x0fキログラム\\x12キロメートル\\x0fキロワッ\" +\n\t\"ト\\x09グラム\\x0fグラムトン\\x0fクルゼイロ\\x0cクローネ\\x09ケース\\x09コルナ\\x09コーポ\\x0cサイクル\\x0fサンチ\" +\n\t\"ーム\\x0cシリング\\x09センチ\\x09セント\\x09ダース\\x06デシ\\x06ドル\\x06トン\\x06ナノ\\x09ノット\\x09ハイツ\" +\n\t\"\\x0fパーセント\\x09パーツ\\x0cバーレル\\x0fピアストル\\x09ピクル\\x06ピコ\\x06ビル\\x0fファラッド\\x0cフィート\" +\n\t\"\\x0fブッシェル\\x09フラン\\x0fヘクタール\\x06ペソ\\x09ペニヒ\\x09ヘルツ\\x09ペンス\\x09ページ\\x09ベータ\\x0cポイ\" +\n\t\"ント\\x09ボルト\\x06ホン\\x09ポンド\\x09ホール\\x09ホーン\\x0cマイクロ\\x09マイル\\x09マッハ\\x09マルク\\x0fマ\" +\n\t\"ンション\\x0cミクロン\\x06ミリ\\x0fミリバール\\x06メガ\\x0cメガトン\\x0cメートル\\x09ヤード\\x09ヤール\\x09ユアン\" +\n\t\"\\x0cリットル\\x06リラ\\x09ルピー\\x0cルーブル\\x06レム\\x0fレントゲン\\x09ワット\\x040点\\x041点\\x042点\" +\n\t\"\\x043点\\x044点\\x045点\\x046点\\x047点\\x048点\\x049点\\x0510点\\x0511点\\x0512点\\x0513点\" +\n\t\"\\x0514点\\x0515点\\x0516点\\x0517点\\x0518点\\x0519点\\x0520点\\x0521点\\x0522点\\x0523点\" +\n\t\"\\x0524点\\x02da\\x02au\\x02ov\\x02pc\\x02dm\\x02iu\\x06平成\\x06昭和\\x06大正\\x06明治\\x0c株\" +\n\t\"式会社\\x02pa\\x02na\\x02ma\\x02ka\\x02kb\\x02mb\\x02gb\\x04kcal\\x02pf\\x02nf\\x02m\" +\n\t\"g\\x02kg\\x02hz\\x02ml\\x02dl\\x02kl\\x02fm\\x02nm\\x02mm\\x02cm\\x02km\\x02m2\\x02m\" +\n\t\"3\\x05m∕s\\x06m∕s2\\x07rad∕s\\x08rad∕s2\\x02ps\\x02ns\\x02ms\\x02pv\\x02nv\\x02mv\" +\n\t\"\\x02kv\\x02pw\\x02nw\\x02mw\\x02kw\\x02bq\\x02cc\\x02cd\\x06c∕kg\\x02db\\x02gy\\x02\" +\n\t\"ha\\x02hp\\x02in\\x02kk\\x02kt\\x02lm\\x02ln\\x02lx\\x02ph\\x02pr\\x02sr\\x02sv\\x02\" +\n\t\"wb\\x05v∕m\\x05a∕m\\x041日\\x042日\\x043日\\x044日\\x045日\\x046日\\x047日\\x048日\\x049日\" +\n\t\"\\x0510日\\x0511日\\x0512日\\x0513日\\x0514日\\x0515日\\x0516日\\x0517日\\x0518日\\x0519日\" +\n\t\"\\x0520日\\x0521日\\x0522日\\x0523日\\x0524日\\x0525日\\x0526日\\x0527日\\x0528日\\x0529日\" +\n\t\"\\x0530日\\x0531日\\x02ь\\x02ɦ\\x02ɬ\\x02ʞ\\x02ʇ\\x02œ\\x04𤋮\\x04𢡊\\x04𢡄\\x04𣏕\\x04𥉉\" +\n\t\"\\x04𥳐\\x04𧻓\\x02ff\\x02fi\\x02fl\\x02st\\x04մն\\x04մե\\x04մի\\x04վն\\x04մխ\\x04יִ\" +\n\t\"\\x04ײַ\\x02ע\\x02ה\\x02כ\\x02ל\\x02ם\\x02ר\\x02ת\\x04שׁ\\x04שׂ\\x06שּׁ\\x06שּׂ\\x04א\" +\n\t\"ַ\\x04אָ\\x04אּ\\x04בּ\\x04גּ\\x04דּ\\x04הּ\\x04וּ\\x04זּ\\x04טּ\\x04יּ\\x04ךּ\\x04\" +\n\t\"כּ\\x04לּ\\x04מּ\\x04נּ\\x04סּ\\x04ףּ\\x04פּ\\x04צּ\\x04קּ\\x04רּ\\x04שּ\\x04תּ\" +\n\t\"\\x04וֹ\\x04בֿ\\x04כֿ\\x04פֿ\\x04אל\\x02ٱ\\x02ٻ\\x02پ\\x02ڀ\\x02ٺ\\x02ٿ\\x02ٹ\\x02ڤ\" +\n\t\"\\x02ڦ\\x02ڄ\\x02ڃ\\x02چ\\x02ڇ\\x02ڍ\\x02ڌ\\x02ڎ\\x02ڈ\\x02ژ\\x02ڑ\\x02ک\\x02گ\\x02ڳ\" +\n\t\"\\x02ڱ\\x02ں\\x02ڻ\\x02ۀ\\x02ہ\\x02ھ\\x02ے\\x02ۓ\\x02ڭ\\x02ۇ\\x02ۆ\\x02ۈ\\x02ۋ\\x02ۅ\" +\n\t\"\\x02ۉ\\x02ې\\x02ى\\x04ئا\\x04ئە\\x04ئو\\x04ئۇ\\x04ئۆ\\x04ئۈ\\x04ئې\\x04ئى\\x02ی\\x04\" +\n\t\"ئج\\x04ئح\\x04ئم\\x04ئي\\x04بج\\x04بح\\x04بخ\\x04بم\\x04بى\\x04بي\\x04تج\\x04تح\" +\n\t\"\\x04تخ\\x04تم\\x04تى\\x04تي\\x04ثج\\x04ثم\\x04ثى\\x04ثي\\x04جح\\x04جم\\x04حج\\x04حم\" +\n\t\"\\x04خج\\x04خح\\x04خم\\x04سج\\x04سح\\x04سخ\\x04سم\\x04صح\\x04صم\\x04ضج\\x04ضح\\x04ضخ\" +\n\t\"\\x04ضم\\x04طح\\x04طم\\x04ظم\\x04عج\\x04عم\\x04غج\\x04غم\\x04فج\\x04فح\\x04فخ\\x04فم\" +\n\t\"\\x04فى\\x04في\\x04قح\\x04قم\\x04قى\\x04قي\\x04كا\\x04كج\\x04كح\\x04كخ\\x04كل\\x04كم\" +\n\t\"\\x04كى\\x04كي\\x04لج\\x04لح\\x04لخ\\x04لم\\x04لى\\x04لي\\x04مج\\x04مح\\x04مخ\\x04مم\" +\n\t\"\\x04مى\\x04مي\\x04نج\\x04نح\\x04نخ\\x04نم\\x04نى\\x04ني\\x04هج\\x04هم\\x04هى\\x04هي\" +\n\t\"\\x04يج\\x04يح\\x04يخ\\x04يم\\x04يى\\x04يي\\x04ذٰ\\x04رٰ\\x04ىٰ\\x05 ٌّ\\x05 ٍّ\\x05\" +\n\t\" َّ\\x05 ُّ\\x05 ِّ\\x05 ّٰ\\x04ئر\\x04ئز\\x04ئن\\x04بر\\x04بز\\x04بن\\x04تر\\x04تز\" +\n\t\"\\x04تن\\x04ثر\\x04ثز\\x04ثن\\x04ما\\x04نر\\x04نز\\x04نن\\x04ير\\x04يز\\x04ين\\x04ئخ\" +\n\t\"\\x04ئه\\x04به\\x04ته\\x04صخ\\x04له\\x04نه\\x04هٰ\\x04يه\\x04ثه\\x04سه\\x04شم\\x04شه\" +\n\t\"\\x06ـَّ\\x06ـُّ\\x06ـِّ\\x04طى\\x04طي\\x04عى\\x04عي\\x04غى\\x04غي\\x04سى\\x04سي\" +\n\t\"\\x04شى\\x04شي\\x04حى\\x04حي\\x04جى\\x04جي\\x04خى\\x04خي\\x04صى\\x04صي\\x04ضى\\x04ضي\" +\n\t\"\\x04شج\\x04شح\\x04شخ\\x04شر\\x04سر\\x04صر\\x04ضر\\x04اً\\x06تجم\\x06تحج\\x06تحم\" +\n\t\"\\x06تخم\\x06تمج\\x06تمح\\x06تمخ\\x06جمح\\x06حمي\\x06حمى\\x06سحج\\x06سجح\\x06سجى\" +\n\t\"\\x06سمح\\x06سمج\\x06سمم\\x06صحح\\x06صمم\\x06شحم\\x06شجي\\x06شمخ\\x06شمم\\x06ضحى\" +\n\t\"\\x06ضخم\\x06طمح\\x06طمم\\x06طمي\\x06عجم\\x06عمم\\x06عمى\\x06غمم\\x06غمي\\x06غمى\" +\n\t\"\\x06فخم\\x06قمح\\x06قمم\\x06لحم\\x06لحي\\x06لحى\\x06لجج\\x06لخم\\x06لمح\\x06محج\" +\n\t\"\\x06محم\\x06محي\\x06مجح\\x06مجم\\x06مخج\\x06مخم\\x06مجخ\\x06همج\\x06همم\\x06نحم\" +\n\t\"\\x06نحى\\x06نجم\\x06نجى\\x06نمي\\x06نمى\\x06يمم\\x06بخي\\x06تجي\\x06تجى\\x06تخي\" +\n\t\"\\x06تخى\\x06تمي\\x06تمى\\x06جمي\\x06جحى\\x06جمى\\x06سخى\\x06صحي\\x06شحي\\x06ضحي\" +\n\t\"\\x06لجي\\x06لمي\\x06يحي\\x06يجي\\x06يمي\\x06ممي\\x06قمي\\x06نحي\\x06عمي\\x06كمي\" +\n\t\"\\x06نجح\\x06مخي\\x06لجم\\x06كمم\\x06جحي\\x06حجي\\x06مجي\\x06فمي\\x06بحي\\x06سخي\" +\n\t\"\\x06نجي\\x06صلے\\x06قلے\\x08الله\\x08اكبر\\x08محمد\\x08صلعم\\x08رسول\\x08عليه\" +\n\t\"\\x08وسلم\\x06صلى!صلى الله عليه وسلم\\x0fجل جلاله\\x08ریال\\x01,\\x01:\\x01!\" +\n\t\"\\x01?\\x01_\\x01{\\x01}\\x01[\\x01]\\x01#\\x01&\\x01*\\x01-\\x01<\\x01>\\x01\\\\\\x01$\" +\n\t\"\\x01%\\x01@\\x04ـً\\x04ـَ\\x04ـُ\\x04ـِ\\x04ـّ\\x04ـْ\\x02ء\\x02آ\\x02أ\\x02ؤ\\x02إ\" +\n\t\"\\x02ئ\\x02ا\\x02ب\\x02ة\\x02ت\\x02ث\\x02ج\\x02ح\\x02خ\\x02د\\x02ذ\\x02ر\\x02ز\\x02س\" +\n\t\"\\x02ش\\x02ص\\x02ض\\x02ط\\x02ظ\\x02ع\\x02غ\\x02ف\\x02ق\\x02ك\\x02ل\\x02م\\x02ن\\x02ه\" +\n\t\"\\x02و\\x02ي\\x04لآ\\x04لأ\\x04لإ\\x04لا\\x01\\x22\\x01'\\x01/\\x01^\\x01|\\x01~\\x02¢\" +\n\t\"\\x02£\\x02¬\\x02¦\\x02¥\\x08𝅗𝅥\\x08𝅘𝅥\\x0c𝅘𝅥𝅮\\x0c𝅘𝅥𝅯\\x0c𝅘𝅥𝅰\\x0c𝅘𝅥𝅱\\x0c𝅘𝅥𝅲\\x08𝆹\" +\n\t\"𝅥\\x08𝆺𝅥\\x0c𝆹𝅥𝅮\\x0c𝆺𝅥𝅮\\x0c𝆹𝅥𝅯\\x0c𝆺𝅥𝅯\\x02ı\\x02ȷ\\x02α\\x02ε\\x02ζ\\x02η\\x02\" +\n\t\"κ\\x02λ\\x02μ\\x02ν\\x02ξ\\x02ο\\x02σ\\x02τ\\x02υ\\x02ψ\\x03∇\\x03∂\\x02ϝ\\x02ٮ\\x02ڡ\" +\n\t\"\\x02ٯ\\x020,\\x021,\\x022,\\x023,\\x024,\\x025,\\x026,\\x027,\\x028,\\x029,\\x03(a)\" +\n\t\"\\x03(b)\\x03(c)\\x03(d)\\x03(e)\\x03(f)\\x03(g)\\x03(h)\\x03(i)\\x03(j)\\x03(k)\" +\n\t\"\\x03(l)\\x03(m)\\x03(n)\\x03(o)\\x03(p)\\x03(q)\\x03(r)\\x03(s)\\x03(t)\\x03(u)\" +\n\t\"\\x03(v)\\x03(w)\\x03(x)\\x03(y)\\x03(z)\\x07〔s〕\\x02wz\\x02hv\\x02sd\\x03ppv\\x02w\" +\n\t\"c\\x02mc\\x02md\\x02dj\\x06ほか\\x06ココ\\x03サ\\x03手\\x03字\\x03双\\x03デ\\x03二\\x03多\\x03解\" +\n\t\"\\x03天\\x03交\\x03映\\x03無\\x03料\\x03前\\x03後\\x03再\\x03新\\x03初\\x03終\\x03生\\x03販\\x03声\" +\n\t\"\\x03吹\\x03演\\x03投\\x03捕\\x03一\\x03三\\x03遊\\x03左\\x03中\\x03右\\x03指\\x03走\\x03打\\x03禁\" +\n\t\"\\x03空\\x03合\\x03満\\x03有\\x03月\\x03申\\x03割\\x03営\\x03配\\x09〔本〕\\x09〔三〕\\x09〔二〕\\x09〔安\" +\n\t\"〕\\x09〔点〕\\x09〔打〕\\x09〔盗〕\\x09〔勝〕\\x09〔敗〕\\x03得\\x03可\\x03丽\\x03丸\\x03乁\\x03你\\x03\" +\n\t\"侮\\x03侻\\x03倂\\x03偺\\x03備\\x03僧\\x03像\\x03㒞\\x03免\\x03兔\\x03兤\\x03具\\x03㒹\\x03內\\x03\" +\n\t\"冗\\x03冤\\x03仌\\x03冬\\x03况\\x03凵\\x03刃\\x03㓟\\x03刻\\x03剆\\x03剷\\x03㔕\\x03勇\\x03勉\\x03\" +\n\t\"勤\\x03勺\\x03包\\x03匆\\x03北\\x03卉\\x03卑\\x03博\\x03即\\x03卽\\x03卿\\x03灰\\x03及\\x03叟\\x03\" +\n\t\"叫\\x03叱\\x03吆\\x03咞\\x03吸\\x03呈\\x03周\\x03咢\\x03哶\\x03唐\\x03啓\\x03啣\\x03善\\x03喙\\x03\" +\n\t\"喫\\x03喳\\x03嗂\\x03圖\\x03嘆\\x03圗\\x03噑\\x03噴\\x03切\\x03壮\\x03城\\x03埴\\x03堍\\x03型\\x03\" +\n\t\"堲\\x03報\\x03墬\\x03売\\x03壷\\x03夆\\x03夢\\x03奢\\x03姬\\x03娛\\x03娧\\x03姘\\x03婦\\x03㛮\\x03\" +\n\t\"嬈\\x03嬾\\x03寃\\x03寘\\x03寧\\x03寳\\x03寿\\x03将\\x03尢\\x03㞁\\x03屠\\x03屮\\x03峀\\x03岍\\x03\" +\n\t\"嵃\\x03嵮\\x03嵫\\x03嵼\\x03巡\\x03巢\\x03㠯\\x03巽\\x03帨\\x03帽\\x03幩\\x03㡢\\x03㡼\\x03庰\\x03\" +\n\t\"庳\\x03庶\\x03廊\\x03廾\\x03舁\\x03弢\\x03㣇\\x03形\\x03彫\\x03㣣\\x03徚\\x03忍\\x03志\\x03忹\\x03\" +\n\t\"悁\\x03㤺\\x03㤜\\x03悔\\x03惇\\x03慈\\x03慌\\x03慎\\x03慺\\x03憎\\x03憲\\x03憤\\x03憯\\x03懞\\x03\" +\n\t\"懲\\x03懶\\x03成\\x03戛\\x03扝\\x03抱\\x03拔\\x03捐\\x03挽\\x03拼\\x03捨\\x03掃\\x03揤\\x03搢\\x03\" +\n\t\"揅\\x03掩\\x03㨮\\x03摩\\x03摾\\x03撝\\x03摷\\x03㩬\\x03敏\\x03敬\\x03旣\\x03書\\x03晉\\x03㬙\\x03\" +\n\t\"暑\\x03㬈\\x03㫤\\x03冒\\x03冕\\x03最\\x03暜\\x03肭\\x03䏙\\x03朗\\x03望\\x03朡\\x03杞\\x03杓\\x03\" +\n\t\"㭉\\x03柺\\x03枅\\x03桒\\x03梅\\x03梎\\x03栟\\x03椔\\x03㮝\\x03楂\\x03榣\\x03槪\\x03檨\\x03櫛\\x03\" +\n\t\"㰘\\x03次\\x03歔\\x03㱎\\x03歲\\x03殟\\x03殺\\x03殻\\x03汎\\x03沿\\x03泍\\x03汧\\x03洖\\x03派\\x03\" +\n\t\"海\\x03流\\x03浩\\x03浸\\x03涅\\x03洴\\x03港\\x03湮\\x03㴳\\x03滋\\x03滇\\x03淹\\x03潮\\x03濆\\x03\" +\n\t\"瀹\\x03瀞\\x03瀛\\x03㶖\\x03灊\\x03災\\x03灷\\x03炭\\x03煅\\x03熜\\x03爨\\x03爵\\x03牐\\x03犀\\x03\" +\n\t\"犕\\x03獺\\x03王\\x03㺬\\x03玥\\x03㺸\\x03瑇\\x03瑜\\x03瑱\\x03璅\\x03瓊\\x03㼛\\x03甤\\x03甾\\x03\" +\n\t\"異\\x03瘐\\x03㿼\\x03䀈\\x03直\\x03眞\\x03真\\x03睊\\x03䀹\\x03瞋\\x03䁆\\x03䂖\\x03硎\\x03碌\\x03\" +\n\t\"磌\\x03䃣\\x03祖\\x03福\\x03秫\\x03䄯\\x03穀\\x03穊\\x03穏\\x03䈂\\x03篆\\x03築\\x03䈧\\x03糒\\x03\" +\n\t\"䊠\\x03糨\\x03糣\\x03紀\\x03絣\\x03䌁\\x03緇\\x03縂\\x03繅\\x03䌴\\x03䍙\\x03罺\\x03羕\\x03翺\\x03\" +\n\t\"者\\x03聠\\x03聰\\x03䏕\\x03育\\x03脃\\x03䐋\\x03脾\\x03媵\\x03舄\\x03辞\\x03䑫\\x03芑\\x03芋\\x03\" +\n\t\"芝\\x03劳\\x03花\\x03芳\\x03芽\\x03苦\\x03若\\x03茝\\x03荣\\x03莭\\x03茣\\x03莽\\x03菧\\x03著\\x03\" +\n\t\"荓\\x03菊\\x03菌\\x03菜\\x03䔫\\x03蓱\\x03蓳\\x03蔖\\x03蕤\\x03䕝\\x03䕡\\x03䕫\\x03虐\\x03虜\\x03\" +\n\t\"虧\\x03虩\\x03蚩\\x03蚈\\x03蜎\\x03蛢\\x03蝹\\x03蜨\\x03蝫\\x03螆\\x03蟡\\x03蠁\\x03䗹\\x03衠\\x03\" +\n\t\"衣\\x03裗\\x03裞\\x03䘵\\x03裺\\x03㒻\\x03䚾\\x03䛇\\x03誠\\x03諭\\x03變\\x03豕\\x03貫\\x03賁\\x03\" +\n\t\"贛\\x03起\\x03跋\\x03趼\\x03跰\\x03軔\\x03輸\\x03邔\\x03郱\\x03鄑\\x03鄛\\x03鈸\\x03鋗\\x03鋘\\x03\" +\n\t\"鉼\\x03鏹\\x03鐕\\x03開\\x03䦕\\x03閷\\x03䧦\\x03雃\\x03嶲\\x03霣\\x03䩮\\x03䩶\\x03韠\\x03䪲\\x03\" +\n\t\"頋\\x03頩\\x03飢\\x03䬳\\x03餩\\x03馧\\x03駂\\x03駾\\x03䯎\\x03鬒\\x03鱀\\x03鳽\\x03䳎\\x03䳭\\x03\" +\n\t\"鵧\\x03䳸\\x03麻\\x03䵖\\x03黹\\x03黾\\x03鼅\\x03鼏\\x03鼖\\x03鼻\"\n\nvar xorData string = \"\" + // Size: 4855 bytes\n\t\"\\x02\\x0c\\x09\\x02\\xb0\\xec\\x02\\xad\\xd8\\x02\\xad\\xd9\\x02\\x06\\x07\\x02\\x0f\\x12\" +\n\t\"\\x02\\x0f\\x1f\\x02\\x0f\\x1d\\x02\\x01\\x13\\x02\\x0f\\x16\\x02\\x0f\\x0b\\x02\\x0f3\" +\n\t\"\\x02\\x0f7\\x02\\x0f?\\x02\\x0f/\\x02\\x0f*\\x02\\x0c&\\x02\\x0c*\\x02\\x0c;\\x02\\x0c9\" +\n\t\"\\x02\\x0c%\\x02\\xab\\xed\\x02\\xab\\xe2\\x02\\xab\\xe3\\x02\\xa9\\xe0\\x02\\xa9\\xe1\" +\n\t\"\\x02\\xa9\\xe6\\x02\\xa3\\xcb\\x02\\xa3\\xc8\\x02\\xa3\\xc9\\x02\\x01#\\x02\\x01\\x08\" +\n\t\"\\x02\\x0e>\\x02\\x0e'\\x02\\x0f\\x03\\x02\\x03\\x0d\\x02\\x03\\x09\\x02\\x03\\x17\\x02\" +\n\t\"\\x03\\x0e\\x02\\x02\\x03\\x02\\x011\\x02\\x01\\x00\\x02\\x01\\x10\\x02\\x03<\\x02\\x07\" +\n\t\"\\x0d\\x02\\x02\\x0c\\x02\\x0c0\\x02\\x01\\x03\\x02\\x01\\x01\\x02\\x01 \\x02\\x01\\x22\" +\n\t\"\\x02\\x01)\\x02\\x01\\x0a\\x02\\x01\\x0c\\x02\\x02\\x06\\x02\\x02\\x02\\x02\\x03\\x10\" +\n\t\"\\x03\\x037 \\x03\\x0b+\\x03\\x02\\x01\\x04\\x02\\x01\\x02\\x02\\x019\\x02\\x03\\x1c\\x02\" +\n\t\"\\x02$\\x03\\x80p$\\x02\\x03:\\x02\\x03\\x0a\\x03\\xc1r.\\x03\\xc1r,\\x03\\xc1r\\x02\" +\n\t\"\\x02\\x02:\\x02\\x02>\\x02\\x02,\\x02\\x02\\x10\\x02\\x02\\x00\\x03\\xc1s<\\x03\\xc1s*\" +\n\t\"\\x03\\xc2L$\\x03\\xc2L;\\x02\\x09)\\x02\\x0a\\x19\\x03\\x83\\xab\\xe3\\x03\\x83\\xab\" +\n\t\"\\xf2\\x03 4\\xe0\\x03\\x81\\xab\\xea\\x03\\x81\\xab\\xf3\\x03 4\\xef\\x03\\x96\\xe1\\xcd\" +\n\t\"\\x03\\x84\\xe5\\xc3\\x02\\x0d\\x11\\x03\\x8b\\xec\\xcb\\x03\\x94\\xec\\xcf\\x03\\x9a\\xec\" +\n\t\"\\xc2\\x03\\x8b\\xec\\xdb\\x03\\x94\\xec\\xdf\\x03\\x9a\\xec\\xd2\\x03\\x01\\x0c!\\x03\" +\n\t\"\\x01\\x0c#\\x03ʠ\\x9d\\x03ʣ\\x9c\\x03ʢ\\x9f\\x03ʥ\\x9e\\x03ʤ\\x91\\x03ʧ\\x90\\x03ʦ\\x93\" +\n\t\"\\x03ʩ\\x92\\x03ʨ\\x95\\x03\\xca\\xf3\\xb5\\x03\\xca\\xf0\\xb4\\x03\\xca\\xf1\\xb7\\x03\" +\n\t\"\\xca\\xf6\\xb6\\x03\\xca\\xf7\\x89\\x03\\xca\\xf4\\x88\\x03\\xca\\xf5\\x8b\\x03\\xca\\xfa\" +\n\t\"\\x8a\\x03\\xca\\xfb\\x8d\\x03\\xca\\xf8\\x8c\\x03\\xca\\xf9\\x8f\\x03\\xca\\xfe\\x8e\\x03\" +\n\t\"\\xca\\xff\\x81\\x03\\xca\\xfc\\x80\\x03\\xca\\xfd\\x83\\x03\\xca\\xe2\\x82\\x03\\xca\\xe3\" +\n\t\"\\x85\\x03\\xca\\xe0\\x84\\x03\\xca\\xe1\\x87\\x03\\xca\\xe6\\x86\\x03\\xca\\xe7\\x99\\x03\" +\n\t\"\\xca\\xe4\\x98\\x03\\xca\\xe5\\x9b\\x03\\xca\\xea\\x9a\\x03\\xca\\xeb\\x9d\\x03\\xca\\xe8\" +\n\t\"\\x9c\\x03ؓ\\x89\\x03ߔ\\x8b\\x02\\x010\\x03\\x03\\x04\\x1e\\x03\\x04\\x15\\x12\\x03\\x0b\" +\n\t\"\\x05,\\x03\\x06\\x04\\x00\\x03\\x06\\x04)\\x03\\x06\\x044\\x03\\x06\\x04<\\x03\\x06\\x05\" +\n\t\"\\x1d\\x03\\x06\\x06\\x00\\x03\\x06\\x06\\x0a\\x03\\x06\\x06'\\x03\\x06\\x062\\x03\\x0786\" +\n\t\"\\x03\\x079/\\x03\\x079 \\x03\\x07:\\x0e\\x03\\x07:\\x1b\\x03\\x07:%\\x03\\x07;/\\x03\" +\n\t\"\\x07;%\\x03\\x074\\x11\\x03\\x076\\x09\\x03\\x077*\\x03\\x070\\x01\\x03\\x070\\x0f\\x03\" +\n\t\"\\x070.\\x03\\x071\\x16\\x03\\x071\\x04\\x03\\x0710\\x03\\x072\\x18\\x03\\x072-\\x03\" +\n\t\"\\x073\\x14\\x03\\x073>\\x03\\x07'\\x09\\x03\\x07 \\x00\\x03\\x07\\x1f\\x0b\\x03\\x07\" +\n\t\"\\x18#\\x03\\x07\\x18(\\x03\\x07\\x186\\x03\\x07\\x18\\x03\\x03\\x07\\x19\\x16\\x03\\x07\" +\n\t\"\\x116\\x03\\x07\\x12'\\x03\\x07\\x13\\x10\\x03\\x07\\x0c&\\x03\\x07\\x0c\\x08\\x03\\x07\" +\n\t\"\\x0c\\x13\\x03\\x07\\x0d\\x02\\x03\\x07\\x0d\\x1c\\x03\\x07\\x0b5\\x03\\x07\\x0b\\x0a\" +\n\t\"\\x03\\x07\\x0b\\x01\\x03\\x07\\x0b\\x0f\\x03\\x07\\x05\\x00\\x03\\x07\\x05\\x09\\x03\\x07\" +\n\t\"\\x05\\x0b\\x03\\x07\\x07\\x01\\x03\\x07\\x07\\x08\\x03\\x07\\x00<\\x03\\x07\\x00+\\x03\" +\n\t\"\\x07\\x01)\\x03\\x07\\x01\\x1b\\x03\\x07\\x01\\x08\\x03\\x07\\x03?\\x03\\x0445\\x03\\x04\" +\n\t\"4\\x08\\x03\\x0454\\x03\\x04)/\\x03\\x04)5\\x03\\x04+\\x05\\x03\\x04+\\x14\\x03\\x04+ \" +\n\t\"\\x03\\x04+<\\x03\\x04*&\\x03\\x04*\\x22\\x03\\x04&8\\x03\\x04!\\x01\\x03\\x04!\\x22\" +\n\t\"\\x03\\x04\\x11+\\x03\\x04\\x10.\\x03\\x04\\x104\\x03\\x04\\x13=\\x03\\x04\\x12\\x04\\x03\" +\n\t\"\\x04\\x12\\x0a\\x03\\x04\\x0d\\x1d\\x03\\x04\\x0d\\x07\\x03\\x04\\x0d \\x03\\x05<>\\x03\" +\n\t\"\\x055<\\x03\\x055!\\x03\\x055#\\x03\\x055&\\x03\\x054\\x1d\\x03\\x054\\x02\\x03\\x054\" +\n\t\"\\x07\\x03\\x0571\\x03\\x053\\x1a\\x03\\x053\\x16\\x03\\x05.<\\x03\\x05.\\x07\\x03\\x05)\" +\n\t\":\\x03\\x05)<\\x03\\x05)\\x0c\\x03\\x05)\\x15\\x03\\x05+-\\x03\\x05+5\\x03\\x05$\\x1e\" +\n\t\"\\x03\\x05$\\x14\\x03\\x05'\\x04\\x03\\x05'\\x14\\x03\\x05&\\x02\\x03\\x05\\x226\\x03\" +\n\t\"\\x05\\x22\\x0c\\x03\\x05\\x22\\x1c\\x03\\x05\\x19\\x0a\\x03\\x05\\x1b\\x09\\x03\\x05\\x1b\" +\n\t\"\\x0c\\x03\\x05\\x14\\x07\\x03\\x05\\x16?\\x03\\x05\\x16\\x0c\\x03\\x05\\x0c\\x05\\x03\" +\n\t\"\\x05\\x0e\\x0f\\x03\\x05\\x01\\x0e\\x03\\x05\\x00(\\x03\\x05\\x030\\x03\\x05\\x03\\x06\" +\n\t\"\\x03\\x0a==\\x03\\x0a=1\\x03\\x0a=,\\x03\\x0a=\\x0c\\x03\\x0a??\\x03\\x0a<\\x08\\x03\" +\n\t\"\\x0a9!\\x03\\x0a9)\\x03\\x0a97\\x03\\x0a99\\x03\\x0a6\\x0a\\x03\\x0a6\\x1c\\x03\\x0a6\" +\n\t\"\\x17\\x03\\x0a7'\\x03\\x0a78\\x03\\x0a73\\x03\\x0a'\\x01\\x03\\x0a'&\\x03\\x0a\\x1f\" +\n\t\"\\x0e\\x03\\x0a\\x1f\\x03\\x03\\x0a\\x1f3\\x03\\x0a\\x1b/\\x03\\x0a\\x18\\x19\\x03\\x0a\" +\n\t\"\\x19\\x01\\x03\\x0a\\x16\\x14\\x03\\x0a\\x0e\\x22\\x03\\x0a\\x0f\\x10\\x03\\x0a\\x0f\\x02\" +\n\t\"\\x03\\x0a\\x0f \\x03\\x0a\\x0c\\x04\\x03\\x0a\\x0b>\\x03\\x0a\\x0b+\\x03\\x0a\\x08/\\x03\" +\n\t\"\\x0a\\x046\\x03\\x0a\\x05\\x14\\x03\\x0a\\x00\\x04\\x03\\x0a\\x00\\x10\\x03\\x0a\\x00\" +\n\t\"\\x14\\x03\\x0b<3\\x03\\x0b;*\\x03\\x0b9\\x22\\x03\\x0b9)\\x03\\x0b97\\x03\\x0b+\\x10\" +\n\t\"\\x03\\x0b((\\x03\\x0b&5\\x03\\x0b$\\x1c\\x03\\x0b$\\x12\\x03\\x0b%\\x04\\x03\\x0b#<\" +\n\t\"\\x03\\x0b#0\\x03\\x0b#\\x0d\\x03\\x0b#\\x19\\x03\\x0b!:\\x03\\x0b!\\x1f\\x03\\x0b!\\x00\" +\n\t\"\\x03\\x0b\\x1e5\\x03\\x0b\\x1c\\x1d\\x03\\x0b\\x1d-\\x03\\x0b\\x1d(\\x03\\x0b\\x18.\\x03\" +\n\t\"\\x0b\\x18 \\x03\\x0b\\x18\\x16\\x03\\x0b\\x14\\x13\\x03\\x0b\\x15$\\x03\\x0b\\x15\\x22\" +\n\t\"\\x03\\x0b\\x12\\x1b\\x03\\x0b\\x12\\x10\\x03\\x0b\\x132\\x03\\x0b\\x13=\\x03\\x0b\\x12\" +\n\t\"\\x18\\x03\\x0b\\x0c&\\x03\\x0b\\x061\\x03\\x0b\\x06:\\x03\\x0b\\x05#\\x03\\x0b\\x05<\" +\n\t\"\\x03\\x0b\\x04\\x0b\\x03\\x0b\\x04\\x04\\x03\\x0b\\x04\\x1b\\x03\\x0b\\x042\\x03\\x0b\" +\n\t\"\\x041\\x03\\x0b\\x03\\x03\\x03\\x0b\\x03\\x1d\\x03\\x0b\\x03/\\x03\\x0b\\x03+\\x03\\x0b\" +\n\t\"\\x02\\x1b\\x03\\x0b\\x02\\x00\\x03\\x0b\\x01\\x1e\\x03\\x0b\\x01\\x08\\x03\\x0b\\x015\" +\n\t\"\\x03\\x06\\x0d9\\x03\\x06\\x0d=\\x03\\x06\\x0d?\\x03\\x02\\x001\\x03\\x02\\x003\\x03\" +\n\t\"\\x02\\x02\\x19\\x03\\x02\\x006\\x03\\x02\\x02\\x1b\\x03\\x02\\x004\\x03\\x02\\x00<\\x03\" +\n\t\"\\x02\\x02\\x0a\\x03\\x02\\x02\\x0e\\x03\\x02\\x01\\x1a\\x03\\x02\\x01\\x07\\x03\\x02\\x01\" +\n\t\"\\x05\\x03\\x02\\x01\\x0b\\x03\\x02\\x01%\\x03\\x02\\x01\\x0c\\x03\\x02\\x01\\x04\\x03\" +\n\t\"\\x02\\x01\\x1c\\x03\\x02\\x00.\\x03\\x02\\x002\\x03\\x02\\x00>\\x03\\x02\\x00\\x12\\x03\" +\n\t\"\\x02\\x00\\x16\\x03\\x02\\x011\\x03\\x02\\x013\\x03\\x02\\x02 \\x03\\x02\\x02%\\x03\\x02\" +\n\t\"\\x02$\\x03\\x02\\x028\\x03\\x02\\x02;\\x03\\x02\\x024\\x03\\x02\\x012\\x03\\x02\\x022\" +\n\t\"\\x03\\x02\\x02/\\x03\\x02\\x01,\\x03\\x02\\x01\\x13\\x03\\x02\\x01\\x16\\x03\\x02\\x01\" +\n\t\"\\x11\\x03\\x02\\x01\\x1e\\x03\\x02\\x01\\x15\\x03\\x02\\x01\\x17\\x03\\x02\\x01\\x0f\\x03\" +\n\t\"\\x02\\x01\\x08\\x03\\x02\\x00?\\x03\\x02\\x03\\x07\\x03\\x02\\x03\\x0d\\x03\\x02\\x03\" +\n\t\"\\x13\\x03\\x02\\x03\\x1d\\x03\\x02\\x03\\x1f\\x03\\x02\\x00\\x03\\x03\\x02\\x00\\x0d\\x03\" +\n\t\"\\x02\\x00\\x01\\x03\\x02\\x00\\x1b\\x03\\x02\\x00\\x19\\x03\\x02\\x00\\x18\\x03\\x02\\x00\" +\n\t\"\\x13\\x03\\x02\\x00/\\x03\\x07>\\x12\\x03\\x07<\\x1f\\x03\\x07>\\x1d\\x03\\x06\\x1d\\x0e\" +\n\t\"\\x03\\x07>\\x1c\\x03\\x07>:\\x03\\x07>\\x13\\x03\\x04\\x12+\\x03\\x07?\\x03\\x03\\x07>\" +\n\t\"\\x02\\x03\\x06\\x224\\x03\\x06\\x1a.\\x03\\x07<%\\x03\\x06\\x1c\\x0b\\x03\\x0609\\x03\" +\n\t\"\\x05\\x1f\\x01\\x03\\x04'\\x08\\x03\\x93\\xfd\\xf5\\x03\\x02\\x0d \\x03\\x02\\x0d#\\x03\" +\n\t\"\\x02\\x0d!\\x03\\x02\\x0d&\\x03\\x02\\x0d\\x22\\x03\\x02\\x0d/\\x03\\x02\\x0d,\\x03\\x02\" +\n\t\"\\x0d$\\x03\\x02\\x0d'\\x03\\x02\\x0d%\\x03\\x02\\x0d;\\x03\\x02\\x0d=\\x03\\x02\\x0d?\" +\n\t\"\\x03\\x099.\\x03\\x08\\x0b7\\x03\\x08\\x02\\x14\\x03\\x08\\x14\\x0d\\x03\\x08.:\\x03\" +\n\t\"\\x089'\\x03\\x0f\\x0b\\x18\\x03\\x0f\\x1c1\\x03\\x0f\\x17&\\x03\\x0f9\\x1f\\x03\\x0f0\" +\n\t\"\\x0c\\x03\\x0e\\x0a9\\x03\\x0e\\x056\\x03\\x0e\\x1c#\\x03\\x0f\\x13\\x0e\\x03\\x072\\x00\" +\n\t\"\\x03\\x070\\x0d\\x03\\x072\\x0b\\x03\\x06\\x11\\x18\\x03\\x070\\x10\\x03\\x06\\x0f(\\x03\" +\n\t\"\\x072\\x05\\x03\\x06\\x0f,\\x03\\x073\\x15\\x03\\x06\\x07\\x08\\x03\\x05\\x16\\x02\\x03\" +\n\t\"\\x04\\x0b \\x03\\x05:8\\x03\\x05\\x16%\\x03\\x0a\\x0d\\x1f\\x03\\x06\\x16\\x10\\x03\\x05\" +\n\t\"\\x1d5\\x03\\x05*;\\x03\\x05\\x16\\x1b\\x03\\x04.-\\x03\\x06\\x1a\\x19\\x03\\x04\\x03,\" +\n\t\"\\x03\\x0b87\\x03\\x04/\\x0a\\x03\\x06\\x00,\\x03\\x04-\\x01\\x03\\x04\\x1e-\\x03\\x06/(\" +\n\t\"\\x03\\x0a\\x0b5\\x03\\x06\\x0e7\\x03\\x06\\x07.\\x03\\x0597\\x03\\x0a*%\\x03\\x0760\" +\n\t\"\\x03\\x06\\x0c;\\x03\\x05'\\x00\\x03\\x072.\\x03\\x072\\x08\\x03\\x06=\\x01\\x03\\x06\" +\n\t\"\\x05\\x1b\\x03\\x06\\x06\\x12\\x03\\x06$=\\x03\\x06'\\x0d\\x03\\x04\\x11\\x0f\\x03\\x076\" +\n\t\",\\x03\\x06\\x07;\\x03\\x06.,\\x03\\x86\\xf9\\xea\\x03\\x8f\\xff\\xeb\\x02\\x092\\x02\" +\n\t\"\\x095\\x02\\x094\\x02\\x09;\\x02\\x09>\\x02\\x098\\x02\\x09*\\x02\\x09/\\x02\\x09,\\x02\" +\n\t\"\\x09%\\x02\\x09&\\x02\\x09#\\x02\\x09 \\x02\\x08!\\x02\\x08%\\x02\\x08$\\x02\\x08+\\x02\" +\n\t\"\\x08.\\x02\\x08*\\x02\\x08&\\x02\\x088\\x02\\x08>\\x02\\x084\\x02\\x086\\x02\\x080\\x02\" +\n\t\"\\x08\\x10\\x02\\x08\\x17\\x02\\x08\\x12\\x02\\x08\\x1d\\x02\\x08\\x1f\\x02\\x08\\x13\\x02\" +\n\t\"\\x08\\x15\\x02\\x08\\x14\\x02\\x08\\x0c\\x03\\x8b\\xfd\\xd0\\x03\\x81\\xec\\xc6\\x03\\x87\" +\n\t\"\\xe0\\x8a\\x03-2\\xe3\\x03\\x80\\xef\\xe4\\x03-2\\xea\\x03\\x88\\xe6\\xeb\\x03\\x8e\\xe6\" +\n\t\"\\xe8\\x03\\x84\\xe6\\xe9\\x03\\x97\\xe6\\xee\\x03-2\\xf9\\x03-2\\xf6\\x03\\x8e\\xe3\\xad\" +\n\t\"\\x03\\x80\\xe3\\x92\\x03\\x88\\xe3\\x90\\x03\\x8e\\xe3\\x90\\x03\\x80\\xe3\\x97\\x03\\x88\" +\n\t\"\\xe3\\x95\\x03\\x88\\xfe\\xcb\\x03\\x8e\\xfe\\xca\\x03\\x84\\xfe\\xcd\\x03\\x91\\xef\\xc9\" +\n\t\"\\x03-2\\xc1\\x03-2\\xc0\\x03-2\\xcb\\x03\\x88@\\x09\\x03\\x8e@\\x08\\x03\\x8f\\xe0\\xf5\" +\n\t\"\\x03\\x8e\\xe6\\xf9\\x03\\x8e\\xe0\\xfa\\x03\\x93\\xff\\xf4\\x03\\x84\\xee\\xd3\\x03\\x0b\" +\n\t\"(\\x04\\x023 \\x021;\\x02\\x01*\\x03\\x0b#\\x10\\x03\\x0b 0\\x03\\x0b!\\x10\\x03\\x0b!0\" +\n\t\"\\x03\\x07\\x15\\x08\\x03\\x09?5\\x03\\x07\\x1f\\x08\\x03\\x07\\x17\\x0b\\x03\\x09\\x1f\" +\n\t\"\\x15\\x03\\x0b\\x1c7\\x03\\x0a+#\\x03\\x06\\x1a\\x1b\\x03\\x06\\x1a\\x14\\x03\\x0a\\x01\" +\n\t\"\\x18\\x03\\x06#\\x1b\\x03\\x0a2\\x0c\\x03\\x0a\\x01\\x04\\x03\\x09#;\\x03\\x08='\\x03\" +\n\t\"\\x08\\x1a\\x0a\\x03\\x07\\x03\\x0a\\x111\\x03\\x09\\x1b\\x09\\x03\\x073.\\x03\\x07\\x01\\x00\" +\n\t\"\\x03\\x09/,\\x03\\x07#>\\x03\\x07\\x048\\x03\\x0a\\x1f\\x22\\x03\\x098>\\x03\\x09\\x11\" +\n\t\"\\x00\\x03\\x08/\\x17\\x03\\x06'\\x22\\x03\\x0b\\x1a+\\x03\\x0a\\x22\\x19\\x03\\x0a/1\" +\n\t\"\\x03\\x0974\\x03\\x09\\x0f\\x22\\x03\\x08,\\x22\\x03\\x08?\\x14\\x03\\x07$5\\x03\\x07<3\" +\n\t\"\\x03\\x07=*\\x03\\x07\\x13\\x18\\x03\\x068\\x0a\\x03\\x06\\x09\\x16\\x03\\x06\\x13\\x00\" +\n\t\"\\x03\\x08\\x067\\x03\\x08\\x01\\x03\\x03\\x08\\x12\\x1d\\x03\\x07+7\\x03\\x06(;\\x03\" +\n\t\"\\x06\\x1c?\\x03\\x07\\x0e\\x17\\x03\\x0a\\x06\\x1d\\x03\\x0a\\x19\\x07\\x03\\x08\\x14$\" +\n\t\"\\x03\\x07$;\\x03\\x08,$\\x03\\x08\\x06\\x0d\\x03\\x07\\x16\\x0a\\x03\\x06>>\\x03\\x0a\" +\n\t\"\\x06\\x12\\x03\\x0a\\x14)\\x03\\x09\\x0d\\x1f\\x03\\x09\\x12\\x17\\x03\\x09\\x19\\x01\" +\n\t\"\\x03\\x08\\x11 \\x03\\x08\\x1d'\\x03\\x06<\\x1a\\x03\\x0a.\\x00\\x03\\x07'\\x18\\x03\" +\n\t\"\\x0a\\x22\\x08\\x03\\x08\\x0d\\x0a\\x03\\x08\\x13)\\x03\\x07*)\\x03\\x06<,\\x03\\x07\" +\n\t\"\\x0b\\x1a\\x03\\x09.\\x14\\x03\\x09\\x0d\\x1e\\x03\\x07\\x0e#\\x03\\x0b\\x1d'\\x03\\x0a\" +\n\t\"\\x0a8\\x03\\x09%2\\x03\\x08+&\\x03\\x080\\x12\\x03\\x0a)4\\x03\\x08\\x06\\x1f\\x03\\x0b\" +\n\t\"\\x1b\\x1a\\x03\\x0a\\x1b\\x0f\\x03\\x0b\\x1d*\\x03\\x09\\x16$\\x03\\x090\\x11\\x03\\x08\" +\n\t\"\\x11\\x08\\x03\\x0a*(\\x03\\x0a\\x042\\x03\\x089,\\x03\\x074'\\x03\\x07\\x0f\\x05\\x03\" +\n\t\"\\x09\\x0b\\x0a\\x03\\x07\\x1b\\x01\\x03\\x09\\x17:\\x03\\x09.\\x0d\\x03\\x07.\\x11\\x03\" +\n\t\"\\x09+\\x15\\x03\\x080\\x13\\x03\\x0b\\x1f\\x19\\x03\\x0a \\x11\\x03\\x0a\\x220\\x03\\x09\" +\n\t\"\\x07;\\x03\\x08\\x16\\x1c\\x03\\x07,\\x13\\x03\\x07\\x0e/\\x03\\x06\\x221\\x03\\x0a.\" +\n\t\"\\x0a\\x03\\x0a7\\x02\\x03\\x0a\\x032\\x03\\x0a\\x1d.\\x03\\x091\\x06\\x03\\x09\\x19:\" +\n\t\"\\x03\\x08\\x02/\\x03\\x060+\\x03\\x06\\x0f-\\x03\\x06\\x1c\\x1f\\x03\\x06\\x1d\\x07\\x03\" +\n\t\"\\x0a,\\x11\\x03\\x09=\\x0d\\x03\\x09\\x0b;\\x03\\x07\\x1b/\\x03\\x0a\\x1f:\\x03\\x09 \" +\n\t\"\\x1f\\x03\\x09.\\x10\\x03\\x094\\x0b\\x03\\x09\\x1a1\\x03\\x08#\\x1a\\x03\\x084\\x1d\" +\n\t\"\\x03\\x08\\x01\\x1f\\x03\\x08\\x11\\x22\\x03\\x07'8\\x03\\x07\\x1a>\\x03\\x0757\\x03\" +\n\t\"\\x06&9\\x03\\x06+\\x11\\x03\\x0a.\\x0b\\x03\\x0a,>\\x03\\x0a4#\\x03\\x08%\\x17\\x03\" +\n\t\"\\x07\\x05\\x22\\x03\\x07\\x0c\\x0b\\x03\\x0a\\x1d+\\x03\\x0a\\x19\\x16\\x03\\x09+\\x1f\" +\n\t\"\\x03\\x09\\x08\\x0b\\x03\\x08\\x16\\x18\\x03\\x08+\\x12\\x03\\x0b\\x1d\\x0c\\x03\\x0a=\" +\n\t\"\\x10\\x03\\x0a\\x09\\x0d\\x03\\x0a\\x10\\x11\\x03\\x09&0\\x03\\x08(\\x1f\\x03\\x087\\x07\" +\n\t\"\\x03\\x08\\x185\\x03\\x07'6\\x03\\x06.\\x05\\x03\\x06=\\x04\\x03\\x06;;\\x03\\x06\\x06,\" +\n\t\"\\x03\\x0b\\x18>\\x03\\x08\\x00\\x18\\x03\\x06 \\x03\\x03\\x06<\\x00\\x03\\x09%\\x18\\x03\" +\n\t\"\\x0b\\x1c<\\x03\\x0a%!\\x03\\x0a\\x09\\x12\\x03\\x0a\\x16\\x02\\x03\\x090'\\x03\\x09\" +\n\t\"\\x0e=\\x03\\x08 \\x0e\\x03\\x08>\\x03\\x03\\x074>\\x03\\x06&?\\x03\\x06\\x19\\x09\\x03\" +\n\t\"\\x06?(\\x03\\x0a-\\x0e\\x03\\x09:3\\x03\\x098:\\x03\\x09\\x12\\x0b\\x03\\x09\\x1d\\x17\" +\n\t\"\\x03\\x087\\x05\\x03\\x082\\x14\\x03\\x08\\x06%\\x03\\x08\\x13\\x1f\\x03\\x06\\x06\\x0e\" +\n\t\"\\x03\\x0a\\x22<\\x03\\x09/<\\x03\\x06>+\\x03\\x0a'?\\x03\\x0a\\x13\\x0c\\x03\\x09\\x10<\" +\n\t\"\\x03\\x07\\x1b=\\x03\\x0a\\x19\\x13\\x03\\x09\\x22\\x1d\\x03\\x09\\x07\\x0d\\x03\\x08)\" +\n\t\"\\x1c\\x03\\x06=\\x1a\\x03\\x0a/4\\x03\\x0a7\\x11\\x03\\x0a\\x16:\\x03\\x09?3\\x03\\x09:\" +\n\t\"/\\x03\\x09\\x05\\x0a\\x03\\x09\\x14\\x06\\x03\\x087\\x22\\x03\\x080\\x07\\x03\\x08\\x1a\" +\n\t\"\\x1f\\x03\\x07\\x04(\\x03\\x07\\x04\\x09\\x03\\x06 %\\x03\\x06<\\x08\\x03\\x0a+\\x14\" +\n\t\"\\x03\\x09\\x1d\\x16\\x03\\x0a70\\x03\\x08 >\\x03\\x0857\\x03\\x070\\x0a\\x03\\x06=\\x12\" +\n\t\"\\x03\\x06\\x16%\\x03\\x06\\x1d,\\x03\\x099#\\x03\\x09\\x10>\\x03\\x07 \\x1e\\x03\\x08\" +\n\t\"\\x0c<\\x03\\x08\\x0b\\x18\\x03\\x08\\x15+\\x03\\x08,:\\x03\\x08%\\x22\\x03\\x07\\x0a$\" +\n\t\"\\x03\\x0b\\x1c=\\x03\\x07+\\x08\\x03\\x0a/\\x05\\x03\\x0a \\x07\\x03\\x0a\\x12'\\x03\" +\n\t\"\\x09#\\x11\\x03\\x08\\x1b\\x15\\x03\\x0a\\x06\\x01\\x03\\x09\\x1c\\x1b\\x03\\x0922\\x03\" +\n\t\"\\x07\\x14<\\x03\\x07\\x09\\x04\\x03\\x061\\x04\\x03\\x07\\x0e\\x01\\x03\\x0a\\x13\\x18\" +\n\t\"\\x03\\x0a-\\x0c\\x03\\x0a?\\x0d\\x03\\x0a\\x09\\x0a\\x03\\x091&\\x03\\x0a/\\x0b\\x03\" +\n\t\"\\x08$<\\x03\\x083\\x1d\\x03\\x08\\x0c$\\x03\\x08\\x0d\\x07\\x03\\x08\\x0d?\\x03\\x08\" +\n\t\"\\x0e\\x14\\x03\\x065\\x0a\\x03\\x08\\x1a#\\x03\\x08\\x16#\\x03\\x0702\\x03\\x07\\x03\" +\n\t\"\\x1a\\x03\\x06(\\x1d\\x03\\x06+\\x1b\\x03\\x06\\x0b\\x05\\x03\\x06\\x0b\\x17\\x03\\x06\" +\n\t\"\\x0c\\x04\\x03\\x06\\x1e\\x19\\x03\\x06+0\\x03\\x062\\x18\\x03\\x0b\\x16\\x1e\\x03\\x0a+\" +\n\t\"\\x16\\x03\\x0a-?\\x03\\x0a#:\\x03\\x0a#\\x10\\x03\\x0a%$\\x03\\x0a>+\\x03\\x0a01\\x03\" +\n\t\"\\x0a1\\x10\\x03\\x0a\\x099\\x03\\x0a\\x0a\\x12\\x03\\x0a\\x19\\x1f\\x03\\x0a\\x19\\x12\" +\n\t\"\\x03\\x09*)\\x03\\x09-\\x16\\x03\\x09.1\\x03\\x09.2\\x03\\x09<\\x0e\\x03\\x09> \\x03\" +\n\t\"\\x093\\x12\\x03\\x09\\x0b\\x01\\x03\\x09\\x1c2\\x03\\x09\\x11\\x1c\\x03\\x09\\x15%\\x03\" +\n\t\"\\x08,&\\x03\\x08!\\x22\\x03\\x089(\\x03\\x08\\x0b\\x1a\\x03\\x08\\x0d2\\x03\\x08\\x0c\" +\n\t\"\\x04\\x03\\x08\\x0c\\x06\\x03\\x08\\x0c\\x1f\\x03\\x08\\x0c\\x0c\\x03\\x08\\x0f\\x1f\\x03\" +\n\t\"\\x08\\x0f\\x1d\\x03\\x08\\x00\\x14\\x03\\x08\\x03\\x14\\x03\\x08\\x06\\x16\\x03\\x08\\x1e\" +\n\t\"#\\x03\\x08\\x11\\x11\\x03\\x08\\x10\\x18\\x03\\x08\\x14(\\x03\\x07)\\x1e\\x03\\x07.1\" +\n\t\"\\x03\\x07 $\\x03\\x07 '\\x03\\x078\\x08\\x03\\x07\\x0d0\\x03\\x07\\x0f7\\x03\\x07\\x05#\" +\n\t\"\\x03\\x07\\x05\\x1a\\x03\\x07\\x1a7\\x03\\x07\\x1d-\\x03\\x07\\x17\\x10\\x03\\x06)\\x1f\" +\n\t\"\\x03\\x062\\x0b\\x03\\x066\\x16\\x03\\x06\\x09\\x11\\x03\\x09(\\x1e\\x03\\x07!5\\x03\" +\n\t\"\\x0b\\x11\\x16\\x03\\x0a/\\x04\\x03\\x0a,\\x1a\\x03\\x0b\\x173\\x03\\x0a,1\\x03\\x0a/5\" +\n\t\"\\x03\\x0a\\x221\\x03\\x0a\\x22\\x0d\\x03\\x0a?%\\x03\\x0a<,\\x03\\x0a?#\\x03\\x0a>\\x19\" +\n\t\"\\x03\\x0a\\x08&\\x03\\x0a\\x0b\\x0e\\x03\\x0a\\x0c:\\x03\\x0a\\x0c+\\x03\\x0a\\x03\\x22\" +\n\t\"\\x03\\x0a\\x06)\\x03\\x0a\\x11\\x10\\x03\\x0a\\x11\\x1a\\x03\\x0a\\x17-\\x03\\x0a\\x14(\" +\n\t\"\\x03\\x09)\\x1e\\x03\\x09/\\x09\\x03\\x09.\\x00\\x03\\x09,\\x07\\x03\\x09/*\\x03\\x09-9\" +\n\t\"\\x03\\x09\\x228\\x03\\x09%\\x09\\x03\\x09:\\x12\\x03\\x09;\\x1d\\x03\\x09?\\x06\\x03\" +\n\t\"\\x093%\\x03\\x096\\x05\\x03\\x096\\x08\\x03\\x097\\x02\\x03\\x09\\x07,\\x03\\x09\\x04,\" +\n\t\"\\x03\\x09\\x1f\\x16\\x03\\x09\\x11\\x03\\x03\\x09\\x11\\x12\\x03\\x09\\x168\\x03\\x08*\" +\n\t\"\\x05\\x03\\x08/2\\x03\\x084:\\x03\\x08\\x22+\\x03\\x08 0\\x03\\x08&\\x0a\\x03\\x08;\" +\n\t\"\\x10\\x03\\x08>$\\x03\\x08>\\x18\\x03\\x0829\\x03\\x082:\\x03\\x081,\\x03\\x081<\\x03\" +\n\t\"\\x081\\x1c\\x03\\x087#\\x03\\x087*\\x03\\x08\\x09'\\x03\\x08\\x00\\x1d\\x03\\x08\\x05-\" +\n\t\"\\x03\\x08\\x1f4\\x03\\x08\\x1d\\x04\\x03\\x08\\x16\\x0f\\x03\\x07*7\\x03\\x07'!\\x03\" +\n\t\"\\x07%\\x1b\\x03\\x077\\x0c\\x03\\x07\\x0c1\\x03\\x07\\x0c.\\x03\\x07\\x00\\x06\\x03\\x07\" +\n\t\"\\x01\\x02\\x03\\x07\\x010\\x03\\x07\\x06=\\x03\\x07\\x01\\x03\\x03\\x07\\x01\\x13\\x03\" +\n\t\"\\x07\\x06\\x06\\x03\\x07\\x05\\x0a\\x03\\x07\\x1f\\x09\\x03\\x07\\x17:\\x03\\x06*1\\x03\" +\n\t\"\\x06-\\x1d\\x03\\x06\\x223\\x03\\x062:\\x03\\x060$\\x03\\x066\\x1e\\x03\\x064\\x12\\x03\" +\n\t\"\\x0645\\x03\\x06\\x0b\\x00\\x03\\x06\\x0b7\\x03\\x06\\x07\\x1f\\x03\\x06\\x15\\x12\\x03\" +\n\t\"\\x0c\\x05\\x0f\\x03\\x0b+\\x0b\\x03\\x0b+-\\x03\\x06\\x16\\x1b\\x03\\x06\\x15\\x17\\x03\" +\n\t\"\\x89\\xca\\xea\\x03\\x89\\xca\\xe8\\x03\\x0c8\\x10\\x03\\x0c8\\x01\\x03\\x0c8\\x0f\\x03\" +\n\t\"\\x0d8%\\x03\\x0d8!\\x03\\x0c8-\\x03\\x0c8/\\x03\\x0c8+\\x03\\x0c87\\x03\\x0c85\\x03\" +\n\t\"\\x0c9\\x09\\x03\\x0c9\\x0d\\x03\\x0c9\\x0f\\x03\\x0c9\\x0b\\x03\\xcfu\\x0c\\x03\\xcfu\" +\n\t\"\\x0f\\x03\\xcfu\\x0e\\x03\\xcfu\\x09\\x03\\x0c9\\x10\\x03\\x0d9\\x0c\\x03\\xcf`;\\x03\" +\n\t\"\\xcf`>\\x03\\xcf`9\\x03\\xcf`8\\x03\\xcf`7\\x03\\xcf`*\\x03\\xcf`-\\x03\\xcf`,\\x03\" +\n\t\"\\x0d\\x1b\\x1a\\x03\\x0d\\x1b&\\x03\\x0c=.\\x03\\x0c=%\\x03\\x0c>\\x1e\\x03\\x0c>\\x14\" +\n\t\"\\x03\\x0c?\\x06\\x03\\x0c?\\x0b\\x03\\x0c?\\x0c\\x03\\x0c?\\x0d\\x03\\x0c?\\x02\\x03\" +\n\t\"\\x0c>\\x0f\\x03\\x0c>\\x08\\x03\\x0c>\\x09\\x03\\x0c>,\\x03\\x0c>\\x0c\\x03\\x0c?\\x13\" +\n\t\"\\x03\\x0c?\\x16\\x03\\x0c?\\x15\\x03\\x0c?\\x1c\\x03\\x0c?\\x1f\\x03\\x0c?\\x1d\\x03\" +\n\t\"\\x0c?\\x1a\\x03\\x0c?\\x17\\x03\\x0c?\\x08\\x03\\x0c?\\x09\\x03\\x0c?\\x0e\\x03\\x0c?\" +\n\t\"\\x04\\x03\\x0c?\\x05\\x03\\x0c\" +\n\t\"\\x03\\x0c=2\\x03\\x0c=6\\x03\\x0c<\\x07\\x03\\x0c<\\x05\\x03\\x0e:!\\x03\\x0e:#\\x03\" +\n\t\"\\x0e8\\x09\\x03\\x0e:&\\x03\\x0e8\\x0b\\x03\\x0e:$\\x03\\x0e:,\\x03\\x0e8\\x1a\\x03\" +\n\t\"\\x0e8\\x1e\\x03\\x0e:*\\x03\\x0e:7\\x03\\x0e:5\\x03\\x0e:;\\x03\\x0e:\\x15\\x03\\x0e:<\" +\n\t\"\\x03\\x0e:4\\x03\\x0e:'\\x03\\x0e:-\\x03\\x0e:%\\x03\\x0e:?\\x03\\x0e:=\\x03\\x0e:)\" +\n\t\"\\x03\\x0e:/\\x03\\xcfs'\\x03\\x0d=\\x0f\\x03\\x0d+*\\x03\\x0d99\\x03\\x0d9;\\x03\\x0d9\" +\n\t\"?\\x03\\x0d)\\x0d\\x03\\x0d(%\\x02\\x01\\x18\\x02\\x01(\\x02\\x01\\x1e\\x03\\x0f$!\\x03\" +\n\t\"\\x0f87\\x03\\x0f4\\x0e\\x03\\x0f5\\x1d\\x03\\x06'\\x03\\x03\\x0f\\x08\\x18\\x03\\x0f\" +\n\t\"\\x0d\\x1b\\x03\\x0e2=\\x03\\x0e;\\x08\\x03\\x0e:\\x0b\\x03\\x0e\\x06$\\x03\\x0e\\x0d)\" +\n\t\"\\x03\\x0e\\x16\\x1f\\x03\\x0e\\x16\\x1b\\x03\\x0d$\\x0a\\x03\\x05,\\x1d\\x03\\x0d. \\x03\" +\n\t\"\\x0d.#\\x03\\x0c(/\\x03\\x09%\\x02\\x03\\x0d90\\x03\\x0d\\x0e4\\x03\\x0d\\x0d\\x0f\\x03\" +\n\t\"\\x0c#\\x00\\x03\\x0c,\\x1e\\x03\\x0c2\\x0e\\x03\\x0c\\x01\\x17\\x03\\x0c\\x09:\\x03\\x0e\" +\n\t\"\\x173\\x03\\x0c\\x08\\x03\\x03\\x0c\\x11\\x07\\x03\\x0c\\x10\\x18\\x03\\x0c\\x1f\\x1c\" +\n\t\"\\x03\\x0c\\x19\\x0e\\x03\\x0c\\x1a\\x1f\\x03\\x0f0>\\x03\\x0b->\\x03\\x0b<+\\x03\\x0b8\" +\n\t\"\\x13\\x03\\x0b\\x043\\x03\\x0b\\x14\\x03\\x03\\x0b\\x16%\\x03\\x0d\\x22&\\x03\\x0b\\x1a\" +\n\t\"\\x1a\\x03\\x0b\\x1a\\x04\\x03\\x0a%9\\x03\\x0a&2\\x03\\x0a&0\\x03\\x0a!\\x1a\\x03\\x0a!\" +\n\t\"7\\x03\\x0a5\\x10\\x03\\x0a=4\\x03\\x0a?\\x0e\\x03\\x0a>\\x10\\x03\\x0a\\x00 \\x03\\x0a\" +\n\t\"\\x0f:\\x03\\x0a\\x0f9\\x03\\x0a\\x0b\\x0a\\x03\\x0a\\x17%\\x03\\x0a\\x1b-\\x03\\x09-\" +\n\t\"\\x1a\\x03\\x09,4\\x03\\x09.,\\x03\\x09)\\x09\\x03\\x096!\\x03\\x091\\x1f\\x03\\x093\" +\n\t\"\\x16\\x03\\x0c+\\x1f\\x03\\x098 \\x03\\x098=\\x03\\x0c(\\x1a\\x03\\x0c(\\x16\\x03\\x09\" +\n\t\"\\x0a+\\x03\\x09\\x16\\x12\\x03\\x09\\x13\\x0e\\x03\\x09\\x153\\x03\\x08)!\\x03\\x09\\x1a\" +\n\t\"\\x01\\x03\\x09\\x18\\x01\\x03\\x08%#\\x03\\x08>\\x22\\x03\\x08\\x05%\\x03\\x08\\x02*\" +\n\t\"\\x03\\x08\\x15;\\x03\\x08\\x1b7\\x03\\x0f\\x07\\x1d\\x03\\x0f\\x04\\x03\\x03\\x070\\x0c\" +\n\t\"\\x03\\x07;\\x0b\\x03\\x07\\x08\\x17\\x03\\x07\\x12\\x06\\x03\\x06/-\\x03\\x0671\\x03\" +\n\t\"\\x065+\\x03\\x06>7\\x03\\x06\\x049\\x03\\x05+\\x1e\\x03\\x05,\\x17\\x03\\x05 \\x1d\\x03\" +\n\t\"\\x05\\x22\\x05\\x03\\x050\\x1d\"\n\n// lookup returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookup(s []byte) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupUnsafe(s []byte) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// lookupString returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookupString(s string) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupStringUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupStringUnsafe(s string) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// idnaTrie. Total size: 29052 bytes (28.37 KiB). Checksum: ef06e7ecc26f36dd.\ntype idnaTrie struct{}\n\nfunc newIdnaTrie(i int) *idnaTrie {\n\treturn &idnaTrie{}\n}\n\n// lookupValue determines the type of block n and looks up the value for b.\nfunc (t *idnaTrie) lookupValue(n uint32, b byte) uint16 {\n\tswitch {\n\tcase n < 125:\n\t\treturn uint16(idnaValues[n<<6+uint32(b)])\n\tdefault:\n\t\tn -= 125\n\t\treturn uint16(idnaSparse.lookup(n, b))\n\t}\n}\n\n// idnaValues: 127 blocks, 8128 entries, 16256 bytes\n// The third block is the zero block.\nvar idnaValues = [8128]uint16{\n\t// Block 0x0, offset 0x0\n\t0x00: 0x0080, 0x01: 0x0080, 0x02: 0x0080, 0x03: 0x0080, 0x04: 0x0080, 0x05: 0x0080,\n\t0x06: 0x0080, 0x07: 0x0080, 0x08: 0x0080, 0x09: 0x0080, 0x0a: 0x0080, 0x0b: 0x0080,\n\t0x0c: 0x0080, 0x0d: 0x0080, 0x0e: 0x0080, 0x0f: 0x0080, 0x10: 0x0080, 0x11: 0x0080,\n\t0x12: 0x0080, 0x13: 0x0080, 0x14: 0x0080, 0x15: 0x0080, 0x16: 0x0080, 0x17: 0x0080,\n\t0x18: 0x0080, 0x19: 0x0080, 0x1a: 0x0080, 0x1b: 0x0080, 0x1c: 0x0080, 0x1d: 0x0080,\n\t0x1e: 0x0080, 0x1f: 0x0080, 0x20: 0x0080, 0x21: 0x0080, 0x22: 0x0080, 0x23: 0x0080,\n\t0x24: 0x0080, 0x25: 0x0080, 0x26: 0x0080, 0x27: 0x0080, 0x28: 0x0080, 0x29: 0x0080,\n\t0x2a: 0x0080, 0x2b: 0x0080, 0x2c: 0x0080, 0x2d: 0x0008, 0x2e: 0x0008, 0x2f: 0x0080,\n\t0x30: 0x0008, 0x31: 0x0008, 0x32: 0x0008, 0x33: 0x0008, 0x34: 0x0008, 0x35: 0x0008,\n\t0x36: 0x0008, 0x37: 0x0008, 0x38: 0x0008, 0x39: 0x0008, 0x3a: 0x0080, 0x3b: 0x0080,\n\t0x3c: 0x0080, 0x3d: 0x0080, 0x3e: 0x0080, 0x3f: 0x0080,\n\t// Block 0x1, offset 0x40\n\t0x40: 0x0080, 0x41: 0xe105, 0x42: 0xe105, 0x43: 0xe105, 0x44: 0xe105, 0x45: 0xe105,\n\t0x46: 0xe105, 0x47: 0xe105, 0x48: 0xe105, 0x49: 0xe105, 0x4a: 0xe105, 0x4b: 0xe105,\n\t0x4c: 0xe105, 0x4d: 0xe105, 0x4e: 0xe105, 0x4f: 0xe105, 0x50: 0xe105, 0x51: 0xe105,\n\t0x52: 0xe105, 0x53: 0xe105, 0x54: 0xe105, 0x55: 0xe105, 0x56: 0xe105, 0x57: 0xe105,\n\t0x58: 0xe105, 0x59: 0xe105, 0x5a: 0xe105, 0x5b: 0x0080, 0x5c: 0x0080, 0x5d: 0x0080,\n\t0x5e: 0x0080, 0x5f: 0x0080, 0x60: 0x0080, 0x61: 0x0008, 0x62: 0x0008, 0x63: 0x0008,\n\t0x64: 0x0008, 0x65: 0x0008, 0x66: 0x0008, 0x67: 0x0008, 0x68: 0x0008, 0x69: 0x0008,\n\t0x6a: 0x0008, 0x6b: 0x0008, 0x6c: 0x0008, 0x6d: 0x0008, 0x6e: 0x0008, 0x6f: 0x0008,\n\t0x70: 0x0008, 0x71: 0x0008, 0x72: 0x0008, 0x73: 0x0008, 0x74: 0x0008, 0x75: 0x0008,\n\t0x76: 0x0008, 0x77: 0x0008, 0x78: 0x0008, 0x79: 0x0008, 0x7a: 0x0008, 0x7b: 0x0080,\n\t0x7c: 0x0080, 0x7d: 0x0080, 0x7e: 0x0080, 0x7f: 0x0080,\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc0: 0x0040, 0xc1: 0x0040, 0xc2: 0x0040, 0xc3: 0x0040, 0xc4: 0x0040, 0xc5: 0x0040,\n\t0xc6: 0x0040, 0xc7: 0x0040, 0xc8: 0x0040, 0xc9: 0x0040, 0xca: 0x0040, 0xcb: 0x0040,\n\t0xcc: 0x0040, 0xcd: 0x0040, 0xce: 0x0040, 0xcf: 0x0040, 0xd0: 0x0040, 0xd1: 0x0040,\n\t0xd2: 0x0040, 0xd3: 0x0040, 0xd4: 0x0040, 0xd5: 0x0040, 0xd6: 0x0040, 0xd7: 0x0040,\n\t0xd8: 0x0040, 0xd9: 0x0040, 0xda: 0x0040, 0xdb: 0x0040, 0xdc: 0x0040, 0xdd: 0x0040,\n\t0xde: 0x0040, 0xdf: 0x0040, 0xe0: 0x000a, 0xe1: 0x0018, 0xe2: 0x0018, 0xe3: 0x0018,\n\t0xe4: 0x0018, 0xe5: 0x0018, 0xe6: 0x0018, 0xe7: 0x0018, 0xe8: 0x001a, 0xe9: 0x0018,\n\t0xea: 0x0039, 0xeb: 0x0018, 0xec: 0x0018, 0xed: 0x03c0, 0xee: 0x0018, 0xef: 0x004a,\n\t0xf0: 0x0018, 0xf1: 0x0018, 0xf2: 0x0069, 0xf3: 0x0079, 0xf4: 0x008a, 0xf5: 0x0005,\n\t0xf6: 0x0018, 0xf7: 0x0008, 0xf8: 0x00aa, 0xf9: 0x00c9, 0xfa: 0x00d9, 0xfb: 0x0018,\n\t0xfc: 0x00e9, 0xfd: 0x0119, 0xfe: 0x0149, 0xff: 0x0018,\n\t// Block 0x4, offset 0x100\n\t0x100: 0xe00d, 0x101: 0x0008, 0x102: 0xe00d, 0x103: 0x0008, 0x104: 0xe00d, 0x105: 0x0008,\n\t0x106: 0xe00d, 0x107: 0x0008, 0x108: 0xe00d, 0x109: 0x0008, 0x10a: 0xe00d, 0x10b: 0x0008,\n\t0x10c: 0xe00d, 0x10d: 0x0008, 0x10e: 0xe00d, 0x10f: 0x0008, 0x110: 0xe00d, 0x111: 0x0008,\n\t0x112: 0xe00d, 0x113: 0x0008, 0x114: 0xe00d, 0x115: 0x0008, 0x116: 0xe00d, 0x117: 0x0008,\n\t0x118: 0xe00d, 0x119: 0x0008, 0x11a: 0xe00d, 0x11b: 0x0008, 0x11c: 0xe00d, 0x11d: 0x0008,\n\t0x11e: 0xe00d, 0x11f: 0x0008, 0x120: 0xe00d, 0x121: 0x0008, 0x122: 0xe00d, 0x123: 0x0008,\n\t0x124: 0xe00d, 0x125: 0x0008, 0x126: 0xe00d, 0x127: 0x0008, 0x128: 0xe00d, 0x129: 0x0008,\n\t0x12a: 0xe00d, 0x12b: 0x0008, 0x12c: 0xe00d, 0x12d: 0x0008, 0x12e: 0xe00d, 0x12f: 0x0008,\n\t0x130: 0x0179, 0x131: 0x0008, 0x132: 0x0035, 0x133: 0x004d, 0x134: 0xe00d, 0x135: 0x0008,\n\t0x136: 0xe00d, 0x137: 0x0008, 0x138: 0x0008, 0x139: 0xe01d, 0x13a: 0x0008, 0x13b: 0xe03d,\n\t0x13c: 0x0008, 0x13d: 0xe01d, 0x13e: 0x0008, 0x13f: 0x0199,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x0199, 0x141: 0xe01d, 0x142: 0x0008, 0x143: 0xe03d, 0x144: 0x0008, 0x145: 0xe01d,\n\t0x146: 0x0008, 0x147: 0xe07d, 0x148: 0x0008, 0x149: 0x01b9, 0x14a: 0xe00d, 0x14b: 0x0008,\n\t0x14c: 0xe00d, 0x14d: 0x0008, 0x14e: 0xe00d, 0x14f: 0x0008, 0x150: 0xe00d, 0x151: 0x0008,\n\t0x152: 0xe00d, 0x153: 0x0008, 0x154: 0xe00d, 0x155: 0x0008, 0x156: 0xe00d, 0x157: 0x0008,\n\t0x158: 0xe00d, 0x159: 0x0008, 0x15a: 0xe00d, 0x15b: 0x0008, 0x15c: 0xe00d, 0x15d: 0x0008,\n\t0x15e: 0xe00d, 0x15f: 0x0008, 0x160: 0xe00d, 0x161: 0x0008, 0x162: 0xe00d, 0x163: 0x0008,\n\t0x164: 0xe00d, 0x165: 0x0008, 0x166: 0xe00d, 0x167: 0x0008, 0x168: 0xe00d, 0x169: 0x0008,\n\t0x16a: 0xe00d, 0x16b: 0x0008, 0x16c: 0xe00d, 0x16d: 0x0008, 0x16e: 0xe00d, 0x16f: 0x0008,\n\t0x170: 0xe00d, 0x171: 0x0008, 0x172: 0xe00d, 0x173: 0x0008, 0x174: 0xe00d, 0x175: 0x0008,\n\t0x176: 0xe00d, 0x177: 0x0008, 0x178: 0x0065, 0x179: 0xe01d, 0x17a: 0x0008, 0x17b: 0xe03d,\n\t0x17c: 0x0008, 0x17d: 0xe01d, 0x17e: 0x0008, 0x17f: 0x01d9,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x0008, 0x181: 0x007d, 0x182: 0xe00d, 0x183: 0x0008, 0x184: 0xe00d, 0x185: 0x0008,\n\t0x186: 0x007d, 0x187: 0xe07d, 0x188: 0x0008, 0x189: 0x0095, 0x18a: 0x00ad, 0x18b: 0xe03d,\n\t0x18c: 0x0008, 0x18d: 0x0008, 0x18e: 0x00c5, 0x18f: 0x00dd, 0x190: 0x00f5, 0x191: 0xe01d,\n\t0x192: 0x0008, 0x193: 0x010d, 0x194: 0x0125, 0x195: 0x0008, 0x196: 0x013d, 0x197: 0x013d,\n\t0x198: 0xe00d, 0x199: 0x0008, 0x19a: 0x0008, 0x19b: 0x0008, 0x19c: 0x010d, 0x19d: 0x0155,\n\t0x19e: 0x0008, 0x19f: 0x016d, 0x1a0: 0xe00d, 0x1a1: 0x0008, 0x1a2: 0xe00d, 0x1a3: 0x0008,\n\t0x1a4: 0xe00d, 0x1a5: 0x0008, 0x1a6: 0x0185, 0x1a7: 0xe07d, 0x1a8: 0x0008, 0x1a9: 0x019d,\n\t0x1aa: 0x0008, 0x1ab: 0x0008, 0x1ac: 0xe00d, 0x1ad: 0x0008, 0x1ae: 0x0185, 0x1af: 0xe0fd,\n\t0x1b0: 0x0008, 0x1b1: 0x01b5, 0x1b2: 0x01cd, 0x1b3: 0xe03d, 0x1b4: 0x0008, 0x1b5: 0xe01d,\n\t0x1b6: 0x0008, 0x1b7: 0x01e5, 0x1b8: 0xe00d, 0x1b9: 0x0008, 0x1ba: 0x0008, 0x1bb: 0x0008,\n\t0x1bc: 0xe00d, 0x1bd: 0x0008, 0x1be: 0x0008, 0x1bf: 0x0008,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x0008, 0x1c1: 0x0008, 0x1c2: 0x0008, 0x1c3: 0x0008, 0x1c4: 0x01e9, 0x1c5: 0x01e9,\n\t0x1c6: 0x01e9, 0x1c7: 0x01fd, 0x1c8: 0x0215, 0x1c9: 0x022d, 0x1ca: 0x0245, 0x1cb: 0x025d,\n\t0x1cc: 0x0275, 0x1cd: 0xe01d, 0x1ce: 0x0008, 0x1cf: 0xe0fd, 0x1d0: 0x0008, 0x1d1: 0xe01d,\n\t0x1d2: 0x0008, 0x1d3: 0xe03d, 0x1d4: 0x0008, 0x1d5: 0xe01d, 0x1d6: 0x0008, 0x1d7: 0xe07d,\n\t0x1d8: 0x0008, 0x1d9: 0xe01d, 0x1da: 0x0008, 0x1db: 0xe03d, 0x1dc: 0x0008, 0x1dd: 0x0008,\n\t0x1de: 0xe00d, 0x1df: 0x0008, 0x1e0: 0xe00d, 0x1e1: 0x0008, 0x1e2: 0xe00d, 0x1e3: 0x0008,\n\t0x1e4: 0xe00d, 0x1e5: 0x0008, 0x1e6: 0xe00d, 0x1e7: 0x0008, 0x1e8: 0xe00d, 0x1e9: 0x0008,\n\t0x1ea: 0xe00d, 0x1eb: 0x0008, 0x1ec: 0xe00d, 0x1ed: 0x0008, 0x1ee: 0xe00d, 0x1ef: 0x0008,\n\t0x1f0: 0x0008, 0x1f1: 0x028d, 0x1f2: 0x02a5, 0x1f3: 0x02bd, 0x1f4: 0xe00d, 0x1f5: 0x0008,\n\t0x1f6: 0x02d5, 0x1f7: 0x02ed, 0x1f8: 0xe00d, 0x1f9: 0x0008, 0x1fa: 0xe00d, 0x1fb: 0x0008,\n\t0x1fc: 0xe00d, 0x1fd: 0x0008, 0x1fe: 0xe00d, 0x1ff: 0x0008,\n\t// Block 0x8, offset 0x200\n\t0x200: 0xe00d, 0x201: 0x0008, 0x202: 0xe00d, 0x203: 0x0008, 0x204: 0xe00d, 0x205: 0x0008,\n\t0x206: 0xe00d, 0x207: 0x0008, 0x208: 0xe00d, 0x209: 0x0008, 0x20a: 0xe00d, 0x20b: 0x0008,\n\t0x20c: 0xe00d, 0x20d: 0x0008, 0x20e: 0xe00d, 0x20f: 0x0008, 0x210: 0xe00d, 0x211: 0x0008,\n\t0x212: 0xe00d, 0x213: 0x0008, 0x214: 0xe00d, 0x215: 0x0008, 0x216: 0xe00d, 0x217: 0x0008,\n\t0x218: 0xe00d, 0x219: 0x0008, 0x21a: 0xe00d, 0x21b: 0x0008, 0x21c: 0xe00d, 0x21d: 0x0008,\n\t0x21e: 0xe00d, 0x21f: 0x0008, 0x220: 0x0305, 0x221: 0x0008, 0x222: 0xe00d, 0x223: 0x0008,\n\t0x224: 0xe00d, 0x225: 0x0008, 0x226: 0xe00d, 0x227: 0x0008, 0x228: 0xe00d, 0x229: 0x0008,\n\t0x22a: 0xe00d, 0x22b: 0x0008, 0x22c: 0xe00d, 0x22d: 0x0008, 0x22e: 0xe00d, 0x22f: 0x0008,\n\t0x230: 0xe00d, 0x231: 0x0008, 0x232: 0xe00d, 0x233: 0x0008, 0x234: 0x0008, 0x235: 0x0008,\n\t0x236: 0x0008, 0x237: 0x0008, 0x238: 0x0008, 0x239: 0x0008, 0x23a: 0x0209, 0x23b: 0xe03d,\n\t0x23c: 0x0008, 0x23d: 0x031d, 0x23e: 0x0229, 0x23f: 0x0008,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x0008, 0x241: 0x0008, 0x242: 0x0018, 0x243: 0x0018, 0x244: 0x0018, 0x245: 0x0018,\n\t0x246: 0x0008, 0x247: 0x0008, 0x248: 0x0008, 0x249: 0x0008, 0x24a: 0x0008, 0x24b: 0x0008,\n\t0x24c: 0x0008, 0x24d: 0x0008, 0x24e: 0x0008, 0x24f: 0x0008, 0x250: 0x0008, 0x251: 0x0008,\n\t0x252: 0x0018, 0x253: 0x0018, 0x254: 0x0018, 0x255: 0x0018, 0x256: 0x0018, 0x257: 0x0018,\n\t0x258: 0x029a, 0x259: 0x02ba, 0x25a: 0x02da, 0x25b: 0x02fa, 0x25c: 0x031a, 0x25d: 0x033a,\n\t0x25e: 0x0018, 0x25f: 0x0018, 0x260: 0x03ad, 0x261: 0x0359, 0x262: 0x01d9, 0x263: 0x0369,\n\t0x264: 0x03c5, 0x265: 0x0018, 0x266: 0x0018, 0x267: 0x0018, 0x268: 0x0018, 0x269: 0x0018,\n\t0x26a: 0x0018, 0x26b: 0x0018, 0x26c: 0x0008, 0x26d: 0x0018, 0x26e: 0x0008, 0x26f: 0x0018,\n\t0x270: 0x0018, 0x271: 0x0018, 0x272: 0x0018, 0x273: 0x0018, 0x274: 0x0018, 0x275: 0x0018,\n\t0x276: 0x0018, 0x277: 0x0018, 0x278: 0x0018, 0x279: 0x0018, 0x27a: 0x0018, 0x27b: 0x0018,\n\t0x27c: 0x0018, 0x27d: 0x0018, 0x27e: 0x0018, 0x27f: 0x0018,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x03dd, 0x281: 0x03dd, 0x282: 0x3308, 0x283: 0x03f5, 0x284: 0x0379, 0x285: 0x040d,\n\t0x286: 0x3308, 0x287: 0x3308, 0x288: 0x3308, 0x289: 0x3308, 0x28a: 0x3308, 0x28b: 0x3308,\n\t0x28c: 0x3308, 0x28d: 0x3308, 0x28e: 0x3308, 0x28f: 0x33c0, 0x290: 0x3308, 0x291: 0x3308,\n\t0x292: 0x3308, 0x293: 0x3308, 0x294: 0x3308, 0x295: 0x3308, 0x296: 0x3308, 0x297: 0x3308,\n\t0x298: 0x3308, 0x299: 0x3308, 0x29a: 0x3308, 0x29b: 0x3308, 0x29c: 0x3308, 0x29d: 0x3308,\n\t0x29e: 0x3308, 0x29f: 0x3308, 0x2a0: 0x3308, 0x2a1: 0x3308, 0x2a2: 0x3308, 0x2a3: 0x3308,\n\t0x2a4: 0x3308, 0x2a5: 0x3308, 0x2a6: 0x3308, 0x2a7: 0x3308, 0x2a8: 0x3308, 0x2a9: 0x3308,\n\t0x2aa: 0x3308, 0x2ab: 0x3308, 0x2ac: 0x3308, 0x2ad: 0x3308, 0x2ae: 0x3308, 0x2af: 0x3308,\n\t0x2b0: 0xe00d, 0x2b1: 0x0008, 0x2b2: 0xe00d, 0x2b3: 0x0008, 0x2b4: 0x0425, 0x2b5: 0x0008,\n\t0x2b6: 0xe00d, 0x2b7: 0x0008, 0x2b8: 0x0040, 0x2b9: 0x0040, 0x2ba: 0x03a2, 0x2bb: 0x0008,\n\t0x2bc: 0x0008, 0x2bd: 0x0008, 0x2be: 0x03c2, 0x2bf: 0x043d,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x0040, 0x2c1: 0x0040, 0x2c2: 0x0040, 0x2c3: 0x0040, 0x2c4: 0x008a, 0x2c5: 0x03d2,\n\t0x2c6: 0xe155, 0x2c7: 0x0455, 0x2c8: 0xe12d, 0x2c9: 0xe13d, 0x2ca: 0xe12d, 0x2cb: 0x0040,\n\t0x2cc: 0x03dd, 0x2cd: 0x0040, 0x2ce: 0x046d, 0x2cf: 0x0485, 0x2d0: 0x0008, 0x2d1: 0xe105,\n\t0x2d2: 0xe105, 0x2d3: 0xe105, 0x2d4: 0xe105, 0x2d5: 0xe105, 0x2d6: 0xe105, 0x2d7: 0xe105,\n\t0x2d8: 0xe105, 0x2d9: 0xe105, 0x2da: 0xe105, 0x2db: 0xe105, 0x2dc: 0xe105, 0x2dd: 0xe105,\n\t0x2de: 0xe105, 0x2df: 0xe105, 0x2e0: 0x049d, 0x2e1: 0x049d, 0x2e2: 0x0040, 0x2e3: 0x049d,\n\t0x2e4: 0x049d, 0x2e5: 0x049d, 0x2e6: 0x049d, 0x2e7: 0x049d, 0x2e8: 0x049d, 0x2e9: 0x049d,\n\t0x2ea: 0x049d, 0x2eb: 0x049d, 0x2ec: 0x0008, 0x2ed: 0x0008, 0x2ee: 0x0008, 0x2ef: 0x0008,\n\t0x2f0: 0x0008, 0x2f1: 0x0008, 0x2f2: 0x0008, 0x2f3: 0x0008, 0x2f4: 0x0008, 0x2f5: 0x0008,\n\t0x2f6: 0x0008, 0x2f7: 0x0008, 0x2f8: 0x0008, 0x2f9: 0x0008, 0x2fa: 0x0008, 0x2fb: 0x0008,\n\t0x2fc: 0x0008, 0x2fd: 0x0008, 0x2fe: 0x0008, 0x2ff: 0x0008,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x0008, 0x301: 0x0008, 0x302: 0xe00f, 0x303: 0x0008, 0x304: 0x0008, 0x305: 0x0008,\n\t0x306: 0x0008, 0x307: 0x0008, 0x308: 0x0008, 0x309: 0x0008, 0x30a: 0x0008, 0x30b: 0x0008,\n\t0x30c: 0x0008, 0x30d: 0x0008, 0x30e: 0x0008, 0x30f: 0xe0c5, 0x310: 0x04b5, 0x311: 0x04cd,\n\t0x312: 0xe0bd, 0x313: 0xe0f5, 0x314: 0xe0fd, 0x315: 0xe09d, 0x316: 0xe0b5, 0x317: 0x0008,\n\t0x318: 0xe00d, 0x319: 0x0008, 0x31a: 0xe00d, 0x31b: 0x0008, 0x31c: 0xe00d, 0x31d: 0x0008,\n\t0x31e: 0xe00d, 0x31f: 0x0008, 0x320: 0xe00d, 0x321: 0x0008, 0x322: 0xe00d, 0x323: 0x0008,\n\t0x324: 0xe00d, 0x325: 0x0008, 0x326: 0xe00d, 0x327: 0x0008, 0x328: 0xe00d, 0x329: 0x0008,\n\t0x32a: 0xe00d, 0x32b: 0x0008, 0x32c: 0xe00d, 0x32d: 0x0008, 0x32e: 0xe00d, 0x32f: 0x0008,\n\t0x330: 0x04e5, 0x331: 0xe185, 0x332: 0xe18d, 0x333: 0x0008, 0x334: 0x04fd, 0x335: 0x03dd,\n\t0x336: 0x0018, 0x337: 0xe07d, 0x338: 0x0008, 0x339: 0xe1d5, 0x33a: 0xe00d, 0x33b: 0x0008,\n\t0x33c: 0x0008, 0x33d: 0x0515, 0x33e: 0x052d, 0x33f: 0x052d,\n\t// Block 0xd, offset 0x340\n\t0x340: 0x0008, 0x341: 0x0008, 0x342: 0x0008, 0x343: 0x0008, 0x344: 0x0008, 0x345: 0x0008,\n\t0x346: 0x0008, 0x347: 0x0008, 0x348: 0x0008, 0x349: 0x0008, 0x34a: 0x0008, 0x34b: 0x0008,\n\t0x34c: 0x0008, 0x34d: 0x0008, 0x34e: 0x0008, 0x34f: 0x0008, 0x350: 0x0008, 0x351: 0x0008,\n\t0x352: 0x0008, 0x353: 0x0008, 0x354: 0x0008, 0x355: 0x0008, 0x356: 0x0008, 0x357: 0x0008,\n\t0x358: 0x0008, 0x359: 0x0008, 0x35a: 0x0008, 0x35b: 0x0008, 0x35c: 0x0008, 0x35d: 0x0008,\n\t0x35e: 0x0008, 0x35f: 0x0008, 0x360: 0xe00d, 0x361: 0x0008, 0x362: 0xe00d, 0x363: 0x0008,\n\t0x364: 0xe00d, 0x365: 0x0008, 0x366: 0xe00d, 0x367: 0x0008, 0x368: 0xe00d, 0x369: 0x0008,\n\t0x36a: 0xe00d, 0x36b: 0x0008, 0x36c: 0xe00d, 0x36d: 0x0008, 0x36e: 0xe00d, 0x36f: 0x0008,\n\t0x370: 0xe00d, 0x371: 0x0008, 0x372: 0xe00d, 0x373: 0x0008, 0x374: 0xe00d, 0x375: 0x0008,\n\t0x376: 0xe00d, 0x377: 0x0008, 0x378: 0xe00d, 0x379: 0x0008, 0x37a: 0xe00d, 0x37b: 0x0008,\n\t0x37c: 0xe00d, 0x37d: 0x0008, 0x37e: 0xe00d, 0x37f: 0x0008,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xe00d, 0x381: 0x0008, 0x382: 0x0018, 0x383: 0x3308, 0x384: 0x3308, 0x385: 0x3308,\n\t0x386: 0x3308, 0x387: 0x3308, 0x388: 0x3318, 0x389: 0x3318, 0x38a: 0xe00d, 0x38b: 0x0008,\n\t0x38c: 0xe00d, 0x38d: 0x0008, 0x38e: 0xe00d, 0x38f: 0x0008, 0x390: 0xe00d, 0x391: 0x0008,\n\t0x392: 0xe00d, 0x393: 0x0008, 0x394: 0xe00d, 0x395: 0x0008, 0x396: 0xe00d, 0x397: 0x0008,\n\t0x398: 0xe00d, 0x399: 0x0008, 0x39a: 0xe00d, 0x39b: 0x0008, 0x39c: 0xe00d, 0x39d: 0x0008,\n\t0x39e: 0xe00d, 0x39f: 0x0008, 0x3a0: 0xe00d, 0x3a1: 0x0008, 0x3a2: 0xe00d, 0x3a3: 0x0008,\n\t0x3a4: 0xe00d, 0x3a5: 0x0008, 0x3a6: 0xe00d, 0x3a7: 0x0008, 0x3a8: 0xe00d, 0x3a9: 0x0008,\n\t0x3aa: 0xe00d, 0x3ab: 0x0008, 0x3ac: 0xe00d, 0x3ad: 0x0008, 0x3ae: 0xe00d, 0x3af: 0x0008,\n\t0x3b0: 0xe00d, 0x3b1: 0x0008, 0x3b2: 0xe00d, 0x3b3: 0x0008, 0x3b4: 0xe00d, 0x3b5: 0x0008,\n\t0x3b6: 0xe00d, 0x3b7: 0x0008, 0x3b8: 0xe00d, 0x3b9: 0x0008, 0x3ba: 0xe00d, 0x3bb: 0x0008,\n\t0x3bc: 0xe00d, 0x3bd: 0x0008, 0x3be: 0xe00d, 0x3bf: 0x0008,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x0040, 0x3c1: 0xe01d, 0x3c2: 0x0008, 0x3c3: 0xe03d, 0x3c4: 0x0008, 0x3c5: 0xe01d,\n\t0x3c6: 0x0008, 0x3c7: 0xe07d, 0x3c8: 0x0008, 0x3c9: 0xe01d, 0x3ca: 0x0008, 0x3cb: 0xe03d,\n\t0x3cc: 0x0008, 0x3cd: 0xe01d, 0x3ce: 0x0008, 0x3cf: 0x0008, 0x3d0: 0xe00d, 0x3d1: 0x0008,\n\t0x3d2: 0xe00d, 0x3d3: 0x0008, 0x3d4: 0xe00d, 0x3d5: 0x0008, 0x3d6: 0xe00d, 0x3d7: 0x0008,\n\t0x3d8: 0xe00d, 0x3d9: 0x0008, 0x3da: 0xe00d, 0x3db: 0x0008, 0x3dc: 0xe00d, 0x3dd: 0x0008,\n\t0x3de: 0xe00d, 0x3df: 0x0008, 0x3e0: 0xe00d, 0x3e1: 0x0008, 0x3e2: 0xe00d, 0x3e3: 0x0008,\n\t0x3e4: 0xe00d, 0x3e5: 0x0008, 0x3e6: 0xe00d, 0x3e7: 0x0008, 0x3e8: 0xe00d, 0x3e9: 0x0008,\n\t0x3ea: 0xe00d, 0x3eb: 0x0008, 0x3ec: 0xe00d, 0x3ed: 0x0008, 0x3ee: 0xe00d, 0x3ef: 0x0008,\n\t0x3f0: 0xe00d, 0x3f1: 0x0008, 0x3f2: 0xe00d, 0x3f3: 0x0008, 0x3f4: 0xe00d, 0x3f5: 0x0008,\n\t0x3f6: 0xe00d, 0x3f7: 0x0008, 0x3f8: 0xe00d, 0x3f9: 0x0008, 0x3fa: 0xe00d, 0x3fb: 0x0008,\n\t0x3fc: 0xe00d, 0x3fd: 0x0008, 0x3fe: 0xe00d, 0x3ff: 0x0008,\n\t// Block 0x10, offset 0x400\n\t0x400: 0xe00d, 0x401: 0x0008, 0x402: 0xe00d, 0x403: 0x0008, 0x404: 0xe00d, 0x405: 0x0008,\n\t0x406: 0xe00d, 0x407: 0x0008, 0x408: 0xe00d, 0x409: 0x0008, 0x40a: 0xe00d, 0x40b: 0x0008,\n\t0x40c: 0xe00d, 0x40d: 0x0008, 0x40e: 0xe00d, 0x40f: 0x0008, 0x410: 0xe00d, 0x411: 0x0008,\n\t0x412: 0xe00d, 0x413: 0x0008, 0x414: 0xe00d, 0x415: 0x0008, 0x416: 0xe00d, 0x417: 0x0008,\n\t0x418: 0xe00d, 0x419: 0x0008, 0x41a: 0xe00d, 0x41b: 0x0008, 0x41c: 0xe00d, 0x41d: 0x0008,\n\t0x41e: 0xe00d, 0x41f: 0x0008, 0x420: 0xe00d, 0x421: 0x0008, 0x422: 0xe00d, 0x423: 0x0008,\n\t0x424: 0xe00d, 0x425: 0x0008, 0x426: 0xe00d, 0x427: 0x0008, 0x428: 0xe00d, 0x429: 0x0008,\n\t0x42a: 0xe00d, 0x42b: 0x0008, 0x42c: 0xe00d, 0x42d: 0x0008, 0x42e: 0xe00d, 0x42f: 0x0008,\n\t0x430: 0x0040, 0x431: 0x03f5, 0x432: 0x03f5, 0x433: 0x03f5, 0x434: 0x03f5, 0x435: 0x03f5,\n\t0x436: 0x03f5, 0x437: 0x03f5, 0x438: 0x03f5, 0x439: 0x03f5, 0x43a: 0x03f5, 0x43b: 0x03f5,\n\t0x43c: 0x03f5, 0x43d: 0x03f5, 0x43e: 0x03f5, 0x43f: 0x03f5,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x0840, 0x441: 0x0840, 0x442: 0x0840, 0x443: 0x0840, 0x444: 0x0840, 0x445: 0x0840,\n\t0x446: 0x0018, 0x447: 0x0018, 0x448: 0x0818, 0x449: 0x0018, 0x44a: 0x0018, 0x44b: 0x0818,\n\t0x44c: 0x0018, 0x44d: 0x0818, 0x44e: 0x0018, 0x44f: 0x0018, 0x450: 0x3308, 0x451: 0x3308,\n\t0x452: 0x3308, 0x453: 0x3308, 0x454: 0x3308, 0x455: 0x3308, 0x456: 0x3308, 0x457: 0x3308,\n\t0x458: 0x3308, 0x459: 0x3308, 0x45a: 0x3308, 0x45b: 0x0818, 0x45c: 0x0b40, 0x45d: 0x0040,\n\t0x45e: 0x0818, 0x45f: 0x0818, 0x460: 0x0a08, 0x461: 0x0808, 0x462: 0x0c08, 0x463: 0x0c08,\n\t0x464: 0x0c08, 0x465: 0x0c08, 0x466: 0x0a08, 0x467: 0x0c08, 0x468: 0x0a08, 0x469: 0x0c08,\n\t0x46a: 0x0a08, 0x46b: 0x0a08, 0x46c: 0x0a08, 0x46d: 0x0a08, 0x46e: 0x0a08, 0x46f: 0x0c08,\n\t0x470: 0x0c08, 0x471: 0x0c08, 0x472: 0x0c08, 0x473: 0x0a08, 0x474: 0x0a08, 0x475: 0x0a08,\n\t0x476: 0x0a08, 0x477: 0x0a08, 0x478: 0x0a08, 0x479: 0x0a08, 0x47a: 0x0a08, 0x47b: 0x0a08,\n\t0x47c: 0x0a08, 0x47d: 0x0a08, 0x47e: 0x0a08, 0x47f: 0x0a08,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x0818, 0x481: 0x0a08, 0x482: 0x0a08, 0x483: 0x0a08, 0x484: 0x0a08, 0x485: 0x0a08,\n\t0x486: 0x0a08, 0x487: 0x0a08, 0x488: 0x0c08, 0x489: 0x0a08, 0x48a: 0x0a08, 0x48b: 0x3308,\n\t0x48c: 0x3308, 0x48d: 0x3308, 0x48e: 0x3308, 0x48f: 0x3308, 0x490: 0x3308, 0x491: 0x3308,\n\t0x492: 0x3308, 0x493: 0x3308, 0x494: 0x3308, 0x495: 0x3308, 0x496: 0x3308, 0x497: 0x3308,\n\t0x498: 0x3308, 0x499: 0x3308, 0x49a: 0x3308, 0x49b: 0x3308, 0x49c: 0x3308, 0x49d: 0x3308,\n\t0x49e: 0x3308, 0x49f: 0x3308, 0x4a0: 0x0808, 0x4a1: 0x0808, 0x4a2: 0x0808, 0x4a3: 0x0808,\n\t0x4a4: 0x0808, 0x4a5: 0x0808, 0x4a6: 0x0808, 0x4a7: 0x0808, 0x4a8: 0x0808, 0x4a9: 0x0808,\n\t0x4aa: 0x0018, 0x4ab: 0x0818, 0x4ac: 0x0818, 0x4ad: 0x0818, 0x4ae: 0x0a08, 0x4af: 0x0a08,\n\t0x4b0: 0x3308, 0x4b1: 0x0c08, 0x4b2: 0x0c08, 0x4b3: 0x0c08, 0x4b4: 0x0808, 0x4b5: 0x0429,\n\t0x4b6: 0x0451, 0x4b7: 0x0479, 0x4b8: 0x04a1, 0x4b9: 0x0a08, 0x4ba: 0x0a08, 0x4bb: 0x0a08,\n\t0x4bc: 0x0a08, 0x4bd: 0x0a08, 0x4be: 0x0a08, 0x4bf: 0x0a08,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0x0c08, 0x4c1: 0x0a08, 0x4c2: 0x0a08, 0x4c3: 0x0c08, 0x4c4: 0x0c08, 0x4c5: 0x0c08,\n\t0x4c6: 0x0c08, 0x4c7: 0x0c08, 0x4c8: 0x0c08, 0x4c9: 0x0c08, 0x4ca: 0x0c08, 0x4cb: 0x0c08,\n\t0x4cc: 0x0a08, 0x4cd: 0x0c08, 0x4ce: 0x0a08, 0x4cf: 0x0c08, 0x4d0: 0x0a08, 0x4d1: 0x0a08,\n\t0x4d2: 0x0c08, 0x4d3: 0x0c08, 0x4d4: 0x0818, 0x4d5: 0x0c08, 0x4d6: 0x3308, 0x4d7: 0x3308,\n\t0x4d8: 0x3308, 0x4d9: 0x3308, 0x4da: 0x3308, 0x4db: 0x3308, 0x4dc: 0x3308, 0x4dd: 0x0840,\n\t0x4de: 0x0018, 0x4df: 0x3308, 0x4e0: 0x3308, 0x4e1: 0x3308, 0x4e2: 0x3308, 0x4e3: 0x3308,\n\t0x4e4: 0x3308, 0x4e5: 0x0808, 0x4e6: 0x0808, 0x4e7: 0x3308, 0x4e8: 0x3308, 0x4e9: 0x0018,\n\t0x4ea: 0x3308, 0x4eb: 0x3308, 0x4ec: 0x3308, 0x4ed: 0x3308, 0x4ee: 0x0c08, 0x4ef: 0x0c08,\n\t0x4f0: 0x0008, 0x4f1: 0x0008, 0x4f2: 0x0008, 0x4f3: 0x0008, 0x4f4: 0x0008, 0x4f5: 0x0008,\n\t0x4f6: 0x0008, 0x4f7: 0x0008, 0x4f8: 0x0008, 0x4f9: 0x0008, 0x4fa: 0x0a08, 0x4fb: 0x0a08,\n\t0x4fc: 0x0a08, 0x4fd: 0x0808, 0x4fe: 0x0808, 0x4ff: 0x0a08,\n\t// Block 0x14, offset 0x500\n\t0x500: 0x0818, 0x501: 0x0818, 0x502: 0x0818, 0x503: 0x0818, 0x504: 0x0818, 0x505: 0x0818,\n\t0x506: 0x0818, 0x507: 0x0818, 0x508: 0x0818, 0x509: 0x0818, 0x50a: 0x0818, 0x50b: 0x0818,\n\t0x50c: 0x0818, 0x50d: 0x0818, 0x50e: 0x0040, 0x50f: 0x0b40, 0x510: 0x0c08, 0x511: 0x3308,\n\t0x512: 0x0a08, 0x513: 0x0a08, 0x514: 0x0a08, 0x515: 0x0c08, 0x516: 0x0c08, 0x517: 0x0c08,\n\t0x518: 0x0c08, 0x519: 0x0c08, 0x51a: 0x0a08, 0x51b: 0x0a08, 0x51c: 0x0a08, 0x51d: 0x0a08,\n\t0x51e: 0x0c08, 0x51f: 0x0a08, 0x520: 0x0a08, 0x521: 0x0a08, 0x522: 0x0a08, 0x523: 0x0a08,\n\t0x524: 0x0a08, 0x525: 0x0a08, 0x526: 0x0a08, 0x527: 0x0a08, 0x528: 0x0c08, 0x529: 0x0a08,\n\t0x52a: 0x0c08, 0x52b: 0x0a08, 0x52c: 0x0c08, 0x52d: 0x0a08, 0x52e: 0x0a08, 0x52f: 0x0c08,\n\t0x530: 0x3308, 0x531: 0x3308, 0x532: 0x3308, 0x533: 0x3308, 0x534: 0x3308, 0x535: 0x3308,\n\t0x536: 0x3308, 0x537: 0x3308, 0x538: 0x3308, 0x539: 0x3308, 0x53a: 0x3308, 0x53b: 0x3308,\n\t0x53c: 0x3308, 0x53d: 0x3308, 0x53e: 0x3308, 0x53f: 0x3308,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x0c08, 0x541: 0x0a08, 0x542: 0x0a08, 0x543: 0x0a08, 0x544: 0x0a08, 0x545: 0x0a08,\n\t0x546: 0x0c08, 0x547: 0x0c08, 0x548: 0x0a08, 0x549: 0x0c08, 0x54a: 0x0a08, 0x54b: 0x0a08,\n\t0x54c: 0x0a08, 0x54d: 0x0a08, 0x54e: 0x0a08, 0x54f: 0x0a08, 0x550: 0x0a08, 0x551: 0x0a08,\n\t0x552: 0x0a08, 0x553: 0x0a08, 0x554: 0x0c08, 0x555: 0x0a08, 0x556: 0x0808, 0x557: 0x0808,\n\t0x558: 0x0808, 0x559: 0x3308, 0x55a: 0x3308, 0x55b: 0x3308, 0x55c: 0x0040, 0x55d: 0x0040,\n\t0x55e: 0x0818, 0x55f: 0x0040, 0x560: 0x0a08, 0x561: 0x0808, 0x562: 0x0a08, 0x563: 0x0a08,\n\t0x564: 0x0a08, 0x565: 0x0a08, 0x566: 0x0808, 0x567: 0x0c08, 0x568: 0x0a08, 0x569: 0x0c08,\n\t0x56a: 0x0c08, 0x56b: 0x0040, 0x56c: 0x0040, 0x56d: 0x0040, 0x56e: 0x0040, 0x56f: 0x0040,\n\t0x570: 0x0040, 0x571: 0x0040, 0x572: 0x0040, 0x573: 0x0040, 0x574: 0x0040, 0x575: 0x0040,\n\t0x576: 0x0040, 0x577: 0x0040, 0x578: 0x0040, 0x579: 0x0040, 0x57a: 0x0040, 0x57b: 0x0040,\n\t0x57c: 0x0040, 0x57d: 0x0040, 0x57e: 0x0040, 0x57f: 0x0040,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x3008, 0x581: 0x3308, 0x582: 0x3308, 0x583: 0x3308, 0x584: 0x3308, 0x585: 0x3308,\n\t0x586: 0x3308, 0x587: 0x3308, 0x588: 0x3308, 0x589: 0x3008, 0x58a: 0x3008, 0x58b: 0x3008,\n\t0x58c: 0x3008, 0x58d: 0x3b08, 0x58e: 0x3008, 0x58f: 0x3008, 0x590: 0x0008, 0x591: 0x3308,\n\t0x592: 0x3308, 0x593: 0x3308, 0x594: 0x3308, 0x595: 0x3308, 0x596: 0x3308, 0x597: 0x3308,\n\t0x598: 0x04c9, 0x599: 0x0501, 0x59a: 0x0539, 0x59b: 0x0571, 0x59c: 0x05a9, 0x59d: 0x05e1,\n\t0x59e: 0x0619, 0x59f: 0x0651, 0x5a0: 0x0008, 0x5a1: 0x0008, 0x5a2: 0x3308, 0x5a3: 0x3308,\n\t0x5a4: 0x0018, 0x5a5: 0x0018, 0x5a6: 0x0008, 0x5a7: 0x0008, 0x5a8: 0x0008, 0x5a9: 0x0008,\n\t0x5aa: 0x0008, 0x5ab: 0x0008, 0x5ac: 0x0008, 0x5ad: 0x0008, 0x5ae: 0x0008, 0x5af: 0x0008,\n\t0x5b0: 0x0018, 0x5b1: 0x0008, 0x5b2: 0x0008, 0x5b3: 0x0008, 0x5b4: 0x0008, 0x5b5: 0x0008,\n\t0x5b6: 0x0008, 0x5b7: 0x0008, 0x5b8: 0x0008, 0x5b9: 0x0008, 0x5ba: 0x0008, 0x5bb: 0x0008,\n\t0x5bc: 0x0008, 0x5bd: 0x0008, 0x5be: 0x0008, 0x5bf: 0x0008,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x0008, 0x5c1: 0x3308, 0x5c2: 0x3008, 0x5c3: 0x3008, 0x5c4: 0x0040, 0x5c5: 0x0008,\n\t0x5c6: 0x0008, 0x5c7: 0x0008, 0x5c8: 0x0008, 0x5c9: 0x0008, 0x5ca: 0x0008, 0x5cb: 0x0008,\n\t0x5cc: 0x0008, 0x5cd: 0x0040, 0x5ce: 0x0040, 0x5cf: 0x0008, 0x5d0: 0x0008, 0x5d1: 0x0040,\n\t0x5d2: 0x0040, 0x5d3: 0x0008, 0x5d4: 0x0008, 0x5d5: 0x0008, 0x5d6: 0x0008, 0x5d7: 0x0008,\n\t0x5d8: 0x0008, 0x5d9: 0x0008, 0x5da: 0x0008, 0x5db: 0x0008, 0x5dc: 0x0008, 0x5dd: 0x0008,\n\t0x5de: 0x0008, 0x5df: 0x0008, 0x5e0: 0x0008, 0x5e1: 0x0008, 0x5e2: 0x0008, 0x5e3: 0x0008,\n\t0x5e4: 0x0008, 0x5e5: 0x0008, 0x5e6: 0x0008, 0x5e7: 0x0008, 0x5e8: 0x0008, 0x5e9: 0x0040,\n\t0x5ea: 0x0008, 0x5eb: 0x0008, 0x5ec: 0x0008, 0x5ed: 0x0008, 0x5ee: 0x0008, 0x5ef: 0x0008,\n\t0x5f0: 0x0008, 0x5f1: 0x0040, 0x5f2: 0x0008, 0x5f3: 0x0040, 0x5f4: 0x0040, 0x5f5: 0x0040,\n\t0x5f6: 0x0008, 0x5f7: 0x0008, 0x5f8: 0x0008, 0x5f9: 0x0008, 0x5fa: 0x0040, 0x5fb: 0x0040,\n\t0x5fc: 0x3308, 0x5fd: 0x0008, 0x5fe: 0x3008, 0x5ff: 0x3008,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x3008, 0x601: 0x3308, 0x602: 0x3308, 0x603: 0x3308, 0x604: 0x3308, 0x605: 0x0040,\n\t0x606: 0x0040, 0x607: 0x3008, 0x608: 0x3008, 0x609: 0x0040, 0x60a: 0x0040, 0x60b: 0x3008,\n\t0x60c: 0x3008, 0x60d: 0x3b08, 0x60e: 0x0008, 0x60f: 0x0040, 0x610: 0x0040, 0x611: 0x0040,\n\t0x612: 0x0040, 0x613: 0x0040, 0x614: 0x0040, 0x615: 0x0040, 0x616: 0x0040, 0x617: 0x3008,\n\t0x618: 0x0040, 0x619: 0x0040, 0x61a: 0x0040, 0x61b: 0x0040, 0x61c: 0x0689, 0x61d: 0x06c1,\n\t0x61e: 0x0040, 0x61f: 0x06f9, 0x620: 0x0008, 0x621: 0x0008, 0x622: 0x3308, 0x623: 0x3308,\n\t0x624: 0x0040, 0x625: 0x0040, 0x626: 0x0008, 0x627: 0x0008, 0x628: 0x0008, 0x629: 0x0008,\n\t0x62a: 0x0008, 0x62b: 0x0008, 0x62c: 0x0008, 0x62d: 0x0008, 0x62e: 0x0008, 0x62f: 0x0008,\n\t0x630: 0x0008, 0x631: 0x0008, 0x632: 0x0018, 0x633: 0x0018, 0x634: 0x0018, 0x635: 0x0018,\n\t0x636: 0x0018, 0x637: 0x0018, 0x638: 0x0018, 0x639: 0x0018, 0x63a: 0x0018, 0x63b: 0x0018,\n\t0x63c: 0x0008, 0x63d: 0x0018, 0x63e: 0x0040, 0x63f: 0x0040,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x0040, 0x641: 0x3308, 0x642: 0x3308, 0x643: 0x3008, 0x644: 0x0040, 0x645: 0x0008,\n\t0x646: 0x0008, 0x647: 0x0008, 0x648: 0x0008, 0x649: 0x0008, 0x64a: 0x0008, 0x64b: 0x0040,\n\t0x64c: 0x0040, 0x64d: 0x0040, 0x64e: 0x0040, 0x64f: 0x0008, 0x650: 0x0008, 0x651: 0x0040,\n\t0x652: 0x0040, 0x653: 0x0008, 0x654: 0x0008, 0x655: 0x0008, 0x656: 0x0008, 0x657: 0x0008,\n\t0x658: 0x0008, 0x659: 0x0008, 0x65a: 0x0008, 0x65b: 0x0008, 0x65c: 0x0008, 0x65d: 0x0008,\n\t0x65e: 0x0008, 0x65f: 0x0008, 0x660: 0x0008, 0x661: 0x0008, 0x662: 0x0008, 0x663: 0x0008,\n\t0x664: 0x0008, 0x665: 0x0008, 0x666: 0x0008, 0x667: 0x0008, 0x668: 0x0008, 0x669: 0x0040,\n\t0x66a: 0x0008, 0x66b: 0x0008, 0x66c: 0x0008, 0x66d: 0x0008, 0x66e: 0x0008, 0x66f: 0x0008,\n\t0x670: 0x0008, 0x671: 0x0040, 0x672: 0x0008, 0x673: 0x0731, 0x674: 0x0040, 0x675: 0x0008,\n\t0x676: 0x0769, 0x677: 0x0040, 0x678: 0x0008, 0x679: 0x0008, 0x67a: 0x0040, 0x67b: 0x0040,\n\t0x67c: 0x3308, 0x67d: 0x0040, 0x67e: 0x3008, 0x67f: 0x3008,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x3008, 0x681: 0x3308, 0x682: 0x3308, 0x683: 0x0040, 0x684: 0x0040, 0x685: 0x0040,\n\t0x686: 0x0040, 0x687: 0x3308, 0x688: 0x3308, 0x689: 0x0040, 0x68a: 0x0040, 0x68b: 0x3308,\n\t0x68c: 0x3308, 0x68d: 0x3b08, 0x68e: 0x0040, 0x68f: 0x0040, 0x690: 0x0040, 0x691: 0x3308,\n\t0x692: 0x0040, 0x693: 0x0040, 0x694: 0x0040, 0x695: 0x0040, 0x696: 0x0040, 0x697: 0x0040,\n\t0x698: 0x0040, 0x699: 0x07a1, 0x69a: 0x07d9, 0x69b: 0x0811, 0x69c: 0x0008, 0x69d: 0x0040,\n\t0x69e: 0x0849, 0x69f: 0x0040, 0x6a0: 0x0040, 0x6a1: 0x0040, 0x6a2: 0x0040, 0x6a3: 0x0040,\n\t0x6a4: 0x0040, 0x6a5: 0x0040, 0x6a6: 0x0008, 0x6a7: 0x0008, 0x6a8: 0x0008, 0x6a9: 0x0008,\n\t0x6aa: 0x0008, 0x6ab: 0x0008, 0x6ac: 0x0008, 0x6ad: 0x0008, 0x6ae: 0x0008, 0x6af: 0x0008,\n\t0x6b0: 0x3308, 0x6b1: 0x3308, 0x6b2: 0x0008, 0x6b3: 0x0008, 0x6b4: 0x0008, 0x6b5: 0x3308,\n\t0x6b6: 0x0040, 0x6b7: 0x0040, 0x6b8: 0x0040, 0x6b9: 0x0040, 0x6ba: 0x0040, 0x6bb: 0x0040,\n\t0x6bc: 0x0040, 0x6bd: 0x0040, 0x6be: 0x0040, 0x6bf: 0x0040,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x0040, 0x6c1: 0x3308, 0x6c2: 0x3308, 0x6c3: 0x3008, 0x6c4: 0x0040, 0x6c5: 0x0008,\n\t0x6c6: 0x0008, 0x6c7: 0x0008, 0x6c8: 0x0008, 0x6c9: 0x0008, 0x6ca: 0x0008, 0x6cb: 0x0008,\n\t0x6cc: 0x0008, 0x6cd: 0x0008, 0x6ce: 0x0040, 0x6cf: 0x0008, 0x6d0: 0x0008, 0x6d1: 0x0008,\n\t0x6d2: 0x0040, 0x6d3: 0x0008, 0x6d4: 0x0008, 0x6d5: 0x0008, 0x6d6: 0x0008, 0x6d7: 0x0008,\n\t0x6d8: 0x0008, 0x6d9: 0x0008, 0x6da: 0x0008, 0x6db: 0x0008, 0x6dc: 0x0008, 0x6dd: 0x0008,\n\t0x6de: 0x0008, 0x6df: 0x0008, 0x6e0: 0x0008, 0x6e1: 0x0008, 0x6e2: 0x0008, 0x6e3: 0x0008,\n\t0x6e4: 0x0008, 0x6e5: 0x0008, 0x6e6: 0x0008, 0x6e7: 0x0008, 0x6e8: 0x0008, 0x6e9: 0x0040,\n\t0x6ea: 0x0008, 0x6eb: 0x0008, 0x6ec: 0x0008, 0x6ed: 0x0008, 0x6ee: 0x0008, 0x6ef: 0x0008,\n\t0x6f0: 0x0008, 0x6f1: 0x0040, 0x6f2: 0x0008, 0x6f3: 0x0008, 0x6f4: 0x0040, 0x6f5: 0x0008,\n\t0x6f6: 0x0008, 0x6f7: 0x0008, 0x6f8: 0x0008, 0x6f9: 0x0008, 0x6fa: 0x0040, 0x6fb: 0x0040,\n\t0x6fc: 0x3308, 0x6fd: 0x0008, 0x6fe: 0x3008, 0x6ff: 0x3008,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x3008, 0x701: 0x3308, 0x702: 0x3308, 0x703: 0x3308, 0x704: 0x3308, 0x705: 0x3308,\n\t0x706: 0x0040, 0x707: 0x3308, 0x708: 0x3308, 0x709: 0x3008, 0x70a: 0x0040, 0x70b: 0x3008,\n\t0x70c: 0x3008, 0x70d: 0x3b08, 0x70e: 0x0040, 0x70f: 0x0040, 0x710: 0x0008, 0x711: 0x0040,\n\t0x712: 0x0040, 0x713: 0x0040, 0x714: 0x0040, 0x715: 0x0040, 0x716: 0x0040, 0x717: 0x0040,\n\t0x718: 0x0040, 0x719: 0x0040, 0x71a: 0x0040, 0x71b: 0x0040, 0x71c: 0x0040, 0x71d: 0x0040,\n\t0x71e: 0x0040, 0x71f: 0x0040, 0x720: 0x0008, 0x721: 0x0008, 0x722: 0x3308, 0x723: 0x3308,\n\t0x724: 0x0040, 0x725: 0x0040, 0x726: 0x0008, 0x727: 0x0008, 0x728: 0x0008, 0x729: 0x0008,\n\t0x72a: 0x0008, 0x72b: 0x0008, 0x72c: 0x0008, 0x72d: 0x0008, 0x72e: 0x0008, 0x72f: 0x0008,\n\t0x730: 0x0018, 0x731: 0x0018, 0x732: 0x0040, 0x733: 0x0040, 0x734: 0x0040, 0x735: 0x0040,\n\t0x736: 0x0040, 0x737: 0x0040, 0x738: 0x0040, 0x739: 0x0008, 0x73a: 0x3308, 0x73b: 0x3308,\n\t0x73c: 0x3308, 0x73d: 0x3308, 0x73e: 0x3308, 0x73f: 0x3308,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0x0040, 0x741: 0x3308, 0x742: 0x3008, 0x743: 0x3008, 0x744: 0x0040, 0x745: 0x0008,\n\t0x746: 0x0008, 0x747: 0x0008, 0x748: 0x0008, 0x749: 0x0008, 0x74a: 0x0008, 0x74b: 0x0008,\n\t0x74c: 0x0008, 0x74d: 0x0040, 0x74e: 0x0040, 0x74f: 0x0008, 0x750: 0x0008, 0x751: 0x0040,\n\t0x752: 0x0040, 0x753: 0x0008, 0x754: 0x0008, 0x755: 0x0008, 0x756: 0x0008, 0x757: 0x0008,\n\t0x758: 0x0008, 0x759: 0x0008, 0x75a: 0x0008, 0x75b: 0x0008, 0x75c: 0x0008, 0x75d: 0x0008,\n\t0x75e: 0x0008, 0x75f: 0x0008, 0x760: 0x0008, 0x761: 0x0008, 0x762: 0x0008, 0x763: 0x0008,\n\t0x764: 0x0008, 0x765: 0x0008, 0x766: 0x0008, 0x767: 0x0008, 0x768: 0x0008, 0x769: 0x0040,\n\t0x76a: 0x0008, 0x76b: 0x0008, 0x76c: 0x0008, 0x76d: 0x0008, 0x76e: 0x0008, 0x76f: 0x0008,\n\t0x770: 0x0008, 0x771: 0x0040, 0x772: 0x0008, 0x773: 0x0008, 0x774: 0x0040, 0x775: 0x0008,\n\t0x776: 0x0008, 0x777: 0x0008, 0x778: 0x0008, 0x779: 0x0008, 0x77a: 0x0040, 0x77b: 0x0040,\n\t0x77c: 0x3308, 0x77d: 0x0008, 0x77e: 0x3008, 0x77f: 0x3308,\n\t// Block 0x1e, offset 0x780\n\t0x780: 0x3008, 0x781: 0x3308, 0x782: 0x3308, 0x783: 0x3308, 0x784: 0x3308, 0x785: 0x0040,\n\t0x786: 0x0040, 0x787: 0x3008, 0x788: 0x3008, 0x789: 0x0040, 0x78a: 0x0040, 0x78b: 0x3008,\n\t0x78c: 0x3008, 0x78d: 0x3b08, 0x78e: 0x0040, 0x78f: 0x0040, 0x790: 0x0040, 0x791: 0x0040,\n\t0x792: 0x0040, 0x793: 0x0040, 0x794: 0x0040, 0x795: 0x0040, 0x796: 0x3308, 0x797: 0x3008,\n\t0x798: 0x0040, 0x799: 0x0040, 0x79a: 0x0040, 0x79b: 0x0040, 0x79c: 0x0881, 0x79d: 0x08b9,\n\t0x79e: 0x0040, 0x79f: 0x0008, 0x7a0: 0x0008, 0x7a1: 0x0008, 0x7a2: 0x3308, 0x7a3: 0x3308,\n\t0x7a4: 0x0040, 0x7a5: 0x0040, 0x7a6: 0x0008, 0x7a7: 0x0008, 0x7a8: 0x0008, 0x7a9: 0x0008,\n\t0x7aa: 0x0008, 0x7ab: 0x0008, 0x7ac: 0x0008, 0x7ad: 0x0008, 0x7ae: 0x0008, 0x7af: 0x0008,\n\t0x7b0: 0x0018, 0x7b1: 0x0008, 0x7b2: 0x0018, 0x7b3: 0x0018, 0x7b4: 0x0018, 0x7b5: 0x0018,\n\t0x7b6: 0x0018, 0x7b7: 0x0018, 0x7b8: 0x0040, 0x7b9: 0x0040, 0x7ba: 0x0040, 0x7bb: 0x0040,\n\t0x7bc: 0x0040, 0x7bd: 0x0040, 0x7be: 0x0040, 0x7bf: 0x0040,\n\t// Block 0x1f, offset 0x7c0\n\t0x7c0: 0x0040, 0x7c1: 0x0040, 0x7c2: 0x3308, 0x7c3: 0x0008, 0x7c4: 0x0040, 0x7c5: 0x0008,\n\t0x7c6: 0x0008, 0x7c7: 0x0008, 0x7c8: 0x0008, 0x7c9: 0x0008, 0x7ca: 0x0008, 0x7cb: 0x0040,\n\t0x7cc: 0x0040, 0x7cd: 0x0040, 0x7ce: 0x0008, 0x7cf: 0x0008, 0x7d0: 0x0008, 0x7d1: 0x0040,\n\t0x7d2: 0x0008, 0x7d3: 0x0008, 0x7d4: 0x0008, 0x7d5: 0x0008, 0x7d6: 0x0040, 0x7d7: 0x0040,\n\t0x7d8: 0x0040, 0x7d9: 0x0008, 0x7da: 0x0008, 0x7db: 0x0040, 0x7dc: 0x0008, 0x7dd: 0x0040,\n\t0x7de: 0x0008, 0x7df: 0x0008, 0x7e0: 0x0040, 0x7e1: 0x0040, 0x7e2: 0x0040, 0x7e3: 0x0008,\n\t0x7e4: 0x0008, 0x7e5: 0x0040, 0x7e6: 0x0040, 0x7e7: 0x0040, 0x7e8: 0x0008, 0x7e9: 0x0008,\n\t0x7ea: 0x0008, 0x7eb: 0x0040, 0x7ec: 0x0040, 0x7ed: 0x0040, 0x7ee: 0x0008, 0x7ef: 0x0008,\n\t0x7f0: 0x0008, 0x7f1: 0x0008, 0x7f2: 0x0008, 0x7f3: 0x0008, 0x7f4: 0x0008, 0x7f5: 0x0008,\n\t0x7f6: 0x0008, 0x7f7: 0x0008, 0x7f8: 0x0008, 0x7f9: 0x0008, 0x7fa: 0x0040, 0x7fb: 0x0040,\n\t0x7fc: 0x0040, 0x7fd: 0x0040, 0x7fe: 0x3008, 0x7ff: 0x3008,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x3308, 0x801: 0x3008, 0x802: 0x3008, 0x803: 0x3008, 0x804: 0x3008, 0x805: 0x0040,\n\t0x806: 0x3308, 0x807: 0x3308, 0x808: 0x3308, 0x809: 0x0040, 0x80a: 0x3308, 0x80b: 0x3308,\n\t0x80c: 0x3308, 0x80d: 0x3b08, 0x80e: 0x0040, 0x80f: 0x0040, 0x810: 0x0040, 0x811: 0x0040,\n\t0x812: 0x0040, 0x813: 0x0040, 0x814: 0x0040, 0x815: 0x3308, 0x816: 0x3308, 0x817: 0x0040,\n\t0x818: 0x0008, 0x819: 0x0008, 0x81a: 0x0008, 0x81b: 0x0040, 0x81c: 0x0040, 0x81d: 0x0040,\n\t0x81e: 0x0040, 0x81f: 0x0040, 0x820: 0x0008, 0x821: 0x0008, 0x822: 0x3308, 0x823: 0x3308,\n\t0x824: 0x0040, 0x825: 0x0040, 0x826: 0x0008, 0x827: 0x0008, 0x828: 0x0008, 0x829: 0x0008,\n\t0x82a: 0x0008, 0x82b: 0x0008, 0x82c: 0x0008, 0x82d: 0x0008, 0x82e: 0x0008, 0x82f: 0x0008,\n\t0x830: 0x0040, 0x831: 0x0040, 0x832: 0x0040, 0x833: 0x0040, 0x834: 0x0040, 0x835: 0x0040,\n\t0x836: 0x0040, 0x837: 0x0040, 0x838: 0x0018, 0x839: 0x0018, 0x83a: 0x0018, 0x83b: 0x0018,\n\t0x83c: 0x0018, 0x83d: 0x0018, 0x83e: 0x0018, 0x83f: 0x0018,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x0008, 0x841: 0x3308, 0x842: 0x3008, 0x843: 0x3008, 0x844: 0x0040, 0x845: 0x0008,\n\t0x846: 0x0008, 0x847: 0x0008, 0x848: 0x0008, 0x849: 0x0008, 0x84a: 0x0008, 0x84b: 0x0008,\n\t0x84c: 0x0008, 0x84d: 0x0040, 0x84e: 0x0008, 0x84f: 0x0008, 0x850: 0x0008, 0x851: 0x0040,\n\t0x852: 0x0008, 0x853: 0x0008, 0x854: 0x0008, 0x855: 0x0008, 0x856: 0x0008, 0x857: 0x0008,\n\t0x858: 0x0008, 0x859: 0x0008, 0x85a: 0x0008, 0x85b: 0x0008, 0x85c: 0x0008, 0x85d: 0x0008,\n\t0x85e: 0x0008, 0x85f: 0x0008, 0x860: 0x0008, 0x861: 0x0008, 0x862: 0x0008, 0x863: 0x0008,\n\t0x864: 0x0008, 0x865: 0x0008, 0x866: 0x0008, 0x867: 0x0008, 0x868: 0x0008, 0x869: 0x0040,\n\t0x86a: 0x0008, 0x86b: 0x0008, 0x86c: 0x0008, 0x86d: 0x0008, 0x86e: 0x0008, 0x86f: 0x0008,\n\t0x870: 0x0008, 0x871: 0x0008, 0x872: 0x0008, 0x873: 0x0008, 0x874: 0x0040, 0x875: 0x0008,\n\t0x876: 0x0008, 0x877: 0x0008, 0x878: 0x0008, 0x879: 0x0008, 0x87a: 0x0040, 0x87b: 0x0040,\n\t0x87c: 0x3308, 0x87d: 0x0008, 0x87e: 0x3008, 0x87f: 0x3308,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x3008, 0x881: 0x3008, 0x882: 0x3008, 0x883: 0x3008, 0x884: 0x3008, 0x885: 0x0040,\n\t0x886: 0x3308, 0x887: 0x3008, 0x888: 0x3008, 0x889: 0x0040, 0x88a: 0x3008, 0x88b: 0x3008,\n\t0x88c: 0x3308, 0x88d: 0x3b08, 0x88e: 0x0040, 0x88f: 0x0040, 0x890: 0x0040, 0x891: 0x0040,\n\t0x892: 0x0040, 0x893: 0x0040, 0x894: 0x0040, 0x895: 0x3008, 0x896: 0x3008, 0x897: 0x0040,\n\t0x898: 0x0040, 0x899: 0x0040, 0x89a: 0x0040, 0x89b: 0x0040, 0x89c: 0x0040, 0x89d: 0x0040,\n\t0x89e: 0x0008, 0x89f: 0x0040, 0x8a0: 0x0008, 0x8a1: 0x0008, 0x8a2: 0x3308, 0x8a3: 0x3308,\n\t0x8a4: 0x0040, 0x8a5: 0x0040, 0x8a6: 0x0008, 0x8a7: 0x0008, 0x8a8: 0x0008, 0x8a9: 0x0008,\n\t0x8aa: 0x0008, 0x8ab: 0x0008, 0x8ac: 0x0008, 0x8ad: 0x0008, 0x8ae: 0x0008, 0x8af: 0x0008,\n\t0x8b0: 0x0040, 0x8b1: 0x0008, 0x8b2: 0x0008, 0x8b3: 0x0040, 0x8b4: 0x0040, 0x8b5: 0x0040,\n\t0x8b6: 0x0040, 0x8b7: 0x0040, 0x8b8: 0x0040, 0x8b9: 0x0040, 0x8ba: 0x0040, 0x8bb: 0x0040,\n\t0x8bc: 0x0040, 0x8bd: 0x0040, 0x8be: 0x0040, 0x8bf: 0x0040,\n\t// Block 0x23, offset 0x8c0\n\t0x8c0: 0x3008, 0x8c1: 0x3308, 0x8c2: 0x3308, 0x8c3: 0x3308, 0x8c4: 0x3308, 0x8c5: 0x0040,\n\t0x8c6: 0x3008, 0x8c7: 0x3008, 0x8c8: 0x3008, 0x8c9: 0x0040, 0x8ca: 0x3008, 0x8cb: 0x3008,\n\t0x8cc: 0x3008, 0x8cd: 0x3b08, 0x8ce: 0x0008, 0x8cf: 0x0018, 0x8d0: 0x0040, 0x8d1: 0x0040,\n\t0x8d2: 0x0040, 0x8d3: 0x0040, 0x8d4: 0x0008, 0x8d5: 0x0008, 0x8d6: 0x0008, 0x8d7: 0x3008,\n\t0x8d8: 0x0018, 0x8d9: 0x0018, 0x8da: 0x0018, 0x8db: 0x0018, 0x8dc: 0x0018, 0x8dd: 0x0018,\n\t0x8de: 0x0018, 0x8df: 0x0008, 0x8e0: 0x0008, 0x8e1: 0x0008, 0x8e2: 0x3308, 0x8e3: 0x3308,\n\t0x8e4: 0x0040, 0x8e5: 0x0040, 0x8e6: 0x0008, 0x8e7: 0x0008, 0x8e8: 0x0008, 0x8e9: 0x0008,\n\t0x8ea: 0x0008, 0x8eb: 0x0008, 0x8ec: 0x0008, 0x8ed: 0x0008, 0x8ee: 0x0008, 0x8ef: 0x0008,\n\t0x8f0: 0x0018, 0x8f1: 0x0018, 0x8f2: 0x0018, 0x8f3: 0x0018, 0x8f4: 0x0018, 0x8f5: 0x0018,\n\t0x8f6: 0x0018, 0x8f7: 0x0018, 0x8f8: 0x0018, 0x8f9: 0x0018, 0x8fa: 0x0008, 0x8fb: 0x0008,\n\t0x8fc: 0x0008, 0x8fd: 0x0008, 0x8fe: 0x0008, 0x8ff: 0x0008,\n\t// Block 0x24, offset 0x900\n\t0x900: 0x0040, 0x901: 0x0008, 0x902: 0x0008, 0x903: 0x0040, 0x904: 0x0008, 0x905: 0x0040,\n\t0x906: 0x0040, 0x907: 0x0008, 0x908: 0x0008, 0x909: 0x0040, 0x90a: 0x0008, 0x90b: 0x0040,\n\t0x90c: 0x0040, 0x90d: 0x0008, 0x90e: 0x0040, 0x90f: 0x0040, 0x910: 0x0040, 0x911: 0x0040,\n\t0x912: 0x0040, 0x913: 0x0040, 0x914: 0x0008, 0x915: 0x0008, 0x916: 0x0008, 0x917: 0x0008,\n\t0x918: 0x0040, 0x919: 0x0008, 0x91a: 0x0008, 0x91b: 0x0008, 0x91c: 0x0008, 0x91d: 0x0008,\n\t0x91e: 0x0008, 0x91f: 0x0008, 0x920: 0x0040, 0x921: 0x0008, 0x922: 0x0008, 0x923: 0x0008,\n\t0x924: 0x0040, 0x925: 0x0008, 0x926: 0x0040, 0x927: 0x0008, 0x928: 0x0040, 0x929: 0x0040,\n\t0x92a: 0x0008, 0x92b: 0x0008, 0x92c: 0x0040, 0x92d: 0x0008, 0x92e: 0x0008, 0x92f: 0x0008,\n\t0x930: 0x0008, 0x931: 0x3308, 0x932: 0x0008, 0x933: 0x0929, 0x934: 0x3308, 0x935: 0x3308,\n\t0x936: 0x3308, 0x937: 0x3308, 0x938: 0x3308, 0x939: 0x3308, 0x93a: 0x0040, 0x93b: 0x3308,\n\t0x93c: 0x3308, 0x93d: 0x0008, 0x93e: 0x0040, 0x93f: 0x0040,\n\t// Block 0x25, offset 0x940\n\t0x940: 0x0008, 0x941: 0x0008, 0x942: 0x0008, 0x943: 0x09d1, 0x944: 0x0008, 0x945: 0x0008,\n\t0x946: 0x0008, 0x947: 0x0008, 0x948: 0x0040, 0x949: 0x0008, 0x94a: 0x0008, 0x94b: 0x0008,\n\t0x94c: 0x0008, 0x94d: 0x0a09, 0x94e: 0x0008, 0x94f: 0x0008, 0x950: 0x0008, 0x951: 0x0008,\n\t0x952: 0x0a41, 0x953: 0x0008, 0x954: 0x0008, 0x955: 0x0008, 0x956: 0x0008, 0x957: 0x0a79,\n\t0x958: 0x0008, 0x959: 0x0008, 0x95a: 0x0008, 0x95b: 0x0008, 0x95c: 0x0ab1, 0x95d: 0x0008,\n\t0x95e: 0x0008, 0x95f: 0x0008, 0x960: 0x0008, 0x961: 0x0008, 0x962: 0x0008, 0x963: 0x0008,\n\t0x964: 0x0008, 0x965: 0x0008, 0x966: 0x0008, 0x967: 0x0008, 0x968: 0x0008, 0x969: 0x0ae9,\n\t0x96a: 0x0008, 0x96b: 0x0008, 0x96c: 0x0008, 0x96d: 0x0040, 0x96e: 0x0040, 0x96f: 0x0040,\n\t0x970: 0x0040, 0x971: 0x3308, 0x972: 0x3308, 0x973: 0x0b21, 0x974: 0x3308, 0x975: 0x0b59,\n\t0x976: 0x0b91, 0x977: 0x0bc9, 0x978: 0x0c19, 0x979: 0x0c51, 0x97a: 0x3308, 0x97b: 0x3308,\n\t0x97c: 0x3308, 0x97d: 0x3308, 0x97e: 0x3308, 0x97f: 0x3008,\n\t// Block 0x26, offset 0x980\n\t0x980: 0x3308, 0x981: 0x0ca1, 0x982: 0x3308, 0x983: 0x3308, 0x984: 0x3b08, 0x985: 0x0018,\n\t0x986: 0x3308, 0x987: 0x3308, 0x988: 0x0008, 0x989: 0x0008, 0x98a: 0x0008, 0x98b: 0x0008,\n\t0x98c: 0x0008, 0x98d: 0x3308, 0x98e: 0x3308, 0x98f: 0x3308, 0x990: 0x3308, 0x991: 0x3308,\n\t0x992: 0x3308, 0x993: 0x0cd9, 0x994: 0x3308, 0x995: 0x3308, 0x996: 0x3308, 0x997: 0x3308,\n\t0x998: 0x0040, 0x999: 0x3308, 0x99a: 0x3308, 0x99b: 0x3308, 0x99c: 0x3308, 0x99d: 0x0d11,\n\t0x99e: 0x3308, 0x99f: 0x3308, 0x9a0: 0x3308, 0x9a1: 0x3308, 0x9a2: 0x0d49, 0x9a3: 0x3308,\n\t0x9a4: 0x3308, 0x9a5: 0x3308, 0x9a6: 0x3308, 0x9a7: 0x0d81, 0x9a8: 0x3308, 0x9a9: 0x3308,\n\t0x9aa: 0x3308, 0x9ab: 0x3308, 0x9ac: 0x0db9, 0x9ad: 0x3308, 0x9ae: 0x3308, 0x9af: 0x3308,\n\t0x9b0: 0x3308, 0x9b1: 0x3308, 0x9b2: 0x3308, 0x9b3: 0x3308, 0x9b4: 0x3308, 0x9b5: 0x3308,\n\t0x9b6: 0x3308, 0x9b7: 0x3308, 0x9b8: 0x3308, 0x9b9: 0x0df1, 0x9ba: 0x3308, 0x9bb: 0x3308,\n\t0x9bc: 0x3308, 0x9bd: 0x0040, 0x9be: 0x0018, 0x9bf: 0x0018,\n\t// Block 0x27, offset 0x9c0\n\t0x9c0: 0x0008, 0x9c1: 0x0008, 0x9c2: 0x0008, 0x9c3: 0x0008, 0x9c4: 0x0008, 0x9c5: 0x0008,\n\t0x9c6: 0x0008, 0x9c7: 0x0008, 0x9c8: 0x0008, 0x9c9: 0x0008, 0x9ca: 0x0008, 0x9cb: 0x0008,\n\t0x9cc: 0x0008, 0x9cd: 0x0008, 0x9ce: 0x0008, 0x9cf: 0x0008, 0x9d0: 0x0008, 0x9d1: 0x0008,\n\t0x9d2: 0x0008, 0x9d3: 0x0008, 0x9d4: 0x0008, 0x9d5: 0x0008, 0x9d6: 0x0008, 0x9d7: 0x0008,\n\t0x9d8: 0x0008, 0x9d9: 0x0008, 0x9da: 0x0008, 0x9db: 0x0008, 0x9dc: 0x0008, 0x9dd: 0x0008,\n\t0x9de: 0x0008, 0x9df: 0x0008, 0x9e0: 0x0008, 0x9e1: 0x0008, 0x9e2: 0x0008, 0x9e3: 0x0008,\n\t0x9e4: 0x0008, 0x9e5: 0x0008, 0x9e6: 0x0008, 0x9e7: 0x0008, 0x9e8: 0x0008, 0x9e9: 0x0008,\n\t0x9ea: 0x0008, 0x9eb: 0x0008, 0x9ec: 0x0039, 0x9ed: 0x0ed1, 0x9ee: 0x0ee9, 0x9ef: 0x0008,\n\t0x9f0: 0x0ef9, 0x9f1: 0x0f09, 0x9f2: 0x0f19, 0x9f3: 0x0f31, 0x9f4: 0x0249, 0x9f5: 0x0f41,\n\t0x9f6: 0x0259, 0x9f7: 0x0f51, 0x9f8: 0x0359, 0x9f9: 0x0f61, 0x9fa: 0x0f71, 0x9fb: 0x0008,\n\t0x9fc: 0x00d9, 0x9fd: 0x0f81, 0x9fe: 0x0f99, 0x9ff: 0x0269,\n\t// Block 0x28, offset 0xa00\n\t0xa00: 0x0fa9, 0xa01: 0x0fb9, 0xa02: 0x0279, 0xa03: 0x0039, 0xa04: 0x0fc9, 0xa05: 0x0fe1,\n\t0xa06: 0x059d, 0xa07: 0x0ee9, 0xa08: 0x0ef9, 0xa09: 0x0f09, 0xa0a: 0x0ff9, 0xa0b: 0x1011,\n\t0xa0c: 0x1029, 0xa0d: 0x0f31, 0xa0e: 0x0008, 0xa0f: 0x0f51, 0xa10: 0x0f61, 0xa11: 0x1041,\n\t0xa12: 0x00d9, 0xa13: 0x1059, 0xa14: 0x05b5, 0xa15: 0x05b5, 0xa16: 0x0f99, 0xa17: 0x0fa9,\n\t0xa18: 0x0fb9, 0xa19: 0x059d, 0xa1a: 0x1071, 0xa1b: 0x1089, 0xa1c: 0x05cd, 0xa1d: 0x1099,\n\t0xa1e: 0x10b1, 0xa1f: 0x10c9, 0xa20: 0x10e1, 0xa21: 0x10f9, 0xa22: 0x0f41, 0xa23: 0x0269,\n\t0xa24: 0x0fb9, 0xa25: 0x1089, 0xa26: 0x1099, 0xa27: 0x10b1, 0xa28: 0x1111, 0xa29: 0x10e1,\n\t0xa2a: 0x10f9, 0xa2b: 0x0008, 0xa2c: 0x0008, 0xa2d: 0x0008, 0xa2e: 0x0008, 0xa2f: 0x0008,\n\t0xa30: 0x0008, 0xa31: 0x0008, 0xa32: 0x0008, 0xa33: 0x0008, 0xa34: 0x0008, 0xa35: 0x0008,\n\t0xa36: 0x0008, 0xa37: 0x0008, 0xa38: 0x1129, 0xa39: 0x0008, 0xa3a: 0x0008, 0xa3b: 0x0008,\n\t0xa3c: 0x0008, 0xa3d: 0x0008, 0xa3e: 0x0008, 0xa3f: 0x0008,\n\t// Block 0x29, offset 0xa40\n\t0xa40: 0x0008, 0xa41: 0x0008, 0xa42: 0x0008, 0xa43: 0x0008, 0xa44: 0x0008, 0xa45: 0x0008,\n\t0xa46: 0x0008, 0xa47: 0x0008, 0xa48: 0x0008, 0xa49: 0x0008, 0xa4a: 0x0008, 0xa4b: 0x0008,\n\t0xa4c: 0x0008, 0xa4d: 0x0008, 0xa4e: 0x0008, 0xa4f: 0x0008, 0xa50: 0x0008, 0xa51: 0x0008,\n\t0xa52: 0x0008, 0xa53: 0x0008, 0xa54: 0x0008, 0xa55: 0x0008, 0xa56: 0x0008, 0xa57: 0x0008,\n\t0xa58: 0x0008, 0xa59: 0x0008, 0xa5a: 0x0008, 0xa5b: 0x1141, 0xa5c: 0x1159, 0xa5d: 0x1169,\n\t0xa5e: 0x1181, 0xa5f: 0x1029, 0xa60: 0x1199, 0xa61: 0x11a9, 0xa62: 0x11c1, 0xa63: 0x11d9,\n\t0xa64: 0x11f1, 0xa65: 0x1209, 0xa66: 0x1221, 0xa67: 0x05e5, 0xa68: 0x1239, 0xa69: 0x1251,\n\t0xa6a: 0xe17d, 0xa6b: 0x1269, 0xa6c: 0x1281, 0xa6d: 0x1299, 0xa6e: 0x12b1, 0xa6f: 0x12c9,\n\t0xa70: 0x12e1, 0xa71: 0x12f9, 0xa72: 0x1311, 0xa73: 0x1329, 0xa74: 0x1341, 0xa75: 0x1359,\n\t0xa76: 0x1371, 0xa77: 0x1389, 0xa78: 0x05fd, 0xa79: 0x13a1, 0xa7a: 0x13b9, 0xa7b: 0x13d1,\n\t0xa7c: 0x13e1, 0xa7d: 0x13f9, 0xa7e: 0x1411, 0xa7f: 0x1429,\n\t// Block 0x2a, offset 0xa80\n\t0xa80: 0xe00d, 0xa81: 0x0008, 0xa82: 0xe00d, 0xa83: 0x0008, 0xa84: 0xe00d, 0xa85: 0x0008,\n\t0xa86: 0xe00d, 0xa87: 0x0008, 0xa88: 0xe00d, 0xa89: 0x0008, 0xa8a: 0xe00d, 0xa8b: 0x0008,\n\t0xa8c: 0xe00d, 0xa8d: 0x0008, 0xa8e: 0xe00d, 0xa8f: 0x0008, 0xa90: 0xe00d, 0xa91: 0x0008,\n\t0xa92: 0xe00d, 0xa93: 0x0008, 0xa94: 0xe00d, 0xa95: 0x0008, 0xa96: 0xe00d, 0xa97: 0x0008,\n\t0xa98: 0xe00d, 0xa99: 0x0008, 0xa9a: 0xe00d, 0xa9b: 0x0008, 0xa9c: 0xe00d, 0xa9d: 0x0008,\n\t0xa9e: 0xe00d, 0xa9f: 0x0008, 0xaa0: 0xe00d, 0xaa1: 0x0008, 0xaa2: 0xe00d, 0xaa3: 0x0008,\n\t0xaa4: 0xe00d, 0xaa5: 0x0008, 0xaa6: 0xe00d, 0xaa7: 0x0008, 0xaa8: 0xe00d, 0xaa9: 0x0008,\n\t0xaaa: 0xe00d, 0xaab: 0x0008, 0xaac: 0xe00d, 0xaad: 0x0008, 0xaae: 0xe00d, 0xaaf: 0x0008,\n\t0xab0: 0xe00d, 0xab1: 0x0008, 0xab2: 0xe00d, 0xab3: 0x0008, 0xab4: 0xe00d, 0xab5: 0x0008,\n\t0xab6: 0xe00d, 0xab7: 0x0008, 0xab8: 0xe00d, 0xab9: 0x0008, 0xaba: 0xe00d, 0xabb: 0x0008,\n\t0xabc: 0xe00d, 0xabd: 0x0008, 0xabe: 0xe00d, 0xabf: 0x0008,\n\t// Block 0x2b, offset 0xac0\n\t0xac0: 0xe00d, 0xac1: 0x0008, 0xac2: 0xe00d, 0xac3: 0x0008, 0xac4: 0xe00d, 0xac5: 0x0008,\n\t0xac6: 0xe00d, 0xac7: 0x0008, 0xac8: 0xe00d, 0xac9: 0x0008, 0xaca: 0xe00d, 0xacb: 0x0008,\n\t0xacc: 0xe00d, 0xacd: 0x0008, 0xace: 0xe00d, 0xacf: 0x0008, 0xad0: 0xe00d, 0xad1: 0x0008,\n\t0xad2: 0xe00d, 0xad3: 0x0008, 0xad4: 0xe00d, 0xad5: 0x0008, 0xad6: 0x0008, 0xad7: 0x0008,\n\t0xad8: 0x0008, 0xad9: 0x0008, 0xada: 0x0615, 0xadb: 0x0635, 0xadc: 0x0008, 0xadd: 0x0008,\n\t0xade: 0x1441, 0xadf: 0x0008, 0xae0: 0xe00d, 0xae1: 0x0008, 0xae2: 0xe00d, 0xae3: 0x0008,\n\t0xae4: 0xe00d, 0xae5: 0x0008, 0xae6: 0xe00d, 0xae7: 0x0008, 0xae8: 0xe00d, 0xae9: 0x0008,\n\t0xaea: 0xe00d, 0xaeb: 0x0008, 0xaec: 0xe00d, 0xaed: 0x0008, 0xaee: 0xe00d, 0xaef: 0x0008,\n\t0xaf0: 0xe00d, 0xaf1: 0x0008, 0xaf2: 0xe00d, 0xaf3: 0x0008, 0xaf4: 0xe00d, 0xaf5: 0x0008,\n\t0xaf6: 0xe00d, 0xaf7: 0x0008, 0xaf8: 0xe00d, 0xaf9: 0x0008, 0xafa: 0xe00d, 0xafb: 0x0008,\n\t0xafc: 0xe00d, 0xafd: 0x0008, 0xafe: 0xe00d, 0xaff: 0x0008,\n\t// Block 0x2c, offset 0xb00\n\t0xb00: 0x0008, 0xb01: 0x0008, 0xb02: 0x0008, 0xb03: 0x0008, 0xb04: 0x0008, 0xb05: 0x0008,\n\t0xb06: 0x0040, 0xb07: 0x0040, 0xb08: 0xe045, 0xb09: 0xe045, 0xb0a: 0xe045, 0xb0b: 0xe045,\n\t0xb0c: 0xe045, 0xb0d: 0xe045, 0xb0e: 0x0040, 0xb0f: 0x0040, 0xb10: 0x0008, 0xb11: 0x0008,\n\t0xb12: 0x0008, 0xb13: 0x0008, 0xb14: 0x0008, 0xb15: 0x0008, 0xb16: 0x0008, 0xb17: 0x0008,\n\t0xb18: 0x0040, 0xb19: 0xe045, 0xb1a: 0x0040, 0xb1b: 0xe045, 0xb1c: 0x0040, 0xb1d: 0xe045,\n\t0xb1e: 0x0040, 0xb1f: 0xe045, 0xb20: 0x0008, 0xb21: 0x0008, 0xb22: 0x0008, 0xb23: 0x0008,\n\t0xb24: 0x0008, 0xb25: 0x0008, 0xb26: 0x0008, 0xb27: 0x0008, 0xb28: 0xe045, 0xb29: 0xe045,\n\t0xb2a: 0xe045, 0xb2b: 0xe045, 0xb2c: 0xe045, 0xb2d: 0xe045, 0xb2e: 0xe045, 0xb2f: 0xe045,\n\t0xb30: 0x0008, 0xb31: 0x1459, 0xb32: 0x0008, 0xb33: 0x1471, 0xb34: 0x0008, 0xb35: 0x1489,\n\t0xb36: 0x0008, 0xb37: 0x14a1, 0xb38: 0x0008, 0xb39: 0x14b9, 0xb3a: 0x0008, 0xb3b: 0x14d1,\n\t0xb3c: 0x0008, 0xb3d: 0x14e9, 0xb3e: 0x0040, 0xb3f: 0x0040,\n\t// Block 0x2d, offset 0xb40\n\t0xb40: 0x1501, 0xb41: 0x1531, 0xb42: 0x1561, 0xb43: 0x1591, 0xb44: 0x15c1, 0xb45: 0x15f1,\n\t0xb46: 0x1621, 0xb47: 0x1651, 0xb48: 0x1501, 0xb49: 0x1531, 0xb4a: 0x1561, 0xb4b: 0x1591,\n\t0xb4c: 0x15c1, 0xb4d: 0x15f1, 0xb4e: 0x1621, 0xb4f: 0x1651, 0xb50: 0x1681, 0xb51: 0x16b1,\n\t0xb52: 0x16e1, 0xb53: 0x1711, 0xb54: 0x1741, 0xb55: 0x1771, 0xb56: 0x17a1, 0xb57: 0x17d1,\n\t0xb58: 0x1681, 0xb59: 0x16b1, 0xb5a: 0x16e1, 0xb5b: 0x1711, 0xb5c: 0x1741, 0xb5d: 0x1771,\n\t0xb5e: 0x17a1, 0xb5f: 0x17d1, 0xb60: 0x1801, 0xb61: 0x1831, 0xb62: 0x1861, 0xb63: 0x1891,\n\t0xb64: 0x18c1, 0xb65: 0x18f1, 0xb66: 0x1921, 0xb67: 0x1951, 0xb68: 0x1801, 0xb69: 0x1831,\n\t0xb6a: 0x1861, 0xb6b: 0x1891, 0xb6c: 0x18c1, 0xb6d: 0x18f1, 0xb6e: 0x1921, 0xb6f: 0x1951,\n\t0xb70: 0x0008, 0xb71: 0x0008, 0xb72: 0x1981, 0xb73: 0x19b1, 0xb74: 0x19d9, 0xb75: 0x0040,\n\t0xb76: 0x0008, 0xb77: 0x1a01, 0xb78: 0xe045, 0xb79: 0xe045, 0xb7a: 0x064d, 0xb7b: 0x1459,\n\t0xb7c: 0x19b1, 0xb7d: 0x0666, 0xb7e: 0x1a31, 0xb7f: 0x0686,\n\t// Block 0x2e, offset 0xb80\n\t0xb80: 0x06a6, 0xb81: 0x1a4a, 0xb82: 0x1a79, 0xb83: 0x1aa9, 0xb84: 0x1ad1, 0xb85: 0x0040,\n\t0xb86: 0x0008, 0xb87: 0x1af9, 0xb88: 0x06c5, 0xb89: 0x1471, 0xb8a: 0x06dd, 0xb8b: 0x1489,\n\t0xb8c: 0x1aa9, 0xb8d: 0x1b2a, 0xb8e: 0x1b5a, 0xb8f: 0x1b8a, 0xb90: 0x0008, 0xb91: 0x0008,\n\t0xb92: 0x0008, 0xb93: 0x1bb9, 0xb94: 0x0040, 0xb95: 0x0040, 0xb96: 0x0008, 0xb97: 0x0008,\n\t0xb98: 0xe045, 0xb99: 0xe045, 0xb9a: 0x06f5, 0xb9b: 0x14a1, 0xb9c: 0x0040, 0xb9d: 0x1bd2,\n\t0xb9e: 0x1c02, 0xb9f: 0x1c32, 0xba0: 0x0008, 0xba1: 0x0008, 0xba2: 0x0008, 0xba3: 0x1c61,\n\t0xba4: 0x0008, 0xba5: 0x0008, 0xba6: 0x0008, 0xba7: 0x0008, 0xba8: 0xe045, 0xba9: 0xe045,\n\t0xbaa: 0x070d, 0xbab: 0x14d1, 0xbac: 0xe04d, 0xbad: 0x1c7a, 0xbae: 0x03d2, 0xbaf: 0x1caa,\n\t0xbb0: 0x0040, 0xbb1: 0x0040, 0xbb2: 0x1cb9, 0xbb3: 0x1ce9, 0xbb4: 0x1d11, 0xbb5: 0x0040,\n\t0xbb6: 0x0008, 0xbb7: 0x1d39, 0xbb8: 0x0725, 0xbb9: 0x14b9, 0xbba: 0x0515, 0xbbb: 0x14e9,\n\t0xbbc: 0x1ce9, 0xbbd: 0x073e, 0xbbe: 0x075e, 0xbbf: 0x0040,\n\t// Block 0x2f, offset 0xbc0\n\t0xbc0: 0x000a, 0xbc1: 0x000a, 0xbc2: 0x000a, 0xbc3: 0x000a, 0xbc4: 0x000a, 0xbc5: 0x000a,\n\t0xbc6: 0x000a, 0xbc7: 0x000a, 0xbc8: 0x000a, 0xbc9: 0x000a, 0xbca: 0x000a, 0xbcb: 0x03c0,\n\t0xbcc: 0x0003, 0xbcd: 0x0003, 0xbce: 0x0340, 0xbcf: 0x0b40, 0xbd0: 0x0018, 0xbd1: 0xe00d,\n\t0xbd2: 0x0018, 0xbd3: 0x0018, 0xbd4: 0x0018, 0xbd5: 0x0018, 0xbd6: 0x0018, 0xbd7: 0x077e,\n\t0xbd8: 0x0018, 0xbd9: 0x0018, 0xbda: 0x0018, 0xbdb: 0x0018, 0xbdc: 0x0018, 0xbdd: 0x0018,\n\t0xbde: 0x0018, 0xbdf: 0x0018, 0xbe0: 0x0018, 0xbe1: 0x0018, 0xbe2: 0x0018, 0xbe3: 0x0018,\n\t0xbe4: 0x0040, 0xbe5: 0x0040, 0xbe6: 0x0040, 0xbe7: 0x0018, 0xbe8: 0x0040, 0xbe9: 0x0040,\n\t0xbea: 0x0340, 0xbeb: 0x0340, 0xbec: 0x0340, 0xbed: 0x0340, 0xbee: 0x0340, 0xbef: 0x000a,\n\t0xbf0: 0x0018, 0xbf1: 0x0018, 0xbf2: 0x0018, 0xbf3: 0x1d69, 0xbf4: 0x1da1, 0xbf5: 0x0018,\n\t0xbf6: 0x1df1, 0xbf7: 0x1e29, 0xbf8: 0x0018, 0xbf9: 0x0018, 0xbfa: 0x0018, 0xbfb: 0x0018,\n\t0xbfc: 0x1e7a, 0xbfd: 0x0018, 0xbfe: 0x079e, 0xbff: 0x0018,\n\t// Block 0x30, offset 0xc00\n\t0xc00: 0x0018, 0xc01: 0x0018, 0xc02: 0x0018, 0xc03: 0x0018, 0xc04: 0x0018, 0xc05: 0x0018,\n\t0xc06: 0x0018, 0xc07: 0x1e92, 0xc08: 0x1eaa, 0xc09: 0x1ec2, 0xc0a: 0x0018, 0xc0b: 0x0018,\n\t0xc0c: 0x0018, 0xc0d: 0x0018, 0xc0e: 0x0018, 0xc0f: 0x0018, 0xc10: 0x0018, 0xc11: 0x0018,\n\t0xc12: 0x0018, 0xc13: 0x0018, 0xc14: 0x0018, 0xc15: 0x0018, 0xc16: 0x0018, 0xc17: 0x1ed9,\n\t0xc18: 0x0018, 0xc19: 0x0018, 0xc1a: 0x0018, 0xc1b: 0x0018, 0xc1c: 0x0018, 0xc1d: 0x0018,\n\t0xc1e: 0x0018, 0xc1f: 0x000a, 0xc20: 0x03c0, 0xc21: 0x0340, 0xc22: 0x0340, 0xc23: 0x0340,\n\t0xc24: 0x03c0, 0xc25: 0x0040, 0xc26: 0x0040, 0xc27: 0x0040, 0xc28: 0x0040, 0xc29: 0x0040,\n\t0xc2a: 0x0340, 0xc2b: 0x0340, 0xc2c: 0x0340, 0xc2d: 0x0340, 0xc2e: 0x0340, 0xc2f: 0x0340,\n\t0xc30: 0x1f41, 0xc31: 0x0f41, 0xc32: 0x0040, 0xc33: 0x0040, 0xc34: 0x1f51, 0xc35: 0x1f61,\n\t0xc36: 0x1f71, 0xc37: 0x1f81, 0xc38: 0x1f91, 0xc39: 0x1fa1, 0xc3a: 0x1fb2, 0xc3b: 0x07bd,\n\t0xc3c: 0x1fc2, 0xc3d: 0x1fd2, 0xc3e: 0x1fe2, 0xc3f: 0x0f71,\n\t// Block 0x31, offset 0xc40\n\t0xc40: 0x1f41, 0xc41: 0x00c9, 0xc42: 0x0069, 0xc43: 0x0079, 0xc44: 0x1f51, 0xc45: 0x1f61,\n\t0xc46: 0x1f71, 0xc47: 0x1f81, 0xc48: 0x1f91, 0xc49: 0x1fa1, 0xc4a: 0x1fb2, 0xc4b: 0x07d5,\n\t0xc4c: 0x1fc2, 0xc4d: 0x1fd2, 0xc4e: 0x1fe2, 0xc4f: 0x0040, 0xc50: 0x0039, 0xc51: 0x0f09,\n\t0xc52: 0x00d9, 0xc53: 0x0369, 0xc54: 0x0ff9, 0xc55: 0x0249, 0xc56: 0x0f51, 0xc57: 0x0359,\n\t0xc58: 0x0f61, 0xc59: 0x0f71, 0xc5a: 0x0f99, 0xc5b: 0x01d9, 0xc5c: 0x0fa9, 0xc5d: 0x0040,\n\t0xc5e: 0x0040, 0xc5f: 0x0040, 0xc60: 0x0018, 0xc61: 0x0018, 0xc62: 0x0018, 0xc63: 0x0018,\n\t0xc64: 0x0018, 0xc65: 0x0018, 0xc66: 0x0018, 0xc67: 0x0018, 0xc68: 0x1ff1, 0xc69: 0x0018,\n\t0xc6a: 0x0018, 0xc6b: 0x0018, 0xc6c: 0x0018, 0xc6d: 0x0018, 0xc6e: 0x0018, 0xc6f: 0x0018,\n\t0xc70: 0x0018, 0xc71: 0x0018, 0xc72: 0x0018, 0xc73: 0x0018, 0xc74: 0x0018, 0xc75: 0x0018,\n\t0xc76: 0x0018, 0xc77: 0x0018, 0xc78: 0x0018, 0xc79: 0x0018, 0xc7a: 0x0018, 0xc7b: 0x0018,\n\t0xc7c: 0x0018, 0xc7d: 0x0018, 0xc7e: 0x0018, 0xc7f: 0x0018,\n\t// Block 0x32, offset 0xc80\n\t0xc80: 0x07ee, 0xc81: 0x080e, 0xc82: 0x1159, 0xc83: 0x082d, 0xc84: 0x0018, 0xc85: 0x084e,\n\t0xc86: 0x086e, 0xc87: 0x1011, 0xc88: 0x0018, 0xc89: 0x088d, 0xc8a: 0x0f31, 0xc8b: 0x0249,\n\t0xc8c: 0x0249, 0xc8d: 0x0249, 0xc8e: 0x0249, 0xc8f: 0x2009, 0xc90: 0x0f41, 0xc91: 0x0f41,\n\t0xc92: 0x0359, 0xc93: 0x0359, 0xc94: 0x0018, 0xc95: 0x0f71, 0xc96: 0x2021, 0xc97: 0x0018,\n\t0xc98: 0x0018, 0xc99: 0x0f99, 0xc9a: 0x2039, 0xc9b: 0x0269, 0xc9c: 0x0269, 0xc9d: 0x0269,\n\t0xc9e: 0x0018, 0xc9f: 0x0018, 0xca0: 0x2049, 0xca1: 0x08ad, 0xca2: 0x2061, 0xca3: 0x0018,\n\t0xca4: 0x13d1, 0xca5: 0x0018, 0xca6: 0x2079, 0xca7: 0x0018, 0xca8: 0x13d1, 0xca9: 0x0018,\n\t0xcaa: 0x0f51, 0xcab: 0x2091, 0xcac: 0x0ee9, 0xcad: 0x1159, 0xcae: 0x0018, 0xcaf: 0x0f09,\n\t0xcb0: 0x0f09, 0xcb1: 0x1199, 0xcb2: 0x0040, 0xcb3: 0x0f61, 0xcb4: 0x00d9, 0xcb5: 0x20a9,\n\t0xcb6: 0x20c1, 0xcb7: 0x20d9, 0xcb8: 0x20f1, 0xcb9: 0x0f41, 0xcba: 0x0018, 0xcbb: 0x08cd,\n\t0xcbc: 0x2109, 0xcbd: 0x10b1, 0xcbe: 0x10b1, 0xcbf: 0x2109,\n\t// Block 0x33, offset 0xcc0\n\t0xcc0: 0x08ed, 0xcc1: 0x0018, 0xcc2: 0x0018, 0xcc3: 0x0018, 0xcc4: 0x0018, 0xcc5: 0x0ef9,\n\t0xcc6: 0x0ef9, 0xcc7: 0x0f09, 0xcc8: 0x0f41, 0xcc9: 0x0259, 0xcca: 0x0018, 0xccb: 0x0018,\n\t0xccc: 0x0018, 0xccd: 0x0018, 0xcce: 0x0008, 0xccf: 0x0018, 0xcd0: 0x2121, 0xcd1: 0x2151,\n\t0xcd2: 0x2181, 0xcd3: 0x21b9, 0xcd4: 0x21e9, 0xcd5: 0x2219, 0xcd6: 0x2249, 0xcd7: 0x2279,\n\t0xcd8: 0x22a9, 0xcd9: 0x22d9, 0xcda: 0x2309, 0xcdb: 0x2339, 0xcdc: 0x2369, 0xcdd: 0x2399,\n\t0xcde: 0x23c9, 0xcdf: 0x23f9, 0xce0: 0x0f41, 0xce1: 0x2421, 0xce2: 0x0905, 0xce3: 0x2439,\n\t0xce4: 0x1089, 0xce5: 0x2451, 0xce6: 0x0925, 0xce7: 0x2469, 0xce8: 0x2491, 0xce9: 0x0369,\n\t0xcea: 0x24a9, 0xceb: 0x0945, 0xcec: 0x0359, 0xced: 0x1159, 0xcee: 0x0ef9, 0xcef: 0x0f61,\n\t0xcf0: 0x0f41, 0xcf1: 0x2421, 0xcf2: 0x0965, 0xcf3: 0x2439, 0xcf4: 0x1089, 0xcf5: 0x2451,\n\t0xcf6: 0x0985, 0xcf7: 0x2469, 0xcf8: 0x2491, 0xcf9: 0x0369, 0xcfa: 0x24a9, 0xcfb: 0x09a5,\n\t0xcfc: 0x0359, 0xcfd: 0x1159, 0xcfe: 0x0ef9, 0xcff: 0x0f61,\n\t// Block 0x34, offset 0xd00\n\t0xd00: 0x0018, 0xd01: 0x0018, 0xd02: 0x0018, 0xd03: 0x0018, 0xd04: 0x0018, 0xd05: 0x0018,\n\t0xd06: 0x0018, 0xd07: 0x0018, 0xd08: 0x0018, 0xd09: 0x0018, 0xd0a: 0x0018, 0xd0b: 0x0040,\n\t0xd0c: 0x0040, 0xd0d: 0x0040, 0xd0e: 0x0040, 0xd0f: 0x0040, 0xd10: 0x0040, 0xd11: 0x0040,\n\t0xd12: 0x0040, 0xd13: 0x0040, 0xd14: 0x0040, 0xd15: 0x0040, 0xd16: 0x0040, 0xd17: 0x0040,\n\t0xd18: 0x0040, 0xd19: 0x0040, 0xd1a: 0x0040, 0xd1b: 0x0040, 0xd1c: 0x0040, 0xd1d: 0x0040,\n\t0xd1e: 0x0040, 0xd1f: 0x0040, 0xd20: 0x00c9, 0xd21: 0x0069, 0xd22: 0x0079, 0xd23: 0x1f51,\n\t0xd24: 0x1f61, 0xd25: 0x1f71, 0xd26: 0x1f81, 0xd27: 0x1f91, 0xd28: 0x1fa1, 0xd29: 0x2601,\n\t0xd2a: 0x2619, 0xd2b: 0x2631, 0xd2c: 0x2649, 0xd2d: 0x2661, 0xd2e: 0x2679, 0xd2f: 0x2691,\n\t0xd30: 0x26a9, 0xd31: 0x26c1, 0xd32: 0x26d9, 0xd33: 0x26f1, 0xd34: 0x0a06, 0xd35: 0x0a26,\n\t0xd36: 0x0a46, 0xd37: 0x0a66, 0xd38: 0x0a86, 0xd39: 0x0aa6, 0xd3a: 0x0ac6, 0xd3b: 0x0ae6,\n\t0xd3c: 0x0b06, 0xd3d: 0x270a, 0xd3e: 0x2732, 0xd3f: 0x275a,\n\t// Block 0x35, offset 0xd40\n\t0xd40: 0x2782, 0xd41: 0x27aa, 0xd42: 0x27d2, 0xd43: 0x27fa, 0xd44: 0x2822, 0xd45: 0x284a,\n\t0xd46: 0x2872, 0xd47: 0x289a, 0xd48: 0x0040, 0xd49: 0x0040, 0xd4a: 0x0040, 0xd4b: 0x0040,\n\t0xd4c: 0x0040, 0xd4d: 0x0040, 0xd4e: 0x0040, 0xd4f: 0x0040, 0xd50: 0x0040, 0xd51: 0x0040,\n\t0xd52: 0x0040, 0xd53: 0x0040, 0xd54: 0x0040, 0xd55: 0x0040, 0xd56: 0x0040, 0xd57: 0x0040,\n\t0xd58: 0x0040, 0xd59: 0x0040, 0xd5a: 0x0040, 0xd5b: 0x0040, 0xd5c: 0x0b26, 0xd5d: 0x0b46,\n\t0xd5e: 0x0b66, 0xd5f: 0x0b86, 0xd60: 0x0ba6, 0xd61: 0x0bc6, 0xd62: 0x0be6, 0xd63: 0x0c06,\n\t0xd64: 0x0c26, 0xd65: 0x0c46, 0xd66: 0x0c66, 0xd67: 0x0c86, 0xd68: 0x0ca6, 0xd69: 0x0cc6,\n\t0xd6a: 0x0ce6, 0xd6b: 0x0d06, 0xd6c: 0x0d26, 0xd6d: 0x0d46, 0xd6e: 0x0d66, 0xd6f: 0x0d86,\n\t0xd70: 0x0da6, 0xd71: 0x0dc6, 0xd72: 0x0de6, 0xd73: 0x0e06, 0xd74: 0x0e26, 0xd75: 0x0e46,\n\t0xd76: 0x0039, 0xd77: 0x0ee9, 0xd78: 0x1159, 0xd79: 0x0ef9, 0xd7a: 0x0f09, 0xd7b: 0x1199,\n\t0xd7c: 0x0f31, 0xd7d: 0x0249, 0xd7e: 0x0f41, 0xd7f: 0x0259,\n\t// Block 0x36, offset 0xd80\n\t0xd80: 0x0f51, 0xd81: 0x0359, 0xd82: 0x0f61, 0xd83: 0x0f71, 0xd84: 0x00d9, 0xd85: 0x0f99,\n\t0xd86: 0x2039, 0xd87: 0x0269, 0xd88: 0x01d9, 0xd89: 0x0fa9, 0xd8a: 0x0fb9, 0xd8b: 0x1089,\n\t0xd8c: 0x0279, 0xd8d: 0x0369, 0xd8e: 0x0289, 0xd8f: 0x13d1, 0xd90: 0x0039, 0xd91: 0x0ee9,\n\t0xd92: 0x1159, 0xd93: 0x0ef9, 0xd94: 0x0f09, 0xd95: 0x1199, 0xd96: 0x0f31, 0xd97: 0x0249,\n\t0xd98: 0x0f41, 0xd99: 0x0259, 0xd9a: 0x0f51, 0xd9b: 0x0359, 0xd9c: 0x0f61, 0xd9d: 0x0f71,\n\t0xd9e: 0x00d9, 0xd9f: 0x0f99, 0xda0: 0x2039, 0xda1: 0x0269, 0xda2: 0x01d9, 0xda3: 0x0fa9,\n\t0xda4: 0x0fb9, 0xda5: 0x1089, 0xda6: 0x0279, 0xda7: 0x0369, 0xda8: 0x0289, 0xda9: 0x13d1,\n\t0xdaa: 0x1f41, 0xdab: 0x0018, 0xdac: 0x0018, 0xdad: 0x0018, 0xdae: 0x0018, 0xdaf: 0x0018,\n\t0xdb0: 0x0018, 0xdb1: 0x0018, 0xdb2: 0x0018, 0xdb3: 0x0018, 0xdb4: 0x0018, 0xdb5: 0x0018,\n\t0xdb6: 0x0018, 0xdb7: 0x0018, 0xdb8: 0x0018, 0xdb9: 0x0018, 0xdba: 0x0018, 0xdbb: 0x0018,\n\t0xdbc: 0x0018, 0xdbd: 0x0018, 0xdbe: 0x0018, 0xdbf: 0x0018,\n\t// Block 0x37, offset 0xdc0\n\t0xdc0: 0x0008, 0xdc1: 0x0008, 0xdc2: 0x0008, 0xdc3: 0x0008, 0xdc4: 0x0008, 0xdc5: 0x0008,\n\t0xdc6: 0x0008, 0xdc7: 0x0008, 0xdc8: 0x0008, 0xdc9: 0x0008, 0xdca: 0x0008, 0xdcb: 0x0008,\n\t0xdcc: 0x0008, 0xdcd: 0x0008, 0xdce: 0x0008, 0xdcf: 0x0008, 0xdd0: 0x0008, 0xdd1: 0x0008,\n\t0xdd2: 0x0008, 0xdd3: 0x0008, 0xdd4: 0x0008, 0xdd5: 0x0008, 0xdd6: 0x0008, 0xdd7: 0x0008,\n\t0xdd8: 0x0008, 0xdd9: 0x0008, 0xdda: 0x0008, 0xddb: 0x0008, 0xddc: 0x0008, 0xddd: 0x0008,\n\t0xdde: 0x0008, 0xddf: 0x0040, 0xde0: 0xe00d, 0xde1: 0x0008, 0xde2: 0x2971, 0xde3: 0x0ebd,\n\t0xde4: 0x2989, 0xde5: 0x0008, 0xde6: 0x0008, 0xde7: 0xe07d, 0xde8: 0x0008, 0xde9: 0xe01d,\n\t0xdea: 0x0008, 0xdeb: 0xe03d, 0xdec: 0x0008, 0xded: 0x0fe1, 0xdee: 0x1281, 0xdef: 0x0fc9,\n\t0xdf0: 0x1141, 0xdf1: 0x0008, 0xdf2: 0xe00d, 0xdf3: 0x0008, 0xdf4: 0x0008, 0xdf5: 0xe01d,\n\t0xdf6: 0x0008, 0xdf7: 0x0008, 0xdf8: 0x0008, 0xdf9: 0x0008, 0xdfa: 0x0008, 0xdfb: 0x0008,\n\t0xdfc: 0x0259, 0xdfd: 0x1089, 0xdfe: 0x29a1, 0xdff: 0x29b9,\n\t// Block 0x38, offset 0xe00\n\t0xe00: 0xe00d, 0xe01: 0x0008, 0xe02: 0xe00d, 0xe03: 0x0008, 0xe04: 0xe00d, 0xe05: 0x0008,\n\t0xe06: 0xe00d, 0xe07: 0x0008, 0xe08: 0xe00d, 0xe09: 0x0008, 0xe0a: 0xe00d, 0xe0b: 0x0008,\n\t0xe0c: 0xe00d, 0xe0d: 0x0008, 0xe0e: 0xe00d, 0xe0f: 0x0008, 0xe10: 0xe00d, 0xe11: 0x0008,\n\t0xe12: 0xe00d, 0xe13: 0x0008, 0xe14: 0xe00d, 0xe15: 0x0008, 0xe16: 0xe00d, 0xe17: 0x0008,\n\t0xe18: 0xe00d, 0xe19: 0x0008, 0xe1a: 0xe00d, 0xe1b: 0x0008, 0xe1c: 0xe00d, 0xe1d: 0x0008,\n\t0xe1e: 0xe00d, 0xe1f: 0x0008, 0xe20: 0xe00d, 0xe21: 0x0008, 0xe22: 0xe00d, 0xe23: 0x0008,\n\t0xe24: 0x0008, 0xe25: 0x0018, 0xe26: 0x0018, 0xe27: 0x0018, 0xe28: 0x0018, 0xe29: 0x0018,\n\t0xe2a: 0x0018, 0xe2b: 0xe03d, 0xe2c: 0x0008, 0xe2d: 0xe01d, 0xe2e: 0x0008, 0xe2f: 0x3308,\n\t0xe30: 0x3308, 0xe31: 0x3308, 0xe32: 0xe00d, 0xe33: 0x0008, 0xe34: 0x0040, 0xe35: 0x0040,\n\t0xe36: 0x0040, 0xe37: 0x0040, 0xe38: 0x0040, 0xe39: 0x0018, 0xe3a: 0x0018, 0xe3b: 0x0018,\n\t0xe3c: 0x0018, 0xe3d: 0x0018, 0xe3e: 0x0018, 0xe3f: 0x0018,\n\t// Block 0x39, offset 0xe40\n\t0xe40: 0x26fd, 0xe41: 0x271d, 0xe42: 0x273d, 0xe43: 0x275d, 0xe44: 0x277d, 0xe45: 0x279d,\n\t0xe46: 0x27bd, 0xe47: 0x27dd, 0xe48: 0x27fd, 0xe49: 0x281d, 0xe4a: 0x283d, 0xe4b: 0x285d,\n\t0xe4c: 0x287d, 0xe4d: 0x289d, 0xe4e: 0x28bd, 0xe4f: 0x28dd, 0xe50: 0x28fd, 0xe51: 0x291d,\n\t0xe52: 0x293d, 0xe53: 0x295d, 0xe54: 0x297d, 0xe55: 0x299d, 0xe56: 0x0040, 0xe57: 0x0040,\n\t0xe58: 0x0040, 0xe59: 0x0040, 0xe5a: 0x0040, 0xe5b: 0x0040, 0xe5c: 0x0040, 0xe5d: 0x0040,\n\t0xe5e: 0x0040, 0xe5f: 0x0040, 0xe60: 0x0040, 0xe61: 0x0040, 0xe62: 0x0040, 0xe63: 0x0040,\n\t0xe64: 0x0040, 0xe65: 0x0040, 0xe66: 0x0040, 0xe67: 0x0040, 0xe68: 0x0040, 0xe69: 0x0040,\n\t0xe6a: 0x0040, 0xe6b: 0x0040, 0xe6c: 0x0040, 0xe6d: 0x0040, 0xe6e: 0x0040, 0xe6f: 0x0040,\n\t0xe70: 0x0040, 0xe71: 0x0040, 0xe72: 0x0040, 0xe73: 0x0040, 0xe74: 0x0040, 0xe75: 0x0040,\n\t0xe76: 0x0040, 0xe77: 0x0040, 0xe78: 0x0040, 0xe79: 0x0040, 0xe7a: 0x0040, 0xe7b: 0x0040,\n\t0xe7c: 0x0040, 0xe7d: 0x0040, 0xe7e: 0x0040, 0xe7f: 0x0040,\n\t// Block 0x3a, offset 0xe80\n\t0xe80: 0x000a, 0xe81: 0x0018, 0xe82: 0x29d1, 0xe83: 0x0018, 0xe84: 0x0018, 0xe85: 0x0008,\n\t0xe86: 0x0008, 0xe87: 0x0008, 0xe88: 0x0018, 0xe89: 0x0018, 0xe8a: 0x0018, 0xe8b: 0x0018,\n\t0xe8c: 0x0018, 0xe8d: 0x0018, 0xe8e: 0x0018, 0xe8f: 0x0018, 0xe90: 0x0018, 0xe91: 0x0018,\n\t0xe92: 0x0018, 0xe93: 0x0018, 0xe94: 0x0018, 0xe95: 0x0018, 0xe96: 0x0018, 0xe97: 0x0018,\n\t0xe98: 0x0018, 0xe99: 0x0018, 0xe9a: 0x0018, 0xe9b: 0x0018, 0xe9c: 0x0018, 0xe9d: 0x0018,\n\t0xe9e: 0x0018, 0xe9f: 0x0018, 0xea0: 0x0018, 0xea1: 0x0018, 0xea2: 0x0018, 0xea3: 0x0018,\n\t0xea4: 0x0018, 0xea5: 0x0018, 0xea6: 0x0018, 0xea7: 0x0018, 0xea8: 0x0018, 0xea9: 0x0018,\n\t0xeaa: 0x3308, 0xeab: 0x3308, 0xeac: 0x3308, 0xead: 0x3308, 0xeae: 0x3018, 0xeaf: 0x3018,\n\t0xeb0: 0x0018, 0xeb1: 0x0018, 0xeb2: 0x0018, 0xeb3: 0x0018, 0xeb4: 0x0018, 0xeb5: 0x0018,\n\t0xeb6: 0xe125, 0xeb7: 0x0018, 0xeb8: 0x29bd, 0xeb9: 0x29dd, 0xeba: 0x29fd, 0xebb: 0x0018,\n\t0xebc: 0x0008, 0xebd: 0x0018, 0xebe: 0x0018, 0xebf: 0x0018,\n\t// Block 0x3b, offset 0xec0\n\t0xec0: 0x2b3d, 0xec1: 0x2b5d, 0xec2: 0x2b7d, 0xec3: 0x2b9d, 0xec4: 0x2bbd, 0xec5: 0x2bdd,\n\t0xec6: 0x2bdd, 0xec7: 0x2bdd, 0xec8: 0x2bfd, 0xec9: 0x2bfd, 0xeca: 0x2bfd, 0xecb: 0x2bfd,\n\t0xecc: 0x2c1d, 0xecd: 0x2c1d, 0xece: 0x2c1d, 0xecf: 0x2c3d, 0xed0: 0x2c5d, 0xed1: 0x2c5d,\n\t0xed2: 0x2a7d, 0xed3: 0x2a7d, 0xed4: 0x2c5d, 0xed5: 0x2c5d, 0xed6: 0x2c7d, 0xed7: 0x2c7d,\n\t0xed8: 0x2c5d, 0xed9: 0x2c5d, 0xeda: 0x2a7d, 0xedb: 0x2a7d, 0xedc: 0x2c5d, 0xedd: 0x2c5d,\n\t0xede: 0x2c3d, 0xedf: 0x2c3d, 0xee0: 0x2c9d, 0xee1: 0x2c9d, 0xee2: 0x2cbd, 0xee3: 0x2cbd,\n\t0xee4: 0x0040, 0xee5: 0x2cdd, 0xee6: 0x2cfd, 0xee7: 0x2d1d, 0xee8: 0x2d1d, 0xee9: 0x2d3d,\n\t0xeea: 0x2d5d, 0xeeb: 0x2d7d, 0xeec: 0x2d9d, 0xeed: 0x2dbd, 0xeee: 0x2ddd, 0xeef: 0x2dfd,\n\t0xef0: 0x2e1d, 0xef1: 0x2e3d, 0xef2: 0x2e3d, 0xef3: 0x2e5d, 0xef4: 0x2e7d, 0xef5: 0x2e7d,\n\t0xef6: 0x2e9d, 0xef7: 0x2ebd, 0xef8: 0x2e5d, 0xef9: 0x2edd, 0xefa: 0x2efd, 0xefb: 0x2edd,\n\t0xefc: 0x2e5d, 0xefd: 0x2f1d, 0xefe: 0x2f3d, 0xeff: 0x2f5d,\n\t// Block 0x3c, offset 0xf00\n\t0xf00: 0x2f7d, 0xf01: 0x2f9d, 0xf02: 0x2cfd, 0xf03: 0x2cdd, 0xf04: 0x2fbd, 0xf05: 0x2fdd,\n\t0xf06: 0x2ffd, 0xf07: 0x301d, 0xf08: 0x303d, 0xf09: 0x305d, 0xf0a: 0x307d, 0xf0b: 0x309d,\n\t0xf0c: 0x30bd, 0xf0d: 0x30dd, 0xf0e: 0x30fd, 0xf0f: 0x0040, 0xf10: 0x0018, 0xf11: 0x0018,\n\t0xf12: 0x311d, 0xf13: 0x313d, 0xf14: 0x315d, 0xf15: 0x317d, 0xf16: 0x319d, 0xf17: 0x31bd,\n\t0xf18: 0x31dd, 0xf19: 0x31fd, 0xf1a: 0x321d, 0xf1b: 0x323d, 0xf1c: 0x315d, 0xf1d: 0x325d,\n\t0xf1e: 0x327d, 0xf1f: 0x329d, 0xf20: 0x0008, 0xf21: 0x0008, 0xf22: 0x0008, 0xf23: 0x0008,\n\t0xf24: 0x0008, 0xf25: 0x0008, 0xf26: 0x0008, 0xf27: 0x0008, 0xf28: 0x0008, 0xf29: 0x0008,\n\t0xf2a: 0x0008, 0xf2b: 0x0008, 0xf2c: 0x0008, 0xf2d: 0x0008, 0xf2e: 0x0008, 0xf2f: 0x0008,\n\t0xf30: 0x0008, 0xf31: 0x0008, 0xf32: 0x0008, 0xf33: 0x0008, 0xf34: 0x0008, 0xf35: 0x0008,\n\t0xf36: 0x0008, 0xf37: 0x0008, 0xf38: 0x0008, 0xf39: 0x0008, 0xf3a: 0x0008, 0xf3b: 0x0040,\n\t0xf3c: 0x0040, 0xf3d: 0x0040, 0xf3e: 0x0040, 0xf3f: 0x0040,\n\t// Block 0x3d, offset 0xf40\n\t0xf40: 0x36a2, 0xf41: 0x36d2, 0xf42: 0x3702, 0xf43: 0x3732, 0xf44: 0x32bd, 0xf45: 0x32dd,\n\t0xf46: 0x32fd, 0xf47: 0x331d, 0xf48: 0x0018, 0xf49: 0x0018, 0xf4a: 0x0018, 0xf4b: 0x0018,\n\t0xf4c: 0x0018, 0xf4d: 0x0018, 0xf4e: 0x0018, 0xf4f: 0x0018, 0xf50: 0x333d, 0xf51: 0x3761,\n\t0xf52: 0x3779, 0xf53: 0x3791, 0xf54: 0x37a9, 0xf55: 0x37c1, 0xf56: 0x37d9, 0xf57: 0x37f1,\n\t0xf58: 0x3809, 0xf59: 0x3821, 0xf5a: 0x3839, 0xf5b: 0x3851, 0xf5c: 0x3869, 0xf5d: 0x3881,\n\t0xf5e: 0x3899, 0xf5f: 0x38b1, 0xf60: 0x335d, 0xf61: 0x337d, 0xf62: 0x339d, 0xf63: 0x33bd,\n\t0xf64: 0x33dd, 0xf65: 0x33dd, 0xf66: 0x33fd, 0xf67: 0x341d, 0xf68: 0x343d, 0xf69: 0x345d,\n\t0xf6a: 0x347d, 0xf6b: 0x349d, 0xf6c: 0x34bd, 0xf6d: 0x34dd, 0xf6e: 0x34fd, 0xf6f: 0x351d,\n\t0xf70: 0x353d, 0xf71: 0x355d, 0xf72: 0x357d, 0xf73: 0x359d, 0xf74: 0x35bd, 0xf75: 0x35dd,\n\t0xf76: 0x35fd, 0xf77: 0x361d, 0xf78: 0x363d, 0xf79: 0x365d, 0xf7a: 0x367d, 0xf7b: 0x369d,\n\t0xf7c: 0x38c9, 0xf7d: 0x3901, 0xf7e: 0x36bd, 0xf7f: 0x0018,\n\t// Block 0x3e, offset 0xf80\n\t0xf80: 0x36dd, 0xf81: 0x36fd, 0xf82: 0x371d, 0xf83: 0x373d, 0xf84: 0x375d, 0xf85: 0x377d,\n\t0xf86: 0x379d, 0xf87: 0x37bd, 0xf88: 0x37dd, 0xf89: 0x37fd, 0xf8a: 0x381d, 0xf8b: 0x383d,\n\t0xf8c: 0x385d, 0xf8d: 0x387d, 0xf8e: 0x389d, 0xf8f: 0x38bd, 0xf90: 0x38dd, 0xf91: 0x38fd,\n\t0xf92: 0x391d, 0xf93: 0x393d, 0xf94: 0x395d, 0xf95: 0x397d, 0xf96: 0x399d, 0xf97: 0x39bd,\n\t0xf98: 0x39dd, 0xf99: 0x39fd, 0xf9a: 0x3a1d, 0xf9b: 0x3a3d, 0xf9c: 0x3a5d, 0xf9d: 0x3a7d,\n\t0xf9e: 0x3a9d, 0xf9f: 0x3abd, 0xfa0: 0x3add, 0xfa1: 0x3afd, 0xfa2: 0x3b1d, 0xfa3: 0x3b3d,\n\t0xfa4: 0x3b5d, 0xfa5: 0x3b7d, 0xfa6: 0x127d, 0xfa7: 0x3b9d, 0xfa8: 0x3bbd, 0xfa9: 0x3bdd,\n\t0xfaa: 0x3bfd, 0xfab: 0x3c1d, 0xfac: 0x3c3d, 0xfad: 0x3c5d, 0xfae: 0x239d, 0xfaf: 0x3c7d,\n\t0xfb0: 0x3c9d, 0xfb1: 0x3939, 0xfb2: 0x3951, 0xfb3: 0x3969, 0xfb4: 0x3981, 0xfb5: 0x3999,\n\t0xfb6: 0x39b1, 0xfb7: 0x39c9, 0xfb8: 0x39e1, 0xfb9: 0x39f9, 0xfba: 0x3a11, 0xfbb: 0x3a29,\n\t0xfbc: 0x3a41, 0xfbd: 0x3a59, 0xfbe: 0x3a71, 0xfbf: 0x3a89,\n\t// Block 0x3f, offset 0xfc0\n\t0xfc0: 0x3aa1, 0xfc1: 0x3ac9, 0xfc2: 0x3af1, 0xfc3: 0x3b19, 0xfc4: 0x3b41, 0xfc5: 0x3b69,\n\t0xfc6: 0x3b91, 0xfc7: 0x3bb9, 0xfc8: 0x3be1, 0xfc9: 0x3c09, 0xfca: 0x3c39, 0xfcb: 0x3c69,\n\t0xfcc: 0x3c99, 0xfcd: 0x3cbd, 0xfce: 0x3cb1, 0xfcf: 0x3cdd, 0xfd0: 0x3cfd, 0xfd1: 0x3d15,\n\t0xfd2: 0x3d2d, 0xfd3: 0x3d45, 0xfd4: 0x3d5d, 0xfd5: 0x3d5d, 0xfd6: 0x3d45, 0xfd7: 0x3d75,\n\t0xfd8: 0x07bd, 0xfd9: 0x3d8d, 0xfda: 0x3da5, 0xfdb: 0x3dbd, 0xfdc: 0x3dd5, 0xfdd: 0x3ded,\n\t0xfde: 0x3e05, 0xfdf: 0x3e1d, 0xfe0: 0x3e35, 0xfe1: 0x3e4d, 0xfe2: 0x3e65, 0xfe3: 0x3e7d,\n\t0xfe4: 0x3e95, 0xfe5: 0x3e95, 0xfe6: 0x3ead, 0xfe7: 0x3ead, 0xfe8: 0x3ec5, 0xfe9: 0x3ec5,\n\t0xfea: 0x3edd, 0xfeb: 0x3ef5, 0xfec: 0x3f0d, 0xfed: 0x3f25, 0xfee: 0x3f3d, 0xfef: 0x3f3d,\n\t0xff0: 0x3f55, 0xff1: 0x3f55, 0xff2: 0x3f55, 0xff3: 0x3f6d, 0xff4: 0x3f85, 0xff5: 0x3f9d,\n\t0xff6: 0x3fb5, 0xff7: 0x3f9d, 0xff8: 0x3fcd, 0xff9: 0x3fe5, 0xffa: 0x3f6d, 0xffb: 0x3ffd,\n\t0xffc: 0x4015, 0xffd: 0x4015, 0xffe: 0x4015, 0xfff: 0x0040,\n\t// Block 0x40, offset 0x1000\n\t0x1000: 0x3cc9, 0x1001: 0x3d31, 0x1002: 0x3d99, 0x1003: 0x3e01, 0x1004: 0x3e51, 0x1005: 0x3eb9,\n\t0x1006: 0x3f09, 0x1007: 0x3f59, 0x1008: 0x3fd9, 0x1009: 0x4041, 0x100a: 0x4091, 0x100b: 0x40e1,\n\t0x100c: 0x4131, 0x100d: 0x4199, 0x100e: 0x4201, 0x100f: 0x4251, 0x1010: 0x42a1, 0x1011: 0x42d9,\n\t0x1012: 0x4329, 0x1013: 0x4391, 0x1014: 0x43f9, 0x1015: 0x4431, 0x1016: 0x44b1, 0x1017: 0x4549,\n\t0x1018: 0x45c9, 0x1019: 0x4619, 0x101a: 0x4699, 0x101b: 0x4719, 0x101c: 0x4781, 0x101d: 0x47d1,\n\t0x101e: 0x4821, 0x101f: 0x4871, 0x1020: 0x48d9, 0x1021: 0x4959, 0x1022: 0x49c1, 0x1023: 0x4a11,\n\t0x1024: 0x4a61, 0x1025: 0x4ab1, 0x1026: 0x4ae9, 0x1027: 0x4b21, 0x1028: 0x4b59, 0x1029: 0x4b91,\n\t0x102a: 0x4be1, 0x102b: 0x4c31, 0x102c: 0x4cb1, 0x102d: 0x4d01, 0x102e: 0x4d69, 0x102f: 0x4de9,\n\t0x1030: 0x4e39, 0x1031: 0x4e71, 0x1032: 0x4ea9, 0x1033: 0x4f29, 0x1034: 0x4f91, 0x1035: 0x5011,\n\t0x1036: 0x5061, 0x1037: 0x50e1, 0x1038: 0x5119, 0x1039: 0x5169, 0x103a: 0x51b9, 0x103b: 0x5209,\n\t0x103c: 0x5259, 0x103d: 0x52a9, 0x103e: 0x5311, 0x103f: 0x5361,\n\t// Block 0x41, offset 0x1040\n\t0x1040: 0x5399, 0x1041: 0x53e9, 0x1042: 0x5439, 0x1043: 0x5489, 0x1044: 0x54f1, 0x1045: 0x5541,\n\t0x1046: 0x5591, 0x1047: 0x55e1, 0x1048: 0x5661, 0x1049: 0x56c9, 0x104a: 0x5701, 0x104b: 0x5781,\n\t0x104c: 0x57b9, 0x104d: 0x5821, 0x104e: 0x5889, 0x104f: 0x58d9, 0x1050: 0x5929, 0x1051: 0x5979,\n\t0x1052: 0x59e1, 0x1053: 0x5a19, 0x1054: 0x5a69, 0x1055: 0x5ad1, 0x1056: 0x5b09, 0x1057: 0x5b89,\n\t0x1058: 0x5bd9, 0x1059: 0x5c01, 0x105a: 0x5c29, 0x105b: 0x5c51, 0x105c: 0x5c79, 0x105d: 0x5ca1,\n\t0x105e: 0x5cc9, 0x105f: 0x5cf1, 0x1060: 0x5d19, 0x1061: 0x5d41, 0x1062: 0x5d69, 0x1063: 0x5d99,\n\t0x1064: 0x5dc9, 0x1065: 0x5df9, 0x1066: 0x5e29, 0x1067: 0x5e59, 0x1068: 0x5e89, 0x1069: 0x5eb9,\n\t0x106a: 0x5ee9, 0x106b: 0x5f19, 0x106c: 0x5f49, 0x106d: 0x5f79, 0x106e: 0x5fa9, 0x106f: 0x5fd9,\n\t0x1070: 0x6009, 0x1071: 0x402d, 0x1072: 0x6039, 0x1073: 0x6051, 0x1074: 0x404d, 0x1075: 0x6069,\n\t0x1076: 0x6081, 0x1077: 0x6099, 0x1078: 0x406d, 0x1079: 0x406d, 0x107a: 0x60b1, 0x107b: 0x60c9,\n\t0x107c: 0x6101, 0x107d: 0x6139, 0x107e: 0x6171, 0x107f: 0x61a9,\n\t// Block 0x42, offset 0x1080\n\t0x1080: 0x6211, 0x1081: 0x6229, 0x1082: 0x408d, 0x1083: 0x6241, 0x1084: 0x6259, 0x1085: 0x6271,\n\t0x1086: 0x6289, 0x1087: 0x62a1, 0x1088: 0x40ad, 0x1089: 0x62b9, 0x108a: 0x62e1, 0x108b: 0x62f9,\n\t0x108c: 0x40cd, 0x108d: 0x40cd, 0x108e: 0x6311, 0x108f: 0x6329, 0x1090: 0x6341, 0x1091: 0x40ed,\n\t0x1092: 0x410d, 0x1093: 0x412d, 0x1094: 0x414d, 0x1095: 0x416d, 0x1096: 0x6359, 0x1097: 0x6371,\n\t0x1098: 0x6389, 0x1099: 0x63a1, 0x109a: 0x63b9, 0x109b: 0x418d, 0x109c: 0x63d1, 0x109d: 0x63e9,\n\t0x109e: 0x6401, 0x109f: 0x41ad, 0x10a0: 0x41cd, 0x10a1: 0x6419, 0x10a2: 0x41ed, 0x10a3: 0x420d,\n\t0x10a4: 0x422d, 0x10a5: 0x6431, 0x10a6: 0x424d, 0x10a7: 0x6449, 0x10a8: 0x6479, 0x10a9: 0x6211,\n\t0x10aa: 0x426d, 0x10ab: 0x428d, 0x10ac: 0x42ad, 0x10ad: 0x42cd, 0x10ae: 0x64b1, 0x10af: 0x64f1,\n\t0x10b0: 0x6539, 0x10b1: 0x6551, 0x10b2: 0x42ed, 0x10b3: 0x6569, 0x10b4: 0x6581, 0x10b5: 0x6599,\n\t0x10b6: 0x430d, 0x10b7: 0x65b1, 0x10b8: 0x65c9, 0x10b9: 0x65b1, 0x10ba: 0x65e1, 0x10bb: 0x65f9,\n\t0x10bc: 0x432d, 0x10bd: 0x6611, 0x10be: 0x6629, 0x10bf: 0x6611,\n\t// Block 0x43, offset 0x10c0\n\t0x10c0: 0x434d, 0x10c1: 0x436d, 0x10c2: 0x0040, 0x10c3: 0x6641, 0x10c4: 0x6659, 0x10c5: 0x6671,\n\t0x10c6: 0x6689, 0x10c7: 0x0040, 0x10c8: 0x66c1, 0x10c9: 0x66d9, 0x10ca: 0x66f1, 0x10cb: 0x6709,\n\t0x10cc: 0x6721, 0x10cd: 0x6739, 0x10ce: 0x6401, 0x10cf: 0x6751, 0x10d0: 0x6769, 0x10d1: 0x6781,\n\t0x10d2: 0x438d, 0x10d3: 0x6799, 0x10d4: 0x6289, 0x10d5: 0x43ad, 0x10d6: 0x43cd, 0x10d7: 0x67b1,\n\t0x10d8: 0x0040, 0x10d9: 0x43ed, 0x10da: 0x67c9, 0x10db: 0x67e1, 0x10dc: 0x67f9, 0x10dd: 0x6811,\n\t0x10de: 0x6829, 0x10df: 0x6859, 0x10e0: 0x6889, 0x10e1: 0x68b1, 0x10e2: 0x68d9, 0x10e3: 0x6901,\n\t0x10e4: 0x6929, 0x10e5: 0x6951, 0x10e6: 0x6979, 0x10e7: 0x69a1, 0x10e8: 0x69c9, 0x10e9: 0x69f1,\n\t0x10ea: 0x6a21, 0x10eb: 0x6a51, 0x10ec: 0x6a81, 0x10ed: 0x6ab1, 0x10ee: 0x6ae1, 0x10ef: 0x6b11,\n\t0x10f0: 0x6b41, 0x10f1: 0x6b71, 0x10f2: 0x6ba1, 0x10f3: 0x6bd1, 0x10f4: 0x6c01, 0x10f5: 0x6c31,\n\t0x10f6: 0x6c61, 0x10f7: 0x6c91, 0x10f8: 0x6cc1, 0x10f9: 0x6cf1, 0x10fa: 0x6d21, 0x10fb: 0x6d51,\n\t0x10fc: 0x6d81, 0x10fd: 0x6db1, 0x10fe: 0x6de1, 0x10ff: 0x440d,\n\t// Block 0x44, offset 0x1100\n\t0x1100: 0xe00d, 0x1101: 0x0008, 0x1102: 0xe00d, 0x1103: 0x0008, 0x1104: 0xe00d, 0x1105: 0x0008,\n\t0x1106: 0xe00d, 0x1107: 0x0008, 0x1108: 0xe00d, 0x1109: 0x0008, 0x110a: 0xe00d, 0x110b: 0x0008,\n\t0x110c: 0xe00d, 0x110d: 0x0008, 0x110e: 0xe00d, 0x110f: 0x0008, 0x1110: 0xe00d, 0x1111: 0x0008,\n\t0x1112: 0xe00d, 0x1113: 0x0008, 0x1114: 0xe00d, 0x1115: 0x0008, 0x1116: 0xe00d, 0x1117: 0x0008,\n\t0x1118: 0xe00d, 0x1119: 0x0008, 0x111a: 0xe00d, 0x111b: 0x0008, 0x111c: 0xe00d, 0x111d: 0x0008,\n\t0x111e: 0xe00d, 0x111f: 0x0008, 0x1120: 0xe00d, 0x1121: 0x0008, 0x1122: 0xe00d, 0x1123: 0x0008,\n\t0x1124: 0xe00d, 0x1125: 0x0008, 0x1126: 0xe00d, 0x1127: 0x0008, 0x1128: 0xe00d, 0x1129: 0x0008,\n\t0x112a: 0xe00d, 0x112b: 0x0008, 0x112c: 0xe00d, 0x112d: 0x0008, 0x112e: 0x0008, 0x112f: 0x3308,\n\t0x1130: 0x3318, 0x1131: 0x3318, 0x1132: 0x3318, 0x1133: 0x0018, 0x1134: 0x3308, 0x1135: 0x3308,\n\t0x1136: 0x3308, 0x1137: 0x3308, 0x1138: 0x3308, 0x1139: 0x3308, 0x113a: 0x3308, 0x113b: 0x3308,\n\t0x113c: 0x3308, 0x113d: 0x3308, 0x113e: 0x0018, 0x113f: 0x0008,\n\t// Block 0x45, offset 0x1140\n\t0x1140: 0xe00d, 0x1141: 0x0008, 0x1142: 0xe00d, 0x1143: 0x0008, 0x1144: 0xe00d, 0x1145: 0x0008,\n\t0x1146: 0xe00d, 0x1147: 0x0008, 0x1148: 0xe00d, 0x1149: 0x0008, 0x114a: 0xe00d, 0x114b: 0x0008,\n\t0x114c: 0xe00d, 0x114d: 0x0008, 0x114e: 0xe00d, 0x114f: 0x0008, 0x1150: 0xe00d, 0x1151: 0x0008,\n\t0x1152: 0xe00d, 0x1153: 0x0008, 0x1154: 0xe00d, 0x1155: 0x0008, 0x1156: 0xe00d, 0x1157: 0x0008,\n\t0x1158: 0xe00d, 0x1159: 0x0008, 0x115a: 0xe00d, 0x115b: 0x0008, 0x115c: 0x0ea1, 0x115d: 0x6e11,\n\t0x115e: 0x3308, 0x115f: 0x3308, 0x1160: 0x0008, 0x1161: 0x0008, 0x1162: 0x0008, 0x1163: 0x0008,\n\t0x1164: 0x0008, 0x1165: 0x0008, 0x1166: 0x0008, 0x1167: 0x0008, 0x1168: 0x0008, 0x1169: 0x0008,\n\t0x116a: 0x0008, 0x116b: 0x0008, 0x116c: 0x0008, 0x116d: 0x0008, 0x116e: 0x0008, 0x116f: 0x0008,\n\t0x1170: 0x0008, 0x1171: 0x0008, 0x1172: 0x0008, 0x1173: 0x0008, 0x1174: 0x0008, 0x1175: 0x0008,\n\t0x1176: 0x0008, 0x1177: 0x0008, 0x1178: 0x0008, 0x1179: 0x0008, 0x117a: 0x0008, 0x117b: 0x0008,\n\t0x117c: 0x0008, 0x117d: 0x0008, 0x117e: 0x0008, 0x117f: 0x0008,\n\t// Block 0x46, offset 0x1180\n\t0x1180: 0x0018, 0x1181: 0x0018, 0x1182: 0x0018, 0x1183: 0x0018, 0x1184: 0x0018, 0x1185: 0x0018,\n\t0x1186: 0x0018, 0x1187: 0x0018, 0x1188: 0x0018, 0x1189: 0x0018, 0x118a: 0x0018, 0x118b: 0x0018,\n\t0x118c: 0x0018, 0x118d: 0x0018, 0x118e: 0x0018, 0x118f: 0x0018, 0x1190: 0x0018, 0x1191: 0x0018,\n\t0x1192: 0x0018, 0x1193: 0x0018, 0x1194: 0x0018, 0x1195: 0x0018, 0x1196: 0x0018, 0x1197: 0x0008,\n\t0x1198: 0x0008, 0x1199: 0x0008, 0x119a: 0x0008, 0x119b: 0x0008, 0x119c: 0x0008, 0x119d: 0x0008,\n\t0x119e: 0x0008, 0x119f: 0x0008, 0x11a0: 0x0018, 0x11a1: 0x0018, 0x11a2: 0xe00d, 0x11a3: 0x0008,\n\t0x11a4: 0xe00d, 0x11a5: 0x0008, 0x11a6: 0xe00d, 0x11a7: 0x0008, 0x11a8: 0xe00d, 0x11a9: 0x0008,\n\t0x11aa: 0xe00d, 0x11ab: 0x0008, 0x11ac: 0xe00d, 0x11ad: 0x0008, 0x11ae: 0xe00d, 0x11af: 0x0008,\n\t0x11b0: 0x0008, 0x11b1: 0x0008, 0x11b2: 0xe00d, 0x11b3: 0x0008, 0x11b4: 0xe00d, 0x11b5: 0x0008,\n\t0x11b6: 0xe00d, 0x11b7: 0x0008, 0x11b8: 0xe00d, 0x11b9: 0x0008, 0x11ba: 0xe00d, 0x11bb: 0x0008,\n\t0x11bc: 0xe00d, 0x11bd: 0x0008, 0x11be: 0xe00d, 0x11bf: 0x0008,\n\t// Block 0x47, offset 0x11c0\n\t0x11c0: 0xe00d, 0x11c1: 0x0008, 0x11c2: 0xe00d, 0x11c3: 0x0008, 0x11c4: 0xe00d, 0x11c5: 0x0008,\n\t0x11c6: 0xe00d, 0x11c7: 0x0008, 0x11c8: 0xe00d, 0x11c9: 0x0008, 0x11ca: 0xe00d, 0x11cb: 0x0008,\n\t0x11cc: 0xe00d, 0x11cd: 0x0008, 0x11ce: 0xe00d, 0x11cf: 0x0008, 0x11d0: 0xe00d, 0x11d1: 0x0008,\n\t0x11d2: 0xe00d, 0x11d3: 0x0008, 0x11d4: 0xe00d, 0x11d5: 0x0008, 0x11d6: 0xe00d, 0x11d7: 0x0008,\n\t0x11d8: 0xe00d, 0x11d9: 0x0008, 0x11da: 0xe00d, 0x11db: 0x0008, 0x11dc: 0xe00d, 0x11dd: 0x0008,\n\t0x11de: 0xe00d, 0x11df: 0x0008, 0x11e0: 0xe00d, 0x11e1: 0x0008, 0x11e2: 0xe00d, 0x11e3: 0x0008,\n\t0x11e4: 0xe00d, 0x11e5: 0x0008, 0x11e6: 0xe00d, 0x11e7: 0x0008, 0x11e8: 0xe00d, 0x11e9: 0x0008,\n\t0x11ea: 0xe00d, 0x11eb: 0x0008, 0x11ec: 0xe00d, 0x11ed: 0x0008, 0x11ee: 0xe00d, 0x11ef: 0x0008,\n\t0x11f0: 0xe0fd, 0x11f1: 0x0008, 0x11f2: 0x0008, 0x11f3: 0x0008, 0x11f4: 0x0008, 0x11f5: 0x0008,\n\t0x11f6: 0x0008, 0x11f7: 0x0008, 0x11f8: 0x0008, 0x11f9: 0xe01d, 0x11fa: 0x0008, 0x11fb: 0xe03d,\n\t0x11fc: 0x0008, 0x11fd: 0x442d, 0x11fe: 0xe00d, 0x11ff: 0x0008,\n\t// Block 0x48, offset 0x1200\n\t0x1200: 0xe00d, 0x1201: 0x0008, 0x1202: 0xe00d, 0x1203: 0x0008, 0x1204: 0xe00d, 0x1205: 0x0008,\n\t0x1206: 0xe00d, 0x1207: 0x0008, 0x1208: 0x0008, 0x1209: 0x0018, 0x120a: 0x0018, 0x120b: 0xe03d,\n\t0x120c: 0x0008, 0x120d: 0x11d9, 0x120e: 0x0008, 0x120f: 0x0008, 0x1210: 0xe00d, 0x1211: 0x0008,\n\t0x1212: 0xe00d, 0x1213: 0x0008, 0x1214: 0x0008, 0x1215: 0x0008, 0x1216: 0xe00d, 0x1217: 0x0008,\n\t0x1218: 0xe00d, 0x1219: 0x0008, 0x121a: 0xe00d, 0x121b: 0x0008, 0x121c: 0xe00d, 0x121d: 0x0008,\n\t0x121e: 0xe00d, 0x121f: 0x0008, 0x1220: 0xe00d, 0x1221: 0x0008, 0x1222: 0xe00d, 0x1223: 0x0008,\n\t0x1224: 0xe00d, 0x1225: 0x0008, 0x1226: 0xe00d, 0x1227: 0x0008, 0x1228: 0xe00d, 0x1229: 0x0008,\n\t0x122a: 0x6e29, 0x122b: 0x1029, 0x122c: 0x11c1, 0x122d: 0x6e41, 0x122e: 0x1221, 0x122f: 0x0040,\n\t0x1230: 0x6e59, 0x1231: 0x6e71, 0x1232: 0x1239, 0x1233: 0x444d, 0x1234: 0xe00d, 0x1235: 0x0008,\n\t0x1236: 0xe00d, 0x1237: 0x0008, 0x1238: 0x0040, 0x1239: 0x0040, 0x123a: 0x0040, 0x123b: 0x0040,\n\t0x123c: 0x0040, 0x123d: 0x0040, 0x123e: 0x0040, 0x123f: 0x0040,\n\t// Block 0x49, offset 0x1240\n\t0x1240: 0x64d5, 0x1241: 0x64f5, 0x1242: 0x6515, 0x1243: 0x6535, 0x1244: 0x6555, 0x1245: 0x6575,\n\t0x1246: 0x6595, 0x1247: 0x65b5, 0x1248: 0x65d5, 0x1249: 0x65f5, 0x124a: 0x6615, 0x124b: 0x6635,\n\t0x124c: 0x6655, 0x124d: 0x6675, 0x124e: 0x0008, 0x124f: 0x0008, 0x1250: 0x6695, 0x1251: 0x0008,\n\t0x1252: 0x66b5, 0x1253: 0x0008, 0x1254: 0x0008, 0x1255: 0x66d5, 0x1256: 0x66f5, 0x1257: 0x6715,\n\t0x1258: 0x6735, 0x1259: 0x6755, 0x125a: 0x6775, 0x125b: 0x6795, 0x125c: 0x67b5, 0x125d: 0x67d5,\n\t0x125e: 0x67f5, 0x125f: 0x0008, 0x1260: 0x6815, 0x1261: 0x0008, 0x1262: 0x6835, 0x1263: 0x0008,\n\t0x1264: 0x0008, 0x1265: 0x6855, 0x1266: 0x6875, 0x1267: 0x0008, 0x1268: 0x0008, 0x1269: 0x0008,\n\t0x126a: 0x6895, 0x126b: 0x68b5, 0x126c: 0x68d5, 0x126d: 0x68f5, 0x126e: 0x6915, 0x126f: 0x6935,\n\t0x1270: 0x6955, 0x1271: 0x6975, 0x1272: 0x6995, 0x1273: 0x69b5, 0x1274: 0x69d5, 0x1275: 0x69f5,\n\t0x1276: 0x6a15, 0x1277: 0x6a35, 0x1278: 0x6a55, 0x1279: 0x6a75, 0x127a: 0x6a95, 0x127b: 0x6ab5,\n\t0x127c: 0x6ad5, 0x127d: 0x6af5, 0x127e: 0x6b15, 0x127f: 0x6b35,\n\t// Block 0x4a, offset 0x1280\n\t0x1280: 0x7a95, 0x1281: 0x7ab5, 0x1282: 0x7ad5, 0x1283: 0x7af5, 0x1284: 0x7b15, 0x1285: 0x7b35,\n\t0x1286: 0x7b55, 0x1287: 0x7b75, 0x1288: 0x7b95, 0x1289: 0x7bb5, 0x128a: 0x7bd5, 0x128b: 0x7bf5,\n\t0x128c: 0x7c15, 0x128d: 0x7c35, 0x128e: 0x7c55, 0x128f: 0x6ec9, 0x1290: 0x6ef1, 0x1291: 0x6f19,\n\t0x1292: 0x7c75, 0x1293: 0x7c95, 0x1294: 0x7cb5, 0x1295: 0x6f41, 0x1296: 0x6f69, 0x1297: 0x6f91,\n\t0x1298: 0x7cd5, 0x1299: 0x7cf5, 0x129a: 0x0040, 0x129b: 0x0040, 0x129c: 0x0040, 0x129d: 0x0040,\n\t0x129e: 0x0040, 0x129f: 0x0040, 0x12a0: 0x0040, 0x12a1: 0x0040, 0x12a2: 0x0040, 0x12a3: 0x0040,\n\t0x12a4: 0x0040, 0x12a5: 0x0040, 0x12a6: 0x0040, 0x12a7: 0x0040, 0x12a8: 0x0040, 0x12a9: 0x0040,\n\t0x12aa: 0x0040, 0x12ab: 0x0040, 0x12ac: 0x0040, 0x12ad: 0x0040, 0x12ae: 0x0040, 0x12af: 0x0040,\n\t0x12b0: 0x0040, 0x12b1: 0x0040, 0x12b2: 0x0040, 0x12b3: 0x0040, 0x12b4: 0x0040, 0x12b5: 0x0040,\n\t0x12b6: 0x0040, 0x12b7: 0x0040, 0x12b8: 0x0040, 0x12b9: 0x0040, 0x12ba: 0x0040, 0x12bb: 0x0040,\n\t0x12bc: 0x0040, 0x12bd: 0x0040, 0x12be: 0x0040, 0x12bf: 0x0040,\n\t// Block 0x4b, offset 0x12c0\n\t0x12c0: 0x6fb9, 0x12c1: 0x6fd1, 0x12c2: 0x6fe9, 0x12c3: 0x7d15, 0x12c4: 0x7d35, 0x12c5: 0x7001,\n\t0x12c6: 0x7001, 0x12c7: 0x0040, 0x12c8: 0x0040, 0x12c9: 0x0040, 0x12ca: 0x0040, 0x12cb: 0x0040,\n\t0x12cc: 0x0040, 0x12cd: 0x0040, 0x12ce: 0x0040, 0x12cf: 0x0040, 0x12d0: 0x0040, 0x12d1: 0x0040,\n\t0x12d2: 0x0040, 0x12d3: 0x7019, 0x12d4: 0x7041, 0x12d5: 0x7069, 0x12d6: 0x7091, 0x12d7: 0x70b9,\n\t0x12d8: 0x0040, 0x12d9: 0x0040, 0x12da: 0x0040, 0x12db: 0x0040, 0x12dc: 0x0040, 0x12dd: 0x70e1,\n\t0x12de: 0x3308, 0x12df: 0x7109, 0x12e0: 0x7131, 0x12e1: 0x20a9, 0x12e2: 0x20f1, 0x12e3: 0x7149,\n\t0x12e4: 0x7161, 0x12e5: 0x7179, 0x12e6: 0x7191, 0x12e7: 0x71a9, 0x12e8: 0x71c1, 0x12e9: 0x1fb2,\n\t0x12ea: 0x71d9, 0x12eb: 0x7201, 0x12ec: 0x7229, 0x12ed: 0x7261, 0x12ee: 0x7299, 0x12ef: 0x72c1,\n\t0x12f0: 0x72e9, 0x12f1: 0x7311, 0x12f2: 0x7339, 0x12f3: 0x7361, 0x12f4: 0x7389, 0x12f5: 0x73b1,\n\t0x12f6: 0x73d9, 0x12f7: 0x0040, 0x12f8: 0x7401, 0x12f9: 0x7429, 0x12fa: 0x7451, 0x12fb: 0x7479,\n\t0x12fc: 0x74a1, 0x12fd: 0x0040, 0x12fe: 0x74c9, 0x12ff: 0x0040,\n\t// Block 0x4c, offset 0x1300\n\t0x1300: 0x74f1, 0x1301: 0x7519, 0x1302: 0x0040, 0x1303: 0x7541, 0x1304: 0x7569, 0x1305: 0x0040,\n\t0x1306: 0x7591, 0x1307: 0x75b9, 0x1308: 0x75e1, 0x1309: 0x7609, 0x130a: 0x7631, 0x130b: 0x7659,\n\t0x130c: 0x7681, 0x130d: 0x76a9, 0x130e: 0x76d1, 0x130f: 0x76f9, 0x1310: 0x7721, 0x1311: 0x7721,\n\t0x1312: 0x7739, 0x1313: 0x7739, 0x1314: 0x7739, 0x1315: 0x7739, 0x1316: 0x7751, 0x1317: 0x7751,\n\t0x1318: 0x7751, 0x1319: 0x7751, 0x131a: 0x7769, 0x131b: 0x7769, 0x131c: 0x7769, 0x131d: 0x7769,\n\t0x131e: 0x7781, 0x131f: 0x7781, 0x1320: 0x7781, 0x1321: 0x7781, 0x1322: 0x7799, 0x1323: 0x7799,\n\t0x1324: 0x7799, 0x1325: 0x7799, 0x1326: 0x77b1, 0x1327: 0x77b1, 0x1328: 0x77b1, 0x1329: 0x77b1,\n\t0x132a: 0x77c9, 0x132b: 0x77c9, 0x132c: 0x77c9, 0x132d: 0x77c9, 0x132e: 0x77e1, 0x132f: 0x77e1,\n\t0x1330: 0x77e1, 0x1331: 0x77e1, 0x1332: 0x77f9, 0x1333: 0x77f9, 0x1334: 0x77f9, 0x1335: 0x77f9,\n\t0x1336: 0x7811, 0x1337: 0x7811, 0x1338: 0x7811, 0x1339: 0x7811, 0x133a: 0x7829, 0x133b: 0x7829,\n\t0x133c: 0x7829, 0x133d: 0x7829, 0x133e: 0x7841, 0x133f: 0x7841,\n\t// Block 0x4d, offset 0x1340\n\t0x1340: 0x7841, 0x1341: 0x7841, 0x1342: 0x7859, 0x1343: 0x7859, 0x1344: 0x7871, 0x1345: 0x7871,\n\t0x1346: 0x7889, 0x1347: 0x7889, 0x1348: 0x78a1, 0x1349: 0x78a1, 0x134a: 0x78b9, 0x134b: 0x78b9,\n\t0x134c: 0x78d1, 0x134d: 0x78d1, 0x134e: 0x78e9, 0x134f: 0x78e9, 0x1350: 0x78e9, 0x1351: 0x78e9,\n\t0x1352: 0x7901, 0x1353: 0x7901, 0x1354: 0x7901, 0x1355: 0x7901, 0x1356: 0x7919, 0x1357: 0x7919,\n\t0x1358: 0x7919, 0x1359: 0x7919, 0x135a: 0x7931, 0x135b: 0x7931, 0x135c: 0x7931, 0x135d: 0x7931,\n\t0x135e: 0x7949, 0x135f: 0x7949, 0x1360: 0x7961, 0x1361: 0x7961, 0x1362: 0x7961, 0x1363: 0x7961,\n\t0x1364: 0x7979, 0x1365: 0x7979, 0x1366: 0x7991, 0x1367: 0x7991, 0x1368: 0x7991, 0x1369: 0x7991,\n\t0x136a: 0x79a9, 0x136b: 0x79a9, 0x136c: 0x79a9, 0x136d: 0x79a9, 0x136e: 0x79c1, 0x136f: 0x79c1,\n\t0x1370: 0x79d9, 0x1371: 0x79d9, 0x1372: 0x0818, 0x1373: 0x0818, 0x1374: 0x0818, 0x1375: 0x0818,\n\t0x1376: 0x0818, 0x1377: 0x0818, 0x1378: 0x0818, 0x1379: 0x0818, 0x137a: 0x0818, 0x137b: 0x0818,\n\t0x137c: 0x0818, 0x137d: 0x0818, 0x137e: 0x0818, 0x137f: 0x0818,\n\t// Block 0x4e, offset 0x1380\n\t0x1380: 0x0818, 0x1381: 0x0818, 0x1382: 0x0040, 0x1383: 0x0040, 0x1384: 0x0040, 0x1385: 0x0040,\n\t0x1386: 0x0040, 0x1387: 0x0040, 0x1388: 0x0040, 0x1389: 0x0040, 0x138a: 0x0040, 0x138b: 0x0040,\n\t0x138c: 0x0040, 0x138d: 0x0040, 0x138e: 0x0040, 0x138f: 0x0040, 0x1390: 0x0040, 0x1391: 0x0040,\n\t0x1392: 0x0040, 0x1393: 0x79f1, 0x1394: 0x79f1, 0x1395: 0x79f1, 0x1396: 0x79f1, 0x1397: 0x7a09,\n\t0x1398: 0x7a09, 0x1399: 0x7a21, 0x139a: 0x7a21, 0x139b: 0x7a39, 0x139c: 0x7a39, 0x139d: 0x0479,\n\t0x139e: 0x7a51, 0x139f: 0x7a51, 0x13a0: 0x7a69, 0x13a1: 0x7a69, 0x13a2: 0x7a81, 0x13a3: 0x7a81,\n\t0x13a4: 0x7a99, 0x13a5: 0x7a99, 0x13a6: 0x7a99, 0x13a7: 0x7a99, 0x13a8: 0x7ab1, 0x13a9: 0x7ab1,\n\t0x13aa: 0x7ac9, 0x13ab: 0x7ac9, 0x13ac: 0x7af1, 0x13ad: 0x7af1, 0x13ae: 0x7b19, 0x13af: 0x7b19,\n\t0x13b0: 0x7b41, 0x13b1: 0x7b41, 0x13b2: 0x7b69, 0x13b3: 0x7b69, 0x13b4: 0x7b91, 0x13b5: 0x7b91,\n\t0x13b6: 0x7bb9, 0x13b7: 0x7bb9, 0x13b8: 0x7bb9, 0x13b9: 0x7be1, 0x13ba: 0x7be1, 0x13bb: 0x7be1,\n\t0x13bc: 0x7c09, 0x13bd: 0x7c09, 0x13be: 0x7c09, 0x13bf: 0x7c09,\n\t// Block 0x4f, offset 0x13c0\n\t0x13c0: 0x85f9, 0x13c1: 0x8621, 0x13c2: 0x8649, 0x13c3: 0x8671, 0x13c4: 0x8699, 0x13c5: 0x86c1,\n\t0x13c6: 0x86e9, 0x13c7: 0x8711, 0x13c8: 0x8739, 0x13c9: 0x8761, 0x13ca: 0x8789, 0x13cb: 0x87b1,\n\t0x13cc: 0x87d9, 0x13cd: 0x8801, 0x13ce: 0x8829, 0x13cf: 0x8851, 0x13d0: 0x8879, 0x13d1: 0x88a1,\n\t0x13d2: 0x88c9, 0x13d3: 0x88f1, 0x13d4: 0x8919, 0x13d5: 0x8941, 0x13d6: 0x8969, 0x13d7: 0x8991,\n\t0x13d8: 0x89b9, 0x13d9: 0x89e1, 0x13da: 0x8a09, 0x13db: 0x8a31, 0x13dc: 0x8a59, 0x13dd: 0x8a81,\n\t0x13de: 0x8aaa, 0x13df: 0x8ada, 0x13e0: 0x8b0a, 0x13e1: 0x8b3a, 0x13e2: 0x8b6a, 0x13e3: 0x8b9a,\n\t0x13e4: 0x8bc9, 0x13e5: 0x8bf1, 0x13e6: 0x7c71, 0x13e7: 0x8c19, 0x13e8: 0x7be1, 0x13e9: 0x7c99,\n\t0x13ea: 0x8c41, 0x13eb: 0x8c69, 0x13ec: 0x7d39, 0x13ed: 0x8c91, 0x13ee: 0x7d61, 0x13ef: 0x7d89,\n\t0x13f0: 0x8cb9, 0x13f1: 0x8ce1, 0x13f2: 0x7e29, 0x13f3: 0x8d09, 0x13f4: 0x7e51, 0x13f5: 0x7e79,\n\t0x13f6: 0x8d31, 0x13f7: 0x8d59, 0x13f8: 0x7ec9, 0x13f9: 0x8d81, 0x13fa: 0x7ef1, 0x13fb: 0x7f19,\n\t0x13fc: 0x83a1, 0x13fd: 0x83c9, 0x13fe: 0x8441, 0x13ff: 0x8469,\n\t// Block 0x50, offset 0x1400\n\t0x1400: 0x8491, 0x1401: 0x8531, 0x1402: 0x8559, 0x1403: 0x8581, 0x1404: 0x85a9, 0x1405: 0x8649,\n\t0x1406: 0x8671, 0x1407: 0x8699, 0x1408: 0x8da9, 0x1409: 0x8739, 0x140a: 0x8dd1, 0x140b: 0x8df9,\n\t0x140c: 0x8829, 0x140d: 0x8e21, 0x140e: 0x8851, 0x140f: 0x8879, 0x1410: 0x8a81, 0x1411: 0x8e49,\n\t0x1412: 0x8e71, 0x1413: 0x89b9, 0x1414: 0x8e99, 0x1415: 0x89e1, 0x1416: 0x8a09, 0x1417: 0x7c21,\n\t0x1418: 0x7c49, 0x1419: 0x8ec1, 0x141a: 0x7c71, 0x141b: 0x8ee9, 0x141c: 0x7cc1, 0x141d: 0x7ce9,\n\t0x141e: 0x7d11, 0x141f: 0x7d39, 0x1420: 0x8f11, 0x1421: 0x7db1, 0x1422: 0x7dd9, 0x1423: 0x7e01,\n\t0x1424: 0x7e29, 0x1425: 0x8f39, 0x1426: 0x7ec9, 0x1427: 0x7f41, 0x1428: 0x7f69, 0x1429: 0x7f91,\n\t0x142a: 0x7fb9, 0x142b: 0x7fe1, 0x142c: 0x8031, 0x142d: 0x8059, 0x142e: 0x8081, 0x142f: 0x80a9,\n\t0x1430: 0x80d1, 0x1431: 0x80f9, 0x1432: 0x8f61, 0x1433: 0x8121, 0x1434: 0x8149, 0x1435: 0x8171,\n\t0x1436: 0x8199, 0x1437: 0x81c1, 0x1438: 0x81e9, 0x1439: 0x8239, 0x143a: 0x8261, 0x143b: 0x8289,\n\t0x143c: 0x82b1, 0x143d: 0x82d9, 0x143e: 0x8301, 0x143f: 0x8329,\n\t// Block 0x51, offset 0x1440\n\t0x1440: 0x8351, 0x1441: 0x8379, 0x1442: 0x83f1, 0x1443: 0x8419, 0x1444: 0x84b9, 0x1445: 0x84e1,\n\t0x1446: 0x8509, 0x1447: 0x8531, 0x1448: 0x8559, 0x1449: 0x85d1, 0x144a: 0x85f9, 0x144b: 0x8621,\n\t0x144c: 0x8649, 0x144d: 0x8f89, 0x144e: 0x86c1, 0x144f: 0x86e9, 0x1450: 0x8711, 0x1451: 0x8739,\n\t0x1452: 0x87b1, 0x1453: 0x87d9, 0x1454: 0x8801, 0x1455: 0x8829, 0x1456: 0x8fb1, 0x1457: 0x88a1,\n\t0x1458: 0x88c9, 0x1459: 0x8fd9, 0x145a: 0x8941, 0x145b: 0x8969, 0x145c: 0x8991, 0x145d: 0x89b9,\n\t0x145e: 0x9001, 0x145f: 0x7c71, 0x1460: 0x8ee9, 0x1461: 0x7d39, 0x1462: 0x8f11, 0x1463: 0x7e29,\n\t0x1464: 0x8f39, 0x1465: 0x7ec9, 0x1466: 0x9029, 0x1467: 0x80d1, 0x1468: 0x9051, 0x1469: 0x9079,\n\t0x146a: 0x90a1, 0x146b: 0x8531, 0x146c: 0x8559, 0x146d: 0x8649, 0x146e: 0x8829, 0x146f: 0x8fb1,\n\t0x1470: 0x89b9, 0x1471: 0x9001, 0x1472: 0x90c9, 0x1473: 0x9101, 0x1474: 0x9139, 0x1475: 0x9171,\n\t0x1476: 0x9199, 0x1477: 0x91c1, 0x1478: 0x91e9, 0x1479: 0x9211, 0x147a: 0x9239, 0x147b: 0x9261,\n\t0x147c: 0x9289, 0x147d: 0x92b1, 0x147e: 0x92d9, 0x147f: 0x9301,\n\t// Block 0x52, offset 0x1480\n\t0x1480: 0x9329, 0x1481: 0x9351, 0x1482: 0x9379, 0x1483: 0x93a1, 0x1484: 0x93c9, 0x1485: 0x93f1,\n\t0x1486: 0x9419, 0x1487: 0x9441, 0x1488: 0x9469, 0x1489: 0x9491, 0x148a: 0x94b9, 0x148b: 0x94e1,\n\t0x148c: 0x9079, 0x148d: 0x9509, 0x148e: 0x9531, 0x148f: 0x9559, 0x1490: 0x9581, 0x1491: 0x9171,\n\t0x1492: 0x9199, 0x1493: 0x91c1, 0x1494: 0x91e9, 0x1495: 0x9211, 0x1496: 0x9239, 0x1497: 0x9261,\n\t0x1498: 0x9289, 0x1499: 0x92b1, 0x149a: 0x92d9, 0x149b: 0x9301, 0x149c: 0x9329, 0x149d: 0x9351,\n\t0x149e: 0x9379, 0x149f: 0x93a1, 0x14a0: 0x93c9, 0x14a1: 0x93f1, 0x14a2: 0x9419, 0x14a3: 0x9441,\n\t0x14a4: 0x9469, 0x14a5: 0x9491, 0x14a6: 0x94b9, 0x14a7: 0x94e1, 0x14a8: 0x9079, 0x14a9: 0x9509,\n\t0x14aa: 0x9531, 0x14ab: 0x9559, 0x14ac: 0x9581, 0x14ad: 0x9491, 0x14ae: 0x94b9, 0x14af: 0x94e1,\n\t0x14b0: 0x9079, 0x14b1: 0x9051, 0x14b2: 0x90a1, 0x14b3: 0x8211, 0x14b4: 0x8059, 0x14b5: 0x8081,\n\t0x14b6: 0x80a9, 0x14b7: 0x9491, 0x14b8: 0x94b9, 0x14b9: 0x94e1, 0x14ba: 0x8211, 0x14bb: 0x8239,\n\t0x14bc: 0x95a9, 0x14bd: 0x95a9, 0x14be: 0x0018, 0x14bf: 0x0018,\n\t// Block 0x53, offset 0x14c0\n\t0x14c0: 0x0040, 0x14c1: 0x0040, 0x14c2: 0x0040, 0x14c3: 0x0040, 0x14c4: 0x0040, 0x14c5: 0x0040,\n\t0x14c6: 0x0040, 0x14c7: 0x0040, 0x14c8: 0x0040, 0x14c9: 0x0040, 0x14ca: 0x0040, 0x14cb: 0x0040,\n\t0x14cc: 0x0040, 0x14cd: 0x0040, 0x14ce: 0x0040, 0x14cf: 0x0040, 0x14d0: 0x95d1, 0x14d1: 0x9609,\n\t0x14d2: 0x9609, 0x14d3: 0x9641, 0x14d4: 0x9679, 0x14d5: 0x96b1, 0x14d6: 0x96e9, 0x14d7: 0x9721,\n\t0x14d8: 0x9759, 0x14d9: 0x9759, 0x14da: 0x9791, 0x14db: 0x97c9, 0x14dc: 0x9801, 0x14dd: 0x9839,\n\t0x14de: 0x9871, 0x14df: 0x98a9, 0x14e0: 0x98a9, 0x14e1: 0x98e1, 0x14e2: 0x9919, 0x14e3: 0x9919,\n\t0x14e4: 0x9951, 0x14e5: 0x9951, 0x14e6: 0x9989, 0x14e7: 0x99c1, 0x14e8: 0x99c1, 0x14e9: 0x99f9,\n\t0x14ea: 0x9a31, 0x14eb: 0x9a31, 0x14ec: 0x9a69, 0x14ed: 0x9a69, 0x14ee: 0x9aa1, 0x14ef: 0x9ad9,\n\t0x14f0: 0x9ad9, 0x14f1: 0x9b11, 0x14f2: 0x9b11, 0x14f3: 0x9b49, 0x14f4: 0x9b81, 0x14f5: 0x9bb9,\n\t0x14f6: 0x9bf1, 0x14f7: 0x9bf1, 0x14f8: 0x9c29, 0x14f9: 0x9c61, 0x14fa: 0x9c99, 0x14fb: 0x9cd1,\n\t0x14fc: 0x9d09, 0x14fd: 0x9d09, 0x14fe: 0x9d41, 0x14ff: 0x9d79,\n\t// Block 0x54, offset 0x1500\n\t0x1500: 0xa949, 0x1501: 0xa981, 0x1502: 0xa9b9, 0x1503: 0xa8a1, 0x1504: 0x9bb9, 0x1505: 0x9989,\n\t0x1506: 0xa9f1, 0x1507: 0xaa29, 0x1508: 0x0040, 0x1509: 0x0040, 0x150a: 0x0040, 0x150b: 0x0040,\n\t0x150c: 0x0040, 0x150d: 0x0040, 0x150e: 0x0040, 0x150f: 0x0040, 0x1510: 0x0040, 0x1511: 0x0040,\n\t0x1512: 0x0040, 0x1513: 0x0040, 0x1514: 0x0040, 0x1515: 0x0040, 0x1516: 0x0040, 0x1517: 0x0040,\n\t0x1518: 0x0040, 0x1519: 0x0040, 0x151a: 0x0040, 0x151b: 0x0040, 0x151c: 0x0040, 0x151d: 0x0040,\n\t0x151e: 0x0040, 0x151f: 0x0040, 0x1520: 0x0040, 0x1521: 0x0040, 0x1522: 0x0040, 0x1523: 0x0040,\n\t0x1524: 0x0040, 0x1525: 0x0040, 0x1526: 0x0040, 0x1527: 0x0040, 0x1528: 0x0040, 0x1529: 0x0040,\n\t0x152a: 0x0040, 0x152b: 0x0040, 0x152c: 0x0040, 0x152d: 0x0040, 0x152e: 0x0040, 0x152f: 0x0040,\n\t0x1530: 0xaa61, 0x1531: 0xaa99, 0x1532: 0xaad1, 0x1533: 0xab19, 0x1534: 0xab61, 0x1535: 0xaba9,\n\t0x1536: 0xabf1, 0x1537: 0xac39, 0x1538: 0xac81, 0x1539: 0xacc9, 0x153a: 0xad02, 0x153b: 0xae12,\n\t0x153c: 0xae91, 0x153d: 0x0018, 0x153e: 0x0040, 0x153f: 0x0040,\n\t// Block 0x55, offset 0x1540\n\t0x1540: 0x33c0, 0x1541: 0x33c0, 0x1542: 0x33c0, 0x1543: 0x33c0, 0x1544: 0x33c0, 0x1545: 0x33c0,\n\t0x1546: 0x33c0, 0x1547: 0x33c0, 0x1548: 0x33c0, 0x1549: 0x33c0, 0x154a: 0x33c0, 0x154b: 0x33c0,\n\t0x154c: 0x33c0, 0x154d: 0x33c0, 0x154e: 0x33c0, 0x154f: 0x33c0, 0x1550: 0xaeda, 0x1551: 0x7d55,\n\t0x1552: 0x0040, 0x1553: 0xaeea, 0x1554: 0x03c2, 0x1555: 0xaefa, 0x1556: 0xaf0a, 0x1557: 0x7d75,\n\t0x1558: 0x7d95, 0x1559: 0x0040, 0x155a: 0x0040, 0x155b: 0x0040, 0x155c: 0x0040, 0x155d: 0x0040,\n\t0x155e: 0x0040, 0x155f: 0x0040, 0x1560: 0x3308, 0x1561: 0x3308, 0x1562: 0x3308, 0x1563: 0x3308,\n\t0x1564: 0x3308, 0x1565: 0x3308, 0x1566: 0x3308, 0x1567: 0x3308, 0x1568: 0x3308, 0x1569: 0x3308,\n\t0x156a: 0x3308, 0x156b: 0x3308, 0x156c: 0x3308, 0x156d: 0x3308, 0x156e: 0x3308, 0x156f: 0x3308,\n\t0x1570: 0x0040, 0x1571: 0x7db5, 0x1572: 0x7dd5, 0x1573: 0xaf1a, 0x1574: 0xaf1a, 0x1575: 0x1fd2,\n\t0x1576: 0x1fe2, 0x1577: 0xaf2a, 0x1578: 0xaf3a, 0x1579: 0x7df5, 0x157a: 0x7e15, 0x157b: 0x7e35,\n\t0x157c: 0x7df5, 0x157d: 0x7e55, 0x157e: 0x7e75, 0x157f: 0x7e55,\n\t// Block 0x56, offset 0x1580\n\t0x1580: 0x7e95, 0x1581: 0x7eb5, 0x1582: 0x7ed5, 0x1583: 0x7eb5, 0x1584: 0x7ef5, 0x1585: 0x0018,\n\t0x1586: 0x0018, 0x1587: 0xaf4a, 0x1588: 0xaf5a, 0x1589: 0x7f16, 0x158a: 0x7f36, 0x158b: 0x7f56,\n\t0x158c: 0x7f76, 0x158d: 0xaf1a, 0x158e: 0xaf1a, 0x158f: 0xaf1a, 0x1590: 0xaeda, 0x1591: 0x7f95,\n\t0x1592: 0x0040, 0x1593: 0x0040, 0x1594: 0x03c2, 0x1595: 0xaeea, 0x1596: 0xaf0a, 0x1597: 0xaefa,\n\t0x1598: 0x7fb5, 0x1599: 0x1fd2, 0x159a: 0x1fe2, 0x159b: 0xaf2a, 0x159c: 0xaf3a, 0x159d: 0x7e95,\n\t0x159e: 0x7ef5, 0x159f: 0xaf6a, 0x15a0: 0xaf7a, 0x15a1: 0xaf8a, 0x15a2: 0x1fb2, 0x15a3: 0xaf99,\n\t0x15a4: 0xafaa, 0x15a5: 0xafba, 0x15a6: 0x1fc2, 0x15a7: 0x0040, 0x15a8: 0xafca, 0x15a9: 0xafda,\n\t0x15aa: 0xafea, 0x15ab: 0xaffa, 0x15ac: 0x0040, 0x15ad: 0x0040, 0x15ae: 0x0040, 0x15af: 0x0040,\n\t0x15b0: 0x7fd6, 0x15b1: 0xb009, 0x15b2: 0x7ff6, 0x15b3: 0x0808, 0x15b4: 0x8016, 0x15b5: 0x0040,\n\t0x15b6: 0x8036, 0x15b7: 0xb031, 0x15b8: 0x8056, 0x15b9: 0xb059, 0x15ba: 0x8076, 0x15bb: 0xb081,\n\t0x15bc: 0x8096, 0x15bd: 0xb0a9, 0x15be: 0x80b6, 0x15bf: 0xb0d1,\n\t// Block 0x57, offset 0x15c0\n\t0x15c0: 0xb0f9, 0x15c1: 0xb111, 0x15c2: 0xb111, 0x15c3: 0xb129, 0x15c4: 0xb129, 0x15c5: 0xb141,\n\t0x15c6: 0xb141, 0x15c7: 0xb159, 0x15c8: 0xb159, 0x15c9: 0xb171, 0x15ca: 0xb171, 0x15cb: 0xb171,\n\t0x15cc: 0xb171, 0x15cd: 0xb189, 0x15ce: 0xb189, 0x15cf: 0xb1a1, 0x15d0: 0xb1a1, 0x15d1: 0xb1a1,\n\t0x15d2: 0xb1a1, 0x15d3: 0xb1b9, 0x15d4: 0xb1b9, 0x15d5: 0xb1d1, 0x15d6: 0xb1d1, 0x15d7: 0xb1d1,\n\t0x15d8: 0xb1d1, 0x15d9: 0xb1e9, 0x15da: 0xb1e9, 0x15db: 0xb1e9, 0x15dc: 0xb1e9, 0x15dd: 0xb201,\n\t0x15de: 0xb201, 0x15df: 0xb201, 0x15e0: 0xb201, 0x15e1: 0xb219, 0x15e2: 0xb219, 0x15e3: 0xb219,\n\t0x15e4: 0xb219, 0x15e5: 0xb231, 0x15e6: 0xb231, 0x15e7: 0xb231, 0x15e8: 0xb231, 0x15e9: 0xb249,\n\t0x15ea: 0xb249, 0x15eb: 0xb261, 0x15ec: 0xb261, 0x15ed: 0xb279, 0x15ee: 0xb279, 0x15ef: 0xb291,\n\t0x15f0: 0xb291, 0x15f1: 0xb2a9, 0x15f2: 0xb2a9, 0x15f3: 0xb2a9, 0x15f4: 0xb2a9, 0x15f5: 0xb2c1,\n\t0x15f6: 0xb2c1, 0x15f7: 0xb2c1, 0x15f8: 0xb2c1, 0x15f9: 0xb2d9, 0x15fa: 0xb2d9, 0x15fb: 0xb2d9,\n\t0x15fc: 0xb2d9, 0x15fd: 0xb2f1, 0x15fe: 0xb2f1, 0x15ff: 0xb2f1,\n\t// Block 0x58, offset 0x1600\n\t0x1600: 0xb2f1, 0x1601: 0xb309, 0x1602: 0xb309, 0x1603: 0xb309, 0x1604: 0xb309, 0x1605: 0xb321,\n\t0x1606: 0xb321, 0x1607: 0xb321, 0x1608: 0xb321, 0x1609: 0xb339, 0x160a: 0xb339, 0x160b: 0xb339,\n\t0x160c: 0xb339, 0x160d: 0xb351, 0x160e: 0xb351, 0x160f: 0xb351, 0x1610: 0xb351, 0x1611: 0xb369,\n\t0x1612: 0xb369, 0x1613: 0xb369, 0x1614: 0xb369, 0x1615: 0xb381, 0x1616: 0xb381, 0x1617: 0xb381,\n\t0x1618: 0xb381, 0x1619: 0xb399, 0x161a: 0xb399, 0x161b: 0xb399, 0x161c: 0xb399, 0x161d: 0xb3b1,\n\t0x161e: 0xb3b1, 0x161f: 0xb3b1, 0x1620: 0xb3b1, 0x1621: 0xb3c9, 0x1622: 0xb3c9, 0x1623: 0xb3c9,\n\t0x1624: 0xb3c9, 0x1625: 0xb3e1, 0x1626: 0xb3e1, 0x1627: 0xb3e1, 0x1628: 0xb3e1, 0x1629: 0xb3f9,\n\t0x162a: 0xb3f9, 0x162b: 0xb3f9, 0x162c: 0xb3f9, 0x162d: 0xb411, 0x162e: 0xb411, 0x162f: 0x7ab1,\n\t0x1630: 0x7ab1, 0x1631: 0xb429, 0x1632: 0xb429, 0x1633: 0xb429, 0x1634: 0xb429, 0x1635: 0xb441,\n\t0x1636: 0xb441, 0x1637: 0xb469, 0x1638: 0xb469, 0x1639: 0xb491, 0x163a: 0xb491, 0x163b: 0xb4b9,\n\t0x163c: 0xb4b9, 0x163d: 0x0040, 0x163e: 0x0040, 0x163f: 0x03c0,\n\t// Block 0x59, offset 0x1640\n\t0x1640: 0x0040, 0x1641: 0xaefa, 0x1642: 0xb4e2, 0x1643: 0xaf6a, 0x1644: 0xafda, 0x1645: 0xafea,\n\t0x1646: 0xaf7a, 0x1647: 0xb4f2, 0x1648: 0x1fd2, 0x1649: 0x1fe2, 0x164a: 0xaf8a, 0x164b: 0x1fb2,\n\t0x164c: 0xaeda, 0x164d: 0xaf99, 0x164e: 0x29d1, 0x164f: 0xb502, 0x1650: 0x1f41, 0x1651: 0x00c9,\n\t0x1652: 0x0069, 0x1653: 0x0079, 0x1654: 0x1f51, 0x1655: 0x1f61, 0x1656: 0x1f71, 0x1657: 0x1f81,\n\t0x1658: 0x1f91, 0x1659: 0x1fa1, 0x165a: 0xaeea, 0x165b: 0x03c2, 0x165c: 0xafaa, 0x165d: 0x1fc2,\n\t0x165e: 0xafba, 0x165f: 0xaf0a, 0x1660: 0xaffa, 0x1661: 0x0039, 0x1662: 0x0ee9, 0x1663: 0x1159,\n\t0x1664: 0x0ef9, 0x1665: 0x0f09, 0x1666: 0x1199, 0x1667: 0x0f31, 0x1668: 0x0249, 0x1669: 0x0f41,\n\t0x166a: 0x0259, 0x166b: 0x0f51, 0x166c: 0x0359, 0x166d: 0x0f61, 0x166e: 0x0f71, 0x166f: 0x00d9,\n\t0x1670: 0x0f99, 0x1671: 0x2039, 0x1672: 0x0269, 0x1673: 0x01d9, 0x1674: 0x0fa9, 0x1675: 0x0fb9,\n\t0x1676: 0x1089, 0x1677: 0x0279, 0x1678: 0x0369, 0x1679: 0x0289, 0x167a: 0x13d1, 0x167b: 0xaf4a,\n\t0x167c: 0xafca, 0x167d: 0xaf5a, 0x167e: 0xb512, 0x167f: 0xaf1a,\n\t// Block 0x5a, offset 0x1680\n\t0x1680: 0x1caa, 0x1681: 0x0039, 0x1682: 0x0ee9, 0x1683: 0x1159, 0x1684: 0x0ef9, 0x1685: 0x0f09,\n\t0x1686: 0x1199, 0x1687: 0x0f31, 0x1688: 0x0249, 0x1689: 0x0f41, 0x168a: 0x0259, 0x168b: 0x0f51,\n\t0x168c: 0x0359, 0x168d: 0x0f61, 0x168e: 0x0f71, 0x168f: 0x00d9, 0x1690: 0x0f99, 0x1691: 0x2039,\n\t0x1692: 0x0269, 0x1693: 0x01d9, 0x1694: 0x0fa9, 0x1695: 0x0fb9, 0x1696: 0x1089, 0x1697: 0x0279,\n\t0x1698: 0x0369, 0x1699: 0x0289, 0x169a: 0x13d1, 0x169b: 0xaf2a, 0x169c: 0xb522, 0x169d: 0xaf3a,\n\t0x169e: 0xb532, 0x169f: 0x80d5, 0x16a0: 0x80f5, 0x16a1: 0x29d1, 0x16a2: 0x8115, 0x16a3: 0x8115,\n\t0x16a4: 0x8135, 0x16a5: 0x8155, 0x16a6: 0x8175, 0x16a7: 0x8195, 0x16a8: 0x81b5, 0x16a9: 0x81d5,\n\t0x16aa: 0x81f5, 0x16ab: 0x8215, 0x16ac: 0x8235, 0x16ad: 0x8255, 0x16ae: 0x8275, 0x16af: 0x8295,\n\t0x16b0: 0x82b5, 0x16b1: 0x82d5, 0x16b2: 0x82f5, 0x16b3: 0x8315, 0x16b4: 0x8335, 0x16b5: 0x8355,\n\t0x16b6: 0x8375, 0x16b7: 0x8395, 0x16b8: 0x83b5, 0x16b9: 0x83d5, 0x16ba: 0x83f5, 0x16bb: 0x8415,\n\t0x16bc: 0x81b5, 0x16bd: 0x8435, 0x16be: 0x8455, 0x16bf: 0x8215,\n\t// Block 0x5b, offset 0x16c0\n\t0x16c0: 0x8475, 0x16c1: 0x8495, 0x16c2: 0x84b5, 0x16c3: 0x84d5, 0x16c4: 0x84f5, 0x16c5: 0x8515,\n\t0x16c6: 0x8535, 0x16c7: 0x8555, 0x16c8: 0x84d5, 0x16c9: 0x8575, 0x16ca: 0x84d5, 0x16cb: 0x8595,\n\t0x16cc: 0x8595, 0x16cd: 0x85b5, 0x16ce: 0x85b5, 0x16cf: 0x85d5, 0x16d0: 0x8515, 0x16d1: 0x85f5,\n\t0x16d2: 0x8615, 0x16d3: 0x85f5, 0x16d4: 0x8635, 0x16d5: 0x8615, 0x16d6: 0x8655, 0x16d7: 0x8655,\n\t0x16d8: 0x8675, 0x16d9: 0x8675, 0x16da: 0x8695, 0x16db: 0x8695, 0x16dc: 0x8615, 0x16dd: 0x8115,\n\t0x16de: 0x86b5, 0x16df: 0x86d5, 0x16e0: 0x0040, 0x16e1: 0x86f5, 0x16e2: 0x8715, 0x16e3: 0x8735,\n\t0x16e4: 0x8755, 0x16e5: 0x8735, 0x16e6: 0x8775, 0x16e7: 0x8795, 0x16e8: 0x87b5, 0x16e9: 0x87b5,\n\t0x16ea: 0x87d5, 0x16eb: 0x87d5, 0x16ec: 0x87f5, 0x16ed: 0x87f5, 0x16ee: 0x87d5, 0x16ef: 0x87d5,\n\t0x16f0: 0x8815, 0x16f1: 0x8835, 0x16f2: 0x8855, 0x16f3: 0x8875, 0x16f4: 0x8895, 0x16f5: 0x88b5,\n\t0x16f6: 0x88b5, 0x16f7: 0x88b5, 0x16f8: 0x88d5, 0x16f9: 0x88d5, 0x16fa: 0x88d5, 0x16fb: 0x88d5,\n\t0x16fc: 0x87b5, 0x16fd: 0x87b5, 0x16fe: 0x87b5, 0x16ff: 0x0040,\n\t// Block 0x5c, offset 0x1700\n\t0x1700: 0x0040, 0x1701: 0x0040, 0x1702: 0x8715, 0x1703: 0x86f5, 0x1704: 0x88f5, 0x1705: 0x86f5,\n\t0x1706: 0x8715, 0x1707: 0x86f5, 0x1708: 0x0040, 0x1709: 0x0040, 0x170a: 0x8915, 0x170b: 0x8715,\n\t0x170c: 0x8935, 0x170d: 0x88f5, 0x170e: 0x8935, 0x170f: 0x8715, 0x1710: 0x0040, 0x1711: 0x0040,\n\t0x1712: 0x8955, 0x1713: 0x8975, 0x1714: 0x8875, 0x1715: 0x8935, 0x1716: 0x88f5, 0x1717: 0x8935,\n\t0x1718: 0x0040, 0x1719: 0x0040, 0x171a: 0x8995, 0x171b: 0x89b5, 0x171c: 0x8995, 0x171d: 0x0040,\n\t0x171e: 0x0040, 0x171f: 0x0040, 0x1720: 0xb541, 0x1721: 0xb559, 0x1722: 0xb571, 0x1723: 0x89d6,\n\t0x1724: 0xb589, 0x1725: 0xb5a1, 0x1726: 0x89f5, 0x1727: 0x0040, 0x1728: 0x8a15, 0x1729: 0x8a35,\n\t0x172a: 0x8a55, 0x172b: 0x8a35, 0x172c: 0x8a75, 0x172d: 0x8a95, 0x172e: 0x8ab5, 0x172f: 0x0040,\n\t0x1730: 0x0040, 0x1731: 0x0040, 0x1732: 0x0040, 0x1733: 0x0040, 0x1734: 0x0040, 0x1735: 0x0040,\n\t0x1736: 0x0040, 0x1737: 0x0040, 0x1738: 0x0040, 0x1739: 0x0340, 0x173a: 0x0340, 0x173b: 0x0340,\n\t0x173c: 0x0040, 0x173d: 0x0040, 0x173e: 0x0040, 0x173f: 0x0040,\n\t// Block 0x5d, offset 0x1740\n\t0x1740: 0x0a08, 0x1741: 0x0a08, 0x1742: 0x0a08, 0x1743: 0x0a08, 0x1744: 0x0a08, 0x1745: 0x0c08,\n\t0x1746: 0x0808, 0x1747: 0x0c08, 0x1748: 0x0818, 0x1749: 0x0c08, 0x174a: 0x0c08, 0x174b: 0x0808,\n\t0x174c: 0x0808, 0x174d: 0x0908, 0x174e: 0x0c08, 0x174f: 0x0c08, 0x1750: 0x0c08, 0x1751: 0x0c08,\n\t0x1752: 0x0c08, 0x1753: 0x0a08, 0x1754: 0x0a08, 0x1755: 0x0a08, 0x1756: 0x0a08, 0x1757: 0x0908,\n\t0x1758: 0x0a08, 0x1759: 0x0a08, 0x175a: 0x0a08, 0x175b: 0x0a08, 0x175c: 0x0a08, 0x175d: 0x0c08,\n\t0x175e: 0x0a08, 0x175f: 0x0a08, 0x1760: 0x0a08, 0x1761: 0x0c08, 0x1762: 0x0808, 0x1763: 0x0808,\n\t0x1764: 0x0c08, 0x1765: 0x3308, 0x1766: 0x3308, 0x1767: 0x0040, 0x1768: 0x0040, 0x1769: 0x0040,\n\t0x176a: 0x0040, 0x176b: 0x0a18, 0x176c: 0x0a18, 0x176d: 0x0a18, 0x176e: 0x0a18, 0x176f: 0x0c18,\n\t0x1770: 0x0818, 0x1771: 0x0818, 0x1772: 0x0818, 0x1773: 0x0818, 0x1774: 0x0818, 0x1775: 0x0818,\n\t0x1776: 0x0818, 0x1777: 0x0040, 0x1778: 0x0040, 0x1779: 0x0040, 0x177a: 0x0040, 0x177b: 0x0040,\n\t0x177c: 0x0040, 0x177d: 0x0040, 0x177e: 0x0040, 0x177f: 0x0040,\n\t// Block 0x5e, offset 0x1780\n\t0x1780: 0x0a08, 0x1781: 0x0c08, 0x1782: 0x0a08, 0x1783: 0x0c08, 0x1784: 0x0c08, 0x1785: 0x0c08,\n\t0x1786: 0x0a08, 0x1787: 0x0a08, 0x1788: 0x0a08, 0x1789: 0x0c08, 0x178a: 0x0a08, 0x178b: 0x0a08,\n\t0x178c: 0x0c08, 0x178d: 0x0a08, 0x178e: 0x0c08, 0x178f: 0x0c08, 0x1790: 0x0a08, 0x1791: 0x0c08,\n\t0x1792: 0x0040, 0x1793: 0x0040, 0x1794: 0x0040, 0x1795: 0x0040, 0x1796: 0x0040, 0x1797: 0x0040,\n\t0x1798: 0x0040, 0x1799: 0x0818, 0x179a: 0x0818, 0x179b: 0x0818, 0x179c: 0x0818, 0x179d: 0x0040,\n\t0x179e: 0x0040, 0x179f: 0x0040, 0x17a0: 0x0040, 0x17a1: 0x0040, 0x17a2: 0x0040, 0x17a3: 0x0040,\n\t0x17a4: 0x0040, 0x17a5: 0x0040, 0x17a6: 0x0040, 0x17a7: 0x0040, 0x17a8: 0x0040, 0x17a9: 0x0c18,\n\t0x17aa: 0x0c18, 0x17ab: 0x0c18, 0x17ac: 0x0c18, 0x17ad: 0x0a18, 0x17ae: 0x0a18, 0x17af: 0x0818,\n\t0x17b0: 0x0040, 0x17b1: 0x0040, 0x17b2: 0x0040, 0x17b3: 0x0040, 0x17b4: 0x0040, 0x17b5: 0x0040,\n\t0x17b6: 0x0040, 0x17b7: 0x0040, 0x17b8: 0x0040, 0x17b9: 0x0040, 0x17ba: 0x0040, 0x17bb: 0x0040,\n\t0x17bc: 0x0040, 0x17bd: 0x0040, 0x17be: 0x0040, 0x17bf: 0x0040,\n\t// Block 0x5f, offset 0x17c0\n\t0x17c0: 0x3308, 0x17c1: 0x3308, 0x17c2: 0x3008, 0x17c3: 0x3008, 0x17c4: 0x0040, 0x17c5: 0x0008,\n\t0x17c6: 0x0008, 0x17c7: 0x0008, 0x17c8: 0x0008, 0x17c9: 0x0008, 0x17ca: 0x0008, 0x17cb: 0x0008,\n\t0x17cc: 0x0008, 0x17cd: 0x0040, 0x17ce: 0x0040, 0x17cf: 0x0008, 0x17d0: 0x0008, 0x17d1: 0x0040,\n\t0x17d2: 0x0040, 0x17d3: 0x0008, 0x17d4: 0x0008, 0x17d5: 0x0008, 0x17d6: 0x0008, 0x17d7: 0x0008,\n\t0x17d8: 0x0008, 0x17d9: 0x0008, 0x17da: 0x0008, 0x17db: 0x0008, 0x17dc: 0x0008, 0x17dd: 0x0008,\n\t0x17de: 0x0008, 0x17df: 0x0008, 0x17e0: 0x0008, 0x17e1: 0x0008, 0x17e2: 0x0008, 0x17e3: 0x0008,\n\t0x17e4: 0x0008, 0x17e5: 0x0008, 0x17e6: 0x0008, 0x17e7: 0x0008, 0x17e8: 0x0008, 0x17e9: 0x0040,\n\t0x17ea: 0x0008, 0x17eb: 0x0008, 0x17ec: 0x0008, 0x17ed: 0x0008, 0x17ee: 0x0008, 0x17ef: 0x0008,\n\t0x17f0: 0x0008, 0x17f1: 0x0040, 0x17f2: 0x0008, 0x17f3: 0x0008, 0x17f4: 0x0040, 0x17f5: 0x0008,\n\t0x17f6: 0x0008, 0x17f7: 0x0008, 0x17f8: 0x0008, 0x17f9: 0x0008, 0x17fa: 0x0040, 0x17fb: 0x0040,\n\t0x17fc: 0x3308, 0x17fd: 0x0008, 0x17fe: 0x3008, 0x17ff: 0x3008,\n\t// Block 0x60, offset 0x1800\n\t0x1800: 0x3308, 0x1801: 0x3008, 0x1802: 0x3008, 0x1803: 0x3008, 0x1804: 0x3008, 0x1805: 0x0040,\n\t0x1806: 0x0040, 0x1807: 0x3008, 0x1808: 0x3008, 0x1809: 0x0040, 0x180a: 0x0040, 0x180b: 0x3008,\n\t0x180c: 0x3008, 0x180d: 0x3808, 0x180e: 0x0040, 0x180f: 0x0040, 0x1810: 0x0008, 0x1811: 0x0040,\n\t0x1812: 0x0040, 0x1813: 0x0040, 0x1814: 0x0040, 0x1815: 0x0040, 0x1816: 0x0040, 0x1817: 0x3008,\n\t0x1818: 0x0040, 0x1819: 0x0040, 0x181a: 0x0040, 0x181b: 0x0040, 0x181c: 0x0040, 0x181d: 0x0008,\n\t0x181e: 0x0008, 0x181f: 0x0008, 0x1820: 0x0008, 0x1821: 0x0008, 0x1822: 0x3008, 0x1823: 0x3008,\n\t0x1824: 0x0040, 0x1825: 0x0040, 0x1826: 0x3308, 0x1827: 0x3308, 0x1828: 0x3308, 0x1829: 0x3308,\n\t0x182a: 0x3308, 0x182b: 0x3308, 0x182c: 0x3308, 0x182d: 0x0040, 0x182e: 0x0040, 0x182f: 0x0040,\n\t0x1830: 0x3308, 0x1831: 0x3308, 0x1832: 0x3308, 0x1833: 0x3308, 0x1834: 0x3308, 0x1835: 0x0040,\n\t0x1836: 0x0040, 0x1837: 0x0040, 0x1838: 0x0040, 0x1839: 0x0040, 0x183a: 0x0040, 0x183b: 0x0040,\n\t0x183c: 0x0040, 0x183d: 0x0040, 0x183e: 0x0040, 0x183f: 0x0040,\n\t// Block 0x61, offset 0x1840\n\t0x1840: 0x0039, 0x1841: 0x0ee9, 0x1842: 0x1159, 0x1843: 0x0ef9, 0x1844: 0x0f09, 0x1845: 0x1199,\n\t0x1846: 0x0f31, 0x1847: 0x0249, 0x1848: 0x0f41, 0x1849: 0x0259, 0x184a: 0x0f51, 0x184b: 0x0359,\n\t0x184c: 0x0f61, 0x184d: 0x0f71, 0x184e: 0x00d9, 0x184f: 0x0f99, 0x1850: 0x2039, 0x1851: 0x0269,\n\t0x1852: 0x01d9, 0x1853: 0x0fa9, 0x1854: 0x0fb9, 0x1855: 0x1089, 0x1856: 0x0279, 0x1857: 0x0369,\n\t0x1858: 0x0289, 0x1859: 0x13d1, 0x185a: 0x0039, 0x185b: 0x0ee9, 0x185c: 0x1159, 0x185d: 0x0ef9,\n\t0x185e: 0x0f09, 0x185f: 0x1199, 0x1860: 0x0f31, 0x1861: 0x0249, 0x1862: 0x0f41, 0x1863: 0x0259,\n\t0x1864: 0x0f51, 0x1865: 0x0359, 0x1866: 0x0f61, 0x1867: 0x0f71, 0x1868: 0x00d9, 0x1869: 0x0f99,\n\t0x186a: 0x2039, 0x186b: 0x0269, 0x186c: 0x01d9, 0x186d: 0x0fa9, 0x186e: 0x0fb9, 0x186f: 0x1089,\n\t0x1870: 0x0279, 0x1871: 0x0369, 0x1872: 0x0289, 0x1873: 0x13d1, 0x1874: 0x0039, 0x1875: 0x0ee9,\n\t0x1876: 0x1159, 0x1877: 0x0ef9, 0x1878: 0x0f09, 0x1879: 0x1199, 0x187a: 0x0f31, 0x187b: 0x0249,\n\t0x187c: 0x0f41, 0x187d: 0x0259, 0x187e: 0x0f51, 0x187f: 0x0359,\n\t// Block 0x62, offset 0x1880\n\t0x1880: 0x0f61, 0x1881: 0x0f71, 0x1882: 0x00d9, 0x1883: 0x0f99, 0x1884: 0x2039, 0x1885: 0x0269,\n\t0x1886: 0x01d9, 0x1887: 0x0fa9, 0x1888: 0x0fb9, 0x1889: 0x1089, 0x188a: 0x0279, 0x188b: 0x0369,\n\t0x188c: 0x0289, 0x188d: 0x13d1, 0x188e: 0x0039, 0x188f: 0x0ee9, 0x1890: 0x1159, 0x1891: 0x0ef9,\n\t0x1892: 0x0f09, 0x1893: 0x1199, 0x1894: 0x0f31, 0x1895: 0x0040, 0x1896: 0x0f41, 0x1897: 0x0259,\n\t0x1898: 0x0f51, 0x1899: 0x0359, 0x189a: 0x0f61, 0x189b: 0x0f71, 0x189c: 0x00d9, 0x189d: 0x0f99,\n\t0x189e: 0x2039, 0x189f: 0x0269, 0x18a0: 0x01d9, 0x18a1: 0x0fa9, 0x18a2: 0x0fb9, 0x18a3: 0x1089,\n\t0x18a4: 0x0279, 0x18a5: 0x0369, 0x18a6: 0x0289, 0x18a7: 0x13d1, 0x18a8: 0x0039, 0x18a9: 0x0ee9,\n\t0x18aa: 0x1159, 0x18ab: 0x0ef9, 0x18ac: 0x0f09, 0x18ad: 0x1199, 0x18ae: 0x0f31, 0x18af: 0x0249,\n\t0x18b0: 0x0f41, 0x18b1: 0x0259, 0x18b2: 0x0f51, 0x18b3: 0x0359, 0x18b4: 0x0f61, 0x18b5: 0x0f71,\n\t0x18b6: 0x00d9, 0x18b7: 0x0f99, 0x18b8: 0x2039, 0x18b9: 0x0269, 0x18ba: 0x01d9, 0x18bb: 0x0fa9,\n\t0x18bc: 0x0fb9, 0x18bd: 0x1089, 0x18be: 0x0279, 0x18bf: 0x0369,\n\t// Block 0x63, offset 0x18c0\n\t0x18c0: 0x0289, 0x18c1: 0x13d1, 0x18c2: 0x0039, 0x18c3: 0x0ee9, 0x18c4: 0x1159, 0x18c5: 0x0ef9,\n\t0x18c6: 0x0f09, 0x18c7: 0x1199, 0x18c8: 0x0f31, 0x18c9: 0x0249, 0x18ca: 0x0f41, 0x18cb: 0x0259,\n\t0x18cc: 0x0f51, 0x18cd: 0x0359, 0x18ce: 0x0f61, 0x18cf: 0x0f71, 0x18d0: 0x00d9, 0x18d1: 0x0f99,\n\t0x18d2: 0x2039, 0x18d3: 0x0269, 0x18d4: 0x01d9, 0x18d5: 0x0fa9, 0x18d6: 0x0fb9, 0x18d7: 0x1089,\n\t0x18d8: 0x0279, 0x18d9: 0x0369, 0x18da: 0x0289, 0x18db: 0x13d1, 0x18dc: 0x0039, 0x18dd: 0x0040,\n\t0x18de: 0x1159, 0x18df: 0x0ef9, 0x18e0: 0x0040, 0x18e1: 0x0040, 0x18e2: 0x0f31, 0x18e3: 0x0040,\n\t0x18e4: 0x0040, 0x18e5: 0x0259, 0x18e6: 0x0f51, 0x18e7: 0x0040, 0x18e8: 0x0040, 0x18e9: 0x0f71,\n\t0x18ea: 0x00d9, 0x18eb: 0x0f99, 0x18ec: 0x2039, 0x18ed: 0x0040, 0x18ee: 0x01d9, 0x18ef: 0x0fa9,\n\t0x18f0: 0x0fb9, 0x18f1: 0x1089, 0x18f2: 0x0279, 0x18f3: 0x0369, 0x18f4: 0x0289, 0x18f5: 0x13d1,\n\t0x18f6: 0x0039, 0x18f7: 0x0ee9, 0x18f8: 0x1159, 0x18f9: 0x0ef9, 0x18fa: 0x0040, 0x18fb: 0x1199,\n\t0x18fc: 0x0040, 0x18fd: 0x0249, 0x18fe: 0x0f41, 0x18ff: 0x0259,\n\t// Block 0x64, offset 0x1900\n\t0x1900: 0x0f51, 0x1901: 0x0359, 0x1902: 0x0f61, 0x1903: 0x0f71, 0x1904: 0x0040, 0x1905: 0x0f99,\n\t0x1906: 0x2039, 0x1907: 0x0269, 0x1908: 0x01d9, 0x1909: 0x0fa9, 0x190a: 0x0fb9, 0x190b: 0x1089,\n\t0x190c: 0x0279, 0x190d: 0x0369, 0x190e: 0x0289, 0x190f: 0x13d1, 0x1910: 0x0039, 0x1911: 0x0ee9,\n\t0x1912: 0x1159, 0x1913: 0x0ef9, 0x1914: 0x0f09, 0x1915: 0x1199, 0x1916: 0x0f31, 0x1917: 0x0249,\n\t0x1918: 0x0f41, 0x1919: 0x0259, 0x191a: 0x0f51, 0x191b: 0x0359, 0x191c: 0x0f61, 0x191d: 0x0f71,\n\t0x191e: 0x00d9, 0x191f: 0x0f99, 0x1920: 0x2039, 0x1921: 0x0269, 0x1922: 0x01d9, 0x1923: 0x0fa9,\n\t0x1924: 0x0fb9, 0x1925: 0x1089, 0x1926: 0x0279, 0x1927: 0x0369, 0x1928: 0x0289, 0x1929: 0x13d1,\n\t0x192a: 0x0039, 0x192b: 0x0ee9, 0x192c: 0x1159, 0x192d: 0x0ef9, 0x192e: 0x0f09, 0x192f: 0x1199,\n\t0x1930: 0x0f31, 0x1931: 0x0249, 0x1932: 0x0f41, 0x1933: 0x0259, 0x1934: 0x0f51, 0x1935: 0x0359,\n\t0x1936: 0x0f61, 0x1937: 0x0f71, 0x1938: 0x00d9, 0x1939: 0x0f99, 0x193a: 0x2039, 0x193b: 0x0269,\n\t0x193c: 0x01d9, 0x193d: 0x0fa9, 0x193e: 0x0fb9, 0x193f: 0x1089,\n\t// Block 0x65, offset 0x1940\n\t0x1940: 0x0279, 0x1941: 0x0369, 0x1942: 0x0289, 0x1943: 0x13d1, 0x1944: 0x0039, 0x1945: 0x0ee9,\n\t0x1946: 0x0040, 0x1947: 0x0ef9, 0x1948: 0x0f09, 0x1949: 0x1199, 0x194a: 0x0f31, 0x194b: 0x0040,\n\t0x194c: 0x0040, 0x194d: 0x0259, 0x194e: 0x0f51, 0x194f: 0x0359, 0x1950: 0x0f61, 0x1951: 0x0f71,\n\t0x1952: 0x00d9, 0x1953: 0x0f99, 0x1954: 0x2039, 0x1955: 0x0040, 0x1956: 0x01d9, 0x1957: 0x0fa9,\n\t0x1958: 0x0fb9, 0x1959: 0x1089, 0x195a: 0x0279, 0x195b: 0x0369, 0x195c: 0x0289, 0x195d: 0x0040,\n\t0x195e: 0x0039, 0x195f: 0x0ee9, 0x1960: 0x1159, 0x1961: 0x0ef9, 0x1962: 0x0f09, 0x1963: 0x1199,\n\t0x1964: 0x0f31, 0x1965: 0x0249, 0x1966: 0x0f41, 0x1967: 0x0259, 0x1968: 0x0f51, 0x1969: 0x0359,\n\t0x196a: 0x0f61, 0x196b: 0x0f71, 0x196c: 0x00d9, 0x196d: 0x0f99, 0x196e: 0x2039, 0x196f: 0x0269,\n\t0x1970: 0x01d9, 0x1971: 0x0fa9, 0x1972: 0x0fb9, 0x1973: 0x1089, 0x1974: 0x0279, 0x1975: 0x0369,\n\t0x1976: 0x0289, 0x1977: 0x13d1, 0x1978: 0x0039, 0x1979: 0x0ee9, 0x197a: 0x0040, 0x197b: 0x0ef9,\n\t0x197c: 0x0f09, 0x197d: 0x1199, 0x197e: 0x0f31, 0x197f: 0x0040,\n\t// Block 0x66, offset 0x1980\n\t0x1980: 0x0f41, 0x1981: 0x0259, 0x1982: 0x0f51, 0x1983: 0x0359, 0x1984: 0x0f61, 0x1985: 0x0040,\n\t0x1986: 0x00d9, 0x1987: 0x0040, 0x1988: 0x0040, 0x1989: 0x0040, 0x198a: 0x01d9, 0x198b: 0x0fa9,\n\t0x198c: 0x0fb9, 0x198d: 0x1089, 0x198e: 0x0279, 0x198f: 0x0369, 0x1990: 0x0289, 0x1991: 0x0040,\n\t0x1992: 0x0039, 0x1993: 0x0ee9, 0x1994: 0x1159, 0x1995: 0x0ef9, 0x1996: 0x0f09, 0x1997: 0x1199,\n\t0x1998: 0x0f31, 0x1999: 0x0249, 0x199a: 0x0f41, 0x199b: 0x0259, 0x199c: 0x0f51, 0x199d: 0x0359,\n\t0x199e: 0x0f61, 0x199f: 0x0f71, 0x19a0: 0x00d9, 0x19a1: 0x0f99, 0x19a2: 0x2039, 0x19a3: 0x0269,\n\t0x19a4: 0x01d9, 0x19a5: 0x0fa9, 0x19a6: 0x0fb9, 0x19a7: 0x1089, 0x19a8: 0x0279, 0x19a9: 0x0369,\n\t0x19aa: 0x0289, 0x19ab: 0x13d1, 0x19ac: 0x0039, 0x19ad: 0x0ee9, 0x19ae: 0x1159, 0x19af: 0x0ef9,\n\t0x19b0: 0x0f09, 0x19b1: 0x1199, 0x19b2: 0x0f31, 0x19b3: 0x0249, 0x19b4: 0x0f41, 0x19b5: 0x0259,\n\t0x19b6: 0x0f51, 0x19b7: 0x0359, 0x19b8: 0x0f61, 0x19b9: 0x0f71, 0x19ba: 0x00d9, 0x19bb: 0x0f99,\n\t0x19bc: 0x2039, 0x19bd: 0x0269, 0x19be: 0x01d9, 0x19bf: 0x0fa9,\n\t// Block 0x67, offset 0x19c0\n\t0x19c0: 0x0fb9, 0x19c1: 0x1089, 0x19c2: 0x0279, 0x19c3: 0x0369, 0x19c4: 0x0289, 0x19c5: 0x13d1,\n\t0x19c6: 0x0039, 0x19c7: 0x0ee9, 0x19c8: 0x1159, 0x19c9: 0x0ef9, 0x19ca: 0x0f09, 0x19cb: 0x1199,\n\t0x19cc: 0x0f31, 0x19cd: 0x0249, 0x19ce: 0x0f41, 0x19cf: 0x0259, 0x19d0: 0x0f51, 0x19d1: 0x0359,\n\t0x19d2: 0x0f61, 0x19d3: 0x0f71, 0x19d4: 0x00d9, 0x19d5: 0x0f99, 0x19d6: 0x2039, 0x19d7: 0x0269,\n\t0x19d8: 0x01d9, 0x19d9: 0x0fa9, 0x19da: 0x0fb9, 0x19db: 0x1089, 0x19dc: 0x0279, 0x19dd: 0x0369,\n\t0x19de: 0x0289, 0x19df: 0x13d1, 0x19e0: 0x0039, 0x19e1: 0x0ee9, 0x19e2: 0x1159, 0x19e3: 0x0ef9,\n\t0x19e4: 0x0f09, 0x19e5: 0x1199, 0x19e6: 0x0f31, 0x19e7: 0x0249, 0x19e8: 0x0f41, 0x19e9: 0x0259,\n\t0x19ea: 0x0f51, 0x19eb: 0x0359, 0x19ec: 0x0f61, 0x19ed: 0x0f71, 0x19ee: 0x00d9, 0x19ef: 0x0f99,\n\t0x19f0: 0x2039, 0x19f1: 0x0269, 0x19f2: 0x01d9, 0x19f3: 0x0fa9, 0x19f4: 0x0fb9, 0x19f5: 0x1089,\n\t0x19f6: 0x0279, 0x19f7: 0x0369, 0x19f8: 0x0289, 0x19f9: 0x13d1, 0x19fa: 0x0039, 0x19fb: 0x0ee9,\n\t0x19fc: 0x1159, 0x19fd: 0x0ef9, 0x19fe: 0x0f09, 0x19ff: 0x1199,\n\t// Block 0x68, offset 0x1a00\n\t0x1a00: 0x0f31, 0x1a01: 0x0249, 0x1a02: 0x0f41, 0x1a03: 0x0259, 0x1a04: 0x0f51, 0x1a05: 0x0359,\n\t0x1a06: 0x0f61, 0x1a07: 0x0f71, 0x1a08: 0x00d9, 0x1a09: 0x0f99, 0x1a0a: 0x2039, 0x1a0b: 0x0269,\n\t0x1a0c: 0x01d9, 0x1a0d: 0x0fa9, 0x1a0e: 0x0fb9, 0x1a0f: 0x1089, 0x1a10: 0x0279, 0x1a11: 0x0369,\n\t0x1a12: 0x0289, 0x1a13: 0x13d1, 0x1a14: 0x0039, 0x1a15: 0x0ee9, 0x1a16: 0x1159, 0x1a17: 0x0ef9,\n\t0x1a18: 0x0f09, 0x1a19: 0x1199, 0x1a1a: 0x0f31, 0x1a1b: 0x0249, 0x1a1c: 0x0f41, 0x1a1d: 0x0259,\n\t0x1a1e: 0x0f51, 0x1a1f: 0x0359, 0x1a20: 0x0f61, 0x1a21: 0x0f71, 0x1a22: 0x00d9, 0x1a23: 0x0f99,\n\t0x1a24: 0x2039, 0x1a25: 0x0269, 0x1a26: 0x01d9, 0x1a27: 0x0fa9, 0x1a28: 0x0fb9, 0x1a29: 0x1089,\n\t0x1a2a: 0x0279, 0x1a2b: 0x0369, 0x1a2c: 0x0289, 0x1a2d: 0x13d1, 0x1a2e: 0x0039, 0x1a2f: 0x0ee9,\n\t0x1a30: 0x1159, 0x1a31: 0x0ef9, 0x1a32: 0x0f09, 0x1a33: 0x1199, 0x1a34: 0x0f31, 0x1a35: 0x0249,\n\t0x1a36: 0x0f41, 0x1a37: 0x0259, 0x1a38: 0x0f51, 0x1a39: 0x0359, 0x1a3a: 0x0f61, 0x1a3b: 0x0f71,\n\t0x1a3c: 0x00d9, 0x1a3d: 0x0f99, 0x1a3e: 0x2039, 0x1a3f: 0x0269,\n\t// Block 0x69, offset 0x1a40\n\t0x1a40: 0x01d9, 0x1a41: 0x0fa9, 0x1a42: 0x0fb9, 0x1a43: 0x1089, 0x1a44: 0x0279, 0x1a45: 0x0369,\n\t0x1a46: 0x0289, 0x1a47: 0x13d1, 0x1a48: 0x0039, 0x1a49: 0x0ee9, 0x1a4a: 0x1159, 0x1a4b: 0x0ef9,\n\t0x1a4c: 0x0f09, 0x1a4d: 0x1199, 0x1a4e: 0x0f31, 0x1a4f: 0x0249, 0x1a50: 0x0f41, 0x1a51: 0x0259,\n\t0x1a52: 0x0f51, 0x1a53: 0x0359, 0x1a54: 0x0f61, 0x1a55: 0x0f71, 0x1a56: 0x00d9, 0x1a57: 0x0f99,\n\t0x1a58: 0x2039, 0x1a59: 0x0269, 0x1a5a: 0x01d9, 0x1a5b: 0x0fa9, 0x1a5c: 0x0fb9, 0x1a5d: 0x1089,\n\t0x1a5e: 0x0279, 0x1a5f: 0x0369, 0x1a60: 0x0289, 0x1a61: 0x13d1, 0x1a62: 0x0039, 0x1a63: 0x0ee9,\n\t0x1a64: 0x1159, 0x1a65: 0x0ef9, 0x1a66: 0x0f09, 0x1a67: 0x1199, 0x1a68: 0x0f31, 0x1a69: 0x0249,\n\t0x1a6a: 0x0f41, 0x1a6b: 0x0259, 0x1a6c: 0x0f51, 0x1a6d: 0x0359, 0x1a6e: 0x0f61, 0x1a6f: 0x0f71,\n\t0x1a70: 0x00d9, 0x1a71: 0x0f99, 0x1a72: 0x2039, 0x1a73: 0x0269, 0x1a74: 0x01d9, 0x1a75: 0x0fa9,\n\t0x1a76: 0x0fb9, 0x1a77: 0x1089, 0x1a78: 0x0279, 0x1a79: 0x0369, 0x1a7a: 0x0289, 0x1a7b: 0x13d1,\n\t0x1a7c: 0x0039, 0x1a7d: 0x0ee9, 0x1a7e: 0x1159, 0x1a7f: 0x0ef9,\n\t// Block 0x6a, offset 0x1a80\n\t0x1a80: 0x0f09, 0x1a81: 0x1199, 0x1a82: 0x0f31, 0x1a83: 0x0249, 0x1a84: 0x0f41, 0x1a85: 0x0259,\n\t0x1a86: 0x0f51, 0x1a87: 0x0359, 0x1a88: 0x0f61, 0x1a89: 0x0f71, 0x1a8a: 0x00d9, 0x1a8b: 0x0f99,\n\t0x1a8c: 0x2039, 0x1a8d: 0x0269, 0x1a8e: 0x01d9, 0x1a8f: 0x0fa9, 0x1a90: 0x0fb9, 0x1a91: 0x1089,\n\t0x1a92: 0x0279, 0x1a93: 0x0369, 0x1a94: 0x0289, 0x1a95: 0x13d1, 0x1a96: 0x0039, 0x1a97: 0x0ee9,\n\t0x1a98: 0x1159, 0x1a99: 0x0ef9, 0x1a9a: 0x0f09, 0x1a9b: 0x1199, 0x1a9c: 0x0f31, 0x1a9d: 0x0249,\n\t0x1a9e: 0x0f41, 0x1a9f: 0x0259, 0x1aa0: 0x0f51, 0x1aa1: 0x0359, 0x1aa2: 0x0f61, 0x1aa3: 0x0f71,\n\t0x1aa4: 0x00d9, 0x1aa5: 0x0f99, 0x1aa6: 0x2039, 0x1aa7: 0x0269, 0x1aa8: 0x01d9, 0x1aa9: 0x0fa9,\n\t0x1aaa: 0x0fb9, 0x1aab: 0x1089, 0x1aac: 0x0279, 0x1aad: 0x0369, 0x1aae: 0x0289, 0x1aaf: 0x13d1,\n\t0x1ab0: 0x0039, 0x1ab1: 0x0ee9, 0x1ab2: 0x1159, 0x1ab3: 0x0ef9, 0x1ab4: 0x0f09, 0x1ab5: 0x1199,\n\t0x1ab6: 0x0f31, 0x1ab7: 0x0249, 0x1ab8: 0x0f41, 0x1ab9: 0x0259, 0x1aba: 0x0f51, 0x1abb: 0x0359,\n\t0x1abc: 0x0f61, 0x1abd: 0x0f71, 0x1abe: 0x00d9, 0x1abf: 0x0f99,\n\t// Block 0x6b, offset 0x1ac0\n\t0x1ac0: 0x2039, 0x1ac1: 0x0269, 0x1ac2: 0x01d9, 0x1ac3: 0x0fa9, 0x1ac4: 0x0fb9, 0x1ac5: 0x1089,\n\t0x1ac6: 0x0279, 0x1ac7: 0x0369, 0x1ac8: 0x0289, 0x1ac9: 0x13d1, 0x1aca: 0x0039, 0x1acb: 0x0ee9,\n\t0x1acc: 0x1159, 0x1acd: 0x0ef9, 0x1ace: 0x0f09, 0x1acf: 0x1199, 0x1ad0: 0x0f31, 0x1ad1: 0x0249,\n\t0x1ad2: 0x0f41, 0x1ad3: 0x0259, 0x1ad4: 0x0f51, 0x1ad5: 0x0359, 0x1ad6: 0x0f61, 0x1ad7: 0x0f71,\n\t0x1ad8: 0x00d9, 0x1ad9: 0x0f99, 0x1ada: 0x2039, 0x1adb: 0x0269, 0x1adc: 0x01d9, 0x1add: 0x0fa9,\n\t0x1ade: 0x0fb9, 0x1adf: 0x1089, 0x1ae0: 0x0279, 0x1ae1: 0x0369, 0x1ae2: 0x0289, 0x1ae3: 0x13d1,\n\t0x1ae4: 0xba81, 0x1ae5: 0xba99, 0x1ae6: 0x0040, 0x1ae7: 0x0040, 0x1ae8: 0xbab1, 0x1ae9: 0x1099,\n\t0x1aea: 0x10b1, 0x1aeb: 0x10c9, 0x1aec: 0xbac9, 0x1aed: 0xbae1, 0x1aee: 0xbaf9, 0x1aef: 0x1429,\n\t0x1af0: 0x1a31, 0x1af1: 0xbb11, 0x1af2: 0xbb29, 0x1af3: 0xbb41, 0x1af4: 0xbb59, 0x1af5: 0xbb71,\n\t0x1af6: 0xbb89, 0x1af7: 0x2109, 0x1af8: 0x1111, 0x1af9: 0x1429, 0x1afa: 0xbba1, 0x1afb: 0xbbb9,\n\t0x1afc: 0xbbd1, 0x1afd: 0x10e1, 0x1afe: 0x10f9, 0x1aff: 0xbbe9,\n\t// Block 0x6c, offset 0x1b00\n\t0x1b00: 0x2079, 0x1b01: 0xbc01, 0x1b02: 0xbab1, 0x1b03: 0x1099, 0x1b04: 0x10b1, 0x1b05: 0x10c9,\n\t0x1b06: 0xbac9, 0x1b07: 0xbae1, 0x1b08: 0xbaf9, 0x1b09: 0x1429, 0x1b0a: 0x1a31, 0x1b0b: 0xbb11,\n\t0x1b0c: 0xbb29, 0x1b0d: 0xbb41, 0x1b0e: 0xbb59, 0x1b0f: 0xbb71, 0x1b10: 0xbb89, 0x1b11: 0x2109,\n\t0x1b12: 0x1111, 0x1b13: 0xbba1, 0x1b14: 0xbba1, 0x1b15: 0xbbb9, 0x1b16: 0xbbd1, 0x1b17: 0x10e1,\n\t0x1b18: 0x10f9, 0x1b19: 0xbbe9, 0x1b1a: 0x2079, 0x1b1b: 0xbc21, 0x1b1c: 0xbac9, 0x1b1d: 0x1429,\n\t0x1b1e: 0xbb11, 0x1b1f: 0x10e1, 0x1b20: 0x1111, 0x1b21: 0x2109, 0x1b22: 0xbab1, 0x1b23: 0x1099,\n\t0x1b24: 0x10b1, 0x1b25: 0x10c9, 0x1b26: 0xbac9, 0x1b27: 0xbae1, 0x1b28: 0xbaf9, 0x1b29: 0x1429,\n\t0x1b2a: 0x1a31, 0x1b2b: 0xbb11, 0x1b2c: 0xbb29, 0x1b2d: 0xbb41, 0x1b2e: 0xbb59, 0x1b2f: 0xbb71,\n\t0x1b30: 0xbb89, 0x1b31: 0x2109, 0x1b32: 0x1111, 0x1b33: 0x1429, 0x1b34: 0xbba1, 0x1b35: 0xbbb9,\n\t0x1b36: 0xbbd1, 0x1b37: 0x10e1, 0x1b38: 0x10f9, 0x1b39: 0xbbe9, 0x1b3a: 0x2079, 0x1b3b: 0xbc01,\n\t0x1b3c: 0xbab1, 0x1b3d: 0x1099, 0x1b3e: 0x10b1, 0x1b3f: 0x10c9,\n\t// Block 0x6d, offset 0x1b40\n\t0x1b40: 0xbac9, 0x1b41: 0xbae1, 0x1b42: 0xbaf9, 0x1b43: 0x1429, 0x1b44: 0x1a31, 0x1b45: 0xbb11,\n\t0x1b46: 0xbb29, 0x1b47: 0xbb41, 0x1b48: 0xbb59, 0x1b49: 0xbb71, 0x1b4a: 0xbb89, 0x1b4b: 0x2109,\n\t0x1b4c: 0x1111, 0x1b4d: 0xbba1, 0x1b4e: 0xbba1, 0x1b4f: 0xbbb9, 0x1b50: 0xbbd1, 0x1b51: 0x10e1,\n\t0x1b52: 0x10f9, 0x1b53: 0xbbe9, 0x1b54: 0x2079, 0x1b55: 0xbc21, 0x1b56: 0xbac9, 0x1b57: 0x1429,\n\t0x1b58: 0xbb11, 0x1b59: 0x10e1, 0x1b5a: 0x1111, 0x1b5b: 0x2109, 0x1b5c: 0xbab1, 0x1b5d: 0x1099,\n\t0x1b5e: 0x10b1, 0x1b5f: 0x10c9, 0x1b60: 0xbac9, 0x1b61: 0xbae1, 0x1b62: 0xbaf9, 0x1b63: 0x1429,\n\t0x1b64: 0x1a31, 0x1b65: 0xbb11, 0x1b66: 0xbb29, 0x1b67: 0xbb41, 0x1b68: 0xbb59, 0x1b69: 0xbb71,\n\t0x1b6a: 0xbb89, 0x1b6b: 0x2109, 0x1b6c: 0x1111, 0x1b6d: 0x1429, 0x1b6e: 0xbba1, 0x1b6f: 0xbbb9,\n\t0x1b70: 0xbbd1, 0x1b71: 0x10e1, 0x1b72: 0x10f9, 0x1b73: 0xbbe9, 0x1b74: 0x2079, 0x1b75: 0xbc01,\n\t0x1b76: 0xbab1, 0x1b77: 0x1099, 0x1b78: 0x10b1, 0x1b79: 0x10c9, 0x1b7a: 0xbac9, 0x1b7b: 0xbae1,\n\t0x1b7c: 0xbaf9, 0x1b7d: 0x1429, 0x1b7e: 0x1a31, 0x1b7f: 0xbb11,\n\t// Block 0x6e, offset 0x1b80\n\t0x1b80: 0xbb29, 0x1b81: 0xbb41, 0x1b82: 0xbb59, 0x1b83: 0xbb71, 0x1b84: 0xbb89, 0x1b85: 0x2109,\n\t0x1b86: 0x1111, 0x1b87: 0xbba1, 0x1b88: 0xbba1, 0x1b89: 0xbbb9, 0x1b8a: 0xbbd1, 0x1b8b: 0x10e1,\n\t0x1b8c: 0x10f9, 0x1b8d: 0xbbe9, 0x1b8e: 0x2079, 0x1b8f: 0xbc21, 0x1b90: 0xbac9, 0x1b91: 0x1429,\n\t0x1b92: 0xbb11, 0x1b93: 0x10e1, 0x1b94: 0x1111, 0x1b95: 0x2109, 0x1b96: 0xbab1, 0x1b97: 0x1099,\n\t0x1b98: 0x10b1, 0x1b99: 0x10c9, 0x1b9a: 0xbac9, 0x1b9b: 0xbae1, 0x1b9c: 0xbaf9, 0x1b9d: 0x1429,\n\t0x1b9e: 0x1a31, 0x1b9f: 0xbb11, 0x1ba0: 0xbb29, 0x1ba1: 0xbb41, 0x1ba2: 0xbb59, 0x1ba3: 0xbb71,\n\t0x1ba4: 0xbb89, 0x1ba5: 0x2109, 0x1ba6: 0x1111, 0x1ba7: 0x1429, 0x1ba8: 0xbba1, 0x1ba9: 0xbbb9,\n\t0x1baa: 0xbbd1, 0x1bab: 0x10e1, 0x1bac: 0x10f9, 0x1bad: 0xbbe9, 0x1bae: 0x2079, 0x1baf: 0xbc01,\n\t0x1bb0: 0xbab1, 0x1bb1: 0x1099, 0x1bb2: 0x10b1, 0x1bb3: 0x10c9, 0x1bb4: 0xbac9, 0x1bb5: 0xbae1,\n\t0x1bb6: 0xbaf9, 0x1bb7: 0x1429, 0x1bb8: 0x1a31, 0x1bb9: 0xbb11, 0x1bba: 0xbb29, 0x1bbb: 0xbb41,\n\t0x1bbc: 0xbb59, 0x1bbd: 0xbb71, 0x1bbe: 0xbb89, 0x1bbf: 0x2109,\n\t// Block 0x6f, offset 0x1bc0\n\t0x1bc0: 0x1111, 0x1bc1: 0xbba1, 0x1bc2: 0xbba1, 0x1bc3: 0xbbb9, 0x1bc4: 0xbbd1, 0x1bc5: 0x10e1,\n\t0x1bc6: 0x10f9, 0x1bc7: 0xbbe9, 0x1bc8: 0x2079, 0x1bc9: 0xbc21, 0x1bca: 0xbac9, 0x1bcb: 0x1429,\n\t0x1bcc: 0xbb11, 0x1bcd: 0x10e1, 0x1bce: 0x1111, 0x1bcf: 0x2109, 0x1bd0: 0xbab1, 0x1bd1: 0x1099,\n\t0x1bd2: 0x10b1, 0x1bd3: 0x10c9, 0x1bd4: 0xbac9, 0x1bd5: 0xbae1, 0x1bd6: 0xbaf9, 0x1bd7: 0x1429,\n\t0x1bd8: 0x1a31, 0x1bd9: 0xbb11, 0x1bda: 0xbb29, 0x1bdb: 0xbb41, 0x1bdc: 0xbb59, 0x1bdd: 0xbb71,\n\t0x1bde: 0xbb89, 0x1bdf: 0x2109, 0x1be0: 0x1111, 0x1be1: 0x1429, 0x1be2: 0xbba1, 0x1be3: 0xbbb9,\n\t0x1be4: 0xbbd1, 0x1be5: 0x10e1, 0x1be6: 0x10f9, 0x1be7: 0xbbe9, 0x1be8: 0x2079, 0x1be9: 0xbc01,\n\t0x1bea: 0xbab1, 0x1beb: 0x1099, 0x1bec: 0x10b1, 0x1bed: 0x10c9, 0x1bee: 0xbac9, 0x1bef: 0xbae1,\n\t0x1bf0: 0xbaf9, 0x1bf1: 0x1429, 0x1bf2: 0x1a31, 0x1bf3: 0xbb11, 0x1bf4: 0xbb29, 0x1bf5: 0xbb41,\n\t0x1bf6: 0xbb59, 0x1bf7: 0xbb71, 0x1bf8: 0xbb89, 0x1bf9: 0x2109, 0x1bfa: 0x1111, 0x1bfb: 0xbba1,\n\t0x1bfc: 0xbba1, 0x1bfd: 0xbbb9, 0x1bfe: 0xbbd1, 0x1bff: 0x10e1,\n\t// Block 0x70, offset 0x1c00\n\t0x1c00: 0x10f9, 0x1c01: 0xbbe9, 0x1c02: 0x2079, 0x1c03: 0xbc21, 0x1c04: 0xbac9, 0x1c05: 0x1429,\n\t0x1c06: 0xbb11, 0x1c07: 0x10e1, 0x1c08: 0x1111, 0x1c09: 0x2109, 0x1c0a: 0xbc41, 0x1c0b: 0xbc41,\n\t0x1c0c: 0x0040, 0x1c0d: 0x0040, 0x1c0e: 0x1f41, 0x1c0f: 0x00c9, 0x1c10: 0x0069, 0x1c11: 0x0079,\n\t0x1c12: 0x1f51, 0x1c13: 0x1f61, 0x1c14: 0x1f71, 0x1c15: 0x1f81, 0x1c16: 0x1f91, 0x1c17: 0x1fa1,\n\t0x1c18: 0x1f41, 0x1c19: 0x00c9, 0x1c1a: 0x0069, 0x1c1b: 0x0079, 0x1c1c: 0x1f51, 0x1c1d: 0x1f61,\n\t0x1c1e: 0x1f71, 0x1c1f: 0x1f81, 0x1c20: 0x1f91, 0x1c21: 0x1fa1, 0x1c22: 0x1f41, 0x1c23: 0x00c9,\n\t0x1c24: 0x0069, 0x1c25: 0x0079, 0x1c26: 0x1f51, 0x1c27: 0x1f61, 0x1c28: 0x1f71, 0x1c29: 0x1f81,\n\t0x1c2a: 0x1f91, 0x1c2b: 0x1fa1, 0x1c2c: 0x1f41, 0x1c2d: 0x00c9, 0x1c2e: 0x0069, 0x1c2f: 0x0079,\n\t0x1c30: 0x1f51, 0x1c31: 0x1f61, 0x1c32: 0x1f71, 0x1c33: 0x1f81, 0x1c34: 0x1f91, 0x1c35: 0x1fa1,\n\t0x1c36: 0x1f41, 0x1c37: 0x00c9, 0x1c38: 0x0069, 0x1c39: 0x0079, 0x1c3a: 0x1f51, 0x1c3b: 0x1f61,\n\t0x1c3c: 0x1f71, 0x1c3d: 0x1f81, 0x1c3e: 0x1f91, 0x1c3f: 0x1fa1,\n\t// Block 0x71, offset 0x1c40\n\t0x1c40: 0xe115, 0x1c41: 0xe115, 0x1c42: 0xe135, 0x1c43: 0xe135, 0x1c44: 0xe115, 0x1c45: 0xe115,\n\t0x1c46: 0xe175, 0x1c47: 0xe175, 0x1c48: 0xe115, 0x1c49: 0xe115, 0x1c4a: 0xe135, 0x1c4b: 0xe135,\n\t0x1c4c: 0xe115, 0x1c4d: 0xe115, 0x1c4e: 0xe1f5, 0x1c4f: 0xe1f5, 0x1c50: 0xe115, 0x1c51: 0xe115,\n\t0x1c52: 0xe135, 0x1c53: 0xe135, 0x1c54: 0xe115, 0x1c55: 0xe115, 0x1c56: 0xe175, 0x1c57: 0xe175,\n\t0x1c58: 0xe115, 0x1c59: 0xe115, 0x1c5a: 0xe135, 0x1c5b: 0xe135, 0x1c5c: 0xe115, 0x1c5d: 0xe115,\n\t0x1c5e: 0x8b05, 0x1c5f: 0x8b05, 0x1c60: 0x04b5, 0x1c61: 0x04b5, 0x1c62: 0x0a08, 0x1c63: 0x0a08,\n\t0x1c64: 0x0a08, 0x1c65: 0x0a08, 0x1c66: 0x0a08, 0x1c67: 0x0a08, 0x1c68: 0x0a08, 0x1c69: 0x0a08,\n\t0x1c6a: 0x0a08, 0x1c6b: 0x0a08, 0x1c6c: 0x0a08, 0x1c6d: 0x0a08, 0x1c6e: 0x0a08, 0x1c6f: 0x0a08,\n\t0x1c70: 0x0a08, 0x1c71: 0x0a08, 0x1c72: 0x0a08, 0x1c73: 0x0a08, 0x1c74: 0x0a08, 0x1c75: 0x0a08,\n\t0x1c76: 0x0a08, 0x1c77: 0x0a08, 0x1c78: 0x0a08, 0x1c79: 0x0a08, 0x1c7a: 0x0a08, 0x1c7b: 0x0a08,\n\t0x1c7c: 0x0a08, 0x1c7d: 0x0a08, 0x1c7e: 0x0a08, 0x1c7f: 0x0a08,\n\t// Block 0x72, offset 0x1c80\n\t0x1c80: 0xb189, 0x1c81: 0xb1a1, 0x1c82: 0xb201, 0x1c83: 0xb249, 0x1c84: 0x0040, 0x1c85: 0xb411,\n\t0x1c86: 0xb291, 0x1c87: 0xb219, 0x1c88: 0xb309, 0x1c89: 0xb429, 0x1c8a: 0xb399, 0x1c8b: 0xb3b1,\n\t0x1c8c: 0xb3c9, 0x1c8d: 0xb3e1, 0x1c8e: 0xb2a9, 0x1c8f: 0xb339, 0x1c90: 0xb369, 0x1c91: 0xb2d9,\n\t0x1c92: 0xb381, 0x1c93: 0xb279, 0x1c94: 0xb2c1, 0x1c95: 0xb1d1, 0x1c96: 0xb1e9, 0x1c97: 0xb231,\n\t0x1c98: 0xb261, 0x1c99: 0xb2f1, 0x1c9a: 0xb321, 0x1c9b: 0xb351, 0x1c9c: 0xbc59, 0x1c9d: 0x7949,\n\t0x1c9e: 0xbc71, 0x1c9f: 0xbc89, 0x1ca0: 0x0040, 0x1ca1: 0xb1a1, 0x1ca2: 0xb201, 0x1ca3: 0x0040,\n\t0x1ca4: 0xb3f9, 0x1ca5: 0x0040, 0x1ca6: 0x0040, 0x1ca7: 0xb219, 0x1ca8: 0x0040, 0x1ca9: 0xb429,\n\t0x1caa: 0xb399, 0x1cab: 0xb3b1, 0x1cac: 0xb3c9, 0x1cad: 0xb3e1, 0x1cae: 0xb2a9, 0x1caf: 0xb339,\n\t0x1cb0: 0xb369, 0x1cb1: 0xb2d9, 0x1cb2: 0xb381, 0x1cb3: 0x0040, 0x1cb4: 0xb2c1, 0x1cb5: 0xb1d1,\n\t0x1cb6: 0xb1e9, 0x1cb7: 0xb231, 0x1cb8: 0x0040, 0x1cb9: 0xb2f1, 0x1cba: 0x0040, 0x1cbb: 0xb351,\n\t0x1cbc: 0x0040, 0x1cbd: 0x0040, 0x1cbe: 0x0040, 0x1cbf: 0x0040,\n\t// Block 0x73, offset 0x1cc0\n\t0x1cc0: 0x0040, 0x1cc1: 0x0040, 0x1cc2: 0xb201, 0x1cc3: 0x0040, 0x1cc4: 0x0040, 0x1cc5: 0x0040,\n\t0x1cc6: 0x0040, 0x1cc7: 0xb219, 0x1cc8: 0x0040, 0x1cc9: 0xb429, 0x1cca: 0x0040, 0x1ccb: 0xb3b1,\n\t0x1ccc: 0x0040, 0x1ccd: 0xb3e1, 0x1cce: 0xb2a9, 0x1ccf: 0xb339, 0x1cd0: 0x0040, 0x1cd1: 0xb2d9,\n\t0x1cd2: 0xb381, 0x1cd3: 0x0040, 0x1cd4: 0xb2c1, 0x1cd5: 0x0040, 0x1cd6: 0x0040, 0x1cd7: 0xb231,\n\t0x1cd8: 0x0040, 0x1cd9: 0xb2f1, 0x1cda: 0x0040, 0x1cdb: 0xb351, 0x1cdc: 0x0040, 0x1cdd: 0x7949,\n\t0x1cde: 0x0040, 0x1cdf: 0xbc89, 0x1ce0: 0x0040, 0x1ce1: 0xb1a1, 0x1ce2: 0xb201, 0x1ce3: 0x0040,\n\t0x1ce4: 0xb3f9, 0x1ce5: 0x0040, 0x1ce6: 0x0040, 0x1ce7: 0xb219, 0x1ce8: 0xb309, 0x1ce9: 0xb429,\n\t0x1cea: 0xb399, 0x1ceb: 0x0040, 0x1cec: 0xb3c9, 0x1ced: 0xb3e1, 0x1cee: 0xb2a9, 0x1cef: 0xb339,\n\t0x1cf0: 0xb369, 0x1cf1: 0xb2d9, 0x1cf2: 0xb381, 0x1cf3: 0x0040, 0x1cf4: 0xb2c1, 0x1cf5: 0xb1d1,\n\t0x1cf6: 0xb1e9, 0x1cf7: 0xb231, 0x1cf8: 0x0040, 0x1cf9: 0xb2f1, 0x1cfa: 0xb321, 0x1cfb: 0xb351,\n\t0x1cfc: 0xbc59, 0x1cfd: 0x0040, 0x1cfe: 0xbc71, 0x1cff: 0x0040,\n\t// Block 0x74, offset 0x1d00\n\t0x1d00: 0xb189, 0x1d01: 0xb1a1, 0x1d02: 0xb201, 0x1d03: 0xb249, 0x1d04: 0xb3f9, 0x1d05: 0xb411,\n\t0x1d06: 0xb291, 0x1d07: 0xb219, 0x1d08: 0xb309, 0x1d09: 0xb429, 0x1d0a: 0x0040, 0x1d0b: 0xb3b1,\n\t0x1d0c: 0xb3c9, 0x1d0d: 0xb3e1, 0x1d0e: 0xb2a9, 0x1d0f: 0xb339, 0x1d10: 0xb369, 0x1d11: 0xb2d9,\n\t0x1d12: 0xb381, 0x1d13: 0xb279, 0x1d14: 0xb2c1, 0x1d15: 0xb1d1, 0x1d16: 0xb1e9, 0x1d17: 0xb231,\n\t0x1d18: 0xb261, 0x1d19: 0xb2f1, 0x1d1a: 0xb321, 0x1d1b: 0xb351, 0x1d1c: 0x0040, 0x1d1d: 0x0040,\n\t0x1d1e: 0x0040, 0x1d1f: 0x0040, 0x1d20: 0x0040, 0x1d21: 0xb1a1, 0x1d22: 0xb201, 0x1d23: 0xb249,\n\t0x1d24: 0x0040, 0x1d25: 0xb411, 0x1d26: 0xb291, 0x1d27: 0xb219, 0x1d28: 0xb309, 0x1d29: 0xb429,\n\t0x1d2a: 0x0040, 0x1d2b: 0xb3b1, 0x1d2c: 0xb3c9, 0x1d2d: 0xb3e1, 0x1d2e: 0xb2a9, 0x1d2f: 0xb339,\n\t0x1d30: 0xb369, 0x1d31: 0xb2d9, 0x1d32: 0xb381, 0x1d33: 0xb279, 0x1d34: 0xb2c1, 0x1d35: 0xb1d1,\n\t0x1d36: 0xb1e9, 0x1d37: 0xb231, 0x1d38: 0xb261, 0x1d39: 0xb2f1, 0x1d3a: 0xb321, 0x1d3b: 0xb351,\n\t0x1d3c: 0x0040, 0x1d3d: 0x0040, 0x1d3e: 0x0040, 0x1d3f: 0x0040,\n\t// Block 0x75, offset 0x1d40\n\t0x1d40: 0x0040, 0x1d41: 0xbca2, 0x1d42: 0xbcba, 0x1d43: 0xbcd2, 0x1d44: 0xbcea, 0x1d45: 0xbd02,\n\t0x1d46: 0xbd1a, 0x1d47: 0xbd32, 0x1d48: 0xbd4a, 0x1d49: 0xbd62, 0x1d4a: 0xbd7a, 0x1d4b: 0x0018,\n\t0x1d4c: 0x0018, 0x1d4d: 0x0040, 0x1d4e: 0x0040, 0x1d4f: 0x0040, 0x1d50: 0xbd92, 0x1d51: 0xbdb2,\n\t0x1d52: 0xbdd2, 0x1d53: 0xbdf2, 0x1d54: 0xbe12, 0x1d55: 0xbe32, 0x1d56: 0xbe52, 0x1d57: 0xbe72,\n\t0x1d58: 0xbe92, 0x1d59: 0xbeb2, 0x1d5a: 0xbed2, 0x1d5b: 0xbef2, 0x1d5c: 0xbf12, 0x1d5d: 0xbf32,\n\t0x1d5e: 0xbf52, 0x1d5f: 0xbf72, 0x1d60: 0xbf92, 0x1d61: 0xbfb2, 0x1d62: 0xbfd2, 0x1d63: 0xbff2,\n\t0x1d64: 0xc012, 0x1d65: 0xc032, 0x1d66: 0xc052, 0x1d67: 0xc072, 0x1d68: 0xc092, 0x1d69: 0xc0b2,\n\t0x1d6a: 0xc0d1, 0x1d6b: 0x1159, 0x1d6c: 0x0269, 0x1d6d: 0x6671, 0x1d6e: 0xc111, 0x1d6f: 0x0040,\n\t0x1d70: 0x0039, 0x1d71: 0x0ee9, 0x1d72: 0x1159, 0x1d73: 0x0ef9, 0x1d74: 0x0f09, 0x1d75: 0x1199,\n\t0x1d76: 0x0f31, 0x1d77: 0x0249, 0x1d78: 0x0f41, 0x1d79: 0x0259, 0x1d7a: 0x0f51, 0x1d7b: 0x0359,\n\t0x1d7c: 0x0f61, 0x1d7d: 0x0f71, 0x1d7e: 0x00d9, 0x1d7f: 0x0f99,\n\t// Block 0x76, offset 0x1d80\n\t0x1d80: 0x2039, 0x1d81: 0x0269, 0x1d82: 0x01d9, 0x1d83: 0x0fa9, 0x1d84: 0x0fb9, 0x1d85: 0x1089,\n\t0x1d86: 0x0279, 0x1d87: 0x0369, 0x1d88: 0x0289, 0x1d89: 0x13d1, 0x1d8a: 0xc129, 0x1d8b: 0x65b1,\n\t0x1d8c: 0xc141, 0x1d8d: 0x1441, 0x1d8e: 0xc159, 0x1d8f: 0xc179, 0x1d90: 0x0018, 0x1d91: 0x0018,\n\t0x1d92: 0x0018, 0x1d93: 0x0018, 0x1d94: 0x0018, 0x1d95: 0x0018, 0x1d96: 0x0018, 0x1d97: 0x0018,\n\t0x1d98: 0x0018, 0x1d99: 0x0018, 0x1d9a: 0x0018, 0x1d9b: 0x0018, 0x1d9c: 0x0018, 0x1d9d: 0x0018,\n\t0x1d9e: 0x0018, 0x1d9f: 0x0018, 0x1da0: 0x0018, 0x1da1: 0x0018, 0x1da2: 0x0018, 0x1da3: 0x0018,\n\t0x1da4: 0x0018, 0x1da5: 0x0018, 0x1da6: 0x0018, 0x1da7: 0x0018, 0x1da8: 0x0018, 0x1da9: 0x0018,\n\t0x1daa: 0xc191, 0x1dab: 0xc1a9, 0x1dac: 0x0040, 0x1dad: 0x0040, 0x1dae: 0x0040, 0x1daf: 0x0040,\n\t0x1db0: 0x0018, 0x1db1: 0x0018, 0x1db2: 0x0018, 0x1db3: 0x0018, 0x1db4: 0x0018, 0x1db5: 0x0018,\n\t0x1db6: 0x0018, 0x1db7: 0x0018, 0x1db8: 0x0018, 0x1db9: 0x0018, 0x1dba: 0x0018, 0x1dbb: 0x0018,\n\t0x1dbc: 0x0018, 0x1dbd: 0x0018, 0x1dbe: 0x0018, 0x1dbf: 0x0018,\n\t// Block 0x77, offset 0x1dc0\n\t0x1dc0: 0xc1d9, 0x1dc1: 0xc211, 0x1dc2: 0xc249, 0x1dc3: 0x0040, 0x1dc4: 0x0040, 0x1dc5: 0x0040,\n\t0x1dc6: 0x0040, 0x1dc7: 0x0040, 0x1dc8: 0x0040, 0x1dc9: 0x0040, 0x1dca: 0x0040, 0x1dcb: 0x0040,\n\t0x1dcc: 0x0040, 0x1dcd: 0x0040, 0x1dce: 0x0040, 0x1dcf: 0x0040, 0x1dd0: 0xc269, 0x1dd1: 0xc289,\n\t0x1dd2: 0xc2a9, 0x1dd3: 0xc2c9, 0x1dd4: 0xc2e9, 0x1dd5: 0xc309, 0x1dd6: 0xc329, 0x1dd7: 0xc349,\n\t0x1dd8: 0xc369, 0x1dd9: 0xc389, 0x1dda: 0xc3a9, 0x1ddb: 0xc3c9, 0x1ddc: 0xc3e9, 0x1ddd: 0xc409,\n\t0x1dde: 0xc429, 0x1ddf: 0xc449, 0x1de0: 0xc469, 0x1de1: 0xc489, 0x1de2: 0xc4a9, 0x1de3: 0xc4c9,\n\t0x1de4: 0xc4e9, 0x1de5: 0xc509, 0x1de6: 0xc529, 0x1de7: 0xc549, 0x1de8: 0xc569, 0x1de9: 0xc589,\n\t0x1dea: 0xc5a9, 0x1deb: 0xc5c9, 0x1dec: 0xc5e9, 0x1ded: 0xc609, 0x1dee: 0xc629, 0x1def: 0xc649,\n\t0x1df0: 0xc669, 0x1df1: 0xc689, 0x1df2: 0xc6a9, 0x1df3: 0xc6c9, 0x1df4: 0xc6e9, 0x1df5: 0xc709,\n\t0x1df6: 0xc729, 0x1df7: 0xc749, 0x1df8: 0xc769, 0x1df9: 0xc789, 0x1dfa: 0xc7a9, 0x1dfb: 0xc7c9,\n\t0x1dfc: 0x0040, 0x1dfd: 0x0040, 0x1dfe: 0x0040, 0x1dff: 0x0040,\n\t// Block 0x78, offset 0x1e00\n\t0x1e00: 0xcaf9, 0x1e01: 0xcb19, 0x1e02: 0xcb39, 0x1e03: 0x8b1d, 0x1e04: 0xcb59, 0x1e05: 0xcb79,\n\t0x1e06: 0xcb99, 0x1e07: 0xcbb9, 0x1e08: 0xcbd9, 0x1e09: 0xcbf9, 0x1e0a: 0xcc19, 0x1e0b: 0xcc39,\n\t0x1e0c: 0xcc59, 0x1e0d: 0x8b3d, 0x1e0e: 0xcc79, 0x1e0f: 0xcc99, 0x1e10: 0xccb9, 0x1e11: 0xccd9,\n\t0x1e12: 0x8b5d, 0x1e13: 0xccf9, 0x1e14: 0xcd19, 0x1e15: 0xc429, 0x1e16: 0x8b7d, 0x1e17: 0xcd39,\n\t0x1e18: 0xcd59, 0x1e19: 0xcd79, 0x1e1a: 0xcd99, 0x1e1b: 0xcdb9, 0x1e1c: 0x8b9d, 0x1e1d: 0xcdd9,\n\t0x1e1e: 0xcdf9, 0x1e1f: 0xce19, 0x1e20: 0xce39, 0x1e21: 0xce59, 0x1e22: 0xc789, 0x1e23: 0xce79,\n\t0x1e24: 0xce99, 0x1e25: 0xceb9, 0x1e26: 0xced9, 0x1e27: 0xcef9, 0x1e28: 0xcf19, 0x1e29: 0xcf39,\n\t0x1e2a: 0xcf59, 0x1e2b: 0xcf79, 0x1e2c: 0xcf99, 0x1e2d: 0xcfb9, 0x1e2e: 0xcfd9, 0x1e2f: 0xcff9,\n\t0x1e30: 0xd019, 0x1e31: 0xd039, 0x1e32: 0xd039, 0x1e33: 0xd039, 0x1e34: 0x8bbd, 0x1e35: 0xd059,\n\t0x1e36: 0xd079, 0x1e37: 0xd099, 0x1e38: 0x8bdd, 0x1e39: 0xd0b9, 0x1e3a: 0xd0d9, 0x1e3b: 0xd0f9,\n\t0x1e3c: 0xd119, 0x1e3d: 0xd139, 0x1e3e: 0xd159, 0x1e3f: 0xd179,\n\t// Block 0x79, offset 0x1e40\n\t0x1e40: 0xd199, 0x1e41: 0xd1b9, 0x1e42: 0xd1d9, 0x1e43: 0xd1f9, 0x1e44: 0xd219, 0x1e45: 0xd239,\n\t0x1e46: 0xd239, 0x1e47: 0xd259, 0x1e48: 0xd279, 0x1e49: 0xd299, 0x1e4a: 0xd2b9, 0x1e4b: 0xd2d9,\n\t0x1e4c: 0xd2f9, 0x1e4d: 0xd319, 0x1e4e: 0xd339, 0x1e4f: 0xd359, 0x1e50: 0xd379, 0x1e51: 0xd399,\n\t0x1e52: 0xd3b9, 0x1e53: 0xd3d9, 0x1e54: 0xd3f9, 0x1e55: 0xd419, 0x1e56: 0xd439, 0x1e57: 0xd459,\n\t0x1e58: 0xd479, 0x1e59: 0x8bfd, 0x1e5a: 0xd499, 0x1e5b: 0xd4b9, 0x1e5c: 0xd4d9, 0x1e5d: 0xc309,\n\t0x1e5e: 0xd4f9, 0x1e5f: 0xd519, 0x1e60: 0x8c1d, 0x1e61: 0x8c3d, 0x1e62: 0xd539, 0x1e63: 0xd559,\n\t0x1e64: 0xd579, 0x1e65: 0xd599, 0x1e66: 0xd5b9, 0x1e67: 0xd5d9, 0x1e68: 0x2040, 0x1e69: 0xd5f9,\n\t0x1e6a: 0xd619, 0x1e6b: 0xd619, 0x1e6c: 0x8c5d, 0x1e6d: 0xd639, 0x1e6e: 0xd659, 0x1e6f: 0xd679,\n\t0x1e70: 0xd699, 0x1e71: 0x8c7d, 0x1e72: 0xd6b9, 0x1e73: 0xd6d9, 0x1e74: 0x2040, 0x1e75: 0xd6f9,\n\t0x1e76: 0xd719, 0x1e77: 0xd739, 0x1e78: 0xd759, 0x1e79: 0xd779, 0x1e7a: 0xd799, 0x1e7b: 0x8c9d,\n\t0x1e7c: 0xd7b9, 0x1e7d: 0x8cbd, 0x1e7e: 0xd7d9, 0x1e7f: 0xd7f9,\n\t// Block 0x7a, offset 0x1e80\n\t0x1e80: 0xd819, 0x1e81: 0xd839, 0x1e82: 0xd859, 0x1e83: 0xd879, 0x1e84: 0xd899, 0x1e85: 0xd8b9,\n\t0x1e86: 0xd8d9, 0x1e87: 0xd8f9, 0x1e88: 0xd919, 0x1e89: 0x8cdd, 0x1e8a: 0xd939, 0x1e8b: 0xd959,\n\t0x1e8c: 0xd979, 0x1e8d: 0xd999, 0x1e8e: 0xd9b9, 0x1e8f: 0x8cfd, 0x1e90: 0xd9d9, 0x1e91: 0x8d1d,\n\t0x1e92: 0x8d3d, 0x1e93: 0xd9f9, 0x1e94: 0xda19, 0x1e95: 0xda19, 0x1e96: 0xda39, 0x1e97: 0x8d5d,\n\t0x1e98: 0x8d7d, 0x1e99: 0xda59, 0x1e9a: 0xda79, 0x1e9b: 0xda99, 0x1e9c: 0xdab9, 0x1e9d: 0xdad9,\n\t0x1e9e: 0xdaf9, 0x1e9f: 0xdb19, 0x1ea0: 0xdb39, 0x1ea1: 0xdb59, 0x1ea2: 0xdb79, 0x1ea3: 0xdb99,\n\t0x1ea4: 0x8d9d, 0x1ea5: 0xdbb9, 0x1ea6: 0xdbd9, 0x1ea7: 0xdbf9, 0x1ea8: 0xdc19, 0x1ea9: 0xdbf9,\n\t0x1eaa: 0xdc39, 0x1eab: 0xdc59, 0x1eac: 0xdc79, 0x1ead: 0xdc99, 0x1eae: 0xdcb9, 0x1eaf: 0xdcd9,\n\t0x1eb0: 0xdcf9, 0x1eb1: 0xdd19, 0x1eb2: 0xdd39, 0x1eb3: 0xdd59, 0x1eb4: 0xdd79, 0x1eb5: 0xdd99,\n\t0x1eb6: 0xddb9, 0x1eb7: 0xddd9, 0x1eb8: 0x8dbd, 0x1eb9: 0xddf9, 0x1eba: 0xde19, 0x1ebb: 0xde39,\n\t0x1ebc: 0xde59, 0x1ebd: 0xde79, 0x1ebe: 0x8ddd, 0x1ebf: 0xde99,\n\t// Block 0x7b, offset 0x1ec0\n\t0x1ec0: 0xe599, 0x1ec1: 0xe5b9, 0x1ec2: 0xe5d9, 0x1ec3: 0xe5f9, 0x1ec4: 0xe619, 0x1ec5: 0xe639,\n\t0x1ec6: 0x8efd, 0x1ec7: 0xe659, 0x1ec8: 0xe679, 0x1ec9: 0xe699, 0x1eca: 0xe6b9, 0x1ecb: 0xe6d9,\n\t0x1ecc: 0xe6f9, 0x1ecd: 0x8f1d, 0x1ece: 0xe719, 0x1ecf: 0xe739, 0x1ed0: 0x8f3d, 0x1ed1: 0x8f5d,\n\t0x1ed2: 0xe759, 0x1ed3: 0xe779, 0x1ed4: 0xe799, 0x1ed5: 0xe7b9, 0x1ed6: 0xe7d9, 0x1ed7: 0xe7f9,\n\t0x1ed8: 0xe819, 0x1ed9: 0xe839, 0x1eda: 0xe859, 0x1edb: 0x8f7d, 0x1edc: 0xe879, 0x1edd: 0x8f9d,\n\t0x1ede: 0xe899, 0x1edf: 0x2040, 0x1ee0: 0xe8b9, 0x1ee1: 0xe8d9, 0x1ee2: 0xe8f9, 0x1ee3: 0x8fbd,\n\t0x1ee4: 0xe919, 0x1ee5: 0xe939, 0x1ee6: 0x8fdd, 0x1ee7: 0x8ffd, 0x1ee8: 0xe959, 0x1ee9: 0xe979,\n\t0x1eea: 0xe999, 0x1eeb: 0xe9b9, 0x1eec: 0xe9d9, 0x1eed: 0xe9d9, 0x1eee: 0xe9f9, 0x1eef: 0xea19,\n\t0x1ef0: 0xea39, 0x1ef1: 0xea59, 0x1ef2: 0xea79, 0x1ef3: 0xea99, 0x1ef4: 0xeab9, 0x1ef5: 0x901d,\n\t0x1ef6: 0xead9, 0x1ef7: 0x903d, 0x1ef8: 0xeaf9, 0x1ef9: 0x905d, 0x1efa: 0xeb19, 0x1efb: 0x907d,\n\t0x1efc: 0x909d, 0x1efd: 0x90bd, 0x1efe: 0xeb39, 0x1eff: 0xeb59,\n\t// Block 0x7c, offset 0x1f00\n\t0x1f00: 0xeb79, 0x1f01: 0x90dd, 0x1f02: 0x90fd, 0x1f03: 0x911d, 0x1f04: 0x913d, 0x1f05: 0xeb99,\n\t0x1f06: 0xebb9, 0x1f07: 0xebb9, 0x1f08: 0xebd9, 0x1f09: 0xebf9, 0x1f0a: 0xec19, 0x1f0b: 0xec39,\n\t0x1f0c: 0xec59, 0x1f0d: 0x915d, 0x1f0e: 0xec79, 0x1f0f: 0xec99, 0x1f10: 0xecb9, 0x1f11: 0xecd9,\n\t0x1f12: 0x917d, 0x1f13: 0xecf9, 0x1f14: 0x919d, 0x1f15: 0x91bd, 0x1f16: 0xed19, 0x1f17: 0xed39,\n\t0x1f18: 0xed59, 0x1f19: 0xed79, 0x1f1a: 0xed99, 0x1f1b: 0xedb9, 0x1f1c: 0x91dd, 0x1f1d: 0x91fd,\n\t0x1f1e: 0x921d, 0x1f1f: 0x2040, 0x1f20: 0xedd9, 0x1f21: 0x923d, 0x1f22: 0xedf9, 0x1f23: 0xee19,\n\t0x1f24: 0xee39, 0x1f25: 0x925d, 0x1f26: 0xee59, 0x1f27: 0xee79, 0x1f28: 0xee99, 0x1f29: 0xeeb9,\n\t0x1f2a: 0xeed9, 0x1f2b: 0x927d, 0x1f2c: 0xeef9, 0x1f2d: 0xef19, 0x1f2e: 0xef39, 0x1f2f: 0xef59,\n\t0x1f30: 0xef79, 0x1f31: 0xef99, 0x1f32: 0x929d, 0x1f33: 0x92bd, 0x1f34: 0xefb9, 0x1f35: 0x92dd,\n\t0x1f36: 0xefd9, 0x1f37: 0x92fd, 0x1f38: 0xeff9, 0x1f39: 0xf019, 0x1f3a: 0xf039, 0x1f3b: 0x931d,\n\t0x1f3c: 0x933d, 0x1f3d: 0xf059, 0x1f3e: 0x935d, 0x1f3f: 0xf079,\n\t// Block 0x7d, offset 0x1f40\n\t0x1f40: 0xf6b9, 0x1f41: 0xf6d9, 0x1f42: 0xf6f9, 0x1f43: 0xf719, 0x1f44: 0xf739, 0x1f45: 0x951d,\n\t0x1f46: 0xf759, 0x1f47: 0xf779, 0x1f48: 0xf799, 0x1f49: 0xf7b9, 0x1f4a: 0xf7d9, 0x1f4b: 0x953d,\n\t0x1f4c: 0x955d, 0x1f4d: 0xf7f9, 0x1f4e: 0xf819, 0x1f4f: 0xf839, 0x1f50: 0xf859, 0x1f51: 0xf879,\n\t0x1f52: 0xf899, 0x1f53: 0x957d, 0x1f54: 0xf8b9, 0x1f55: 0xf8d9, 0x1f56: 0xf8f9, 0x1f57: 0xf919,\n\t0x1f58: 0x959d, 0x1f59: 0x95bd, 0x1f5a: 0xf939, 0x1f5b: 0xf959, 0x1f5c: 0xf979, 0x1f5d: 0x95dd,\n\t0x1f5e: 0xf999, 0x1f5f: 0xf9b9, 0x1f60: 0x6815, 0x1f61: 0x95fd, 0x1f62: 0xf9d9, 0x1f63: 0xf9f9,\n\t0x1f64: 0xfa19, 0x1f65: 0x961d, 0x1f66: 0xfa39, 0x1f67: 0xfa59, 0x1f68: 0xfa79, 0x1f69: 0xfa99,\n\t0x1f6a: 0xfab9, 0x1f6b: 0xfad9, 0x1f6c: 0xfaf9, 0x1f6d: 0x963d, 0x1f6e: 0xfb19, 0x1f6f: 0xfb39,\n\t0x1f70: 0xfb59, 0x1f71: 0x965d, 0x1f72: 0xfb79, 0x1f73: 0xfb99, 0x1f74: 0xfbb9, 0x1f75: 0xfbd9,\n\t0x1f76: 0x7b35, 0x1f77: 0x967d, 0x1f78: 0xfbf9, 0x1f79: 0xfc19, 0x1f7a: 0xfc39, 0x1f7b: 0x969d,\n\t0x1f7c: 0xfc59, 0x1f7d: 0x96bd, 0x1f7e: 0xfc79, 0x1f7f: 0xfc79,\n\t// Block 0x7e, offset 0x1f80\n\t0x1f80: 0xfc99, 0x1f81: 0x96dd, 0x1f82: 0xfcb9, 0x1f83: 0xfcd9, 0x1f84: 0xfcf9, 0x1f85: 0xfd19,\n\t0x1f86: 0xfd39, 0x1f87: 0xfd59, 0x1f88: 0xfd79, 0x1f89: 0x96fd, 0x1f8a: 0xfd99, 0x1f8b: 0xfdb9,\n\t0x1f8c: 0xfdd9, 0x1f8d: 0xfdf9, 0x1f8e: 0xfe19, 0x1f8f: 0xfe39, 0x1f90: 0x971d, 0x1f91: 0xfe59,\n\t0x1f92: 0x973d, 0x1f93: 0x975d, 0x1f94: 0x977d, 0x1f95: 0xfe79, 0x1f96: 0xfe99, 0x1f97: 0xfeb9,\n\t0x1f98: 0xfed9, 0x1f99: 0xfef9, 0x1f9a: 0xff19, 0x1f9b: 0xff39, 0x1f9c: 0xff59, 0x1f9d: 0x979d,\n\t0x1f9e: 0x0040, 0x1f9f: 0x0040, 0x1fa0: 0x0040, 0x1fa1: 0x0040, 0x1fa2: 0x0040, 0x1fa3: 0x0040,\n\t0x1fa4: 0x0040, 0x1fa5: 0x0040, 0x1fa6: 0x0040, 0x1fa7: 0x0040, 0x1fa8: 0x0040, 0x1fa9: 0x0040,\n\t0x1faa: 0x0040, 0x1fab: 0x0040, 0x1fac: 0x0040, 0x1fad: 0x0040, 0x1fae: 0x0040, 0x1faf: 0x0040,\n\t0x1fb0: 0x0040, 0x1fb1: 0x0040, 0x1fb2: 0x0040, 0x1fb3: 0x0040, 0x1fb4: 0x0040, 0x1fb5: 0x0040,\n\t0x1fb6: 0x0040, 0x1fb7: 0x0040, 0x1fb8: 0x0040, 0x1fb9: 0x0040, 0x1fba: 0x0040, 0x1fbb: 0x0040,\n\t0x1fbc: 0x0040, 0x1fbd: 0x0040, 0x1fbe: 0x0040, 0x1fbf: 0x0040,\n}\n\n// idnaIndex: 36 blocks, 2304 entries, 4608 bytes\n// Block 0 is the zero block.\nvar idnaIndex = [2304]uint16{\n\t// Block 0x0, offset 0x0\n\t// Block 0x1, offset 0x40\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc2: 0x01, 0xc3: 0x7d, 0xc4: 0x02, 0xc5: 0x03, 0xc6: 0x04, 0xc7: 0x05,\n\t0xc8: 0x06, 0xc9: 0x7e, 0xca: 0x7f, 0xcb: 0x07, 0xcc: 0x80, 0xcd: 0x08, 0xce: 0x09, 0xcf: 0x0a,\n\t0xd0: 0x81, 0xd1: 0x0b, 0xd2: 0x0c, 0xd3: 0x0d, 0xd4: 0x0e, 0xd5: 0x82, 0xd6: 0x83, 0xd7: 0x84,\n\t0xd8: 0x0f, 0xd9: 0x10, 0xda: 0x85, 0xdb: 0x11, 0xdc: 0x12, 0xdd: 0x86, 0xde: 0x87, 0xdf: 0x88,\n\t0xe0: 0x02, 0xe1: 0x03, 0xe2: 0x04, 0xe3: 0x05, 0xe4: 0x06, 0xe5: 0x07, 0xe6: 0x07, 0xe7: 0x07,\n\t0xe8: 0x07, 0xe9: 0x08, 0xea: 0x09, 0xeb: 0x07, 0xec: 0x07, 0xed: 0x0a, 0xee: 0x0b, 0xef: 0x0c,\n\t0xf0: 0x1d, 0xf1: 0x1e, 0xf2: 0x1e, 0xf3: 0x20, 0xf4: 0x21,\n\t// Block 0x4, offset 0x100\n\t0x120: 0x89, 0x121: 0x13, 0x122: 0x8a, 0x123: 0x8b, 0x124: 0x8c, 0x125: 0x14, 0x126: 0x15, 0x127: 0x16,\n\t0x128: 0x17, 0x129: 0x18, 0x12a: 0x19, 0x12b: 0x1a, 0x12c: 0x1b, 0x12d: 0x1c, 0x12e: 0x1d, 0x12f: 0x8d,\n\t0x130: 0x8e, 0x131: 0x1e, 0x132: 0x1f, 0x133: 0x20, 0x134: 0x8f, 0x135: 0x21, 0x136: 0x90, 0x137: 0x91,\n\t0x138: 0x92, 0x139: 0x93, 0x13a: 0x22, 0x13b: 0x94, 0x13c: 0x95, 0x13d: 0x23, 0x13e: 0x24, 0x13f: 0x96,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x97, 0x141: 0x98, 0x142: 0x99, 0x143: 0x9a, 0x144: 0x9b, 0x145: 0x9c, 0x146: 0x9d, 0x147: 0x9e,\n\t0x148: 0x9f, 0x149: 0xa0, 0x14a: 0xa1, 0x14b: 0xa2, 0x14c: 0xa3, 0x14d: 0xa4, 0x14e: 0xa5, 0x14f: 0xa6,\n\t0x150: 0xa7, 0x151: 0x9f, 0x152: 0x9f, 0x153: 0x9f, 0x154: 0x9f, 0x155: 0x9f, 0x156: 0x9f, 0x157: 0x9f,\n\t0x158: 0x9f, 0x159: 0xa8, 0x15a: 0xa9, 0x15b: 0xaa, 0x15c: 0xab, 0x15d: 0xac, 0x15e: 0xad, 0x15f: 0xae,\n\t0x160: 0xaf, 0x161: 0xb0, 0x162: 0xb1, 0x163: 0xb2, 0x164: 0xb3, 0x165: 0xb4, 0x166: 0xb5, 0x167: 0xb6,\n\t0x168: 0xb7, 0x169: 0xb8, 0x16a: 0xb9, 0x16b: 0xba, 0x16c: 0xbb, 0x16d: 0xbc, 0x16e: 0xbd, 0x16f: 0xbe,\n\t0x170: 0xbf, 0x171: 0xc0, 0x172: 0xc1, 0x173: 0xc2, 0x174: 0x25, 0x175: 0x26, 0x176: 0x27, 0x177: 0xc3,\n\t0x178: 0x28, 0x179: 0x28, 0x17a: 0x29, 0x17b: 0x28, 0x17c: 0xc4, 0x17d: 0x2a, 0x17e: 0x2b, 0x17f: 0x2c,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x2d, 0x181: 0x2e, 0x182: 0x2f, 0x183: 0xc5, 0x184: 0x30, 0x185: 0x31, 0x186: 0xc6, 0x187: 0x9b,\n\t0x188: 0xc7, 0x189: 0xc8, 0x18a: 0x9b, 0x18b: 0x9b, 0x18c: 0xc9, 0x18d: 0x9b, 0x18e: 0x9b, 0x18f: 0x9b,\n\t0x190: 0xca, 0x191: 0x32, 0x192: 0x33, 0x193: 0x34, 0x194: 0x9b, 0x195: 0x9b, 0x196: 0x9b, 0x197: 0x9b,\n\t0x198: 0x9b, 0x199: 0x9b, 0x19a: 0x9b, 0x19b: 0x9b, 0x19c: 0x9b, 0x19d: 0x9b, 0x19e: 0x9b, 0x19f: 0x9b,\n\t0x1a0: 0x9b, 0x1a1: 0x9b, 0x1a2: 0x9b, 0x1a3: 0x9b, 0x1a4: 0x9b, 0x1a5: 0x9b, 0x1a6: 0x9b, 0x1a7: 0x9b,\n\t0x1a8: 0xcb, 0x1a9: 0xcc, 0x1aa: 0x9b, 0x1ab: 0xcd, 0x1ac: 0x9b, 0x1ad: 0xce, 0x1ae: 0xcf, 0x1af: 0xd0,\n\t0x1b0: 0xd1, 0x1b1: 0x35, 0x1b2: 0x28, 0x1b3: 0x36, 0x1b4: 0xd2, 0x1b5: 0xd3, 0x1b6: 0xd4, 0x1b7: 0xd5,\n\t0x1b8: 0xd6, 0x1b9: 0xd7, 0x1ba: 0xd8, 0x1bb: 0xd9, 0x1bc: 0xda, 0x1bd: 0xdb, 0x1be: 0xdc, 0x1bf: 0x37,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x38, 0x1c1: 0xdd, 0x1c2: 0xde, 0x1c3: 0xdf, 0x1c4: 0xe0, 0x1c5: 0x39, 0x1c6: 0x3a, 0x1c7: 0xe1,\n\t0x1c8: 0xe2, 0x1c9: 0x3b, 0x1ca: 0x3c, 0x1cb: 0x3d, 0x1cc: 0x3e, 0x1cd: 0x3f, 0x1ce: 0x40, 0x1cf: 0x41,\n\t0x1d0: 0x9f, 0x1d1: 0x9f, 0x1d2: 0x9f, 0x1d3: 0x9f, 0x1d4: 0x9f, 0x1d5: 0x9f, 0x1d6: 0x9f, 0x1d7: 0x9f,\n\t0x1d8: 0x9f, 0x1d9: 0x9f, 0x1da: 0x9f, 0x1db: 0x9f, 0x1dc: 0x9f, 0x1dd: 0x9f, 0x1de: 0x9f, 0x1df: 0x9f,\n\t0x1e0: 0x9f, 0x1e1: 0x9f, 0x1e2: 0x9f, 0x1e3: 0x9f, 0x1e4: 0x9f, 0x1e5: 0x9f, 0x1e6: 0x9f, 0x1e7: 0x9f,\n\t0x1e8: 0x9f, 0x1e9: 0x9f, 0x1ea: 0x9f, 0x1eb: 0x9f, 0x1ec: 0x9f, 0x1ed: 0x9f, 0x1ee: 0x9f, 0x1ef: 0x9f,\n\t0x1f0: 0x9f, 0x1f1: 0x9f, 0x1f2: 0x9f, 0x1f3: 0x9f, 0x1f4: 0x9f, 0x1f5: 0x9f, 0x1f6: 0x9f, 0x1f7: 0x9f,\n\t0x1f8: 0x9f, 0x1f9: 0x9f, 0x1fa: 0x9f, 0x1fb: 0x9f, 0x1fc: 0x9f, 0x1fd: 0x9f, 0x1fe: 0x9f, 0x1ff: 0x9f,\n\t// Block 0x8, offset 0x200\n\t0x200: 0x9f, 0x201: 0x9f, 0x202: 0x9f, 0x203: 0x9f, 0x204: 0x9f, 0x205: 0x9f, 0x206: 0x9f, 0x207: 0x9f,\n\t0x208: 0x9f, 0x209: 0x9f, 0x20a: 0x9f, 0x20b: 0x9f, 0x20c: 0x9f, 0x20d: 0x9f, 0x20e: 0x9f, 0x20f: 0x9f,\n\t0x210: 0x9f, 0x211: 0x9f, 0x212: 0x9f, 0x213: 0x9f, 0x214: 0x9f, 0x215: 0x9f, 0x216: 0x9f, 0x217: 0x9f,\n\t0x218: 0x9f, 0x219: 0x9f, 0x21a: 0x9f, 0x21b: 0x9f, 0x21c: 0x9f, 0x21d: 0x9f, 0x21e: 0x9f, 0x21f: 0x9f,\n\t0x220: 0x9f, 0x221: 0x9f, 0x222: 0x9f, 0x223: 0x9f, 0x224: 0x9f, 0x225: 0x9f, 0x226: 0x9f, 0x227: 0x9f,\n\t0x228: 0x9f, 0x229: 0x9f, 0x22a: 0x9f, 0x22b: 0x9f, 0x22c: 0x9f, 0x22d: 0x9f, 0x22e: 0x9f, 0x22f: 0x9f,\n\t0x230: 0x9f, 0x231: 0x9f, 0x232: 0x9f, 0x233: 0x9f, 0x234: 0x9f, 0x235: 0x9f, 0x236: 0xb2, 0x237: 0x9b,\n\t0x238: 0x9f, 0x239: 0x9f, 0x23a: 0x9f, 0x23b: 0x9f, 0x23c: 0x9f, 0x23d: 0x9f, 0x23e: 0x9f, 0x23f: 0x9f,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x9f, 0x241: 0x9f, 0x242: 0x9f, 0x243: 0x9f, 0x244: 0x9f, 0x245: 0x9f, 0x246: 0x9f, 0x247: 0x9f,\n\t0x248: 0x9f, 0x249: 0x9f, 0x24a: 0x9f, 0x24b: 0x9f, 0x24c: 0x9f, 0x24d: 0x9f, 0x24e: 0x9f, 0x24f: 0x9f,\n\t0x250: 0x9f, 0x251: 0x9f, 0x252: 0x9f, 0x253: 0x9f, 0x254: 0x9f, 0x255: 0x9f, 0x256: 0x9f, 0x257: 0x9f,\n\t0x258: 0x9f, 0x259: 0x9f, 0x25a: 0x9f, 0x25b: 0x9f, 0x25c: 0x9f, 0x25d: 0x9f, 0x25e: 0x9f, 0x25f: 0x9f,\n\t0x260: 0x9f, 0x261: 0x9f, 0x262: 0x9f, 0x263: 0x9f, 0x264: 0x9f, 0x265: 0x9f, 0x266: 0x9f, 0x267: 0x9f,\n\t0x268: 0x9f, 0x269: 0x9f, 0x26a: 0x9f, 0x26b: 0x9f, 0x26c: 0x9f, 0x26d: 0x9f, 0x26e: 0x9f, 0x26f: 0x9f,\n\t0x270: 0x9f, 0x271: 0x9f, 0x272: 0x9f, 0x273: 0x9f, 0x274: 0x9f, 0x275: 0x9f, 0x276: 0x9f, 0x277: 0x9f,\n\t0x278: 0x9f, 0x279: 0x9f, 0x27a: 0x9f, 0x27b: 0x9f, 0x27c: 0x9f, 0x27d: 0x9f, 0x27e: 0x9f, 0x27f: 0x9f,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x9f, 0x281: 0x9f, 0x282: 0x9f, 0x283: 0x9f, 0x284: 0x9f, 0x285: 0x9f, 0x286: 0x9f, 0x287: 0x9f,\n\t0x288: 0x9f, 0x289: 0x9f, 0x28a: 0x9f, 0x28b: 0x9f, 0x28c: 0x9f, 0x28d: 0x9f, 0x28e: 0x9f, 0x28f: 0x9f,\n\t0x290: 0x9f, 0x291: 0x9f, 0x292: 0x9f, 0x293: 0x9f, 0x294: 0x9f, 0x295: 0x9f, 0x296: 0x9f, 0x297: 0x9f,\n\t0x298: 0x9f, 0x299: 0x9f, 0x29a: 0x9f, 0x29b: 0x9f, 0x29c: 0x9f, 0x29d: 0x9f, 0x29e: 0x9f, 0x29f: 0x9f,\n\t0x2a0: 0x9f, 0x2a1: 0x9f, 0x2a2: 0x9f, 0x2a3: 0x9f, 0x2a4: 0x9f, 0x2a5: 0x9f, 0x2a6: 0x9f, 0x2a7: 0x9f,\n\t0x2a8: 0x9f, 0x2a9: 0x9f, 0x2aa: 0x9f, 0x2ab: 0x9f, 0x2ac: 0x9f, 0x2ad: 0x9f, 0x2ae: 0x9f, 0x2af: 0x9f,\n\t0x2b0: 0x9f, 0x2b1: 0x9f, 0x2b2: 0x9f, 0x2b3: 0x9f, 0x2b4: 0x9f, 0x2b5: 0x9f, 0x2b6: 0x9f, 0x2b7: 0x9f,\n\t0x2b8: 0x9f, 0x2b9: 0x9f, 0x2ba: 0x9f, 0x2bb: 0x9f, 0x2bc: 0x9f, 0x2bd: 0x9f, 0x2be: 0x9f, 0x2bf: 0xe3,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x9f, 0x2c1: 0x9f, 0x2c2: 0x9f, 0x2c3: 0x9f, 0x2c4: 0x9f, 0x2c5: 0x9f, 0x2c6: 0x9f, 0x2c7: 0x9f,\n\t0x2c8: 0x9f, 0x2c9: 0x9f, 0x2ca: 0x9f, 0x2cb: 0x9f, 0x2cc: 0x9f, 0x2cd: 0x9f, 0x2ce: 0x9f, 0x2cf: 0x9f,\n\t0x2d0: 0x9f, 0x2d1: 0x9f, 0x2d2: 0xe4, 0x2d3: 0xe5, 0x2d4: 0x9f, 0x2d5: 0x9f, 0x2d6: 0x9f, 0x2d7: 0x9f,\n\t0x2d8: 0xe6, 0x2d9: 0x42, 0x2da: 0x43, 0x2db: 0xe7, 0x2dc: 0x44, 0x2dd: 0x45, 0x2de: 0x46, 0x2df: 0xe8,\n\t0x2e0: 0xe9, 0x2e1: 0xea, 0x2e2: 0xeb, 0x2e3: 0xec, 0x2e4: 0xed, 0x2e5: 0xee, 0x2e6: 0xef, 0x2e7: 0xf0,\n\t0x2e8: 0xf1, 0x2e9: 0xf2, 0x2ea: 0xf3, 0x2eb: 0xf4, 0x2ec: 0xf5, 0x2ed: 0xf6, 0x2ee: 0xf7, 0x2ef: 0xf8,\n\t0x2f0: 0x9f, 0x2f1: 0x9f, 0x2f2: 0x9f, 0x2f3: 0x9f, 0x2f4: 0x9f, 0x2f5: 0x9f, 0x2f6: 0x9f, 0x2f7: 0x9f,\n\t0x2f8: 0x9f, 0x2f9: 0x9f, 0x2fa: 0x9f, 0x2fb: 0x9f, 0x2fc: 0x9f, 0x2fd: 0x9f, 0x2fe: 0x9f, 0x2ff: 0x9f,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x9f, 0x301: 0x9f, 0x302: 0x9f, 0x303: 0x9f, 0x304: 0x9f, 0x305: 0x9f, 0x306: 0x9f, 0x307: 0x9f,\n\t0x308: 0x9f, 0x309: 0x9f, 0x30a: 0x9f, 0x30b: 0x9f, 0x30c: 0x9f, 0x30d: 0x9f, 0x30e: 0x9f, 0x30f: 0x9f,\n\t0x310: 0x9f, 0x311: 0x9f, 0x312: 0x9f, 0x313: 0x9f, 0x314: 0x9f, 0x315: 0x9f, 0x316: 0x9f, 0x317: 0x9f,\n\t0x318: 0x9f, 0x319: 0x9f, 0x31a: 0x9f, 0x31b: 0x9f, 0x31c: 0x9f, 0x31d: 0x9f, 0x31e: 0xf9, 0x31f: 0xfa,\n\t// Block 0xd, offset 0x340\n\t0x340: 0xba, 0x341: 0xba, 0x342: 0xba, 0x343: 0xba, 0x344: 0xba, 0x345: 0xba, 0x346: 0xba, 0x347: 0xba,\n\t0x348: 0xba, 0x349: 0xba, 0x34a: 0xba, 0x34b: 0xba, 0x34c: 0xba, 0x34d: 0xba, 0x34e: 0xba, 0x34f: 0xba,\n\t0x350: 0xba, 0x351: 0xba, 0x352: 0xba, 0x353: 0xba, 0x354: 0xba, 0x355: 0xba, 0x356: 0xba, 0x357: 0xba,\n\t0x358: 0xba, 0x359: 0xba, 0x35a: 0xba, 0x35b: 0xba, 0x35c: 0xba, 0x35d: 0xba, 0x35e: 0xba, 0x35f: 0xba,\n\t0x360: 0xba, 0x361: 0xba, 0x362: 0xba, 0x363: 0xba, 0x364: 0xba, 0x365: 0xba, 0x366: 0xba, 0x367: 0xba,\n\t0x368: 0xba, 0x369: 0xba, 0x36a: 0xba, 0x36b: 0xba, 0x36c: 0xba, 0x36d: 0xba, 0x36e: 0xba, 0x36f: 0xba,\n\t0x370: 0xba, 0x371: 0xba, 0x372: 0xba, 0x373: 0xba, 0x374: 0xba, 0x375: 0xba, 0x376: 0xba, 0x377: 0xba,\n\t0x378: 0xba, 0x379: 0xba, 0x37a: 0xba, 0x37b: 0xba, 0x37c: 0xba, 0x37d: 0xba, 0x37e: 0xba, 0x37f: 0xba,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xba, 0x381: 0xba, 0x382: 0xba, 0x383: 0xba, 0x384: 0xba, 0x385: 0xba, 0x386: 0xba, 0x387: 0xba,\n\t0x388: 0xba, 0x389: 0xba, 0x38a: 0xba, 0x38b: 0xba, 0x38c: 0xba, 0x38d: 0xba, 0x38e: 0xba, 0x38f: 0xba,\n\t0x390: 0xba, 0x391: 0xba, 0x392: 0xba, 0x393: 0xba, 0x394: 0xba, 0x395: 0xba, 0x396: 0xba, 0x397: 0xba,\n\t0x398: 0xba, 0x399: 0xba, 0x39a: 0xba, 0x39b: 0xba, 0x39c: 0xba, 0x39d: 0xba, 0x39e: 0xba, 0x39f: 0xba,\n\t0x3a0: 0xba, 0x3a1: 0xba, 0x3a2: 0xba, 0x3a3: 0xba, 0x3a4: 0xfb, 0x3a5: 0xfc, 0x3a6: 0xfd, 0x3a7: 0xfe,\n\t0x3a8: 0x47, 0x3a9: 0xff, 0x3aa: 0x100, 0x3ab: 0x48, 0x3ac: 0x49, 0x3ad: 0x4a, 0x3ae: 0x4b, 0x3af: 0x4c,\n\t0x3b0: 0x101, 0x3b1: 0x4d, 0x3b2: 0x4e, 0x3b3: 0x4f, 0x3b4: 0x50, 0x3b5: 0x51, 0x3b6: 0x102, 0x3b7: 0x52,\n\t0x3b8: 0x53, 0x3b9: 0x54, 0x3ba: 0x55, 0x3bb: 0x56, 0x3bc: 0x57, 0x3bd: 0x58, 0x3be: 0x59, 0x3bf: 0x5a,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x103, 0x3c1: 0x104, 0x3c2: 0x9f, 0x3c3: 0x105, 0x3c4: 0x106, 0x3c5: 0x9b, 0x3c6: 0x107, 0x3c7: 0x108,\n\t0x3c8: 0xba, 0x3c9: 0xba, 0x3ca: 0x109, 0x3cb: 0x10a, 0x3cc: 0x10b, 0x3cd: 0x10c, 0x3ce: 0x10d, 0x3cf: 0x10e,\n\t0x3d0: 0x10f, 0x3d1: 0x9f, 0x3d2: 0x110, 0x3d3: 0x111, 0x3d4: 0x112, 0x3d5: 0x113, 0x3d6: 0xba, 0x3d7: 0xba,\n\t0x3d8: 0x9f, 0x3d9: 0x9f, 0x3da: 0x9f, 0x3db: 0x9f, 0x3dc: 0x114, 0x3dd: 0x115, 0x3de: 0xba, 0x3df: 0xba,\n\t0x3e0: 0x116, 0x3e1: 0x117, 0x3e2: 0x118, 0x3e3: 0x119, 0x3e4: 0x11a, 0x3e5: 0xba, 0x3e6: 0x11b, 0x3e7: 0x11c,\n\t0x3e8: 0x11d, 0x3e9: 0x11e, 0x3ea: 0x11f, 0x3eb: 0x5b, 0x3ec: 0x120, 0x3ed: 0x121, 0x3ee: 0x5c, 0x3ef: 0xba,\n\t0x3f0: 0x122, 0x3f1: 0x123, 0x3f2: 0x124, 0x3f3: 0x125, 0x3f4: 0xba, 0x3f5: 0xba, 0x3f6: 0xba, 0x3f7: 0xba,\n\t0x3f8: 0xba, 0x3f9: 0x126, 0x3fa: 0xba, 0x3fb: 0xba, 0x3fc: 0xba, 0x3fd: 0xba, 0x3fe: 0xba, 0x3ff: 0xba,\n\t// Block 0x10, offset 0x400\n\t0x400: 0x127, 0x401: 0x128, 0x402: 0x129, 0x403: 0x12a, 0x404: 0x12b, 0x405: 0x12c, 0x406: 0x12d, 0x407: 0x12e,\n\t0x408: 0x12f, 0x409: 0xba, 0x40a: 0x130, 0x40b: 0x131, 0x40c: 0x5d, 0x40d: 0x5e, 0x40e: 0xba, 0x40f: 0xba,\n\t0x410: 0x132, 0x411: 0x133, 0x412: 0x134, 0x413: 0x135, 0x414: 0xba, 0x415: 0xba, 0x416: 0x136, 0x417: 0x137,\n\t0x418: 0x138, 0x419: 0x139, 0x41a: 0x13a, 0x41b: 0x13b, 0x41c: 0x13c, 0x41d: 0xba, 0x41e: 0xba, 0x41f: 0xba,\n\t0x420: 0xba, 0x421: 0xba, 0x422: 0x13d, 0x423: 0x13e, 0x424: 0xba, 0x425: 0xba, 0x426: 0xba, 0x427: 0xba,\n\t0x428: 0x13f, 0x429: 0x140, 0x42a: 0x141, 0x42b: 0x142, 0x42c: 0xba, 0x42d: 0xba, 0x42e: 0xba, 0x42f: 0xba,\n\t0x430: 0x143, 0x431: 0x144, 0x432: 0x145, 0x433: 0xba, 0x434: 0x146, 0x435: 0x147, 0x436: 0xba, 0x437: 0xba,\n\t0x438: 0xba, 0x439: 0xba, 0x43a: 0xba, 0x43b: 0xba, 0x43c: 0xba, 0x43d: 0xba, 0x43e: 0xba, 0x43f: 0xba,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x9f, 0x441: 0x9f, 0x442: 0x9f, 0x443: 0x9f, 0x444: 0x9f, 0x445: 0x9f, 0x446: 0x9f, 0x447: 0x9f,\n\t0x448: 0x9f, 0x449: 0x9f, 0x44a: 0x9f, 0x44b: 0x9f, 0x44c: 0x9f, 0x44d: 0x9f, 0x44e: 0x148, 0x44f: 0xba,\n\t0x450: 0x9b, 0x451: 0x149, 0x452: 0x9f, 0x453: 0x9f, 0x454: 0x9f, 0x455: 0x14a, 0x456: 0xba, 0x457: 0xba,\n\t0x458: 0xba, 0x459: 0xba, 0x45a: 0xba, 0x45b: 0xba, 0x45c: 0xba, 0x45d: 0xba, 0x45e: 0xba, 0x45f: 0xba,\n\t0x460: 0xba, 0x461: 0xba, 0x462: 0xba, 0x463: 0xba, 0x464: 0xba, 0x465: 0xba, 0x466: 0xba, 0x467: 0xba,\n\t0x468: 0xba, 0x469: 0xba, 0x46a: 0xba, 0x46b: 0xba, 0x46c: 0xba, 0x46d: 0xba, 0x46e: 0xba, 0x46f: 0xba,\n\t0x470: 0xba, 0x471: 0xba, 0x472: 0xba, 0x473: 0xba, 0x474: 0xba, 0x475: 0xba, 0x476: 0xba, 0x477: 0xba,\n\t0x478: 0xba, 0x479: 0xba, 0x47a: 0xba, 0x47b: 0xba, 0x47c: 0xba, 0x47d: 0xba, 0x47e: 0xba, 0x47f: 0xba,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x9f, 0x481: 0x9f, 0x482: 0x9f, 0x483: 0x9f, 0x484: 0x9f, 0x485: 0x9f, 0x486: 0x9f, 0x487: 0x9f,\n\t0x488: 0x9f, 0x489: 0x9f, 0x48a: 0x9f, 0x48b: 0x9f, 0x48c: 0x9f, 0x48d: 0x9f, 0x48e: 0x9f, 0x48f: 0x9f,\n\t0x490: 0x14b, 0x491: 0xba, 0x492: 0xba, 0x493: 0xba, 0x494: 0xba, 0x495: 0xba, 0x496: 0xba, 0x497: 0xba,\n\t0x498: 0xba, 0x499: 0xba, 0x49a: 0xba, 0x49b: 0xba, 0x49c: 0xba, 0x49d: 0xba, 0x49e: 0xba, 0x49f: 0xba,\n\t0x4a0: 0xba, 0x4a1: 0xba, 0x4a2: 0xba, 0x4a3: 0xba, 0x4a4: 0xba, 0x4a5: 0xba, 0x4a6: 0xba, 0x4a7: 0xba,\n\t0x4a8: 0xba, 0x4a9: 0xba, 0x4aa: 0xba, 0x4ab: 0xba, 0x4ac: 0xba, 0x4ad: 0xba, 0x4ae: 0xba, 0x4af: 0xba,\n\t0x4b0: 0xba, 0x4b1: 0xba, 0x4b2: 0xba, 0x4b3: 0xba, 0x4b4: 0xba, 0x4b5: 0xba, 0x4b6: 0xba, 0x4b7: 0xba,\n\t0x4b8: 0xba, 0x4b9: 0xba, 0x4ba: 0xba, 0x4bb: 0xba, 0x4bc: 0xba, 0x4bd: 0xba, 0x4be: 0xba, 0x4bf: 0xba,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0xba, 0x4c1: 0xba, 0x4c2: 0xba, 0x4c3: 0xba, 0x4c4: 0xba, 0x4c5: 0xba, 0x4c6: 0xba, 0x4c7: 0xba,\n\t0x4c8: 0xba, 0x4c9: 0xba, 0x4ca: 0xba, 0x4cb: 0xba, 0x4cc: 0xba, 0x4cd: 0xba, 0x4ce: 0xba, 0x4cf: 0xba,\n\t0x4d0: 0x9f, 0x4d1: 0x9f, 0x4d2: 0x9f, 0x4d3: 0x9f, 0x4d4: 0x9f, 0x4d5: 0x9f, 0x4d6: 0x9f, 0x4d7: 0x9f,\n\t0x4d8: 0x9f, 0x4d9: 0x14c, 0x4da: 0xba, 0x4db: 0xba, 0x4dc: 0xba, 0x4dd: 0xba, 0x4de: 0xba, 0x4df: 0xba,\n\t0x4e0: 0xba, 0x4e1: 0xba, 0x4e2: 0xba, 0x4e3: 0xba, 0x4e4: 0xba, 0x4e5: 0xba, 0x4e6: 0xba, 0x4e7: 0xba,\n\t0x4e8: 0xba, 0x4e9: 0xba, 0x4ea: 0xba, 0x4eb: 0xba, 0x4ec: 0xba, 0x4ed: 0xba, 0x4ee: 0xba, 0x4ef: 0xba,\n\t0x4f0: 0xba, 0x4f1: 0xba, 0x4f2: 0xba, 0x4f3: 0xba, 0x4f4: 0xba, 0x4f5: 0xba, 0x4f6: 0xba, 0x4f7: 0xba,\n\t0x4f8: 0xba, 0x4f9: 0xba, 0x4fa: 0xba, 0x4fb: 0xba, 0x4fc: 0xba, 0x4fd: 0xba, 0x4fe: 0xba, 0x4ff: 0xba,\n\t// Block 0x14, offset 0x500\n\t0x500: 0xba, 0x501: 0xba, 0x502: 0xba, 0x503: 0xba, 0x504: 0xba, 0x505: 0xba, 0x506: 0xba, 0x507: 0xba,\n\t0x508: 0xba, 0x509: 0xba, 0x50a: 0xba, 0x50b: 0xba, 0x50c: 0xba, 0x50d: 0xba, 0x50e: 0xba, 0x50f: 0xba,\n\t0x510: 0xba, 0x511: 0xba, 0x512: 0xba, 0x513: 0xba, 0x514: 0xba, 0x515: 0xba, 0x516: 0xba, 0x517: 0xba,\n\t0x518: 0xba, 0x519: 0xba, 0x51a: 0xba, 0x51b: 0xba, 0x51c: 0xba, 0x51d: 0xba, 0x51e: 0xba, 0x51f: 0xba,\n\t0x520: 0x9f, 0x521: 0x9f, 0x522: 0x9f, 0x523: 0x9f, 0x524: 0x9f, 0x525: 0x9f, 0x526: 0x9f, 0x527: 0x9f,\n\t0x528: 0x142, 0x529: 0x14d, 0x52a: 0xba, 0x52b: 0x14e, 0x52c: 0x14f, 0x52d: 0x150, 0x52e: 0x151, 0x52f: 0xba,\n\t0x530: 0xba, 0x531: 0xba, 0x532: 0xba, 0x533: 0xba, 0x534: 0xba, 0x535: 0xba, 0x536: 0xba, 0x537: 0xba,\n\t0x538: 0xba, 0x539: 0xba, 0x53a: 0xba, 0x53b: 0xba, 0x53c: 0x9f, 0x53d: 0x152, 0x53e: 0x153, 0x53f: 0x154,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x9f, 0x541: 0x9f, 0x542: 0x9f, 0x543: 0x9f, 0x544: 0x9f, 0x545: 0x9f, 0x546: 0x9f, 0x547: 0x9f,\n\t0x548: 0x9f, 0x549: 0x9f, 0x54a: 0x9f, 0x54b: 0x9f, 0x54c: 0x9f, 0x54d: 0x9f, 0x54e: 0x9f, 0x54f: 0x9f,\n\t0x550: 0x9f, 0x551: 0x9f, 0x552: 0x9f, 0x553: 0x9f, 0x554: 0x9f, 0x555: 0x9f, 0x556: 0x9f, 0x557: 0x9f,\n\t0x558: 0x9f, 0x559: 0x9f, 0x55a: 0x9f, 0x55b: 0x9f, 0x55c: 0x9f, 0x55d: 0x9f, 0x55e: 0x9f, 0x55f: 0x155,\n\t0x560: 0x9f, 0x561: 0x9f, 0x562: 0x9f, 0x563: 0x9f, 0x564: 0x9f, 0x565: 0x9f, 0x566: 0x9f, 0x567: 0x9f,\n\t0x568: 0x9f, 0x569: 0x9f, 0x56a: 0x9f, 0x56b: 0x156, 0x56c: 0xba, 0x56d: 0xba, 0x56e: 0xba, 0x56f: 0xba,\n\t0x570: 0xba, 0x571: 0xba, 0x572: 0xba, 0x573: 0xba, 0x574: 0xba, 0x575: 0xba, 0x576: 0xba, 0x577: 0xba,\n\t0x578: 0xba, 0x579: 0xba, 0x57a: 0xba, 0x57b: 0xba, 0x57c: 0xba, 0x57d: 0xba, 0x57e: 0xba, 0x57f: 0xba,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x9f, 0x581: 0x9f, 0x582: 0x9f, 0x583: 0x9f, 0x584: 0x157, 0x585: 0x158, 0x586: 0x9f, 0x587: 0x9f,\n\t0x588: 0x9f, 0x589: 0x9f, 0x58a: 0x9f, 0x58b: 0x159, 0x58c: 0xba, 0x58d: 0xba, 0x58e: 0xba, 0x58f: 0xba,\n\t0x590: 0xba, 0x591: 0xba, 0x592: 0xba, 0x593: 0xba, 0x594: 0xba, 0x595: 0xba, 0x596: 0xba, 0x597: 0xba,\n\t0x598: 0xba, 0x599: 0xba, 0x59a: 0xba, 0x59b: 0xba, 0x59c: 0xba, 0x59d: 0xba, 0x59e: 0xba, 0x59f: 0xba,\n\t0x5a0: 0xba, 0x5a1: 0xba, 0x5a2: 0xba, 0x5a3: 0xba, 0x5a4: 0xba, 0x5a5: 0xba, 0x5a6: 0xba, 0x5a7: 0xba,\n\t0x5a8: 0xba, 0x5a9: 0xba, 0x5aa: 0xba, 0x5ab: 0xba, 0x5ac: 0xba, 0x5ad: 0xba, 0x5ae: 0xba, 0x5af: 0xba,\n\t0x5b0: 0x9f, 0x5b1: 0x15a, 0x5b2: 0x15b, 0x5b3: 0xba, 0x5b4: 0xba, 0x5b5: 0xba, 0x5b6: 0xba, 0x5b7: 0xba,\n\t0x5b8: 0xba, 0x5b9: 0xba, 0x5ba: 0xba, 0x5bb: 0xba, 0x5bc: 0xba, 0x5bd: 0xba, 0x5be: 0xba, 0x5bf: 0xba,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x9b, 0x5c1: 0x9b, 0x5c2: 0x9b, 0x5c3: 0x15c, 0x5c4: 0x15d, 0x5c5: 0x15e, 0x5c6: 0x15f, 0x5c7: 0x160,\n\t0x5c8: 0x9b, 0x5c9: 0x161, 0x5ca: 0xba, 0x5cb: 0xba, 0x5cc: 0x9b, 0x5cd: 0x162, 0x5ce: 0xba, 0x5cf: 0xba,\n\t0x5d0: 0x5f, 0x5d1: 0x60, 0x5d2: 0x61, 0x5d3: 0x62, 0x5d4: 0x63, 0x5d5: 0x64, 0x5d6: 0x65, 0x5d7: 0x66,\n\t0x5d8: 0x67, 0x5d9: 0x68, 0x5da: 0x69, 0x5db: 0x6a, 0x5dc: 0x6b, 0x5dd: 0x6c, 0x5de: 0x6d, 0x5df: 0x6e,\n\t0x5e0: 0x9b, 0x5e1: 0x9b, 0x5e2: 0x9b, 0x5e3: 0x9b, 0x5e4: 0x9b, 0x5e5: 0x9b, 0x5e6: 0x9b, 0x5e7: 0x9b,\n\t0x5e8: 0x163, 0x5e9: 0x164, 0x5ea: 0x165, 0x5eb: 0xba, 0x5ec: 0xba, 0x5ed: 0xba, 0x5ee: 0xba, 0x5ef: 0xba,\n\t0x5f0: 0xba, 0x5f1: 0xba, 0x5f2: 0xba, 0x5f3: 0xba, 0x5f4: 0xba, 0x5f5: 0xba, 0x5f6: 0xba, 0x5f7: 0xba,\n\t0x5f8: 0xba, 0x5f9: 0xba, 0x5fa: 0xba, 0x5fb: 0xba, 0x5fc: 0xba, 0x5fd: 0xba, 0x5fe: 0xba, 0x5ff: 0xba,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x166, 0x601: 0xba, 0x602: 0xba, 0x603: 0xba, 0x604: 0xba, 0x605: 0xba, 0x606: 0xba, 0x607: 0xba,\n\t0x608: 0xba, 0x609: 0xba, 0x60a: 0xba, 0x60b: 0xba, 0x60c: 0xba, 0x60d: 0xba, 0x60e: 0xba, 0x60f: 0xba,\n\t0x610: 0xba, 0x611: 0xba, 0x612: 0xba, 0x613: 0xba, 0x614: 0xba, 0x615: 0xba, 0x616: 0xba, 0x617: 0xba,\n\t0x618: 0xba, 0x619: 0xba, 0x61a: 0xba, 0x61b: 0xba, 0x61c: 0xba, 0x61d: 0xba, 0x61e: 0xba, 0x61f: 0xba,\n\t0x620: 0x122, 0x621: 0x122, 0x622: 0x122, 0x623: 0x167, 0x624: 0x6f, 0x625: 0x168, 0x626: 0xba, 0x627: 0xba,\n\t0x628: 0xba, 0x629: 0xba, 0x62a: 0xba, 0x62b: 0xba, 0x62c: 0xba, 0x62d: 0xba, 0x62e: 0xba, 0x62f: 0xba,\n\t0x630: 0xba, 0x631: 0xba, 0x632: 0xba, 0x633: 0xba, 0x634: 0xba, 0x635: 0xba, 0x636: 0xba, 0x637: 0xba,\n\t0x638: 0x70, 0x639: 0x71, 0x63a: 0x72, 0x63b: 0x169, 0x63c: 0xba, 0x63d: 0xba, 0x63e: 0xba, 0x63f: 0xba,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x16a, 0x641: 0x9b, 0x642: 0x16b, 0x643: 0x16c, 0x644: 0x73, 0x645: 0x74, 0x646: 0x16d, 0x647: 0x16e,\n\t0x648: 0x75, 0x649: 0x16f, 0x64a: 0xba, 0x64b: 0xba, 0x64c: 0x9b, 0x64d: 0x9b, 0x64e: 0x9b, 0x64f: 0x9b,\n\t0x650: 0x9b, 0x651: 0x9b, 0x652: 0x9b, 0x653: 0x9b, 0x654: 0x9b, 0x655: 0x9b, 0x656: 0x9b, 0x657: 0x9b,\n\t0x658: 0x9b, 0x659: 0x9b, 0x65a: 0x9b, 0x65b: 0x170, 0x65c: 0x9b, 0x65d: 0x171, 0x65e: 0x9b, 0x65f: 0x172,\n\t0x660: 0x173, 0x661: 0x174, 0x662: 0x175, 0x663: 0xba, 0x664: 0x176, 0x665: 0x177, 0x666: 0x178, 0x667: 0x179,\n\t0x668: 0xba, 0x669: 0xba, 0x66a: 0xba, 0x66b: 0xba, 0x66c: 0xba, 0x66d: 0xba, 0x66e: 0xba, 0x66f: 0xba,\n\t0x670: 0xba, 0x671: 0xba, 0x672: 0xba, 0x673: 0xba, 0x674: 0xba, 0x675: 0xba, 0x676: 0xba, 0x677: 0xba,\n\t0x678: 0xba, 0x679: 0xba, 0x67a: 0xba, 0x67b: 0xba, 0x67c: 0xba, 0x67d: 0xba, 0x67e: 0xba, 0x67f: 0xba,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x9f, 0x681: 0x9f, 0x682: 0x9f, 0x683: 0x9f, 0x684: 0x9f, 0x685: 0x9f, 0x686: 0x9f, 0x687: 0x9f,\n\t0x688: 0x9f, 0x689: 0x9f, 0x68a: 0x9f, 0x68b: 0x9f, 0x68c: 0x9f, 0x68d: 0x9f, 0x68e: 0x9f, 0x68f: 0x9f,\n\t0x690: 0x9f, 0x691: 0x9f, 0x692: 0x9f, 0x693: 0x9f, 0x694: 0x9f, 0x695: 0x9f, 0x696: 0x9f, 0x697: 0x9f,\n\t0x698: 0x9f, 0x699: 0x9f, 0x69a: 0x9f, 0x69b: 0x17a, 0x69c: 0x9f, 0x69d: 0x9f, 0x69e: 0x9f, 0x69f: 0x9f,\n\t0x6a0: 0x9f, 0x6a1: 0x9f, 0x6a2: 0x9f, 0x6a3: 0x9f, 0x6a4: 0x9f, 0x6a5: 0x9f, 0x6a6: 0x9f, 0x6a7: 0x9f,\n\t0x6a8: 0x9f, 0x6a9: 0x9f, 0x6aa: 0x9f, 0x6ab: 0x9f, 0x6ac: 0x9f, 0x6ad: 0x9f, 0x6ae: 0x9f, 0x6af: 0x9f,\n\t0x6b0: 0x9f, 0x6b1: 0x9f, 0x6b2: 0x9f, 0x6b3: 0x9f, 0x6b4: 0x9f, 0x6b5: 0x9f, 0x6b6: 0x9f, 0x6b7: 0x9f,\n\t0x6b8: 0x9f, 0x6b9: 0x9f, 0x6ba: 0x9f, 0x6bb: 0x9f, 0x6bc: 0x9f, 0x6bd: 0x9f, 0x6be: 0x9f, 0x6bf: 0x9f,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x9f, 0x6c1: 0x9f, 0x6c2: 0x9f, 0x6c3: 0x9f, 0x6c4: 0x9f, 0x6c5: 0x9f, 0x6c6: 0x9f, 0x6c7: 0x9f,\n\t0x6c8: 0x9f, 0x6c9: 0x9f, 0x6ca: 0x9f, 0x6cb: 0x9f, 0x6cc: 0x9f, 0x6cd: 0x9f, 0x6ce: 0x9f, 0x6cf: 0x9f,\n\t0x6d0: 0x9f, 0x6d1: 0x9f, 0x6d2: 0x9f, 0x6d3: 0x9f, 0x6d4: 0x9f, 0x6d5: 0x9f, 0x6d6: 0x9f, 0x6d7: 0x9f,\n\t0x6d8: 0x9f, 0x6d9: 0x9f, 0x6da: 0x9f, 0x6db: 0x9f, 0x6dc: 0x17b, 0x6dd: 0x9f, 0x6de: 0x9f, 0x6df: 0x9f,\n\t0x6e0: 0x17c, 0x6e1: 0x9f, 0x6e2: 0x9f, 0x6e3: 0x9f, 0x6e4: 0x9f, 0x6e5: 0x9f, 0x6e6: 0x9f, 0x6e7: 0x9f,\n\t0x6e8: 0x9f, 0x6e9: 0x9f, 0x6ea: 0x9f, 0x6eb: 0x9f, 0x6ec: 0x9f, 0x6ed: 0x9f, 0x6ee: 0x9f, 0x6ef: 0x9f,\n\t0x6f0: 0x9f, 0x6f1: 0x9f, 0x6f2: 0x9f, 0x6f3: 0x9f, 0x6f4: 0x9f, 0x6f5: 0x9f, 0x6f6: 0x9f, 0x6f7: 0x9f,\n\t0x6f8: 0x9f, 0x6f9: 0x9f, 0x6fa: 0x9f, 0x6fb: 0x9f, 0x6fc: 0x9f, 0x6fd: 0x9f, 0x6fe: 0x9f, 0x6ff: 0x9f,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x9f, 0x701: 0x9f, 0x702: 0x9f, 0x703: 0x9f, 0x704: 0x9f, 0x705: 0x9f, 0x706: 0x9f, 0x707: 0x9f,\n\t0x708: 0x9f, 0x709: 0x9f, 0x70a: 0x9f, 0x70b: 0x9f, 0x70c: 0x9f, 0x70d: 0x9f, 0x70e: 0x9f, 0x70f: 0x9f,\n\t0x710: 0x9f, 0x711: 0x9f, 0x712: 0x9f, 0x713: 0x9f, 0x714: 0x9f, 0x715: 0x9f, 0x716: 0x9f, 0x717: 0x9f,\n\t0x718: 0x9f, 0x719: 0x9f, 0x71a: 0x9f, 0x71b: 0x9f, 0x71c: 0x9f, 0x71d: 0x9f, 0x71e: 0x9f, 0x71f: 0x9f,\n\t0x720: 0x9f, 0x721: 0x9f, 0x722: 0x9f, 0x723: 0x9f, 0x724: 0x9f, 0x725: 0x9f, 0x726: 0x9f, 0x727: 0x9f,\n\t0x728: 0x9f, 0x729: 0x9f, 0x72a: 0x9f, 0x72b: 0x9f, 0x72c: 0x9f, 0x72d: 0x9f, 0x72e: 0x9f, 0x72f: 0x9f,\n\t0x730: 0x9f, 0x731: 0x9f, 0x732: 0x9f, 0x733: 0x9f, 0x734: 0x9f, 0x735: 0x9f, 0x736: 0x9f, 0x737: 0x9f,\n\t0x738: 0x9f, 0x739: 0x9f, 0x73a: 0x17d, 0x73b: 0x9f, 0x73c: 0x9f, 0x73d: 0x9f, 0x73e: 0x9f, 0x73f: 0x9f,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0x9f, 0x741: 0x9f, 0x742: 0x9f, 0x743: 0x9f, 0x744: 0x9f, 0x745: 0x9f, 0x746: 0x9f, 0x747: 0x9f,\n\t0x748: 0x9f, 0x749: 0x9f, 0x74a: 0x9f, 0x74b: 0x9f, 0x74c: 0x9f, 0x74d: 0x9f, 0x74e: 0x9f, 0x74f: 0x9f,\n\t0x750: 0x9f, 0x751: 0x9f, 0x752: 0x9f, 0x753: 0x9f, 0x754: 0x9f, 0x755: 0x9f, 0x756: 0x9f, 0x757: 0x9f,\n\t0x758: 0x9f, 0x759: 0x9f, 0x75a: 0x9f, 0x75b: 0x9f, 0x75c: 0x9f, 0x75d: 0x9f, 0x75e: 0x9f, 0x75f: 0x9f,\n\t0x760: 0x9f, 0x761: 0x9f, 0x762: 0x9f, 0x763: 0x9f, 0x764: 0x9f, 0x765: 0x9f, 0x766: 0x9f, 0x767: 0x9f,\n\t0x768: 0x9f, 0x769: 0x9f, 0x76a: 0x9f, 0x76b: 0x9f, 0x76c: 0x9f, 0x76d: 0x9f, 0x76e: 0x9f, 0x76f: 0x17e,\n\t0x770: 0xba, 0x771: 0xba, 0x772: 0xba, 0x773: 0xba, 0x774: 0xba, 0x775: 0xba, 0x776: 0xba, 0x777: 0xba,\n\t0x778: 0xba, 0x779: 0xba, 0x77a: 0xba, 0x77b: 0xba, 0x77c: 0xba, 0x77d: 0xba, 0x77e: 0xba, 0x77f: 0xba,\n\t// Block 0x1e, offset 0x780\n\t0x780: 0xba, 0x781: 0xba, 0x782: 0xba, 0x783: 0xba, 0x784: 0xba, 0x785: 0xba, 0x786: 0xba, 0x787: 0xba,\n\t0x788: 0xba, 0x789: 0xba, 0x78a: 0xba, 0x78b: 0xba, 0x78c: 0xba, 0x78d: 0xba, 0x78e: 0xba, 0x78f: 0xba,\n\t0x790: 0xba, 0x791: 0xba, 0x792: 0xba, 0x793: 0xba, 0x794: 0xba, 0x795: 0xba, 0x796: 0xba, 0x797: 0xba,\n\t0x798: 0xba, 0x799: 0xba, 0x79a: 0xba, 0x79b: 0xba, 0x79c: 0xba, 0x79d: 0xba, 0x79e: 0xba, 0x79f: 0xba,\n\t0x7a0: 0x76, 0x7a1: 0x77, 0x7a2: 0x78, 0x7a3: 0x17f, 0x7a4: 0x79, 0x7a5: 0x7a, 0x7a6: 0x180, 0x7a7: 0x7b,\n\t0x7a8: 0x7c, 0x7a9: 0xba, 0x7aa: 0xba, 0x7ab: 0xba, 0x7ac: 0xba, 0x7ad: 0xba, 0x7ae: 0xba, 0x7af: 0xba,\n\t0x7b0: 0xba, 0x7b1: 0xba, 0x7b2: 0xba, 0x7b3: 0xba, 0x7b4: 0xba, 0x7b5: 0xba, 0x7b6: 0xba, 0x7b7: 0xba,\n\t0x7b8: 0xba, 0x7b9: 0xba, 0x7ba: 0xba, 0x7bb: 0xba, 0x7bc: 0xba, 0x7bd: 0xba, 0x7be: 0xba, 0x7bf: 0xba,\n\t// Block 0x1f, offset 0x7c0\n\t0x7d0: 0x0d, 0x7d1: 0x0e, 0x7d2: 0x0f, 0x7d3: 0x10, 0x7d4: 0x11, 0x7d5: 0x0b, 0x7d6: 0x12, 0x7d7: 0x07,\n\t0x7d8: 0x13, 0x7d9: 0x0b, 0x7da: 0x0b, 0x7db: 0x14, 0x7dc: 0x0b, 0x7dd: 0x15, 0x7de: 0x16, 0x7df: 0x17,\n\t0x7e0: 0x07, 0x7e1: 0x07, 0x7e2: 0x07, 0x7e3: 0x07, 0x7e4: 0x07, 0x7e5: 0x07, 0x7e6: 0x07, 0x7e7: 0x07,\n\t0x7e8: 0x07, 0x7e9: 0x07, 0x7ea: 0x18, 0x7eb: 0x19, 0x7ec: 0x1a, 0x7ed: 0x07, 0x7ee: 0x1b, 0x7ef: 0x1c,\n\t0x7f0: 0x0b, 0x7f1: 0x0b, 0x7f2: 0x0b, 0x7f3: 0x0b, 0x7f4: 0x0b, 0x7f5: 0x0b, 0x7f6: 0x0b, 0x7f7: 0x0b,\n\t0x7f8: 0x0b, 0x7f9: 0x0b, 0x7fa: 0x0b, 0x7fb: 0x0b, 0x7fc: 0x0b, 0x7fd: 0x0b, 0x7fe: 0x0b, 0x7ff: 0x0b,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x0b, 0x801: 0x0b, 0x802: 0x0b, 0x803: 0x0b, 0x804: 0x0b, 0x805: 0x0b, 0x806: 0x0b, 0x807: 0x0b,\n\t0x808: 0x0b, 0x809: 0x0b, 0x80a: 0x0b, 0x80b: 0x0b, 0x80c: 0x0b, 0x80d: 0x0b, 0x80e: 0x0b, 0x80f: 0x0b,\n\t0x810: 0x0b, 0x811: 0x0b, 0x812: 0x0b, 0x813: 0x0b, 0x814: 0x0b, 0x815: 0x0b, 0x816: 0x0b, 0x817: 0x0b,\n\t0x818: 0x0b, 0x819: 0x0b, 0x81a: 0x0b, 0x81b: 0x0b, 0x81c: 0x0b, 0x81d: 0x0b, 0x81e: 0x0b, 0x81f: 0x0b,\n\t0x820: 0x0b, 0x821: 0x0b, 0x822: 0x0b, 0x823: 0x0b, 0x824: 0x0b, 0x825: 0x0b, 0x826: 0x0b, 0x827: 0x0b,\n\t0x828: 0x0b, 0x829: 0x0b, 0x82a: 0x0b, 0x82b: 0x0b, 0x82c: 0x0b, 0x82d: 0x0b, 0x82e: 0x0b, 0x82f: 0x0b,\n\t0x830: 0x0b, 0x831: 0x0b, 0x832: 0x0b, 0x833: 0x0b, 0x834: 0x0b, 0x835: 0x0b, 0x836: 0x0b, 0x837: 0x0b,\n\t0x838: 0x0b, 0x839: 0x0b, 0x83a: 0x0b, 0x83b: 0x0b, 0x83c: 0x0b, 0x83d: 0x0b, 0x83e: 0x0b, 0x83f: 0x0b,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x181, 0x841: 0x182, 0x842: 0xba, 0x843: 0xba, 0x844: 0x183, 0x845: 0x183, 0x846: 0x183, 0x847: 0x184,\n\t0x848: 0xba, 0x849: 0xba, 0x84a: 0xba, 0x84b: 0xba, 0x84c: 0xba, 0x84d: 0xba, 0x84e: 0xba, 0x84f: 0xba,\n\t0x850: 0xba, 0x851: 0xba, 0x852: 0xba, 0x853: 0xba, 0x854: 0xba, 0x855: 0xba, 0x856: 0xba, 0x857: 0xba,\n\t0x858: 0xba, 0x859: 0xba, 0x85a: 0xba, 0x85b: 0xba, 0x85c: 0xba, 0x85d: 0xba, 0x85e: 0xba, 0x85f: 0xba,\n\t0x860: 0xba, 0x861: 0xba, 0x862: 0xba, 0x863: 0xba, 0x864: 0xba, 0x865: 0xba, 0x866: 0xba, 0x867: 0xba,\n\t0x868: 0xba, 0x869: 0xba, 0x86a: 0xba, 0x86b: 0xba, 0x86c: 0xba, 0x86d: 0xba, 0x86e: 0xba, 0x86f: 0xba,\n\t0x870: 0xba, 0x871: 0xba, 0x872: 0xba, 0x873: 0xba, 0x874: 0xba, 0x875: 0xba, 0x876: 0xba, 0x877: 0xba,\n\t0x878: 0xba, 0x879: 0xba, 0x87a: 0xba, 0x87b: 0xba, 0x87c: 0xba, 0x87d: 0xba, 0x87e: 0xba, 0x87f: 0xba,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x0b, 0x881: 0x0b, 0x882: 0x0b, 0x883: 0x0b, 0x884: 0x0b, 0x885: 0x0b, 0x886: 0x0b, 0x887: 0x0b,\n\t0x888: 0x0b, 0x889: 0x0b, 0x88a: 0x0b, 0x88b: 0x0b, 0x88c: 0x0b, 0x88d: 0x0b, 0x88e: 0x0b, 0x88f: 0x0b,\n\t0x890: 0x0b, 0x891: 0x0b, 0x892: 0x0b, 0x893: 0x0b, 0x894: 0x0b, 0x895: 0x0b, 0x896: 0x0b, 0x897: 0x0b,\n\t0x898: 0x0b, 0x899: 0x0b, 0x89a: 0x0b, 0x89b: 0x0b, 0x89c: 0x0b, 0x89d: 0x0b, 0x89e: 0x0b, 0x89f: 0x0b,\n\t0x8a0: 0x1f, 0x8a1: 0x0b, 0x8a2: 0x0b, 0x8a3: 0x0b, 0x8a4: 0x0b, 0x8a5: 0x0b, 0x8a6: 0x0b, 0x8a7: 0x0b,\n\t0x8a8: 0x0b, 0x8a9: 0x0b, 0x8aa: 0x0b, 0x8ab: 0x0b, 0x8ac: 0x0b, 0x8ad: 0x0b, 0x8ae: 0x0b, 0x8af: 0x0b,\n\t0x8b0: 0x0b, 0x8b1: 0x0b, 0x8b2: 0x0b, 0x8b3: 0x0b, 0x8b4: 0x0b, 0x8b5: 0x0b, 0x8b6: 0x0b, 0x8b7: 0x0b,\n\t0x8b8: 0x0b, 0x8b9: 0x0b, 0x8ba: 0x0b, 0x8bb: 0x0b, 0x8bc: 0x0b, 0x8bd: 0x0b, 0x8be: 0x0b, 0x8bf: 0x0b,\n\t// Block 0x23, offset 0x8c0\n\t0x8c0: 0x0b, 0x8c1: 0x0b, 0x8c2: 0x0b, 0x8c3: 0x0b, 0x8c4: 0x0b, 0x8c5: 0x0b, 0x8c6: 0x0b, 0x8c7: 0x0b,\n\t0x8c8: 0x0b, 0x8c9: 0x0b, 0x8ca: 0x0b, 0x8cb: 0x0b, 0x8cc: 0x0b, 0x8cd: 0x0b, 0x8ce: 0x0b, 0x8cf: 0x0b,\n}\n\n// idnaSparseOffset: 264 entries, 528 bytes\nvar idnaSparseOffset = []uint16{0x0, 0x8, 0x19, 0x25, 0x27, 0x2c, 0x34, 0x3f, 0x4b, 0x4f, 0x5e, 0x63, 0x6b, 0x77, 0x85, 0x8a, 0x93, 0xa3, 0xb1, 0xbd, 0xc9, 0xda, 0xe4, 0xeb, 0xf8, 0x109, 0x110, 0x11b, 0x12a, 0x138, 0x142, 0x144, 0x149, 0x14c, 0x14f, 0x151, 0x15d, 0x168, 0x170, 0x176, 0x17c, 0x181, 0x186, 0x189, 0x18d, 0x193, 0x198, 0x1a4, 0x1ae, 0x1b4, 0x1c5, 0x1cf, 0x1d2, 0x1da, 0x1dd, 0x1ea, 0x1f2, 0x1f6, 0x1fd, 0x205, 0x215, 0x221, 0x223, 0x22d, 0x239, 0x245, 0x251, 0x259, 0x25e, 0x268, 0x279, 0x27d, 0x288, 0x28c, 0x295, 0x29d, 0x2a3, 0x2a8, 0x2ab, 0x2af, 0x2b5, 0x2b9, 0x2bd, 0x2c3, 0x2ca, 0x2d0, 0x2d8, 0x2df, 0x2ea, 0x2f4, 0x2f8, 0x2fb, 0x301, 0x305, 0x307, 0x30a, 0x30c, 0x30f, 0x319, 0x31c, 0x32b, 0x32f, 0x334, 0x337, 0x33b, 0x340, 0x345, 0x34b, 0x351, 0x360, 0x366, 0x36a, 0x379, 0x37e, 0x386, 0x390, 0x39b, 0x3a3, 0x3b4, 0x3bd, 0x3cd, 0x3da, 0x3e4, 0x3e9, 0x3f6, 0x3fa, 0x3ff, 0x401, 0x405, 0x407, 0x40b, 0x414, 0x41a, 0x41e, 0x42e, 0x438, 0x43d, 0x440, 0x446, 0x44d, 0x452, 0x456, 0x45c, 0x461, 0x46a, 0x46f, 0x475, 0x47c, 0x483, 0x48a, 0x48e, 0x493, 0x496, 0x49b, 0x4a7, 0x4ad, 0x4b2, 0x4b9, 0x4c1, 0x4c6, 0x4ca, 0x4da, 0x4e1, 0x4e5, 0x4e9, 0x4f0, 0x4f2, 0x4f5, 0x4f8, 0x4fc, 0x500, 0x506, 0x50f, 0x51b, 0x522, 0x52b, 0x533, 0x53a, 0x548, 0x555, 0x562, 0x56b, 0x56f, 0x57d, 0x585, 0x590, 0x599, 0x59f, 0x5a7, 0x5b0, 0x5ba, 0x5bd, 0x5c9, 0x5cc, 0x5d1, 0x5de, 0x5e7, 0x5f3, 0x5f6, 0x600, 0x609, 0x615, 0x622, 0x62a, 0x62d, 0x632, 0x635, 0x638, 0x63b, 0x642, 0x649, 0x64d, 0x658, 0x65b, 0x661, 0x666, 0x66a, 0x66d, 0x670, 0x673, 0x676, 0x679, 0x67e, 0x688, 0x68b, 0x68f, 0x69e, 0x6aa, 0x6ae, 0x6b3, 0x6b8, 0x6bc, 0x6c1, 0x6ca, 0x6d5, 0x6db, 0x6e3, 0x6e7, 0x6eb, 0x6f1, 0x6f7, 0x6fc, 0x6ff, 0x70f, 0x716, 0x719, 0x71c, 0x720, 0x726, 0x72b, 0x730, 0x735, 0x738, 0x73d, 0x740, 0x743, 0x747, 0x74b, 0x74e, 0x75e, 0x76f, 0x774, 0x776, 0x778}\n\n// idnaSparseValues: 1915 entries, 7660 bytes\nvar idnaSparseValues = [1915]valueRange{\n\t// Block 0x0, offset 0x0\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0xe105, lo: 0x80, hi: 0x96},\n\t{value: 0x0018, lo: 0x97, hi: 0x97},\n\t{value: 0xe105, lo: 0x98, hi: 0x9e},\n\t{value: 0x001f, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbf},\n\t// Block 0x1, offset 0x8\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0xe01d, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0335, lo: 0x83, hi: 0x83},\n\t{value: 0x034d, lo: 0x84, hi: 0x84},\n\t{value: 0x0365, lo: 0x85, hi: 0x85},\n\t{value: 0xe00d, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0xe00d, lo: 0x88, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x89},\n\t{value: 0xe00d, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe00d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0x8d},\n\t{value: 0xe00d, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0xbf},\n\t// Block 0x2, offset 0x19\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x0249, lo: 0xb0, hi: 0xb0},\n\t{value: 0x037d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0259, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0269, lo: 0xb3, hi: 0xb3},\n\t{value: 0x034d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0395, lo: 0xb5, hi: 0xb5},\n\t{value: 0xe1bd, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0279, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0289, lo: 0xb8, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbf},\n\t// Block 0x3, offset 0x25\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x3308, lo: 0x80, hi: 0xbf},\n\t// Block 0x4, offset 0x27\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x03f5, lo: 0x80, hi: 0x8f},\n\t{value: 0xe105, lo: 0x90, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5, offset 0x2c\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x0545, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x0008, lo: 0x99, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xbf},\n\t// Block 0x6, offset 0x34\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0401, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x88},\n\t{value: 0x0018, lo: 0x89, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x3308, lo: 0x91, hi: 0xbd},\n\t{value: 0x0818, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x7, offset 0x3f\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0818, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x82},\n\t{value: 0x0818, lo: 0x83, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x85},\n\t{value: 0x0818, lo: 0x86, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0808, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x8, offset 0x4b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0a08, lo: 0x80, hi: 0x87},\n\t{value: 0x0c08, lo: 0x88, hi: 0x99},\n\t{value: 0x0a08, lo: 0x9a, hi: 0xbf},\n\t// Block 0x9, offset 0x4f\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3308, lo: 0x80, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0c08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0a08, lo: 0x8e, hi: 0x98},\n\t{value: 0x0c08, lo: 0x99, hi: 0x9b},\n\t{value: 0x0a08, lo: 0x9c, hi: 0xaa},\n\t{value: 0x0c08, lo: 0xab, hi: 0xac},\n\t{value: 0x0a08, lo: 0xad, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0a08, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0c08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0a08, lo: 0xb5, hi: 0xb7},\n\t{value: 0x0c08, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbf},\n\t// Block 0xa, offset 0x5e\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xb0},\n\t{value: 0x0808, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xb, offset 0x63\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x89},\n\t{value: 0x0a08, lo: 0x8a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0xc, offset 0x6b\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x99},\n\t{value: 0x0808, lo: 0x9a, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa3},\n\t{value: 0x0808, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa7},\n\t{value: 0x0808, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0818, lo: 0xb0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xd, offset 0x77\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0a08, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0c08, lo: 0xaa, hi: 0xac},\n\t{value: 0x0808, lo: 0xad, hi: 0xad},\n\t{value: 0x0c08, lo: 0xae, hi: 0xae},\n\t{value: 0x0a08, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb2},\n\t{value: 0x0a08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0a08, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0c08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0xe, offset 0x85\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x93},\n\t{value: 0x3308, lo: 0x94, hi: 0xa1},\n\t{value: 0x0840, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xbf},\n\t// Block 0xf, offset 0x8a\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x10, offset 0x93\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x85},\n\t{value: 0x3008, lo: 0x86, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x3008, lo: 0x8a, hi: 0x8c},\n\t{value: 0x3b08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x11, offset 0xa3\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0008, lo: 0xaa, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x12, offset 0xb1\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xba},\n\t{value: 0x3b08, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x13, offset 0xbd\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0040, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x14, offset 0xc9\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x89},\n\t{value: 0x3b08, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x3008, lo: 0x98, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x15, offset 0xda\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb2},\n\t{value: 0x08f1, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb9},\n\t{value: 0x3b08, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x0018, lo: 0xbf, hi: 0xbf},\n\t// Block 0x16, offset 0xe4\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x8e},\n\t{value: 0x0018, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0xbf},\n\t// Block 0x17, offset 0xeb\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0961, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0999, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0008, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x18, offset 0xf8\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe03d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x19, offset 0x109\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0xbf},\n\t// Block 0x1a, offset 0x110\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x1b, offset 0x11b\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x3008, lo: 0x96, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x3308, lo: 0x9e, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3008, lo: 0xa2, hi: 0xa4},\n\t{value: 0x0008, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xbf},\n\t// Block 0x1c, offset 0x12a\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x8c},\n\t{value: 0x3308, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x3008, lo: 0x9a, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x1d, offset 0x138\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x86},\n\t{value: 0x055d, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8c},\n\t{value: 0x055d, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe105, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x1e, offset 0x142\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0018, lo: 0x80, hi: 0xbf},\n\t// Block 0x1f, offset 0x144\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa0},\n\t{value: 0x2018, lo: 0xa1, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x20, offset 0x149\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa7},\n\t{value: 0x2018, lo: 0xa8, hi: 0xbf},\n\t// Block 0x21, offset 0x14c\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x2018, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0xbf},\n\t// Block 0x22, offset 0x14f\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0008, lo: 0x80, hi: 0xbf},\n\t// Block 0x23, offset 0x151\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x24, offset 0x15d\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x25, offset 0x168\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x26, offset 0x170\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x27, offset 0x176\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x28, offset 0x17c\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x29, offset 0x181\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x2a, offset 0x186\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x2b, offset 0x189\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xbf},\n\t// Block 0x2c, offset 0x18d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x2d, offset 0x193\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0x2e, offset 0x198\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x3b08, lo: 0x94, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3b08, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x2f, offset 0x1a4\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x30, offset 0x1ae\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xb3},\n\t{value: 0x3340, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x31, offset 0x1b4\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x3008, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x88},\n\t{value: 0x3308, lo: 0x89, hi: 0x91},\n\t{value: 0x3b08, lo: 0x92, hi: 0x92},\n\t{value: 0x3308, lo: 0x93, hi: 0x93},\n\t{value: 0x0018, lo: 0x94, hi: 0x96},\n\t{value: 0x0008, lo: 0x97, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x32, offset 0x1c5\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x86},\n\t{value: 0x0218, lo: 0x87, hi: 0x87},\n\t{value: 0x0018, lo: 0x88, hi: 0x8a},\n\t{value: 0x33c0, lo: 0x8b, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0208, lo: 0xa0, hi: 0xbf},\n\t// Block 0x33, offset 0x1cf\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0208, lo: 0x80, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x34, offset 0x1d2\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0208, lo: 0x87, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0208, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x35, offset 0x1da\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0x36, offset 0x1dd\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x37, offset 0x1ea\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x38, offset 0x1f2\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x39, offset 0x1f6\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0028, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0xbf},\n\t// Block 0x3a, offset 0x1fd\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x3308, lo: 0x97, hi: 0x98},\n\t{value: 0x3008, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x3b, offset 0x205\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x94},\n\t{value: 0x3008, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3b08, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xac},\n\t{value: 0x3008, lo: 0xad, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3c, offset 0x215\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xbd},\n\t{value: 0x3318, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3d, offset 0x221\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0040, lo: 0x80, hi: 0xbf},\n\t// Block 0x3e, offset 0x223\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x83},\n\t{value: 0x3008, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x3f, offset 0x22d\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x3808, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x40, offset 0x239\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3808, lo: 0xaa, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xbf},\n\t// Block 0x41, offset 0x245\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3008, lo: 0xaa, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3808, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbf},\n\t// Block 0x42, offset 0x251\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x3008, lo: 0xa4, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbf},\n\t// Block 0x43, offset 0x259\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x44, offset 0x25e\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0e29, lo: 0x80, hi: 0x80},\n\t{value: 0x0e41, lo: 0x81, hi: 0x81},\n\t{value: 0x0e59, lo: 0x82, hi: 0x82},\n\t{value: 0x0e71, lo: 0x83, hi: 0x83},\n\t{value: 0x0e89, lo: 0x84, hi: 0x85},\n\t{value: 0x0ea1, lo: 0x86, hi: 0x86},\n\t{value: 0x0eb9, lo: 0x87, hi: 0x87},\n\t{value: 0x057d, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0x45, offset 0x268\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x92},\n\t{value: 0x0018, lo: 0x93, hi: 0x93},\n\t{value: 0x3308, lo: 0x94, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa8},\n\t{value: 0x0008, lo: 0xa9, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x3008, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x46, offset 0x279\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0x47, offset 0x27d\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x87},\n\t{value: 0xe045, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0xe045, lo: 0x98, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0xe045, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbf},\n\t// Block 0x48, offset 0x288\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x3318, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbf},\n\t// Block 0x49, offset 0x28c\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x88},\n\t{value: 0x24c1, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x4a, offset 0x295\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x24f1, lo: 0xac, hi: 0xac},\n\t{value: 0x2529, lo: 0xad, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xae},\n\t{value: 0x2579, lo: 0xaf, hi: 0xaf},\n\t{value: 0x25b1, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0x4b, offset 0x29d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x9f},\n\t{value: 0x0080, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xad},\n\t{value: 0x0080, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x4c, offset 0x2a3\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xa8},\n\t{value: 0x09c5, lo: 0xa9, hi: 0xa9},\n\t{value: 0x09e5, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xbf},\n\t// Block 0x4d, offset 0x2a8\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xbf},\n\t// Block 0x4e, offset 0x2ab\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x28c1, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0xbf},\n\t// Block 0x4f, offset 0x2af\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0e66, lo: 0xb4, hi: 0xb4},\n\t{value: 0x292a, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0e86, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x50, offset 0x2b5\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x9b},\n\t{value: 0x2941, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0xbf},\n\t// Block 0x51, offset 0x2b9\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x52, offset 0x2bd\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbc},\n\t{value: 0x0018, lo: 0xbd, hi: 0xbf},\n\t// Block 0x53, offset 0x2c3\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x92},\n\t{value: 0x0040, lo: 0x93, hi: 0xab},\n\t{value: 0x0018, lo: 0xac, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x54, offset 0x2ca\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x03f5, lo: 0x90, hi: 0x9f},\n\t{value: 0x0ea5, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x55, offset 0x2d0\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xac},\n\t{value: 0x0008, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x56, offset 0x2d8\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xae},\n\t{value: 0xe075, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0x57, offset 0x2df\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x58, offset 0x2ea\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xbf},\n\t// Block 0x59, offset 0x2f4\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5a, offset 0x2f8\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0xbf},\n\t// Block 0x5b, offset 0x2fb\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9e},\n\t{value: 0x0edd, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0x5c, offset 0x301\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb2},\n\t{value: 0x0efd, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x5d, offset 0x305\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x0f1d, lo: 0x80, hi: 0xbf},\n\t// Block 0x5e, offset 0x307\n\t{value: 0x0020, lo: 0x02},\n\t{value: 0x171d, lo: 0x80, hi: 0x8f},\n\t{value: 0x18fd, lo: 0x90, hi: 0xbf},\n\t// Block 0x5f, offset 0x30a\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x1efd, lo: 0x80, hi: 0xbf},\n\t// Block 0x60, offset 0x30c\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x61, offset 0x30f\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9a},\n\t{value: 0x29e2, lo: 0x9b, hi: 0x9b},\n\t{value: 0x2a0a, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0008, lo: 0x9d, hi: 0x9e},\n\t{value: 0x2a31, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xbf},\n\t// Block 0x62, offset 0x319\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xbe},\n\t{value: 0x2a69, lo: 0xbf, hi: 0xbf},\n\t// Block 0x63, offset 0x31c\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0040, lo: 0x80, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xb0},\n\t{value: 0x2a1d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x2a3d, lo: 0xb2, hi: 0xb2},\n\t{value: 0x2a5d, lo: 0xb3, hi: 0xb3},\n\t{value: 0x2a7d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x2a5d, lo: 0xb5, hi: 0xb5},\n\t{value: 0x2a9d, lo: 0xb6, hi: 0xb6},\n\t{value: 0x2abd, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2add, lo: 0xb8, hi: 0xb9},\n\t{value: 0x2afd, lo: 0xba, hi: 0xbb},\n\t{value: 0x2b1d, lo: 0xbc, hi: 0xbd},\n\t{value: 0x2afd, lo: 0xbe, hi: 0xbf},\n\t// Block 0x64, offset 0x32b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x65, offset 0x32f\n\t{value: 0x0030, lo: 0x04},\n\t{value: 0x2aa2, lo: 0x80, hi: 0x9d},\n\t{value: 0x305a, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x30a2, lo: 0xa0, hi: 0xbf},\n\t// Block 0x66, offset 0x334\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xbf},\n\t// Block 0x67, offset 0x337\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x68, offset 0x33b\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x69, offset 0x340\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xbf},\n\t// Block 0x6a, offset 0x345\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0018, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x6b, offset 0x34b\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0xb6},\n\t{value: 0x0008, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2009, lo: 0xb8, hi: 0xb8},\n\t{value: 0x6e89, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xbf},\n\t// Block 0x6c, offset 0x351\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x3308, lo: 0x8b, hi: 0x8b},\n\t{value: 0x0008, lo: 0x8c, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x6d, offset 0x360\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0208, lo: 0x80, hi: 0xb1},\n\t{value: 0x0108, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x6e, offset 0x366\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xbf},\n\t// Block 0x6f, offset 0x36a\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3008, lo: 0x80, hi: 0x83},\n\t{value: 0x3b08, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xba},\n\t{value: 0x0008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x70, offset 0x379\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x71, offset 0x37e\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x91},\n\t{value: 0x3008, lo: 0x92, hi: 0x92},\n\t{value: 0x3808, lo: 0x93, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x72, offset 0x386\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb9},\n\t{value: 0x3008, lo: 0xba, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x73, offset 0x390\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x74, offset 0x39b\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x75, offset 0x3a3\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8c},\n\t{value: 0x3008, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x76, offset 0x3b4\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x77, offset 0x3bd\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x9a},\n\t{value: 0x0008, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3b08, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x78, offset 0x3cd\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x90},\n\t{value: 0x0008, lo: 0x91, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x79, offset 0x3da\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x4465, lo: 0x9c, hi: 0x9c},\n\t{value: 0x447d, lo: 0x9d, hi: 0x9d},\n\t{value: 0x2971, lo: 0x9e, hi: 0x9e},\n\t{value: 0xe06d, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xaf},\n\t{value: 0x4495, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7a, offset 0x3e4\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x44b5, lo: 0x80, hi: 0x8f},\n\t{value: 0x44d5, lo: 0x90, hi: 0x9f},\n\t{value: 0x44f5, lo: 0xa0, hi: 0xaf},\n\t{value: 0x44d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7b, offset 0x3e9\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3b08, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x7c, offset 0x3f6\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7d, offset 0x3fa\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x7e, offset 0x3ff\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x4515, lo: 0x80, hi: 0xbf},\n\t// Block 0x7f, offset 0x401\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x4d15, lo: 0x80, hi: 0x94},\n\t{value: 0x4ad5, lo: 0x95, hi: 0x95},\n\t{value: 0x4fb5, lo: 0x96, hi: 0xbf},\n\t// Block 0x80, offset 0x405\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x54f5, lo: 0x80, hi: 0xbf},\n\t// Block 0x81, offset 0x407\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x5cf5, lo: 0x80, hi: 0x84},\n\t{value: 0x5655, lo: 0x85, hi: 0x85},\n\t{value: 0x5d95, lo: 0x86, hi: 0xbf},\n\t// Block 0x82, offset 0x40b\n\t{value: 0x0020, lo: 0x08},\n\t{value: 0x6b55, lo: 0x80, hi: 0x8f},\n\t{value: 0x6d15, lo: 0x90, hi: 0x90},\n\t{value: 0x6d55, lo: 0x91, hi: 0xab},\n\t{value: 0x6ea1, lo: 0xac, hi: 0xac},\n\t{value: 0x70b5, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x70d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x83, offset 0x414\n\t{value: 0x0020, lo: 0x05},\n\t{value: 0x72d5, lo: 0x80, hi: 0xad},\n\t{value: 0x6535, lo: 0xae, hi: 0xae},\n\t{value: 0x7895, lo: 0xaf, hi: 0xb5},\n\t{value: 0x6f55, lo: 0xb6, hi: 0xb6},\n\t{value: 0x7975, lo: 0xb7, hi: 0xbf},\n\t// Block 0x84, offset 0x41a\n\t{value: 0x0028, lo: 0x03},\n\t{value: 0x7c21, lo: 0x80, hi: 0x82},\n\t{value: 0x7be1, lo: 0x83, hi: 0x83},\n\t{value: 0x7c99, lo: 0x84, hi: 0xbf},\n\t// Block 0x85, offset 0x41e\n\t{value: 0x0038, lo: 0x0f},\n\t{value: 0x9db1, lo: 0x80, hi: 0x83},\n\t{value: 0x9e59, lo: 0x84, hi: 0x85},\n\t{value: 0x9e91, lo: 0x86, hi: 0x87},\n\t{value: 0x9ec9, lo: 0x88, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0xa089, lo: 0x92, hi: 0x97},\n\t{value: 0xa1a1, lo: 0x98, hi: 0x9c},\n\t{value: 0xa281, lo: 0x9d, hi: 0xb3},\n\t{value: 0x9d41, lo: 0xb4, hi: 0xb4},\n\t{value: 0x9db1, lo: 0xb5, hi: 0xb5},\n\t{value: 0xa789, lo: 0xb6, hi: 0xbb},\n\t{value: 0xa869, lo: 0xbc, hi: 0xbc},\n\t{value: 0xa7f9, lo: 0xbd, hi: 0xbd},\n\t{value: 0xa8d9, lo: 0xbe, hi: 0xbf},\n\t// Block 0x86, offset 0x42e\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0008, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x87, offset 0x438\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0x88, offset 0x43d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x89, offset 0x440\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x8a, offset 0x446\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0x8b, offset 0x44d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x8c, offset 0x452\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x8d, offset 0x456\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x8e, offset 0x45c\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xac},\n\t{value: 0x0008, lo: 0xad, hi: 0xbf},\n\t// Block 0x8f, offset 0x461\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x90, offset 0x46a\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x91, offset 0x46f\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0xbf},\n\t// Block 0x92, offset 0x475\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x97},\n\t{value: 0x8ad5, lo: 0x98, hi: 0x9f},\n\t{value: 0x8aed, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xbf},\n\t// Block 0x93, offset 0x47c\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x8aed, lo: 0xb0, hi: 0xb7},\n\t{value: 0x8ad5, lo: 0xb8, hi: 0xbf},\n\t// Block 0x94, offset 0x483\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x95, offset 0x48a\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x96, offset 0x48e\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xae},\n\t{value: 0x0018, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x97, offset 0x493\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x98, offset 0x496\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xbf},\n\t// Block 0x99, offset 0x49b\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0808, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0808, lo: 0x8a, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0808, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0808, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0808, lo: 0xbf, hi: 0xbf},\n\t// Block 0x9a, offset 0x4a7\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x96},\n\t{value: 0x0818, lo: 0x97, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0818, lo: 0xb7, hi: 0xbf},\n\t// Block 0x9b, offset 0x4ad\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa6},\n\t{value: 0x0818, lo: 0xa7, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x9c, offset 0x4b2\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xba},\n\t{value: 0x0818, lo: 0xbb, hi: 0xbf},\n\t// Block 0x9d, offset 0x4b9\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0818, lo: 0x96, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbe},\n\t{value: 0x0818, lo: 0xbf, hi: 0xbf},\n\t// Block 0x9e, offset 0x4c1\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbb},\n\t{value: 0x0818, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0808, lo: 0xbe, hi: 0xbf},\n\t// Block 0x9f, offset 0x4c6\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0818, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x0818, lo: 0x92, hi: 0xbf},\n\t// Block 0xa0, offset 0x4ca\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0808, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x94},\n\t{value: 0x0808, lo: 0x95, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0x98},\n\t{value: 0x0808, lo: 0x99, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xa1, offset 0x4da\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0818, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0818, lo: 0x90, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0818, lo: 0xbd, hi: 0xbf},\n\t// Block 0xa2, offset 0x4e1\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0x9c},\n\t{value: 0x0818, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xa3, offset 0x4e5\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0018, lo: 0xb9, hi: 0xbf},\n\t// Block 0xa4, offset 0x4e9\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0818, lo: 0x98, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb7},\n\t{value: 0x0818, lo: 0xb8, hi: 0xbf},\n\t// Block 0xa5, offset 0x4f0\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0808, lo: 0x80, hi: 0xbf},\n\t// Block 0xa6, offset 0x4f2\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0808, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0xa7, offset 0x4f5\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x03dd, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xa8, offset 0x4f8\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xbf},\n\t// Block 0xa9, offset 0x4fc\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0818, lo: 0xa0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xaa, offset 0x500\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xab, offset 0x506\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x91},\n\t{value: 0x0018, lo: 0x92, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xac, offset 0x50f\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb6},\n\t{value: 0x3008, lo: 0xb7, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0340, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0xad, offset 0x51b\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xae, offset 0x522\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb2},\n\t{value: 0x3b08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xbf},\n\t// Block 0xaf, offset 0x52b\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xb0, offset 0x533\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xbe},\n\t{value: 0x3008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb1, offset 0x53a\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x89},\n\t{value: 0x3308, lo: 0x8a, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xb2, offset 0x548\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3808, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb3, offset 0x555\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0008, lo: 0x9f, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0xb4, offset 0x562\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x3308, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa9},\n\t{value: 0x3b08, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xb5, offset 0x56b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xb6, offset 0x56f\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x84},\n\t{value: 0x3008, lo: 0x85, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0xb7, offset 0x57d\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3008, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb8, offset 0x585\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x85},\n\t{value: 0x0018, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xb9, offset 0x590\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xba, offset 0x599\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9b},\n\t{value: 0x3308, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0xbb, offset 0x59f\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbc, offset 0x5a7\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xbd, offset 0x5b0\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb5},\n\t{value: 0x3808, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0xbe, offset 0x5ba\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0xbf},\n\t// Block 0xbf, offset 0x5bd\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbf},\n\t// Block 0xc0, offset 0x5c9\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xbf},\n\t// Block 0xc1, offset 0x5cc\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc2, offset 0x5d1\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x88},\n\t{value: 0x3308, lo: 0x89, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3b08, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb8},\n\t{value: 0x3008, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbe},\n\t{value: 0x0018, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc3, offset 0x5de\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x3b08, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x3308, lo: 0x91, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0xbf},\n\t// Block 0xc4, offset 0x5e7\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x89},\n\t{value: 0x3308, lo: 0x8a, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x98},\n\t{value: 0x3b08, lo: 0x99, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0xa2},\n\t{value: 0x0040, lo: 0xa3, hi: 0xbf},\n\t// Block 0xc5, offset 0x5f3\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xc6, offset 0x5f6\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc7, offset 0x600\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xbf},\n\t// Block 0xc8, offset 0x609\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xa9},\n\t{value: 0x3308, lo: 0xaa, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xc9, offset 0x615\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0xca, offset 0x622\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x3308, lo: 0x80, hi: 0x83},\n\t{value: 0x3b08, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xcb, offset 0x62a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xcc, offset 0x62d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xcd, offset 0x632\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0xbf},\n\t// Block 0xce, offset 0x635\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xbf},\n\t// Block 0xcf, offset 0x638\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0xbf},\n\t// Block 0xd0, offset 0x63b\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xd1, offset 0x642\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xd2, offset 0x649\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0xd3, offset 0x64d\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x0008, lo: 0xa3, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0xd4, offset 0x658\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0xbf},\n\t// Block 0xd5, offset 0x65b\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x3008, lo: 0x91, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xd6, offset 0x661\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8e},\n\t{value: 0x3308, lo: 0x8f, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xd7, offset 0x666\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xbf},\n\t// Block 0xd8, offset 0x66a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xd9, offset 0x66d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xda, offset 0x670\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xbf},\n\t// Block 0xdb, offset 0x673\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0xdc, offset 0x676\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0xdd, offset 0x679\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0xde, offset 0x67e\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x03c0, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xbf},\n\t// Block 0xdf, offset 0x688\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xe0, offset 0x68b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xbf},\n\t// Block 0xe1, offset 0x68f\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0018, lo: 0x80, hi: 0x9d},\n\t{value: 0xb5b9, lo: 0x9e, hi: 0x9e},\n\t{value: 0xb601, lo: 0x9f, hi: 0x9f},\n\t{value: 0xb649, lo: 0xa0, hi: 0xa0},\n\t{value: 0xb6b1, lo: 0xa1, hi: 0xa1},\n\t{value: 0xb719, lo: 0xa2, hi: 0xa2},\n\t{value: 0xb781, lo: 0xa3, hi: 0xa3},\n\t{value: 0xb7e9, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3018, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3318, lo: 0xa7, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xac},\n\t{value: 0x3018, lo: 0xad, hi: 0xb2},\n\t{value: 0x0340, lo: 0xb3, hi: 0xba},\n\t{value: 0x3318, lo: 0xbb, hi: 0xbf},\n\t// Block 0xe2, offset 0x69e\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3318, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0x84},\n\t{value: 0x3318, lo: 0x85, hi: 0x8b},\n\t{value: 0x0018, lo: 0x8c, hi: 0xa9},\n\t{value: 0x3318, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xba},\n\t{value: 0xb851, lo: 0xbb, hi: 0xbb},\n\t{value: 0xb899, lo: 0xbc, hi: 0xbc},\n\t{value: 0xb8e1, lo: 0xbd, hi: 0xbd},\n\t{value: 0xb949, lo: 0xbe, hi: 0xbe},\n\t{value: 0xb9b1, lo: 0xbf, hi: 0xbf},\n\t// Block 0xe3, offset 0x6aa\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0xba19, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xbf},\n\t// Block 0xe4, offset 0x6ae\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x3318, lo: 0x82, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0xbf},\n\t// Block 0xe5, offset 0x6b3\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xe6, offset 0x6b8\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0xe7, offset 0x6bc\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x3308, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0xe8, offset 0x6c1\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3308, lo: 0xa1, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xe9, offset 0x6ca\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa4},\n\t{value: 0x0040, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xbf},\n\t// Block 0xea, offset 0x6d5\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x86},\n\t{value: 0x0818, lo: 0x87, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0xeb, offset 0x6db\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0a08, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0818, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xec, offset 0x6e3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xed, offset 0x6e7\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0xee, offset 0x6eb\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0xef, offset 0x6f1\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xf0, offset 0x6f7\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8f},\n\t{value: 0xc1c1, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xf1, offset 0x6fc\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xbf},\n\t// Block 0xf2, offset 0x6ff\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0xc7e9, lo: 0x80, hi: 0x80},\n\t{value: 0xc839, lo: 0x81, hi: 0x81},\n\t{value: 0xc889, lo: 0x82, hi: 0x82},\n\t{value: 0xc8d9, lo: 0x83, hi: 0x83},\n\t{value: 0xc929, lo: 0x84, hi: 0x84},\n\t{value: 0xc979, lo: 0x85, hi: 0x85},\n\t{value: 0xc9c9, lo: 0x86, hi: 0x86},\n\t{value: 0xca19, lo: 0x87, hi: 0x87},\n\t{value: 0xca69, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0xcab9, lo: 0x90, hi: 0x90},\n\t{value: 0xcad9, lo: 0x91, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xbf},\n\t// Block 0xf3, offset 0x70f\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xf4, offset 0x716\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0xf5, offset 0x719\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0xbf},\n\t// Block 0xf6, offset 0x71c\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0xf7, offset 0x720\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0xf8, offset 0x726\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xbf},\n\t// Block 0xf9, offset 0x72b\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xfa, offset 0x730\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xbf},\n\t// Block 0xfb, offset 0x735\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0xbf},\n\t// Block 0xfc, offset 0x738\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xbf},\n\t// Block 0xfd, offset 0x73d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0xfe, offset 0x740\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xff, offset 0x743\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x100, offset 0x747\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x101, offset 0x74b\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0x102, offset 0x74e\n\t{value: 0x0020, lo: 0x0f},\n\t{value: 0xdeb9, lo: 0x80, hi: 0x89},\n\t{value: 0x8dfd, lo: 0x8a, hi: 0x8a},\n\t{value: 0xdff9, lo: 0x8b, hi: 0x9c},\n\t{value: 0x8e1d, lo: 0x9d, hi: 0x9d},\n\t{value: 0xe239, lo: 0x9e, hi: 0xa2},\n\t{value: 0x8e3d, lo: 0xa3, hi: 0xa3},\n\t{value: 0xe2d9, lo: 0xa4, hi: 0xab},\n\t{value: 0x7ed5, lo: 0xac, hi: 0xac},\n\t{value: 0xe3d9, lo: 0xad, hi: 0xaf},\n\t{value: 0x8e5d, lo: 0xb0, hi: 0xb0},\n\t{value: 0xe439, lo: 0xb1, hi: 0xb6},\n\t{value: 0x8e7d, lo: 0xb7, hi: 0xb9},\n\t{value: 0xe4f9, lo: 0xba, hi: 0xba},\n\t{value: 0x8edd, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe519, lo: 0xbc, hi: 0xbf},\n\t// Block 0x103, offset 0x75e\n\t{value: 0x0020, lo: 0x10},\n\t{value: 0x937d, lo: 0x80, hi: 0x80},\n\t{value: 0xf099, lo: 0x81, hi: 0x86},\n\t{value: 0x939d, lo: 0x87, hi: 0x8a},\n\t{value: 0xd9f9, lo: 0x8b, hi: 0x8b},\n\t{value: 0xf159, lo: 0x8c, hi: 0x96},\n\t{value: 0x941d, lo: 0x97, hi: 0x97},\n\t{value: 0xf2b9, lo: 0x98, hi: 0xa3},\n\t{value: 0x943d, lo: 0xa4, hi: 0xa6},\n\t{value: 0xf439, lo: 0xa7, hi: 0xaa},\n\t{value: 0x949d, lo: 0xab, hi: 0xab},\n\t{value: 0xf4b9, lo: 0xac, hi: 0xac},\n\t{value: 0x94bd, lo: 0xad, hi: 0xad},\n\t{value: 0xf4d9, lo: 0xae, hi: 0xaf},\n\t{value: 0x94dd, lo: 0xb0, hi: 0xb1},\n\t{value: 0xf519, lo: 0xb2, hi: 0xbe},\n\t{value: 0x2040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x104, offset 0x76f\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0340, lo: 0x81, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x9f},\n\t{value: 0x0340, lo: 0xa0, hi: 0xbf},\n\t// Block 0x105, offset 0x774\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0340, lo: 0x80, hi: 0xbf},\n\t// Block 0x106, offset 0x776\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x33c0, lo: 0x80, hi: 0xbf},\n\t// Block 0x107, offset 0x778\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x33c0, lo: 0x80, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n}\n\n// Total table size 42114 bytes (41KiB); checksum: 355A58A4\n" }, { "path": "vendor/golang.org/x/net/idna/tables11.0.0.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// +build go1.13\n\npackage idna\n\n// UnicodeVersion is the Unicode version from which the tables in this package are derived.\nconst UnicodeVersion = \"11.0.0\"\n\nvar mappings string = \"\" + // Size: 8175 bytes\n\t\"\\x00\\x01 \\x03 ̈\\x01a\\x03 ̄\\x012\\x013\\x03 ́\\x03 ̧\\x011\\x01o\\x051⁄4\\x051⁄2\" +\n\t\"\\x053⁄4\\x03i̇\\x03l·\\x03ʼn\\x01s\\x03dž\\x03ⱥ\\x03ⱦ\\x01h\\x01j\\x01r\\x01w\\x01y\" +\n\t\"\\x03 ̆\\x03 ̇\\x03 ̊\\x03 ̨\\x03 ̃\\x03 ̋\\x01l\\x01x\\x04̈́\\x03 ι\\x01;\\x05 ̈́\" +\n\t\"\\x04եւ\\x04اٴ\\x04وٴ\\x04ۇٴ\\x04يٴ\\x06क़\\x06ख़\\x06ग़\\x06ज़\\x06ड़\\x06ढ़\\x06फ़\" +\n\t\"\\x06य़\\x06ড়\\x06ঢ়\\x06য়\\x06ਲ਼\\x06ਸ਼\\x06ਖ਼\\x06ਗ਼\\x06ਜ਼\\x06ਫ਼\\x06ଡ଼\\x06ଢ଼\" +\n\t\"\\x06ํา\\x06ໍາ\\x06ຫນ\\x06ຫມ\\x06གྷ\\x06ཌྷ\\x06དྷ\\x06བྷ\\x06ཛྷ\\x06ཀྵ\\x06ཱི\\x06ཱུ\" +\n\t\"\\x06ྲྀ\\x09ྲཱྀ\\x06ླྀ\\x09ླཱྀ\\x06ཱྀ\\x06ྒྷ\\x06ྜྷ\\x06ྡྷ\\x06ྦྷ\\x06ྫྷ\\x06ྐྵ\\x02\" +\n\t\"в\\x02д\\x02о\\x02с\\x02т\\x02ъ\\x02ѣ\\x02æ\\x01b\\x01d\\x01e\\x02ǝ\\x01g\\x01i\\x01k\" +\n\t\"\\x01m\\x01n\\x02ȣ\\x01p\\x01t\\x01u\\x02ɐ\\x02ɑ\\x02ə\\x02ɛ\\x02ɜ\\x02ŋ\\x02ɔ\\x02ɯ\" +\n\t\"\\x01v\\x02β\\x02γ\\x02δ\\x02φ\\x02χ\\x02ρ\\x02н\\x02ɒ\\x01c\\x02ɕ\\x02ð\\x01f\\x02ɟ\" +\n\t\"\\x02ɡ\\x02ɥ\\x02ɨ\\x02ɩ\\x02ɪ\\x02ʝ\\x02ɭ\\x02ʟ\\x02ɱ\\x02ɰ\\x02ɲ\\x02ɳ\\x02ɴ\\x02ɵ\" +\n\t\"\\x02ɸ\\x02ʂ\\x02ʃ\\x02ƫ\\x02ʉ\\x02ʊ\\x02ʋ\\x02ʌ\\x01z\\x02ʐ\\x02ʑ\\x02ʒ\\x02θ\\x02ss\" +\n\t\"\\x02ά\\x02έ\\x02ή\\x02ί\\x02ό\\x02ύ\\x02ώ\\x05ἀι\\x05ἁι\\x05ἂι\\x05ἃι\\x05ἄι\\x05ἅι\" +\n\t\"\\x05ἆι\\x05ἇι\\x05ἠι\\x05ἡι\\x05ἢι\\x05ἣι\\x05ἤι\\x05ἥι\\x05ἦι\\x05ἧι\\x05ὠι\\x05ὡι\" +\n\t\"\\x05ὢι\\x05ὣι\\x05ὤι\\x05ὥι\\x05ὦι\\x05ὧι\\x05ὰι\\x04αι\\x04άι\\x05ᾶι\\x02ι\\x05 ̈͂\" +\n\t\"\\x05ὴι\\x04ηι\\x04ήι\\x05ῆι\\x05 ̓̀\\x05 ̓́\\x05 ̓͂\\x02ΐ\\x05 ̔̀\\x05 ̔́\\x05 ̔͂\" +\n\t\"\\x02ΰ\\x05 ̈̀\\x01`\\x05ὼι\\x04ωι\\x04ώι\\x05ῶι\\x06′′\\x09′′′\\x06‵‵\\x09‵‵‵\\x02!\" +\n\t\"!\\x02??\\x02?!\\x02!?\\x0c′′′′\\x010\\x014\\x015\\x016\\x017\\x018\\x019\\x01+\\x01=\" +\n\t\"\\x01(\\x01)\\x02rs\\x02ħ\\x02no\\x01q\\x02sm\\x02tm\\x02ω\\x02å\\x02א\\x02ב\\x02ג\" +\n\t\"\\x02ד\\x02π\\x051⁄7\\x051⁄9\\x061⁄10\\x051⁄3\\x052⁄3\\x051⁄5\\x052⁄5\\x053⁄5\\x054\" +\n\t\"⁄5\\x051⁄6\\x055⁄6\\x051⁄8\\x053⁄8\\x055⁄8\\x057⁄8\\x041⁄\\x02ii\\x02iv\\x02vi\" +\n\t\"\\x04viii\\x02ix\\x02xi\\x050⁄3\\x06∫∫\\x09∫∫∫\\x06∮∮\\x09∮∮∮\\x0210\\x0211\\x0212\" +\n\t\"\\x0213\\x0214\\x0215\\x0216\\x0217\\x0218\\x0219\\x0220\\x04(10)\\x04(11)\\x04(12)\" +\n\t\"\\x04(13)\\x04(14)\\x04(15)\\x04(16)\\x04(17)\\x04(18)\\x04(19)\\x04(20)\\x0c∫∫∫∫\" +\n\t\"\\x02==\\x05⫝̸\\x02ɫ\\x02ɽ\\x02ȿ\\x02ɀ\\x01.\\x04 ゙\\x04 ゚\\x06より\\x06コト\\x05(ᄀ)\\x05\" +\n\t\"(ᄂ)\\x05(ᄃ)\\x05(ᄅ)\\x05(ᄆ)\\x05(ᄇ)\\x05(ᄉ)\\x05(ᄋ)\\x05(ᄌ)\\x05(ᄎ)\\x05(ᄏ)\\x05(ᄐ\" +\n\t\")\\x05(ᄑ)\\x05(ᄒ)\\x05(가)\\x05(나)\\x05(다)\\x05(라)\\x05(마)\\x05(바)\\x05(사)\\x05(아)\" +\n\t\"\\x05(자)\\x05(차)\\x05(카)\\x05(타)\\x05(파)\\x05(하)\\x05(주)\\x08(오전)\\x08(오후)\\x05(一)\" +\n\t\"\\x05(二)\\x05(三)\\x05(四)\\x05(五)\\x05(六)\\x05(七)\\x05(八)\\x05(九)\\x05(十)\\x05(月)\" +\n\t\"\\x05(火)\\x05(水)\\x05(木)\\x05(金)\\x05(土)\\x05(日)\\x05(株)\\x05(有)\\x05(社)\\x05(名)\" +\n\t\"\\x05(特)\\x05(財)\\x05(祝)\\x05(労)\\x05(代)\\x05(呼)\\x05(学)\\x05(監)\\x05(企)\\x05(資)\" +\n\t\"\\x05(協)\\x05(祭)\\x05(休)\\x05(自)\\x05(至)\\x0221\\x0222\\x0223\\x0224\\x0225\\x0226\" +\n\t\"\\x0227\\x0228\\x0229\\x0230\\x0231\\x0232\\x0233\\x0234\\x0235\\x06참고\\x06주의\\x0236\" +\n\t\"\\x0237\\x0238\\x0239\\x0240\\x0241\\x0242\\x0243\\x0244\\x0245\\x0246\\x0247\\x0248\" +\n\t\"\\x0249\\x0250\\x041月\\x042月\\x043月\\x044月\\x045月\\x046月\\x047月\\x048月\\x049月\\x0510\" +\n\t\"月\\x0511月\\x0512月\\x02hg\\x02ev\\x0cアパート\\x0cアルファ\\x0cアンペア\\x09アール\\x0cイニング\\x09\" +\n\t\"インチ\\x09ウォン\\x0fエスクード\\x0cエーカー\\x09オンス\\x09オーム\\x09カイリ\\x0cカラット\\x0cカロリー\\x09ガロ\" +\n\t\"ン\\x09ガンマ\\x06ギガ\\x09ギニー\\x0cキュリー\\x0cギルダー\\x06キロ\\x0fキログラム\\x12キロメートル\\x0fキロワッ\" +\n\t\"ト\\x09グラム\\x0fグラムトン\\x0fクルゼイロ\\x0cクローネ\\x09ケース\\x09コルナ\\x09コーポ\\x0cサイクル\\x0fサンチ\" +\n\t\"ーム\\x0cシリング\\x09センチ\\x09セント\\x09ダース\\x06デシ\\x06ドル\\x06トン\\x06ナノ\\x09ノット\\x09ハイツ\" +\n\t\"\\x0fパーセント\\x09パーツ\\x0cバーレル\\x0fピアストル\\x09ピクル\\x06ピコ\\x06ビル\\x0fファラッド\\x0cフィート\" +\n\t\"\\x0fブッシェル\\x09フラン\\x0fヘクタール\\x06ペソ\\x09ペニヒ\\x09ヘルツ\\x09ペンス\\x09ページ\\x09ベータ\\x0cポイ\" +\n\t\"ント\\x09ボルト\\x06ホン\\x09ポンド\\x09ホール\\x09ホーン\\x0cマイクロ\\x09マイル\\x09マッハ\\x09マルク\\x0fマ\" +\n\t\"ンション\\x0cミクロン\\x06ミリ\\x0fミリバール\\x06メガ\\x0cメガトン\\x0cメートル\\x09ヤード\\x09ヤール\\x09ユアン\" +\n\t\"\\x0cリットル\\x06リラ\\x09ルピー\\x0cルーブル\\x06レム\\x0fレントゲン\\x09ワット\\x040点\\x041点\\x042点\" +\n\t\"\\x043点\\x044点\\x045点\\x046点\\x047点\\x048点\\x049点\\x0510点\\x0511点\\x0512点\\x0513点\" +\n\t\"\\x0514点\\x0515点\\x0516点\\x0517点\\x0518点\\x0519点\\x0520点\\x0521点\\x0522点\\x0523点\" +\n\t\"\\x0524点\\x02da\\x02au\\x02ov\\x02pc\\x02dm\\x02iu\\x06平成\\x06昭和\\x06大正\\x06明治\\x0c株\" +\n\t\"式会社\\x02pa\\x02na\\x02ma\\x02ka\\x02kb\\x02mb\\x02gb\\x04kcal\\x02pf\\x02nf\\x02m\" +\n\t\"g\\x02kg\\x02hz\\x02ml\\x02dl\\x02kl\\x02fm\\x02nm\\x02mm\\x02cm\\x02km\\x02m2\\x02m\" +\n\t\"3\\x05m∕s\\x06m∕s2\\x07rad∕s\\x08rad∕s2\\x02ps\\x02ns\\x02ms\\x02pv\\x02nv\\x02mv\" +\n\t\"\\x02kv\\x02pw\\x02nw\\x02mw\\x02kw\\x02bq\\x02cc\\x02cd\\x06c∕kg\\x02db\\x02gy\\x02\" +\n\t\"ha\\x02hp\\x02in\\x02kk\\x02kt\\x02lm\\x02ln\\x02lx\\x02ph\\x02pr\\x02sr\\x02sv\\x02\" +\n\t\"wb\\x05v∕m\\x05a∕m\\x041日\\x042日\\x043日\\x044日\\x045日\\x046日\\x047日\\x048日\\x049日\" +\n\t\"\\x0510日\\x0511日\\x0512日\\x0513日\\x0514日\\x0515日\\x0516日\\x0517日\\x0518日\\x0519日\" +\n\t\"\\x0520日\\x0521日\\x0522日\\x0523日\\x0524日\\x0525日\\x0526日\\x0527日\\x0528日\\x0529日\" +\n\t\"\\x0530日\\x0531日\\x02ь\\x02ɦ\\x02ɬ\\x02ʞ\\x02ʇ\\x02œ\\x04𤋮\\x04𢡊\\x04𢡄\\x04𣏕\\x04𥉉\" +\n\t\"\\x04𥳐\\x04𧻓\\x02ff\\x02fi\\x02fl\\x02st\\x04մն\\x04մե\\x04մի\\x04վն\\x04մխ\\x04יִ\" +\n\t\"\\x04ײַ\\x02ע\\x02ה\\x02כ\\x02ל\\x02ם\\x02ר\\x02ת\\x04שׁ\\x04שׂ\\x06שּׁ\\x06שּׂ\\x04א\" +\n\t\"ַ\\x04אָ\\x04אּ\\x04בּ\\x04גּ\\x04דּ\\x04הּ\\x04וּ\\x04זּ\\x04טּ\\x04יּ\\x04ךּ\\x04\" +\n\t\"כּ\\x04לּ\\x04מּ\\x04נּ\\x04סּ\\x04ףּ\\x04פּ\\x04צּ\\x04קּ\\x04רּ\\x04שּ\\x04תּ\" +\n\t\"\\x04וֹ\\x04בֿ\\x04כֿ\\x04פֿ\\x04אל\\x02ٱ\\x02ٻ\\x02پ\\x02ڀ\\x02ٺ\\x02ٿ\\x02ٹ\\x02ڤ\" +\n\t\"\\x02ڦ\\x02ڄ\\x02ڃ\\x02چ\\x02ڇ\\x02ڍ\\x02ڌ\\x02ڎ\\x02ڈ\\x02ژ\\x02ڑ\\x02ک\\x02گ\\x02ڳ\" +\n\t\"\\x02ڱ\\x02ں\\x02ڻ\\x02ۀ\\x02ہ\\x02ھ\\x02ے\\x02ۓ\\x02ڭ\\x02ۇ\\x02ۆ\\x02ۈ\\x02ۋ\\x02ۅ\" +\n\t\"\\x02ۉ\\x02ې\\x02ى\\x04ئا\\x04ئە\\x04ئو\\x04ئۇ\\x04ئۆ\\x04ئۈ\\x04ئې\\x04ئى\\x02ی\\x04\" +\n\t\"ئج\\x04ئح\\x04ئم\\x04ئي\\x04بج\\x04بح\\x04بخ\\x04بم\\x04بى\\x04بي\\x04تج\\x04تح\" +\n\t\"\\x04تخ\\x04تم\\x04تى\\x04تي\\x04ثج\\x04ثم\\x04ثى\\x04ثي\\x04جح\\x04جم\\x04حج\\x04حم\" +\n\t\"\\x04خج\\x04خح\\x04خم\\x04سج\\x04سح\\x04سخ\\x04سم\\x04صح\\x04صم\\x04ضج\\x04ضح\\x04ضخ\" +\n\t\"\\x04ضم\\x04طح\\x04طم\\x04ظم\\x04عج\\x04عم\\x04غج\\x04غم\\x04فج\\x04فح\\x04فخ\\x04فم\" +\n\t\"\\x04فى\\x04في\\x04قح\\x04قم\\x04قى\\x04قي\\x04كا\\x04كج\\x04كح\\x04كخ\\x04كل\\x04كم\" +\n\t\"\\x04كى\\x04كي\\x04لج\\x04لح\\x04لخ\\x04لم\\x04لى\\x04لي\\x04مج\\x04مح\\x04مخ\\x04مم\" +\n\t\"\\x04مى\\x04مي\\x04نج\\x04نح\\x04نخ\\x04نم\\x04نى\\x04ني\\x04هج\\x04هم\\x04هى\\x04هي\" +\n\t\"\\x04يج\\x04يح\\x04يخ\\x04يم\\x04يى\\x04يي\\x04ذٰ\\x04رٰ\\x04ىٰ\\x05 ٌّ\\x05 ٍّ\\x05\" +\n\t\" َّ\\x05 ُّ\\x05 ِّ\\x05 ّٰ\\x04ئر\\x04ئز\\x04ئن\\x04بر\\x04بز\\x04بن\\x04تر\\x04تز\" +\n\t\"\\x04تن\\x04ثر\\x04ثز\\x04ثن\\x04ما\\x04نر\\x04نز\\x04نن\\x04ير\\x04يز\\x04ين\\x04ئخ\" +\n\t\"\\x04ئه\\x04به\\x04ته\\x04صخ\\x04له\\x04نه\\x04هٰ\\x04يه\\x04ثه\\x04سه\\x04شم\\x04شه\" +\n\t\"\\x06ـَّ\\x06ـُّ\\x06ـِّ\\x04طى\\x04طي\\x04عى\\x04عي\\x04غى\\x04غي\\x04سى\\x04سي\" +\n\t\"\\x04شى\\x04شي\\x04حى\\x04حي\\x04جى\\x04جي\\x04خى\\x04خي\\x04صى\\x04صي\\x04ضى\\x04ضي\" +\n\t\"\\x04شج\\x04شح\\x04شخ\\x04شر\\x04سر\\x04صر\\x04ضر\\x04اً\\x06تجم\\x06تحج\\x06تحم\" +\n\t\"\\x06تخم\\x06تمج\\x06تمح\\x06تمخ\\x06جمح\\x06حمي\\x06حمى\\x06سحج\\x06سجح\\x06سجى\" +\n\t\"\\x06سمح\\x06سمج\\x06سمم\\x06صحح\\x06صمم\\x06شحم\\x06شجي\\x06شمخ\\x06شمم\\x06ضحى\" +\n\t\"\\x06ضخم\\x06طمح\\x06طمم\\x06طمي\\x06عجم\\x06عمم\\x06عمى\\x06غمم\\x06غمي\\x06غمى\" +\n\t\"\\x06فخم\\x06قمح\\x06قمم\\x06لحم\\x06لحي\\x06لحى\\x06لجج\\x06لخم\\x06لمح\\x06محج\" +\n\t\"\\x06محم\\x06محي\\x06مجح\\x06مجم\\x06مخج\\x06مخم\\x06مجخ\\x06همج\\x06همم\\x06نحم\" +\n\t\"\\x06نحى\\x06نجم\\x06نجى\\x06نمي\\x06نمى\\x06يمم\\x06بخي\\x06تجي\\x06تجى\\x06تخي\" +\n\t\"\\x06تخى\\x06تمي\\x06تمى\\x06جمي\\x06جحى\\x06جمى\\x06سخى\\x06صحي\\x06شحي\\x06ضحي\" +\n\t\"\\x06لجي\\x06لمي\\x06يحي\\x06يجي\\x06يمي\\x06ممي\\x06قمي\\x06نحي\\x06عمي\\x06كمي\" +\n\t\"\\x06نجح\\x06مخي\\x06لجم\\x06كمم\\x06جحي\\x06حجي\\x06مجي\\x06فمي\\x06بحي\\x06سخي\" +\n\t\"\\x06نجي\\x06صلے\\x06قلے\\x08الله\\x08اكبر\\x08محمد\\x08صلعم\\x08رسول\\x08عليه\" +\n\t\"\\x08وسلم\\x06صلى!صلى الله عليه وسلم\\x0fجل جلاله\\x08ریال\\x01,\\x01:\\x01!\" +\n\t\"\\x01?\\x01_\\x01{\\x01}\\x01[\\x01]\\x01#\\x01&\\x01*\\x01-\\x01<\\x01>\\x01\\\\\\x01$\" +\n\t\"\\x01%\\x01@\\x04ـً\\x04ـَ\\x04ـُ\\x04ـِ\\x04ـّ\\x04ـْ\\x02ء\\x02آ\\x02أ\\x02ؤ\\x02إ\" +\n\t\"\\x02ئ\\x02ا\\x02ب\\x02ة\\x02ت\\x02ث\\x02ج\\x02ح\\x02خ\\x02د\\x02ذ\\x02ر\\x02ز\\x02س\" +\n\t\"\\x02ش\\x02ص\\x02ض\\x02ط\\x02ظ\\x02ع\\x02غ\\x02ف\\x02ق\\x02ك\\x02ل\\x02م\\x02ن\\x02ه\" +\n\t\"\\x02و\\x02ي\\x04لآ\\x04لأ\\x04لإ\\x04لا\\x01\\x22\\x01'\\x01/\\x01^\\x01|\\x01~\\x02¢\" +\n\t\"\\x02£\\x02¬\\x02¦\\x02¥\\x08𝅗𝅥\\x08𝅘𝅥\\x0c𝅘𝅥𝅮\\x0c𝅘𝅥𝅯\\x0c𝅘𝅥𝅰\\x0c𝅘𝅥𝅱\\x0c𝅘𝅥𝅲\\x08𝆹\" +\n\t\"𝅥\\x08𝆺𝅥\\x0c𝆹𝅥𝅮\\x0c𝆺𝅥𝅮\\x0c𝆹𝅥𝅯\\x0c𝆺𝅥𝅯\\x02ı\\x02ȷ\\x02α\\x02ε\\x02ζ\\x02η\\x02\" +\n\t\"κ\\x02λ\\x02μ\\x02ν\\x02ξ\\x02ο\\x02σ\\x02τ\\x02υ\\x02ψ\\x03∇\\x03∂\\x02ϝ\\x02ٮ\\x02ڡ\" +\n\t\"\\x02ٯ\\x020,\\x021,\\x022,\\x023,\\x024,\\x025,\\x026,\\x027,\\x028,\\x029,\\x03(a)\" +\n\t\"\\x03(b)\\x03(c)\\x03(d)\\x03(e)\\x03(f)\\x03(g)\\x03(h)\\x03(i)\\x03(j)\\x03(k)\" +\n\t\"\\x03(l)\\x03(m)\\x03(n)\\x03(o)\\x03(p)\\x03(q)\\x03(r)\\x03(s)\\x03(t)\\x03(u)\" +\n\t\"\\x03(v)\\x03(w)\\x03(x)\\x03(y)\\x03(z)\\x07〔s〕\\x02wz\\x02hv\\x02sd\\x03ppv\\x02w\" +\n\t\"c\\x02mc\\x02md\\x02dj\\x06ほか\\x06ココ\\x03サ\\x03手\\x03字\\x03双\\x03デ\\x03二\\x03多\\x03解\" +\n\t\"\\x03天\\x03交\\x03映\\x03無\\x03料\\x03前\\x03後\\x03再\\x03新\\x03初\\x03終\\x03生\\x03販\\x03声\" +\n\t\"\\x03吹\\x03演\\x03投\\x03捕\\x03一\\x03三\\x03遊\\x03左\\x03中\\x03右\\x03指\\x03走\\x03打\\x03禁\" +\n\t\"\\x03空\\x03合\\x03満\\x03有\\x03月\\x03申\\x03割\\x03営\\x03配\\x09〔本〕\\x09〔三〕\\x09〔二〕\\x09〔安\" +\n\t\"〕\\x09〔点〕\\x09〔打〕\\x09〔盗〕\\x09〔勝〕\\x09〔敗〕\\x03得\\x03可\\x03丽\\x03丸\\x03乁\\x03你\\x03\" +\n\t\"侮\\x03侻\\x03倂\\x03偺\\x03備\\x03僧\\x03像\\x03㒞\\x03免\\x03兔\\x03兤\\x03具\\x03㒹\\x03內\\x03\" +\n\t\"冗\\x03冤\\x03仌\\x03冬\\x03况\\x03凵\\x03刃\\x03㓟\\x03刻\\x03剆\\x03剷\\x03㔕\\x03勇\\x03勉\\x03\" +\n\t\"勤\\x03勺\\x03包\\x03匆\\x03北\\x03卉\\x03卑\\x03博\\x03即\\x03卽\\x03卿\\x03灰\\x03及\\x03叟\\x03\" +\n\t\"叫\\x03叱\\x03吆\\x03咞\\x03吸\\x03呈\\x03周\\x03咢\\x03哶\\x03唐\\x03啓\\x03啣\\x03善\\x03喙\\x03\" +\n\t\"喫\\x03喳\\x03嗂\\x03圖\\x03嘆\\x03圗\\x03噑\\x03噴\\x03切\\x03壮\\x03城\\x03埴\\x03堍\\x03型\\x03\" +\n\t\"堲\\x03報\\x03墬\\x03売\\x03壷\\x03夆\\x03夢\\x03奢\\x03姬\\x03娛\\x03娧\\x03姘\\x03婦\\x03㛮\\x03\" +\n\t\"嬈\\x03嬾\\x03寃\\x03寘\\x03寧\\x03寳\\x03寿\\x03将\\x03尢\\x03㞁\\x03屠\\x03屮\\x03峀\\x03岍\\x03\" +\n\t\"嵃\\x03嵮\\x03嵫\\x03嵼\\x03巡\\x03巢\\x03㠯\\x03巽\\x03帨\\x03帽\\x03幩\\x03㡢\\x03㡼\\x03庰\\x03\" +\n\t\"庳\\x03庶\\x03廊\\x03廾\\x03舁\\x03弢\\x03㣇\\x03形\\x03彫\\x03㣣\\x03徚\\x03忍\\x03志\\x03忹\\x03\" +\n\t\"悁\\x03㤺\\x03㤜\\x03悔\\x03惇\\x03慈\\x03慌\\x03慎\\x03慺\\x03憎\\x03憲\\x03憤\\x03憯\\x03懞\\x03\" +\n\t\"懲\\x03懶\\x03成\\x03戛\\x03扝\\x03抱\\x03拔\\x03捐\\x03挽\\x03拼\\x03捨\\x03掃\\x03揤\\x03搢\\x03\" +\n\t\"揅\\x03掩\\x03㨮\\x03摩\\x03摾\\x03撝\\x03摷\\x03㩬\\x03敏\\x03敬\\x03旣\\x03書\\x03晉\\x03㬙\\x03\" +\n\t\"暑\\x03㬈\\x03㫤\\x03冒\\x03冕\\x03最\\x03暜\\x03肭\\x03䏙\\x03朗\\x03望\\x03朡\\x03杞\\x03杓\\x03\" +\n\t\"㭉\\x03柺\\x03枅\\x03桒\\x03梅\\x03梎\\x03栟\\x03椔\\x03㮝\\x03楂\\x03榣\\x03槪\\x03檨\\x03櫛\\x03\" +\n\t\"㰘\\x03次\\x03歔\\x03㱎\\x03歲\\x03殟\\x03殺\\x03殻\\x03汎\\x03沿\\x03泍\\x03汧\\x03洖\\x03派\\x03\" +\n\t\"海\\x03流\\x03浩\\x03浸\\x03涅\\x03洴\\x03港\\x03湮\\x03㴳\\x03滋\\x03滇\\x03淹\\x03潮\\x03濆\\x03\" +\n\t\"瀹\\x03瀞\\x03瀛\\x03㶖\\x03灊\\x03災\\x03灷\\x03炭\\x03煅\\x03熜\\x03爨\\x03爵\\x03牐\\x03犀\\x03\" +\n\t\"犕\\x03獺\\x03王\\x03㺬\\x03玥\\x03㺸\\x03瑇\\x03瑜\\x03瑱\\x03璅\\x03瓊\\x03㼛\\x03甤\\x03甾\\x03\" +\n\t\"異\\x03瘐\\x03㿼\\x03䀈\\x03直\\x03眞\\x03真\\x03睊\\x03䀹\\x03瞋\\x03䁆\\x03䂖\\x03硎\\x03碌\\x03\" +\n\t\"磌\\x03䃣\\x03祖\\x03福\\x03秫\\x03䄯\\x03穀\\x03穊\\x03穏\\x03䈂\\x03篆\\x03築\\x03䈧\\x03糒\\x03\" +\n\t\"䊠\\x03糨\\x03糣\\x03紀\\x03絣\\x03䌁\\x03緇\\x03縂\\x03繅\\x03䌴\\x03䍙\\x03罺\\x03羕\\x03翺\\x03\" +\n\t\"者\\x03聠\\x03聰\\x03䏕\\x03育\\x03脃\\x03䐋\\x03脾\\x03媵\\x03舄\\x03辞\\x03䑫\\x03芑\\x03芋\\x03\" +\n\t\"芝\\x03劳\\x03花\\x03芳\\x03芽\\x03苦\\x03若\\x03茝\\x03荣\\x03莭\\x03茣\\x03莽\\x03菧\\x03著\\x03\" +\n\t\"荓\\x03菊\\x03菌\\x03菜\\x03䔫\\x03蓱\\x03蓳\\x03蔖\\x03蕤\\x03䕝\\x03䕡\\x03䕫\\x03虐\\x03虜\\x03\" +\n\t\"虧\\x03虩\\x03蚩\\x03蚈\\x03蜎\\x03蛢\\x03蝹\\x03蜨\\x03蝫\\x03螆\\x03蟡\\x03蠁\\x03䗹\\x03衠\\x03\" +\n\t\"衣\\x03裗\\x03裞\\x03䘵\\x03裺\\x03㒻\\x03䚾\\x03䛇\\x03誠\\x03諭\\x03變\\x03豕\\x03貫\\x03賁\\x03\" +\n\t\"贛\\x03起\\x03跋\\x03趼\\x03跰\\x03軔\\x03輸\\x03邔\\x03郱\\x03鄑\\x03鄛\\x03鈸\\x03鋗\\x03鋘\\x03\" +\n\t\"鉼\\x03鏹\\x03鐕\\x03開\\x03䦕\\x03閷\\x03䧦\\x03雃\\x03嶲\\x03霣\\x03䩮\\x03䩶\\x03韠\\x03䪲\\x03\" +\n\t\"頋\\x03頩\\x03飢\\x03䬳\\x03餩\\x03馧\\x03駂\\x03駾\\x03䯎\\x03鬒\\x03鱀\\x03鳽\\x03䳎\\x03䳭\\x03\" +\n\t\"鵧\\x03䳸\\x03麻\\x03䵖\\x03黹\\x03黾\\x03鼅\\x03鼏\\x03鼖\\x03鼻\"\n\nvar xorData string = \"\" + // Size: 4855 bytes\n\t\"\\x02\\x0c\\x09\\x02\\xb0\\xec\\x02\\xad\\xd8\\x02\\xad\\xd9\\x02\\x06\\x07\\x02\\x0f\\x12\" +\n\t\"\\x02\\x0f\\x1f\\x02\\x0f\\x1d\\x02\\x01\\x13\\x02\\x0f\\x16\\x02\\x0f\\x0b\\x02\\x0f3\" +\n\t\"\\x02\\x0f7\\x02\\x0f?\\x02\\x0f/\\x02\\x0f*\\x02\\x0c&\\x02\\x0c*\\x02\\x0c;\\x02\\x0c9\" +\n\t\"\\x02\\x0c%\\x02\\xab\\xed\\x02\\xab\\xe2\\x02\\xab\\xe3\\x02\\xa9\\xe0\\x02\\xa9\\xe1\" +\n\t\"\\x02\\xa9\\xe6\\x02\\xa3\\xcb\\x02\\xa3\\xc8\\x02\\xa3\\xc9\\x02\\x01#\\x02\\x01\\x08\" +\n\t\"\\x02\\x0e>\\x02\\x0e'\\x02\\x0f\\x03\\x02\\x03\\x0d\\x02\\x03\\x09\\x02\\x03\\x17\\x02\" +\n\t\"\\x03\\x0e\\x02\\x02\\x03\\x02\\x011\\x02\\x01\\x00\\x02\\x01\\x10\\x02\\x03<\\x02\\x07\" +\n\t\"\\x0d\\x02\\x02\\x0c\\x02\\x0c0\\x02\\x01\\x03\\x02\\x01\\x01\\x02\\x01 \\x02\\x01\\x22\" +\n\t\"\\x02\\x01)\\x02\\x01\\x0a\\x02\\x01\\x0c\\x02\\x02\\x06\\x02\\x02\\x02\\x02\\x03\\x10\" +\n\t\"\\x03\\x037 \\x03\\x0b+\\x03\\x02\\x01\\x04\\x02\\x01\\x02\\x02\\x019\\x02\\x03\\x1c\\x02\" +\n\t\"\\x02$\\x03\\x80p$\\x02\\x03:\\x02\\x03\\x0a\\x03\\xc1r.\\x03\\xc1r,\\x03\\xc1r\\x02\" +\n\t\"\\x02\\x02:\\x02\\x02>\\x02\\x02,\\x02\\x02\\x10\\x02\\x02\\x00\\x03\\xc1s<\\x03\\xc1s*\" +\n\t\"\\x03\\xc2L$\\x03\\xc2L;\\x02\\x09)\\x02\\x0a\\x19\\x03\\x83\\xab\\xe3\\x03\\x83\\xab\" +\n\t\"\\xf2\\x03 4\\xe0\\x03\\x81\\xab\\xea\\x03\\x81\\xab\\xf3\\x03 4\\xef\\x03\\x96\\xe1\\xcd\" +\n\t\"\\x03\\x84\\xe5\\xc3\\x02\\x0d\\x11\\x03\\x8b\\xec\\xcb\\x03\\x94\\xec\\xcf\\x03\\x9a\\xec\" +\n\t\"\\xc2\\x03\\x8b\\xec\\xdb\\x03\\x94\\xec\\xdf\\x03\\x9a\\xec\\xd2\\x03\\x01\\x0c!\\x03\" +\n\t\"\\x01\\x0c#\\x03ʠ\\x9d\\x03ʣ\\x9c\\x03ʢ\\x9f\\x03ʥ\\x9e\\x03ʤ\\x91\\x03ʧ\\x90\\x03ʦ\\x93\" +\n\t\"\\x03ʩ\\x92\\x03ʨ\\x95\\x03\\xca\\xf3\\xb5\\x03\\xca\\xf0\\xb4\\x03\\xca\\xf1\\xb7\\x03\" +\n\t\"\\xca\\xf6\\xb6\\x03\\xca\\xf7\\x89\\x03\\xca\\xf4\\x88\\x03\\xca\\xf5\\x8b\\x03\\xca\\xfa\" +\n\t\"\\x8a\\x03\\xca\\xfb\\x8d\\x03\\xca\\xf8\\x8c\\x03\\xca\\xf9\\x8f\\x03\\xca\\xfe\\x8e\\x03\" +\n\t\"\\xca\\xff\\x81\\x03\\xca\\xfc\\x80\\x03\\xca\\xfd\\x83\\x03\\xca\\xe2\\x82\\x03\\xca\\xe3\" +\n\t\"\\x85\\x03\\xca\\xe0\\x84\\x03\\xca\\xe1\\x87\\x03\\xca\\xe6\\x86\\x03\\xca\\xe7\\x99\\x03\" +\n\t\"\\xca\\xe4\\x98\\x03\\xca\\xe5\\x9b\\x03\\xca\\xea\\x9a\\x03\\xca\\xeb\\x9d\\x03\\xca\\xe8\" +\n\t\"\\x9c\\x03ؓ\\x89\\x03ߔ\\x8b\\x02\\x010\\x03\\x03\\x04\\x1e\\x03\\x04\\x15\\x12\\x03\\x0b\" +\n\t\"\\x05,\\x03\\x06\\x04\\x00\\x03\\x06\\x04)\\x03\\x06\\x044\\x03\\x06\\x04<\\x03\\x06\\x05\" +\n\t\"\\x1d\\x03\\x06\\x06\\x00\\x03\\x06\\x06\\x0a\\x03\\x06\\x06'\\x03\\x06\\x062\\x03\\x0786\" +\n\t\"\\x03\\x079/\\x03\\x079 \\x03\\x07:\\x0e\\x03\\x07:\\x1b\\x03\\x07:%\\x03\\x07;/\\x03\" +\n\t\"\\x07;%\\x03\\x074\\x11\\x03\\x076\\x09\\x03\\x077*\\x03\\x070\\x01\\x03\\x070\\x0f\\x03\" +\n\t\"\\x070.\\x03\\x071\\x16\\x03\\x071\\x04\\x03\\x0710\\x03\\x072\\x18\\x03\\x072-\\x03\" +\n\t\"\\x073\\x14\\x03\\x073>\\x03\\x07'\\x09\\x03\\x07 \\x00\\x03\\x07\\x1f\\x0b\\x03\\x07\" +\n\t\"\\x18#\\x03\\x07\\x18(\\x03\\x07\\x186\\x03\\x07\\x18\\x03\\x03\\x07\\x19\\x16\\x03\\x07\" +\n\t\"\\x116\\x03\\x07\\x12'\\x03\\x07\\x13\\x10\\x03\\x07\\x0c&\\x03\\x07\\x0c\\x08\\x03\\x07\" +\n\t\"\\x0c\\x13\\x03\\x07\\x0d\\x02\\x03\\x07\\x0d\\x1c\\x03\\x07\\x0b5\\x03\\x07\\x0b\\x0a\" +\n\t\"\\x03\\x07\\x0b\\x01\\x03\\x07\\x0b\\x0f\\x03\\x07\\x05\\x00\\x03\\x07\\x05\\x09\\x03\\x07\" +\n\t\"\\x05\\x0b\\x03\\x07\\x07\\x01\\x03\\x07\\x07\\x08\\x03\\x07\\x00<\\x03\\x07\\x00+\\x03\" +\n\t\"\\x07\\x01)\\x03\\x07\\x01\\x1b\\x03\\x07\\x01\\x08\\x03\\x07\\x03?\\x03\\x0445\\x03\\x04\" +\n\t\"4\\x08\\x03\\x0454\\x03\\x04)/\\x03\\x04)5\\x03\\x04+\\x05\\x03\\x04+\\x14\\x03\\x04+ \" +\n\t\"\\x03\\x04+<\\x03\\x04*&\\x03\\x04*\\x22\\x03\\x04&8\\x03\\x04!\\x01\\x03\\x04!\\x22\" +\n\t\"\\x03\\x04\\x11+\\x03\\x04\\x10.\\x03\\x04\\x104\\x03\\x04\\x13=\\x03\\x04\\x12\\x04\\x03\" +\n\t\"\\x04\\x12\\x0a\\x03\\x04\\x0d\\x1d\\x03\\x04\\x0d\\x07\\x03\\x04\\x0d \\x03\\x05<>\\x03\" +\n\t\"\\x055<\\x03\\x055!\\x03\\x055#\\x03\\x055&\\x03\\x054\\x1d\\x03\\x054\\x02\\x03\\x054\" +\n\t\"\\x07\\x03\\x0571\\x03\\x053\\x1a\\x03\\x053\\x16\\x03\\x05.<\\x03\\x05.\\x07\\x03\\x05)\" +\n\t\":\\x03\\x05)<\\x03\\x05)\\x0c\\x03\\x05)\\x15\\x03\\x05+-\\x03\\x05+5\\x03\\x05$\\x1e\" +\n\t\"\\x03\\x05$\\x14\\x03\\x05'\\x04\\x03\\x05'\\x14\\x03\\x05&\\x02\\x03\\x05\\x226\\x03\" +\n\t\"\\x05\\x22\\x0c\\x03\\x05\\x22\\x1c\\x03\\x05\\x19\\x0a\\x03\\x05\\x1b\\x09\\x03\\x05\\x1b\" +\n\t\"\\x0c\\x03\\x05\\x14\\x07\\x03\\x05\\x16?\\x03\\x05\\x16\\x0c\\x03\\x05\\x0c\\x05\\x03\" +\n\t\"\\x05\\x0e\\x0f\\x03\\x05\\x01\\x0e\\x03\\x05\\x00(\\x03\\x05\\x030\\x03\\x05\\x03\\x06\" +\n\t\"\\x03\\x0a==\\x03\\x0a=1\\x03\\x0a=,\\x03\\x0a=\\x0c\\x03\\x0a??\\x03\\x0a<\\x08\\x03\" +\n\t\"\\x0a9!\\x03\\x0a9)\\x03\\x0a97\\x03\\x0a99\\x03\\x0a6\\x0a\\x03\\x0a6\\x1c\\x03\\x0a6\" +\n\t\"\\x17\\x03\\x0a7'\\x03\\x0a78\\x03\\x0a73\\x03\\x0a'\\x01\\x03\\x0a'&\\x03\\x0a\\x1f\" +\n\t\"\\x0e\\x03\\x0a\\x1f\\x03\\x03\\x0a\\x1f3\\x03\\x0a\\x1b/\\x03\\x0a\\x18\\x19\\x03\\x0a\" +\n\t\"\\x19\\x01\\x03\\x0a\\x16\\x14\\x03\\x0a\\x0e\\x22\\x03\\x0a\\x0f\\x10\\x03\\x0a\\x0f\\x02\" +\n\t\"\\x03\\x0a\\x0f \\x03\\x0a\\x0c\\x04\\x03\\x0a\\x0b>\\x03\\x0a\\x0b+\\x03\\x0a\\x08/\\x03\" +\n\t\"\\x0a\\x046\\x03\\x0a\\x05\\x14\\x03\\x0a\\x00\\x04\\x03\\x0a\\x00\\x10\\x03\\x0a\\x00\" +\n\t\"\\x14\\x03\\x0b<3\\x03\\x0b;*\\x03\\x0b9\\x22\\x03\\x0b9)\\x03\\x0b97\\x03\\x0b+\\x10\" +\n\t\"\\x03\\x0b((\\x03\\x0b&5\\x03\\x0b$\\x1c\\x03\\x0b$\\x12\\x03\\x0b%\\x04\\x03\\x0b#<\" +\n\t\"\\x03\\x0b#0\\x03\\x0b#\\x0d\\x03\\x0b#\\x19\\x03\\x0b!:\\x03\\x0b!\\x1f\\x03\\x0b!\\x00\" +\n\t\"\\x03\\x0b\\x1e5\\x03\\x0b\\x1c\\x1d\\x03\\x0b\\x1d-\\x03\\x0b\\x1d(\\x03\\x0b\\x18.\\x03\" +\n\t\"\\x0b\\x18 \\x03\\x0b\\x18\\x16\\x03\\x0b\\x14\\x13\\x03\\x0b\\x15$\\x03\\x0b\\x15\\x22\" +\n\t\"\\x03\\x0b\\x12\\x1b\\x03\\x0b\\x12\\x10\\x03\\x0b\\x132\\x03\\x0b\\x13=\\x03\\x0b\\x12\" +\n\t\"\\x18\\x03\\x0b\\x0c&\\x03\\x0b\\x061\\x03\\x0b\\x06:\\x03\\x0b\\x05#\\x03\\x0b\\x05<\" +\n\t\"\\x03\\x0b\\x04\\x0b\\x03\\x0b\\x04\\x04\\x03\\x0b\\x04\\x1b\\x03\\x0b\\x042\\x03\\x0b\" +\n\t\"\\x041\\x03\\x0b\\x03\\x03\\x03\\x0b\\x03\\x1d\\x03\\x0b\\x03/\\x03\\x0b\\x03+\\x03\\x0b\" +\n\t\"\\x02\\x1b\\x03\\x0b\\x02\\x00\\x03\\x0b\\x01\\x1e\\x03\\x0b\\x01\\x08\\x03\\x0b\\x015\" +\n\t\"\\x03\\x06\\x0d9\\x03\\x06\\x0d=\\x03\\x06\\x0d?\\x03\\x02\\x001\\x03\\x02\\x003\\x03\" +\n\t\"\\x02\\x02\\x19\\x03\\x02\\x006\\x03\\x02\\x02\\x1b\\x03\\x02\\x004\\x03\\x02\\x00<\\x03\" +\n\t\"\\x02\\x02\\x0a\\x03\\x02\\x02\\x0e\\x03\\x02\\x01\\x1a\\x03\\x02\\x01\\x07\\x03\\x02\\x01\" +\n\t\"\\x05\\x03\\x02\\x01\\x0b\\x03\\x02\\x01%\\x03\\x02\\x01\\x0c\\x03\\x02\\x01\\x04\\x03\" +\n\t\"\\x02\\x01\\x1c\\x03\\x02\\x00.\\x03\\x02\\x002\\x03\\x02\\x00>\\x03\\x02\\x00\\x12\\x03\" +\n\t\"\\x02\\x00\\x16\\x03\\x02\\x011\\x03\\x02\\x013\\x03\\x02\\x02 \\x03\\x02\\x02%\\x03\\x02\" +\n\t\"\\x02$\\x03\\x02\\x028\\x03\\x02\\x02;\\x03\\x02\\x024\\x03\\x02\\x012\\x03\\x02\\x022\" +\n\t\"\\x03\\x02\\x02/\\x03\\x02\\x01,\\x03\\x02\\x01\\x13\\x03\\x02\\x01\\x16\\x03\\x02\\x01\" +\n\t\"\\x11\\x03\\x02\\x01\\x1e\\x03\\x02\\x01\\x15\\x03\\x02\\x01\\x17\\x03\\x02\\x01\\x0f\\x03\" +\n\t\"\\x02\\x01\\x08\\x03\\x02\\x00?\\x03\\x02\\x03\\x07\\x03\\x02\\x03\\x0d\\x03\\x02\\x03\" +\n\t\"\\x13\\x03\\x02\\x03\\x1d\\x03\\x02\\x03\\x1f\\x03\\x02\\x00\\x03\\x03\\x02\\x00\\x0d\\x03\" +\n\t\"\\x02\\x00\\x01\\x03\\x02\\x00\\x1b\\x03\\x02\\x00\\x19\\x03\\x02\\x00\\x18\\x03\\x02\\x00\" +\n\t\"\\x13\\x03\\x02\\x00/\\x03\\x07>\\x12\\x03\\x07<\\x1f\\x03\\x07>\\x1d\\x03\\x06\\x1d\\x0e\" +\n\t\"\\x03\\x07>\\x1c\\x03\\x07>:\\x03\\x07>\\x13\\x03\\x04\\x12+\\x03\\x07?\\x03\\x03\\x07>\" +\n\t\"\\x02\\x03\\x06\\x224\\x03\\x06\\x1a.\\x03\\x07<%\\x03\\x06\\x1c\\x0b\\x03\\x0609\\x03\" +\n\t\"\\x05\\x1f\\x01\\x03\\x04'\\x08\\x03\\x93\\xfd\\xf5\\x03\\x02\\x0d \\x03\\x02\\x0d#\\x03\" +\n\t\"\\x02\\x0d!\\x03\\x02\\x0d&\\x03\\x02\\x0d\\x22\\x03\\x02\\x0d/\\x03\\x02\\x0d,\\x03\\x02\" +\n\t\"\\x0d$\\x03\\x02\\x0d'\\x03\\x02\\x0d%\\x03\\x02\\x0d;\\x03\\x02\\x0d=\\x03\\x02\\x0d?\" +\n\t\"\\x03\\x099.\\x03\\x08\\x0b7\\x03\\x08\\x02\\x14\\x03\\x08\\x14\\x0d\\x03\\x08.:\\x03\" +\n\t\"\\x089'\\x03\\x0f\\x0b\\x18\\x03\\x0f\\x1c1\\x03\\x0f\\x17&\\x03\\x0f9\\x1f\\x03\\x0f0\" +\n\t\"\\x0c\\x03\\x0e\\x0a9\\x03\\x0e\\x056\\x03\\x0e\\x1c#\\x03\\x0f\\x13\\x0e\\x03\\x072\\x00\" +\n\t\"\\x03\\x070\\x0d\\x03\\x072\\x0b\\x03\\x06\\x11\\x18\\x03\\x070\\x10\\x03\\x06\\x0f(\\x03\" +\n\t\"\\x072\\x05\\x03\\x06\\x0f,\\x03\\x073\\x15\\x03\\x06\\x07\\x08\\x03\\x05\\x16\\x02\\x03\" +\n\t\"\\x04\\x0b \\x03\\x05:8\\x03\\x05\\x16%\\x03\\x0a\\x0d\\x1f\\x03\\x06\\x16\\x10\\x03\\x05\" +\n\t\"\\x1d5\\x03\\x05*;\\x03\\x05\\x16\\x1b\\x03\\x04.-\\x03\\x06\\x1a\\x19\\x03\\x04\\x03,\" +\n\t\"\\x03\\x0b87\\x03\\x04/\\x0a\\x03\\x06\\x00,\\x03\\x04-\\x01\\x03\\x04\\x1e-\\x03\\x06/(\" +\n\t\"\\x03\\x0a\\x0b5\\x03\\x06\\x0e7\\x03\\x06\\x07.\\x03\\x0597\\x03\\x0a*%\\x03\\x0760\" +\n\t\"\\x03\\x06\\x0c;\\x03\\x05'\\x00\\x03\\x072.\\x03\\x072\\x08\\x03\\x06=\\x01\\x03\\x06\" +\n\t\"\\x05\\x1b\\x03\\x06\\x06\\x12\\x03\\x06$=\\x03\\x06'\\x0d\\x03\\x04\\x11\\x0f\\x03\\x076\" +\n\t\",\\x03\\x06\\x07;\\x03\\x06.,\\x03\\x86\\xf9\\xea\\x03\\x8f\\xff\\xeb\\x02\\x092\\x02\" +\n\t\"\\x095\\x02\\x094\\x02\\x09;\\x02\\x09>\\x02\\x098\\x02\\x09*\\x02\\x09/\\x02\\x09,\\x02\" +\n\t\"\\x09%\\x02\\x09&\\x02\\x09#\\x02\\x09 \\x02\\x08!\\x02\\x08%\\x02\\x08$\\x02\\x08+\\x02\" +\n\t\"\\x08.\\x02\\x08*\\x02\\x08&\\x02\\x088\\x02\\x08>\\x02\\x084\\x02\\x086\\x02\\x080\\x02\" +\n\t\"\\x08\\x10\\x02\\x08\\x17\\x02\\x08\\x12\\x02\\x08\\x1d\\x02\\x08\\x1f\\x02\\x08\\x13\\x02\" +\n\t\"\\x08\\x15\\x02\\x08\\x14\\x02\\x08\\x0c\\x03\\x8b\\xfd\\xd0\\x03\\x81\\xec\\xc6\\x03\\x87\" +\n\t\"\\xe0\\x8a\\x03-2\\xe3\\x03\\x80\\xef\\xe4\\x03-2\\xea\\x03\\x88\\xe6\\xeb\\x03\\x8e\\xe6\" +\n\t\"\\xe8\\x03\\x84\\xe6\\xe9\\x03\\x97\\xe6\\xee\\x03-2\\xf9\\x03-2\\xf6\\x03\\x8e\\xe3\\xad\" +\n\t\"\\x03\\x80\\xe3\\x92\\x03\\x88\\xe3\\x90\\x03\\x8e\\xe3\\x90\\x03\\x80\\xe3\\x97\\x03\\x88\" +\n\t\"\\xe3\\x95\\x03\\x88\\xfe\\xcb\\x03\\x8e\\xfe\\xca\\x03\\x84\\xfe\\xcd\\x03\\x91\\xef\\xc9\" +\n\t\"\\x03-2\\xc1\\x03-2\\xc0\\x03-2\\xcb\\x03\\x88@\\x09\\x03\\x8e@\\x08\\x03\\x8f\\xe0\\xf5\" +\n\t\"\\x03\\x8e\\xe6\\xf9\\x03\\x8e\\xe0\\xfa\\x03\\x93\\xff\\xf4\\x03\\x84\\xee\\xd3\\x03\\x0b\" +\n\t\"(\\x04\\x023 \\x021;\\x02\\x01*\\x03\\x0b#\\x10\\x03\\x0b 0\\x03\\x0b!\\x10\\x03\\x0b!0\" +\n\t\"\\x03\\x07\\x15\\x08\\x03\\x09?5\\x03\\x07\\x1f\\x08\\x03\\x07\\x17\\x0b\\x03\\x09\\x1f\" +\n\t\"\\x15\\x03\\x0b\\x1c7\\x03\\x0a+#\\x03\\x06\\x1a\\x1b\\x03\\x06\\x1a\\x14\\x03\\x0a\\x01\" +\n\t\"\\x18\\x03\\x06#\\x1b\\x03\\x0a2\\x0c\\x03\\x0a\\x01\\x04\\x03\\x09#;\\x03\\x08='\\x03\" +\n\t\"\\x08\\x1a\\x0a\\x03\\x07\\x03\\x0a\\x111\\x03\\x09\\x1b\\x09\\x03\\x073.\\x03\\x07\\x01\\x00\" +\n\t\"\\x03\\x09/,\\x03\\x07#>\\x03\\x07\\x048\\x03\\x0a\\x1f\\x22\\x03\\x098>\\x03\\x09\\x11\" +\n\t\"\\x00\\x03\\x08/\\x17\\x03\\x06'\\x22\\x03\\x0b\\x1a+\\x03\\x0a\\x22\\x19\\x03\\x0a/1\" +\n\t\"\\x03\\x0974\\x03\\x09\\x0f\\x22\\x03\\x08,\\x22\\x03\\x08?\\x14\\x03\\x07$5\\x03\\x07<3\" +\n\t\"\\x03\\x07=*\\x03\\x07\\x13\\x18\\x03\\x068\\x0a\\x03\\x06\\x09\\x16\\x03\\x06\\x13\\x00\" +\n\t\"\\x03\\x08\\x067\\x03\\x08\\x01\\x03\\x03\\x08\\x12\\x1d\\x03\\x07+7\\x03\\x06(;\\x03\" +\n\t\"\\x06\\x1c?\\x03\\x07\\x0e\\x17\\x03\\x0a\\x06\\x1d\\x03\\x0a\\x19\\x07\\x03\\x08\\x14$\" +\n\t\"\\x03\\x07$;\\x03\\x08,$\\x03\\x08\\x06\\x0d\\x03\\x07\\x16\\x0a\\x03\\x06>>\\x03\\x0a\" +\n\t\"\\x06\\x12\\x03\\x0a\\x14)\\x03\\x09\\x0d\\x1f\\x03\\x09\\x12\\x17\\x03\\x09\\x19\\x01\" +\n\t\"\\x03\\x08\\x11 \\x03\\x08\\x1d'\\x03\\x06<\\x1a\\x03\\x0a.\\x00\\x03\\x07'\\x18\\x03\" +\n\t\"\\x0a\\x22\\x08\\x03\\x08\\x0d\\x0a\\x03\\x08\\x13)\\x03\\x07*)\\x03\\x06<,\\x03\\x07\" +\n\t\"\\x0b\\x1a\\x03\\x09.\\x14\\x03\\x09\\x0d\\x1e\\x03\\x07\\x0e#\\x03\\x0b\\x1d'\\x03\\x0a\" +\n\t\"\\x0a8\\x03\\x09%2\\x03\\x08+&\\x03\\x080\\x12\\x03\\x0a)4\\x03\\x08\\x06\\x1f\\x03\\x0b\" +\n\t\"\\x1b\\x1a\\x03\\x0a\\x1b\\x0f\\x03\\x0b\\x1d*\\x03\\x09\\x16$\\x03\\x090\\x11\\x03\\x08\" +\n\t\"\\x11\\x08\\x03\\x0a*(\\x03\\x0a\\x042\\x03\\x089,\\x03\\x074'\\x03\\x07\\x0f\\x05\\x03\" +\n\t\"\\x09\\x0b\\x0a\\x03\\x07\\x1b\\x01\\x03\\x09\\x17:\\x03\\x09.\\x0d\\x03\\x07.\\x11\\x03\" +\n\t\"\\x09+\\x15\\x03\\x080\\x13\\x03\\x0b\\x1f\\x19\\x03\\x0a \\x11\\x03\\x0a\\x220\\x03\\x09\" +\n\t\"\\x07;\\x03\\x08\\x16\\x1c\\x03\\x07,\\x13\\x03\\x07\\x0e/\\x03\\x06\\x221\\x03\\x0a.\" +\n\t\"\\x0a\\x03\\x0a7\\x02\\x03\\x0a\\x032\\x03\\x0a\\x1d.\\x03\\x091\\x06\\x03\\x09\\x19:\" +\n\t\"\\x03\\x08\\x02/\\x03\\x060+\\x03\\x06\\x0f-\\x03\\x06\\x1c\\x1f\\x03\\x06\\x1d\\x07\\x03\" +\n\t\"\\x0a,\\x11\\x03\\x09=\\x0d\\x03\\x09\\x0b;\\x03\\x07\\x1b/\\x03\\x0a\\x1f:\\x03\\x09 \" +\n\t\"\\x1f\\x03\\x09.\\x10\\x03\\x094\\x0b\\x03\\x09\\x1a1\\x03\\x08#\\x1a\\x03\\x084\\x1d\" +\n\t\"\\x03\\x08\\x01\\x1f\\x03\\x08\\x11\\x22\\x03\\x07'8\\x03\\x07\\x1a>\\x03\\x0757\\x03\" +\n\t\"\\x06&9\\x03\\x06+\\x11\\x03\\x0a.\\x0b\\x03\\x0a,>\\x03\\x0a4#\\x03\\x08%\\x17\\x03\" +\n\t\"\\x07\\x05\\x22\\x03\\x07\\x0c\\x0b\\x03\\x0a\\x1d+\\x03\\x0a\\x19\\x16\\x03\\x09+\\x1f\" +\n\t\"\\x03\\x09\\x08\\x0b\\x03\\x08\\x16\\x18\\x03\\x08+\\x12\\x03\\x0b\\x1d\\x0c\\x03\\x0a=\" +\n\t\"\\x10\\x03\\x0a\\x09\\x0d\\x03\\x0a\\x10\\x11\\x03\\x09&0\\x03\\x08(\\x1f\\x03\\x087\\x07\" +\n\t\"\\x03\\x08\\x185\\x03\\x07'6\\x03\\x06.\\x05\\x03\\x06=\\x04\\x03\\x06;;\\x03\\x06\\x06,\" +\n\t\"\\x03\\x0b\\x18>\\x03\\x08\\x00\\x18\\x03\\x06 \\x03\\x03\\x06<\\x00\\x03\\x09%\\x18\\x03\" +\n\t\"\\x0b\\x1c<\\x03\\x0a%!\\x03\\x0a\\x09\\x12\\x03\\x0a\\x16\\x02\\x03\\x090'\\x03\\x09\" +\n\t\"\\x0e=\\x03\\x08 \\x0e\\x03\\x08>\\x03\\x03\\x074>\\x03\\x06&?\\x03\\x06\\x19\\x09\\x03\" +\n\t\"\\x06?(\\x03\\x0a-\\x0e\\x03\\x09:3\\x03\\x098:\\x03\\x09\\x12\\x0b\\x03\\x09\\x1d\\x17\" +\n\t\"\\x03\\x087\\x05\\x03\\x082\\x14\\x03\\x08\\x06%\\x03\\x08\\x13\\x1f\\x03\\x06\\x06\\x0e\" +\n\t\"\\x03\\x0a\\x22<\\x03\\x09/<\\x03\\x06>+\\x03\\x0a'?\\x03\\x0a\\x13\\x0c\\x03\\x09\\x10<\" +\n\t\"\\x03\\x07\\x1b=\\x03\\x0a\\x19\\x13\\x03\\x09\\x22\\x1d\\x03\\x09\\x07\\x0d\\x03\\x08)\" +\n\t\"\\x1c\\x03\\x06=\\x1a\\x03\\x0a/4\\x03\\x0a7\\x11\\x03\\x0a\\x16:\\x03\\x09?3\\x03\\x09:\" +\n\t\"/\\x03\\x09\\x05\\x0a\\x03\\x09\\x14\\x06\\x03\\x087\\x22\\x03\\x080\\x07\\x03\\x08\\x1a\" +\n\t\"\\x1f\\x03\\x07\\x04(\\x03\\x07\\x04\\x09\\x03\\x06 %\\x03\\x06<\\x08\\x03\\x0a+\\x14\" +\n\t\"\\x03\\x09\\x1d\\x16\\x03\\x0a70\\x03\\x08 >\\x03\\x0857\\x03\\x070\\x0a\\x03\\x06=\\x12\" +\n\t\"\\x03\\x06\\x16%\\x03\\x06\\x1d,\\x03\\x099#\\x03\\x09\\x10>\\x03\\x07 \\x1e\\x03\\x08\" +\n\t\"\\x0c<\\x03\\x08\\x0b\\x18\\x03\\x08\\x15+\\x03\\x08,:\\x03\\x08%\\x22\\x03\\x07\\x0a$\" +\n\t\"\\x03\\x0b\\x1c=\\x03\\x07+\\x08\\x03\\x0a/\\x05\\x03\\x0a \\x07\\x03\\x0a\\x12'\\x03\" +\n\t\"\\x09#\\x11\\x03\\x08\\x1b\\x15\\x03\\x0a\\x06\\x01\\x03\\x09\\x1c\\x1b\\x03\\x0922\\x03\" +\n\t\"\\x07\\x14<\\x03\\x07\\x09\\x04\\x03\\x061\\x04\\x03\\x07\\x0e\\x01\\x03\\x0a\\x13\\x18\" +\n\t\"\\x03\\x0a-\\x0c\\x03\\x0a?\\x0d\\x03\\x0a\\x09\\x0a\\x03\\x091&\\x03\\x0a/\\x0b\\x03\" +\n\t\"\\x08$<\\x03\\x083\\x1d\\x03\\x08\\x0c$\\x03\\x08\\x0d\\x07\\x03\\x08\\x0d?\\x03\\x08\" +\n\t\"\\x0e\\x14\\x03\\x065\\x0a\\x03\\x08\\x1a#\\x03\\x08\\x16#\\x03\\x0702\\x03\\x07\\x03\" +\n\t\"\\x1a\\x03\\x06(\\x1d\\x03\\x06+\\x1b\\x03\\x06\\x0b\\x05\\x03\\x06\\x0b\\x17\\x03\\x06\" +\n\t\"\\x0c\\x04\\x03\\x06\\x1e\\x19\\x03\\x06+0\\x03\\x062\\x18\\x03\\x0b\\x16\\x1e\\x03\\x0a+\" +\n\t\"\\x16\\x03\\x0a-?\\x03\\x0a#:\\x03\\x0a#\\x10\\x03\\x0a%$\\x03\\x0a>+\\x03\\x0a01\\x03\" +\n\t\"\\x0a1\\x10\\x03\\x0a\\x099\\x03\\x0a\\x0a\\x12\\x03\\x0a\\x19\\x1f\\x03\\x0a\\x19\\x12\" +\n\t\"\\x03\\x09*)\\x03\\x09-\\x16\\x03\\x09.1\\x03\\x09.2\\x03\\x09<\\x0e\\x03\\x09> \\x03\" +\n\t\"\\x093\\x12\\x03\\x09\\x0b\\x01\\x03\\x09\\x1c2\\x03\\x09\\x11\\x1c\\x03\\x09\\x15%\\x03\" +\n\t\"\\x08,&\\x03\\x08!\\x22\\x03\\x089(\\x03\\x08\\x0b\\x1a\\x03\\x08\\x0d2\\x03\\x08\\x0c\" +\n\t\"\\x04\\x03\\x08\\x0c\\x06\\x03\\x08\\x0c\\x1f\\x03\\x08\\x0c\\x0c\\x03\\x08\\x0f\\x1f\\x03\" +\n\t\"\\x08\\x0f\\x1d\\x03\\x08\\x00\\x14\\x03\\x08\\x03\\x14\\x03\\x08\\x06\\x16\\x03\\x08\\x1e\" +\n\t\"#\\x03\\x08\\x11\\x11\\x03\\x08\\x10\\x18\\x03\\x08\\x14(\\x03\\x07)\\x1e\\x03\\x07.1\" +\n\t\"\\x03\\x07 $\\x03\\x07 '\\x03\\x078\\x08\\x03\\x07\\x0d0\\x03\\x07\\x0f7\\x03\\x07\\x05#\" +\n\t\"\\x03\\x07\\x05\\x1a\\x03\\x07\\x1a7\\x03\\x07\\x1d-\\x03\\x07\\x17\\x10\\x03\\x06)\\x1f\" +\n\t\"\\x03\\x062\\x0b\\x03\\x066\\x16\\x03\\x06\\x09\\x11\\x03\\x09(\\x1e\\x03\\x07!5\\x03\" +\n\t\"\\x0b\\x11\\x16\\x03\\x0a/\\x04\\x03\\x0a,\\x1a\\x03\\x0b\\x173\\x03\\x0a,1\\x03\\x0a/5\" +\n\t\"\\x03\\x0a\\x221\\x03\\x0a\\x22\\x0d\\x03\\x0a?%\\x03\\x0a<,\\x03\\x0a?#\\x03\\x0a>\\x19\" +\n\t\"\\x03\\x0a\\x08&\\x03\\x0a\\x0b\\x0e\\x03\\x0a\\x0c:\\x03\\x0a\\x0c+\\x03\\x0a\\x03\\x22\" +\n\t\"\\x03\\x0a\\x06)\\x03\\x0a\\x11\\x10\\x03\\x0a\\x11\\x1a\\x03\\x0a\\x17-\\x03\\x0a\\x14(\" +\n\t\"\\x03\\x09)\\x1e\\x03\\x09/\\x09\\x03\\x09.\\x00\\x03\\x09,\\x07\\x03\\x09/*\\x03\\x09-9\" +\n\t\"\\x03\\x09\\x228\\x03\\x09%\\x09\\x03\\x09:\\x12\\x03\\x09;\\x1d\\x03\\x09?\\x06\\x03\" +\n\t\"\\x093%\\x03\\x096\\x05\\x03\\x096\\x08\\x03\\x097\\x02\\x03\\x09\\x07,\\x03\\x09\\x04,\" +\n\t\"\\x03\\x09\\x1f\\x16\\x03\\x09\\x11\\x03\\x03\\x09\\x11\\x12\\x03\\x09\\x168\\x03\\x08*\" +\n\t\"\\x05\\x03\\x08/2\\x03\\x084:\\x03\\x08\\x22+\\x03\\x08 0\\x03\\x08&\\x0a\\x03\\x08;\" +\n\t\"\\x10\\x03\\x08>$\\x03\\x08>\\x18\\x03\\x0829\\x03\\x082:\\x03\\x081,\\x03\\x081<\\x03\" +\n\t\"\\x081\\x1c\\x03\\x087#\\x03\\x087*\\x03\\x08\\x09'\\x03\\x08\\x00\\x1d\\x03\\x08\\x05-\" +\n\t\"\\x03\\x08\\x1f4\\x03\\x08\\x1d\\x04\\x03\\x08\\x16\\x0f\\x03\\x07*7\\x03\\x07'!\\x03\" +\n\t\"\\x07%\\x1b\\x03\\x077\\x0c\\x03\\x07\\x0c1\\x03\\x07\\x0c.\\x03\\x07\\x00\\x06\\x03\\x07\" +\n\t\"\\x01\\x02\\x03\\x07\\x010\\x03\\x07\\x06=\\x03\\x07\\x01\\x03\\x03\\x07\\x01\\x13\\x03\" +\n\t\"\\x07\\x06\\x06\\x03\\x07\\x05\\x0a\\x03\\x07\\x1f\\x09\\x03\\x07\\x17:\\x03\\x06*1\\x03\" +\n\t\"\\x06-\\x1d\\x03\\x06\\x223\\x03\\x062:\\x03\\x060$\\x03\\x066\\x1e\\x03\\x064\\x12\\x03\" +\n\t\"\\x0645\\x03\\x06\\x0b\\x00\\x03\\x06\\x0b7\\x03\\x06\\x07\\x1f\\x03\\x06\\x15\\x12\\x03\" +\n\t\"\\x0c\\x05\\x0f\\x03\\x0b+\\x0b\\x03\\x0b+-\\x03\\x06\\x16\\x1b\\x03\\x06\\x15\\x17\\x03\" +\n\t\"\\x89\\xca\\xea\\x03\\x89\\xca\\xe8\\x03\\x0c8\\x10\\x03\\x0c8\\x01\\x03\\x0c8\\x0f\\x03\" +\n\t\"\\x0d8%\\x03\\x0d8!\\x03\\x0c8-\\x03\\x0c8/\\x03\\x0c8+\\x03\\x0c87\\x03\\x0c85\\x03\" +\n\t\"\\x0c9\\x09\\x03\\x0c9\\x0d\\x03\\x0c9\\x0f\\x03\\x0c9\\x0b\\x03\\xcfu\\x0c\\x03\\xcfu\" +\n\t\"\\x0f\\x03\\xcfu\\x0e\\x03\\xcfu\\x09\\x03\\x0c9\\x10\\x03\\x0d9\\x0c\\x03\\xcf`;\\x03\" +\n\t\"\\xcf`>\\x03\\xcf`9\\x03\\xcf`8\\x03\\xcf`7\\x03\\xcf`*\\x03\\xcf`-\\x03\\xcf`,\\x03\" +\n\t\"\\x0d\\x1b\\x1a\\x03\\x0d\\x1b&\\x03\\x0c=.\\x03\\x0c=%\\x03\\x0c>\\x1e\\x03\\x0c>\\x14\" +\n\t\"\\x03\\x0c?\\x06\\x03\\x0c?\\x0b\\x03\\x0c?\\x0c\\x03\\x0c?\\x0d\\x03\\x0c?\\x02\\x03\" +\n\t\"\\x0c>\\x0f\\x03\\x0c>\\x08\\x03\\x0c>\\x09\\x03\\x0c>,\\x03\\x0c>\\x0c\\x03\\x0c?\\x13\" +\n\t\"\\x03\\x0c?\\x16\\x03\\x0c?\\x15\\x03\\x0c?\\x1c\\x03\\x0c?\\x1f\\x03\\x0c?\\x1d\\x03\" +\n\t\"\\x0c?\\x1a\\x03\\x0c?\\x17\\x03\\x0c?\\x08\\x03\\x0c?\\x09\\x03\\x0c?\\x0e\\x03\\x0c?\" +\n\t\"\\x04\\x03\\x0c?\\x05\\x03\\x0c\" +\n\t\"\\x03\\x0c=2\\x03\\x0c=6\\x03\\x0c<\\x07\\x03\\x0c<\\x05\\x03\\x0e:!\\x03\\x0e:#\\x03\" +\n\t\"\\x0e8\\x09\\x03\\x0e:&\\x03\\x0e8\\x0b\\x03\\x0e:$\\x03\\x0e:,\\x03\\x0e8\\x1a\\x03\" +\n\t\"\\x0e8\\x1e\\x03\\x0e:*\\x03\\x0e:7\\x03\\x0e:5\\x03\\x0e:;\\x03\\x0e:\\x15\\x03\\x0e:<\" +\n\t\"\\x03\\x0e:4\\x03\\x0e:'\\x03\\x0e:-\\x03\\x0e:%\\x03\\x0e:?\\x03\\x0e:=\\x03\\x0e:)\" +\n\t\"\\x03\\x0e:/\\x03\\xcfs'\\x03\\x0d=\\x0f\\x03\\x0d+*\\x03\\x0d99\\x03\\x0d9;\\x03\\x0d9\" +\n\t\"?\\x03\\x0d)\\x0d\\x03\\x0d(%\\x02\\x01\\x18\\x02\\x01(\\x02\\x01\\x1e\\x03\\x0f$!\\x03\" +\n\t\"\\x0f87\\x03\\x0f4\\x0e\\x03\\x0f5\\x1d\\x03\\x06'\\x03\\x03\\x0f\\x08\\x18\\x03\\x0f\" +\n\t\"\\x0d\\x1b\\x03\\x0e2=\\x03\\x0e;\\x08\\x03\\x0e:\\x0b\\x03\\x0e\\x06$\\x03\\x0e\\x0d)\" +\n\t\"\\x03\\x0e\\x16\\x1f\\x03\\x0e\\x16\\x1b\\x03\\x0d$\\x0a\\x03\\x05,\\x1d\\x03\\x0d. \\x03\" +\n\t\"\\x0d.#\\x03\\x0c(/\\x03\\x09%\\x02\\x03\\x0d90\\x03\\x0d\\x0e4\\x03\\x0d\\x0d\\x0f\\x03\" +\n\t\"\\x0c#\\x00\\x03\\x0c,\\x1e\\x03\\x0c2\\x0e\\x03\\x0c\\x01\\x17\\x03\\x0c\\x09:\\x03\\x0e\" +\n\t\"\\x173\\x03\\x0c\\x08\\x03\\x03\\x0c\\x11\\x07\\x03\\x0c\\x10\\x18\\x03\\x0c\\x1f\\x1c\" +\n\t\"\\x03\\x0c\\x19\\x0e\\x03\\x0c\\x1a\\x1f\\x03\\x0f0>\\x03\\x0b->\\x03\\x0b<+\\x03\\x0b8\" +\n\t\"\\x13\\x03\\x0b\\x043\\x03\\x0b\\x14\\x03\\x03\\x0b\\x16%\\x03\\x0d\\x22&\\x03\\x0b\\x1a\" +\n\t\"\\x1a\\x03\\x0b\\x1a\\x04\\x03\\x0a%9\\x03\\x0a&2\\x03\\x0a&0\\x03\\x0a!\\x1a\\x03\\x0a!\" +\n\t\"7\\x03\\x0a5\\x10\\x03\\x0a=4\\x03\\x0a?\\x0e\\x03\\x0a>\\x10\\x03\\x0a\\x00 \\x03\\x0a\" +\n\t\"\\x0f:\\x03\\x0a\\x0f9\\x03\\x0a\\x0b\\x0a\\x03\\x0a\\x17%\\x03\\x0a\\x1b-\\x03\\x09-\" +\n\t\"\\x1a\\x03\\x09,4\\x03\\x09.,\\x03\\x09)\\x09\\x03\\x096!\\x03\\x091\\x1f\\x03\\x093\" +\n\t\"\\x16\\x03\\x0c+\\x1f\\x03\\x098 \\x03\\x098=\\x03\\x0c(\\x1a\\x03\\x0c(\\x16\\x03\\x09\" +\n\t\"\\x0a+\\x03\\x09\\x16\\x12\\x03\\x09\\x13\\x0e\\x03\\x09\\x153\\x03\\x08)!\\x03\\x09\\x1a\" +\n\t\"\\x01\\x03\\x09\\x18\\x01\\x03\\x08%#\\x03\\x08>\\x22\\x03\\x08\\x05%\\x03\\x08\\x02*\" +\n\t\"\\x03\\x08\\x15;\\x03\\x08\\x1b7\\x03\\x0f\\x07\\x1d\\x03\\x0f\\x04\\x03\\x03\\x070\\x0c\" +\n\t\"\\x03\\x07;\\x0b\\x03\\x07\\x08\\x17\\x03\\x07\\x12\\x06\\x03\\x06/-\\x03\\x0671\\x03\" +\n\t\"\\x065+\\x03\\x06>7\\x03\\x06\\x049\\x03\\x05+\\x1e\\x03\\x05,\\x17\\x03\\x05 \\x1d\\x03\" +\n\t\"\\x05\\x22\\x05\\x03\\x050\\x1d\"\n\n// lookup returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookup(s []byte) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupUnsafe(s []byte) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// lookupString returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookupString(s string) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupStringUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupStringUnsafe(s string) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// idnaTrie. Total size: 29404 bytes (28.71 KiB). Checksum: 848c45acb5f7991c.\ntype idnaTrie struct{}\n\nfunc newIdnaTrie(i int) *idnaTrie {\n\treturn &idnaTrie{}\n}\n\n// lookupValue determines the type of block n and looks up the value for b.\nfunc (t *idnaTrie) lookupValue(n uint32, b byte) uint16 {\n\tswitch {\n\tcase n < 125:\n\t\treturn uint16(idnaValues[n<<6+uint32(b)])\n\tdefault:\n\t\tn -= 125\n\t\treturn uint16(idnaSparse.lookup(n, b))\n\t}\n}\n\n// idnaValues: 127 blocks, 8128 entries, 16256 bytes\n// The third block is the zero block.\nvar idnaValues = [8128]uint16{\n\t// Block 0x0, offset 0x0\n\t0x00: 0x0080, 0x01: 0x0080, 0x02: 0x0080, 0x03: 0x0080, 0x04: 0x0080, 0x05: 0x0080,\n\t0x06: 0x0080, 0x07: 0x0080, 0x08: 0x0080, 0x09: 0x0080, 0x0a: 0x0080, 0x0b: 0x0080,\n\t0x0c: 0x0080, 0x0d: 0x0080, 0x0e: 0x0080, 0x0f: 0x0080, 0x10: 0x0080, 0x11: 0x0080,\n\t0x12: 0x0080, 0x13: 0x0080, 0x14: 0x0080, 0x15: 0x0080, 0x16: 0x0080, 0x17: 0x0080,\n\t0x18: 0x0080, 0x19: 0x0080, 0x1a: 0x0080, 0x1b: 0x0080, 0x1c: 0x0080, 0x1d: 0x0080,\n\t0x1e: 0x0080, 0x1f: 0x0080, 0x20: 0x0080, 0x21: 0x0080, 0x22: 0x0080, 0x23: 0x0080,\n\t0x24: 0x0080, 0x25: 0x0080, 0x26: 0x0080, 0x27: 0x0080, 0x28: 0x0080, 0x29: 0x0080,\n\t0x2a: 0x0080, 0x2b: 0x0080, 0x2c: 0x0080, 0x2d: 0x0008, 0x2e: 0x0008, 0x2f: 0x0080,\n\t0x30: 0x0008, 0x31: 0x0008, 0x32: 0x0008, 0x33: 0x0008, 0x34: 0x0008, 0x35: 0x0008,\n\t0x36: 0x0008, 0x37: 0x0008, 0x38: 0x0008, 0x39: 0x0008, 0x3a: 0x0080, 0x3b: 0x0080,\n\t0x3c: 0x0080, 0x3d: 0x0080, 0x3e: 0x0080, 0x3f: 0x0080,\n\t// Block 0x1, offset 0x40\n\t0x40: 0x0080, 0x41: 0xe105, 0x42: 0xe105, 0x43: 0xe105, 0x44: 0xe105, 0x45: 0xe105,\n\t0x46: 0xe105, 0x47: 0xe105, 0x48: 0xe105, 0x49: 0xe105, 0x4a: 0xe105, 0x4b: 0xe105,\n\t0x4c: 0xe105, 0x4d: 0xe105, 0x4e: 0xe105, 0x4f: 0xe105, 0x50: 0xe105, 0x51: 0xe105,\n\t0x52: 0xe105, 0x53: 0xe105, 0x54: 0xe105, 0x55: 0xe105, 0x56: 0xe105, 0x57: 0xe105,\n\t0x58: 0xe105, 0x59: 0xe105, 0x5a: 0xe105, 0x5b: 0x0080, 0x5c: 0x0080, 0x5d: 0x0080,\n\t0x5e: 0x0080, 0x5f: 0x0080, 0x60: 0x0080, 0x61: 0x0008, 0x62: 0x0008, 0x63: 0x0008,\n\t0x64: 0x0008, 0x65: 0x0008, 0x66: 0x0008, 0x67: 0x0008, 0x68: 0x0008, 0x69: 0x0008,\n\t0x6a: 0x0008, 0x6b: 0x0008, 0x6c: 0x0008, 0x6d: 0x0008, 0x6e: 0x0008, 0x6f: 0x0008,\n\t0x70: 0x0008, 0x71: 0x0008, 0x72: 0x0008, 0x73: 0x0008, 0x74: 0x0008, 0x75: 0x0008,\n\t0x76: 0x0008, 0x77: 0x0008, 0x78: 0x0008, 0x79: 0x0008, 0x7a: 0x0008, 0x7b: 0x0080,\n\t0x7c: 0x0080, 0x7d: 0x0080, 0x7e: 0x0080, 0x7f: 0x0080,\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc0: 0x0040, 0xc1: 0x0040, 0xc2: 0x0040, 0xc3: 0x0040, 0xc4: 0x0040, 0xc5: 0x0040,\n\t0xc6: 0x0040, 0xc7: 0x0040, 0xc8: 0x0040, 0xc9: 0x0040, 0xca: 0x0040, 0xcb: 0x0040,\n\t0xcc: 0x0040, 0xcd: 0x0040, 0xce: 0x0040, 0xcf: 0x0040, 0xd0: 0x0040, 0xd1: 0x0040,\n\t0xd2: 0x0040, 0xd3: 0x0040, 0xd4: 0x0040, 0xd5: 0x0040, 0xd6: 0x0040, 0xd7: 0x0040,\n\t0xd8: 0x0040, 0xd9: 0x0040, 0xda: 0x0040, 0xdb: 0x0040, 0xdc: 0x0040, 0xdd: 0x0040,\n\t0xde: 0x0040, 0xdf: 0x0040, 0xe0: 0x000a, 0xe1: 0x0018, 0xe2: 0x0018, 0xe3: 0x0018,\n\t0xe4: 0x0018, 0xe5: 0x0018, 0xe6: 0x0018, 0xe7: 0x0018, 0xe8: 0x001a, 0xe9: 0x0018,\n\t0xea: 0x0039, 0xeb: 0x0018, 0xec: 0x0018, 0xed: 0x03c0, 0xee: 0x0018, 0xef: 0x004a,\n\t0xf0: 0x0018, 0xf1: 0x0018, 0xf2: 0x0069, 0xf3: 0x0079, 0xf4: 0x008a, 0xf5: 0x0005,\n\t0xf6: 0x0018, 0xf7: 0x0008, 0xf8: 0x00aa, 0xf9: 0x00c9, 0xfa: 0x00d9, 0xfb: 0x0018,\n\t0xfc: 0x00e9, 0xfd: 0x0119, 0xfe: 0x0149, 0xff: 0x0018,\n\t// Block 0x4, offset 0x100\n\t0x100: 0xe00d, 0x101: 0x0008, 0x102: 0xe00d, 0x103: 0x0008, 0x104: 0xe00d, 0x105: 0x0008,\n\t0x106: 0xe00d, 0x107: 0x0008, 0x108: 0xe00d, 0x109: 0x0008, 0x10a: 0xe00d, 0x10b: 0x0008,\n\t0x10c: 0xe00d, 0x10d: 0x0008, 0x10e: 0xe00d, 0x10f: 0x0008, 0x110: 0xe00d, 0x111: 0x0008,\n\t0x112: 0xe00d, 0x113: 0x0008, 0x114: 0xe00d, 0x115: 0x0008, 0x116: 0xe00d, 0x117: 0x0008,\n\t0x118: 0xe00d, 0x119: 0x0008, 0x11a: 0xe00d, 0x11b: 0x0008, 0x11c: 0xe00d, 0x11d: 0x0008,\n\t0x11e: 0xe00d, 0x11f: 0x0008, 0x120: 0xe00d, 0x121: 0x0008, 0x122: 0xe00d, 0x123: 0x0008,\n\t0x124: 0xe00d, 0x125: 0x0008, 0x126: 0xe00d, 0x127: 0x0008, 0x128: 0xe00d, 0x129: 0x0008,\n\t0x12a: 0xe00d, 0x12b: 0x0008, 0x12c: 0xe00d, 0x12d: 0x0008, 0x12e: 0xe00d, 0x12f: 0x0008,\n\t0x130: 0x0179, 0x131: 0x0008, 0x132: 0x0035, 0x133: 0x004d, 0x134: 0xe00d, 0x135: 0x0008,\n\t0x136: 0xe00d, 0x137: 0x0008, 0x138: 0x0008, 0x139: 0xe01d, 0x13a: 0x0008, 0x13b: 0xe03d,\n\t0x13c: 0x0008, 0x13d: 0xe01d, 0x13e: 0x0008, 0x13f: 0x0199,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x0199, 0x141: 0xe01d, 0x142: 0x0008, 0x143: 0xe03d, 0x144: 0x0008, 0x145: 0xe01d,\n\t0x146: 0x0008, 0x147: 0xe07d, 0x148: 0x0008, 0x149: 0x01b9, 0x14a: 0xe00d, 0x14b: 0x0008,\n\t0x14c: 0xe00d, 0x14d: 0x0008, 0x14e: 0xe00d, 0x14f: 0x0008, 0x150: 0xe00d, 0x151: 0x0008,\n\t0x152: 0xe00d, 0x153: 0x0008, 0x154: 0xe00d, 0x155: 0x0008, 0x156: 0xe00d, 0x157: 0x0008,\n\t0x158: 0xe00d, 0x159: 0x0008, 0x15a: 0xe00d, 0x15b: 0x0008, 0x15c: 0xe00d, 0x15d: 0x0008,\n\t0x15e: 0xe00d, 0x15f: 0x0008, 0x160: 0xe00d, 0x161: 0x0008, 0x162: 0xe00d, 0x163: 0x0008,\n\t0x164: 0xe00d, 0x165: 0x0008, 0x166: 0xe00d, 0x167: 0x0008, 0x168: 0xe00d, 0x169: 0x0008,\n\t0x16a: 0xe00d, 0x16b: 0x0008, 0x16c: 0xe00d, 0x16d: 0x0008, 0x16e: 0xe00d, 0x16f: 0x0008,\n\t0x170: 0xe00d, 0x171: 0x0008, 0x172: 0xe00d, 0x173: 0x0008, 0x174: 0xe00d, 0x175: 0x0008,\n\t0x176: 0xe00d, 0x177: 0x0008, 0x178: 0x0065, 0x179: 0xe01d, 0x17a: 0x0008, 0x17b: 0xe03d,\n\t0x17c: 0x0008, 0x17d: 0xe01d, 0x17e: 0x0008, 0x17f: 0x01d9,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x0008, 0x181: 0x007d, 0x182: 0xe00d, 0x183: 0x0008, 0x184: 0xe00d, 0x185: 0x0008,\n\t0x186: 0x007d, 0x187: 0xe07d, 0x188: 0x0008, 0x189: 0x0095, 0x18a: 0x00ad, 0x18b: 0xe03d,\n\t0x18c: 0x0008, 0x18d: 0x0008, 0x18e: 0x00c5, 0x18f: 0x00dd, 0x190: 0x00f5, 0x191: 0xe01d,\n\t0x192: 0x0008, 0x193: 0x010d, 0x194: 0x0125, 0x195: 0x0008, 0x196: 0x013d, 0x197: 0x013d,\n\t0x198: 0xe00d, 0x199: 0x0008, 0x19a: 0x0008, 0x19b: 0x0008, 0x19c: 0x010d, 0x19d: 0x0155,\n\t0x19e: 0x0008, 0x19f: 0x016d, 0x1a0: 0xe00d, 0x1a1: 0x0008, 0x1a2: 0xe00d, 0x1a3: 0x0008,\n\t0x1a4: 0xe00d, 0x1a5: 0x0008, 0x1a6: 0x0185, 0x1a7: 0xe07d, 0x1a8: 0x0008, 0x1a9: 0x019d,\n\t0x1aa: 0x0008, 0x1ab: 0x0008, 0x1ac: 0xe00d, 0x1ad: 0x0008, 0x1ae: 0x0185, 0x1af: 0xe0fd,\n\t0x1b0: 0x0008, 0x1b1: 0x01b5, 0x1b2: 0x01cd, 0x1b3: 0xe03d, 0x1b4: 0x0008, 0x1b5: 0xe01d,\n\t0x1b6: 0x0008, 0x1b7: 0x01e5, 0x1b8: 0xe00d, 0x1b9: 0x0008, 0x1ba: 0x0008, 0x1bb: 0x0008,\n\t0x1bc: 0xe00d, 0x1bd: 0x0008, 0x1be: 0x0008, 0x1bf: 0x0008,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x0008, 0x1c1: 0x0008, 0x1c2: 0x0008, 0x1c3: 0x0008, 0x1c4: 0x01e9, 0x1c5: 0x01e9,\n\t0x1c6: 0x01e9, 0x1c7: 0x01fd, 0x1c8: 0x0215, 0x1c9: 0x022d, 0x1ca: 0x0245, 0x1cb: 0x025d,\n\t0x1cc: 0x0275, 0x1cd: 0xe01d, 0x1ce: 0x0008, 0x1cf: 0xe0fd, 0x1d0: 0x0008, 0x1d1: 0xe01d,\n\t0x1d2: 0x0008, 0x1d3: 0xe03d, 0x1d4: 0x0008, 0x1d5: 0xe01d, 0x1d6: 0x0008, 0x1d7: 0xe07d,\n\t0x1d8: 0x0008, 0x1d9: 0xe01d, 0x1da: 0x0008, 0x1db: 0xe03d, 0x1dc: 0x0008, 0x1dd: 0x0008,\n\t0x1de: 0xe00d, 0x1df: 0x0008, 0x1e0: 0xe00d, 0x1e1: 0x0008, 0x1e2: 0xe00d, 0x1e3: 0x0008,\n\t0x1e4: 0xe00d, 0x1e5: 0x0008, 0x1e6: 0xe00d, 0x1e7: 0x0008, 0x1e8: 0xe00d, 0x1e9: 0x0008,\n\t0x1ea: 0xe00d, 0x1eb: 0x0008, 0x1ec: 0xe00d, 0x1ed: 0x0008, 0x1ee: 0xe00d, 0x1ef: 0x0008,\n\t0x1f0: 0x0008, 0x1f1: 0x028d, 0x1f2: 0x02a5, 0x1f3: 0x02bd, 0x1f4: 0xe00d, 0x1f5: 0x0008,\n\t0x1f6: 0x02d5, 0x1f7: 0x02ed, 0x1f8: 0xe00d, 0x1f9: 0x0008, 0x1fa: 0xe00d, 0x1fb: 0x0008,\n\t0x1fc: 0xe00d, 0x1fd: 0x0008, 0x1fe: 0xe00d, 0x1ff: 0x0008,\n\t// Block 0x8, offset 0x200\n\t0x200: 0xe00d, 0x201: 0x0008, 0x202: 0xe00d, 0x203: 0x0008, 0x204: 0xe00d, 0x205: 0x0008,\n\t0x206: 0xe00d, 0x207: 0x0008, 0x208: 0xe00d, 0x209: 0x0008, 0x20a: 0xe00d, 0x20b: 0x0008,\n\t0x20c: 0xe00d, 0x20d: 0x0008, 0x20e: 0xe00d, 0x20f: 0x0008, 0x210: 0xe00d, 0x211: 0x0008,\n\t0x212: 0xe00d, 0x213: 0x0008, 0x214: 0xe00d, 0x215: 0x0008, 0x216: 0xe00d, 0x217: 0x0008,\n\t0x218: 0xe00d, 0x219: 0x0008, 0x21a: 0xe00d, 0x21b: 0x0008, 0x21c: 0xe00d, 0x21d: 0x0008,\n\t0x21e: 0xe00d, 0x21f: 0x0008, 0x220: 0x0305, 0x221: 0x0008, 0x222: 0xe00d, 0x223: 0x0008,\n\t0x224: 0xe00d, 0x225: 0x0008, 0x226: 0xe00d, 0x227: 0x0008, 0x228: 0xe00d, 0x229: 0x0008,\n\t0x22a: 0xe00d, 0x22b: 0x0008, 0x22c: 0xe00d, 0x22d: 0x0008, 0x22e: 0xe00d, 0x22f: 0x0008,\n\t0x230: 0xe00d, 0x231: 0x0008, 0x232: 0xe00d, 0x233: 0x0008, 0x234: 0x0008, 0x235: 0x0008,\n\t0x236: 0x0008, 0x237: 0x0008, 0x238: 0x0008, 0x239: 0x0008, 0x23a: 0x0209, 0x23b: 0xe03d,\n\t0x23c: 0x0008, 0x23d: 0x031d, 0x23e: 0x0229, 0x23f: 0x0008,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x0008, 0x241: 0x0008, 0x242: 0x0018, 0x243: 0x0018, 0x244: 0x0018, 0x245: 0x0018,\n\t0x246: 0x0008, 0x247: 0x0008, 0x248: 0x0008, 0x249: 0x0008, 0x24a: 0x0008, 0x24b: 0x0008,\n\t0x24c: 0x0008, 0x24d: 0x0008, 0x24e: 0x0008, 0x24f: 0x0008, 0x250: 0x0008, 0x251: 0x0008,\n\t0x252: 0x0018, 0x253: 0x0018, 0x254: 0x0018, 0x255: 0x0018, 0x256: 0x0018, 0x257: 0x0018,\n\t0x258: 0x029a, 0x259: 0x02ba, 0x25a: 0x02da, 0x25b: 0x02fa, 0x25c: 0x031a, 0x25d: 0x033a,\n\t0x25e: 0x0018, 0x25f: 0x0018, 0x260: 0x03ad, 0x261: 0x0359, 0x262: 0x01d9, 0x263: 0x0369,\n\t0x264: 0x03c5, 0x265: 0x0018, 0x266: 0x0018, 0x267: 0x0018, 0x268: 0x0018, 0x269: 0x0018,\n\t0x26a: 0x0018, 0x26b: 0x0018, 0x26c: 0x0008, 0x26d: 0x0018, 0x26e: 0x0008, 0x26f: 0x0018,\n\t0x270: 0x0018, 0x271: 0x0018, 0x272: 0x0018, 0x273: 0x0018, 0x274: 0x0018, 0x275: 0x0018,\n\t0x276: 0x0018, 0x277: 0x0018, 0x278: 0x0018, 0x279: 0x0018, 0x27a: 0x0018, 0x27b: 0x0018,\n\t0x27c: 0x0018, 0x27d: 0x0018, 0x27e: 0x0018, 0x27f: 0x0018,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x03dd, 0x281: 0x03dd, 0x282: 0x3308, 0x283: 0x03f5, 0x284: 0x0379, 0x285: 0x040d,\n\t0x286: 0x3308, 0x287: 0x3308, 0x288: 0x3308, 0x289: 0x3308, 0x28a: 0x3308, 0x28b: 0x3308,\n\t0x28c: 0x3308, 0x28d: 0x3308, 0x28e: 0x3308, 0x28f: 0x33c0, 0x290: 0x3308, 0x291: 0x3308,\n\t0x292: 0x3308, 0x293: 0x3308, 0x294: 0x3308, 0x295: 0x3308, 0x296: 0x3308, 0x297: 0x3308,\n\t0x298: 0x3308, 0x299: 0x3308, 0x29a: 0x3308, 0x29b: 0x3308, 0x29c: 0x3308, 0x29d: 0x3308,\n\t0x29e: 0x3308, 0x29f: 0x3308, 0x2a0: 0x3308, 0x2a1: 0x3308, 0x2a2: 0x3308, 0x2a3: 0x3308,\n\t0x2a4: 0x3308, 0x2a5: 0x3308, 0x2a6: 0x3308, 0x2a7: 0x3308, 0x2a8: 0x3308, 0x2a9: 0x3308,\n\t0x2aa: 0x3308, 0x2ab: 0x3308, 0x2ac: 0x3308, 0x2ad: 0x3308, 0x2ae: 0x3308, 0x2af: 0x3308,\n\t0x2b0: 0xe00d, 0x2b1: 0x0008, 0x2b2: 0xe00d, 0x2b3: 0x0008, 0x2b4: 0x0425, 0x2b5: 0x0008,\n\t0x2b6: 0xe00d, 0x2b7: 0x0008, 0x2b8: 0x0040, 0x2b9: 0x0040, 0x2ba: 0x03a2, 0x2bb: 0x0008,\n\t0x2bc: 0x0008, 0x2bd: 0x0008, 0x2be: 0x03c2, 0x2bf: 0x043d,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x0040, 0x2c1: 0x0040, 0x2c2: 0x0040, 0x2c3: 0x0040, 0x2c4: 0x008a, 0x2c5: 0x03d2,\n\t0x2c6: 0xe155, 0x2c7: 0x0455, 0x2c8: 0xe12d, 0x2c9: 0xe13d, 0x2ca: 0xe12d, 0x2cb: 0x0040,\n\t0x2cc: 0x03dd, 0x2cd: 0x0040, 0x2ce: 0x046d, 0x2cf: 0x0485, 0x2d0: 0x0008, 0x2d1: 0xe105,\n\t0x2d2: 0xe105, 0x2d3: 0xe105, 0x2d4: 0xe105, 0x2d5: 0xe105, 0x2d6: 0xe105, 0x2d7: 0xe105,\n\t0x2d8: 0xe105, 0x2d9: 0xe105, 0x2da: 0xe105, 0x2db: 0xe105, 0x2dc: 0xe105, 0x2dd: 0xe105,\n\t0x2de: 0xe105, 0x2df: 0xe105, 0x2e0: 0x049d, 0x2e1: 0x049d, 0x2e2: 0x0040, 0x2e3: 0x049d,\n\t0x2e4: 0x049d, 0x2e5: 0x049d, 0x2e6: 0x049d, 0x2e7: 0x049d, 0x2e8: 0x049d, 0x2e9: 0x049d,\n\t0x2ea: 0x049d, 0x2eb: 0x049d, 0x2ec: 0x0008, 0x2ed: 0x0008, 0x2ee: 0x0008, 0x2ef: 0x0008,\n\t0x2f0: 0x0008, 0x2f1: 0x0008, 0x2f2: 0x0008, 0x2f3: 0x0008, 0x2f4: 0x0008, 0x2f5: 0x0008,\n\t0x2f6: 0x0008, 0x2f7: 0x0008, 0x2f8: 0x0008, 0x2f9: 0x0008, 0x2fa: 0x0008, 0x2fb: 0x0008,\n\t0x2fc: 0x0008, 0x2fd: 0x0008, 0x2fe: 0x0008, 0x2ff: 0x0008,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x0008, 0x301: 0x0008, 0x302: 0xe00f, 0x303: 0x0008, 0x304: 0x0008, 0x305: 0x0008,\n\t0x306: 0x0008, 0x307: 0x0008, 0x308: 0x0008, 0x309: 0x0008, 0x30a: 0x0008, 0x30b: 0x0008,\n\t0x30c: 0x0008, 0x30d: 0x0008, 0x30e: 0x0008, 0x30f: 0xe0c5, 0x310: 0x04b5, 0x311: 0x04cd,\n\t0x312: 0xe0bd, 0x313: 0xe0f5, 0x314: 0xe0fd, 0x315: 0xe09d, 0x316: 0xe0b5, 0x317: 0x0008,\n\t0x318: 0xe00d, 0x319: 0x0008, 0x31a: 0xe00d, 0x31b: 0x0008, 0x31c: 0xe00d, 0x31d: 0x0008,\n\t0x31e: 0xe00d, 0x31f: 0x0008, 0x320: 0xe00d, 0x321: 0x0008, 0x322: 0xe00d, 0x323: 0x0008,\n\t0x324: 0xe00d, 0x325: 0x0008, 0x326: 0xe00d, 0x327: 0x0008, 0x328: 0xe00d, 0x329: 0x0008,\n\t0x32a: 0xe00d, 0x32b: 0x0008, 0x32c: 0xe00d, 0x32d: 0x0008, 0x32e: 0xe00d, 0x32f: 0x0008,\n\t0x330: 0x04e5, 0x331: 0xe185, 0x332: 0xe18d, 0x333: 0x0008, 0x334: 0x04fd, 0x335: 0x03dd,\n\t0x336: 0x0018, 0x337: 0xe07d, 0x338: 0x0008, 0x339: 0xe1d5, 0x33a: 0xe00d, 0x33b: 0x0008,\n\t0x33c: 0x0008, 0x33d: 0x0515, 0x33e: 0x052d, 0x33f: 0x052d,\n\t// Block 0xd, offset 0x340\n\t0x340: 0x0008, 0x341: 0x0008, 0x342: 0x0008, 0x343: 0x0008, 0x344: 0x0008, 0x345: 0x0008,\n\t0x346: 0x0008, 0x347: 0x0008, 0x348: 0x0008, 0x349: 0x0008, 0x34a: 0x0008, 0x34b: 0x0008,\n\t0x34c: 0x0008, 0x34d: 0x0008, 0x34e: 0x0008, 0x34f: 0x0008, 0x350: 0x0008, 0x351: 0x0008,\n\t0x352: 0x0008, 0x353: 0x0008, 0x354: 0x0008, 0x355: 0x0008, 0x356: 0x0008, 0x357: 0x0008,\n\t0x358: 0x0008, 0x359: 0x0008, 0x35a: 0x0008, 0x35b: 0x0008, 0x35c: 0x0008, 0x35d: 0x0008,\n\t0x35e: 0x0008, 0x35f: 0x0008, 0x360: 0xe00d, 0x361: 0x0008, 0x362: 0xe00d, 0x363: 0x0008,\n\t0x364: 0xe00d, 0x365: 0x0008, 0x366: 0xe00d, 0x367: 0x0008, 0x368: 0xe00d, 0x369: 0x0008,\n\t0x36a: 0xe00d, 0x36b: 0x0008, 0x36c: 0xe00d, 0x36d: 0x0008, 0x36e: 0xe00d, 0x36f: 0x0008,\n\t0x370: 0xe00d, 0x371: 0x0008, 0x372: 0xe00d, 0x373: 0x0008, 0x374: 0xe00d, 0x375: 0x0008,\n\t0x376: 0xe00d, 0x377: 0x0008, 0x378: 0xe00d, 0x379: 0x0008, 0x37a: 0xe00d, 0x37b: 0x0008,\n\t0x37c: 0xe00d, 0x37d: 0x0008, 0x37e: 0xe00d, 0x37f: 0x0008,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xe00d, 0x381: 0x0008, 0x382: 0x0018, 0x383: 0x3308, 0x384: 0x3308, 0x385: 0x3308,\n\t0x386: 0x3308, 0x387: 0x3308, 0x388: 0x3318, 0x389: 0x3318, 0x38a: 0xe00d, 0x38b: 0x0008,\n\t0x38c: 0xe00d, 0x38d: 0x0008, 0x38e: 0xe00d, 0x38f: 0x0008, 0x390: 0xe00d, 0x391: 0x0008,\n\t0x392: 0xe00d, 0x393: 0x0008, 0x394: 0xe00d, 0x395: 0x0008, 0x396: 0xe00d, 0x397: 0x0008,\n\t0x398: 0xe00d, 0x399: 0x0008, 0x39a: 0xe00d, 0x39b: 0x0008, 0x39c: 0xe00d, 0x39d: 0x0008,\n\t0x39e: 0xe00d, 0x39f: 0x0008, 0x3a0: 0xe00d, 0x3a1: 0x0008, 0x3a2: 0xe00d, 0x3a3: 0x0008,\n\t0x3a4: 0xe00d, 0x3a5: 0x0008, 0x3a6: 0xe00d, 0x3a7: 0x0008, 0x3a8: 0xe00d, 0x3a9: 0x0008,\n\t0x3aa: 0xe00d, 0x3ab: 0x0008, 0x3ac: 0xe00d, 0x3ad: 0x0008, 0x3ae: 0xe00d, 0x3af: 0x0008,\n\t0x3b0: 0xe00d, 0x3b1: 0x0008, 0x3b2: 0xe00d, 0x3b3: 0x0008, 0x3b4: 0xe00d, 0x3b5: 0x0008,\n\t0x3b6: 0xe00d, 0x3b7: 0x0008, 0x3b8: 0xe00d, 0x3b9: 0x0008, 0x3ba: 0xe00d, 0x3bb: 0x0008,\n\t0x3bc: 0xe00d, 0x3bd: 0x0008, 0x3be: 0xe00d, 0x3bf: 0x0008,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x0040, 0x3c1: 0xe01d, 0x3c2: 0x0008, 0x3c3: 0xe03d, 0x3c4: 0x0008, 0x3c5: 0xe01d,\n\t0x3c6: 0x0008, 0x3c7: 0xe07d, 0x3c8: 0x0008, 0x3c9: 0xe01d, 0x3ca: 0x0008, 0x3cb: 0xe03d,\n\t0x3cc: 0x0008, 0x3cd: 0xe01d, 0x3ce: 0x0008, 0x3cf: 0x0008, 0x3d0: 0xe00d, 0x3d1: 0x0008,\n\t0x3d2: 0xe00d, 0x3d3: 0x0008, 0x3d4: 0xe00d, 0x3d5: 0x0008, 0x3d6: 0xe00d, 0x3d7: 0x0008,\n\t0x3d8: 0xe00d, 0x3d9: 0x0008, 0x3da: 0xe00d, 0x3db: 0x0008, 0x3dc: 0xe00d, 0x3dd: 0x0008,\n\t0x3de: 0xe00d, 0x3df: 0x0008, 0x3e0: 0xe00d, 0x3e1: 0x0008, 0x3e2: 0xe00d, 0x3e3: 0x0008,\n\t0x3e4: 0xe00d, 0x3e5: 0x0008, 0x3e6: 0xe00d, 0x3e7: 0x0008, 0x3e8: 0xe00d, 0x3e9: 0x0008,\n\t0x3ea: 0xe00d, 0x3eb: 0x0008, 0x3ec: 0xe00d, 0x3ed: 0x0008, 0x3ee: 0xe00d, 0x3ef: 0x0008,\n\t0x3f0: 0xe00d, 0x3f1: 0x0008, 0x3f2: 0xe00d, 0x3f3: 0x0008, 0x3f4: 0xe00d, 0x3f5: 0x0008,\n\t0x3f6: 0xe00d, 0x3f7: 0x0008, 0x3f8: 0xe00d, 0x3f9: 0x0008, 0x3fa: 0xe00d, 0x3fb: 0x0008,\n\t0x3fc: 0xe00d, 0x3fd: 0x0008, 0x3fe: 0xe00d, 0x3ff: 0x0008,\n\t// Block 0x10, offset 0x400\n\t0x400: 0xe00d, 0x401: 0x0008, 0x402: 0xe00d, 0x403: 0x0008, 0x404: 0xe00d, 0x405: 0x0008,\n\t0x406: 0xe00d, 0x407: 0x0008, 0x408: 0xe00d, 0x409: 0x0008, 0x40a: 0xe00d, 0x40b: 0x0008,\n\t0x40c: 0xe00d, 0x40d: 0x0008, 0x40e: 0xe00d, 0x40f: 0x0008, 0x410: 0xe00d, 0x411: 0x0008,\n\t0x412: 0xe00d, 0x413: 0x0008, 0x414: 0xe00d, 0x415: 0x0008, 0x416: 0xe00d, 0x417: 0x0008,\n\t0x418: 0xe00d, 0x419: 0x0008, 0x41a: 0xe00d, 0x41b: 0x0008, 0x41c: 0xe00d, 0x41d: 0x0008,\n\t0x41e: 0xe00d, 0x41f: 0x0008, 0x420: 0xe00d, 0x421: 0x0008, 0x422: 0xe00d, 0x423: 0x0008,\n\t0x424: 0xe00d, 0x425: 0x0008, 0x426: 0xe00d, 0x427: 0x0008, 0x428: 0xe00d, 0x429: 0x0008,\n\t0x42a: 0xe00d, 0x42b: 0x0008, 0x42c: 0xe00d, 0x42d: 0x0008, 0x42e: 0xe00d, 0x42f: 0x0008,\n\t0x430: 0x0040, 0x431: 0x03f5, 0x432: 0x03f5, 0x433: 0x03f5, 0x434: 0x03f5, 0x435: 0x03f5,\n\t0x436: 0x03f5, 0x437: 0x03f5, 0x438: 0x03f5, 0x439: 0x03f5, 0x43a: 0x03f5, 0x43b: 0x03f5,\n\t0x43c: 0x03f5, 0x43d: 0x03f5, 0x43e: 0x03f5, 0x43f: 0x03f5,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x0840, 0x441: 0x0840, 0x442: 0x0840, 0x443: 0x0840, 0x444: 0x0840, 0x445: 0x0840,\n\t0x446: 0x0018, 0x447: 0x0018, 0x448: 0x0818, 0x449: 0x0018, 0x44a: 0x0018, 0x44b: 0x0818,\n\t0x44c: 0x0018, 0x44d: 0x0818, 0x44e: 0x0018, 0x44f: 0x0018, 0x450: 0x3308, 0x451: 0x3308,\n\t0x452: 0x3308, 0x453: 0x3308, 0x454: 0x3308, 0x455: 0x3308, 0x456: 0x3308, 0x457: 0x3308,\n\t0x458: 0x3308, 0x459: 0x3308, 0x45a: 0x3308, 0x45b: 0x0818, 0x45c: 0x0b40, 0x45d: 0x0040,\n\t0x45e: 0x0818, 0x45f: 0x0818, 0x460: 0x0a08, 0x461: 0x0808, 0x462: 0x0c08, 0x463: 0x0c08,\n\t0x464: 0x0c08, 0x465: 0x0c08, 0x466: 0x0a08, 0x467: 0x0c08, 0x468: 0x0a08, 0x469: 0x0c08,\n\t0x46a: 0x0a08, 0x46b: 0x0a08, 0x46c: 0x0a08, 0x46d: 0x0a08, 0x46e: 0x0a08, 0x46f: 0x0c08,\n\t0x470: 0x0c08, 0x471: 0x0c08, 0x472: 0x0c08, 0x473: 0x0a08, 0x474: 0x0a08, 0x475: 0x0a08,\n\t0x476: 0x0a08, 0x477: 0x0a08, 0x478: 0x0a08, 0x479: 0x0a08, 0x47a: 0x0a08, 0x47b: 0x0a08,\n\t0x47c: 0x0a08, 0x47d: 0x0a08, 0x47e: 0x0a08, 0x47f: 0x0a08,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x0818, 0x481: 0x0a08, 0x482: 0x0a08, 0x483: 0x0a08, 0x484: 0x0a08, 0x485: 0x0a08,\n\t0x486: 0x0a08, 0x487: 0x0a08, 0x488: 0x0c08, 0x489: 0x0a08, 0x48a: 0x0a08, 0x48b: 0x3308,\n\t0x48c: 0x3308, 0x48d: 0x3308, 0x48e: 0x3308, 0x48f: 0x3308, 0x490: 0x3308, 0x491: 0x3308,\n\t0x492: 0x3308, 0x493: 0x3308, 0x494: 0x3308, 0x495: 0x3308, 0x496: 0x3308, 0x497: 0x3308,\n\t0x498: 0x3308, 0x499: 0x3308, 0x49a: 0x3308, 0x49b: 0x3308, 0x49c: 0x3308, 0x49d: 0x3308,\n\t0x49e: 0x3308, 0x49f: 0x3308, 0x4a0: 0x0808, 0x4a1: 0x0808, 0x4a2: 0x0808, 0x4a3: 0x0808,\n\t0x4a4: 0x0808, 0x4a5: 0x0808, 0x4a6: 0x0808, 0x4a7: 0x0808, 0x4a8: 0x0808, 0x4a9: 0x0808,\n\t0x4aa: 0x0018, 0x4ab: 0x0818, 0x4ac: 0x0818, 0x4ad: 0x0818, 0x4ae: 0x0a08, 0x4af: 0x0a08,\n\t0x4b0: 0x3308, 0x4b1: 0x0c08, 0x4b2: 0x0c08, 0x4b3: 0x0c08, 0x4b4: 0x0808, 0x4b5: 0x0429,\n\t0x4b6: 0x0451, 0x4b7: 0x0479, 0x4b8: 0x04a1, 0x4b9: 0x0a08, 0x4ba: 0x0a08, 0x4bb: 0x0a08,\n\t0x4bc: 0x0a08, 0x4bd: 0x0a08, 0x4be: 0x0a08, 0x4bf: 0x0a08,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0x0c08, 0x4c1: 0x0a08, 0x4c2: 0x0a08, 0x4c3: 0x0c08, 0x4c4: 0x0c08, 0x4c5: 0x0c08,\n\t0x4c6: 0x0c08, 0x4c7: 0x0c08, 0x4c8: 0x0c08, 0x4c9: 0x0c08, 0x4ca: 0x0c08, 0x4cb: 0x0c08,\n\t0x4cc: 0x0a08, 0x4cd: 0x0c08, 0x4ce: 0x0a08, 0x4cf: 0x0c08, 0x4d0: 0x0a08, 0x4d1: 0x0a08,\n\t0x4d2: 0x0c08, 0x4d3: 0x0c08, 0x4d4: 0x0818, 0x4d5: 0x0c08, 0x4d6: 0x3308, 0x4d7: 0x3308,\n\t0x4d8: 0x3308, 0x4d9: 0x3308, 0x4da: 0x3308, 0x4db: 0x3308, 0x4dc: 0x3308, 0x4dd: 0x0840,\n\t0x4de: 0x0018, 0x4df: 0x3308, 0x4e0: 0x3308, 0x4e1: 0x3308, 0x4e2: 0x3308, 0x4e3: 0x3308,\n\t0x4e4: 0x3308, 0x4e5: 0x0808, 0x4e6: 0x0808, 0x4e7: 0x3308, 0x4e8: 0x3308, 0x4e9: 0x0018,\n\t0x4ea: 0x3308, 0x4eb: 0x3308, 0x4ec: 0x3308, 0x4ed: 0x3308, 0x4ee: 0x0c08, 0x4ef: 0x0c08,\n\t0x4f0: 0x0008, 0x4f1: 0x0008, 0x4f2: 0x0008, 0x4f3: 0x0008, 0x4f4: 0x0008, 0x4f5: 0x0008,\n\t0x4f6: 0x0008, 0x4f7: 0x0008, 0x4f8: 0x0008, 0x4f9: 0x0008, 0x4fa: 0x0a08, 0x4fb: 0x0a08,\n\t0x4fc: 0x0a08, 0x4fd: 0x0808, 0x4fe: 0x0808, 0x4ff: 0x0a08,\n\t// Block 0x14, offset 0x500\n\t0x500: 0x0818, 0x501: 0x0818, 0x502: 0x0818, 0x503: 0x0818, 0x504: 0x0818, 0x505: 0x0818,\n\t0x506: 0x0818, 0x507: 0x0818, 0x508: 0x0818, 0x509: 0x0818, 0x50a: 0x0818, 0x50b: 0x0818,\n\t0x50c: 0x0818, 0x50d: 0x0818, 0x50e: 0x0040, 0x50f: 0x0b40, 0x510: 0x0c08, 0x511: 0x3308,\n\t0x512: 0x0a08, 0x513: 0x0a08, 0x514: 0x0a08, 0x515: 0x0c08, 0x516: 0x0c08, 0x517: 0x0c08,\n\t0x518: 0x0c08, 0x519: 0x0c08, 0x51a: 0x0a08, 0x51b: 0x0a08, 0x51c: 0x0a08, 0x51d: 0x0a08,\n\t0x51e: 0x0c08, 0x51f: 0x0a08, 0x520: 0x0a08, 0x521: 0x0a08, 0x522: 0x0a08, 0x523: 0x0a08,\n\t0x524: 0x0a08, 0x525: 0x0a08, 0x526: 0x0a08, 0x527: 0x0a08, 0x528: 0x0c08, 0x529: 0x0a08,\n\t0x52a: 0x0c08, 0x52b: 0x0a08, 0x52c: 0x0c08, 0x52d: 0x0a08, 0x52e: 0x0a08, 0x52f: 0x0c08,\n\t0x530: 0x3308, 0x531: 0x3308, 0x532: 0x3308, 0x533: 0x3308, 0x534: 0x3308, 0x535: 0x3308,\n\t0x536: 0x3308, 0x537: 0x3308, 0x538: 0x3308, 0x539: 0x3308, 0x53a: 0x3308, 0x53b: 0x3308,\n\t0x53c: 0x3308, 0x53d: 0x3308, 0x53e: 0x3308, 0x53f: 0x3308,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x0c08, 0x541: 0x0a08, 0x542: 0x0a08, 0x543: 0x0a08, 0x544: 0x0a08, 0x545: 0x0a08,\n\t0x546: 0x0c08, 0x547: 0x0c08, 0x548: 0x0a08, 0x549: 0x0c08, 0x54a: 0x0a08, 0x54b: 0x0a08,\n\t0x54c: 0x0a08, 0x54d: 0x0a08, 0x54e: 0x0a08, 0x54f: 0x0a08, 0x550: 0x0a08, 0x551: 0x0a08,\n\t0x552: 0x0a08, 0x553: 0x0a08, 0x554: 0x0c08, 0x555: 0x0a08, 0x556: 0x0808, 0x557: 0x0808,\n\t0x558: 0x0808, 0x559: 0x3308, 0x55a: 0x3308, 0x55b: 0x3308, 0x55c: 0x0040, 0x55d: 0x0040,\n\t0x55e: 0x0818, 0x55f: 0x0040, 0x560: 0x0a08, 0x561: 0x0808, 0x562: 0x0a08, 0x563: 0x0a08,\n\t0x564: 0x0a08, 0x565: 0x0a08, 0x566: 0x0808, 0x567: 0x0c08, 0x568: 0x0a08, 0x569: 0x0c08,\n\t0x56a: 0x0c08, 0x56b: 0x0040, 0x56c: 0x0040, 0x56d: 0x0040, 0x56e: 0x0040, 0x56f: 0x0040,\n\t0x570: 0x0040, 0x571: 0x0040, 0x572: 0x0040, 0x573: 0x0040, 0x574: 0x0040, 0x575: 0x0040,\n\t0x576: 0x0040, 0x577: 0x0040, 0x578: 0x0040, 0x579: 0x0040, 0x57a: 0x0040, 0x57b: 0x0040,\n\t0x57c: 0x0040, 0x57d: 0x0040, 0x57e: 0x0040, 0x57f: 0x0040,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x3008, 0x581: 0x3308, 0x582: 0x3308, 0x583: 0x3308, 0x584: 0x3308, 0x585: 0x3308,\n\t0x586: 0x3308, 0x587: 0x3308, 0x588: 0x3308, 0x589: 0x3008, 0x58a: 0x3008, 0x58b: 0x3008,\n\t0x58c: 0x3008, 0x58d: 0x3b08, 0x58e: 0x3008, 0x58f: 0x3008, 0x590: 0x0008, 0x591: 0x3308,\n\t0x592: 0x3308, 0x593: 0x3308, 0x594: 0x3308, 0x595: 0x3308, 0x596: 0x3308, 0x597: 0x3308,\n\t0x598: 0x04c9, 0x599: 0x0501, 0x59a: 0x0539, 0x59b: 0x0571, 0x59c: 0x05a9, 0x59d: 0x05e1,\n\t0x59e: 0x0619, 0x59f: 0x0651, 0x5a0: 0x0008, 0x5a1: 0x0008, 0x5a2: 0x3308, 0x5a3: 0x3308,\n\t0x5a4: 0x0018, 0x5a5: 0x0018, 0x5a6: 0x0008, 0x5a7: 0x0008, 0x5a8: 0x0008, 0x5a9: 0x0008,\n\t0x5aa: 0x0008, 0x5ab: 0x0008, 0x5ac: 0x0008, 0x5ad: 0x0008, 0x5ae: 0x0008, 0x5af: 0x0008,\n\t0x5b0: 0x0018, 0x5b1: 0x0008, 0x5b2: 0x0008, 0x5b3: 0x0008, 0x5b4: 0x0008, 0x5b5: 0x0008,\n\t0x5b6: 0x0008, 0x5b7: 0x0008, 0x5b8: 0x0008, 0x5b9: 0x0008, 0x5ba: 0x0008, 0x5bb: 0x0008,\n\t0x5bc: 0x0008, 0x5bd: 0x0008, 0x5be: 0x0008, 0x5bf: 0x0008,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x0008, 0x5c1: 0x3308, 0x5c2: 0x3008, 0x5c3: 0x3008, 0x5c4: 0x0040, 0x5c5: 0x0008,\n\t0x5c6: 0x0008, 0x5c7: 0x0008, 0x5c8: 0x0008, 0x5c9: 0x0008, 0x5ca: 0x0008, 0x5cb: 0x0008,\n\t0x5cc: 0x0008, 0x5cd: 0x0040, 0x5ce: 0x0040, 0x5cf: 0x0008, 0x5d0: 0x0008, 0x5d1: 0x0040,\n\t0x5d2: 0x0040, 0x5d3: 0x0008, 0x5d4: 0x0008, 0x5d5: 0x0008, 0x5d6: 0x0008, 0x5d7: 0x0008,\n\t0x5d8: 0x0008, 0x5d9: 0x0008, 0x5da: 0x0008, 0x5db: 0x0008, 0x5dc: 0x0008, 0x5dd: 0x0008,\n\t0x5de: 0x0008, 0x5df: 0x0008, 0x5e0: 0x0008, 0x5e1: 0x0008, 0x5e2: 0x0008, 0x5e3: 0x0008,\n\t0x5e4: 0x0008, 0x5e5: 0x0008, 0x5e6: 0x0008, 0x5e7: 0x0008, 0x5e8: 0x0008, 0x5e9: 0x0040,\n\t0x5ea: 0x0008, 0x5eb: 0x0008, 0x5ec: 0x0008, 0x5ed: 0x0008, 0x5ee: 0x0008, 0x5ef: 0x0008,\n\t0x5f0: 0x0008, 0x5f1: 0x0040, 0x5f2: 0x0008, 0x5f3: 0x0040, 0x5f4: 0x0040, 0x5f5: 0x0040,\n\t0x5f6: 0x0008, 0x5f7: 0x0008, 0x5f8: 0x0008, 0x5f9: 0x0008, 0x5fa: 0x0040, 0x5fb: 0x0040,\n\t0x5fc: 0x3308, 0x5fd: 0x0008, 0x5fe: 0x3008, 0x5ff: 0x3008,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x3008, 0x601: 0x3308, 0x602: 0x3308, 0x603: 0x3308, 0x604: 0x3308, 0x605: 0x0040,\n\t0x606: 0x0040, 0x607: 0x3008, 0x608: 0x3008, 0x609: 0x0040, 0x60a: 0x0040, 0x60b: 0x3008,\n\t0x60c: 0x3008, 0x60d: 0x3b08, 0x60e: 0x0008, 0x60f: 0x0040, 0x610: 0x0040, 0x611: 0x0040,\n\t0x612: 0x0040, 0x613: 0x0040, 0x614: 0x0040, 0x615: 0x0040, 0x616: 0x0040, 0x617: 0x3008,\n\t0x618: 0x0040, 0x619: 0x0040, 0x61a: 0x0040, 0x61b: 0x0040, 0x61c: 0x0689, 0x61d: 0x06c1,\n\t0x61e: 0x0040, 0x61f: 0x06f9, 0x620: 0x0008, 0x621: 0x0008, 0x622: 0x3308, 0x623: 0x3308,\n\t0x624: 0x0040, 0x625: 0x0040, 0x626: 0x0008, 0x627: 0x0008, 0x628: 0x0008, 0x629: 0x0008,\n\t0x62a: 0x0008, 0x62b: 0x0008, 0x62c: 0x0008, 0x62d: 0x0008, 0x62e: 0x0008, 0x62f: 0x0008,\n\t0x630: 0x0008, 0x631: 0x0008, 0x632: 0x0018, 0x633: 0x0018, 0x634: 0x0018, 0x635: 0x0018,\n\t0x636: 0x0018, 0x637: 0x0018, 0x638: 0x0018, 0x639: 0x0018, 0x63a: 0x0018, 0x63b: 0x0018,\n\t0x63c: 0x0008, 0x63d: 0x0018, 0x63e: 0x3308, 0x63f: 0x0040,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x0040, 0x641: 0x3308, 0x642: 0x3308, 0x643: 0x3008, 0x644: 0x0040, 0x645: 0x0008,\n\t0x646: 0x0008, 0x647: 0x0008, 0x648: 0x0008, 0x649: 0x0008, 0x64a: 0x0008, 0x64b: 0x0040,\n\t0x64c: 0x0040, 0x64d: 0x0040, 0x64e: 0x0040, 0x64f: 0x0008, 0x650: 0x0008, 0x651: 0x0040,\n\t0x652: 0x0040, 0x653: 0x0008, 0x654: 0x0008, 0x655: 0x0008, 0x656: 0x0008, 0x657: 0x0008,\n\t0x658: 0x0008, 0x659: 0x0008, 0x65a: 0x0008, 0x65b: 0x0008, 0x65c: 0x0008, 0x65d: 0x0008,\n\t0x65e: 0x0008, 0x65f: 0x0008, 0x660: 0x0008, 0x661: 0x0008, 0x662: 0x0008, 0x663: 0x0008,\n\t0x664: 0x0008, 0x665: 0x0008, 0x666: 0x0008, 0x667: 0x0008, 0x668: 0x0008, 0x669: 0x0040,\n\t0x66a: 0x0008, 0x66b: 0x0008, 0x66c: 0x0008, 0x66d: 0x0008, 0x66e: 0x0008, 0x66f: 0x0008,\n\t0x670: 0x0008, 0x671: 0x0040, 0x672: 0x0008, 0x673: 0x0731, 0x674: 0x0040, 0x675: 0x0008,\n\t0x676: 0x0769, 0x677: 0x0040, 0x678: 0x0008, 0x679: 0x0008, 0x67a: 0x0040, 0x67b: 0x0040,\n\t0x67c: 0x3308, 0x67d: 0x0040, 0x67e: 0x3008, 0x67f: 0x3008,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x3008, 0x681: 0x3308, 0x682: 0x3308, 0x683: 0x0040, 0x684: 0x0040, 0x685: 0x0040,\n\t0x686: 0x0040, 0x687: 0x3308, 0x688: 0x3308, 0x689: 0x0040, 0x68a: 0x0040, 0x68b: 0x3308,\n\t0x68c: 0x3308, 0x68d: 0x3b08, 0x68e: 0x0040, 0x68f: 0x0040, 0x690: 0x0040, 0x691: 0x3308,\n\t0x692: 0x0040, 0x693: 0x0040, 0x694: 0x0040, 0x695: 0x0040, 0x696: 0x0040, 0x697: 0x0040,\n\t0x698: 0x0040, 0x699: 0x07a1, 0x69a: 0x07d9, 0x69b: 0x0811, 0x69c: 0x0008, 0x69d: 0x0040,\n\t0x69e: 0x0849, 0x69f: 0x0040, 0x6a0: 0x0040, 0x6a1: 0x0040, 0x6a2: 0x0040, 0x6a3: 0x0040,\n\t0x6a4: 0x0040, 0x6a5: 0x0040, 0x6a6: 0x0008, 0x6a7: 0x0008, 0x6a8: 0x0008, 0x6a9: 0x0008,\n\t0x6aa: 0x0008, 0x6ab: 0x0008, 0x6ac: 0x0008, 0x6ad: 0x0008, 0x6ae: 0x0008, 0x6af: 0x0008,\n\t0x6b0: 0x3308, 0x6b1: 0x3308, 0x6b2: 0x0008, 0x6b3: 0x0008, 0x6b4: 0x0008, 0x6b5: 0x3308,\n\t0x6b6: 0x0018, 0x6b7: 0x0040, 0x6b8: 0x0040, 0x6b9: 0x0040, 0x6ba: 0x0040, 0x6bb: 0x0040,\n\t0x6bc: 0x0040, 0x6bd: 0x0040, 0x6be: 0x0040, 0x6bf: 0x0040,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x0040, 0x6c1: 0x3308, 0x6c2: 0x3308, 0x6c3: 0x3008, 0x6c4: 0x0040, 0x6c5: 0x0008,\n\t0x6c6: 0x0008, 0x6c7: 0x0008, 0x6c8: 0x0008, 0x6c9: 0x0008, 0x6ca: 0x0008, 0x6cb: 0x0008,\n\t0x6cc: 0x0008, 0x6cd: 0x0008, 0x6ce: 0x0040, 0x6cf: 0x0008, 0x6d0: 0x0008, 0x6d1: 0x0008,\n\t0x6d2: 0x0040, 0x6d3: 0x0008, 0x6d4: 0x0008, 0x6d5: 0x0008, 0x6d6: 0x0008, 0x6d7: 0x0008,\n\t0x6d8: 0x0008, 0x6d9: 0x0008, 0x6da: 0x0008, 0x6db: 0x0008, 0x6dc: 0x0008, 0x6dd: 0x0008,\n\t0x6de: 0x0008, 0x6df: 0x0008, 0x6e0: 0x0008, 0x6e1: 0x0008, 0x6e2: 0x0008, 0x6e3: 0x0008,\n\t0x6e4: 0x0008, 0x6e5: 0x0008, 0x6e6: 0x0008, 0x6e7: 0x0008, 0x6e8: 0x0008, 0x6e9: 0x0040,\n\t0x6ea: 0x0008, 0x6eb: 0x0008, 0x6ec: 0x0008, 0x6ed: 0x0008, 0x6ee: 0x0008, 0x6ef: 0x0008,\n\t0x6f0: 0x0008, 0x6f1: 0x0040, 0x6f2: 0x0008, 0x6f3: 0x0008, 0x6f4: 0x0040, 0x6f5: 0x0008,\n\t0x6f6: 0x0008, 0x6f7: 0x0008, 0x6f8: 0x0008, 0x6f9: 0x0008, 0x6fa: 0x0040, 0x6fb: 0x0040,\n\t0x6fc: 0x3308, 0x6fd: 0x0008, 0x6fe: 0x3008, 0x6ff: 0x3008,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x3008, 0x701: 0x3308, 0x702: 0x3308, 0x703: 0x3308, 0x704: 0x3308, 0x705: 0x3308,\n\t0x706: 0x0040, 0x707: 0x3308, 0x708: 0x3308, 0x709: 0x3008, 0x70a: 0x0040, 0x70b: 0x3008,\n\t0x70c: 0x3008, 0x70d: 0x3b08, 0x70e: 0x0040, 0x70f: 0x0040, 0x710: 0x0008, 0x711: 0x0040,\n\t0x712: 0x0040, 0x713: 0x0040, 0x714: 0x0040, 0x715: 0x0040, 0x716: 0x0040, 0x717: 0x0040,\n\t0x718: 0x0040, 0x719: 0x0040, 0x71a: 0x0040, 0x71b: 0x0040, 0x71c: 0x0040, 0x71d: 0x0040,\n\t0x71e: 0x0040, 0x71f: 0x0040, 0x720: 0x0008, 0x721: 0x0008, 0x722: 0x3308, 0x723: 0x3308,\n\t0x724: 0x0040, 0x725: 0x0040, 0x726: 0x0008, 0x727: 0x0008, 0x728: 0x0008, 0x729: 0x0008,\n\t0x72a: 0x0008, 0x72b: 0x0008, 0x72c: 0x0008, 0x72d: 0x0008, 0x72e: 0x0008, 0x72f: 0x0008,\n\t0x730: 0x0018, 0x731: 0x0018, 0x732: 0x0040, 0x733: 0x0040, 0x734: 0x0040, 0x735: 0x0040,\n\t0x736: 0x0040, 0x737: 0x0040, 0x738: 0x0040, 0x739: 0x0008, 0x73a: 0x3308, 0x73b: 0x3308,\n\t0x73c: 0x3308, 0x73d: 0x3308, 0x73e: 0x3308, 0x73f: 0x3308,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0x0040, 0x741: 0x3308, 0x742: 0x3008, 0x743: 0x3008, 0x744: 0x0040, 0x745: 0x0008,\n\t0x746: 0x0008, 0x747: 0x0008, 0x748: 0x0008, 0x749: 0x0008, 0x74a: 0x0008, 0x74b: 0x0008,\n\t0x74c: 0x0008, 0x74d: 0x0040, 0x74e: 0x0040, 0x74f: 0x0008, 0x750: 0x0008, 0x751: 0x0040,\n\t0x752: 0x0040, 0x753: 0x0008, 0x754: 0x0008, 0x755: 0x0008, 0x756: 0x0008, 0x757: 0x0008,\n\t0x758: 0x0008, 0x759: 0x0008, 0x75a: 0x0008, 0x75b: 0x0008, 0x75c: 0x0008, 0x75d: 0x0008,\n\t0x75e: 0x0008, 0x75f: 0x0008, 0x760: 0x0008, 0x761: 0x0008, 0x762: 0x0008, 0x763: 0x0008,\n\t0x764: 0x0008, 0x765: 0x0008, 0x766: 0x0008, 0x767: 0x0008, 0x768: 0x0008, 0x769: 0x0040,\n\t0x76a: 0x0008, 0x76b: 0x0008, 0x76c: 0x0008, 0x76d: 0x0008, 0x76e: 0x0008, 0x76f: 0x0008,\n\t0x770: 0x0008, 0x771: 0x0040, 0x772: 0x0008, 0x773: 0x0008, 0x774: 0x0040, 0x775: 0x0008,\n\t0x776: 0x0008, 0x777: 0x0008, 0x778: 0x0008, 0x779: 0x0008, 0x77a: 0x0040, 0x77b: 0x0040,\n\t0x77c: 0x3308, 0x77d: 0x0008, 0x77e: 0x3008, 0x77f: 0x3308,\n\t// Block 0x1e, offset 0x780\n\t0x780: 0x3008, 0x781: 0x3308, 0x782: 0x3308, 0x783: 0x3308, 0x784: 0x3308, 0x785: 0x0040,\n\t0x786: 0x0040, 0x787: 0x3008, 0x788: 0x3008, 0x789: 0x0040, 0x78a: 0x0040, 0x78b: 0x3008,\n\t0x78c: 0x3008, 0x78d: 0x3b08, 0x78e: 0x0040, 0x78f: 0x0040, 0x790: 0x0040, 0x791: 0x0040,\n\t0x792: 0x0040, 0x793: 0x0040, 0x794: 0x0040, 0x795: 0x0040, 0x796: 0x3308, 0x797: 0x3008,\n\t0x798: 0x0040, 0x799: 0x0040, 0x79a: 0x0040, 0x79b: 0x0040, 0x79c: 0x0881, 0x79d: 0x08b9,\n\t0x79e: 0x0040, 0x79f: 0x0008, 0x7a0: 0x0008, 0x7a1: 0x0008, 0x7a2: 0x3308, 0x7a3: 0x3308,\n\t0x7a4: 0x0040, 0x7a5: 0x0040, 0x7a6: 0x0008, 0x7a7: 0x0008, 0x7a8: 0x0008, 0x7a9: 0x0008,\n\t0x7aa: 0x0008, 0x7ab: 0x0008, 0x7ac: 0x0008, 0x7ad: 0x0008, 0x7ae: 0x0008, 0x7af: 0x0008,\n\t0x7b0: 0x0018, 0x7b1: 0x0008, 0x7b2: 0x0018, 0x7b3: 0x0018, 0x7b4: 0x0018, 0x7b5: 0x0018,\n\t0x7b6: 0x0018, 0x7b7: 0x0018, 0x7b8: 0x0040, 0x7b9: 0x0040, 0x7ba: 0x0040, 0x7bb: 0x0040,\n\t0x7bc: 0x0040, 0x7bd: 0x0040, 0x7be: 0x0040, 0x7bf: 0x0040,\n\t// Block 0x1f, offset 0x7c0\n\t0x7c0: 0x0040, 0x7c1: 0x0040, 0x7c2: 0x3308, 0x7c3: 0x0008, 0x7c4: 0x0040, 0x7c5: 0x0008,\n\t0x7c6: 0x0008, 0x7c7: 0x0008, 0x7c8: 0x0008, 0x7c9: 0x0008, 0x7ca: 0x0008, 0x7cb: 0x0040,\n\t0x7cc: 0x0040, 0x7cd: 0x0040, 0x7ce: 0x0008, 0x7cf: 0x0008, 0x7d0: 0x0008, 0x7d1: 0x0040,\n\t0x7d2: 0x0008, 0x7d3: 0x0008, 0x7d4: 0x0008, 0x7d5: 0x0008, 0x7d6: 0x0040, 0x7d7: 0x0040,\n\t0x7d8: 0x0040, 0x7d9: 0x0008, 0x7da: 0x0008, 0x7db: 0x0040, 0x7dc: 0x0008, 0x7dd: 0x0040,\n\t0x7de: 0x0008, 0x7df: 0x0008, 0x7e0: 0x0040, 0x7e1: 0x0040, 0x7e2: 0x0040, 0x7e3: 0x0008,\n\t0x7e4: 0x0008, 0x7e5: 0x0040, 0x7e6: 0x0040, 0x7e7: 0x0040, 0x7e8: 0x0008, 0x7e9: 0x0008,\n\t0x7ea: 0x0008, 0x7eb: 0x0040, 0x7ec: 0x0040, 0x7ed: 0x0040, 0x7ee: 0x0008, 0x7ef: 0x0008,\n\t0x7f0: 0x0008, 0x7f1: 0x0008, 0x7f2: 0x0008, 0x7f3: 0x0008, 0x7f4: 0x0008, 0x7f5: 0x0008,\n\t0x7f6: 0x0008, 0x7f7: 0x0008, 0x7f8: 0x0008, 0x7f9: 0x0008, 0x7fa: 0x0040, 0x7fb: 0x0040,\n\t0x7fc: 0x0040, 0x7fd: 0x0040, 0x7fe: 0x3008, 0x7ff: 0x3008,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x3308, 0x801: 0x3008, 0x802: 0x3008, 0x803: 0x3008, 0x804: 0x3008, 0x805: 0x0040,\n\t0x806: 0x3308, 0x807: 0x3308, 0x808: 0x3308, 0x809: 0x0040, 0x80a: 0x3308, 0x80b: 0x3308,\n\t0x80c: 0x3308, 0x80d: 0x3b08, 0x80e: 0x0040, 0x80f: 0x0040, 0x810: 0x0040, 0x811: 0x0040,\n\t0x812: 0x0040, 0x813: 0x0040, 0x814: 0x0040, 0x815: 0x3308, 0x816: 0x3308, 0x817: 0x0040,\n\t0x818: 0x0008, 0x819: 0x0008, 0x81a: 0x0008, 0x81b: 0x0040, 0x81c: 0x0040, 0x81d: 0x0040,\n\t0x81e: 0x0040, 0x81f: 0x0040, 0x820: 0x0008, 0x821: 0x0008, 0x822: 0x3308, 0x823: 0x3308,\n\t0x824: 0x0040, 0x825: 0x0040, 0x826: 0x0008, 0x827: 0x0008, 0x828: 0x0008, 0x829: 0x0008,\n\t0x82a: 0x0008, 0x82b: 0x0008, 0x82c: 0x0008, 0x82d: 0x0008, 0x82e: 0x0008, 0x82f: 0x0008,\n\t0x830: 0x0040, 0x831: 0x0040, 0x832: 0x0040, 0x833: 0x0040, 0x834: 0x0040, 0x835: 0x0040,\n\t0x836: 0x0040, 0x837: 0x0040, 0x838: 0x0018, 0x839: 0x0018, 0x83a: 0x0018, 0x83b: 0x0018,\n\t0x83c: 0x0018, 0x83d: 0x0018, 0x83e: 0x0018, 0x83f: 0x0018,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x0008, 0x841: 0x3308, 0x842: 0x3008, 0x843: 0x3008, 0x844: 0x0018, 0x845: 0x0008,\n\t0x846: 0x0008, 0x847: 0x0008, 0x848: 0x0008, 0x849: 0x0008, 0x84a: 0x0008, 0x84b: 0x0008,\n\t0x84c: 0x0008, 0x84d: 0x0040, 0x84e: 0x0008, 0x84f: 0x0008, 0x850: 0x0008, 0x851: 0x0040,\n\t0x852: 0x0008, 0x853: 0x0008, 0x854: 0x0008, 0x855: 0x0008, 0x856: 0x0008, 0x857: 0x0008,\n\t0x858: 0x0008, 0x859: 0x0008, 0x85a: 0x0008, 0x85b: 0x0008, 0x85c: 0x0008, 0x85d: 0x0008,\n\t0x85e: 0x0008, 0x85f: 0x0008, 0x860: 0x0008, 0x861: 0x0008, 0x862: 0x0008, 0x863: 0x0008,\n\t0x864: 0x0008, 0x865: 0x0008, 0x866: 0x0008, 0x867: 0x0008, 0x868: 0x0008, 0x869: 0x0040,\n\t0x86a: 0x0008, 0x86b: 0x0008, 0x86c: 0x0008, 0x86d: 0x0008, 0x86e: 0x0008, 0x86f: 0x0008,\n\t0x870: 0x0008, 0x871: 0x0008, 0x872: 0x0008, 0x873: 0x0008, 0x874: 0x0040, 0x875: 0x0008,\n\t0x876: 0x0008, 0x877: 0x0008, 0x878: 0x0008, 0x879: 0x0008, 0x87a: 0x0040, 0x87b: 0x0040,\n\t0x87c: 0x3308, 0x87d: 0x0008, 0x87e: 0x3008, 0x87f: 0x3308,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x3008, 0x881: 0x3008, 0x882: 0x3008, 0x883: 0x3008, 0x884: 0x3008, 0x885: 0x0040,\n\t0x886: 0x3308, 0x887: 0x3008, 0x888: 0x3008, 0x889: 0x0040, 0x88a: 0x3008, 0x88b: 0x3008,\n\t0x88c: 0x3308, 0x88d: 0x3b08, 0x88e: 0x0040, 0x88f: 0x0040, 0x890: 0x0040, 0x891: 0x0040,\n\t0x892: 0x0040, 0x893: 0x0040, 0x894: 0x0040, 0x895: 0x3008, 0x896: 0x3008, 0x897: 0x0040,\n\t0x898: 0x0040, 0x899: 0x0040, 0x89a: 0x0040, 0x89b: 0x0040, 0x89c: 0x0040, 0x89d: 0x0040,\n\t0x89e: 0x0008, 0x89f: 0x0040, 0x8a0: 0x0008, 0x8a1: 0x0008, 0x8a2: 0x3308, 0x8a3: 0x3308,\n\t0x8a4: 0x0040, 0x8a5: 0x0040, 0x8a6: 0x0008, 0x8a7: 0x0008, 0x8a8: 0x0008, 0x8a9: 0x0008,\n\t0x8aa: 0x0008, 0x8ab: 0x0008, 0x8ac: 0x0008, 0x8ad: 0x0008, 0x8ae: 0x0008, 0x8af: 0x0008,\n\t0x8b0: 0x0040, 0x8b1: 0x0008, 0x8b2: 0x0008, 0x8b3: 0x0040, 0x8b4: 0x0040, 0x8b5: 0x0040,\n\t0x8b6: 0x0040, 0x8b7: 0x0040, 0x8b8: 0x0040, 0x8b9: 0x0040, 0x8ba: 0x0040, 0x8bb: 0x0040,\n\t0x8bc: 0x0040, 0x8bd: 0x0040, 0x8be: 0x0040, 0x8bf: 0x0040,\n\t// Block 0x23, offset 0x8c0\n\t0x8c0: 0x3008, 0x8c1: 0x3308, 0x8c2: 0x3308, 0x8c3: 0x3308, 0x8c4: 0x3308, 0x8c5: 0x0040,\n\t0x8c6: 0x3008, 0x8c7: 0x3008, 0x8c8: 0x3008, 0x8c9: 0x0040, 0x8ca: 0x3008, 0x8cb: 0x3008,\n\t0x8cc: 0x3008, 0x8cd: 0x3b08, 0x8ce: 0x0008, 0x8cf: 0x0018, 0x8d0: 0x0040, 0x8d1: 0x0040,\n\t0x8d2: 0x0040, 0x8d3: 0x0040, 0x8d4: 0x0008, 0x8d5: 0x0008, 0x8d6: 0x0008, 0x8d7: 0x3008,\n\t0x8d8: 0x0018, 0x8d9: 0x0018, 0x8da: 0x0018, 0x8db: 0x0018, 0x8dc: 0x0018, 0x8dd: 0x0018,\n\t0x8de: 0x0018, 0x8df: 0x0008, 0x8e0: 0x0008, 0x8e1: 0x0008, 0x8e2: 0x3308, 0x8e3: 0x3308,\n\t0x8e4: 0x0040, 0x8e5: 0x0040, 0x8e6: 0x0008, 0x8e7: 0x0008, 0x8e8: 0x0008, 0x8e9: 0x0008,\n\t0x8ea: 0x0008, 0x8eb: 0x0008, 0x8ec: 0x0008, 0x8ed: 0x0008, 0x8ee: 0x0008, 0x8ef: 0x0008,\n\t0x8f0: 0x0018, 0x8f1: 0x0018, 0x8f2: 0x0018, 0x8f3: 0x0018, 0x8f4: 0x0018, 0x8f5: 0x0018,\n\t0x8f6: 0x0018, 0x8f7: 0x0018, 0x8f8: 0x0018, 0x8f9: 0x0018, 0x8fa: 0x0008, 0x8fb: 0x0008,\n\t0x8fc: 0x0008, 0x8fd: 0x0008, 0x8fe: 0x0008, 0x8ff: 0x0008,\n\t// Block 0x24, offset 0x900\n\t0x900: 0x0040, 0x901: 0x0008, 0x902: 0x0008, 0x903: 0x0040, 0x904: 0x0008, 0x905: 0x0040,\n\t0x906: 0x0040, 0x907: 0x0008, 0x908: 0x0008, 0x909: 0x0040, 0x90a: 0x0008, 0x90b: 0x0040,\n\t0x90c: 0x0040, 0x90d: 0x0008, 0x90e: 0x0040, 0x90f: 0x0040, 0x910: 0x0040, 0x911: 0x0040,\n\t0x912: 0x0040, 0x913: 0x0040, 0x914: 0x0008, 0x915: 0x0008, 0x916: 0x0008, 0x917: 0x0008,\n\t0x918: 0x0040, 0x919: 0x0008, 0x91a: 0x0008, 0x91b: 0x0008, 0x91c: 0x0008, 0x91d: 0x0008,\n\t0x91e: 0x0008, 0x91f: 0x0008, 0x920: 0x0040, 0x921: 0x0008, 0x922: 0x0008, 0x923: 0x0008,\n\t0x924: 0x0040, 0x925: 0x0008, 0x926: 0x0040, 0x927: 0x0008, 0x928: 0x0040, 0x929: 0x0040,\n\t0x92a: 0x0008, 0x92b: 0x0008, 0x92c: 0x0040, 0x92d: 0x0008, 0x92e: 0x0008, 0x92f: 0x0008,\n\t0x930: 0x0008, 0x931: 0x3308, 0x932: 0x0008, 0x933: 0x0929, 0x934: 0x3308, 0x935: 0x3308,\n\t0x936: 0x3308, 0x937: 0x3308, 0x938: 0x3308, 0x939: 0x3308, 0x93a: 0x0040, 0x93b: 0x3308,\n\t0x93c: 0x3308, 0x93d: 0x0008, 0x93e: 0x0040, 0x93f: 0x0040,\n\t// Block 0x25, offset 0x940\n\t0x940: 0x0008, 0x941: 0x0008, 0x942: 0x0008, 0x943: 0x09d1, 0x944: 0x0008, 0x945: 0x0008,\n\t0x946: 0x0008, 0x947: 0x0008, 0x948: 0x0040, 0x949: 0x0008, 0x94a: 0x0008, 0x94b: 0x0008,\n\t0x94c: 0x0008, 0x94d: 0x0a09, 0x94e: 0x0008, 0x94f: 0x0008, 0x950: 0x0008, 0x951: 0x0008,\n\t0x952: 0x0a41, 0x953: 0x0008, 0x954: 0x0008, 0x955: 0x0008, 0x956: 0x0008, 0x957: 0x0a79,\n\t0x958: 0x0008, 0x959: 0x0008, 0x95a: 0x0008, 0x95b: 0x0008, 0x95c: 0x0ab1, 0x95d: 0x0008,\n\t0x95e: 0x0008, 0x95f: 0x0008, 0x960: 0x0008, 0x961: 0x0008, 0x962: 0x0008, 0x963: 0x0008,\n\t0x964: 0x0008, 0x965: 0x0008, 0x966: 0x0008, 0x967: 0x0008, 0x968: 0x0008, 0x969: 0x0ae9,\n\t0x96a: 0x0008, 0x96b: 0x0008, 0x96c: 0x0008, 0x96d: 0x0040, 0x96e: 0x0040, 0x96f: 0x0040,\n\t0x970: 0x0040, 0x971: 0x3308, 0x972: 0x3308, 0x973: 0x0b21, 0x974: 0x3308, 0x975: 0x0b59,\n\t0x976: 0x0b91, 0x977: 0x0bc9, 0x978: 0x0c19, 0x979: 0x0c51, 0x97a: 0x3308, 0x97b: 0x3308,\n\t0x97c: 0x3308, 0x97d: 0x3308, 0x97e: 0x3308, 0x97f: 0x3008,\n\t// Block 0x26, offset 0x980\n\t0x980: 0x3308, 0x981: 0x0ca1, 0x982: 0x3308, 0x983: 0x3308, 0x984: 0x3b08, 0x985: 0x0018,\n\t0x986: 0x3308, 0x987: 0x3308, 0x988: 0x0008, 0x989: 0x0008, 0x98a: 0x0008, 0x98b: 0x0008,\n\t0x98c: 0x0008, 0x98d: 0x3308, 0x98e: 0x3308, 0x98f: 0x3308, 0x990: 0x3308, 0x991: 0x3308,\n\t0x992: 0x3308, 0x993: 0x0cd9, 0x994: 0x3308, 0x995: 0x3308, 0x996: 0x3308, 0x997: 0x3308,\n\t0x998: 0x0040, 0x999: 0x3308, 0x99a: 0x3308, 0x99b: 0x3308, 0x99c: 0x3308, 0x99d: 0x0d11,\n\t0x99e: 0x3308, 0x99f: 0x3308, 0x9a0: 0x3308, 0x9a1: 0x3308, 0x9a2: 0x0d49, 0x9a3: 0x3308,\n\t0x9a4: 0x3308, 0x9a5: 0x3308, 0x9a6: 0x3308, 0x9a7: 0x0d81, 0x9a8: 0x3308, 0x9a9: 0x3308,\n\t0x9aa: 0x3308, 0x9ab: 0x3308, 0x9ac: 0x0db9, 0x9ad: 0x3308, 0x9ae: 0x3308, 0x9af: 0x3308,\n\t0x9b0: 0x3308, 0x9b1: 0x3308, 0x9b2: 0x3308, 0x9b3: 0x3308, 0x9b4: 0x3308, 0x9b5: 0x3308,\n\t0x9b6: 0x3308, 0x9b7: 0x3308, 0x9b8: 0x3308, 0x9b9: 0x0df1, 0x9ba: 0x3308, 0x9bb: 0x3308,\n\t0x9bc: 0x3308, 0x9bd: 0x0040, 0x9be: 0x0018, 0x9bf: 0x0018,\n\t// Block 0x27, offset 0x9c0\n\t0x9c0: 0x0008, 0x9c1: 0x0008, 0x9c2: 0x0008, 0x9c3: 0x0008, 0x9c4: 0x0008, 0x9c5: 0x0008,\n\t0x9c6: 0x0008, 0x9c7: 0x0008, 0x9c8: 0x0008, 0x9c9: 0x0008, 0x9ca: 0x0008, 0x9cb: 0x0008,\n\t0x9cc: 0x0008, 0x9cd: 0x0008, 0x9ce: 0x0008, 0x9cf: 0x0008, 0x9d0: 0x0008, 0x9d1: 0x0008,\n\t0x9d2: 0x0008, 0x9d3: 0x0008, 0x9d4: 0x0008, 0x9d5: 0x0008, 0x9d6: 0x0008, 0x9d7: 0x0008,\n\t0x9d8: 0x0008, 0x9d9: 0x0008, 0x9da: 0x0008, 0x9db: 0x0008, 0x9dc: 0x0008, 0x9dd: 0x0008,\n\t0x9de: 0x0008, 0x9df: 0x0008, 0x9e0: 0x0008, 0x9e1: 0x0008, 0x9e2: 0x0008, 0x9e3: 0x0008,\n\t0x9e4: 0x0008, 0x9e5: 0x0008, 0x9e6: 0x0008, 0x9e7: 0x0008, 0x9e8: 0x0008, 0x9e9: 0x0008,\n\t0x9ea: 0x0008, 0x9eb: 0x0008, 0x9ec: 0x0039, 0x9ed: 0x0ed1, 0x9ee: 0x0ee9, 0x9ef: 0x0008,\n\t0x9f0: 0x0ef9, 0x9f1: 0x0f09, 0x9f2: 0x0f19, 0x9f3: 0x0f31, 0x9f4: 0x0249, 0x9f5: 0x0f41,\n\t0x9f6: 0x0259, 0x9f7: 0x0f51, 0x9f8: 0x0359, 0x9f9: 0x0f61, 0x9fa: 0x0f71, 0x9fb: 0x0008,\n\t0x9fc: 0x00d9, 0x9fd: 0x0f81, 0x9fe: 0x0f99, 0x9ff: 0x0269,\n\t// Block 0x28, offset 0xa00\n\t0xa00: 0x0fa9, 0xa01: 0x0fb9, 0xa02: 0x0279, 0xa03: 0x0039, 0xa04: 0x0fc9, 0xa05: 0x0fe1,\n\t0xa06: 0x059d, 0xa07: 0x0ee9, 0xa08: 0x0ef9, 0xa09: 0x0f09, 0xa0a: 0x0ff9, 0xa0b: 0x1011,\n\t0xa0c: 0x1029, 0xa0d: 0x0f31, 0xa0e: 0x0008, 0xa0f: 0x0f51, 0xa10: 0x0f61, 0xa11: 0x1041,\n\t0xa12: 0x00d9, 0xa13: 0x1059, 0xa14: 0x05b5, 0xa15: 0x05b5, 0xa16: 0x0f99, 0xa17: 0x0fa9,\n\t0xa18: 0x0fb9, 0xa19: 0x059d, 0xa1a: 0x1071, 0xa1b: 0x1089, 0xa1c: 0x05cd, 0xa1d: 0x1099,\n\t0xa1e: 0x10b1, 0xa1f: 0x10c9, 0xa20: 0x10e1, 0xa21: 0x10f9, 0xa22: 0x0f41, 0xa23: 0x0269,\n\t0xa24: 0x0fb9, 0xa25: 0x1089, 0xa26: 0x1099, 0xa27: 0x10b1, 0xa28: 0x1111, 0xa29: 0x10e1,\n\t0xa2a: 0x10f9, 0xa2b: 0x0008, 0xa2c: 0x0008, 0xa2d: 0x0008, 0xa2e: 0x0008, 0xa2f: 0x0008,\n\t0xa30: 0x0008, 0xa31: 0x0008, 0xa32: 0x0008, 0xa33: 0x0008, 0xa34: 0x0008, 0xa35: 0x0008,\n\t0xa36: 0x0008, 0xa37: 0x0008, 0xa38: 0x1129, 0xa39: 0x0008, 0xa3a: 0x0008, 0xa3b: 0x0008,\n\t0xa3c: 0x0008, 0xa3d: 0x0008, 0xa3e: 0x0008, 0xa3f: 0x0008,\n\t// Block 0x29, offset 0xa40\n\t0xa40: 0x0008, 0xa41: 0x0008, 0xa42: 0x0008, 0xa43: 0x0008, 0xa44: 0x0008, 0xa45: 0x0008,\n\t0xa46: 0x0008, 0xa47: 0x0008, 0xa48: 0x0008, 0xa49: 0x0008, 0xa4a: 0x0008, 0xa4b: 0x0008,\n\t0xa4c: 0x0008, 0xa4d: 0x0008, 0xa4e: 0x0008, 0xa4f: 0x0008, 0xa50: 0x0008, 0xa51: 0x0008,\n\t0xa52: 0x0008, 0xa53: 0x0008, 0xa54: 0x0008, 0xa55: 0x0008, 0xa56: 0x0008, 0xa57: 0x0008,\n\t0xa58: 0x0008, 0xa59: 0x0008, 0xa5a: 0x0008, 0xa5b: 0x1141, 0xa5c: 0x1159, 0xa5d: 0x1169,\n\t0xa5e: 0x1181, 0xa5f: 0x1029, 0xa60: 0x1199, 0xa61: 0x11a9, 0xa62: 0x11c1, 0xa63: 0x11d9,\n\t0xa64: 0x11f1, 0xa65: 0x1209, 0xa66: 0x1221, 0xa67: 0x05e5, 0xa68: 0x1239, 0xa69: 0x1251,\n\t0xa6a: 0xe17d, 0xa6b: 0x1269, 0xa6c: 0x1281, 0xa6d: 0x1299, 0xa6e: 0x12b1, 0xa6f: 0x12c9,\n\t0xa70: 0x12e1, 0xa71: 0x12f9, 0xa72: 0x1311, 0xa73: 0x1329, 0xa74: 0x1341, 0xa75: 0x1359,\n\t0xa76: 0x1371, 0xa77: 0x1389, 0xa78: 0x05fd, 0xa79: 0x13a1, 0xa7a: 0x13b9, 0xa7b: 0x13d1,\n\t0xa7c: 0x13e1, 0xa7d: 0x13f9, 0xa7e: 0x1411, 0xa7f: 0x1429,\n\t// Block 0x2a, offset 0xa80\n\t0xa80: 0xe00d, 0xa81: 0x0008, 0xa82: 0xe00d, 0xa83: 0x0008, 0xa84: 0xe00d, 0xa85: 0x0008,\n\t0xa86: 0xe00d, 0xa87: 0x0008, 0xa88: 0xe00d, 0xa89: 0x0008, 0xa8a: 0xe00d, 0xa8b: 0x0008,\n\t0xa8c: 0xe00d, 0xa8d: 0x0008, 0xa8e: 0xe00d, 0xa8f: 0x0008, 0xa90: 0xe00d, 0xa91: 0x0008,\n\t0xa92: 0xe00d, 0xa93: 0x0008, 0xa94: 0xe00d, 0xa95: 0x0008, 0xa96: 0xe00d, 0xa97: 0x0008,\n\t0xa98: 0xe00d, 0xa99: 0x0008, 0xa9a: 0xe00d, 0xa9b: 0x0008, 0xa9c: 0xe00d, 0xa9d: 0x0008,\n\t0xa9e: 0xe00d, 0xa9f: 0x0008, 0xaa0: 0xe00d, 0xaa1: 0x0008, 0xaa2: 0xe00d, 0xaa3: 0x0008,\n\t0xaa4: 0xe00d, 0xaa5: 0x0008, 0xaa6: 0xe00d, 0xaa7: 0x0008, 0xaa8: 0xe00d, 0xaa9: 0x0008,\n\t0xaaa: 0xe00d, 0xaab: 0x0008, 0xaac: 0xe00d, 0xaad: 0x0008, 0xaae: 0xe00d, 0xaaf: 0x0008,\n\t0xab0: 0xe00d, 0xab1: 0x0008, 0xab2: 0xe00d, 0xab3: 0x0008, 0xab4: 0xe00d, 0xab5: 0x0008,\n\t0xab6: 0xe00d, 0xab7: 0x0008, 0xab8: 0xe00d, 0xab9: 0x0008, 0xaba: 0xe00d, 0xabb: 0x0008,\n\t0xabc: 0xe00d, 0xabd: 0x0008, 0xabe: 0xe00d, 0xabf: 0x0008,\n\t// Block 0x2b, offset 0xac0\n\t0xac0: 0xe00d, 0xac1: 0x0008, 0xac2: 0xe00d, 0xac3: 0x0008, 0xac4: 0xe00d, 0xac5: 0x0008,\n\t0xac6: 0xe00d, 0xac7: 0x0008, 0xac8: 0xe00d, 0xac9: 0x0008, 0xaca: 0xe00d, 0xacb: 0x0008,\n\t0xacc: 0xe00d, 0xacd: 0x0008, 0xace: 0xe00d, 0xacf: 0x0008, 0xad0: 0xe00d, 0xad1: 0x0008,\n\t0xad2: 0xe00d, 0xad3: 0x0008, 0xad4: 0xe00d, 0xad5: 0x0008, 0xad6: 0x0008, 0xad7: 0x0008,\n\t0xad8: 0x0008, 0xad9: 0x0008, 0xada: 0x0615, 0xadb: 0x0635, 0xadc: 0x0008, 0xadd: 0x0008,\n\t0xade: 0x1441, 0xadf: 0x0008, 0xae0: 0xe00d, 0xae1: 0x0008, 0xae2: 0xe00d, 0xae3: 0x0008,\n\t0xae4: 0xe00d, 0xae5: 0x0008, 0xae6: 0xe00d, 0xae7: 0x0008, 0xae8: 0xe00d, 0xae9: 0x0008,\n\t0xaea: 0xe00d, 0xaeb: 0x0008, 0xaec: 0xe00d, 0xaed: 0x0008, 0xaee: 0xe00d, 0xaef: 0x0008,\n\t0xaf0: 0xe00d, 0xaf1: 0x0008, 0xaf2: 0xe00d, 0xaf3: 0x0008, 0xaf4: 0xe00d, 0xaf5: 0x0008,\n\t0xaf6: 0xe00d, 0xaf7: 0x0008, 0xaf8: 0xe00d, 0xaf9: 0x0008, 0xafa: 0xe00d, 0xafb: 0x0008,\n\t0xafc: 0xe00d, 0xafd: 0x0008, 0xafe: 0xe00d, 0xaff: 0x0008,\n\t// Block 0x2c, offset 0xb00\n\t0xb00: 0x0008, 0xb01: 0x0008, 0xb02: 0x0008, 0xb03: 0x0008, 0xb04: 0x0008, 0xb05: 0x0008,\n\t0xb06: 0x0040, 0xb07: 0x0040, 0xb08: 0xe045, 0xb09: 0xe045, 0xb0a: 0xe045, 0xb0b: 0xe045,\n\t0xb0c: 0xe045, 0xb0d: 0xe045, 0xb0e: 0x0040, 0xb0f: 0x0040, 0xb10: 0x0008, 0xb11: 0x0008,\n\t0xb12: 0x0008, 0xb13: 0x0008, 0xb14: 0x0008, 0xb15: 0x0008, 0xb16: 0x0008, 0xb17: 0x0008,\n\t0xb18: 0x0040, 0xb19: 0xe045, 0xb1a: 0x0040, 0xb1b: 0xe045, 0xb1c: 0x0040, 0xb1d: 0xe045,\n\t0xb1e: 0x0040, 0xb1f: 0xe045, 0xb20: 0x0008, 0xb21: 0x0008, 0xb22: 0x0008, 0xb23: 0x0008,\n\t0xb24: 0x0008, 0xb25: 0x0008, 0xb26: 0x0008, 0xb27: 0x0008, 0xb28: 0xe045, 0xb29: 0xe045,\n\t0xb2a: 0xe045, 0xb2b: 0xe045, 0xb2c: 0xe045, 0xb2d: 0xe045, 0xb2e: 0xe045, 0xb2f: 0xe045,\n\t0xb30: 0x0008, 0xb31: 0x1459, 0xb32: 0x0008, 0xb33: 0x1471, 0xb34: 0x0008, 0xb35: 0x1489,\n\t0xb36: 0x0008, 0xb37: 0x14a1, 0xb38: 0x0008, 0xb39: 0x14b9, 0xb3a: 0x0008, 0xb3b: 0x14d1,\n\t0xb3c: 0x0008, 0xb3d: 0x14e9, 0xb3e: 0x0040, 0xb3f: 0x0040,\n\t// Block 0x2d, offset 0xb40\n\t0xb40: 0x1501, 0xb41: 0x1531, 0xb42: 0x1561, 0xb43: 0x1591, 0xb44: 0x15c1, 0xb45: 0x15f1,\n\t0xb46: 0x1621, 0xb47: 0x1651, 0xb48: 0x1501, 0xb49: 0x1531, 0xb4a: 0x1561, 0xb4b: 0x1591,\n\t0xb4c: 0x15c1, 0xb4d: 0x15f1, 0xb4e: 0x1621, 0xb4f: 0x1651, 0xb50: 0x1681, 0xb51: 0x16b1,\n\t0xb52: 0x16e1, 0xb53: 0x1711, 0xb54: 0x1741, 0xb55: 0x1771, 0xb56: 0x17a1, 0xb57: 0x17d1,\n\t0xb58: 0x1681, 0xb59: 0x16b1, 0xb5a: 0x16e1, 0xb5b: 0x1711, 0xb5c: 0x1741, 0xb5d: 0x1771,\n\t0xb5e: 0x17a1, 0xb5f: 0x17d1, 0xb60: 0x1801, 0xb61: 0x1831, 0xb62: 0x1861, 0xb63: 0x1891,\n\t0xb64: 0x18c1, 0xb65: 0x18f1, 0xb66: 0x1921, 0xb67: 0x1951, 0xb68: 0x1801, 0xb69: 0x1831,\n\t0xb6a: 0x1861, 0xb6b: 0x1891, 0xb6c: 0x18c1, 0xb6d: 0x18f1, 0xb6e: 0x1921, 0xb6f: 0x1951,\n\t0xb70: 0x0008, 0xb71: 0x0008, 0xb72: 0x1981, 0xb73: 0x19b1, 0xb74: 0x19d9, 0xb75: 0x0040,\n\t0xb76: 0x0008, 0xb77: 0x1a01, 0xb78: 0xe045, 0xb79: 0xe045, 0xb7a: 0x064d, 0xb7b: 0x1459,\n\t0xb7c: 0x19b1, 0xb7d: 0x0666, 0xb7e: 0x1a31, 0xb7f: 0x0686,\n\t// Block 0x2e, offset 0xb80\n\t0xb80: 0x06a6, 0xb81: 0x1a4a, 0xb82: 0x1a79, 0xb83: 0x1aa9, 0xb84: 0x1ad1, 0xb85: 0x0040,\n\t0xb86: 0x0008, 0xb87: 0x1af9, 0xb88: 0x06c5, 0xb89: 0x1471, 0xb8a: 0x06dd, 0xb8b: 0x1489,\n\t0xb8c: 0x1aa9, 0xb8d: 0x1b2a, 0xb8e: 0x1b5a, 0xb8f: 0x1b8a, 0xb90: 0x0008, 0xb91: 0x0008,\n\t0xb92: 0x0008, 0xb93: 0x1bb9, 0xb94: 0x0040, 0xb95: 0x0040, 0xb96: 0x0008, 0xb97: 0x0008,\n\t0xb98: 0xe045, 0xb99: 0xe045, 0xb9a: 0x06f5, 0xb9b: 0x14a1, 0xb9c: 0x0040, 0xb9d: 0x1bd2,\n\t0xb9e: 0x1c02, 0xb9f: 0x1c32, 0xba0: 0x0008, 0xba1: 0x0008, 0xba2: 0x0008, 0xba3: 0x1c61,\n\t0xba4: 0x0008, 0xba5: 0x0008, 0xba6: 0x0008, 0xba7: 0x0008, 0xba8: 0xe045, 0xba9: 0xe045,\n\t0xbaa: 0x070d, 0xbab: 0x14d1, 0xbac: 0xe04d, 0xbad: 0x1c7a, 0xbae: 0x03d2, 0xbaf: 0x1caa,\n\t0xbb0: 0x0040, 0xbb1: 0x0040, 0xbb2: 0x1cb9, 0xbb3: 0x1ce9, 0xbb4: 0x1d11, 0xbb5: 0x0040,\n\t0xbb6: 0x0008, 0xbb7: 0x1d39, 0xbb8: 0x0725, 0xbb9: 0x14b9, 0xbba: 0x0515, 0xbbb: 0x14e9,\n\t0xbbc: 0x1ce9, 0xbbd: 0x073e, 0xbbe: 0x075e, 0xbbf: 0x0040,\n\t// Block 0x2f, offset 0xbc0\n\t0xbc0: 0x000a, 0xbc1: 0x000a, 0xbc2: 0x000a, 0xbc3: 0x000a, 0xbc4: 0x000a, 0xbc5: 0x000a,\n\t0xbc6: 0x000a, 0xbc7: 0x000a, 0xbc8: 0x000a, 0xbc9: 0x000a, 0xbca: 0x000a, 0xbcb: 0x03c0,\n\t0xbcc: 0x0003, 0xbcd: 0x0003, 0xbce: 0x0340, 0xbcf: 0x0b40, 0xbd0: 0x0018, 0xbd1: 0xe00d,\n\t0xbd2: 0x0018, 0xbd3: 0x0018, 0xbd4: 0x0018, 0xbd5: 0x0018, 0xbd6: 0x0018, 0xbd7: 0x077e,\n\t0xbd8: 0x0018, 0xbd9: 0x0018, 0xbda: 0x0018, 0xbdb: 0x0018, 0xbdc: 0x0018, 0xbdd: 0x0018,\n\t0xbde: 0x0018, 0xbdf: 0x0018, 0xbe0: 0x0018, 0xbe1: 0x0018, 0xbe2: 0x0018, 0xbe3: 0x0018,\n\t0xbe4: 0x0040, 0xbe5: 0x0040, 0xbe6: 0x0040, 0xbe7: 0x0018, 0xbe8: 0x0040, 0xbe9: 0x0040,\n\t0xbea: 0x0340, 0xbeb: 0x0340, 0xbec: 0x0340, 0xbed: 0x0340, 0xbee: 0x0340, 0xbef: 0x000a,\n\t0xbf0: 0x0018, 0xbf1: 0x0018, 0xbf2: 0x0018, 0xbf3: 0x1d69, 0xbf4: 0x1da1, 0xbf5: 0x0018,\n\t0xbf6: 0x1df1, 0xbf7: 0x1e29, 0xbf8: 0x0018, 0xbf9: 0x0018, 0xbfa: 0x0018, 0xbfb: 0x0018,\n\t0xbfc: 0x1e7a, 0xbfd: 0x0018, 0xbfe: 0x079e, 0xbff: 0x0018,\n\t// Block 0x30, offset 0xc00\n\t0xc00: 0x0018, 0xc01: 0x0018, 0xc02: 0x0018, 0xc03: 0x0018, 0xc04: 0x0018, 0xc05: 0x0018,\n\t0xc06: 0x0018, 0xc07: 0x1e92, 0xc08: 0x1eaa, 0xc09: 0x1ec2, 0xc0a: 0x0018, 0xc0b: 0x0018,\n\t0xc0c: 0x0018, 0xc0d: 0x0018, 0xc0e: 0x0018, 0xc0f: 0x0018, 0xc10: 0x0018, 0xc11: 0x0018,\n\t0xc12: 0x0018, 0xc13: 0x0018, 0xc14: 0x0018, 0xc15: 0x0018, 0xc16: 0x0018, 0xc17: 0x1ed9,\n\t0xc18: 0x0018, 0xc19: 0x0018, 0xc1a: 0x0018, 0xc1b: 0x0018, 0xc1c: 0x0018, 0xc1d: 0x0018,\n\t0xc1e: 0x0018, 0xc1f: 0x000a, 0xc20: 0x03c0, 0xc21: 0x0340, 0xc22: 0x0340, 0xc23: 0x0340,\n\t0xc24: 0x03c0, 0xc25: 0x0040, 0xc26: 0x0040, 0xc27: 0x0040, 0xc28: 0x0040, 0xc29: 0x0040,\n\t0xc2a: 0x0340, 0xc2b: 0x0340, 0xc2c: 0x0340, 0xc2d: 0x0340, 0xc2e: 0x0340, 0xc2f: 0x0340,\n\t0xc30: 0x1f41, 0xc31: 0x0f41, 0xc32: 0x0040, 0xc33: 0x0040, 0xc34: 0x1f51, 0xc35: 0x1f61,\n\t0xc36: 0x1f71, 0xc37: 0x1f81, 0xc38: 0x1f91, 0xc39: 0x1fa1, 0xc3a: 0x1fb2, 0xc3b: 0x07bd,\n\t0xc3c: 0x1fc2, 0xc3d: 0x1fd2, 0xc3e: 0x1fe2, 0xc3f: 0x0f71,\n\t// Block 0x31, offset 0xc40\n\t0xc40: 0x1f41, 0xc41: 0x00c9, 0xc42: 0x0069, 0xc43: 0x0079, 0xc44: 0x1f51, 0xc45: 0x1f61,\n\t0xc46: 0x1f71, 0xc47: 0x1f81, 0xc48: 0x1f91, 0xc49: 0x1fa1, 0xc4a: 0x1fb2, 0xc4b: 0x07d5,\n\t0xc4c: 0x1fc2, 0xc4d: 0x1fd2, 0xc4e: 0x1fe2, 0xc4f: 0x0040, 0xc50: 0x0039, 0xc51: 0x0f09,\n\t0xc52: 0x00d9, 0xc53: 0x0369, 0xc54: 0x0ff9, 0xc55: 0x0249, 0xc56: 0x0f51, 0xc57: 0x0359,\n\t0xc58: 0x0f61, 0xc59: 0x0f71, 0xc5a: 0x0f99, 0xc5b: 0x01d9, 0xc5c: 0x0fa9, 0xc5d: 0x0040,\n\t0xc5e: 0x0040, 0xc5f: 0x0040, 0xc60: 0x0018, 0xc61: 0x0018, 0xc62: 0x0018, 0xc63: 0x0018,\n\t0xc64: 0x0018, 0xc65: 0x0018, 0xc66: 0x0018, 0xc67: 0x0018, 0xc68: 0x1ff1, 0xc69: 0x0018,\n\t0xc6a: 0x0018, 0xc6b: 0x0018, 0xc6c: 0x0018, 0xc6d: 0x0018, 0xc6e: 0x0018, 0xc6f: 0x0018,\n\t0xc70: 0x0018, 0xc71: 0x0018, 0xc72: 0x0018, 0xc73: 0x0018, 0xc74: 0x0018, 0xc75: 0x0018,\n\t0xc76: 0x0018, 0xc77: 0x0018, 0xc78: 0x0018, 0xc79: 0x0018, 0xc7a: 0x0018, 0xc7b: 0x0018,\n\t0xc7c: 0x0018, 0xc7d: 0x0018, 0xc7e: 0x0018, 0xc7f: 0x0018,\n\t// Block 0x32, offset 0xc80\n\t0xc80: 0x07ee, 0xc81: 0x080e, 0xc82: 0x1159, 0xc83: 0x082d, 0xc84: 0x0018, 0xc85: 0x084e,\n\t0xc86: 0x086e, 0xc87: 0x1011, 0xc88: 0x0018, 0xc89: 0x088d, 0xc8a: 0x0f31, 0xc8b: 0x0249,\n\t0xc8c: 0x0249, 0xc8d: 0x0249, 0xc8e: 0x0249, 0xc8f: 0x2009, 0xc90: 0x0f41, 0xc91: 0x0f41,\n\t0xc92: 0x0359, 0xc93: 0x0359, 0xc94: 0x0018, 0xc95: 0x0f71, 0xc96: 0x2021, 0xc97: 0x0018,\n\t0xc98: 0x0018, 0xc99: 0x0f99, 0xc9a: 0x2039, 0xc9b: 0x0269, 0xc9c: 0x0269, 0xc9d: 0x0269,\n\t0xc9e: 0x0018, 0xc9f: 0x0018, 0xca0: 0x2049, 0xca1: 0x08ad, 0xca2: 0x2061, 0xca3: 0x0018,\n\t0xca4: 0x13d1, 0xca5: 0x0018, 0xca6: 0x2079, 0xca7: 0x0018, 0xca8: 0x13d1, 0xca9: 0x0018,\n\t0xcaa: 0x0f51, 0xcab: 0x2091, 0xcac: 0x0ee9, 0xcad: 0x1159, 0xcae: 0x0018, 0xcaf: 0x0f09,\n\t0xcb0: 0x0f09, 0xcb1: 0x1199, 0xcb2: 0x0040, 0xcb3: 0x0f61, 0xcb4: 0x00d9, 0xcb5: 0x20a9,\n\t0xcb6: 0x20c1, 0xcb7: 0x20d9, 0xcb8: 0x20f1, 0xcb9: 0x0f41, 0xcba: 0x0018, 0xcbb: 0x08cd,\n\t0xcbc: 0x2109, 0xcbd: 0x10b1, 0xcbe: 0x10b1, 0xcbf: 0x2109,\n\t// Block 0x33, offset 0xcc0\n\t0xcc0: 0x08ed, 0xcc1: 0x0018, 0xcc2: 0x0018, 0xcc3: 0x0018, 0xcc4: 0x0018, 0xcc5: 0x0ef9,\n\t0xcc6: 0x0ef9, 0xcc7: 0x0f09, 0xcc8: 0x0f41, 0xcc9: 0x0259, 0xcca: 0x0018, 0xccb: 0x0018,\n\t0xccc: 0x0018, 0xccd: 0x0018, 0xcce: 0x0008, 0xccf: 0x0018, 0xcd0: 0x2121, 0xcd1: 0x2151,\n\t0xcd2: 0x2181, 0xcd3: 0x21b9, 0xcd4: 0x21e9, 0xcd5: 0x2219, 0xcd6: 0x2249, 0xcd7: 0x2279,\n\t0xcd8: 0x22a9, 0xcd9: 0x22d9, 0xcda: 0x2309, 0xcdb: 0x2339, 0xcdc: 0x2369, 0xcdd: 0x2399,\n\t0xcde: 0x23c9, 0xcdf: 0x23f9, 0xce0: 0x0f41, 0xce1: 0x2421, 0xce2: 0x0905, 0xce3: 0x2439,\n\t0xce4: 0x1089, 0xce5: 0x2451, 0xce6: 0x0925, 0xce7: 0x2469, 0xce8: 0x2491, 0xce9: 0x0369,\n\t0xcea: 0x24a9, 0xceb: 0x0945, 0xcec: 0x0359, 0xced: 0x1159, 0xcee: 0x0ef9, 0xcef: 0x0f61,\n\t0xcf0: 0x0f41, 0xcf1: 0x2421, 0xcf2: 0x0965, 0xcf3: 0x2439, 0xcf4: 0x1089, 0xcf5: 0x2451,\n\t0xcf6: 0x0985, 0xcf7: 0x2469, 0xcf8: 0x2491, 0xcf9: 0x0369, 0xcfa: 0x24a9, 0xcfb: 0x09a5,\n\t0xcfc: 0x0359, 0xcfd: 0x1159, 0xcfe: 0x0ef9, 0xcff: 0x0f61,\n\t// Block 0x34, offset 0xd00\n\t0xd00: 0x0018, 0xd01: 0x0018, 0xd02: 0x0018, 0xd03: 0x0018, 0xd04: 0x0018, 0xd05: 0x0018,\n\t0xd06: 0x0018, 0xd07: 0x0018, 0xd08: 0x0018, 0xd09: 0x0018, 0xd0a: 0x0018, 0xd0b: 0x0040,\n\t0xd0c: 0x0040, 0xd0d: 0x0040, 0xd0e: 0x0040, 0xd0f: 0x0040, 0xd10: 0x0040, 0xd11: 0x0040,\n\t0xd12: 0x0040, 0xd13: 0x0040, 0xd14: 0x0040, 0xd15: 0x0040, 0xd16: 0x0040, 0xd17: 0x0040,\n\t0xd18: 0x0040, 0xd19: 0x0040, 0xd1a: 0x0040, 0xd1b: 0x0040, 0xd1c: 0x0040, 0xd1d: 0x0040,\n\t0xd1e: 0x0040, 0xd1f: 0x0040, 0xd20: 0x00c9, 0xd21: 0x0069, 0xd22: 0x0079, 0xd23: 0x1f51,\n\t0xd24: 0x1f61, 0xd25: 0x1f71, 0xd26: 0x1f81, 0xd27: 0x1f91, 0xd28: 0x1fa1, 0xd29: 0x2601,\n\t0xd2a: 0x2619, 0xd2b: 0x2631, 0xd2c: 0x2649, 0xd2d: 0x2661, 0xd2e: 0x2679, 0xd2f: 0x2691,\n\t0xd30: 0x26a9, 0xd31: 0x26c1, 0xd32: 0x26d9, 0xd33: 0x26f1, 0xd34: 0x0a06, 0xd35: 0x0a26,\n\t0xd36: 0x0a46, 0xd37: 0x0a66, 0xd38: 0x0a86, 0xd39: 0x0aa6, 0xd3a: 0x0ac6, 0xd3b: 0x0ae6,\n\t0xd3c: 0x0b06, 0xd3d: 0x270a, 0xd3e: 0x2732, 0xd3f: 0x275a,\n\t// Block 0x35, offset 0xd40\n\t0xd40: 0x2782, 0xd41: 0x27aa, 0xd42: 0x27d2, 0xd43: 0x27fa, 0xd44: 0x2822, 0xd45: 0x284a,\n\t0xd46: 0x2872, 0xd47: 0x289a, 0xd48: 0x0040, 0xd49: 0x0040, 0xd4a: 0x0040, 0xd4b: 0x0040,\n\t0xd4c: 0x0040, 0xd4d: 0x0040, 0xd4e: 0x0040, 0xd4f: 0x0040, 0xd50: 0x0040, 0xd51: 0x0040,\n\t0xd52: 0x0040, 0xd53: 0x0040, 0xd54: 0x0040, 0xd55: 0x0040, 0xd56: 0x0040, 0xd57: 0x0040,\n\t0xd58: 0x0040, 0xd59: 0x0040, 0xd5a: 0x0040, 0xd5b: 0x0040, 0xd5c: 0x0b26, 0xd5d: 0x0b46,\n\t0xd5e: 0x0b66, 0xd5f: 0x0b86, 0xd60: 0x0ba6, 0xd61: 0x0bc6, 0xd62: 0x0be6, 0xd63: 0x0c06,\n\t0xd64: 0x0c26, 0xd65: 0x0c46, 0xd66: 0x0c66, 0xd67: 0x0c86, 0xd68: 0x0ca6, 0xd69: 0x0cc6,\n\t0xd6a: 0x0ce6, 0xd6b: 0x0d06, 0xd6c: 0x0d26, 0xd6d: 0x0d46, 0xd6e: 0x0d66, 0xd6f: 0x0d86,\n\t0xd70: 0x0da6, 0xd71: 0x0dc6, 0xd72: 0x0de6, 0xd73: 0x0e06, 0xd74: 0x0e26, 0xd75: 0x0e46,\n\t0xd76: 0x0039, 0xd77: 0x0ee9, 0xd78: 0x1159, 0xd79: 0x0ef9, 0xd7a: 0x0f09, 0xd7b: 0x1199,\n\t0xd7c: 0x0f31, 0xd7d: 0x0249, 0xd7e: 0x0f41, 0xd7f: 0x0259,\n\t// Block 0x36, offset 0xd80\n\t0xd80: 0x0f51, 0xd81: 0x0359, 0xd82: 0x0f61, 0xd83: 0x0f71, 0xd84: 0x00d9, 0xd85: 0x0f99,\n\t0xd86: 0x2039, 0xd87: 0x0269, 0xd88: 0x01d9, 0xd89: 0x0fa9, 0xd8a: 0x0fb9, 0xd8b: 0x1089,\n\t0xd8c: 0x0279, 0xd8d: 0x0369, 0xd8e: 0x0289, 0xd8f: 0x13d1, 0xd90: 0x0039, 0xd91: 0x0ee9,\n\t0xd92: 0x1159, 0xd93: 0x0ef9, 0xd94: 0x0f09, 0xd95: 0x1199, 0xd96: 0x0f31, 0xd97: 0x0249,\n\t0xd98: 0x0f41, 0xd99: 0x0259, 0xd9a: 0x0f51, 0xd9b: 0x0359, 0xd9c: 0x0f61, 0xd9d: 0x0f71,\n\t0xd9e: 0x00d9, 0xd9f: 0x0f99, 0xda0: 0x2039, 0xda1: 0x0269, 0xda2: 0x01d9, 0xda3: 0x0fa9,\n\t0xda4: 0x0fb9, 0xda5: 0x1089, 0xda6: 0x0279, 0xda7: 0x0369, 0xda8: 0x0289, 0xda9: 0x13d1,\n\t0xdaa: 0x1f41, 0xdab: 0x0018, 0xdac: 0x0018, 0xdad: 0x0018, 0xdae: 0x0018, 0xdaf: 0x0018,\n\t0xdb0: 0x0018, 0xdb1: 0x0018, 0xdb2: 0x0018, 0xdb3: 0x0018, 0xdb4: 0x0018, 0xdb5: 0x0018,\n\t0xdb6: 0x0018, 0xdb7: 0x0018, 0xdb8: 0x0018, 0xdb9: 0x0018, 0xdba: 0x0018, 0xdbb: 0x0018,\n\t0xdbc: 0x0018, 0xdbd: 0x0018, 0xdbe: 0x0018, 0xdbf: 0x0018,\n\t// Block 0x37, offset 0xdc0\n\t0xdc0: 0x0008, 0xdc1: 0x0008, 0xdc2: 0x0008, 0xdc3: 0x0008, 0xdc4: 0x0008, 0xdc5: 0x0008,\n\t0xdc6: 0x0008, 0xdc7: 0x0008, 0xdc8: 0x0008, 0xdc9: 0x0008, 0xdca: 0x0008, 0xdcb: 0x0008,\n\t0xdcc: 0x0008, 0xdcd: 0x0008, 0xdce: 0x0008, 0xdcf: 0x0008, 0xdd0: 0x0008, 0xdd1: 0x0008,\n\t0xdd2: 0x0008, 0xdd3: 0x0008, 0xdd4: 0x0008, 0xdd5: 0x0008, 0xdd6: 0x0008, 0xdd7: 0x0008,\n\t0xdd8: 0x0008, 0xdd9: 0x0008, 0xdda: 0x0008, 0xddb: 0x0008, 0xddc: 0x0008, 0xddd: 0x0008,\n\t0xdde: 0x0008, 0xddf: 0x0040, 0xde0: 0xe00d, 0xde1: 0x0008, 0xde2: 0x2971, 0xde3: 0x0ebd,\n\t0xde4: 0x2989, 0xde5: 0x0008, 0xde6: 0x0008, 0xde7: 0xe07d, 0xde8: 0x0008, 0xde9: 0xe01d,\n\t0xdea: 0x0008, 0xdeb: 0xe03d, 0xdec: 0x0008, 0xded: 0x0fe1, 0xdee: 0x1281, 0xdef: 0x0fc9,\n\t0xdf0: 0x1141, 0xdf1: 0x0008, 0xdf2: 0xe00d, 0xdf3: 0x0008, 0xdf4: 0x0008, 0xdf5: 0xe01d,\n\t0xdf6: 0x0008, 0xdf7: 0x0008, 0xdf8: 0x0008, 0xdf9: 0x0008, 0xdfa: 0x0008, 0xdfb: 0x0008,\n\t0xdfc: 0x0259, 0xdfd: 0x1089, 0xdfe: 0x29a1, 0xdff: 0x29b9,\n\t// Block 0x38, offset 0xe00\n\t0xe00: 0xe00d, 0xe01: 0x0008, 0xe02: 0xe00d, 0xe03: 0x0008, 0xe04: 0xe00d, 0xe05: 0x0008,\n\t0xe06: 0xe00d, 0xe07: 0x0008, 0xe08: 0xe00d, 0xe09: 0x0008, 0xe0a: 0xe00d, 0xe0b: 0x0008,\n\t0xe0c: 0xe00d, 0xe0d: 0x0008, 0xe0e: 0xe00d, 0xe0f: 0x0008, 0xe10: 0xe00d, 0xe11: 0x0008,\n\t0xe12: 0xe00d, 0xe13: 0x0008, 0xe14: 0xe00d, 0xe15: 0x0008, 0xe16: 0xe00d, 0xe17: 0x0008,\n\t0xe18: 0xe00d, 0xe19: 0x0008, 0xe1a: 0xe00d, 0xe1b: 0x0008, 0xe1c: 0xe00d, 0xe1d: 0x0008,\n\t0xe1e: 0xe00d, 0xe1f: 0x0008, 0xe20: 0xe00d, 0xe21: 0x0008, 0xe22: 0xe00d, 0xe23: 0x0008,\n\t0xe24: 0x0008, 0xe25: 0x0018, 0xe26: 0x0018, 0xe27: 0x0018, 0xe28: 0x0018, 0xe29: 0x0018,\n\t0xe2a: 0x0018, 0xe2b: 0xe03d, 0xe2c: 0x0008, 0xe2d: 0xe01d, 0xe2e: 0x0008, 0xe2f: 0x3308,\n\t0xe30: 0x3308, 0xe31: 0x3308, 0xe32: 0xe00d, 0xe33: 0x0008, 0xe34: 0x0040, 0xe35: 0x0040,\n\t0xe36: 0x0040, 0xe37: 0x0040, 0xe38: 0x0040, 0xe39: 0x0018, 0xe3a: 0x0018, 0xe3b: 0x0018,\n\t0xe3c: 0x0018, 0xe3d: 0x0018, 0xe3e: 0x0018, 0xe3f: 0x0018,\n\t// Block 0x39, offset 0xe40\n\t0xe40: 0x26fd, 0xe41: 0x271d, 0xe42: 0x273d, 0xe43: 0x275d, 0xe44: 0x277d, 0xe45: 0x279d,\n\t0xe46: 0x27bd, 0xe47: 0x27dd, 0xe48: 0x27fd, 0xe49: 0x281d, 0xe4a: 0x283d, 0xe4b: 0x285d,\n\t0xe4c: 0x287d, 0xe4d: 0x289d, 0xe4e: 0x28bd, 0xe4f: 0x28dd, 0xe50: 0x28fd, 0xe51: 0x291d,\n\t0xe52: 0x293d, 0xe53: 0x295d, 0xe54: 0x297d, 0xe55: 0x299d, 0xe56: 0x0040, 0xe57: 0x0040,\n\t0xe58: 0x0040, 0xe59: 0x0040, 0xe5a: 0x0040, 0xe5b: 0x0040, 0xe5c: 0x0040, 0xe5d: 0x0040,\n\t0xe5e: 0x0040, 0xe5f: 0x0040, 0xe60: 0x0040, 0xe61: 0x0040, 0xe62: 0x0040, 0xe63: 0x0040,\n\t0xe64: 0x0040, 0xe65: 0x0040, 0xe66: 0x0040, 0xe67: 0x0040, 0xe68: 0x0040, 0xe69: 0x0040,\n\t0xe6a: 0x0040, 0xe6b: 0x0040, 0xe6c: 0x0040, 0xe6d: 0x0040, 0xe6e: 0x0040, 0xe6f: 0x0040,\n\t0xe70: 0x0040, 0xe71: 0x0040, 0xe72: 0x0040, 0xe73: 0x0040, 0xe74: 0x0040, 0xe75: 0x0040,\n\t0xe76: 0x0040, 0xe77: 0x0040, 0xe78: 0x0040, 0xe79: 0x0040, 0xe7a: 0x0040, 0xe7b: 0x0040,\n\t0xe7c: 0x0040, 0xe7d: 0x0040, 0xe7e: 0x0040, 0xe7f: 0x0040,\n\t// Block 0x3a, offset 0xe80\n\t0xe80: 0x000a, 0xe81: 0x0018, 0xe82: 0x29d1, 0xe83: 0x0018, 0xe84: 0x0018, 0xe85: 0x0008,\n\t0xe86: 0x0008, 0xe87: 0x0008, 0xe88: 0x0018, 0xe89: 0x0018, 0xe8a: 0x0018, 0xe8b: 0x0018,\n\t0xe8c: 0x0018, 0xe8d: 0x0018, 0xe8e: 0x0018, 0xe8f: 0x0018, 0xe90: 0x0018, 0xe91: 0x0018,\n\t0xe92: 0x0018, 0xe93: 0x0018, 0xe94: 0x0018, 0xe95: 0x0018, 0xe96: 0x0018, 0xe97: 0x0018,\n\t0xe98: 0x0018, 0xe99: 0x0018, 0xe9a: 0x0018, 0xe9b: 0x0018, 0xe9c: 0x0018, 0xe9d: 0x0018,\n\t0xe9e: 0x0018, 0xe9f: 0x0018, 0xea0: 0x0018, 0xea1: 0x0018, 0xea2: 0x0018, 0xea3: 0x0018,\n\t0xea4: 0x0018, 0xea5: 0x0018, 0xea6: 0x0018, 0xea7: 0x0018, 0xea8: 0x0018, 0xea9: 0x0018,\n\t0xeaa: 0x3308, 0xeab: 0x3308, 0xeac: 0x3308, 0xead: 0x3308, 0xeae: 0x3018, 0xeaf: 0x3018,\n\t0xeb0: 0x0018, 0xeb1: 0x0018, 0xeb2: 0x0018, 0xeb3: 0x0018, 0xeb4: 0x0018, 0xeb5: 0x0018,\n\t0xeb6: 0xe125, 0xeb7: 0x0018, 0xeb8: 0x29bd, 0xeb9: 0x29dd, 0xeba: 0x29fd, 0xebb: 0x0018,\n\t0xebc: 0x0008, 0xebd: 0x0018, 0xebe: 0x0018, 0xebf: 0x0018,\n\t// Block 0x3b, offset 0xec0\n\t0xec0: 0x2b3d, 0xec1: 0x2b5d, 0xec2: 0x2b7d, 0xec3: 0x2b9d, 0xec4: 0x2bbd, 0xec5: 0x2bdd,\n\t0xec6: 0x2bdd, 0xec7: 0x2bdd, 0xec8: 0x2bfd, 0xec9: 0x2bfd, 0xeca: 0x2bfd, 0xecb: 0x2bfd,\n\t0xecc: 0x2c1d, 0xecd: 0x2c1d, 0xece: 0x2c1d, 0xecf: 0x2c3d, 0xed0: 0x2c5d, 0xed1: 0x2c5d,\n\t0xed2: 0x2a7d, 0xed3: 0x2a7d, 0xed4: 0x2c5d, 0xed5: 0x2c5d, 0xed6: 0x2c7d, 0xed7: 0x2c7d,\n\t0xed8: 0x2c5d, 0xed9: 0x2c5d, 0xeda: 0x2a7d, 0xedb: 0x2a7d, 0xedc: 0x2c5d, 0xedd: 0x2c5d,\n\t0xede: 0x2c3d, 0xedf: 0x2c3d, 0xee0: 0x2c9d, 0xee1: 0x2c9d, 0xee2: 0x2cbd, 0xee3: 0x2cbd,\n\t0xee4: 0x0040, 0xee5: 0x2cdd, 0xee6: 0x2cfd, 0xee7: 0x2d1d, 0xee8: 0x2d1d, 0xee9: 0x2d3d,\n\t0xeea: 0x2d5d, 0xeeb: 0x2d7d, 0xeec: 0x2d9d, 0xeed: 0x2dbd, 0xeee: 0x2ddd, 0xeef: 0x2dfd,\n\t0xef0: 0x2e1d, 0xef1: 0x2e3d, 0xef2: 0x2e3d, 0xef3: 0x2e5d, 0xef4: 0x2e7d, 0xef5: 0x2e7d,\n\t0xef6: 0x2e9d, 0xef7: 0x2ebd, 0xef8: 0x2e5d, 0xef9: 0x2edd, 0xefa: 0x2efd, 0xefb: 0x2edd,\n\t0xefc: 0x2e5d, 0xefd: 0x2f1d, 0xefe: 0x2f3d, 0xeff: 0x2f5d,\n\t// Block 0x3c, offset 0xf00\n\t0xf00: 0x2f7d, 0xf01: 0x2f9d, 0xf02: 0x2cfd, 0xf03: 0x2cdd, 0xf04: 0x2fbd, 0xf05: 0x2fdd,\n\t0xf06: 0x2ffd, 0xf07: 0x301d, 0xf08: 0x303d, 0xf09: 0x305d, 0xf0a: 0x307d, 0xf0b: 0x309d,\n\t0xf0c: 0x30bd, 0xf0d: 0x30dd, 0xf0e: 0x30fd, 0xf0f: 0x0040, 0xf10: 0x0018, 0xf11: 0x0018,\n\t0xf12: 0x311d, 0xf13: 0x313d, 0xf14: 0x315d, 0xf15: 0x317d, 0xf16: 0x319d, 0xf17: 0x31bd,\n\t0xf18: 0x31dd, 0xf19: 0x31fd, 0xf1a: 0x321d, 0xf1b: 0x323d, 0xf1c: 0x315d, 0xf1d: 0x325d,\n\t0xf1e: 0x327d, 0xf1f: 0x329d, 0xf20: 0x0008, 0xf21: 0x0008, 0xf22: 0x0008, 0xf23: 0x0008,\n\t0xf24: 0x0008, 0xf25: 0x0008, 0xf26: 0x0008, 0xf27: 0x0008, 0xf28: 0x0008, 0xf29: 0x0008,\n\t0xf2a: 0x0008, 0xf2b: 0x0008, 0xf2c: 0x0008, 0xf2d: 0x0008, 0xf2e: 0x0008, 0xf2f: 0x0008,\n\t0xf30: 0x0008, 0xf31: 0x0008, 0xf32: 0x0008, 0xf33: 0x0008, 0xf34: 0x0008, 0xf35: 0x0008,\n\t0xf36: 0x0008, 0xf37: 0x0008, 0xf38: 0x0008, 0xf39: 0x0008, 0xf3a: 0x0008, 0xf3b: 0x0040,\n\t0xf3c: 0x0040, 0xf3d: 0x0040, 0xf3e: 0x0040, 0xf3f: 0x0040,\n\t// Block 0x3d, offset 0xf40\n\t0xf40: 0x36a2, 0xf41: 0x36d2, 0xf42: 0x3702, 0xf43: 0x3732, 0xf44: 0x32bd, 0xf45: 0x32dd,\n\t0xf46: 0x32fd, 0xf47: 0x331d, 0xf48: 0x0018, 0xf49: 0x0018, 0xf4a: 0x0018, 0xf4b: 0x0018,\n\t0xf4c: 0x0018, 0xf4d: 0x0018, 0xf4e: 0x0018, 0xf4f: 0x0018, 0xf50: 0x333d, 0xf51: 0x3761,\n\t0xf52: 0x3779, 0xf53: 0x3791, 0xf54: 0x37a9, 0xf55: 0x37c1, 0xf56: 0x37d9, 0xf57: 0x37f1,\n\t0xf58: 0x3809, 0xf59: 0x3821, 0xf5a: 0x3839, 0xf5b: 0x3851, 0xf5c: 0x3869, 0xf5d: 0x3881,\n\t0xf5e: 0x3899, 0xf5f: 0x38b1, 0xf60: 0x335d, 0xf61: 0x337d, 0xf62: 0x339d, 0xf63: 0x33bd,\n\t0xf64: 0x33dd, 0xf65: 0x33dd, 0xf66: 0x33fd, 0xf67: 0x341d, 0xf68: 0x343d, 0xf69: 0x345d,\n\t0xf6a: 0x347d, 0xf6b: 0x349d, 0xf6c: 0x34bd, 0xf6d: 0x34dd, 0xf6e: 0x34fd, 0xf6f: 0x351d,\n\t0xf70: 0x353d, 0xf71: 0x355d, 0xf72: 0x357d, 0xf73: 0x359d, 0xf74: 0x35bd, 0xf75: 0x35dd,\n\t0xf76: 0x35fd, 0xf77: 0x361d, 0xf78: 0x363d, 0xf79: 0x365d, 0xf7a: 0x367d, 0xf7b: 0x369d,\n\t0xf7c: 0x38c9, 0xf7d: 0x3901, 0xf7e: 0x36bd, 0xf7f: 0x0018,\n\t// Block 0x3e, offset 0xf80\n\t0xf80: 0x36dd, 0xf81: 0x36fd, 0xf82: 0x371d, 0xf83: 0x373d, 0xf84: 0x375d, 0xf85: 0x377d,\n\t0xf86: 0x379d, 0xf87: 0x37bd, 0xf88: 0x37dd, 0xf89: 0x37fd, 0xf8a: 0x381d, 0xf8b: 0x383d,\n\t0xf8c: 0x385d, 0xf8d: 0x387d, 0xf8e: 0x389d, 0xf8f: 0x38bd, 0xf90: 0x38dd, 0xf91: 0x38fd,\n\t0xf92: 0x391d, 0xf93: 0x393d, 0xf94: 0x395d, 0xf95: 0x397d, 0xf96: 0x399d, 0xf97: 0x39bd,\n\t0xf98: 0x39dd, 0xf99: 0x39fd, 0xf9a: 0x3a1d, 0xf9b: 0x3a3d, 0xf9c: 0x3a5d, 0xf9d: 0x3a7d,\n\t0xf9e: 0x3a9d, 0xf9f: 0x3abd, 0xfa0: 0x3add, 0xfa1: 0x3afd, 0xfa2: 0x3b1d, 0xfa3: 0x3b3d,\n\t0xfa4: 0x3b5d, 0xfa5: 0x3b7d, 0xfa6: 0x127d, 0xfa7: 0x3b9d, 0xfa8: 0x3bbd, 0xfa9: 0x3bdd,\n\t0xfaa: 0x3bfd, 0xfab: 0x3c1d, 0xfac: 0x3c3d, 0xfad: 0x3c5d, 0xfae: 0x239d, 0xfaf: 0x3c7d,\n\t0xfb0: 0x3c9d, 0xfb1: 0x3939, 0xfb2: 0x3951, 0xfb3: 0x3969, 0xfb4: 0x3981, 0xfb5: 0x3999,\n\t0xfb6: 0x39b1, 0xfb7: 0x39c9, 0xfb8: 0x39e1, 0xfb9: 0x39f9, 0xfba: 0x3a11, 0xfbb: 0x3a29,\n\t0xfbc: 0x3a41, 0xfbd: 0x3a59, 0xfbe: 0x3a71, 0xfbf: 0x3a89,\n\t// Block 0x3f, offset 0xfc0\n\t0xfc0: 0x3aa1, 0xfc1: 0x3ac9, 0xfc2: 0x3af1, 0xfc3: 0x3b19, 0xfc4: 0x3b41, 0xfc5: 0x3b69,\n\t0xfc6: 0x3b91, 0xfc7: 0x3bb9, 0xfc8: 0x3be1, 0xfc9: 0x3c09, 0xfca: 0x3c39, 0xfcb: 0x3c69,\n\t0xfcc: 0x3c99, 0xfcd: 0x3cbd, 0xfce: 0x3cb1, 0xfcf: 0x3cdd, 0xfd0: 0x3cfd, 0xfd1: 0x3d15,\n\t0xfd2: 0x3d2d, 0xfd3: 0x3d45, 0xfd4: 0x3d5d, 0xfd5: 0x3d5d, 0xfd6: 0x3d45, 0xfd7: 0x3d75,\n\t0xfd8: 0x07bd, 0xfd9: 0x3d8d, 0xfda: 0x3da5, 0xfdb: 0x3dbd, 0xfdc: 0x3dd5, 0xfdd: 0x3ded,\n\t0xfde: 0x3e05, 0xfdf: 0x3e1d, 0xfe0: 0x3e35, 0xfe1: 0x3e4d, 0xfe2: 0x3e65, 0xfe3: 0x3e7d,\n\t0xfe4: 0x3e95, 0xfe5: 0x3e95, 0xfe6: 0x3ead, 0xfe7: 0x3ead, 0xfe8: 0x3ec5, 0xfe9: 0x3ec5,\n\t0xfea: 0x3edd, 0xfeb: 0x3ef5, 0xfec: 0x3f0d, 0xfed: 0x3f25, 0xfee: 0x3f3d, 0xfef: 0x3f3d,\n\t0xff0: 0x3f55, 0xff1: 0x3f55, 0xff2: 0x3f55, 0xff3: 0x3f6d, 0xff4: 0x3f85, 0xff5: 0x3f9d,\n\t0xff6: 0x3fb5, 0xff7: 0x3f9d, 0xff8: 0x3fcd, 0xff9: 0x3fe5, 0xffa: 0x3f6d, 0xffb: 0x3ffd,\n\t0xffc: 0x4015, 0xffd: 0x4015, 0xffe: 0x4015, 0xfff: 0x0040,\n\t// Block 0x40, offset 0x1000\n\t0x1000: 0x3cc9, 0x1001: 0x3d31, 0x1002: 0x3d99, 0x1003: 0x3e01, 0x1004: 0x3e51, 0x1005: 0x3eb9,\n\t0x1006: 0x3f09, 0x1007: 0x3f59, 0x1008: 0x3fd9, 0x1009: 0x4041, 0x100a: 0x4091, 0x100b: 0x40e1,\n\t0x100c: 0x4131, 0x100d: 0x4199, 0x100e: 0x4201, 0x100f: 0x4251, 0x1010: 0x42a1, 0x1011: 0x42d9,\n\t0x1012: 0x4329, 0x1013: 0x4391, 0x1014: 0x43f9, 0x1015: 0x4431, 0x1016: 0x44b1, 0x1017: 0x4549,\n\t0x1018: 0x45c9, 0x1019: 0x4619, 0x101a: 0x4699, 0x101b: 0x4719, 0x101c: 0x4781, 0x101d: 0x47d1,\n\t0x101e: 0x4821, 0x101f: 0x4871, 0x1020: 0x48d9, 0x1021: 0x4959, 0x1022: 0x49c1, 0x1023: 0x4a11,\n\t0x1024: 0x4a61, 0x1025: 0x4ab1, 0x1026: 0x4ae9, 0x1027: 0x4b21, 0x1028: 0x4b59, 0x1029: 0x4b91,\n\t0x102a: 0x4be1, 0x102b: 0x4c31, 0x102c: 0x4cb1, 0x102d: 0x4d01, 0x102e: 0x4d69, 0x102f: 0x4de9,\n\t0x1030: 0x4e39, 0x1031: 0x4e71, 0x1032: 0x4ea9, 0x1033: 0x4f29, 0x1034: 0x4f91, 0x1035: 0x5011,\n\t0x1036: 0x5061, 0x1037: 0x50e1, 0x1038: 0x5119, 0x1039: 0x5169, 0x103a: 0x51b9, 0x103b: 0x5209,\n\t0x103c: 0x5259, 0x103d: 0x52a9, 0x103e: 0x5311, 0x103f: 0x5361,\n\t// Block 0x41, offset 0x1040\n\t0x1040: 0x5399, 0x1041: 0x53e9, 0x1042: 0x5439, 0x1043: 0x5489, 0x1044: 0x54f1, 0x1045: 0x5541,\n\t0x1046: 0x5591, 0x1047: 0x55e1, 0x1048: 0x5661, 0x1049: 0x56c9, 0x104a: 0x5701, 0x104b: 0x5781,\n\t0x104c: 0x57b9, 0x104d: 0x5821, 0x104e: 0x5889, 0x104f: 0x58d9, 0x1050: 0x5929, 0x1051: 0x5979,\n\t0x1052: 0x59e1, 0x1053: 0x5a19, 0x1054: 0x5a69, 0x1055: 0x5ad1, 0x1056: 0x5b09, 0x1057: 0x5b89,\n\t0x1058: 0x5bd9, 0x1059: 0x5c01, 0x105a: 0x5c29, 0x105b: 0x5c51, 0x105c: 0x5c79, 0x105d: 0x5ca1,\n\t0x105e: 0x5cc9, 0x105f: 0x5cf1, 0x1060: 0x5d19, 0x1061: 0x5d41, 0x1062: 0x5d69, 0x1063: 0x5d99,\n\t0x1064: 0x5dc9, 0x1065: 0x5df9, 0x1066: 0x5e29, 0x1067: 0x5e59, 0x1068: 0x5e89, 0x1069: 0x5eb9,\n\t0x106a: 0x5ee9, 0x106b: 0x5f19, 0x106c: 0x5f49, 0x106d: 0x5f79, 0x106e: 0x5fa9, 0x106f: 0x5fd9,\n\t0x1070: 0x6009, 0x1071: 0x402d, 0x1072: 0x6039, 0x1073: 0x6051, 0x1074: 0x404d, 0x1075: 0x6069,\n\t0x1076: 0x6081, 0x1077: 0x6099, 0x1078: 0x406d, 0x1079: 0x406d, 0x107a: 0x60b1, 0x107b: 0x60c9,\n\t0x107c: 0x6101, 0x107d: 0x6139, 0x107e: 0x6171, 0x107f: 0x61a9,\n\t// Block 0x42, offset 0x1080\n\t0x1080: 0x6211, 0x1081: 0x6229, 0x1082: 0x408d, 0x1083: 0x6241, 0x1084: 0x6259, 0x1085: 0x6271,\n\t0x1086: 0x6289, 0x1087: 0x62a1, 0x1088: 0x40ad, 0x1089: 0x62b9, 0x108a: 0x62e1, 0x108b: 0x62f9,\n\t0x108c: 0x40cd, 0x108d: 0x40cd, 0x108e: 0x6311, 0x108f: 0x6329, 0x1090: 0x6341, 0x1091: 0x40ed,\n\t0x1092: 0x410d, 0x1093: 0x412d, 0x1094: 0x414d, 0x1095: 0x416d, 0x1096: 0x6359, 0x1097: 0x6371,\n\t0x1098: 0x6389, 0x1099: 0x63a1, 0x109a: 0x63b9, 0x109b: 0x418d, 0x109c: 0x63d1, 0x109d: 0x63e9,\n\t0x109e: 0x6401, 0x109f: 0x41ad, 0x10a0: 0x41cd, 0x10a1: 0x6419, 0x10a2: 0x41ed, 0x10a3: 0x420d,\n\t0x10a4: 0x422d, 0x10a5: 0x6431, 0x10a6: 0x424d, 0x10a7: 0x6449, 0x10a8: 0x6479, 0x10a9: 0x6211,\n\t0x10aa: 0x426d, 0x10ab: 0x428d, 0x10ac: 0x42ad, 0x10ad: 0x42cd, 0x10ae: 0x64b1, 0x10af: 0x64f1,\n\t0x10b0: 0x6539, 0x10b1: 0x6551, 0x10b2: 0x42ed, 0x10b3: 0x6569, 0x10b4: 0x6581, 0x10b5: 0x6599,\n\t0x10b6: 0x430d, 0x10b7: 0x65b1, 0x10b8: 0x65c9, 0x10b9: 0x65b1, 0x10ba: 0x65e1, 0x10bb: 0x65f9,\n\t0x10bc: 0x432d, 0x10bd: 0x6611, 0x10be: 0x6629, 0x10bf: 0x6611,\n\t// Block 0x43, offset 0x10c0\n\t0x10c0: 0x434d, 0x10c1: 0x436d, 0x10c2: 0x0040, 0x10c3: 0x6641, 0x10c4: 0x6659, 0x10c5: 0x6671,\n\t0x10c6: 0x6689, 0x10c7: 0x0040, 0x10c8: 0x66c1, 0x10c9: 0x66d9, 0x10ca: 0x66f1, 0x10cb: 0x6709,\n\t0x10cc: 0x6721, 0x10cd: 0x6739, 0x10ce: 0x6401, 0x10cf: 0x6751, 0x10d0: 0x6769, 0x10d1: 0x6781,\n\t0x10d2: 0x438d, 0x10d3: 0x6799, 0x10d4: 0x6289, 0x10d5: 0x43ad, 0x10d6: 0x43cd, 0x10d7: 0x67b1,\n\t0x10d8: 0x0040, 0x10d9: 0x43ed, 0x10da: 0x67c9, 0x10db: 0x67e1, 0x10dc: 0x67f9, 0x10dd: 0x6811,\n\t0x10de: 0x6829, 0x10df: 0x6859, 0x10e0: 0x6889, 0x10e1: 0x68b1, 0x10e2: 0x68d9, 0x10e3: 0x6901,\n\t0x10e4: 0x6929, 0x10e5: 0x6951, 0x10e6: 0x6979, 0x10e7: 0x69a1, 0x10e8: 0x69c9, 0x10e9: 0x69f1,\n\t0x10ea: 0x6a21, 0x10eb: 0x6a51, 0x10ec: 0x6a81, 0x10ed: 0x6ab1, 0x10ee: 0x6ae1, 0x10ef: 0x6b11,\n\t0x10f0: 0x6b41, 0x10f1: 0x6b71, 0x10f2: 0x6ba1, 0x10f3: 0x6bd1, 0x10f4: 0x6c01, 0x10f5: 0x6c31,\n\t0x10f6: 0x6c61, 0x10f7: 0x6c91, 0x10f8: 0x6cc1, 0x10f9: 0x6cf1, 0x10fa: 0x6d21, 0x10fb: 0x6d51,\n\t0x10fc: 0x6d81, 0x10fd: 0x6db1, 0x10fe: 0x6de1, 0x10ff: 0x440d,\n\t// Block 0x44, offset 0x1100\n\t0x1100: 0xe00d, 0x1101: 0x0008, 0x1102: 0xe00d, 0x1103: 0x0008, 0x1104: 0xe00d, 0x1105: 0x0008,\n\t0x1106: 0xe00d, 0x1107: 0x0008, 0x1108: 0xe00d, 0x1109: 0x0008, 0x110a: 0xe00d, 0x110b: 0x0008,\n\t0x110c: 0xe00d, 0x110d: 0x0008, 0x110e: 0xe00d, 0x110f: 0x0008, 0x1110: 0xe00d, 0x1111: 0x0008,\n\t0x1112: 0xe00d, 0x1113: 0x0008, 0x1114: 0xe00d, 0x1115: 0x0008, 0x1116: 0xe00d, 0x1117: 0x0008,\n\t0x1118: 0xe00d, 0x1119: 0x0008, 0x111a: 0xe00d, 0x111b: 0x0008, 0x111c: 0xe00d, 0x111d: 0x0008,\n\t0x111e: 0xe00d, 0x111f: 0x0008, 0x1120: 0xe00d, 0x1121: 0x0008, 0x1122: 0xe00d, 0x1123: 0x0008,\n\t0x1124: 0xe00d, 0x1125: 0x0008, 0x1126: 0xe00d, 0x1127: 0x0008, 0x1128: 0xe00d, 0x1129: 0x0008,\n\t0x112a: 0xe00d, 0x112b: 0x0008, 0x112c: 0xe00d, 0x112d: 0x0008, 0x112e: 0x0008, 0x112f: 0x3308,\n\t0x1130: 0x3318, 0x1131: 0x3318, 0x1132: 0x3318, 0x1133: 0x0018, 0x1134: 0x3308, 0x1135: 0x3308,\n\t0x1136: 0x3308, 0x1137: 0x3308, 0x1138: 0x3308, 0x1139: 0x3308, 0x113a: 0x3308, 0x113b: 0x3308,\n\t0x113c: 0x3308, 0x113d: 0x3308, 0x113e: 0x0018, 0x113f: 0x0008,\n\t// Block 0x45, offset 0x1140\n\t0x1140: 0xe00d, 0x1141: 0x0008, 0x1142: 0xe00d, 0x1143: 0x0008, 0x1144: 0xe00d, 0x1145: 0x0008,\n\t0x1146: 0xe00d, 0x1147: 0x0008, 0x1148: 0xe00d, 0x1149: 0x0008, 0x114a: 0xe00d, 0x114b: 0x0008,\n\t0x114c: 0xe00d, 0x114d: 0x0008, 0x114e: 0xe00d, 0x114f: 0x0008, 0x1150: 0xe00d, 0x1151: 0x0008,\n\t0x1152: 0xe00d, 0x1153: 0x0008, 0x1154: 0xe00d, 0x1155: 0x0008, 0x1156: 0xe00d, 0x1157: 0x0008,\n\t0x1158: 0xe00d, 0x1159: 0x0008, 0x115a: 0xe00d, 0x115b: 0x0008, 0x115c: 0x0ea1, 0x115d: 0x6e11,\n\t0x115e: 0x3308, 0x115f: 0x3308, 0x1160: 0x0008, 0x1161: 0x0008, 0x1162: 0x0008, 0x1163: 0x0008,\n\t0x1164: 0x0008, 0x1165: 0x0008, 0x1166: 0x0008, 0x1167: 0x0008, 0x1168: 0x0008, 0x1169: 0x0008,\n\t0x116a: 0x0008, 0x116b: 0x0008, 0x116c: 0x0008, 0x116d: 0x0008, 0x116e: 0x0008, 0x116f: 0x0008,\n\t0x1170: 0x0008, 0x1171: 0x0008, 0x1172: 0x0008, 0x1173: 0x0008, 0x1174: 0x0008, 0x1175: 0x0008,\n\t0x1176: 0x0008, 0x1177: 0x0008, 0x1178: 0x0008, 0x1179: 0x0008, 0x117a: 0x0008, 0x117b: 0x0008,\n\t0x117c: 0x0008, 0x117d: 0x0008, 0x117e: 0x0008, 0x117f: 0x0008,\n\t// Block 0x46, offset 0x1180\n\t0x1180: 0x0018, 0x1181: 0x0018, 0x1182: 0x0018, 0x1183: 0x0018, 0x1184: 0x0018, 0x1185: 0x0018,\n\t0x1186: 0x0018, 0x1187: 0x0018, 0x1188: 0x0018, 0x1189: 0x0018, 0x118a: 0x0018, 0x118b: 0x0018,\n\t0x118c: 0x0018, 0x118d: 0x0018, 0x118e: 0x0018, 0x118f: 0x0018, 0x1190: 0x0018, 0x1191: 0x0018,\n\t0x1192: 0x0018, 0x1193: 0x0018, 0x1194: 0x0018, 0x1195: 0x0018, 0x1196: 0x0018, 0x1197: 0x0008,\n\t0x1198: 0x0008, 0x1199: 0x0008, 0x119a: 0x0008, 0x119b: 0x0008, 0x119c: 0x0008, 0x119d: 0x0008,\n\t0x119e: 0x0008, 0x119f: 0x0008, 0x11a0: 0x0018, 0x11a1: 0x0018, 0x11a2: 0xe00d, 0x11a3: 0x0008,\n\t0x11a4: 0xe00d, 0x11a5: 0x0008, 0x11a6: 0xe00d, 0x11a7: 0x0008, 0x11a8: 0xe00d, 0x11a9: 0x0008,\n\t0x11aa: 0xe00d, 0x11ab: 0x0008, 0x11ac: 0xe00d, 0x11ad: 0x0008, 0x11ae: 0xe00d, 0x11af: 0x0008,\n\t0x11b0: 0x0008, 0x11b1: 0x0008, 0x11b2: 0xe00d, 0x11b3: 0x0008, 0x11b4: 0xe00d, 0x11b5: 0x0008,\n\t0x11b6: 0xe00d, 0x11b7: 0x0008, 0x11b8: 0xe00d, 0x11b9: 0x0008, 0x11ba: 0xe00d, 0x11bb: 0x0008,\n\t0x11bc: 0xe00d, 0x11bd: 0x0008, 0x11be: 0xe00d, 0x11bf: 0x0008,\n\t// Block 0x47, offset 0x11c0\n\t0x11c0: 0xe00d, 0x11c1: 0x0008, 0x11c2: 0xe00d, 0x11c3: 0x0008, 0x11c4: 0xe00d, 0x11c5: 0x0008,\n\t0x11c6: 0xe00d, 0x11c7: 0x0008, 0x11c8: 0xe00d, 0x11c9: 0x0008, 0x11ca: 0xe00d, 0x11cb: 0x0008,\n\t0x11cc: 0xe00d, 0x11cd: 0x0008, 0x11ce: 0xe00d, 0x11cf: 0x0008, 0x11d0: 0xe00d, 0x11d1: 0x0008,\n\t0x11d2: 0xe00d, 0x11d3: 0x0008, 0x11d4: 0xe00d, 0x11d5: 0x0008, 0x11d6: 0xe00d, 0x11d7: 0x0008,\n\t0x11d8: 0xe00d, 0x11d9: 0x0008, 0x11da: 0xe00d, 0x11db: 0x0008, 0x11dc: 0xe00d, 0x11dd: 0x0008,\n\t0x11de: 0xe00d, 0x11df: 0x0008, 0x11e0: 0xe00d, 0x11e1: 0x0008, 0x11e2: 0xe00d, 0x11e3: 0x0008,\n\t0x11e4: 0xe00d, 0x11e5: 0x0008, 0x11e6: 0xe00d, 0x11e7: 0x0008, 0x11e8: 0xe00d, 0x11e9: 0x0008,\n\t0x11ea: 0xe00d, 0x11eb: 0x0008, 0x11ec: 0xe00d, 0x11ed: 0x0008, 0x11ee: 0xe00d, 0x11ef: 0x0008,\n\t0x11f0: 0xe0fd, 0x11f1: 0x0008, 0x11f2: 0x0008, 0x11f3: 0x0008, 0x11f4: 0x0008, 0x11f5: 0x0008,\n\t0x11f6: 0x0008, 0x11f7: 0x0008, 0x11f8: 0x0008, 0x11f9: 0xe01d, 0x11fa: 0x0008, 0x11fb: 0xe03d,\n\t0x11fc: 0x0008, 0x11fd: 0x442d, 0x11fe: 0xe00d, 0x11ff: 0x0008,\n\t// Block 0x48, offset 0x1200\n\t0x1200: 0xe00d, 0x1201: 0x0008, 0x1202: 0xe00d, 0x1203: 0x0008, 0x1204: 0xe00d, 0x1205: 0x0008,\n\t0x1206: 0xe00d, 0x1207: 0x0008, 0x1208: 0x0008, 0x1209: 0x0018, 0x120a: 0x0018, 0x120b: 0xe03d,\n\t0x120c: 0x0008, 0x120d: 0x11d9, 0x120e: 0x0008, 0x120f: 0x0008, 0x1210: 0xe00d, 0x1211: 0x0008,\n\t0x1212: 0xe00d, 0x1213: 0x0008, 0x1214: 0x0008, 0x1215: 0x0008, 0x1216: 0xe00d, 0x1217: 0x0008,\n\t0x1218: 0xe00d, 0x1219: 0x0008, 0x121a: 0xe00d, 0x121b: 0x0008, 0x121c: 0xe00d, 0x121d: 0x0008,\n\t0x121e: 0xe00d, 0x121f: 0x0008, 0x1220: 0xe00d, 0x1221: 0x0008, 0x1222: 0xe00d, 0x1223: 0x0008,\n\t0x1224: 0xe00d, 0x1225: 0x0008, 0x1226: 0xe00d, 0x1227: 0x0008, 0x1228: 0xe00d, 0x1229: 0x0008,\n\t0x122a: 0x6e29, 0x122b: 0x1029, 0x122c: 0x11c1, 0x122d: 0x6e41, 0x122e: 0x1221, 0x122f: 0x0008,\n\t0x1230: 0x6e59, 0x1231: 0x6e71, 0x1232: 0x1239, 0x1233: 0x444d, 0x1234: 0xe00d, 0x1235: 0x0008,\n\t0x1236: 0xe00d, 0x1237: 0x0008, 0x1238: 0x0040, 0x1239: 0x0008, 0x123a: 0x0040, 0x123b: 0x0040,\n\t0x123c: 0x0040, 0x123d: 0x0040, 0x123e: 0x0040, 0x123f: 0x0040,\n\t// Block 0x49, offset 0x1240\n\t0x1240: 0x64d5, 0x1241: 0x64f5, 0x1242: 0x6515, 0x1243: 0x6535, 0x1244: 0x6555, 0x1245: 0x6575,\n\t0x1246: 0x6595, 0x1247: 0x65b5, 0x1248: 0x65d5, 0x1249: 0x65f5, 0x124a: 0x6615, 0x124b: 0x6635,\n\t0x124c: 0x6655, 0x124d: 0x6675, 0x124e: 0x0008, 0x124f: 0x0008, 0x1250: 0x6695, 0x1251: 0x0008,\n\t0x1252: 0x66b5, 0x1253: 0x0008, 0x1254: 0x0008, 0x1255: 0x66d5, 0x1256: 0x66f5, 0x1257: 0x6715,\n\t0x1258: 0x6735, 0x1259: 0x6755, 0x125a: 0x6775, 0x125b: 0x6795, 0x125c: 0x67b5, 0x125d: 0x67d5,\n\t0x125e: 0x67f5, 0x125f: 0x0008, 0x1260: 0x6815, 0x1261: 0x0008, 0x1262: 0x6835, 0x1263: 0x0008,\n\t0x1264: 0x0008, 0x1265: 0x6855, 0x1266: 0x6875, 0x1267: 0x0008, 0x1268: 0x0008, 0x1269: 0x0008,\n\t0x126a: 0x6895, 0x126b: 0x68b5, 0x126c: 0x68d5, 0x126d: 0x68f5, 0x126e: 0x6915, 0x126f: 0x6935,\n\t0x1270: 0x6955, 0x1271: 0x6975, 0x1272: 0x6995, 0x1273: 0x69b5, 0x1274: 0x69d5, 0x1275: 0x69f5,\n\t0x1276: 0x6a15, 0x1277: 0x6a35, 0x1278: 0x6a55, 0x1279: 0x6a75, 0x127a: 0x6a95, 0x127b: 0x6ab5,\n\t0x127c: 0x6ad5, 0x127d: 0x6af5, 0x127e: 0x6b15, 0x127f: 0x6b35,\n\t// Block 0x4a, offset 0x1280\n\t0x1280: 0x7a95, 0x1281: 0x7ab5, 0x1282: 0x7ad5, 0x1283: 0x7af5, 0x1284: 0x7b15, 0x1285: 0x7b35,\n\t0x1286: 0x7b55, 0x1287: 0x7b75, 0x1288: 0x7b95, 0x1289: 0x7bb5, 0x128a: 0x7bd5, 0x128b: 0x7bf5,\n\t0x128c: 0x7c15, 0x128d: 0x7c35, 0x128e: 0x7c55, 0x128f: 0x6ec9, 0x1290: 0x6ef1, 0x1291: 0x6f19,\n\t0x1292: 0x7c75, 0x1293: 0x7c95, 0x1294: 0x7cb5, 0x1295: 0x6f41, 0x1296: 0x6f69, 0x1297: 0x6f91,\n\t0x1298: 0x7cd5, 0x1299: 0x7cf5, 0x129a: 0x0040, 0x129b: 0x0040, 0x129c: 0x0040, 0x129d: 0x0040,\n\t0x129e: 0x0040, 0x129f: 0x0040, 0x12a0: 0x0040, 0x12a1: 0x0040, 0x12a2: 0x0040, 0x12a3: 0x0040,\n\t0x12a4: 0x0040, 0x12a5: 0x0040, 0x12a6: 0x0040, 0x12a7: 0x0040, 0x12a8: 0x0040, 0x12a9: 0x0040,\n\t0x12aa: 0x0040, 0x12ab: 0x0040, 0x12ac: 0x0040, 0x12ad: 0x0040, 0x12ae: 0x0040, 0x12af: 0x0040,\n\t0x12b0: 0x0040, 0x12b1: 0x0040, 0x12b2: 0x0040, 0x12b3: 0x0040, 0x12b4: 0x0040, 0x12b5: 0x0040,\n\t0x12b6: 0x0040, 0x12b7: 0x0040, 0x12b8: 0x0040, 0x12b9: 0x0040, 0x12ba: 0x0040, 0x12bb: 0x0040,\n\t0x12bc: 0x0040, 0x12bd: 0x0040, 0x12be: 0x0040, 0x12bf: 0x0040,\n\t// Block 0x4b, offset 0x12c0\n\t0x12c0: 0x6fb9, 0x12c1: 0x6fd1, 0x12c2: 0x6fe9, 0x12c3: 0x7d15, 0x12c4: 0x7d35, 0x12c5: 0x7001,\n\t0x12c6: 0x7001, 0x12c7: 0x0040, 0x12c8: 0x0040, 0x12c9: 0x0040, 0x12ca: 0x0040, 0x12cb: 0x0040,\n\t0x12cc: 0x0040, 0x12cd: 0x0040, 0x12ce: 0x0040, 0x12cf: 0x0040, 0x12d0: 0x0040, 0x12d1: 0x0040,\n\t0x12d2: 0x0040, 0x12d3: 0x7019, 0x12d4: 0x7041, 0x12d5: 0x7069, 0x12d6: 0x7091, 0x12d7: 0x70b9,\n\t0x12d8: 0x0040, 0x12d9: 0x0040, 0x12da: 0x0040, 0x12db: 0x0040, 0x12dc: 0x0040, 0x12dd: 0x70e1,\n\t0x12de: 0x3308, 0x12df: 0x7109, 0x12e0: 0x7131, 0x12e1: 0x20a9, 0x12e2: 0x20f1, 0x12e3: 0x7149,\n\t0x12e4: 0x7161, 0x12e5: 0x7179, 0x12e6: 0x7191, 0x12e7: 0x71a9, 0x12e8: 0x71c1, 0x12e9: 0x1fb2,\n\t0x12ea: 0x71d9, 0x12eb: 0x7201, 0x12ec: 0x7229, 0x12ed: 0x7261, 0x12ee: 0x7299, 0x12ef: 0x72c1,\n\t0x12f0: 0x72e9, 0x12f1: 0x7311, 0x12f2: 0x7339, 0x12f3: 0x7361, 0x12f4: 0x7389, 0x12f5: 0x73b1,\n\t0x12f6: 0x73d9, 0x12f7: 0x0040, 0x12f8: 0x7401, 0x12f9: 0x7429, 0x12fa: 0x7451, 0x12fb: 0x7479,\n\t0x12fc: 0x74a1, 0x12fd: 0x0040, 0x12fe: 0x74c9, 0x12ff: 0x0040,\n\t// Block 0x4c, offset 0x1300\n\t0x1300: 0x74f1, 0x1301: 0x7519, 0x1302: 0x0040, 0x1303: 0x7541, 0x1304: 0x7569, 0x1305: 0x0040,\n\t0x1306: 0x7591, 0x1307: 0x75b9, 0x1308: 0x75e1, 0x1309: 0x7609, 0x130a: 0x7631, 0x130b: 0x7659,\n\t0x130c: 0x7681, 0x130d: 0x76a9, 0x130e: 0x76d1, 0x130f: 0x76f9, 0x1310: 0x7721, 0x1311: 0x7721,\n\t0x1312: 0x7739, 0x1313: 0x7739, 0x1314: 0x7739, 0x1315: 0x7739, 0x1316: 0x7751, 0x1317: 0x7751,\n\t0x1318: 0x7751, 0x1319: 0x7751, 0x131a: 0x7769, 0x131b: 0x7769, 0x131c: 0x7769, 0x131d: 0x7769,\n\t0x131e: 0x7781, 0x131f: 0x7781, 0x1320: 0x7781, 0x1321: 0x7781, 0x1322: 0x7799, 0x1323: 0x7799,\n\t0x1324: 0x7799, 0x1325: 0x7799, 0x1326: 0x77b1, 0x1327: 0x77b1, 0x1328: 0x77b1, 0x1329: 0x77b1,\n\t0x132a: 0x77c9, 0x132b: 0x77c9, 0x132c: 0x77c9, 0x132d: 0x77c9, 0x132e: 0x77e1, 0x132f: 0x77e1,\n\t0x1330: 0x77e1, 0x1331: 0x77e1, 0x1332: 0x77f9, 0x1333: 0x77f9, 0x1334: 0x77f9, 0x1335: 0x77f9,\n\t0x1336: 0x7811, 0x1337: 0x7811, 0x1338: 0x7811, 0x1339: 0x7811, 0x133a: 0x7829, 0x133b: 0x7829,\n\t0x133c: 0x7829, 0x133d: 0x7829, 0x133e: 0x7841, 0x133f: 0x7841,\n\t// Block 0x4d, offset 0x1340\n\t0x1340: 0x7841, 0x1341: 0x7841, 0x1342: 0x7859, 0x1343: 0x7859, 0x1344: 0x7871, 0x1345: 0x7871,\n\t0x1346: 0x7889, 0x1347: 0x7889, 0x1348: 0x78a1, 0x1349: 0x78a1, 0x134a: 0x78b9, 0x134b: 0x78b9,\n\t0x134c: 0x78d1, 0x134d: 0x78d1, 0x134e: 0x78e9, 0x134f: 0x78e9, 0x1350: 0x78e9, 0x1351: 0x78e9,\n\t0x1352: 0x7901, 0x1353: 0x7901, 0x1354: 0x7901, 0x1355: 0x7901, 0x1356: 0x7919, 0x1357: 0x7919,\n\t0x1358: 0x7919, 0x1359: 0x7919, 0x135a: 0x7931, 0x135b: 0x7931, 0x135c: 0x7931, 0x135d: 0x7931,\n\t0x135e: 0x7949, 0x135f: 0x7949, 0x1360: 0x7961, 0x1361: 0x7961, 0x1362: 0x7961, 0x1363: 0x7961,\n\t0x1364: 0x7979, 0x1365: 0x7979, 0x1366: 0x7991, 0x1367: 0x7991, 0x1368: 0x7991, 0x1369: 0x7991,\n\t0x136a: 0x79a9, 0x136b: 0x79a9, 0x136c: 0x79a9, 0x136d: 0x79a9, 0x136e: 0x79c1, 0x136f: 0x79c1,\n\t0x1370: 0x79d9, 0x1371: 0x79d9, 0x1372: 0x0818, 0x1373: 0x0818, 0x1374: 0x0818, 0x1375: 0x0818,\n\t0x1376: 0x0818, 0x1377: 0x0818, 0x1378: 0x0818, 0x1379: 0x0818, 0x137a: 0x0818, 0x137b: 0x0818,\n\t0x137c: 0x0818, 0x137d: 0x0818, 0x137e: 0x0818, 0x137f: 0x0818,\n\t// Block 0x4e, offset 0x1380\n\t0x1380: 0x0818, 0x1381: 0x0818, 0x1382: 0x0040, 0x1383: 0x0040, 0x1384: 0x0040, 0x1385: 0x0040,\n\t0x1386: 0x0040, 0x1387: 0x0040, 0x1388: 0x0040, 0x1389: 0x0040, 0x138a: 0x0040, 0x138b: 0x0040,\n\t0x138c: 0x0040, 0x138d: 0x0040, 0x138e: 0x0040, 0x138f: 0x0040, 0x1390: 0x0040, 0x1391: 0x0040,\n\t0x1392: 0x0040, 0x1393: 0x79f1, 0x1394: 0x79f1, 0x1395: 0x79f1, 0x1396: 0x79f1, 0x1397: 0x7a09,\n\t0x1398: 0x7a09, 0x1399: 0x7a21, 0x139a: 0x7a21, 0x139b: 0x7a39, 0x139c: 0x7a39, 0x139d: 0x0479,\n\t0x139e: 0x7a51, 0x139f: 0x7a51, 0x13a0: 0x7a69, 0x13a1: 0x7a69, 0x13a2: 0x7a81, 0x13a3: 0x7a81,\n\t0x13a4: 0x7a99, 0x13a5: 0x7a99, 0x13a6: 0x7a99, 0x13a7: 0x7a99, 0x13a8: 0x7ab1, 0x13a9: 0x7ab1,\n\t0x13aa: 0x7ac9, 0x13ab: 0x7ac9, 0x13ac: 0x7af1, 0x13ad: 0x7af1, 0x13ae: 0x7b19, 0x13af: 0x7b19,\n\t0x13b0: 0x7b41, 0x13b1: 0x7b41, 0x13b2: 0x7b69, 0x13b3: 0x7b69, 0x13b4: 0x7b91, 0x13b5: 0x7b91,\n\t0x13b6: 0x7bb9, 0x13b7: 0x7bb9, 0x13b8: 0x7bb9, 0x13b9: 0x7be1, 0x13ba: 0x7be1, 0x13bb: 0x7be1,\n\t0x13bc: 0x7c09, 0x13bd: 0x7c09, 0x13be: 0x7c09, 0x13bf: 0x7c09,\n\t// Block 0x4f, offset 0x13c0\n\t0x13c0: 0x85f9, 0x13c1: 0x8621, 0x13c2: 0x8649, 0x13c3: 0x8671, 0x13c4: 0x8699, 0x13c5: 0x86c1,\n\t0x13c6: 0x86e9, 0x13c7: 0x8711, 0x13c8: 0x8739, 0x13c9: 0x8761, 0x13ca: 0x8789, 0x13cb: 0x87b1,\n\t0x13cc: 0x87d9, 0x13cd: 0x8801, 0x13ce: 0x8829, 0x13cf: 0x8851, 0x13d0: 0x8879, 0x13d1: 0x88a1,\n\t0x13d2: 0x88c9, 0x13d3: 0x88f1, 0x13d4: 0x8919, 0x13d5: 0x8941, 0x13d6: 0x8969, 0x13d7: 0x8991,\n\t0x13d8: 0x89b9, 0x13d9: 0x89e1, 0x13da: 0x8a09, 0x13db: 0x8a31, 0x13dc: 0x8a59, 0x13dd: 0x8a81,\n\t0x13de: 0x8aaa, 0x13df: 0x8ada, 0x13e0: 0x8b0a, 0x13e1: 0x8b3a, 0x13e2: 0x8b6a, 0x13e3: 0x8b9a,\n\t0x13e4: 0x8bc9, 0x13e5: 0x8bf1, 0x13e6: 0x7c71, 0x13e7: 0x8c19, 0x13e8: 0x7be1, 0x13e9: 0x7c99,\n\t0x13ea: 0x8c41, 0x13eb: 0x8c69, 0x13ec: 0x7d39, 0x13ed: 0x8c91, 0x13ee: 0x7d61, 0x13ef: 0x7d89,\n\t0x13f0: 0x8cb9, 0x13f1: 0x8ce1, 0x13f2: 0x7e29, 0x13f3: 0x8d09, 0x13f4: 0x7e51, 0x13f5: 0x7e79,\n\t0x13f6: 0x8d31, 0x13f7: 0x8d59, 0x13f8: 0x7ec9, 0x13f9: 0x8d81, 0x13fa: 0x7ef1, 0x13fb: 0x7f19,\n\t0x13fc: 0x83a1, 0x13fd: 0x83c9, 0x13fe: 0x8441, 0x13ff: 0x8469,\n\t// Block 0x50, offset 0x1400\n\t0x1400: 0x8491, 0x1401: 0x8531, 0x1402: 0x8559, 0x1403: 0x8581, 0x1404: 0x85a9, 0x1405: 0x8649,\n\t0x1406: 0x8671, 0x1407: 0x8699, 0x1408: 0x8da9, 0x1409: 0x8739, 0x140a: 0x8dd1, 0x140b: 0x8df9,\n\t0x140c: 0x8829, 0x140d: 0x8e21, 0x140e: 0x8851, 0x140f: 0x8879, 0x1410: 0x8a81, 0x1411: 0x8e49,\n\t0x1412: 0x8e71, 0x1413: 0x89b9, 0x1414: 0x8e99, 0x1415: 0x89e1, 0x1416: 0x8a09, 0x1417: 0x7c21,\n\t0x1418: 0x7c49, 0x1419: 0x8ec1, 0x141a: 0x7c71, 0x141b: 0x8ee9, 0x141c: 0x7cc1, 0x141d: 0x7ce9,\n\t0x141e: 0x7d11, 0x141f: 0x7d39, 0x1420: 0x8f11, 0x1421: 0x7db1, 0x1422: 0x7dd9, 0x1423: 0x7e01,\n\t0x1424: 0x7e29, 0x1425: 0x8f39, 0x1426: 0x7ec9, 0x1427: 0x7f41, 0x1428: 0x7f69, 0x1429: 0x7f91,\n\t0x142a: 0x7fb9, 0x142b: 0x7fe1, 0x142c: 0x8031, 0x142d: 0x8059, 0x142e: 0x8081, 0x142f: 0x80a9,\n\t0x1430: 0x80d1, 0x1431: 0x80f9, 0x1432: 0x8f61, 0x1433: 0x8121, 0x1434: 0x8149, 0x1435: 0x8171,\n\t0x1436: 0x8199, 0x1437: 0x81c1, 0x1438: 0x81e9, 0x1439: 0x8239, 0x143a: 0x8261, 0x143b: 0x8289,\n\t0x143c: 0x82b1, 0x143d: 0x82d9, 0x143e: 0x8301, 0x143f: 0x8329,\n\t// Block 0x51, offset 0x1440\n\t0x1440: 0x8351, 0x1441: 0x8379, 0x1442: 0x83f1, 0x1443: 0x8419, 0x1444: 0x84b9, 0x1445: 0x84e1,\n\t0x1446: 0x8509, 0x1447: 0x8531, 0x1448: 0x8559, 0x1449: 0x85d1, 0x144a: 0x85f9, 0x144b: 0x8621,\n\t0x144c: 0x8649, 0x144d: 0x8f89, 0x144e: 0x86c1, 0x144f: 0x86e9, 0x1450: 0x8711, 0x1451: 0x8739,\n\t0x1452: 0x87b1, 0x1453: 0x87d9, 0x1454: 0x8801, 0x1455: 0x8829, 0x1456: 0x8fb1, 0x1457: 0x88a1,\n\t0x1458: 0x88c9, 0x1459: 0x8fd9, 0x145a: 0x8941, 0x145b: 0x8969, 0x145c: 0x8991, 0x145d: 0x89b9,\n\t0x145e: 0x9001, 0x145f: 0x7c71, 0x1460: 0x8ee9, 0x1461: 0x7d39, 0x1462: 0x8f11, 0x1463: 0x7e29,\n\t0x1464: 0x8f39, 0x1465: 0x7ec9, 0x1466: 0x9029, 0x1467: 0x80d1, 0x1468: 0x9051, 0x1469: 0x9079,\n\t0x146a: 0x90a1, 0x146b: 0x8531, 0x146c: 0x8559, 0x146d: 0x8649, 0x146e: 0x8829, 0x146f: 0x8fb1,\n\t0x1470: 0x89b9, 0x1471: 0x9001, 0x1472: 0x90c9, 0x1473: 0x9101, 0x1474: 0x9139, 0x1475: 0x9171,\n\t0x1476: 0x9199, 0x1477: 0x91c1, 0x1478: 0x91e9, 0x1479: 0x9211, 0x147a: 0x9239, 0x147b: 0x9261,\n\t0x147c: 0x9289, 0x147d: 0x92b1, 0x147e: 0x92d9, 0x147f: 0x9301,\n\t// Block 0x52, offset 0x1480\n\t0x1480: 0x9329, 0x1481: 0x9351, 0x1482: 0x9379, 0x1483: 0x93a1, 0x1484: 0x93c9, 0x1485: 0x93f1,\n\t0x1486: 0x9419, 0x1487: 0x9441, 0x1488: 0x9469, 0x1489: 0x9491, 0x148a: 0x94b9, 0x148b: 0x94e1,\n\t0x148c: 0x9079, 0x148d: 0x9509, 0x148e: 0x9531, 0x148f: 0x9559, 0x1490: 0x9581, 0x1491: 0x9171,\n\t0x1492: 0x9199, 0x1493: 0x91c1, 0x1494: 0x91e9, 0x1495: 0x9211, 0x1496: 0x9239, 0x1497: 0x9261,\n\t0x1498: 0x9289, 0x1499: 0x92b1, 0x149a: 0x92d9, 0x149b: 0x9301, 0x149c: 0x9329, 0x149d: 0x9351,\n\t0x149e: 0x9379, 0x149f: 0x93a1, 0x14a0: 0x93c9, 0x14a1: 0x93f1, 0x14a2: 0x9419, 0x14a3: 0x9441,\n\t0x14a4: 0x9469, 0x14a5: 0x9491, 0x14a6: 0x94b9, 0x14a7: 0x94e1, 0x14a8: 0x9079, 0x14a9: 0x9509,\n\t0x14aa: 0x9531, 0x14ab: 0x9559, 0x14ac: 0x9581, 0x14ad: 0x9491, 0x14ae: 0x94b9, 0x14af: 0x94e1,\n\t0x14b0: 0x9079, 0x14b1: 0x9051, 0x14b2: 0x90a1, 0x14b3: 0x8211, 0x14b4: 0x8059, 0x14b5: 0x8081,\n\t0x14b6: 0x80a9, 0x14b7: 0x9491, 0x14b8: 0x94b9, 0x14b9: 0x94e1, 0x14ba: 0x8211, 0x14bb: 0x8239,\n\t0x14bc: 0x95a9, 0x14bd: 0x95a9, 0x14be: 0x0018, 0x14bf: 0x0018,\n\t// Block 0x53, offset 0x14c0\n\t0x14c0: 0x0040, 0x14c1: 0x0040, 0x14c2: 0x0040, 0x14c3: 0x0040, 0x14c4: 0x0040, 0x14c5: 0x0040,\n\t0x14c6: 0x0040, 0x14c7: 0x0040, 0x14c8: 0x0040, 0x14c9: 0x0040, 0x14ca: 0x0040, 0x14cb: 0x0040,\n\t0x14cc: 0x0040, 0x14cd: 0x0040, 0x14ce: 0x0040, 0x14cf: 0x0040, 0x14d0: 0x95d1, 0x14d1: 0x9609,\n\t0x14d2: 0x9609, 0x14d3: 0x9641, 0x14d4: 0x9679, 0x14d5: 0x96b1, 0x14d6: 0x96e9, 0x14d7: 0x9721,\n\t0x14d8: 0x9759, 0x14d9: 0x9759, 0x14da: 0x9791, 0x14db: 0x97c9, 0x14dc: 0x9801, 0x14dd: 0x9839,\n\t0x14de: 0x9871, 0x14df: 0x98a9, 0x14e0: 0x98a9, 0x14e1: 0x98e1, 0x14e2: 0x9919, 0x14e3: 0x9919,\n\t0x14e4: 0x9951, 0x14e5: 0x9951, 0x14e6: 0x9989, 0x14e7: 0x99c1, 0x14e8: 0x99c1, 0x14e9: 0x99f9,\n\t0x14ea: 0x9a31, 0x14eb: 0x9a31, 0x14ec: 0x9a69, 0x14ed: 0x9a69, 0x14ee: 0x9aa1, 0x14ef: 0x9ad9,\n\t0x14f0: 0x9ad9, 0x14f1: 0x9b11, 0x14f2: 0x9b11, 0x14f3: 0x9b49, 0x14f4: 0x9b81, 0x14f5: 0x9bb9,\n\t0x14f6: 0x9bf1, 0x14f7: 0x9bf1, 0x14f8: 0x9c29, 0x14f9: 0x9c61, 0x14fa: 0x9c99, 0x14fb: 0x9cd1,\n\t0x14fc: 0x9d09, 0x14fd: 0x9d09, 0x14fe: 0x9d41, 0x14ff: 0x9d79,\n\t// Block 0x54, offset 0x1500\n\t0x1500: 0xa949, 0x1501: 0xa981, 0x1502: 0xa9b9, 0x1503: 0xa8a1, 0x1504: 0x9bb9, 0x1505: 0x9989,\n\t0x1506: 0xa9f1, 0x1507: 0xaa29, 0x1508: 0x0040, 0x1509: 0x0040, 0x150a: 0x0040, 0x150b: 0x0040,\n\t0x150c: 0x0040, 0x150d: 0x0040, 0x150e: 0x0040, 0x150f: 0x0040, 0x1510: 0x0040, 0x1511: 0x0040,\n\t0x1512: 0x0040, 0x1513: 0x0040, 0x1514: 0x0040, 0x1515: 0x0040, 0x1516: 0x0040, 0x1517: 0x0040,\n\t0x1518: 0x0040, 0x1519: 0x0040, 0x151a: 0x0040, 0x151b: 0x0040, 0x151c: 0x0040, 0x151d: 0x0040,\n\t0x151e: 0x0040, 0x151f: 0x0040, 0x1520: 0x0040, 0x1521: 0x0040, 0x1522: 0x0040, 0x1523: 0x0040,\n\t0x1524: 0x0040, 0x1525: 0x0040, 0x1526: 0x0040, 0x1527: 0x0040, 0x1528: 0x0040, 0x1529: 0x0040,\n\t0x152a: 0x0040, 0x152b: 0x0040, 0x152c: 0x0040, 0x152d: 0x0040, 0x152e: 0x0040, 0x152f: 0x0040,\n\t0x1530: 0xaa61, 0x1531: 0xaa99, 0x1532: 0xaad1, 0x1533: 0xab19, 0x1534: 0xab61, 0x1535: 0xaba9,\n\t0x1536: 0xabf1, 0x1537: 0xac39, 0x1538: 0xac81, 0x1539: 0xacc9, 0x153a: 0xad02, 0x153b: 0xae12,\n\t0x153c: 0xae91, 0x153d: 0x0018, 0x153e: 0x0040, 0x153f: 0x0040,\n\t// Block 0x55, offset 0x1540\n\t0x1540: 0x33c0, 0x1541: 0x33c0, 0x1542: 0x33c0, 0x1543: 0x33c0, 0x1544: 0x33c0, 0x1545: 0x33c0,\n\t0x1546: 0x33c0, 0x1547: 0x33c0, 0x1548: 0x33c0, 0x1549: 0x33c0, 0x154a: 0x33c0, 0x154b: 0x33c0,\n\t0x154c: 0x33c0, 0x154d: 0x33c0, 0x154e: 0x33c0, 0x154f: 0x33c0, 0x1550: 0xaeda, 0x1551: 0x7d55,\n\t0x1552: 0x0040, 0x1553: 0xaeea, 0x1554: 0x03c2, 0x1555: 0xaefa, 0x1556: 0xaf0a, 0x1557: 0x7d75,\n\t0x1558: 0x7d95, 0x1559: 0x0040, 0x155a: 0x0040, 0x155b: 0x0040, 0x155c: 0x0040, 0x155d: 0x0040,\n\t0x155e: 0x0040, 0x155f: 0x0040, 0x1560: 0x3308, 0x1561: 0x3308, 0x1562: 0x3308, 0x1563: 0x3308,\n\t0x1564: 0x3308, 0x1565: 0x3308, 0x1566: 0x3308, 0x1567: 0x3308, 0x1568: 0x3308, 0x1569: 0x3308,\n\t0x156a: 0x3308, 0x156b: 0x3308, 0x156c: 0x3308, 0x156d: 0x3308, 0x156e: 0x3308, 0x156f: 0x3308,\n\t0x1570: 0x0040, 0x1571: 0x7db5, 0x1572: 0x7dd5, 0x1573: 0xaf1a, 0x1574: 0xaf1a, 0x1575: 0x1fd2,\n\t0x1576: 0x1fe2, 0x1577: 0xaf2a, 0x1578: 0xaf3a, 0x1579: 0x7df5, 0x157a: 0x7e15, 0x157b: 0x7e35,\n\t0x157c: 0x7df5, 0x157d: 0x7e55, 0x157e: 0x7e75, 0x157f: 0x7e55,\n\t// Block 0x56, offset 0x1580\n\t0x1580: 0x7e95, 0x1581: 0x7eb5, 0x1582: 0x7ed5, 0x1583: 0x7eb5, 0x1584: 0x7ef5, 0x1585: 0x0018,\n\t0x1586: 0x0018, 0x1587: 0xaf4a, 0x1588: 0xaf5a, 0x1589: 0x7f16, 0x158a: 0x7f36, 0x158b: 0x7f56,\n\t0x158c: 0x7f76, 0x158d: 0xaf1a, 0x158e: 0xaf1a, 0x158f: 0xaf1a, 0x1590: 0xaeda, 0x1591: 0x7f95,\n\t0x1592: 0x0040, 0x1593: 0x0040, 0x1594: 0x03c2, 0x1595: 0xaeea, 0x1596: 0xaf0a, 0x1597: 0xaefa,\n\t0x1598: 0x7fb5, 0x1599: 0x1fd2, 0x159a: 0x1fe2, 0x159b: 0xaf2a, 0x159c: 0xaf3a, 0x159d: 0x7e95,\n\t0x159e: 0x7ef5, 0x159f: 0xaf6a, 0x15a0: 0xaf7a, 0x15a1: 0xaf8a, 0x15a2: 0x1fb2, 0x15a3: 0xaf99,\n\t0x15a4: 0xafaa, 0x15a5: 0xafba, 0x15a6: 0x1fc2, 0x15a7: 0x0040, 0x15a8: 0xafca, 0x15a9: 0xafda,\n\t0x15aa: 0xafea, 0x15ab: 0xaffa, 0x15ac: 0x0040, 0x15ad: 0x0040, 0x15ae: 0x0040, 0x15af: 0x0040,\n\t0x15b0: 0x7fd6, 0x15b1: 0xb009, 0x15b2: 0x7ff6, 0x15b3: 0x0808, 0x15b4: 0x8016, 0x15b5: 0x0040,\n\t0x15b6: 0x8036, 0x15b7: 0xb031, 0x15b8: 0x8056, 0x15b9: 0xb059, 0x15ba: 0x8076, 0x15bb: 0xb081,\n\t0x15bc: 0x8096, 0x15bd: 0xb0a9, 0x15be: 0x80b6, 0x15bf: 0xb0d1,\n\t// Block 0x57, offset 0x15c0\n\t0x15c0: 0xb0f9, 0x15c1: 0xb111, 0x15c2: 0xb111, 0x15c3: 0xb129, 0x15c4: 0xb129, 0x15c5: 0xb141,\n\t0x15c6: 0xb141, 0x15c7: 0xb159, 0x15c8: 0xb159, 0x15c9: 0xb171, 0x15ca: 0xb171, 0x15cb: 0xb171,\n\t0x15cc: 0xb171, 0x15cd: 0xb189, 0x15ce: 0xb189, 0x15cf: 0xb1a1, 0x15d0: 0xb1a1, 0x15d1: 0xb1a1,\n\t0x15d2: 0xb1a1, 0x15d3: 0xb1b9, 0x15d4: 0xb1b9, 0x15d5: 0xb1d1, 0x15d6: 0xb1d1, 0x15d7: 0xb1d1,\n\t0x15d8: 0xb1d1, 0x15d9: 0xb1e9, 0x15da: 0xb1e9, 0x15db: 0xb1e9, 0x15dc: 0xb1e9, 0x15dd: 0xb201,\n\t0x15de: 0xb201, 0x15df: 0xb201, 0x15e0: 0xb201, 0x15e1: 0xb219, 0x15e2: 0xb219, 0x15e3: 0xb219,\n\t0x15e4: 0xb219, 0x15e5: 0xb231, 0x15e6: 0xb231, 0x15e7: 0xb231, 0x15e8: 0xb231, 0x15e9: 0xb249,\n\t0x15ea: 0xb249, 0x15eb: 0xb261, 0x15ec: 0xb261, 0x15ed: 0xb279, 0x15ee: 0xb279, 0x15ef: 0xb291,\n\t0x15f0: 0xb291, 0x15f1: 0xb2a9, 0x15f2: 0xb2a9, 0x15f3: 0xb2a9, 0x15f4: 0xb2a9, 0x15f5: 0xb2c1,\n\t0x15f6: 0xb2c1, 0x15f7: 0xb2c1, 0x15f8: 0xb2c1, 0x15f9: 0xb2d9, 0x15fa: 0xb2d9, 0x15fb: 0xb2d9,\n\t0x15fc: 0xb2d9, 0x15fd: 0xb2f1, 0x15fe: 0xb2f1, 0x15ff: 0xb2f1,\n\t// Block 0x58, offset 0x1600\n\t0x1600: 0xb2f1, 0x1601: 0xb309, 0x1602: 0xb309, 0x1603: 0xb309, 0x1604: 0xb309, 0x1605: 0xb321,\n\t0x1606: 0xb321, 0x1607: 0xb321, 0x1608: 0xb321, 0x1609: 0xb339, 0x160a: 0xb339, 0x160b: 0xb339,\n\t0x160c: 0xb339, 0x160d: 0xb351, 0x160e: 0xb351, 0x160f: 0xb351, 0x1610: 0xb351, 0x1611: 0xb369,\n\t0x1612: 0xb369, 0x1613: 0xb369, 0x1614: 0xb369, 0x1615: 0xb381, 0x1616: 0xb381, 0x1617: 0xb381,\n\t0x1618: 0xb381, 0x1619: 0xb399, 0x161a: 0xb399, 0x161b: 0xb399, 0x161c: 0xb399, 0x161d: 0xb3b1,\n\t0x161e: 0xb3b1, 0x161f: 0xb3b1, 0x1620: 0xb3b1, 0x1621: 0xb3c9, 0x1622: 0xb3c9, 0x1623: 0xb3c9,\n\t0x1624: 0xb3c9, 0x1625: 0xb3e1, 0x1626: 0xb3e1, 0x1627: 0xb3e1, 0x1628: 0xb3e1, 0x1629: 0xb3f9,\n\t0x162a: 0xb3f9, 0x162b: 0xb3f9, 0x162c: 0xb3f9, 0x162d: 0xb411, 0x162e: 0xb411, 0x162f: 0x7ab1,\n\t0x1630: 0x7ab1, 0x1631: 0xb429, 0x1632: 0xb429, 0x1633: 0xb429, 0x1634: 0xb429, 0x1635: 0xb441,\n\t0x1636: 0xb441, 0x1637: 0xb469, 0x1638: 0xb469, 0x1639: 0xb491, 0x163a: 0xb491, 0x163b: 0xb4b9,\n\t0x163c: 0xb4b9, 0x163d: 0x0040, 0x163e: 0x0040, 0x163f: 0x03c0,\n\t// Block 0x59, offset 0x1640\n\t0x1640: 0x0040, 0x1641: 0xaefa, 0x1642: 0xb4e2, 0x1643: 0xaf6a, 0x1644: 0xafda, 0x1645: 0xafea,\n\t0x1646: 0xaf7a, 0x1647: 0xb4f2, 0x1648: 0x1fd2, 0x1649: 0x1fe2, 0x164a: 0xaf8a, 0x164b: 0x1fb2,\n\t0x164c: 0xaeda, 0x164d: 0xaf99, 0x164e: 0x29d1, 0x164f: 0xb502, 0x1650: 0x1f41, 0x1651: 0x00c9,\n\t0x1652: 0x0069, 0x1653: 0x0079, 0x1654: 0x1f51, 0x1655: 0x1f61, 0x1656: 0x1f71, 0x1657: 0x1f81,\n\t0x1658: 0x1f91, 0x1659: 0x1fa1, 0x165a: 0xaeea, 0x165b: 0x03c2, 0x165c: 0xafaa, 0x165d: 0x1fc2,\n\t0x165e: 0xafba, 0x165f: 0xaf0a, 0x1660: 0xaffa, 0x1661: 0x0039, 0x1662: 0x0ee9, 0x1663: 0x1159,\n\t0x1664: 0x0ef9, 0x1665: 0x0f09, 0x1666: 0x1199, 0x1667: 0x0f31, 0x1668: 0x0249, 0x1669: 0x0f41,\n\t0x166a: 0x0259, 0x166b: 0x0f51, 0x166c: 0x0359, 0x166d: 0x0f61, 0x166e: 0x0f71, 0x166f: 0x00d9,\n\t0x1670: 0x0f99, 0x1671: 0x2039, 0x1672: 0x0269, 0x1673: 0x01d9, 0x1674: 0x0fa9, 0x1675: 0x0fb9,\n\t0x1676: 0x1089, 0x1677: 0x0279, 0x1678: 0x0369, 0x1679: 0x0289, 0x167a: 0x13d1, 0x167b: 0xaf4a,\n\t0x167c: 0xafca, 0x167d: 0xaf5a, 0x167e: 0xb512, 0x167f: 0xaf1a,\n\t// Block 0x5a, offset 0x1680\n\t0x1680: 0x1caa, 0x1681: 0x0039, 0x1682: 0x0ee9, 0x1683: 0x1159, 0x1684: 0x0ef9, 0x1685: 0x0f09,\n\t0x1686: 0x1199, 0x1687: 0x0f31, 0x1688: 0x0249, 0x1689: 0x0f41, 0x168a: 0x0259, 0x168b: 0x0f51,\n\t0x168c: 0x0359, 0x168d: 0x0f61, 0x168e: 0x0f71, 0x168f: 0x00d9, 0x1690: 0x0f99, 0x1691: 0x2039,\n\t0x1692: 0x0269, 0x1693: 0x01d9, 0x1694: 0x0fa9, 0x1695: 0x0fb9, 0x1696: 0x1089, 0x1697: 0x0279,\n\t0x1698: 0x0369, 0x1699: 0x0289, 0x169a: 0x13d1, 0x169b: 0xaf2a, 0x169c: 0xb522, 0x169d: 0xaf3a,\n\t0x169e: 0xb532, 0x169f: 0x80d5, 0x16a0: 0x80f5, 0x16a1: 0x29d1, 0x16a2: 0x8115, 0x16a3: 0x8115,\n\t0x16a4: 0x8135, 0x16a5: 0x8155, 0x16a6: 0x8175, 0x16a7: 0x8195, 0x16a8: 0x81b5, 0x16a9: 0x81d5,\n\t0x16aa: 0x81f5, 0x16ab: 0x8215, 0x16ac: 0x8235, 0x16ad: 0x8255, 0x16ae: 0x8275, 0x16af: 0x8295,\n\t0x16b0: 0x82b5, 0x16b1: 0x82d5, 0x16b2: 0x82f5, 0x16b3: 0x8315, 0x16b4: 0x8335, 0x16b5: 0x8355,\n\t0x16b6: 0x8375, 0x16b7: 0x8395, 0x16b8: 0x83b5, 0x16b9: 0x83d5, 0x16ba: 0x83f5, 0x16bb: 0x8415,\n\t0x16bc: 0x81b5, 0x16bd: 0x8435, 0x16be: 0x8455, 0x16bf: 0x8215,\n\t// Block 0x5b, offset 0x16c0\n\t0x16c0: 0x8475, 0x16c1: 0x8495, 0x16c2: 0x84b5, 0x16c3: 0x84d5, 0x16c4: 0x84f5, 0x16c5: 0x8515,\n\t0x16c6: 0x8535, 0x16c7: 0x8555, 0x16c8: 0x84d5, 0x16c9: 0x8575, 0x16ca: 0x84d5, 0x16cb: 0x8595,\n\t0x16cc: 0x8595, 0x16cd: 0x85b5, 0x16ce: 0x85b5, 0x16cf: 0x85d5, 0x16d0: 0x8515, 0x16d1: 0x85f5,\n\t0x16d2: 0x8615, 0x16d3: 0x85f5, 0x16d4: 0x8635, 0x16d5: 0x8615, 0x16d6: 0x8655, 0x16d7: 0x8655,\n\t0x16d8: 0x8675, 0x16d9: 0x8675, 0x16da: 0x8695, 0x16db: 0x8695, 0x16dc: 0x8615, 0x16dd: 0x8115,\n\t0x16de: 0x86b5, 0x16df: 0x86d5, 0x16e0: 0x0040, 0x16e1: 0x86f5, 0x16e2: 0x8715, 0x16e3: 0x8735,\n\t0x16e4: 0x8755, 0x16e5: 0x8735, 0x16e6: 0x8775, 0x16e7: 0x8795, 0x16e8: 0x87b5, 0x16e9: 0x87b5,\n\t0x16ea: 0x87d5, 0x16eb: 0x87d5, 0x16ec: 0x87f5, 0x16ed: 0x87f5, 0x16ee: 0x87d5, 0x16ef: 0x87d5,\n\t0x16f0: 0x8815, 0x16f1: 0x8835, 0x16f2: 0x8855, 0x16f3: 0x8875, 0x16f4: 0x8895, 0x16f5: 0x88b5,\n\t0x16f6: 0x88b5, 0x16f7: 0x88b5, 0x16f8: 0x88d5, 0x16f9: 0x88d5, 0x16fa: 0x88d5, 0x16fb: 0x88d5,\n\t0x16fc: 0x87b5, 0x16fd: 0x87b5, 0x16fe: 0x87b5, 0x16ff: 0x0040,\n\t// Block 0x5c, offset 0x1700\n\t0x1700: 0x0040, 0x1701: 0x0040, 0x1702: 0x8715, 0x1703: 0x86f5, 0x1704: 0x88f5, 0x1705: 0x86f5,\n\t0x1706: 0x8715, 0x1707: 0x86f5, 0x1708: 0x0040, 0x1709: 0x0040, 0x170a: 0x8915, 0x170b: 0x8715,\n\t0x170c: 0x8935, 0x170d: 0x88f5, 0x170e: 0x8935, 0x170f: 0x8715, 0x1710: 0x0040, 0x1711: 0x0040,\n\t0x1712: 0x8955, 0x1713: 0x8975, 0x1714: 0x8875, 0x1715: 0x8935, 0x1716: 0x88f5, 0x1717: 0x8935,\n\t0x1718: 0x0040, 0x1719: 0x0040, 0x171a: 0x8995, 0x171b: 0x89b5, 0x171c: 0x8995, 0x171d: 0x0040,\n\t0x171e: 0x0040, 0x171f: 0x0040, 0x1720: 0xb541, 0x1721: 0xb559, 0x1722: 0xb571, 0x1723: 0x89d6,\n\t0x1724: 0xb589, 0x1725: 0xb5a1, 0x1726: 0x89f5, 0x1727: 0x0040, 0x1728: 0x8a15, 0x1729: 0x8a35,\n\t0x172a: 0x8a55, 0x172b: 0x8a35, 0x172c: 0x8a75, 0x172d: 0x8a95, 0x172e: 0x8ab5, 0x172f: 0x0040,\n\t0x1730: 0x0040, 0x1731: 0x0040, 0x1732: 0x0040, 0x1733: 0x0040, 0x1734: 0x0040, 0x1735: 0x0040,\n\t0x1736: 0x0040, 0x1737: 0x0040, 0x1738: 0x0040, 0x1739: 0x0340, 0x173a: 0x0340, 0x173b: 0x0340,\n\t0x173c: 0x0040, 0x173d: 0x0040, 0x173e: 0x0040, 0x173f: 0x0040,\n\t// Block 0x5d, offset 0x1740\n\t0x1740: 0x0a08, 0x1741: 0x0a08, 0x1742: 0x0a08, 0x1743: 0x0a08, 0x1744: 0x0a08, 0x1745: 0x0c08,\n\t0x1746: 0x0808, 0x1747: 0x0c08, 0x1748: 0x0818, 0x1749: 0x0c08, 0x174a: 0x0c08, 0x174b: 0x0808,\n\t0x174c: 0x0808, 0x174d: 0x0908, 0x174e: 0x0c08, 0x174f: 0x0c08, 0x1750: 0x0c08, 0x1751: 0x0c08,\n\t0x1752: 0x0c08, 0x1753: 0x0a08, 0x1754: 0x0a08, 0x1755: 0x0a08, 0x1756: 0x0a08, 0x1757: 0x0908,\n\t0x1758: 0x0a08, 0x1759: 0x0a08, 0x175a: 0x0a08, 0x175b: 0x0a08, 0x175c: 0x0a08, 0x175d: 0x0c08,\n\t0x175e: 0x0a08, 0x175f: 0x0a08, 0x1760: 0x0a08, 0x1761: 0x0c08, 0x1762: 0x0808, 0x1763: 0x0808,\n\t0x1764: 0x0c08, 0x1765: 0x3308, 0x1766: 0x3308, 0x1767: 0x0040, 0x1768: 0x0040, 0x1769: 0x0040,\n\t0x176a: 0x0040, 0x176b: 0x0a18, 0x176c: 0x0a18, 0x176d: 0x0a18, 0x176e: 0x0a18, 0x176f: 0x0c18,\n\t0x1770: 0x0818, 0x1771: 0x0818, 0x1772: 0x0818, 0x1773: 0x0818, 0x1774: 0x0818, 0x1775: 0x0818,\n\t0x1776: 0x0818, 0x1777: 0x0040, 0x1778: 0x0040, 0x1779: 0x0040, 0x177a: 0x0040, 0x177b: 0x0040,\n\t0x177c: 0x0040, 0x177d: 0x0040, 0x177e: 0x0040, 0x177f: 0x0040,\n\t// Block 0x5e, offset 0x1780\n\t0x1780: 0x0a08, 0x1781: 0x0c08, 0x1782: 0x0a08, 0x1783: 0x0c08, 0x1784: 0x0c08, 0x1785: 0x0c08,\n\t0x1786: 0x0a08, 0x1787: 0x0a08, 0x1788: 0x0a08, 0x1789: 0x0c08, 0x178a: 0x0a08, 0x178b: 0x0a08,\n\t0x178c: 0x0c08, 0x178d: 0x0a08, 0x178e: 0x0c08, 0x178f: 0x0c08, 0x1790: 0x0a08, 0x1791: 0x0c08,\n\t0x1792: 0x0040, 0x1793: 0x0040, 0x1794: 0x0040, 0x1795: 0x0040, 0x1796: 0x0040, 0x1797: 0x0040,\n\t0x1798: 0x0040, 0x1799: 0x0818, 0x179a: 0x0818, 0x179b: 0x0818, 0x179c: 0x0818, 0x179d: 0x0040,\n\t0x179e: 0x0040, 0x179f: 0x0040, 0x17a0: 0x0040, 0x17a1: 0x0040, 0x17a2: 0x0040, 0x17a3: 0x0040,\n\t0x17a4: 0x0040, 0x17a5: 0x0040, 0x17a6: 0x0040, 0x17a7: 0x0040, 0x17a8: 0x0040, 0x17a9: 0x0c18,\n\t0x17aa: 0x0c18, 0x17ab: 0x0c18, 0x17ac: 0x0c18, 0x17ad: 0x0a18, 0x17ae: 0x0a18, 0x17af: 0x0818,\n\t0x17b0: 0x0040, 0x17b1: 0x0040, 0x17b2: 0x0040, 0x17b3: 0x0040, 0x17b4: 0x0040, 0x17b5: 0x0040,\n\t0x17b6: 0x0040, 0x17b7: 0x0040, 0x17b8: 0x0040, 0x17b9: 0x0040, 0x17ba: 0x0040, 0x17bb: 0x0040,\n\t0x17bc: 0x0040, 0x17bd: 0x0040, 0x17be: 0x0040, 0x17bf: 0x0040,\n\t// Block 0x5f, offset 0x17c0\n\t0x17c0: 0x3308, 0x17c1: 0x3308, 0x17c2: 0x3008, 0x17c3: 0x3008, 0x17c4: 0x0040, 0x17c5: 0x0008,\n\t0x17c6: 0x0008, 0x17c7: 0x0008, 0x17c8: 0x0008, 0x17c9: 0x0008, 0x17ca: 0x0008, 0x17cb: 0x0008,\n\t0x17cc: 0x0008, 0x17cd: 0x0040, 0x17ce: 0x0040, 0x17cf: 0x0008, 0x17d0: 0x0008, 0x17d1: 0x0040,\n\t0x17d2: 0x0040, 0x17d3: 0x0008, 0x17d4: 0x0008, 0x17d5: 0x0008, 0x17d6: 0x0008, 0x17d7: 0x0008,\n\t0x17d8: 0x0008, 0x17d9: 0x0008, 0x17da: 0x0008, 0x17db: 0x0008, 0x17dc: 0x0008, 0x17dd: 0x0008,\n\t0x17de: 0x0008, 0x17df: 0x0008, 0x17e0: 0x0008, 0x17e1: 0x0008, 0x17e2: 0x0008, 0x17e3: 0x0008,\n\t0x17e4: 0x0008, 0x17e5: 0x0008, 0x17e6: 0x0008, 0x17e7: 0x0008, 0x17e8: 0x0008, 0x17e9: 0x0040,\n\t0x17ea: 0x0008, 0x17eb: 0x0008, 0x17ec: 0x0008, 0x17ed: 0x0008, 0x17ee: 0x0008, 0x17ef: 0x0008,\n\t0x17f0: 0x0008, 0x17f1: 0x0040, 0x17f2: 0x0008, 0x17f3: 0x0008, 0x17f4: 0x0040, 0x17f5: 0x0008,\n\t0x17f6: 0x0008, 0x17f7: 0x0008, 0x17f8: 0x0008, 0x17f9: 0x0008, 0x17fa: 0x0040, 0x17fb: 0x3308,\n\t0x17fc: 0x3308, 0x17fd: 0x0008, 0x17fe: 0x3008, 0x17ff: 0x3008,\n\t// Block 0x60, offset 0x1800\n\t0x1800: 0x3308, 0x1801: 0x3008, 0x1802: 0x3008, 0x1803: 0x3008, 0x1804: 0x3008, 0x1805: 0x0040,\n\t0x1806: 0x0040, 0x1807: 0x3008, 0x1808: 0x3008, 0x1809: 0x0040, 0x180a: 0x0040, 0x180b: 0x3008,\n\t0x180c: 0x3008, 0x180d: 0x3808, 0x180e: 0x0040, 0x180f: 0x0040, 0x1810: 0x0008, 0x1811: 0x0040,\n\t0x1812: 0x0040, 0x1813: 0x0040, 0x1814: 0x0040, 0x1815: 0x0040, 0x1816: 0x0040, 0x1817: 0x3008,\n\t0x1818: 0x0040, 0x1819: 0x0040, 0x181a: 0x0040, 0x181b: 0x0040, 0x181c: 0x0040, 0x181d: 0x0008,\n\t0x181e: 0x0008, 0x181f: 0x0008, 0x1820: 0x0008, 0x1821: 0x0008, 0x1822: 0x3008, 0x1823: 0x3008,\n\t0x1824: 0x0040, 0x1825: 0x0040, 0x1826: 0x3308, 0x1827: 0x3308, 0x1828: 0x3308, 0x1829: 0x3308,\n\t0x182a: 0x3308, 0x182b: 0x3308, 0x182c: 0x3308, 0x182d: 0x0040, 0x182e: 0x0040, 0x182f: 0x0040,\n\t0x1830: 0x3308, 0x1831: 0x3308, 0x1832: 0x3308, 0x1833: 0x3308, 0x1834: 0x3308, 0x1835: 0x0040,\n\t0x1836: 0x0040, 0x1837: 0x0040, 0x1838: 0x0040, 0x1839: 0x0040, 0x183a: 0x0040, 0x183b: 0x0040,\n\t0x183c: 0x0040, 0x183d: 0x0040, 0x183e: 0x0040, 0x183f: 0x0040,\n\t// Block 0x61, offset 0x1840\n\t0x1840: 0x0039, 0x1841: 0x0ee9, 0x1842: 0x1159, 0x1843: 0x0ef9, 0x1844: 0x0f09, 0x1845: 0x1199,\n\t0x1846: 0x0f31, 0x1847: 0x0249, 0x1848: 0x0f41, 0x1849: 0x0259, 0x184a: 0x0f51, 0x184b: 0x0359,\n\t0x184c: 0x0f61, 0x184d: 0x0f71, 0x184e: 0x00d9, 0x184f: 0x0f99, 0x1850: 0x2039, 0x1851: 0x0269,\n\t0x1852: 0x01d9, 0x1853: 0x0fa9, 0x1854: 0x0fb9, 0x1855: 0x1089, 0x1856: 0x0279, 0x1857: 0x0369,\n\t0x1858: 0x0289, 0x1859: 0x13d1, 0x185a: 0x0039, 0x185b: 0x0ee9, 0x185c: 0x1159, 0x185d: 0x0ef9,\n\t0x185e: 0x0f09, 0x185f: 0x1199, 0x1860: 0x0f31, 0x1861: 0x0249, 0x1862: 0x0f41, 0x1863: 0x0259,\n\t0x1864: 0x0f51, 0x1865: 0x0359, 0x1866: 0x0f61, 0x1867: 0x0f71, 0x1868: 0x00d9, 0x1869: 0x0f99,\n\t0x186a: 0x2039, 0x186b: 0x0269, 0x186c: 0x01d9, 0x186d: 0x0fa9, 0x186e: 0x0fb9, 0x186f: 0x1089,\n\t0x1870: 0x0279, 0x1871: 0x0369, 0x1872: 0x0289, 0x1873: 0x13d1, 0x1874: 0x0039, 0x1875: 0x0ee9,\n\t0x1876: 0x1159, 0x1877: 0x0ef9, 0x1878: 0x0f09, 0x1879: 0x1199, 0x187a: 0x0f31, 0x187b: 0x0249,\n\t0x187c: 0x0f41, 0x187d: 0x0259, 0x187e: 0x0f51, 0x187f: 0x0359,\n\t// Block 0x62, offset 0x1880\n\t0x1880: 0x0f61, 0x1881: 0x0f71, 0x1882: 0x00d9, 0x1883: 0x0f99, 0x1884: 0x2039, 0x1885: 0x0269,\n\t0x1886: 0x01d9, 0x1887: 0x0fa9, 0x1888: 0x0fb9, 0x1889: 0x1089, 0x188a: 0x0279, 0x188b: 0x0369,\n\t0x188c: 0x0289, 0x188d: 0x13d1, 0x188e: 0x0039, 0x188f: 0x0ee9, 0x1890: 0x1159, 0x1891: 0x0ef9,\n\t0x1892: 0x0f09, 0x1893: 0x1199, 0x1894: 0x0f31, 0x1895: 0x0040, 0x1896: 0x0f41, 0x1897: 0x0259,\n\t0x1898: 0x0f51, 0x1899: 0x0359, 0x189a: 0x0f61, 0x189b: 0x0f71, 0x189c: 0x00d9, 0x189d: 0x0f99,\n\t0x189e: 0x2039, 0x189f: 0x0269, 0x18a0: 0x01d9, 0x18a1: 0x0fa9, 0x18a2: 0x0fb9, 0x18a3: 0x1089,\n\t0x18a4: 0x0279, 0x18a5: 0x0369, 0x18a6: 0x0289, 0x18a7: 0x13d1, 0x18a8: 0x0039, 0x18a9: 0x0ee9,\n\t0x18aa: 0x1159, 0x18ab: 0x0ef9, 0x18ac: 0x0f09, 0x18ad: 0x1199, 0x18ae: 0x0f31, 0x18af: 0x0249,\n\t0x18b0: 0x0f41, 0x18b1: 0x0259, 0x18b2: 0x0f51, 0x18b3: 0x0359, 0x18b4: 0x0f61, 0x18b5: 0x0f71,\n\t0x18b6: 0x00d9, 0x18b7: 0x0f99, 0x18b8: 0x2039, 0x18b9: 0x0269, 0x18ba: 0x01d9, 0x18bb: 0x0fa9,\n\t0x18bc: 0x0fb9, 0x18bd: 0x1089, 0x18be: 0x0279, 0x18bf: 0x0369,\n\t// Block 0x63, offset 0x18c0\n\t0x18c0: 0x0289, 0x18c1: 0x13d1, 0x18c2: 0x0039, 0x18c3: 0x0ee9, 0x18c4: 0x1159, 0x18c5: 0x0ef9,\n\t0x18c6: 0x0f09, 0x18c7: 0x1199, 0x18c8: 0x0f31, 0x18c9: 0x0249, 0x18ca: 0x0f41, 0x18cb: 0x0259,\n\t0x18cc: 0x0f51, 0x18cd: 0x0359, 0x18ce: 0x0f61, 0x18cf: 0x0f71, 0x18d0: 0x00d9, 0x18d1: 0x0f99,\n\t0x18d2: 0x2039, 0x18d3: 0x0269, 0x18d4: 0x01d9, 0x18d5: 0x0fa9, 0x18d6: 0x0fb9, 0x18d7: 0x1089,\n\t0x18d8: 0x0279, 0x18d9: 0x0369, 0x18da: 0x0289, 0x18db: 0x13d1, 0x18dc: 0x0039, 0x18dd: 0x0040,\n\t0x18de: 0x1159, 0x18df: 0x0ef9, 0x18e0: 0x0040, 0x18e1: 0x0040, 0x18e2: 0x0f31, 0x18e3: 0x0040,\n\t0x18e4: 0x0040, 0x18e5: 0x0259, 0x18e6: 0x0f51, 0x18e7: 0x0040, 0x18e8: 0x0040, 0x18e9: 0x0f71,\n\t0x18ea: 0x00d9, 0x18eb: 0x0f99, 0x18ec: 0x2039, 0x18ed: 0x0040, 0x18ee: 0x01d9, 0x18ef: 0x0fa9,\n\t0x18f0: 0x0fb9, 0x18f1: 0x1089, 0x18f2: 0x0279, 0x18f3: 0x0369, 0x18f4: 0x0289, 0x18f5: 0x13d1,\n\t0x18f6: 0x0039, 0x18f7: 0x0ee9, 0x18f8: 0x1159, 0x18f9: 0x0ef9, 0x18fa: 0x0040, 0x18fb: 0x1199,\n\t0x18fc: 0x0040, 0x18fd: 0x0249, 0x18fe: 0x0f41, 0x18ff: 0x0259,\n\t// Block 0x64, offset 0x1900\n\t0x1900: 0x0f51, 0x1901: 0x0359, 0x1902: 0x0f61, 0x1903: 0x0f71, 0x1904: 0x0040, 0x1905: 0x0f99,\n\t0x1906: 0x2039, 0x1907: 0x0269, 0x1908: 0x01d9, 0x1909: 0x0fa9, 0x190a: 0x0fb9, 0x190b: 0x1089,\n\t0x190c: 0x0279, 0x190d: 0x0369, 0x190e: 0x0289, 0x190f: 0x13d1, 0x1910: 0x0039, 0x1911: 0x0ee9,\n\t0x1912: 0x1159, 0x1913: 0x0ef9, 0x1914: 0x0f09, 0x1915: 0x1199, 0x1916: 0x0f31, 0x1917: 0x0249,\n\t0x1918: 0x0f41, 0x1919: 0x0259, 0x191a: 0x0f51, 0x191b: 0x0359, 0x191c: 0x0f61, 0x191d: 0x0f71,\n\t0x191e: 0x00d9, 0x191f: 0x0f99, 0x1920: 0x2039, 0x1921: 0x0269, 0x1922: 0x01d9, 0x1923: 0x0fa9,\n\t0x1924: 0x0fb9, 0x1925: 0x1089, 0x1926: 0x0279, 0x1927: 0x0369, 0x1928: 0x0289, 0x1929: 0x13d1,\n\t0x192a: 0x0039, 0x192b: 0x0ee9, 0x192c: 0x1159, 0x192d: 0x0ef9, 0x192e: 0x0f09, 0x192f: 0x1199,\n\t0x1930: 0x0f31, 0x1931: 0x0249, 0x1932: 0x0f41, 0x1933: 0x0259, 0x1934: 0x0f51, 0x1935: 0x0359,\n\t0x1936: 0x0f61, 0x1937: 0x0f71, 0x1938: 0x00d9, 0x1939: 0x0f99, 0x193a: 0x2039, 0x193b: 0x0269,\n\t0x193c: 0x01d9, 0x193d: 0x0fa9, 0x193e: 0x0fb9, 0x193f: 0x1089,\n\t// Block 0x65, offset 0x1940\n\t0x1940: 0x0279, 0x1941: 0x0369, 0x1942: 0x0289, 0x1943: 0x13d1, 0x1944: 0x0039, 0x1945: 0x0ee9,\n\t0x1946: 0x0040, 0x1947: 0x0ef9, 0x1948: 0x0f09, 0x1949: 0x1199, 0x194a: 0x0f31, 0x194b: 0x0040,\n\t0x194c: 0x0040, 0x194d: 0x0259, 0x194e: 0x0f51, 0x194f: 0x0359, 0x1950: 0x0f61, 0x1951: 0x0f71,\n\t0x1952: 0x00d9, 0x1953: 0x0f99, 0x1954: 0x2039, 0x1955: 0x0040, 0x1956: 0x01d9, 0x1957: 0x0fa9,\n\t0x1958: 0x0fb9, 0x1959: 0x1089, 0x195a: 0x0279, 0x195b: 0x0369, 0x195c: 0x0289, 0x195d: 0x0040,\n\t0x195e: 0x0039, 0x195f: 0x0ee9, 0x1960: 0x1159, 0x1961: 0x0ef9, 0x1962: 0x0f09, 0x1963: 0x1199,\n\t0x1964: 0x0f31, 0x1965: 0x0249, 0x1966: 0x0f41, 0x1967: 0x0259, 0x1968: 0x0f51, 0x1969: 0x0359,\n\t0x196a: 0x0f61, 0x196b: 0x0f71, 0x196c: 0x00d9, 0x196d: 0x0f99, 0x196e: 0x2039, 0x196f: 0x0269,\n\t0x1970: 0x01d9, 0x1971: 0x0fa9, 0x1972: 0x0fb9, 0x1973: 0x1089, 0x1974: 0x0279, 0x1975: 0x0369,\n\t0x1976: 0x0289, 0x1977: 0x13d1, 0x1978: 0x0039, 0x1979: 0x0ee9, 0x197a: 0x0040, 0x197b: 0x0ef9,\n\t0x197c: 0x0f09, 0x197d: 0x1199, 0x197e: 0x0f31, 0x197f: 0x0040,\n\t// Block 0x66, offset 0x1980\n\t0x1980: 0x0f41, 0x1981: 0x0259, 0x1982: 0x0f51, 0x1983: 0x0359, 0x1984: 0x0f61, 0x1985: 0x0040,\n\t0x1986: 0x00d9, 0x1987: 0x0040, 0x1988: 0x0040, 0x1989: 0x0040, 0x198a: 0x01d9, 0x198b: 0x0fa9,\n\t0x198c: 0x0fb9, 0x198d: 0x1089, 0x198e: 0x0279, 0x198f: 0x0369, 0x1990: 0x0289, 0x1991: 0x0040,\n\t0x1992: 0x0039, 0x1993: 0x0ee9, 0x1994: 0x1159, 0x1995: 0x0ef9, 0x1996: 0x0f09, 0x1997: 0x1199,\n\t0x1998: 0x0f31, 0x1999: 0x0249, 0x199a: 0x0f41, 0x199b: 0x0259, 0x199c: 0x0f51, 0x199d: 0x0359,\n\t0x199e: 0x0f61, 0x199f: 0x0f71, 0x19a0: 0x00d9, 0x19a1: 0x0f99, 0x19a2: 0x2039, 0x19a3: 0x0269,\n\t0x19a4: 0x01d9, 0x19a5: 0x0fa9, 0x19a6: 0x0fb9, 0x19a7: 0x1089, 0x19a8: 0x0279, 0x19a9: 0x0369,\n\t0x19aa: 0x0289, 0x19ab: 0x13d1, 0x19ac: 0x0039, 0x19ad: 0x0ee9, 0x19ae: 0x1159, 0x19af: 0x0ef9,\n\t0x19b0: 0x0f09, 0x19b1: 0x1199, 0x19b2: 0x0f31, 0x19b3: 0x0249, 0x19b4: 0x0f41, 0x19b5: 0x0259,\n\t0x19b6: 0x0f51, 0x19b7: 0x0359, 0x19b8: 0x0f61, 0x19b9: 0x0f71, 0x19ba: 0x00d9, 0x19bb: 0x0f99,\n\t0x19bc: 0x2039, 0x19bd: 0x0269, 0x19be: 0x01d9, 0x19bf: 0x0fa9,\n\t// Block 0x67, offset 0x19c0\n\t0x19c0: 0x0fb9, 0x19c1: 0x1089, 0x19c2: 0x0279, 0x19c3: 0x0369, 0x19c4: 0x0289, 0x19c5: 0x13d1,\n\t0x19c6: 0x0039, 0x19c7: 0x0ee9, 0x19c8: 0x1159, 0x19c9: 0x0ef9, 0x19ca: 0x0f09, 0x19cb: 0x1199,\n\t0x19cc: 0x0f31, 0x19cd: 0x0249, 0x19ce: 0x0f41, 0x19cf: 0x0259, 0x19d0: 0x0f51, 0x19d1: 0x0359,\n\t0x19d2: 0x0f61, 0x19d3: 0x0f71, 0x19d4: 0x00d9, 0x19d5: 0x0f99, 0x19d6: 0x2039, 0x19d7: 0x0269,\n\t0x19d8: 0x01d9, 0x19d9: 0x0fa9, 0x19da: 0x0fb9, 0x19db: 0x1089, 0x19dc: 0x0279, 0x19dd: 0x0369,\n\t0x19de: 0x0289, 0x19df: 0x13d1, 0x19e0: 0x0039, 0x19e1: 0x0ee9, 0x19e2: 0x1159, 0x19e3: 0x0ef9,\n\t0x19e4: 0x0f09, 0x19e5: 0x1199, 0x19e6: 0x0f31, 0x19e7: 0x0249, 0x19e8: 0x0f41, 0x19e9: 0x0259,\n\t0x19ea: 0x0f51, 0x19eb: 0x0359, 0x19ec: 0x0f61, 0x19ed: 0x0f71, 0x19ee: 0x00d9, 0x19ef: 0x0f99,\n\t0x19f0: 0x2039, 0x19f1: 0x0269, 0x19f2: 0x01d9, 0x19f3: 0x0fa9, 0x19f4: 0x0fb9, 0x19f5: 0x1089,\n\t0x19f6: 0x0279, 0x19f7: 0x0369, 0x19f8: 0x0289, 0x19f9: 0x13d1, 0x19fa: 0x0039, 0x19fb: 0x0ee9,\n\t0x19fc: 0x1159, 0x19fd: 0x0ef9, 0x19fe: 0x0f09, 0x19ff: 0x1199,\n\t// Block 0x68, offset 0x1a00\n\t0x1a00: 0x0f31, 0x1a01: 0x0249, 0x1a02: 0x0f41, 0x1a03: 0x0259, 0x1a04: 0x0f51, 0x1a05: 0x0359,\n\t0x1a06: 0x0f61, 0x1a07: 0x0f71, 0x1a08: 0x00d9, 0x1a09: 0x0f99, 0x1a0a: 0x2039, 0x1a0b: 0x0269,\n\t0x1a0c: 0x01d9, 0x1a0d: 0x0fa9, 0x1a0e: 0x0fb9, 0x1a0f: 0x1089, 0x1a10: 0x0279, 0x1a11: 0x0369,\n\t0x1a12: 0x0289, 0x1a13: 0x13d1, 0x1a14: 0x0039, 0x1a15: 0x0ee9, 0x1a16: 0x1159, 0x1a17: 0x0ef9,\n\t0x1a18: 0x0f09, 0x1a19: 0x1199, 0x1a1a: 0x0f31, 0x1a1b: 0x0249, 0x1a1c: 0x0f41, 0x1a1d: 0x0259,\n\t0x1a1e: 0x0f51, 0x1a1f: 0x0359, 0x1a20: 0x0f61, 0x1a21: 0x0f71, 0x1a22: 0x00d9, 0x1a23: 0x0f99,\n\t0x1a24: 0x2039, 0x1a25: 0x0269, 0x1a26: 0x01d9, 0x1a27: 0x0fa9, 0x1a28: 0x0fb9, 0x1a29: 0x1089,\n\t0x1a2a: 0x0279, 0x1a2b: 0x0369, 0x1a2c: 0x0289, 0x1a2d: 0x13d1, 0x1a2e: 0x0039, 0x1a2f: 0x0ee9,\n\t0x1a30: 0x1159, 0x1a31: 0x0ef9, 0x1a32: 0x0f09, 0x1a33: 0x1199, 0x1a34: 0x0f31, 0x1a35: 0x0249,\n\t0x1a36: 0x0f41, 0x1a37: 0x0259, 0x1a38: 0x0f51, 0x1a39: 0x0359, 0x1a3a: 0x0f61, 0x1a3b: 0x0f71,\n\t0x1a3c: 0x00d9, 0x1a3d: 0x0f99, 0x1a3e: 0x2039, 0x1a3f: 0x0269,\n\t// Block 0x69, offset 0x1a40\n\t0x1a40: 0x01d9, 0x1a41: 0x0fa9, 0x1a42: 0x0fb9, 0x1a43: 0x1089, 0x1a44: 0x0279, 0x1a45: 0x0369,\n\t0x1a46: 0x0289, 0x1a47: 0x13d1, 0x1a48: 0x0039, 0x1a49: 0x0ee9, 0x1a4a: 0x1159, 0x1a4b: 0x0ef9,\n\t0x1a4c: 0x0f09, 0x1a4d: 0x1199, 0x1a4e: 0x0f31, 0x1a4f: 0x0249, 0x1a50: 0x0f41, 0x1a51: 0x0259,\n\t0x1a52: 0x0f51, 0x1a53: 0x0359, 0x1a54: 0x0f61, 0x1a55: 0x0f71, 0x1a56: 0x00d9, 0x1a57: 0x0f99,\n\t0x1a58: 0x2039, 0x1a59: 0x0269, 0x1a5a: 0x01d9, 0x1a5b: 0x0fa9, 0x1a5c: 0x0fb9, 0x1a5d: 0x1089,\n\t0x1a5e: 0x0279, 0x1a5f: 0x0369, 0x1a60: 0x0289, 0x1a61: 0x13d1, 0x1a62: 0x0039, 0x1a63: 0x0ee9,\n\t0x1a64: 0x1159, 0x1a65: 0x0ef9, 0x1a66: 0x0f09, 0x1a67: 0x1199, 0x1a68: 0x0f31, 0x1a69: 0x0249,\n\t0x1a6a: 0x0f41, 0x1a6b: 0x0259, 0x1a6c: 0x0f51, 0x1a6d: 0x0359, 0x1a6e: 0x0f61, 0x1a6f: 0x0f71,\n\t0x1a70: 0x00d9, 0x1a71: 0x0f99, 0x1a72: 0x2039, 0x1a73: 0x0269, 0x1a74: 0x01d9, 0x1a75: 0x0fa9,\n\t0x1a76: 0x0fb9, 0x1a77: 0x1089, 0x1a78: 0x0279, 0x1a79: 0x0369, 0x1a7a: 0x0289, 0x1a7b: 0x13d1,\n\t0x1a7c: 0x0039, 0x1a7d: 0x0ee9, 0x1a7e: 0x1159, 0x1a7f: 0x0ef9,\n\t// Block 0x6a, offset 0x1a80\n\t0x1a80: 0x0f09, 0x1a81: 0x1199, 0x1a82: 0x0f31, 0x1a83: 0x0249, 0x1a84: 0x0f41, 0x1a85: 0x0259,\n\t0x1a86: 0x0f51, 0x1a87: 0x0359, 0x1a88: 0x0f61, 0x1a89: 0x0f71, 0x1a8a: 0x00d9, 0x1a8b: 0x0f99,\n\t0x1a8c: 0x2039, 0x1a8d: 0x0269, 0x1a8e: 0x01d9, 0x1a8f: 0x0fa9, 0x1a90: 0x0fb9, 0x1a91: 0x1089,\n\t0x1a92: 0x0279, 0x1a93: 0x0369, 0x1a94: 0x0289, 0x1a95: 0x13d1, 0x1a96: 0x0039, 0x1a97: 0x0ee9,\n\t0x1a98: 0x1159, 0x1a99: 0x0ef9, 0x1a9a: 0x0f09, 0x1a9b: 0x1199, 0x1a9c: 0x0f31, 0x1a9d: 0x0249,\n\t0x1a9e: 0x0f41, 0x1a9f: 0x0259, 0x1aa0: 0x0f51, 0x1aa1: 0x0359, 0x1aa2: 0x0f61, 0x1aa3: 0x0f71,\n\t0x1aa4: 0x00d9, 0x1aa5: 0x0f99, 0x1aa6: 0x2039, 0x1aa7: 0x0269, 0x1aa8: 0x01d9, 0x1aa9: 0x0fa9,\n\t0x1aaa: 0x0fb9, 0x1aab: 0x1089, 0x1aac: 0x0279, 0x1aad: 0x0369, 0x1aae: 0x0289, 0x1aaf: 0x13d1,\n\t0x1ab0: 0x0039, 0x1ab1: 0x0ee9, 0x1ab2: 0x1159, 0x1ab3: 0x0ef9, 0x1ab4: 0x0f09, 0x1ab5: 0x1199,\n\t0x1ab6: 0x0f31, 0x1ab7: 0x0249, 0x1ab8: 0x0f41, 0x1ab9: 0x0259, 0x1aba: 0x0f51, 0x1abb: 0x0359,\n\t0x1abc: 0x0f61, 0x1abd: 0x0f71, 0x1abe: 0x00d9, 0x1abf: 0x0f99,\n\t// Block 0x6b, offset 0x1ac0\n\t0x1ac0: 0x2039, 0x1ac1: 0x0269, 0x1ac2: 0x01d9, 0x1ac3: 0x0fa9, 0x1ac4: 0x0fb9, 0x1ac5: 0x1089,\n\t0x1ac6: 0x0279, 0x1ac7: 0x0369, 0x1ac8: 0x0289, 0x1ac9: 0x13d1, 0x1aca: 0x0039, 0x1acb: 0x0ee9,\n\t0x1acc: 0x1159, 0x1acd: 0x0ef9, 0x1ace: 0x0f09, 0x1acf: 0x1199, 0x1ad0: 0x0f31, 0x1ad1: 0x0249,\n\t0x1ad2: 0x0f41, 0x1ad3: 0x0259, 0x1ad4: 0x0f51, 0x1ad5: 0x0359, 0x1ad6: 0x0f61, 0x1ad7: 0x0f71,\n\t0x1ad8: 0x00d9, 0x1ad9: 0x0f99, 0x1ada: 0x2039, 0x1adb: 0x0269, 0x1adc: 0x01d9, 0x1add: 0x0fa9,\n\t0x1ade: 0x0fb9, 0x1adf: 0x1089, 0x1ae0: 0x0279, 0x1ae1: 0x0369, 0x1ae2: 0x0289, 0x1ae3: 0x13d1,\n\t0x1ae4: 0xba81, 0x1ae5: 0xba99, 0x1ae6: 0x0040, 0x1ae7: 0x0040, 0x1ae8: 0xbab1, 0x1ae9: 0x1099,\n\t0x1aea: 0x10b1, 0x1aeb: 0x10c9, 0x1aec: 0xbac9, 0x1aed: 0xbae1, 0x1aee: 0xbaf9, 0x1aef: 0x1429,\n\t0x1af0: 0x1a31, 0x1af1: 0xbb11, 0x1af2: 0xbb29, 0x1af3: 0xbb41, 0x1af4: 0xbb59, 0x1af5: 0xbb71,\n\t0x1af6: 0xbb89, 0x1af7: 0x2109, 0x1af8: 0x1111, 0x1af9: 0x1429, 0x1afa: 0xbba1, 0x1afb: 0xbbb9,\n\t0x1afc: 0xbbd1, 0x1afd: 0x10e1, 0x1afe: 0x10f9, 0x1aff: 0xbbe9,\n\t// Block 0x6c, offset 0x1b00\n\t0x1b00: 0x2079, 0x1b01: 0xbc01, 0x1b02: 0xbab1, 0x1b03: 0x1099, 0x1b04: 0x10b1, 0x1b05: 0x10c9,\n\t0x1b06: 0xbac9, 0x1b07: 0xbae1, 0x1b08: 0xbaf9, 0x1b09: 0x1429, 0x1b0a: 0x1a31, 0x1b0b: 0xbb11,\n\t0x1b0c: 0xbb29, 0x1b0d: 0xbb41, 0x1b0e: 0xbb59, 0x1b0f: 0xbb71, 0x1b10: 0xbb89, 0x1b11: 0x2109,\n\t0x1b12: 0x1111, 0x1b13: 0xbba1, 0x1b14: 0xbba1, 0x1b15: 0xbbb9, 0x1b16: 0xbbd1, 0x1b17: 0x10e1,\n\t0x1b18: 0x10f9, 0x1b19: 0xbbe9, 0x1b1a: 0x2079, 0x1b1b: 0xbc21, 0x1b1c: 0xbac9, 0x1b1d: 0x1429,\n\t0x1b1e: 0xbb11, 0x1b1f: 0x10e1, 0x1b20: 0x1111, 0x1b21: 0x2109, 0x1b22: 0xbab1, 0x1b23: 0x1099,\n\t0x1b24: 0x10b1, 0x1b25: 0x10c9, 0x1b26: 0xbac9, 0x1b27: 0xbae1, 0x1b28: 0xbaf9, 0x1b29: 0x1429,\n\t0x1b2a: 0x1a31, 0x1b2b: 0xbb11, 0x1b2c: 0xbb29, 0x1b2d: 0xbb41, 0x1b2e: 0xbb59, 0x1b2f: 0xbb71,\n\t0x1b30: 0xbb89, 0x1b31: 0x2109, 0x1b32: 0x1111, 0x1b33: 0x1429, 0x1b34: 0xbba1, 0x1b35: 0xbbb9,\n\t0x1b36: 0xbbd1, 0x1b37: 0x10e1, 0x1b38: 0x10f9, 0x1b39: 0xbbe9, 0x1b3a: 0x2079, 0x1b3b: 0xbc01,\n\t0x1b3c: 0xbab1, 0x1b3d: 0x1099, 0x1b3e: 0x10b1, 0x1b3f: 0x10c9,\n\t// Block 0x6d, offset 0x1b40\n\t0x1b40: 0xbac9, 0x1b41: 0xbae1, 0x1b42: 0xbaf9, 0x1b43: 0x1429, 0x1b44: 0x1a31, 0x1b45: 0xbb11,\n\t0x1b46: 0xbb29, 0x1b47: 0xbb41, 0x1b48: 0xbb59, 0x1b49: 0xbb71, 0x1b4a: 0xbb89, 0x1b4b: 0x2109,\n\t0x1b4c: 0x1111, 0x1b4d: 0xbba1, 0x1b4e: 0xbba1, 0x1b4f: 0xbbb9, 0x1b50: 0xbbd1, 0x1b51: 0x10e1,\n\t0x1b52: 0x10f9, 0x1b53: 0xbbe9, 0x1b54: 0x2079, 0x1b55: 0xbc21, 0x1b56: 0xbac9, 0x1b57: 0x1429,\n\t0x1b58: 0xbb11, 0x1b59: 0x10e1, 0x1b5a: 0x1111, 0x1b5b: 0x2109, 0x1b5c: 0xbab1, 0x1b5d: 0x1099,\n\t0x1b5e: 0x10b1, 0x1b5f: 0x10c9, 0x1b60: 0xbac9, 0x1b61: 0xbae1, 0x1b62: 0xbaf9, 0x1b63: 0x1429,\n\t0x1b64: 0x1a31, 0x1b65: 0xbb11, 0x1b66: 0xbb29, 0x1b67: 0xbb41, 0x1b68: 0xbb59, 0x1b69: 0xbb71,\n\t0x1b6a: 0xbb89, 0x1b6b: 0x2109, 0x1b6c: 0x1111, 0x1b6d: 0x1429, 0x1b6e: 0xbba1, 0x1b6f: 0xbbb9,\n\t0x1b70: 0xbbd1, 0x1b71: 0x10e1, 0x1b72: 0x10f9, 0x1b73: 0xbbe9, 0x1b74: 0x2079, 0x1b75: 0xbc01,\n\t0x1b76: 0xbab1, 0x1b77: 0x1099, 0x1b78: 0x10b1, 0x1b79: 0x10c9, 0x1b7a: 0xbac9, 0x1b7b: 0xbae1,\n\t0x1b7c: 0xbaf9, 0x1b7d: 0x1429, 0x1b7e: 0x1a31, 0x1b7f: 0xbb11,\n\t// Block 0x6e, offset 0x1b80\n\t0x1b80: 0xbb29, 0x1b81: 0xbb41, 0x1b82: 0xbb59, 0x1b83: 0xbb71, 0x1b84: 0xbb89, 0x1b85: 0x2109,\n\t0x1b86: 0x1111, 0x1b87: 0xbba1, 0x1b88: 0xbba1, 0x1b89: 0xbbb9, 0x1b8a: 0xbbd1, 0x1b8b: 0x10e1,\n\t0x1b8c: 0x10f9, 0x1b8d: 0xbbe9, 0x1b8e: 0x2079, 0x1b8f: 0xbc21, 0x1b90: 0xbac9, 0x1b91: 0x1429,\n\t0x1b92: 0xbb11, 0x1b93: 0x10e1, 0x1b94: 0x1111, 0x1b95: 0x2109, 0x1b96: 0xbab1, 0x1b97: 0x1099,\n\t0x1b98: 0x10b1, 0x1b99: 0x10c9, 0x1b9a: 0xbac9, 0x1b9b: 0xbae1, 0x1b9c: 0xbaf9, 0x1b9d: 0x1429,\n\t0x1b9e: 0x1a31, 0x1b9f: 0xbb11, 0x1ba0: 0xbb29, 0x1ba1: 0xbb41, 0x1ba2: 0xbb59, 0x1ba3: 0xbb71,\n\t0x1ba4: 0xbb89, 0x1ba5: 0x2109, 0x1ba6: 0x1111, 0x1ba7: 0x1429, 0x1ba8: 0xbba1, 0x1ba9: 0xbbb9,\n\t0x1baa: 0xbbd1, 0x1bab: 0x10e1, 0x1bac: 0x10f9, 0x1bad: 0xbbe9, 0x1bae: 0x2079, 0x1baf: 0xbc01,\n\t0x1bb0: 0xbab1, 0x1bb1: 0x1099, 0x1bb2: 0x10b1, 0x1bb3: 0x10c9, 0x1bb4: 0xbac9, 0x1bb5: 0xbae1,\n\t0x1bb6: 0xbaf9, 0x1bb7: 0x1429, 0x1bb8: 0x1a31, 0x1bb9: 0xbb11, 0x1bba: 0xbb29, 0x1bbb: 0xbb41,\n\t0x1bbc: 0xbb59, 0x1bbd: 0xbb71, 0x1bbe: 0xbb89, 0x1bbf: 0x2109,\n\t// Block 0x6f, offset 0x1bc0\n\t0x1bc0: 0x1111, 0x1bc1: 0xbba1, 0x1bc2: 0xbba1, 0x1bc3: 0xbbb9, 0x1bc4: 0xbbd1, 0x1bc5: 0x10e1,\n\t0x1bc6: 0x10f9, 0x1bc7: 0xbbe9, 0x1bc8: 0x2079, 0x1bc9: 0xbc21, 0x1bca: 0xbac9, 0x1bcb: 0x1429,\n\t0x1bcc: 0xbb11, 0x1bcd: 0x10e1, 0x1bce: 0x1111, 0x1bcf: 0x2109, 0x1bd0: 0xbab1, 0x1bd1: 0x1099,\n\t0x1bd2: 0x10b1, 0x1bd3: 0x10c9, 0x1bd4: 0xbac9, 0x1bd5: 0xbae1, 0x1bd6: 0xbaf9, 0x1bd7: 0x1429,\n\t0x1bd8: 0x1a31, 0x1bd9: 0xbb11, 0x1bda: 0xbb29, 0x1bdb: 0xbb41, 0x1bdc: 0xbb59, 0x1bdd: 0xbb71,\n\t0x1bde: 0xbb89, 0x1bdf: 0x2109, 0x1be0: 0x1111, 0x1be1: 0x1429, 0x1be2: 0xbba1, 0x1be3: 0xbbb9,\n\t0x1be4: 0xbbd1, 0x1be5: 0x10e1, 0x1be6: 0x10f9, 0x1be7: 0xbbe9, 0x1be8: 0x2079, 0x1be9: 0xbc01,\n\t0x1bea: 0xbab1, 0x1beb: 0x1099, 0x1bec: 0x10b1, 0x1bed: 0x10c9, 0x1bee: 0xbac9, 0x1bef: 0xbae1,\n\t0x1bf0: 0xbaf9, 0x1bf1: 0x1429, 0x1bf2: 0x1a31, 0x1bf3: 0xbb11, 0x1bf4: 0xbb29, 0x1bf5: 0xbb41,\n\t0x1bf6: 0xbb59, 0x1bf7: 0xbb71, 0x1bf8: 0xbb89, 0x1bf9: 0x2109, 0x1bfa: 0x1111, 0x1bfb: 0xbba1,\n\t0x1bfc: 0xbba1, 0x1bfd: 0xbbb9, 0x1bfe: 0xbbd1, 0x1bff: 0x10e1,\n\t// Block 0x70, offset 0x1c00\n\t0x1c00: 0x10f9, 0x1c01: 0xbbe9, 0x1c02: 0x2079, 0x1c03: 0xbc21, 0x1c04: 0xbac9, 0x1c05: 0x1429,\n\t0x1c06: 0xbb11, 0x1c07: 0x10e1, 0x1c08: 0x1111, 0x1c09: 0x2109, 0x1c0a: 0xbc41, 0x1c0b: 0xbc41,\n\t0x1c0c: 0x0040, 0x1c0d: 0x0040, 0x1c0e: 0x1f41, 0x1c0f: 0x00c9, 0x1c10: 0x0069, 0x1c11: 0x0079,\n\t0x1c12: 0x1f51, 0x1c13: 0x1f61, 0x1c14: 0x1f71, 0x1c15: 0x1f81, 0x1c16: 0x1f91, 0x1c17: 0x1fa1,\n\t0x1c18: 0x1f41, 0x1c19: 0x00c9, 0x1c1a: 0x0069, 0x1c1b: 0x0079, 0x1c1c: 0x1f51, 0x1c1d: 0x1f61,\n\t0x1c1e: 0x1f71, 0x1c1f: 0x1f81, 0x1c20: 0x1f91, 0x1c21: 0x1fa1, 0x1c22: 0x1f41, 0x1c23: 0x00c9,\n\t0x1c24: 0x0069, 0x1c25: 0x0079, 0x1c26: 0x1f51, 0x1c27: 0x1f61, 0x1c28: 0x1f71, 0x1c29: 0x1f81,\n\t0x1c2a: 0x1f91, 0x1c2b: 0x1fa1, 0x1c2c: 0x1f41, 0x1c2d: 0x00c9, 0x1c2e: 0x0069, 0x1c2f: 0x0079,\n\t0x1c30: 0x1f51, 0x1c31: 0x1f61, 0x1c32: 0x1f71, 0x1c33: 0x1f81, 0x1c34: 0x1f91, 0x1c35: 0x1fa1,\n\t0x1c36: 0x1f41, 0x1c37: 0x00c9, 0x1c38: 0x0069, 0x1c39: 0x0079, 0x1c3a: 0x1f51, 0x1c3b: 0x1f61,\n\t0x1c3c: 0x1f71, 0x1c3d: 0x1f81, 0x1c3e: 0x1f91, 0x1c3f: 0x1fa1,\n\t// Block 0x71, offset 0x1c40\n\t0x1c40: 0xe115, 0x1c41: 0xe115, 0x1c42: 0xe135, 0x1c43: 0xe135, 0x1c44: 0xe115, 0x1c45: 0xe115,\n\t0x1c46: 0xe175, 0x1c47: 0xe175, 0x1c48: 0xe115, 0x1c49: 0xe115, 0x1c4a: 0xe135, 0x1c4b: 0xe135,\n\t0x1c4c: 0xe115, 0x1c4d: 0xe115, 0x1c4e: 0xe1f5, 0x1c4f: 0xe1f5, 0x1c50: 0xe115, 0x1c51: 0xe115,\n\t0x1c52: 0xe135, 0x1c53: 0xe135, 0x1c54: 0xe115, 0x1c55: 0xe115, 0x1c56: 0xe175, 0x1c57: 0xe175,\n\t0x1c58: 0xe115, 0x1c59: 0xe115, 0x1c5a: 0xe135, 0x1c5b: 0xe135, 0x1c5c: 0xe115, 0x1c5d: 0xe115,\n\t0x1c5e: 0x8b05, 0x1c5f: 0x8b05, 0x1c60: 0x04b5, 0x1c61: 0x04b5, 0x1c62: 0x0a08, 0x1c63: 0x0a08,\n\t0x1c64: 0x0a08, 0x1c65: 0x0a08, 0x1c66: 0x0a08, 0x1c67: 0x0a08, 0x1c68: 0x0a08, 0x1c69: 0x0a08,\n\t0x1c6a: 0x0a08, 0x1c6b: 0x0a08, 0x1c6c: 0x0a08, 0x1c6d: 0x0a08, 0x1c6e: 0x0a08, 0x1c6f: 0x0a08,\n\t0x1c70: 0x0a08, 0x1c71: 0x0a08, 0x1c72: 0x0a08, 0x1c73: 0x0a08, 0x1c74: 0x0a08, 0x1c75: 0x0a08,\n\t0x1c76: 0x0a08, 0x1c77: 0x0a08, 0x1c78: 0x0a08, 0x1c79: 0x0a08, 0x1c7a: 0x0a08, 0x1c7b: 0x0a08,\n\t0x1c7c: 0x0a08, 0x1c7d: 0x0a08, 0x1c7e: 0x0a08, 0x1c7f: 0x0a08,\n\t// Block 0x72, offset 0x1c80\n\t0x1c80: 0xb189, 0x1c81: 0xb1a1, 0x1c82: 0xb201, 0x1c83: 0xb249, 0x1c84: 0x0040, 0x1c85: 0xb411,\n\t0x1c86: 0xb291, 0x1c87: 0xb219, 0x1c88: 0xb309, 0x1c89: 0xb429, 0x1c8a: 0xb399, 0x1c8b: 0xb3b1,\n\t0x1c8c: 0xb3c9, 0x1c8d: 0xb3e1, 0x1c8e: 0xb2a9, 0x1c8f: 0xb339, 0x1c90: 0xb369, 0x1c91: 0xb2d9,\n\t0x1c92: 0xb381, 0x1c93: 0xb279, 0x1c94: 0xb2c1, 0x1c95: 0xb1d1, 0x1c96: 0xb1e9, 0x1c97: 0xb231,\n\t0x1c98: 0xb261, 0x1c99: 0xb2f1, 0x1c9a: 0xb321, 0x1c9b: 0xb351, 0x1c9c: 0xbc59, 0x1c9d: 0x7949,\n\t0x1c9e: 0xbc71, 0x1c9f: 0xbc89, 0x1ca0: 0x0040, 0x1ca1: 0xb1a1, 0x1ca2: 0xb201, 0x1ca3: 0x0040,\n\t0x1ca4: 0xb3f9, 0x1ca5: 0x0040, 0x1ca6: 0x0040, 0x1ca7: 0xb219, 0x1ca8: 0x0040, 0x1ca9: 0xb429,\n\t0x1caa: 0xb399, 0x1cab: 0xb3b1, 0x1cac: 0xb3c9, 0x1cad: 0xb3e1, 0x1cae: 0xb2a9, 0x1caf: 0xb339,\n\t0x1cb0: 0xb369, 0x1cb1: 0xb2d9, 0x1cb2: 0xb381, 0x1cb3: 0x0040, 0x1cb4: 0xb2c1, 0x1cb5: 0xb1d1,\n\t0x1cb6: 0xb1e9, 0x1cb7: 0xb231, 0x1cb8: 0x0040, 0x1cb9: 0xb2f1, 0x1cba: 0x0040, 0x1cbb: 0xb351,\n\t0x1cbc: 0x0040, 0x1cbd: 0x0040, 0x1cbe: 0x0040, 0x1cbf: 0x0040,\n\t// Block 0x73, offset 0x1cc0\n\t0x1cc0: 0x0040, 0x1cc1: 0x0040, 0x1cc2: 0xb201, 0x1cc3: 0x0040, 0x1cc4: 0x0040, 0x1cc5: 0x0040,\n\t0x1cc6: 0x0040, 0x1cc7: 0xb219, 0x1cc8: 0x0040, 0x1cc9: 0xb429, 0x1cca: 0x0040, 0x1ccb: 0xb3b1,\n\t0x1ccc: 0x0040, 0x1ccd: 0xb3e1, 0x1cce: 0xb2a9, 0x1ccf: 0xb339, 0x1cd0: 0x0040, 0x1cd1: 0xb2d9,\n\t0x1cd2: 0xb381, 0x1cd3: 0x0040, 0x1cd4: 0xb2c1, 0x1cd5: 0x0040, 0x1cd6: 0x0040, 0x1cd7: 0xb231,\n\t0x1cd8: 0x0040, 0x1cd9: 0xb2f1, 0x1cda: 0x0040, 0x1cdb: 0xb351, 0x1cdc: 0x0040, 0x1cdd: 0x7949,\n\t0x1cde: 0x0040, 0x1cdf: 0xbc89, 0x1ce0: 0x0040, 0x1ce1: 0xb1a1, 0x1ce2: 0xb201, 0x1ce3: 0x0040,\n\t0x1ce4: 0xb3f9, 0x1ce5: 0x0040, 0x1ce6: 0x0040, 0x1ce7: 0xb219, 0x1ce8: 0xb309, 0x1ce9: 0xb429,\n\t0x1cea: 0xb399, 0x1ceb: 0x0040, 0x1cec: 0xb3c9, 0x1ced: 0xb3e1, 0x1cee: 0xb2a9, 0x1cef: 0xb339,\n\t0x1cf0: 0xb369, 0x1cf1: 0xb2d9, 0x1cf2: 0xb381, 0x1cf3: 0x0040, 0x1cf4: 0xb2c1, 0x1cf5: 0xb1d1,\n\t0x1cf6: 0xb1e9, 0x1cf7: 0xb231, 0x1cf8: 0x0040, 0x1cf9: 0xb2f1, 0x1cfa: 0xb321, 0x1cfb: 0xb351,\n\t0x1cfc: 0xbc59, 0x1cfd: 0x0040, 0x1cfe: 0xbc71, 0x1cff: 0x0040,\n\t// Block 0x74, offset 0x1d00\n\t0x1d00: 0xb189, 0x1d01: 0xb1a1, 0x1d02: 0xb201, 0x1d03: 0xb249, 0x1d04: 0xb3f9, 0x1d05: 0xb411,\n\t0x1d06: 0xb291, 0x1d07: 0xb219, 0x1d08: 0xb309, 0x1d09: 0xb429, 0x1d0a: 0x0040, 0x1d0b: 0xb3b1,\n\t0x1d0c: 0xb3c9, 0x1d0d: 0xb3e1, 0x1d0e: 0xb2a9, 0x1d0f: 0xb339, 0x1d10: 0xb369, 0x1d11: 0xb2d9,\n\t0x1d12: 0xb381, 0x1d13: 0xb279, 0x1d14: 0xb2c1, 0x1d15: 0xb1d1, 0x1d16: 0xb1e9, 0x1d17: 0xb231,\n\t0x1d18: 0xb261, 0x1d19: 0xb2f1, 0x1d1a: 0xb321, 0x1d1b: 0xb351, 0x1d1c: 0x0040, 0x1d1d: 0x0040,\n\t0x1d1e: 0x0040, 0x1d1f: 0x0040, 0x1d20: 0x0040, 0x1d21: 0xb1a1, 0x1d22: 0xb201, 0x1d23: 0xb249,\n\t0x1d24: 0x0040, 0x1d25: 0xb411, 0x1d26: 0xb291, 0x1d27: 0xb219, 0x1d28: 0xb309, 0x1d29: 0xb429,\n\t0x1d2a: 0x0040, 0x1d2b: 0xb3b1, 0x1d2c: 0xb3c9, 0x1d2d: 0xb3e1, 0x1d2e: 0xb2a9, 0x1d2f: 0xb339,\n\t0x1d30: 0xb369, 0x1d31: 0xb2d9, 0x1d32: 0xb381, 0x1d33: 0xb279, 0x1d34: 0xb2c1, 0x1d35: 0xb1d1,\n\t0x1d36: 0xb1e9, 0x1d37: 0xb231, 0x1d38: 0xb261, 0x1d39: 0xb2f1, 0x1d3a: 0xb321, 0x1d3b: 0xb351,\n\t0x1d3c: 0x0040, 0x1d3d: 0x0040, 0x1d3e: 0x0040, 0x1d3f: 0x0040,\n\t// Block 0x75, offset 0x1d40\n\t0x1d40: 0x0040, 0x1d41: 0xbca2, 0x1d42: 0xbcba, 0x1d43: 0xbcd2, 0x1d44: 0xbcea, 0x1d45: 0xbd02,\n\t0x1d46: 0xbd1a, 0x1d47: 0xbd32, 0x1d48: 0xbd4a, 0x1d49: 0xbd62, 0x1d4a: 0xbd7a, 0x1d4b: 0x0018,\n\t0x1d4c: 0x0018, 0x1d4d: 0x0040, 0x1d4e: 0x0040, 0x1d4f: 0x0040, 0x1d50: 0xbd92, 0x1d51: 0xbdb2,\n\t0x1d52: 0xbdd2, 0x1d53: 0xbdf2, 0x1d54: 0xbe12, 0x1d55: 0xbe32, 0x1d56: 0xbe52, 0x1d57: 0xbe72,\n\t0x1d58: 0xbe92, 0x1d59: 0xbeb2, 0x1d5a: 0xbed2, 0x1d5b: 0xbef2, 0x1d5c: 0xbf12, 0x1d5d: 0xbf32,\n\t0x1d5e: 0xbf52, 0x1d5f: 0xbf72, 0x1d60: 0xbf92, 0x1d61: 0xbfb2, 0x1d62: 0xbfd2, 0x1d63: 0xbff2,\n\t0x1d64: 0xc012, 0x1d65: 0xc032, 0x1d66: 0xc052, 0x1d67: 0xc072, 0x1d68: 0xc092, 0x1d69: 0xc0b2,\n\t0x1d6a: 0xc0d1, 0x1d6b: 0x1159, 0x1d6c: 0x0269, 0x1d6d: 0x6671, 0x1d6e: 0xc111, 0x1d6f: 0x0018,\n\t0x1d70: 0x0039, 0x1d71: 0x0ee9, 0x1d72: 0x1159, 0x1d73: 0x0ef9, 0x1d74: 0x0f09, 0x1d75: 0x1199,\n\t0x1d76: 0x0f31, 0x1d77: 0x0249, 0x1d78: 0x0f41, 0x1d79: 0x0259, 0x1d7a: 0x0f51, 0x1d7b: 0x0359,\n\t0x1d7c: 0x0f61, 0x1d7d: 0x0f71, 0x1d7e: 0x00d9, 0x1d7f: 0x0f99,\n\t// Block 0x76, offset 0x1d80\n\t0x1d80: 0x2039, 0x1d81: 0x0269, 0x1d82: 0x01d9, 0x1d83: 0x0fa9, 0x1d84: 0x0fb9, 0x1d85: 0x1089,\n\t0x1d86: 0x0279, 0x1d87: 0x0369, 0x1d88: 0x0289, 0x1d89: 0x13d1, 0x1d8a: 0xc129, 0x1d8b: 0x65b1,\n\t0x1d8c: 0xc141, 0x1d8d: 0x1441, 0x1d8e: 0xc159, 0x1d8f: 0xc179, 0x1d90: 0x0018, 0x1d91: 0x0018,\n\t0x1d92: 0x0018, 0x1d93: 0x0018, 0x1d94: 0x0018, 0x1d95: 0x0018, 0x1d96: 0x0018, 0x1d97: 0x0018,\n\t0x1d98: 0x0018, 0x1d99: 0x0018, 0x1d9a: 0x0018, 0x1d9b: 0x0018, 0x1d9c: 0x0018, 0x1d9d: 0x0018,\n\t0x1d9e: 0x0018, 0x1d9f: 0x0018, 0x1da0: 0x0018, 0x1da1: 0x0018, 0x1da2: 0x0018, 0x1da3: 0x0018,\n\t0x1da4: 0x0018, 0x1da5: 0x0018, 0x1da6: 0x0018, 0x1da7: 0x0018, 0x1da8: 0x0018, 0x1da9: 0x0018,\n\t0x1daa: 0xc191, 0x1dab: 0xc1a9, 0x1dac: 0x0040, 0x1dad: 0x0040, 0x1dae: 0x0040, 0x1daf: 0x0040,\n\t0x1db0: 0x0018, 0x1db1: 0x0018, 0x1db2: 0x0018, 0x1db3: 0x0018, 0x1db4: 0x0018, 0x1db5: 0x0018,\n\t0x1db6: 0x0018, 0x1db7: 0x0018, 0x1db8: 0x0018, 0x1db9: 0x0018, 0x1dba: 0x0018, 0x1dbb: 0x0018,\n\t0x1dbc: 0x0018, 0x1dbd: 0x0018, 0x1dbe: 0x0018, 0x1dbf: 0x0018,\n\t// Block 0x77, offset 0x1dc0\n\t0x1dc0: 0xc1d9, 0x1dc1: 0xc211, 0x1dc2: 0xc249, 0x1dc3: 0x0040, 0x1dc4: 0x0040, 0x1dc5: 0x0040,\n\t0x1dc6: 0x0040, 0x1dc7: 0x0040, 0x1dc8: 0x0040, 0x1dc9: 0x0040, 0x1dca: 0x0040, 0x1dcb: 0x0040,\n\t0x1dcc: 0x0040, 0x1dcd: 0x0040, 0x1dce: 0x0040, 0x1dcf: 0x0040, 0x1dd0: 0xc269, 0x1dd1: 0xc289,\n\t0x1dd2: 0xc2a9, 0x1dd3: 0xc2c9, 0x1dd4: 0xc2e9, 0x1dd5: 0xc309, 0x1dd6: 0xc329, 0x1dd7: 0xc349,\n\t0x1dd8: 0xc369, 0x1dd9: 0xc389, 0x1dda: 0xc3a9, 0x1ddb: 0xc3c9, 0x1ddc: 0xc3e9, 0x1ddd: 0xc409,\n\t0x1dde: 0xc429, 0x1ddf: 0xc449, 0x1de0: 0xc469, 0x1de1: 0xc489, 0x1de2: 0xc4a9, 0x1de3: 0xc4c9,\n\t0x1de4: 0xc4e9, 0x1de5: 0xc509, 0x1de6: 0xc529, 0x1de7: 0xc549, 0x1de8: 0xc569, 0x1de9: 0xc589,\n\t0x1dea: 0xc5a9, 0x1deb: 0xc5c9, 0x1dec: 0xc5e9, 0x1ded: 0xc609, 0x1dee: 0xc629, 0x1def: 0xc649,\n\t0x1df0: 0xc669, 0x1df1: 0xc689, 0x1df2: 0xc6a9, 0x1df3: 0xc6c9, 0x1df4: 0xc6e9, 0x1df5: 0xc709,\n\t0x1df6: 0xc729, 0x1df7: 0xc749, 0x1df8: 0xc769, 0x1df9: 0xc789, 0x1dfa: 0xc7a9, 0x1dfb: 0xc7c9,\n\t0x1dfc: 0x0040, 0x1dfd: 0x0040, 0x1dfe: 0x0040, 0x1dff: 0x0040,\n\t// Block 0x78, offset 0x1e00\n\t0x1e00: 0xcaf9, 0x1e01: 0xcb19, 0x1e02: 0xcb39, 0x1e03: 0x8b1d, 0x1e04: 0xcb59, 0x1e05: 0xcb79,\n\t0x1e06: 0xcb99, 0x1e07: 0xcbb9, 0x1e08: 0xcbd9, 0x1e09: 0xcbf9, 0x1e0a: 0xcc19, 0x1e0b: 0xcc39,\n\t0x1e0c: 0xcc59, 0x1e0d: 0x8b3d, 0x1e0e: 0xcc79, 0x1e0f: 0xcc99, 0x1e10: 0xccb9, 0x1e11: 0xccd9,\n\t0x1e12: 0x8b5d, 0x1e13: 0xccf9, 0x1e14: 0xcd19, 0x1e15: 0xc429, 0x1e16: 0x8b7d, 0x1e17: 0xcd39,\n\t0x1e18: 0xcd59, 0x1e19: 0xcd79, 0x1e1a: 0xcd99, 0x1e1b: 0xcdb9, 0x1e1c: 0x8b9d, 0x1e1d: 0xcdd9,\n\t0x1e1e: 0xcdf9, 0x1e1f: 0xce19, 0x1e20: 0xce39, 0x1e21: 0xce59, 0x1e22: 0xc789, 0x1e23: 0xce79,\n\t0x1e24: 0xce99, 0x1e25: 0xceb9, 0x1e26: 0xced9, 0x1e27: 0xcef9, 0x1e28: 0xcf19, 0x1e29: 0xcf39,\n\t0x1e2a: 0xcf59, 0x1e2b: 0xcf79, 0x1e2c: 0xcf99, 0x1e2d: 0xcfb9, 0x1e2e: 0xcfd9, 0x1e2f: 0xcff9,\n\t0x1e30: 0xd019, 0x1e31: 0xd039, 0x1e32: 0xd039, 0x1e33: 0xd039, 0x1e34: 0x8bbd, 0x1e35: 0xd059,\n\t0x1e36: 0xd079, 0x1e37: 0xd099, 0x1e38: 0x8bdd, 0x1e39: 0xd0b9, 0x1e3a: 0xd0d9, 0x1e3b: 0xd0f9,\n\t0x1e3c: 0xd119, 0x1e3d: 0xd139, 0x1e3e: 0xd159, 0x1e3f: 0xd179,\n\t// Block 0x79, offset 0x1e40\n\t0x1e40: 0xd199, 0x1e41: 0xd1b9, 0x1e42: 0xd1d9, 0x1e43: 0xd1f9, 0x1e44: 0xd219, 0x1e45: 0xd239,\n\t0x1e46: 0xd239, 0x1e47: 0xd259, 0x1e48: 0xd279, 0x1e49: 0xd299, 0x1e4a: 0xd2b9, 0x1e4b: 0xd2d9,\n\t0x1e4c: 0xd2f9, 0x1e4d: 0xd319, 0x1e4e: 0xd339, 0x1e4f: 0xd359, 0x1e50: 0xd379, 0x1e51: 0xd399,\n\t0x1e52: 0xd3b9, 0x1e53: 0xd3d9, 0x1e54: 0xd3f9, 0x1e55: 0xd419, 0x1e56: 0xd439, 0x1e57: 0xd459,\n\t0x1e58: 0xd479, 0x1e59: 0x8bfd, 0x1e5a: 0xd499, 0x1e5b: 0xd4b9, 0x1e5c: 0xd4d9, 0x1e5d: 0xc309,\n\t0x1e5e: 0xd4f9, 0x1e5f: 0xd519, 0x1e60: 0x8c1d, 0x1e61: 0x8c3d, 0x1e62: 0xd539, 0x1e63: 0xd559,\n\t0x1e64: 0xd579, 0x1e65: 0xd599, 0x1e66: 0xd5b9, 0x1e67: 0xd5d9, 0x1e68: 0x2040, 0x1e69: 0xd5f9,\n\t0x1e6a: 0xd619, 0x1e6b: 0xd619, 0x1e6c: 0x8c5d, 0x1e6d: 0xd639, 0x1e6e: 0xd659, 0x1e6f: 0xd679,\n\t0x1e70: 0xd699, 0x1e71: 0x8c7d, 0x1e72: 0xd6b9, 0x1e73: 0xd6d9, 0x1e74: 0x2040, 0x1e75: 0xd6f9,\n\t0x1e76: 0xd719, 0x1e77: 0xd739, 0x1e78: 0xd759, 0x1e79: 0xd779, 0x1e7a: 0xd799, 0x1e7b: 0x8c9d,\n\t0x1e7c: 0xd7b9, 0x1e7d: 0x8cbd, 0x1e7e: 0xd7d9, 0x1e7f: 0xd7f9,\n\t// Block 0x7a, offset 0x1e80\n\t0x1e80: 0xd819, 0x1e81: 0xd839, 0x1e82: 0xd859, 0x1e83: 0xd879, 0x1e84: 0xd899, 0x1e85: 0xd8b9,\n\t0x1e86: 0xd8d9, 0x1e87: 0xd8f9, 0x1e88: 0xd919, 0x1e89: 0x8cdd, 0x1e8a: 0xd939, 0x1e8b: 0xd959,\n\t0x1e8c: 0xd979, 0x1e8d: 0xd999, 0x1e8e: 0xd9b9, 0x1e8f: 0x8cfd, 0x1e90: 0xd9d9, 0x1e91: 0x8d1d,\n\t0x1e92: 0x8d3d, 0x1e93: 0xd9f9, 0x1e94: 0xda19, 0x1e95: 0xda19, 0x1e96: 0xda39, 0x1e97: 0x8d5d,\n\t0x1e98: 0x8d7d, 0x1e99: 0xda59, 0x1e9a: 0xda79, 0x1e9b: 0xda99, 0x1e9c: 0xdab9, 0x1e9d: 0xdad9,\n\t0x1e9e: 0xdaf9, 0x1e9f: 0xdb19, 0x1ea0: 0xdb39, 0x1ea1: 0xdb59, 0x1ea2: 0xdb79, 0x1ea3: 0xdb99,\n\t0x1ea4: 0x8d9d, 0x1ea5: 0xdbb9, 0x1ea6: 0xdbd9, 0x1ea7: 0xdbf9, 0x1ea8: 0xdc19, 0x1ea9: 0xdbf9,\n\t0x1eaa: 0xdc39, 0x1eab: 0xdc59, 0x1eac: 0xdc79, 0x1ead: 0xdc99, 0x1eae: 0xdcb9, 0x1eaf: 0xdcd9,\n\t0x1eb0: 0xdcf9, 0x1eb1: 0xdd19, 0x1eb2: 0xdd39, 0x1eb3: 0xdd59, 0x1eb4: 0xdd79, 0x1eb5: 0xdd99,\n\t0x1eb6: 0xddb9, 0x1eb7: 0xddd9, 0x1eb8: 0x8dbd, 0x1eb9: 0xddf9, 0x1eba: 0xde19, 0x1ebb: 0xde39,\n\t0x1ebc: 0xde59, 0x1ebd: 0xde79, 0x1ebe: 0x8ddd, 0x1ebf: 0xde99,\n\t// Block 0x7b, offset 0x1ec0\n\t0x1ec0: 0xe599, 0x1ec1: 0xe5b9, 0x1ec2: 0xe5d9, 0x1ec3: 0xe5f9, 0x1ec4: 0xe619, 0x1ec5: 0xe639,\n\t0x1ec6: 0x8efd, 0x1ec7: 0xe659, 0x1ec8: 0xe679, 0x1ec9: 0xe699, 0x1eca: 0xe6b9, 0x1ecb: 0xe6d9,\n\t0x1ecc: 0xe6f9, 0x1ecd: 0x8f1d, 0x1ece: 0xe719, 0x1ecf: 0xe739, 0x1ed0: 0x8f3d, 0x1ed1: 0x8f5d,\n\t0x1ed2: 0xe759, 0x1ed3: 0xe779, 0x1ed4: 0xe799, 0x1ed5: 0xe7b9, 0x1ed6: 0xe7d9, 0x1ed7: 0xe7f9,\n\t0x1ed8: 0xe819, 0x1ed9: 0xe839, 0x1eda: 0xe859, 0x1edb: 0x8f7d, 0x1edc: 0xe879, 0x1edd: 0x8f9d,\n\t0x1ede: 0xe899, 0x1edf: 0x2040, 0x1ee0: 0xe8b9, 0x1ee1: 0xe8d9, 0x1ee2: 0xe8f9, 0x1ee3: 0x8fbd,\n\t0x1ee4: 0xe919, 0x1ee5: 0xe939, 0x1ee6: 0x8fdd, 0x1ee7: 0x8ffd, 0x1ee8: 0xe959, 0x1ee9: 0xe979,\n\t0x1eea: 0xe999, 0x1eeb: 0xe9b9, 0x1eec: 0xe9d9, 0x1eed: 0xe9d9, 0x1eee: 0xe9f9, 0x1eef: 0xea19,\n\t0x1ef0: 0xea39, 0x1ef1: 0xea59, 0x1ef2: 0xea79, 0x1ef3: 0xea99, 0x1ef4: 0xeab9, 0x1ef5: 0x901d,\n\t0x1ef6: 0xead9, 0x1ef7: 0x903d, 0x1ef8: 0xeaf9, 0x1ef9: 0x905d, 0x1efa: 0xeb19, 0x1efb: 0x907d,\n\t0x1efc: 0x909d, 0x1efd: 0x90bd, 0x1efe: 0xeb39, 0x1eff: 0xeb59,\n\t// Block 0x7c, offset 0x1f00\n\t0x1f00: 0xeb79, 0x1f01: 0x90dd, 0x1f02: 0x90fd, 0x1f03: 0x911d, 0x1f04: 0x913d, 0x1f05: 0xeb99,\n\t0x1f06: 0xebb9, 0x1f07: 0xebb9, 0x1f08: 0xebd9, 0x1f09: 0xebf9, 0x1f0a: 0xec19, 0x1f0b: 0xec39,\n\t0x1f0c: 0xec59, 0x1f0d: 0x915d, 0x1f0e: 0xec79, 0x1f0f: 0xec99, 0x1f10: 0xecb9, 0x1f11: 0xecd9,\n\t0x1f12: 0x917d, 0x1f13: 0xecf9, 0x1f14: 0x919d, 0x1f15: 0x91bd, 0x1f16: 0xed19, 0x1f17: 0xed39,\n\t0x1f18: 0xed59, 0x1f19: 0xed79, 0x1f1a: 0xed99, 0x1f1b: 0xedb9, 0x1f1c: 0x91dd, 0x1f1d: 0x91fd,\n\t0x1f1e: 0x921d, 0x1f1f: 0x2040, 0x1f20: 0xedd9, 0x1f21: 0x923d, 0x1f22: 0xedf9, 0x1f23: 0xee19,\n\t0x1f24: 0xee39, 0x1f25: 0x925d, 0x1f26: 0xee59, 0x1f27: 0xee79, 0x1f28: 0xee99, 0x1f29: 0xeeb9,\n\t0x1f2a: 0xeed9, 0x1f2b: 0x927d, 0x1f2c: 0xeef9, 0x1f2d: 0xef19, 0x1f2e: 0xef39, 0x1f2f: 0xef59,\n\t0x1f30: 0xef79, 0x1f31: 0xef99, 0x1f32: 0x929d, 0x1f33: 0x92bd, 0x1f34: 0xefb9, 0x1f35: 0x92dd,\n\t0x1f36: 0xefd9, 0x1f37: 0x92fd, 0x1f38: 0xeff9, 0x1f39: 0xf019, 0x1f3a: 0xf039, 0x1f3b: 0x931d,\n\t0x1f3c: 0x933d, 0x1f3d: 0xf059, 0x1f3e: 0x935d, 0x1f3f: 0xf079,\n\t// Block 0x7d, offset 0x1f40\n\t0x1f40: 0xf6b9, 0x1f41: 0xf6d9, 0x1f42: 0xf6f9, 0x1f43: 0xf719, 0x1f44: 0xf739, 0x1f45: 0x951d,\n\t0x1f46: 0xf759, 0x1f47: 0xf779, 0x1f48: 0xf799, 0x1f49: 0xf7b9, 0x1f4a: 0xf7d9, 0x1f4b: 0x953d,\n\t0x1f4c: 0x955d, 0x1f4d: 0xf7f9, 0x1f4e: 0xf819, 0x1f4f: 0xf839, 0x1f50: 0xf859, 0x1f51: 0xf879,\n\t0x1f52: 0xf899, 0x1f53: 0x957d, 0x1f54: 0xf8b9, 0x1f55: 0xf8d9, 0x1f56: 0xf8f9, 0x1f57: 0xf919,\n\t0x1f58: 0x959d, 0x1f59: 0x95bd, 0x1f5a: 0xf939, 0x1f5b: 0xf959, 0x1f5c: 0xf979, 0x1f5d: 0x95dd,\n\t0x1f5e: 0xf999, 0x1f5f: 0xf9b9, 0x1f60: 0x6815, 0x1f61: 0x95fd, 0x1f62: 0xf9d9, 0x1f63: 0xf9f9,\n\t0x1f64: 0xfa19, 0x1f65: 0x961d, 0x1f66: 0xfa39, 0x1f67: 0xfa59, 0x1f68: 0xfa79, 0x1f69: 0xfa99,\n\t0x1f6a: 0xfab9, 0x1f6b: 0xfad9, 0x1f6c: 0xfaf9, 0x1f6d: 0x963d, 0x1f6e: 0xfb19, 0x1f6f: 0xfb39,\n\t0x1f70: 0xfb59, 0x1f71: 0x965d, 0x1f72: 0xfb79, 0x1f73: 0xfb99, 0x1f74: 0xfbb9, 0x1f75: 0xfbd9,\n\t0x1f76: 0x7b35, 0x1f77: 0x967d, 0x1f78: 0xfbf9, 0x1f79: 0xfc19, 0x1f7a: 0xfc39, 0x1f7b: 0x969d,\n\t0x1f7c: 0xfc59, 0x1f7d: 0x96bd, 0x1f7e: 0xfc79, 0x1f7f: 0xfc79,\n\t// Block 0x7e, offset 0x1f80\n\t0x1f80: 0xfc99, 0x1f81: 0x96dd, 0x1f82: 0xfcb9, 0x1f83: 0xfcd9, 0x1f84: 0xfcf9, 0x1f85: 0xfd19,\n\t0x1f86: 0xfd39, 0x1f87: 0xfd59, 0x1f88: 0xfd79, 0x1f89: 0x96fd, 0x1f8a: 0xfd99, 0x1f8b: 0xfdb9,\n\t0x1f8c: 0xfdd9, 0x1f8d: 0xfdf9, 0x1f8e: 0xfe19, 0x1f8f: 0xfe39, 0x1f90: 0x971d, 0x1f91: 0xfe59,\n\t0x1f92: 0x973d, 0x1f93: 0x975d, 0x1f94: 0x977d, 0x1f95: 0xfe79, 0x1f96: 0xfe99, 0x1f97: 0xfeb9,\n\t0x1f98: 0xfed9, 0x1f99: 0xfef9, 0x1f9a: 0xff19, 0x1f9b: 0xff39, 0x1f9c: 0xff59, 0x1f9d: 0x979d,\n\t0x1f9e: 0x0040, 0x1f9f: 0x0040, 0x1fa0: 0x0040, 0x1fa1: 0x0040, 0x1fa2: 0x0040, 0x1fa3: 0x0040,\n\t0x1fa4: 0x0040, 0x1fa5: 0x0040, 0x1fa6: 0x0040, 0x1fa7: 0x0040, 0x1fa8: 0x0040, 0x1fa9: 0x0040,\n\t0x1faa: 0x0040, 0x1fab: 0x0040, 0x1fac: 0x0040, 0x1fad: 0x0040, 0x1fae: 0x0040, 0x1faf: 0x0040,\n\t0x1fb0: 0x0040, 0x1fb1: 0x0040, 0x1fb2: 0x0040, 0x1fb3: 0x0040, 0x1fb4: 0x0040, 0x1fb5: 0x0040,\n\t0x1fb6: 0x0040, 0x1fb7: 0x0040, 0x1fb8: 0x0040, 0x1fb9: 0x0040, 0x1fba: 0x0040, 0x1fbb: 0x0040,\n\t0x1fbc: 0x0040, 0x1fbd: 0x0040, 0x1fbe: 0x0040, 0x1fbf: 0x0040,\n}\n\n// idnaIndex: 36 blocks, 2304 entries, 4608 bytes\n// Block 0 is the zero block.\nvar idnaIndex = [2304]uint16{\n\t// Block 0x0, offset 0x0\n\t// Block 0x1, offset 0x40\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc2: 0x01, 0xc3: 0x7d, 0xc4: 0x02, 0xc5: 0x03, 0xc6: 0x04, 0xc7: 0x05,\n\t0xc8: 0x06, 0xc9: 0x7e, 0xca: 0x7f, 0xcb: 0x07, 0xcc: 0x80, 0xcd: 0x08, 0xce: 0x09, 0xcf: 0x0a,\n\t0xd0: 0x81, 0xd1: 0x0b, 0xd2: 0x0c, 0xd3: 0x0d, 0xd4: 0x0e, 0xd5: 0x82, 0xd6: 0x83, 0xd7: 0x84,\n\t0xd8: 0x0f, 0xd9: 0x10, 0xda: 0x85, 0xdb: 0x11, 0xdc: 0x12, 0xdd: 0x86, 0xde: 0x87, 0xdf: 0x88,\n\t0xe0: 0x02, 0xe1: 0x03, 0xe2: 0x04, 0xe3: 0x05, 0xe4: 0x06, 0xe5: 0x07, 0xe6: 0x07, 0xe7: 0x07,\n\t0xe8: 0x07, 0xe9: 0x08, 0xea: 0x09, 0xeb: 0x07, 0xec: 0x07, 0xed: 0x0a, 0xee: 0x0b, 0xef: 0x0c,\n\t0xf0: 0x1d, 0xf1: 0x1e, 0xf2: 0x1e, 0xf3: 0x20, 0xf4: 0x21,\n\t// Block 0x4, offset 0x100\n\t0x120: 0x89, 0x121: 0x13, 0x122: 0x8a, 0x123: 0x8b, 0x124: 0x8c, 0x125: 0x14, 0x126: 0x15, 0x127: 0x16,\n\t0x128: 0x17, 0x129: 0x18, 0x12a: 0x19, 0x12b: 0x1a, 0x12c: 0x1b, 0x12d: 0x1c, 0x12e: 0x1d, 0x12f: 0x8d,\n\t0x130: 0x8e, 0x131: 0x1e, 0x132: 0x1f, 0x133: 0x20, 0x134: 0x8f, 0x135: 0x21, 0x136: 0x90, 0x137: 0x91,\n\t0x138: 0x92, 0x139: 0x93, 0x13a: 0x22, 0x13b: 0x94, 0x13c: 0x95, 0x13d: 0x23, 0x13e: 0x24, 0x13f: 0x96,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x97, 0x141: 0x98, 0x142: 0x99, 0x143: 0x9a, 0x144: 0x9b, 0x145: 0x9c, 0x146: 0x9d, 0x147: 0x9e,\n\t0x148: 0x9f, 0x149: 0xa0, 0x14a: 0xa1, 0x14b: 0xa2, 0x14c: 0xa3, 0x14d: 0xa4, 0x14e: 0xa5, 0x14f: 0xa6,\n\t0x150: 0xa7, 0x151: 0x9f, 0x152: 0x9f, 0x153: 0x9f, 0x154: 0x9f, 0x155: 0x9f, 0x156: 0x9f, 0x157: 0x9f,\n\t0x158: 0x9f, 0x159: 0xa8, 0x15a: 0xa9, 0x15b: 0xaa, 0x15c: 0xab, 0x15d: 0xac, 0x15e: 0xad, 0x15f: 0xae,\n\t0x160: 0xaf, 0x161: 0xb0, 0x162: 0xb1, 0x163: 0xb2, 0x164: 0xb3, 0x165: 0xb4, 0x166: 0xb5, 0x167: 0xb6,\n\t0x168: 0xb7, 0x169: 0xb8, 0x16a: 0xb9, 0x16b: 0xba, 0x16c: 0xbb, 0x16d: 0xbc, 0x16e: 0xbd, 0x16f: 0xbe,\n\t0x170: 0xbf, 0x171: 0xc0, 0x172: 0xc1, 0x173: 0xc2, 0x174: 0x25, 0x175: 0x26, 0x176: 0x27, 0x177: 0xc3,\n\t0x178: 0x28, 0x179: 0x28, 0x17a: 0x29, 0x17b: 0x28, 0x17c: 0xc4, 0x17d: 0x2a, 0x17e: 0x2b, 0x17f: 0x2c,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x2d, 0x181: 0x2e, 0x182: 0x2f, 0x183: 0xc5, 0x184: 0x30, 0x185: 0x31, 0x186: 0xc6, 0x187: 0x9b,\n\t0x188: 0xc7, 0x189: 0xc8, 0x18a: 0x9b, 0x18b: 0x9b, 0x18c: 0xc9, 0x18d: 0x9b, 0x18e: 0x9b, 0x18f: 0x9b,\n\t0x190: 0xca, 0x191: 0x32, 0x192: 0x33, 0x193: 0x34, 0x194: 0x9b, 0x195: 0x9b, 0x196: 0x9b, 0x197: 0x9b,\n\t0x198: 0x9b, 0x199: 0x9b, 0x19a: 0x9b, 0x19b: 0x9b, 0x19c: 0x9b, 0x19d: 0x9b, 0x19e: 0x9b, 0x19f: 0x9b,\n\t0x1a0: 0x9b, 0x1a1: 0x9b, 0x1a2: 0x9b, 0x1a3: 0x9b, 0x1a4: 0x9b, 0x1a5: 0x9b, 0x1a6: 0x9b, 0x1a7: 0x9b,\n\t0x1a8: 0xcb, 0x1a9: 0xcc, 0x1aa: 0x9b, 0x1ab: 0xcd, 0x1ac: 0x9b, 0x1ad: 0xce, 0x1ae: 0xcf, 0x1af: 0xd0,\n\t0x1b0: 0xd1, 0x1b1: 0x35, 0x1b2: 0x28, 0x1b3: 0x36, 0x1b4: 0xd2, 0x1b5: 0xd3, 0x1b6: 0xd4, 0x1b7: 0xd5,\n\t0x1b8: 0xd6, 0x1b9: 0xd7, 0x1ba: 0xd8, 0x1bb: 0xd9, 0x1bc: 0xda, 0x1bd: 0xdb, 0x1be: 0xdc, 0x1bf: 0x37,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x38, 0x1c1: 0xdd, 0x1c2: 0xde, 0x1c3: 0xdf, 0x1c4: 0xe0, 0x1c5: 0x39, 0x1c6: 0x3a, 0x1c7: 0xe1,\n\t0x1c8: 0xe2, 0x1c9: 0x3b, 0x1ca: 0x3c, 0x1cb: 0x3d, 0x1cc: 0x3e, 0x1cd: 0x3f, 0x1ce: 0x40, 0x1cf: 0x41,\n\t0x1d0: 0x9f, 0x1d1: 0x9f, 0x1d2: 0x9f, 0x1d3: 0x9f, 0x1d4: 0x9f, 0x1d5: 0x9f, 0x1d6: 0x9f, 0x1d7: 0x9f,\n\t0x1d8: 0x9f, 0x1d9: 0x9f, 0x1da: 0x9f, 0x1db: 0x9f, 0x1dc: 0x9f, 0x1dd: 0x9f, 0x1de: 0x9f, 0x1df: 0x9f,\n\t0x1e0: 0x9f, 0x1e1: 0x9f, 0x1e2: 0x9f, 0x1e3: 0x9f, 0x1e4: 0x9f, 0x1e5: 0x9f, 0x1e6: 0x9f, 0x1e7: 0x9f,\n\t0x1e8: 0x9f, 0x1e9: 0x9f, 0x1ea: 0x9f, 0x1eb: 0x9f, 0x1ec: 0x9f, 0x1ed: 0x9f, 0x1ee: 0x9f, 0x1ef: 0x9f,\n\t0x1f0: 0x9f, 0x1f1: 0x9f, 0x1f2: 0x9f, 0x1f3: 0x9f, 0x1f4: 0x9f, 0x1f5: 0x9f, 0x1f6: 0x9f, 0x1f7: 0x9f,\n\t0x1f8: 0x9f, 0x1f9: 0x9f, 0x1fa: 0x9f, 0x1fb: 0x9f, 0x1fc: 0x9f, 0x1fd: 0x9f, 0x1fe: 0x9f, 0x1ff: 0x9f,\n\t// Block 0x8, offset 0x200\n\t0x200: 0x9f, 0x201: 0x9f, 0x202: 0x9f, 0x203: 0x9f, 0x204: 0x9f, 0x205: 0x9f, 0x206: 0x9f, 0x207: 0x9f,\n\t0x208: 0x9f, 0x209: 0x9f, 0x20a: 0x9f, 0x20b: 0x9f, 0x20c: 0x9f, 0x20d: 0x9f, 0x20e: 0x9f, 0x20f: 0x9f,\n\t0x210: 0x9f, 0x211: 0x9f, 0x212: 0x9f, 0x213: 0x9f, 0x214: 0x9f, 0x215: 0x9f, 0x216: 0x9f, 0x217: 0x9f,\n\t0x218: 0x9f, 0x219: 0x9f, 0x21a: 0x9f, 0x21b: 0x9f, 0x21c: 0x9f, 0x21d: 0x9f, 0x21e: 0x9f, 0x21f: 0x9f,\n\t0x220: 0x9f, 0x221: 0x9f, 0x222: 0x9f, 0x223: 0x9f, 0x224: 0x9f, 0x225: 0x9f, 0x226: 0x9f, 0x227: 0x9f,\n\t0x228: 0x9f, 0x229: 0x9f, 0x22a: 0x9f, 0x22b: 0x9f, 0x22c: 0x9f, 0x22d: 0x9f, 0x22e: 0x9f, 0x22f: 0x9f,\n\t0x230: 0x9f, 0x231: 0x9f, 0x232: 0x9f, 0x233: 0x9f, 0x234: 0x9f, 0x235: 0x9f, 0x236: 0xb2, 0x237: 0x9b,\n\t0x238: 0x9f, 0x239: 0x9f, 0x23a: 0x9f, 0x23b: 0x9f, 0x23c: 0x9f, 0x23d: 0x9f, 0x23e: 0x9f, 0x23f: 0x9f,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x9f, 0x241: 0x9f, 0x242: 0x9f, 0x243: 0x9f, 0x244: 0x9f, 0x245: 0x9f, 0x246: 0x9f, 0x247: 0x9f,\n\t0x248: 0x9f, 0x249: 0x9f, 0x24a: 0x9f, 0x24b: 0x9f, 0x24c: 0x9f, 0x24d: 0x9f, 0x24e: 0x9f, 0x24f: 0x9f,\n\t0x250: 0x9f, 0x251: 0x9f, 0x252: 0x9f, 0x253: 0x9f, 0x254: 0x9f, 0x255: 0x9f, 0x256: 0x9f, 0x257: 0x9f,\n\t0x258: 0x9f, 0x259: 0x9f, 0x25a: 0x9f, 0x25b: 0x9f, 0x25c: 0x9f, 0x25d: 0x9f, 0x25e: 0x9f, 0x25f: 0x9f,\n\t0x260: 0x9f, 0x261: 0x9f, 0x262: 0x9f, 0x263: 0x9f, 0x264: 0x9f, 0x265: 0x9f, 0x266: 0x9f, 0x267: 0x9f,\n\t0x268: 0x9f, 0x269: 0x9f, 0x26a: 0x9f, 0x26b: 0x9f, 0x26c: 0x9f, 0x26d: 0x9f, 0x26e: 0x9f, 0x26f: 0x9f,\n\t0x270: 0x9f, 0x271: 0x9f, 0x272: 0x9f, 0x273: 0x9f, 0x274: 0x9f, 0x275: 0x9f, 0x276: 0x9f, 0x277: 0x9f,\n\t0x278: 0x9f, 0x279: 0x9f, 0x27a: 0x9f, 0x27b: 0x9f, 0x27c: 0x9f, 0x27d: 0x9f, 0x27e: 0x9f, 0x27f: 0x9f,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x9f, 0x281: 0x9f, 0x282: 0x9f, 0x283: 0x9f, 0x284: 0x9f, 0x285: 0x9f, 0x286: 0x9f, 0x287: 0x9f,\n\t0x288: 0x9f, 0x289: 0x9f, 0x28a: 0x9f, 0x28b: 0x9f, 0x28c: 0x9f, 0x28d: 0x9f, 0x28e: 0x9f, 0x28f: 0x9f,\n\t0x290: 0x9f, 0x291: 0x9f, 0x292: 0x9f, 0x293: 0x9f, 0x294: 0x9f, 0x295: 0x9f, 0x296: 0x9f, 0x297: 0x9f,\n\t0x298: 0x9f, 0x299: 0x9f, 0x29a: 0x9f, 0x29b: 0x9f, 0x29c: 0x9f, 0x29d: 0x9f, 0x29e: 0x9f, 0x29f: 0x9f,\n\t0x2a0: 0x9f, 0x2a1: 0x9f, 0x2a2: 0x9f, 0x2a3: 0x9f, 0x2a4: 0x9f, 0x2a5: 0x9f, 0x2a6: 0x9f, 0x2a7: 0x9f,\n\t0x2a8: 0x9f, 0x2a9: 0x9f, 0x2aa: 0x9f, 0x2ab: 0x9f, 0x2ac: 0x9f, 0x2ad: 0x9f, 0x2ae: 0x9f, 0x2af: 0x9f,\n\t0x2b0: 0x9f, 0x2b1: 0x9f, 0x2b2: 0x9f, 0x2b3: 0x9f, 0x2b4: 0x9f, 0x2b5: 0x9f, 0x2b6: 0x9f, 0x2b7: 0x9f,\n\t0x2b8: 0x9f, 0x2b9: 0x9f, 0x2ba: 0x9f, 0x2bb: 0x9f, 0x2bc: 0x9f, 0x2bd: 0x9f, 0x2be: 0x9f, 0x2bf: 0xe3,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x9f, 0x2c1: 0x9f, 0x2c2: 0x9f, 0x2c3: 0x9f, 0x2c4: 0x9f, 0x2c5: 0x9f, 0x2c6: 0x9f, 0x2c7: 0x9f,\n\t0x2c8: 0x9f, 0x2c9: 0x9f, 0x2ca: 0x9f, 0x2cb: 0x9f, 0x2cc: 0x9f, 0x2cd: 0x9f, 0x2ce: 0x9f, 0x2cf: 0x9f,\n\t0x2d0: 0x9f, 0x2d1: 0x9f, 0x2d2: 0xe4, 0x2d3: 0xe5, 0x2d4: 0x9f, 0x2d5: 0x9f, 0x2d6: 0x9f, 0x2d7: 0x9f,\n\t0x2d8: 0xe6, 0x2d9: 0x42, 0x2da: 0x43, 0x2db: 0xe7, 0x2dc: 0x44, 0x2dd: 0x45, 0x2de: 0x46, 0x2df: 0xe8,\n\t0x2e0: 0xe9, 0x2e1: 0xea, 0x2e2: 0xeb, 0x2e3: 0xec, 0x2e4: 0xed, 0x2e5: 0xee, 0x2e6: 0xef, 0x2e7: 0xf0,\n\t0x2e8: 0xf1, 0x2e9: 0xf2, 0x2ea: 0xf3, 0x2eb: 0xf4, 0x2ec: 0xf5, 0x2ed: 0xf6, 0x2ee: 0xf7, 0x2ef: 0xf8,\n\t0x2f0: 0x9f, 0x2f1: 0x9f, 0x2f2: 0x9f, 0x2f3: 0x9f, 0x2f4: 0x9f, 0x2f5: 0x9f, 0x2f6: 0x9f, 0x2f7: 0x9f,\n\t0x2f8: 0x9f, 0x2f9: 0x9f, 0x2fa: 0x9f, 0x2fb: 0x9f, 0x2fc: 0x9f, 0x2fd: 0x9f, 0x2fe: 0x9f, 0x2ff: 0x9f,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x9f, 0x301: 0x9f, 0x302: 0x9f, 0x303: 0x9f, 0x304: 0x9f, 0x305: 0x9f, 0x306: 0x9f, 0x307: 0x9f,\n\t0x308: 0x9f, 0x309: 0x9f, 0x30a: 0x9f, 0x30b: 0x9f, 0x30c: 0x9f, 0x30d: 0x9f, 0x30e: 0x9f, 0x30f: 0x9f,\n\t0x310: 0x9f, 0x311: 0x9f, 0x312: 0x9f, 0x313: 0x9f, 0x314: 0x9f, 0x315: 0x9f, 0x316: 0x9f, 0x317: 0x9f,\n\t0x318: 0x9f, 0x319: 0x9f, 0x31a: 0x9f, 0x31b: 0x9f, 0x31c: 0x9f, 0x31d: 0x9f, 0x31e: 0xf9, 0x31f: 0xfa,\n\t// Block 0xd, offset 0x340\n\t0x340: 0xba, 0x341: 0xba, 0x342: 0xba, 0x343: 0xba, 0x344: 0xba, 0x345: 0xba, 0x346: 0xba, 0x347: 0xba,\n\t0x348: 0xba, 0x349: 0xba, 0x34a: 0xba, 0x34b: 0xba, 0x34c: 0xba, 0x34d: 0xba, 0x34e: 0xba, 0x34f: 0xba,\n\t0x350: 0xba, 0x351: 0xba, 0x352: 0xba, 0x353: 0xba, 0x354: 0xba, 0x355: 0xba, 0x356: 0xba, 0x357: 0xba,\n\t0x358: 0xba, 0x359: 0xba, 0x35a: 0xba, 0x35b: 0xba, 0x35c: 0xba, 0x35d: 0xba, 0x35e: 0xba, 0x35f: 0xba,\n\t0x360: 0xba, 0x361: 0xba, 0x362: 0xba, 0x363: 0xba, 0x364: 0xba, 0x365: 0xba, 0x366: 0xba, 0x367: 0xba,\n\t0x368: 0xba, 0x369: 0xba, 0x36a: 0xba, 0x36b: 0xba, 0x36c: 0xba, 0x36d: 0xba, 0x36e: 0xba, 0x36f: 0xba,\n\t0x370: 0xba, 0x371: 0xba, 0x372: 0xba, 0x373: 0xba, 0x374: 0xba, 0x375: 0xba, 0x376: 0xba, 0x377: 0xba,\n\t0x378: 0xba, 0x379: 0xba, 0x37a: 0xba, 0x37b: 0xba, 0x37c: 0xba, 0x37d: 0xba, 0x37e: 0xba, 0x37f: 0xba,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xba, 0x381: 0xba, 0x382: 0xba, 0x383: 0xba, 0x384: 0xba, 0x385: 0xba, 0x386: 0xba, 0x387: 0xba,\n\t0x388: 0xba, 0x389: 0xba, 0x38a: 0xba, 0x38b: 0xba, 0x38c: 0xba, 0x38d: 0xba, 0x38e: 0xba, 0x38f: 0xba,\n\t0x390: 0xba, 0x391: 0xba, 0x392: 0xba, 0x393: 0xba, 0x394: 0xba, 0x395: 0xba, 0x396: 0xba, 0x397: 0xba,\n\t0x398: 0xba, 0x399: 0xba, 0x39a: 0xba, 0x39b: 0xba, 0x39c: 0xba, 0x39d: 0xba, 0x39e: 0xba, 0x39f: 0xba,\n\t0x3a0: 0xba, 0x3a1: 0xba, 0x3a2: 0xba, 0x3a3: 0xba, 0x3a4: 0xfb, 0x3a5: 0xfc, 0x3a6: 0xfd, 0x3a7: 0xfe,\n\t0x3a8: 0x47, 0x3a9: 0xff, 0x3aa: 0x100, 0x3ab: 0x48, 0x3ac: 0x49, 0x3ad: 0x4a, 0x3ae: 0x4b, 0x3af: 0x4c,\n\t0x3b0: 0x101, 0x3b1: 0x4d, 0x3b2: 0x4e, 0x3b3: 0x4f, 0x3b4: 0x50, 0x3b5: 0x51, 0x3b6: 0x102, 0x3b7: 0x52,\n\t0x3b8: 0x53, 0x3b9: 0x54, 0x3ba: 0x55, 0x3bb: 0x56, 0x3bc: 0x57, 0x3bd: 0x58, 0x3be: 0x59, 0x3bf: 0x5a,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x103, 0x3c1: 0x104, 0x3c2: 0x9f, 0x3c3: 0x105, 0x3c4: 0x106, 0x3c5: 0x9b, 0x3c6: 0x107, 0x3c7: 0x108,\n\t0x3c8: 0xba, 0x3c9: 0xba, 0x3ca: 0x109, 0x3cb: 0x10a, 0x3cc: 0x10b, 0x3cd: 0x10c, 0x3ce: 0x10d, 0x3cf: 0x10e,\n\t0x3d0: 0x10f, 0x3d1: 0x9f, 0x3d2: 0x110, 0x3d3: 0x111, 0x3d4: 0x112, 0x3d5: 0x113, 0x3d6: 0xba, 0x3d7: 0xba,\n\t0x3d8: 0x9f, 0x3d9: 0x9f, 0x3da: 0x9f, 0x3db: 0x9f, 0x3dc: 0x114, 0x3dd: 0x115, 0x3de: 0xba, 0x3df: 0xba,\n\t0x3e0: 0x116, 0x3e1: 0x117, 0x3e2: 0x118, 0x3e3: 0x119, 0x3e4: 0x11a, 0x3e5: 0xba, 0x3e6: 0x11b, 0x3e7: 0x11c,\n\t0x3e8: 0x11d, 0x3e9: 0x11e, 0x3ea: 0x11f, 0x3eb: 0x5b, 0x3ec: 0x120, 0x3ed: 0x121, 0x3ee: 0x5c, 0x3ef: 0xba,\n\t0x3f0: 0x122, 0x3f1: 0x123, 0x3f2: 0x124, 0x3f3: 0x125, 0x3f4: 0x126, 0x3f5: 0xba, 0x3f6: 0xba, 0x3f7: 0xba,\n\t0x3f8: 0xba, 0x3f9: 0x127, 0x3fa: 0xba, 0x3fb: 0xba, 0x3fc: 0x128, 0x3fd: 0x129, 0x3fe: 0xba, 0x3ff: 0xba,\n\t// Block 0x10, offset 0x400\n\t0x400: 0x12a, 0x401: 0x12b, 0x402: 0x12c, 0x403: 0x12d, 0x404: 0x12e, 0x405: 0x12f, 0x406: 0x130, 0x407: 0x131,\n\t0x408: 0x132, 0x409: 0xba, 0x40a: 0x133, 0x40b: 0x134, 0x40c: 0x5d, 0x40d: 0x5e, 0x40e: 0xba, 0x40f: 0xba,\n\t0x410: 0x135, 0x411: 0x136, 0x412: 0x137, 0x413: 0x138, 0x414: 0xba, 0x415: 0xba, 0x416: 0x139, 0x417: 0x13a,\n\t0x418: 0x13b, 0x419: 0x13c, 0x41a: 0x13d, 0x41b: 0x13e, 0x41c: 0x13f, 0x41d: 0xba, 0x41e: 0xba, 0x41f: 0xba,\n\t0x420: 0x140, 0x421: 0xba, 0x422: 0x141, 0x423: 0x142, 0x424: 0xba, 0x425: 0xba, 0x426: 0xba, 0x427: 0xba,\n\t0x428: 0x143, 0x429: 0x144, 0x42a: 0x145, 0x42b: 0x146, 0x42c: 0xba, 0x42d: 0xba, 0x42e: 0xba, 0x42f: 0xba,\n\t0x430: 0x147, 0x431: 0x148, 0x432: 0x149, 0x433: 0xba, 0x434: 0x14a, 0x435: 0x14b, 0x436: 0x14c, 0x437: 0xba,\n\t0x438: 0xba, 0x439: 0xba, 0x43a: 0xba, 0x43b: 0x14d, 0x43c: 0xba, 0x43d: 0xba, 0x43e: 0xba, 0x43f: 0xba,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x9f, 0x441: 0x9f, 0x442: 0x9f, 0x443: 0x9f, 0x444: 0x9f, 0x445: 0x9f, 0x446: 0x9f, 0x447: 0x9f,\n\t0x448: 0x9f, 0x449: 0x9f, 0x44a: 0x9f, 0x44b: 0x9f, 0x44c: 0x9f, 0x44d: 0x9f, 0x44e: 0x14e, 0x44f: 0xba,\n\t0x450: 0x9b, 0x451: 0x14f, 0x452: 0x9f, 0x453: 0x9f, 0x454: 0x9f, 0x455: 0x150, 0x456: 0xba, 0x457: 0xba,\n\t0x458: 0xba, 0x459: 0xba, 0x45a: 0xba, 0x45b: 0xba, 0x45c: 0xba, 0x45d: 0xba, 0x45e: 0xba, 0x45f: 0xba,\n\t0x460: 0xba, 0x461: 0xba, 0x462: 0xba, 0x463: 0xba, 0x464: 0xba, 0x465: 0xba, 0x466: 0xba, 0x467: 0xba,\n\t0x468: 0xba, 0x469: 0xba, 0x46a: 0xba, 0x46b: 0xba, 0x46c: 0xba, 0x46d: 0xba, 0x46e: 0xba, 0x46f: 0xba,\n\t0x470: 0xba, 0x471: 0xba, 0x472: 0xba, 0x473: 0xba, 0x474: 0xba, 0x475: 0xba, 0x476: 0xba, 0x477: 0xba,\n\t0x478: 0xba, 0x479: 0xba, 0x47a: 0xba, 0x47b: 0xba, 0x47c: 0xba, 0x47d: 0xba, 0x47e: 0xba, 0x47f: 0xba,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x9f, 0x481: 0x9f, 0x482: 0x9f, 0x483: 0x9f, 0x484: 0x9f, 0x485: 0x9f, 0x486: 0x9f, 0x487: 0x9f,\n\t0x488: 0x9f, 0x489: 0x9f, 0x48a: 0x9f, 0x48b: 0x9f, 0x48c: 0x9f, 0x48d: 0x9f, 0x48e: 0x9f, 0x48f: 0x9f,\n\t0x490: 0x151, 0x491: 0xba, 0x492: 0xba, 0x493: 0xba, 0x494: 0xba, 0x495: 0xba, 0x496: 0xba, 0x497: 0xba,\n\t0x498: 0xba, 0x499: 0xba, 0x49a: 0xba, 0x49b: 0xba, 0x49c: 0xba, 0x49d: 0xba, 0x49e: 0xba, 0x49f: 0xba,\n\t0x4a0: 0xba, 0x4a1: 0xba, 0x4a2: 0xba, 0x4a3: 0xba, 0x4a4: 0xba, 0x4a5: 0xba, 0x4a6: 0xba, 0x4a7: 0xba,\n\t0x4a8: 0xba, 0x4a9: 0xba, 0x4aa: 0xba, 0x4ab: 0xba, 0x4ac: 0xba, 0x4ad: 0xba, 0x4ae: 0xba, 0x4af: 0xba,\n\t0x4b0: 0xba, 0x4b1: 0xba, 0x4b2: 0xba, 0x4b3: 0xba, 0x4b4: 0xba, 0x4b5: 0xba, 0x4b6: 0xba, 0x4b7: 0xba,\n\t0x4b8: 0xba, 0x4b9: 0xba, 0x4ba: 0xba, 0x4bb: 0xba, 0x4bc: 0xba, 0x4bd: 0xba, 0x4be: 0xba, 0x4bf: 0xba,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0xba, 0x4c1: 0xba, 0x4c2: 0xba, 0x4c3: 0xba, 0x4c4: 0xba, 0x4c5: 0xba, 0x4c6: 0xba, 0x4c7: 0xba,\n\t0x4c8: 0xba, 0x4c9: 0xba, 0x4ca: 0xba, 0x4cb: 0xba, 0x4cc: 0xba, 0x4cd: 0xba, 0x4ce: 0xba, 0x4cf: 0xba,\n\t0x4d0: 0x9f, 0x4d1: 0x9f, 0x4d2: 0x9f, 0x4d3: 0x9f, 0x4d4: 0x9f, 0x4d5: 0x9f, 0x4d6: 0x9f, 0x4d7: 0x9f,\n\t0x4d8: 0x9f, 0x4d9: 0x152, 0x4da: 0xba, 0x4db: 0xba, 0x4dc: 0xba, 0x4dd: 0xba, 0x4de: 0xba, 0x4df: 0xba,\n\t0x4e0: 0xba, 0x4e1: 0xba, 0x4e2: 0xba, 0x4e3: 0xba, 0x4e4: 0xba, 0x4e5: 0xba, 0x4e6: 0xba, 0x4e7: 0xba,\n\t0x4e8: 0xba, 0x4e9: 0xba, 0x4ea: 0xba, 0x4eb: 0xba, 0x4ec: 0xba, 0x4ed: 0xba, 0x4ee: 0xba, 0x4ef: 0xba,\n\t0x4f0: 0xba, 0x4f1: 0xba, 0x4f2: 0xba, 0x4f3: 0xba, 0x4f4: 0xba, 0x4f5: 0xba, 0x4f6: 0xba, 0x4f7: 0xba,\n\t0x4f8: 0xba, 0x4f9: 0xba, 0x4fa: 0xba, 0x4fb: 0xba, 0x4fc: 0xba, 0x4fd: 0xba, 0x4fe: 0xba, 0x4ff: 0xba,\n\t// Block 0x14, offset 0x500\n\t0x500: 0xba, 0x501: 0xba, 0x502: 0xba, 0x503: 0xba, 0x504: 0xba, 0x505: 0xba, 0x506: 0xba, 0x507: 0xba,\n\t0x508: 0xba, 0x509: 0xba, 0x50a: 0xba, 0x50b: 0xba, 0x50c: 0xba, 0x50d: 0xba, 0x50e: 0xba, 0x50f: 0xba,\n\t0x510: 0xba, 0x511: 0xba, 0x512: 0xba, 0x513: 0xba, 0x514: 0xba, 0x515: 0xba, 0x516: 0xba, 0x517: 0xba,\n\t0x518: 0xba, 0x519: 0xba, 0x51a: 0xba, 0x51b: 0xba, 0x51c: 0xba, 0x51d: 0xba, 0x51e: 0xba, 0x51f: 0xba,\n\t0x520: 0x9f, 0x521: 0x9f, 0x522: 0x9f, 0x523: 0x9f, 0x524: 0x9f, 0x525: 0x9f, 0x526: 0x9f, 0x527: 0x9f,\n\t0x528: 0x146, 0x529: 0x153, 0x52a: 0xba, 0x52b: 0x154, 0x52c: 0x155, 0x52d: 0x156, 0x52e: 0x157, 0x52f: 0xba,\n\t0x530: 0xba, 0x531: 0xba, 0x532: 0xba, 0x533: 0xba, 0x534: 0xba, 0x535: 0xba, 0x536: 0xba, 0x537: 0xba,\n\t0x538: 0xba, 0x539: 0x158, 0x53a: 0x159, 0x53b: 0xba, 0x53c: 0x9f, 0x53d: 0x15a, 0x53e: 0x15b, 0x53f: 0x15c,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x9f, 0x541: 0x9f, 0x542: 0x9f, 0x543: 0x9f, 0x544: 0x9f, 0x545: 0x9f, 0x546: 0x9f, 0x547: 0x9f,\n\t0x548: 0x9f, 0x549: 0x9f, 0x54a: 0x9f, 0x54b: 0x9f, 0x54c: 0x9f, 0x54d: 0x9f, 0x54e: 0x9f, 0x54f: 0x9f,\n\t0x550: 0x9f, 0x551: 0x9f, 0x552: 0x9f, 0x553: 0x9f, 0x554: 0x9f, 0x555: 0x9f, 0x556: 0x9f, 0x557: 0x9f,\n\t0x558: 0x9f, 0x559: 0x9f, 0x55a: 0x9f, 0x55b: 0x9f, 0x55c: 0x9f, 0x55d: 0x9f, 0x55e: 0x9f, 0x55f: 0x15d,\n\t0x560: 0x9f, 0x561: 0x9f, 0x562: 0x9f, 0x563: 0x9f, 0x564: 0x9f, 0x565: 0x9f, 0x566: 0x9f, 0x567: 0x9f,\n\t0x568: 0x9f, 0x569: 0x9f, 0x56a: 0x9f, 0x56b: 0x15e, 0x56c: 0xba, 0x56d: 0xba, 0x56e: 0xba, 0x56f: 0xba,\n\t0x570: 0xba, 0x571: 0xba, 0x572: 0xba, 0x573: 0xba, 0x574: 0xba, 0x575: 0xba, 0x576: 0xba, 0x577: 0xba,\n\t0x578: 0xba, 0x579: 0xba, 0x57a: 0xba, 0x57b: 0xba, 0x57c: 0xba, 0x57d: 0xba, 0x57e: 0xba, 0x57f: 0xba,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x9f, 0x581: 0x9f, 0x582: 0x9f, 0x583: 0x9f, 0x584: 0x15f, 0x585: 0x160, 0x586: 0x9f, 0x587: 0x9f,\n\t0x588: 0x9f, 0x589: 0x9f, 0x58a: 0x9f, 0x58b: 0x161, 0x58c: 0xba, 0x58d: 0xba, 0x58e: 0xba, 0x58f: 0xba,\n\t0x590: 0xba, 0x591: 0xba, 0x592: 0xba, 0x593: 0xba, 0x594: 0xba, 0x595: 0xba, 0x596: 0xba, 0x597: 0xba,\n\t0x598: 0xba, 0x599: 0xba, 0x59a: 0xba, 0x59b: 0xba, 0x59c: 0xba, 0x59d: 0xba, 0x59e: 0xba, 0x59f: 0xba,\n\t0x5a0: 0xba, 0x5a1: 0xba, 0x5a2: 0xba, 0x5a3: 0xba, 0x5a4: 0xba, 0x5a5: 0xba, 0x5a6: 0xba, 0x5a7: 0xba,\n\t0x5a8: 0xba, 0x5a9: 0xba, 0x5aa: 0xba, 0x5ab: 0xba, 0x5ac: 0xba, 0x5ad: 0xba, 0x5ae: 0xba, 0x5af: 0xba,\n\t0x5b0: 0x9f, 0x5b1: 0x162, 0x5b2: 0x163, 0x5b3: 0xba, 0x5b4: 0xba, 0x5b5: 0xba, 0x5b6: 0xba, 0x5b7: 0xba,\n\t0x5b8: 0xba, 0x5b9: 0xba, 0x5ba: 0xba, 0x5bb: 0xba, 0x5bc: 0xba, 0x5bd: 0xba, 0x5be: 0xba, 0x5bf: 0xba,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x9b, 0x5c1: 0x9b, 0x5c2: 0x9b, 0x5c3: 0x164, 0x5c4: 0x165, 0x5c5: 0x166, 0x5c6: 0x167, 0x5c7: 0x168,\n\t0x5c8: 0x9b, 0x5c9: 0x169, 0x5ca: 0xba, 0x5cb: 0x16a, 0x5cc: 0x9b, 0x5cd: 0x16b, 0x5ce: 0xba, 0x5cf: 0xba,\n\t0x5d0: 0x5f, 0x5d1: 0x60, 0x5d2: 0x61, 0x5d3: 0x62, 0x5d4: 0x63, 0x5d5: 0x64, 0x5d6: 0x65, 0x5d7: 0x66,\n\t0x5d8: 0x67, 0x5d9: 0x68, 0x5da: 0x69, 0x5db: 0x6a, 0x5dc: 0x6b, 0x5dd: 0x6c, 0x5de: 0x6d, 0x5df: 0x6e,\n\t0x5e0: 0x9b, 0x5e1: 0x9b, 0x5e2: 0x9b, 0x5e3: 0x9b, 0x5e4: 0x9b, 0x5e5: 0x9b, 0x5e6: 0x9b, 0x5e7: 0x9b,\n\t0x5e8: 0x16c, 0x5e9: 0x16d, 0x5ea: 0x16e, 0x5eb: 0xba, 0x5ec: 0xba, 0x5ed: 0xba, 0x5ee: 0xba, 0x5ef: 0xba,\n\t0x5f0: 0xba, 0x5f1: 0xba, 0x5f2: 0xba, 0x5f3: 0xba, 0x5f4: 0xba, 0x5f5: 0xba, 0x5f6: 0xba, 0x5f7: 0xba,\n\t0x5f8: 0xba, 0x5f9: 0xba, 0x5fa: 0xba, 0x5fb: 0xba, 0x5fc: 0xba, 0x5fd: 0xba, 0x5fe: 0xba, 0x5ff: 0xba,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x16f, 0x601: 0xba, 0x602: 0xba, 0x603: 0xba, 0x604: 0xba, 0x605: 0xba, 0x606: 0xba, 0x607: 0xba,\n\t0x608: 0xba, 0x609: 0xba, 0x60a: 0xba, 0x60b: 0xba, 0x60c: 0xba, 0x60d: 0xba, 0x60e: 0xba, 0x60f: 0xba,\n\t0x610: 0xba, 0x611: 0xba, 0x612: 0xba, 0x613: 0xba, 0x614: 0xba, 0x615: 0xba, 0x616: 0xba, 0x617: 0xba,\n\t0x618: 0xba, 0x619: 0xba, 0x61a: 0xba, 0x61b: 0xba, 0x61c: 0xba, 0x61d: 0xba, 0x61e: 0xba, 0x61f: 0xba,\n\t0x620: 0x122, 0x621: 0x122, 0x622: 0x122, 0x623: 0x170, 0x624: 0x6f, 0x625: 0x171, 0x626: 0xba, 0x627: 0xba,\n\t0x628: 0xba, 0x629: 0xba, 0x62a: 0xba, 0x62b: 0xba, 0x62c: 0xba, 0x62d: 0xba, 0x62e: 0xba, 0x62f: 0xba,\n\t0x630: 0xba, 0x631: 0x172, 0x632: 0x173, 0x633: 0xba, 0x634: 0xba, 0x635: 0xba, 0x636: 0xba, 0x637: 0xba,\n\t0x638: 0x70, 0x639: 0x71, 0x63a: 0x72, 0x63b: 0x174, 0x63c: 0xba, 0x63d: 0xba, 0x63e: 0xba, 0x63f: 0xba,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x175, 0x641: 0x9b, 0x642: 0x176, 0x643: 0x177, 0x644: 0x73, 0x645: 0x74, 0x646: 0x178, 0x647: 0x179,\n\t0x648: 0x75, 0x649: 0x17a, 0x64a: 0xba, 0x64b: 0xba, 0x64c: 0x9b, 0x64d: 0x9b, 0x64e: 0x9b, 0x64f: 0x9b,\n\t0x650: 0x9b, 0x651: 0x9b, 0x652: 0x9b, 0x653: 0x9b, 0x654: 0x9b, 0x655: 0x9b, 0x656: 0x9b, 0x657: 0x9b,\n\t0x658: 0x9b, 0x659: 0x9b, 0x65a: 0x9b, 0x65b: 0x17b, 0x65c: 0x9b, 0x65d: 0x17c, 0x65e: 0x9b, 0x65f: 0x17d,\n\t0x660: 0x17e, 0x661: 0x17f, 0x662: 0x180, 0x663: 0xba, 0x664: 0x181, 0x665: 0x182, 0x666: 0x183, 0x667: 0x184,\n\t0x668: 0xba, 0x669: 0x185, 0x66a: 0xba, 0x66b: 0xba, 0x66c: 0xba, 0x66d: 0xba, 0x66e: 0xba, 0x66f: 0xba,\n\t0x670: 0xba, 0x671: 0xba, 0x672: 0xba, 0x673: 0xba, 0x674: 0xba, 0x675: 0xba, 0x676: 0xba, 0x677: 0xba,\n\t0x678: 0xba, 0x679: 0xba, 0x67a: 0xba, 0x67b: 0xba, 0x67c: 0xba, 0x67d: 0xba, 0x67e: 0xba, 0x67f: 0xba,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x9f, 0x681: 0x9f, 0x682: 0x9f, 0x683: 0x9f, 0x684: 0x9f, 0x685: 0x9f, 0x686: 0x9f, 0x687: 0x9f,\n\t0x688: 0x9f, 0x689: 0x9f, 0x68a: 0x9f, 0x68b: 0x9f, 0x68c: 0x9f, 0x68d: 0x9f, 0x68e: 0x9f, 0x68f: 0x9f,\n\t0x690: 0x9f, 0x691: 0x9f, 0x692: 0x9f, 0x693: 0x9f, 0x694: 0x9f, 0x695: 0x9f, 0x696: 0x9f, 0x697: 0x9f,\n\t0x698: 0x9f, 0x699: 0x9f, 0x69a: 0x9f, 0x69b: 0x186, 0x69c: 0x9f, 0x69d: 0x9f, 0x69e: 0x9f, 0x69f: 0x9f,\n\t0x6a0: 0x9f, 0x6a1: 0x9f, 0x6a2: 0x9f, 0x6a3: 0x9f, 0x6a4: 0x9f, 0x6a5: 0x9f, 0x6a6: 0x9f, 0x6a7: 0x9f,\n\t0x6a8: 0x9f, 0x6a9: 0x9f, 0x6aa: 0x9f, 0x6ab: 0x9f, 0x6ac: 0x9f, 0x6ad: 0x9f, 0x6ae: 0x9f, 0x6af: 0x9f,\n\t0x6b0: 0x9f, 0x6b1: 0x9f, 0x6b2: 0x9f, 0x6b3: 0x9f, 0x6b4: 0x9f, 0x6b5: 0x9f, 0x6b6: 0x9f, 0x6b7: 0x9f,\n\t0x6b8: 0x9f, 0x6b9: 0x9f, 0x6ba: 0x9f, 0x6bb: 0x9f, 0x6bc: 0x9f, 0x6bd: 0x9f, 0x6be: 0x9f, 0x6bf: 0x9f,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x9f, 0x6c1: 0x9f, 0x6c2: 0x9f, 0x6c3: 0x9f, 0x6c4: 0x9f, 0x6c5: 0x9f, 0x6c6: 0x9f, 0x6c7: 0x9f,\n\t0x6c8: 0x9f, 0x6c9: 0x9f, 0x6ca: 0x9f, 0x6cb: 0x9f, 0x6cc: 0x9f, 0x6cd: 0x9f, 0x6ce: 0x9f, 0x6cf: 0x9f,\n\t0x6d0: 0x9f, 0x6d1: 0x9f, 0x6d2: 0x9f, 0x6d3: 0x9f, 0x6d4: 0x9f, 0x6d5: 0x9f, 0x6d6: 0x9f, 0x6d7: 0x9f,\n\t0x6d8: 0x9f, 0x6d9: 0x9f, 0x6da: 0x9f, 0x6db: 0x9f, 0x6dc: 0x187, 0x6dd: 0x9f, 0x6de: 0x9f, 0x6df: 0x9f,\n\t0x6e0: 0x188, 0x6e1: 0x9f, 0x6e2: 0x9f, 0x6e3: 0x9f, 0x6e4: 0x9f, 0x6e5: 0x9f, 0x6e6: 0x9f, 0x6e7: 0x9f,\n\t0x6e8: 0x9f, 0x6e9: 0x9f, 0x6ea: 0x9f, 0x6eb: 0x9f, 0x6ec: 0x9f, 0x6ed: 0x9f, 0x6ee: 0x9f, 0x6ef: 0x9f,\n\t0x6f0: 0x9f, 0x6f1: 0x9f, 0x6f2: 0x9f, 0x6f3: 0x9f, 0x6f4: 0x9f, 0x6f5: 0x9f, 0x6f6: 0x9f, 0x6f7: 0x9f,\n\t0x6f8: 0x9f, 0x6f9: 0x9f, 0x6fa: 0x9f, 0x6fb: 0x9f, 0x6fc: 0x9f, 0x6fd: 0x9f, 0x6fe: 0x9f, 0x6ff: 0x9f,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x9f, 0x701: 0x9f, 0x702: 0x9f, 0x703: 0x9f, 0x704: 0x9f, 0x705: 0x9f, 0x706: 0x9f, 0x707: 0x9f,\n\t0x708: 0x9f, 0x709: 0x9f, 0x70a: 0x9f, 0x70b: 0x9f, 0x70c: 0x9f, 0x70d: 0x9f, 0x70e: 0x9f, 0x70f: 0x9f,\n\t0x710: 0x9f, 0x711: 0x9f, 0x712: 0x9f, 0x713: 0x9f, 0x714: 0x9f, 0x715: 0x9f, 0x716: 0x9f, 0x717: 0x9f,\n\t0x718: 0x9f, 0x719: 0x9f, 0x71a: 0x9f, 0x71b: 0x9f, 0x71c: 0x9f, 0x71d: 0x9f, 0x71e: 0x9f, 0x71f: 0x9f,\n\t0x720: 0x9f, 0x721: 0x9f, 0x722: 0x9f, 0x723: 0x9f, 0x724: 0x9f, 0x725: 0x9f, 0x726: 0x9f, 0x727: 0x9f,\n\t0x728: 0x9f, 0x729: 0x9f, 0x72a: 0x9f, 0x72b: 0x9f, 0x72c: 0x9f, 0x72d: 0x9f, 0x72e: 0x9f, 0x72f: 0x9f,\n\t0x730: 0x9f, 0x731: 0x9f, 0x732: 0x9f, 0x733: 0x9f, 0x734: 0x9f, 0x735: 0x9f, 0x736: 0x9f, 0x737: 0x9f,\n\t0x738: 0x9f, 0x739: 0x9f, 0x73a: 0x189, 0x73b: 0x9f, 0x73c: 0x9f, 0x73d: 0x9f, 0x73e: 0x9f, 0x73f: 0x9f,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0x9f, 0x741: 0x9f, 0x742: 0x9f, 0x743: 0x9f, 0x744: 0x9f, 0x745: 0x9f, 0x746: 0x9f, 0x747: 0x9f,\n\t0x748: 0x9f, 0x749: 0x9f, 0x74a: 0x9f, 0x74b: 0x9f, 0x74c: 0x9f, 0x74d: 0x9f, 0x74e: 0x9f, 0x74f: 0x9f,\n\t0x750: 0x9f, 0x751: 0x9f, 0x752: 0x9f, 0x753: 0x9f, 0x754: 0x9f, 0x755: 0x9f, 0x756: 0x9f, 0x757: 0x9f,\n\t0x758: 0x9f, 0x759: 0x9f, 0x75a: 0x9f, 0x75b: 0x9f, 0x75c: 0x9f, 0x75d: 0x9f, 0x75e: 0x9f, 0x75f: 0x9f,\n\t0x760: 0x9f, 0x761: 0x9f, 0x762: 0x9f, 0x763: 0x9f, 0x764: 0x9f, 0x765: 0x9f, 0x766: 0x9f, 0x767: 0x9f,\n\t0x768: 0x9f, 0x769: 0x9f, 0x76a: 0x9f, 0x76b: 0x9f, 0x76c: 0x9f, 0x76d: 0x9f, 0x76e: 0x9f, 0x76f: 0x18a,\n\t0x770: 0xba, 0x771: 0xba, 0x772: 0xba, 0x773: 0xba, 0x774: 0xba, 0x775: 0xba, 0x776: 0xba, 0x777: 0xba,\n\t0x778: 0xba, 0x779: 0xba, 0x77a: 0xba, 0x77b: 0xba, 0x77c: 0xba, 0x77d: 0xba, 0x77e: 0xba, 0x77f: 0xba,\n\t// Block 0x1e, offset 0x780\n\t0x780: 0xba, 0x781: 0xba, 0x782: 0xba, 0x783: 0xba, 0x784: 0xba, 0x785: 0xba, 0x786: 0xba, 0x787: 0xba,\n\t0x788: 0xba, 0x789: 0xba, 0x78a: 0xba, 0x78b: 0xba, 0x78c: 0xba, 0x78d: 0xba, 0x78e: 0xba, 0x78f: 0xba,\n\t0x790: 0xba, 0x791: 0xba, 0x792: 0xba, 0x793: 0xba, 0x794: 0xba, 0x795: 0xba, 0x796: 0xba, 0x797: 0xba,\n\t0x798: 0xba, 0x799: 0xba, 0x79a: 0xba, 0x79b: 0xba, 0x79c: 0xba, 0x79d: 0xba, 0x79e: 0xba, 0x79f: 0xba,\n\t0x7a0: 0x76, 0x7a1: 0x77, 0x7a2: 0x78, 0x7a3: 0x18b, 0x7a4: 0x79, 0x7a5: 0x7a, 0x7a6: 0x18c, 0x7a7: 0x7b,\n\t0x7a8: 0x7c, 0x7a9: 0xba, 0x7aa: 0xba, 0x7ab: 0xba, 0x7ac: 0xba, 0x7ad: 0xba, 0x7ae: 0xba, 0x7af: 0xba,\n\t0x7b0: 0xba, 0x7b1: 0xba, 0x7b2: 0xba, 0x7b3: 0xba, 0x7b4: 0xba, 0x7b5: 0xba, 0x7b6: 0xba, 0x7b7: 0xba,\n\t0x7b8: 0xba, 0x7b9: 0xba, 0x7ba: 0xba, 0x7bb: 0xba, 0x7bc: 0xba, 0x7bd: 0xba, 0x7be: 0xba, 0x7bf: 0xba,\n\t// Block 0x1f, offset 0x7c0\n\t0x7d0: 0x0d, 0x7d1: 0x0e, 0x7d2: 0x0f, 0x7d3: 0x10, 0x7d4: 0x11, 0x7d5: 0x0b, 0x7d6: 0x12, 0x7d7: 0x07,\n\t0x7d8: 0x13, 0x7d9: 0x0b, 0x7da: 0x0b, 0x7db: 0x14, 0x7dc: 0x0b, 0x7dd: 0x15, 0x7de: 0x16, 0x7df: 0x17,\n\t0x7e0: 0x07, 0x7e1: 0x07, 0x7e2: 0x07, 0x7e3: 0x07, 0x7e4: 0x07, 0x7e5: 0x07, 0x7e6: 0x07, 0x7e7: 0x07,\n\t0x7e8: 0x07, 0x7e9: 0x07, 0x7ea: 0x18, 0x7eb: 0x19, 0x7ec: 0x1a, 0x7ed: 0x07, 0x7ee: 0x1b, 0x7ef: 0x1c,\n\t0x7f0: 0x0b, 0x7f1: 0x0b, 0x7f2: 0x0b, 0x7f3: 0x0b, 0x7f4: 0x0b, 0x7f5: 0x0b, 0x7f6: 0x0b, 0x7f7: 0x0b,\n\t0x7f8: 0x0b, 0x7f9: 0x0b, 0x7fa: 0x0b, 0x7fb: 0x0b, 0x7fc: 0x0b, 0x7fd: 0x0b, 0x7fe: 0x0b, 0x7ff: 0x0b,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x0b, 0x801: 0x0b, 0x802: 0x0b, 0x803: 0x0b, 0x804: 0x0b, 0x805: 0x0b, 0x806: 0x0b, 0x807: 0x0b,\n\t0x808: 0x0b, 0x809: 0x0b, 0x80a: 0x0b, 0x80b: 0x0b, 0x80c: 0x0b, 0x80d: 0x0b, 0x80e: 0x0b, 0x80f: 0x0b,\n\t0x810: 0x0b, 0x811: 0x0b, 0x812: 0x0b, 0x813: 0x0b, 0x814: 0x0b, 0x815: 0x0b, 0x816: 0x0b, 0x817: 0x0b,\n\t0x818: 0x0b, 0x819: 0x0b, 0x81a: 0x0b, 0x81b: 0x0b, 0x81c: 0x0b, 0x81d: 0x0b, 0x81e: 0x0b, 0x81f: 0x0b,\n\t0x820: 0x0b, 0x821: 0x0b, 0x822: 0x0b, 0x823: 0x0b, 0x824: 0x0b, 0x825: 0x0b, 0x826: 0x0b, 0x827: 0x0b,\n\t0x828: 0x0b, 0x829: 0x0b, 0x82a: 0x0b, 0x82b: 0x0b, 0x82c: 0x0b, 0x82d: 0x0b, 0x82e: 0x0b, 0x82f: 0x0b,\n\t0x830: 0x0b, 0x831: 0x0b, 0x832: 0x0b, 0x833: 0x0b, 0x834: 0x0b, 0x835: 0x0b, 0x836: 0x0b, 0x837: 0x0b,\n\t0x838: 0x0b, 0x839: 0x0b, 0x83a: 0x0b, 0x83b: 0x0b, 0x83c: 0x0b, 0x83d: 0x0b, 0x83e: 0x0b, 0x83f: 0x0b,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x18d, 0x841: 0x18e, 0x842: 0xba, 0x843: 0xba, 0x844: 0x18f, 0x845: 0x18f, 0x846: 0x18f, 0x847: 0x190,\n\t0x848: 0xba, 0x849: 0xba, 0x84a: 0xba, 0x84b: 0xba, 0x84c: 0xba, 0x84d: 0xba, 0x84e: 0xba, 0x84f: 0xba,\n\t0x850: 0xba, 0x851: 0xba, 0x852: 0xba, 0x853: 0xba, 0x854: 0xba, 0x855: 0xba, 0x856: 0xba, 0x857: 0xba,\n\t0x858: 0xba, 0x859: 0xba, 0x85a: 0xba, 0x85b: 0xba, 0x85c: 0xba, 0x85d: 0xba, 0x85e: 0xba, 0x85f: 0xba,\n\t0x860: 0xba, 0x861: 0xba, 0x862: 0xba, 0x863: 0xba, 0x864: 0xba, 0x865: 0xba, 0x866: 0xba, 0x867: 0xba,\n\t0x868: 0xba, 0x869: 0xba, 0x86a: 0xba, 0x86b: 0xba, 0x86c: 0xba, 0x86d: 0xba, 0x86e: 0xba, 0x86f: 0xba,\n\t0x870: 0xba, 0x871: 0xba, 0x872: 0xba, 0x873: 0xba, 0x874: 0xba, 0x875: 0xba, 0x876: 0xba, 0x877: 0xba,\n\t0x878: 0xba, 0x879: 0xba, 0x87a: 0xba, 0x87b: 0xba, 0x87c: 0xba, 0x87d: 0xba, 0x87e: 0xba, 0x87f: 0xba,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x0b, 0x881: 0x0b, 0x882: 0x0b, 0x883: 0x0b, 0x884: 0x0b, 0x885: 0x0b, 0x886: 0x0b, 0x887: 0x0b,\n\t0x888: 0x0b, 0x889: 0x0b, 0x88a: 0x0b, 0x88b: 0x0b, 0x88c: 0x0b, 0x88d: 0x0b, 0x88e: 0x0b, 0x88f: 0x0b,\n\t0x890: 0x0b, 0x891: 0x0b, 0x892: 0x0b, 0x893: 0x0b, 0x894: 0x0b, 0x895: 0x0b, 0x896: 0x0b, 0x897: 0x0b,\n\t0x898: 0x0b, 0x899: 0x0b, 0x89a: 0x0b, 0x89b: 0x0b, 0x89c: 0x0b, 0x89d: 0x0b, 0x89e: 0x0b, 0x89f: 0x0b,\n\t0x8a0: 0x1f, 0x8a1: 0x0b, 0x8a2: 0x0b, 0x8a3: 0x0b, 0x8a4: 0x0b, 0x8a5: 0x0b, 0x8a6: 0x0b, 0x8a7: 0x0b,\n\t0x8a8: 0x0b, 0x8a9: 0x0b, 0x8aa: 0x0b, 0x8ab: 0x0b, 0x8ac: 0x0b, 0x8ad: 0x0b, 0x8ae: 0x0b, 0x8af: 0x0b,\n\t0x8b0: 0x0b, 0x8b1: 0x0b, 0x8b2: 0x0b, 0x8b3: 0x0b, 0x8b4: 0x0b, 0x8b5: 0x0b, 0x8b6: 0x0b, 0x8b7: 0x0b,\n\t0x8b8: 0x0b, 0x8b9: 0x0b, 0x8ba: 0x0b, 0x8bb: 0x0b, 0x8bc: 0x0b, 0x8bd: 0x0b, 0x8be: 0x0b, 0x8bf: 0x0b,\n\t// Block 0x23, offset 0x8c0\n\t0x8c0: 0x0b, 0x8c1: 0x0b, 0x8c2: 0x0b, 0x8c3: 0x0b, 0x8c4: 0x0b, 0x8c5: 0x0b, 0x8c6: 0x0b, 0x8c7: 0x0b,\n\t0x8c8: 0x0b, 0x8c9: 0x0b, 0x8ca: 0x0b, 0x8cb: 0x0b, 0x8cc: 0x0b, 0x8cd: 0x0b, 0x8ce: 0x0b, 0x8cf: 0x0b,\n}\n\n// idnaSparseOffset: 276 entries, 552 bytes\nvar idnaSparseOffset = []uint16{0x0, 0x8, 0x19, 0x25, 0x27, 0x2c, 0x33, 0x3e, 0x4a, 0x4e, 0x5d, 0x62, 0x6c, 0x78, 0x86, 0x8b, 0x94, 0xa4, 0xb2, 0xbe, 0xca, 0xdb, 0xe5, 0xec, 0xf9, 0x10a, 0x111, 0x11c, 0x12b, 0x139, 0x143, 0x145, 0x14a, 0x14d, 0x150, 0x152, 0x15e, 0x169, 0x171, 0x177, 0x17d, 0x182, 0x187, 0x18a, 0x18e, 0x194, 0x199, 0x1a5, 0x1af, 0x1b5, 0x1c6, 0x1d0, 0x1d3, 0x1db, 0x1de, 0x1eb, 0x1f3, 0x1f7, 0x1fe, 0x206, 0x216, 0x222, 0x224, 0x22e, 0x23a, 0x246, 0x252, 0x25a, 0x25f, 0x269, 0x27a, 0x27e, 0x289, 0x28d, 0x296, 0x29e, 0x2a4, 0x2a9, 0x2ac, 0x2b0, 0x2b6, 0x2ba, 0x2be, 0x2c2, 0x2c7, 0x2cd, 0x2d5, 0x2dc, 0x2e7, 0x2f1, 0x2f5, 0x2f8, 0x2fe, 0x302, 0x304, 0x307, 0x309, 0x30c, 0x316, 0x319, 0x328, 0x32c, 0x331, 0x334, 0x338, 0x33d, 0x342, 0x348, 0x34e, 0x35d, 0x363, 0x367, 0x376, 0x37b, 0x383, 0x38d, 0x398, 0x3a0, 0x3b1, 0x3ba, 0x3ca, 0x3d7, 0x3e1, 0x3e6, 0x3f3, 0x3f7, 0x3fc, 0x3fe, 0x402, 0x404, 0x408, 0x411, 0x417, 0x41b, 0x42b, 0x435, 0x43a, 0x43d, 0x443, 0x44a, 0x44f, 0x453, 0x459, 0x45e, 0x467, 0x46c, 0x472, 0x479, 0x480, 0x487, 0x48b, 0x490, 0x493, 0x498, 0x4a4, 0x4aa, 0x4af, 0x4b6, 0x4be, 0x4c3, 0x4c7, 0x4d7, 0x4de, 0x4e2, 0x4e6, 0x4ed, 0x4ef, 0x4f2, 0x4f5, 0x4f9, 0x502, 0x506, 0x50e, 0x516, 0x51c, 0x525, 0x531, 0x538, 0x541, 0x54b, 0x552, 0x560, 0x56d, 0x57a, 0x583, 0x587, 0x596, 0x59e, 0x5a9, 0x5b2, 0x5b8, 0x5c0, 0x5c9, 0x5d3, 0x5d6, 0x5e2, 0x5eb, 0x5ee, 0x5f3, 0x5fe, 0x607, 0x613, 0x616, 0x620, 0x629, 0x635, 0x642, 0x64f, 0x65d, 0x664, 0x667, 0x66c, 0x66f, 0x672, 0x675, 0x67c, 0x683, 0x687, 0x692, 0x695, 0x698, 0x69b, 0x6a1, 0x6a6, 0x6aa, 0x6ad, 0x6b0, 0x6b3, 0x6b6, 0x6b9, 0x6be, 0x6c8, 0x6cb, 0x6cf, 0x6de, 0x6ea, 0x6ee, 0x6f3, 0x6f7, 0x6fc, 0x700, 0x705, 0x70e, 0x719, 0x71f, 0x727, 0x72a, 0x72d, 0x731, 0x735, 0x73b, 0x741, 0x746, 0x749, 0x759, 0x760, 0x763, 0x766, 0x76a, 0x770, 0x775, 0x77a, 0x782, 0x787, 0x78b, 0x78f, 0x792, 0x795, 0x799, 0x79d, 0x7a0, 0x7b0, 0x7c1, 0x7c6, 0x7c8, 0x7ca}\n\n// idnaSparseValues: 1997 entries, 7988 bytes\nvar idnaSparseValues = [1997]valueRange{\n\t// Block 0x0, offset 0x0\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0xe105, lo: 0x80, hi: 0x96},\n\t{value: 0x0018, lo: 0x97, hi: 0x97},\n\t{value: 0xe105, lo: 0x98, hi: 0x9e},\n\t{value: 0x001f, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbf},\n\t// Block 0x1, offset 0x8\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0xe01d, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0335, lo: 0x83, hi: 0x83},\n\t{value: 0x034d, lo: 0x84, hi: 0x84},\n\t{value: 0x0365, lo: 0x85, hi: 0x85},\n\t{value: 0xe00d, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0xe00d, lo: 0x88, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x89},\n\t{value: 0xe00d, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe00d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0x8d},\n\t{value: 0xe00d, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0xbf},\n\t// Block 0x2, offset 0x19\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x0249, lo: 0xb0, hi: 0xb0},\n\t{value: 0x037d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0259, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0269, lo: 0xb3, hi: 0xb3},\n\t{value: 0x034d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0395, lo: 0xb5, hi: 0xb5},\n\t{value: 0xe1bd, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0279, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0289, lo: 0xb8, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbf},\n\t// Block 0x3, offset 0x25\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x3308, lo: 0x80, hi: 0xbf},\n\t// Block 0x4, offset 0x27\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x03f5, lo: 0x80, hi: 0x8f},\n\t{value: 0xe105, lo: 0x90, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5, offset 0x2c\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x0545, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x0008, lo: 0x99, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x6, offset 0x33\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0401, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x88},\n\t{value: 0x0018, lo: 0x89, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x3308, lo: 0x91, hi: 0xbd},\n\t{value: 0x0818, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x7, offset 0x3e\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0818, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x82},\n\t{value: 0x0818, lo: 0x83, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x85},\n\t{value: 0x0818, lo: 0x86, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xae},\n\t{value: 0x0808, lo: 0xaf, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x8, offset 0x4a\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0a08, lo: 0x80, hi: 0x87},\n\t{value: 0x0c08, lo: 0x88, hi: 0x99},\n\t{value: 0x0a08, lo: 0x9a, hi: 0xbf},\n\t// Block 0x9, offset 0x4e\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3308, lo: 0x80, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0c08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0a08, lo: 0x8e, hi: 0x98},\n\t{value: 0x0c08, lo: 0x99, hi: 0x9b},\n\t{value: 0x0a08, lo: 0x9c, hi: 0xaa},\n\t{value: 0x0c08, lo: 0xab, hi: 0xac},\n\t{value: 0x0a08, lo: 0xad, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0a08, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0c08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0a08, lo: 0xb5, hi: 0xb7},\n\t{value: 0x0c08, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbf},\n\t// Block 0xa, offset 0x5d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xb0},\n\t{value: 0x0808, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xb, offset 0x62\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0808, lo: 0x80, hi: 0x89},\n\t{value: 0x0a08, lo: 0x8a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0818, lo: 0xbe, hi: 0xbf},\n\t// Block 0xc, offset 0x6c\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x99},\n\t{value: 0x0808, lo: 0x9a, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa3},\n\t{value: 0x0808, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa7},\n\t{value: 0x0808, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0818, lo: 0xb0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xd, offset 0x78\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0a08, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0c08, lo: 0xaa, hi: 0xac},\n\t{value: 0x0808, lo: 0xad, hi: 0xad},\n\t{value: 0x0c08, lo: 0xae, hi: 0xae},\n\t{value: 0x0a08, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb2},\n\t{value: 0x0a08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0a08, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0c08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0xe, offset 0x86\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x92},\n\t{value: 0x3308, lo: 0x93, hi: 0xa1},\n\t{value: 0x0840, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xbf},\n\t// Block 0xf, offset 0x8b\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x10, offset 0x94\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x85},\n\t{value: 0x3008, lo: 0x86, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x3008, lo: 0x8a, hi: 0x8c},\n\t{value: 0x3b08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x11, offset 0xa4\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0008, lo: 0xaa, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x12, offset 0xb2\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xba},\n\t{value: 0x3b08, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x13, offset 0xbe\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0040, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x14, offset 0xca\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x89},\n\t{value: 0x3b08, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x3008, lo: 0x98, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x15, offset 0xdb\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb2},\n\t{value: 0x08f1, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb9},\n\t{value: 0x3b08, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x0018, lo: 0xbf, hi: 0xbf},\n\t// Block 0x16, offset 0xe5\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x8e},\n\t{value: 0x0018, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0xbf},\n\t// Block 0x17, offset 0xec\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0961, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0999, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0008, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x18, offset 0xf9\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe03d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x19, offset 0x10a\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0xbf},\n\t// Block 0x1a, offset 0x111\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x1b, offset 0x11c\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x3008, lo: 0x96, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x3308, lo: 0x9e, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3008, lo: 0xa2, hi: 0xa4},\n\t{value: 0x0008, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xbf},\n\t// Block 0x1c, offset 0x12b\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x8c},\n\t{value: 0x3308, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x3008, lo: 0x9a, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x1d, offset 0x139\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x86},\n\t{value: 0x055d, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8c},\n\t{value: 0x055d, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe105, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x1e, offset 0x143\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0018, lo: 0x80, hi: 0xbf},\n\t// Block 0x1f, offset 0x145\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa0},\n\t{value: 0x2018, lo: 0xa1, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x20, offset 0x14a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa7},\n\t{value: 0x2018, lo: 0xa8, hi: 0xbf},\n\t// Block 0x21, offset 0x14d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x2018, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0xbf},\n\t// Block 0x22, offset 0x150\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0008, lo: 0x80, hi: 0xbf},\n\t// Block 0x23, offset 0x152\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x24, offset 0x15e\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x25, offset 0x169\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x26, offset 0x171\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x27, offset 0x177\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x28, offset 0x17d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x29, offset 0x182\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x2a, offset 0x187\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x2b, offset 0x18a\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xbf},\n\t// Block 0x2c, offset 0x18e\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x2d, offset 0x194\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0x2e, offset 0x199\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x3b08, lo: 0x94, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3b08, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x2f, offset 0x1a5\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x30, offset 0x1af\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xb3},\n\t{value: 0x3340, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x31, offset 0x1b5\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x3008, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x88},\n\t{value: 0x3308, lo: 0x89, hi: 0x91},\n\t{value: 0x3b08, lo: 0x92, hi: 0x92},\n\t{value: 0x3308, lo: 0x93, hi: 0x93},\n\t{value: 0x0018, lo: 0x94, hi: 0x96},\n\t{value: 0x0008, lo: 0x97, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x32, offset 0x1c6\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x86},\n\t{value: 0x0218, lo: 0x87, hi: 0x87},\n\t{value: 0x0018, lo: 0x88, hi: 0x8a},\n\t{value: 0x33c0, lo: 0x8b, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0208, lo: 0xa0, hi: 0xbf},\n\t// Block 0x33, offset 0x1d0\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0208, lo: 0x80, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0x34, offset 0x1d3\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0208, lo: 0x87, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0208, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x35, offset 0x1db\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0x36, offset 0x1de\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x37, offset 0x1eb\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x38, offset 0x1f3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x39, offset 0x1f7\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0028, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0xbf},\n\t// Block 0x3a, offset 0x1fe\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x3308, lo: 0x97, hi: 0x98},\n\t{value: 0x3008, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x3b, offset 0x206\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x94},\n\t{value: 0x3008, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3b08, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xac},\n\t{value: 0x3008, lo: 0xad, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3c, offset 0x216\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xbd},\n\t{value: 0x3318, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3d, offset 0x222\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0040, lo: 0x80, hi: 0xbf},\n\t// Block 0x3e, offset 0x224\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x83},\n\t{value: 0x3008, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x3f, offset 0x22e\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x3808, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x40, offset 0x23a\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3808, lo: 0xaa, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xbf},\n\t// Block 0x41, offset 0x246\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3008, lo: 0xaa, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3808, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbf},\n\t// Block 0x42, offset 0x252\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x3008, lo: 0xa4, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbf},\n\t// Block 0x43, offset 0x25a\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x44, offset 0x25f\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0e29, lo: 0x80, hi: 0x80},\n\t{value: 0x0e41, lo: 0x81, hi: 0x81},\n\t{value: 0x0e59, lo: 0x82, hi: 0x82},\n\t{value: 0x0e71, lo: 0x83, hi: 0x83},\n\t{value: 0x0e89, lo: 0x84, hi: 0x85},\n\t{value: 0x0ea1, lo: 0x86, hi: 0x86},\n\t{value: 0x0eb9, lo: 0x87, hi: 0x87},\n\t{value: 0x057d, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0x45, offset 0x269\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x92},\n\t{value: 0x0018, lo: 0x93, hi: 0x93},\n\t{value: 0x3308, lo: 0x94, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa8},\n\t{value: 0x0008, lo: 0xa9, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x3008, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x46, offset 0x27a\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0x47, offset 0x27e\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x87},\n\t{value: 0xe045, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0xe045, lo: 0x98, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0xe045, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbf},\n\t// Block 0x48, offset 0x289\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x3318, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbf},\n\t// Block 0x49, offset 0x28d\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x88},\n\t{value: 0x24c1, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x4a, offset 0x296\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x24f1, lo: 0xac, hi: 0xac},\n\t{value: 0x2529, lo: 0xad, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xae},\n\t{value: 0x2579, lo: 0xaf, hi: 0xaf},\n\t{value: 0x25b1, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0x4b, offset 0x29e\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x9f},\n\t{value: 0x0080, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xad},\n\t{value: 0x0080, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x4c, offset 0x2a4\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xa8},\n\t{value: 0x09c5, lo: 0xa9, hi: 0xa9},\n\t{value: 0x09e5, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xbf},\n\t// Block 0x4d, offset 0x2a9\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xbf},\n\t// Block 0x4e, offset 0x2ac\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x28c1, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0xbf},\n\t// Block 0x4f, offset 0x2b0\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0e66, lo: 0xb4, hi: 0xb4},\n\t{value: 0x292a, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0e86, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x50, offset 0x2b6\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x9b},\n\t{value: 0x2941, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0xbf},\n\t// Block 0x51, offset 0x2ba\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x52, offset 0x2be\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0xbf},\n\t// Block 0x53, offset 0x2c2\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x54, offset 0x2c7\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x03f5, lo: 0x90, hi: 0x9f},\n\t{value: 0x0ea5, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x55, offset 0x2cd\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xac},\n\t{value: 0x0008, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x56, offset 0x2d5\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xae},\n\t{value: 0xe075, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0x57, offset 0x2dc\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x58, offset 0x2e7\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xbf},\n\t// Block 0x59, offset 0x2f1\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5a, offset 0x2f5\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0xbf},\n\t// Block 0x5b, offset 0x2f8\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9e},\n\t{value: 0x0edd, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0x5c, offset 0x2fe\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb2},\n\t{value: 0x0efd, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x5d, offset 0x302\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x0f1d, lo: 0x80, hi: 0xbf},\n\t// Block 0x5e, offset 0x304\n\t{value: 0x0020, lo: 0x02},\n\t{value: 0x171d, lo: 0x80, hi: 0x8f},\n\t{value: 0x18fd, lo: 0x90, hi: 0xbf},\n\t// Block 0x5f, offset 0x307\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x1efd, lo: 0x80, hi: 0xbf},\n\t// Block 0x60, offset 0x309\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x61, offset 0x30c\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9a},\n\t{value: 0x29e2, lo: 0x9b, hi: 0x9b},\n\t{value: 0x2a0a, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0008, lo: 0x9d, hi: 0x9e},\n\t{value: 0x2a31, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xbf},\n\t// Block 0x62, offset 0x316\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xbe},\n\t{value: 0x2a69, lo: 0xbf, hi: 0xbf},\n\t// Block 0x63, offset 0x319\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0040, lo: 0x80, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xb0},\n\t{value: 0x2a1d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x2a3d, lo: 0xb2, hi: 0xb2},\n\t{value: 0x2a5d, lo: 0xb3, hi: 0xb3},\n\t{value: 0x2a7d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x2a5d, lo: 0xb5, hi: 0xb5},\n\t{value: 0x2a9d, lo: 0xb6, hi: 0xb6},\n\t{value: 0x2abd, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2add, lo: 0xb8, hi: 0xb9},\n\t{value: 0x2afd, lo: 0xba, hi: 0xbb},\n\t{value: 0x2b1d, lo: 0xbc, hi: 0xbd},\n\t{value: 0x2afd, lo: 0xbe, hi: 0xbf},\n\t// Block 0x64, offset 0x328\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x65, offset 0x32c\n\t{value: 0x0030, lo: 0x04},\n\t{value: 0x2aa2, lo: 0x80, hi: 0x9d},\n\t{value: 0x305a, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x30a2, lo: 0xa0, hi: 0xbf},\n\t// Block 0x66, offset 0x331\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x67, offset 0x334\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x68, offset 0x338\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x69, offset 0x33d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xbf},\n\t// Block 0x6a, offset 0x342\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0018, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x6b, offset 0x348\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0xb6},\n\t{value: 0x0008, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2009, lo: 0xb8, hi: 0xb8},\n\t{value: 0x6e89, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xbf},\n\t// Block 0x6c, offset 0x34e\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x3308, lo: 0x8b, hi: 0x8b},\n\t{value: 0x0008, lo: 0x8c, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x6d, offset 0x35d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0208, lo: 0x80, hi: 0xb1},\n\t{value: 0x0108, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x6e, offset 0x363\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xbf},\n\t// Block 0x6f, offset 0x367\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3008, lo: 0x80, hi: 0x83},\n\t{value: 0x3b08, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xba},\n\t{value: 0x0008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x70, offset 0x376\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x71, offset 0x37b\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x91},\n\t{value: 0x3008, lo: 0x92, hi: 0x92},\n\t{value: 0x3808, lo: 0x93, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x72, offset 0x383\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb9},\n\t{value: 0x3008, lo: 0xba, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x73, offset 0x38d\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x74, offset 0x398\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x75, offset 0x3a0\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8c},\n\t{value: 0x3008, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x76, offset 0x3b1\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x77, offset 0x3ba\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x9a},\n\t{value: 0x0008, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3b08, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x78, offset 0x3ca\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x90},\n\t{value: 0x0008, lo: 0x91, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x79, offset 0x3d7\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x4465, lo: 0x9c, hi: 0x9c},\n\t{value: 0x447d, lo: 0x9d, hi: 0x9d},\n\t{value: 0x2971, lo: 0x9e, hi: 0x9e},\n\t{value: 0xe06d, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xaf},\n\t{value: 0x4495, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7a, offset 0x3e1\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x44b5, lo: 0x80, hi: 0x8f},\n\t{value: 0x44d5, lo: 0x90, hi: 0x9f},\n\t{value: 0x44f5, lo: 0xa0, hi: 0xaf},\n\t{value: 0x44d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7b, offset 0x3e6\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3b08, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x7c, offset 0x3f3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7d, offset 0x3f7\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x7e, offset 0x3fc\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x4515, lo: 0x80, hi: 0xbf},\n\t// Block 0x7f, offset 0x3fe\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x4d15, lo: 0x80, hi: 0x94},\n\t{value: 0x4ad5, lo: 0x95, hi: 0x95},\n\t{value: 0x4fb5, lo: 0x96, hi: 0xbf},\n\t// Block 0x80, offset 0x402\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x54f5, lo: 0x80, hi: 0xbf},\n\t// Block 0x81, offset 0x404\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x5cf5, lo: 0x80, hi: 0x84},\n\t{value: 0x5655, lo: 0x85, hi: 0x85},\n\t{value: 0x5d95, lo: 0x86, hi: 0xbf},\n\t// Block 0x82, offset 0x408\n\t{value: 0x0020, lo: 0x08},\n\t{value: 0x6b55, lo: 0x80, hi: 0x8f},\n\t{value: 0x6d15, lo: 0x90, hi: 0x90},\n\t{value: 0x6d55, lo: 0x91, hi: 0xab},\n\t{value: 0x6ea1, lo: 0xac, hi: 0xac},\n\t{value: 0x70b5, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x70d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x83, offset 0x411\n\t{value: 0x0020, lo: 0x05},\n\t{value: 0x72d5, lo: 0x80, hi: 0xad},\n\t{value: 0x6535, lo: 0xae, hi: 0xae},\n\t{value: 0x7895, lo: 0xaf, hi: 0xb5},\n\t{value: 0x6f55, lo: 0xb6, hi: 0xb6},\n\t{value: 0x7975, lo: 0xb7, hi: 0xbf},\n\t// Block 0x84, offset 0x417\n\t{value: 0x0028, lo: 0x03},\n\t{value: 0x7c21, lo: 0x80, hi: 0x82},\n\t{value: 0x7be1, lo: 0x83, hi: 0x83},\n\t{value: 0x7c99, lo: 0x84, hi: 0xbf},\n\t// Block 0x85, offset 0x41b\n\t{value: 0x0038, lo: 0x0f},\n\t{value: 0x9db1, lo: 0x80, hi: 0x83},\n\t{value: 0x9e59, lo: 0x84, hi: 0x85},\n\t{value: 0x9e91, lo: 0x86, hi: 0x87},\n\t{value: 0x9ec9, lo: 0x88, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0xa089, lo: 0x92, hi: 0x97},\n\t{value: 0xa1a1, lo: 0x98, hi: 0x9c},\n\t{value: 0xa281, lo: 0x9d, hi: 0xb3},\n\t{value: 0x9d41, lo: 0xb4, hi: 0xb4},\n\t{value: 0x9db1, lo: 0xb5, hi: 0xb5},\n\t{value: 0xa789, lo: 0xb6, hi: 0xbb},\n\t{value: 0xa869, lo: 0xbc, hi: 0xbc},\n\t{value: 0xa7f9, lo: 0xbd, hi: 0xbd},\n\t{value: 0xa8d9, lo: 0xbe, hi: 0xbf},\n\t// Block 0x86, offset 0x42b\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0008, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x87, offset 0x435\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0x88, offset 0x43a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x89, offset 0x43d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x8a, offset 0x443\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0x8b, offset 0x44a\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x8c, offset 0x44f\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x8d, offset 0x453\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x8e, offset 0x459\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xac},\n\t{value: 0x0008, lo: 0xad, hi: 0xbf},\n\t// Block 0x8f, offset 0x45e\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x90, offset 0x467\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x91, offset 0x46c\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0xbf},\n\t// Block 0x92, offset 0x472\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x97},\n\t{value: 0x8ad5, lo: 0x98, hi: 0x9f},\n\t{value: 0x8aed, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xbf},\n\t// Block 0x93, offset 0x479\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x8aed, lo: 0xb0, hi: 0xb7},\n\t{value: 0x8ad5, lo: 0xb8, hi: 0xbf},\n\t// Block 0x94, offset 0x480\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x95, offset 0x487\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x96, offset 0x48b\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xae},\n\t{value: 0x0018, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x97, offset 0x490\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x98, offset 0x493\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xbf},\n\t// Block 0x99, offset 0x498\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0808, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0808, lo: 0x8a, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0808, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0808, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0808, lo: 0xbf, hi: 0xbf},\n\t// Block 0x9a, offset 0x4a4\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x96},\n\t{value: 0x0818, lo: 0x97, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0818, lo: 0xb7, hi: 0xbf},\n\t// Block 0x9b, offset 0x4aa\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa6},\n\t{value: 0x0818, lo: 0xa7, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x9c, offset 0x4af\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xba},\n\t{value: 0x0818, lo: 0xbb, hi: 0xbf},\n\t// Block 0x9d, offset 0x4b6\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0818, lo: 0x96, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbe},\n\t{value: 0x0818, lo: 0xbf, hi: 0xbf},\n\t// Block 0x9e, offset 0x4be\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbb},\n\t{value: 0x0818, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0808, lo: 0xbe, hi: 0xbf},\n\t// Block 0x9f, offset 0x4c3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0818, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x0818, lo: 0x92, hi: 0xbf},\n\t// Block 0xa0, offset 0x4c7\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0808, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x94},\n\t{value: 0x0808, lo: 0x95, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0x98},\n\t{value: 0x0808, lo: 0x99, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xa1, offset 0x4d7\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0818, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0x0818, lo: 0x90, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0818, lo: 0xbd, hi: 0xbf},\n\t// Block 0xa2, offset 0x4de\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0x9c},\n\t{value: 0x0818, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xa3, offset 0x4e2\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0018, lo: 0xb9, hi: 0xbf},\n\t// Block 0xa4, offset 0x4e6\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0818, lo: 0x98, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb7},\n\t{value: 0x0818, lo: 0xb8, hi: 0xbf},\n\t// Block 0xa5, offset 0x4ed\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0808, lo: 0x80, hi: 0xbf},\n\t// Block 0xa6, offset 0x4ef\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0808, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0xa7, offset 0x4f2\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x03dd, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xa8, offset 0x4f5\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xbf},\n\t// Block 0xa9, offset 0x4f9\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0908, lo: 0x80, hi: 0x80},\n\t{value: 0x0a08, lo: 0x81, hi: 0xa1},\n\t{value: 0x0c08, lo: 0xa2, hi: 0xa2},\n\t{value: 0x0a08, lo: 0xa3, hi: 0xa3},\n\t{value: 0x3308, lo: 0xa4, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0808, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xaa, offset 0x502\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0818, lo: 0xa0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xab, offset 0x506\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x9c},\n\t{value: 0x0818, lo: 0x9d, hi: 0xa6},\n\t{value: 0x0808, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0a08, lo: 0xb0, hi: 0xb2},\n\t{value: 0x0c08, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0a08, lo: 0xb4, hi: 0xbf},\n\t// Block 0xac, offset 0x50e\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0a08, lo: 0x80, hi: 0x84},\n\t{value: 0x0808, lo: 0x85, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x90},\n\t{value: 0x0a18, lo: 0x91, hi: 0x93},\n\t{value: 0x0c18, lo: 0x94, hi: 0x94},\n\t{value: 0x0818, lo: 0x95, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xad, offset 0x516\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xae, offset 0x51c\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x91},\n\t{value: 0x0018, lo: 0x92, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xaf, offset 0x525\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb6},\n\t{value: 0x3008, lo: 0xb7, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0xb0, offset 0x531\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xb1, offset 0x538\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb2},\n\t{value: 0x3b08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xbf},\n\t// Block 0xb2, offset 0x541\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x3008, lo: 0x85, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xb3, offset 0x54b\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xbe},\n\t{value: 0x3008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb4, offset 0x552\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x88},\n\t{value: 0x3308, lo: 0x89, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xb5, offset 0x560\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3808, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb6, offset 0x56d\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0008, lo: 0x9f, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0xb7, offset 0x57a\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x3308, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa9},\n\t{value: 0x3b08, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xb8, offset 0x583\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xb9, offset 0x587\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x84},\n\t{value: 0x3008, lo: 0x85, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9d},\n\t{value: 0x3308, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xbf},\n\t// Block 0xba, offset 0x596\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3008, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbb, offset 0x59e\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x85},\n\t{value: 0x0018, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xbc, offset 0x5a9\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbd, offset 0x5b2\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9b},\n\t{value: 0x3308, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0xbe, offset 0x5b8\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbf, offset 0x5c0\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xc0, offset 0x5c9\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb5},\n\t{value: 0x3808, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0xc1, offset 0x5d3\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0xbf},\n\t// Block 0xc2, offset 0x5d6\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbf},\n\t// Block 0xc3, offset 0x5e2\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0xc4, offset 0x5eb\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xbf},\n\t// Block 0xc5, offset 0x5ee\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc6, offset 0x5f3\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3b08, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb8},\n\t{value: 0x3008, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbe},\n\t{value: 0x0018, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc7, offset 0x5fe\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x3b08, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x3308, lo: 0x91, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0xbf},\n\t// Block 0xc8, offset 0x607\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x89},\n\t{value: 0x3308, lo: 0x8a, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x98},\n\t{value: 0x3b08, lo: 0x99, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9c},\n\t{value: 0x0008, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0xa2},\n\t{value: 0x0040, lo: 0xa3, hi: 0xbf},\n\t// Block 0xc9, offset 0x613\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xca, offset 0x616\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xcb, offset 0x620\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xbf},\n\t// Block 0xcc, offset 0x629\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xa9},\n\t{value: 0x3308, lo: 0xaa, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xcd, offset 0x635\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0xce, offset 0x642\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x3308, lo: 0x80, hi: 0x83},\n\t{value: 0x3b08, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0008, lo: 0xaa, hi: 0xbf},\n\t// Block 0xcf, offset 0x64f\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x3008, lo: 0x8a, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x92},\n\t{value: 0x3008, lo: 0x93, hi: 0x94},\n\t{value: 0x3308, lo: 0x95, hi: 0x95},\n\t{value: 0x3008, lo: 0x96, hi: 0x96},\n\t{value: 0x3b08, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xbf},\n\t// Block 0xd0, offset 0x65d\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xd1, offset 0x664\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xd2, offset 0x667\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xd3, offset 0x66c\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0xbf},\n\t// Block 0xd4, offset 0x66f\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xbf},\n\t// Block 0xd5, offset 0x672\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0xbf},\n\t// Block 0xd6, offset 0x675\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xd7, offset 0x67c\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xd8, offset 0x683\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0xd9, offset 0x687\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x0008, lo: 0xa3, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0xda, offset 0x692\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0xbf},\n\t// Block 0xdb, offset 0x695\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0xdc, offset 0x698\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0xbf},\n\t// Block 0xdd, offset 0x69b\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x3008, lo: 0x91, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xde, offset 0x6a1\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8e},\n\t{value: 0x3308, lo: 0x8f, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xdf, offset 0x6a6\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xbf},\n\t// Block 0xe0, offset 0x6aa\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xe1, offset 0x6ad\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xe2, offset 0x6b0\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xbf},\n\t// Block 0xe3, offset 0x6b3\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0xe4, offset 0x6b6\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0xe5, offset 0x6b9\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0xe6, offset 0x6be\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x03c0, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xbf},\n\t// Block 0xe7, offset 0x6c8\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xe8, offset 0x6cb\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xbf},\n\t// Block 0xe9, offset 0x6cf\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0018, lo: 0x80, hi: 0x9d},\n\t{value: 0xb5b9, lo: 0x9e, hi: 0x9e},\n\t{value: 0xb601, lo: 0x9f, hi: 0x9f},\n\t{value: 0xb649, lo: 0xa0, hi: 0xa0},\n\t{value: 0xb6b1, lo: 0xa1, hi: 0xa1},\n\t{value: 0xb719, lo: 0xa2, hi: 0xa2},\n\t{value: 0xb781, lo: 0xa3, hi: 0xa3},\n\t{value: 0xb7e9, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3018, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3318, lo: 0xa7, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xac},\n\t{value: 0x3018, lo: 0xad, hi: 0xb2},\n\t{value: 0x0340, lo: 0xb3, hi: 0xba},\n\t{value: 0x3318, lo: 0xbb, hi: 0xbf},\n\t// Block 0xea, offset 0x6de\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3318, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0x84},\n\t{value: 0x3318, lo: 0x85, hi: 0x8b},\n\t{value: 0x0018, lo: 0x8c, hi: 0xa9},\n\t{value: 0x3318, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xba},\n\t{value: 0xb851, lo: 0xbb, hi: 0xbb},\n\t{value: 0xb899, lo: 0xbc, hi: 0xbc},\n\t{value: 0xb8e1, lo: 0xbd, hi: 0xbd},\n\t{value: 0xb949, lo: 0xbe, hi: 0xbe},\n\t{value: 0xb9b1, lo: 0xbf, hi: 0xbf},\n\t// Block 0xeb, offset 0x6ea\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0xba19, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xbf},\n\t// Block 0xec, offset 0x6ee\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x3318, lo: 0x82, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0xbf},\n\t// Block 0xed, offset 0x6f3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0xee, offset 0x6f7\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xef, offset 0x6fc\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0xf0, offset 0x700\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x3308, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0xf1, offset 0x705\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3308, lo: 0xa1, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xf2, offset 0x70e\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa4},\n\t{value: 0x0040, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xbf},\n\t// Block 0xf3, offset 0x719\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x86},\n\t{value: 0x0818, lo: 0x87, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0xf4, offset 0x71f\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0a08, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0818, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xf5, offset 0x727\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xb0},\n\t{value: 0x0818, lo: 0xb1, hi: 0xbf},\n\t// Block 0xf6, offset 0x72a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0818, lo: 0x80, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xf7, offset 0x72d\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xf8, offset 0x731\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0xf9, offset 0x735\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0xfa, offset 0x73b\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xfb, offset 0x741\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8f},\n\t{value: 0xc1c1, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xfc, offset 0x746\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xbf},\n\t// Block 0xfd, offset 0x749\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0xc7e9, lo: 0x80, hi: 0x80},\n\t{value: 0xc839, lo: 0x81, hi: 0x81},\n\t{value: 0xc889, lo: 0x82, hi: 0x82},\n\t{value: 0xc8d9, lo: 0x83, hi: 0x83},\n\t{value: 0xc929, lo: 0x84, hi: 0x84},\n\t{value: 0xc979, lo: 0x85, hi: 0x85},\n\t{value: 0xc9c9, lo: 0x86, hi: 0x86},\n\t{value: 0xca19, lo: 0x87, hi: 0x87},\n\t{value: 0xca69, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0xcab9, lo: 0x90, hi: 0x90},\n\t{value: 0xcad9, lo: 0x91, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xbf},\n\t// Block 0xfe, offset 0x759\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xff, offset 0x760\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x100, offset 0x763\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0xbf},\n\t// Block 0x101, offset 0x766\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x102, offset 0x76a\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0x103, offset 0x770\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xbf},\n\t// Block 0x104, offset 0x775\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x105, offset 0x77a\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb2},\n\t{value: 0x0018, lo: 0xb3, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbf},\n\t// Block 0x106, offset 0x782\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xa2},\n\t{value: 0x0040, lo: 0xa3, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x107, offset 0x787\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x108, offset 0x78b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xbf},\n\t// Block 0x109, offset 0x78f\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0x10a, offset 0x792\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x10b, offset 0x795\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x10c, offset 0x799\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x10d, offset 0x79d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0x10e, offset 0x7a0\n\t{value: 0x0020, lo: 0x0f},\n\t{value: 0xdeb9, lo: 0x80, hi: 0x89},\n\t{value: 0x8dfd, lo: 0x8a, hi: 0x8a},\n\t{value: 0xdff9, lo: 0x8b, hi: 0x9c},\n\t{value: 0x8e1d, lo: 0x9d, hi: 0x9d},\n\t{value: 0xe239, lo: 0x9e, hi: 0xa2},\n\t{value: 0x8e3d, lo: 0xa3, hi: 0xa3},\n\t{value: 0xe2d9, lo: 0xa4, hi: 0xab},\n\t{value: 0x7ed5, lo: 0xac, hi: 0xac},\n\t{value: 0xe3d9, lo: 0xad, hi: 0xaf},\n\t{value: 0x8e5d, lo: 0xb0, hi: 0xb0},\n\t{value: 0xe439, lo: 0xb1, hi: 0xb6},\n\t{value: 0x8e7d, lo: 0xb7, hi: 0xb9},\n\t{value: 0xe4f9, lo: 0xba, hi: 0xba},\n\t{value: 0x8edd, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe519, lo: 0xbc, hi: 0xbf},\n\t// Block 0x10f, offset 0x7b0\n\t{value: 0x0020, lo: 0x10},\n\t{value: 0x937d, lo: 0x80, hi: 0x80},\n\t{value: 0xf099, lo: 0x81, hi: 0x86},\n\t{value: 0x939d, lo: 0x87, hi: 0x8a},\n\t{value: 0xd9f9, lo: 0x8b, hi: 0x8b},\n\t{value: 0xf159, lo: 0x8c, hi: 0x96},\n\t{value: 0x941d, lo: 0x97, hi: 0x97},\n\t{value: 0xf2b9, lo: 0x98, hi: 0xa3},\n\t{value: 0x943d, lo: 0xa4, hi: 0xa6},\n\t{value: 0xf439, lo: 0xa7, hi: 0xaa},\n\t{value: 0x949d, lo: 0xab, hi: 0xab},\n\t{value: 0xf4b9, lo: 0xac, hi: 0xac},\n\t{value: 0x94bd, lo: 0xad, hi: 0xad},\n\t{value: 0xf4d9, lo: 0xae, hi: 0xaf},\n\t{value: 0x94dd, lo: 0xb0, hi: 0xb1},\n\t{value: 0xf519, lo: 0xb2, hi: 0xbe},\n\t{value: 0x2040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x110, offset 0x7c1\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0340, lo: 0x81, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x9f},\n\t{value: 0x0340, lo: 0xa0, hi: 0xbf},\n\t// Block 0x111, offset 0x7c6\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0340, lo: 0x80, hi: 0xbf},\n\t// Block 0x112, offset 0x7c8\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x33c0, lo: 0x80, hi: 0xbf},\n\t// Block 0x113, offset 0x7ca\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x33c0, lo: 0x80, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n}\n\n// Total table size 42466 bytes (41KiB); checksum: 355A58A4\n" }, { "path": "vendor/golang.org/x/net/idna/tables9.0.0.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// +build !go1.10\n\npackage idna\n\n// UnicodeVersion is the Unicode version from which the tables in this package are derived.\nconst UnicodeVersion = \"9.0.0\"\n\nvar mappings string = \"\" + // Size: 8175 bytes\n\t\"\\x00\\x01 \\x03 ̈\\x01a\\x03 ̄\\x012\\x013\\x03 ́\\x03 ̧\\x011\\x01o\\x051⁄4\\x051⁄2\" +\n\t\"\\x053⁄4\\x03i̇\\x03l·\\x03ʼn\\x01s\\x03dž\\x03ⱥ\\x03ⱦ\\x01h\\x01j\\x01r\\x01w\\x01y\" +\n\t\"\\x03 ̆\\x03 ̇\\x03 ̊\\x03 ̨\\x03 ̃\\x03 ̋\\x01l\\x01x\\x04̈́\\x03 ι\\x01;\\x05 ̈́\" +\n\t\"\\x04եւ\\x04اٴ\\x04وٴ\\x04ۇٴ\\x04يٴ\\x06क़\\x06ख़\\x06ग़\\x06ज़\\x06ड़\\x06ढ़\\x06फ़\" +\n\t\"\\x06य़\\x06ড়\\x06ঢ়\\x06য়\\x06ਲ਼\\x06ਸ਼\\x06ਖ਼\\x06ਗ਼\\x06ਜ਼\\x06ਫ਼\\x06ଡ଼\\x06ଢ଼\" +\n\t\"\\x06ํา\\x06ໍາ\\x06ຫນ\\x06ຫມ\\x06གྷ\\x06ཌྷ\\x06དྷ\\x06བྷ\\x06ཛྷ\\x06ཀྵ\\x06ཱི\\x06ཱུ\" +\n\t\"\\x06ྲྀ\\x09ྲཱྀ\\x06ླྀ\\x09ླཱྀ\\x06ཱྀ\\x06ྒྷ\\x06ྜྷ\\x06ྡྷ\\x06ྦྷ\\x06ྫྷ\\x06ྐྵ\\x02\" +\n\t\"в\\x02д\\x02о\\x02с\\x02т\\x02ъ\\x02ѣ\\x02æ\\x01b\\x01d\\x01e\\x02ǝ\\x01g\\x01i\\x01k\" +\n\t\"\\x01m\\x01n\\x02ȣ\\x01p\\x01t\\x01u\\x02ɐ\\x02ɑ\\x02ə\\x02ɛ\\x02ɜ\\x02ŋ\\x02ɔ\\x02ɯ\" +\n\t\"\\x01v\\x02β\\x02γ\\x02δ\\x02φ\\x02χ\\x02ρ\\x02н\\x02ɒ\\x01c\\x02ɕ\\x02ð\\x01f\\x02ɟ\" +\n\t\"\\x02ɡ\\x02ɥ\\x02ɨ\\x02ɩ\\x02ɪ\\x02ʝ\\x02ɭ\\x02ʟ\\x02ɱ\\x02ɰ\\x02ɲ\\x02ɳ\\x02ɴ\\x02ɵ\" +\n\t\"\\x02ɸ\\x02ʂ\\x02ʃ\\x02ƫ\\x02ʉ\\x02ʊ\\x02ʋ\\x02ʌ\\x01z\\x02ʐ\\x02ʑ\\x02ʒ\\x02θ\\x02ss\" +\n\t\"\\x02ά\\x02έ\\x02ή\\x02ί\\x02ό\\x02ύ\\x02ώ\\x05ἀι\\x05ἁι\\x05ἂι\\x05ἃι\\x05ἄι\\x05ἅι\" +\n\t\"\\x05ἆι\\x05ἇι\\x05ἠι\\x05ἡι\\x05ἢι\\x05ἣι\\x05ἤι\\x05ἥι\\x05ἦι\\x05ἧι\\x05ὠι\\x05ὡι\" +\n\t\"\\x05ὢι\\x05ὣι\\x05ὤι\\x05ὥι\\x05ὦι\\x05ὧι\\x05ὰι\\x04αι\\x04άι\\x05ᾶι\\x02ι\\x05 ̈͂\" +\n\t\"\\x05ὴι\\x04ηι\\x04ήι\\x05ῆι\\x05 ̓̀\\x05 ̓́\\x05 ̓͂\\x02ΐ\\x05 ̔̀\\x05 ̔́\\x05 ̔͂\" +\n\t\"\\x02ΰ\\x05 ̈̀\\x01`\\x05ὼι\\x04ωι\\x04ώι\\x05ῶι\\x06′′\\x09′′′\\x06‵‵\\x09‵‵‵\\x02!\" +\n\t\"!\\x02??\\x02?!\\x02!?\\x0c′′′′\\x010\\x014\\x015\\x016\\x017\\x018\\x019\\x01+\\x01=\" +\n\t\"\\x01(\\x01)\\x02rs\\x02ħ\\x02no\\x01q\\x02sm\\x02tm\\x02ω\\x02å\\x02א\\x02ב\\x02ג\" +\n\t\"\\x02ד\\x02π\\x051⁄7\\x051⁄9\\x061⁄10\\x051⁄3\\x052⁄3\\x051⁄5\\x052⁄5\\x053⁄5\\x054\" +\n\t\"⁄5\\x051⁄6\\x055⁄6\\x051⁄8\\x053⁄8\\x055⁄8\\x057⁄8\\x041⁄\\x02ii\\x02iv\\x02vi\" +\n\t\"\\x04viii\\x02ix\\x02xi\\x050⁄3\\x06∫∫\\x09∫∫∫\\x06∮∮\\x09∮∮∮\\x0210\\x0211\\x0212\" +\n\t\"\\x0213\\x0214\\x0215\\x0216\\x0217\\x0218\\x0219\\x0220\\x04(10)\\x04(11)\\x04(12)\" +\n\t\"\\x04(13)\\x04(14)\\x04(15)\\x04(16)\\x04(17)\\x04(18)\\x04(19)\\x04(20)\\x0c∫∫∫∫\" +\n\t\"\\x02==\\x05⫝̸\\x02ɫ\\x02ɽ\\x02ȿ\\x02ɀ\\x01.\\x04 ゙\\x04 ゚\\x06より\\x06コト\\x05(ᄀ)\\x05\" +\n\t\"(ᄂ)\\x05(ᄃ)\\x05(ᄅ)\\x05(ᄆ)\\x05(ᄇ)\\x05(ᄉ)\\x05(ᄋ)\\x05(ᄌ)\\x05(ᄎ)\\x05(ᄏ)\\x05(ᄐ\" +\n\t\")\\x05(ᄑ)\\x05(ᄒ)\\x05(가)\\x05(나)\\x05(다)\\x05(라)\\x05(마)\\x05(바)\\x05(사)\\x05(아)\" +\n\t\"\\x05(자)\\x05(차)\\x05(카)\\x05(타)\\x05(파)\\x05(하)\\x05(주)\\x08(오전)\\x08(오후)\\x05(一)\" +\n\t\"\\x05(二)\\x05(三)\\x05(四)\\x05(五)\\x05(六)\\x05(七)\\x05(八)\\x05(九)\\x05(十)\\x05(月)\" +\n\t\"\\x05(火)\\x05(水)\\x05(木)\\x05(金)\\x05(土)\\x05(日)\\x05(株)\\x05(有)\\x05(社)\\x05(名)\" +\n\t\"\\x05(特)\\x05(財)\\x05(祝)\\x05(労)\\x05(代)\\x05(呼)\\x05(学)\\x05(監)\\x05(企)\\x05(資)\" +\n\t\"\\x05(協)\\x05(祭)\\x05(休)\\x05(自)\\x05(至)\\x0221\\x0222\\x0223\\x0224\\x0225\\x0226\" +\n\t\"\\x0227\\x0228\\x0229\\x0230\\x0231\\x0232\\x0233\\x0234\\x0235\\x06참고\\x06주의\\x0236\" +\n\t\"\\x0237\\x0238\\x0239\\x0240\\x0241\\x0242\\x0243\\x0244\\x0245\\x0246\\x0247\\x0248\" +\n\t\"\\x0249\\x0250\\x041月\\x042月\\x043月\\x044月\\x045月\\x046月\\x047月\\x048月\\x049月\\x0510\" +\n\t\"月\\x0511月\\x0512月\\x02hg\\x02ev\\x0cアパート\\x0cアルファ\\x0cアンペア\\x09アール\\x0cイニング\\x09\" +\n\t\"インチ\\x09ウォン\\x0fエスクード\\x0cエーカー\\x09オンス\\x09オーム\\x09カイリ\\x0cカラット\\x0cカロリー\\x09ガロ\" +\n\t\"ン\\x09ガンマ\\x06ギガ\\x09ギニー\\x0cキュリー\\x0cギルダー\\x06キロ\\x0fキログラム\\x12キロメートル\\x0fキロワッ\" +\n\t\"ト\\x09グラム\\x0fグラムトン\\x0fクルゼイロ\\x0cクローネ\\x09ケース\\x09コルナ\\x09コーポ\\x0cサイクル\\x0fサンチ\" +\n\t\"ーム\\x0cシリング\\x09センチ\\x09セント\\x09ダース\\x06デシ\\x06ドル\\x06トン\\x06ナノ\\x09ノット\\x09ハイツ\" +\n\t\"\\x0fパーセント\\x09パーツ\\x0cバーレル\\x0fピアストル\\x09ピクル\\x06ピコ\\x06ビル\\x0fファラッド\\x0cフィート\" +\n\t\"\\x0fブッシェル\\x09フラン\\x0fヘクタール\\x06ペソ\\x09ペニヒ\\x09ヘルツ\\x09ペンス\\x09ページ\\x09ベータ\\x0cポイ\" +\n\t\"ント\\x09ボルト\\x06ホン\\x09ポンド\\x09ホール\\x09ホーン\\x0cマイクロ\\x09マイル\\x09マッハ\\x09マルク\\x0fマ\" +\n\t\"ンション\\x0cミクロン\\x06ミリ\\x0fミリバール\\x06メガ\\x0cメガトン\\x0cメートル\\x09ヤード\\x09ヤール\\x09ユアン\" +\n\t\"\\x0cリットル\\x06リラ\\x09ルピー\\x0cルーブル\\x06レム\\x0fレントゲン\\x09ワット\\x040点\\x041点\\x042点\" +\n\t\"\\x043点\\x044点\\x045点\\x046点\\x047点\\x048点\\x049点\\x0510点\\x0511点\\x0512点\\x0513点\" +\n\t\"\\x0514点\\x0515点\\x0516点\\x0517点\\x0518点\\x0519点\\x0520点\\x0521点\\x0522点\\x0523点\" +\n\t\"\\x0524点\\x02da\\x02au\\x02ov\\x02pc\\x02dm\\x02iu\\x06平成\\x06昭和\\x06大正\\x06明治\\x0c株\" +\n\t\"式会社\\x02pa\\x02na\\x02ma\\x02ka\\x02kb\\x02mb\\x02gb\\x04kcal\\x02pf\\x02nf\\x02m\" +\n\t\"g\\x02kg\\x02hz\\x02ml\\x02dl\\x02kl\\x02fm\\x02nm\\x02mm\\x02cm\\x02km\\x02m2\\x02m\" +\n\t\"3\\x05m∕s\\x06m∕s2\\x07rad∕s\\x08rad∕s2\\x02ps\\x02ns\\x02ms\\x02pv\\x02nv\\x02mv\" +\n\t\"\\x02kv\\x02pw\\x02nw\\x02mw\\x02kw\\x02bq\\x02cc\\x02cd\\x06c∕kg\\x02db\\x02gy\\x02\" +\n\t\"ha\\x02hp\\x02in\\x02kk\\x02kt\\x02lm\\x02ln\\x02lx\\x02ph\\x02pr\\x02sr\\x02sv\\x02\" +\n\t\"wb\\x05v∕m\\x05a∕m\\x041日\\x042日\\x043日\\x044日\\x045日\\x046日\\x047日\\x048日\\x049日\" +\n\t\"\\x0510日\\x0511日\\x0512日\\x0513日\\x0514日\\x0515日\\x0516日\\x0517日\\x0518日\\x0519日\" +\n\t\"\\x0520日\\x0521日\\x0522日\\x0523日\\x0524日\\x0525日\\x0526日\\x0527日\\x0528日\\x0529日\" +\n\t\"\\x0530日\\x0531日\\x02ь\\x02ɦ\\x02ɬ\\x02ʞ\\x02ʇ\\x02œ\\x04𤋮\\x04𢡊\\x04𢡄\\x04𣏕\\x04𥉉\" +\n\t\"\\x04𥳐\\x04𧻓\\x02ff\\x02fi\\x02fl\\x02st\\x04մն\\x04մե\\x04մի\\x04վն\\x04մխ\\x04יִ\" +\n\t\"\\x04ײַ\\x02ע\\x02ה\\x02כ\\x02ל\\x02ם\\x02ר\\x02ת\\x04שׁ\\x04שׂ\\x06שּׁ\\x06שּׂ\\x04א\" +\n\t\"ַ\\x04אָ\\x04אּ\\x04בּ\\x04גּ\\x04דּ\\x04הּ\\x04וּ\\x04זּ\\x04טּ\\x04יּ\\x04ךּ\\x04\" +\n\t\"כּ\\x04לּ\\x04מּ\\x04נּ\\x04סּ\\x04ףּ\\x04פּ\\x04צּ\\x04קּ\\x04רּ\\x04שּ\\x04תּ\" +\n\t\"\\x04וֹ\\x04בֿ\\x04כֿ\\x04פֿ\\x04אל\\x02ٱ\\x02ٻ\\x02پ\\x02ڀ\\x02ٺ\\x02ٿ\\x02ٹ\\x02ڤ\" +\n\t\"\\x02ڦ\\x02ڄ\\x02ڃ\\x02چ\\x02ڇ\\x02ڍ\\x02ڌ\\x02ڎ\\x02ڈ\\x02ژ\\x02ڑ\\x02ک\\x02گ\\x02ڳ\" +\n\t\"\\x02ڱ\\x02ں\\x02ڻ\\x02ۀ\\x02ہ\\x02ھ\\x02ے\\x02ۓ\\x02ڭ\\x02ۇ\\x02ۆ\\x02ۈ\\x02ۋ\\x02ۅ\" +\n\t\"\\x02ۉ\\x02ې\\x02ى\\x04ئا\\x04ئە\\x04ئو\\x04ئۇ\\x04ئۆ\\x04ئۈ\\x04ئې\\x04ئى\\x02ی\\x04\" +\n\t\"ئج\\x04ئح\\x04ئم\\x04ئي\\x04بج\\x04بح\\x04بخ\\x04بم\\x04بى\\x04بي\\x04تج\\x04تح\" +\n\t\"\\x04تخ\\x04تم\\x04تى\\x04تي\\x04ثج\\x04ثم\\x04ثى\\x04ثي\\x04جح\\x04جم\\x04حج\\x04حم\" +\n\t\"\\x04خج\\x04خح\\x04خم\\x04سج\\x04سح\\x04سخ\\x04سم\\x04صح\\x04صم\\x04ضج\\x04ضح\\x04ضخ\" +\n\t\"\\x04ضم\\x04طح\\x04طم\\x04ظم\\x04عج\\x04عم\\x04غج\\x04غم\\x04فج\\x04فح\\x04فخ\\x04فم\" +\n\t\"\\x04فى\\x04في\\x04قح\\x04قم\\x04قى\\x04قي\\x04كا\\x04كج\\x04كح\\x04كخ\\x04كل\\x04كم\" +\n\t\"\\x04كى\\x04كي\\x04لج\\x04لح\\x04لخ\\x04لم\\x04لى\\x04لي\\x04مج\\x04مح\\x04مخ\\x04مم\" +\n\t\"\\x04مى\\x04مي\\x04نج\\x04نح\\x04نخ\\x04نم\\x04نى\\x04ني\\x04هج\\x04هم\\x04هى\\x04هي\" +\n\t\"\\x04يج\\x04يح\\x04يخ\\x04يم\\x04يى\\x04يي\\x04ذٰ\\x04رٰ\\x04ىٰ\\x05 ٌّ\\x05 ٍّ\\x05\" +\n\t\" َّ\\x05 ُّ\\x05 ِّ\\x05 ّٰ\\x04ئر\\x04ئز\\x04ئن\\x04بر\\x04بز\\x04بن\\x04تر\\x04تز\" +\n\t\"\\x04تن\\x04ثر\\x04ثز\\x04ثن\\x04ما\\x04نر\\x04نز\\x04نن\\x04ير\\x04يز\\x04ين\\x04ئخ\" +\n\t\"\\x04ئه\\x04به\\x04ته\\x04صخ\\x04له\\x04نه\\x04هٰ\\x04يه\\x04ثه\\x04سه\\x04شم\\x04شه\" +\n\t\"\\x06ـَّ\\x06ـُّ\\x06ـِّ\\x04طى\\x04طي\\x04عى\\x04عي\\x04غى\\x04غي\\x04سى\\x04سي\" +\n\t\"\\x04شى\\x04شي\\x04حى\\x04حي\\x04جى\\x04جي\\x04خى\\x04خي\\x04صى\\x04صي\\x04ضى\\x04ضي\" +\n\t\"\\x04شج\\x04شح\\x04شخ\\x04شر\\x04سر\\x04صر\\x04ضر\\x04اً\\x06تجم\\x06تحج\\x06تحم\" +\n\t\"\\x06تخم\\x06تمج\\x06تمح\\x06تمخ\\x06جمح\\x06حمي\\x06حمى\\x06سحج\\x06سجح\\x06سجى\" +\n\t\"\\x06سمح\\x06سمج\\x06سمم\\x06صحح\\x06صمم\\x06شحم\\x06شجي\\x06شمخ\\x06شمم\\x06ضحى\" +\n\t\"\\x06ضخم\\x06طمح\\x06طمم\\x06طمي\\x06عجم\\x06عمم\\x06عمى\\x06غمم\\x06غمي\\x06غمى\" +\n\t\"\\x06فخم\\x06قمح\\x06قمم\\x06لحم\\x06لحي\\x06لحى\\x06لجج\\x06لخم\\x06لمح\\x06محج\" +\n\t\"\\x06محم\\x06محي\\x06مجح\\x06مجم\\x06مخج\\x06مخم\\x06مجخ\\x06همج\\x06همم\\x06نحم\" +\n\t\"\\x06نحى\\x06نجم\\x06نجى\\x06نمي\\x06نمى\\x06يمم\\x06بخي\\x06تجي\\x06تجى\\x06تخي\" +\n\t\"\\x06تخى\\x06تمي\\x06تمى\\x06جمي\\x06جحى\\x06جمى\\x06سخى\\x06صحي\\x06شحي\\x06ضحي\" +\n\t\"\\x06لجي\\x06لمي\\x06يحي\\x06يجي\\x06يمي\\x06ممي\\x06قمي\\x06نحي\\x06عمي\\x06كمي\" +\n\t\"\\x06نجح\\x06مخي\\x06لجم\\x06كمم\\x06جحي\\x06حجي\\x06مجي\\x06فمي\\x06بحي\\x06سخي\" +\n\t\"\\x06نجي\\x06صلے\\x06قلے\\x08الله\\x08اكبر\\x08محمد\\x08صلعم\\x08رسول\\x08عليه\" +\n\t\"\\x08وسلم\\x06صلى!صلى الله عليه وسلم\\x0fجل جلاله\\x08ریال\\x01,\\x01:\\x01!\" +\n\t\"\\x01?\\x01_\\x01{\\x01}\\x01[\\x01]\\x01#\\x01&\\x01*\\x01-\\x01<\\x01>\\x01\\\\\\x01$\" +\n\t\"\\x01%\\x01@\\x04ـً\\x04ـَ\\x04ـُ\\x04ـِ\\x04ـّ\\x04ـْ\\x02ء\\x02آ\\x02أ\\x02ؤ\\x02إ\" +\n\t\"\\x02ئ\\x02ا\\x02ب\\x02ة\\x02ت\\x02ث\\x02ج\\x02ح\\x02خ\\x02د\\x02ذ\\x02ر\\x02ز\\x02س\" +\n\t\"\\x02ش\\x02ص\\x02ض\\x02ط\\x02ظ\\x02ع\\x02غ\\x02ف\\x02ق\\x02ك\\x02ل\\x02م\\x02ن\\x02ه\" +\n\t\"\\x02و\\x02ي\\x04لآ\\x04لأ\\x04لإ\\x04لا\\x01\\x22\\x01'\\x01/\\x01^\\x01|\\x01~\\x02¢\" +\n\t\"\\x02£\\x02¬\\x02¦\\x02¥\\x08𝅗𝅥\\x08𝅘𝅥\\x0c𝅘𝅥𝅮\\x0c𝅘𝅥𝅯\\x0c𝅘𝅥𝅰\\x0c𝅘𝅥𝅱\\x0c𝅘𝅥𝅲\\x08𝆹\" +\n\t\"𝅥\\x08𝆺𝅥\\x0c𝆹𝅥𝅮\\x0c𝆺𝅥𝅮\\x0c𝆹𝅥𝅯\\x0c𝆺𝅥𝅯\\x02ı\\x02ȷ\\x02α\\x02ε\\x02ζ\\x02η\\x02\" +\n\t\"κ\\x02λ\\x02μ\\x02ν\\x02ξ\\x02ο\\x02σ\\x02τ\\x02υ\\x02ψ\\x03∇\\x03∂\\x02ϝ\\x02ٮ\\x02ڡ\" +\n\t\"\\x02ٯ\\x020,\\x021,\\x022,\\x023,\\x024,\\x025,\\x026,\\x027,\\x028,\\x029,\\x03(a)\" +\n\t\"\\x03(b)\\x03(c)\\x03(d)\\x03(e)\\x03(f)\\x03(g)\\x03(h)\\x03(i)\\x03(j)\\x03(k)\" +\n\t\"\\x03(l)\\x03(m)\\x03(n)\\x03(o)\\x03(p)\\x03(q)\\x03(r)\\x03(s)\\x03(t)\\x03(u)\" +\n\t\"\\x03(v)\\x03(w)\\x03(x)\\x03(y)\\x03(z)\\x07〔s〕\\x02wz\\x02hv\\x02sd\\x03ppv\\x02w\" +\n\t\"c\\x02mc\\x02md\\x02dj\\x06ほか\\x06ココ\\x03サ\\x03手\\x03字\\x03双\\x03デ\\x03二\\x03多\\x03解\" +\n\t\"\\x03天\\x03交\\x03映\\x03無\\x03料\\x03前\\x03後\\x03再\\x03新\\x03初\\x03終\\x03生\\x03販\\x03声\" +\n\t\"\\x03吹\\x03演\\x03投\\x03捕\\x03一\\x03三\\x03遊\\x03左\\x03中\\x03右\\x03指\\x03走\\x03打\\x03禁\" +\n\t\"\\x03空\\x03合\\x03満\\x03有\\x03月\\x03申\\x03割\\x03営\\x03配\\x09〔本〕\\x09〔三〕\\x09〔二〕\\x09〔安\" +\n\t\"〕\\x09〔点〕\\x09〔打〕\\x09〔盗〕\\x09〔勝〕\\x09〔敗〕\\x03得\\x03可\\x03丽\\x03丸\\x03乁\\x03你\\x03\" +\n\t\"侮\\x03侻\\x03倂\\x03偺\\x03備\\x03僧\\x03像\\x03㒞\\x03免\\x03兔\\x03兤\\x03具\\x03㒹\\x03內\\x03\" +\n\t\"冗\\x03冤\\x03仌\\x03冬\\x03况\\x03凵\\x03刃\\x03㓟\\x03刻\\x03剆\\x03剷\\x03㔕\\x03勇\\x03勉\\x03\" +\n\t\"勤\\x03勺\\x03包\\x03匆\\x03北\\x03卉\\x03卑\\x03博\\x03即\\x03卽\\x03卿\\x03灰\\x03及\\x03叟\\x03\" +\n\t\"叫\\x03叱\\x03吆\\x03咞\\x03吸\\x03呈\\x03周\\x03咢\\x03哶\\x03唐\\x03啓\\x03啣\\x03善\\x03喙\\x03\" +\n\t\"喫\\x03喳\\x03嗂\\x03圖\\x03嘆\\x03圗\\x03噑\\x03噴\\x03切\\x03壮\\x03城\\x03埴\\x03堍\\x03型\\x03\" +\n\t\"堲\\x03報\\x03墬\\x03売\\x03壷\\x03夆\\x03夢\\x03奢\\x03姬\\x03娛\\x03娧\\x03姘\\x03婦\\x03㛮\\x03\" +\n\t\"嬈\\x03嬾\\x03寃\\x03寘\\x03寧\\x03寳\\x03寿\\x03将\\x03尢\\x03㞁\\x03屠\\x03屮\\x03峀\\x03岍\\x03\" +\n\t\"嵃\\x03嵮\\x03嵫\\x03嵼\\x03巡\\x03巢\\x03㠯\\x03巽\\x03帨\\x03帽\\x03幩\\x03㡢\\x03㡼\\x03庰\\x03\" +\n\t\"庳\\x03庶\\x03廊\\x03廾\\x03舁\\x03弢\\x03㣇\\x03形\\x03彫\\x03㣣\\x03徚\\x03忍\\x03志\\x03忹\\x03\" +\n\t\"悁\\x03㤺\\x03㤜\\x03悔\\x03惇\\x03慈\\x03慌\\x03慎\\x03慺\\x03憎\\x03憲\\x03憤\\x03憯\\x03懞\\x03\" +\n\t\"懲\\x03懶\\x03成\\x03戛\\x03扝\\x03抱\\x03拔\\x03捐\\x03挽\\x03拼\\x03捨\\x03掃\\x03揤\\x03搢\\x03\" +\n\t\"揅\\x03掩\\x03㨮\\x03摩\\x03摾\\x03撝\\x03摷\\x03㩬\\x03敏\\x03敬\\x03旣\\x03書\\x03晉\\x03㬙\\x03\" +\n\t\"暑\\x03㬈\\x03㫤\\x03冒\\x03冕\\x03最\\x03暜\\x03肭\\x03䏙\\x03朗\\x03望\\x03朡\\x03杞\\x03杓\\x03\" +\n\t\"㭉\\x03柺\\x03枅\\x03桒\\x03梅\\x03梎\\x03栟\\x03椔\\x03㮝\\x03楂\\x03榣\\x03槪\\x03檨\\x03櫛\\x03\" +\n\t\"㰘\\x03次\\x03歔\\x03㱎\\x03歲\\x03殟\\x03殺\\x03殻\\x03汎\\x03沿\\x03泍\\x03汧\\x03洖\\x03派\\x03\" +\n\t\"海\\x03流\\x03浩\\x03浸\\x03涅\\x03洴\\x03港\\x03湮\\x03㴳\\x03滋\\x03滇\\x03淹\\x03潮\\x03濆\\x03\" +\n\t\"瀹\\x03瀞\\x03瀛\\x03㶖\\x03灊\\x03災\\x03灷\\x03炭\\x03煅\\x03熜\\x03爨\\x03爵\\x03牐\\x03犀\\x03\" +\n\t\"犕\\x03獺\\x03王\\x03㺬\\x03玥\\x03㺸\\x03瑇\\x03瑜\\x03瑱\\x03璅\\x03瓊\\x03㼛\\x03甤\\x03甾\\x03\" +\n\t\"異\\x03瘐\\x03㿼\\x03䀈\\x03直\\x03眞\\x03真\\x03睊\\x03䀹\\x03瞋\\x03䁆\\x03䂖\\x03硎\\x03碌\\x03\" +\n\t\"磌\\x03䃣\\x03祖\\x03福\\x03秫\\x03䄯\\x03穀\\x03穊\\x03穏\\x03䈂\\x03篆\\x03築\\x03䈧\\x03糒\\x03\" +\n\t\"䊠\\x03糨\\x03糣\\x03紀\\x03絣\\x03䌁\\x03緇\\x03縂\\x03繅\\x03䌴\\x03䍙\\x03罺\\x03羕\\x03翺\\x03\" +\n\t\"者\\x03聠\\x03聰\\x03䏕\\x03育\\x03脃\\x03䐋\\x03脾\\x03媵\\x03舄\\x03辞\\x03䑫\\x03芑\\x03芋\\x03\" +\n\t\"芝\\x03劳\\x03花\\x03芳\\x03芽\\x03苦\\x03若\\x03茝\\x03荣\\x03莭\\x03茣\\x03莽\\x03菧\\x03著\\x03\" +\n\t\"荓\\x03菊\\x03菌\\x03菜\\x03䔫\\x03蓱\\x03蓳\\x03蔖\\x03蕤\\x03䕝\\x03䕡\\x03䕫\\x03虐\\x03虜\\x03\" +\n\t\"虧\\x03虩\\x03蚩\\x03蚈\\x03蜎\\x03蛢\\x03蝹\\x03蜨\\x03蝫\\x03螆\\x03蟡\\x03蠁\\x03䗹\\x03衠\\x03\" +\n\t\"衣\\x03裗\\x03裞\\x03䘵\\x03裺\\x03㒻\\x03䚾\\x03䛇\\x03誠\\x03諭\\x03變\\x03豕\\x03貫\\x03賁\\x03\" +\n\t\"贛\\x03起\\x03跋\\x03趼\\x03跰\\x03軔\\x03輸\\x03邔\\x03郱\\x03鄑\\x03鄛\\x03鈸\\x03鋗\\x03鋘\\x03\" +\n\t\"鉼\\x03鏹\\x03鐕\\x03開\\x03䦕\\x03閷\\x03䧦\\x03雃\\x03嶲\\x03霣\\x03䩮\\x03䩶\\x03韠\\x03䪲\\x03\" +\n\t\"頋\\x03頩\\x03飢\\x03䬳\\x03餩\\x03馧\\x03駂\\x03駾\\x03䯎\\x03鬒\\x03鱀\\x03鳽\\x03䳎\\x03䳭\\x03\" +\n\t\"鵧\\x03䳸\\x03麻\\x03䵖\\x03黹\\x03黾\\x03鼅\\x03鼏\\x03鼖\\x03鼻\"\n\nvar xorData string = \"\" + // Size: 4855 bytes\n\t\"\\x02\\x0c\\x09\\x02\\xb0\\xec\\x02\\xad\\xd8\\x02\\xad\\xd9\\x02\\x06\\x07\\x02\\x0f\\x12\" +\n\t\"\\x02\\x0f\\x1f\\x02\\x0f\\x1d\\x02\\x01\\x13\\x02\\x0f\\x16\\x02\\x0f\\x0b\\x02\\x0f3\" +\n\t\"\\x02\\x0f7\\x02\\x0f?\\x02\\x0f/\\x02\\x0f*\\x02\\x0c&\\x02\\x0c*\\x02\\x0c;\\x02\\x0c9\" +\n\t\"\\x02\\x0c%\\x02\\xab\\xed\\x02\\xab\\xe2\\x02\\xab\\xe3\\x02\\xa9\\xe0\\x02\\xa9\\xe1\" +\n\t\"\\x02\\xa9\\xe6\\x02\\xa3\\xcb\\x02\\xa3\\xc8\\x02\\xa3\\xc9\\x02\\x01#\\x02\\x01\\x08\" +\n\t\"\\x02\\x0e>\\x02\\x0e'\\x02\\x0f\\x03\\x02\\x03\\x0d\\x02\\x03\\x09\\x02\\x03\\x17\\x02\" +\n\t\"\\x03\\x0e\\x02\\x02\\x03\\x02\\x011\\x02\\x01\\x00\\x02\\x01\\x10\\x02\\x03<\\x02\\x07\" +\n\t\"\\x0d\\x02\\x02\\x0c\\x02\\x0c0\\x02\\x01\\x03\\x02\\x01\\x01\\x02\\x01 \\x02\\x01\\x22\" +\n\t\"\\x02\\x01)\\x02\\x01\\x0a\\x02\\x01\\x0c\\x02\\x02\\x06\\x02\\x02\\x02\\x02\\x03\\x10\" +\n\t\"\\x03\\x037 \\x03\\x0b+\\x03\\x02\\x01\\x04\\x02\\x01\\x02\\x02\\x019\\x02\\x03\\x1c\\x02\" +\n\t\"\\x02$\\x03\\x80p$\\x02\\x03:\\x02\\x03\\x0a\\x03\\xc1r.\\x03\\xc1r,\\x03\\xc1r\\x02\" +\n\t\"\\x02\\x02:\\x02\\x02>\\x02\\x02,\\x02\\x02\\x10\\x02\\x02\\x00\\x03\\xc1s<\\x03\\xc1s*\" +\n\t\"\\x03\\xc2L$\\x03\\xc2L;\\x02\\x09)\\x02\\x0a\\x19\\x03\\x83\\xab\\xe3\\x03\\x83\\xab\" +\n\t\"\\xf2\\x03 4\\xe0\\x03\\x81\\xab\\xea\\x03\\x81\\xab\\xf3\\x03 4\\xef\\x03\\x96\\xe1\\xcd\" +\n\t\"\\x03\\x84\\xe5\\xc3\\x02\\x0d\\x11\\x03\\x8b\\xec\\xcb\\x03\\x94\\xec\\xcf\\x03\\x9a\\xec\" +\n\t\"\\xc2\\x03\\x8b\\xec\\xdb\\x03\\x94\\xec\\xdf\\x03\\x9a\\xec\\xd2\\x03\\x01\\x0c!\\x03\" +\n\t\"\\x01\\x0c#\\x03ʠ\\x9d\\x03ʣ\\x9c\\x03ʢ\\x9f\\x03ʥ\\x9e\\x03ʤ\\x91\\x03ʧ\\x90\\x03ʦ\\x93\" +\n\t\"\\x03ʩ\\x92\\x03ʨ\\x95\\x03\\xca\\xf3\\xb5\\x03\\xca\\xf0\\xb4\\x03\\xca\\xf1\\xb7\\x03\" +\n\t\"\\xca\\xf6\\xb6\\x03\\xca\\xf7\\x89\\x03\\xca\\xf4\\x88\\x03\\xca\\xf5\\x8b\\x03\\xca\\xfa\" +\n\t\"\\x8a\\x03\\xca\\xfb\\x8d\\x03\\xca\\xf8\\x8c\\x03\\xca\\xf9\\x8f\\x03\\xca\\xfe\\x8e\\x03\" +\n\t\"\\xca\\xff\\x81\\x03\\xca\\xfc\\x80\\x03\\xca\\xfd\\x83\\x03\\xca\\xe2\\x82\\x03\\xca\\xe3\" +\n\t\"\\x85\\x03\\xca\\xe0\\x84\\x03\\xca\\xe1\\x87\\x03\\xca\\xe6\\x86\\x03\\xca\\xe7\\x99\\x03\" +\n\t\"\\xca\\xe4\\x98\\x03\\xca\\xe5\\x9b\\x03\\xca\\xea\\x9a\\x03\\xca\\xeb\\x9d\\x03\\xca\\xe8\" +\n\t\"\\x9c\\x03ؓ\\x89\\x03ߔ\\x8b\\x02\\x010\\x03\\x03\\x04\\x1e\\x03\\x04\\x15\\x12\\x03\\x0b\" +\n\t\"\\x05,\\x03\\x06\\x04\\x00\\x03\\x06\\x04)\\x03\\x06\\x044\\x03\\x06\\x04<\\x03\\x06\\x05\" +\n\t\"\\x1d\\x03\\x06\\x06\\x00\\x03\\x06\\x06\\x0a\\x03\\x06\\x06'\\x03\\x06\\x062\\x03\\x0786\" +\n\t\"\\x03\\x079/\\x03\\x079 \\x03\\x07:\\x0e\\x03\\x07:\\x1b\\x03\\x07:%\\x03\\x07;/\\x03\" +\n\t\"\\x07;%\\x03\\x074\\x11\\x03\\x076\\x09\\x03\\x077*\\x03\\x070\\x01\\x03\\x070\\x0f\\x03\" +\n\t\"\\x070.\\x03\\x071\\x16\\x03\\x071\\x04\\x03\\x0710\\x03\\x072\\x18\\x03\\x072-\\x03\" +\n\t\"\\x073\\x14\\x03\\x073>\\x03\\x07'\\x09\\x03\\x07 \\x00\\x03\\x07\\x1f\\x0b\\x03\\x07\" +\n\t\"\\x18#\\x03\\x07\\x18(\\x03\\x07\\x186\\x03\\x07\\x18\\x03\\x03\\x07\\x19\\x16\\x03\\x07\" +\n\t\"\\x116\\x03\\x07\\x12'\\x03\\x07\\x13\\x10\\x03\\x07\\x0c&\\x03\\x07\\x0c\\x08\\x03\\x07\" +\n\t\"\\x0c\\x13\\x03\\x07\\x0d\\x02\\x03\\x07\\x0d\\x1c\\x03\\x07\\x0b5\\x03\\x07\\x0b\\x0a\" +\n\t\"\\x03\\x07\\x0b\\x01\\x03\\x07\\x0b\\x0f\\x03\\x07\\x05\\x00\\x03\\x07\\x05\\x09\\x03\\x07\" +\n\t\"\\x05\\x0b\\x03\\x07\\x07\\x01\\x03\\x07\\x07\\x08\\x03\\x07\\x00<\\x03\\x07\\x00+\\x03\" +\n\t\"\\x07\\x01)\\x03\\x07\\x01\\x1b\\x03\\x07\\x01\\x08\\x03\\x07\\x03?\\x03\\x0445\\x03\\x04\" +\n\t\"4\\x08\\x03\\x0454\\x03\\x04)/\\x03\\x04)5\\x03\\x04+\\x05\\x03\\x04+\\x14\\x03\\x04+ \" +\n\t\"\\x03\\x04+<\\x03\\x04*&\\x03\\x04*\\x22\\x03\\x04&8\\x03\\x04!\\x01\\x03\\x04!\\x22\" +\n\t\"\\x03\\x04\\x11+\\x03\\x04\\x10.\\x03\\x04\\x104\\x03\\x04\\x13=\\x03\\x04\\x12\\x04\\x03\" +\n\t\"\\x04\\x12\\x0a\\x03\\x04\\x0d\\x1d\\x03\\x04\\x0d\\x07\\x03\\x04\\x0d \\x03\\x05<>\\x03\" +\n\t\"\\x055<\\x03\\x055!\\x03\\x055#\\x03\\x055&\\x03\\x054\\x1d\\x03\\x054\\x02\\x03\\x054\" +\n\t\"\\x07\\x03\\x0571\\x03\\x053\\x1a\\x03\\x053\\x16\\x03\\x05.<\\x03\\x05.\\x07\\x03\\x05)\" +\n\t\":\\x03\\x05)<\\x03\\x05)\\x0c\\x03\\x05)\\x15\\x03\\x05+-\\x03\\x05+5\\x03\\x05$\\x1e\" +\n\t\"\\x03\\x05$\\x14\\x03\\x05'\\x04\\x03\\x05'\\x14\\x03\\x05&\\x02\\x03\\x05\\x226\\x03\" +\n\t\"\\x05\\x22\\x0c\\x03\\x05\\x22\\x1c\\x03\\x05\\x19\\x0a\\x03\\x05\\x1b\\x09\\x03\\x05\\x1b\" +\n\t\"\\x0c\\x03\\x05\\x14\\x07\\x03\\x05\\x16?\\x03\\x05\\x16\\x0c\\x03\\x05\\x0c\\x05\\x03\" +\n\t\"\\x05\\x0e\\x0f\\x03\\x05\\x01\\x0e\\x03\\x05\\x00(\\x03\\x05\\x030\\x03\\x05\\x03\\x06\" +\n\t\"\\x03\\x0a==\\x03\\x0a=1\\x03\\x0a=,\\x03\\x0a=\\x0c\\x03\\x0a??\\x03\\x0a<\\x08\\x03\" +\n\t\"\\x0a9!\\x03\\x0a9)\\x03\\x0a97\\x03\\x0a99\\x03\\x0a6\\x0a\\x03\\x0a6\\x1c\\x03\\x0a6\" +\n\t\"\\x17\\x03\\x0a7'\\x03\\x0a78\\x03\\x0a73\\x03\\x0a'\\x01\\x03\\x0a'&\\x03\\x0a\\x1f\" +\n\t\"\\x0e\\x03\\x0a\\x1f\\x03\\x03\\x0a\\x1f3\\x03\\x0a\\x1b/\\x03\\x0a\\x18\\x19\\x03\\x0a\" +\n\t\"\\x19\\x01\\x03\\x0a\\x16\\x14\\x03\\x0a\\x0e\\x22\\x03\\x0a\\x0f\\x10\\x03\\x0a\\x0f\\x02\" +\n\t\"\\x03\\x0a\\x0f \\x03\\x0a\\x0c\\x04\\x03\\x0a\\x0b>\\x03\\x0a\\x0b+\\x03\\x0a\\x08/\\x03\" +\n\t\"\\x0a\\x046\\x03\\x0a\\x05\\x14\\x03\\x0a\\x00\\x04\\x03\\x0a\\x00\\x10\\x03\\x0a\\x00\" +\n\t\"\\x14\\x03\\x0b<3\\x03\\x0b;*\\x03\\x0b9\\x22\\x03\\x0b9)\\x03\\x0b97\\x03\\x0b+\\x10\" +\n\t\"\\x03\\x0b((\\x03\\x0b&5\\x03\\x0b$\\x1c\\x03\\x0b$\\x12\\x03\\x0b%\\x04\\x03\\x0b#<\" +\n\t\"\\x03\\x0b#0\\x03\\x0b#\\x0d\\x03\\x0b#\\x19\\x03\\x0b!:\\x03\\x0b!\\x1f\\x03\\x0b!\\x00\" +\n\t\"\\x03\\x0b\\x1e5\\x03\\x0b\\x1c\\x1d\\x03\\x0b\\x1d-\\x03\\x0b\\x1d(\\x03\\x0b\\x18.\\x03\" +\n\t\"\\x0b\\x18 \\x03\\x0b\\x18\\x16\\x03\\x0b\\x14\\x13\\x03\\x0b\\x15$\\x03\\x0b\\x15\\x22\" +\n\t\"\\x03\\x0b\\x12\\x1b\\x03\\x0b\\x12\\x10\\x03\\x0b\\x132\\x03\\x0b\\x13=\\x03\\x0b\\x12\" +\n\t\"\\x18\\x03\\x0b\\x0c&\\x03\\x0b\\x061\\x03\\x0b\\x06:\\x03\\x0b\\x05#\\x03\\x0b\\x05<\" +\n\t\"\\x03\\x0b\\x04\\x0b\\x03\\x0b\\x04\\x04\\x03\\x0b\\x04\\x1b\\x03\\x0b\\x042\\x03\\x0b\" +\n\t\"\\x041\\x03\\x0b\\x03\\x03\\x03\\x0b\\x03\\x1d\\x03\\x0b\\x03/\\x03\\x0b\\x03+\\x03\\x0b\" +\n\t\"\\x02\\x1b\\x03\\x0b\\x02\\x00\\x03\\x0b\\x01\\x1e\\x03\\x0b\\x01\\x08\\x03\\x0b\\x015\" +\n\t\"\\x03\\x06\\x0d9\\x03\\x06\\x0d=\\x03\\x06\\x0d?\\x03\\x02\\x001\\x03\\x02\\x003\\x03\" +\n\t\"\\x02\\x02\\x19\\x03\\x02\\x006\\x03\\x02\\x02\\x1b\\x03\\x02\\x004\\x03\\x02\\x00<\\x03\" +\n\t\"\\x02\\x02\\x0a\\x03\\x02\\x02\\x0e\\x03\\x02\\x01\\x1a\\x03\\x02\\x01\\x07\\x03\\x02\\x01\" +\n\t\"\\x05\\x03\\x02\\x01\\x0b\\x03\\x02\\x01%\\x03\\x02\\x01\\x0c\\x03\\x02\\x01\\x04\\x03\" +\n\t\"\\x02\\x01\\x1c\\x03\\x02\\x00.\\x03\\x02\\x002\\x03\\x02\\x00>\\x03\\x02\\x00\\x12\\x03\" +\n\t\"\\x02\\x00\\x16\\x03\\x02\\x011\\x03\\x02\\x013\\x03\\x02\\x02 \\x03\\x02\\x02%\\x03\\x02\" +\n\t\"\\x02$\\x03\\x02\\x028\\x03\\x02\\x02;\\x03\\x02\\x024\\x03\\x02\\x012\\x03\\x02\\x022\" +\n\t\"\\x03\\x02\\x02/\\x03\\x02\\x01,\\x03\\x02\\x01\\x13\\x03\\x02\\x01\\x16\\x03\\x02\\x01\" +\n\t\"\\x11\\x03\\x02\\x01\\x1e\\x03\\x02\\x01\\x15\\x03\\x02\\x01\\x17\\x03\\x02\\x01\\x0f\\x03\" +\n\t\"\\x02\\x01\\x08\\x03\\x02\\x00?\\x03\\x02\\x03\\x07\\x03\\x02\\x03\\x0d\\x03\\x02\\x03\" +\n\t\"\\x13\\x03\\x02\\x03\\x1d\\x03\\x02\\x03\\x1f\\x03\\x02\\x00\\x03\\x03\\x02\\x00\\x0d\\x03\" +\n\t\"\\x02\\x00\\x01\\x03\\x02\\x00\\x1b\\x03\\x02\\x00\\x19\\x03\\x02\\x00\\x18\\x03\\x02\\x00\" +\n\t\"\\x13\\x03\\x02\\x00/\\x03\\x07>\\x12\\x03\\x07<\\x1f\\x03\\x07>\\x1d\\x03\\x06\\x1d\\x0e\" +\n\t\"\\x03\\x07>\\x1c\\x03\\x07>:\\x03\\x07>\\x13\\x03\\x04\\x12+\\x03\\x07?\\x03\\x03\\x07>\" +\n\t\"\\x02\\x03\\x06\\x224\\x03\\x06\\x1a.\\x03\\x07<%\\x03\\x06\\x1c\\x0b\\x03\\x0609\\x03\" +\n\t\"\\x05\\x1f\\x01\\x03\\x04'\\x08\\x03\\x93\\xfd\\xf5\\x03\\x02\\x0d \\x03\\x02\\x0d#\\x03\" +\n\t\"\\x02\\x0d!\\x03\\x02\\x0d&\\x03\\x02\\x0d\\x22\\x03\\x02\\x0d/\\x03\\x02\\x0d,\\x03\\x02\" +\n\t\"\\x0d$\\x03\\x02\\x0d'\\x03\\x02\\x0d%\\x03\\x02\\x0d;\\x03\\x02\\x0d=\\x03\\x02\\x0d?\" +\n\t\"\\x03\\x099.\\x03\\x08\\x0b7\\x03\\x08\\x02\\x14\\x03\\x08\\x14\\x0d\\x03\\x08.:\\x03\" +\n\t\"\\x089'\\x03\\x0f\\x0b\\x18\\x03\\x0f\\x1c1\\x03\\x0f\\x17&\\x03\\x0f9\\x1f\\x03\\x0f0\" +\n\t\"\\x0c\\x03\\x0e\\x0a9\\x03\\x0e\\x056\\x03\\x0e\\x1c#\\x03\\x0f\\x13\\x0e\\x03\\x072\\x00\" +\n\t\"\\x03\\x070\\x0d\\x03\\x072\\x0b\\x03\\x06\\x11\\x18\\x03\\x070\\x10\\x03\\x06\\x0f(\\x03\" +\n\t\"\\x072\\x05\\x03\\x06\\x0f,\\x03\\x073\\x15\\x03\\x06\\x07\\x08\\x03\\x05\\x16\\x02\\x03\" +\n\t\"\\x04\\x0b \\x03\\x05:8\\x03\\x05\\x16%\\x03\\x0a\\x0d\\x1f\\x03\\x06\\x16\\x10\\x03\\x05\" +\n\t\"\\x1d5\\x03\\x05*;\\x03\\x05\\x16\\x1b\\x03\\x04.-\\x03\\x06\\x1a\\x19\\x03\\x04\\x03,\" +\n\t\"\\x03\\x0b87\\x03\\x04/\\x0a\\x03\\x06\\x00,\\x03\\x04-\\x01\\x03\\x04\\x1e-\\x03\\x06/(\" +\n\t\"\\x03\\x0a\\x0b5\\x03\\x06\\x0e7\\x03\\x06\\x07.\\x03\\x0597\\x03\\x0a*%\\x03\\x0760\" +\n\t\"\\x03\\x06\\x0c;\\x03\\x05'\\x00\\x03\\x072.\\x03\\x072\\x08\\x03\\x06=\\x01\\x03\\x06\" +\n\t\"\\x05\\x1b\\x03\\x06\\x06\\x12\\x03\\x06$=\\x03\\x06'\\x0d\\x03\\x04\\x11\\x0f\\x03\\x076\" +\n\t\",\\x03\\x06\\x07;\\x03\\x06.,\\x03\\x86\\xf9\\xea\\x03\\x8f\\xff\\xeb\\x02\\x092\\x02\" +\n\t\"\\x095\\x02\\x094\\x02\\x09;\\x02\\x09>\\x02\\x098\\x02\\x09*\\x02\\x09/\\x02\\x09,\\x02\" +\n\t\"\\x09%\\x02\\x09&\\x02\\x09#\\x02\\x09 \\x02\\x08!\\x02\\x08%\\x02\\x08$\\x02\\x08+\\x02\" +\n\t\"\\x08.\\x02\\x08*\\x02\\x08&\\x02\\x088\\x02\\x08>\\x02\\x084\\x02\\x086\\x02\\x080\\x02\" +\n\t\"\\x08\\x10\\x02\\x08\\x17\\x02\\x08\\x12\\x02\\x08\\x1d\\x02\\x08\\x1f\\x02\\x08\\x13\\x02\" +\n\t\"\\x08\\x15\\x02\\x08\\x14\\x02\\x08\\x0c\\x03\\x8b\\xfd\\xd0\\x03\\x81\\xec\\xc6\\x03\\x87\" +\n\t\"\\xe0\\x8a\\x03-2\\xe3\\x03\\x80\\xef\\xe4\\x03-2\\xea\\x03\\x88\\xe6\\xeb\\x03\\x8e\\xe6\" +\n\t\"\\xe8\\x03\\x84\\xe6\\xe9\\x03\\x97\\xe6\\xee\\x03-2\\xf9\\x03-2\\xf6\\x03\\x8e\\xe3\\xad\" +\n\t\"\\x03\\x80\\xe3\\x92\\x03\\x88\\xe3\\x90\\x03\\x8e\\xe3\\x90\\x03\\x80\\xe3\\x97\\x03\\x88\" +\n\t\"\\xe3\\x95\\x03\\x88\\xfe\\xcb\\x03\\x8e\\xfe\\xca\\x03\\x84\\xfe\\xcd\\x03\\x91\\xef\\xc9\" +\n\t\"\\x03-2\\xc1\\x03-2\\xc0\\x03-2\\xcb\\x03\\x88@\\x09\\x03\\x8e@\\x08\\x03\\x8f\\xe0\\xf5\" +\n\t\"\\x03\\x8e\\xe6\\xf9\\x03\\x8e\\xe0\\xfa\\x03\\x93\\xff\\xf4\\x03\\x84\\xee\\xd3\\x03\\x0b\" +\n\t\"(\\x04\\x023 \\x021;\\x02\\x01*\\x03\\x0b#\\x10\\x03\\x0b 0\\x03\\x0b!\\x10\\x03\\x0b!0\" +\n\t\"\\x03\\x07\\x15\\x08\\x03\\x09?5\\x03\\x07\\x1f\\x08\\x03\\x07\\x17\\x0b\\x03\\x09\\x1f\" +\n\t\"\\x15\\x03\\x0b\\x1c7\\x03\\x0a+#\\x03\\x06\\x1a\\x1b\\x03\\x06\\x1a\\x14\\x03\\x0a\\x01\" +\n\t\"\\x18\\x03\\x06#\\x1b\\x03\\x0a2\\x0c\\x03\\x0a\\x01\\x04\\x03\\x09#;\\x03\\x08='\\x03\" +\n\t\"\\x08\\x1a\\x0a\\x03\\x07\\x03\\x0a\\x111\\x03\\x09\\x1b\\x09\\x03\\x073.\\x03\\x07\\x01\\x00\" +\n\t\"\\x03\\x09/,\\x03\\x07#>\\x03\\x07\\x048\\x03\\x0a\\x1f\\x22\\x03\\x098>\\x03\\x09\\x11\" +\n\t\"\\x00\\x03\\x08/\\x17\\x03\\x06'\\x22\\x03\\x0b\\x1a+\\x03\\x0a\\x22\\x19\\x03\\x0a/1\" +\n\t\"\\x03\\x0974\\x03\\x09\\x0f\\x22\\x03\\x08,\\x22\\x03\\x08?\\x14\\x03\\x07$5\\x03\\x07<3\" +\n\t\"\\x03\\x07=*\\x03\\x07\\x13\\x18\\x03\\x068\\x0a\\x03\\x06\\x09\\x16\\x03\\x06\\x13\\x00\" +\n\t\"\\x03\\x08\\x067\\x03\\x08\\x01\\x03\\x03\\x08\\x12\\x1d\\x03\\x07+7\\x03\\x06(;\\x03\" +\n\t\"\\x06\\x1c?\\x03\\x07\\x0e\\x17\\x03\\x0a\\x06\\x1d\\x03\\x0a\\x19\\x07\\x03\\x08\\x14$\" +\n\t\"\\x03\\x07$;\\x03\\x08,$\\x03\\x08\\x06\\x0d\\x03\\x07\\x16\\x0a\\x03\\x06>>\\x03\\x0a\" +\n\t\"\\x06\\x12\\x03\\x0a\\x14)\\x03\\x09\\x0d\\x1f\\x03\\x09\\x12\\x17\\x03\\x09\\x19\\x01\" +\n\t\"\\x03\\x08\\x11 \\x03\\x08\\x1d'\\x03\\x06<\\x1a\\x03\\x0a.\\x00\\x03\\x07'\\x18\\x03\" +\n\t\"\\x0a\\x22\\x08\\x03\\x08\\x0d\\x0a\\x03\\x08\\x13)\\x03\\x07*)\\x03\\x06<,\\x03\\x07\" +\n\t\"\\x0b\\x1a\\x03\\x09.\\x14\\x03\\x09\\x0d\\x1e\\x03\\x07\\x0e#\\x03\\x0b\\x1d'\\x03\\x0a\" +\n\t\"\\x0a8\\x03\\x09%2\\x03\\x08+&\\x03\\x080\\x12\\x03\\x0a)4\\x03\\x08\\x06\\x1f\\x03\\x0b\" +\n\t\"\\x1b\\x1a\\x03\\x0a\\x1b\\x0f\\x03\\x0b\\x1d*\\x03\\x09\\x16$\\x03\\x090\\x11\\x03\\x08\" +\n\t\"\\x11\\x08\\x03\\x0a*(\\x03\\x0a\\x042\\x03\\x089,\\x03\\x074'\\x03\\x07\\x0f\\x05\\x03\" +\n\t\"\\x09\\x0b\\x0a\\x03\\x07\\x1b\\x01\\x03\\x09\\x17:\\x03\\x09.\\x0d\\x03\\x07.\\x11\\x03\" +\n\t\"\\x09+\\x15\\x03\\x080\\x13\\x03\\x0b\\x1f\\x19\\x03\\x0a \\x11\\x03\\x0a\\x220\\x03\\x09\" +\n\t\"\\x07;\\x03\\x08\\x16\\x1c\\x03\\x07,\\x13\\x03\\x07\\x0e/\\x03\\x06\\x221\\x03\\x0a.\" +\n\t\"\\x0a\\x03\\x0a7\\x02\\x03\\x0a\\x032\\x03\\x0a\\x1d.\\x03\\x091\\x06\\x03\\x09\\x19:\" +\n\t\"\\x03\\x08\\x02/\\x03\\x060+\\x03\\x06\\x0f-\\x03\\x06\\x1c\\x1f\\x03\\x06\\x1d\\x07\\x03\" +\n\t\"\\x0a,\\x11\\x03\\x09=\\x0d\\x03\\x09\\x0b;\\x03\\x07\\x1b/\\x03\\x0a\\x1f:\\x03\\x09 \" +\n\t\"\\x1f\\x03\\x09.\\x10\\x03\\x094\\x0b\\x03\\x09\\x1a1\\x03\\x08#\\x1a\\x03\\x084\\x1d\" +\n\t\"\\x03\\x08\\x01\\x1f\\x03\\x08\\x11\\x22\\x03\\x07'8\\x03\\x07\\x1a>\\x03\\x0757\\x03\" +\n\t\"\\x06&9\\x03\\x06+\\x11\\x03\\x0a.\\x0b\\x03\\x0a,>\\x03\\x0a4#\\x03\\x08%\\x17\\x03\" +\n\t\"\\x07\\x05\\x22\\x03\\x07\\x0c\\x0b\\x03\\x0a\\x1d+\\x03\\x0a\\x19\\x16\\x03\\x09+\\x1f\" +\n\t\"\\x03\\x09\\x08\\x0b\\x03\\x08\\x16\\x18\\x03\\x08+\\x12\\x03\\x0b\\x1d\\x0c\\x03\\x0a=\" +\n\t\"\\x10\\x03\\x0a\\x09\\x0d\\x03\\x0a\\x10\\x11\\x03\\x09&0\\x03\\x08(\\x1f\\x03\\x087\\x07\" +\n\t\"\\x03\\x08\\x185\\x03\\x07'6\\x03\\x06.\\x05\\x03\\x06=\\x04\\x03\\x06;;\\x03\\x06\\x06,\" +\n\t\"\\x03\\x0b\\x18>\\x03\\x08\\x00\\x18\\x03\\x06 \\x03\\x03\\x06<\\x00\\x03\\x09%\\x18\\x03\" +\n\t\"\\x0b\\x1c<\\x03\\x0a%!\\x03\\x0a\\x09\\x12\\x03\\x0a\\x16\\x02\\x03\\x090'\\x03\\x09\" +\n\t\"\\x0e=\\x03\\x08 \\x0e\\x03\\x08>\\x03\\x03\\x074>\\x03\\x06&?\\x03\\x06\\x19\\x09\\x03\" +\n\t\"\\x06?(\\x03\\x0a-\\x0e\\x03\\x09:3\\x03\\x098:\\x03\\x09\\x12\\x0b\\x03\\x09\\x1d\\x17\" +\n\t\"\\x03\\x087\\x05\\x03\\x082\\x14\\x03\\x08\\x06%\\x03\\x08\\x13\\x1f\\x03\\x06\\x06\\x0e\" +\n\t\"\\x03\\x0a\\x22<\\x03\\x09/<\\x03\\x06>+\\x03\\x0a'?\\x03\\x0a\\x13\\x0c\\x03\\x09\\x10<\" +\n\t\"\\x03\\x07\\x1b=\\x03\\x0a\\x19\\x13\\x03\\x09\\x22\\x1d\\x03\\x09\\x07\\x0d\\x03\\x08)\" +\n\t\"\\x1c\\x03\\x06=\\x1a\\x03\\x0a/4\\x03\\x0a7\\x11\\x03\\x0a\\x16:\\x03\\x09?3\\x03\\x09:\" +\n\t\"/\\x03\\x09\\x05\\x0a\\x03\\x09\\x14\\x06\\x03\\x087\\x22\\x03\\x080\\x07\\x03\\x08\\x1a\" +\n\t\"\\x1f\\x03\\x07\\x04(\\x03\\x07\\x04\\x09\\x03\\x06 %\\x03\\x06<\\x08\\x03\\x0a+\\x14\" +\n\t\"\\x03\\x09\\x1d\\x16\\x03\\x0a70\\x03\\x08 >\\x03\\x0857\\x03\\x070\\x0a\\x03\\x06=\\x12\" +\n\t\"\\x03\\x06\\x16%\\x03\\x06\\x1d,\\x03\\x099#\\x03\\x09\\x10>\\x03\\x07 \\x1e\\x03\\x08\" +\n\t\"\\x0c<\\x03\\x08\\x0b\\x18\\x03\\x08\\x15+\\x03\\x08,:\\x03\\x08%\\x22\\x03\\x07\\x0a$\" +\n\t\"\\x03\\x0b\\x1c=\\x03\\x07+\\x08\\x03\\x0a/\\x05\\x03\\x0a \\x07\\x03\\x0a\\x12'\\x03\" +\n\t\"\\x09#\\x11\\x03\\x08\\x1b\\x15\\x03\\x0a\\x06\\x01\\x03\\x09\\x1c\\x1b\\x03\\x0922\\x03\" +\n\t\"\\x07\\x14<\\x03\\x07\\x09\\x04\\x03\\x061\\x04\\x03\\x07\\x0e\\x01\\x03\\x0a\\x13\\x18\" +\n\t\"\\x03\\x0a-\\x0c\\x03\\x0a?\\x0d\\x03\\x0a\\x09\\x0a\\x03\\x091&\\x03\\x0a/\\x0b\\x03\" +\n\t\"\\x08$<\\x03\\x083\\x1d\\x03\\x08\\x0c$\\x03\\x08\\x0d\\x07\\x03\\x08\\x0d?\\x03\\x08\" +\n\t\"\\x0e\\x14\\x03\\x065\\x0a\\x03\\x08\\x1a#\\x03\\x08\\x16#\\x03\\x0702\\x03\\x07\\x03\" +\n\t\"\\x1a\\x03\\x06(\\x1d\\x03\\x06+\\x1b\\x03\\x06\\x0b\\x05\\x03\\x06\\x0b\\x17\\x03\\x06\" +\n\t\"\\x0c\\x04\\x03\\x06\\x1e\\x19\\x03\\x06+0\\x03\\x062\\x18\\x03\\x0b\\x16\\x1e\\x03\\x0a+\" +\n\t\"\\x16\\x03\\x0a-?\\x03\\x0a#:\\x03\\x0a#\\x10\\x03\\x0a%$\\x03\\x0a>+\\x03\\x0a01\\x03\" +\n\t\"\\x0a1\\x10\\x03\\x0a\\x099\\x03\\x0a\\x0a\\x12\\x03\\x0a\\x19\\x1f\\x03\\x0a\\x19\\x12\" +\n\t\"\\x03\\x09*)\\x03\\x09-\\x16\\x03\\x09.1\\x03\\x09.2\\x03\\x09<\\x0e\\x03\\x09> \\x03\" +\n\t\"\\x093\\x12\\x03\\x09\\x0b\\x01\\x03\\x09\\x1c2\\x03\\x09\\x11\\x1c\\x03\\x09\\x15%\\x03\" +\n\t\"\\x08,&\\x03\\x08!\\x22\\x03\\x089(\\x03\\x08\\x0b\\x1a\\x03\\x08\\x0d2\\x03\\x08\\x0c\" +\n\t\"\\x04\\x03\\x08\\x0c\\x06\\x03\\x08\\x0c\\x1f\\x03\\x08\\x0c\\x0c\\x03\\x08\\x0f\\x1f\\x03\" +\n\t\"\\x08\\x0f\\x1d\\x03\\x08\\x00\\x14\\x03\\x08\\x03\\x14\\x03\\x08\\x06\\x16\\x03\\x08\\x1e\" +\n\t\"#\\x03\\x08\\x11\\x11\\x03\\x08\\x10\\x18\\x03\\x08\\x14(\\x03\\x07)\\x1e\\x03\\x07.1\" +\n\t\"\\x03\\x07 $\\x03\\x07 '\\x03\\x078\\x08\\x03\\x07\\x0d0\\x03\\x07\\x0f7\\x03\\x07\\x05#\" +\n\t\"\\x03\\x07\\x05\\x1a\\x03\\x07\\x1a7\\x03\\x07\\x1d-\\x03\\x07\\x17\\x10\\x03\\x06)\\x1f\" +\n\t\"\\x03\\x062\\x0b\\x03\\x066\\x16\\x03\\x06\\x09\\x11\\x03\\x09(\\x1e\\x03\\x07!5\\x03\" +\n\t\"\\x0b\\x11\\x16\\x03\\x0a/\\x04\\x03\\x0a,\\x1a\\x03\\x0b\\x173\\x03\\x0a,1\\x03\\x0a/5\" +\n\t\"\\x03\\x0a\\x221\\x03\\x0a\\x22\\x0d\\x03\\x0a?%\\x03\\x0a<,\\x03\\x0a?#\\x03\\x0a>\\x19\" +\n\t\"\\x03\\x0a\\x08&\\x03\\x0a\\x0b\\x0e\\x03\\x0a\\x0c:\\x03\\x0a\\x0c+\\x03\\x0a\\x03\\x22\" +\n\t\"\\x03\\x0a\\x06)\\x03\\x0a\\x11\\x10\\x03\\x0a\\x11\\x1a\\x03\\x0a\\x17-\\x03\\x0a\\x14(\" +\n\t\"\\x03\\x09)\\x1e\\x03\\x09/\\x09\\x03\\x09.\\x00\\x03\\x09,\\x07\\x03\\x09/*\\x03\\x09-9\" +\n\t\"\\x03\\x09\\x228\\x03\\x09%\\x09\\x03\\x09:\\x12\\x03\\x09;\\x1d\\x03\\x09?\\x06\\x03\" +\n\t\"\\x093%\\x03\\x096\\x05\\x03\\x096\\x08\\x03\\x097\\x02\\x03\\x09\\x07,\\x03\\x09\\x04,\" +\n\t\"\\x03\\x09\\x1f\\x16\\x03\\x09\\x11\\x03\\x03\\x09\\x11\\x12\\x03\\x09\\x168\\x03\\x08*\" +\n\t\"\\x05\\x03\\x08/2\\x03\\x084:\\x03\\x08\\x22+\\x03\\x08 0\\x03\\x08&\\x0a\\x03\\x08;\" +\n\t\"\\x10\\x03\\x08>$\\x03\\x08>\\x18\\x03\\x0829\\x03\\x082:\\x03\\x081,\\x03\\x081<\\x03\" +\n\t\"\\x081\\x1c\\x03\\x087#\\x03\\x087*\\x03\\x08\\x09'\\x03\\x08\\x00\\x1d\\x03\\x08\\x05-\" +\n\t\"\\x03\\x08\\x1f4\\x03\\x08\\x1d\\x04\\x03\\x08\\x16\\x0f\\x03\\x07*7\\x03\\x07'!\\x03\" +\n\t\"\\x07%\\x1b\\x03\\x077\\x0c\\x03\\x07\\x0c1\\x03\\x07\\x0c.\\x03\\x07\\x00\\x06\\x03\\x07\" +\n\t\"\\x01\\x02\\x03\\x07\\x010\\x03\\x07\\x06=\\x03\\x07\\x01\\x03\\x03\\x07\\x01\\x13\\x03\" +\n\t\"\\x07\\x06\\x06\\x03\\x07\\x05\\x0a\\x03\\x07\\x1f\\x09\\x03\\x07\\x17:\\x03\\x06*1\\x03\" +\n\t\"\\x06-\\x1d\\x03\\x06\\x223\\x03\\x062:\\x03\\x060$\\x03\\x066\\x1e\\x03\\x064\\x12\\x03\" +\n\t\"\\x0645\\x03\\x06\\x0b\\x00\\x03\\x06\\x0b7\\x03\\x06\\x07\\x1f\\x03\\x06\\x15\\x12\\x03\" +\n\t\"\\x0c\\x05\\x0f\\x03\\x0b+\\x0b\\x03\\x0b+-\\x03\\x06\\x16\\x1b\\x03\\x06\\x15\\x17\\x03\" +\n\t\"\\x89\\xca\\xea\\x03\\x89\\xca\\xe8\\x03\\x0c8\\x10\\x03\\x0c8\\x01\\x03\\x0c8\\x0f\\x03\" +\n\t\"\\x0d8%\\x03\\x0d8!\\x03\\x0c8-\\x03\\x0c8/\\x03\\x0c8+\\x03\\x0c87\\x03\\x0c85\\x03\" +\n\t\"\\x0c9\\x09\\x03\\x0c9\\x0d\\x03\\x0c9\\x0f\\x03\\x0c9\\x0b\\x03\\xcfu\\x0c\\x03\\xcfu\" +\n\t\"\\x0f\\x03\\xcfu\\x0e\\x03\\xcfu\\x09\\x03\\x0c9\\x10\\x03\\x0d9\\x0c\\x03\\xcf`;\\x03\" +\n\t\"\\xcf`>\\x03\\xcf`9\\x03\\xcf`8\\x03\\xcf`7\\x03\\xcf`*\\x03\\xcf`-\\x03\\xcf`,\\x03\" +\n\t\"\\x0d\\x1b\\x1a\\x03\\x0d\\x1b&\\x03\\x0c=.\\x03\\x0c=%\\x03\\x0c>\\x1e\\x03\\x0c>\\x14\" +\n\t\"\\x03\\x0c?\\x06\\x03\\x0c?\\x0b\\x03\\x0c?\\x0c\\x03\\x0c?\\x0d\\x03\\x0c?\\x02\\x03\" +\n\t\"\\x0c>\\x0f\\x03\\x0c>\\x08\\x03\\x0c>\\x09\\x03\\x0c>,\\x03\\x0c>\\x0c\\x03\\x0c?\\x13\" +\n\t\"\\x03\\x0c?\\x16\\x03\\x0c?\\x15\\x03\\x0c?\\x1c\\x03\\x0c?\\x1f\\x03\\x0c?\\x1d\\x03\" +\n\t\"\\x0c?\\x1a\\x03\\x0c?\\x17\\x03\\x0c?\\x08\\x03\\x0c?\\x09\\x03\\x0c?\\x0e\\x03\\x0c?\" +\n\t\"\\x04\\x03\\x0c?\\x05\\x03\\x0c\" +\n\t\"\\x03\\x0c=2\\x03\\x0c=6\\x03\\x0c<\\x07\\x03\\x0c<\\x05\\x03\\x0e:!\\x03\\x0e:#\\x03\" +\n\t\"\\x0e8\\x09\\x03\\x0e:&\\x03\\x0e8\\x0b\\x03\\x0e:$\\x03\\x0e:,\\x03\\x0e8\\x1a\\x03\" +\n\t\"\\x0e8\\x1e\\x03\\x0e:*\\x03\\x0e:7\\x03\\x0e:5\\x03\\x0e:;\\x03\\x0e:\\x15\\x03\\x0e:<\" +\n\t\"\\x03\\x0e:4\\x03\\x0e:'\\x03\\x0e:-\\x03\\x0e:%\\x03\\x0e:?\\x03\\x0e:=\\x03\\x0e:)\" +\n\t\"\\x03\\x0e:/\\x03\\xcfs'\\x03\\x0d=\\x0f\\x03\\x0d+*\\x03\\x0d99\\x03\\x0d9;\\x03\\x0d9\" +\n\t\"?\\x03\\x0d)\\x0d\\x03\\x0d(%\\x02\\x01\\x18\\x02\\x01(\\x02\\x01\\x1e\\x03\\x0f$!\\x03\" +\n\t\"\\x0f87\\x03\\x0f4\\x0e\\x03\\x0f5\\x1d\\x03\\x06'\\x03\\x03\\x0f\\x08\\x18\\x03\\x0f\" +\n\t\"\\x0d\\x1b\\x03\\x0e2=\\x03\\x0e;\\x08\\x03\\x0e:\\x0b\\x03\\x0e\\x06$\\x03\\x0e\\x0d)\" +\n\t\"\\x03\\x0e\\x16\\x1f\\x03\\x0e\\x16\\x1b\\x03\\x0d$\\x0a\\x03\\x05,\\x1d\\x03\\x0d. \\x03\" +\n\t\"\\x0d.#\\x03\\x0c(/\\x03\\x09%\\x02\\x03\\x0d90\\x03\\x0d\\x0e4\\x03\\x0d\\x0d\\x0f\\x03\" +\n\t\"\\x0c#\\x00\\x03\\x0c,\\x1e\\x03\\x0c2\\x0e\\x03\\x0c\\x01\\x17\\x03\\x0c\\x09:\\x03\\x0e\" +\n\t\"\\x173\\x03\\x0c\\x08\\x03\\x03\\x0c\\x11\\x07\\x03\\x0c\\x10\\x18\\x03\\x0c\\x1f\\x1c\" +\n\t\"\\x03\\x0c\\x19\\x0e\\x03\\x0c\\x1a\\x1f\\x03\\x0f0>\\x03\\x0b->\\x03\\x0b<+\\x03\\x0b8\" +\n\t\"\\x13\\x03\\x0b\\x043\\x03\\x0b\\x14\\x03\\x03\\x0b\\x16%\\x03\\x0d\\x22&\\x03\\x0b\\x1a\" +\n\t\"\\x1a\\x03\\x0b\\x1a\\x04\\x03\\x0a%9\\x03\\x0a&2\\x03\\x0a&0\\x03\\x0a!\\x1a\\x03\\x0a!\" +\n\t\"7\\x03\\x0a5\\x10\\x03\\x0a=4\\x03\\x0a?\\x0e\\x03\\x0a>\\x10\\x03\\x0a\\x00 \\x03\\x0a\" +\n\t\"\\x0f:\\x03\\x0a\\x0f9\\x03\\x0a\\x0b\\x0a\\x03\\x0a\\x17%\\x03\\x0a\\x1b-\\x03\\x09-\" +\n\t\"\\x1a\\x03\\x09,4\\x03\\x09.,\\x03\\x09)\\x09\\x03\\x096!\\x03\\x091\\x1f\\x03\\x093\" +\n\t\"\\x16\\x03\\x0c+\\x1f\\x03\\x098 \\x03\\x098=\\x03\\x0c(\\x1a\\x03\\x0c(\\x16\\x03\\x09\" +\n\t\"\\x0a+\\x03\\x09\\x16\\x12\\x03\\x09\\x13\\x0e\\x03\\x09\\x153\\x03\\x08)!\\x03\\x09\\x1a\" +\n\t\"\\x01\\x03\\x09\\x18\\x01\\x03\\x08%#\\x03\\x08>\\x22\\x03\\x08\\x05%\\x03\\x08\\x02*\" +\n\t\"\\x03\\x08\\x15;\\x03\\x08\\x1b7\\x03\\x0f\\x07\\x1d\\x03\\x0f\\x04\\x03\\x03\\x070\\x0c\" +\n\t\"\\x03\\x07;\\x0b\\x03\\x07\\x08\\x17\\x03\\x07\\x12\\x06\\x03\\x06/-\\x03\\x0671\\x03\" +\n\t\"\\x065+\\x03\\x06>7\\x03\\x06\\x049\\x03\\x05+\\x1e\\x03\\x05,\\x17\\x03\\x05 \\x1d\\x03\" +\n\t\"\\x05\\x22\\x05\\x03\\x050\\x1d\"\n\n// lookup returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookup(s []byte) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupUnsafe(s []byte) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// lookupString returns the trie value for the first UTF-8 encoding in s and\n// the width in bytes of this encoding. The size will be 0 if s does not\n// hold enough bytes to complete the encoding. len(s) must be greater than 0.\nfunc (t *idnaTrie) lookupString(s string) (v uint16, sz int) {\n\tc0 := s[0]\n\tswitch {\n\tcase c0 < 0x80: // is ASCII\n\t\treturn idnaValues[c0], 1\n\tcase c0 < 0xC2:\n\t\treturn 0, 1 // Illegal UTF-8: not a starter, not ASCII.\n\tcase c0 < 0xE0: // 2-byte UTF-8\n\t\tif len(s) < 2 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c1), 2\n\tcase c0 < 0xF0: // 3-byte UTF-8\n\t\tif len(s) < 3 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c2), 3\n\tcase c0 < 0xF8: // 4-byte UTF-8\n\t\tif len(s) < 4 {\n\t\t\treturn 0, 0\n\t\t}\n\t\ti := idnaIndex[c0]\n\t\tc1 := s[1]\n\t\tif c1 < 0x80 || 0xC0 <= c1 {\n\t\t\treturn 0, 1 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to := uint32(i)<<6 + uint32(c1)\n\t\ti = idnaIndex[o]\n\t\tc2 := s[2]\n\t\tif c2 < 0x80 || 0xC0 <= c2 {\n\t\t\treturn 0, 2 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\to = uint32(i)<<6 + uint32(c2)\n\t\ti = idnaIndex[o]\n\t\tc3 := s[3]\n\t\tif c3 < 0x80 || 0xC0 <= c3 {\n\t\t\treturn 0, 3 // Illegal UTF-8: not a continuation byte.\n\t\t}\n\t\treturn t.lookupValue(uint32(i), c3), 4\n\t}\n\t// Illegal rune\n\treturn 0, 1\n}\n\n// lookupStringUnsafe returns the trie value for the first UTF-8 encoding in s.\n// s must start with a full and valid UTF-8 encoded rune.\nfunc (t *idnaTrie) lookupStringUnsafe(s string) uint16 {\n\tc0 := s[0]\n\tif c0 < 0x80 { // is ASCII\n\t\treturn idnaValues[c0]\n\t}\n\ti := idnaIndex[c0]\n\tif c0 < 0xE0 { // 2-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[1])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[1])]\n\tif c0 < 0xF0 { // 3-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[2])\n\t}\n\ti = idnaIndex[uint32(i)<<6+uint32(s[2])]\n\tif c0 < 0xF8 { // 4-byte UTF-8\n\t\treturn t.lookupValue(uint32(i), s[3])\n\t}\n\treturn 0\n}\n\n// idnaTrie. Total size: 28600 bytes (27.93 KiB). Checksum: 95575047b5d8fff.\ntype idnaTrie struct{}\n\nfunc newIdnaTrie(i int) *idnaTrie {\n\treturn &idnaTrie{}\n}\n\n// lookupValue determines the type of block n and looks up the value for b.\nfunc (t *idnaTrie) lookupValue(n uint32, b byte) uint16 {\n\tswitch {\n\tcase n < 124:\n\t\treturn uint16(idnaValues[n<<6+uint32(b)])\n\tdefault:\n\t\tn -= 124\n\t\treturn uint16(idnaSparse.lookup(n, b))\n\t}\n}\n\n// idnaValues: 126 blocks, 8064 entries, 16128 bytes\n// The third block is the zero block.\nvar idnaValues = [8064]uint16{\n\t// Block 0x0, offset 0x0\n\t0x00: 0x0080, 0x01: 0x0080, 0x02: 0x0080, 0x03: 0x0080, 0x04: 0x0080, 0x05: 0x0080,\n\t0x06: 0x0080, 0x07: 0x0080, 0x08: 0x0080, 0x09: 0x0080, 0x0a: 0x0080, 0x0b: 0x0080,\n\t0x0c: 0x0080, 0x0d: 0x0080, 0x0e: 0x0080, 0x0f: 0x0080, 0x10: 0x0080, 0x11: 0x0080,\n\t0x12: 0x0080, 0x13: 0x0080, 0x14: 0x0080, 0x15: 0x0080, 0x16: 0x0080, 0x17: 0x0080,\n\t0x18: 0x0080, 0x19: 0x0080, 0x1a: 0x0080, 0x1b: 0x0080, 0x1c: 0x0080, 0x1d: 0x0080,\n\t0x1e: 0x0080, 0x1f: 0x0080, 0x20: 0x0080, 0x21: 0x0080, 0x22: 0x0080, 0x23: 0x0080,\n\t0x24: 0x0080, 0x25: 0x0080, 0x26: 0x0080, 0x27: 0x0080, 0x28: 0x0080, 0x29: 0x0080,\n\t0x2a: 0x0080, 0x2b: 0x0080, 0x2c: 0x0080, 0x2d: 0x0008, 0x2e: 0x0008, 0x2f: 0x0080,\n\t0x30: 0x0008, 0x31: 0x0008, 0x32: 0x0008, 0x33: 0x0008, 0x34: 0x0008, 0x35: 0x0008,\n\t0x36: 0x0008, 0x37: 0x0008, 0x38: 0x0008, 0x39: 0x0008, 0x3a: 0x0080, 0x3b: 0x0080,\n\t0x3c: 0x0080, 0x3d: 0x0080, 0x3e: 0x0080, 0x3f: 0x0080,\n\t// Block 0x1, offset 0x40\n\t0x40: 0x0080, 0x41: 0xe105, 0x42: 0xe105, 0x43: 0xe105, 0x44: 0xe105, 0x45: 0xe105,\n\t0x46: 0xe105, 0x47: 0xe105, 0x48: 0xe105, 0x49: 0xe105, 0x4a: 0xe105, 0x4b: 0xe105,\n\t0x4c: 0xe105, 0x4d: 0xe105, 0x4e: 0xe105, 0x4f: 0xe105, 0x50: 0xe105, 0x51: 0xe105,\n\t0x52: 0xe105, 0x53: 0xe105, 0x54: 0xe105, 0x55: 0xe105, 0x56: 0xe105, 0x57: 0xe105,\n\t0x58: 0xe105, 0x59: 0xe105, 0x5a: 0xe105, 0x5b: 0x0080, 0x5c: 0x0080, 0x5d: 0x0080,\n\t0x5e: 0x0080, 0x5f: 0x0080, 0x60: 0x0080, 0x61: 0x0008, 0x62: 0x0008, 0x63: 0x0008,\n\t0x64: 0x0008, 0x65: 0x0008, 0x66: 0x0008, 0x67: 0x0008, 0x68: 0x0008, 0x69: 0x0008,\n\t0x6a: 0x0008, 0x6b: 0x0008, 0x6c: 0x0008, 0x6d: 0x0008, 0x6e: 0x0008, 0x6f: 0x0008,\n\t0x70: 0x0008, 0x71: 0x0008, 0x72: 0x0008, 0x73: 0x0008, 0x74: 0x0008, 0x75: 0x0008,\n\t0x76: 0x0008, 0x77: 0x0008, 0x78: 0x0008, 0x79: 0x0008, 0x7a: 0x0008, 0x7b: 0x0080,\n\t0x7c: 0x0080, 0x7d: 0x0080, 0x7e: 0x0080, 0x7f: 0x0080,\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc0: 0x0040, 0xc1: 0x0040, 0xc2: 0x0040, 0xc3: 0x0040, 0xc4: 0x0040, 0xc5: 0x0040,\n\t0xc6: 0x0040, 0xc7: 0x0040, 0xc8: 0x0040, 0xc9: 0x0040, 0xca: 0x0040, 0xcb: 0x0040,\n\t0xcc: 0x0040, 0xcd: 0x0040, 0xce: 0x0040, 0xcf: 0x0040, 0xd0: 0x0040, 0xd1: 0x0040,\n\t0xd2: 0x0040, 0xd3: 0x0040, 0xd4: 0x0040, 0xd5: 0x0040, 0xd6: 0x0040, 0xd7: 0x0040,\n\t0xd8: 0x0040, 0xd9: 0x0040, 0xda: 0x0040, 0xdb: 0x0040, 0xdc: 0x0040, 0xdd: 0x0040,\n\t0xde: 0x0040, 0xdf: 0x0040, 0xe0: 0x000a, 0xe1: 0x0018, 0xe2: 0x0018, 0xe3: 0x0018,\n\t0xe4: 0x0018, 0xe5: 0x0018, 0xe6: 0x0018, 0xe7: 0x0018, 0xe8: 0x001a, 0xe9: 0x0018,\n\t0xea: 0x0039, 0xeb: 0x0018, 0xec: 0x0018, 0xed: 0x03c0, 0xee: 0x0018, 0xef: 0x004a,\n\t0xf0: 0x0018, 0xf1: 0x0018, 0xf2: 0x0069, 0xf3: 0x0079, 0xf4: 0x008a, 0xf5: 0x0005,\n\t0xf6: 0x0018, 0xf7: 0x0008, 0xf8: 0x00aa, 0xf9: 0x00c9, 0xfa: 0x00d9, 0xfb: 0x0018,\n\t0xfc: 0x00e9, 0xfd: 0x0119, 0xfe: 0x0149, 0xff: 0x0018,\n\t// Block 0x4, offset 0x100\n\t0x100: 0xe00d, 0x101: 0x0008, 0x102: 0xe00d, 0x103: 0x0008, 0x104: 0xe00d, 0x105: 0x0008,\n\t0x106: 0xe00d, 0x107: 0x0008, 0x108: 0xe00d, 0x109: 0x0008, 0x10a: 0xe00d, 0x10b: 0x0008,\n\t0x10c: 0xe00d, 0x10d: 0x0008, 0x10e: 0xe00d, 0x10f: 0x0008, 0x110: 0xe00d, 0x111: 0x0008,\n\t0x112: 0xe00d, 0x113: 0x0008, 0x114: 0xe00d, 0x115: 0x0008, 0x116: 0xe00d, 0x117: 0x0008,\n\t0x118: 0xe00d, 0x119: 0x0008, 0x11a: 0xe00d, 0x11b: 0x0008, 0x11c: 0xe00d, 0x11d: 0x0008,\n\t0x11e: 0xe00d, 0x11f: 0x0008, 0x120: 0xe00d, 0x121: 0x0008, 0x122: 0xe00d, 0x123: 0x0008,\n\t0x124: 0xe00d, 0x125: 0x0008, 0x126: 0xe00d, 0x127: 0x0008, 0x128: 0xe00d, 0x129: 0x0008,\n\t0x12a: 0xe00d, 0x12b: 0x0008, 0x12c: 0xe00d, 0x12d: 0x0008, 0x12e: 0xe00d, 0x12f: 0x0008,\n\t0x130: 0x0179, 0x131: 0x0008, 0x132: 0x0035, 0x133: 0x004d, 0x134: 0xe00d, 0x135: 0x0008,\n\t0x136: 0xe00d, 0x137: 0x0008, 0x138: 0x0008, 0x139: 0xe01d, 0x13a: 0x0008, 0x13b: 0xe03d,\n\t0x13c: 0x0008, 0x13d: 0xe01d, 0x13e: 0x0008, 0x13f: 0x0199,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x0199, 0x141: 0xe01d, 0x142: 0x0008, 0x143: 0xe03d, 0x144: 0x0008, 0x145: 0xe01d,\n\t0x146: 0x0008, 0x147: 0xe07d, 0x148: 0x0008, 0x149: 0x01b9, 0x14a: 0xe00d, 0x14b: 0x0008,\n\t0x14c: 0xe00d, 0x14d: 0x0008, 0x14e: 0xe00d, 0x14f: 0x0008, 0x150: 0xe00d, 0x151: 0x0008,\n\t0x152: 0xe00d, 0x153: 0x0008, 0x154: 0xe00d, 0x155: 0x0008, 0x156: 0xe00d, 0x157: 0x0008,\n\t0x158: 0xe00d, 0x159: 0x0008, 0x15a: 0xe00d, 0x15b: 0x0008, 0x15c: 0xe00d, 0x15d: 0x0008,\n\t0x15e: 0xe00d, 0x15f: 0x0008, 0x160: 0xe00d, 0x161: 0x0008, 0x162: 0xe00d, 0x163: 0x0008,\n\t0x164: 0xe00d, 0x165: 0x0008, 0x166: 0xe00d, 0x167: 0x0008, 0x168: 0xe00d, 0x169: 0x0008,\n\t0x16a: 0xe00d, 0x16b: 0x0008, 0x16c: 0xe00d, 0x16d: 0x0008, 0x16e: 0xe00d, 0x16f: 0x0008,\n\t0x170: 0xe00d, 0x171: 0x0008, 0x172: 0xe00d, 0x173: 0x0008, 0x174: 0xe00d, 0x175: 0x0008,\n\t0x176: 0xe00d, 0x177: 0x0008, 0x178: 0x0065, 0x179: 0xe01d, 0x17a: 0x0008, 0x17b: 0xe03d,\n\t0x17c: 0x0008, 0x17d: 0xe01d, 0x17e: 0x0008, 0x17f: 0x01d9,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x0008, 0x181: 0x007d, 0x182: 0xe00d, 0x183: 0x0008, 0x184: 0xe00d, 0x185: 0x0008,\n\t0x186: 0x007d, 0x187: 0xe07d, 0x188: 0x0008, 0x189: 0x0095, 0x18a: 0x00ad, 0x18b: 0xe03d,\n\t0x18c: 0x0008, 0x18d: 0x0008, 0x18e: 0x00c5, 0x18f: 0x00dd, 0x190: 0x00f5, 0x191: 0xe01d,\n\t0x192: 0x0008, 0x193: 0x010d, 0x194: 0x0125, 0x195: 0x0008, 0x196: 0x013d, 0x197: 0x013d,\n\t0x198: 0xe00d, 0x199: 0x0008, 0x19a: 0x0008, 0x19b: 0x0008, 0x19c: 0x010d, 0x19d: 0x0155,\n\t0x19e: 0x0008, 0x19f: 0x016d, 0x1a0: 0xe00d, 0x1a1: 0x0008, 0x1a2: 0xe00d, 0x1a3: 0x0008,\n\t0x1a4: 0xe00d, 0x1a5: 0x0008, 0x1a6: 0x0185, 0x1a7: 0xe07d, 0x1a8: 0x0008, 0x1a9: 0x019d,\n\t0x1aa: 0x0008, 0x1ab: 0x0008, 0x1ac: 0xe00d, 0x1ad: 0x0008, 0x1ae: 0x0185, 0x1af: 0xe0fd,\n\t0x1b0: 0x0008, 0x1b1: 0x01b5, 0x1b2: 0x01cd, 0x1b3: 0xe03d, 0x1b4: 0x0008, 0x1b5: 0xe01d,\n\t0x1b6: 0x0008, 0x1b7: 0x01e5, 0x1b8: 0xe00d, 0x1b9: 0x0008, 0x1ba: 0x0008, 0x1bb: 0x0008,\n\t0x1bc: 0xe00d, 0x1bd: 0x0008, 0x1be: 0x0008, 0x1bf: 0x0008,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x0008, 0x1c1: 0x0008, 0x1c2: 0x0008, 0x1c3: 0x0008, 0x1c4: 0x01e9, 0x1c5: 0x01e9,\n\t0x1c6: 0x01e9, 0x1c7: 0x01fd, 0x1c8: 0x0215, 0x1c9: 0x022d, 0x1ca: 0x0245, 0x1cb: 0x025d,\n\t0x1cc: 0x0275, 0x1cd: 0xe01d, 0x1ce: 0x0008, 0x1cf: 0xe0fd, 0x1d0: 0x0008, 0x1d1: 0xe01d,\n\t0x1d2: 0x0008, 0x1d3: 0xe03d, 0x1d4: 0x0008, 0x1d5: 0xe01d, 0x1d6: 0x0008, 0x1d7: 0xe07d,\n\t0x1d8: 0x0008, 0x1d9: 0xe01d, 0x1da: 0x0008, 0x1db: 0xe03d, 0x1dc: 0x0008, 0x1dd: 0x0008,\n\t0x1de: 0xe00d, 0x1df: 0x0008, 0x1e0: 0xe00d, 0x1e1: 0x0008, 0x1e2: 0xe00d, 0x1e3: 0x0008,\n\t0x1e4: 0xe00d, 0x1e5: 0x0008, 0x1e6: 0xe00d, 0x1e7: 0x0008, 0x1e8: 0xe00d, 0x1e9: 0x0008,\n\t0x1ea: 0xe00d, 0x1eb: 0x0008, 0x1ec: 0xe00d, 0x1ed: 0x0008, 0x1ee: 0xe00d, 0x1ef: 0x0008,\n\t0x1f0: 0x0008, 0x1f1: 0x028d, 0x1f2: 0x02a5, 0x1f3: 0x02bd, 0x1f4: 0xe00d, 0x1f5: 0x0008,\n\t0x1f6: 0x02d5, 0x1f7: 0x02ed, 0x1f8: 0xe00d, 0x1f9: 0x0008, 0x1fa: 0xe00d, 0x1fb: 0x0008,\n\t0x1fc: 0xe00d, 0x1fd: 0x0008, 0x1fe: 0xe00d, 0x1ff: 0x0008,\n\t// Block 0x8, offset 0x200\n\t0x200: 0xe00d, 0x201: 0x0008, 0x202: 0xe00d, 0x203: 0x0008, 0x204: 0xe00d, 0x205: 0x0008,\n\t0x206: 0xe00d, 0x207: 0x0008, 0x208: 0xe00d, 0x209: 0x0008, 0x20a: 0xe00d, 0x20b: 0x0008,\n\t0x20c: 0xe00d, 0x20d: 0x0008, 0x20e: 0xe00d, 0x20f: 0x0008, 0x210: 0xe00d, 0x211: 0x0008,\n\t0x212: 0xe00d, 0x213: 0x0008, 0x214: 0xe00d, 0x215: 0x0008, 0x216: 0xe00d, 0x217: 0x0008,\n\t0x218: 0xe00d, 0x219: 0x0008, 0x21a: 0xe00d, 0x21b: 0x0008, 0x21c: 0xe00d, 0x21d: 0x0008,\n\t0x21e: 0xe00d, 0x21f: 0x0008, 0x220: 0x0305, 0x221: 0x0008, 0x222: 0xe00d, 0x223: 0x0008,\n\t0x224: 0xe00d, 0x225: 0x0008, 0x226: 0xe00d, 0x227: 0x0008, 0x228: 0xe00d, 0x229: 0x0008,\n\t0x22a: 0xe00d, 0x22b: 0x0008, 0x22c: 0xe00d, 0x22d: 0x0008, 0x22e: 0xe00d, 0x22f: 0x0008,\n\t0x230: 0xe00d, 0x231: 0x0008, 0x232: 0xe00d, 0x233: 0x0008, 0x234: 0x0008, 0x235: 0x0008,\n\t0x236: 0x0008, 0x237: 0x0008, 0x238: 0x0008, 0x239: 0x0008, 0x23a: 0x0209, 0x23b: 0xe03d,\n\t0x23c: 0x0008, 0x23d: 0x031d, 0x23e: 0x0229, 0x23f: 0x0008,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x0008, 0x241: 0x0008, 0x242: 0x0018, 0x243: 0x0018, 0x244: 0x0018, 0x245: 0x0018,\n\t0x246: 0x0008, 0x247: 0x0008, 0x248: 0x0008, 0x249: 0x0008, 0x24a: 0x0008, 0x24b: 0x0008,\n\t0x24c: 0x0008, 0x24d: 0x0008, 0x24e: 0x0008, 0x24f: 0x0008, 0x250: 0x0008, 0x251: 0x0008,\n\t0x252: 0x0018, 0x253: 0x0018, 0x254: 0x0018, 0x255: 0x0018, 0x256: 0x0018, 0x257: 0x0018,\n\t0x258: 0x029a, 0x259: 0x02ba, 0x25a: 0x02da, 0x25b: 0x02fa, 0x25c: 0x031a, 0x25d: 0x033a,\n\t0x25e: 0x0018, 0x25f: 0x0018, 0x260: 0x03ad, 0x261: 0x0359, 0x262: 0x01d9, 0x263: 0x0369,\n\t0x264: 0x03c5, 0x265: 0x0018, 0x266: 0x0018, 0x267: 0x0018, 0x268: 0x0018, 0x269: 0x0018,\n\t0x26a: 0x0018, 0x26b: 0x0018, 0x26c: 0x0008, 0x26d: 0x0018, 0x26e: 0x0008, 0x26f: 0x0018,\n\t0x270: 0x0018, 0x271: 0x0018, 0x272: 0x0018, 0x273: 0x0018, 0x274: 0x0018, 0x275: 0x0018,\n\t0x276: 0x0018, 0x277: 0x0018, 0x278: 0x0018, 0x279: 0x0018, 0x27a: 0x0018, 0x27b: 0x0018,\n\t0x27c: 0x0018, 0x27d: 0x0018, 0x27e: 0x0018, 0x27f: 0x0018,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x03dd, 0x281: 0x03dd, 0x282: 0x3308, 0x283: 0x03f5, 0x284: 0x0379, 0x285: 0x040d,\n\t0x286: 0x3308, 0x287: 0x3308, 0x288: 0x3308, 0x289: 0x3308, 0x28a: 0x3308, 0x28b: 0x3308,\n\t0x28c: 0x3308, 0x28d: 0x3308, 0x28e: 0x3308, 0x28f: 0x33c0, 0x290: 0x3308, 0x291: 0x3308,\n\t0x292: 0x3308, 0x293: 0x3308, 0x294: 0x3308, 0x295: 0x3308, 0x296: 0x3308, 0x297: 0x3308,\n\t0x298: 0x3308, 0x299: 0x3308, 0x29a: 0x3308, 0x29b: 0x3308, 0x29c: 0x3308, 0x29d: 0x3308,\n\t0x29e: 0x3308, 0x29f: 0x3308, 0x2a0: 0x3308, 0x2a1: 0x3308, 0x2a2: 0x3308, 0x2a3: 0x3308,\n\t0x2a4: 0x3308, 0x2a5: 0x3308, 0x2a6: 0x3308, 0x2a7: 0x3308, 0x2a8: 0x3308, 0x2a9: 0x3308,\n\t0x2aa: 0x3308, 0x2ab: 0x3308, 0x2ac: 0x3308, 0x2ad: 0x3308, 0x2ae: 0x3308, 0x2af: 0x3308,\n\t0x2b0: 0xe00d, 0x2b1: 0x0008, 0x2b2: 0xe00d, 0x2b3: 0x0008, 0x2b4: 0x0425, 0x2b5: 0x0008,\n\t0x2b6: 0xe00d, 0x2b7: 0x0008, 0x2b8: 0x0040, 0x2b9: 0x0040, 0x2ba: 0x03a2, 0x2bb: 0x0008,\n\t0x2bc: 0x0008, 0x2bd: 0x0008, 0x2be: 0x03c2, 0x2bf: 0x043d,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x0040, 0x2c1: 0x0040, 0x2c2: 0x0040, 0x2c3: 0x0040, 0x2c4: 0x008a, 0x2c5: 0x03d2,\n\t0x2c6: 0xe155, 0x2c7: 0x0455, 0x2c8: 0xe12d, 0x2c9: 0xe13d, 0x2ca: 0xe12d, 0x2cb: 0x0040,\n\t0x2cc: 0x03dd, 0x2cd: 0x0040, 0x2ce: 0x046d, 0x2cf: 0x0485, 0x2d0: 0x0008, 0x2d1: 0xe105,\n\t0x2d2: 0xe105, 0x2d3: 0xe105, 0x2d4: 0xe105, 0x2d5: 0xe105, 0x2d6: 0xe105, 0x2d7: 0xe105,\n\t0x2d8: 0xe105, 0x2d9: 0xe105, 0x2da: 0xe105, 0x2db: 0xe105, 0x2dc: 0xe105, 0x2dd: 0xe105,\n\t0x2de: 0xe105, 0x2df: 0xe105, 0x2e0: 0x049d, 0x2e1: 0x049d, 0x2e2: 0x0040, 0x2e3: 0x049d,\n\t0x2e4: 0x049d, 0x2e5: 0x049d, 0x2e6: 0x049d, 0x2e7: 0x049d, 0x2e8: 0x049d, 0x2e9: 0x049d,\n\t0x2ea: 0x049d, 0x2eb: 0x049d, 0x2ec: 0x0008, 0x2ed: 0x0008, 0x2ee: 0x0008, 0x2ef: 0x0008,\n\t0x2f0: 0x0008, 0x2f1: 0x0008, 0x2f2: 0x0008, 0x2f3: 0x0008, 0x2f4: 0x0008, 0x2f5: 0x0008,\n\t0x2f6: 0x0008, 0x2f7: 0x0008, 0x2f8: 0x0008, 0x2f9: 0x0008, 0x2fa: 0x0008, 0x2fb: 0x0008,\n\t0x2fc: 0x0008, 0x2fd: 0x0008, 0x2fe: 0x0008, 0x2ff: 0x0008,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x0008, 0x301: 0x0008, 0x302: 0xe00f, 0x303: 0x0008, 0x304: 0x0008, 0x305: 0x0008,\n\t0x306: 0x0008, 0x307: 0x0008, 0x308: 0x0008, 0x309: 0x0008, 0x30a: 0x0008, 0x30b: 0x0008,\n\t0x30c: 0x0008, 0x30d: 0x0008, 0x30e: 0x0008, 0x30f: 0xe0c5, 0x310: 0x04b5, 0x311: 0x04cd,\n\t0x312: 0xe0bd, 0x313: 0xe0f5, 0x314: 0xe0fd, 0x315: 0xe09d, 0x316: 0xe0b5, 0x317: 0x0008,\n\t0x318: 0xe00d, 0x319: 0x0008, 0x31a: 0xe00d, 0x31b: 0x0008, 0x31c: 0xe00d, 0x31d: 0x0008,\n\t0x31e: 0xe00d, 0x31f: 0x0008, 0x320: 0xe00d, 0x321: 0x0008, 0x322: 0xe00d, 0x323: 0x0008,\n\t0x324: 0xe00d, 0x325: 0x0008, 0x326: 0xe00d, 0x327: 0x0008, 0x328: 0xe00d, 0x329: 0x0008,\n\t0x32a: 0xe00d, 0x32b: 0x0008, 0x32c: 0xe00d, 0x32d: 0x0008, 0x32e: 0xe00d, 0x32f: 0x0008,\n\t0x330: 0x04e5, 0x331: 0xe185, 0x332: 0xe18d, 0x333: 0x0008, 0x334: 0x04fd, 0x335: 0x03dd,\n\t0x336: 0x0018, 0x337: 0xe07d, 0x338: 0x0008, 0x339: 0xe1d5, 0x33a: 0xe00d, 0x33b: 0x0008,\n\t0x33c: 0x0008, 0x33d: 0x0515, 0x33e: 0x052d, 0x33f: 0x052d,\n\t// Block 0xd, offset 0x340\n\t0x340: 0x0008, 0x341: 0x0008, 0x342: 0x0008, 0x343: 0x0008, 0x344: 0x0008, 0x345: 0x0008,\n\t0x346: 0x0008, 0x347: 0x0008, 0x348: 0x0008, 0x349: 0x0008, 0x34a: 0x0008, 0x34b: 0x0008,\n\t0x34c: 0x0008, 0x34d: 0x0008, 0x34e: 0x0008, 0x34f: 0x0008, 0x350: 0x0008, 0x351: 0x0008,\n\t0x352: 0x0008, 0x353: 0x0008, 0x354: 0x0008, 0x355: 0x0008, 0x356: 0x0008, 0x357: 0x0008,\n\t0x358: 0x0008, 0x359: 0x0008, 0x35a: 0x0008, 0x35b: 0x0008, 0x35c: 0x0008, 0x35d: 0x0008,\n\t0x35e: 0x0008, 0x35f: 0x0008, 0x360: 0xe00d, 0x361: 0x0008, 0x362: 0xe00d, 0x363: 0x0008,\n\t0x364: 0xe00d, 0x365: 0x0008, 0x366: 0xe00d, 0x367: 0x0008, 0x368: 0xe00d, 0x369: 0x0008,\n\t0x36a: 0xe00d, 0x36b: 0x0008, 0x36c: 0xe00d, 0x36d: 0x0008, 0x36e: 0xe00d, 0x36f: 0x0008,\n\t0x370: 0xe00d, 0x371: 0x0008, 0x372: 0xe00d, 0x373: 0x0008, 0x374: 0xe00d, 0x375: 0x0008,\n\t0x376: 0xe00d, 0x377: 0x0008, 0x378: 0xe00d, 0x379: 0x0008, 0x37a: 0xe00d, 0x37b: 0x0008,\n\t0x37c: 0xe00d, 0x37d: 0x0008, 0x37e: 0xe00d, 0x37f: 0x0008,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xe00d, 0x381: 0x0008, 0x382: 0x0018, 0x383: 0x3308, 0x384: 0x3308, 0x385: 0x3308,\n\t0x386: 0x3308, 0x387: 0x3308, 0x388: 0x3318, 0x389: 0x3318, 0x38a: 0xe00d, 0x38b: 0x0008,\n\t0x38c: 0xe00d, 0x38d: 0x0008, 0x38e: 0xe00d, 0x38f: 0x0008, 0x390: 0xe00d, 0x391: 0x0008,\n\t0x392: 0xe00d, 0x393: 0x0008, 0x394: 0xe00d, 0x395: 0x0008, 0x396: 0xe00d, 0x397: 0x0008,\n\t0x398: 0xe00d, 0x399: 0x0008, 0x39a: 0xe00d, 0x39b: 0x0008, 0x39c: 0xe00d, 0x39d: 0x0008,\n\t0x39e: 0xe00d, 0x39f: 0x0008, 0x3a0: 0xe00d, 0x3a1: 0x0008, 0x3a2: 0xe00d, 0x3a3: 0x0008,\n\t0x3a4: 0xe00d, 0x3a5: 0x0008, 0x3a6: 0xe00d, 0x3a7: 0x0008, 0x3a8: 0xe00d, 0x3a9: 0x0008,\n\t0x3aa: 0xe00d, 0x3ab: 0x0008, 0x3ac: 0xe00d, 0x3ad: 0x0008, 0x3ae: 0xe00d, 0x3af: 0x0008,\n\t0x3b0: 0xe00d, 0x3b1: 0x0008, 0x3b2: 0xe00d, 0x3b3: 0x0008, 0x3b4: 0xe00d, 0x3b5: 0x0008,\n\t0x3b6: 0xe00d, 0x3b7: 0x0008, 0x3b8: 0xe00d, 0x3b9: 0x0008, 0x3ba: 0xe00d, 0x3bb: 0x0008,\n\t0x3bc: 0xe00d, 0x3bd: 0x0008, 0x3be: 0xe00d, 0x3bf: 0x0008,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x0040, 0x3c1: 0xe01d, 0x3c2: 0x0008, 0x3c3: 0xe03d, 0x3c4: 0x0008, 0x3c5: 0xe01d,\n\t0x3c6: 0x0008, 0x3c7: 0xe07d, 0x3c8: 0x0008, 0x3c9: 0xe01d, 0x3ca: 0x0008, 0x3cb: 0xe03d,\n\t0x3cc: 0x0008, 0x3cd: 0xe01d, 0x3ce: 0x0008, 0x3cf: 0x0008, 0x3d0: 0xe00d, 0x3d1: 0x0008,\n\t0x3d2: 0xe00d, 0x3d3: 0x0008, 0x3d4: 0xe00d, 0x3d5: 0x0008, 0x3d6: 0xe00d, 0x3d7: 0x0008,\n\t0x3d8: 0xe00d, 0x3d9: 0x0008, 0x3da: 0xe00d, 0x3db: 0x0008, 0x3dc: 0xe00d, 0x3dd: 0x0008,\n\t0x3de: 0xe00d, 0x3df: 0x0008, 0x3e0: 0xe00d, 0x3e1: 0x0008, 0x3e2: 0xe00d, 0x3e3: 0x0008,\n\t0x3e4: 0xe00d, 0x3e5: 0x0008, 0x3e6: 0xe00d, 0x3e7: 0x0008, 0x3e8: 0xe00d, 0x3e9: 0x0008,\n\t0x3ea: 0xe00d, 0x3eb: 0x0008, 0x3ec: 0xe00d, 0x3ed: 0x0008, 0x3ee: 0xe00d, 0x3ef: 0x0008,\n\t0x3f0: 0xe00d, 0x3f1: 0x0008, 0x3f2: 0xe00d, 0x3f3: 0x0008, 0x3f4: 0xe00d, 0x3f5: 0x0008,\n\t0x3f6: 0xe00d, 0x3f7: 0x0008, 0x3f8: 0xe00d, 0x3f9: 0x0008, 0x3fa: 0xe00d, 0x3fb: 0x0008,\n\t0x3fc: 0xe00d, 0x3fd: 0x0008, 0x3fe: 0xe00d, 0x3ff: 0x0008,\n\t// Block 0x10, offset 0x400\n\t0x400: 0xe00d, 0x401: 0x0008, 0x402: 0xe00d, 0x403: 0x0008, 0x404: 0xe00d, 0x405: 0x0008,\n\t0x406: 0xe00d, 0x407: 0x0008, 0x408: 0xe00d, 0x409: 0x0008, 0x40a: 0xe00d, 0x40b: 0x0008,\n\t0x40c: 0xe00d, 0x40d: 0x0008, 0x40e: 0xe00d, 0x40f: 0x0008, 0x410: 0xe00d, 0x411: 0x0008,\n\t0x412: 0xe00d, 0x413: 0x0008, 0x414: 0xe00d, 0x415: 0x0008, 0x416: 0xe00d, 0x417: 0x0008,\n\t0x418: 0xe00d, 0x419: 0x0008, 0x41a: 0xe00d, 0x41b: 0x0008, 0x41c: 0xe00d, 0x41d: 0x0008,\n\t0x41e: 0xe00d, 0x41f: 0x0008, 0x420: 0xe00d, 0x421: 0x0008, 0x422: 0xe00d, 0x423: 0x0008,\n\t0x424: 0xe00d, 0x425: 0x0008, 0x426: 0xe00d, 0x427: 0x0008, 0x428: 0xe00d, 0x429: 0x0008,\n\t0x42a: 0xe00d, 0x42b: 0x0008, 0x42c: 0xe00d, 0x42d: 0x0008, 0x42e: 0xe00d, 0x42f: 0x0008,\n\t0x430: 0x0040, 0x431: 0x03f5, 0x432: 0x03f5, 0x433: 0x03f5, 0x434: 0x03f5, 0x435: 0x03f5,\n\t0x436: 0x03f5, 0x437: 0x03f5, 0x438: 0x03f5, 0x439: 0x03f5, 0x43a: 0x03f5, 0x43b: 0x03f5,\n\t0x43c: 0x03f5, 0x43d: 0x03f5, 0x43e: 0x03f5, 0x43f: 0x03f5,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x0840, 0x441: 0x0840, 0x442: 0x0840, 0x443: 0x0840, 0x444: 0x0840, 0x445: 0x0840,\n\t0x446: 0x0018, 0x447: 0x0018, 0x448: 0x0818, 0x449: 0x0018, 0x44a: 0x0018, 0x44b: 0x0818,\n\t0x44c: 0x0018, 0x44d: 0x0818, 0x44e: 0x0018, 0x44f: 0x0018, 0x450: 0x3308, 0x451: 0x3308,\n\t0x452: 0x3308, 0x453: 0x3308, 0x454: 0x3308, 0x455: 0x3308, 0x456: 0x3308, 0x457: 0x3308,\n\t0x458: 0x3308, 0x459: 0x3308, 0x45a: 0x3308, 0x45b: 0x0818, 0x45c: 0x0b40, 0x45d: 0x0040,\n\t0x45e: 0x0818, 0x45f: 0x0818, 0x460: 0x0a08, 0x461: 0x0808, 0x462: 0x0c08, 0x463: 0x0c08,\n\t0x464: 0x0c08, 0x465: 0x0c08, 0x466: 0x0a08, 0x467: 0x0c08, 0x468: 0x0a08, 0x469: 0x0c08,\n\t0x46a: 0x0a08, 0x46b: 0x0a08, 0x46c: 0x0a08, 0x46d: 0x0a08, 0x46e: 0x0a08, 0x46f: 0x0c08,\n\t0x470: 0x0c08, 0x471: 0x0c08, 0x472: 0x0c08, 0x473: 0x0a08, 0x474: 0x0a08, 0x475: 0x0a08,\n\t0x476: 0x0a08, 0x477: 0x0a08, 0x478: 0x0a08, 0x479: 0x0a08, 0x47a: 0x0a08, 0x47b: 0x0a08,\n\t0x47c: 0x0a08, 0x47d: 0x0a08, 0x47e: 0x0a08, 0x47f: 0x0a08,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x0818, 0x481: 0x0a08, 0x482: 0x0a08, 0x483: 0x0a08, 0x484: 0x0a08, 0x485: 0x0a08,\n\t0x486: 0x0a08, 0x487: 0x0a08, 0x488: 0x0c08, 0x489: 0x0a08, 0x48a: 0x0a08, 0x48b: 0x3308,\n\t0x48c: 0x3308, 0x48d: 0x3308, 0x48e: 0x3308, 0x48f: 0x3308, 0x490: 0x3308, 0x491: 0x3308,\n\t0x492: 0x3308, 0x493: 0x3308, 0x494: 0x3308, 0x495: 0x3308, 0x496: 0x3308, 0x497: 0x3308,\n\t0x498: 0x3308, 0x499: 0x3308, 0x49a: 0x3308, 0x49b: 0x3308, 0x49c: 0x3308, 0x49d: 0x3308,\n\t0x49e: 0x3308, 0x49f: 0x3308, 0x4a0: 0x0808, 0x4a1: 0x0808, 0x4a2: 0x0808, 0x4a3: 0x0808,\n\t0x4a4: 0x0808, 0x4a5: 0x0808, 0x4a6: 0x0808, 0x4a7: 0x0808, 0x4a8: 0x0808, 0x4a9: 0x0808,\n\t0x4aa: 0x0018, 0x4ab: 0x0818, 0x4ac: 0x0818, 0x4ad: 0x0818, 0x4ae: 0x0a08, 0x4af: 0x0a08,\n\t0x4b0: 0x3308, 0x4b1: 0x0c08, 0x4b2: 0x0c08, 0x4b3: 0x0c08, 0x4b4: 0x0808, 0x4b5: 0x0429,\n\t0x4b6: 0x0451, 0x4b7: 0x0479, 0x4b8: 0x04a1, 0x4b9: 0x0a08, 0x4ba: 0x0a08, 0x4bb: 0x0a08,\n\t0x4bc: 0x0a08, 0x4bd: 0x0a08, 0x4be: 0x0a08, 0x4bf: 0x0a08,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0x0c08, 0x4c1: 0x0a08, 0x4c2: 0x0a08, 0x4c3: 0x0c08, 0x4c4: 0x0c08, 0x4c5: 0x0c08,\n\t0x4c6: 0x0c08, 0x4c7: 0x0c08, 0x4c8: 0x0c08, 0x4c9: 0x0c08, 0x4ca: 0x0c08, 0x4cb: 0x0c08,\n\t0x4cc: 0x0a08, 0x4cd: 0x0c08, 0x4ce: 0x0a08, 0x4cf: 0x0c08, 0x4d0: 0x0a08, 0x4d1: 0x0a08,\n\t0x4d2: 0x0c08, 0x4d3: 0x0c08, 0x4d4: 0x0818, 0x4d5: 0x0c08, 0x4d6: 0x3308, 0x4d7: 0x3308,\n\t0x4d8: 0x3308, 0x4d9: 0x3308, 0x4da: 0x3308, 0x4db: 0x3308, 0x4dc: 0x3308, 0x4dd: 0x0840,\n\t0x4de: 0x0018, 0x4df: 0x3308, 0x4e0: 0x3308, 0x4e1: 0x3308, 0x4e2: 0x3308, 0x4e3: 0x3308,\n\t0x4e4: 0x3308, 0x4e5: 0x0808, 0x4e6: 0x0808, 0x4e7: 0x3308, 0x4e8: 0x3308, 0x4e9: 0x0018,\n\t0x4ea: 0x3308, 0x4eb: 0x3308, 0x4ec: 0x3308, 0x4ed: 0x3308, 0x4ee: 0x0c08, 0x4ef: 0x0c08,\n\t0x4f0: 0x0008, 0x4f1: 0x0008, 0x4f2: 0x0008, 0x4f3: 0x0008, 0x4f4: 0x0008, 0x4f5: 0x0008,\n\t0x4f6: 0x0008, 0x4f7: 0x0008, 0x4f8: 0x0008, 0x4f9: 0x0008, 0x4fa: 0x0a08, 0x4fb: 0x0a08,\n\t0x4fc: 0x0a08, 0x4fd: 0x0808, 0x4fe: 0x0808, 0x4ff: 0x0a08,\n\t// Block 0x14, offset 0x500\n\t0x500: 0x0818, 0x501: 0x0818, 0x502: 0x0818, 0x503: 0x0818, 0x504: 0x0818, 0x505: 0x0818,\n\t0x506: 0x0818, 0x507: 0x0818, 0x508: 0x0818, 0x509: 0x0818, 0x50a: 0x0818, 0x50b: 0x0818,\n\t0x50c: 0x0818, 0x50d: 0x0818, 0x50e: 0x0040, 0x50f: 0x0b40, 0x510: 0x0c08, 0x511: 0x3308,\n\t0x512: 0x0a08, 0x513: 0x0a08, 0x514: 0x0a08, 0x515: 0x0c08, 0x516: 0x0c08, 0x517: 0x0c08,\n\t0x518: 0x0c08, 0x519: 0x0c08, 0x51a: 0x0a08, 0x51b: 0x0a08, 0x51c: 0x0a08, 0x51d: 0x0a08,\n\t0x51e: 0x0c08, 0x51f: 0x0a08, 0x520: 0x0a08, 0x521: 0x0a08, 0x522: 0x0a08, 0x523: 0x0a08,\n\t0x524: 0x0a08, 0x525: 0x0a08, 0x526: 0x0a08, 0x527: 0x0a08, 0x528: 0x0c08, 0x529: 0x0a08,\n\t0x52a: 0x0c08, 0x52b: 0x0a08, 0x52c: 0x0c08, 0x52d: 0x0a08, 0x52e: 0x0a08, 0x52f: 0x0c08,\n\t0x530: 0x3308, 0x531: 0x3308, 0x532: 0x3308, 0x533: 0x3308, 0x534: 0x3308, 0x535: 0x3308,\n\t0x536: 0x3308, 0x537: 0x3308, 0x538: 0x3308, 0x539: 0x3308, 0x53a: 0x3308, 0x53b: 0x3308,\n\t0x53c: 0x3308, 0x53d: 0x3308, 0x53e: 0x3308, 0x53f: 0x3308,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x3008, 0x541: 0x3308, 0x542: 0x3308, 0x543: 0x3308, 0x544: 0x3308, 0x545: 0x3308,\n\t0x546: 0x3308, 0x547: 0x3308, 0x548: 0x3308, 0x549: 0x3008, 0x54a: 0x3008, 0x54b: 0x3008,\n\t0x54c: 0x3008, 0x54d: 0x3b08, 0x54e: 0x3008, 0x54f: 0x3008, 0x550: 0x0008, 0x551: 0x3308,\n\t0x552: 0x3308, 0x553: 0x3308, 0x554: 0x3308, 0x555: 0x3308, 0x556: 0x3308, 0x557: 0x3308,\n\t0x558: 0x04c9, 0x559: 0x0501, 0x55a: 0x0539, 0x55b: 0x0571, 0x55c: 0x05a9, 0x55d: 0x05e1,\n\t0x55e: 0x0619, 0x55f: 0x0651, 0x560: 0x0008, 0x561: 0x0008, 0x562: 0x3308, 0x563: 0x3308,\n\t0x564: 0x0018, 0x565: 0x0018, 0x566: 0x0008, 0x567: 0x0008, 0x568: 0x0008, 0x569: 0x0008,\n\t0x56a: 0x0008, 0x56b: 0x0008, 0x56c: 0x0008, 0x56d: 0x0008, 0x56e: 0x0008, 0x56f: 0x0008,\n\t0x570: 0x0018, 0x571: 0x0008, 0x572: 0x0008, 0x573: 0x0008, 0x574: 0x0008, 0x575: 0x0008,\n\t0x576: 0x0008, 0x577: 0x0008, 0x578: 0x0008, 0x579: 0x0008, 0x57a: 0x0008, 0x57b: 0x0008,\n\t0x57c: 0x0008, 0x57d: 0x0008, 0x57e: 0x0008, 0x57f: 0x0008,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x0008, 0x581: 0x3308, 0x582: 0x3008, 0x583: 0x3008, 0x584: 0x0040, 0x585: 0x0008,\n\t0x586: 0x0008, 0x587: 0x0008, 0x588: 0x0008, 0x589: 0x0008, 0x58a: 0x0008, 0x58b: 0x0008,\n\t0x58c: 0x0008, 0x58d: 0x0040, 0x58e: 0x0040, 0x58f: 0x0008, 0x590: 0x0008, 0x591: 0x0040,\n\t0x592: 0x0040, 0x593: 0x0008, 0x594: 0x0008, 0x595: 0x0008, 0x596: 0x0008, 0x597: 0x0008,\n\t0x598: 0x0008, 0x599: 0x0008, 0x59a: 0x0008, 0x59b: 0x0008, 0x59c: 0x0008, 0x59d: 0x0008,\n\t0x59e: 0x0008, 0x59f: 0x0008, 0x5a0: 0x0008, 0x5a1: 0x0008, 0x5a2: 0x0008, 0x5a3: 0x0008,\n\t0x5a4: 0x0008, 0x5a5: 0x0008, 0x5a6: 0x0008, 0x5a7: 0x0008, 0x5a8: 0x0008, 0x5a9: 0x0040,\n\t0x5aa: 0x0008, 0x5ab: 0x0008, 0x5ac: 0x0008, 0x5ad: 0x0008, 0x5ae: 0x0008, 0x5af: 0x0008,\n\t0x5b0: 0x0008, 0x5b1: 0x0040, 0x5b2: 0x0008, 0x5b3: 0x0040, 0x5b4: 0x0040, 0x5b5: 0x0040,\n\t0x5b6: 0x0008, 0x5b7: 0x0008, 0x5b8: 0x0008, 0x5b9: 0x0008, 0x5ba: 0x0040, 0x5bb: 0x0040,\n\t0x5bc: 0x3308, 0x5bd: 0x0008, 0x5be: 0x3008, 0x5bf: 0x3008,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x3008, 0x5c1: 0x3308, 0x5c2: 0x3308, 0x5c3: 0x3308, 0x5c4: 0x3308, 0x5c5: 0x0040,\n\t0x5c6: 0x0040, 0x5c7: 0x3008, 0x5c8: 0x3008, 0x5c9: 0x0040, 0x5ca: 0x0040, 0x5cb: 0x3008,\n\t0x5cc: 0x3008, 0x5cd: 0x3b08, 0x5ce: 0x0008, 0x5cf: 0x0040, 0x5d0: 0x0040, 0x5d1: 0x0040,\n\t0x5d2: 0x0040, 0x5d3: 0x0040, 0x5d4: 0x0040, 0x5d5: 0x0040, 0x5d6: 0x0040, 0x5d7: 0x3008,\n\t0x5d8: 0x0040, 0x5d9: 0x0040, 0x5da: 0x0040, 0x5db: 0x0040, 0x5dc: 0x0689, 0x5dd: 0x06c1,\n\t0x5de: 0x0040, 0x5df: 0x06f9, 0x5e0: 0x0008, 0x5e1: 0x0008, 0x5e2: 0x3308, 0x5e3: 0x3308,\n\t0x5e4: 0x0040, 0x5e5: 0x0040, 0x5e6: 0x0008, 0x5e7: 0x0008, 0x5e8: 0x0008, 0x5e9: 0x0008,\n\t0x5ea: 0x0008, 0x5eb: 0x0008, 0x5ec: 0x0008, 0x5ed: 0x0008, 0x5ee: 0x0008, 0x5ef: 0x0008,\n\t0x5f0: 0x0008, 0x5f1: 0x0008, 0x5f2: 0x0018, 0x5f3: 0x0018, 0x5f4: 0x0018, 0x5f5: 0x0018,\n\t0x5f6: 0x0018, 0x5f7: 0x0018, 0x5f8: 0x0018, 0x5f9: 0x0018, 0x5fa: 0x0018, 0x5fb: 0x0018,\n\t0x5fc: 0x0040, 0x5fd: 0x0040, 0x5fe: 0x0040, 0x5ff: 0x0040,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x0040, 0x601: 0x3308, 0x602: 0x3308, 0x603: 0x3008, 0x604: 0x0040, 0x605: 0x0008,\n\t0x606: 0x0008, 0x607: 0x0008, 0x608: 0x0008, 0x609: 0x0008, 0x60a: 0x0008, 0x60b: 0x0040,\n\t0x60c: 0x0040, 0x60d: 0x0040, 0x60e: 0x0040, 0x60f: 0x0008, 0x610: 0x0008, 0x611: 0x0040,\n\t0x612: 0x0040, 0x613: 0x0008, 0x614: 0x0008, 0x615: 0x0008, 0x616: 0x0008, 0x617: 0x0008,\n\t0x618: 0x0008, 0x619: 0x0008, 0x61a: 0x0008, 0x61b: 0x0008, 0x61c: 0x0008, 0x61d: 0x0008,\n\t0x61e: 0x0008, 0x61f: 0x0008, 0x620: 0x0008, 0x621: 0x0008, 0x622: 0x0008, 0x623: 0x0008,\n\t0x624: 0x0008, 0x625: 0x0008, 0x626: 0x0008, 0x627: 0x0008, 0x628: 0x0008, 0x629: 0x0040,\n\t0x62a: 0x0008, 0x62b: 0x0008, 0x62c: 0x0008, 0x62d: 0x0008, 0x62e: 0x0008, 0x62f: 0x0008,\n\t0x630: 0x0008, 0x631: 0x0040, 0x632: 0x0008, 0x633: 0x0731, 0x634: 0x0040, 0x635: 0x0008,\n\t0x636: 0x0769, 0x637: 0x0040, 0x638: 0x0008, 0x639: 0x0008, 0x63a: 0x0040, 0x63b: 0x0040,\n\t0x63c: 0x3308, 0x63d: 0x0040, 0x63e: 0x3008, 0x63f: 0x3008,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x3008, 0x641: 0x3308, 0x642: 0x3308, 0x643: 0x0040, 0x644: 0x0040, 0x645: 0x0040,\n\t0x646: 0x0040, 0x647: 0x3308, 0x648: 0x3308, 0x649: 0x0040, 0x64a: 0x0040, 0x64b: 0x3308,\n\t0x64c: 0x3308, 0x64d: 0x3b08, 0x64e: 0x0040, 0x64f: 0x0040, 0x650: 0x0040, 0x651: 0x3308,\n\t0x652: 0x0040, 0x653: 0x0040, 0x654: 0x0040, 0x655: 0x0040, 0x656: 0x0040, 0x657: 0x0040,\n\t0x658: 0x0040, 0x659: 0x07a1, 0x65a: 0x07d9, 0x65b: 0x0811, 0x65c: 0x0008, 0x65d: 0x0040,\n\t0x65e: 0x0849, 0x65f: 0x0040, 0x660: 0x0040, 0x661: 0x0040, 0x662: 0x0040, 0x663: 0x0040,\n\t0x664: 0x0040, 0x665: 0x0040, 0x666: 0x0008, 0x667: 0x0008, 0x668: 0x0008, 0x669: 0x0008,\n\t0x66a: 0x0008, 0x66b: 0x0008, 0x66c: 0x0008, 0x66d: 0x0008, 0x66e: 0x0008, 0x66f: 0x0008,\n\t0x670: 0x3308, 0x671: 0x3308, 0x672: 0x0008, 0x673: 0x0008, 0x674: 0x0008, 0x675: 0x3308,\n\t0x676: 0x0040, 0x677: 0x0040, 0x678: 0x0040, 0x679: 0x0040, 0x67a: 0x0040, 0x67b: 0x0040,\n\t0x67c: 0x0040, 0x67d: 0x0040, 0x67e: 0x0040, 0x67f: 0x0040,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x0040, 0x681: 0x3308, 0x682: 0x3308, 0x683: 0x3008, 0x684: 0x0040, 0x685: 0x0008,\n\t0x686: 0x0008, 0x687: 0x0008, 0x688: 0x0008, 0x689: 0x0008, 0x68a: 0x0008, 0x68b: 0x0008,\n\t0x68c: 0x0008, 0x68d: 0x0008, 0x68e: 0x0040, 0x68f: 0x0008, 0x690: 0x0008, 0x691: 0x0008,\n\t0x692: 0x0040, 0x693: 0x0008, 0x694: 0x0008, 0x695: 0x0008, 0x696: 0x0008, 0x697: 0x0008,\n\t0x698: 0x0008, 0x699: 0x0008, 0x69a: 0x0008, 0x69b: 0x0008, 0x69c: 0x0008, 0x69d: 0x0008,\n\t0x69e: 0x0008, 0x69f: 0x0008, 0x6a0: 0x0008, 0x6a1: 0x0008, 0x6a2: 0x0008, 0x6a3: 0x0008,\n\t0x6a4: 0x0008, 0x6a5: 0x0008, 0x6a6: 0x0008, 0x6a7: 0x0008, 0x6a8: 0x0008, 0x6a9: 0x0040,\n\t0x6aa: 0x0008, 0x6ab: 0x0008, 0x6ac: 0x0008, 0x6ad: 0x0008, 0x6ae: 0x0008, 0x6af: 0x0008,\n\t0x6b0: 0x0008, 0x6b1: 0x0040, 0x6b2: 0x0008, 0x6b3: 0x0008, 0x6b4: 0x0040, 0x6b5: 0x0008,\n\t0x6b6: 0x0008, 0x6b7: 0x0008, 0x6b8: 0x0008, 0x6b9: 0x0008, 0x6ba: 0x0040, 0x6bb: 0x0040,\n\t0x6bc: 0x3308, 0x6bd: 0x0008, 0x6be: 0x3008, 0x6bf: 0x3008,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x3008, 0x6c1: 0x3308, 0x6c2: 0x3308, 0x6c3: 0x3308, 0x6c4: 0x3308, 0x6c5: 0x3308,\n\t0x6c6: 0x0040, 0x6c7: 0x3308, 0x6c8: 0x3308, 0x6c9: 0x3008, 0x6ca: 0x0040, 0x6cb: 0x3008,\n\t0x6cc: 0x3008, 0x6cd: 0x3b08, 0x6ce: 0x0040, 0x6cf: 0x0040, 0x6d0: 0x0008, 0x6d1: 0x0040,\n\t0x6d2: 0x0040, 0x6d3: 0x0040, 0x6d4: 0x0040, 0x6d5: 0x0040, 0x6d6: 0x0040, 0x6d7: 0x0040,\n\t0x6d8: 0x0040, 0x6d9: 0x0040, 0x6da: 0x0040, 0x6db: 0x0040, 0x6dc: 0x0040, 0x6dd: 0x0040,\n\t0x6de: 0x0040, 0x6df: 0x0040, 0x6e0: 0x0008, 0x6e1: 0x0008, 0x6e2: 0x3308, 0x6e3: 0x3308,\n\t0x6e4: 0x0040, 0x6e5: 0x0040, 0x6e6: 0x0008, 0x6e7: 0x0008, 0x6e8: 0x0008, 0x6e9: 0x0008,\n\t0x6ea: 0x0008, 0x6eb: 0x0008, 0x6ec: 0x0008, 0x6ed: 0x0008, 0x6ee: 0x0008, 0x6ef: 0x0008,\n\t0x6f0: 0x0018, 0x6f1: 0x0018, 0x6f2: 0x0040, 0x6f3: 0x0040, 0x6f4: 0x0040, 0x6f5: 0x0040,\n\t0x6f6: 0x0040, 0x6f7: 0x0040, 0x6f8: 0x0040, 0x6f9: 0x0008, 0x6fa: 0x0040, 0x6fb: 0x0040,\n\t0x6fc: 0x0040, 0x6fd: 0x0040, 0x6fe: 0x0040, 0x6ff: 0x0040,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x0040, 0x701: 0x3308, 0x702: 0x3008, 0x703: 0x3008, 0x704: 0x0040, 0x705: 0x0008,\n\t0x706: 0x0008, 0x707: 0x0008, 0x708: 0x0008, 0x709: 0x0008, 0x70a: 0x0008, 0x70b: 0x0008,\n\t0x70c: 0x0008, 0x70d: 0x0040, 0x70e: 0x0040, 0x70f: 0x0008, 0x710: 0x0008, 0x711: 0x0040,\n\t0x712: 0x0040, 0x713: 0x0008, 0x714: 0x0008, 0x715: 0x0008, 0x716: 0x0008, 0x717: 0x0008,\n\t0x718: 0x0008, 0x719: 0x0008, 0x71a: 0x0008, 0x71b: 0x0008, 0x71c: 0x0008, 0x71d: 0x0008,\n\t0x71e: 0x0008, 0x71f: 0x0008, 0x720: 0x0008, 0x721: 0x0008, 0x722: 0x0008, 0x723: 0x0008,\n\t0x724: 0x0008, 0x725: 0x0008, 0x726: 0x0008, 0x727: 0x0008, 0x728: 0x0008, 0x729: 0x0040,\n\t0x72a: 0x0008, 0x72b: 0x0008, 0x72c: 0x0008, 0x72d: 0x0008, 0x72e: 0x0008, 0x72f: 0x0008,\n\t0x730: 0x0008, 0x731: 0x0040, 0x732: 0x0008, 0x733: 0x0008, 0x734: 0x0040, 0x735: 0x0008,\n\t0x736: 0x0008, 0x737: 0x0008, 0x738: 0x0008, 0x739: 0x0008, 0x73a: 0x0040, 0x73b: 0x0040,\n\t0x73c: 0x3308, 0x73d: 0x0008, 0x73e: 0x3008, 0x73f: 0x3308,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0x3008, 0x741: 0x3308, 0x742: 0x3308, 0x743: 0x3308, 0x744: 0x3308, 0x745: 0x0040,\n\t0x746: 0x0040, 0x747: 0x3008, 0x748: 0x3008, 0x749: 0x0040, 0x74a: 0x0040, 0x74b: 0x3008,\n\t0x74c: 0x3008, 0x74d: 0x3b08, 0x74e: 0x0040, 0x74f: 0x0040, 0x750: 0x0040, 0x751: 0x0040,\n\t0x752: 0x0040, 0x753: 0x0040, 0x754: 0x0040, 0x755: 0x0040, 0x756: 0x3308, 0x757: 0x3008,\n\t0x758: 0x0040, 0x759: 0x0040, 0x75a: 0x0040, 0x75b: 0x0040, 0x75c: 0x0881, 0x75d: 0x08b9,\n\t0x75e: 0x0040, 0x75f: 0x0008, 0x760: 0x0008, 0x761: 0x0008, 0x762: 0x3308, 0x763: 0x3308,\n\t0x764: 0x0040, 0x765: 0x0040, 0x766: 0x0008, 0x767: 0x0008, 0x768: 0x0008, 0x769: 0x0008,\n\t0x76a: 0x0008, 0x76b: 0x0008, 0x76c: 0x0008, 0x76d: 0x0008, 0x76e: 0x0008, 0x76f: 0x0008,\n\t0x770: 0x0018, 0x771: 0x0008, 0x772: 0x0018, 0x773: 0x0018, 0x774: 0x0018, 0x775: 0x0018,\n\t0x776: 0x0018, 0x777: 0x0018, 0x778: 0x0040, 0x779: 0x0040, 0x77a: 0x0040, 0x77b: 0x0040,\n\t0x77c: 0x0040, 0x77d: 0x0040, 0x77e: 0x0040, 0x77f: 0x0040,\n\t// Block 0x1e, offset 0x780\n\t0x780: 0x0040, 0x781: 0x0040, 0x782: 0x3308, 0x783: 0x0008, 0x784: 0x0040, 0x785: 0x0008,\n\t0x786: 0x0008, 0x787: 0x0008, 0x788: 0x0008, 0x789: 0x0008, 0x78a: 0x0008, 0x78b: 0x0040,\n\t0x78c: 0x0040, 0x78d: 0x0040, 0x78e: 0x0008, 0x78f: 0x0008, 0x790: 0x0008, 0x791: 0x0040,\n\t0x792: 0x0008, 0x793: 0x0008, 0x794: 0x0008, 0x795: 0x0008, 0x796: 0x0040, 0x797: 0x0040,\n\t0x798: 0x0040, 0x799: 0x0008, 0x79a: 0x0008, 0x79b: 0x0040, 0x79c: 0x0008, 0x79d: 0x0040,\n\t0x79e: 0x0008, 0x79f: 0x0008, 0x7a0: 0x0040, 0x7a1: 0x0040, 0x7a2: 0x0040, 0x7a3: 0x0008,\n\t0x7a4: 0x0008, 0x7a5: 0x0040, 0x7a6: 0x0040, 0x7a7: 0x0040, 0x7a8: 0x0008, 0x7a9: 0x0008,\n\t0x7aa: 0x0008, 0x7ab: 0x0040, 0x7ac: 0x0040, 0x7ad: 0x0040, 0x7ae: 0x0008, 0x7af: 0x0008,\n\t0x7b0: 0x0008, 0x7b1: 0x0008, 0x7b2: 0x0008, 0x7b3: 0x0008, 0x7b4: 0x0008, 0x7b5: 0x0008,\n\t0x7b6: 0x0008, 0x7b7: 0x0008, 0x7b8: 0x0008, 0x7b9: 0x0008, 0x7ba: 0x0040, 0x7bb: 0x0040,\n\t0x7bc: 0x0040, 0x7bd: 0x0040, 0x7be: 0x3008, 0x7bf: 0x3008,\n\t// Block 0x1f, offset 0x7c0\n\t0x7c0: 0x3308, 0x7c1: 0x3008, 0x7c2: 0x3008, 0x7c3: 0x3008, 0x7c4: 0x3008, 0x7c5: 0x0040,\n\t0x7c6: 0x3308, 0x7c7: 0x3308, 0x7c8: 0x3308, 0x7c9: 0x0040, 0x7ca: 0x3308, 0x7cb: 0x3308,\n\t0x7cc: 0x3308, 0x7cd: 0x3b08, 0x7ce: 0x0040, 0x7cf: 0x0040, 0x7d0: 0x0040, 0x7d1: 0x0040,\n\t0x7d2: 0x0040, 0x7d3: 0x0040, 0x7d4: 0x0040, 0x7d5: 0x3308, 0x7d6: 0x3308, 0x7d7: 0x0040,\n\t0x7d8: 0x0008, 0x7d9: 0x0008, 0x7da: 0x0008, 0x7db: 0x0040, 0x7dc: 0x0040, 0x7dd: 0x0040,\n\t0x7de: 0x0040, 0x7df: 0x0040, 0x7e0: 0x0008, 0x7e1: 0x0008, 0x7e2: 0x3308, 0x7e3: 0x3308,\n\t0x7e4: 0x0040, 0x7e5: 0x0040, 0x7e6: 0x0008, 0x7e7: 0x0008, 0x7e8: 0x0008, 0x7e9: 0x0008,\n\t0x7ea: 0x0008, 0x7eb: 0x0008, 0x7ec: 0x0008, 0x7ed: 0x0008, 0x7ee: 0x0008, 0x7ef: 0x0008,\n\t0x7f0: 0x0040, 0x7f1: 0x0040, 0x7f2: 0x0040, 0x7f3: 0x0040, 0x7f4: 0x0040, 0x7f5: 0x0040,\n\t0x7f6: 0x0040, 0x7f7: 0x0040, 0x7f8: 0x0018, 0x7f9: 0x0018, 0x7fa: 0x0018, 0x7fb: 0x0018,\n\t0x7fc: 0x0018, 0x7fd: 0x0018, 0x7fe: 0x0018, 0x7ff: 0x0018,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x0008, 0x801: 0x3308, 0x802: 0x3008, 0x803: 0x3008, 0x804: 0x0040, 0x805: 0x0008,\n\t0x806: 0x0008, 0x807: 0x0008, 0x808: 0x0008, 0x809: 0x0008, 0x80a: 0x0008, 0x80b: 0x0008,\n\t0x80c: 0x0008, 0x80d: 0x0040, 0x80e: 0x0008, 0x80f: 0x0008, 0x810: 0x0008, 0x811: 0x0040,\n\t0x812: 0x0008, 0x813: 0x0008, 0x814: 0x0008, 0x815: 0x0008, 0x816: 0x0008, 0x817: 0x0008,\n\t0x818: 0x0008, 0x819: 0x0008, 0x81a: 0x0008, 0x81b: 0x0008, 0x81c: 0x0008, 0x81d: 0x0008,\n\t0x81e: 0x0008, 0x81f: 0x0008, 0x820: 0x0008, 0x821: 0x0008, 0x822: 0x0008, 0x823: 0x0008,\n\t0x824: 0x0008, 0x825: 0x0008, 0x826: 0x0008, 0x827: 0x0008, 0x828: 0x0008, 0x829: 0x0040,\n\t0x82a: 0x0008, 0x82b: 0x0008, 0x82c: 0x0008, 0x82d: 0x0008, 0x82e: 0x0008, 0x82f: 0x0008,\n\t0x830: 0x0008, 0x831: 0x0008, 0x832: 0x0008, 0x833: 0x0008, 0x834: 0x0040, 0x835: 0x0008,\n\t0x836: 0x0008, 0x837: 0x0008, 0x838: 0x0008, 0x839: 0x0008, 0x83a: 0x0040, 0x83b: 0x0040,\n\t0x83c: 0x3308, 0x83d: 0x0008, 0x83e: 0x3008, 0x83f: 0x3308,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x3008, 0x841: 0x3008, 0x842: 0x3008, 0x843: 0x3008, 0x844: 0x3008, 0x845: 0x0040,\n\t0x846: 0x3308, 0x847: 0x3008, 0x848: 0x3008, 0x849: 0x0040, 0x84a: 0x3008, 0x84b: 0x3008,\n\t0x84c: 0x3308, 0x84d: 0x3b08, 0x84e: 0x0040, 0x84f: 0x0040, 0x850: 0x0040, 0x851: 0x0040,\n\t0x852: 0x0040, 0x853: 0x0040, 0x854: 0x0040, 0x855: 0x3008, 0x856: 0x3008, 0x857: 0x0040,\n\t0x858: 0x0040, 0x859: 0x0040, 0x85a: 0x0040, 0x85b: 0x0040, 0x85c: 0x0040, 0x85d: 0x0040,\n\t0x85e: 0x0008, 0x85f: 0x0040, 0x860: 0x0008, 0x861: 0x0008, 0x862: 0x3308, 0x863: 0x3308,\n\t0x864: 0x0040, 0x865: 0x0040, 0x866: 0x0008, 0x867: 0x0008, 0x868: 0x0008, 0x869: 0x0008,\n\t0x86a: 0x0008, 0x86b: 0x0008, 0x86c: 0x0008, 0x86d: 0x0008, 0x86e: 0x0008, 0x86f: 0x0008,\n\t0x870: 0x0040, 0x871: 0x0008, 0x872: 0x0008, 0x873: 0x0040, 0x874: 0x0040, 0x875: 0x0040,\n\t0x876: 0x0040, 0x877: 0x0040, 0x878: 0x0040, 0x879: 0x0040, 0x87a: 0x0040, 0x87b: 0x0040,\n\t0x87c: 0x0040, 0x87d: 0x0040, 0x87e: 0x0040, 0x87f: 0x0040,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x3008, 0x881: 0x3308, 0x882: 0x3308, 0x883: 0x3308, 0x884: 0x3308, 0x885: 0x0040,\n\t0x886: 0x3008, 0x887: 0x3008, 0x888: 0x3008, 0x889: 0x0040, 0x88a: 0x3008, 0x88b: 0x3008,\n\t0x88c: 0x3008, 0x88d: 0x3b08, 0x88e: 0x0008, 0x88f: 0x0018, 0x890: 0x0040, 0x891: 0x0040,\n\t0x892: 0x0040, 0x893: 0x0040, 0x894: 0x0008, 0x895: 0x0008, 0x896: 0x0008, 0x897: 0x3008,\n\t0x898: 0x0018, 0x899: 0x0018, 0x89a: 0x0018, 0x89b: 0x0018, 0x89c: 0x0018, 0x89d: 0x0018,\n\t0x89e: 0x0018, 0x89f: 0x0008, 0x8a0: 0x0008, 0x8a1: 0x0008, 0x8a2: 0x3308, 0x8a3: 0x3308,\n\t0x8a4: 0x0040, 0x8a5: 0x0040, 0x8a6: 0x0008, 0x8a7: 0x0008, 0x8a8: 0x0008, 0x8a9: 0x0008,\n\t0x8aa: 0x0008, 0x8ab: 0x0008, 0x8ac: 0x0008, 0x8ad: 0x0008, 0x8ae: 0x0008, 0x8af: 0x0008,\n\t0x8b0: 0x0018, 0x8b1: 0x0018, 0x8b2: 0x0018, 0x8b3: 0x0018, 0x8b4: 0x0018, 0x8b5: 0x0018,\n\t0x8b6: 0x0018, 0x8b7: 0x0018, 0x8b8: 0x0018, 0x8b9: 0x0018, 0x8ba: 0x0008, 0x8bb: 0x0008,\n\t0x8bc: 0x0008, 0x8bd: 0x0008, 0x8be: 0x0008, 0x8bf: 0x0008,\n\t// Block 0x23, offset 0x8c0\n\t0x8c0: 0x0040, 0x8c1: 0x0008, 0x8c2: 0x0008, 0x8c3: 0x0040, 0x8c4: 0x0008, 0x8c5: 0x0040,\n\t0x8c6: 0x0040, 0x8c7: 0x0008, 0x8c8: 0x0008, 0x8c9: 0x0040, 0x8ca: 0x0008, 0x8cb: 0x0040,\n\t0x8cc: 0x0040, 0x8cd: 0x0008, 0x8ce: 0x0040, 0x8cf: 0x0040, 0x8d0: 0x0040, 0x8d1: 0x0040,\n\t0x8d2: 0x0040, 0x8d3: 0x0040, 0x8d4: 0x0008, 0x8d5: 0x0008, 0x8d6: 0x0008, 0x8d7: 0x0008,\n\t0x8d8: 0x0040, 0x8d9: 0x0008, 0x8da: 0x0008, 0x8db: 0x0008, 0x8dc: 0x0008, 0x8dd: 0x0008,\n\t0x8de: 0x0008, 0x8df: 0x0008, 0x8e0: 0x0040, 0x8e1: 0x0008, 0x8e2: 0x0008, 0x8e3: 0x0008,\n\t0x8e4: 0x0040, 0x8e5: 0x0008, 0x8e6: 0x0040, 0x8e7: 0x0008, 0x8e8: 0x0040, 0x8e9: 0x0040,\n\t0x8ea: 0x0008, 0x8eb: 0x0008, 0x8ec: 0x0040, 0x8ed: 0x0008, 0x8ee: 0x0008, 0x8ef: 0x0008,\n\t0x8f0: 0x0008, 0x8f1: 0x3308, 0x8f2: 0x0008, 0x8f3: 0x0929, 0x8f4: 0x3308, 0x8f5: 0x3308,\n\t0x8f6: 0x3308, 0x8f7: 0x3308, 0x8f8: 0x3308, 0x8f9: 0x3308, 0x8fa: 0x0040, 0x8fb: 0x3308,\n\t0x8fc: 0x3308, 0x8fd: 0x0008, 0x8fe: 0x0040, 0x8ff: 0x0040,\n\t// Block 0x24, offset 0x900\n\t0x900: 0x0008, 0x901: 0x0008, 0x902: 0x0008, 0x903: 0x09d1, 0x904: 0x0008, 0x905: 0x0008,\n\t0x906: 0x0008, 0x907: 0x0008, 0x908: 0x0040, 0x909: 0x0008, 0x90a: 0x0008, 0x90b: 0x0008,\n\t0x90c: 0x0008, 0x90d: 0x0a09, 0x90e: 0x0008, 0x90f: 0x0008, 0x910: 0x0008, 0x911: 0x0008,\n\t0x912: 0x0a41, 0x913: 0x0008, 0x914: 0x0008, 0x915: 0x0008, 0x916: 0x0008, 0x917: 0x0a79,\n\t0x918: 0x0008, 0x919: 0x0008, 0x91a: 0x0008, 0x91b: 0x0008, 0x91c: 0x0ab1, 0x91d: 0x0008,\n\t0x91e: 0x0008, 0x91f: 0x0008, 0x920: 0x0008, 0x921: 0x0008, 0x922: 0x0008, 0x923: 0x0008,\n\t0x924: 0x0008, 0x925: 0x0008, 0x926: 0x0008, 0x927: 0x0008, 0x928: 0x0008, 0x929: 0x0ae9,\n\t0x92a: 0x0008, 0x92b: 0x0008, 0x92c: 0x0008, 0x92d: 0x0040, 0x92e: 0x0040, 0x92f: 0x0040,\n\t0x930: 0x0040, 0x931: 0x3308, 0x932: 0x3308, 0x933: 0x0b21, 0x934: 0x3308, 0x935: 0x0b59,\n\t0x936: 0x0b91, 0x937: 0x0bc9, 0x938: 0x0c19, 0x939: 0x0c51, 0x93a: 0x3308, 0x93b: 0x3308,\n\t0x93c: 0x3308, 0x93d: 0x3308, 0x93e: 0x3308, 0x93f: 0x3008,\n\t// Block 0x25, offset 0x940\n\t0x940: 0x3308, 0x941: 0x0ca1, 0x942: 0x3308, 0x943: 0x3308, 0x944: 0x3b08, 0x945: 0x0018,\n\t0x946: 0x3308, 0x947: 0x3308, 0x948: 0x0008, 0x949: 0x0008, 0x94a: 0x0008, 0x94b: 0x0008,\n\t0x94c: 0x0008, 0x94d: 0x3308, 0x94e: 0x3308, 0x94f: 0x3308, 0x950: 0x3308, 0x951: 0x3308,\n\t0x952: 0x3308, 0x953: 0x0cd9, 0x954: 0x3308, 0x955: 0x3308, 0x956: 0x3308, 0x957: 0x3308,\n\t0x958: 0x0040, 0x959: 0x3308, 0x95a: 0x3308, 0x95b: 0x3308, 0x95c: 0x3308, 0x95d: 0x0d11,\n\t0x95e: 0x3308, 0x95f: 0x3308, 0x960: 0x3308, 0x961: 0x3308, 0x962: 0x0d49, 0x963: 0x3308,\n\t0x964: 0x3308, 0x965: 0x3308, 0x966: 0x3308, 0x967: 0x0d81, 0x968: 0x3308, 0x969: 0x3308,\n\t0x96a: 0x3308, 0x96b: 0x3308, 0x96c: 0x0db9, 0x96d: 0x3308, 0x96e: 0x3308, 0x96f: 0x3308,\n\t0x970: 0x3308, 0x971: 0x3308, 0x972: 0x3308, 0x973: 0x3308, 0x974: 0x3308, 0x975: 0x3308,\n\t0x976: 0x3308, 0x977: 0x3308, 0x978: 0x3308, 0x979: 0x0df1, 0x97a: 0x3308, 0x97b: 0x3308,\n\t0x97c: 0x3308, 0x97d: 0x0040, 0x97e: 0x0018, 0x97f: 0x0018,\n\t// Block 0x26, offset 0x980\n\t0x980: 0x0008, 0x981: 0x0008, 0x982: 0x0008, 0x983: 0x0008, 0x984: 0x0008, 0x985: 0x0008,\n\t0x986: 0x0008, 0x987: 0x0008, 0x988: 0x0008, 0x989: 0x0008, 0x98a: 0x0008, 0x98b: 0x0008,\n\t0x98c: 0x0008, 0x98d: 0x0008, 0x98e: 0x0008, 0x98f: 0x0008, 0x990: 0x0008, 0x991: 0x0008,\n\t0x992: 0x0008, 0x993: 0x0008, 0x994: 0x0008, 0x995: 0x0008, 0x996: 0x0008, 0x997: 0x0008,\n\t0x998: 0x0008, 0x999: 0x0008, 0x99a: 0x0008, 0x99b: 0x0008, 0x99c: 0x0008, 0x99d: 0x0008,\n\t0x99e: 0x0008, 0x99f: 0x0008, 0x9a0: 0x0008, 0x9a1: 0x0008, 0x9a2: 0x0008, 0x9a3: 0x0008,\n\t0x9a4: 0x0008, 0x9a5: 0x0008, 0x9a6: 0x0008, 0x9a7: 0x0008, 0x9a8: 0x0008, 0x9a9: 0x0008,\n\t0x9aa: 0x0008, 0x9ab: 0x0008, 0x9ac: 0x0039, 0x9ad: 0x0ed1, 0x9ae: 0x0ee9, 0x9af: 0x0008,\n\t0x9b0: 0x0ef9, 0x9b1: 0x0f09, 0x9b2: 0x0f19, 0x9b3: 0x0f31, 0x9b4: 0x0249, 0x9b5: 0x0f41,\n\t0x9b6: 0x0259, 0x9b7: 0x0f51, 0x9b8: 0x0359, 0x9b9: 0x0f61, 0x9ba: 0x0f71, 0x9bb: 0x0008,\n\t0x9bc: 0x00d9, 0x9bd: 0x0f81, 0x9be: 0x0f99, 0x9bf: 0x0269,\n\t// Block 0x27, offset 0x9c0\n\t0x9c0: 0x0fa9, 0x9c1: 0x0fb9, 0x9c2: 0x0279, 0x9c3: 0x0039, 0x9c4: 0x0fc9, 0x9c5: 0x0fe1,\n\t0x9c6: 0x059d, 0x9c7: 0x0ee9, 0x9c8: 0x0ef9, 0x9c9: 0x0f09, 0x9ca: 0x0ff9, 0x9cb: 0x1011,\n\t0x9cc: 0x1029, 0x9cd: 0x0f31, 0x9ce: 0x0008, 0x9cf: 0x0f51, 0x9d0: 0x0f61, 0x9d1: 0x1041,\n\t0x9d2: 0x00d9, 0x9d3: 0x1059, 0x9d4: 0x05b5, 0x9d5: 0x05b5, 0x9d6: 0x0f99, 0x9d7: 0x0fa9,\n\t0x9d8: 0x0fb9, 0x9d9: 0x059d, 0x9da: 0x1071, 0x9db: 0x1089, 0x9dc: 0x05cd, 0x9dd: 0x1099,\n\t0x9de: 0x10b1, 0x9df: 0x10c9, 0x9e0: 0x10e1, 0x9e1: 0x10f9, 0x9e2: 0x0f41, 0x9e3: 0x0269,\n\t0x9e4: 0x0fb9, 0x9e5: 0x1089, 0x9e6: 0x1099, 0x9e7: 0x10b1, 0x9e8: 0x1111, 0x9e9: 0x10e1,\n\t0x9ea: 0x10f9, 0x9eb: 0x0008, 0x9ec: 0x0008, 0x9ed: 0x0008, 0x9ee: 0x0008, 0x9ef: 0x0008,\n\t0x9f0: 0x0008, 0x9f1: 0x0008, 0x9f2: 0x0008, 0x9f3: 0x0008, 0x9f4: 0x0008, 0x9f5: 0x0008,\n\t0x9f6: 0x0008, 0x9f7: 0x0008, 0x9f8: 0x1129, 0x9f9: 0x0008, 0x9fa: 0x0008, 0x9fb: 0x0008,\n\t0x9fc: 0x0008, 0x9fd: 0x0008, 0x9fe: 0x0008, 0x9ff: 0x0008,\n\t// Block 0x28, offset 0xa00\n\t0xa00: 0x0008, 0xa01: 0x0008, 0xa02: 0x0008, 0xa03: 0x0008, 0xa04: 0x0008, 0xa05: 0x0008,\n\t0xa06: 0x0008, 0xa07: 0x0008, 0xa08: 0x0008, 0xa09: 0x0008, 0xa0a: 0x0008, 0xa0b: 0x0008,\n\t0xa0c: 0x0008, 0xa0d: 0x0008, 0xa0e: 0x0008, 0xa0f: 0x0008, 0xa10: 0x0008, 0xa11: 0x0008,\n\t0xa12: 0x0008, 0xa13: 0x0008, 0xa14: 0x0008, 0xa15: 0x0008, 0xa16: 0x0008, 0xa17: 0x0008,\n\t0xa18: 0x0008, 0xa19: 0x0008, 0xa1a: 0x0008, 0xa1b: 0x1141, 0xa1c: 0x1159, 0xa1d: 0x1169,\n\t0xa1e: 0x1181, 0xa1f: 0x1029, 0xa20: 0x1199, 0xa21: 0x11a9, 0xa22: 0x11c1, 0xa23: 0x11d9,\n\t0xa24: 0x11f1, 0xa25: 0x1209, 0xa26: 0x1221, 0xa27: 0x05e5, 0xa28: 0x1239, 0xa29: 0x1251,\n\t0xa2a: 0xe17d, 0xa2b: 0x1269, 0xa2c: 0x1281, 0xa2d: 0x1299, 0xa2e: 0x12b1, 0xa2f: 0x12c9,\n\t0xa30: 0x12e1, 0xa31: 0x12f9, 0xa32: 0x1311, 0xa33: 0x1329, 0xa34: 0x1341, 0xa35: 0x1359,\n\t0xa36: 0x1371, 0xa37: 0x1389, 0xa38: 0x05fd, 0xa39: 0x13a1, 0xa3a: 0x13b9, 0xa3b: 0x13d1,\n\t0xa3c: 0x13e1, 0xa3d: 0x13f9, 0xa3e: 0x1411, 0xa3f: 0x1429,\n\t// Block 0x29, offset 0xa40\n\t0xa40: 0xe00d, 0xa41: 0x0008, 0xa42: 0xe00d, 0xa43: 0x0008, 0xa44: 0xe00d, 0xa45: 0x0008,\n\t0xa46: 0xe00d, 0xa47: 0x0008, 0xa48: 0xe00d, 0xa49: 0x0008, 0xa4a: 0xe00d, 0xa4b: 0x0008,\n\t0xa4c: 0xe00d, 0xa4d: 0x0008, 0xa4e: 0xe00d, 0xa4f: 0x0008, 0xa50: 0xe00d, 0xa51: 0x0008,\n\t0xa52: 0xe00d, 0xa53: 0x0008, 0xa54: 0xe00d, 0xa55: 0x0008, 0xa56: 0xe00d, 0xa57: 0x0008,\n\t0xa58: 0xe00d, 0xa59: 0x0008, 0xa5a: 0xe00d, 0xa5b: 0x0008, 0xa5c: 0xe00d, 0xa5d: 0x0008,\n\t0xa5e: 0xe00d, 0xa5f: 0x0008, 0xa60: 0xe00d, 0xa61: 0x0008, 0xa62: 0xe00d, 0xa63: 0x0008,\n\t0xa64: 0xe00d, 0xa65: 0x0008, 0xa66: 0xe00d, 0xa67: 0x0008, 0xa68: 0xe00d, 0xa69: 0x0008,\n\t0xa6a: 0xe00d, 0xa6b: 0x0008, 0xa6c: 0xe00d, 0xa6d: 0x0008, 0xa6e: 0xe00d, 0xa6f: 0x0008,\n\t0xa70: 0xe00d, 0xa71: 0x0008, 0xa72: 0xe00d, 0xa73: 0x0008, 0xa74: 0xe00d, 0xa75: 0x0008,\n\t0xa76: 0xe00d, 0xa77: 0x0008, 0xa78: 0xe00d, 0xa79: 0x0008, 0xa7a: 0xe00d, 0xa7b: 0x0008,\n\t0xa7c: 0xe00d, 0xa7d: 0x0008, 0xa7e: 0xe00d, 0xa7f: 0x0008,\n\t// Block 0x2a, offset 0xa80\n\t0xa80: 0xe00d, 0xa81: 0x0008, 0xa82: 0xe00d, 0xa83: 0x0008, 0xa84: 0xe00d, 0xa85: 0x0008,\n\t0xa86: 0xe00d, 0xa87: 0x0008, 0xa88: 0xe00d, 0xa89: 0x0008, 0xa8a: 0xe00d, 0xa8b: 0x0008,\n\t0xa8c: 0xe00d, 0xa8d: 0x0008, 0xa8e: 0xe00d, 0xa8f: 0x0008, 0xa90: 0xe00d, 0xa91: 0x0008,\n\t0xa92: 0xe00d, 0xa93: 0x0008, 0xa94: 0xe00d, 0xa95: 0x0008, 0xa96: 0x0008, 0xa97: 0x0008,\n\t0xa98: 0x0008, 0xa99: 0x0008, 0xa9a: 0x0615, 0xa9b: 0x0635, 0xa9c: 0x0008, 0xa9d: 0x0008,\n\t0xa9e: 0x1441, 0xa9f: 0x0008, 0xaa0: 0xe00d, 0xaa1: 0x0008, 0xaa2: 0xe00d, 0xaa3: 0x0008,\n\t0xaa4: 0xe00d, 0xaa5: 0x0008, 0xaa6: 0xe00d, 0xaa7: 0x0008, 0xaa8: 0xe00d, 0xaa9: 0x0008,\n\t0xaaa: 0xe00d, 0xaab: 0x0008, 0xaac: 0xe00d, 0xaad: 0x0008, 0xaae: 0xe00d, 0xaaf: 0x0008,\n\t0xab0: 0xe00d, 0xab1: 0x0008, 0xab2: 0xe00d, 0xab3: 0x0008, 0xab4: 0xe00d, 0xab5: 0x0008,\n\t0xab6: 0xe00d, 0xab7: 0x0008, 0xab8: 0xe00d, 0xab9: 0x0008, 0xaba: 0xe00d, 0xabb: 0x0008,\n\t0xabc: 0xe00d, 0xabd: 0x0008, 0xabe: 0xe00d, 0xabf: 0x0008,\n\t// Block 0x2b, offset 0xac0\n\t0xac0: 0x0008, 0xac1: 0x0008, 0xac2: 0x0008, 0xac3: 0x0008, 0xac4: 0x0008, 0xac5: 0x0008,\n\t0xac6: 0x0040, 0xac7: 0x0040, 0xac8: 0xe045, 0xac9: 0xe045, 0xaca: 0xe045, 0xacb: 0xe045,\n\t0xacc: 0xe045, 0xacd: 0xe045, 0xace: 0x0040, 0xacf: 0x0040, 0xad0: 0x0008, 0xad1: 0x0008,\n\t0xad2: 0x0008, 0xad3: 0x0008, 0xad4: 0x0008, 0xad5: 0x0008, 0xad6: 0x0008, 0xad7: 0x0008,\n\t0xad8: 0x0040, 0xad9: 0xe045, 0xada: 0x0040, 0xadb: 0xe045, 0xadc: 0x0040, 0xadd: 0xe045,\n\t0xade: 0x0040, 0xadf: 0xe045, 0xae0: 0x0008, 0xae1: 0x0008, 0xae2: 0x0008, 0xae3: 0x0008,\n\t0xae4: 0x0008, 0xae5: 0x0008, 0xae6: 0x0008, 0xae7: 0x0008, 0xae8: 0xe045, 0xae9: 0xe045,\n\t0xaea: 0xe045, 0xaeb: 0xe045, 0xaec: 0xe045, 0xaed: 0xe045, 0xaee: 0xe045, 0xaef: 0xe045,\n\t0xaf0: 0x0008, 0xaf1: 0x1459, 0xaf2: 0x0008, 0xaf3: 0x1471, 0xaf4: 0x0008, 0xaf5: 0x1489,\n\t0xaf6: 0x0008, 0xaf7: 0x14a1, 0xaf8: 0x0008, 0xaf9: 0x14b9, 0xafa: 0x0008, 0xafb: 0x14d1,\n\t0xafc: 0x0008, 0xafd: 0x14e9, 0xafe: 0x0040, 0xaff: 0x0040,\n\t// Block 0x2c, offset 0xb00\n\t0xb00: 0x1501, 0xb01: 0x1531, 0xb02: 0x1561, 0xb03: 0x1591, 0xb04: 0x15c1, 0xb05: 0x15f1,\n\t0xb06: 0x1621, 0xb07: 0x1651, 0xb08: 0x1501, 0xb09: 0x1531, 0xb0a: 0x1561, 0xb0b: 0x1591,\n\t0xb0c: 0x15c1, 0xb0d: 0x15f1, 0xb0e: 0x1621, 0xb0f: 0x1651, 0xb10: 0x1681, 0xb11: 0x16b1,\n\t0xb12: 0x16e1, 0xb13: 0x1711, 0xb14: 0x1741, 0xb15: 0x1771, 0xb16: 0x17a1, 0xb17: 0x17d1,\n\t0xb18: 0x1681, 0xb19: 0x16b1, 0xb1a: 0x16e1, 0xb1b: 0x1711, 0xb1c: 0x1741, 0xb1d: 0x1771,\n\t0xb1e: 0x17a1, 0xb1f: 0x17d1, 0xb20: 0x1801, 0xb21: 0x1831, 0xb22: 0x1861, 0xb23: 0x1891,\n\t0xb24: 0x18c1, 0xb25: 0x18f1, 0xb26: 0x1921, 0xb27: 0x1951, 0xb28: 0x1801, 0xb29: 0x1831,\n\t0xb2a: 0x1861, 0xb2b: 0x1891, 0xb2c: 0x18c1, 0xb2d: 0x18f1, 0xb2e: 0x1921, 0xb2f: 0x1951,\n\t0xb30: 0x0008, 0xb31: 0x0008, 0xb32: 0x1981, 0xb33: 0x19b1, 0xb34: 0x19d9, 0xb35: 0x0040,\n\t0xb36: 0x0008, 0xb37: 0x1a01, 0xb38: 0xe045, 0xb39: 0xe045, 0xb3a: 0x064d, 0xb3b: 0x1459,\n\t0xb3c: 0x19b1, 0xb3d: 0x0666, 0xb3e: 0x1a31, 0xb3f: 0x0686,\n\t// Block 0x2d, offset 0xb40\n\t0xb40: 0x06a6, 0xb41: 0x1a4a, 0xb42: 0x1a79, 0xb43: 0x1aa9, 0xb44: 0x1ad1, 0xb45: 0x0040,\n\t0xb46: 0x0008, 0xb47: 0x1af9, 0xb48: 0x06c5, 0xb49: 0x1471, 0xb4a: 0x06dd, 0xb4b: 0x1489,\n\t0xb4c: 0x1aa9, 0xb4d: 0x1b2a, 0xb4e: 0x1b5a, 0xb4f: 0x1b8a, 0xb50: 0x0008, 0xb51: 0x0008,\n\t0xb52: 0x0008, 0xb53: 0x1bb9, 0xb54: 0x0040, 0xb55: 0x0040, 0xb56: 0x0008, 0xb57: 0x0008,\n\t0xb58: 0xe045, 0xb59: 0xe045, 0xb5a: 0x06f5, 0xb5b: 0x14a1, 0xb5c: 0x0040, 0xb5d: 0x1bd2,\n\t0xb5e: 0x1c02, 0xb5f: 0x1c32, 0xb60: 0x0008, 0xb61: 0x0008, 0xb62: 0x0008, 0xb63: 0x1c61,\n\t0xb64: 0x0008, 0xb65: 0x0008, 0xb66: 0x0008, 0xb67: 0x0008, 0xb68: 0xe045, 0xb69: 0xe045,\n\t0xb6a: 0x070d, 0xb6b: 0x14d1, 0xb6c: 0xe04d, 0xb6d: 0x1c7a, 0xb6e: 0x03d2, 0xb6f: 0x1caa,\n\t0xb70: 0x0040, 0xb71: 0x0040, 0xb72: 0x1cb9, 0xb73: 0x1ce9, 0xb74: 0x1d11, 0xb75: 0x0040,\n\t0xb76: 0x0008, 0xb77: 0x1d39, 0xb78: 0x0725, 0xb79: 0x14b9, 0xb7a: 0x0515, 0xb7b: 0x14e9,\n\t0xb7c: 0x1ce9, 0xb7d: 0x073e, 0xb7e: 0x075e, 0xb7f: 0x0040,\n\t// Block 0x2e, offset 0xb80\n\t0xb80: 0x000a, 0xb81: 0x000a, 0xb82: 0x000a, 0xb83: 0x000a, 0xb84: 0x000a, 0xb85: 0x000a,\n\t0xb86: 0x000a, 0xb87: 0x000a, 0xb88: 0x000a, 0xb89: 0x000a, 0xb8a: 0x000a, 0xb8b: 0x03c0,\n\t0xb8c: 0x0003, 0xb8d: 0x0003, 0xb8e: 0x0340, 0xb8f: 0x0b40, 0xb90: 0x0018, 0xb91: 0xe00d,\n\t0xb92: 0x0018, 0xb93: 0x0018, 0xb94: 0x0018, 0xb95: 0x0018, 0xb96: 0x0018, 0xb97: 0x077e,\n\t0xb98: 0x0018, 0xb99: 0x0018, 0xb9a: 0x0018, 0xb9b: 0x0018, 0xb9c: 0x0018, 0xb9d: 0x0018,\n\t0xb9e: 0x0018, 0xb9f: 0x0018, 0xba0: 0x0018, 0xba1: 0x0018, 0xba2: 0x0018, 0xba3: 0x0018,\n\t0xba4: 0x0040, 0xba5: 0x0040, 0xba6: 0x0040, 0xba7: 0x0018, 0xba8: 0x0040, 0xba9: 0x0040,\n\t0xbaa: 0x0340, 0xbab: 0x0340, 0xbac: 0x0340, 0xbad: 0x0340, 0xbae: 0x0340, 0xbaf: 0x000a,\n\t0xbb0: 0x0018, 0xbb1: 0x0018, 0xbb2: 0x0018, 0xbb3: 0x1d69, 0xbb4: 0x1da1, 0xbb5: 0x0018,\n\t0xbb6: 0x1df1, 0xbb7: 0x1e29, 0xbb8: 0x0018, 0xbb9: 0x0018, 0xbba: 0x0018, 0xbbb: 0x0018,\n\t0xbbc: 0x1e7a, 0xbbd: 0x0018, 0xbbe: 0x079e, 0xbbf: 0x0018,\n\t// Block 0x2f, offset 0xbc0\n\t0xbc0: 0x0018, 0xbc1: 0x0018, 0xbc2: 0x0018, 0xbc3: 0x0018, 0xbc4: 0x0018, 0xbc5: 0x0018,\n\t0xbc6: 0x0018, 0xbc7: 0x1e92, 0xbc8: 0x1eaa, 0xbc9: 0x1ec2, 0xbca: 0x0018, 0xbcb: 0x0018,\n\t0xbcc: 0x0018, 0xbcd: 0x0018, 0xbce: 0x0018, 0xbcf: 0x0018, 0xbd0: 0x0018, 0xbd1: 0x0018,\n\t0xbd2: 0x0018, 0xbd3: 0x0018, 0xbd4: 0x0018, 0xbd5: 0x0018, 0xbd6: 0x0018, 0xbd7: 0x1ed9,\n\t0xbd8: 0x0018, 0xbd9: 0x0018, 0xbda: 0x0018, 0xbdb: 0x0018, 0xbdc: 0x0018, 0xbdd: 0x0018,\n\t0xbde: 0x0018, 0xbdf: 0x000a, 0xbe0: 0x03c0, 0xbe1: 0x0340, 0xbe2: 0x0340, 0xbe3: 0x0340,\n\t0xbe4: 0x03c0, 0xbe5: 0x0040, 0xbe6: 0x0040, 0xbe7: 0x0040, 0xbe8: 0x0040, 0xbe9: 0x0040,\n\t0xbea: 0x0340, 0xbeb: 0x0340, 0xbec: 0x0340, 0xbed: 0x0340, 0xbee: 0x0340, 0xbef: 0x0340,\n\t0xbf0: 0x1f41, 0xbf1: 0x0f41, 0xbf2: 0x0040, 0xbf3: 0x0040, 0xbf4: 0x1f51, 0xbf5: 0x1f61,\n\t0xbf6: 0x1f71, 0xbf7: 0x1f81, 0xbf8: 0x1f91, 0xbf9: 0x1fa1, 0xbfa: 0x1fb2, 0xbfb: 0x07bd,\n\t0xbfc: 0x1fc2, 0xbfd: 0x1fd2, 0xbfe: 0x1fe2, 0xbff: 0x0f71,\n\t// Block 0x30, offset 0xc00\n\t0xc00: 0x1f41, 0xc01: 0x00c9, 0xc02: 0x0069, 0xc03: 0x0079, 0xc04: 0x1f51, 0xc05: 0x1f61,\n\t0xc06: 0x1f71, 0xc07: 0x1f81, 0xc08: 0x1f91, 0xc09: 0x1fa1, 0xc0a: 0x1fb2, 0xc0b: 0x07d5,\n\t0xc0c: 0x1fc2, 0xc0d: 0x1fd2, 0xc0e: 0x1fe2, 0xc0f: 0x0040, 0xc10: 0x0039, 0xc11: 0x0f09,\n\t0xc12: 0x00d9, 0xc13: 0x0369, 0xc14: 0x0ff9, 0xc15: 0x0249, 0xc16: 0x0f51, 0xc17: 0x0359,\n\t0xc18: 0x0f61, 0xc19: 0x0f71, 0xc1a: 0x0f99, 0xc1b: 0x01d9, 0xc1c: 0x0fa9, 0xc1d: 0x0040,\n\t0xc1e: 0x0040, 0xc1f: 0x0040, 0xc20: 0x0018, 0xc21: 0x0018, 0xc22: 0x0018, 0xc23: 0x0018,\n\t0xc24: 0x0018, 0xc25: 0x0018, 0xc26: 0x0018, 0xc27: 0x0018, 0xc28: 0x1ff1, 0xc29: 0x0018,\n\t0xc2a: 0x0018, 0xc2b: 0x0018, 0xc2c: 0x0018, 0xc2d: 0x0018, 0xc2e: 0x0018, 0xc2f: 0x0018,\n\t0xc30: 0x0018, 0xc31: 0x0018, 0xc32: 0x0018, 0xc33: 0x0018, 0xc34: 0x0018, 0xc35: 0x0018,\n\t0xc36: 0x0018, 0xc37: 0x0018, 0xc38: 0x0018, 0xc39: 0x0018, 0xc3a: 0x0018, 0xc3b: 0x0018,\n\t0xc3c: 0x0018, 0xc3d: 0x0018, 0xc3e: 0x0018, 0xc3f: 0x0040,\n\t// Block 0x31, offset 0xc40\n\t0xc40: 0x07ee, 0xc41: 0x080e, 0xc42: 0x1159, 0xc43: 0x082d, 0xc44: 0x0018, 0xc45: 0x084e,\n\t0xc46: 0x086e, 0xc47: 0x1011, 0xc48: 0x0018, 0xc49: 0x088d, 0xc4a: 0x0f31, 0xc4b: 0x0249,\n\t0xc4c: 0x0249, 0xc4d: 0x0249, 0xc4e: 0x0249, 0xc4f: 0x2009, 0xc50: 0x0f41, 0xc51: 0x0f41,\n\t0xc52: 0x0359, 0xc53: 0x0359, 0xc54: 0x0018, 0xc55: 0x0f71, 0xc56: 0x2021, 0xc57: 0x0018,\n\t0xc58: 0x0018, 0xc59: 0x0f99, 0xc5a: 0x2039, 0xc5b: 0x0269, 0xc5c: 0x0269, 0xc5d: 0x0269,\n\t0xc5e: 0x0018, 0xc5f: 0x0018, 0xc60: 0x2049, 0xc61: 0x08ad, 0xc62: 0x2061, 0xc63: 0x0018,\n\t0xc64: 0x13d1, 0xc65: 0x0018, 0xc66: 0x2079, 0xc67: 0x0018, 0xc68: 0x13d1, 0xc69: 0x0018,\n\t0xc6a: 0x0f51, 0xc6b: 0x2091, 0xc6c: 0x0ee9, 0xc6d: 0x1159, 0xc6e: 0x0018, 0xc6f: 0x0f09,\n\t0xc70: 0x0f09, 0xc71: 0x1199, 0xc72: 0x0040, 0xc73: 0x0f61, 0xc74: 0x00d9, 0xc75: 0x20a9,\n\t0xc76: 0x20c1, 0xc77: 0x20d9, 0xc78: 0x20f1, 0xc79: 0x0f41, 0xc7a: 0x0018, 0xc7b: 0x08cd,\n\t0xc7c: 0x2109, 0xc7d: 0x10b1, 0xc7e: 0x10b1, 0xc7f: 0x2109,\n\t// Block 0x32, offset 0xc80\n\t0xc80: 0x08ed, 0xc81: 0x0018, 0xc82: 0x0018, 0xc83: 0x0018, 0xc84: 0x0018, 0xc85: 0x0ef9,\n\t0xc86: 0x0ef9, 0xc87: 0x0f09, 0xc88: 0x0f41, 0xc89: 0x0259, 0xc8a: 0x0018, 0xc8b: 0x0018,\n\t0xc8c: 0x0018, 0xc8d: 0x0018, 0xc8e: 0x0008, 0xc8f: 0x0018, 0xc90: 0x2121, 0xc91: 0x2151,\n\t0xc92: 0x2181, 0xc93: 0x21b9, 0xc94: 0x21e9, 0xc95: 0x2219, 0xc96: 0x2249, 0xc97: 0x2279,\n\t0xc98: 0x22a9, 0xc99: 0x22d9, 0xc9a: 0x2309, 0xc9b: 0x2339, 0xc9c: 0x2369, 0xc9d: 0x2399,\n\t0xc9e: 0x23c9, 0xc9f: 0x23f9, 0xca0: 0x0f41, 0xca1: 0x2421, 0xca2: 0x0905, 0xca3: 0x2439,\n\t0xca4: 0x1089, 0xca5: 0x2451, 0xca6: 0x0925, 0xca7: 0x2469, 0xca8: 0x2491, 0xca9: 0x0369,\n\t0xcaa: 0x24a9, 0xcab: 0x0945, 0xcac: 0x0359, 0xcad: 0x1159, 0xcae: 0x0ef9, 0xcaf: 0x0f61,\n\t0xcb0: 0x0f41, 0xcb1: 0x2421, 0xcb2: 0x0965, 0xcb3: 0x2439, 0xcb4: 0x1089, 0xcb5: 0x2451,\n\t0xcb6: 0x0985, 0xcb7: 0x2469, 0xcb8: 0x2491, 0xcb9: 0x0369, 0xcba: 0x24a9, 0xcbb: 0x09a5,\n\t0xcbc: 0x0359, 0xcbd: 0x1159, 0xcbe: 0x0ef9, 0xcbf: 0x0f61,\n\t// Block 0x33, offset 0xcc0\n\t0xcc0: 0x0018, 0xcc1: 0x0018, 0xcc2: 0x0018, 0xcc3: 0x0018, 0xcc4: 0x0018, 0xcc5: 0x0018,\n\t0xcc6: 0x0018, 0xcc7: 0x0018, 0xcc8: 0x0018, 0xcc9: 0x0018, 0xcca: 0x0018, 0xccb: 0x0040,\n\t0xccc: 0x0040, 0xccd: 0x0040, 0xcce: 0x0040, 0xccf: 0x0040, 0xcd0: 0x0040, 0xcd1: 0x0040,\n\t0xcd2: 0x0040, 0xcd3: 0x0040, 0xcd4: 0x0040, 0xcd5: 0x0040, 0xcd6: 0x0040, 0xcd7: 0x0040,\n\t0xcd8: 0x0040, 0xcd9: 0x0040, 0xcda: 0x0040, 0xcdb: 0x0040, 0xcdc: 0x0040, 0xcdd: 0x0040,\n\t0xcde: 0x0040, 0xcdf: 0x0040, 0xce0: 0x00c9, 0xce1: 0x0069, 0xce2: 0x0079, 0xce3: 0x1f51,\n\t0xce4: 0x1f61, 0xce5: 0x1f71, 0xce6: 0x1f81, 0xce7: 0x1f91, 0xce8: 0x1fa1, 0xce9: 0x2601,\n\t0xcea: 0x2619, 0xceb: 0x2631, 0xcec: 0x2649, 0xced: 0x2661, 0xcee: 0x2679, 0xcef: 0x2691,\n\t0xcf0: 0x26a9, 0xcf1: 0x26c1, 0xcf2: 0x26d9, 0xcf3: 0x26f1, 0xcf4: 0x0a06, 0xcf5: 0x0a26,\n\t0xcf6: 0x0a46, 0xcf7: 0x0a66, 0xcf8: 0x0a86, 0xcf9: 0x0aa6, 0xcfa: 0x0ac6, 0xcfb: 0x0ae6,\n\t0xcfc: 0x0b06, 0xcfd: 0x270a, 0xcfe: 0x2732, 0xcff: 0x275a,\n\t// Block 0x34, offset 0xd00\n\t0xd00: 0x2782, 0xd01: 0x27aa, 0xd02: 0x27d2, 0xd03: 0x27fa, 0xd04: 0x2822, 0xd05: 0x284a,\n\t0xd06: 0x2872, 0xd07: 0x289a, 0xd08: 0x0040, 0xd09: 0x0040, 0xd0a: 0x0040, 0xd0b: 0x0040,\n\t0xd0c: 0x0040, 0xd0d: 0x0040, 0xd0e: 0x0040, 0xd0f: 0x0040, 0xd10: 0x0040, 0xd11: 0x0040,\n\t0xd12: 0x0040, 0xd13: 0x0040, 0xd14: 0x0040, 0xd15: 0x0040, 0xd16: 0x0040, 0xd17: 0x0040,\n\t0xd18: 0x0040, 0xd19: 0x0040, 0xd1a: 0x0040, 0xd1b: 0x0040, 0xd1c: 0x0b26, 0xd1d: 0x0b46,\n\t0xd1e: 0x0b66, 0xd1f: 0x0b86, 0xd20: 0x0ba6, 0xd21: 0x0bc6, 0xd22: 0x0be6, 0xd23: 0x0c06,\n\t0xd24: 0x0c26, 0xd25: 0x0c46, 0xd26: 0x0c66, 0xd27: 0x0c86, 0xd28: 0x0ca6, 0xd29: 0x0cc6,\n\t0xd2a: 0x0ce6, 0xd2b: 0x0d06, 0xd2c: 0x0d26, 0xd2d: 0x0d46, 0xd2e: 0x0d66, 0xd2f: 0x0d86,\n\t0xd30: 0x0da6, 0xd31: 0x0dc6, 0xd32: 0x0de6, 0xd33: 0x0e06, 0xd34: 0x0e26, 0xd35: 0x0e46,\n\t0xd36: 0x0039, 0xd37: 0x0ee9, 0xd38: 0x1159, 0xd39: 0x0ef9, 0xd3a: 0x0f09, 0xd3b: 0x1199,\n\t0xd3c: 0x0f31, 0xd3d: 0x0249, 0xd3e: 0x0f41, 0xd3f: 0x0259,\n\t// Block 0x35, offset 0xd40\n\t0xd40: 0x0f51, 0xd41: 0x0359, 0xd42: 0x0f61, 0xd43: 0x0f71, 0xd44: 0x00d9, 0xd45: 0x0f99,\n\t0xd46: 0x2039, 0xd47: 0x0269, 0xd48: 0x01d9, 0xd49: 0x0fa9, 0xd4a: 0x0fb9, 0xd4b: 0x1089,\n\t0xd4c: 0x0279, 0xd4d: 0x0369, 0xd4e: 0x0289, 0xd4f: 0x13d1, 0xd50: 0x0039, 0xd51: 0x0ee9,\n\t0xd52: 0x1159, 0xd53: 0x0ef9, 0xd54: 0x0f09, 0xd55: 0x1199, 0xd56: 0x0f31, 0xd57: 0x0249,\n\t0xd58: 0x0f41, 0xd59: 0x0259, 0xd5a: 0x0f51, 0xd5b: 0x0359, 0xd5c: 0x0f61, 0xd5d: 0x0f71,\n\t0xd5e: 0x00d9, 0xd5f: 0x0f99, 0xd60: 0x2039, 0xd61: 0x0269, 0xd62: 0x01d9, 0xd63: 0x0fa9,\n\t0xd64: 0x0fb9, 0xd65: 0x1089, 0xd66: 0x0279, 0xd67: 0x0369, 0xd68: 0x0289, 0xd69: 0x13d1,\n\t0xd6a: 0x1f41, 0xd6b: 0x0018, 0xd6c: 0x0018, 0xd6d: 0x0018, 0xd6e: 0x0018, 0xd6f: 0x0018,\n\t0xd70: 0x0018, 0xd71: 0x0018, 0xd72: 0x0018, 0xd73: 0x0018, 0xd74: 0x0018, 0xd75: 0x0018,\n\t0xd76: 0x0018, 0xd77: 0x0018, 0xd78: 0x0018, 0xd79: 0x0018, 0xd7a: 0x0018, 0xd7b: 0x0018,\n\t0xd7c: 0x0018, 0xd7d: 0x0018, 0xd7e: 0x0018, 0xd7f: 0x0018,\n\t// Block 0x36, offset 0xd80\n\t0xd80: 0x0008, 0xd81: 0x0008, 0xd82: 0x0008, 0xd83: 0x0008, 0xd84: 0x0008, 0xd85: 0x0008,\n\t0xd86: 0x0008, 0xd87: 0x0008, 0xd88: 0x0008, 0xd89: 0x0008, 0xd8a: 0x0008, 0xd8b: 0x0008,\n\t0xd8c: 0x0008, 0xd8d: 0x0008, 0xd8e: 0x0008, 0xd8f: 0x0008, 0xd90: 0x0008, 0xd91: 0x0008,\n\t0xd92: 0x0008, 0xd93: 0x0008, 0xd94: 0x0008, 0xd95: 0x0008, 0xd96: 0x0008, 0xd97: 0x0008,\n\t0xd98: 0x0008, 0xd99: 0x0008, 0xd9a: 0x0008, 0xd9b: 0x0008, 0xd9c: 0x0008, 0xd9d: 0x0008,\n\t0xd9e: 0x0008, 0xd9f: 0x0040, 0xda0: 0xe00d, 0xda1: 0x0008, 0xda2: 0x2971, 0xda3: 0x0ebd,\n\t0xda4: 0x2989, 0xda5: 0x0008, 0xda6: 0x0008, 0xda7: 0xe07d, 0xda8: 0x0008, 0xda9: 0xe01d,\n\t0xdaa: 0x0008, 0xdab: 0xe03d, 0xdac: 0x0008, 0xdad: 0x0fe1, 0xdae: 0x1281, 0xdaf: 0x0fc9,\n\t0xdb0: 0x1141, 0xdb1: 0x0008, 0xdb2: 0xe00d, 0xdb3: 0x0008, 0xdb4: 0x0008, 0xdb5: 0xe01d,\n\t0xdb6: 0x0008, 0xdb7: 0x0008, 0xdb8: 0x0008, 0xdb9: 0x0008, 0xdba: 0x0008, 0xdbb: 0x0008,\n\t0xdbc: 0x0259, 0xdbd: 0x1089, 0xdbe: 0x29a1, 0xdbf: 0x29b9,\n\t// Block 0x37, offset 0xdc0\n\t0xdc0: 0xe00d, 0xdc1: 0x0008, 0xdc2: 0xe00d, 0xdc3: 0x0008, 0xdc4: 0xe00d, 0xdc5: 0x0008,\n\t0xdc6: 0xe00d, 0xdc7: 0x0008, 0xdc8: 0xe00d, 0xdc9: 0x0008, 0xdca: 0xe00d, 0xdcb: 0x0008,\n\t0xdcc: 0xe00d, 0xdcd: 0x0008, 0xdce: 0xe00d, 0xdcf: 0x0008, 0xdd0: 0xe00d, 0xdd1: 0x0008,\n\t0xdd2: 0xe00d, 0xdd3: 0x0008, 0xdd4: 0xe00d, 0xdd5: 0x0008, 0xdd6: 0xe00d, 0xdd7: 0x0008,\n\t0xdd8: 0xe00d, 0xdd9: 0x0008, 0xdda: 0xe00d, 0xddb: 0x0008, 0xddc: 0xe00d, 0xddd: 0x0008,\n\t0xdde: 0xe00d, 0xddf: 0x0008, 0xde0: 0xe00d, 0xde1: 0x0008, 0xde2: 0xe00d, 0xde3: 0x0008,\n\t0xde4: 0x0008, 0xde5: 0x0018, 0xde6: 0x0018, 0xde7: 0x0018, 0xde8: 0x0018, 0xde9: 0x0018,\n\t0xdea: 0x0018, 0xdeb: 0xe03d, 0xdec: 0x0008, 0xded: 0xe01d, 0xdee: 0x0008, 0xdef: 0x3308,\n\t0xdf0: 0x3308, 0xdf1: 0x3308, 0xdf2: 0xe00d, 0xdf3: 0x0008, 0xdf4: 0x0040, 0xdf5: 0x0040,\n\t0xdf6: 0x0040, 0xdf7: 0x0040, 0xdf8: 0x0040, 0xdf9: 0x0018, 0xdfa: 0x0018, 0xdfb: 0x0018,\n\t0xdfc: 0x0018, 0xdfd: 0x0018, 0xdfe: 0x0018, 0xdff: 0x0018,\n\t// Block 0x38, offset 0xe00\n\t0xe00: 0x26fd, 0xe01: 0x271d, 0xe02: 0x273d, 0xe03: 0x275d, 0xe04: 0x277d, 0xe05: 0x279d,\n\t0xe06: 0x27bd, 0xe07: 0x27dd, 0xe08: 0x27fd, 0xe09: 0x281d, 0xe0a: 0x283d, 0xe0b: 0x285d,\n\t0xe0c: 0x287d, 0xe0d: 0x289d, 0xe0e: 0x28bd, 0xe0f: 0x28dd, 0xe10: 0x28fd, 0xe11: 0x291d,\n\t0xe12: 0x293d, 0xe13: 0x295d, 0xe14: 0x297d, 0xe15: 0x299d, 0xe16: 0x0040, 0xe17: 0x0040,\n\t0xe18: 0x0040, 0xe19: 0x0040, 0xe1a: 0x0040, 0xe1b: 0x0040, 0xe1c: 0x0040, 0xe1d: 0x0040,\n\t0xe1e: 0x0040, 0xe1f: 0x0040, 0xe20: 0x0040, 0xe21: 0x0040, 0xe22: 0x0040, 0xe23: 0x0040,\n\t0xe24: 0x0040, 0xe25: 0x0040, 0xe26: 0x0040, 0xe27: 0x0040, 0xe28: 0x0040, 0xe29: 0x0040,\n\t0xe2a: 0x0040, 0xe2b: 0x0040, 0xe2c: 0x0040, 0xe2d: 0x0040, 0xe2e: 0x0040, 0xe2f: 0x0040,\n\t0xe30: 0x0040, 0xe31: 0x0040, 0xe32: 0x0040, 0xe33: 0x0040, 0xe34: 0x0040, 0xe35: 0x0040,\n\t0xe36: 0x0040, 0xe37: 0x0040, 0xe38: 0x0040, 0xe39: 0x0040, 0xe3a: 0x0040, 0xe3b: 0x0040,\n\t0xe3c: 0x0040, 0xe3d: 0x0040, 0xe3e: 0x0040, 0xe3f: 0x0040,\n\t// Block 0x39, offset 0xe40\n\t0xe40: 0x000a, 0xe41: 0x0018, 0xe42: 0x29d1, 0xe43: 0x0018, 0xe44: 0x0018, 0xe45: 0x0008,\n\t0xe46: 0x0008, 0xe47: 0x0008, 0xe48: 0x0018, 0xe49: 0x0018, 0xe4a: 0x0018, 0xe4b: 0x0018,\n\t0xe4c: 0x0018, 0xe4d: 0x0018, 0xe4e: 0x0018, 0xe4f: 0x0018, 0xe50: 0x0018, 0xe51: 0x0018,\n\t0xe52: 0x0018, 0xe53: 0x0018, 0xe54: 0x0018, 0xe55: 0x0018, 0xe56: 0x0018, 0xe57: 0x0018,\n\t0xe58: 0x0018, 0xe59: 0x0018, 0xe5a: 0x0018, 0xe5b: 0x0018, 0xe5c: 0x0018, 0xe5d: 0x0018,\n\t0xe5e: 0x0018, 0xe5f: 0x0018, 0xe60: 0x0018, 0xe61: 0x0018, 0xe62: 0x0018, 0xe63: 0x0018,\n\t0xe64: 0x0018, 0xe65: 0x0018, 0xe66: 0x0018, 0xe67: 0x0018, 0xe68: 0x0018, 0xe69: 0x0018,\n\t0xe6a: 0x3308, 0xe6b: 0x3308, 0xe6c: 0x3308, 0xe6d: 0x3308, 0xe6e: 0x3018, 0xe6f: 0x3018,\n\t0xe70: 0x0018, 0xe71: 0x0018, 0xe72: 0x0018, 0xe73: 0x0018, 0xe74: 0x0018, 0xe75: 0x0018,\n\t0xe76: 0xe125, 0xe77: 0x0018, 0xe78: 0x29bd, 0xe79: 0x29dd, 0xe7a: 0x29fd, 0xe7b: 0x0018,\n\t0xe7c: 0x0008, 0xe7d: 0x0018, 0xe7e: 0x0018, 0xe7f: 0x0018,\n\t// Block 0x3a, offset 0xe80\n\t0xe80: 0x2b3d, 0xe81: 0x2b5d, 0xe82: 0x2b7d, 0xe83: 0x2b9d, 0xe84: 0x2bbd, 0xe85: 0x2bdd,\n\t0xe86: 0x2bdd, 0xe87: 0x2bdd, 0xe88: 0x2bfd, 0xe89: 0x2bfd, 0xe8a: 0x2bfd, 0xe8b: 0x2bfd,\n\t0xe8c: 0x2c1d, 0xe8d: 0x2c1d, 0xe8e: 0x2c1d, 0xe8f: 0x2c3d, 0xe90: 0x2c5d, 0xe91: 0x2c5d,\n\t0xe92: 0x2a7d, 0xe93: 0x2a7d, 0xe94: 0x2c5d, 0xe95: 0x2c5d, 0xe96: 0x2c7d, 0xe97: 0x2c7d,\n\t0xe98: 0x2c5d, 0xe99: 0x2c5d, 0xe9a: 0x2a7d, 0xe9b: 0x2a7d, 0xe9c: 0x2c5d, 0xe9d: 0x2c5d,\n\t0xe9e: 0x2c3d, 0xe9f: 0x2c3d, 0xea0: 0x2c9d, 0xea1: 0x2c9d, 0xea2: 0x2cbd, 0xea3: 0x2cbd,\n\t0xea4: 0x0040, 0xea5: 0x2cdd, 0xea6: 0x2cfd, 0xea7: 0x2d1d, 0xea8: 0x2d1d, 0xea9: 0x2d3d,\n\t0xeaa: 0x2d5d, 0xeab: 0x2d7d, 0xeac: 0x2d9d, 0xead: 0x2dbd, 0xeae: 0x2ddd, 0xeaf: 0x2dfd,\n\t0xeb0: 0x2e1d, 0xeb1: 0x2e3d, 0xeb2: 0x2e3d, 0xeb3: 0x2e5d, 0xeb4: 0x2e7d, 0xeb5: 0x2e7d,\n\t0xeb6: 0x2e9d, 0xeb7: 0x2ebd, 0xeb8: 0x2e5d, 0xeb9: 0x2edd, 0xeba: 0x2efd, 0xebb: 0x2edd,\n\t0xebc: 0x2e5d, 0xebd: 0x2f1d, 0xebe: 0x2f3d, 0xebf: 0x2f5d,\n\t// Block 0x3b, offset 0xec0\n\t0xec0: 0x2f7d, 0xec1: 0x2f9d, 0xec2: 0x2cfd, 0xec3: 0x2cdd, 0xec4: 0x2fbd, 0xec5: 0x2fdd,\n\t0xec6: 0x2ffd, 0xec7: 0x301d, 0xec8: 0x303d, 0xec9: 0x305d, 0xeca: 0x307d, 0xecb: 0x309d,\n\t0xecc: 0x30bd, 0xecd: 0x30dd, 0xece: 0x30fd, 0xecf: 0x0040, 0xed0: 0x0018, 0xed1: 0x0018,\n\t0xed2: 0x311d, 0xed3: 0x313d, 0xed4: 0x315d, 0xed5: 0x317d, 0xed6: 0x319d, 0xed7: 0x31bd,\n\t0xed8: 0x31dd, 0xed9: 0x31fd, 0xeda: 0x321d, 0xedb: 0x323d, 0xedc: 0x315d, 0xedd: 0x325d,\n\t0xede: 0x327d, 0xedf: 0x329d, 0xee0: 0x0008, 0xee1: 0x0008, 0xee2: 0x0008, 0xee3: 0x0008,\n\t0xee4: 0x0008, 0xee5: 0x0008, 0xee6: 0x0008, 0xee7: 0x0008, 0xee8: 0x0008, 0xee9: 0x0008,\n\t0xeea: 0x0008, 0xeeb: 0x0008, 0xeec: 0x0008, 0xeed: 0x0008, 0xeee: 0x0008, 0xeef: 0x0008,\n\t0xef0: 0x0008, 0xef1: 0x0008, 0xef2: 0x0008, 0xef3: 0x0008, 0xef4: 0x0008, 0xef5: 0x0008,\n\t0xef6: 0x0008, 0xef7: 0x0008, 0xef8: 0x0008, 0xef9: 0x0008, 0xefa: 0x0008, 0xefb: 0x0040,\n\t0xefc: 0x0040, 0xefd: 0x0040, 0xefe: 0x0040, 0xeff: 0x0040,\n\t// Block 0x3c, offset 0xf00\n\t0xf00: 0x36a2, 0xf01: 0x36d2, 0xf02: 0x3702, 0xf03: 0x3732, 0xf04: 0x32bd, 0xf05: 0x32dd,\n\t0xf06: 0x32fd, 0xf07: 0x331d, 0xf08: 0x0018, 0xf09: 0x0018, 0xf0a: 0x0018, 0xf0b: 0x0018,\n\t0xf0c: 0x0018, 0xf0d: 0x0018, 0xf0e: 0x0018, 0xf0f: 0x0018, 0xf10: 0x333d, 0xf11: 0x3761,\n\t0xf12: 0x3779, 0xf13: 0x3791, 0xf14: 0x37a9, 0xf15: 0x37c1, 0xf16: 0x37d9, 0xf17: 0x37f1,\n\t0xf18: 0x3809, 0xf19: 0x3821, 0xf1a: 0x3839, 0xf1b: 0x3851, 0xf1c: 0x3869, 0xf1d: 0x3881,\n\t0xf1e: 0x3899, 0xf1f: 0x38b1, 0xf20: 0x335d, 0xf21: 0x337d, 0xf22: 0x339d, 0xf23: 0x33bd,\n\t0xf24: 0x33dd, 0xf25: 0x33dd, 0xf26: 0x33fd, 0xf27: 0x341d, 0xf28: 0x343d, 0xf29: 0x345d,\n\t0xf2a: 0x347d, 0xf2b: 0x349d, 0xf2c: 0x34bd, 0xf2d: 0x34dd, 0xf2e: 0x34fd, 0xf2f: 0x351d,\n\t0xf30: 0x353d, 0xf31: 0x355d, 0xf32: 0x357d, 0xf33: 0x359d, 0xf34: 0x35bd, 0xf35: 0x35dd,\n\t0xf36: 0x35fd, 0xf37: 0x361d, 0xf38: 0x363d, 0xf39: 0x365d, 0xf3a: 0x367d, 0xf3b: 0x369d,\n\t0xf3c: 0x38c9, 0xf3d: 0x3901, 0xf3e: 0x36bd, 0xf3f: 0x0018,\n\t// Block 0x3d, offset 0xf40\n\t0xf40: 0x36dd, 0xf41: 0x36fd, 0xf42: 0x371d, 0xf43: 0x373d, 0xf44: 0x375d, 0xf45: 0x377d,\n\t0xf46: 0x379d, 0xf47: 0x37bd, 0xf48: 0x37dd, 0xf49: 0x37fd, 0xf4a: 0x381d, 0xf4b: 0x383d,\n\t0xf4c: 0x385d, 0xf4d: 0x387d, 0xf4e: 0x389d, 0xf4f: 0x38bd, 0xf50: 0x38dd, 0xf51: 0x38fd,\n\t0xf52: 0x391d, 0xf53: 0x393d, 0xf54: 0x395d, 0xf55: 0x397d, 0xf56: 0x399d, 0xf57: 0x39bd,\n\t0xf58: 0x39dd, 0xf59: 0x39fd, 0xf5a: 0x3a1d, 0xf5b: 0x3a3d, 0xf5c: 0x3a5d, 0xf5d: 0x3a7d,\n\t0xf5e: 0x3a9d, 0xf5f: 0x3abd, 0xf60: 0x3add, 0xf61: 0x3afd, 0xf62: 0x3b1d, 0xf63: 0x3b3d,\n\t0xf64: 0x3b5d, 0xf65: 0x3b7d, 0xf66: 0x127d, 0xf67: 0x3b9d, 0xf68: 0x3bbd, 0xf69: 0x3bdd,\n\t0xf6a: 0x3bfd, 0xf6b: 0x3c1d, 0xf6c: 0x3c3d, 0xf6d: 0x3c5d, 0xf6e: 0x239d, 0xf6f: 0x3c7d,\n\t0xf70: 0x3c9d, 0xf71: 0x3939, 0xf72: 0x3951, 0xf73: 0x3969, 0xf74: 0x3981, 0xf75: 0x3999,\n\t0xf76: 0x39b1, 0xf77: 0x39c9, 0xf78: 0x39e1, 0xf79: 0x39f9, 0xf7a: 0x3a11, 0xf7b: 0x3a29,\n\t0xf7c: 0x3a41, 0xf7d: 0x3a59, 0xf7e: 0x3a71, 0xf7f: 0x3a89,\n\t// Block 0x3e, offset 0xf80\n\t0xf80: 0x3aa1, 0xf81: 0x3ac9, 0xf82: 0x3af1, 0xf83: 0x3b19, 0xf84: 0x3b41, 0xf85: 0x3b69,\n\t0xf86: 0x3b91, 0xf87: 0x3bb9, 0xf88: 0x3be1, 0xf89: 0x3c09, 0xf8a: 0x3c39, 0xf8b: 0x3c69,\n\t0xf8c: 0x3c99, 0xf8d: 0x3cbd, 0xf8e: 0x3cb1, 0xf8f: 0x3cdd, 0xf90: 0x3cfd, 0xf91: 0x3d15,\n\t0xf92: 0x3d2d, 0xf93: 0x3d45, 0xf94: 0x3d5d, 0xf95: 0x3d5d, 0xf96: 0x3d45, 0xf97: 0x3d75,\n\t0xf98: 0x07bd, 0xf99: 0x3d8d, 0xf9a: 0x3da5, 0xf9b: 0x3dbd, 0xf9c: 0x3dd5, 0xf9d: 0x3ded,\n\t0xf9e: 0x3e05, 0xf9f: 0x3e1d, 0xfa0: 0x3e35, 0xfa1: 0x3e4d, 0xfa2: 0x3e65, 0xfa3: 0x3e7d,\n\t0xfa4: 0x3e95, 0xfa5: 0x3e95, 0xfa6: 0x3ead, 0xfa7: 0x3ead, 0xfa8: 0x3ec5, 0xfa9: 0x3ec5,\n\t0xfaa: 0x3edd, 0xfab: 0x3ef5, 0xfac: 0x3f0d, 0xfad: 0x3f25, 0xfae: 0x3f3d, 0xfaf: 0x3f3d,\n\t0xfb0: 0x3f55, 0xfb1: 0x3f55, 0xfb2: 0x3f55, 0xfb3: 0x3f6d, 0xfb4: 0x3f85, 0xfb5: 0x3f9d,\n\t0xfb6: 0x3fb5, 0xfb7: 0x3f9d, 0xfb8: 0x3fcd, 0xfb9: 0x3fe5, 0xfba: 0x3f6d, 0xfbb: 0x3ffd,\n\t0xfbc: 0x4015, 0xfbd: 0x4015, 0xfbe: 0x4015, 0xfbf: 0x0040,\n\t// Block 0x3f, offset 0xfc0\n\t0xfc0: 0x3cc9, 0xfc1: 0x3d31, 0xfc2: 0x3d99, 0xfc3: 0x3e01, 0xfc4: 0x3e51, 0xfc5: 0x3eb9,\n\t0xfc6: 0x3f09, 0xfc7: 0x3f59, 0xfc8: 0x3fd9, 0xfc9: 0x4041, 0xfca: 0x4091, 0xfcb: 0x40e1,\n\t0xfcc: 0x4131, 0xfcd: 0x4199, 0xfce: 0x4201, 0xfcf: 0x4251, 0xfd0: 0x42a1, 0xfd1: 0x42d9,\n\t0xfd2: 0x4329, 0xfd3: 0x4391, 0xfd4: 0x43f9, 0xfd5: 0x4431, 0xfd6: 0x44b1, 0xfd7: 0x4549,\n\t0xfd8: 0x45c9, 0xfd9: 0x4619, 0xfda: 0x4699, 0xfdb: 0x4719, 0xfdc: 0x4781, 0xfdd: 0x47d1,\n\t0xfde: 0x4821, 0xfdf: 0x4871, 0xfe0: 0x48d9, 0xfe1: 0x4959, 0xfe2: 0x49c1, 0xfe3: 0x4a11,\n\t0xfe4: 0x4a61, 0xfe5: 0x4ab1, 0xfe6: 0x4ae9, 0xfe7: 0x4b21, 0xfe8: 0x4b59, 0xfe9: 0x4b91,\n\t0xfea: 0x4be1, 0xfeb: 0x4c31, 0xfec: 0x4cb1, 0xfed: 0x4d01, 0xfee: 0x4d69, 0xfef: 0x4de9,\n\t0xff0: 0x4e39, 0xff1: 0x4e71, 0xff2: 0x4ea9, 0xff3: 0x4f29, 0xff4: 0x4f91, 0xff5: 0x5011,\n\t0xff6: 0x5061, 0xff7: 0x50e1, 0xff8: 0x5119, 0xff9: 0x5169, 0xffa: 0x51b9, 0xffb: 0x5209,\n\t0xffc: 0x5259, 0xffd: 0x52a9, 0xffe: 0x5311, 0xfff: 0x5361,\n\t// Block 0x40, offset 0x1000\n\t0x1000: 0x5399, 0x1001: 0x53e9, 0x1002: 0x5439, 0x1003: 0x5489, 0x1004: 0x54f1, 0x1005: 0x5541,\n\t0x1006: 0x5591, 0x1007: 0x55e1, 0x1008: 0x5661, 0x1009: 0x56c9, 0x100a: 0x5701, 0x100b: 0x5781,\n\t0x100c: 0x57b9, 0x100d: 0x5821, 0x100e: 0x5889, 0x100f: 0x58d9, 0x1010: 0x5929, 0x1011: 0x5979,\n\t0x1012: 0x59e1, 0x1013: 0x5a19, 0x1014: 0x5a69, 0x1015: 0x5ad1, 0x1016: 0x5b09, 0x1017: 0x5b89,\n\t0x1018: 0x5bd9, 0x1019: 0x5c01, 0x101a: 0x5c29, 0x101b: 0x5c51, 0x101c: 0x5c79, 0x101d: 0x5ca1,\n\t0x101e: 0x5cc9, 0x101f: 0x5cf1, 0x1020: 0x5d19, 0x1021: 0x5d41, 0x1022: 0x5d69, 0x1023: 0x5d99,\n\t0x1024: 0x5dc9, 0x1025: 0x5df9, 0x1026: 0x5e29, 0x1027: 0x5e59, 0x1028: 0x5e89, 0x1029: 0x5eb9,\n\t0x102a: 0x5ee9, 0x102b: 0x5f19, 0x102c: 0x5f49, 0x102d: 0x5f79, 0x102e: 0x5fa9, 0x102f: 0x5fd9,\n\t0x1030: 0x6009, 0x1031: 0x402d, 0x1032: 0x6039, 0x1033: 0x6051, 0x1034: 0x404d, 0x1035: 0x6069,\n\t0x1036: 0x6081, 0x1037: 0x6099, 0x1038: 0x406d, 0x1039: 0x406d, 0x103a: 0x60b1, 0x103b: 0x60c9,\n\t0x103c: 0x6101, 0x103d: 0x6139, 0x103e: 0x6171, 0x103f: 0x61a9,\n\t// Block 0x41, offset 0x1040\n\t0x1040: 0x6211, 0x1041: 0x6229, 0x1042: 0x408d, 0x1043: 0x6241, 0x1044: 0x6259, 0x1045: 0x6271,\n\t0x1046: 0x6289, 0x1047: 0x62a1, 0x1048: 0x40ad, 0x1049: 0x62b9, 0x104a: 0x62e1, 0x104b: 0x62f9,\n\t0x104c: 0x40cd, 0x104d: 0x40cd, 0x104e: 0x6311, 0x104f: 0x6329, 0x1050: 0x6341, 0x1051: 0x40ed,\n\t0x1052: 0x410d, 0x1053: 0x412d, 0x1054: 0x414d, 0x1055: 0x416d, 0x1056: 0x6359, 0x1057: 0x6371,\n\t0x1058: 0x6389, 0x1059: 0x63a1, 0x105a: 0x63b9, 0x105b: 0x418d, 0x105c: 0x63d1, 0x105d: 0x63e9,\n\t0x105e: 0x6401, 0x105f: 0x41ad, 0x1060: 0x41cd, 0x1061: 0x6419, 0x1062: 0x41ed, 0x1063: 0x420d,\n\t0x1064: 0x422d, 0x1065: 0x6431, 0x1066: 0x424d, 0x1067: 0x6449, 0x1068: 0x6479, 0x1069: 0x6211,\n\t0x106a: 0x426d, 0x106b: 0x428d, 0x106c: 0x42ad, 0x106d: 0x42cd, 0x106e: 0x64b1, 0x106f: 0x64f1,\n\t0x1070: 0x6539, 0x1071: 0x6551, 0x1072: 0x42ed, 0x1073: 0x6569, 0x1074: 0x6581, 0x1075: 0x6599,\n\t0x1076: 0x430d, 0x1077: 0x65b1, 0x1078: 0x65c9, 0x1079: 0x65b1, 0x107a: 0x65e1, 0x107b: 0x65f9,\n\t0x107c: 0x432d, 0x107d: 0x6611, 0x107e: 0x6629, 0x107f: 0x6611,\n\t// Block 0x42, offset 0x1080\n\t0x1080: 0x434d, 0x1081: 0x436d, 0x1082: 0x0040, 0x1083: 0x6641, 0x1084: 0x6659, 0x1085: 0x6671,\n\t0x1086: 0x6689, 0x1087: 0x0040, 0x1088: 0x66c1, 0x1089: 0x66d9, 0x108a: 0x66f1, 0x108b: 0x6709,\n\t0x108c: 0x6721, 0x108d: 0x6739, 0x108e: 0x6401, 0x108f: 0x6751, 0x1090: 0x6769, 0x1091: 0x6781,\n\t0x1092: 0x438d, 0x1093: 0x6799, 0x1094: 0x6289, 0x1095: 0x43ad, 0x1096: 0x43cd, 0x1097: 0x67b1,\n\t0x1098: 0x0040, 0x1099: 0x43ed, 0x109a: 0x67c9, 0x109b: 0x67e1, 0x109c: 0x67f9, 0x109d: 0x6811,\n\t0x109e: 0x6829, 0x109f: 0x6859, 0x10a0: 0x6889, 0x10a1: 0x68b1, 0x10a2: 0x68d9, 0x10a3: 0x6901,\n\t0x10a4: 0x6929, 0x10a5: 0x6951, 0x10a6: 0x6979, 0x10a7: 0x69a1, 0x10a8: 0x69c9, 0x10a9: 0x69f1,\n\t0x10aa: 0x6a21, 0x10ab: 0x6a51, 0x10ac: 0x6a81, 0x10ad: 0x6ab1, 0x10ae: 0x6ae1, 0x10af: 0x6b11,\n\t0x10b0: 0x6b41, 0x10b1: 0x6b71, 0x10b2: 0x6ba1, 0x10b3: 0x6bd1, 0x10b4: 0x6c01, 0x10b5: 0x6c31,\n\t0x10b6: 0x6c61, 0x10b7: 0x6c91, 0x10b8: 0x6cc1, 0x10b9: 0x6cf1, 0x10ba: 0x6d21, 0x10bb: 0x6d51,\n\t0x10bc: 0x6d81, 0x10bd: 0x6db1, 0x10be: 0x6de1, 0x10bf: 0x440d,\n\t// Block 0x43, offset 0x10c0\n\t0x10c0: 0xe00d, 0x10c1: 0x0008, 0x10c2: 0xe00d, 0x10c3: 0x0008, 0x10c4: 0xe00d, 0x10c5: 0x0008,\n\t0x10c6: 0xe00d, 0x10c7: 0x0008, 0x10c8: 0xe00d, 0x10c9: 0x0008, 0x10ca: 0xe00d, 0x10cb: 0x0008,\n\t0x10cc: 0xe00d, 0x10cd: 0x0008, 0x10ce: 0xe00d, 0x10cf: 0x0008, 0x10d0: 0xe00d, 0x10d1: 0x0008,\n\t0x10d2: 0xe00d, 0x10d3: 0x0008, 0x10d4: 0xe00d, 0x10d5: 0x0008, 0x10d6: 0xe00d, 0x10d7: 0x0008,\n\t0x10d8: 0xe00d, 0x10d9: 0x0008, 0x10da: 0xe00d, 0x10db: 0x0008, 0x10dc: 0xe00d, 0x10dd: 0x0008,\n\t0x10de: 0xe00d, 0x10df: 0x0008, 0x10e0: 0xe00d, 0x10e1: 0x0008, 0x10e2: 0xe00d, 0x10e3: 0x0008,\n\t0x10e4: 0xe00d, 0x10e5: 0x0008, 0x10e6: 0xe00d, 0x10e7: 0x0008, 0x10e8: 0xe00d, 0x10e9: 0x0008,\n\t0x10ea: 0xe00d, 0x10eb: 0x0008, 0x10ec: 0xe00d, 0x10ed: 0x0008, 0x10ee: 0x0008, 0x10ef: 0x3308,\n\t0x10f0: 0x3318, 0x10f1: 0x3318, 0x10f2: 0x3318, 0x10f3: 0x0018, 0x10f4: 0x3308, 0x10f5: 0x3308,\n\t0x10f6: 0x3308, 0x10f7: 0x3308, 0x10f8: 0x3308, 0x10f9: 0x3308, 0x10fa: 0x3308, 0x10fb: 0x3308,\n\t0x10fc: 0x3308, 0x10fd: 0x3308, 0x10fe: 0x0018, 0x10ff: 0x0008,\n\t// Block 0x44, offset 0x1100\n\t0x1100: 0xe00d, 0x1101: 0x0008, 0x1102: 0xe00d, 0x1103: 0x0008, 0x1104: 0xe00d, 0x1105: 0x0008,\n\t0x1106: 0xe00d, 0x1107: 0x0008, 0x1108: 0xe00d, 0x1109: 0x0008, 0x110a: 0xe00d, 0x110b: 0x0008,\n\t0x110c: 0xe00d, 0x110d: 0x0008, 0x110e: 0xe00d, 0x110f: 0x0008, 0x1110: 0xe00d, 0x1111: 0x0008,\n\t0x1112: 0xe00d, 0x1113: 0x0008, 0x1114: 0xe00d, 0x1115: 0x0008, 0x1116: 0xe00d, 0x1117: 0x0008,\n\t0x1118: 0xe00d, 0x1119: 0x0008, 0x111a: 0xe00d, 0x111b: 0x0008, 0x111c: 0x0ea1, 0x111d: 0x6e11,\n\t0x111e: 0x3308, 0x111f: 0x3308, 0x1120: 0x0008, 0x1121: 0x0008, 0x1122: 0x0008, 0x1123: 0x0008,\n\t0x1124: 0x0008, 0x1125: 0x0008, 0x1126: 0x0008, 0x1127: 0x0008, 0x1128: 0x0008, 0x1129: 0x0008,\n\t0x112a: 0x0008, 0x112b: 0x0008, 0x112c: 0x0008, 0x112d: 0x0008, 0x112e: 0x0008, 0x112f: 0x0008,\n\t0x1130: 0x0008, 0x1131: 0x0008, 0x1132: 0x0008, 0x1133: 0x0008, 0x1134: 0x0008, 0x1135: 0x0008,\n\t0x1136: 0x0008, 0x1137: 0x0008, 0x1138: 0x0008, 0x1139: 0x0008, 0x113a: 0x0008, 0x113b: 0x0008,\n\t0x113c: 0x0008, 0x113d: 0x0008, 0x113e: 0x0008, 0x113f: 0x0008,\n\t// Block 0x45, offset 0x1140\n\t0x1140: 0x0018, 0x1141: 0x0018, 0x1142: 0x0018, 0x1143: 0x0018, 0x1144: 0x0018, 0x1145: 0x0018,\n\t0x1146: 0x0018, 0x1147: 0x0018, 0x1148: 0x0018, 0x1149: 0x0018, 0x114a: 0x0018, 0x114b: 0x0018,\n\t0x114c: 0x0018, 0x114d: 0x0018, 0x114e: 0x0018, 0x114f: 0x0018, 0x1150: 0x0018, 0x1151: 0x0018,\n\t0x1152: 0x0018, 0x1153: 0x0018, 0x1154: 0x0018, 0x1155: 0x0018, 0x1156: 0x0018, 0x1157: 0x0008,\n\t0x1158: 0x0008, 0x1159: 0x0008, 0x115a: 0x0008, 0x115b: 0x0008, 0x115c: 0x0008, 0x115d: 0x0008,\n\t0x115e: 0x0008, 0x115f: 0x0008, 0x1160: 0x0018, 0x1161: 0x0018, 0x1162: 0xe00d, 0x1163: 0x0008,\n\t0x1164: 0xe00d, 0x1165: 0x0008, 0x1166: 0xe00d, 0x1167: 0x0008, 0x1168: 0xe00d, 0x1169: 0x0008,\n\t0x116a: 0xe00d, 0x116b: 0x0008, 0x116c: 0xe00d, 0x116d: 0x0008, 0x116e: 0xe00d, 0x116f: 0x0008,\n\t0x1170: 0x0008, 0x1171: 0x0008, 0x1172: 0xe00d, 0x1173: 0x0008, 0x1174: 0xe00d, 0x1175: 0x0008,\n\t0x1176: 0xe00d, 0x1177: 0x0008, 0x1178: 0xe00d, 0x1179: 0x0008, 0x117a: 0xe00d, 0x117b: 0x0008,\n\t0x117c: 0xe00d, 0x117d: 0x0008, 0x117e: 0xe00d, 0x117f: 0x0008,\n\t// Block 0x46, offset 0x1180\n\t0x1180: 0xe00d, 0x1181: 0x0008, 0x1182: 0xe00d, 0x1183: 0x0008, 0x1184: 0xe00d, 0x1185: 0x0008,\n\t0x1186: 0xe00d, 0x1187: 0x0008, 0x1188: 0xe00d, 0x1189: 0x0008, 0x118a: 0xe00d, 0x118b: 0x0008,\n\t0x118c: 0xe00d, 0x118d: 0x0008, 0x118e: 0xe00d, 0x118f: 0x0008, 0x1190: 0xe00d, 0x1191: 0x0008,\n\t0x1192: 0xe00d, 0x1193: 0x0008, 0x1194: 0xe00d, 0x1195: 0x0008, 0x1196: 0xe00d, 0x1197: 0x0008,\n\t0x1198: 0xe00d, 0x1199: 0x0008, 0x119a: 0xe00d, 0x119b: 0x0008, 0x119c: 0xe00d, 0x119d: 0x0008,\n\t0x119e: 0xe00d, 0x119f: 0x0008, 0x11a0: 0xe00d, 0x11a1: 0x0008, 0x11a2: 0xe00d, 0x11a3: 0x0008,\n\t0x11a4: 0xe00d, 0x11a5: 0x0008, 0x11a6: 0xe00d, 0x11a7: 0x0008, 0x11a8: 0xe00d, 0x11a9: 0x0008,\n\t0x11aa: 0xe00d, 0x11ab: 0x0008, 0x11ac: 0xe00d, 0x11ad: 0x0008, 0x11ae: 0xe00d, 0x11af: 0x0008,\n\t0x11b0: 0xe0fd, 0x11b1: 0x0008, 0x11b2: 0x0008, 0x11b3: 0x0008, 0x11b4: 0x0008, 0x11b5: 0x0008,\n\t0x11b6: 0x0008, 0x11b7: 0x0008, 0x11b8: 0x0008, 0x11b9: 0xe01d, 0x11ba: 0x0008, 0x11bb: 0xe03d,\n\t0x11bc: 0x0008, 0x11bd: 0x442d, 0x11be: 0xe00d, 0x11bf: 0x0008,\n\t// Block 0x47, offset 0x11c0\n\t0x11c0: 0xe00d, 0x11c1: 0x0008, 0x11c2: 0xe00d, 0x11c3: 0x0008, 0x11c4: 0xe00d, 0x11c5: 0x0008,\n\t0x11c6: 0xe00d, 0x11c7: 0x0008, 0x11c8: 0x0008, 0x11c9: 0x0018, 0x11ca: 0x0018, 0x11cb: 0xe03d,\n\t0x11cc: 0x0008, 0x11cd: 0x11d9, 0x11ce: 0x0008, 0x11cf: 0x0008, 0x11d0: 0xe00d, 0x11d1: 0x0008,\n\t0x11d2: 0xe00d, 0x11d3: 0x0008, 0x11d4: 0x0008, 0x11d5: 0x0008, 0x11d6: 0xe00d, 0x11d7: 0x0008,\n\t0x11d8: 0xe00d, 0x11d9: 0x0008, 0x11da: 0xe00d, 0x11db: 0x0008, 0x11dc: 0xe00d, 0x11dd: 0x0008,\n\t0x11de: 0xe00d, 0x11df: 0x0008, 0x11e0: 0xe00d, 0x11e1: 0x0008, 0x11e2: 0xe00d, 0x11e3: 0x0008,\n\t0x11e4: 0xe00d, 0x11e5: 0x0008, 0x11e6: 0xe00d, 0x11e7: 0x0008, 0x11e8: 0xe00d, 0x11e9: 0x0008,\n\t0x11ea: 0x6e29, 0x11eb: 0x1029, 0x11ec: 0x11c1, 0x11ed: 0x6e41, 0x11ee: 0x1221, 0x11ef: 0x0040,\n\t0x11f0: 0x6e59, 0x11f1: 0x6e71, 0x11f2: 0x1239, 0x11f3: 0x444d, 0x11f4: 0xe00d, 0x11f5: 0x0008,\n\t0x11f6: 0xe00d, 0x11f7: 0x0008, 0x11f8: 0x0040, 0x11f9: 0x0040, 0x11fa: 0x0040, 0x11fb: 0x0040,\n\t0x11fc: 0x0040, 0x11fd: 0x0040, 0x11fe: 0x0040, 0x11ff: 0x0040,\n\t// Block 0x48, offset 0x1200\n\t0x1200: 0x64d5, 0x1201: 0x64f5, 0x1202: 0x6515, 0x1203: 0x6535, 0x1204: 0x6555, 0x1205: 0x6575,\n\t0x1206: 0x6595, 0x1207: 0x65b5, 0x1208: 0x65d5, 0x1209: 0x65f5, 0x120a: 0x6615, 0x120b: 0x6635,\n\t0x120c: 0x6655, 0x120d: 0x6675, 0x120e: 0x0008, 0x120f: 0x0008, 0x1210: 0x6695, 0x1211: 0x0008,\n\t0x1212: 0x66b5, 0x1213: 0x0008, 0x1214: 0x0008, 0x1215: 0x66d5, 0x1216: 0x66f5, 0x1217: 0x6715,\n\t0x1218: 0x6735, 0x1219: 0x6755, 0x121a: 0x6775, 0x121b: 0x6795, 0x121c: 0x67b5, 0x121d: 0x67d5,\n\t0x121e: 0x67f5, 0x121f: 0x0008, 0x1220: 0x6815, 0x1221: 0x0008, 0x1222: 0x6835, 0x1223: 0x0008,\n\t0x1224: 0x0008, 0x1225: 0x6855, 0x1226: 0x6875, 0x1227: 0x0008, 0x1228: 0x0008, 0x1229: 0x0008,\n\t0x122a: 0x6895, 0x122b: 0x68b5, 0x122c: 0x68d5, 0x122d: 0x68f5, 0x122e: 0x6915, 0x122f: 0x6935,\n\t0x1230: 0x6955, 0x1231: 0x6975, 0x1232: 0x6995, 0x1233: 0x69b5, 0x1234: 0x69d5, 0x1235: 0x69f5,\n\t0x1236: 0x6a15, 0x1237: 0x6a35, 0x1238: 0x6a55, 0x1239: 0x6a75, 0x123a: 0x6a95, 0x123b: 0x6ab5,\n\t0x123c: 0x6ad5, 0x123d: 0x6af5, 0x123e: 0x6b15, 0x123f: 0x6b35,\n\t// Block 0x49, offset 0x1240\n\t0x1240: 0x7a95, 0x1241: 0x7ab5, 0x1242: 0x7ad5, 0x1243: 0x7af5, 0x1244: 0x7b15, 0x1245: 0x7b35,\n\t0x1246: 0x7b55, 0x1247: 0x7b75, 0x1248: 0x7b95, 0x1249: 0x7bb5, 0x124a: 0x7bd5, 0x124b: 0x7bf5,\n\t0x124c: 0x7c15, 0x124d: 0x7c35, 0x124e: 0x7c55, 0x124f: 0x6ec9, 0x1250: 0x6ef1, 0x1251: 0x6f19,\n\t0x1252: 0x7c75, 0x1253: 0x7c95, 0x1254: 0x7cb5, 0x1255: 0x6f41, 0x1256: 0x6f69, 0x1257: 0x6f91,\n\t0x1258: 0x7cd5, 0x1259: 0x7cf5, 0x125a: 0x0040, 0x125b: 0x0040, 0x125c: 0x0040, 0x125d: 0x0040,\n\t0x125e: 0x0040, 0x125f: 0x0040, 0x1260: 0x0040, 0x1261: 0x0040, 0x1262: 0x0040, 0x1263: 0x0040,\n\t0x1264: 0x0040, 0x1265: 0x0040, 0x1266: 0x0040, 0x1267: 0x0040, 0x1268: 0x0040, 0x1269: 0x0040,\n\t0x126a: 0x0040, 0x126b: 0x0040, 0x126c: 0x0040, 0x126d: 0x0040, 0x126e: 0x0040, 0x126f: 0x0040,\n\t0x1270: 0x0040, 0x1271: 0x0040, 0x1272: 0x0040, 0x1273: 0x0040, 0x1274: 0x0040, 0x1275: 0x0040,\n\t0x1276: 0x0040, 0x1277: 0x0040, 0x1278: 0x0040, 0x1279: 0x0040, 0x127a: 0x0040, 0x127b: 0x0040,\n\t0x127c: 0x0040, 0x127d: 0x0040, 0x127e: 0x0040, 0x127f: 0x0040,\n\t// Block 0x4a, offset 0x1280\n\t0x1280: 0x6fb9, 0x1281: 0x6fd1, 0x1282: 0x6fe9, 0x1283: 0x7d15, 0x1284: 0x7d35, 0x1285: 0x7001,\n\t0x1286: 0x7001, 0x1287: 0x0040, 0x1288: 0x0040, 0x1289: 0x0040, 0x128a: 0x0040, 0x128b: 0x0040,\n\t0x128c: 0x0040, 0x128d: 0x0040, 0x128e: 0x0040, 0x128f: 0x0040, 0x1290: 0x0040, 0x1291: 0x0040,\n\t0x1292: 0x0040, 0x1293: 0x7019, 0x1294: 0x7041, 0x1295: 0x7069, 0x1296: 0x7091, 0x1297: 0x70b9,\n\t0x1298: 0x0040, 0x1299: 0x0040, 0x129a: 0x0040, 0x129b: 0x0040, 0x129c: 0x0040, 0x129d: 0x70e1,\n\t0x129e: 0x3308, 0x129f: 0x7109, 0x12a0: 0x7131, 0x12a1: 0x20a9, 0x12a2: 0x20f1, 0x12a3: 0x7149,\n\t0x12a4: 0x7161, 0x12a5: 0x7179, 0x12a6: 0x7191, 0x12a7: 0x71a9, 0x12a8: 0x71c1, 0x12a9: 0x1fb2,\n\t0x12aa: 0x71d9, 0x12ab: 0x7201, 0x12ac: 0x7229, 0x12ad: 0x7261, 0x12ae: 0x7299, 0x12af: 0x72c1,\n\t0x12b0: 0x72e9, 0x12b1: 0x7311, 0x12b2: 0x7339, 0x12b3: 0x7361, 0x12b4: 0x7389, 0x12b5: 0x73b1,\n\t0x12b6: 0x73d9, 0x12b7: 0x0040, 0x12b8: 0x7401, 0x12b9: 0x7429, 0x12ba: 0x7451, 0x12bb: 0x7479,\n\t0x12bc: 0x74a1, 0x12bd: 0x0040, 0x12be: 0x74c9, 0x12bf: 0x0040,\n\t// Block 0x4b, offset 0x12c0\n\t0x12c0: 0x74f1, 0x12c1: 0x7519, 0x12c2: 0x0040, 0x12c3: 0x7541, 0x12c4: 0x7569, 0x12c5: 0x0040,\n\t0x12c6: 0x7591, 0x12c7: 0x75b9, 0x12c8: 0x75e1, 0x12c9: 0x7609, 0x12ca: 0x7631, 0x12cb: 0x7659,\n\t0x12cc: 0x7681, 0x12cd: 0x76a9, 0x12ce: 0x76d1, 0x12cf: 0x76f9, 0x12d0: 0x7721, 0x12d1: 0x7721,\n\t0x12d2: 0x7739, 0x12d3: 0x7739, 0x12d4: 0x7739, 0x12d5: 0x7739, 0x12d6: 0x7751, 0x12d7: 0x7751,\n\t0x12d8: 0x7751, 0x12d9: 0x7751, 0x12da: 0x7769, 0x12db: 0x7769, 0x12dc: 0x7769, 0x12dd: 0x7769,\n\t0x12de: 0x7781, 0x12df: 0x7781, 0x12e0: 0x7781, 0x12e1: 0x7781, 0x12e2: 0x7799, 0x12e3: 0x7799,\n\t0x12e4: 0x7799, 0x12e5: 0x7799, 0x12e6: 0x77b1, 0x12e7: 0x77b1, 0x12e8: 0x77b1, 0x12e9: 0x77b1,\n\t0x12ea: 0x77c9, 0x12eb: 0x77c9, 0x12ec: 0x77c9, 0x12ed: 0x77c9, 0x12ee: 0x77e1, 0x12ef: 0x77e1,\n\t0x12f0: 0x77e1, 0x12f1: 0x77e1, 0x12f2: 0x77f9, 0x12f3: 0x77f9, 0x12f4: 0x77f9, 0x12f5: 0x77f9,\n\t0x12f6: 0x7811, 0x12f7: 0x7811, 0x12f8: 0x7811, 0x12f9: 0x7811, 0x12fa: 0x7829, 0x12fb: 0x7829,\n\t0x12fc: 0x7829, 0x12fd: 0x7829, 0x12fe: 0x7841, 0x12ff: 0x7841,\n\t// Block 0x4c, offset 0x1300\n\t0x1300: 0x7841, 0x1301: 0x7841, 0x1302: 0x7859, 0x1303: 0x7859, 0x1304: 0x7871, 0x1305: 0x7871,\n\t0x1306: 0x7889, 0x1307: 0x7889, 0x1308: 0x78a1, 0x1309: 0x78a1, 0x130a: 0x78b9, 0x130b: 0x78b9,\n\t0x130c: 0x78d1, 0x130d: 0x78d1, 0x130e: 0x78e9, 0x130f: 0x78e9, 0x1310: 0x78e9, 0x1311: 0x78e9,\n\t0x1312: 0x7901, 0x1313: 0x7901, 0x1314: 0x7901, 0x1315: 0x7901, 0x1316: 0x7919, 0x1317: 0x7919,\n\t0x1318: 0x7919, 0x1319: 0x7919, 0x131a: 0x7931, 0x131b: 0x7931, 0x131c: 0x7931, 0x131d: 0x7931,\n\t0x131e: 0x7949, 0x131f: 0x7949, 0x1320: 0x7961, 0x1321: 0x7961, 0x1322: 0x7961, 0x1323: 0x7961,\n\t0x1324: 0x7979, 0x1325: 0x7979, 0x1326: 0x7991, 0x1327: 0x7991, 0x1328: 0x7991, 0x1329: 0x7991,\n\t0x132a: 0x79a9, 0x132b: 0x79a9, 0x132c: 0x79a9, 0x132d: 0x79a9, 0x132e: 0x79c1, 0x132f: 0x79c1,\n\t0x1330: 0x79d9, 0x1331: 0x79d9, 0x1332: 0x0818, 0x1333: 0x0818, 0x1334: 0x0818, 0x1335: 0x0818,\n\t0x1336: 0x0818, 0x1337: 0x0818, 0x1338: 0x0818, 0x1339: 0x0818, 0x133a: 0x0818, 0x133b: 0x0818,\n\t0x133c: 0x0818, 0x133d: 0x0818, 0x133e: 0x0818, 0x133f: 0x0818,\n\t// Block 0x4d, offset 0x1340\n\t0x1340: 0x0818, 0x1341: 0x0818, 0x1342: 0x0040, 0x1343: 0x0040, 0x1344: 0x0040, 0x1345: 0x0040,\n\t0x1346: 0x0040, 0x1347: 0x0040, 0x1348: 0x0040, 0x1349: 0x0040, 0x134a: 0x0040, 0x134b: 0x0040,\n\t0x134c: 0x0040, 0x134d: 0x0040, 0x134e: 0x0040, 0x134f: 0x0040, 0x1350: 0x0040, 0x1351: 0x0040,\n\t0x1352: 0x0040, 0x1353: 0x79f1, 0x1354: 0x79f1, 0x1355: 0x79f1, 0x1356: 0x79f1, 0x1357: 0x7a09,\n\t0x1358: 0x7a09, 0x1359: 0x7a21, 0x135a: 0x7a21, 0x135b: 0x7a39, 0x135c: 0x7a39, 0x135d: 0x0479,\n\t0x135e: 0x7a51, 0x135f: 0x7a51, 0x1360: 0x7a69, 0x1361: 0x7a69, 0x1362: 0x7a81, 0x1363: 0x7a81,\n\t0x1364: 0x7a99, 0x1365: 0x7a99, 0x1366: 0x7a99, 0x1367: 0x7a99, 0x1368: 0x7ab1, 0x1369: 0x7ab1,\n\t0x136a: 0x7ac9, 0x136b: 0x7ac9, 0x136c: 0x7af1, 0x136d: 0x7af1, 0x136e: 0x7b19, 0x136f: 0x7b19,\n\t0x1370: 0x7b41, 0x1371: 0x7b41, 0x1372: 0x7b69, 0x1373: 0x7b69, 0x1374: 0x7b91, 0x1375: 0x7b91,\n\t0x1376: 0x7bb9, 0x1377: 0x7bb9, 0x1378: 0x7bb9, 0x1379: 0x7be1, 0x137a: 0x7be1, 0x137b: 0x7be1,\n\t0x137c: 0x7c09, 0x137d: 0x7c09, 0x137e: 0x7c09, 0x137f: 0x7c09,\n\t// Block 0x4e, offset 0x1380\n\t0x1380: 0x85f9, 0x1381: 0x8621, 0x1382: 0x8649, 0x1383: 0x8671, 0x1384: 0x8699, 0x1385: 0x86c1,\n\t0x1386: 0x86e9, 0x1387: 0x8711, 0x1388: 0x8739, 0x1389: 0x8761, 0x138a: 0x8789, 0x138b: 0x87b1,\n\t0x138c: 0x87d9, 0x138d: 0x8801, 0x138e: 0x8829, 0x138f: 0x8851, 0x1390: 0x8879, 0x1391: 0x88a1,\n\t0x1392: 0x88c9, 0x1393: 0x88f1, 0x1394: 0x8919, 0x1395: 0x8941, 0x1396: 0x8969, 0x1397: 0x8991,\n\t0x1398: 0x89b9, 0x1399: 0x89e1, 0x139a: 0x8a09, 0x139b: 0x8a31, 0x139c: 0x8a59, 0x139d: 0x8a81,\n\t0x139e: 0x8aaa, 0x139f: 0x8ada, 0x13a0: 0x8b0a, 0x13a1: 0x8b3a, 0x13a2: 0x8b6a, 0x13a3: 0x8b9a,\n\t0x13a4: 0x8bc9, 0x13a5: 0x8bf1, 0x13a6: 0x7c71, 0x13a7: 0x8c19, 0x13a8: 0x7be1, 0x13a9: 0x7c99,\n\t0x13aa: 0x8c41, 0x13ab: 0x8c69, 0x13ac: 0x7d39, 0x13ad: 0x8c91, 0x13ae: 0x7d61, 0x13af: 0x7d89,\n\t0x13b0: 0x8cb9, 0x13b1: 0x8ce1, 0x13b2: 0x7e29, 0x13b3: 0x8d09, 0x13b4: 0x7e51, 0x13b5: 0x7e79,\n\t0x13b6: 0x8d31, 0x13b7: 0x8d59, 0x13b8: 0x7ec9, 0x13b9: 0x8d81, 0x13ba: 0x7ef1, 0x13bb: 0x7f19,\n\t0x13bc: 0x83a1, 0x13bd: 0x83c9, 0x13be: 0x8441, 0x13bf: 0x8469,\n\t// Block 0x4f, offset 0x13c0\n\t0x13c0: 0x8491, 0x13c1: 0x8531, 0x13c2: 0x8559, 0x13c3: 0x8581, 0x13c4: 0x85a9, 0x13c5: 0x8649,\n\t0x13c6: 0x8671, 0x13c7: 0x8699, 0x13c8: 0x8da9, 0x13c9: 0x8739, 0x13ca: 0x8dd1, 0x13cb: 0x8df9,\n\t0x13cc: 0x8829, 0x13cd: 0x8e21, 0x13ce: 0x8851, 0x13cf: 0x8879, 0x13d0: 0x8a81, 0x13d1: 0x8e49,\n\t0x13d2: 0x8e71, 0x13d3: 0x89b9, 0x13d4: 0x8e99, 0x13d5: 0x89e1, 0x13d6: 0x8a09, 0x13d7: 0x7c21,\n\t0x13d8: 0x7c49, 0x13d9: 0x8ec1, 0x13da: 0x7c71, 0x13db: 0x8ee9, 0x13dc: 0x7cc1, 0x13dd: 0x7ce9,\n\t0x13de: 0x7d11, 0x13df: 0x7d39, 0x13e0: 0x8f11, 0x13e1: 0x7db1, 0x13e2: 0x7dd9, 0x13e3: 0x7e01,\n\t0x13e4: 0x7e29, 0x13e5: 0x8f39, 0x13e6: 0x7ec9, 0x13e7: 0x7f41, 0x13e8: 0x7f69, 0x13e9: 0x7f91,\n\t0x13ea: 0x7fb9, 0x13eb: 0x7fe1, 0x13ec: 0x8031, 0x13ed: 0x8059, 0x13ee: 0x8081, 0x13ef: 0x80a9,\n\t0x13f0: 0x80d1, 0x13f1: 0x80f9, 0x13f2: 0x8f61, 0x13f3: 0x8121, 0x13f4: 0x8149, 0x13f5: 0x8171,\n\t0x13f6: 0x8199, 0x13f7: 0x81c1, 0x13f8: 0x81e9, 0x13f9: 0x8239, 0x13fa: 0x8261, 0x13fb: 0x8289,\n\t0x13fc: 0x82b1, 0x13fd: 0x82d9, 0x13fe: 0x8301, 0x13ff: 0x8329,\n\t// Block 0x50, offset 0x1400\n\t0x1400: 0x8351, 0x1401: 0x8379, 0x1402: 0x83f1, 0x1403: 0x8419, 0x1404: 0x84b9, 0x1405: 0x84e1,\n\t0x1406: 0x8509, 0x1407: 0x8531, 0x1408: 0x8559, 0x1409: 0x85d1, 0x140a: 0x85f9, 0x140b: 0x8621,\n\t0x140c: 0x8649, 0x140d: 0x8f89, 0x140e: 0x86c1, 0x140f: 0x86e9, 0x1410: 0x8711, 0x1411: 0x8739,\n\t0x1412: 0x87b1, 0x1413: 0x87d9, 0x1414: 0x8801, 0x1415: 0x8829, 0x1416: 0x8fb1, 0x1417: 0x88a1,\n\t0x1418: 0x88c9, 0x1419: 0x8fd9, 0x141a: 0x8941, 0x141b: 0x8969, 0x141c: 0x8991, 0x141d: 0x89b9,\n\t0x141e: 0x9001, 0x141f: 0x7c71, 0x1420: 0x8ee9, 0x1421: 0x7d39, 0x1422: 0x8f11, 0x1423: 0x7e29,\n\t0x1424: 0x8f39, 0x1425: 0x7ec9, 0x1426: 0x9029, 0x1427: 0x80d1, 0x1428: 0x9051, 0x1429: 0x9079,\n\t0x142a: 0x90a1, 0x142b: 0x8531, 0x142c: 0x8559, 0x142d: 0x8649, 0x142e: 0x8829, 0x142f: 0x8fb1,\n\t0x1430: 0x89b9, 0x1431: 0x9001, 0x1432: 0x90c9, 0x1433: 0x9101, 0x1434: 0x9139, 0x1435: 0x9171,\n\t0x1436: 0x9199, 0x1437: 0x91c1, 0x1438: 0x91e9, 0x1439: 0x9211, 0x143a: 0x9239, 0x143b: 0x9261,\n\t0x143c: 0x9289, 0x143d: 0x92b1, 0x143e: 0x92d9, 0x143f: 0x9301,\n\t// Block 0x51, offset 0x1440\n\t0x1440: 0x9329, 0x1441: 0x9351, 0x1442: 0x9379, 0x1443: 0x93a1, 0x1444: 0x93c9, 0x1445: 0x93f1,\n\t0x1446: 0x9419, 0x1447: 0x9441, 0x1448: 0x9469, 0x1449: 0x9491, 0x144a: 0x94b9, 0x144b: 0x94e1,\n\t0x144c: 0x9079, 0x144d: 0x9509, 0x144e: 0x9531, 0x144f: 0x9559, 0x1450: 0x9581, 0x1451: 0x9171,\n\t0x1452: 0x9199, 0x1453: 0x91c1, 0x1454: 0x91e9, 0x1455: 0x9211, 0x1456: 0x9239, 0x1457: 0x9261,\n\t0x1458: 0x9289, 0x1459: 0x92b1, 0x145a: 0x92d9, 0x145b: 0x9301, 0x145c: 0x9329, 0x145d: 0x9351,\n\t0x145e: 0x9379, 0x145f: 0x93a1, 0x1460: 0x93c9, 0x1461: 0x93f1, 0x1462: 0x9419, 0x1463: 0x9441,\n\t0x1464: 0x9469, 0x1465: 0x9491, 0x1466: 0x94b9, 0x1467: 0x94e1, 0x1468: 0x9079, 0x1469: 0x9509,\n\t0x146a: 0x9531, 0x146b: 0x9559, 0x146c: 0x9581, 0x146d: 0x9491, 0x146e: 0x94b9, 0x146f: 0x94e1,\n\t0x1470: 0x9079, 0x1471: 0x9051, 0x1472: 0x90a1, 0x1473: 0x8211, 0x1474: 0x8059, 0x1475: 0x8081,\n\t0x1476: 0x80a9, 0x1477: 0x9491, 0x1478: 0x94b9, 0x1479: 0x94e1, 0x147a: 0x8211, 0x147b: 0x8239,\n\t0x147c: 0x95a9, 0x147d: 0x95a9, 0x147e: 0x0018, 0x147f: 0x0018,\n\t// Block 0x52, offset 0x1480\n\t0x1480: 0x0040, 0x1481: 0x0040, 0x1482: 0x0040, 0x1483: 0x0040, 0x1484: 0x0040, 0x1485: 0x0040,\n\t0x1486: 0x0040, 0x1487: 0x0040, 0x1488: 0x0040, 0x1489: 0x0040, 0x148a: 0x0040, 0x148b: 0x0040,\n\t0x148c: 0x0040, 0x148d: 0x0040, 0x148e: 0x0040, 0x148f: 0x0040, 0x1490: 0x95d1, 0x1491: 0x9609,\n\t0x1492: 0x9609, 0x1493: 0x9641, 0x1494: 0x9679, 0x1495: 0x96b1, 0x1496: 0x96e9, 0x1497: 0x9721,\n\t0x1498: 0x9759, 0x1499: 0x9759, 0x149a: 0x9791, 0x149b: 0x97c9, 0x149c: 0x9801, 0x149d: 0x9839,\n\t0x149e: 0x9871, 0x149f: 0x98a9, 0x14a0: 0x98a9, 0x14a1: 0x98e1, 0x14a2: 0x9919, 0x14a3: 0x9919,\n\t0x14a4: 0x9951, 0x14a5: 0x9951, 0x14a6: 0x9989, 0x14a7: 0x99c1, 0x14a8: 0x99c1, 0x14a9: 0x99f9,\n\t0x14aa: 0x9a31, 0x14ab: 0x9a31, 0x14ac: 0x9a69, 0x14ad: 0x9a69, 0x14ae: 0x9aa1, 0x14af: 0x9ad9,\n\t0x14b0: 0x9ad9, 0x14b1: 0x9b11, 0x14b2: 0x9b11, 0x14b3: 0x9b49, 0x14b4: 0x9b81, 0x14b5: 0x9bb9,\n\t0x14b6: 0x9bf1, 0x14b7: 0x9bf1, 0x14b8: 0x9c29, 0x14b9: 0x9c61, 0x14ba: 0x9c99, 0x14bb: 0x9cd1,\n\t0x14bc: 0x9d09, 0x14bd: 0x9d09, 0x14be: 0x9d41, 0x14bf: 0x9d79,\n\t// Block 0x53, offset 0x14c0\n\t0x14c0: 0xa949, 0x14c1: 0xa981, 0x14c2: 0xa9b9, 0x14c3: 0xa8a1, 0x14c4: 0x9bb9, 0x14c5: 0x9989,\n\t0x14c6: 0xa9f1, 0x14c7: 0xaa29, 0x14c8: 0x0040, 0x14c9: 0x0040, 0x14ca: 0x0040, 0x14cb: 0x0040,\n\t0x14cc: 0x0040, 0x14cd: 0x0040, 0x14ce: 0x0040, 0x14cf: 0x0040, 0x14d0: 0x0040, 0x14d1: 0x0040,\n\t0x14d2: 0x0040, 0x14d3: 0x0040, 0x14d4: 0x0040, 0x14d5: 0x0040, 0x14d6: 0x0040, 0x14d7: 0x0040,\n\t0x14d8: 0x0040, 0x14d9: 0x0040, 0x14da: 0x0040, 0x14db: 0x0040, 0x14dc: 0x0040, 0x14dd: 0x0040,\n\t0x14de: 0x0040, 0x14df: 0x0040, 0x14e0: 0x0040, 0x14e1: 0x0040, 0x14e2: 0x0040, 0x14e3: 0x0040,\n\t0x14e4: 0x0040, 0x14e5: 0x0040, 0x14e6: 0x0040, 0x14e7: 0x0040, 0x14e8: 0x0040, 0x14e9: 0x0040,\n\t0x14ea: 0x0040, 0x14eb: 0x0040, 0x14ec: 0x0040, 0x14ed: 0x0040, 0x14ee: 0x0040, 0x14ef: 0x0040,\n\t0x14f0: 0xaa61, 0x14f1: 0xaa99, 0x14f2: 0xaad1, 0x14f3: 0xab19, 0x14f4: 0xab61, 0x14f5: 0xaba9,\n\t0x14f6: 0xabf1, 0x14f7: 0xac39, 0x14f8: 0xac81, 0x14f9: 0xacc9, 0x14fa: 0xad02, 0x14fb: 0xae12,\n\t0x14fc: 0xae91, 0x14fd: 0x0018, 0x14fe: 0x0040, 0x14ff: 0x0040,\n\t// Block 0x54, offset 0x1500\n\t0x1500: 0x33c0, 0x1501: 0x33c0, 0x1502: 0x33c0, 0x1503: 0x33c0, 0x1504: 0x33c0, 0x1505: 0x33c0,\n\t0x1506: 0x33c0, 0x1507: 0x33c0, 0x1508: 0x33c0, 0x1509: 0x33c0, 0x150a: 0x33c0, 0x150b: 0x33c0,\n\t0x150c: 0x33c0, 0x150d: 0x33c0, 0x150e: 0x33c0, 0x150f: 0x33c0, 0x1510: 0xaeda, 0x1511: 0x7d55,\n\t0x1512: 0x0040, 0x1513: 0xaeea, 0x1514: 0x03c2, 0x1515: 0xaefa, 0x1516: 0xaf0a, 0x1517: 0x7d75,\n\t0x1518: 0x7d95, 0x1519: 0x0040, 0x151a: 0x0040, 0x151b: 0x0040, 0x151c: 0x0040, 0x151d: 0x0040,\n\t0x151e: 0x0040, 0x151f: 0x0040, 0x1520: 0x3308, 0x1521: 0x3308, 0x1522: 0x3308, 0x1523: 0x3308,\n\t0x1524: 0x3308, 0x1525: 0x3308, 0x1526: 0x3308, 0x1527: 0x3308, 0x1528: 0x3308, 0x1529: 0x3308,\n\t0x152a: 0x3308, 0x152b: 0x3308, 0x152c: 0x3308, 0x152d: 0x3308, 0x152e: 0x3308, 0x152f: 0x3308,\n\t0x1530: 0x0040, 0x1531: 0x7db5, 0x1532: 0x7dd5, 0x1533: 0xaf1a, 0x1534: 0xaf1a, 0x1535: 0x1fd2,\n\t0x1536: 0x1fe2, 0x1537: 0xaf2a, 0x1538: 0xaf3a, 0x1539: 0x7df5, 0x153a: 0x7e15, 0x153b: 0x7e35,\n\t0x153c: 0x7df5, 0x153d: 0x7e55, 0x153e: 0x7e75, 0x153f: 0x7e55,\n\t// Block 0x55, offset 0x1540\n\t0x1540: 0x7e95, 0x1541: 0x7eb5, 0x1542: 0x7ed5, 0x1543: 0x7eb5, 0x1544: 0x7ef5, 0x1545: 0x0018,\n\t0x1546: 0x0018, 0x1547: 0xaf4a, 0x1548: 0xaf5a, 0x1549: 0x7f16, 0x154a: 0x7f36, 0x154b: 0x7f56,\n\t0x154c: 0x7f76, 0x154d: 0xaf1a, 0x154e: 0xaf1a, 0x154f: 0xaf1a, 0x1550: 0xaeda, 0x1551: 0x7f95,\n\t0x1552: 0x0040, 0x1553: 0x0040, 0x1554: 0x03c2, 0x1555: 0xaeea, 0x1556: 0xaf0a, 0x1557: 0xaefa,\n\t0x1558: 0x7fb5, 0x1559: 0x1fd2, 0x155a: 0x1fe2, 0x155b: 0xaf2a, 0x155c: 0xaf3a, 0x155d: 0x7e95,\n\t0x155e: 0x7ef5, 0x155f: 0xaf6a, 0x1560: 0xaf7a, 0x1561: 0xaf8a, 0x1562: 0x1fb2, 0x1563: 0xaf99,\n\t0x1564: 0xafaa, 0x1565: 0xafba, 0x1566: 0x1fc2, 0x1567: 0x0040, 0x1568: 0xafca, 0x1569: 0xafda,\n\t0x156a: 0xafea, 0x156b: 0xaffa, 0x156c: 0x0040, 0x156d: 0x0040, 0x156e: 0x0040, 0x156f: 0x0040,\n\t0x1570: 0x7fd6, 0x1571: 0xb009, 0x1572: 0x7ff6, 0x1573: 0x0808, 0x1574: 0x8016, 0x1575: 0x0040,\n\t0x1576: 0x8036, 0x1577: 0xb031, 0x1578: 0x8056, 0x1579: 0xb059, 0x157a: 0x8076, 0x157b: 0xb081,\n\t0x157c: 0x8096, 0x157d: 0xb0a9, 0x157e: 0x80b6, 0x157f: 0xb0d1,\n\t// Block 0x56, offset 0x1580\n\t0x1580: 0xb0f9, 0x1581: 0xb111, 0x1582: 0xb111, 0x1583: 0xb129, 0x1584: 0xb129, 0x1585: 0xb141,\n\t0x1586: 0xb141, 0x1587: 0xb159, 0x1588: 0xb159, 0x1589: 0xb171, 0x158a: 0xb171, 0x158b: 0xb171,\n\t0x158c: 0xb171, 0x158d: 0xb189, 0x158e: 0xb189, 0x158f: 0xb1a1, 0x1590: 0xb1a1, 0x1591: 0xb1a1,\n\t0x1592: 0xb1a1, 0x1593: 0xb1b9, 0x1594: 0xb1b9, 0x1595: 0xb1d1, 0x1596: 0xb1d1, 0x1597: 0xb1d1,\n\t0x1598: 0xb1d1, 0x1599: 0xb1e9, 0x159a: 0xb1e9, 0x159b: 0xb1e9, 0x159c: 0xb1e9, 0x159d: 0xb201,\n\t0x159e: 0xb201, 0x159f: 0xb201, 0x15a0: 0xb201, 0x15a1: 0xb219, 0x15a2: 0xb219, 0x15a3: 0xb219,\n\t0x15a4: 0xb219, 0x15a5: 0xb231, 0x15a6: 0xb231, 0x15a7: 0xb231, 0x15a8: 0xb231, 0x15a9: 0xb249,\n\t0x15aa: 0xb249, 0x15ab: 0xb261, 0x15ac: 0xb261, 0x15ad: 0xb279, 0x15ae: 0xb279, 0x15af: 0xb291,\n\t0x15b0: 0xb291, 0x15b1: 0xb2a9, 0x15b2: 0xb2a9, 0x15b3: 0xb2a9, 0x15b4: 0xb2a9, 0x15b5: 0xb2c1,\n\t0x15b6: 0xb2c1, 0x15b7: 0xb2c1, 0x15b8: 0xb2c1, 0x15b9: 0xb2d9, 0x15ba: 0xb2d9, 0x15bb: 0xb2d9,\n\t0x15bc: 0xb2d9, 0x15bd: 0xb2f1, 0x15be: 0xb2f1, 0x15bf: 0xb2f1,\n\t// Block 0x57, offset 0x15c0\n\t0x15c0: 0xb2f1, 0x15c1: 0xb309, 0x15c2: 0xb309, 0x15c3: 0xb309, 0x15c4: 0xb309, 0x15c5: 0xb321,\n\t0x15c6: 0xb321, 0x15c7: 0xb321, 0x15c8: 0xb321, 0x15c9: 0xb339, 0x15ca: 0xb339, 0x15cb: 0xb339,\n\t0x15cc: 0xb339, 0x15cd: 0xb351, 0x15ce: 0xb351, 0x15cf: 0xb351, 0x15d0: 0xb351, 0x15d1: 0xb369,\n\t0x15d2: 0xb369, 0x15d3: 0xb369, 0x15d4: 0xb369, 0x15d5: 0xb381, 0x15d6: 0xb381, 0x15d7: 0xb381,\n\t0x15d8: 0xb381, 0x15d9: 0xb399, 0x15da: 0xb399, 0x15db: 0xb399, 0x15dc: 0xb399, 0x15dd: 0xb3b1,\n\t0x15de: 0xb3b1, 0x15df: 0xb3b1, 0x15e0: 0xb3b1, 0x15e1: 0xb3c9, 0x15e2: 0xb3c9, 0x15e3: 0xb3c9,\n\t0x15e4: 0xb3c9, 0x15e5: 0xb3e1, 0x15e6: 0xb3e1, 0x15e7: 0xb3e1, 0x15e8: 0xb3e1, 0x15e9: 0xb3f9,\n\t0x15ea: 0xb3f9, 0x15eb: 0xb3f9, 0x15ec: 0xb3f9, 0x15ed: 0xb411, 0x15ee: 0xb411, 0x15ef: 0x7ab1,\n\t0x15f0: 0x7ab1, 0x15f1: 0xb429, 0x15f2: 0xb429, 0x15f3: 0xb429, 0x15f4: 0xb429, 0x15f5: 0xb441,\n\t0x15f6: 0xb441, 0x15f7: 0xb469, 0x15f8: 0xb469, 0x15f9: 0xb491, 0x15fa: 0xb491, 0x15fb: 0xb4b9,\n\t0x15fc: 0xb4b9, 0x15fd: 0x0040, 0x15fe: 0x0040, 0x15ff: 0x03c0,\n\t// Block 0x58, offset 0x1600\n\t0x1600: 0x0040, 0x1601: 0xaefa, 0x1602: 0xb4e2, 0x1603: 0xaf6a, 0x1604: 0xafda, 0x1605: 0xafea,\n\t0x1606: 0xaf7a, 0x1607: 0xb4f2, 0x1608: 0x1fd2, 0x1609: 0x1fe2, 0x160a: 0xaf8a, 0x160b: 0x1fb2,\n\t0x160c: 0xaeda, 0x160d: 0xaf99, 0x160e: 0x29d1, 0x160f: 0xb502, 0x1610: 0x1f41, 0x1611: 0x00c9,\n\t0x1612: 0x0069, 0x1613: 0x0079, 0x1614: 0x1f51, 0x1615: 0x1f61, 0x1616: 0x1f71, 0x1617: 0x1f81,\n\t0x1618: 0x1f91, 0x1619: 0x1fa1, 0x161a: 0xaeea, 0x161b: 0x03c2, 0x161c: 0xafaa, 0x161d: 0x1fc2,\n\t0x161e: 0xafba, 0x161f: 0xaf0a, 0x1620: 0xaffa, 0x1621: 0x0039, 0x1622: 0x0ee9, 0x1623: 0x1159,\n\t0x1624: 0x0ef9, 0x1625: 0x0f09, 0x1626: 0x1199, 0x1627: 0x0f31, 0x1628: 0x0249, 0x1629: 0x0f41,\n\t0x162a: 0x0259, 0x162b: 0x0f51, 0x162c: 0x0359, 0x162d: 0x0f61, 0x162e: 0x0f71, 0x162f: 0x00d9,\n\t0x1630: 0x0f99, 0x1631: 0x2039, 0x1632: 0x0269, 0x1633: 0x01d9, 0x1634: 0x0fa9, 0x1635: 0x0fb9,\n\t0x1636: 0x1089, 0x1637: 0x0279, 0x1638: 0x0369, 0x1639: 0x0289, 0x163a: 0x13d1, 0x163b: 0xaf4a,\n\t0x163c: 0xafca, 0x163d: 0xaf5a, 0x163e: 0xb512, 0x163f: 0xaf1a,\n\t// Block 0x59, offset 0x1640\n\t0x1640: 0x1caa, 0x1641: 0x0039, 0x1642: 0x0ee9, 0x1643: 0x1159, 0x1644: 0x0ef9, 0x1645: 0x0f09,\n\t0x1646: 0x1199, 0x1647: 0x0f31, 0x1648: 0x0249, 0x1649: 0x0f41, 0x164a: 0x0259, 0x164b: 0x0f51,\n\t0x164c: 0x0359, 0x164d: 0x0f61, 0x164e: 0x0f71, 0x164f: 0x00d9, 0x1650: 0x0f99, 0x1651: 0x2039,\n\t0x1652: 0x0269, 0x1653: 0x01d9, 0x1654: 0x0fa9, 0x1655: 0x0fb9, 0x1656: 0x1089, 0x1657: 0x0279,\n\t0x1658: 0x0369, 0x1659: 0x0289, 0x165a: 0x13d1, 0x165b: 0xaf2a, 0x165c: 0xb522, 0x165d: 0xaf3a,\n\t0x165e: 0xb532, 0x165f: 0x80d5, 0x1660: 0x80f5, 0x1661: 0x29d1, 0x1662: 0x8115, 0x1663: 0x8115,\n\t0x1664: 0x8135, 0x1665: 0x8155, 0x1666: 0x8175, 0x1667: 0x8195, 0x1668: 0x81b5, 0x1669: 0x81d5,\n\t0x166a: 0x81f5, 0x166b: 0x8215, 0x166c: 0x8235, 0x166d: 0x8255, 0x166e: 0x8275, 0x166f: 0x8295,\n\t0x1670: 0x82b5, 0x1671: 0x82d5, 0x1672: 0x82f5, 0x1673: 0x8315, 0x1674: 0x8335, 0x1675: 0x8355,\n\t0x1676: 0x8375, 0x1677: 0x8395, 0x1678: 0x83b5, 0x1679: 0x83d5, 0x167a: 0x83f5, 0x167b: 0x8415,\n\t0x167c: 0x81b5, 0x167d: 0x8435, 0x167e: 0x8455, 0x167f: 0x8215,\n\t// Block 0x5a, offset 0x1680\n\t0x1680: 0x8475, 0x1681: 0x8495, 0x1682: 0x84b5, 0x1683: 0x84d5, 0x1684: 0x84f5, 0x1685: 0x8515,\n\t0x1686: 0x8535, 0x1687: 0x8555, 0x1688: 0x84d5, 0x1689: 0x8575, 0x168a: 0x84d5, 0x168b: 0x8595,\n\t0x168c: 0x8595, 0x168d: 0x85b5, 0x168e: 0x85b5, 0x168f: 0x85d5, 0x1690: 0x8515, 0x1691: 0x85f5,\n\t0x1692: 0x8615, 0x1693: 0x85f5, 0x1694: 0x8635, 0x1695: 0x8615, 0x1696: 0x8655, 0x1697: 0x8655,\n\t0x1698: 0x8675, 0x1699: 0x8675, 0x169a: 0x8695, 0x169b: 0x8695, 0x169c: 0x8615, 0x169d: 0x8115,\n\t0x169e: 0x86b5, 0x169f: 0x86d5, 0x16a0: 0x0040, 0x16a1: 0x86f5, 0x16a2: 0x8715, 0x16a3: 0x8735,\n\t0x16a4: 0x8755, 0x16a5: 0x8735, 0x16a6: 0x8775, 0x16a7: 0x8795, 0x16a8: 0x87b5, 0x16a9: 0x87b5,\n\t0x16aa: 0x87d5, 0x16ab: 0x87d5, 0x16ac: 0x87f5, 0x16ad: 0x87f5, 0x16ae: 0x87d5, 0x16af: 0x87d5,\n\t0x16b0: 0x8815, 0x16b1: 0x8835, 0x16b2: 0x8855, 0x16b3: 0x8875, 0x16b4: 0x8895, 0x16b5: 0x88b5,\n\t0x16b6: 0x88b5, 0x16b7: 0x88b5, 0x16b8: 0x88d5, 0x16b9: 0x88d5, 0x16ba: 0x88d5, 0x16bb: 0x88d5,\n\t0x16bc: 0x87b5, 0x16bd: 0x87b5, 0x16be: 0x87b5, 0x16bf: 0x0040,\n\t// Block 0x5b, offset 0x16c0\n\t0x16c0: 0x0040, 0x16c1: 0x0040, 0x16c2: 0x8715, 0x16c3: 0x86f5, 0x16c4: 0x88f5, 0x16c5: 0x86f5,\n\t0x16c6: 0x8715, 0x16c7: 0x86f5, 0x16c8: 0x0040, 0x16c9: 0x0040, 0x16ca: 0x8915, 0x16cb: 0x8715,\n\t0x16cc: 0x8935, 0x16cd: 0x88f5, 0x16ce: 0x8935, 0x16cf: 0x8715, 0x16d0: 0x0040, 0x16d1: 0x0040,\n\t0x16d2: 0x8955, 0x16d3: 0x8975, 0x16d4: 0x8875, 0x16d5: 0x8935, 0x16d6: 0x88f5, 0x16d7: 0x8935,\n\t0x16d8: 0x0040, 0x16d9: 0x0040, 0x16da: 0x8995, 0x16db: 0x89b5, 0x16dc: 0x8995, 0x16dd: 0x0040,\n\t0x16de: 0x0040, 0x16df: 0x0040, 0x16e0: 0xb541, 0x16e1: 0xb559, 0x16e2: 0xb571, 0x16e3: 0x89d6,\n\t0x16e4: 0xb589, 0x16e5: 0xb5a1, 0x16e6: 0x89f5, 0x16e7: 0x0040, 0x16e8: 0x8a15, 0x16e9: 0x8a35,\n\t0x16ea: 0x8a55, 0x16eb: 0x8a35, 0x16ec: 0x8a75, 0x16ed: 0x8a95, 0x16ee: 0x8ab5, 0x16ef: 0x0040,\n\t0x16f0: 0x0040, 0x16f1: 0x0040, 0x16f2: 0x0040, 0x16f3: 0x0040, 0x16f4: 0x0040, 0x16f5: 0x0040,\n\t0x16f6: 0x0040, 0x16f7: 0x0040, 0x16f8: 0x0040, 0x16f9: 0x0340, 0x16fa: 0x0340, 0x16fb: 0x0340,\n\t0x16fc: 0x0040, 0x16fd: 0x0040, 0x16fe: 0x0040, 0x16ff: 0x0040,\n\t// Block 0x5c, offset 0x1700\n\t0x1700: 0x0a08, 0x1701: 0x0a08, 0x1702: 0x0a08, 0x1703: 0x0a08, 0x1704: 0x0a08, 0x1705: 0x0c08,\n\t0x1706: 0x0808, 0x1707: 0x0c08, 0x1708: 0x0818, 0x1709: 0x0c08, 0x170a: 0x0c08, 0x170b: 0x0808,\n\t0x170c: 0x0808, 0x170d: 0x0908, 0x170e: 0x0c08, 0x170f: 0x0c08, 0x1710: 0x0c08, 0x1711: 0x0c08,\n\t0x1712: 0x0c08, 0x1713: 0x0a08, 0x1714: 0x0a08, 0x1715: 0x0a08, 0x1716: 0x0a08, 0x1717: 0x0908,\n\t0x1718: 0x0a08, 0x1719: 0x0a08, 0x171a: 0x0a08, 0x171b: 0x0a08, 0x171c: 0x0a08, 0x171d: 0x0c08,\n\t0x171e: 0x0a08, 0x171f: 0x0a08, 0x1720: 0x0a08, 0x1721: 0x0c08, 0x1722: 0x0808, 0x1723: 0x0808,\n\t0x1724: 0x0c08, 0x1725: 0x3308, 0x1726: 0x3308, 0x1727: 0x0040, 0x1728: 0x0040, 0x1729: 0x0040,\n\t0x172a: 0x0040, 0x172b: 0x0a18, 0x172c: 0x0a18, 0x172d: 0x0a18, 0x172e: 0x0a18, 0x172f: 0x0c18,\n\t0x1730: 0x0818, 0x1731: 0x0818, 0x1732: 0x0818, 0x1733: 0x0818, 0x1734: 0x0818, 0x1735: 0x0818,\n\t0x1736: 0x0818, 0x1737: 0x0040, 0x1738: 0x0040, 0x1739: 0x0040, 0x173a: 0x0040, 0x173b: 0x0040,\n\t0x173c: 0x0040, 0x173d: 0x0040, 0x173e: 0x0040, 0x173f: 0x0040,\n\t// Block 0x5d, offset 0x1740\n\t0x1740: 0x0a08, 0x1741: 0x0c08, 0x1742: 0x0a08, 0x1743: 0x0c08, 0x1744: 0x0c08, 0x1745: 0x0c08,\n\t0x1746: 0x0a08, 0x1747: 0x0a08, 0x1748: 0x0a08, 0x1749: 0x0c08, 0x174a: 0x0a08, 0x174b: 0x0a08,\n\t0x174c: 0x0c08, 0x174d: 0x0a08, 0x174e: 0x0c08, 0x174f: 0x0c08, 0x1750: 0x0a08, 0x1751: 0x0c08,\n\t0x1752: 0x0040, 0x1753: 0x0040, 0x1754: 0x0040, 0x1755: 0x0040, 0x1756: 0x0040, 0x1757: 0x0040,\n\t0x1758: 0x0040, 0x1759: 0x0818, 0x175a: 0x0818, 0x175b: 0x0818, 0x175c: 0x0818, 0x175d: 0x0040,\n\t0x175e: 0x0040, 0x175f: 0x0040, 0x1760: 0x0040, 0x1761: 0x0040, 0x1762: 0x0040, 0x1763: 0x0040,\n\t0x1764: 0x0040, 0x1765: 0x0040, 0x1766: 0x0040, 0x1767: 0x0040, 0x1768: 0x0040, 0x1769: 0x0c18,\n\t0x176a: 0x0c18, 0x176b: 0x0c18, 0x176c: 0x0c18, 0x176d: 0x0a18, 0x176e: 0x0a18, 0x176f: 0x0818,\n\t0x1770: 0x0040, 0x1771: 0x0040, 0x1772: 0x0040, 0x1773: 0x0040, 0x1774: 0x0040, 0x1775: 0x0040,\n\t0x1776: 0x0040, 0x1777: 0x0040, 0x1778: 0x0040, 0x1779: 0x0040, 0x177a: 0x0040, 0x177b: 0x0040,\n\t0x177c: 0x0040, 0x177d: 0x0040, 0x177e: 0x0040, 0x177f: 0x0040,\n\t// Block 0x5e, offset 0x1780\n\t0x1780: 0x3308, 0x1781: 0x3308, 0x1782: 0x3008, 0x1783: 0x3008, 0x1784: 0x0040, 0x1785: 0x0008,\n\t0x1786: 0x0008, 0x1787: 0x0008, 0x1788: 0x0008, 0x1789: 0x0008, 0x178a: 0x0008, 0x178b: 0x0008,\n\t0x178c: 0x0008, 0x178d: 0x0040, 0x178e: 0x0040, 0x178f: 0x0008, 0x1790: 0x0008, 0x1791: 0x0040,\n\t0x1792: 0x0040, 0x1793: 0x0008, 0x1794: 0x0008, 0x1795: 0x0008, 0x1796: 0x0008, 0x1797: 0x0008,\n\t0x1798: 0x0008, 0x1799: 0x0008, 0x179a: 0x0008, 0x179b: 0x0008, 0x179c: 0x0008, 0x179d: 0x0008,\n\t0x179e: 0x0008, 0x179f: 0x0008, 0x17a0: 0x0008, 0x17a1: 0x0008, 0x17a2: 0x0008, 0x17a3: 0x0008,\n\t0x17a4: 0x0008, 0x17a5: 0x0008, 0x17a6: 0x0008, 0x17a7: 0x0008, 0x17a8: 0x0008, 0x17a9: 0x0040,\n\t0x17aa: 0x0008, 0x17ab: 0x0008, 0x17ac: 0x0008, 0x17ad: 0x0008, 0x17ae: 0x0008, 0x17af: 0x0008,\n\t0x17b0: 0x0008, 0x17b1: 0x0040, 0x17b2: 0x0008, 0x17b3: 0x0008, 0x17b4: 0x0040, 0x17b5: 0x0008,\n\t0x17b6: 0x0008, 0x17b7: 0x0008, 0x17b8: 0x0008, 0x17b9: 0x0008, 0x17ba: 0x0040, 0x17bb: 0x0040,\n\t0x17bc: 0x3308, 0x17bd: 0x0008, 0x17be: 0x3008, 0x17bf: 0x3008,\n\t// Block 0x5f, offset 0x17c0\n\t0x17c0: 0x3308, 0x17c1: 0x3008, 0x17c2: 0x3008, 0x17c3: 0x3008, 0x17c4: 0x3008, 0x17c5: 0x0040,\n\t0x17c6: 0x0040, 0x17c7: 0x3008, 0x17c8: 0x3008, 0x17c9: 0x0040, 0x17ca: 0x0040, 0x17cb: 0x3008,\n\t0x17cc: 0x3008, 0x17cd: 0x3808, 0x17ce: 0x0040, 0x17cf: 0x0040, 0x17d0: 0x0008, 0x17d1: 0x0040,\n\t0x17d2: 0x0040, 0x17d3: 0x0040, 0x17d4: 0x0040, 0x17d5: 0x0040, 0x17d6: 0x0040, 0x17d7: 0x3008,\n\t0x17d8: 0x0040, 0x17d9: 0x0040, 0x17da: 0x0040, 0x17db: 0x0040, 0x17dc: 0x0040, 0x17dd: 0x0008,\n\t0x17de: 0x0008, 0x17df: 0x0008, 0x17e0: 0x0008, 0x17e1: 0x0008, 0x17e2: 0x3008, 0x17e3: 0x3008,\n\t0x17e4: 0x0040, 0x17e5: 0x0040, 0x17e6: 0x3308, 0x17e7: 0x3308, 0x17e8: 0x3308, 0x17e9: 0x3308,\n\t0x17ea: 0x3308, 0x17eb: 0x3308, 0x17ec: 0x3308, 0x17ed: 0x0040, 0x17ee: 0x0040, 0x17ef: 0x0040,\n\t0x17f0: 0x3308, 0x17f1: 0x3308, 0x17f2: 0x3308, 0x17f3: 0x3308, 0x17f4: 0x3308, 0x17f5: 0x0040,\n\t0x17f6: 0x0040, 0x17f7: 0x0040, 0x17f8: 0x0040, 0x17f9: 0x0040, 0x17fa: 0x0040, 0x17fb: 0x0040,\n\t0x17fc: 0x0040, 0x17fd: 0x0040, 0x17fe: 0x0040, 0x17ff: 0x0040,\n\t// Block 0x60, offset 0x1800\n\t0x1800: 0x0039, 0x1801: 0x0ee9, 0x1802: 0x1159, 0x1803: 0x0ef9, 0x1804: 0x0f09, 0x1805: 0x1199,\n\t0x1806: 0x0f31, 0x1807: 0x0249, 0x1808: 0x0f41, 0x1809: 0x0259, 0x180a: 0x0f51, 0x180b: 0x0359,\n\t0x180c: 0x0f61, 0x180d: 0x0f71, 0x180e: 0x00d9, 0x180f: 0x0f99, 0x1810: 0x2039, 0x1811: 0x0269,\n\t0x1812: 0x01d9, 0x1813: 0x0fa9, 0x1814: 0x0fb9, 0x1815: 0x1089, 0x1816: 0x0279, 0x1817: 0x0369,\n\t0x1818: 0x0289, 0x1819: 0x13d1, 0x181a: 0x0039, 0x181b: 0x0ee9, 0x181c: 0x1159, 0x181d: 0x0ef9,\n\t0x181e: 0x0f09, 0x181f: 0x1199, 0x1820: 0x0f31, 0x1821: 0x0249, 0x1822: 0x0f41, 0x1823: 0x0259,\n\t0x1824: 0x0f51, 0x1825: 0x0359, 0x1826: 0x0f61, 0x1827: 0x0f71, 0x1828: 0x00d9, 0x1829: 0x0f99,\n\t0x182a: 0x2039, 0x182b: 0x0269, 0x182c: 0x01d9, 0x182d: 0x0fa9, 0x182e: 0x0fb9, 0x182f: 0x1089,\n\t0x1830: 0x0279, 0x1831: 0x0369, 0x1832: 0x0289, 0x1833: 0x13d1, 0x1834: 0x0039, 0x1835: 0x0ee9,\n\t0x1836: 0x1159, 0x1837: 0x0ef9, 0x1838: 0x0f09, 0x1839: 0x1199, 0x183a: 0x0f31, 0x183b: 0x0249,\n\t0x183c: 0x0f41, 0x183d: 0x0259, 0x183e: 0x0f51, 0x183f: 0x0359,\n\t// Block 0x61, offset 0x1840\n\t0x1840: 0x0f61, 0x1841: 0x0f71, 0x1842: 0x00d9, 0x1843: 0x0f99, 0x1844: 0x2039, 0x1845: 0x0269,\n\t0x1846: 0x01d9, 0x1847: 0x0fa9, 0x1848: 0x0fb9, 0x1849: 0x1089, 0x184a: 0x0279, 0x184b: 0x0369,\n\t0x184c: 0x0289, 0x184d: 0x13d1, 0x184e: 0x0039, 0x184f: 0x0ee9, 0x1850: 0x1159, 0x1851: 0x0ef9,\n\t0x1852: 0x0f09, 0x1853: 0x1199, 0x1854: 0x0f31, 0x1855: 0x0040, 0x1856: 0x0f41, 0x1857: 0x0259,\n\t0x1858: 0x0f51, 0x1859: 0x0359, 0x185a: 0x0f61, 0x185b: 0x0f71, 0x185c: 0x00d9, 0x185d: 0x0f99,\n\t0x185e: 0x2039, 0x185f: 0x0269, 0x1860: 0x01d9, 0x1861: 0x0fa9, 0x1862: 0x0fb9, 0x1863: 0x1089,\n\t0x1864: 0x0279, 0x1865: 0x0369, 0x1866: 0x0289, 0x1867: 0x13d1, 0x1868: 0x0039, 0x1869: 0x0ee9,\n\t0x186a: 0x1159, 0x186b: 0x0ef9, 0x186c: 0x0f09, 0x186d: 0x1199, 0x186e: 0x0f31, 0x186f: 0x0249,\n\t0x1870: 0x0f41, 0x1871: 0x0259, 0x1872: 0x0f51, 0x1873: 0x0359, 0x1874: 0x0f61, 0x1875: 0x0f71,\n\t0x1876: 0x00d9, 0x1877: 0x0f99, 0x1878: 0x2039, 0x1879: 0x0269, 0x187a: 0x01d9, 0x187b: 0x0fa9,\n\t0x187c: 0x0fb9, 0x187d: 0x1089, 0x187e: 0x0279, 0x187f: 0x0369,\n\t// Block 0x62, offset 0x1880\n\t0x1880: 0x0289, 0x1881: 0x13d1, 0x1882: 0x0039, 0x1883: 0x0ee9, 0x1884: 0x1159, 0x1885: 0x0ef9,\n\t0x1886: 0x0f09, 0x1887: 0x1199, 0x1888: 0x0f31, 0x1889: 0x0249, 0x188a: 0x0f41, 0x188b: 0x0259,\n\t0x188c: 0x0f51, 0x188d: 0x0359, 0x188e: 0x0f61, 0x188f: 0x0f71, 0x1890: 0x00d9, 0x1891: 0x0f99,\n\t0x1892: 0x2039, 0x1893: 0x0269, 0x1894: 0x01d9, 0x1895: 0x0fa9, 0x1896: 0x0fb9, 0x1897: 0x1089,\n\t0x1898: 0x0279, 0x1899: 0x0369, 0x189a: 0x0289, 0x189b: 0x13d1, 0x189c: 0x0039, 0x189d: 0x0040,\n\t0x189e: 0x1159, 0x189f: 0x0ef9, 0x18a0: 0x0040, 0x18a1: 0x0040, 0x18a2: 0x0f31, 0x18a3: 0x0040,\n\t0x18a4: 0x0040, 0x18a5: 0x0259, 0x18a6: 0x0f51, 0x18a7: 0x0040, 0x18a8: 0x0040, 0x18a9: 0x0f71,\n\t0x18aa: 0x00d9, 0x18ab: 0x0f99, 0x18ac: 0x2039, 0x18ad: 0x0040, 0x18ae: 0x01d9, 0x18af: 0x0fa9,\n\t0x18b0: 0x0fb9, 0x18b1: 0x1089, 0x18b2: 0x0279, 0x18b3: 0x0369, 0x18b4: 0x0289, 0x18b5: 0x13d1,\n\t0x18b6: 0x0039, 0x18b7: 0x0ee9, 0x18b8: 0x1159, 0x18b9: 0x0ef9, 0x18ba: 0x0040, 0x18bb: 0x1199,\n\t0x18bc: 0x0040, 0x18bd: 0x0249, 0x18be: 0x0f41, 0x18bf: 0x0259,\n\t// Block 0x63, offset 0x18c0\n\t0x18c0: 0x0f51, 0x18c1: 0x0359, 0x18c2: 0x0f61, 0x18c3: 0x0f71, 0x18c4: 0x0040, 0x18c5: 0x0f99,\n\t0x18c6: 0x2039, 0x18c7: 0x0269, 0x18c8: 0x01d9, 0x18c9: 0x0fa9, 0x18ca: 0x0fb9, 0x18cb: 0x1089,\n\t0x18cc: 0x0279, 0x18cd: 0x0369, 0x18ce: 0x0289, 0x18cf: 0x13d1, 0x18d0: 0x0039, 0x18d1: 0x0ee9,\n\t0x18d2: 0x1159, 0x18d3: 0x0ef9, 0x18d4: 0x0f09, 0x18d5: 0x1199, 0x18d6: 0x0f31, 0x18d7: 0x0249,\n\t0x18d8: 0x0f41, 0x18d9: 0x0259, 0x18da: 0x0f51, 0x18db: 0x0359, 0x18dc: 0x0f61, 0x18dd: 0x0f71,\n\t0x18de: 0x00d9, 0x18df: 0x0f99, 0x18e0: 0x2039, 0x18e1: 0x0269, 0x18e2: 0x01d9, 0x18e3: 0x0fa9,\n\t0x18e4: 0x0fb9, 0x18e5: 0x1089, 0x18e6: 0x0279, 0x18e7: 0x0369, 0x18e8: 0x0289, 0x18e9: 0x13d1,\n\t0x18ea: 0x0039, 0x18eb: 0x0ee9, 0x18ec: 0x1159, 0x18ed: 0x0ef9, 0x18ee: 0x0f09, 0x18ef: 0x1199,\n\t0x18f0: 0x0f31, 0x18f1: 0x0249, 0x18f2: 0x0f41, 0x18f3: 0x0259, 0x18f4: 0x0f51, 0x18f5: 0x0359,\n\t0x18f6: 0x0f61, 0x18f7: 0x0f71, 0x18f8: 0x00d9, 0x18f9: 0x0f99, 0x18fa: 0x2039, 0x18fb: 0x0269,\n\t0x18fc: 0x01d9, 0x18fd: 0x0fa9, 0x18fe: 0x0fb9, 0x18ff: 0x1089,\n\t// Block 0x64, offset 0x1900\n\t0x1900: 0x0279, 0x1901: 0x0369, 0x1902: 0x0289, 0x1903: 0x13d1, 0x1904: 0x0039, 0x1905: 0x0ee9,\n\t0x1906: 0x0040, 0x1907: 0x0ef9, 0x1908: 0x0f09, 0x1909: 0x1199, 0x190a: 0x0f31, 0x190b: 0x0040,\n\t0x190c: 0x0040, 0x190d: 0x0259, 0x190e: 0x0f51, 0x190f: 0x0359, 0x1910: 0x0f61, 0x1911: 0x0f71,\n\t0x1912: 0x00d9, 0x1913: 0x0f99, 0x1914: 0x2039, 0x1915: 0x0040, 0x1916: 0x01d9, 0x1917: 0x0fa9,\n\t0x1918: 0x0fb9, 0x1919: 0x1089, 0x191a: 0x0279, 0x191b: 0x0369, 0x191c: 0x0289, 0x191d: 0x0040,\n\t0x191e: 0x0039, 0x191f: 0x0ee9, 0x1920: 0x1159, 0x1921: 0x0ef9, 0x1922: 0x0f09, 0x1923: 0x1199,\n\t0x1924: 0x0f31, 0x1925: 0x0249, 0x1926: 0x0f41, 0x1927: 0x0259, 0x1928: 0x0f51, 0x1929: 0x0359,\n\t0x192a: 0x0f61, 0x192b: 0x0f71, 0x192c: 0x00d9, 0x192d: 0x0f99, 0x192e: 0x2039, 0x192f: 0x0269,\n\t0x1930: 0x01d9, 0x1931: 0x0fa9, 0x1932: 0x0fb9, 0x1933: 0x1089, 0x1934: 0x0279, 0x1935: 0x0369,\n\t0x1936: 0x0289, 0x1937: 0x13d1, 0x1938: 0x0039, 0x1939: 0x0ee9, 0x193a: 0x0040, 0x193b: 0x0ef9,\n\t0x193c: 0x0f09, 0x193d: 0x1199, 0x193e: 0x0f31, 0x193f: 0x0040,\n\t// Block 0x65, offset 0x1940\n\t0x1940: 0x0f41, 0x1941: 0x0259, 0x1942: 0x0f51, 0x1943: 0x0359, 0x1944: 0x0f61, 0x1945: 0x0040,\n\t0x1946: 0x00d9, 0x1947: 0x0040, 0x1948: 0x0040, 0x1949: 0x0040, 0x194a: 0x01d9, 0x194b: 0x0fa9,\n\t0x194c: 0x0fb9, 0x194d: 0x1089, 0x194e: 0x0279, 0x194f: 0x0369, 0x1950: 0x0289, 0x1951: 0x0040,\n\t0x1952: 0x0039, 0x1953: 0x0ee9, 0x1954: 0x1159, 0x1955: 0x0ef9, 0x1956: 0x0f09, 0x1957: 0x1199,\n\t0x1958: 0x0f31, 0x1959: 0x0249, 0x195a: 0x0f41, 0x195b: 0x0259, 0x195c: 0x0f51, 0x195d: 0x0359,\n\t0x195e: 0x0f61, 0x195f: 0x0f71, 0x1960: 0x00d9, 0x1961: 0x0f99, 0x1962: 0x2039, 0x1963: 0x0269,\n\t0x1964: 0x01d9, 0x1965: 0x0fa9, 0x1966: 0x0fb9, 0x1967: 0x1089, 0x1968: 0x0279, 0x1969: 0x0369,\n\t0x196a: 0x0289, 0x196b: 0x13d1, 0x196c: 0x0039, 0x196d: 0x0ee9, 0x196e: 0x1159, 0x196f: 0x0ef9,\n\t0x1970: 0x0f09, 0x1971: 0x1199, 0x1972: 0x0f31, 0x1973: 0x0249, 0x1974: 0x0f41, 0x1975: 0x0259,\n\t0x1976: 0x0f51, 0x1977: 0x0359, 0x1978: 0x0f61, 0x1979: 0x0f71, 0x197a: 0x00d9, 0x197b: 0x0f99,\n\t0x197c: 0x2039, 0x197d: 0x0269, 0x197e: 0x01d9, 0x197f: 0x0fa9,\n\t// Block 0x66, offset 0x1980\n\t0x1980: 0x0fb9, 0x1981: 0x1089, 0x1982: 0x0279, 0x1983: 0x0369, 0x1984: 0x0289, 0x1985: 0x13d1,\n\t0x1986: 0x0039, 0x1987: 0x0ee9, 0x1988: 0x1159, 0x1989: 0x0ef9, 0x198a: 0x0f09, 0x198b: 0x1199,\n\t0x198c: 0x0f31, 0x198d: 0x0249, 0x198e: 0x0f41, 0x198f: 0x0259, 0x1990: 0x0f51, 0x1991: 0x0359,\n\t0x1992: 0x0f61, 0x1993: 0x0f71, 0x1994: 0x00d9, 0x1995: 0x0f99, 0x1996: 0x2039, 0x1997: 0x0269,\n\t0x1998: 0x01d9, 0x1999: 0x0fa9, 0x199a: 0x0fb9, 0x199b: 0x1089, 0x199c: 0x0279, 0x199d: 0x0369,\n\t0x199e: 0x0289, 0x199f: 0x13d1, 0x19a0: 0x0039, 0x19a1: 0x0ee9, 0x19a2: 0x1159, 0x19a3: 0x0ef9,\n\t0x19a4: 0x0f09, 0x19a5: 0x1199, 0x19a6: 0x0f31, 0x19a7: 0x0249, 0x19a8: 0x0f41, 0x19a9: 0x0259,\n\t0x19aa: 0x0f51, 0x19ab: 0x0359, 0x19ac: 0x0f61, 0x19ad: 0x0f71, 0x19ae: 0x00d9, 0x19af: 0x0f99,\n\t0x19b0: 0x2039, 0x19b1: 0x0269, 0x19b2: 0x01d9, 0x19b3: 0x0fa9, 0x19b4: 0x0fb9, 0x19b5: 0x1089,\n\t0x19b6: 0x0279, 0x19b7: 0x0369, 0x19b8: 0x0289, 0x19b9: 0x13d1, 0x19ba: 0x0039, 0x19bb: 0x0ee9,\n\t0x19bc: 0x1159, 0x19bd: 0x0ef9, 0x19be: 0x0f09, 0x19bf: 0x1199,\n\t// Block 0x67, offset 0x19c0\n\t0x19c0: 0x0f31, 0x19c1: 0x0249, 0x19c2: 0x0f41, 0x19c3: 0x0259, 0x19c4: 0x0f51, 0x19c5: 0x0359,\n\t0x19c6: 0x0f61, 0x19c7: 0x0f71, 0x19c8: 0x00d9, 0x19c9: 0x0f99, 0x19ca: 0x2039, 0x19cb: 0x0269,\n\t0x19cc: 0x01d9, 0x19cd: 0x0fa9, 0x19ce: 0x0fb9, 0x19cf: 0x1089, 0x19d0: 0x0279, 0x19d1: 0x0369,\n\t0x19d2: 0x0289, 0x19d3: 0x13d1, 0x19d4: 0x0039, 0x19d5: 0x0ee9, 0x19d6: 0x1159, 0x19d7: 0x0ef9,\n\t0x19d8: 0x0f09, 0x19d9: 0x1199, 0x19da: 0x0f31, 0x19db: 0x0249, 0x19dc: 0x0f41, 0x19dd: 0x0259,\n\t0x19de: 0x0f51, 0x19df: 0x0359, 0x19e0: 0x0f61, 0x19e1: 0x0f71, 0x19e2: 0x00d9, 0x19e3: 0x0f99,\n\t0x19e4: 0x2039, 0x19e5: 0x0269, 0x19e6: 0x01d9, 0x19e7: 0x0fa9, 0x19e8: 0x0fb9, 0x19e9: 0x1089,\n\t0x19ea: 0x0279, 0x19eb: 0x0369, 0x19ec: 0x0289, 0x19ed: 0x13d1, 0x19ee: 0x0039, 0x19ef: 0x0ee9,\n\t0x19f0: 0x1159, 0x19f1: 0x0ef9, 0x19f2: 0x0f09, 0x19f3: 0x1199, 0x19f4: 0x0f31, 0x19f5: 0x0249,\n\t0x19f6: 0x0f41, 0x19f7: 0x0259, 0x19f8: 0x0f51, 0x19f9: 0x0359, 0x19fa: 0x0f61, 0x19fb: 0x0f71,\n\t0x19fc: 0x00d9, 0x19fd: 0x0f99, 0x19fe: 0x2039, 0x19ff: 0x0269,\n\t// Block 0x68, offset 0x1a00\n\t0x1a00: 0x01d9, 0x1a01: 0x0fa9, 0x1a02: 0x0fb9, 0x1a03: 0x1089, 0x1a04: 0x0279, 0x1a05: 0x0369,\n\t0x1a06: 0x0289, 0x1a07: 0x13d1, 0x1a08: 0x0039, 0x1a09: 0x0ee9, 0x1a0a: 0x1159, 0x1a0b: 0x0ef9,\n\t0x1a0c: 0x0f09, 0x1a0d: 0x1199, 0x1a0e: 0x0f31, 0x1a0f: 0x0249, 0x1a10: 0x0f41, 0x1a11: 0x0259,\n\t0x1a12: 0x0f51, 0x1a13: 0x0359, 0x1a14: 0x0f61, 0x1a15: 0x0f71, 0x1a16: 0x00d9, 0x1a17: 0x0f99,\n\t0x1a18: 0x2039, 0x1a19: 0x0269, 0x1a1a: 0x01d9, 0x1a1b: 0x0fa9, 0x1a1c: 0x0fb9, 0x1a1d: 0x1089,\n\t0x1a1e: 0x0279, 0x1a1f: 0x0369, 0x1a20: 0x0289, 0x1a21: 0x13d1, 0x1a22: 0x0039, 0x1a23: 0x0ee9,\n\t0x1a24: 0x1159, 0x1a25: 0x0ef9, 0x1a26: 0x0f09, 0x1a27: 0x1199, 0x1a28: 0x0f31, 0x1a29: 0x0249,\n\t0x1a2a: 0x0f41, 0x1a2b: 0x0259, 0x1a2c: 0x0f51, 0x1a2d: 0x0359, 0x1a2e: 0x0f61, 0x1a2f: 0x0f71,\n\t0x1a30: 0x00d9, 0x1a31: 0x0f99, 0x1a32: 0x2039, 0x1a33: 0x0269, 0x1a34: 0x01d9, 0x1a35: 0x0fa9,\n\t0x1a36: 0x0fb9, 0x1a37: 0x1089, 0x1a38: 0x0279, 0x1a39: 0x0369, 0x1a3a: 0x0289, 0x1a3b: 0x13d1,\n\t0x1a3c: 0x0039, 0x1a3d: 0x0ee9, 0x1a3e: 0x1159, 0x1a3f: 0x0ef9,\n\t// Block 0x69, offset 0x1a40\n\t0x1a40: 0x0f09, 0x1a41: 0x1199, 0x1a42: 0x0f31, 0x1a43: 0x0249, 0x1a44: 0x0f41, 0x1a45: 0x0259,\n\t0x1a46: 0x0f51, 0x1a47: 0x0359, 0x1a48: 0x0f61, 0x1a49: 0x0f71, 0x1a4a: 0x00d9, 0x1a4b: 0x0f99,\n\t0x1a4c: 0x2039, 0x1a4d: 0x0269, 0x1a4e: 0x01d9, 0x1a4f: 0x0fa9, 0x1a50: 0x0fb9, 0x1a51: 0x1089,\n\t0x1a52: 0x0279, 0x1a53: 0x0369, 0x1a54: 0x0289, 0x1a55: 0x13d1, 0x1a56: 0x0039, 0x1a57: 0x0ee9,\n\t0x1a58: 0x1159, 0x1a59: 0x0ef9, 0x1a5a: 0x0f09, 0x1a5b: 0x1199, 0x1a5c: 0x0f31, 0x1a5d: 0x0249,\n\t0x1a5e: 0x0f41, 0x1a5f: 0x0259, 0x1a60: 0x0f51, 0x1a61: 0x0359, 0x1a62: 0x0f61, 0x1a63: 0x0f71,\n\t0x1a64: 0x00d9, 0x1a65: 0x0f99, 0x1a66: 0x2039, 0x1a67: 0x0269, 0x1a68: 0x01d9, 0x1a69: 0x0fa9,\n\t0x1a6a: 0x0fb9, 0x1a6b: 0x1089, 0x1a6c: 0x0279, 0x1a6d: 0x0369, 0x1a6e: 0x0289, 0x1a6f: 0x13d1,\n\t0x1a70: 0x0039, 0x1a71: 0x0ee9, 0x1a72: 0x1159, 0x1a73: 0x0ef9, 0x1a74: 0x0f09, 0x1a75: 0x1199,\n\t0x1a76: 0x0f31, 0x1a77: 0x0249, 0x1a78: 0x0f41, 0x1a79: 0x0259, 0x1a7a: 0x0f51, 0x1a7b: 0x0359,\n\t0x1a7c: 0x0f61, 0x1a7d: 0x0f71, 0x1a7e: 0x00d9, 0x1a7f: 0x0f99,\n\t// Block 0x6a, offset 0x1a80\n\t0x1a80: 0x2039, 0x1a81: 0x0269, 0x1a82: 0x01d9, 0x1a83: 0x0fa9, 0x1a84: 0x0fb9, 0x1a85: 0x1089,\n\t0x1a86: 0x0279, 0x1a87: 0x0369, 0x1a88: 0x0289, 0x1a89: 0x13d1, 0x1a8a: 0x0039, 0x1a8b: 0x0ee9,\n\t0x1a8c: 0x1159, 0x1a8d: 0x0ef9, 0x1a8e: 0x0f09, 0x1a8f: 0x1199, 0x1a90: 0x0f31, 0x1a91: 0x0249,\n\t0x1a92: 0x0f41, 0x1a93: 0x0259, 0x1a94: 0x0f51, 0x1a95: 0x0359, 0x1a96: 0x0f61, 0x1a97: 0x0f71,\n\t0x1a98: 0x00d9, 0x1a99: 0x0f99, 0x1a9a: 0x2039, 0x1a9b: 0x0269, 0x1a9c: 0x01d9, 0x1a9d: 0x0fa9,\n\t0x1a9e: 0x0fb9, 0x1a9f: 0x1089, 0x1aa0: 0x0279, 0x1aa1: 0x0369, 0x1aa2: 0x0289, 0x1aa3: 0x13d1,\n\t0x1aa4: 0xba81, 0x1aa5: 0xba99, 0x1aa6: 0x0040, 0x1aa7: 0x0040, 0x1aa8: 0xbab1, 0x1aa9: 0x1099,\n\t0x1aaa: 0x10b1, 0x1aab: 0x10c9, 0x1aac: 0xbac9, 0x1aad: 0xbae1, 0x1aae: 0xbaf9, 0x1aaf: 0x1429,\n\t0x1ab0: 0x1a31, 0x1ab1: 0xbb11, 0x1ab2: 0xbb29, 0x1ab3: 0xbb41, 0x1ab4: 0xbb59, 0x1ab5: 0xbb71,\n\t0x1ab6: 0xbb89, 0x1ab7: 0x2109, 0x1ab8: 0x1111, 0x1ab9: 0x1429, 0x1aba: 0xbba1, 0x1abb: 0xbbb9,\n\t0x1abc: 0xbbd1, 0x1abd: 0x10e1, 0x1abe: 0x10f9, 0x1abf: 0xbbe9,\n\t// Block 0x6b, offset 0x1ac0\n\t0x1ac0: 0x2079, 0x1ac1: 0xbc01, 0x1ac2: 0xbab1, 0x1ac3: 0x1099, 0x1ac4: 0x10b1, 0x1ac5: 0x10c9,\n\t0x1ac6: 0xbac9, 0x1ac7: 0xbae1, 0x1ac8: 0xbaf9, 0x1ac9: 0x1429, 0x1aca: 0x1a31, 0x1acb: 0xbb11,\n\t0x1acc: 0xbb29, 0x1acd: 0xbb41, 0x1ace: 0xbb59, 0x1acf: 0xbb71, 0x1ad0: 0xbb89, 0x1ad1: 0x2109,\n\t0x1ad2: 0x1111, 0x1ad3: 0xbba1, 0x1ad4: 0xbba1, 0x1ad5: 0xbbb9, 0x1ad6: 0xbbd1, 0x1ad7: 0x10e1,\n\t0x1ad8: 0x10f9, 0x1ad9: 0xbbe9, 0x1ada: 0x2079, 0x1adb: 0xbc21, 0x1adc: 0xbac9, 0x1add: 0x1429,\n\t0x1ade: 0xbb11, 0x1adf: 0x10e1, 0x1ae0: 0x1111, 0x1ae1: 0x2109, 0x1ae2: 0xbab1, 0x1ae3: 0x1099,\n\t0x1ae4: 0x10b1, 0x1ae5: 0x10c9, 0x1ae6: 0xbac9, 0x1ae7: 0xbae1, 0x1ae8: 0xbaf9, 0x1ae9: 0x1429,\n\t0x1aea: 0x1a31, 0x1aeb: 0xbb11, 0x1aec: 0xbb29, 0x1aed: 0xbb41, 0x1aee: 0xbb59, 0x1aef: 0xbb71,\n\t0x1af0: 0xbb89, 0x1af1: 0x2109, 0x1af2: 0x1111, 0x1af3: 0x1429, 0x1af4: 0xbba1, 0x1af5: 0xbbb9,\n\t0x1af6: 0xbbd1, 0x1af7: 0x10e1, 0x1af8: 0x10f9, 0x1af9: 0xbbe9, 0x1afa: 0x2079, 0x1afb: 0xbc01,\n\t0x1afc: 0xbab1, 0x1afd: 0x1099, 0x1afe: 0x10b1, 0x1aff: 0x10c9,\n\t// Block 0x6c, offset 0x1b00\n\t0x1b00: 0xbac9, 0x1b01: 0xbae1, 0x1b02: 0xbaf9, 0x1b03: 0x1429, 0x1b04: 0x1a31, 0x1b05: 0xbb11,\n\t0x1b06: 0xbb29, 0x1b07: 0xbb41, 0x1b08: 0xbb59, 0x1b09: 0xbb71, 0x1b0a: 0xbb89, 0x1b0b: 0x2109,\n\t0x1b0c: 0x1111, 0x1b0d: 0xbba1, 0x1b0e: 0xbba1, 0x1b0f: 0xbbb9, 0x1b10: 0xbbd1, 0x1b11: 0x10e1,\n\t0x1b12: 0x10f9, 0x1b13: 0xbbe9, 0x1b14: 0x2079, 0x1b15: 0xbc21, 0x1b16: 0xbac9, 0x1b17: 0x1429,\n\t0x1b18: 0xbb11, 0x1b19: 0x10e1, 0x1b1a: 0x1111, 0x1b1b: 0x2109, 0x1b1c: 0xbab1, 0x1b1d: 0x1099,\n\t0x1b1e: 0x10b1, 0x1b1f: 0x10c9, 0x1b20: 0xbac9, 0x1b21: 0xbae1, 0x1b22: 0xbaf9, 0x1b23: 0x1429,\n\t0x1b24: 0x1a31, 0x1b25: 0xbb11, 0x1b26: 0xbb29, 0x1b27: 0xbb41, 0x1b28: 0xbb59, 0x1b29: 0xbb71,\n\t0x1b2a: 0xbb89, 0x1b2b: 0x2109, 0x1b2c: 0x1111, 0x1b2d: 0x1429, 0x1b2e: 0xbba1, 0x1b2f: 0xbbb9,\n\t0x1b30: 0xbbd1, 0x1b31: 0x10e1, 0x1b32: 0x10f9, 0x1b33: 0xbbe9, 0x1b34: 0x2079, 0x1b35: 0xbc01,\n\t0x1b36: 0xbab1, 0x1b37: 0x1099, 0x1b38: 0x10b1, 0x1b39: 0x10c9, 0x1b3a: 0xbac9, 0x1b3b: 0xbae1,\n\t0x1b3c: 0xbaf9, 0x1b3d: 0x1429, 0x1b3e: 0x1a31, 0x1b3f: 0xbb11,\n\t// Block 0x6d, offset 0x1b40\n\t0x1b40: 0xbb29, 0x1b41: 0xbb41, 0x1b42: 0xbb59, 0x1b43: 0xbb71, 0x1b44: 0xbb89, 0x1b45: 0x2109,\n\t0x1b46: 0x1111, 0x1b47: 0xbba1, 0x1b48: 0xbba1, 0x1b49: 0xbbb9, 0x1b4a: 0xbbd1, 0x1b4b: 0x10e1,\n\t0x1b4c: 0x10f9, 0x1b4d: 0xbbe9, 0x1b4e: 0x2079, 0x1b4f: 0xbc21, 0x1b50: 0xbac9, 0x1b51: 0x1429,\n\t0x1b52: 0xbb11, 0x1b53: 0x10e1, 0x1b54: 0x1111, 0x1b55: 0x2109, 0x1b56: 0xbab1, 0x1b57: 0x1099,\n\t0x1b58: 0x10b1, 0x1b59: 0x10c9, 0x1b5a: 0xbac9, 0x1b5b: 0xbae1, 0x1b5c: 0xbaf9, 0x1b5d: 0x1429,\n\t0x1b5e: 0x1a31, 0x1b5f: 0xbb11, 0x1b60: 0xbb29, 0x1b61: 0xbb41, 0x1b62: 0xbb59, 0x1b63: 0xbb71,\n\t0x1b64: 0xbb89, 0x1b65: 0x2109, 0x1b66: 0x1111, 0x1b67: 0x1429, 0x1b68: 0xbba1, 0x1b69: 0xbbb9,\n\t0x1b6a: 0xbbd1, 0x1b6b: 0x10e1, 0x1b6c: 0x10f9, 0x1b6d: 0xbbe9, 0x1b6e: 0x2079, 0x1b6f: 0xbc01,\n\t0x1b70: 0xbab1, 0x1b71: 0x1099, 0x1b72: 0x10b1, 0x1b73: 0x10c9, 0x1b74: 0xbac9, 0x1b75: 0xbae1,\n\t0x1b76: 0xbaf9, 0x1b77: 0x1429, 0x1b78: 0x1a31, 0x1b79: 0xbb11, 0x1b7a: 0xbb29, 0x1b7b: 0xbb41,\n\t0x1b7c: 0xbb59, 0x1b7d: 0xbb71, 0x1b7e: 0xbb89, 0x1b7f: 0x2109,\n\t// Block 0x6e, offset 0x1b80\n\t0x1b80: 0x1111, 0x1b81: 0xbba1, 0x1b82: 0xbba1, 0x1b83: 0xbbb9, 0x1b84: 0xbbd1, 0x1b85: 0x10e1,\n\t0x1b86: 0x10f9, 0x1b87: 0xbbe9, 0x1b88: 0x2079, 0x1b89: 0xbc21, 0x1b8a: 0xbac9, 0x1b8b: 0x1429,\n\t0x1b8c: 0xbb11, 0x1b8d: 0x10e1, 0x1b8e: 0x1111, 0x1b8f: 0x2109, 0x1b90: 0xbab1, 0x1b91: 0x1099,\n\t0x1b92: 0x10b1, 0x1b93: 0x10c9, 0x1b94: 0xbac9, 0x1b95: 0xbae1, 0x1b96: 0xbaf9, 0x1b97: 0x1429,\n\t0x1b98: 0x1a31, 0x1b99: 0xbb11, 0x1b9a: 0xbb29, 0x1b9b: 0xbb41, 0x1b9c: 0xbb59, 0x1b9d: 0xbb71,\n\t0x1b9e: 0xbb89, 0x1b9f: 0x2109, 0x1ba0: 0x1111, 0x1ba1: 0x1429, 0x1ba2: 0xbba1, 0x1ba3: 0xbbb9,\n\t0x1ba4: 0xbbd1, 0x1ba5: 0x10e1, 0x1ba6: 0x10f9, 0x1ba7: 0xbbe9, 0x1ba8: 0x2079, 0x1ba9: 0xbc01,\n\t0x1baa: 0xbab1, 0x1bab: 0x1099, 0x1bac: 0x10b1, 0x1bad: 0x10c9, 0x1bae: 0xbac9, 0x1baf: 0xbae1,\n\t0x1bb0: 0xbaf9, 0x1bb1: 0x1429, 0x1bb2: 0x1a31, 0x1bb3: 0xbb11, 0x1bb4: 0xbb29, 0x1bb5: 0xbb41,\n\t0x1bb6: 0xbb59, 0x1bb7: 0xbb71, 0x1bb8: 0xbb89, 0x1bb9: 0x2109, 0x1bba: 0x1111, 0x1bbb: 0xbba1,\n\t0x1bbc: 0xbba1, 0x1bbd: 0xbbb9, 0x1bbe: 0xbbd1, 0x1bbf: 0x10e1,\n\t// Block 0x6f, offset 0x1bc0\n\t0x1bc0: 0x10f9, 0x1bc1: 0xbbe9, 0x1bc2: 0x2079, 0x1bc3: 0xbc21, 0x1bc4: 0xbac9, 0x1bc5: 0x1429,\n\t0x1bc6: 0xbb11, 0x1bc7: 0x10e1, 0x1bc8: 0x1111, 0x1bc9: 0x2109, 0x1bca: 0xbc41, 0x1bcb: 0xbc41,\n\t0x1bcc: 0x0040, 0x1bcd: 0x0040, 0x1bce: 0x1f41, 0x1bcf: 0x00c9, 0x1bd0: 0x0069, 0x1bd1: 0x0079,\n\t0x1bd2: 0x1f51, 0x1bd3: 0x1f61, 0x1bd4: 0x1f71, 0x1bd5: 0x1f81, 0x1bd6: 0x1f91, 0x1bd7: 0x1fa1,\n\t0x1bd8: 0x1f41, 0x1bd9: 0x00c9, 0x1bda: 0x0069, 0x1bdb: 0x0079, 0x1bdc: 0x1f51, 0x1bdd: 0x1f61,\n\t0x1bde: 0x1f71, 0x1bdf: 0x1f81, 0x1be0: 0x1f91, 0x1be1: 0x1fa1, 0x1be2: 0x1f41, 0x1be3: 0x00c9,\n\t0x1be4: 0x0069, 0x1be5: 0x0079, 0x1be6: 0x1f51, 0x1be7: 0x1f61, 0x1be8: 0x1f71, 0x1be9: 0x1f81,\n\t0x1bea: 0x1f91, 0x1beb: 0x1fa1, 0x1bec: 0x1f41, 0x1bed: 0x00c9, 0x1bee: 0x0069, 0x1bef: 0x0079,\n\t0x1bf0: 0x1f51, 0x1bf1: 0x1f61, 0x1bf2: 0x1f71, 0x1bf3: 0x1f81, 0x1bf4: 0x1f91, 0x1bf5: 0x1fa1,\n\t0x1bf6: 0x1f41, 0x1bf7: 0x00c9, 0x1bf8: 0x0069, 0x1bf9: 0x0079, 0x1bfa: 0x1f51, 0x1bfb: 0x1f61,\n\t0x1bfc: 0x1f71, 0x1bfd: 0x1f81, 0x1bfe: 0x1f91, 0x1bff: 0x1fa1,\n\t// Block 0x70, offset 0x1c00\n\t0x1c00: 0xe115, 0x1c01: 0xe115, 0x1c02: 0xe135, 0x1c03: 0xe135, 0x1c04: 0xe115, 0x1c05: 0xe115,\n\t0x1c06: 0xe175, 0x1c07: 0xe175, 0x1c08: 0xe115, 0x1c09: 0xe115, 0x1c0a: 0xe135, 0x1c0b: 0xe135,\n\t0x1c0c: 0xe115, 0x1c0d: 0xe115, 0x1c0e: 0xe1f5, 0x1c0f: 0xe1f5, 0x1c10: 0xe115, 0x1c11: 0xe115,\n\t0x1c12: 0xe135, 0x1c13: 0xe135, 0x1c14: 0xe115, 0x1c15: 0xe115, 0x1c16: 0xe175, 0x1c17: 0xe175,\n\t0x1c18: 0xe115, 0x1c19: 0xe115, 0x1c1a: 0xe135, 0x1c1b: 0xe135, 0x1c1c: 0xe115, 0x1c1d: 0xe115,\n\t0x1c1e: 0x8b05, 0x1c1f: 0x8b05, 0x1c20: 0x04b5, 0x1c21: 0x04b5, 0x1c22: 0x0a08, 0x1c23: 0x0a08,\n\t0x1c24: 0x0a08, 0x1c25: 0x0a08, 0x1c26: 0x0a08, 0x1c27: 0x0a08, 0x1c28: 0x0a08, 0x1c29: 0x0a08,\n\t0x1c2a: 0x0a08, 0x1c2b: 0x0a08, 0x1c2c: 0x0a08, 0x1c2d: 0x0a08, 0x1c2e: 0x0a08, 0x1c2f: 0x0a08,\n\t0x1c30: 0x0a08, 0x1c31: 0x0a08, 0x1c32: 0x0a08, 0x1c33: 0x0a08, 0x1c34: 0x0a08, 0x1c35: 0x0a08,\n\t0x1c36: 0x0a08, 0x1c37: 0x0a08, 0x1c38: 0x0a08, 0x1c39: 0x0a08, 0x1c3a: 0x0a08, 0x1c3b: 0x0a08,\n\t0x1c3c: 0x0a08, 0x1c3d: 0x0a08, 0x1c3e: 0x0a08, 0x1c3f: 0x0a08,\n\t// Block 0x71, offset 0x1c40\n\t0x1c40: 0xb189, 0x1c41: 0xb1a1, 0x1c42: 0xb201, 0x1c43: 0xb249, 0x1c44: 0x0040, 0x1c45: 0xb411,\n\t0x1c46: 0xb291, 0x1c47: 0xb219, 0x1c48: 0xb309, 0x1c49: 0xb429, 0x1c4a: 0xb399, 0x1c4b: 0xb3b1,\n\t0x1c4c: 0xb3c9, 0x1c4d: 0xb3e1, 0x1c4e: 0xb2a9, 0x1c4f: 0xb339, 0x1c50: 0xb369, 0x1c51: 0xb2d9,\n\t0x1c52: 0xb381, 0x1c53: 0xb279, 0x1c54: 0xb2c1, 0x1c55: 0xb1d1, 0x1c56: 0xb1e9, 0x1c57: 0xb231,\n\t0x1c58: 0xb261, 0x1c59: 0xb2f1, 0x1c5a: 0xb321, 0x1c5b: 0xb351, 0x1c5c: 0xbc59, 0x1c5d: 0x7949,\n\t0x1c5e: 0xbc71, 0x1c5f: 0xbc89, 0x1c60: 0x0040, 0x1c61: 0xb1a1, 0x1c62: 0xb201, 0x1c63: 0x0040,\n\t0x1c64: 0xb3f9, 0x1c65: 0x0040, 0x1c66: 0x0040, 0x1c67: 0xb219, 0x1c68: 0x0040, 0x1c69: 0xb429,\n\t0x1c6a: 0xb399, 0x1c6b: 0xb3b1, 0x1c6c: 0xb3c9, 0x1c6d: 0xb3e1, 0x1c6e: 0xb2a9, 0x1c6f: 0xb339,\n\t0x1c70: 0xb369, 0x1c71: 0xb2d9, 0x1c72: 0xb381, 0x1c73: 0x0040, 0x1c74: 0xb2c1, 0x1c75: 0xb1d1,\n\t0x1c76: 0xb1e9, 0x1c77: 0xb231, 0x1c78: 0x0040, 0x1c79: 0xb2f1, 0x1c7a: 0x0040, 0x1c7b: 0xb351,\n\t0x1c7c: 0x0040, 0x1c7d: 0x0040, 0x1c7e: 0x0040, 0x1c7f: 0x0040,\n\t// Block 0x72, offset 0x1c80\n\t0x1c80: 0x0040, 0x1c81: 0x0040, 0x1c82: 0xb201, 0x1c83: 0x0040, 0x1c84: 0x0040, 0x1c85: 0x0040,\n\t0x1c86: 0x0040, 0x1c87: 0xb219, 0x1c88: 0x0040, 0x1c89: 0xb429, 0x1c8a: 0x0040, 0x1c8b: 0xb3b1,\n\t0x1c8c: 0x0040, 0x1c8d: 0xb3e1, 0x1c8e: 0xb2a9, 0x1c8f: 0xb339, 0x1c90: 0x0040, 0x1c91: 0xb2d9,\n\t0x1c92: 0xb381, 0x1c93: 0x0040, 0x1c94: 0xb2c1, 0x1c95: 0x0040, 0x1c96: 0x0040, 0x1c97: 0xb231,\n\t0x1c98: 0x0040, 0x1c99: 0xb2f1, 0x1c9a: 0x0040, 0x1c9b: 0xb351, 0x1c9c: 0x0040, 0x1c9d: 0x7949,\n\t0x1c9e: 0x0040, 0x1c9f: 0xbc89, 0x1ca0: 0x0040, 0x1ca1: 0xb1a1, 0x1ca2: 0xb201, 0x1ca3: 0x0040,\n\t0x1ca4: 0xb3f9, 0x1ca5: 0x0040, 0x1ca6: 0x0040, 0x1ca7: 0xb219, 0x1ca8: 0xb309, 0x1ca9: 0xb429,\n\t0x1caa: 0xb399, 0x1cab: 0x0040, 0x1cac: 0xb3c9, 0x1cad: 0xb3e1, 0x1cae: 0xb2a9, 0x1caf: 0xb339,\n\t0x1cb0: 0xb369, 0x1cb1: 0xb2d9, 0x1cb2: 0xb381, 0x1cb3: 0x0040, 0x1cb4: 0xb2c1, 0x1cb5: 0xb1d1,\n\t0x1cb6: 0xb1e9, 0x1cb7: 0xb231, 0x1cb8: 0x0040, 0x1cb9: 0xb2f1, 0x1cba: 0xb321, 0x1cbb: 0xb351,\n\t0x1cbc: 0xbc59, 0x1cbd: 0x0040, 0x1cbe: 0xbc71, 0x1cbf: 0x0040,\n\t// Block 0x73, offset 0x1cc0\n\t0x1cc0: 0xb189, 0x1cc1: 0xb1a1, 0x1cc2: 0xb201, 0x1cc3: 0xb249, 0x1cc4: 0xb3f9, 0x1cc5: 0xb411,\n\t0x1cc6: 0xb291, 0x1cc7: 0xb219, 0x1cc8: 0xb309, 0x1cc9: 0xb429, 0x1cca: 0x0040, 0x1ccb: 0xb3b1,\n\t0x1ccc: 0xb3c9, 0x1ccd: 0xb3e1, 0x1cce: 0xb2a9, 0x1ccf: 0xb339, 0x1cd0: 0xb369, 0x1cd1: 0xb2d9,\n\t0x1cd2: 0xb381, 0x1cd3: 0xb279, 0x1cd4: 0xb2c1, 0x1cd5: 0xb1d1, 0x1cd6: 0xb1e9, 0x1cd7: 0xb231,\n\t0x1cd8: 0xb261, 0x1cd9: 0xb2f1, 0x1cda: 0xb321, 0x1cdb: 0xb351, 0x1cdc: 0x0040, 0x1cdd: 0x0040,\n\t0x1cde: 0x0040, 0x1cdf: 0x0040, 0x1ce0: 0x0040, 0x1ce1: 0xb1a1, 0x1ce2: 0xb201, 0x1ce3: 0xb249,\n\t0x1ce4: 0x0040, 0x1ce5: 0xb411, 0x1ce6: 0xb291, 0x1ce7: 0xb219, 0x1ce8: 0xb309, 0x1ce9: 0xb429,\n\t0x1cea: 0x0040, 0x1ceb: 0xb3b1, 0x1cec: 0xb3c9, 0x1ced: 0xb3e1, 0x1cee: 0xb2a9, 0x1cef: 0xb339,\n\t0x1cf0: 0xb369, 0x1cf1: 0xb2d9, 0x1cf2: 0xb381, 0x1cf3: 0xb279, 0x1cf4: 0xb2c1, 0x1cf5: 0xb1d1,\n\t0x1cf6: 0xb1e9, 0x1cf7: 0xb231, 0x1cf8: 0xb261, 0x1cf9: 0xb2f1, 0x1cfa: 0xb321, 0x1cfb: 0xb351,\n\t0x1cfc: 0x0040, 0x1cfd: 0x0040, 0x1cfe: 0x0040, 0x1cff: 0x0040,\n\t// Block 0x74, offset 0x1d00\n\t0x1d00: 0x0040, 0x1d01: 0xbca2, 0x1d02: 0xbcba, 0x1d03: 0xbcd2, 0x1d04: 0xbcea, 0x1d05: 0xbd02,\n\t0x1d06: 0xbd1a, 0x1d07: 0xbd32, 0x1d08: 0xbd4a, 0x1d09: 0xbd62, 0x1d0a: 0xbd7a, 0x1d0b: 0x0018,\n\t0x1d0c: 0x0018, 0x1d0d: 0x0040, 0x1d0e: 0x0040, 0x1d0f: 0x0040, 0x1d10: 0xbd92, 0x1d11: 0xbdb2,\n\t0x1d12: 0xbdd2, 0x1d13: 0xbdf2, 0x1d14: 0xbe12, 0x1d15: 0xbe32, 0x1d16: 0xbe52, 0x1d17: 0xbe72,\n\t0x1d18: 0xbe92, 0x1d19: 0xbeb2, 0x1d1a: 0xbed2, 0x1d1b: 0xbef2, 0x1d1c: 0xbf12, 0x1d1d: 0xbf32,\n\t0x1d1e: 0xbf52, 0x1d1f: 0xbf72, 0x1d20: 0xbf92, 0x1d21: 0xbfb2, 0x1d22: 0xbfd2, 0x1d23: 0xbff2,\n\t0x1d24: 0xc012, 0x1d25: 0xc032, 0x1d26: 0xc052, 0x1d27: 0xc072, 0x1d28: 0xc092, 0x1d29: 0xc0b2,\n\t0x1d2a: 0xc0d1, 0x1d2b: 0x1159, 0x1d2c: 0x0269, 0x1d2d: 0x6671, 0x1d2e: 0xc111, 0x1d2f: 0x0040,\n\t0x1d30: 0x0039, 0x1d31: 0x0ee9, 0x1d32: 0x1159, 0x1d33: 0x0ef9, 0x1d34: 0x0f09, 0x1d35: 0x1199,\n\t0x1d36: 0x0f31, 0x1d37: 0x0249, 0x1d38: 0x0f41, 0x1d39: 0x0259, 0x1d3a: 0x0f51, 0x1d3b: 0x0359,\n\t0x1d3c: 0x0f61, 0x1d3d: 0x0f71, 0x1d3e: 0x00d9, 0x1d3f: 0x0f99,\n\t// Block 0x75, offset 0x1d40\n\t0x1d40: 0x2039, 0x1d41: 0x0269, 0x1d42: 0x01d9, 0x1d43: 0x0fa9, 0x1d44: 0x0fb9, 0x1d45: 0x1089,\n\t0x1d46: 0x0279, 0x1d47: 0x0369, 0x1d48: 0x0289, 0x1d49: 0x13d1, 0x1d4a: 0xc129, 0x1d4b: 0x65b1,\n\t0x1d4c: 0xc141, 0x1d4d: 0x1441, 0x1d4e: 0xc159, 0x1d4f: 0xc179, 0x1d50: 0x0018, 0x1d51: 0x0018,\n\t0x1d52: 0x0018, 0x1d53: 0x0018, 0x1d54: 0x0018, 0x1d55: 0x0018, 0x1d56: 0x0018, 0x1d57: 0x0018,\n\t0x1d58: 0x0018, 0x1d59: 0x0018, 0x1d5a: 0x0018, 0x1d5b: 0x0018, 0x1d5c: 0x0018, 0x1d5d: 0x0018,\n\t0x1d5e: 0x0018, 0x1d5f: 0x0018, 0x1d60: 0x0018, 0x1d61: 0x0018, 0x1d62: 0x0018, 0x1d63: 0x0018,\n\t0x1d64: 0x0018, 0x1d65: 0x0018, 0x1d66: 0x0018, 0x1d67: 0x0018, 0x1d68: 0x0018, 0x1d69: 0x0018,\n\t0x1d6a: 0xc191, 0x1d6b: 0xc1a9, 0x1d6c: 0x0040, 0x1d6d: 0x0040, 0x1d6e: 0x0040, 0x1d6f: 0x0040,\n\t0x1d70: 0x0018, 0x1d71: 0x0018, 0x1d72: 0x0018, 0x1d73: 0x0018, 0x1d74: 0x0018, 0x1d75: 0x0018,\n\t0x1d76: 0x0018, 0x1d77: 0x0018, 0x1d78: 0x0018, 0x1d79: 0x0018, 0x1d7a: 0x0018, 0x1d7b: 0x0018,\n\t0x1d7c: 0x0018, 0x1d7d: 0x0018, 0x1d7e: 0x0018, 0x1d7f: 0x0018,\n\t// Block 0x76, offset 0x1d80\n\t0x1d80: 0xc1d9, 0x1d81: 0xc211, 0x1d82: 0xc249, 0x1d83: 0x0040, 0x1d84: 0x0040, 0x1d85: 0x0040,\n\t0x1d86: 0x0040, 0x1d87: 0x0040, 0x1d88: 0x0040, 0x1d89: 0x0040, 0x1d8a: 0x0040, 0x1d8b: 0x0040,\n\t0x1d8c: 0x0040, 0x1d8d: 0x0040, 0x1d8e: 0x0040, 0x1d8f: 0x0040, 0x1d90: 0xc269, 0x1d91: 0xc289,\n\t0x1d92: 0xc2a9, 0x1d93: 0xc2c9, 0x1d94: 0xc2e9, 0x1d95: 0xc309, 0x1d96: 0xc329, 0x1d97: 0xc349,\n\t0x1d98: 0xc369, 0x1d99: 0xc389, 0x1d9a: 0xc3a9, 0x1d9b: 0xc3c9, 0x1d9c: 0xc3e9, 0x1d9d: 0xc409,\n\t0x1d9e: 0xc429, 0x1d9f: 0xc449, 0x1da0: 0xc469, 0x1da1: 0xc489, 0x1da2: 0xc4a9, 0x1da3: 0xc4c9,\n\t0x1da4: 0xc4e9, 0x1da5: 0xc509, 0x1da6: 0xc529, 0x1da7: 0xc549, 0x1da8: 0xc569, 0x1da9: 0xc589,\n\t0x1daa: 0xc5a9, 0x1dab: 0xc5c9, 0x1dac: 0xc5e9, 0x1dad: 0xc609, 0x1dae: 0xc629, 0x1daf: 0xc649,\n\t0x1db0: 0xc669, 0x1db1: 0xc689, 0x1db2: 0xc6a9, 0x1db3: 0xc6c9, 0x1db4: 0xc6e9, 0x1db5: 0xc709,\n\t0x1db6: 0xc729, 0x1db7: 0xc749, 0x1db8: 0xc769, 0x1db9: 0xc789, 0x1dba: 0xc7a9, 0x1dbb: 0xc7c9,\n\t0x1dbc: 0x0040, 0x1dbd: 0x0040, 0x1dbe: 0x0040, 0x1dbf: 0x0040,\n\t// Block 0x77, offset 0x1dc0\n\t0x1dc0: 0xcaf9, 0x1dc1: 0xcb19, 0x1dc2: 0xcb39, 0x1dc3: 0x8b1d, 0x1dc4: 0xcb59, 0x1dc5: 0xcb79,\n\t0x1dc6: 0xcb99, 0x1dc7: 0xcbb9, 0x1dc8: 0xcbd9, 0x1dc9: 0xcbf9, 0x1dca: 0xcc19, 0x1dcb: 0xcc39,\n\t0x1dcc: 0xcc59, 0x1dcd: 0x8b3d, 0x1dce: 0xcc79, 0x1dcf: 0xcc99, 0x1dd0: 0xccb9, 0x1dd1: 0xccd9,\n\t0x1dd2: 0x8b5d, 0x1dd3: 0xccf9, 0x1dd4: 0xcd19, 0x1dd5: 0xc429, 0x1dd6: 0x8b7d, 0x1dd7: 0xcd39,\n\t0x1dd8: 0xcd59, 0x1dd9: 0xcd79, 0x1dda: 0xcd99, 0x1ddb: 0xcdb9, 0x1ddc: 0x8b9d, 0x1ddd: 0xcdd9,\n\t0x1dde: 0xcdf9, 0x1ddf: 0xce19, 0x1de0: 0xce39, 0x1de1: 0xce59, 0x1de2: 0xc789, 0x1de3: 0xce79,\n\t0x1de4: 0xce99, 0x1de5: 0xceb9, 0x1de6: 0xced9, 0x1de7: 0xcef9, 0x1de8: 0xcf19, 0x1de9: 0xcf39,\n\t0x1dea: 0xcf59, 0x1deb: 0xcf79, 0x1dec: 0xcf99, 0x1ded: 0xcfb9, 0x1dee: 0xcfd9, 0x1def: 0xcff9,\n\t0x1df0: 0xd019, 0x1df1: 0xd039, 0x1df2: 0xd039, 0x1df3: 0xd039, 0x1df4: 0x8bbd, 0x1df5: 0xd059,\n\t0x1df6: 0xd079, 0x1df7: 0xd099, 0x1df8: 0x8bdd, 0x1df9: 0xd0b9, 0x1dfa: 0xd0d9, 0x1dfb: 0xd0f9,\n\t0x1dfc: 0xd119, 0x1dfd: 0xd139, 0x1dfe: 0xd159, 0x1dff: 0xd179,\n\t// Block 0x78, offset 0x1e00\n\t0x1e00: 0xd199, 0x1e01: 0xd1b9, 0x1e02: 0xd1d9, 0x1e03: 0xd1f9, 0x1e04: 0xd219, 0x1e05: 0xd239,\n\t0x1e06: 0xd239, 0x1e07: 0xd259, 0x1e08: 0xd279, 0x1e09: 0xd299, 0x1e0a: 0xd2b9, 0x1e0b: 0xd2d9,\n\t0x1e0c: 0xd2f9, 0x1e0d: 0xd319, 0x1e0e: 0xd339, 0x1e0f: 0xd359, 0x1e10: 0xd379, 0x1e11: 0xd399,\n\t0x1e12: 0xd3b9, 0x1e13: 0xd3d9, 0x1e14: 0xd3f9, 0x1e15: 0xd419, 0x1e16: 0xd439, 0x1e17: 0xd459,\n\t0x1e18: 0xd479, 0x1e19: 0x8bfd, 0x1e1a: 0xd499, 0x1e1b: 0xd4b9, 0x1e1c: 0xd4d9, 0x1e1d: 0xc309,\n\t0x1e1e: 0xd4f9, 0x1e1f: 0xd519, 0x1e20: 0x8c1d, 0x1e21: 0x8c3d, 0x1e22: 0xd539, 0x1e23: 0xd559,\n\t0x1e24: 0xd579, 0x1e25: 0xd599, 0x1e26: 0xd5b9, 0x1e27: 0xd5d9, 0x1e28: 0x2040, 0x1e29: 0xd5f9,\n\t0x1e2a: 0xd619, 0x1e2b: 0xd619, 0x1e2c: 0x8c5d, 0x1e2d: 0xd639, 0x1e2e: 0xd659, 0x1e2f: 0xd679,\n\t0x1e30: 0xd699, 0x1e31: 0x8c7d, 0x1e32: 0xd6b9, 0x1e33: 0xd6d9, 0x1e34: 0x2040, 0x1e35: 0xd6f9,\n\t0x1e36: 0xd719, 0x1e37: 0xd739, 0x1e38: 0xd759, 0x1e39: 0xd779, 0x1e3a: 0xd799, 0x1e3b: 0x8c9d,\n\t0x1e3c: 0xd7b9, 0x1e3d: 0x8cbd, 0x1e3e: 0xd7d9, 0x1e3f: 0xd7f9,\n\t// Block 0x79, offset 0x1e40\n\t0x1e40: 0xd819, 0x1e41: 0xd839, 0x1e42: 0xd859, 0x1e43: 0xd879, 0x1e44: 0xd899, 0x1e45: 0xd8b9,\n\t0x1e46: 0xd8d9, 0x1e47: 0xd8f9, 0x1e48: 0xd919, 0x1e49: 0x8cdd, 0x1e4a: 0xd939, 0x1e4b: 0xd959,\n\t0x1e4c: 0xd979, 0x1e4d: 0xd999, 0x1e4e: 0xd9b9, 0x1e4f: 0x8cfd, 0x1e50: 0xd9d9, 0x1e51: 0x8d1d,\n\t0x1e52: 0x8d3d, 0x1e53: 0xd9f9, 0x1e54: 0xda19, 0x1e55: 0xda19, 0x1e56: 0xda39, 0x1e57: 0x8d5d,\n\t0x1e58: 0x8d7d, 0x1e59: 0xda59, 0x1e5a: 0xda79, 0x1e5b: 0xda99, 0x1e5c: 0xdab9, 0x1e5d: 0xdad9,\n\t0x1e5e: 0xdaf9, 0x1e5f: 0xdb19, 0x1e60: 0xdb39, 0x1e61: 0xdb59, 0x1e62: 0xdb79, 0x1e63: 0xdb99,\n\t0x1e64: 0x8d9d, 0x1e65: 0xdbb9, 0x1e66: 0xdbd9, 0x1e67: 0xdbf9, 0x1e68: 0xdc19, 0x1e69: 0xdbf9,\n\t0x1e6a: 0xdc39, 0x1e6b: 0xdc59, 0x1e6c: 0xdc79, 0x1e6d: 0xdc99, 0x1e6e: 0xdcb9, 0x1e6f: 0xdcd9,\n\t0x1e70: 0xdcf9, 0x1e71: 0xdd19, 0x1e72: 0xdd39, 0x1e73: 0xdd59, 0x1e74: 0xdd79, 0x1e75: 0xdd99,\n\t0x1e76: 0xddb9, 0x1e77: 0xddd9, 0x1e78: 0x8dbd, 0x1e79: 0xddf9, 0x1e7a: 0xde19, 0x1e7b: 0xde39,\n\t0x1e7c: 0xde59, 0x1e7d: 0xde79, 0x1e7e: 0x8ddd, 0x1e7f: 0xde99,\n\t// Block 0x7a, offset 0x1e80\n\t0x1e80: 0xe599, 0x1e81: 0xe5b9, 0x1e82: 0xe5d9, 0x1e83: 0xe5f9, 0x1e84: 0xe619, 0x1e85: 0xe639,\n\t0x1e86: 0x8efd, 0x1e87: 0xe659, 0x1e88: 0xe679, 0x1e89: 0xe699, 0x1e8a: 0xe6b9, 0x1e8b: 0xe6d9,\n\t0x1e8c: 0xe6f9, 0x1e8d: 0x8f1d, 0x1e8e: 0xe719, 0x1e8f: 0xe739, 0x1e90: 0x8f3d, 0x1e91: 0x8f5d,\n\t0x1e92: 0xe759, 0x1e93: 0xe779, 0x1e94: 0xe799, 0x1e95: 0xe7b9, 0x1e96: 0xe7d9, 0x1e97: 0xe7f9,\n\t0x1e98: 0xe819, 0x1e99: 0xe839, 0x1e9a: 0xe859, 0x1e9b: 0x8f7d, 0x1e9c: 0xe879, 0x1e9d: 0x8f9d,\n\t0x1e9e: 0xe899, 0x1e9f: 0x2040, 0x1ea0: 0xe8b9, 0x1ea1: 0xe8d9, 0x1ea2: 0xe8f9, 0x1ea3: 0x8fbd,\n\t0x1ea4: 0xe919, 0x1ea5: 0xe939, 0x1ea6: 0x8fdd, 0x1ea7: 0x8ffd, 0x1ea8: 0xe959, 0x1ea9: 0xe979,\n\t0x1eaa: 0xe999, 0x1eab: 0xe9b9, 0x1eac: 0xe9d9, 0x1ead: 0xe9d9, 0x1eae: 0xe9f9, 0x1eaf: 0xea19,\n\t0x1eb0: 0xea39, 0x1eb1: 0xea59, 0x1eb2: 0xea79, 0x1eb3: 0xea99, 0x1eb4: 0xeab9, 0x1eb5: 0x901d,\n\t0x1eb6: 0xead9, 0x1eb7: 0x903d, 0x1eb8: 0xeaf9, 0x1eb9: 0x905d, 0x1eba: 0xeb19, 0x1ebb: 0x907d,\n\t0x1ebc: 0x909d, 0x1ebd: 0x90bd, 0x1ebe: 0xeb39, 0x1ebf: 0xeb59,\n\t// Block 0x7b, offset 0x1ec0\n\t0x1ec0: 0xeb79, 0x1ec1: 0x90dd, 0x1ec2: 0x90fd, 0x1ec3: 0x911d, 0x1ec4: 0x913d, 0x1ec5: 0xeb99,\n\t0x1ec6: 0xebb9, 0x1ec7: 0xebb9, 0x1ec8: 0xebd9, 0x1ec9: 0xebf9, 0x1eca: 0xec19, 0x1ecb: 0xec39,\n\t0x1ecc: 0xec59, 0x1ecd: 0x915d, 0x1ece: 0xec79, 0x1ecf: 0xec99, 0x1ed0: 0xecb9, 0x1ed1: 0xecd9,\n\t0x1ed2: 0x917d, 0x1ed3: 0xecf9, 0x1ed4: 0x919d, 0x1ed5: 0x91bd, 0x1ed6: 0xed19, 0x1ed7: 0xed39,\n\t0x1ed8: 0xed59, 0x1ed9: 0xed79, 0x1eda: 0xed99, 0x1edb: 0xedb9, 0x1edc: 0x91dd, 0x1edd: 0x91fd,\n\t0x1ede: 0x921d, 0x1edf: 0x2040, 0x1ee0: 0xedd9, 0x1ee1: 0x923d, 0x1ee2: 0xedf9, 0x1ee3: 0xee19,\n\t0x1ee4: 0xee39, 0x1ee5: 0x925d, 0x1ee6: 0xee59, 0x1ee7: 0xee79, 0x1ee8: 0xee99, 0x1ee9: 0xeeb9,\n\t0x1eea: 0xeed9, 0x1eeb: 0x927d, 0x1eec: 0xeef9, 0x1eed: 0xef19, 0x1eee: 0xef39, 0x1eef: 0xef59,\n\t0x1ef0: 0xef79, 0x1ef1: 0xef99, 0x1ef2: 0x929d, 0x1ef3: 0x92bd, 0x1ef4: 0xefb9, 0x1ef5: 0x92dd,\n\t0x1ef6: 0xefd9, 0x1ef7: 0x92fd, 0x1ef8: 0xeff9, 0x1ef9: 0xf019, 0x1efa: 0xf039, 0x1efb: 0x931d,\n\t0x1efc: 0x933d, 0x1efd: 0xf059, 0x1efe: 0x935d, 0x1eff: 0xf079,\n\t// Block 0x7c, offset 0x1f00\n\t0x1f00: 0xf6b9, 0x1f01: 0xf6d9, 0x1f02: 0xf6f9, 0x1f03: 0xf719, 0x1f04: 0xf739, 0x1f05: 0x951d,\n\t0x1f06: 0xf759, 0x1f07: 0xf779, 0x1f08: 0xf799, 0x1f09: 0xf7b9, 0x1f0a: 0xf7d9, 0x1f0b: 0x953d,\n\t0x1f0c: 0x955d, 0x1f0d: 0xf7f9, 0x1f0e: 0xf819, 0x1f0f: 0xf839, 0x1f10: 0xf859, 0x1f11: 0xf879,\n\t0x1f12: 0xf899, 0x1f13: 0x957d, 0x1f14: 0xf8b9, 0x1f15: 0xf8d9, 0x1f16: 0xf8f9, 0x1f17: 0xf919,\n\t0x1f18: 0x959d, 0x1f19: 0x95bd, 0x1f1a: 0xf939, 0x1f1b: 0xf959, 0x1f1c: 0xf979, 0x1f1d: 0x95dd,\n\t0x1f1e: 0xf999, 0x1f1f: 0xf9b9, 0x1f20: 0x6815, 0x1f21: 0x95fd, 0x1f22: 0xf9d9, 0x1f23: 0xf9f9,\n\t0x1f24: 0xfa19, 0x1f25: 0x961d, 0x1f26: 0xfa39, 0x1f27: 0xfa59, 0x1f28: 0xfa79, 0x1f29: 0xfa99,\n\t0x1f2a: 0xfab9, 0x1f2b: 0xfad9, 0x1f2c: 0xfaf9, 0x1f2d: 0x963d, 0x1f2e: 0xfb19, 0x1f2f: 0xfb39,\n\t0x1f30: 0xfb59, 0x1f31: 0x965d, 0x1f32: 0xfb79, 0x1f33: 0xfb99, 0x1f34: 0xfbb9, 0x1f35: 0xfbd9,\n\t0x1f36: 0x7b35, 0x1f37: 0x967d, 0x1f38: 0xfbf9, 0x1f39: 0xfc19, 0x1f3a: 0xfc39, 0x1f3b: 0x969d,\n\t0x1f3c: 0xfc59, 0x1f3d: 0x96bd, 0x1f3e: 0xfc79, 0x1f3f: 0xfc79,\n\t// Block 0x7d, offset 0x1f40\n\t0x1f40: 0xfc99, 0x1f41: 0x96dd, 0x1f42: 0xfcb9, 0x1f43: 0xfcd9, 0x1f44: 0xfcf9, 0x1f45: 0xfd19,\n\t0x1f46: 0xfd39, 0x1f47: 0xfd59, 0x1f48: 0xfd79, 0x1f49: 0x96fd, 0x1f4a: 0xfd99, 0x1f4b: 0xfdb9,\n\t0x1f4c: 0xfdd9, 0x1f4d: 0xfdf9, 0x1f4e: 0xfe19, 0x1f4f: 0xfe39, 0x1f50: 0x971d, 0x1f51: 0xfe59,\n\t0x1f52: 0x973d, 0x1f53: 0x975d, 0x1f54: 0x977d, 0x1f55: 0xfe79, 0x1f56: 0xfe99, 0x1f57: 0xfeb9,\n\t0x1f58: 0xfed9, 0x1f59: 0xfef9, 0x1f5a: 0xff19, 0x1f5b: 0xff39, 0x1f5c: 0xff59, 0x1f5d: 0x979d,\n\t0x1f5e: 0x0040, 0x1f5f: 0x0040, 0x1f60: 0x0040, 0x1f61: 0x0040, 0x1f62: 0x0040, 0x1f63: 0x0040,\n\t0x1f64: 0x0040, 0x1f65: 0x0040, 0x1f66: 0x0040, 0x1f67: 0x0040, 0x1f68: 0x0040, 0x1f69: 0x0040,\n\t0x1f6a: 0x0040, 0x1f6b: 0x0040, 0x1f6c: 0x0040, 0x1f6d: 0x0040, 0x1f6e: 0x0040, 0x1f6f: 0x0040,\n\t0x1f70: 0x0040, 0x1f71: 0x0040, 0x1f72: 0x0040, 0x1f73: 0x0040, 0x1f74: 0x0040, 0x1f75: 0x0040,\n\t0x1f76: 0x0040, 0x1f77: 0x0040, 0x1f78: 0x0040, 0x1f79: 0x0040, 0x1f7a: 0x0040, 0x1f7b: 0x0040,\n\t0x1f7c: 0x0040, 0x1f7d: 0x0040, 0x1f7e: 0x0040, 0x1f7f: 0x0040,\n}\n\n// idnaIndex: 35 blocks, 2240 entries, 4480 bytes\n// Block 0 is the zero block.\nvar idnaIndex = [2240]uint16{\n\t// Block 0x0, offset 0x0\n\t// Block 0x1, offset 0x40\n\t// Block 0x2, offset 0x80\n\t// Block 0x3, offset 0xc0\n\t0xc2: 0x01, 0xc3: 0x7c, 0xc4: 0x02, 0xc5: 0x03, 0xc6: 0x04, 0xc7: 0x05,\n\t0xc8: 0x06, 0xc9: 0x7d, 0xca: 0x7e, 0xcb: 0x07, 0xcc: 0x7f, 0xcd: 0x08, 0xce: 0x09, 0xcf: 0x0a,\n\t0xd0: 0x80, 0xd1: 0x0b, 0xd2: 0x0c, 0xd3: 0x0d, 0xd4: 0x0e, 0xd5: 0x81, 0xd6: 0x82, 0xd7: 0x83,\n\t0xd8: 0x0f, 0xd9: 0x10, 0xda: 0x84, 0xdb: 0x11, 0xdc: 0x12, 0xdd: 0x85, 0xde: 0x86, 0xdf: 0x87,\n\t0xe0: 0x02, 0xe1: 0x03, 0xe2: 0x04, 0xe3: 0x05, 0xe4: 0x06, 0xe5: 0x07, 0xe6: 0x07, 0xe7: 0x07,\n\t0xe8: 0x07, 0xe9: 0x08, 0xea: 0x09, 0xeb: 0x07, 0xec: 0x07, 0xed: 0x0a, 0xee: 0x0b, 0xef: 0x0c,\n\t0xf0: 0x1c, 0xf1: 0x1d, 0xf2: 0x1d, 0xf3: 0x1f, 0xf4: 0x20,\n\t// Block 0x4, offset 0x100\n\t0x120: 0x88, 0x121: 0x89, 0x122: 0x8a, 0x123: 0x8b, 0x124: 0x8c, 0x125: 0x13, 0x126: 0x14, 0x127: 0x15,\n\t0x128: 0x16, 0x129: 0x17, 0x12a: 0x18, 0x12b: 0x19, 0x12c: 0x1a, 0x12d: 0x1b, 0x12e: 0x1c, 0x12f: 0x8d,\n\t0x130: 0x8e, 0x131: 0x1d, 0x132: 0x1e, 0x133: 0x1f, 0x134: 0x8f, 0x135: 0x20, 0x136: 0x90, 0x137: 0x91,\n\t0x138: 0x92, 0x139: 0x93, 0x13a: 0x21, 0x13b: 0x94, 0x13c: 0x95, 0x13d: 0x22, 0x13e: 0x23, 0x13f: 0x96,\n\t// Block 0x5, offset 0x140\n\t0x140: 0x97, 0x141: 0x98, 0x142: 0x99, 0x143: 0x9a, 0x144: 0x9b, 0x145: 0x9c, 0x146: 0x9d, 0x147: 0x9e,\n\t0x148: 0x9f, 0x149: 0xa0, 0x14a: 0xa1, 0x14b: 0xa2, 0x14c: 0xa3, 0x14d: 0xa4, 0x14e: 0xa5, 0x14f: 0xa6,\n\t0x150: 0xa7, 0x151: 0x9f, 0x152: 0x9f, 0x153: 0x9f, 0x154: 0x9f, 0x155: 0x9f, 0x156: 0x9f, 0x157: 0x9f,\n\t0x158: 0x9f, 0x159: 0xa8, 0x15a: 0xa9, 0x15b: 0xaa, 0x15c: 0xab, 0x15d: 0xac, 0x15e: 0xad, 0x15f: 0xae,\n\t0x160: 0xaf, 0x161: 0xb0, 0x162: 0xb1, 0x163: 0xb2, 0x164: 0xb3, 0x165: 0xb4, 0x166: 0xb5, 0x167: 0xb6,\n\t0x168: 0xb7, 0x169: 0xb8, 0x16a: 0xb9, 0x16b: 0xba, 0x16c: 0xbb, 0x16d: 0xbc, 0x16e: 0xbd, 0x16f: 0xbe,\n\t0x170: 0xbf, 0x171: 0xc0, 0x172: 0xc1, 0x173: 0xc2, 0x174: 0x24, 0x175: 0x25, 0x176: 0x26, 0x177: 0xc3,\n\t0x178: 0x27, 0x179: 0x27, 0x17a: 0x28, 0x17b: 0x27, 0x17c: 0xc4, 0x17d: 0x29, 0x17e: 0x2a, 0x17f: 0x2b,\n\t// Block 0x6, offset 0x180\n\t0x180: 0x2c, 0x181: 0x2d, 0x182: 0x2e, 0x183: 0xc5, 0x184: 0x2f, 0x185: 0x30, 0x186: 0xc6, 0x187: 0x9b,\n\t0x188: 0xc7, 0x189: 0xc8, 0x18a: 0x9b, 0x18b: 0x9b, 0x18c: 0xc9, 0x18d: 0x9b, 0x18e: 0x9b, 0x18f: 0xca,\n\t0x190: 0xcb, 0x191: 0x31, 0x192: 0x32, 0x193: 0x33, 0x194: 0x9b, 0x195: 0x9b, 0x196: 0x9b, 0x197: 0x9b,\n\t0x198: 0x9b, 0x199: 0x9b, 0x19a: 0x9b, 0x19b: 0x9b, 0x19c: 0x9b, 0x19d: 0x9b, 0x19e: 0x9b, 0x19f: 0x9b,\n\t0x1a0: 0x9b, 0x1a1: 0x9b, 0x1a2: 0x9b, 0x1a3: 0x9b, 0x1a4: 0x9b, 0x1a5: 0x9b, 0x1a6: 0x9b, 0x1a7: 0x9b,\n\t0x1a8: 0xcc, 0x1a9: 0xcd, 0x1aa: 0x9b, 0x1ab: 0xce, 0x1ac: 0x9b, 0x1ad: 0xcf, 0x1ae: 0xd0, 0x1af: 0xd1,\n\t0x1b0: 0xd2, 0x1b1: 0x34, 0x1b2: 0x27, 0x1b3: 0x35, 0x1b4: 0xd3, 0x1b5: 0xd4, 0x1b6: 0xd5, 0x1b7: 0xd6,\n\t0x1b8: 0xd7, 0x1b9: 0xd8, 0x1ba: 0xd9, 0x1bb: 0xda, 0x1bc: 0xdb, 0x1bd: 0xdc, 0x1be: 0xdd, 0x1bf: 0x36,\n\t// Block 0x7, offset 0x1c0\n\t0x1c0: 0x37, 0x1c1: 0xde, 0x1c2: 0xdf, 0x1c3: 0xe0, 0x1c4: 0xe1, 0x1c5: 0x38, 0x1c6: 0x39, 0x1c7: 0xe2,\n\t0x1c8: 0xe3, 0x1c9: 0x3a, 0x1ca: 0x3b, 0x1cb: 0x3c, 0x1cc: 0x3d, 0x1cd: 0x3e, 0x1ce: 0x3f, 0x1cf: 0x40,\n\t0x1d0: 0x9f, 0x1d1: 0x9f, 0x1d2: 0x9f, 0x1d3: 0x9f, 0x1d4: 0x9f, 0x1d5: 0x9f, 0x1d6: 0x9f, 0x1d7: 0x9f,\n\t0x1d8: 0x9f, 0x1d9: 0x9f, 0x1da: 0x9f, 0x1db: 0x9f, 0x1dc: 0x9f, 0x1dd: 0x9f, 0x1de: 0x9f, 0x1df: 0x9f,\n\t0x1e0: 0x9f, 0x1e1: 0x9f, 0x1e2: 0x9f, 0x1e3: 0x9f, 0x1e4: 0x9f, 0x1e5: 0x9f, 0x1e6: 0x9f, 0x1e7: 0x9f,\n\t0x1e8: 0x9f, 0x1e9: 0x9f, 0x1ea: 0x9f, 0x1eb: 0x9f, 0x1ec: 0x9f, 0x1ed: 0x9f, 0x1ee: 0x9f, 0x1ef: 0x9f,\n\t0x1f0: 0x9f, 0x1f1: 0x9f, 0x1f2: 0x9f, 0x1f3: 0x9f, 0x1f4: 0x9f, 0x1f5: 0x9f, 0x1f6: 0x9f, 0x1f7: 0x9f,\n\t0x1f8: 0x9f, 0x1f9: 0x9f, 0x1fa: 0x9f, 0x1fb: 0x9f, 0x1fc: 0x9f, 0x1fd: 0x9f, 0x1fe: 0x9f, 0x1ff: 0x9f,\n\t// Block 0x8, offset 0x200\n\t0x200: 0x9f, 0x201: 0x9f, 0x202: 0x9f, 0x203: 0x9f, 0x204: 0x9f, 0x205: 0x9f, 0x206: 0x9f, 0x207: 0x9f,\n\t0x208: 0x9f, 0x209: 0x9f, 0x20a: 0x9f, 0x20b: 0x9f, 0x20c: 0x9f, 0x20d: 0x9f, 0x20e: 0x9f, 0x20f: 0x9f,\n\t0x210: 0x9f, 0x211: 0x9f, 0x212: 0x9f, 0x213: 0x9f, 0x214: 0x9f, 0x215: 0x9f, 0x216: 0x9f, 0x217: 0x9f,\n\t0x218: 0x9f, 0x219: 0x9f, 0x21a: 0x9f, 0x21b: 0x9f, 0x21c: 0x9f, 0x21d: 0x9f, 0x21e: 0x9f, 0x21f: 0x9f,\n\t0x220: 0x9f, 0x221: 0x9f, 0x222: 0x9f, 0x223: 0x9f, 0x224: 0x9f, 0x225: 0x9f, 0x226: 0x9f, 0x227: 0x9f,\n\t0x228: 0x9f, 0x229: 0x9f, 0x22a: 0x9f, 0x22b: 0x9f, 0x22c: 0x9f, 0x22d: 0x9f, 0x22e: 0x9f, 0x22f: 0x9f,\n\t0x230: 0x9f, 0x231: 0x9f, 0x232: 0x9f, 0x233: 0x9f, 0x234: 0x9f, 0x235: 0x9f, 0x236: 0xb2, 0x237: 0x9b,\n\t0x238: 0x9f, 0x239: 0x9f, 0x23a: 0x9f, 0x23b: 0x9f, 0x23c: 0x9f, 0x23d: 0x9f, 0x23e: 0x9f, 0x23f: 0x9f,\n\t// Block 0x9, offset 0x240\n\t0x240: 0x9f, 0x241: 0x9f, 0x242: 0x9f, 0x243: 0x9f, 0x244: 0x9f, 0x245: 0x9f, 0x246: 0x9f, 0x247: 0x9f,\n\t0x248: 0x9f, 0x249: 0x9f, 0x24a: 0x9f, 0x24b: 0x9f, 0x24c: 0x9f, 0x24d: 0x9f, 0x24e: 0x9f, 0x24f: 0x9f,\n\t0x250: 0x9f, 0x251: 0x9f, 0x252: 0x9f, 0x253: 0x9f, 0x254: 0x9f, 0x255: 0x9f, 0x256: 0x9f, 0x257: 0x9f,\n\t0x258: 0x9f, 0x259: 0x9f, 0x25a: 0x9f, 0x25b: 0x9f, 0x25c: 0x9f, 0x25d: 0x9f, 0x25e: 0x9f, 0x25f: 0x9f,\n\t0x260: 0x9f, 0x261: 0x9f, 0x262: 0x9f, 0x263: 0x9f, 0x264: 0x9f, 0x265: 0x9f, 0x266: 0x9f, 0x267: 0x9f,\n\t0x268: 0x9f, 0x269: 0x9f, 0x26a: 0x9f, 0x26b: 0x9f, 0x26c: 0x9f, 0x26d: 0x9f, 0x26e: 0x9f, 0x26f: 0x9f,\n\t0x270: 0x9f, 0x271: 0x9f, 0x272: 0x9f, 0x273: 0x9f, 0x274: 0x9f, 0x275: 0x9f, 0x276: 0x9f, 0x277: 0x9f,\n\t0x278: 0x9f, 0x279: 0x9f, 0x27a: 0x9f, 0x27b: 0x9f, 0x27c: 0x9f, 0x27d: 0x9f, 0x27e: 0x9f, 0x27f: 0x9f,\n\t// Block 0xa, offset 0x280\n\t0x280: 0x9f, 0x281: 0x9f, 0x282: 0x9f, 0x283: 0x9f, 0x284: 0x9f, 0x285: 0x9f, 0x286: 0x9f, 0x287: 0x9f,\n\t0x288: 0x9f, 0x289: 0x9f, 0x28a: 0x9f, 0x28b: 0x9f, 0x28c: 0x9f, 0x28d: 0x9f, 0x28e: 0x9f, 0x28f: 0x9f,\n\t0x290: 0x9f, 0x291: 0x9f, 0x292: 0x9f, 0x293: 0x9f, 0x294: 0x9f, 0x295: 0x9f, 0x296: 0x9f, 0x297: 0x9f,\n\t0x298: 0x9f, 0x299: 0x9f, 0x29a: 0x9f, 0x29b: 0x9f, 0x29c: 0x9f, 0x29d: 0x9f, 0x29e: 0x9f, 0x29f: 0x9f,\n\t0x2a0: 0x9f, 0x2a1: 0x9f, 0x2a2: 0x9f, 0x2a3: 0x9f, 0x2a4: 0x9f, 0x2a5: 0x9f, 0x2a6: 0x9f, 0x2a7: 0x9f,\n\t0x2a8: 0x9f, 0x2a9: 0x9f, 0x2aa: 0x9f, 0x2ab: 0x9f, 0x2ac: 0x9f, 0x2ad: 0x9f, 0x2ae: 0x9f, 0x2af: 0x9f,\n\t0x2b0: 0x9f, 0x2b1: 0x9f, 0x2b2: 0x9f, 0x2b3: 0x9f, 0x2b4: 0x9f, 0x2b5: 0x9f, 0x2b6: 0x9f, 0x2b7: 0x9f,\n\t0x2b8: 0x9f, 0x2b9: 0x9f, 0x2ba: 0x9f, 0x2bb: 0x9f, 0x2bc: 0x9f, 0x2bd: 0x9f, 0x2be: 0x9f, 0x2bf: 0xe4,\n\t// Block 0xb, offset 0x2c0\n\t0x2c0: 0x9f, 0x2c1: 0x9f, 0x2c2: 0x9f, 0x2c3: 0x9f, 0x2c4: 0x9f, 0x2c5: 0x9f, 0x2c6: 0x9f, 0x2c7: 0x9f,\n\t0x2c8: 0x9f, 0x2c9: 0x9f, 0x2ca: 0x9f, 0x2cb: 0x9f, 0x2cc: 0x9f, 0x2cd: 0x9f, 0x2ce: 0x9f, 0x2cf: 0x9f,\n\t0x2d0: 0x9f, 0x2d1: 0x9f, 0x2d2: 0xe5, 0x2d3: 0xe6, 0x2d4: 0x9f, 0x2d5: 0x9f, 0x2d6: 0x9f, 0x2d7: 0x9f,\n\t0x2d8: 0xe7, 0x2d9: 0x41, 0x2da: 0x42, 0x2db: 0xe8, 0x2dc: 0x43, 0x2dd: 0x44, 0x2de: 0x45, 0x2df: 0xe9,\n\t0x2e0: 0xea, 0x2e1: 0xeb, 0x2e2: 0xec, 0x2e3: 0xed, 0x2e4: 0xee, 0x2e5: 0xef, 0x2e6: 0xf0, 0x2e7: 0xf1,\n\t0x2e8: 0xf2, 0x2e9: 0xf3, 0x2ea: 0xf4, 0x2eb: 0xf5, 0x2ec: 0xf6, 0x2ed: 0xf7, 0x2ee: 0xf8, 0x2ef: 0xf9,\n\t0x2f0: 0x9f, 0x2f1: 0x9f, 0x2f2: 0x9f, 0x2f3: 0x9f, 0x2f4: 0x9f, 0x2f5: 0x9f, 0x2f6: 0x9f, 0x2f7: 0x9f,\n\t0x2f8: 0x9f, 0x2f9: 0x9f, 0x2fa: 0x9f, 0x2fb: 0x9f, 0x2fc: 0x9f, 0x2fd: 0x9f, 0x2fe: 0x9f, 0x2ff: 0x9f,\n\t// Block 0xc, offset 0x300\n\t0x300: 0x9f, 0x301: 0x9f, 0x302: 0x9f, 0x303: 0x9f, 0x304: 0x9f, 0x305: 0x9f, 0x306: 0x9f, 0x307: 0x9f,\n\t0x308: 0x9f, 0x309: 0x9f, 0x30a: 0x9f, 0x30b: 0x9f, 0x30c: 0x9f, 0x30d: 0x9f, 0x30e: 0x9f, 0x30f: 0x9f,\n\t0x310: 0x9f, 0x311: 0x9f, 0x312: 0x9f, 0x313: 0x9f, 0x314: 0x9f, 0x315: 0x9f, 0x316: 0x9f, 0x317: 0x9f,\n\t0x318: 0x9f, 0x319: 0x9f, 0x31a: 0x9f, 0x31b: 0x9f, 0x31c: 0x9f, 0x31d: 0x9f, 0x31e: 0xfa, 0x31f: 0xfb,\n\t// Block 0xd, offset 0x340\n\t0x340: 0xba, 0x341: 0xba, 0x342: 0xba, 0x343: 0xba, 0x344: 0xba, 0x345: 0xba, 0x346: 0xba, 0x347: 0xba,\n\t0x348: 0xba, 0x349: 0xba, 0x34a: 0xba, 0x34b: 0xba, 0x34c: 0xba, 0x34d: 0xba, 0x34e: 0xba, 0x34f: 0xba,\n\t0x350: 0xba, 0x351: 0xba, 0x352: 0xba, 0x353: 0xba, 0x354: 0xba, 0x355: 0xba, 0x356: 0xba, 0x357: 0xba,\n\t0x358: 0xba, 0x359: 0xba, 0x35a: 0xba, 0x35b: 0xba, 0x35c: 0xba, 0x35d: 0xba, 0x35e: 0xba, 0x35f: 0xba,\n\t0x360: 0xba, 0x361: 0xba, 0x362: 0xba, 0x363: 0xba, 0x364: 0xba, 0x365: 0xba, 0x366: 0xba, 0x367: 0xba,\n\t0x368: 0xba, 0x369: 0xba, 0x36a: 0xba, 0x36b: 0xba, 0x36c: 0xba, 0x36d: 0xba, 0x36e: 0xba, 0x36f: 0xba,\n\t0x370: 0xba, 0x371: 0xba, 0x372: 0xba, 0x373: 0xba, 0x374: 0xba, 0x375: 0xba, 0x376: 0xba, 0x377: 0xba,\n\t0x378: 0xba, 0x379: 0xba, 0x37a: 0xba, 0x37b: 0xba, 0x37c: 0xba, 0x37d: 0xba, 0x37e: 0xba, 0x37f: 0xba,\n\t// Block 0xe, offset 0x380\n\t0x380: 0xba, 0x381: 0xba, 0x382: 0xba, 0x383: 0xba, 0x384: 0xba, 0x385: 0xba, 0x386: 0xba, 0x387: 0xba,\n\t0x388: 0xba, 0x389: 0xba, 0x38a: 0xba, 0x38b: 0xba, 0x38c: 0xba, 0x38d: 0xba, 0x38e: 0xba, 0x38f: 0xba,\n\t0x390: 0xba, 0x391: 0xba, 0x392: 0xba, 0x393: 0xba, 0x394: 0xba, 0x395: 0xba, 0x396: 0xba, 0x397: 0xba,\n\t0x398: 0xba, 0x399: 0xba, 0x39a: 0xba, 0x39b: 0xba, 0x39c: 0xba, 0x39d: 0xba, 0x39e: 0xba, 0x39f: 0xba,\n\t0x3a0: 0xba, 0x3a1: 0xba, 0x3a2: 0xba, 0x3a3: 0xba, 0x3a4: 0xfc, 0x3a5: 0xfd, 0x3a6: 0xfe, 0x3a7: 0xff,\n\t0x3a8: 0x46, 0x3a9: 0x100, 0x3aa: 0x101, 0x3ab: 0x47, 0x3ac: 0x48, 0x3ad: 0x49, 0x3ae: 0x4a, 0x3af: 0x4b,\n\t0x3b0: 0x102, 0x3b1: 0x4c, 0x3b2: 0x4d, 0x3b3: 0x4e, 0x3b4: 0x4f, 0x3b5: 0x50, 0x3b6: 0x103, 0x3b7: 0x51,\n\t0x3b8: 0x52, 0x3b9: 0x53, 0x3ba: 0x54, 0x3bb: 0x55, 0x3bc: 0x56, 0x3bd: 0x57, 0x3be: 0x58, 0x3bf: 0x59,\n\t// Block 0xf, offset 0x3c0\n\t0x3c0: 0x104, 0x3c1: 0x105, 0x3c2: 0x9f, 0x3c3: 0x106, 0x3c4: 0x107, 0x3c5: 0x9b, 0x3c6: 0x108, 0x3c7: 0x109,\n\t0x3c8: 0xba, 0x3c9: 0xba, 0x3ca: 0x10a, 0x3cb: 0x10b, 0x3cc: 0x10c, 0x3cd: 0x10d, 0x3ce: 0x10e, 0x3cf: 0x10f,\n\t0x3d0: 0x110, 0x3d1: 0x9f, 0x3d2: 0x111, 0x3d3: 0x112, 0x3d4: 0x113, 0x3d5: 0x114, 0x3d6: 0xba, 0x3d7: 0xba,\n\t0x3d8: 0x9f, 0x3d9: 0x9f, 0x3da: 0x9f, 0x3db: 0x9f, 0x3dc: 0x115, 0x3dd: 0x116, 0x3de: 0xba, 0x3df: 0xba,\n\t0x3e0: 0x117, 0x3e1: 0x118, 0x3e2: 0x119, 0x3e3: 0x11a, 0x3e4: 0x11b, 0x3e5: 0xba, 0x3e6: 0x11c, 0x3e7: 0x11d,\n\t0x3e8: 0x11e, 0x3e9: 0x11f, 0x3ea: 0x120, 0x3eb: 0x5a, 0x3ec: 0x121, 0x3ed: 0x122, 0x3ee: 0x5b, 0x3ef: 0xba,\n\t0x3f0: 0x123, 0x3f1: 0x124, 0x3f2: 0x125, 0x3f3: 0x126, 0x3f4: 0xba, 0x3f5: 0xba, 0x3f6: 0xba, 0x3f7: 0xba,\n\t0x3f8: 0xba, 0x3f9: 0x127, 0x3fa: 0xba, 0x3fb: 0xba, 0x3fc: 0xba, 0x3fd: 0xba, 0x3fe: 0xba, 0x3ff: 0xba,\n\t// Block 0x10, offset 0x400\n\t0x400: 0x128, 0x401: 0x129, 0x402: 0x12a, 0x403: 0x12b, 0x404: 0x12c, 0x405: 0x12d, 0x406: 0x12e, 0x407: 0x12f,\n\t0x408: 0x130, 0x409: 0xba, 0x40a: 0x131, 0x40b: 0x132, 0x40c: 0x5c, 0x40d: 0x5d, 0x40e: 0xba, 0x40f: 0xba,\n\t0x410: 0x133, 0x411: 0x134, 0x412: 0x135, 0x413: 0x136, 0x414: 0xba, 0x415: 0xba, 0x416: 0x137, 0x417: 0x138,\n\t0x418: 0x139, 0x419: 0x13a, 0x41a: 0x13b, 0x41b: 0x13c, 0x41c: 0x13d, 0x41d: 0xba, 0x41e: 0xba, 0x41f: 0xba,\n\t0x420: 0xba, 0x421: 0xba, 0x422: 0x13e, 0x423: 0x13f, 0x424: 0xba, 0x425: 0xba, 0x426: 0xba, 0x427: 0xba,\n\t0x428: 0xba, 0x429: 0xba, 0x42a: 0xba, 0x42b: 0x140, 0x42c: 0xba, 0x42d: 0xba, 0x42e: 0xba, 0x42f: 0xba,\n\t0x430: 0x141, 0x431: 0x142, 0x432: 0x143, 0x433: 0xba, 0x434: 0xba, 0x435: 0xba, 0x436: 0xba, 0x437: 0xba,\n\t0x438: 0xba, 0x439: 0xba, 0x43a: 0xba, 0x43b: 0xba, 0x43c: 0xba, 0x43d: 0xba, 0x43e: 0xba, 0x43f: 0xba,\n\t// Block 0x11, offset 0x440\n\t0x440: 0x9f, 0x441: 0x9f, 0x442: 0x9f, 0x443: 0x9f, 0x444: 0x9f, 0x445: 0x9f, 0x446: 0x9f, 0x447: 0x9f,\n\t0x448: 0x9f, 0x449: 0x9f, 0x44a: 0x9f, 0x44b: 0x9f, 0x44c: 0x9f, 0x44d: 0x9f, 0x44e: 0x144, 0x44f: 0xba,\n\t0x450: 0x9b, 0x451: 0x145, 0x452: 0x9f, 0x453: 0x9f, 0x454: 0x9f, 0x455: 0x146, 0x456: 0xba, 0x457: 0xba,\n\t0x458: 0xba, 0x459: 0xba, 0x45a: 0xba, 0x45b: 0xba, 0x45c: 0xba, 0x45d: 0xba, 0x45e: 0xba, 0x45f: 0xba,\n\t0x460: 0xba, 0x461: 0xba, 0x462: 0xba, 0x463: 0xba, 0x464: 0xba, 0x465: 0xba, 0x466: 0xba, 0x467: 0xba,\n\t0x468: 0xba, 0x469: 0xba, 0x46a: 0xba, 0x46b: 0xba, 0x46c: 0xba, 0x46d: 0xba, 0x46e: 0xba, 0x46f: 0xba,\n\t0x470: 0xba, 0x471: 0xba, 0x472: 0xba, 0x473: 0xba, 0x474: 0xba, 0x475: 0xba, 0x476: 0xba, 0x477: 0xba,\n\t0x478: 0xba, 0x479: 0xba, 0x47a: 0xba, 0x47b: 0xba, 0x47c: 0xba, 0x47d: 0xba, 0x47e: 0xba, 0x47f: 0xba,\n\t// Block 0x12, offset 0x480\n\t0x480: 0x9f, 0x481: 0x9f, 0x482: 0x9f, 0x483: 0x9f, 0x484: 0x9f, 0x485: 0x9f, 0x486: 0x9f, 0x487: 0x9f,\n\t0x488: 0x9f, 0x489: 0x9f, 0x48a: 0x9f, 0x48b: 0x9f, 0x48c: 0x9f, 0x48d: 0x9f, 0x48e: 0x9f, 0x48f: 0x9f,\n\t0x490: 0x147, 0x491: 0xba, 0x492: 0xba, 0x493: 0xba, 0x494: 0xba, 0x495: 0xba, 0x496: 0xba, 0x497: 0xba,\n\t0x498: 0xba, 0x499: 0xba, 0x49a: 0xba, 0x49b: 0xba, 0x49c: 0xba, 0x49d: 0xba, 0x49e: 0xba, 0x49f: 0xba,\n\t0x4a0: 0xba, 0x4a1: 0xba, 0x4a2: 0xba, 0x4a3: 0xba, 0x4a4: 0xba, 0x4a5: 0xba, 0x4a6: 0xba, 0x4a7: 0xba,\n\t0x4a8: 0xba, 0x4a9: 0xba, 0x4aa: 0xba, 0x4ab: 0xba, 0x4ac: 0xba, 0x4ad: 0xba, 0x4ae: 0xba, 0x4af: 0xba,\n\t0x4b0: 0xba, 0x4b1: 0xba, 0x4b2: 0xba, 0x4b3: 0xba, 0x4b4: 0xba, 0x4b5: 0xba, 0x4b6: 0xba, 0x4b7: 0xba,\n\t0x4b8: 0xba, 0x4b9: 0xba, 0x4ba: 0xba, 0x4bb: 0xba, 0x4bc: 0xba, 0x4bd: 0xba, 0x4be: 0xba, 0x4bf: 0xba,\n\t// Block 0x13, offset 0x4c0\n\t0x4c0: 0xba, 0x4c1: 0xba, 0x4c2: 0xba, 0x4c3: 0xba, 0x4c4: 0xba, 0x4c5: 0xba, 0x4c6: 0xba, 0x4c7: 0xba,\n\t0x4c8: 0xba, 0x4c9: 0xba, 0x4ca: 0xba, 0x4cb: 0xba, 0x4cc: 0xba, 0x4cd: 0xba, 0x4ce: 0xba, 0x4cf: 0xba,\n\t0x4d0: 0x9f, 0x4d1: 0x9f, 0x4d2: 0x9f, 0x4d3: 0x9f, 0x4d4: 0x9f, 0x4d5: 0x9f, 0x4d6: 0x9f, 0x4d7: 0x9f,\n\t0x4d8: 0x9f, 0x4d9: 0x148, 0x4da: 0xba, 0x4db: 0xba, 0x4dc: 0xba, 0x4dd: 0xba, 0x4de: 0xba, 0x4df: 0xba,\n\t0x4e0: 0xba, 0x4e1: 0xba, 0x4e2: 0xba, 0x4e3: 0xba, 0x4e4: 0xba, 0x4e5: 0xba, 0x4e6: 0xba, 0x4e7: 0xba,\n\t0x4e8: 0xba, 0x4e9: 0xba, 0x4ea: 0xba, 0x4eb: 0xba, 0x4ec: 0xba, 0x4ed: 0xba, 0x4ee: 0xba, 0x4ef: 0xba,\n\t0x4f0: 0xba, 0x4f1: 0xba, 0x4f2: 0xba, 0x4f3: 0xba, 0x4f4: 0xba, 0x4f5: 0xba, 0x4f6: 0xba, 0x4f7: 0xba,\n\t0x4f8: 0xba, 0x4f9: 0xba, 0x4fa: 0xba, 0x4fb: 0xba, 0x4fc: 0xba, 0x4fd: 0xba, 0x4fe: 0xba, 0x4ff: 0xba,\n\t// Block 0x14, offset 0x500\n\t0x500: 0xba, 0x501: 0xba, 0x502: 0xba, 0x503: 0xba, 0x504: 0xba, 0x505: 0xba, 0x506: 0xba, 0x507: 0xba,\n\t0x508: 0xba, 0x509: 0xba, 0x50a: 0xba, 0x50b: 0xba, 0x50c: 0xba, 0x50d: 0xba, 0x50e: 0xba, 0x50f: 0xba,\n\t0x510: 0xba, 0x511: 0xba, 0x512: 0xba, 0x513: 0xba, 0x514: 0xba, 0x515: 0xba, 0x516: 0xba, 0x517: 0xba,\n\t0x518: 0xba, 0x519: 0xba, 0x51a: 0xba, 0x51b: 0xba, 0x51c: 0xba, 0x51d: 0xba, 0x51e: 0xba, 0x51f: 0xba,\n\t0x520: 0x9f, 0x521: 0x9f, 0x522: 0x9f, 0x523: 0x9f, 0x524: 0x9f, 0x525: 0x9f, 0x526: 0x9f, 0x527: 0x9f,\n\t0x528: 0x140, 0x529: 0x149, 0x52a: 0xba, 0x52b: 0x14a, 0x52c: 0x14b, 0x52d: 0x14c, 0x52e: 0x14d, 0x52f: 0xba,\n\t0x530: 0xba, 0x531: 0xba, 0x532: 0xba, 0x533: 0xba, 0x534: 0xba, 0x535: 0xba, 0x536: 0xba, 0x537: 0xba,\n\t0x538: 0xba, 0x539: 0xba, 0x53a: 0xba, 0x53b: 0xba, 0x53c: 0x9f, 0x53d: 0x14e, 0x53e: 0x14f, 0x53f: 0x150,\n\t// Block 0x15, offset 0x540\n\t0x540: 0x9f, 0x541: 0x9f, 0x542: 0x9f, 0x543: 0x9f, 0x544: 0x9f, 0x545: 0x9f, 0x546: 0x9f, 0x547: 0x9f,\n\t0x548: 0x9f, 0x549: 0x9f, 0x54a: 0x9f, 0x54b: 0x9f, 0x54c: 0x9f, 0x54d: 0x9f, 0x54e: 0x9f, 0x54f: 0x9f,\n\t0x550: 0x9f, 0x551: 0x9f, 0x552: 0x9f, 0x553: 0x9f, 0x554: 0x9f, 0x555: 0x9f, 0x556: 0x9f, 0x557: 0x9f,\n\t0x558: 0x9f, 0x559: 0x9f, 0x55a: 0x9f, 0x55b: 0x9f, 0x55c: 0x9f, 0x55d: 0x9f, 0x55e: 0x9f, 0x55f: 0x151,\n\t0x560: 0x9f, 0x561: 0x9f, 0x562: 0x9f, 0x563: 0x9f, 0x564: 0x9f, 0x565: 0x9f, 0x566: 0x9f, 0x567: 0x9f,\n\t0x568: 0x9f, 0x569: 0x9f, 0x56a: 0x9f, 0x56b: 0x152, 0x56c: 0xba, 0x56d: 0xba, 0x56e: 0xba, 0x56f: 0xba,\n\t0x570: 0xba, 0x571: 0xba, 0x572: 0xba, 0x573: 0xba, 0x574: 0xba, 0x575: 0xba, 0x576: 0xba, 0x577: 0xba,\n\t0x578: 0xba, 0x579: 0xba, 0x57a: 0xba, 0x57b: 0xba, 0x57c: 0xba, 0x57d: 0xba, 0x57e: 0xba, 0x57f: 0xba,\n\t// Block 0x16, offset 0x580\n\t0x580: 0x153, 0x581: 0xba, 0x582: 0xba, 0x583: 0xba, 0x584: 0xba, 0x585: 0xba, 0x586: 0xba, 0x587: 0xba,\n\t0x588: 0xba, 0x589: 0xba, 0x58a: 0xba, 0x58b: 0xba, 0x58c: 0xba, 0x58d: 0xba, 0x58e: 0xba, 0x58f: 0xba,\n\t0x590: 0xba, 0x591: 0xba, 0x592: 0xba, 0x593: 0xba, 0x594: 0xba, 0x595: 0xba, 0x596: 0xba, 0x597: 0xba,\n\t0x598: 0xba, 0x599: 0xba, 0x59a: 0xba, 0x59b: 0xba, 0x59c: 0xba, 0x59d: 0xba, 0x59e: 0xba, 0x59f: 0xba,\n\t0x5a0: 0xba, 0x5a1: 0xba, 0x5a2: 0xba, 0x5a3: 0xba, 0x5a4: 0xba, 0x5a5: 0xba, 0x5a6: 0xba, 0x5a7: 0xba,\n\t0x5a8: 0xba, 0x5a9: 0xba, 0x5aa: 0xba, 0x5ab: 0xba, 0x5ac: 0xba, 0x5ad: 0xba, 0x5ae: 0xba, 0x5af: 0xba,\n\t0x5b0: 0x9f, 0x5b1: 0x154, 0x5b2: 0x155, 0x5b3: 0xba, 0x5b4: 0xba, 0x5b5: 0xba, 0x5b6: 0xba, 0x5b7: 0xba,\n\t0x5b8: 0xba, 0x5b9: 0xba, 0x5ba: 0xba, 0x5bb: 0xba, 0x5bc: 0xba, 0x5bd: 0xba, 0x5be: 0xba, 0x5bf: 0xba,\n\t// Block 0x17, offset 0x5c0\n\t0x5c0: 0x9b, 0x5c1: 0x9b, 0x5c2: 0x9b, 0x5c3: 0x156, 0x5c4: 0x157, 0x5c5: 0x158, 0x5c6: 0x159, 0x5c7: 0x15a,\n\t0x5c8: 0x9b, 0x5c9: 0x15b, 0x5ca: 0xba, 0x5cb: 0xba, 0x5cc: 0x9b, 0x5cd: 0x15c, 0x5ce: 0xba, 0x5cf: 0xba,\n\t0x5d0: 0x5e, 0x5d1: 0x5f, 0x5d2: 0x60, 0x5d3: 0x61, 0x5d4: 0x62, 0x5d5: 0x63, 0x5d6: 0x64, 0x5d7: 0x65,\n\t0x5d8: 0x66, 0x5d9: 0x67, 0x5da: 0x68, 0x5db: 0x69, 0x5dc: 0x6a, 0x5dd: 0x6b, 0x5de: 0x6c, 0x5df: 0x6d,\n\t0x5e0: 0x9b, 0x5e1: 0x9b, 0x5e2: 0x9b, 0x5e3: 0x9b, 0x5e4: 0x9b, 0x5e5: 0x9b, 0x5e6: 0x9b, 0x5e7: 0x9b,\n\t0x5e8: 0x15d, 0x5e9: 0x15e, 0x5ea: 0x15f, 0x5eb: 0xba, 0x5ec: 0xba, 0x5ed: 0xba, 0x5ee: 0xba, 0x5ef: 0xba,\n\t0x5f0: 0xba, 0x5f1: 0xba, 0x5f2: 0xba, 0x5f3: 0xba, 0x5f4: 0xba, 0x5f5: 0xba, 0x5f6: 0xba, 0x5f7: 0xba,\n\t0x5f8: 0xba, 0x5f9: 0xba, 0x5fa: 0xba, 0x5fb: 0xba, 0x5fc: 0xba, 0x5fd: 0xba, 0x5fe: 0xba, 0x5ff: 0xba,\n\t// Block 0x18, offset 0x600\n\t0x600: 0x160, 0x601: 0xba, 0x602: 0xba, 0x603: 0xba, 0x604: 0xba, 0x605: 0xba, 0x606: 0xba, 0x607: 0xba,\n\t0x608: 0xba, 0x609: 0xba, 0x60a: 0xba, 0x60b: 0xba, 0x60c: 0xba, 0x60d: 0xba, 0x60e: 0xba, 0x60f: 0xba,\n\t0x610: 0xba, 0x611: 0xba, 0x612: 0xba, 0x613: 0xba, 0x614: 0xba, 0x615: 0xba, 0x616: 0xba, 0x617: 0xba,\n\t0x618: 0xba, 0x619: 0xba, 0x61a: 0xba, 0x61b: 0xba, 0x61c: 0xba, 0x61d: 0xba, 0x61e: 0xba, 0x61f: 0xba,\n\t0x620: 0x123, 0x621: 0x123, 0x622: 0x123, 0x623: 0x161, 0x624: 0x6e, 0x625: 0x162, 0x626: 0xba, 0x627: 0xba,\n\t0x628: 0xba, 0x629: 0xba, 0x62a: 0xba, 0x62b: 0xba, 0x62c: 0xba, 0x62d: 0xba, 0x62e: 0xba, 0x62f: 0xba,\n\t0x630: 0xba, 0x631: 0xba, 0x632: 0xba, 0x633: 0xba, 0x634: 0xba, 0x635: 0xba, 0x636: 0xba, 0x637: 0xba,\n\t0x638: 0x6f, 0x639: 0x70, 0x63a: 0x71, 0x63b: 0x163, 0x63c: 0xba, 0x63d: 0xba, 0x63e: 0xba, 0x63f: 0xba,\n\t// Block 0x19, offset 0x640\n\t0x640: 0x164, 0x641: 0x9b, 0x642: 0x165, 0x643: 0x166, 0x644: 0x72, 0x645: 0x73, 0x646: 0x167, 0x647: 0x168,\n\t0x648: 0x74, 0x649: 0x169, 0x64a: 0xba, 0x64b: 0xba, 0x64c: 0x9b, 0x64d: 0x9b, 0x64e: 0x9b, 0x64f: 0x9b,\n\t0x650: 0x9b, 0x651: 0x9b, 0x652: 0x9b, 0x653: 0x9b, 0x654: 0x9b, 0x655: 0x9b, 0x656: 0x9b, 0x657: 0x9b,\n\t0x658: 0x9b, 0x659: 0x9b, 0x65a: 0x9b, 0x65b: 0x16a, 0x65c: 0x9b, 0x65d: 0x16b, 0x65e: 0x9b, 0x65f: 0x16c,\n\t0x660: 0x16d, 0x661: 0x16e, 0x662: 0x16f, 0x663: 0xba, 0x664: 0x170, 0x665: 0x171, 0x666: 0x172, 0x667: 0x173,\n\t0x668: 0xba, 0x669: 0xba, 0x66a: 0xba, 0x66b: 0xba, 0x66c: 0xba, 0x66d: 0xba, 0x66e: 0xba, 0x66f: 0xba,\n\t0x670: 0xba, 0x671: 0xba, 0x672: 0xba, 0x673: 0xba, 0x674: 0xba, 0x675: 0xba, 0x676: 0xba, 0x677: 0xba,\n\t0x678: 0xba, 0x679: 0xba, 0x67a: 0xba, 0x67b: 0xba, 0x67c: 0xba, 0x67d: 0xba, 0x67e: 0xba, 0x67f: 0xba,\n\t// Block 0x1a, offset 0x680\n\t0x680: 0x9f, 0x681: 0x9f, 0x682: 0x9f, 0x683: 0x9f, 0x684: 0x9f, 0x685: 0x9f, 0x686: 0x9f, 0x687: 0x9f,\n\t0x688: 0x9f, 0x689: 0x9f, 0x68a: 0x9f, 0x68b: 0x9f, 0x68c: 0x9f, 0x68d: 0x9f, 0x68e: 0x9f, 0x68f: 0x9f,\n\t0x690: 0x9f, 0x691: 0x9f, 0x692: 0x9f, 0x693: 0x9f, 0x694: 0x9f, 0x695: 0x9f, 0x696: 0x9f, 0x697: 0x9f,\n\t0x698: 0x9f, 0x699: 0x9f, 0x69a: 0x9f, 0x69b: 0x174, 0x69c: 0x9f, 0x69d: 0x9f, 0x69e: 0x9f, 0x69f: 0x9f,\n\t0x6a0: 0x9f, 0x6a1: 0x9f, 0x6a2: 0x9f, 0x6a3: 0x9f, 0x6a4: 0x9f, 0x6a5: 0x9f, 0x6a6: 0x9f, 0x6a7: 0x9f,\n\t0x6a8: 0x9f, 0x6a9: 0x9f, 0x6aa: 0x9f, 0x6ab: 0x9f, 0x6ac: 0x9f, 0x6ad: 0x9f, 0x6ae: 0x9f, 0x6af: 0x9f,\n\t0x6b0: 0x9f, 0x6b1: 0x9f, 0x6b2: 0x9f, 0x6b3: 0x9f, 0x6b4: 0x9f, 0x6b5: 0x9f, 0x6b6: 0x9f, 0x6b7: 0x9f,\n\t0x6b8: 0x9f, 0x6b9: 0x9f, 0x6ba: 0x9f, 0x6bb: 0x9f, 0x6bc: 0x9f, 0x6bd: 0x9f, 0x6be: 0x9f, 0x6bf: 0x9f,\n\t// Block 0x1b, offset 0x6c0\n\t0x6c0: 0x9f, 0x6c1: 0x9f, 0x6c2: 0x9f, 0x6c3: 0x9f, 0x6c4: 0x9f, 0x6c5: 0x9f, 0x6c6: 0x9f, 0x6c7: 0x9f,\n\t0x6c8: 0x9f, 0x6c9: 0x9f, 0x6ca: 0x9f, 0x6cb: 0x9f, 0x6cc: 0x9f, 0x6cd: 0x9f, 0x6ce: 0x9f, 0x6cf: 0x9f,\n\t0x6d0: 0x9f, 0x6d1: 0x9f, 0x6d2: 0x9f, 0x6d3: 0x9f, 0x6d4: 0x9f, 0x6d5: 0x9f, 0x6d6: 0x9f, 0x6d7: 0x9f,\n\t0x6d8: 0x9f, 0x6d9: 0x9f, 0x6da: 0x9f, 0x6db: 0x9f, 0x6dc: 0x175, 0x6dd: 0x9f, 0x6de: 0x9f, 0x6df: 0x9f,\n\t0x6e0: 0x176, 0x6e1: 0x9f, 0x6e2: 0x9f, 0x6e3: 0x9f, 0x6e4: 0x9f, 0x6e5: 0x9f, 0x6e6: 0x9f, 0x6e7: 0x9f,\n\t0x6e8: 0x9f, 0x6e9: 0x9f, 0x6ea: 0x9f, 0x6eb: 0x9f, 0x6ec: 0x9f, 0x6ed: 0x9f, 0x6ee: 0x9f, 0x6ef: 0x9f,\n\t0x6f0: 0x9f, 0x6f1: 0x9f, 0x6f2: 0x9f, 0x6f3: 0x9f, 0x6f4: 0x9f, 0x6f5: 0x9f, 0x6f6: 0x9f, 0x6f7: 0x9f,\n\t0x6f8: 0x9f, 0x6f9: 0x9f, 0x6fa: 0x9f, 0x6fb: 0x9f, 0x6fc: 0x9f, 0x6fd: 0x9f, 0x6fe: 0x9f, 0x6ff: 0x9f,\n\t// Block 0x1c, offset 0x700\n\t0x700: 0x9f, 0x701: 0x9f, 0x702: 0x9f, 0x703: 0x9f, 0x704: 0x9f, 0x705: 0x9f, 0x706: 0x9f, 0x707: 0x9f,\n\t0x708: 0x9f, 0x709: 0x9f, 0x70a: 0x9f, 0x70b: 0x9f, 0x70c: 0x9f, 0x70d: 0x9f, 0x70e: 0x9f, 0x70f: 0x9f,\n\t0x710: 0x9f, 0x711: 0x9f, 0x712: 0x9f, 0x713: 0x9f, 0x714: 0x9f, 0x715: 0x9f, 0x716: 0x9f, 0x717: 0x9f,\n\t0x718: 0x9f, 0x719: 0x9f, 0x71a: 0x9f, 0x71b: 0x9f, 0x71c: 0x9f, 0x71d: 0x9f, 0x71e: 0x9f, 0x71f: 0x9f,\n\t0x720: 0x9f, 0x721: 0x9f, 0x722: 0x9f, 0x723: 0x9f, 0x724: 0x9f, 0x725: 0x9f, 0x726: 0x9f, 0x727: 0x9f,\n\t0x728: 0x9f, 0x729: 0x9f, 0x72a: 0x9f, 0x72b: 0x9f, 0x72c: 0x9f, 0x72d: 0x9f, 0x72e: 0x9f, 0x72f: 0x9f,\n\t0x730: 0x9f, 0x731: 0x9f, 0x732: 0x9f, 0x733: 0x9f, 0x734: 0x9f, 0x735: 0x9f, 0x736: 0x9f, 0x737: 0x9f,\n\t0x738: 0x9f, 0x739: 0x9f, 0x73a: 0x177, 0x73b: 0xba, 0x73c: 0xba, 0x73d: 0xba, 0x73e: 0xba, 0x73f: 0xba,\n\t// Block 0x1d, offset 0x740\n\t0x740: 0xba, 0x741: 0xba, 0x742: 0xba, 0x743: 0xba, 0x744: 0xba, 0x745: 0xba, 0x746: 0xba, 0x747: 0xba,\n\t0x748: 0xba, 0x749: 0xba, 0x74a: 0xba, 0x74b: 0xba, 0x74c: 0xba, 0x74d: 0xba, 0x74e: 0xba, 0x74f: 0xba,\n\t0x750: 0xba, 0x751: 0xba, 0x752: 0xba, 0x753: 0xba, 0x754: 0xba, 0x755: 0xba, 0x756: 0xba, 0x757: 0xba,\n\t0x758: 0xba, 0x759: 0xba, 0x75a: 0xba, 0x75b: 0xba, 0x75c: 0xba, 0x75d: 0xba, 0x75e: 0xba, 0x75f: 0xba,\n\t0x760: 0x75, 0x761: 0x76, 0x762: 0x77, 0x763: 0x178, 0x764: 0x78, 0x765: 0x79, 0x766: 0x179, 0x767: 0x7a,\n\t0x768: 0x7b, 0x769: 0xba, 0x76a: 0xba, 0x76b: 0xba, 0x76c: 0xba, 0x76d: 0xba, 0x76e: 0xba, 0x76f: 0xba,\n\t0x770: 0xba, 0x771: 0xba, 0x772: 0xba, 0x773: 0xba, 0x774: 0xba, 0x775: 0xba, 0x776: 0xba, 0x777: 0xba,\n\t0x778: 0xba, 0x779: 0xba, 0x77a: 0xba, 0x77b: 0xba, 0x77c: 0xba, 0x77d: 0xba, 0x77e: 0xba, 0x77f: 0xba,\n\t// Block 0x1e, offset 0x780\n\t0x790: 0x0d, 0x791: 0x0e, 0x792: 0x0f, 0x793: 0x10, 0x794: 0x11, 0x795: 0x0b, 0x796: 0x12, 0x797: 0x07,\n\t0x798: 0x13, 0x799: 0x0b, 0x79a: 0x0b, 0x79b: 0x14, 0x79c: 0x0b, 0x79d: 0x15, 0x79e: 0x16, 0x79f: 0x17,\n\t0x7a0: 0x07, 0x7a1: 0x07, 0x7a2: 0x07, 0x7a3: 0x07, 0x7a4: 0x07, 0x7a5: 0x07, 0x7a6: 0x07, 0x7a7: 0x07,\n\t0x7a8: 0x07, 0x7a9: 0x07, 0x7aa: 0x18, 0x7ab: 0x19, 0x7ac: 0x1a, 0x7ad: 0x0b, 0x7ae: 0x0b, 0x7af: 0x1b,\n\t0x7b0: 0x0b, 0x7b1: 0x0b, 0x7b2: 0x0b, 0x7b3: 0x0b, 0x7b4: 0x0b, 0x7b5: 0x0b, 0x7b6: 0x0b, 0x7b7: 0x0b,\n\t0x7b8: 0x0b, 0x7b9: 0x0b, 0x7ba: 0x0b, 0x7bb: 0x0b, 0x7bc: 0x0b, 0x7bd: 0x0b, 0x7be: 0x0b, 0x7bf: 0x0b,\n\t// Block 0x1f, offset 0x7c0\n\t0x7c0: 0x0b, 0x7c1: 0x0b, 0x7c2: 0x0b, 0x7c3: 0x0b, 0x7c4: 0x0b, 0x7c5: 0x0b, 0x7c6: 0x0b, 0x7c7: 0x0b,\n\t0x7c8: 0x0b, 0x7c9: 0x0b, 0x7ca: 0x0b, 0x7cb: 0x0b, 0x7cc: 0x0b, 0x7cd: 0x0b, 0x7ce: 0x0b, 0x7cf: 0x0b,\n\t0x7d0: 0x0b, 0x7d1: 0x0b, 0x7d2: 0x0b, 0x7d3: 0x0b, 0x7d4: 0x0b, 0x7d5: 0x0b, 0x7d6: 0x0b, 0x7d7: 0x0b,\n\t0x7d8: 0x0b, 0x7d9: 0x0b, 0x7da: 0x0b, 0x7db: 0x0b, 0x7dc: 0x0b, 0x7dd: 0x0b, 0x7de: 0x0b, 0x7df: 0x0b,\n\t0x7e0: 0x0b, 0x7e1: 0x0b, 0x7e2: 0x0b, 0x7e3: 0x0b, 0x7e4: 0x0b, 0x7e5: 0x0b, 0x7e6: 0x0b, 0x7e7: 0x0b,\n\t0x7e8: 0x0b, 0x7e9: 0x0b, 0x7ea: 0x0b, 0x7eb: 0x0b, 0x7ec: 0x0b, 0x7ed: 0x0b, 0x7ee: 0x0b, 0x7ef: 0x0b,\n\t0x7f0: 0x0b, 0x7f1: 0x0b, 0x7f2: 0x0b, 0x7f3: 0x0b, 0x7f4: 0x0b, 0x7f5: 0x0b, 0x7f6: 0x0b, 0x7f7: 0x0b,\n\t0x7f8: 0x0b, 0x7f9: 0x0b, 0x7fa: 0x0b, 0x7fb: 0x0b, 0x7fc: 0x0b, 0x7fd: 0x0b, 0x7fe: 0x0b, 0x7ff: 0x0b,\n\t// Block 0x20, offset 0x800\n\t0x800: 0x17a, 0x801: 0x17b, 0x802: 0xba, 0x803: 0xba, 0x804: 0x17c, 0x805: 0x17c, 0x806: 0x17c, 0x807: 0x17d,\n\t0x808: 0xba, 0x809: 0xba, 0x80a: 0xba, 0x80b: 0xba, 0x80c: 0xba, 0x80d: 0xba, 0x80e: 0xba, 0x80f: 0xba,\n\t0x810: 0xba, 0x811: 0xba, 0x812: 0xba, 0x813: 0xba, 0x814: 0xba, 0x815: 0xba, 0x816: 0xba, 0x817: 0xba,\n\t0x818: 0xba, 0x819: 0xba, 0x81a: 0xba, 0x81b: 0xba, 0x81c: 0xba, 0x81d: 0xba, 0x81e: 0xba, 0x81f: 0xba,\n\t0x820: 0xba, 0x821: 0xba, 0x822: 0xba, 0x823: 0xba, 0x824: 0xba, 0x825: 0xba, 0x826: 0xba, 0x827: 0xba,\n\t0x828: 0xba, 0x829: 0xba, 0x82a: 0xba, 0x82b: 0xba, 0x82c: 0xba, 0x82d: 0xba, 0x82e: 0xba, 0x82f: 0xba,\n\t0x830: 0xba, 0x831: 0xba, 0x832: 0xba, 0x833: 0xba, 0x834: 0xba, 0x835: 0xba, 0x836: 0xba, 0x837: 0xba,\n\t0x838: 0xba, 0x839: 0xba, 0x83a: 0xba, 0x83b: 0xba, 0x83c: 0xba, 0x83d: 0xba, 0x83e: 0xba, 0x83f: 0xba,\n\t// Block 0x21, offset 0x840\n\t0x840: 0x0b, 0x841: 0x0b, 0x842: 0x0b, 0x843: 0x0b, 0x844: 0x0b, 0x845: 0x0b, 0x846: 0x0b, 0x847: 0x0b,\n\t0x848: 0x0b, 0x849: 0x0b, 0x84a: 0x0b, 0x84b: 0x0b, 0x84c: 0x0b, 0x84d: 0x0b, 0x84e: 0x0b, 0x84f: 0x0b,\n\t0x850: 0x0b, 0x851: 0x0b, 0x852: 0x0b, 0x853: 0x0b, 0x854: 0x0b, 0x855: 0x0b, 0x856: 0x0b, 0x857: 0x0b,\n\t0x858: 0x0b, 0x859: 0x0b, 0x85a: 0x0b, 0x85b: 0x0b, 0x85c: 0x0b, 0x85d: 0x0b, 0x85e: 0x0b, 0x85f: 0x0b,\n\t0x860: 0x1e, 0x861: 0x0b, 0x862: 0x0b, 0x863: 0x0b, 0x864: 0x0b, 0x865: 0x0b, 0x866: 0x0b, 0x867: 0x0b,\n\t0x868: 0x0b, 0x869: 0x0b, 0x86a: 0x0b, 0x86b: 0x0b, 0x86c: 0x0b, 0x86d: 0x0b, 0x86e: 0x0b, 0x86f: 0x0b,\n\t0x870: 0x0b, 0x871: 0x0b, 0x872: 0x0b, 0x873: 0x0b, 0x874: 0x0b, 0x875: 0x0b, 0x876: 0x0b, 0x877: 0x0b,\n\t0x878: 0x0b, 0x879: 0x0b, 0x87a: 0x0b, 0x87b: 0x0b, 0x87c: 0x0b, 0x87d: 0x0b, 0x87e: 0x0b, 0x87f: 0x0b,\n\t// Block 0x22, offset 0x880\n\t0x880: 0x0b, 0x881: 0x0b, 0x882: 0x0b, 0x883: 0x0b, 0x884: 0x0b, 0x885: 0x0b, 0x886: 0x0b, 0x887: 0x0b,\n\t0x888: 0x0b, 0x889: 0x0b, 0x88a: 0x0b, 0x88b: 0x0b, 0x88c: 0x0b, 0x88d: 0x0b, 0x88e: 0x0b, 0x88f: 0x0b,\n}\n\n// idnaSparseOffset: 258 entries, 516 bytes\nvar idnaSparseOffset = []uint16{0x0, 0x8, 0x19, 0x25, 0x27, 0x2c, 0x34, 0x3f, 0x4b, 0x4f, 0x5e, 0x63, 0x6b, 0x77, 0x85, 0x93, 0x98, 0xa1, 0xb1, 0xbf, 0xcc, 0xd8, 0xe9, 0xf3, 0xfa, 0x107, 0x118, 0x11f, 0x12a, 0x139, 0x147, 0x151, 0x153, 0x158, 0x15b, 0x15e, 0x160, 0x16c, 0x177, 0x17f, 0x185, 0x18b, 0x190, 0x195, 0x198, 0x19c, 0x1a2, 0x1a7, 0x1b3, 0x1bd, 0x1c3, 0x1d4, 0x1de, 0x1e1, 0x1e9, 0x1ec, 0x1f9, 0x201, 0x205, 0x20c, 0x214, 0x224, 0x230, 0x232, 0x23c, 0x248, 0x254, 0x260, 0x268, 0x26d, 0x277, 0x288, 0x28c, 0x297, 0x29b, 0x2a4, 0x2ac, 0x2b2, 0x2b7, 0x2ba, 0x2bd, 0x2c1, 0x2c7, 0x2cb, 0x2cf, 0x2d5, 0x2dc, 0x2e2, 0x2ea, 0x2f1, 0x2fc, 0x306, 0x30a, 0x30d, 0x313, 0x317, 0x319, 0x31c, 0x31e, 0x321, 0x32b, 0x32e, 0x33d, 0x341, 0x346, 0x349, 0x34d, 0x352, 0x357, 0x35d, 0x363, 0x372, 0x378, 0x37c, 0x38b, 0x390, 0x398, 0x3a2, 0x3ad, 0x3b5, 0x3c6, 0x3cf, 0x3df, 0x3ec, 0x3f6, 0x3fb, 0x408, 0x40c, 0x411, 0x413, 0x417, 0x419, 0x41d, 0x426, 0x42c, 0x430, 0x440, 0x44a, 0x44f, 0x452, 0x458, 0x45f, 0x464, 0x468, 0x46e, 0x473, 0x47c, 0x481, 0x487, 0x48e, 0x495, 0x49c, 0x4a0, 0x4a5, 0x4a8, 0x4ad, 0x4b9, 0x4bf, 0x4c4, 0x4cb, 0x4d3, 0x4d8, 0x4dc, 0x4ec, 0x4f3, 0x4f7, 0x4fb, 0x502, 0x504, 0x507, 0x50a, 0x50e, 0x512, 0x518, 0x521, 0x52d, 0x534, 0x53d, 0x545, 0x54c, 0x55a, 0x567, 0x574, 0x57d, 0x581, 0x58f, 0x597, 0x5a2, 0x5ab, 0x5b1, 0x5b9, 0x5c2, 0x5cc, 0x5cf, 0x5db, 0x5de, 0x5e3, 0x5e6, 0x5f0, 0x5f9, 0x605, 0x608, 0x60d, 0x610, 0x613, 0x616, 0x61d, 0x624, 0x628, 0x633, 0x636, 0x63c, 0x641, 0x645, 0x648, 0x64b, 0x64e, 0x653, 0x65d, 0x660, 0x664, 0x673, 0x67f, 0x683, 0x688, 0x68d, 0x691, 0x696, 0x69f, 0x6aa, 0x6b0, 0x6b8, 0x6bc, 0x6c0, 0x6c6, 0x6cc, 0x6d1, 0x6d4, 0x6e2, 0x6e9, 0x6ec, 0x6ef, 0x6f3, 0x6f9, 0x6fe, 0x708, 0x70d, 0x710, 0x713, 0x716, 0x719, 0x71d, 0x720, 0x730, 0x741, 0x746, 0x748, 0x74a}\n\n// idnaSparseValues: 1869 entries, 7476 bytes\nvar idnaSparseValues = [1869]valueRange{\n\t// Block 0x0, offset 0x0\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0xe105, lo: 0x80, hi: 0x96},\n\t{value: 0x0018, lo: 0x97, hi: 0x97},\n\t{value: 0xe105, lo: 0x98, hi: 0x9e},\n\t{value: 0x001f, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbf},\n\t// Block 0x1, offset 0x8\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0xe01d, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0335, lo: 0x83, hi: 0x83},\n\t{value: 0x034d, lo: 0x84, hi: 0x84},\n\t{value: 0x0365, lo: 0x85, hi: 0x85},\n\t{value: 0xe00d, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0xe00d, lo: 0x88, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x89},\n\t{value: 0xe00d, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe00d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0x8d},\n\t{value: 0xe00d, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0xbf},\n\t// Block 0x2, offset 0x19\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x0249, lo: 0xb0, hi: 0xb0},\n\t{value: 0x037d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0259, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0269, lo: 0xb3, hi: 0xb3},\n\t{value: 0x034d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0395, lo: 0xb5, hi: 0xb5},\n\t{value: 0xe1bd, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0279, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0289, lo: 0xb8, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbf},\n\t// Block 0x3, offset 0x25\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x3308, lo: 0x80, hi: 0xbf},\n\t// Block 0x4, offset 0x27\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x03f5, lo: 0x80, hi: 0x8f},\n\t{value: 0xe105, lo: 0x90, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5, offset 0x2c\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x0545, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x0008, lo: 0x99, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xbf},\n\t// Block 0x6, offset 0x34\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0401, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x88},\n\t{value: 0x0018, lo: 0x89, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x3308, lo: 0x91, hi: 0xbd},\n\t{value: 0x0818, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x7, offset 0x3f\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0818, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x82},\n\t{value: 0x0818, lo: 0x83, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x85},\n\t{value: 0x0818, lo: 0x86, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0808, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x8, offset 0x4b\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0a08, lo: 0x80, hi: 0x87},\n\t{value: 0x0c08, lo: 0x88, hi: 0x99},\n\t{value: 0x0a08, lo: 0x9a, hi: 0xbf},\n\t// Block 0x9, offset 0x4f\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3308, lo: 0x80, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8c},\n\t{value: 0x0c08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0a08, lo: 0x8e, hi: 0x98},\n\t{value: 0x0c08, lo: 0x99, hi: 0x9b},\n\t{value: 0x0a08, lo: 0x9c, hi: 0xaa},\n\t{value: 0x0c08, lo: 0xab, hi: 0xac},\n\t{value: 0x0a08, lo: 0xad, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0a08, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0c08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0a08, lo: 0xb5, hi: 0xb7},\n\t{value: 0x0c08, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbf},\n\t// Block 0xa, offset 0x5e\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xb0},\n\t{value: 0x0808, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xb, offset 0x63\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x89},\n\t{value: 0x0a08, lo: 0x8a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0xc, offset 0x6b\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x99},\n\t{value: 0x0808, lo: 0x9a, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa3},\n\t{value: 0x0808, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa7},\n\t{value: 0x0808, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0818, lo: 0xb0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xd, offset 0x77\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0c08, lo: 0x80, hi: 0x80},\n\t{value: 0x0a08, lo: 0x81, hi: 0x85},\n\t{value: 0x0c08, lo: 0x86, hi: 0x87},\n\t{value: 0x0a08, lo: 0x88, hi: 0x88},\n\t{value: 0x0c08, lo: 0x89, hi: 0x89},\n\t{value: 0x0a08, lo: 0x8a, hi: 0x93},\n\t{value: 0x0c08, lo: 0x94, hi: 0x94},\n\t{value: 0x0a08, lo: 0x95, hi: 0x95},\n\t{value: 0x0808, lo: 0x96, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0818, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xbf},\n\t// Block 0xe, offset 0x85\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0a08, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0c08, lo: 0xaa, hi: 0xac},\n\t{value: 0x0808, lo: 0xad, hi: 0xad},\n\t{value: 0x0c08, lo: 0xae, hi: 0xae},\n\t{value: 0x0a08, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0c08, lo: 0xb1, hi: 0xb2},\n\t{value: 0x0a08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0a08, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0c08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0a08, lo: 0xba, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0xf, offset 0x93\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x93},\n\t{value: 0x3308, lo: 0x94, hi: 0xa1},\n\t{value: 0x0840, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xbf},\n\t// Block 0x10, offset 0x98\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x11, offset 0xa1\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x85},\n\t{value: 0x3008, lo: 0x86, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x3008, lo: 0x8a, hi: 0x8c},\n\t{value: 0x3b08, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x12, offset 0xb1\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0008, lo: 0xaa, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x13, offset 0xbf\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x14, offset 0xcc\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0040, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x15, offset 0xd8\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x89},\n\t{value: 0x3b08, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x3008, lo: 0x98, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x16, offset 0xe9\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb2},\n\t{value: 0x08f1, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb9},\n\t{value: 0x3b08, lo: 0xba, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x0018, lo: 0xbf, hi: 0xbf},\n\t// Block 0x17, offset 0xf3\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x8e},\n\t{value: 0x0018, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0xbf},\n\t// Block 0x18, offset 0xfa\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0961, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0999, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0008, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x19, offset 0x107\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8a},\n\t{value: 0x0008, lo: 0x8b, hi: 0x8b},\n\t{value: 0xe03d, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x1a, offset 0x118\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0xbf},\n\t// Block 0x1b, offset 0x11f\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x1c, offset 0x12a\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x3008, lo: 0x96, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x3308, lo: 0x9e, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3008, lo: 0xa2, hi: 0xa4},\n\t{value: 0x0008, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xbf},\n\t// Block 0x1d, offset 0x139\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x8c},\n\t{value: 0x3308, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x8e},\n\t{value: 0x3008, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x3008, lo: 0x9a, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0x1e, offset 0x147\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x86},\n\t{value: 0x055d, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8c},\n\t{value: 0x055d, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe105, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x1f, offset 0x151\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0018, lo: 0x80, hi: 0xbf},\n\t// Block 0x20, offset 0x153\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa0},\n\t{value: 0x2018, lo: 0xa1, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x21, offset 0x158\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa7},\n\t{value: 0x2018, lo: 0xa8, hi: 0xbf},\n\t// Block 0x22, offset 0x15b\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x2018, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0xbf},\n\t// Block 0x23, offset 0x15e\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0008, lo: 0x80, hi: 0xbf},\n\t// Block 0x24, offset 0x160\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x99},\n\t{value: 0x0008, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x25, offset 0x16c\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x26, offset 0x177\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x27, offset 0x17f\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0x0008, lo: 0x92, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbf},\n\t// Block 0x28, offset 0x185\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x29, offset 0x18b\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x2a, offset 0x190\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x2b, offset 0x195\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x2c, offset 0x198\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xbf},\n\t// Block 0x2d, offset 0x19c\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x2e, offset 0x1a2\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0x2f, offset 0x1a7\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0008, lo: 0x8e, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x3b08, lo: 0x94, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3b08, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x30, offset 0x1b3\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x31, offset 0x1bd\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xb3},\n\t{value: 0x3340, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x32, offset 0x1c3\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x3008, lo: 0x80, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x3008, lo: 0x87, hi: 0x88},\n\t{value: 0x3308, lo: 0x89, hi: 0x91},\n\t{value: 0x3b08, lo: 0x92, hi: 0x92},\n\t{value: 0x3308, lo: 0x93, hi: 0x93},\n\t{value: 0x0018, lo: 0x94, hi: 0x96},\n\t{value: 0x0008, lo: 0x97, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x33, offset 0x1d4\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0018, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x86},\n\t{value: 0x0218, lo: 0x87, hi: 0x87},\n\t{value: 0x0018, lo: 0x88, hi: 0x8a},\n\t{value: 0x33c0, lo: 0x8b, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0208, lo: 0xa0, hi: 0xbf},\n\t// Block 0x34, offset 0x1de\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0208, lo: 0x80, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x35, offset 0x1e1\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0208, lo: 0x87, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0208, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x36, offset 0x1e9\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0x37, offset 0x1ec\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3308, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x38, offset 0x1f9\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0008, lo: 0x86, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0x39, offset 0x201\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x3a, offset 0x205\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0028, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0040, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0xbf},\n\t// Block 0x3b, offset 0x20c\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x3308, lo: 0x97, hi: 0x98},\n\t{value: 0x3008, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x3c, offset 0x214\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x94},\n\t{value: 0x3008, lo: 0x95, hi: 0x95},\n\t{value: 0x3308, lo: 0x96, hi: 0x96},\n\t{value: 0x3008, lo: 0x97, hi: 0x97},\n\t{value: 0x3308, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3b08, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xac},\n\t{value: 0x3008, lo: 0xad, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3d, offset 0x224\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xbd},\n\t{value: 0x3318, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x3e, offset 0x230\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0040, lo: 0x80, hi: 0xbf},\n\t// Block 0x3f, offset 0x232\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x83},\n\t{value: 0x3008, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x40, offset 0x23c\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x3808, lo: 0x84, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x41, offset 0x248\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3808, lo: 0xaa, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xbf},\n\t// Block 0x42, offset 0x254\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa9},\n\t{value: 0x3008, lo: 0xaa, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3808, lo: 0xb2, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbf},\n\t// Block 0x43, offset 0x260\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x3008, lo: 0xa4, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbf},\n\t// Block 0x44, offset 0x268\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x45, offset 0x26d\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0e29, lo: 0x80, hi: 0x80},\n\t{value: 0x0e41, lo: 0x81, hi: 0x81},\n\t{value: 0x0e59, lo: 0x82, hi: 0x82},\n\t{value: 0x0e71, lo: 0x83, hi: 0x83},\n\t{value: 0x0e89, lo: 0x84, hi: 0x85},\n\t{value: 0x0ea1, lo: 0x86, hi: 0x86},\n\t{value: 0x0eb9, lo: 0x87, hi: 0x87},\n\t{value: 0x057d, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0x46, offset 0x277\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x92},\n\t{value: 0x0018, lo: 0x93, hi: 0x93},\n\t{value: 0x3308, lo: 0x94, hi: 0xa0},\n\t{value: 0x3008, lo: 0xa1, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa8},\n\t{value: 0x0008, lo: 0xa9, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x0008, lo: 0xae, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x47, offset 0x288\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0x48, offset 0x28c\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x87},\n\t{value: 0xe045, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0xe045, lo: 0x98, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0xe045, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb7},\n\t{value: 0xe045, lo: 0xb8, hi: 0xbf},\n\t// Block 0x49, offset 0x297\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x3318, lo: 0x90, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbf},\n\t// Block 0x4a, offset 0x29b\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x88},\n\t{value: 0x24c1, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x4b, offset 0x2a4\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x24f1, lo: 0xac, hi: 0xac},\n\t{value: 0x2529, lo: 0xad, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xae},\n\t{value: 0x2579, lo: 0xaf, hi: 0xaf},\n\t{value: 0x25b1, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0x4c, offset 0x2ac\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x9f},\n\t{value: 0x0080, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xad},\n\t{value: 0x0080, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x4d, offset 0x2b2\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xa8},\n\t{value: 0x09c5, lo: 0xa9, hi: 0xa9},\n\t{value: 0x09e5, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xbf},\n\t// Block 0x4e, offset 0x2b7\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x4f, offset 0x2ba\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xbf},\n\t// Block 0x50, offset 0x2bd\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x28c1, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0xbf},\n\t// Block 0x51, offset 0x2c1\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0e66, lo: 0xb4, hi: 0xb4},\n\t{value: 0x292a, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0e86, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x52, offset 0x2c7\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x9b},\n\t{value: 0x2941, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0xbf},\n\t// Block 0x53, offset 0x2cb\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0x54, offset 0x2cf\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0018, lo: 0x98, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbc},\n\t{value: 0x0018, lo: 0xbd, hi: 0xbf},\n\t// Block 0x55, offset 0x2d5\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0xab},\n\t{value: 0x0018, lo: 0xac, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x56, offset 0x2dc\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0xe185, lo: 0x80, hi: 0x8f},\n\t{value: 0x03f5, lo: 0x90, hi: 0x9f},\n\t{value: 0x0ea5, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x57, offset 0x2e2\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xa6},\n\t{value: 0x0008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xac},\n\t{value: 0x0008, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x58, offset 0x2ea\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xae},\n\t{value: 0xe075, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0x59, offset 0x2f1\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0008, lo: 0xb8, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x5a, offset 0x2fc\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xbf},\n\t// Block 0x5b, offset 0x306\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x5c, offset 0x30a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0xbf},\n\t// Block 0x5d, offset 0x30d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9e},\n\t{value: 0x0edd, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0x5e, offset 0x313\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xb2},\n\t{value: 0x0efd, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0x5f, offset 0x317\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x0f1d, lo: 0x80, hi: 0xbf},\n\t// Block 0x60, offset 0x319\n\t{value: 0x0020, lo: 0x02},\n\t{value: 0x171d, lo: 0x80, hi: 0x8f},\n\t{value: 0x18fd, lo: 0x90, hi: 0xbf},\n\t// Block 0x61, offset 0x31c\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x1efd, lo: 0x80, hi: 0xbf},\n\t// Block 0x62, offset 0x31e\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0xbf},\n\t// Block 0x63, offset 0x321\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x98},\n\t{value: 0x3308, lo: 0x99, hi: 0x9a},\n\t{value: 0x29e2, lo: 0x9b, hi: 0x9b},\n\t{value: 0x2a0a, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0008, lo: 0x9d, hi: 0x9e},\n\t{value: 0x2a31, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0008, lo: 0xa1, hi: 0xbf},\n\t// Block 0x64, offset 0x32b\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xbe},\n\t{value: 0x2a69, lo: 0xbf, hi: 0xbf},\n\t// Block 0x65, offset 0x32e\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0040, lo: 0x80, hi: 0x84},\n\t{value: 0x0008, lo: 0x85, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xb0},\n\t{value: 0x2a1d, lo: 0xb1, hi: 0xb1},\n\t{value: 0x2a3d, lo: 0xb2, hi: 0xb2},\n\t{value: 0x2a5d, lo: 0xb3, hi: 0xb3},\n\t{value: 0x2a7d, lo: 0xb4, hi: 0xb4},\n\t{value: 0x2a5d, lo: 0xb5, hi: 0xb5},\n\t{value: 0x2a9d, lo: 0xb6, hi: 0xb6},\n\t{value: 0x2abd, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2add, lo: 0xb8, hi: 0xb9},\n\t{value: 0x2afd, lo: 0xba, hi: 0xbb},\n\t{value: 0x2b1d, lo: 0xbc, hi: 0xbd},\n\t{value: 0x2afd, lo: 0xbe, hi: 0xbf},\n\t// Block 0x66, offset 0x33d\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x67, offset 0x341\n\t{value: 0x0030, lo: 0x04},\n\t{value: 0x2aa2, lo: 0x80, hi: 0x9d},\n\t{value: 0x305a, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x30a2, lo: 0xa0, hi: 0xbf},\n\t// Block 0x68, offset 0x346\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0xbf},\n\t// Block 0x69, offset 0x349\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0040, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0x6a, offset 0x34d\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0x6b, offset 0x352\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xbf},\n\t// Block 0x6c, offset 0x357\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0018, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x6d, offset 0x35d\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0xb6},\n\t{value: 0x0008, lo: 0xb7, hi: 0xb7},\n\t{value: 0x2009, lo: 0xb8, hi: 0xb8},\n\t{value: 0x6e89, lo: 0xb9, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xbf},\n\t// Block 0x6e, offset 0x363\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x3308, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x3308, lo: 0x8b, hi: 0x8b},\n\t{value: 0x0008, lo: 0x8c, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3008, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0018, lo: 0xa8, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x6f, offset 0x372\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0208, lo: 0x80, hi: 0xb1},\n\t{value: 0x0108, lo: 0xb2, hi: 0xb2},\n\t{value: 0x0008, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0x70, offset 0x378\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xbf},\n\t// Block 0x71, offset 0x37c\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x3008, lo: 0x80, hi: 0x83},\n\t{value: 0x3b08, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8d},\n\t{value: 0x0018, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xba},\n\t{value: 0x0008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0018, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x72, offset 0x38b\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x73, offset 0x390\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x3308, lo: 0x87, hi: 0x91},\n\t{value: 0x3008, lo: 0x92, hi: 0x92},\n\t{value: 0x3808, lo: 0x93, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0x74, offset 0x398\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x3008, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb9},\n\t{value: 0x3008, lo: 0xba, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbf},\n\t// Block 0x75, offset 0x3a2\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0x76, offset 0x3ad\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xa8},\n\t{value: 0x3308, lo: 0xa9, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb0},\n\t{value: 0x3308, lo: 0xb1, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x77, offset 0x3b5\n\t{value: 0x0000, lo: 0x10},\n\t{value: 0x0008, lo: 0x80, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8c},\n\t{value: 0x3008, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xb9},\n\t{value: 0x0008, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbc},\n\t{value: 0x3008, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0008, lo: 0xbe, hi: 0xbf},\n\t// Block 0x78, offset 0x3c6\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb4},\n\t{value: 0x0008, lo: 0xb5, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0008, lo: 0xb9, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbf},\n\t// Block 0x79, offset 0x3cf\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x9a},\n\t{value: 0x0008, lo: 0x9b, hi: 0x9d},\n\t{value: 0x0018, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xaa},\n\t{value: 0x3008, lo: 0xab, hi: 0xab},\n\t{value: 0x3308, lo: 0xac, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3b08, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x7a, offset 0x3df\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x88},\n\t{value: 0x0008, lo: 0x89, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x90},\n\t{value: 0x0008, lo: 0x91, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7b, offset 0x3ec\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x4465, lo: 0x9c, hi: 0x9c},\n\t{value: 0x447d, lo: 0x9d, hi: 0x9d},\n\t{value: 0x2971, lo: 0x9e, hi: 0x9e},\n\t{value: 0xe06d, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa5},\n\t{value: 0x0040, lo: 0xa6, hi: 0xaf},\n\t{value: 0x4495, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7c, offset 0x3f6\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x44b5, lo: 0x80, hi: 0x8f},\n\t{value: 0x44d5, lo: 0x90, hi: 0x9f},\n\t{value: 0x44f5, lo: 0xa0, hi: 0xaf},\n\t{value: 0x44d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7d, offset 0x3fb\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0xa2},\n\t{value: 0x3008, lo: 0xa3, hi: 0xa4},\n\t{value: 0x3308, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa7},\n\t{value: 0x3308, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xaa},\n\t{value: 0x0018, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3b08, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0x7e, offset 0x408\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0x7f, offset 0x40c\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x80, offset 0x411\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x4515, lo: 0x80, hi: 0xbf},\n\t// Block 0x81, offset 0x413\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x4d15, lo: 0x80, hi: 0x94},\n\t{value: 0x4ad5, lo: 0x95, hi: 0x95},\n\t{value: 0x4fb5, lo: 0x96, hi: 0xbf},\n\t// Block 0x82, offset 0x417\n\t{value: 0x0020, lo: 0x01},\n\t{value: 0x54f5, lo: 0x80, hi: 0xbf},\n\t// Block 0x83, offset 0x419\n\t{value: 0x0020, lo: 0x03},\n\t{value: 0x5cf5, lo: 0x80, hi: 0x84},\n\t{value: 0x5655, lo: 0x85, hi: 0x85},\n\t{value: 0x5d95, lo: 0x86, hi: 0xbf},\n\t// Block 0x84, offset 0x41d\n\t{value: 0x0020, lo: 0x08},\n\t{value: 0x6b55, lo: 0x80, hi: 0x8f},\n\t{value: 0x6d15, lo: 0x90, hi: 0x90},\n\t{value: 0x6d55, lo: 0x91, hi: 0xab},\n\t{value: 0x6ea1, lo: 0xac, hi: 0xac},\n\t{value: 0x70b5, lo: 0xad, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x70d5, lo: 0xb0, hi: 0xbf},\n\t// Block 0x85, offset 0x426\n\t{value: 0x0020, lo: 0x05},\n\t{value: 0x72d5, lo: 0x80, hi: 0xad},\n\t{value: 0x6535, lo: 0xae, hi: 0xae},\n\t{value: 0x7895, lo: 0xaf, hi: 0xb5},\n\t{value: 0x6f55, lo: 0xb6, hi: 0xb6},\n\t{value: 0x7975, lo: 0xb7, hi: 0xbf},\n\t// Block 0x86, offset 0x42c\n\t{value: 0x0028, lo: 0x03},\n\t{value: 0x7c21, lo: 0x80, hi: 0x82},\n\t{value: 0x7be1, lo: 0x83, hi: 0x83},\n\t{value: 0x7c99, lo: 0x84, hi: 0xbf},\n\t// Block 0x87, offset 0x430\n\t{value: 0x0038, lo: 0x0f},\n\t{value: 0x9db1, lo: 0x80, hi: 0x83},\n\t{value: 0x9e59, lo: 0x84, hi: 0x85},\n\t{value: 0x9e91, lo: 0x86, hi: 0x87},\n\t{value: 0x9ec9, lo: 0x88, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x91},\n\t{value: 0xa089, lo: 0x92, hi: 0x97},\n\t{value: 0xa1a1, lo: 0x98, hi: 0x9c},\n\t{value: 0xa281, lo: 0x9d, hi: 0xb3},\n\t{value: 0x9d41, lo: 0xb4, hi: 0xb4},\n\t{value: 0x9db1, lo: 0xb5, hi: 0xb5},\n\t{value: 0xa789, lo: 0xb6, hi: 0xbb},\n\t{value: 0xa869, lo: 0xbc, hi: 0xbc},\n\t{value: 0xa7f9, lo: 0xbd, hi: 0xbd},\n\t{value: 0xa8d9, lo: 0xbe, hi: 0xbf},\n\t// Block 0x88, offset 0x440\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8c},\n\t{value: 0x0008, lo: 0x8d, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbb},\n\t{value: 0x0008, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0x89, offset 0x44a\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0x8a, offset 0x44f\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x8b, offset 0x452\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x82},\n\t{value: 0x0040, lo: 0x83, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0x8c, offset 0x458\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x8e},\n\t{value: 0x0040, lo: 0x8f, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0x8d, offset 0x45f\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0040, lo: 0xbe, hi: 0xbf},\n\t// Block 0x8e, offset 0x464\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9c},\n\t{value: 0x0040, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x8f, offset 0x468\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x90},\n\t{value: 0x0040, lo: 0x91, hi: 0x9f},\n\t{value: 0x3308, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x90, offset 0x46e\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x91, offset 0x473\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x81},\n\t{value: 0x0008, lo: 0x82, hi: 0x89},\n\t{value: 0x0018, lo: 0x8a, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbf},\n\t// Block 0x92, offset 0x47c\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0x93, offset 0x481\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0xbf},\n\t// Block 0x94, offset 0x487\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x97},\n\t{value: 0x8ad5, lo: 0x98, hi: 0x9f},\n\t{value: 0x8aed, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0008, lo: 0xa8, hi: 0xbf},\n\t// Block 0x95, offset 0x48e\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x8aed, lo: 0xb0, hi: 0xb7},\n\t{value: 0x8ad5, lo: 0xb8, hi: 0xbf},\n\t// Block 0x96, offset 0x495\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0xe145, lo: 0x80, hi: 0x87},\n\t{value: 0xe1c5, lo: 0x88, hi: 0x8f},\n\t{value: 0xe145, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0xbb},\n\t{value: 0x0040, lo: 0xbc, hi: 0xbf},\n\t// Block 0x97, offset 0x49c\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0x98, offset 0x4a0\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xae},\n\t{value: 0x0018, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x99, offset 0x4a5\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0x9a, offset 0x4a8\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xbf},\n\t// Block 0x9b, offset 0x4ad\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0808, lo: 0x80, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x87},\n\t{value: 0x0808, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0808, lo: 0x8a, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0808, lo: 0xb7, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbb},\n\t{value: 0x0808, lo: 0xbc, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbe},\n\t{value: 0x0808, lo: 0xbf, hi: 0xbf},\n\t// Block 0x9c, offset 0x4b9\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x96},\n\t{value: 0x0818, lo: 0x97, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb6},\n\t{value: 0x0818, lo: 0xb7, hi: 0xbf},\n\t// Block 0x9d, offset 0x4bf\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xa6},\n\t{value: 0x0818, lo: 0xa7, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0x9e, offset 0x4c4\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0808, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xba},\n\t{value: 0x0818, lo: 0xbb, hi: 0xbf},\n\t// Block 0x9f, offset 0x4cb\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0818, lo: 0x96, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbe},\n\t{value: 0x0818, lo: 0xbf, hi: 0xbf},\n\t// Block 0xa0, offset 0x4d3\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0808, lo: 0x80, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbb},\n\t{value: 0x0818, lo: 0xbc, hi: 0xbd},\n\t{value: 0x0808, lo: 0xbe, hi: 0xbf},\n\t// Block 0xa1, offset 0x4d8\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0818, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x0818, lo: 0x92, hi: 0xbf},\n\t// Block 0xa2, offset 0x4dc\n\t{value: 0x0000, lo: 0x0f},\n\t{value: 0x0808, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x84},\n\t{value: 0x3308, lo: 0x85, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x8b},\n\t{value: 0x3308, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x94},\n\t{value: 0x0808, lo: 0x95, hi: 0x97},\n\t{value: 0x0040, lo: 0x98, hi: 0x98},\n\t{value: 0x0808, lo: 0x99, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xba},\n\t{value: 0x0040, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xa3, offset 0x4ec\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0818, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0818, lo: 0x90, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xbc},\n\t{value: 0x0818, lo: 0xbd, hi: 0xbf},\n\t// Block 0xa4, offset 0x4f3\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0x9c},\n\t{value: 0x0818, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xa5, offset 0x4f7\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb8},\n\t{value: 0x0018, lo: 0xb9, hi: 0xbf},\n\t// Block 0xa6, offset 0x4fb\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0808, lo: 0x80, hi: 0x95},\n\t{value: 0x0040, lo: 0x96, hi: 0x97},\n\t{value: 0x0818, lo: 0x98, hi: 0x9f},\n\t{value: 0x0808, lo: 0xa0, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb7},\n\t{value: 0x0818, lo: 0xb8, hi: 0xbf},\n\t// Block 0xa7, offset 0x502\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0808, lo: 0x80, hi: 0xbf},\n\t// Block 0xa8, offset 0x504\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0808, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0xbf},\n\t// Block 0xa9, offset 0x507\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x03dd, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xaa, offset 0x50a\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0808, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xb9},\n\t{value: 0x0818, lo: 0xba, hi: 0xbf},\n\t// Block 0xab, offset 0x50e\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0818, lo: 0xa0, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xac, offset 0x512\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3008, lo: 0x80, hi: 0x80},\n\t{value: 0x3308, lo: 0x81, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xad, offset 0x518\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x85},\n\t{value: 0x3b08, lo: 0x86, hi: 0x86},\n\t{value: 0x0018, lo: 0x87, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x91},\n\t{value: 0x0018, lo: 0x92, hi: 0xa5},\n\t{value: 0x0008, lo: 0xa6, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xae, offset 0x521\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb6},\n\t{value: 0x3008, lo: 0xb7, hi: 0xb8},\n\t{value: 0x3b08, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x0018, lo: 0xbb, hi: 0xbc},\n\t{value: 0x0340, lo: 0xbd, hi: 0xbd},\n\t{value: 0x0018, lo: 0xbe, hi: 0xbf},\n\t// Block 0xaf, offset 0x52d\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xb0, offset 0x534\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xb2},\n\t{value: 0x3b08, lo: 0xb3, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xbf},\n\t// Block 0xb1, offset 0x53d\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb3},\n\t{value: 0x0018, lo: 0xb4, hi: 0xb5},\n\t{value: 0x0008, lo: 0xb6, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xb2, offset 0x545\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x3308, lo: 0x80, hi: 0x81},\n\t{value: 0x3008, lo: 0x82, hi: 0x82},\n\t{value: 0x0008, lo: 0x83, hi: 0xb2},\n\t{value: 0x3008, lo: 0xb3, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xbe},\n\t{value: 0x3008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb3, offset 0x54c\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3808, lo: 0x80, hi: 0x80},\n\t{value: 0x0008, lo: 0x81, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x89},\n\t{value: 0x3308, lo: 0x8a, hi: 0x8c},\n\t{value: 0x0018, lo: 0x8d, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0008, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0018, lo: 0xa1, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xb4, offset 0x55a\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xae},\n\t{value: 0x3308, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3008, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3308, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3808, lo: 0xb5, hi: 0xb5},\n\t{value: 0x3308, lo: 0xb6, hi: 0xb7},\n\t{value: 0x0018, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3308, lo: 0xbe, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xb5, offset 0x567\n\t{value: 0x0000, lo: 0x0c},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x0008, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0x8d},\n\t{value: 0x0040, lo: 0x8e, hi: 0x8e},\n\t{value: 0x0008, lo: 0x8f, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9e},\n\t{value: 0x0008, lo: 0x9f, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbf},\n\t// Block 0xb6, offset 0x574\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x3308, lo: 0x9f, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa9},\n\t{value: 0x3b08, lo: 0xaa, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0040, lo: 0xba, hi: 0xbf},\n\t// Block 0xb7, offset 0x57d\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x3008, lo: 0xb5, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbf},\n\t// Block 0xb8, offset 0x581\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0x3008, lo: 0x80, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x84},\n\t{value: 0x3008, lo: 0x85, hi: 0x85},\n\t{value: 0x3308, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x8a},\n\t{value: 0x0018, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0x9b},\n\t{value: 0x0040, lo: 0x9c, hi: 0x9c},\n\t{value: 0x0018, lo: 0x9d, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0xb9, offset 0x58f\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xb8},\n\t{value: 0x3008, lo: 0xb9, hi: 0xb9},\n\t{value: 0x3308, lo: 0xba, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbe},\n\t{value: 0x3308, lo: 0xbf, hi: 0xbf},\n\t// Block 0xba, offset 0x597\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x3008, lo: 0x81, hi: 0x81},\n\t{value: 0x3b08, lo: 0x82, hi: 0x82},\n\t{value: 0x3308, lo: 0x83, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x85},\n\t{value: 0x0018, lo: 0x86, hi: 0x86},\n\t{value: 0x0008, lo: 0x87, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xbb, offset 0x5a2\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xb7},\n\t{value: 0x3008, lo: 0xb8, hi: 0xbb},\n\t{value: 0x3308, lo: 0xbc, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbc, offset 0x5ab\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x97},\n\t{value: 0x0008, lo: 0x98, hi: 0x9b},\n\t{value: 0x3308, lo: 0x9c, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0xbf},\n\t// Block 0xbd, offset 0x5b1\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3008, lo: 0xb0, hi: 0xb2},\n\t{value: 0x3308, lo: 0xb3, hi: 0xba},\n\t{value: 0x3008, lo: 0xbb, hi: 0xbc},\n\t{value: 0x3308, lo: 0xbd, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xbe, offset 0x5b9\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x3308, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x83},\n\t{value: 0x0008, lo: 0x84, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xbf, offset 0x5c2\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x3308, lo: 0xab, hi: 0xab},\n\t{value: 0x3008, lo: 0xac, hi: 0xac},\n\t{value: 0x3308, lo: 0xad, hi: 0xad},\n\t{value: 0x3008, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb5},\n\t{value: 0x3808, lo: 0xb6, hi: 0xb6},\n\t{value: 0x3308, lo: 0xb7, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbf},\n\t// Block 0xc0, offset 0x5cc\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x89},\n\t{value: 0x0040, lo: 0x8a, hi: 0xbf},\n\t// Block 0xc1, offset 0x5cf\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9f},\n\t{value: 0x3008, lo: 0xa0, hi: 0xa1},\n\t{value: 0x3308, lo: 0xa2, hi: 0xa5},\n\t{value: 0x3008, lo: 0xa6, hi: 0xa6},\n\t{value: 0x3308, lo: 0xa7, hi: 0xaa},\n\t{value: 0x3b08, lo: 0xab, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xb9},\n\t{value: 0x0018, lo: 0xba, hi: 0xbf},\n\t// Block 0xc2, offset 0x5db\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x049d, lo: 0xa0, hi: 0xbf},\n\t// Block 0xc3, offset 0x5de\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbe},\n\t{value: 0x0008, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc4, offset 0x5e3\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb8},\n\t{value: 0x0040, lo: 0xb9, hi: 0xbf},\n\t// Block 0xc5, offset 0x5e6\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x89},\n\t{value: 0x0008, lo: 0x8a, hi: 0xae},\n\t{value: 0x3008, lo: 0xaf, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xb7},\n\t{value: 0x3308, lo: 0xb8, hi: 0xbd},\n\t{value: 0x3008, lo: 0xbe, hi: 0xbe},\n\t{value: 0x3b08, lo: 0xbf, hi: 0xbf},\n\t// Block 0xc6, offset 0x5f0\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0008, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0018, lo: 0x9a, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0008, lo: 0xb2, hi: 0xbf},\n\t// Block 0xc7, offset 0x5f9\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x91},\n\t{value: 0x3308, lo: 0x92, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xa8},\n\t{value: 0x3008, lo: 0xa9, hi: 0xa9},\n\t{value: 0x3308, lo: 0xaa, hi: 0xb0},\n\t{value: 0x3008, lo: 0xb1, hi: 0xb1},\n\t{value: 0x3308, lo: 0xb2, hi: 0xb3},\n\t{value: 0x3008, lo: 0xb4, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xc8, offset 0x605\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0xbf},\n\t// Block 0xc9, offset 0x608\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xca, offset 0x60d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0040, lo: 0x84, hi: 0xbf},\n\t// Block 0xcb, offset 0x610\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xbf},\n\t// Block 0xcc, offset 0x613\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0xbf},\n\t// Block 0xcd, offset 0x616\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0008, lo: 0x80, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa9},\n\t{value: 0x0040, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xce, offset 0x61d\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb4},\n\t{value: 0x0018, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xcf, offset 0x624\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0xaf},\n\t{value: 0x3308, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xbf},\n\t// Block 0xd0, offset 0x628\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x0008, lo: 0x80, hi: 0x83},\n\t{value: 0x0018, lo: 0x84, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9a},\n\t{value: 0x0018, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x0008, lo: 0xa3, hi: 0xb7},\n\t{value: 0x0040, lo: 0xb8, hi: 0xbc},\n\t{value: 0x0008, lo: 0xbd, hi: 0xbf},\n\t// Block 0xd1, offset 0x633\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0xbf},\n\t// Block 0xd2, offset 0x636\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0008, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x90},\n\t{value: 0x3008, lo: 0x91, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xd3, offset 0x63c\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x8e},\n\t{value: 0x3308, lo: 0x8f, hi: 0x92},\n\t{value: 0x0008, lo: 0x93, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xd4, offset 0x641\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xa0},\n\t{value: 0x0040, lo: 0xa1, hi: 0xbf},\n\t// Block 0xd5, offset 0x645\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xd6, offset 0x648\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb2},\n\t{value: 0x0040, lo: 0xb3, hi: 0xbf},\n\t// Block 0xd7, offset 0x64b\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0xbf},\n\t// Block 0xd8, offset 0x64e\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0008, lo: 0x80, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xaf},\n\t{value: 0x0008, lo: 0xb0, hi: 0xbc},\n\t{value: 0x0040, lo: 0xbd, hi: 0xbf},\n\t// Block 0xd9, offset 0x653\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0008, lo: 0x80, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0x0008, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9b},\n\t{value: 0x0018, lo: 0x9c, hi: 0x9c},\n\t{value: 0x3308, lo: 0x9d, hi: 0x9e},\n\t{value: 0x0018, lo: 0x9f, hi: 0x9f},\n\t{value: 0x03c0, lo: 0xa0, hi: 0xa3},\n\t{value: 0x0040, lo: 0xa4, hi: 0xbf},\n\t// Block 0xda, offset 0x65d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xdb, offset 0x660\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xa6},\n\t{value: 0x0040, lo: 0xa7, hi: 0xa8},\n\t{value: 0x0018, lo: 0xa9, hi: 0xbf},\n\t// Block 0xdc, offset 0x664\n\t{value: 0x0000, lo: 0x0e},\n\t{value: 0x0018, lo: 0x80, hi: 0x9d},\n\t{value: 0xb5b9, lo: 0x9e, hi: 0x9e},\n\t{value: 0xb601, lo: 0x9f, hi: 0x9f},\n\t{value: 0xb649, lo: 0xa0, hi: 0xa0},\n\t{value: 0xb6b1, lo: 0xa1, hi: 0xa1},\n\t{value: 0xb719, lo: 0xa2, hi: 0xa2},\n\t{value: 0xb781, lo: 0xa3, hi: 0xa3},\n\t{value: 0xb7e9, lo: 0xa4, hi: 0xa4},\n\t{value: 0x3018, lo: 0xa5, hi: 0xa6},\n\t{value: 0x3318, lo: 0xa7, hi: 0xa9},\n\t{value: 0x0018, lo: 0xaa, hi: 0xac},\n\t{value: 0x3018, lo: 0xad, hi: 0xb2},\n\t{value: 0x0340, lo: 0xb3, hi: 0xba},\n\t{value: 0x3318, lo: 0xbb, hi: 0xbf},\n\t// Block 0xdd, offset 0x673\n\t{value: 0x0000, lo: 0x0b},\n\t{value: 0x3318, lo: 0x80, hi: 0x82},\n\t{value: 0x0018, lo: 0x83, hi: 0x84},\n\t{value: 0x3318, lo: 0x85, hi: 0x8b},\n\t{value: 0x0018, lo: 0x8c, hi: 0xa9},\n\t{value: 0x3318, lo: 0xaa, hi: 0xad},\n\t{value: 0x0018, lo: 0xae, hi: 0xba},\n\t{value: 0xb851, lo: 0xbb, hi: 0xbb},\n\t{value: 0xb899, lo: 0xbc, hi: 0xbc},\n\t{value: 0xb8e1, lo: 0xbd, hi: 0xbd},\n\t{value: 0xb949, lo: 0xbe, hi: 0xbe},\n\t{value: 0xb9b1, lo: 0xbf, hi: 0xbf},\n\t// Block 0xde, offset 0x67f\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0xba19, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0xa8},\n\t{value: 0x0040, lo: 0xa9, hi: 0xbf},\n\t// Block 0xdf, offset 0x683\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x81},\n\t{value: 0x3318, lo: 0x82, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x85},\n\t{value: 0x0040, lo: 0x86, hi: 0xbf},\n\t// Block 0xe0, offset 0x688\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xe1, offset 0x68d\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x3308, lo: 0x80, hi: 0xb6},\n\t{value: 0x0018, lo: 0xb7, hi: 0xba},\n\t{value: 0x3308, lo: 0xbb, hi: 0xbf},\n\t// Block 0xe2, offset 0x691\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x3308, lo: 0x80, hi: 0xac},\n\t{value: 0x0018, lo: 0xad, hi: 0xb4},\n\t{value: 0x3308, lo: 0xb5, hi: 0xb5},\n\t{value: 0x0018, lo: 0xb6, hi: 0xbf},\n\t// Block 0xe3, offset 0x696\n\t{value: 0x0000, lo: 0x08},\n\t{value: 0x0018, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x84},\n\t{value: 0x0018, lo: 0x85, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xa0},\n\t{value: 0x3308, lo: 0xa1, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n\t// Block 0xe4, offset 0x69f\n\t{value: 0x0000, lo: 0x0a},\n\t{value: 0x3308, lo: 0x80, hi: 0x86},\n\t{value: 0x0040, lo: 0x87, hi: 0x87},\n\t{value: 0x3308, lo: 0x88, hi: 0x98},\n\t{value: 0x0040, lo: 0x99, hi: 0x9a},\n\t{value: 0x3308, lo: 0x9b, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xa2},\n\t{value: 0x3308, lo: 0xa3, hi: 0xa4},\n\t{value: 0x0040, lo: 0xa5, hi: 0xa5},\n\t{value: 0x3308, lo: 0xa6, hi: 0xaa},\n\t{value: 0x0040, lo: 0xab, hi: 0xbf},\n\t// Block 0xe5, offset 0x6aa\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0808, lo: 0x80, hi: 0x84},\n\t{value: 0x0040, lo: 0x85, hi: 0x86},\n\t{value: 0x0818, lo: 0x87, hi: 0x8f},\n\t{value: 0x3308, lo: 0x90, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0xe6, offset 0x6b0\n\t{value: 0x0000, lo: 0x07},\n\t{value: 0x0a08, lo: 0x80, hi: 0x83},\n\t{value: 0x3308, lo: 0x84, hi: 0x8a},\n\t{value: 0x0040, lo: 0x8b, hi: 0x8f},\n\t{value: 0x0808, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9d},\n\t{value: 0x0818, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0040, lo: 0xa0, hi: 0xbf},\n\t// Block 0xe7, offset 0x6b8\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0040, lo: 0x80, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb1},\n\t{value: 0x0040, lo: 0xb2, hi: 0xbf},\n\t// Block 0xe8, offset 0x6bc\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0xab},\n\t{value: 0x0040, lo: 0xac, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xbf},\n\t// Block 0xe9, offset 0x6c0\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x93},\n\t{value: 0x0040, lo: 0x94, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xae},\n\t{value: 0x0040, lo: 0xaf, hi: 0xb0},\n\t{value: 0x0018, lo: 0xb1, hi: 0xbf},\n\t// Block 0xea, offset 0x6c6\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0018, lo: 0x81, hi: 0x8f},\n\t{value: 0x0040, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xb5},\n\t{value: 0x0040, lo: 0xb6, hi: 0xbf},\n\t// Block 0xeb, offset 0x6cc\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8f},\n\t{value: 0xc1c1, lo: 0x90, hi: 0x90},\n\t{value: 0x0018, lo: 0x91, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xbf},\n\t// Block 0xec, offset 0x6d1\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0040, lo: 0x80, hi: 0xa5},\n\t{value: 0x0018, lo: 0xa6, hi: 0xbf},\n\t// Block 0xed, offset 0x6d4\n\t{value: 0x0000, lo: 0x0d},\n\t{value: 0xc7e9, lo: 0x80, hi: 0x80},\n\t{value: 0xc839, lo: 0x81, hi: 0x81},\n\t{value: 0xc889, lo: 0x82, hi: 0x82},\n\t{value: 0xc8d9, lo: 0x83, hi: 0x83},\n\t{value: 0xc929, lo: 0x84, hi: 0x84},\n\t{value: 0xc979, lo: 0x85, hi: 0x85},\n\t{value: 0xc9c9, lo: 0x86, hi: 0x86},\n\t{value: 0xca19, lo: 0x87, hi: 0x87},\n\t{value: 0xca69, lo: 0x88, hi: 0x88},\n\t{value: 0x0040, lo: 0x89, hi: 0x8f},\n\t{value: 0xcab9, lo: 0x90, hi: 0x90},\n\t{value: 0xcad9, lo: 0x91, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0xbf},\n\t// Block 0xee, offset 0x6e2\n\t{value: 0x0000, lo: 0x06},\n\t{value: 0x0018, lo: 0x80, hi: 0x92},\n\t{value: 0x0040, lo: 0x93, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xac},\n\t{value: 0x0040, lo: 0xad, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb6},\n\t{value: 0x0040, lo: 0xb7, hi: 0xbf},\n\t// Block 0xef, offset 0x6e9\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0xb3},\n\t{value: 0x0040, lo: 0xb4, hi: 0xbf},\n\t// Block 0xf0, offset 0x6ec\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x94},\n\t{value: 0x0040, lo: 0x95, hi: 0xbf},\n\t// Block 0xf1, offset 0x6ef\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xbf},\n\t// Block 0xf2, offset 0x6f3\n\t{value: 0x0000, lo: 0x05},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x99},\n\t{value: 0x0040, lo: 0x9a, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xbf},\n\t// Block 0xf3, offset 0x6f9\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x87},\n\t{value: 0x0040, lo: 0x88, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0xad},\n\t{value: 0x0040, lo: 0xae, hi: 0xbf},\n\t// Block 0xf4, offset 0x6fe\n\t{value: 0x0000, lo: 0x09},\n\t{value: 0x0040, lo: 0x80, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0x9f},\n\t{value: 0x0018, lo: 0xa0, hi: 0xa7},\n\t{value: 0x0040, lo: 0xa8, hi: 0xaf},\n\t{value: 0x0018, lo: 0xb0, hi: 0xb0},\n\t{value: 0x0040, lo: 0xb1, hi: 0xb2},\n\t{value: 0x0018, lo: 0xb3, hi: 0xbe},\n\t{value: 0x0040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xf5, offset 0x708\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0018, lo: 0x80, hi: 0x8b},\n\t{value: 0x0040, lo: 0x8c, hi: 0x8f},\n\t{value: 0x0018, lo: 0x90, hi: 0x9e},\n\t{value: 0x0040, lo: 0x9f, hi: 0xbf},\n\t// Block 0xf6, offset 0x70d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x91},\n\t{value: 0x0040, lo: 0x92, hi: 0xbf},\n\t// Block 0xf7, offset 0x710\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0018, lo: 0x80, hi: 0x80},\n\t{value: 0x0040, lo: 0x81, hi: 0xbf},\n\t// Block 0xf8, offset 0x713\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0x96},\n\t{value: 0x0040, lo: 0x97, hi: 0xbf},\n\t// Block 0xf9, offset 0x716\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xb4},\n\t{value: 0x0040, lo: 0xb5, hi: 0xbf},\n\t// Block 0xfa, offset 0x719\n\t{value: 0x0000, lo: 0x03},\n\t{value: 0x0008, lo: 0x80, hi: 0x9d},\n\t{value: 0x0040, lo: 0x9e, hi: 0x9f},\n\t{value: 0x0008, lo: 0xa0, hi: 0xbf},\n\t// Block 0xfb, offset 0x71d\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x0008, lo: 0x80, hi: 0xa1},\n\t{value: 0x0040, lo: 0xa2, hi: 0xbf},\n\t// Block 0xfc, offset 0x720\n\t{value: 0x0020, lo: 0x0f},\n\t{value: 0xdeb9, lo: 0x80, hi: 0x89},\n\t{value: 0x8dfd, lo: 0x8a, hi: 0x8a},\n\t{value: 0xdff9, lo: 0x8b, hi: 0x9c},\n\t{value: 0x8e1d, lo: 0x9d, hi: 0x9d},\n\t{value: 0xe239, lo: 0x9e, hi: 0xa2},\n\t{value: 0x8e3d, lo: 0xa3, hi: 0xa3},\n\t{value: 0xe2d9, lo: 0xa4, hi: 0xab},\n\t{value: 0x7ed5, lo: 0xac, hi: 0xac},\n\t{value: 0xe3d9, lo: 0xad, hi: 0xaf},\n\t{value: 0x8e5d, lo: 0xb0, hi: 0xb0},\n\t{value: 0xe439, lo: 0xb1, hi: 0xb6},\n\t{value: 0x8e7d, lo: 0xb7, hi: 0xb9},\n\t{value: 0xe4f9, lo: 0xba, hi: 0xba},\n\t{value: 0x8edd, lo: 0xbb, hi: 0xbb},\n\t{value: 0xe519, lo: 0xbc, hi: 0xbf},\n\t// Block 0xfd, offset 0x730\n\t{value: 0x0020, lo: 0x10},\n\t{value: 0x937d, lo: 0x80, hi: 0x80},\n\t{value: 0xf099, lo: 0x81, hi: 0x86},\n\t{value: 0x939d, lo: 0x87, hi: 0x8a},\n\t{value: 0xd9f9, lo: 0x8b, hi: 0x8b},\n\t{value: 0xf159, lo: 0x8c, hi: 0x96},\n\t{value: 0x941d, lo: 0x97, hi: 0x97},\n\t{value: 0xf2b9, lo: 0x98, hi: 0xa3},\n\t{value: 0x943d, lo: 0xa4, hi: 0xa6},\n\t{value: 0xf439, lo: 0xa7, hi: 0xaa},\n\t{value: 0x949d, lo: 0xab, hi: 0xab},\n\t{value: 0xf4b9, lo: 0xac, hi: 0xac},\n\t{value: 0x94bd, lo: 0xad, hi: 0xad},\n\t{value: 0xf4d9, lo: 0xae, hi: 0xaf},\n\t{value: 0x94dd, lo: 0xb0, hi: 0xb1},\n\t{value: 0xf519, lo: 0xb2, hi: 0xbe},\n\t{value: 0x2040, lo: 0xbf, hi: 0xbf},\n\t// Block 0xfe, offset 0x741\n\t{value: 0x0000, lo: 0x04},\n\t{value: 0x0040, lo: 0x80, hi: 0x80},\n\t{value: 0x0340, lo: 0x81, hi: 0x81},\n\t{value: 0x0040, lo: 0x82, hi: 0x9f},\n\t{value: 0x0340, lo: 0xa0, hi: 0xbf},\n\t// Block 0xff, offset 0x746\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x0340, lo: 0x80, hi: 0xbf},\n\t// Block 0x100, offset 0x748\n\t{value: 0x0000, lo: 0x01},\n\t{value: 0x33c0, lo: 0x80, hi: 0xbf},\n\t// Block 0x101, offset 0x74a\n\t{value: 0x0000, lo: 0x02},\n\t{value: 0x33c0, lo: 0x80, hi: 0xaf},\n\t{value: 0x0040, lo: 0xb0, hi: 0xbf},\n}\n\n// Total table size 41662 bytes (40KiB); checksum: 355A58A4\n" }, { "path": "vendor/golang.org/x/net/idna/trie.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\n// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage idna\n\n// appendMapping appends the mapping for the respective rune. isMapped must be\n// true. A mapping is a categorization of a rune as defined in UTS #46.\nfunc (c info) appendMapping(b []byte, s string) []byte {\n\tindex := int(c >> indexShift)\n\tif c&xorBit == 0 {\n\t\ts := mappings[index:]\n\t\treturn append(b, s[1:s[0]+1]...)\n\t}\n\tb = append(b, s...)\n\tif c&inlineXOR == inlineXOR {\n\t\t// TODO: support and handle two-byte inline masks\n\t\tb[len(b)-1] ^= byte(index)\n\t} else {\n\t\tfor p := len(b) - int(xorData[index]); p < len(b); p++ {\n\t\t\tindex++\n\t\t\tb[p] ^= xorData[index]\n\t\t}\n\t}\n\treturn b\n}\n\n// Sparse block handling code.\n\ntype valueRange struct {\n\tvalue uint16 // header: value:stride\n\tlo, hi byte // header: lo:n\n}\n\ntype sparseBlocks struct {\n\tvalues []valueRange\n\toffset []uint16\n}\n\nvar idnaSparse = sparseBlocks{\n\tvalues: idnaSparseValues[:],\n\toffset: idnaSparseOffset[:],\n}\n\n// Don't use newIdnaTrie to avoid unconditional linking in of the table.\nvar trie = &idnaTrie{}\n\n// lookup determines the type of block n and looks up the value for b.\n// For n < t.cutoff, the block is a simple lookup table. Otherwise, the block\n// is a list of ranges with an accompanying value. Given a matching range r,\n// the value for b is by r.value + (b - r.lo) * stride.\nfunc (t *sparseBlocks) lookup(n uint32, b byte) uint16 {\n\toffset := t.offset[n]\n\theader := t.values[offset]\n\tlo := offset + 1\n\thi := lo + uint16(header.lo)\n\tfor lo < hi {\n\t\tm := lo + (hi-lo)/2\n\t\tr := t.values[m]\n\t\tif r.lo <= b && b <= r.hi {\n\t\t\treturn r.value + uint16(b-r.lo)*header.value\n\t\t}\n\t\tif b < r.lo {\n\t\t\thi = m\n\t\t} else {\n\t\t\tlo = m + 1\n\t\t}\n\t}\n\treturn 0\n}\n" }, { "path": "vendor/golang.org/x/net/idna/trieval.go", "content": "// Code generated by running \"go generate\" in golang.org/x/text. DO NOT EDIT.\n\npackage idna\n\n// This file contains definitions for interpreting the trie value of the idna\n// trie generated by \"go run gen*.go\". It is shared by both the generator\n// program and the resultant package. Sharing is achieved by the generator\n// copying gen_trieval.go to trieval.go and changing what's above this comment.\n\n// info holds information from the IDNA mapping table for a single rune. It is\n// the value returned by a trie lookup. In most cases, all information fits in\n// a 16-bit value. For mappings, this value may contain an index into a slice\n// with the mapped string. Such mappings can consist of the actual mapped value\n// or an XOR pattern to be applied to the bytes of the UTF8 encoding of the\n// input rune. This technique is used by the cases packages and reduces the\n// table size significantly.\n//\n// The per-rune values have the following format:\n//\n// if mapped {\n// if inlinedXOR {\n// 15..13 inline XOR marker\n// 12..11 unused\n// 10..3 inline XOR mask\n// } else {\n// 15..3 index into xor or mapping table\n// }\n// } else {\n// 15..14 unused\n// 13 mayNeedNorm\n// 12..11 attributes\n// 10..8 joining type\n// 7..3 category type\n// }\n// 2 use xor pattern\n// 1..0 mapped category\n//\n// See the definitions below for a more detailed description of the various\n// bits.\ntype info uint16\n\nconst (\n\tcatSmallMask = 0x3\n\tcatBigMask = 0xF8\n\tindexShift = 3\n\txorBit = 0x4 // interpret the index as an xor pattern\n\tinlineXOR = 0xE000 // These bits are set if the XOR pattern is inlined.\n\n\tjoinShift = 8\n\tjoinMask = 0x07\n\n\t// Attributes\n\tattributesMask = 0x1800\n\tviramaModifier = 0x1800\n\tmodifier = 0x1000\n\trtl = 0x0800\n\n\tmayNeedNorm = 0x2000\n)\n\n// A category corresponds to a category defined in the IDNA mapping table.\ntype category uint16\n\nconst (\n\tunknown category = 0 // not currently defined in unicode.\n\tmapped category = 1\n\tdisallowedSTD3Mapped category = 2\n\tdeviation category = 3\n)\n\nconst (\n\tvalid category = 0x08\n\tvalidNV8 category = 0x18\n\tvalidXV8 category = 0x28\n\tdisallowed category = 0x40\n\tdisallowedSTD3Valid category = 0x80\n\tignored category = 0xC0\n)\n\n// join types and additional rune information\nconst (\n\tjoiningL = (iota + 1)\n\tjoiningD\n\tjoiningT\n\tjoiningR\n\n\t//the following types are derived during processing\n\tjoinZWJ\n\tjoinZWNJ\n\tjoinVirama\n\tnumJoinTypes\n)\n\nfunc (c info) isMapped() bool {\n\treturn c&0x3 != 0\n}\n\nfunc (c info) category() category {\n\tsmall := c & catSmallMask\n\tif small != 0 {\n\t\treturn category(small)\n\t}\n\treturn category(c & catBigMask)\n}\n\nfunc (c info) joinType() info {\n\tif c.isMapped() {\n\t\treturn 0\n\t}\n\treturn (c >> joinShift) & joinMask\n}\n\nfunc (c info) isModifier() bool {\n\treturn c&(modifier|catSmallMask) == modifier\n}\n\nfunc (c info) isViramaModifier() bool {\n\treturn c&(attributesMask|catSmallMask) == viramaModifier\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/file.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage webdav\n\nimport (\n\t\"context\"\n\t\"encoding/xml\"\n\t\"io\"\n\t\"net/http\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n)\n\n// slashClean is equivalent to but slightly more efficient than\n// path.Clean(\"/\" + name).\nfunc slashClean(name string) string {\n\tif name == \"\" || name[0] != '/' {\n\t\tname = \"/\" + name\n\t}\n\treturn path.Clean(name)\n}\n\n// A FileSystem implements access to a collection of named files. The elements\n// in a file path are separated by slash ('/', U+002F) characters, regardless\n// of host operating system convention.\n//\n// Each method has the same semantics as the os package's function of the same\n// name.\n//\n// Note that the os.Rename documentation says that \"OS-specific restrictions\n// might apply\". In particular, whether or not renaming a file or directory\n// overwriting another existing file or directory is an error is OS-dependent.\ntype FileSystem interface {\n\tMkdir(ctx context.Context, name string, perm os.FileMode) error\n\tOpenFile(ctx context.Context, name string, flag int, perm os.FileMode) (File, error)\n\tRemoveAll(ctx context.Context, name string) error\n\tRename(ctx context.Context, oldName, newName string) error\n\tStat(ctx context.Context, name string) (os.FileInfo, error)\n}\n\n// A File is returned by a FileSystem's OpenFile method and can be served by a\n// Handler.\n//\n// A File may optionally implement the DeadPropsHolder interface, if it can\n// load and save dead properties.\ntype File interface {\n\thttp.File\n\tio.Writer\n}\n\n// A Dir implements FileSystem using the native file system restricted to a\n// specific directory tree.\n//\n// While the FileSystem.OpenFile method takes '/'-separated paths, a Dir's\n// string value is a filename on the native file system, not a URL, so it is\n// separated by filepath.Separator, which isn't necessarily '/'.\n//\n// An empty Dir is treated as \".\".\ntype Dir string\n\nfunc (d Dir) resolve(name string) string {\n\t// This implementation is based on Dir.Open's code in the standard net/http package.\n\tif filepath.Separator != '/' && strings.IndexRune(name, filepath.Separator) >= 0 ||\n\t\tstrings.Contains(name, \"\\x00\") {\n\t\treturn \"\"\n\t}\n\tdir := string(d)\n\tif dir == \"\" {\n\t\tdir = \".\"\n\t}\n\treturn filepath.Join(dir, filepath.FromSlash(slashClean(name)))\n}\n\nfunc (d Dir) Mkdir(ctx context.Context, name string, perm os.FileMode) error {\n\tif name = d.resolve(name); name == \"\" {\n\t\treturn os.ErrNotExist\n\t}\n\treturn os.Mkdir(name, perm)\n}\n\nfunc (d Dir) OpenFile(ctx context.Context, name string, flag int, perm os.FileMode) (File, error) {\n\tif name = d.resolve(name); name == \"\" {\n\t\treturn nil, os.ErrNotExist\n\t}\n\tf, err := os.OpenFile(name, flag, perm)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn f, nil\n}\n\nfunc (d Dir) RemoveAll(ctx context.Context, name string) error {\n\tif name = d.resolve(name); name == \"\" {\n\t\treturn os.ErrNotExist\n\t}\n\tif name == filepath.Clean(string(d)) {\n\t\t// Prohibit removing the virtual root directory.\n\t\treturn os.ErrInvalid\n\t}\n\treturn os.RemoveAll(name)\n}\n\nfunc (d Dir) Rename(ctx context.Context, oldName, newName string) error {\n\tif oldName = d.resolve(oldName); oldName == \"\" {\n\t\treturn os.ErrNotExist\n\t}\n\tif newName = d.resolve(newName); newName == \"\" {\n\t\treturn os.ErrNotExist\n\t}\n\tif root := filepath.Clean(string(d)); root == oldName || root == newName {\n\t\t// Prohibit renaming from or to the virtual root directory.\n\t\treturn os.ErrInvalid\n\t}\n\treturn os.Rename(oldName, newName)\n}\n\nfunc (d Dir) Stat(ctx context.Context, name string) (os.FileInfo, error) {\n\tif name = d.resolve(name); name == \"\" {\n\t\treturn nil, os.ErrNotExist\n\t}\n\treturn os.Stat(name)\n}\n\n// NewMemFS returns a new in-memory FileSystem implementation.\nfunc NewMemFS() FileSystem {\n\treturn &memFS{\n\t\troot: memFSNode{\n\t\t\tchildren: make(map[string]*memFSNode),\n\t\t\tmode: 0660 | os.ModeDir,\n\t\t\tmodTime: time.Now(),\n\t\t},\n\t}\n}\n\n// A memFS implements FileSystem, storing all metadata and actual file data\n// in-memory. No limits on filesystem size are used, so it is not recommended\n// this be used where the clients are untrusted.\n//\n// Concurrent access is permitted. The tree structure is protected by a mutex,\n// and each node's contents and metadata are protected by a per-node mutex.\n//\n// TODO: Enforce file permissions.\ntype memFS struct {\n\tmu sync.Mutex\n\troot memFSNode\n}\n\n// TODO: clean up and rationalize the walk/find code.\n\n// walk walks the directory tree for the fullname, calling f at each step. If f\n// returns an error, the walk will be aborted and return that same error.\n//\n// dir is the directory at that step, frag is the name fragment, and final is\n// whether it is the final step. For example, walking \"/foo/bar/x\" will result\n// in 3 calls to f:\n// - \"/\", \"foo\", false\n// - \"/foo/\", \"bar\", false\n// - \"/foo/bar/\", \"x\", true\n// The frag argument will be empty only if dir is the root node and the walk\n// ends at that root node.\nfunc (fs *memFS) walk(op, fullname string, f func(dir *memFSNode, frag string, final bool) error) error {\n\toriginal := fullname\n\tfullname = slashClean(fullname)\n\n\t// Strip any leading \"/\"s to make fullname a relative path, as the walk\n\t// starts at fs.root.\n\tif fullname[0] == '/' {\n\t\tfullname = fullname[1:]\n\t}\n\tdir := &fs.root\n\n\tfor {\n\t\tfrag, remaining := fullname, \"\"\n\t\ti := strings.IndexRune(fullname, '/')\n\t\tfinal := i < 0\n\t\tif !final {\n\t\t\tfrag, remaining = fullname[:i], fullname[i+1:]\n\t\t}\n\t\tif frag == \"\" && dir != &fs.root {\n\t\t\tpanic(\"webdav: empty path fragment for a clean path\")\n\t\t}\n\t\tif err := f(dir, frag, final); err != nil {\n\t\t\treturn &os.PathError{\n\t\t\t\tOp: op,\n\t\t\t\tPath: original,\n\t\t\t\tErr: err,\n\t\t\t}\n\t\t}\n\t\tif final {\n\t\t\tbreak\n\t\t}\n\t\tchild := dir.children[frag]\n\t\tif child == nil {\n\t\t\treturn &os.PathError{\n\t\t\t\tOp: op,\n\t\t\t\tPath: original,\n\t\t\t\tErr: os.ErrNotExist,\n\t\t\t}\n\t\t}\n\t\tif !child.mode.IsDir() {\n\t\t\treturn &os.PathError{\n\t\t\t\tOp: op,\n\t\t\t\tPath: original,\n\t\t\t\tErr: os.ErrInvalid,\n\t\t\t}\n\t\t}\n\t\tdir, fullname = child, remaining\n\t}\n\treturn nil\n}\n\n// find returns the parent of the named node and the relative name fragment\n// from the parent to the child. For example, if finding \"/foo/bar/baz\" then\n// parent will be the node for \"/foo/bar\" and frag will be \"baz\".\n//\n// If the fullname names the root node, then parent, frag and err will be zero.\n//\n// find returns an error if the parent does not already exist or the parent\n// isn't a directory, but it will not return an error per se if the child does\n// not already exist. The error returned is either nil or an *os.PathError\n// whose Op is op.\nfunc (fs *memFS) find(op, fullname string) (parent *memFSNode, frag string, err error) {\n\terr = fs.walk(op, fullname, func(parent0 *memFSNode, frag0 string, final bool) error {\n\t\tif !final {\n\t\t\treturn nil\n\t\t}\n\t\tif frag0 != \"\" {\n\t\t\tparent, frag = parent0, frag0\n\t\t}\n\t\treturn nil\n\t})\n\treturn parent, frag, err\n}\n\nfunc (fs *memFS) Mkdir(ctx context.Context, name string, perm os.FileMode) error {\n\tfs.mu.Lock()\n\tdefer fs.mu.Unlock()\n\n\tdir, frag, err := fs.find(\"mkdir\", name)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif dir == nil {\n\t\t// We can't create the root.\n\t\treturn os.ErrInvalid\n\t}\n\tif _, ok := dir.children[frag]; ok {\n\t\treturn os.ErrExist\n\t}\n\tdir.children[frag] = &memFSNode{\n\t\tchildren: make(map[string]*memFSNode),\n\t\tmode: perm.Perm() | os.ModeDir,\n\t\tmodTime: time.Now(),\n\t}\n\treturn nil\n}\n\nfunc (fs *memFS) OpenFile(ctx context.Context, name string, flag int, perm os.FileMode) (File, error) {\n\tfs.mu.Lock()\n\tdefer fs.mu.Unlock()\n\n\tdir, frag, err := fs.find(\"open\", name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tvar n *memFSNode\n\tif dir == nil {\n\t\t// We're opening the root.\n\t\tif flag&(os.O_WRONLY|os.O_RDWR) != 0 {\n\t\t\treturn nil, os.ErrPermission\n\t\t}\n\t\tn, frag = &fs.root, \"/\"\n\n\t} else {\n\t\tn = dir.children[frag]\n\t\tif flag&(os.O_SYNC|os.O_APPEND) != 0 {\n\t\t\t// memFile doesn't support these flags yet.\n\t\t\treturn nil, os.ErrInvalid\n\t\t}\n\t\tif flag&os.O_CREATE != 0 {\n\t\t\tif flag&os.O_EXCL != 0 && n != nil {\n\t\t\t\treturn nil, os.ErrExist\n\t\t\t}\n\t\t\tif n == nil {\n\t\t\t\tn = &memFSNode{\n\t\t\t\t\tmode: perm.Perm(),\n\t\t\t\t}\n\t\t\t\tdir.children[frag] = n\n\t\t\t}\n\t\t}\n\t\tif n == nil {\n\t\t\treturn nil, os.ErrNotExist\n\t\t}\n\t\tif flag&(os.O_WRONLY|os.O_RDWR) != 0 && flag&os.O_TRUNC != 0 {\n\t\t\tn.mu.Lock()\n\t\t\tn.data = nil\n\t\t\tn.mu.Unlock()\n\t\t}\n\t}\n\n\tchildren := make([]os.FileInfo, 0, len(n.children))\n\tfor cName, c := range n.children {\n\t\tchildren = append(children, c.stat(cName))\n\t}\n\treturn &memFile{\n\t\tn: n,\n\t\tnameSnapshot: frag,\n\t\tchildrenSnapshot: children,\n\t}, nil\n}\n\nfunc (fs *memFS) RemoveAll(ctx context.Context, name string) error {\n\tfs.mu.Lock()\n\tdefer fs.mu.Unlock()\n\n\tdir, frag, err := fs.find(\"remove\", name)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif dir == nil {\n\t\t// We can't remove the root.\n\t\treturn os.ErrInvalid\n\t}\n\tdelete(dir.children, frag)\n\treturn nil\n}\n\nfunc (fs *memFS) Rename(ctx context.Context, oldName, newName string) error {\n\tfs.mu.Lock()\n\tdefer fs.mu.Unlock()\n\n\toldName = slashClean(oldName)\n\tnewName = slashClean(newName)\n\tif oldName == newName {\n\t\treturn nil\n\t}\n\tif strings.HasPrefix(newName, oldName+\"/\") {\n\t\t// We can't rename oldName to be a sub-directory of itself.\n\t\treturn os.ErrInvalid\n\t}\n\n\toDir, oFrag, err := fs.find(\"rename\", oldName)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif oDir == nil {\n\t\t// We can't rename from the root.\n\t\treturn os.ErrInvalid\n\t}\n\n\tnDir, nFrag, err := fs.find(\"rename\", newName)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif nDir == nil {\n\t\t// We can't rename to the root.\n\t\treturn os.ErrInvalid\n\t}\n\n\toNode, ok := oDir.children[oFrag]\n\tif !ok {\n\t\treturn os.ErrNotExist\n\t}\n\tif oNode.children != nil {\n\t\tif nNode, ok := nDir.children[nFrag]; ok {\n\t\t\tif nNode.children == nil {\n\t\t\t\treturn errNotADirectory\n\t\t\t}\n\t\t\tif len(nNode.children) != 0 {\n\t\t\t\treturn errDirectoryNotEmpty\n\t\t\t}\n\t\t}\n\t}\n\tdelete(oDir.children, oFrag)\n\tnDir.children[nFrag] = oNode\n\treturn nil\n}\n\nfunc (fs *memFS) Stat(ctx context.Context, name string) (os.FileInfo, error) {\n\tfs.mu.Lock()\n\tdefer fs.mu.Unlock()\n\n\tdir, frag, err := fs.find(\"stat\", name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif dir == nil {\n\t\t// We're stat'ting the root.\n\t\treturn fs.root.stat(\"/\"), nil\n\t}\n\tif n, ok := dir.children[frag]; ok {\n\t\treturn n.stat(path.Base(name)), nil\n\t}\n\treturn nil, os.ErrNotExist\n}\n\n// A memFSNode represents a single entry in the in-memory filesystem and also\n// implements os.FileInfo.\ntype memFSNode struct {\n\t// children is protected by memFS.mu.\n\tchildren map[string]*memFSNode\n\n\tmu sync.Mutex\n\tdata []byte\n\tmode os.FileMode\n\tmodTime time.Time\n\tdeadProps map[xml.Name]Property\n}\n\nfunc (n *memFSNode) stat(name string) *memFileInfo {\n\tn.mu.Lock()\n\tdefer n.mu.Unlock()\n\treturn &memFileInfo{\n\t\tname: name,\n\t\tsize: int64(len(n.data)),\n\t\tmode: n.mode,\n\t\tmodTime: n.modTime,\n\t}\n}\n\nfunc (n *memFSNode) DeadProps() (map[xml.Name]Property, error) {\n\tn.mu.Lock()\n\tdefer n.mu.Unlock()\n\tif len(n.deadProps) == 0 {\n\t\treturn nil, nil\n\t}\n\tret := make(map[xml.Name]Property, len(n.deadProps))\n\tfor k, v := range n.deadProps {\n\t\tret[k] = v\n\t}\n\treturn ret, nil\n}\n\nfunc (n *memFSNode) Patch(patches []Proppatch) ([]Propstat, error) {\n\tn.mu.Lock()\n\tdefer n.mu.Unlock()\n\tpstat := Propstat{Status: http.StatusOK}\n\tfor _, patch := range patches {\n\t\tfor _, p := range patch.Props {\n\t\t\tpstat.Props = append(pstat.Props, Property{XMLName: p.XMLName})\n\t\t\tif patch.Remove {\n\t\t\t\tdelete(n.deadProps, p.XMLName)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif n.deadProps == nil {\n\t\t\t\tn.deadProps = map[xml.Name]Property{}\n\t\t\t}\n\t\t\tn.deadProps[p.XMLName] = p\n\t\t}\n\t}\n\treturn []Propstat{pstat}, nil\n}\n\ntype memFileInfo struct {\n\tname string\n\tsize int64\n\tmode os.FileMode\n\tmodTime time.Time\n}\n\nfunc (f *memFileInfo) Name() string { return f.name }\nfunc (f *memFileInfo) Size() int64 { return f.size }\nfunc (f *memFileInfo) Mode() os.FileMode { return f.mode }\nfunc (f *memFileInfo) ModTime() time.Time { return f.modTime }\nfunc (f *memFileInfo) IsDir() bool { return f.mode.IsDir() }\nfunc (f *memFileInfo) Sys() interface{} { return nil }\n\n// A memFile is a File implementation for a memFSNode. It is a per-file (not\n// per-node) read/write position, and a snapshot of the memFS' tree structure\n// (a node's name and children) for that node.\ntype memFile struct {\n\tn *memFSNode\n\tnameSnapshot string\n\tchildrenSnapshot []os.FileInfo\n\t// pos is protected by n.mu.\n\tpos int\n}\n\n// A *memFile implements the optional DeadPropsHolder interface.\nvar _ DeadPropsHolder = (*memFile)(nil)\n\nfunc (f *memFile) DeadProps() (map[xml.Name]Property, error) { return f.n.DeadProps() }\nfunc (f *memFile) Patch(patches []Proppatch) ([]Propstat, error) { return f.n.Patch(patches) }\n\nfunc (f *memFile) Close() error {\n\treturn nil\n}\n\nfunc (f *memFile) Read(p []byte) (int, error) {\n\tf.n.mu.Lock()\n\tdefer f.n.mu.Unlock()\n\tif f.n.mode.IsDir() {\n\t\treturn 0, os.ErrInvalid\n\t}\n\tif f.pos >= len(f.n.data) {\n\t\treturn 0, io.EOF\n\t}\n\tn := copy(p, f.n.data[f.pos:])\n\tf.pos += n\n\treturn n, nil\n}\n\nfunc (f *memFile) Readdir(count int) ([]os.FileInfo, error) {\n\tf.n.mu.Lock()\n\tdefer f.n.mu.Unlock()\n\tif !f.n.mode.IsDir() {\n\t\treturn nil, os.ErrInvalid\n\t}\n\told := f.pos\n\tif old >= len(f.childrenSnapshot) {\n\t\t// The os.File Readdir docs say that at the end of a directory,\n\t\t// the error is io.EOF if count > 0 and nil if count <= 0.\n\t\tif count > 0 {\n\t\t\treturn nil, io.EOF\n\t\t}\n\t\treturn nil, nil\n\t}\n\tif count > 0 {\n\t\tf.pos += count\n\t\tif f.pos > len(f.childrenSnapshot) {\n\t\t\tf.pos = len(f.childrenSnapshot)\n\t\t}\n\t} else {\n\t\tf.pos = len(f.childrenSnapshot)\n\t\told = 0\n\t}\n\treturn f.childrenSnapshot[old:f.pos], nil\n}\n\nfunc (f *memFile) Seek(offset int64, whence int) (int64, error) {\n\tf.n.mu.Lock()\n\tdefer f.n.mu.Unlock()\n\tnpos := f.pos\n\t// TODO: How to handle offsets greater than the size of system int?\n\tswitch whence {\n\tcase os.SEEK_SET:\n\t\tnpos = int(offset)\n\tcase os.SEEK_CUR:\n\t\tnpos += int(offset)\n\tcase os.SEEK_END:\n\t\tnpos = len(f.n.data) + int(offset)\n\tdefault:\n\t\tnpos = -1\n\t}\n\tif npos < 0 {\n\t\treturn 0, os.ErrInvalid\n\t}\n\tf.pos = npos\n\treturn int64(f.pos), nil\n}\n\nfunc (f *memFile) Stat() (os.FileInfo, error) {\n\treturn f.n.stat(f.nameSnapshot), nil\n}\n\nfunc (f *memFile) Write(p []byte) (int, error) {\n\tlenp := len(p)\n\tf.n.mu.Lock()\n\tdefer f.n.mu.Unlock()\n\n\tif f.n.mode.IsDir() {\n\t\treturn 0, os.ErrInvalid\n\t}\n\tif f.pos < len(f.n.data) {\n\t\tn := copy(f.n.data[f.pos:], p)\n\t\tf.pos += n\n\t\tp = p[n:]\n\t} else if f.pos > len(f.n.data) {\n\t\t// Write permits the creation of holes, if we've seek'ed past the\n\t\t// existing end of file.\n\t\tif f.pos <= cap(f.n.data) {\n\t\t\toldLen := len(f.n.data)\n\t\t\tf.n.data = f.n.data[:f.pos]\n\t\t\thole := f.n.data[oldLen:]\n\t\t\tfor i := range hole {\n\t\t\t\thole[i] = 0\n\t\t\t}\n\t\t} else {\n\t\t\td := make([]byte, f.pos, f.pos+len(p))\n\t\t\tcopy(d, f.n.data)\n\t\t\tf.n.data = d\n\t\t}\n\t}\n\n\tif len(p) > 0 {\n\t\t// We should only get here if f.pos == len(f.n.data).\n\t\tf.n.data = append(f.n.data, p...)\n\t\tf.pos = len(f.n.data)\n\t}\n\tf.n.modTime = time.Now()\n\treturn lenp, nil\n}\n\n// moveFiles moves files and/or directories from src to dst.\n//\n// See section 9.9.4 for when various HTTP status codes apply.\nfunc moveFiles(ctx context.Context, fs FileSystem, src, dst string, overwrite bool) (status int, err error) {\n\tcreated := false\n\tif _, err := fs.Stat(ctx, dst); err != nil {\n\t\tif !os.IsNotExist(err) {\n\t\t\treturn http.StatusForbidden, err\n\t\t}\n\t\tcreated = true\n\t} else if overwrite {\n\t\t// Section 9.9.3 says that \"If a resource exists at the destination\n\t\t// and the Overwrite header is \"T\", then prior to performing the move,\n\t\t// the server must perform a DELETE with \"Depth: infinity\" on the\n\t\t// destination resource.\n\t\tif err := fs.RemoveAll(ctx, dst); err != nil {\n\t\t\treturn http.StatusForbidden, err\n\t\t}\n\t} else {\n\t\treturn http.StatusPreconditionFailed, os.ErrExist\n\t}\n\tif err := fs.Rename(ctx, src, dst); err != nil {\n\t\treturn http.StatusForbidden, err\n\t}\n\tif created {\n\t\treturn http.StatusCreated, nil\n\t}\n\treturn http.StatusNoContent, nil\n}\n\nfunc copyProps(dst, src File) error {\n\td, ok := dst.(DeadPropsHolder)\n\tif !ok {\n\t\treturn nil\n\t}\n\ts, ok := src.(DeadPropsHolder)\n\tif !ok {\n\t\treturn nil\n\t}\n\tm, err := s.DeadProps()\n\tif err != nil {\n\t\treturn err\n\t}\n\tprops := make([]Property, 0, len(m))\n\tfor _, prop := range m {\n\t\tprops = append(props, prop)\n\t}\n\t_, err = d.Patch([]Proppatch{{Props: props}})\n\treturn err\n}\n\n// copyFiles copies files and/or directories from src to dst.\n//\n// See section 9.8.5 for when various HTTP status codes apply.\nfunc copyFiles(ctx context.Context, fs FileSystem, src, dst string, overwrite bool, depth int, recursion int) (status int, err error) {\n\tif recursion == 1000 {\n\t\treturn http.StatusInternalServerError, errRecursionTooDeep\n\t}\n\trecursion++\n\n\t// TODO: section 9.8.3 says that \"Note that an infinite-depth COPY of /A/\n\t// into /A/B/ could lead to infinite recursion if not handled correctly.\"\n\n\tsrcFile, err := fs.OpenFile(ctx, src, os.O_RDONLY, 0)\n\tif err != nil {\n\t\tif os.IsNotExist(err) {\n\t\t\treturn http.StatusNotFound, err\n\t\t}\n\t\treturn http.StatusInternalServerError, err\n\t}\n\tdefer srcFile.Close()\n\tsrcStat, err := srcFile.Stat()\n\tif err != nil {\n\t\tif os.IsNotExist(err) {\n\t\t\treturn http.StatusNotFound, err\n\t\t}\n\t\treturn http.StatusInternalServerError, err\n\t}\n\tsrcPerm := srcStat.Mode() & os.ModePerm\n\n\tcreated := false\n\tif _, err := fs.Stat(ctx, dst); err != nil {\n\t\tif os.IsNotExist(err) {\n\t\t\tcreated = true\n\t\t} else {\n\t\t\treturn http.StatusForbidden, err\n\t\t}\n\t} else {\n\t\tif !overwrite {\n\t\t\treturn http.StatusPreconditionFailed, os.ErrExist\n\t\t}\n\t\tif err := fs.RemoveAll(ctx, dst); err != nil && !os.IsNotExist(err) {\n\t\t\treturn http.StatusForbidden, err\n\t\t}\n\t}\n\n\tif srcStat.IsDir() {\n\t\tif err := fs.Mkdir(ctx, dst, srcPerm); err != nil {\n\t\t\treturn http.StatusForbidden, err\n\t\t}\n\t\tif depth == infiniteDepth {\n\t\t\tchildren, err := srcFile.Readdir(-1)\n\t\t\tif err != nil {\n\t\t\t\treturn http.StatusForbidden, err\n\t\t\t}\n\t\t\tfor _, c := range children {\n\t\t\t\tname := c.Name()\n\t\t\t\ts := path.Join(src, name)\n\t\t\t\td := path.Join(dst, name)\n\t\t\t\tcStatus, cErr := copyFiles(ctx, fs, s, d, overwrite, depth, recursion)\n\t\t\t\tif cErr != nil {\n\t\t\t\t\t// TODO: MultiStatus.\n\t\t\t\t\treturn cStatus, cErr\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t} else {\n\t\tdstFile, err := fs.OpenFile(ctx, dst, os.O_RDWR|os.O_CREATE|os.O_TRUNC, srcPerm)\n\t\tif err != nil {\n\t\t\tif os.IsNotExist(err) {\n\t\t\t\treturn http.StatusConflict, err\n\t\t\t}\n\t\t\treturn http.StatusForbidden, err\n\n\t\t}\n\t\t_, copyErr := io.Copy(dstFile, srcFile)\n\t\tpropsErr := copyProps(dstFile, srcFile)\n\t\tcloseErr := dstFile.Close()\n\t\tif copyErr != nil {\n\t\t\treturn http.StatusInternalServerError, copyErr\n\t\t}\n\t\tif propsErr != nil {\n\t\t\treturn http.StatusInternalServerError, propsErr\n\t\t}\n\t\tif closeErr != nil {\n\t\t\treturn http.StatusInternalServerError, closeErr\n\t\t}\n\t}\n\n\tif created {\n\t\treturn http.StatusCreated, nil\n\t}\n\treturn http.StatusNoContent, nil\n}\n\n// walkFS traverses filesystem fs starting at name up to depth levels.\n//\n// Allowed values for depth are 0, 1 or infiniteDepth. For each visited node,\n// walkFS calls walkFn. If a visited file system node is a directory and\n// walkFn returns filepath.SkipDir, walkFS will skip traversal of this node.\nfunc walkFS(ctx context.Context, fs FileSystem, depth int, name string, info os.FileInfo, walkFn filepath.WalkFunc) error {\n\t// This implementation is based on Walk's code in the standard path/filepath package.\n\terr := walkFn(name, info, nil)\n\tif err != nil {\n\t\tif info.IsDir() && err == filepath.SkipDir {\n\t\t\treturn nil\n\t\t}\n\t\treturn err\n\t}\n\tif !info.IsDir() || depth == 0 {\n\t\treturn nil\n\t}\n\tif depth == 1 {\n\t\tdepth = 0\n\t}\n\n\t// Read directory names.\n\tf, err := fs.OpenFile(ctx, name, os.O_RDONLY, 0)\n\tif err != nil {\n\t\treturn walkFn(name, info, err)\n\t}\n\tfileInfos, err := f.Readdir(0)\n\tf.Close()\n\tif err != nil {\n\t\treturn walkFn(name, info, err)\n\t}\n\n\tfor _, fileInfo := range fileInfos {\n\t\tfilename := path.Join(name, fileInfo.Name())\n\t\tfileInfo, err := fs.Stat(ctx, filename)\n\t\tif err != nil {\n\t\t\tif err := walkFn(filename, fileInfo, err); err != nil && err != filepath.SkipDir {\n\t\t\t\treturn err\n\t\t\t}\n\t\t} else {\n\t\t\terr = walkFS(ctx, fs, depth, filename, fileInfo, walkFn)\n\t\t\tif err != nil {\n\t\t\t\tif !fileInfo.IsDir() || err != filepath.SkipDir {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/if.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage webdav\n\n// The If header is covered by Section 10.4.\n// http://www.webdav.org/specs/rfc4918.html#HEADER_If\n\nimport (\n\t\"strings\"\n)\n\n// ifHeader is a disjunction (OR) of ifLists.\ntype ifHeader struct {\n\tlists []ifList\n}\n\n// ifList is a conjunction (AND) of Conditions, and an optional resource tag.\ntype ifList struct {\n\tresourceTag string\n\tconditions []Condition\n}\n\n// parseIfHeader parses the \"If: foo bar\" HTTP header. The httpHeader string\n// should omit the \"If:\" prefix and have any \"\\r\\n\"s collapsed to a \" \", as is\n// returned by req.Header.Get(\"If\") for a http.Request req.\nfunc parseIfHeader(httpHeader string) (h ifHeader, ok bool) {\n\ts := strings.TrimSpace(httpHeader)\n\tswitch tokenType, _, _ := lex(s); tokenType {\n\tcase '(':\n\t\treturn parseNoTagLists(s)\n\tcase angleTokenType:\n\t\treturn parseTaggedLists(s)\n\tdefault:\n\t\treturn ifHeader{}, false\n\t}\n}\n\nfunc parseNoTagLists(s string) (h ifHeader, ok bool) {\n\tfor {\n\t\tl, remaining, ok := parseList(s)\n\t\tif !ok {\n\t\t\treturn ifHeader{}, false\n\t\t}\n\t\th.lists = append(h.lists, l)\n\t\tif remaining == \"\" {\n\t\t\treturn h, true\n\t\t}\n\t\ts = remaining\n\t}\n}\n\nfunc parseTaggedLists(s string) (h ifHeader, ok bool) {\n\tresourceTag, n := \"\", 0\n\tfor first := true; ; first = false {\n\t\ttokenType, tokenStr, remaining := lex(s)\n\t\tswitch tokenType {\n\t\tcase angleTokenType:\n\t\t\tif !first && n == 0 {\n\t\t\t\treturn ifHeader{}, false\n\t\t\t}\n\t\t\tresourceTag, n = tokenStr, 0\n\t\t\ts = remaining\n\t\tcase '(':\n\t\t\tn++\n\t\t\tl, remaining, ok := parseList(s)\n\t\t\tif !ok {\n\t\t\t\treturn ifHeader{}, false\n\t\t\t}\n\t\t\tl.resourceTag = resourceTag\n\t\t\th.lists = append(h.lists, l)\n\t\t\tif remaining == \"\" {\n\t\t\t\treturn h, true\n\t\t\t}\n\t\t\ts = remaining\n\t\tdefault:\n\t\t\treturn ifHeader{}, false\n\t\t}\n\t}\n}\n\nfunc parseList(s string) (l ifList, remaining string, ok bool) {\n\ttokenType, _, s := lex(s)\n\tif tokenType != '(' {\n\t\treturn ifList{}, \"\", false\n\t}\n\tfor {\n\t\ttokenType, _, remaining = lex(s)\n\t\tif tokenType == ')' {\n\t\t\tif len(l.conditions) == 0 {\n\t\t\t\treturn ifList{}, \"\", false\n\t\t\t}\n\t\t\treturn l, remaining, true\n\t\t}\n\t\tc, remaining, ok := parseCondition(s)\n\t\tif !ok {\n\t\t\treturn ifList{}, \"\", false\n\t\t}\n\t\tl.conditions = append(l.conditions, c)\n\t\ts = remaining\n\t}\n}\n\nfunc parseCondition(s string) (c Condition, remaining string, ok bool) {\n\ttokenType, tokenStr, s := lex(s)\n\tif tokenType == notTokenType {\n\t\tc.Not = true\n\t\ttokenType, tokenStr, s = lex(s)\n\t}\n\tswitch tokenType {\n\tcase strTokenType, angleTokenType:\n\t\tc.Token = tokenStr\n\tcase squareTokenType:\n\t\tc.ETag = tokenStr\n\tdefault:\n\t\treturn Condition{}, \"\", false\n\t}\n\treturn c, s, true\n}\n\n// Single-rune tokens like '(' or ')' have a token type equal to their rune.\n// All other tokens have a negative token type.\nconst (\n\terrTokenType = rune(-1)\n\teofTokenType = rune(-2)\n\tstrTokenType = rune(-3)\n\tnotTokenType = rune(-4)\n\tangleTokenType = rune(-5)\n\tsquareTokenType = rune(-6)\n)\n\nfunc lex(s string) (tokenType rune, tokenStr string, remaining string) {\n\t// The net/textproto Reader that parses the HTTP header will collapse\n\t// Linear White Space that spans multiple \"\\r\\n\" lines to a single \" \",\n\t// so we don't need to look for '\\r' or '\\n'.\n\tfor len(s) > 0 && (s[0] == '\\t' || s[0] == ' ') {\n\t\ts = s[1:]\n\t}\n\tif len(s) == 0 {\n\t\treturn eofTokenType, \"\", \"\"\n\t}\n\ti := 0\nloop:\n\tfor ; i < len(s); i++ {\n\t\tswitch s[i] {\n\t\tcase '\\t', ' ', '(', ')', '<', '>', '[', ']':\n\t\t\tbreak loop\n\t\t}\n\t}\n\n\tif i != 0 {\n\t\ttokenStr, remaining = s[:i], s[i:]\n\t\tif tokenStr == \"Not\" {\n\t\t\treturn notTokenType, \"\", remaining\n\t\t}\n\t\treturn strTokenType, tokenStr, remaining\n\t}\n\n\tj := 0\n\tswitch s[0] {\n\tcase '<':\n\t\tj, tokenType = strings.IndexByte(s, '>'), angleTokenType\n\tcase '[':\n\t\tj, tokenType = strings.IndexByte(s, ']'), squareTokenType\n\tdefault:\n\t\treturn rune(s[0]), \"\", s[1:]\n\t}\n\tif j < 0 {\n\t\treturn errTokenType, \"\", \"\"\n\t}\n\treturn tokenType, s[1:j], s[j+1:]\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/internal/xml/README", "content": "This is a fork of the encoding/xml package at ca1d6c4, the last commit before\nhttps://go.googlesource.com/go/+/c0d6d33 \"encoding/xml: restore Go 1.4 name\nspace behavior\" made late in the lead-up to the Go 1.5 release.\n\nThe list of encoding/xml changes is at\nhttps://go.googlesource.com/go/+log/master/src/encoding/xml\n\nThis fork is temporary, and I (nigeltao) expect to revert it after Go 1.6 is\nreleased.\n\nSee http://golang.org/issue/11841\n" }, { "path": "vendor/golang.org/x/net/webdav/internal/xml/marshal.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage xml\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"encoding\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nconst (\n\t// A generic XML header suitable for use with the output of Marshal.\n\t// This is not automatically added to any output of this package,\n\t// it is provided as a convenience.\n\tHeader = `` + \"\\n\"\n)\n\n// Marshal returns the XML encoding of v.\n//\n// Marshal handles an array or slice by marshalling each of the elements.\n// Marshal handles a pointer by marshalling the value it points at or, if the\n// pointer is nil, by writing nothing. Marshal handles an interface value by\n// marshalling the value it contains or, if the interface value is nil, by\n// writing nothing. Marshal handles all other data by writing one or more XML\n// elements containing the data.\n//\n// The name for the XML elements is taken from, in order of preference:\n// - the tag on the XMLName field, if the data is a struct\n// - the value of the XMLName field of type xml.Name\n// - the tag of the struct field used to obtain the data\n// - the name of the struct field used to obtain the data\n// - the name of the marshalled type\n//\n// The XML element for a struct contains marshalled elements for each of the\n// exported fields of the struct, with these exceptions:\n// - the XMLName field, described above, is omitted.\n// - a field with tag \"-\" is omitted.\n// - a field with tag \"name,attr\" becomes an attribute with\n// the given name in the XML element.\n// - a field with tag \",attr\" becomes an attribute with the\n// field name in the XML element.\n// - a field with tag \",chardata\" is written as character data,\n// not as an XML element.\n// - a field with tag \",innerxml\" is written verbatim, not subject\n// to the usual marshalling procedure.\n// - a field with tag \",comment\" is written as an XML comment, not\n// subject to the usual marshalling procedure. It must not contain\n// the \"--\" string within it.\n// - a field with a tag including the \"omitempty\" option is omitted\n// if the field value is empty. The empty values are false, 0, any\n// nil pointer or interface value, and any array, slice, map, or\n// string of length zero.\n// - an anonymous struct field is handled as if the fields of its\n// value were part of the outer struct.\n//\n// If a field uses a tag \"a>b>c\", then the element c will be nested inside\n// parent elements a and b. Fields that appear next to each other that name\n// the same parent will be enclosed in one XML element.\n//\n// See MarshalIndent for an example.\n//\n// Marshal will return an error if asked to marshal a channel, function, or map.\nfunc Marshal(v interface{}) ([]byte, error) {\n\tvar b bytes.Buffer\n\tif err := NewEncoder(&b).Encode(v); err != nil {\n\t\treturn nil, err\n\t}\n\treturn b.Bytes(), nil\n}\n\n// Marshaler is the interface implemented by objects that can marshal\n// themselves into valid XML elements.\n//\n// MarshalXML encodes the receiver as zero or more XML elements.\n// By convention, arrays or slices are typically encoded as a sequence\n// of elements, one per entry.\n// Using start as the element tag is not required, but doing so\n// will enable Unmarshal to match the XML elements to the correct\n// struct field.\n// One common implementation strategy is to construct a separate\n// value with a layout corresponding to the desired XML and then\n// to encode it using e.EncodeElement.\n// Another common strategy is to use repeated calls to e.EncodeToken\n// to generate the XML output one token at a time.\n// The sequence of encoded tokens must make up zero or more valid\n// XML elements.\ntype Marshaler interface {\n\tMarshalXML(e *Encoder, start StartElement) error\n}\n\n// MarshalerAttr is the interface implemented by objects that can marshal\n// themselves into valid XML attributes.\n//\n// MarshalXMLAttr returns an XML attribute with the encoded value of the receiver.\n// Using name as the attribute name is not required, but doing so\n// will enable Unmarshal to match the attribute to the correct\n// struct field.\n// If MarshalXMLAttr returns the zero attribute Attr{}, no attribute\n// will be generated in the output.\n// MarshalXMLAttr is used only for struct fields with the\n// \"attr\" option in the field tag.\ntype MarshalerAttr interface {\n\tMarshalXMLAttr(name Name) (Attr, error)\n}\n\n// MarshalIndent works like Marshal, but each XML element begins on a new\n// indented line that starts with prefix and is followed by one or more\n// copies of indent according to the nesting depth.\nfunc MarshalIndent(v interface{}, prefix, indent string) ([]byte, error) {\n\tvar b bytes.Buffer\n\tenc := NewEncoder(&b)\n\tenc.Indent(prefix, indent)\n\tif err := enc.Encode(v); err != nil {\n\t\treturn nil, err\n\t}\n\treturn b.Bytes(), nil\n}\n\n// An Encoder writes XML data to an output stream.\ntype Encoder struct {\n\tp printer\n}\n\n// NewEncoder returns a new encoder that writes to w.\nfunc NewEncoder(w io.Writer) *Encoder {\n\te := &Encoder{printer{Writer: bufio.NewWriter(w)}}\n\te.p.encoder = e\n\treturn e\n}\n\n// Indent sets the encoder to generate XML in which each element\n// begins on a new indented line that starts with prefix and is followed by\n// one or more copies of indent according to the nesting depth.\nfunc (enc *Encoder) Indent(prefix, indent string) {\n\tenc.p.prefix = prefix\n\tenc.p.indent = indent\n}\n\n// Encode writes the XML encoding of v to the stream.\n//\n// See the documentation for Marshal for details about the conversion\n// of Go values to XML.\n//\n// Encode calls Flush before returning.\nfunc (enc *Encoder) Encode(v interface{}) error {\n\terr := enc.p.marshalValue(reflect.ValueOf(v), nil, nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn enc.p.Flush()\n}\n\n// EncodeElement writes the XML encoding of v to the stream,\n// using start as the outermost tag in the encoding.\n//\n// See the documentation for Marshal for details about the conversion\n// of Go values to XML.\n//\n// EncodeElement calls Flush before returning.\nfunc (enc *Encoder) EncodeElement(v interface{}, start StartElement) error {\n\terr := enc.p.marshalValue(reflect.ValueOf(v), nil, &start)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn enc.p.Flush()\n}\n\nvar (\n\tbegComment = []byte(\"\")\n\tendProcInst = []byte(\"?>\")\n\tendDirective = []byte(\">\")\n)\n\n// EncodeToken writes the given XML token to the stream.\n// It returns an error if StartElement and EndElement tokens are not\n// properly matched.\n//\n// EncodeToken does not call Flush, because usually it is part of a\n// larger operation such as Encode or EncodeElement (or a custom\n// Marshaler's MarshalXML invoked during those), and those will call\n// Flush when finished. Callers that create an Encoder and then invoke\n// EncodeToken directly, without using Encode or EncodeElement, need to\n// call Flush when finished to ensure that the XML is written to the\n// underlying writer.\n//\n// EncodeToken allows writing a ProcInst with Target set to \"xml\" only\n// as the first token in the stream.\n//\n// When encoding a StartElement holding an XML namespace prefix\n// declaration for a prefix that is not already declared, contained\n// elements (including the StartElement itself) will use the declared\n// prefix when encoding names with matching namespace URIs.\nfunc (enc *Encoder) EncodeToken(t Token) error {\n\n\tp := &enc.p\n\tswitch t := t.(type) {\n\tcase StartElement:\n\t\tif err := p.writeStart(&t); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase EndElement:\n\t\tif err := p.writeEnd(t.Name); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase CharData:\n\t\tescapeText(p, t, false)\n\tcase Comment:\n\t\tif bytes.Contains(t, endComment) {\n\t\t\treturn fmt.Errorf(\"xml: EncodeToken of Comment containing --> marker\")\n\t\t}\n\t\tp.WriteString(\"\")\n\t\treturn p.cachedWriteError()\n\tcase ProcInst:\n\t\t// First token to be encoded which is also a ProcInst with target of xml\n\t\t// is the xml declaration. The only ProcInst where target of xml is allowed.\n\t\tif t.Target == \"xml\" && p.Buffered() != 0 {\n\t\t\treturn fmt.Errorf(\"xml: EncodeToken of ProcInst xml target only valid for xml declaration, first token encoded\")\n\t\t}\n\t\tif !isNameString(t.Target) {\n\t\t\treturn fmt.Errorf(\"xml: EncodeToken of ProcInst with invalid Target\")\n\t\t}\n\t\tif bytes.Contains(t.Inst, endProcInst) {\n\t\t\treturn fmt.Errorf(\"xml: EncodeToken of ProcInst containing ?> marker\")\n\t\t}\n\t\tp.WriteString(\" 0 {\n\t\t\tp.WriteByte(' ')\n\t\t\tp.Write(t.Inst)\n\t\t}\n\t\tp.WriteString(\"?>\")\n\tcase Directive:\n\t\tif !isValidDirective(t) {\n\t\t\treturn fmt.Errorf(\"xml: EncodeToken of Directive containing wrong < or > markers\")\n\t\t}\n\t\tp.WriteString(\"\")\n\tdefault:\n\t\treturn fmt.Errorf(\"xml: EncodeToken of invalid token type\")\n\n\t}\n\treturn p.cachedWriteError()\n}\n\n// isValidDirective reports whether dir is a valid directive text,\n// meaning angle brackets are matched, ignoring comments and strings.\nfunc isValidDirective(dir Directive) bool {\n\tvar (\n\t\tdepth int\n\t\tinquote uint8\n\t\tincomment bool\n\t)\n\tfor i, c := range dir {\n\t\tswitch {\n\t\tcase incomment:\n\t\t\tif c == '>' {\n\t\t\t\tif n := 1 + i - len(endComment); n >= 0 && bytes.Equal(dir[n:i+1], endComment) {\n\t\t\t\t\tincomment = false\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Just ignore anything in comment\n\t\tcase inquote != 0:\n\t\t\tif c == inquote {\n\t\t\t\tinquote = 0\n\t\t\t}\n\t\t\t// Just ignore anything within quotes\n\t\tcase c == '\\'' || c == '\"':\n\t\t\tinquote = c\n\t\tcase c == '<':\n\t\t\tif i+len(begComment) < len(dir) && bytes.Equal(dir[i:i+len(begComment)], begComment) {\n\t\t\t\tincomment = true\n\t\t\t} else {\n\t\t\t\tdepth++\n\t\t\t}\n\t\tcase c == '>':\n\t\t\tif depth == 0 {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tdepth--\n\t\t}\n\t}\n\treturn depth == 0 && inquote == 0 && !incomment\n}\n\n// Flush flushes any buffered XML to the underlying writer.\n// See the EncodeToken documentation for details about when it is necessary.\nfunc (enc *Encoder) Flush() error {\n\treturn enc.p.Flush()\n}\n\ntype printer struct {\n\t*bufio.Writer\n\tencoder *Encoder\n\tseq int\n\tindent string\n\tprefix string\n\tdepth int\n\tindentedIn bool\n\tputNewline bool\n\tdefaultNS string\n\tattrNS map[string]string // map prefix -> name space\n\tattrPrefix map[string]string // map name space -> prefix\n\tprefixes []printerPrefix\n\ttags []Name\n}\n\n// printerPrefix holds a namespace undo record.\n// When an element is popped, the prefix record\n// is set back to the recorded URL. The empty\n// prefix records the URL for the default name space.\n//\n// The start of an element is recorded with an element\n// that has mark=true.\ntype printerPrefix struct {\n\tprefix string\n\turl string\n\tmark bool\n}\n\nfunc (p *printer) prefixForNS(url string, isAttr bool) string {\n\t// The \"http://www.w3.org/XML/1998/namespace\" name space is predefined as \"xml\"\n\t// and must be referred to that way.\n\t// (The \"http://www.w3.org/2000/xmlns/\" name space is also predefined as \"xmlns\",\n\t// but users should not be trying to use that one directly - that's our job.)\n\tif url == xmlURL {\n\t\treturn \"xml\"\n\t}\n\tif !isAttr && url == p.defaultNS {\n\t\t// We can use the default name space.\n\t\treturn \"\"\n\t}\n\treturn p.attrPrefix[url]\n}\n\n// defineNS pushes any namespace definition found in the given attribute.\n// If ignoreNonEmptyDefault is true, an xmlns=\"nonempty\"\n// attribute will be ignored.\nfunc (p *printer) defineNS(attr Attr, ignoreNonEmptyDefault bool) error {\n\tvar prefix string\n\tif attr.Name.Local == \"xmlns\" {\n\t\tif attr.Name.Space != \"\" && attr.Name.Space != \"xml\" && attr.Name.Space != xmlURL {\n\t\t\treturn fmt.Errorf(\"xml: cannot redefine xmlns attribute prefix\")\n\t\t}\n\t} else if attr.Name.Space == \"xmlns\" && attr.Name.Local != \"\" {\n\t\tprefix = attr.Name.Local\n\t\tif attr.Value == \"\" {\n\t\t\t// Technically, an empty XML namespace is allowed for an attribute.\n\t\t\t// From http://www.w3.org/TR/xml-names11/#scoping-defaulting:\n\t\t\t//\n\t\t\t// \tThe attribute value in a namespace declaration for a prefix may be\n\t\t\t//\tempty. This has the effect, within the scope of the declaration, of removing\n\t\t\t//\tany association of the prefix with a namespace name.\n\t\t\t//\n\t\t\t// However our namespace prefixes here are used only as hints. There's\n\t\t\t// no need to respect the removal of a namespace prefix, so we ignore it.\n\t\t\treturn nil\n\t\t}\n\t} else {\n\t\t// Ignore: it's not a namespace definition\n\t\treturn nil\n\t}\n\tif prefix == \"\" {\n\t\tif attr.Value == p.defaultNS {\n\t\t\t// No need for redefinition.\n\t\t\treturn nil\n\t\t}\n\t\tif attr.Value != \"\" && ignoreNonEmptyDefault {\n\t\t\t// We have an xmlns=\"...\" value but\n\t\t\t// it can't define a name space in this context,\n\t\t\t// probably because the element has an empty\n\t\t\t// name space. In this case, we just ignore\n\t\t\t// the name space declaration.\n\t\t\treturn nil\n\t\t}\n\t} else if _, ok := p.attrPrefix[attr.Value]; ok {\n\t\t// There's already a prefix for the given name space,\n\t\t// so use that. This prevents us from\n\t\t// having two prefixes for the same name space\n\t\t// so attrNS and attrPrefix can remain bijective.\n\t\treturn nil\n\t}\n\tp.pushPrefix(prefix, attr.Value)\n\treturn nil\n}\n\n// createNSPrefix creates a name space prefix attribute\n// to use for the given name space, defining a new prefix\n// if necessary.\n// If isAttr is true, the prefix is to be created for an attribute\n// prefix, which means that the default name space cannot\n// be used.\nfunc (p *printer) createNSPrefix(url string, isAttr bool) {\n\tif _, ok := p.attrPrefix[url]; ok {\n\t\t// We already have a prefix for the given URL.\n\t\treturn\n\t}\n\tswitch {\n\tcase !isAttr && url == p.defaultNS:\n\t\t// We can use the default name space.\n\t\treturn\n\tcase url == \"\":\n\t\t// The only way we can encode names in the empty\n\t\t// name space is by using the default name space,\n\t\t// so we must use that.\n\t\tif p.defaultNS != \"\" {\n\t\t\t// The default namespace is non-empty, so we\n\t\t\t// need to set it to empty.\n\t\t\tp.pushPrefix(\"\", \"\")\n\t\t}\n\t\treturn\n\tcase url == xmlURL:\n\t\treturn\n\t}\n\t// TODO If the URL is an existing prefix, we could\n\t// use it as is. That would enable the\n\t// marshaling of elements that had been unmarshaled\n\t// and with a name space prefix that was not found.\n\t// although technically it would be incorrect.\n\n\t// Pick a name. We try to use the final element of the path\n\t// but fall back to _.\n\tprefix := strings.TrimRight(url, \"/\")\n\tif i := strings.LastIndex(prefix, \"/\"); i >= 0 {\n\t\tprefix = prefix[i+1:]\n\t}\n\tif prefix == \"\" || !isName([]byte(prefix)) || strings.Contains(prefix, \":\") {\n\t\tprefix = \"_\"\n\t}\n\tif strings.HasPrefix(prefix, \"xml\") {\n\t\t// xmlanything is reserved.\n\t\tprefix = \"_\" + prefix\n\t}\n\tif p.attrNS[prefix] != \"\" {\n\t\t// Name is taken. Find a better one.\n\t\tfor p.seq++; ; p.seq++ {\n\t\t\tif id := prefix + \"_\" + strconv.Itoa(p.seq); p.attrNS[id] == \"\" {\n\t\t\t\tprefix = id\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tp.pushPrefix(prefix, url)\n}\n\n// writeNamespaces writes xmlns attributes for all the\n// namespace prefixes that have been defined in\n// the current element.\nfunc (p *printer) writeNamespaces() {\n\tfor i := len(p.prefixes) - 1; i >= 0; i-- {\n\t\tprefix := p.prefixes[i]\n\t\tif prefix.mark {\n\t\t\treturn\n\t\t}\n\t\tp.WriteString(\" \")\n\t\tif prefix.prefix == \"\" {\n\t\t\t// Default name space.\n\t\t\tp.WriteString(`xmlns=\"`)\n\t\t} else {\n\t\t\tp.WriteString(\"xmlns:\")\n\t\t\tp.WriteString(prefix.prefix)\n\t\t\tp.WriteString(`=\"`)\n\t\t}\n\t\tEscapeText(p, []byte(p.nsForPrefix(prefix.prefix)))\n\t\tp.WriteString(`\"`)\n\t}\n}\n\n// pushPrefix pushes a new prefix on the prefix stack\n// without checking to see if it is already defined.\nfunc (p *printer) pushPrefix(prefix, url string) {\n\tp.prefixes = append(p.prefixes, printerPrefix{\n\t\tprefix: prefix,\n\t\turl: p.nsForPrefix(prefix),\n\t})\n\tp.setAttrPrefix(prefix, url)\n}\n\n// nsForPrefix returns the name space for the given\n// prefix. Note that this is not valid for the\n// empty attribute prefix, which always has an empty\n// name space.\nfunc (p *printer) nsForPrefix(prefix string) string {\n\tif prefix == \"\" {\n\t\treturn p.defaultNS\n\t}\n\treturn p.attrNS[prefix]\n}\n\n// markPrefix marks the start of an element on the prefix\n// stack.\nfunc (p *printer) markPrefix() {\n\tp.prefixes = append(p.prefixes, printerPrefix{\n\t\tmark: true,\n\t})\n}\n\n// popPrefix pops all defined prefixes for the current\n// element.\nfunc (p *printer) popPrefix() {\n\tfor len(p.prefixes) > 0 {\n\t\tprefix := p.prefixes[len(p.prefixes)-1]\n\t\tp.prefixes = p.prefixes[:len(p.prefixes)-1]\n\t\tif prefix.mark {\n\t\t\tbreak\n\t\t}\n\t\tp.setAttrPrefix(prefix.prefix, prefix.url)\n\t}\n}\n\n// setAttrPrefix sets an attribute name space prefix.\n// If url is empty, the attribute is removed.\n// If prefix is empty, the default name space is set.\nfunc (p *printer) setAttrPrefix(prefix, url string) {\n\tif prefix == \"\" {\n\t\tp.defaultNS = url\n\t\treturn\n\t}\n\tif url == \"\" {\n\t\tdelete(p.attrPrefix, p.attrNS[prefix])\n\t\tdelete(p.attrNS, prefix)\n\t\treturn\n\t}\n\tif p.attrPrefix == nil {\n\t\t// Need to define a new name space.\n\t\tp.attrPrefix = make(map[string]string)\n\t\tp.attrNS = make(map[string]string)\n\t}\n\t// Remove any old prefix value. This is OK because we maintain a\n\t// strict one-to-one mapping between prefix and URL (see\n\t// defineNS)\n\tdelete(p.attrPrefix, p.attrNS[prefix])\n\tp.attrPrefix[url] = prefix\n\tp.attrNS[prefix] = url\n}\n\nvar (\n\tmarshalerType = reflect.TypeOf((*Marshaler)(nil)).Elem()\n\tmarshalerAttrType = reflect.TypeOf((*MarshalerAttr)(nil)).Elem()\n\ttextMarshalerType = reflect.TypeOf((*encoding.TextMarshaler)(nil)).Elem()\n)\n\n// marshalValue writes one or more XML elements representing val.\n// If val was obtained from a struct field, finfo must have its details.\nfunc (p *printer) marshalValue(val reflect.Value, finfo *fieldInfo, startTemplate *StartElement) error {\n\tif startTemplate != nil && startTemplate.Name.Local == \"\" {\n\t\treturn fmt.Errorf(\"xml: EncodeElement of StartElement with missing name\")\n\t}\n\n\tif !val.IsValid() {\n\t\treturn nil\n\t}\n\tif finfo != nil && finfo.flags&fOmitEmpty != 0 && isEmptyValue(val) {\n\t\treturn nil\n\t}\n\n\t// Drill into interfaces and pointers.\n\t// This can turn into an infinite loop given a cyclic chain,\n\t// but it matches the Go 1 behavior.\n\tfor val.Kind() == reflect.Interface || val.Kind() == reflect.Ptr {\n\t\tif val.IsNil() {\n\t\t\treturn nil\n\t\t}\n\t\tval = val.Elem()\n\t}\n\n\tkind := val.Kind()\n\ttyp := val.Type()\n\n\t// Check for marshaler.\n\tif val.CanInterface() && typ.Implements(marshalerType) {\n\t\treturn p.marshalInterface(val.Interface().(Marshaler), p.defaultStart(typ, finfo, startTemplate))\n\t}\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(marshalerType) {\n\t\t\treturn p.marshalInterface(pv.Interface().(Marshaler), p.defaultStart(pv.Type(), finfo, startTemplate))\n\t\t}\n\t}\n\n\t// Check for text marshaler.\n\tif val.CanInterface() && typ.Implements(textMarshalerType) {\n\t\treturn p.marshalTextInterface(val.Interface().(encoding.TextMarshaler), p.defaultStart(typ, finfo, startTemplate))\n\t}\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(textMarshalerType) {\n\t\t\treturn p.marshalTextInterface(pv.Interface().(encoding.TextMarshaler), p.defaultStart(pv.Type(), finfo, startTemplate))\n\t\t}\n\t}\n\n\t// Slices and arrays iterate over the elements. They do not have an enclosing tag.\n\tif (kind == reflect.Slice || kind == reflect.Array) && typ.Elem().Kind() != reflect.Uint8 {\n\t\tfor i, n := 0, val.Len(); i < n; i++ {\n\t\t\tif err := p.marshalValue(val.Index(i), finfo, startTemplate); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t}\n\n\ttinfo, err := getTypeInfo(typ)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Create start element.\n\t// Precedence for the XML element name is:\n\t// 0. startTemplate\n\t// 1. XMLName field in underlying struct;\n\t// 2. field name/tag in the struct field; and\n\t// 3. type name\n\tvar start StartElement\n\n\t// explicitNS records whether the element's name space has been\n\t// explicitly set (for example an XMLName field).\n\texplicitNS := false\n\n\tif startTemplate != nil {\n\t\tstart.Name = startTemplate.Name\n\t\texplicitNS = true\n\t\tstart.Attr = append(start.Attr, startTemplate.Attr...)\n\t} else if tinfo.xmlname != nil {\n\t\txmlname := tinfo.xmlname\n\t\tif xmlname.name != \"\" {\n\t\t\tstart.Name.Space, start.Name.Local = xmlname.xmlns, xmlname.name\n\t\t} else if v, ok := xmlname.value(val).Interface().(Name); ok && v.Local != \"\" {\n\t\t\tstart.Name = v\n\t\t}\n\t\texplicitNS = true\n\t}\n\tif start.Name.Local == \"\" && finfo != nil {\n\t\tstart.Name.Local = finfo.name\n\t\tif finfo.xmlns != \"\" {\n\t\t\tstart.Name.Space = finfo.xmlns\n\t\t\texplicitNS = true\n\t\t}\n\t}\n\tif start.Name.Local == \"\" {\n\t\tname := typ.Name()\n\t\tif name == \"\" {\n\t\t\treturn &UnsupportedTypeError{typ}\n\t\t}\n\t\tstart.Name.Local = name\n\t}\n\n\t// defaultNS records the default name space as set by a xmlns=\"...\"\n\t// attribute. We don't set p.defaultNS because we want to let\n\t// the attribute writing code (in p.defineNS) be solely responsible\n\t// for maintaining that.\n\tdefaultNS := p.defaultNS\n\n\t// Attributes\n\tfor i := range tinfo.fields {\n\t\tfinfo := &tinfo.fields[i]\n\t\tif finfo.flags&fAttr == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tattr, err := p.fieldAttr(finfo, val)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif attr.Name.Local == \"\" {\n\t\t\tcontinue\n\t\t}\n\t\tstart.Attr = append(start.Attr, attr)\n\t\tif attr.Name.Space == \"\" && attr.Name.Local == \"xmlns\" {\n\t\t\tdefaultNS = attr.Value\n\t\t}\n\t}\n\tif !explicitNS {\n\t\t// Historic behavior: elements use the default name space\n\t\t// they are contained in by default.\n\t\tstart.Name.Space = defaultNS\n\t}\n\t// Historic behaviour: an element that's in a namespace sets\n\t// the default namespace for all elements contained within it.\n\tstart.setDefaultNamespace()\n\n\tif err := p.writeStart(&start); err != nil {\n\t\treturn err\n\t}\n\n\tif val.Kind() == reflect.Struct {\n\t\terr = p.marshalStruct(tinfo, val)\n\t} else {\n\t\ts, b, err1 := p.marshalSimple(typ, val)\n\t\tif err1 != nil {\n\t\t\terr = err1\n\t\t} else if b != nil {\n\t\t\tEscapeText(p, b)\n\t\t} else {\n\t\t\tp.EscapeString(s)\n\t\t}\n\t}\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif err := p.writeEnd(start.Name); err != nil {\n\t\treturn err\n\t}\n\n\treturn p.cachedWriteError()\n}\n\n// fieldAttr returns the attribute of the given field.\n// If the returned attribute has an empty Name.Local,\n// it should not be used.\n// The given value holds the value containing the field.\nfunc (p *printer) fieldAttr(finfo *fieldInfo, val reflect.Value) (Attr, error) {\n\tfv := finfo.value(val)\n\tname := Name{Space: finfo.xmlns, Local: finfo.name}\n\tif finfo.flags&fOmitEmpty != 0 && isEmptyValue(fv) {\n\t\treturn Attr{}, nil\n\t}\n\tif fv.Kind() == reflect.Interface && fv.IsNil() {\n\t\treturn Attr{}, nil\n\t}\n\tif fv.CanInterface() && fv.Type().Implements(marshalerAttrType) {\n\t\tattr, err := fv.Interface().(MarshalerAttr).MarshalXMLAttr(name)\n\t\treturn attr, err\n\t}\n\tif fv.CanAddr() {\n\t\tpv := fv.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(marshalerAttrType) {\n\t\t\tattr, err := pv.Interface().(MarshalerAttr).MarshalXMLAttr(name)\n\t\t\treturn attr, err\n\t\t}\n\t}\n\tif fv.CanInterface() && fv.Type().Implements(textMarshalerType) {\n\t\ttext, err := fv.Interface().(encoding.TextMarshaler).MarshalText()\n\t\tif err != nil {\n\t\t\treturn Attr{}, err\n\t\t}\n\t\treturn Attr{name, string(text)}, nil\n\t}\n\tif fv.CanAddr() {\n\t\tpv := fv.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(textMarshalerType) {\n\t\t\ttext, err := pv.Interface().(encoding.TextMarshaler).MarshalText()\n\t\t\tif err != nil {\n\t\t\t\treturn Attr{}, err\n\t\t\t}\n\t\t\treturn Attr{name, string(text)}, nil\n\t\t}\n\t}\n\t// Dereference or skip nil pointer, interface values.\n\tswitch fv.Kind() {\n\tcase reflect.Ptr, reflect.Interface:\n\t\tif fv.IsNil() {\n\t\t\treturn Attr{}, nil\n\t\t}\n\t\tfv = fv.Elem()\n\t}\n\ts, b, err := p.marshalSimple(fv.Type(), fv)\n\tif err != nil {\n\t\treturn Attr{}, err\n\t}\n\tif b != nil {\n\t\ts = string(b)\n\t}\n\treturn Attr{name, s}, nil\n}\n\n// defaultStart returns the default start element to use,\n// given the reflect type, field info, and start template.\nfunc (p *printer) defaultStart(typ reflect.Type, finfo *fieldInfo, startTemplate *StartElement) StartElement {\n\tvar start StartElement\n\t// Precedence for the XML element name is as above,\n\t// except that we do not look inside structs for the first field.\n\tif startTemplate != nil {\n\t\tstart.Name = startTemplate.Name\n\t\tstart.Attr = append(start.Attr, startTemplate.Attr...)\n\t} else if finfo != nil && finfo.name != \"\" {\n\t\tstart.Name.Local = finfo.name\n\t\tstart.Name.Space = finfo.xmlns\n\t} else if typ.Name() != \"\" {\n\t\tstart.Name.Local = typ.Name()\n\t} else {\n\t\t// Must be a pointer to a named type,\n\t\t// since it has the Marshaler methods.\n\t\tstart.Name.Local = typ.Elem().Name()\n\t}\n\t// Historic behaviour: elements use the name space of\n\t// the element they are contained in by default.\n\tif start.Name.Space == \"\" {\n\t\tstart.Name.Space = p.defaultNS\n\t}\n\tstart.setDefaultNamespace()\n\treturn start\n}\n\n// marshalInterface marshals a Marshaler interface value.\nfunc (p *printer) marshalInterface(val Marshaler, start StartElement) error {\n\t// Push a marker onto the tag stack so that MarshalXML\n\t// cannot close the XML tags that it did not open.\n\tp.tags = append(p.tags, Name{})\n\tn := len(p.tags)\n\n\terr := val.MarshalXML(p.encoder, start)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Make sure MarshalXML closed all its tags. p.tags[n-1] is the mark.\n\tif len(p.tags) > n {\n\t\treturn fmt.Errorf(\"xml: %s.MarshalXML wrote invalid XML: <%s> not closed\", receiverType(val), p.tags[len(p.tags)-1].Local)\n\t}\n\tp.tags = p.tags[:n-1]\n\treturn nil\n}\n\n// marshalTextInterface marshals a TextMarshaler interface value.\nfunc (p *printer) marshalTextInterface(val encoding.TextMarshaler, start StartElement) error {\n\tif err := p.writeStart(&start); err != nil {\n\t\treturn err\n\t}\n\ttext, err := val.MarshalText()\n\tif err != nil {\n\t\treturn err\n\t}\n\tEscapeText(p, text)\n\treturn p.writeEnd(start.Name)\n}\n\n// writeStart writes the given start element.\nfunc (p *printer) writeStart(start *StartElement) error {\n\tif start.Name.Local == \"\" {\n\t\treturn fmt.Errorf(\"xml: start tag with no name\")\n\t}\n\n\tp.tags = append(p.tags, start.Name)\n\tp.markPrefix()\n\t// Define any name spaces explicitly declared in the attributes.\n\t// We do this as a separate pass so that explicitly declared prefixes\n\t// will take precedence over implicitly declared prefixes\n\t// regardless of the order of the attributes.\n\tignoreNonEmptyDefault := start.Name.Space == \"\"\n\tfor _, attr := range start.Attr {\n\t\tif err := p.defineNS(attr, ignoreNonEmptyDefault); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t// Define any new name spaces implied by the attributes.\n\tfor _, attr := range start.Attr {\n\t\tname := attr.Name\n\t\t// From http://www.w3.org/TR/xml-names11/#defaulting\n\t\t// \"Default namespace declarations do not apply directly\n\t\t// to attribute names; the interpretation of unprefixed\n\t\t// attributes is determined by the element on which they\n\t\t// appear.\"\n\t\t// This means we don't need to create a new namespace\n\t\t// when an attribute name space is empty.\n\t\tif name.Space != \"\" && !name.isNamespace() {\n\t\t\tp.createNSPrefix(name.Space, true)\n\t\t}\n\t}\n\tp.createNSPrefix(start.Name.Space, false)\n\n\tp.writeIndent(1)\n\tp.WriteByte('<')\n\tp.writeName(start.Name, false)\n\tp.writeNamespaces()\n\tfor _, attr := range start.Attr {\n\t\tname := attr.Name\n\t\tif name.Local == \"\" || name.isNamespace() {\n\t\t\t// Namespaces have already been written by writeNamespaces above.\n\t\t\tcontinue\n\t\t}\n\t\tp.WriteByte(' ')\n\t\tp.writeName(name, true)\n\t\tp.WriteString(`=\"`)\n\t\tp.EscapeString(attr.Value)\n\t\tp.WriteByte('\"')\n\t}\n\tp.WriteByte('>')\n\treturn nil\n}\n\n// writeName writes the given name. It assumes\n// that p.createNSPrefix(name) has already been called.\nfunc (p *printer) writeName(name Name, isAttr bool) {\n\tif prefix := p.prefixForNS(name.Space, isAttr); prefix != \"\" {\n\t\tp.WriteString(prefix)\n\t\tp.WriteByte(':')\n\t}\n\tp.WriteString(name.Local)\n}\n\nfunc (p *printer) writeEnd(name Name) error {\n\tif name.Local == \"\" {\n\t\treturn fmt.Errorf(\"xml: end tag with no name\")\n\t}\n\tif len(p.tags) == 0 || p.tags[len(p.tags)-1].Local == \"\" {\n\t\treturn fmt.Errorf(\"xml: end tag without start tag\", name.Local)\n\t}\n\tif top := p.tags[len(p.tags)-1]; top != name {\n\t\tif top.Local != name.Local {\n\t\t\treturn fmt.Errorf(\"xml: end tag does not match start tag <%s>\", name.Local, top.Local)\n\t\t}\n\t\treturn fmt.Errorf(\"xml: end tag in namespace %s does not match start tag <%s> in namespace %s\", name.Local, name.Space, top.Local, top.Space)\n\t}\n\tp.tags = p.tags[:len(p.tags)-1]\n\n\tp.writeIndent(-1)\n\tp.WriteByte('<')\n\tp.WriteByte('/')\n\tp.writeName(name, false)\n\tp.WriteByte('>')\n\tp.popPrefix()\n\treturn nil\n}\n\nfunc (p *printer) marshalSimple(typ reflect.Type, val reflect.Value) (string, []byte, error) {\n\tswitch val.Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn strconv.FormatInt(val.Int(), 10), nil, nil\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn strconv.FormatUint(val.Uint(), 10), nil, nil\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn strconv.FormatFloat(val.Float(), 'g', -1, val.Type().Bits()), nil, nil\n\tcase reflect.String:\n\t\treturn val.String(), nil, nil\n\tcase reflect.Bool:\n\t\treturn strconv.FormatBool(val.Bool()), nil, nil\n\tcase reflect.Array:\n\t\tif typ.Elem().Kind() != reflect.Uint8 {\n\t\t\tbreak\n\t\t}\n\t\t// [...]byte\n\t\tvar bytes []byte\n\t\tif val.CanAddr() {\n\t\t\tbytes = val.Slice(0, val.Len()).Bytes()\n\t\t} else {\n\t\t\tbytes = make([]byte, val.Len())\n\t\t\treflect.Copy(reflect.ValueOf(bytes), val)\n\t\t}\n\t\treturn \"\", bytes, nil\n\tcase reflect.Slice:\n\t\tif typ.Elem().Kind() != reflect.Uint8 {\n\t\t\tbreak\n\t\t}\n\t\t// []byte\n\t\treturn \"\", val.Bytes(), nil\n\t}\n\treturn \"\", nil, &UnsupportedTypeError{typ}\n}\n\nvar ddBytes = []byte(\"--\")\n\nfunc (p *printer) marshalStruct(tinfo *typeInfo, val reflect.Value) error {\n\ts := parentStack{p: p}\n\tfor i := range tinfo.fields {\n\t\tfinfo := &tinfo.fields[i]\n\t\tif finfo.flags&fAttr != 0 {\n\t\t\tcontinue\n\t\t}\n\t\tvf := finfo.value(val)\n\n\t\t// Dereference or skip nil pointer, interface values.\n\t\tswitch vf.Kind() {\n\t\tcase reflect.Ptr, reflect.Interface:\n\t\t\tif !vf.IsNil() {\n\t\t\t\tvf = vf.Elem()\n\t\t\t}\n\t\t}\n\n\t\tswitch finfo.flags & fMode {\n\t\tcase fCharData:\n\t\t\tif err := s.setParents(&noField, reflect.Value{}); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif vf.CanInterface() && vf.Type().Implements(textMarshalerType) {\n\t\t\t\tdata, err := vf.Interface().(encoding.TextMarshaler).MarshalText()\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tEscape(p, data)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif vf.CanAddr() {\n\t\t\t\tpv := vf.Addr()\n\t\t\t\tif pv.CanInterface() && pv.Type().Implements(textMarshalerType) {\n\t\t\t\t\tdata, err := pv.Interface().(encoding.TextMarshaler).MarshalText()\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\tEscape(p, data)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\tvar scratch [64]byte\n\t\t\tswitch vf.Kind() {\n\t\t\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\t\t\tEscape(p, strconv.AppendInt(scratch[:0], vf.Int(), 10))\n\t\t\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\t\t\tEscape(p, strconv.AppendUint(scratch[:0], vf.Uint(), 10))\n\t\t\tcase reflect.Float32, reflect.Float64:\n\t\t\t\tEscape(p, strconv.AppendFloat(scratch[:0], vf.Float(), 'g', -1, vf.Type().Bits()))\n\t\t\tcase reflect.Bool:\n\t\t\t\tEscape(p, strconv.AppendBool(scratch[:0], vf.Bool()))\n\t\t\tcase reflect.String:\n\t\t\t\tif err := EscapeText(p, []byte(vf.String())); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\tcase reflect.Slice:\n\t\t\t\tif elem, ok := vf.Interface().([]byte); ok {\n\t\t\t\t\tif err := EscapeText(p, elem); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\n\t\tcase fComment:\n\t\t\tif err := s.setParents(&noField, reflect.Value{}); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tk := vf.Kind()\n\t\t\tif !(k == reflect.String || k == reflect.Slice && vf.Type().Elem().Kind() == reflect.Uint8) {\n\t\t\t\treturn fmt.Errorf(\"xml: bad type for comment field of %s\", val.Type())\n\t\t\t}\n\t\t\tif vf.Len() == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tp.writeIndent(0)\n\t\t\tp.WriteString(\"\" is invalid grammar. Make it \"- -->\"\n\t\t\t\tp.WriteByte(' ')\n\t\t\t}\n\t\t\tp.WriteString(\"-->\")\n\t\t\tcontinue\n\n\t\tcase fInnerXml:\n\t\t\tiface := vf.Interface()\n\t\t\tswitch raw := iface.(type) {\n\t\t\tcase []byte:\n\t\t\t\tp.Write(raw)\n\t\t\t\tcontinue\n\t\t\tcase string:\n\t\t\t\tp.WriteString(raw)\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\tcase fElement, fElement | fAny:\n\t\t\tif err := s.setParents(finfo, vf); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tif err := p.marshalValue(vf, finfo, nil); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tif err := s.setParents(&noField, reflect.Value{}); err != nil {\n\t\treturn err\n\t}\n\treturn p.cachedWriteError()\n}\n\nvar noField fieldInfo\n\n// return the bufio Writer's cached write error\nfunc (p *printer) cachedWriteError() error {\n\t_, err := p.Write(nil)\n\treturn err\n}\n\nfunc (p *printer) writeIndent(depthDelta int) {\n\tif len(p.prefix) == 0 && len(p.indent) == 0 {\n\t\treturn\n\t}\n\tif depthDelta < 0 {\n\t\tp.depth--\n\t\tif p.indentedIn {\n\t\t\tp.indentedIn = false\n\t\t\treturn\n\t\t}\n\t\tp.indentedIn = false\n\t}\n\tif p.putNewline {\n\t\tp.WriteByte('\\n')\n\t} else {\n\t\tp.putNewline = true\n\t}\n\tif len(p.prefix) > 0 {\n\t\tp.WriteString(p.prefix)\n\t}\n\tif len(p.indent) > 0 {\n\t\tfor i := 0; i < p.depth; i++ {\n\t\t\tp.WriteString(p.indent)\n\t\t}\n\t}\n\tif depthDelta > 0 {\n\t\tp.depth++\n\t\tp.indentedIn = true\n\t}\n}\n\ntype parentStack struct {\n\tp *printer\n\txmlns string\n\tparents []string\n}\n\n// setParents sets the stack of current parents to those found in finfo.\n// It only writes the start elements if vf holds a non-nil value.\n// If finfo is &noField, it pops all elements.\nfunc (s *parentStack) setParents(finfo *fieldInfo, vf reflect.Value) error {\n\txmlns := s.p.defaultNS\n\tif finfo.xmlns != \"\" {\n\t\txmlns = finfo.xmlns\n\t}\n\tcommonParents := 0\n\tif xmlns == s.xmlns {\n\t\tfor ; commonParents < len(finfo.parents) && commonParents < len(s.parents); commonParents++ {\n\t\t\tif finfo.parents[commonParents] != s.parents[commonParents] {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\t// Pop off any parents that aren't in common with the previous field.\n\tfor i := len(s.parents) - 1; i >= commonParents; i-- {\n\t\tif err := s.p.writeEnd(Name{\n\t\t\tSpace: s.xmlns,\n\t\t\tLocal: s.parents[i],\n\t\t}); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\ts.parents = finfo.parents\n\ts.xmlns = xmlns\n\tif commonParents >= len(s.parents) {\n\t\t// No new elements to push.\n\t\treturn nil\n\t}\n\tif (vf.Kind() == reflect.Ptr || vf.Kind() == reflect.Interface) && vf.IsNil() {\n\t\t// The element is nil, so no need for the start elements.\n\t\ts.parents = s.parents[:commonParents]\n\t\treturn nil\n\t}\n\t// Push any new parents required.\n\tfor _, name := range s.parents[commonParents:] {\n\t\tstart := &StartElement{\n\t\t\tName: Name{\n\t\t\t\tSpace: s.xmlns,\n\t\t\t\tLocal: name,\n\t\t\t},\n\t\t}\n\t\t// Set the default name space for parent elements\n\t\t// to match what we do with other elements.\n\t\tif s.xmlns != s.p.defaultNS {\n\t\t\tstart.setDefaultNamespace()\n\t\t}\n\t\tif err := s.p.writeStart(start); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// A MarshalXMLError is returned when Marshal encounters a type\n// that cannot be converted into XML.\ntype UnsupportedTypeError struct {\n\tType reflect.Type\n}\n\nfunc (e *UnsupportedTypeError) Error() string {\n\treturn \"xml: unsupported type: \" + e.Type.String()\n}\n\nfunc isEmptyValue(v reflect.Value) bool {\n\tswitch v.Kind() {\n\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\treturn v.Len() == 0\n\tcase reflect.Bool:\n\t\treturn !v.Bool()\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn v.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\treturn v.IsNil()\n\t}\n\treturn false\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/internal/xml/read.go", "content": "// Copyright 2009 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage xml\n\nimport (\n\t\"bytes\"\n\t\"encoding\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// BUG(rsc): Mapping between XML elements and data structures is inherently flawed:\n// an XML element is an order-dependent collection of anonymous\n// values, while a data structure is an order-independent collection\n// of named values.\n// See package json for a textual representation more suitable\n// to data structures.\n\n// Unmarshal parses the XML-encoded data and stores the result in\n// the value pointed to by v, which must be an arbitrary struct,\n// slice, or string. Well-formed data that does not fit into v is\n// discarded.\n//\n// Because Unmarshal uses the reflect package, it can only assign\n// to exported (upper case) fields. Unmarshal uses a case-sensitive\n// comparison to match XML element names to tag values and struct\n// field names.\n//\n// Unmarshal maps an XML element to a struct using the following rules.\n// In the rules, the tag of a field refers to the value associated with the\n// key 'xml' in the struct field's tag (see the example above).\n//\n// * If the struct has a field of type []byte or string with tag\n// \",innerxml\", Unmarshal accumulates the raw XML nested inside the\n// element in that field. The rest of the rules still apply.\n//\n// * If the struct has a field named XMLName of type xml.Name,\n// Unmarshal records the element name in that field.\n//\n// * If the XMLName field has an associated tag of the form\n// \"name\" or \"namespace-URL name\", the XML element must have\n// the given name (and, optionally, name space) or else Unmarshal\n// returns an error.\n//\n// * If the XML element has an attribute whose name matches a\n// struct field name with an associated tag containing \",attr\" or\n// the explicit name in a struct field tag of the form \"name,attr\",\n// Unmarshal records the attribute value in that field.\n//\n// * If the XML element contains character data, that data is\n// accumulated in the first struct field that has tag \",chardata\".\n// The struct field may have type []byte or string.\n// If there is no such field, the character data is discarded.\n//\n// * If the XML element contains comments, they are accumulated in\n// the first struct field that has tag \",comment\". The struct\n// field may have type []byte or string. If there is no such\n// field, the comments are discarded.\n//\n// * If the XML element contains a sub-element whose name matches\n// the prefix of a tag formatted as \"a\" or \"a>b>c\", unmarshal\n// will descend into the XML structure looking for elements with the\n// given names, and will map the innermost elements to that struct\n// field. A tag starting with \">\" is equivalent to one starting\n// with the field name followed by \">\".\n//\n// * If the XML element contains a sub-element whose name matches\n// a struct field's XMLName tag and the struct field has no\n// explicit name tag as per the previous rule, unmarshal maps\n// the sub-element to that struct field.\n//\n// * If the XML element contains a sub-element whose name matches a\n// field without any mode flags (\",attr\", \",chardata\", etc), Unmarshal\n// maps the sub-element to that struct field.\n//\n// * If the XML element contains a sub-element that hasn't matched any\n// of the above rules and the struct has a field with tag \",any\",\n// unmarshal maps the sub-element to that struct field.\n//\n// * An anonymous struct field is handled as if the fields of its\n// value were part of the outer struct.\n//\n// * A struct field with tag \"-\" is never unmarshalled into.\n//\n// Unmarshal maps an XML element to a string or []byte by saving the\n// concatenation of that element's character data in the string or\n// []byte. The saved []byte is never nil.\n//\n// Unmarshal maps an attribute value to a string or []byte by saving\n// the value in the string or slice.\n//\n// Unmarshal maps an XML element to a slice by extending the length of\n// the slice and mapping the element to the newly created value.\n//\n// Unmarshal maps an XML element or attribute value to a bool by\n// setting it to the boolean value represented by the string.\n//\n// Unmarshal maps an XML element or attribute value to an integer or\n// floating-point field by setting the field to the result of\n// interpreting the string value in decimal. There is no check for\n// overflow.\n//\n// Unmarshal maps an XML element to an xml.Name by recording the\n// element name.\n//\n// Unmarshal maps an XML element to a pointer by setting the pointer\n// to a freshly allocated value and then mapping the element to that value.\n//\nfunc Unmarshal(data []byte, v interface{}) error {\n\treturn NewDecoder(bytes.NewReader(data)).Decode(v)\n}\n\n// Decode works like xml.Unmarshal, except it reads the decoder\n// stream to find the start element.\nfunc (d *Decoder) Decode(v interface{}) error {\n\treturn d.DecodeElement(v, nil)\n}\n\n// DecodeElement works like xml.Unmarshal except that it takes\n// a pointer to the start XML element to decode into v.\n// It is useful when a client reads some raw XML tokens itself\n// but also wants to defer to Unmarshal for some elements.\nfunc (d *Decoder) DecodeElement(v interface{}, start *StartElement) error {\n\tval := reflect.ValueOf(v)\n\tif val.Kind() != reflect.Ptr {\n\t\treturn errors.New(\"non-pointer passed to Unmarshal\")\n\t}\n\treturn d.unmarshal(val.Elem(), start)\n}\n\n// An UnmarshalError represents an error in the unmarshalling process.\ntype UnmarshalError string\n\nfunc (e UnmarshalError) Error() string { return string(e) }\n\n// Unmarshaler is the interface implemented by objects that can unmarshal\n// an XML element description of themselves.\n//\n// UnmarshalXML decodes a single XML element\n// beginning with the given start element.\n// If it returns an error, the outer call to Unmarshal stops and\n// returns that error.\n// UnmarshalXML must consume exactly one XML element.\n// One common implementation strategy is to unmarshal into\n// a separate value with a layout matching the expected XML\n// using d.DecodeElement, and then to copy the data from\n// that value into the receiver.\n// Another common strategy is to use d.Token to process the\n// XML object one token at a time.\n// UnmarshalXML may not use d.RawToken.\ntype Unmarshaler interface {\n\tUnmarshalXML(d *Decoder, start StartElement) error\n}\n\n// UnmarshalerAttr is the interface implemented by objects that can unmarshal\n// an XML attribute description of themselves.\n//\n// UnmarshalXMLAttr decodes a single XML attribute.\n// If it returns an error, the outer call to Unmarshal stops and\n// returns that error.\n// UnmarshalXMLAttr is used only for struct fields with the\n// \"attr\" option in the field tag.\ntype UnmarshalerAttr interface {\n\tUnmarshalXMLAttr(attr Attr) error\n}\n\n// receiverType returns the receiver type to use in an expression like \"%s.MethodName\".\nfunc receiverType(val interface{}) string {\n\tt := reflect.TypeOf(val)\n\tif t.Name() != \"\" {\n\t\treturn t.String()\n\t}\n\treturn \"(\" + t.String() + \")\"\n}\n\n// unmarshalInterface unmarshals a single XML element into val.\n// start is the opening tag of the element.\nfunc (p *Decoder) unmarshalInterface(val Unmarshaler, start *StartElement) error {\n\t// Record that decoder must stop at end tag corresponding to start.\n\tp.pushEOF()\n\n\tp.unmarshalDepth++\n\terr := val.UnmarshalXML(p, *start)\n\tp.unmarshalDepth--\n\tif err != nil {\n\t\tp.popEOF()\n\t\treturn err\n\t}\n\n\tif !p.popEOF() {\n\t\treturn fmt.Errorf(\"xml: %s.UnmarshalXML did not consume entire <%s> element\", receiverType(val), start.Name.Local)\n\t}\n\n\treturn nil\n}\n\n// unmarshalTextInterface unmarshals a single XML element into val.\n// The chardata contained in the element (but not its children)\n// is passed to the text unmarshaler.\nfunc (p *Decoder) unmarshalTextInterface(val encoding.TextUnmarshaler, start *StartElement) error {\n\tvar buf []byte\n\tdepth := 1\n\tfor depth > 0 {\n\t\tt, err := p.Token()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tswitch t := t.(type) {\n\t\tcase CharData:\n\t\t\tif depth == 1 {\n\t\t\t\tbuf = append(buf, t...)\n\t\t\t}\n\t\tcase StartElement:\n\t\t\tdepth++\n\t\tcase EndElement:\n\t\t\tdepth--\n\t\t}\n\t}\n\treturn val.UnmarshalText(buf)\n}\n\n// unmarshalAttr unmarshals a single XML attribute into val.\nfunc (p *Decoder) unmarshalAttr(val reflect.Value, attr Attr) error {\n\tif val.Kind() == reflect.Ptr {\n\t\tif val.IsNil() {\n\t\t\tval.Set(reflect.New(val.Type().Elem()))\n\t\t}\n\t\tval = val.Elem()\n\t}\n\n\tif val.CanInterface() && val.Type().Implements(unmarshalerAttrType) {\n\t\t// This is an unmarshaler with a non-pointer receiver,\n\t\t// so it's likely to be incorrect, but we do what we're told.\n\t\treturn val.Interface().(UnmarshalerAttr).UnmarshalXMLAttr(attr)\n\t}\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(unmarshalerAttrType) {\n\t\t\treturn pv.Interface().(UnmarshalerAttr).UnmarshalXMLAttr(attr)\n\t\t}\n\t}\n\n\t// Not an UnmarshalerAttr; try encoding.TextUnmarshaler.\n\tif val.CanInterface() && val.Type().Implements(textUnmarshalerType) {\n\t\t// This is an unmarshaler with a non-pointer receiver,\n\t\t// so it's likely to be incorrect, but we do what we're told.\n\t\treturn val.Interface().(encoding.TextUnmarshaler).UnmarshalText([]byte(attr.Value))\n\t}\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(textUnmarshalerType) {\n\t\t\treturn pv.Interface().(encoding.TextUnmarshaler).UnmarshalText([]byte(attr.Value))\n\t\t}\n\t}\n\n\tcopyValue(val, []byte(attr.Value))\n\treturn nil\n}\n\nvar (\n\tunmarshalerType = reflect.TypeOf((*Unmarshaler)(nil)).Elem()\n\tunmarshalerAttrType = reflect.TypeOf((*UnmarshalerAttr)(nil)).Elem()\n\ttextUnmarshalerType = reflect.TypeOf((*encoding.TextUnmarshaler)(nil)).Elem()\n)\n\n// Unmarshal a single XML element into val.\nfunc (p *Decoder) unmarshal(val reflect.Value, start *StartElement) error {\n\t// Find start element if we need it.\n\tif start == nil {\n\t\tfor {\n\t\t\ttok, err := p.Token()\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif t, ok := tok.(StartElement); ok {\n\t\t\t\tstart = &t\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\t// Load value from interface, but only if the result will be\n\t// usefully addressable.\n\tif val.Kind() == reflect.Interface && !val.IsNil() {\n\t\te := val.Elem()\n\t\tif e.Kind() == reflect.Ptr && !e.IsNil() {\n\t\t\tval = e\n\t\t}\n\t}\n\n\tif val.Kind() == reflect.Ptr {\n\t\tif val.IsNil() {\n\t\t\tval.Set(reflect.New(val.Type().Elem()))\n\t\t}\n\t\tval = val.Elem()\n\t}\n\n\tif val.CanInterface() && val.Type().Implements(unmarshalerType) {\n\t\t// This is an unmarshaler with a non-pointer receiver,\n\t\t// so it's likely to be incorrect, but we do what we're told.\n\t\treturn p.unmarshalInterface(val.Interface().(Unmarshaler), start)\n\t}\n\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(unmarshalerType) {\n\t\t\treturn p.unmarshalInterface(pv.Interface().(Unmarshaler), start)\n\t\t}\n\t}\n\n\tif val.CanInterface() && val.Type().Implements(textUnmarshalerType) {\n\t\treturn p.unmarshalTextInterface(val.Interface().(encoding.TextUnmarshaler), start)\n\t}\n\n\tif val.CanAddr() {\n\t\tpv := val.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(textUnmarshalerType) {\n\t\t\treturn p.unmarshalTextInterface(pv.Interface().(encoding.TextUnmarshaler), start)\n\t\t}\n\t}\n\n\tvar (\n\t\tdata []byte\n\t\tsaveData reflect.Value\n\t\tcomment []byte\n\t\tsaveComment reflect.Value\n\t\tsaveXML reflect.Value\n\t\tsaveXMLIndex int\n\t\tsaveXMLData []byte\n\t\tsaveAny reflect.Value\n\t\tsv reflect.Value\n\t\ttinfo *typeInfo\n\t\terr error\n\t)\n\n\tswitch v := val; v.Kind() {\n\tdefault:\n\t\treturn errors.New(\"unknown type \" + v.Type().String())\n\n\tcase reflect.Interface:\n\t\t// TODO: For now, simply ignore the field. In the near\n\t\t// future we may choose to unmarshal the start\n\t\t// element on it, if not nil.\n\t\treturn p.Skip()\n\n\tcase reflect.Slice:\n\t\ttyp := v.Type()\n\t\tif typ.Elem().Kind() == reflect.Uint8 {\n\t\t\t// []byte\n\t\t\tsaveData = v\n\t\t\tbreak\n\t\t}\n\n\t\t// Slice of element values.\n\t\t// Grow slice.\n\t\tn := v.Len()\n\t\tif n >= v.Cap() {\n\t\t\tncap := 2 * n\n\t\t\tif ncap < 4 {\n\t\t\t\tncap = 4\n\t\t\t}\n\t\t\tnew := reflect.MakeSlice(typ, n, ncap)\n\t\t\treflect.Copy(new, v)\n\t\t\tv.Set(new)\n\t\t}\n\t\tv.SetLen(n + 1)\n\n\t\t// Recur to read element into slice.\n\t\tif err := p.unmarshal(v.Index(n), start); err != nil {\n\t\t\tv.SetLen(n)\n\t\t\treturn err\n\t\t}\n\t\treturn nil\n\n\tcase reflect.Bool, reflect.Float32, reflect.Float64, reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr, reflect.String:\n\t\tsaveData = v\n\n\tcase reflect.Struct:\n\t\ttyp := v.Type()\n\t\tif typ == nameType {\n\t\t\tv.Set(reflect.ValueOf(start.Name))\n\t\t\tbreak\n\t\t}\n\n\t\tsv = v\n\t\ttinfo, err = getTypeInfo(typ)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Validate and assign element name.\n\t\tif tinfo.xmlname != nil {\n\t\t\tfinfo := tinfo.xmlname\n\t\t\tif finfo.name != \"\" && finfo.name != start.Name.Local {\n\t\t\t\treturn UnmarshalError(\"expected element type <\" + finfo.name + \"> but have <\" + start.Name.Local + \">\")\n\t\t\t}\n\t\t\tif finfo.xmlns != \"\" && finfo.xmlns != start.Name.Space {\n\t\t\t\te := \"expected element <\" + finfo.name + \"> in name space \" + finfo.xmlns + \" but have \"\n\t\t\t\tif start.Name.Space == \"\" {\n\t\t\t\t\te += \"no name space\"\n\t\t\t\t} else {\n\t\t\t\t\te += start.Name.Space\n\t\t\t\t}\n\t\t\t\treturn UnmarshalError(e)\n\t\t\t}\n\t\t\tfv := finfo.value(sv)\n\t\t\tif _, ok := fv.Interface().(Name); ok {\n\t\t\t\tfv.Set(reflect.ValueOf(start.Name))\n\t\t\t}\n\t\t}\n\n\t\t// Assign attributes.\n\t\t// Also, determine whether we need to save character data or comments.\n\t\tfor i := range tinfo.fields {\n\t\t\tfinfo := &tinfo.fields[i]\n\t\t\tswitch finfo.flags & fMode {\n\t\t\tcase fAttr:\n\t\t\t\tstrv := finfo.value(sv)\n\t\t\t\t// Look for attribute.\n\t\t\t\tfor _, a := range start.Attr {\n\t\t\t\t\tif a.Name.Local == finfo.name && (finfo.xmlns == \"\" || finfo.xmlns == a.Name.Space) {\n\t\t\t\t\t\tif err := p.unmarshalAttr(strv, a); err != nil {\n\t\t\t\t\t\t\treturn err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase fCharData:\n\t\t\t\tif !saveData.IsValid() {\n\t\t\t\t\tsaveData = finfo.value(sv)\n\t\t\t\t}\n\n\t\t\tcase fComment:\n\t\t\t\tif !saveComment.IsValid() {\n\t\t\t\t\tsaveComment = finfo.value(sv)\n\t\t\t\t}\n\n\t\t\tcase fAny, fAny | fElement:\n\t\t\t\tif !saveAny.IsValid() {\n\t\t\t\t\tsaveAny = finfo.value(sv)\n\t\t\t\t}\n\n\t\t\tcase fInnerXml:\n\t\t\t\tif !saveXML.IsValid() {\n\t\t\t\t\tsaveXML = finfo.value(sv)\n\t\t\t\t\tif p.saved == nil {\n\t\t\t\t\t\tsaveXMLIndex = 0\n\t\t\t\t\t\tp.saved = new(bytes.Buffer)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsaveXMLIndex = p.savedOffset()\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Find end element.\n\t// Process sub-elements along the way.\nLoop:\n\tfor {\n\t\tvar savedOffset int\n\t\tif saveXML.IsValid() {\n\t\t\tsavedOffset = p.savedOffset()\n\t\t}\n\t\ttok, err := p.Token()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tswitch t := tok.(type) {\n\t\tcase StartElement:\n\t\t\tconsumed := false\n\t\t\tif sv.IsValid() {\n\t\t\t\tconsumed, err = p.unmarshalPath(tinfo, sv, nil, &t)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tif !consumed && saveAny.IsValid() {\n\t\t\t\t\tconsumed = true\n\t\t\t\t\tif err := p.unmarshal(saveAny, &t); err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !consumed {\n\t\t\t\tif err := p.Skip(); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase EndElement:\n\t\t\tif saveXML.IsValid() {\n\t\t\t\tsaveXMLData = p.saved.Bytes()[saveXMLIndex:savedOffset]\n\t\t\t\tif saveXMLIndex == 0 {\n\t\t\t\t\tp.saved = nil\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak Loop\n\n\t\tcase CharData:\n\t\t\tif saveData.IsValid() {\n\t\t\t\tdata = append(data, t...)\n\t\t\t}\n\n\t\tcase Comment:\n\t\t\tif saveComment.IsValid() {\n\t\t\t\tcomment = append(comment, t...)\n\t\t\t}\n\t\t}\n\t}\n\n\tif saveData.IsValid() && saveData.CanInterface() && saveData.Type().Implements(textUnmarshalerType) {\n\t\tif err := saveData.Interface().(encoding.TextUnmarshaler).UnmarshalText(data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tsaveData = reflect.Value{}\n\t}\n\n\tif saveData.IsValid() && saveData.CanAddr() {\n\t\tpv := saveData.Addr()\n\t\tif pv.CanInterface() && pv.Type().Implements(textUnmarshalerType) {\n\t\t\tif err := pv.Interface().(encoding.TextUnmarshaler).UnmarshalText(data); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tsaveData = reflect.Value{}\n\t\t}\n\t}\n\n\tif err := copyValue(saveData, data); err != nil {\n\t\treturn err\n\t}\n\n\tswitch t := saveComment; t.Kind() {\n\tcase reflect.String:\n\t\tt.SetString(string(comment))\n\tcase reflect.Slice:\n\t\tt.Set(reflect.ValueOf(comment))\n\t}\n\n\tswitch t := saveXML; t.Kind() {\n\tcase reflect.String:\n\t\tt.SetString(string(saveXMLData))\n\tcase reflect.Slice:\n\t\tt.Set(reflect.ValueOf(saveXMLData))\n\t}\n\n\treturn nil\n}\n\nfunc copyValue(dst reflect.Value, src []byte) (err error) {\n\tdst0 := dst\n\n\tif dst.Kind() == reflect.Ptr {\n\t\tif dst.IsNil() {\n\t\t\tdst.Set(reflect.New(dst.Type().Elem()))\n\t\t}\n\t\tdst = dst.Elem()\n\t}\n\n\t// Save accumulated data.\n\tswitch dst.Kind() {\n\tcase reflect.Invalid:\n\t\t// Probably a comment.\n\tdefault:\n\t\treturn errors.New(\"cannot unmarshal into \" + dst0.Type().String())\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\titmp, err := strconv.ParseInt(string(src), 10, dst.Type().Bits())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tdst.SetInt(itmp)\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tutmp, err := strconv.ParseUint(string(src), 10, dst.Type().Bits())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tdst.SetUint(utmp)\n\tcase reflect.Float32, reflect.Float64:\n\t\tftmp, err := strconv.ParseFloat(string(src), dst.Type().Bits())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tdst.SetFloat(ftmp)\n\tcase reflect.Bool:\n\t\tvalue, err := strconv.ParseBool(strings.TrimSpace(string(src)))\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tdst.SetBool(value)\n\tcase reflect.String:\n\t\tdst.SetString(string(src))\n\tcase reflect.Slice:\n\t\tif len(src) == 0 {\n\t\t\t// non-nil to flag presence\n\t\t\tsrc = []byte{}\n\t\t}\n\t\tdst.SetBytes(src)\n\t}\n\treturn nil\n}\n\n// unmarshalPath walks down an XML structure looking for wanted\n// paths, and calls unmarshal on them.\n// The consumed result tells whether XML elements have been consumed\n// from the Decoder until start's matching end element, or if it's\n// still untouched because start is uninteresting for sv's fields.\nfunc (p *Decoder) unmarshalPath(tinfo *typeInfo, sv reflect.Value, parents []string, start *StartElement) (consumed bool, err error) {\n\trecurse := false\nLoop:\n\tfor i := range tinfo.fields {\n\t\tfinfo := &tinfo.fields[i]\n\t\tif finfo.flags&fElement == 0 || len(finfo.parents) < len(parents) || finfo.xmlns != \"\" && finfo.xmlns != start.Name.Space {\n\t\t\tcontinue\n\t\t}\n\t\tfor j := range parents {\n\t\t\tif parents[j] != finfo.parents[j] {\n\t\t\t\tcontinue Loop\n\t\t\t}\n\t\t}\n\t\tif len(finfo.parents) == len(parents) && finfo.name == start.Name.Local {\n\t\t\t// It's a perfect match, unmarshal the field.\n\t\t\treturn true, p.unmarshal(finfo.value(sv), start)\n\t\t}\n\t\tif len(finfo.parents) > len(parents) && finfo.parents[len(parents)] == start.Name.Local {\n\t\t\t// It's a prefix for the field. Break and recurse\n\t\t\t// since it's not ok for one field path to be itself\n\t\t\t// the prefix for another field path.\n\t\t\trecurse = true\n\n\t\t\t// We can reuse the same slice as long as we\n\t\t\t// don't try to append to it.\n\t\t\tparents = finfo.parents[:len(parents)+1]\n\t\t\tbreak\n\t\t}\n\t}\n\tif !recurse {\n\t\t// We have no business with this element.\n\t\treturn false, nil\n\t}\n\t// The element is not a perfect match for any field, but one\n\t// or more fields have the path to this element as a parent\n\t// prefix. Recurse and attempt to match these.\n\tfor {\n\t\tvar tok Token\n\t\ttok, err = p.Token()\n\t\tif err != nil {\n\t\t\treturn true, err\n\t\t}\n\t\tswitch t := tok.(type) {\n\t\tcase StartElement:\n\t\t\tconsumed2, err := p.unmarshalPath(tinfo, sv, parents, &t)\n\t\t\tif err != nil {\n\t\t\t\treturn true, err\n\t\t\t}\n\t\t\tif !consumed2 {\n\t\t\t\tif err := p.Skip(); err != nil {\n\t\t\t\t\treturn true, err\n\t\t\t\t}\n\t\t\t}\n\t\tcase EndElement:\n\t\t\treturn true, nil\n\t\t}\n\t}\n}\n\n// Skip reads tokens until it has consumed the end element\n// matching the most recent start element already consumed.\n// It recurs if it encounters a start element, so it can be used to\n// skip nested structures.\n// It returns nil if it finds an end element matching the start\n// element; otherwise it returns an error describing the problem.\nfunc (d *Decoder) Skip() error {\n\tfor {\n\t\ttok, err := d.Token()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tswitch tok.(type) {\n\t\tcase StartElement:\n\t\t\tif err := d.Skip(); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\tcase EndElement:\n\t\t\treturn nil\n\t\t}\n\t}\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/internal/xml/typeinfo.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage xml\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n)\n\n// typeInfo holds details for the xml representation of a type.\ntype typeInfo struct {\n\txmlname *fieldInfo\n\tfields []fieldInfo\n}\n\n// fieldInfo holds details for the xml representation of a single field.\ntype fieldInfo struct {\n\tidx []int\n\tname string\n\txmlns string\n\tflags fieldFlags\n\tparents []string\n}\n\ntype fieldFlags int\n\nconst (\n\tfElement fieldFlags = 1 << iota\n\tfAttr\n\tfCharData\n\tfInnerXml\n\tfComment\n\tfAny\n\n\tfOmitEmpty\n\n\tfMode = fElement | fAttr | fCharData | fInnerXml | fComment | fAny\n)\n\nvar tinfoMap = make(map[reflect.Type]*typeInfo)\nvar tinfoLock sync.RWMutex\n\nvar nameType = reflect.TypeOf(Name{})\n\n// getTypeInfo returns the typeInfo structure with details necessary\n// for marshalling and unmarshalling typ.\nfunc getTypeInfo(typ reflect.Type) (*typeInfo, error) {\n\ttinfoLock.RLock()\n\ttinfo, ok := tinfoMap[typ]\n\ttinfoLock.RUnlock()\n\tif ok {\n\t\treturn tinfo, nil\n\t}\n\ttinfo = &typeInfo{}\n\tif typ.Kind() == reflect.Struct && typ != nameType {\n\t\tn := typ.NumField()\n\t\tfor i := 0; i < n; i++ {\n\t\t\tf := typ.Field(i)\n\t\t\tif f.PkgPath != \"\" || f.Tag.Get(\"xml\") == \"-\" {\n\t\t\t\tcontinue // Private field\n\t\t\t}\n\n\t\t\t// For embedded structs, embed its fields.\n\t\t\tif f.Anonymous {\n\t\t\t\tt := f.Type\n\t\t\t\tif t.Kind() == reflect.Ptr {\n\t\t\t\t\tt = t.Elem()\n\t\t\t\t}\n\t\t\t\tif t.Kind() == reflect.Struct {\n\t\t\t\t\tinner, err := getTypeInfo(t)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tif tinfo.xmlname == nil {\n\t\t\t\t\t\ttinfo.xmlname = inner.xmlname\n\t\t\t\t\t}\n\t\t\t\t\tfor _, finfo := range inner.fields {\n\t\t\t\t\t\tfinfo.idx = append([]int{i}, finfo.idx...)\n\t\t\t\t\t\tif err := addFieldInfo(typ, tinfo, &finfo); err != nil {\n\t\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfinfo, err := structFieldInfo(typ, &f)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tif f.Name == \"XMLName\" {\n\t\t\t\ttinfo.xmlname = finfo\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// Add the field if it doesn't conflict with other fields.\n\t\t\tif err := addFieldInfo(typ, tinfo, finfo); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t}\n\ttinfoLock.Lock()\n\ttinfoMap[typ] = tinfo\n\ttinfoLock.Unlock()\n\treturn tinfo, nil\n}\n\n// structFieldInfo builds and returns a fieldInfo for f.\nfunc structFieldInfo(typ reflect.Type, f *reflect.StructField) (*fieldInfo, error) {\n\tfinfo := &fieldInfo{idx: f.Index}\n\n\t// Split the tag from the xml namespace if necessary.\n\ttag := f.Tag.Get(\"xml\")\n\tif i := strings.Index(tag, \" \"); i >= 0 {\n\t\tfinfo.xmlns, tag = tag[:i], tag[i+1:]\n\t}\n\n\t// Parse flags.\n\ttokens := strings.Split(tag, \",\")\n\tif len(tokens) == 1 {\n\t\tfinfo.flags = fElement\n\t} else {\n\t\ttag = tokens[0]\n\t\tfor _, flag := range tokens[1:] {\n\t\t\tswitch flag {\n\t\t\tcase \"attr\":\n\t\t\t\tfinfo.flags |= fAttr\n\t\t\tcase \"chardata\":\n\t\t\t\tfinfo.flags |= fCharData\n\t\t\tcase \"innerxml\":\n\t\t\t\tfinfo.flags |= fInnerXml\n\t\t\tcase \"comment\":\n\t\t\t\tfinfo.flags |= fComment\n\t\t\tcase \"any\":\n\t\t\t\tfinfo.flags |= fAny\n\t\t\tcase \"omitempty\":\n\t\t\t\tfinfo.flags |= fOmitEmpty\n\t\t\t}\n\t\t}\n\n\t\t// Validate the flags used.\n\t\tvalid := true\n\t\tswitch mode := finfo.flags & fMode; mode {\n\t\tcase 0:\n\t\t\tfinfo.flags |= fElement\n\t\tcase fAttr, fCharData, fInnerXml, fComment, fAny:\n\t\t\tif f.Name == \"XMLName\" || tag != \"\" && mode != fAttr {\n\t\t\t\tvalid = false\n\t\t\t}\n\t\tdefault:\n\t\t\t// This will also catch multiple modes in a single field.\n\t\t\tvalid = false\n\t\t}\n\t\tif finfo.flags&fMode == fAny {\n\t\t\tfinfo.flags |= fElement\n\t\t}\n\t\tif finfo.flags&fOmitEmpty != 0 && finfo.flags&(fElement|fAttr) == 0 {\n\t\t\tvalid = false\n\t\t}\n\t\tif !valid {\n\t\t\treturn nil, fmt.Errorf(\"xml: invalid tag in field %s of type %s: %q\",\n\t\t\t\tf.Name, typ, f.Tag.Get(\"xml\"))\n\t\t}\n\t}\n\n\t// Use of xmlns without a name is not allowed.\n\tif finfo.xmlns != \"\" && tag == \"\" {\n\t\treturn nil, fmt.Errorf(\"xml: namespace without name in field %s of type %s: %q\",\n\t\t\tf.Name, typ, f.Tag.Get(\"xml\"))\n\t}\n\n\tif f.Name == \"XMLName\" {\n\t\t// The XMLName field records the XML element name. Don't\n\t\t// process it as usual because its name should default to\n\t\t// empty rather than to the field name.\n\t\tfinfo.name = tag\n\t\treturn finfo, nil\n\t}\n\n\tif tag == \"\" {\n\t\t// If the name part of the tag is completely empty, get\n\t\t// default from XMLName of underlying struct if feasible,\n\t\t// or field name otherwise.\n\t\tif xmlname := lookupXMLName(f.Type); xmlname != nil {\n\t\t\tfinfo.xmlns, finfo.name = xmlname.xmlns, xmlname.name\n\t\t} else {\n\t\t\tfinfo.name = f.Name\n\t\t}\n\t\treturn finfo, nil\n\t}\n\n\tif finfo.xmlns == \"\" && finfo.flags&fAttr == 0 {\n\t\t// If it's an element no namespace specified, get the default\n\t\t// from the XMLName of enclosing struct if possible.\n\t\tif xmlname := lookupXMLName(typ); xmlname != nil {\n\t\t\tfinfo.xmlns = xmlname.xmlns\n\t\t}\n\t}\n\n\t// Prepare field name and parents.\n\tparents := strings.Split(tag, \">\")\n\tif parents[0] == \"\" {\n\t\tparents[0] = f.Name\n\t}\n\tif parents[len(parents)-1] == \"\" {\n\t\treturn nil, fmt.Errorf(\"xml: trailing '>' in field %s of type %s\", f.Name, typ)\n\t}\n\tfinfo.name = parents[len(parents)-1]\n\tif len(parents) > 1 {\n\t\tif (finfo.flags & fElement) == 0 {\n\t\t\treturn nil, fmt.Errorf(\"xml: %s chain not valid with %s flag\", tag, strings.Join(tokens[1:], \",\"))\n\t\t}\n\t\tfinfo.parents = parents[:len(parents)-1]\n\t}\n\n\t// If the field type has an XMLName field, the names must match\n\t// so that the behavior of both marshalling and unmarshalling\n\t// is straightforward and unambiguous.\n\tif finfo.flags&fElement != 0 {\n\t\tftyp := f.Type\n\t\txmlname := lookupXMLName(ftyp)\n\t\tif xmlname != nil && xmlname.name != finfo.name {\n\t\t\treturn nil, fmt.Errorf(\"xml: name %q in tag of %s.%s conflicts with name %q in %s.XMLName\",\n\t\t\t\tfinfo.name, typ, f.Name, xmlname.name, ftyp)\n\t\t}\n\t}\n\treturn finfo, nil\n}\n\n// lookupXMLName returns the fieldInfo for typ's XMLName field\n// in case it exists and has a valid xml field tag, otherwise\n// it returns nil.\nfunc lookupXMLName(typ reflect.Type) (xmlname *fieldInfo) {\n\tfor typ.Kind() == reflect.Ptr {\n\t\ttyp = typ.Elem()\n\t}\n\tif typ.Kind() != reflect.Struct {\n\t\treturn nil\n\t}\n\tfor i, n := 0, typ.NumField(); i < n; i++ {\n\t\tf := typ.Field(i)\n\t\tif f.Name != \"XMLName\" {\n\t\t\tcontinue\n\t\t}\n\t\tfinfo, err := structFieldInfo(typ, &f)\n\t\tif finfo.name != \"\" && err == nil {\n\t\t\treturn finfo\n\t\t}\n\t\t// Also consider errors as a non-existent field tag\n\t\t// and let getTypeInfo itself report the error.\n\t\tbreak\n\t}\n\treturn nil\n}\n\nfunc min(a, b int) int {\n\tif a <= b {\n\t\treturn a\n\t}\n\treturn b\n}\n\n// addFieldInfo adds finfo to tinfo.fields if there are no\n// conflicts, or if conflicts arise from previous fields that were\n// obtained from deeper embedded structures than finfo. In the latter\n// case, the conflicting entries are dropped.\n// A conflict occurs when the path (parent + name) to a field is\n// itself a prefix of another path, or when two paths match exactly.\n// It is okay for field paths to share a common, shorter prefix.\nfunc addFieldInfo(typ reflect.Type, tinfo *typeInfo, newf *fieldInfo) error {\n\tvar conflicts []int\nLoop:\n\t// First, figure all conflicts. Most working code will have none.\n\tfor i := range tinfo.fields {\n\t\toldf := &tinfo.fields[i]\n\t\tif oldf.flags&fMode != newf.flags&fMode {\n\t\t\tcontinue\n\t\t}\n\t\tif oldf.xmlns != \"\" && newf.xmlns != \"\" && oldf.xmlns != newf.xmlns {\n\t\t\tcontinue\n\t\t}\n\t\tminl := min(len(newf.parents), len(oldf.parents))\n\t\tfor p := 0; p < minl; p++ {\n\t\t\tif oldf.parents[p] != newf.parents[p] {\n\t\t\t\tcontinue Loop\n\t\t\t}\n\t\t}\n\t\tif len(oldf.parents) > len(newf.parents) {\n\t\t\tif oldf.parents[len(newf.parents)] == newf.name {\n\t\t\t\tconflicts = append(conflicts, i)\n\t\t\t}\n\t\t} else if len(oldf.parents) < len(newf.parents) {\n\t\t\tif newf.parents[len(oldf.parents)] == oldf.name {\n\t\t\t\tconflicts = append(conflicts, i)\n\t\t\t}\n\t\t} else {\n\t\t\tif newf.name == oldf.name {\n\t\t\t\tconflicts = append(conflicts, i)\n\t\t\t}\n\t\t}\n\t}\n\t// Without conflicts, add the new field and return.\n\tif conflicts == nil {\n\t\ttinfo.fields = append(tinfo.fields, *newf)\n\t\treturn nil\n\t}\n\n\t// If any conflict is shallower, ignore the new field.\n\t// This matches the Go field resolution on embedding.\n\tfor _, i := range conflicts {\n\t\tif len(tinfo.fields[i].idx) < len(newf.idx) {\n\t\t\treturn nil\n\t\t}\n\t}\n\n\t// Otherwise, if any of them is at the same depth level, it's an error.\n\tfor _, i := range conflicts {\n\t\toldf := &tinfo.fields[i]\n\t\tif len(oldf.idx) == len(newf.idx) {\n\t\t\tf1 := typ.FieldByIndex(oldf.idx)\n\t\t\tf2 := typ.FieldByIndex(newf.idx)\n\t\t\treturn &TagPathError{typ, f1.Name, f1.Tag.Get(\"xml\"), f2.Name, f2.Tag.Get(\"xml\")}\n\t\t}\n\t}\n\n\t// Otherwise, the new field is shallower, and thus takes precedence,\n\t// so drop the conflicting fields from tinfo and append the new one.\n\tfor c := len(conflicts) - 1; c >= 0; c-- {\n\t\ti := conflicts[c]\n\t\tcopy(tinfo.fields[i:], tinfo.fields[i+1:])\n\t\ttinfo.fields = tinfo.fields[:len(tinfo.fields)-1]\n\t}\n\ttinfo.fields = append(tinfo.fields, *newf)\n\treturn nil\n}\n\n// A TagPathError represents an error in the unmarshalling process\n// caused by the use of field tags with conflicting paths.\ntype TagPathError struct {\n\tStruct reflect.Type\n\tField1, Tag1 string\n\tField2, Tag2 string\n}\n\nfunc (e *TagPathError) Error() string {\n\treturn fmt.Sprintf(\"%s field %q with tag %q conflicts with field %q with tag %q\", e.Struct, e.Field1, e.Tag1, e.Field2, e.Tag2)\n}\n\n// value returns v's field value corresponding to finfo.\n// It's equivalent to v.FieldByIndex(finfo.idx), but initializes\n// and dereferences pointers as necessary.\nfunc (finfo *fieldInfo) value(v reflect.Value) reflect.Value {\n\tfor i, x := range finfo.idx {\n\t\tif i > 0 {\n\t\t\tt := v.Type()\n\t\t\tif t.Kind() == reflect.Ptr && t.Elem().Kind() == reflect.Struct {\n\t\t\t\tif v.IsNil() {\n\t\t\t\t\tv.Set(reflect.New(v.Type().Elem()))\n\t\t\t\t}\n\t\t\t\tv = v.Elem()\n\t\t\t}\n\t\t}\n\t\tv = v.Field(x)\n\t}\n\treturn v\n}\n" }, { "path": "vendor/golang.org/x/net/webdav/internal/xml/xml.go", "content": "// Copyright 2009 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package xml implements a simple XML 1.0 parser that\n// understands XML name spaces.\npackage xml\n\n// References:\n// Annotated XML spec: http://www.xml.com/axml/testaxml.htm\n// XML name spaces: http://www.w3.org/TR/REC-xml-names/\n\n// TODO(rsc):\n//\tTest error handling.\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode\"\n\t\"unicode/utf8\"\n)\n\n// A SyntaxError represents a syntax error in the XML input stream.\ntype SyntaxError struct {\n\tMsg string\n\tLine int\n}\n\nfunc (e *SyntaxError) Error() string {\n\treturn \"XML syntax error on line \" + strconv.Itoa(e.Line) + \": \" + e.Msg\n}\n\n// A Name represents an XML name (Local) annotated with a name space\n// identifier (Space). In tokens returned by Decoder.Token, the Space\n// identifier is given as a canonical URL, not the short prefix used in\n// the document being parsed.\n//\n// As a special case, XML namespace declarations will use the literal\n// string \"xmlns\" for the Space field instead of the fully resolved URL.\n// See Encoder.EncodeToken for more information on namespace encoding\n// behaviour.\ntype Name struct {\n\tSpace, Local string\n}\n\n// isNamespace reports whether the name is a namespace-defining name.\nfunc (name Name) isNamespace() bool {\n\treturn name.Local == \"xmlns\" || name.Space == \"xmlns\"\n}\n\n// An Attr represents an attribute in an XML element (Name=Value).\ntype Attr struct {\n\tName Name\n\tValue string\n}\n\n// A Token is an interface holding one of the token types:\n// StartElement, EndElement, CharData, Comment, ProcInst, or Directive.\ntype Token interface{}\n\n// A StartElement represents an XML start element.\ntype StartElement struct {\n\tName Name\n\tAttr []Attr\n}\n\nfunc (e StartElement) Copy() StartElement {\n\tattrs := make([]Attr, len(e.Attr))\n\tcopy(attrs, e.Attr)\n\te.Attr = attrs\n\treturn e\n}\n\n// End returns the corresponding XML end element.\nfunc (e StartElement) End() EndElement {\n\treturn EndElement{e.Name}\n}\n\n// setDefaultNamespace sets the namespace of the element\n// as the default for all elements contained within it.\nfunc (e *StartElement) setDefaultNamespace() {\n\tif e.Name.Space == \"\" {\n\t\t// If there's no namespace on the element, don't\n\t\t// set the default. Strictly speaking this might be wrong, as\n\t\t// we can't tell if the element had no namespace set\n\t\t// or was just using the default namespace.\n\t\treturn\n\t}\n\t// Don't add a default name space if there's already one set.\n\tfor _, attr := range e.Attr {\n\t\tif attr.Name.Space == \"\" && attr.Name.Local == \"xmlns\" {\n\t\t\treturn\n\t\t}\n\t}\n\te.Attr = append(e.Attr, Attr{\n\t\tName: Name{\n\t\t\tLocal: \"xmlns\",\n\t\t},\n\t\tValue: e.Name.Space,\n\t})\n}\n\n// An EndElement represents an XML end element.\ntype EndElement struct {\n\tName Name\n}\n\n// A CharData represents XML character data (raw text),\n// in which XML escape sequences have been replaced by\n// the characters they represent.\ntype CharData []byte\n\nfunc makeCopy(b []byte) []byte {\n\tb1 := make([]byte, len(b))\n\tcopy(b1, b)\n\treturn b1\n}\n\nfunc (c CharData) Copy() CharData { return CharData(makeCopy(c)) }\n\n// A Comment represents an XML comment of the form .\n// The bytes do not include the comment markers.\ntype Comment []byte\n\nfunc (c Comment) Copy() Comment { return Comment(makeCopy(c)) }\n\n// A ProcInst represents an XML processing instruction of the form \ntype ProcInst struct {\n\tTarget string\n\tInst []byte\n}\n\nfunc (p ProcInst) Copy() ProcInst {\n\tp.Inst = makeCopy(p.Inst)\n\treturn p\n}\n\n// A Directive represents an XML directive of the form .\n// The bytes do not include the markers.\ntype Directive []byte\n\nfunc (d Directive) Copy() Directive { return Directive(makeCopy(d)) }\n\n// CopyToken returns a copy of a Token.\nfunc CopyToken(t Token) Token {\n\tswitch v := t.(type) {\n\tcase CharData:\n\t\treturn v.Copy()\n\tcase Comment:\n\t\treturn v.Copy()\n\tcase Directive:\n\t\treturn v.Copy()\n\tcase ProcInst:\n\t\treturn v.Copy()\n\tcase StartElement:\n\t\treturn v.Copy()\n\t}\n\treturn t\n}\n\n// A Decoder represents an XML parser reading a particular input stream.\n// The parser assumes that its input is encoded in UTF-8.\ntype Decoder struct {\n\t// Strict defaults to true, enforcing the requirements\n\t// of the XML specification.\n\t// If set to false, the parser allows input containing common\n\t// mistakes:\n\t//\t* If an element is missing an end tag, the parser invents\n\t//\t end tags as necessary to keep the return values from Token\n\t//\t properly balanced.\n\t//\t* In attribute values and character data, unknown or malformed\n\t//\t character entities (sequences beginning with &) are left alone.\n\t//\n\t// Setting:\n\t//\n\t//\td.Strict = false;\n\t//\td.AutoClose = HTMLAutoClose;\n\t//\td.Entity = HTMLEntity\n\t//\n\t// creates a parser that can handle typical HTML.\n\t//\n\t// Strict mode does not enforce the requirements of the XML name spaces TR.\n\t// In particular it does not reject name space tags using undefined prefixes.\n\t// Such tags are recorded with the unknown prefix as the name space URL.\n\tStrict bool\n\n\t// When Strict == false, AutoClose indicates a set of elements to\n\t// consider closed immediately after they are opened, regardless\n\t// of whether an end element is present.\n\tAutoClose []string\n\n\t// Entity can be used to map non-standard entity names to string replacements.\n\t// The parser behaves as if these standard mappings are present in the map,\n\t// regardless of the actual map content:\n\t//\n\t//\t\"lt\": \"<\",\n\t//\t\"gt\": \">\",\n\t//\t\"amp\": \"&\",\n\t//\t\"apos\": \"'\",\n\t//\t\"quot\": `\"`,\n\tEntity map[string]string\n\n\t// CharsetReader, if non-nil, defines a function to generate\n\t// charset-conversion readers, converting from the provided\n\t// non-UTF-8 charset into UTF-8. If CharsetReader is nil or\n\t// returns an error, parsing stops with an error. One of the\n\t// the CharsetReader's result values must be non-nil.\n\tCharsetReader func(charset string, input io.Reader) (io.Reader, error)\n\n\t// DefaultSpace sets the default name space used for unadorned tags,\n\t// as if the entire XML stream were wrapped in an element containing\n\t// the attribute xmlns=\"DefaultSpace\".\n\tDefaultSpace string\n\n\tr io.ByteReader\n\tbuf bytes.Buffer\n\tsaved *bytes.Buffer\n\tstk *stack\n\tfree *stack\n\tneedClose bool\n\ttoClose Name\n\tnextToken Token\n\tnextByte int\n\tns map[string]string\n\terr error\n\tline int\n\toffset int64\n\tunmarshalDepth int\n}\n\n// NewDecoder creates a new XML parser reading from r.\n// If r does not implement io.ByteReader, NewDecoder will\n// do its own buffering.\nfunc NewDecoder(r io.Reader) *Decoder {\n\td := &Decoder{\n\t\tns: make(map[string]string),\n\t\tnextByte: -1,\n\t\tline: 1,\n\t\tStrict: true,\n\t}\n\td.switchToReader(r)\n\treturn d\n}\n\n// Token returns the next XML token in the input stream.\n// At the end of the input stream, Token returns nil, io.EOF.\n//\n// Slices of bytes in the returned token data refer to the\n// parser's internal buffer and remain valid only until the next\n// call to Token. To acquire a copy of the bytes, call CopyToken\n// or the token's Copy method.\n//\n// Token expands self-closing elements such as
\n// into separate start and end elements returned by successive calls.\n//\n// Token guarantees that the StartElement and EndElement\n// tokens it returns are properly nested and matched:\n// if Token encounters an unexpected end element,\n// it will return an error.\n//\n// Token implements XML name spaces as described by\n// http://www.w3.org/TR/REC-xml-names/. Each of the\n// Name structures contained in the Token has the Space\n// set to the URL identifying its name space when known.\n// If Token encounters an unrecognized name space prefix,\n// it uses the prefix as the Space rather than report an error.\nfunc (d *Decoder) Token() (t Token, err error) {\n\tif d.stk != nil && d.stk.kind == stkEOF {\n\t\terr = io.EOF\n\t\treturn\n\t}\n\tif d.nextToken != nil {\n\t\tt = d.nextToken\n\t\td.nextToken = nil\n\t} else if t, err = d.rawToken(); err != nil {\n\t\treturn\n\t}\n\n\tif !d.Strict {\n\t\tif t1, ok := d.autoClose(t); ok {\n\t\t\td.nextToken = t\n\t\t\tt = t1\n\t\t}\n\t}\n\tswitch t1 := t.(type) {\n\tcase StartElement:\n\t\t// In XML name spaces, the translations listed in the\n\t\t// attributes apply to the element name and\n\t\t// to the other attribute names, so process\n\t\t// the translations first.\n\t\tfor _, a := range t1.Attr {\n\t\t\tif a.Name.Space == \"xmlns\" {\n\t\t\t\tv, ok := d.ns[a.Name.Local]\n\t\t\t\td.pushNs(a.Name.Local, v, ok)\n\t\t\t\td.ns[a.Name.Local] = a.Value\n\t\t\t}\n\t\t\tif a.Name.Space == \"\" && a.Name.Local == \"xmlns\" {\n\t\t\t\t// Default space for untagged names\n\t\t\t\tv, ok := d.ns[\"\"]\n\t\t\t\td.pushNs(\"\", v, ok)\n\t\t\t\td.ns[\"\"] = a.Value\n\t\t\t}\n\t\t}\n\n\t\td.translate(&t1.Name, true)\n\t\tfor i := range t1.Attr {\n\t\t\td.translate(&t1.Attr[i].Name, false)\n\t\t}\n\t\td.pushElement(t1.Name)\n\t\tt = t1\n\n\tcase EndElement:\n\t\td.translate(&t1.Name, true)\n\t\tif !d.popElement(&t1) {\n\t\t\treturn nil, d.err\n\t\t}\n\t\tt = t1\n\t}\n\treturn\n}\n\nconst xmlURL = \"http://www.w3.org/XML/1998/namespace\"\n\n// Apply name space translation to name n.\n// The default name space (for Space==\"\")\n// applies only to element names, not to attribute names.\nfunc (d *Decoder) translate(n *Name, isElementName bool) {\n\tswitch {\n\tcase n.Space == \"xmlns\":\n\t\treturn\n\tcase n.Space == \"\" && !isElementName:\n\t\treturn\n\tcase n.Space == \"xml\":\n\t\tn.Space = xmlURL\n\tcase n.Space == \"\" && n.Local == \"xmlns\":\n\t\treturn\n\t}\n\tif v, ok := d.ns[n.Space]; ok {\n\t\tn.Space = v\n\t} else if n.Space == \"\" {\n\t\tn.Space = d.DefaultSpace\n\t}\n}\n\nfunc (d *Decoder) switchToReader(r io.Reader) {\n\t// Get efficient byte at a time reader.\n\t// Assume that if reader has its own\n\t// ReadByte, it's efficient enough.\n\t// Otherwise, use bufio.\n\tif rb, ok := r.(io.ByteReader); ok {\n\t\td.r = rb\n\t} else {\n\t\td.r = bufio.NewReader(r)\n\t}\n}\n\n// Parsing state - stack holds old name space translations\n// and the current set of open elements. The translations to pop when\n// ending a given tag are *below* it on the stack, which is\n// more work but forced on us by XML.\ntype stack struct {\n\tnext *stack\n\tkind int\n\tname Name\n\tok bool\n}\n\nconst (\n\tstkStart = iota\n\tstkNs\n\tstkEOF\n)\n\nfunc (d *Decoder) push(kind int) *stack {\n\ts := d.free\n\tif s != nil {\n\t\td.free = s.next\n\t} else {\n\t\ts = new(stack)\n\t}\n\ts.next = d.stk\n\ts.kind = kind\n\td.stk = s\n\treturn s\n}\n\nfunc (d *Decoder) pop() *stack {\n\ts := d.stk\n\tif s != nil {\n\t\td.stk = s.next\n\t\ts.next = d.free\n\t\td.free = s\n\t}\n\treturn s\n}\n\n// Record that after the current element is finished\n// (that element is already pushed on the stack)\n// Token should return EOF until popEOF is called.\nfunc (d *Decoder) pushEOF() {\n\t// Walk down stack to find Start.\n\t// It might not be the top, because there might be stkNs\n\t// entries above it.\n\tstart := d.stk\n\tfor start.kind != stkStart {\n\t\tstart = start.next\n\t}\n\t// The stkNs entries below a start are associated with that\n\t// element too; skip over them.\n\tfor start.next != nil && start.next.kind == stkNs {\n\t\tstart = start.next\n\t}\n\ts := d.free\n\tif s != nil {\n\t\td.free = s.next\n\t} else {\n\t\ts = new(stack)\n\t}\n\ts.kind = stkEOF\n\ts.next = start.next\n\tstart.next = s\n}\n\n// Undo a pushEOF.\n// The element must have been finished, so the EOF should be at the top of the stack.\nfunc (d *Decoder) popEOF() bool {\n\tif d.stk == nil || d.stk.kind != stkEOF {\n\t\treturn false\n\t}\n\td.pop()\n\treturn true\n}\n\n// Record that we are starting an element with the given name.\nfunc (d *Decoder) pushElement(name Name) {\n\ts := d.push(stkStart)\n\ts.name = name\n}\n\n// Record that we are changing the value of ns[local].\n// The old value is url, ok.\nfunc (d *Decoder) pushNs(local string, url string, ok bool) {\n\ts := d.push(stkNs)\n\ts.name.Local = local\n\ts.name.Space = url\n\ts.ok = ok\n}\n\n// Creates a SyntaxError with the current line number.\nfunc (d *Decoder) syntaxError(msg string) error {\n\treturn &SyntaxError{Msg: msg, Line: d.line}\n}\n\n// Record that we are ending an element with the given name.\n// The name must match the record at the top of the stack,\n// which must be a pushElement record.\n// After popping the element, apply any undo records from\n// the stack to restore the name translations that existed\n// before we saw this element.\nfunc (d *Decoder) popElement(t *EndElement) bool {\n\ts := d.pop()\n\tname := t.Name\n\tswitch {\n\tcase s == nil || s.kind != stkStart:\n\t\td.err = d.syntaxError(\"unexpected end element \")\n\t\treturn false\n\tcase s.name.Local != name.Local:\n\t\tif !d.Strict {\n\t\t\td.needClose = true\n\t\t\td.toClose = t.Name\n\t\t\tt.Name = s.name\n\t\t\treturn true\n\t\t}\n\t\td.err = d.syntaxError(\"element <\" + s.name.Local + \"> closed by \")\n\t\treturn false\n\tcase s.name.Space != name.Space:\n\t\td.err = d.syntaxError(\"element <\" + s.name.Local + \"> in space \" + s.name.Space +\n\t\t\t\"closed by in space \" + name.Space)\n\t\treturn false\n\t}\n\n\t// Pop stack until a Start or EOF is on the top, undoing the\n\t// translations that were associated with the element we just closed.\n\tfor d.stk != nil && d.stk.kind != stkStart && d.stk.kind != stkEOF {\n\t\ts := d.pop()\n\t\tif s.ok {\n\t\t\td.ns[s.name.Local] = s.name.Space\n\t\t} else {\n\t\t\tdelete(d.ns, s.name.Local)\n\t\t}\n\t}\n\n\treturn true\n}\n\n// If the top element on the stack is autoclosing and\n// t is not the end tag, invent the end tag.\nfunc (d *Decoder) autoClose(t Token) (Token, bool) {\n\tif d.stk == nil || d.stk.kind != stkStart {\n\t\treturn nil, false\n\t}\n\tname := strings.ToLower(d.stk.name.Local)\n\tfor _, s := range d.AutoClose {\n\t\tif strings.ToLower(s) == name {\n\t\t\t// This one should be auto closed if t doesn't close it.\n\t\t\tet, ok := t.(EndElement)\n\t\t\tif !ok || et.Name.Local != name {\n\t\t\t\treturn EndElement{d.stk.name}, true\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\treturn nil, false\n}\n\nvar errRawToken = errors.New(\"xml: cannot use RawToken from UnmarshalXML method\")\n\n// RawToken is like Token but does not verify that\n// start and end elements match and does not translate\n// name space prefixes to their corresponding URLs.\nfunc (d *Decoder) RawToken() (Token, error) {\n\tif d.unmarshalDepth > 0 {\n\t\treturn nil, errRawToken\n\t}\n\treturn d.rawToken()\n}\n\nfunc (d *Decoder) rawToken() (Token, error) {\n\tif d.err != nil {\n\t\treturn nil, d.err\n\t}\n\tif d.needClose {\n\t\t// The last element we read was self-closing and\n\t\t// we returned just the StartElement half.\n\t\t// Return the EndElement half now.\n\t\td.needClose = false\n\t\treturn EndElement{d.toClose}, nil\n\t}\n\n\tb, ok := d.getc()\n\tif !ok {\n\t\treturn nil, d.err\n\t}\n\n\tif b != '<' {\n\t\t// Text section.\n\t\td.ungetc(b)\n\t\tdata := d.text(-1, false)\n\t\tif data == nil {\n\t\t\treturn nil, d.err\n\t\t}\n\t\treturn CharData(data), nil\n\t}\n\n\tif b, ok = d.mustgetc(); !ok {\n\t\treturn nil, d.err\n\t}\n\tswitch b {\n\tcase '/':\n\t\t// ' {\n\t\t\td.err = d.syntaxError(\"invalid characters between \")\n\t\t\treturn nil, d.err\n\t\t}\n\t\treturn EndElement{name}, nil\n\n\tcase '?':\n\t\t// ' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tb0 = b\n\t\t}\n\t\tdata := d.buf.Bytes()\n\t\tdata = data[0 : len(data)-2] // chop ?>\n\n\t\tif target == \"xml\" {\n\t\t\tcontent := string(data)\n\t\t\tver := procInst(\"version\", content)\n\t\t\tif ver != \"\" && ver != \"1.0\" {\n\t\t\t\td.err = fmt.Errorf(\"xml: unsupported version %q; only version 1.0 is supported\", ver)\n\t\t\t\treturn nil, d.err\n\t\t\t}\n\t\t\tenc := procInst(\"encoding\", content)\n\t\t\tif enc != \"\" && enc != \"utf-8\" && enc != \"UTF-8\" {\n\t\t\t\tif d.CharsetReader == nil {\n\t\t\t\t\td.err = fmt.Errorf(\"xml: encoding %q declared but Decoder.CharsetReader is nil\", enc)\n\t\t\t\t\treturn nil, d.err\n\t\t\t\t}\n\t\t\t\tnewr, err := d.CharsetReader(enc, d.r.(io.Reader))\n\t\t\t\tif err != nil {\n\t\t\t\t\td.err = fmt.Errorf(\"xml: opening charset %q: %v\", enc, err)\n\t\t\t\t\treturn nil, d.err\n\t\t\t\t}\n\t\t\t\tif newr == nil {\n\t\t\t\t\tpanic(\"CharsetReader returned a nil Reader for charset \" + enc)\n\t\t\t\t}\n\t\t\t\td.switchToReader(newr)\n\t\t\t}\n\t\t}\n\t\treturn ProcInst{target, data}, nil\n\n\tcase '!':\n\t\t// ' {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tb0, b1 = b1, b\n\t\t\t}\n\t\t\tdata := d.buf.Bytes()\n\t\t\tdata = data[0 : len(data)-3] // chop -->\n\t\t\treturn Comment(data), nil\n\n\t\tcase '[': // .\n\t\t\tdata := d.text(-1, true)\n\t\t\tif data == nil {\n\t\t\t\treturn nil, d.err\n\t\t\t}\n\t\t\treturn CharData(data), nil\n\t\t}\n\n\t\t// Probably a directive: , , etc.\n\t\t// We don't care, but accumulate for caller. Quoted angle\n\t\t// brackets do not count for nesting.\n\t\td.buf.Reset()\n\t\td.buf.WriteByte(b)\n\t\tinquote := uint8(0)\n\t\tdepth := 0\n\t\tfor {\n\t\t\tif b, ok = d.mustgetc(); !ok {\n\t\t\t\treturn nil, d.err\n\t\t\t}\n\t\t\tif inquote == 0 && b == '>' && depth == 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\tHandleB:\n\t\t\td.buf.WriteByte(b)\n\t\t\tswitch {\n\t\t\tcase b == inquote:\n\t\t\t\tinquote = 0\n\n\t\t\tcase inquote != 0:\n\t\t\t\t// in quotes, no special action\n\n\t\t\tcase b == '\\'' || b == '\"':\n\t\t\t\tinquote = b\n\n\t\t\tcase b == '>' && inquote == 0:\n\t\t\t\tdepth--\n\n\t\t\tcase b == '<' && inquote == 0:\n\t\t\t\t// Look for \n//\n// the ast.BinaryExpr(+) node is considered to enclose interval B\n// even though its [Pos()..End()) is actually only interval A.\n// This behaviour makes user interfaces more tolerant of imperfect\n// input.\n//\n// This function treats tokens as nodes, though they are not included\n// in the result. e.g. PathEnclosingInterval(\"+\") returns the\n// enclosing ast.BinaryExpr(\"x + y\").\n//\n// If start==end, the 1-char interval following start is used instead.\n//\n// The 'exact' result is true if the interval contains only path[0]\n// and perhaps some adjacent whitespace. It is false if the interval\n// overlaps multiple children of path[0], or if it contains only\n// interior whitespace of path[0].\n// In this example:\n//\n// z := x + y // add them\n// <--C--> <---E-->\n// ^\n// D\n//\n// intervals C, D and E are inexact. C is contained by the\n// z-assignment statement, because it spans three of its children (:=,\n// x, +). So too is the 1-char interval D, because it contains only\n// interior whitespace of the assignment. E is considered interior\n// whitespace of the BlockStmt containing the assignment.\n//\n// Precondition: [start, end) both lie within the same file as root.\n// TODO(adonovan): return (nil, false) in this case and remove precond.\n// Requires FileSet; see loader.tokenFileContainsPos.\n//\n// Postcondition: path is never nil; it always contains at least 'root'.\n//\nfunc PathEnclosingInterval(root *ast.File, start, end token.Pos) (path []ast.Node, exact bool) {\n\t// fmt.Printf(\"EnclosingInterval %d %d\\n\", start, end) // debugging\n\n\t// Precondition: node.[Pos..End) and adjoining whitespace contain [start, end).\n\tvar visit func(node ast.Node) bool\n\tvisit = func(node ast.Node) bool {\n\t\tpath = append(path, node)\n\n\t\tnodePos := node.Pos()\n\t\tnodeEnd := node.End()\n\n\t\t// fmt.Printf(\"visit(%T, %d, %d)\\n\", node, nodePos, nodeEnd) // debugging\n\n\t\t// Intersect [start, end) with interval of node.\n\t\tif start < nodePos {\n\t\t\tstart = nodePos\n\t\t}\n\t\tif end > nodeEnd {\n\t\t\tend = nodeEnd\n\t\t}\n\n\t\t// Find sole child that contains [start, end).\n\t\tchildren := childrenOf(node)\n\t\tl := len(children)\n\t\tfor i, child := range children {\n\t\t\t// [childPos, childEnd) is unaugmented interval of child.\n\t\t\tchildPos := child.Pos()\n\t\t\tchildEnd := child.End()\n\n\t\t\t// [augPos, augEnd) is whitespace-augmented interval of child.\n\t\t\taugPos := childPos\n\t\t\taugEnd := childEnd\n\t\t\tif i > 0 {\n\t\t\t\taugPos = children[i-1].End() // start of preceding whitespace\n\t\t\t}\n\t\t\tif i < l-1 {\n\t\t\t\tnextChildPos := children[i+1].Pos()\n\t\t\t\t// Does [start, end) lie between child and next child?\n\t\t\t\tif start >= augEnd && end <= nextChildPos {\n\t\t\t\t\treturn false // inexact match\n\t\t\t\t}\n\t\t\t\taugEnd = nextChildPos // end of following whitespace\n\t\t\t}\n\n\t\t\t// fmt.Printf(\"\\tchild %d: [%d..%d)\\tcontains interval [%d..%d)?\\n\",\n\t\t\t// \ti, augPos, augEnd, start, end) // debugging\n\n\t\t\t// Does augmented child strictly contain [start, end)?\n\t\t\tif augPos <= start && end <= augEnd {\n\t\t\t\t_, isToken := child.(tokenNode)\n\t\t\t\treturn isToken || visit(child)\n\t\t\t}\n\n\t\t\t// Does [start, end) overlap multiple children?\n\t\t\t// i.e. left-augmented child contains start\n\t\t\t// but LR-augmented child does not contain end.\n\t\t\tif start < childEnd && end > augEnd {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\n\t\t// No single child contained [start, end),\n\t\t// so node is the result. Is it exact?\n\n\t\t// (It's tempting to put this condition before the\n\t\t// child loop, but it gives the wrong result in the\n\t\t// case where a node (e.g. ExprStmt) and its sole\n\t\t// child have equal intervals.)\n\t\tif start == nodePos && end == nodeEnd {\n\t\t\treturn true // exact match\n\t\t}\n\n\t\treturn false // inexact: overlaps multiple children\n\t}\n\n\tif start > end {\n\t\tstart, end = end, start\n\t}\n\n\tif start < root.End() && end > root.Pos() {\n\t\tif start == end {\n\t\t\tend = start + 1 // empty interval => interval of size 1\n\t\t}\n\t\texact = visit(root)\n\n\t\t// Reverse the path:\n\t\tfor i, l := 0, len(path); i < l/2; i++ {\n\t\t\tpath[i], path[l-1-i] = path[l-1-i], path[i]\n\t\t}\n\t} else {\n\t\t// Selection lies within whitespace preceding the\n\t\t// first (or following the last) declaration in the file.\n\t\t// The result nonetheless always includes the ast.File.\n\t\tpath = append(path, root)\n\t}\n\n\treturn\n}\n\n// tokenNode is a dummy implementation of ast.Node for a single token.\n// They are used transiently by PathEnclosingInterval but never escape\n// this package.\n//\ntype tokenNode struct {\n\tpos token.Pos\n\tend token.Pos\n}\n\nfunc (n tokenNode) Pos() token.Pos {\n\treturn n.pos\n}\n\nfunc (n tokenNode) End() token.Pos {\n\treturn n.end\n}\n\nfunc tok(pos token.Pos, len int) ast.Node {\n\treturn tokenNode{pos, pos + token.Pos(len)}\n}\n\n// childrenOf returns the direct non-nil children of ast.Node n.\n// It may include fake ast.Node implementations for bare tokens.\n// it is not safe to call (e.g.) ast.Walk on such nodes.\n//\nfunc childrenOf(n ast.Node) []ast.Node {\n\tvar children []ast.Node\n\n\t// First add nodes for all true subtrees.\n\tast.Inspect(n, func(node ast.Node) bool {\n\t\tif node == n { // push n\n\t\t\treturn true // recur\n\t\t}\n\t\tif node != nil { // push child\n\t\t\tchildren = append(children, node)\n\t\t}\n\t\treturn false // no recursion\n\t})\n\n\t// Then add fake Nodes for bare tokens.\n\tswitch n := n.(type) {\n\tcase *ast.ArrayType:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lbrack, len(\"[\")),\n\t\t\ttok(n.Elt.End(), len(\"]\")))\n\n\tcase *ast.AssignStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.TokPos, len(n.Tok.String())))\n\n\tcase *ast.BasicLit:\n\t\tchildren = append(children,\n\t\t\ttok(n.ValuePos, len(n.Value)))\n\n\tcase *ast.BinaryExpr:\n\t\tchildren = append(children, tok(n.OpPos, len(n.Op.String())))\n\n\tcase *ast.BlockStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lbrace, len(\"{\")),\n\t\t\ttok(n.Rbrace, len(\"}\")))\n\n\tcase *ast.BranchStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.TokPos, len(n.Tok.String())))\n\n\tcase *ast.CallExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lparen, len(\"(\")),\n\t\t\ttok(n.Rparen, len(\")\")))\n\t\tif n.Ellipsis != 0 {\n\t\t\tchildren = append(children, tok(n.Ellipsis, len(\"...\")))\n\t\t}\n\n\tcase *ast.CaseClause:\n\t\tif n.List == nil {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Case, len(\"default\")))\n\t\t} else {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Case, len(\"case\")))\n\t\t}\n\t\tchildren = append(children, tok(n.Colon, len(\":\")))\n\n\tcase *ast.ChanType:\n\t\tswitch n.Dir {\n\t\tcase ast.RECV:\n\t\t\tchildren = append(children, tok(n.Begin, len(\"<-chan\")))\n\t\tcase ast.SEND:\n\t\t\tchildren = append(children, tok(n.Begin, len(\"chan<-\")))\n\t\tcase ast.RECV | ast.SEND:\n\t\t\tchildren = append(children, tok(n.Begin, len(\"chan\")))\n\t\t}\n\n\tcase *ast.CommClause:\n\t\tif n.Comm == nil {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Case, len(\"default\")))\n\t\t} else {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Case, len(\"case\")))\n\t\t}\n\t\tchildren = append(children, tok(n.Colon, len(\":\")))\n\n\tcase *ast.Comment:\n\t\t// nop\n\n\tcase *ast.CommentGroup:\n\t\t// nop\n\n\tcase *ast.CompositeLit:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lbrace, len(\"{\")),\n\t\t\ttok(n.Rbrace, len(\"{\")))\n\n\tcase *ast.DeclStmt:\n\t\t// nop\n\n\tcase *ast.DeferStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Defer, len(\"defer\")))\n\n\tcase *ast.Ellipsis:\n\t\tchildren = append(children,\n\t\t\ttok(n.Ellipsis, len(\"...\")))\n\n\tcase *ast.EmptyStmt:\n\t\t// nop\n\n\tcase *ast.ExprStmt:\n\t\t// nop\n\n\tcase *ast.Field:\n\t\t// TODO(adonovan): Field.{Doc,Comment,Tag}?\n\n\tcase *ast.FieldList:\n\t\tchildren = append(children,\n\t\t\ttok(n.Opening, len(\"(\")),\n\t\t\ttok(n.Closing, len(\")\")))\n\n\tcase *ast.File:\n\t\t// TODO test: Doc\n\t\tchildren = append(children,\n\t\t\ttok(n.Package, len(\"package\")))\n\n\tcase *ast.ForStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.For, len(\"for\")))\n\n\tcase *ast.FuncDecl:\n\t\t// TODO(adonovan): FuncDecl.Comment?\n\n\t\t// Uniquely, FuncDecl breaks the invariant that\n\t\t// preorder traversal yields tokens in lexical order:\n\t\t// in fact, FuncDecl.Recv precedes FuncDecl.Type.Func.\n\t\t//\n\t\t// As a workaround, we inline the case for FuncType\n\t\t// here and order things correctly.\n\t\t//\n\t\tchildren = nil // discard ast.Walk(FuncDecl) info subtrees\n\t\tchildren = append(children, tok(n.Type.Func, len(\"func\")))\n\t\tif n.Recv != nil {\n\t\t\tchildren = append(children, n.Recv)\n\t\t}\n\t\tchildren = append(children, n.Name)\n\t\tif n.Type.Params != nil {\n\t\t\tchildren = append(children, n.Type.Params)\n\t\t}\n\t\tif n.Type.Results != nil {\n\t\t\tchildren = append(children, n.Type.Results)\n\t\t}\n\t\tif n.Body != nil {\n\t\t\tchildren = append(children, n.Body)\n\t\t}\n\n\tcase *ast.FuncLit:\n\t\t// nop\n\n\tcase *ast.FuncType:\n\t\tif n.Func != 0 {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Func, len(\"func\")))\n\t\t}\n\n\tcase *ast.GenDecl:\n\t\tchildren = append(children,\n\t\t\ttok(n.TokPos, len(n.Tok.String())))\n\t\tif n.Lparen != 0 {\n\t\t\tchildren = append(children,\n\t\t\t\ttok(n.Lparen, len(\"(\")),\n\t\t\t\ttok(n.Rparen, len(\")\")))\n\t\t}\n\n\tcase *ast.GoStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Go, len(\"go\")))\n\n\tcase *ast.Ident:\n\t\tchildren = append(children,\n\t\t\ttok(n.NamePos, len(n.Name)))\n\n\tcase *ast.IfStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.If, len(\"if\")))\n\n\tcase *ast.ImportSpec:\n\t\t// TODO(adonovan): ImportSpec.{Doc,EndPos}?\n\n\tcase *ast.IncDecStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.TokPos, len(n.Tok.String())))\n\n\tcase *ast.IndexExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lbrack, len(\"{\")),\n\t\t\ttok(n.Rbrack, len(\"}\")))\n\n\tcase *ast.InterfaceType:\n\t\tchildren = append(children,\n\t\t\ttok(n.Interface, len(\"interface\")))\n\n\tcase *ast.KeyValueExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Colon, len(\":\")))\n\n\tcase *ast.LabeledStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Colon, len(\":\")))\n\n\tcase *ast.MapType:\n\t\tchildren = append(children,\n\t\t\ttok(n.Map, len(\"map\")))\n\n\tcase *ast.ParenExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lparen, len(\"(\")),\n\t\t\ttok(n.Rparen, len(\")\")))\n\n\tcase *ast.RangeStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.For, len(\"for\")),\n\t\t\ttok(n.TokPos, len(n.Tok.String())))\n\n\tcase *ast.ReturnStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Return, len(\"return\")))\n\n\tcase *ast.SelectStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Select, len(\"select\")))\n\n\tcase *ast.SelectorExpr:\n\t\t// nop\n\n\tcase *ast.SendStmt:\n\t\tchildren = append(children,\n\t\t\ttok(n.Arrow, len(\"<-\")))\n\n\tcase *ast.SliceExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lbrack, len(\"[\")),\n\t\t\ttok(n.Rbrack, len(\"]\")))\n\n\tcase *ast.StarExpr:\n\t\tchildren = append(children, tok(n.Star, len(\"*\")))\n\n\tcase *ast.StructType:\n\t\tchildren = append(children, tok(n.Struct, len(\"struct\")))\n\n\tcase *ast.SwitchStmt:\n\t\tchildren = append(children, tok(n.Switch, len(\"switch\")))\n\n\tcase *ast.TypeAssertExpr:\n\t\tchildren = append(children,\n\t\t\ttok(n.Lparen-1, len(\".\")),\n\t\t\ttok(n.Lparen, len(\"(\")),\n\t\t\ttok(n.Rparen, len(\")\")))\n\n\tcase *ast.TypeSpec:\n\t\t// TODO(adonovan): TypeSpec.{Doc,Comment}?\n\n\tcase *ast.TypeSwitchStmt:\n\t\tchildren = append(children, tok(n.Switch, len(\"switch\")))\n\n\tcase *ast.UnaryExpr:\n\t\tchildren = append(children, tok(n.OpPos, len(n.Op.String())))\n\n\tcase *ast.ValueSpec:\n\t\t// TODO(adonovan): ValueSpec.{Doc,Comment}?\n\n\tcase *ast.BadDecl, *ast.BadExpr, *ast.BadStmt:\n\t\t// nop\n\t}\n\n\t// TODO(adonovan): opt: merge the logic of ast.Inspect() into\n\t// the switch above so we can make interleaved callbacks for\n\t// both Nodes and Tokens in the right order and avoid the need\n\t// to sort.\n\tsort.Sort(byPos(children))\n\n\treturn children\n}\n\ntype byPos []ast.Node\n\nfunc (sl byPos) Len() int {\n\treturn len(sl)\n}\nfunc (sl byPos) Less(i, j int) bool {\n\treturn sl[i].Pos() < sl[j].Pos()\n}\nfunc (sl byPos) Swap(i, j int) {\n\tsl[i], sl[j] = sl[j], sl[i]\n}\n\n// NodeDescription returns a description of the concrete type of n suitable\n// for a user interface.\n//\n// TODO(adonovan): in some cases (e.g. Field, FieldList, Ident,\n// StarExpr) we could be much more specific given the path to the AST\n// root. Perhaps we should do that.\n//\nfunc NodeDescription(n ast.Node) string {\n\tswitch n := n.(type) {\n\tcase *ast.ArrayType:\n\t\treturn \"array type\"\n\tcase *ast.AssignStmt:\n\t\treturn \"assignment\"\n\tcase *ast.BadDecl:\n\t\treturn \"bad declaration\"\n\tcase *ast.BadExpr:\n\t\treturn \"bad expression\"\n\tcase *ast.BadStmt:\n\t\treturn \"bad statement\"\n\tcase *ast.BasicLit:\n\t\treturn \"basic literal\"\n\tcase *ast.BinaryExpr:\n\t\treturn fmt.Sprintf(\"binary %s operation\", n.Op)\n\tcase *ast.BlockStmt:\n\t\treturn \"block\"\n\tcase *ast.BranchStmt:\n\t\tswitch n.Tok {\n\t\tcase token.BREAK:\n\t\t\treturn \"break statement\"\n\t\tcase token.CONTINUE:\n\t\t\treturn \"continue statement\"\n\t\tcase token.GOTO:\n\t\t\treturn \"goto statement\"\n\t\tcase token.FALLTHROUGH:\n\t\t\treturn \"fall-through statement\"\n\t\t}\n\tcase *ast.CallExpr:\n\t\tif len(n.Args) == 1 && !n.Ellipsis.IsValid() {\n\t\t\treturn \"function call (or conversion)\"\n\t\t}\n\t\treturn \"function call\"\n\tcase *ast.CaseClause:\n\t\treturn \"case clause\"\n\tcase *ast.ChanType:\n\t\treturn \"channel type\"\n\tcase *ast.CommClause:\n\t\treturn \"communication clause\"\n\tcase *ast.Comment:\n\t\treturn \"comment\"\n\tcase *ast.CommentGroup:\n\t\treturn \"comment group\"\n\tcase *ast.CompositeLit:\n\t\treturn \"composite literal\"\n\tcase *ast.DeclStmt:\n\t\treturn NodeDescription(n.Decl) + \" statement\"\n\tcase *ast.DeferStmt:\n\t\treturn \"defer statement\"\n\tcase *ast.Ellipsis:\n\t\treturn \"ellipsis\"\n\tcase *ast.EmptyStmt:\n\t\treturn \"empty statement\"\n\tcase *ast.ExprStmt:\n\t\treturn \"expression statement\"\n\tcase *ast.Field:\n\t\t// Can be any of these:\n\t\t// struct {x, y int} -- struct field(s)\n\t\t// struct {T} -- anon struct field\n\t\t// interface {I} -- interface embedding\n\t\t// interface {f()} -- interface method\n\t\t// func (A) func(B) C -- receiver, param(s), result(s)\n\t\treturn \"field/method/parameter\"\n\tcase *ast.FieldList:\n\t\treturn \"field/method/parameter list\"\n\tcase *ast.File:\n\t\treturn \"source file\"\n\tcase *ast.ForStmt:\n\t\treturn \"for loop\"\n\tcase *ast.FuncDecl:\n\t\treturn \"function declaration\"\n\tcase *ast.FuncLit:\n\t\treturn \"function literal\"\n\tcase *ast.FuncType:\n\t\treturn \"function type\"\n\tcase *ast.GenDecl:\n\t\tswitch n.Tok {\n\t\tcase token.IMPORT:\n\t\t\treturn \"import declaration\"\n\t\tcase token.CONST:\n\t\t\treturn \"constant declaration\"\n\t\tcase token.TYPE:\n\t\t\treturn \"type declaration\"\n\t\tcase token.VAR:\n\t\t\treturn \"variable declaration\"\n\t\t}\n\tcase *ast.GoStmt:\n\t\treturn \"go statement\"\n\tcase *ast.Ident:\n\t\treturn \"identifier\"\n\tcase *ast.IfStmt:\n\t\treturn \"if statement\"\n\tcase *ast.ImportSpec:\n\t\treturn \"import specification\"\n\tcase *ast.IncDecStmt:\n\t\tif n.Tok == token.INC {\n\t\t\treturn \"increment statement\"\n\t\t}\n\t\treturn \"decrement statement\"\n\tcase *ast.IndexExpr:\n\t\treturn \"index expression\"\n\tcase *ast.InterfaceType:\n\t\treturn \"interface type\"\n\tcase *ast.KeyValueExpr:\n\t\treturn \"key/value association\"\n\tcase *ast.LabeledStmt:\n\t\treturn \"statement label\"\n\tcase *ast.MapType:\n\t\treturn \"map type\"\n\tcase *ast.Package:\n\t\treturn \"package\"\n\tcase *ast.ParenExpr:\n\t\treturn \"parenthesized \" + NodeDescription(n.X)\n\tcase *ast.RangeStmt:\n\t\treturn \"range loop\"\n\tcase *ast.ReturnStmt:\n\t\treturn \"return statement\"\n\tcase *ast.SelectStmt:\n\t\treturn \"select statement\"\n\tcase *ast.SelectorExpr:\n\t\treturn \"selector\"\n\tcase *ast.SendStmt:\n\t\treturn \"channel send\"\n\tcase *ast.SliceExpr:\n\t\treturn \"slice expression\"\n\tcase *ast.StarExpr:\n\t\treturn \"*-operation\" // load/store expr or pointer type\n\tcase *ast.StructType:\n\t\treturn \"struct type\"\n\tcase *ast.SwitchStmt:\n\t\treturn \"switch statement\"\n\tcase *ast.TypeAssertExpr:\n\t\treturn \"type assertion\"\n\tcase *ast.TypeSpec:\n\t\treturn \"type specification\"\n\tcase *ast.TypeSwitchStmt:\n\t\treturn \"type switch\"\n\tcase *ast.UnaryExpr:\n\t\treturn fmt.Sprintf(\"unary %s operation\", n.Op)\n\tcase *ast.ValueSpec:\n\t\treturn \"value specification\"\n\n\t}\n\tpanic(fmt.Sprintf(\"unexpected node type: %T\", n))\n}\n" }, { "path": "vendor/golang.org/x/tools/go/ast/astutil/imports.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package astutil contains common utilities for working with the Go AST.\npackage astutil // import \"golang.org/x/tools/go/ast/astutil\"\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/token\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// AddImport adds the import path to the file f, if absent.\nfunc AddImport(fset *token.FileSet, f *ast.File, path string) (added bool) {\n\treturn AddNamedImport(fset, f, \"\", path)\n}\n\n// AddNamedImport adds the import with the given name and path to the file f, if absent.\n// If name is not empty, it is used to rename the import.\n//\n// For example, calling\n//\tAddNamedImport(fset, f, \"pathpkg\", \"path\")\n// adds\n//\timport pathpkg \"path\"\nfunc AddNamedImport(fset *token.FileSet, f *ast.File, name, path string) (added bool) {\n\tif imports(f, name, path) {\n\t\treturn false\n\t}\n\n\tnewImport := &ast.ImportSpec{\n\t\tPath: &ast.BasicLit{\n\t\t\tKind: token.STRING,\n\t\t\tValue: strconv.Quote(path),\n\t\t},\n\t}\n\tif name != \"\" {\n\t\tnewImport.Name = &ast.Ident{Name: name}\n\t}\n\n\t// Find an import decl to add to.\n\t// The goal is to find an existing import\n\t// whose import path has the longest shared\n\t// prefix with path.\n\tvar (\n\t\tbestMatch = -1 // length of longest shared prefix\n\t\tlastImport = -1 // index in f.Decls of the file's final import decl\n\t\timpDecl *ast.GenDecl // import decl containing the best match\n\t\timpIndex = -1 // spec index in impDecl containing the best match\n\n\t\tisThirdPartyPath = isThirdParty(path)\n\t)\n\tfor i, decl := range f.Decls {\n\t\tgen, ok := decl.(*ast.GenDecl)\n\t\tif ok && gen.Tok == token.IMPORT {\n\t\t\tlastImport = i\n\t\t\t// Do not add to import \"C\", to avoid disrupting the\n\t\t\t// association with its doc comment, breaking cgo.\n\t\t\tif declImports(gen, \"C\") {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// Match an empty import decl if that's all that is available.\n\t\t\tif len(gen.Specs) == 0 && bestMatch == -1 {\n\t\t\t\timpDecl = gen\n\t\t\t}\n\n\t\t\t// Compute longest shared prefix with imports in this group and find best\n\t\t\t// matched import spec.\n\t\t\t// 1. Always prefer import spec with longest shared prefix.\n\t\t\t// 2. While match length is 0,\n\t\t\t// - for stdlib package: prefer first import spec.\n\t\t\t// - for third party package: prefer first third party import spec.\n\t\t\t// We cannot use last import spec as best match for third party package\n\t\t\t// because grouped imports are usually placed last by goimports -local\n\t\t\t// flag.\n\t\t\t// See issue #19190.\n\t\t\tseenAnyThirdParty := false\n\t\t\tfor j, spec := range gen.Specs {\n\t\t\t\timpspec := spec.(*ast.ImportSpec)\n\t\t\t\tp := importPath(impspec)\n\t\t\t\tn := matchLen(p, path)\n\t\t\t\tif n > bestMatch || (bestMatch == 0 && !seenAnyThirdParty && isThirdPartyPath) {\n\t\t\t\t\tbestMatch = n\n\t\t\t\t\timpDecl = gen\n\t\t\t\t\timpIndex = j\n\t\t\t\t}\n\t\t\t\tseenAnyThirdParty = seenAnyThirdParty || isThirdParty(p)\n\t\t\t}\n\t\t}\n\t}\n\n\t// If no import decl found, add one after the last import.\n\tif impDecl == nil {\n\t\timpDecl = &ast.GenDecl{\n\t\t\tTok: token.IMPORT,\n\t\t}\n\t\tif lastImport >= 0 {\n\t\t\timpDecl.TokPos = f.Decls[lastImport].End()\n\t\t} else {\n\t\t\t// There are no existing imports.\n\t\t\t// Our new import, preceded by a blank line, goes after the package declaration\n\t\t\t// and after the comment, if any, that starts on the same line as the\n\t\t\t// package declaration.\n\t\t\timpDecl.TokPos = f.Package\n\n\t\t\tfile := fset.File(f.Package)\n\t\t\tpkgLine := file.Line(f.Package)\n\t\t\tfor _, c := range f.Comments {\n\t\t\t\tif file.Line(c.Pos()) > pkgLine {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\t// +2 for a blank line\n\t\t\t\timpDecl.TokPos = c.End() + 2\n\t\t\t}\n\t\t}\n\t\tf.Decls = append(f.Decls, nil)\n\t\tcopy(f.Decls[lastImport+2:], f.Decls[lastImport+1:])\n\t\tf.Decls[lastImport+1] = impDecl\n\t}\n\n\t// Insert new import at insertAt.\n\tinsertAt := 0\n\tif impIndex >= 0 {\n\t\t// insert after the found import\n\t\tinsertAt = impIndex + 1\n\t}\n\timpDecl.Specs = append(impDecl.Specs, nil)\n\tcopy(impDecl.Specs[insertAt+1:], impDecl.Specs[insertAt:])\n\timpDecl.Specs[insertAt] = newImport\n\tpos := impDecl.Pos()\n\tif insertAt > 0 {\n\t\t// If there is a comment after an existing import, preserve the comment\n\t\t// position by adding the new import after the comment.\n\t\tif spec, ok := impDecl.Specs[insertAt-1].(*ast.ImportSpec); ok && spec.Comment != nil {\n\t\t\tpos = spec.Comment.End()\n\t\t} else {\n\t\t\t// Assign same position as the previous import,\n\t\t\t// so that the sorter sees it as being in the same block.\n\t\t\tpos = impDecl.Specs[insertAt-1].Pos()\n\t\t}\n\t}\n\tif newImport.Name != nil {\n\t\tnewImport.Name.NamePos = pos\n\t}\n\tnewImport.Path.ValuePos = pos\n\tnewImport.EndPos = pos\n\n\t// Clean up parens. impDecl contains at least one spec.\n\tif len(impDecl.Specs) == 1 {\n\t\t// Remove unneeded parens.\n\t\timpDecl.Lparen = token.NoPos\n\t} else if !impDecl.Lparen.IsValid() {\n\t\t// impDecl needs parens added.\n\t\timpDecl.Lparen = impDecl.Specs[0].Pos()\n\t}\n\n\tf.Imports = append(f.Imports, newImport)\n\n\tif len(f.Decls) <= 1 {\n\t\treturn true\n\t}\n\n\t// Merge all the import declarations into the first one.\n\tvar first *ast.GenDecl\n\tfor i := 0; i < len(f.Decls); i++ {\n\t\tdecl := f.Decls[i]\n\t\tgen, ok := decl.(*ast.GenDecl)\n\t\tif !ok || gen.Tok != token.IMPORT || declImports(gen, \"C\") {\n\t\t\tcontinue\n\t\t}\n\t\tif first == nil {\n\t\t\tfirst = gen\n\t\t\tcontinue // Don't touch the first one.\n\t\t}\n\t\t// We now know there is more than one package in this import\n\t\t// declaration. Ensure that it ends up parenthesized.\n\t\tfirst.Lparen = first.Pos()\n\t\t// Move the imports of the other import declaration to the first one.\n\t\tfor _, spec := range gen.Specs {\n\t\t\tspec.(*ast.ImportSpec).Path.ValuePos = first.Pos()\n\t\t\tfirst.Specs = append(first.Specs, spec)\n\t\t}\n\t\tf.Decls = append(f.Decls[:i], f.Decls[i+1:]...)\n\t\ti--\n\t}\n\n\treturn true\n}\n\nfunc isThirdParty(importPath string) bool {\n\t// Third party package import path usually contains \".\" (\".com\", \".org\", ...)\n\t// This logic is taken from golang.org/x/tools/imports package.\n\treturn strings.Contains(importPath, \".\")\n}\n\n// DeleteImport deletes the import path from the file f, if present.\n// If there are duplicate import declarations, all matching ones are deleted.\nfunc DeleteImport(fset *token.FileSet, f *ast.File, path string) (deleted bool) {\n\treturn DeleteNamedImport(fset, f, \"\", path)\n}\n\n// DeleteNamedImport deletes the import with the given name and path from the file f, if present.\n// If there are duplicate import declarations, all matching ones are deleted.\nfunc DeleteNamedImport(fset *token.FileSet, f *ast.File, name, path string) (deleted bool) {\n\tvar delspecs []*ast.ImportSpec\n\tvar delcomments []*ast.CommentGroup\n\n\t// Find the import nodes that import path, if any.\n\tfor i := 0; i < len(f.Decls); i++ {\n\t\tdecl := f.Decls[i]\n\t\tgen, ok := decl.(*ast.GenDecl)\n\t\tif !ok || gen.Tok != token.IMPORT {\n\t\t\tcontinue\n\t\t}\n\t\tfor j := 0; j < len(gen.Specs); j++ {\n\t\t\tspec := gen.Specs[j]\n\t\t\timpspec := spec.(*ast.ImportSpec)\n\t\t\tif importName(impspec) != name || importPath(impspec) != path {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// We found an import spec that imports path.\n\t\t\t// Delete it.\n\t\t\tdelspecs = append(delspecs, impspec)\n\t\t\tdeleted = true\n\t\t\tcopy(gen.Specs[j:], gen.Specs[j+1:])\n\t\t\tgen.Specs = gen.Specs[:len(gen.Specs)-1]\n\n\t\t\t// If this was the last import spec in this decl,\n\t\t\t// delete the decl, too.\n\t\t\tif len(gen.Specs) == 0 {\n\t\t\t\tcopy(f.Decls[i:], f.Decls[i+1:])\n\t\t\t\tf.Decls = f.Decls[:len(f.Decls)-1]\n\t\t\t\ti--\n\t\t\t\tbreak\n\t\t\t} else if len(gen.Specs) == 1 {\n\t\t\t\tif impspec.Doc != nil {\n\t\t\t\t\tdelcomments = append(delcomments, impspec.Doc)\n\t\t\t\t}\n\t\t\t\tif impspec.Comment != nil {\n\t\t\t\t\tdelcomments = append(delcomments, impspec.Comment)\n\t\t\t\t}\n\t\t\t\tfor _, cg := range f.Comments {\n\t\t\t\t\t// Found comment on the same line as the import spec.\n\t\t\t\t\tif cg.End() < impspec.Pos() && fset.Position(cg.End()).Line == fset.Position(impspec.Pos()).Line {\n\t\t\t\t\t\tdelcomments = append(delcomments, cg)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tspec := gen.Specs[0].(*ast.ImportSpec)\n\n\t\t\t\t// Move the documentation right after the import decl.\n\t\t\t\tif spec.Doc != nil {\n\t\t\t\t\tfor fset.Position(gen.TokPos).Line+1 < fset.Position(spec.Doc.Pos()).Line {\n\t\t\t\t\t\tfset.File(gen.TokPos).MergeLine(fset.Position(gen.TokPos).Line)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor _, cg := range f.Comments {\n\t\t\t\t\tif cg.End() < spec.Pos() && fset.Position(cg.End()).Line == fset.Position(spec.Pos()).Line {\n\t\t\t\t\t\tfor fset.Position(gen.TokPos).Line+1 < fset.Position(spec.Pos()).Line {\n\t\t\t\t\t\t\tfset.File(gen.TokPos).MergeLine(fset.Position(gen.TokPos).Line)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif j > 0 {\n\t\t\t\tlastImpspec := gen.Specs[j-1].(*ast.ImportSpec)\n\t\t\t\tlastLine := fset.Position(lastImpspec.Path.ValuePos).Line\n\t\t\t\tline := fset.Position(impspec.Path.ValuePos).Line\n\n\t\t\t\t// We deleted an entry but now there may be\n\t\t\t\t// a blank line-sized hole where the import was.\n\t\t\t\tif line-lastLine > 1 {\n\t\t\t\t\t// There was a blank line immediately preceding the deleted import,\n\t\t\t\t\t// so there's no need to close the hole.\n\t\t\t\t\t// Do nothing.\n\t\t\t\t} else if line != fset.File(gen.Rparen).LineCount() {\n\t\t\t\t\t// There was no blank line. Close the hole.\n\t\t\t\t\tfset.File(gen.Rparen).MergeLine(line)\n\t\t\t\t}\n\t\t\t}\n\t\t\tj--\n\t\t}\n\t}\n\n\t// Delete imports from f.Imports.\n\tfor i := 0; i < len(f.Imports); i++ {\n\t\timp := f.Imports[i]\n\t\tfor j, del := range delspecs {\n\t\t\tif imp == del {\n\t\t\t\tcopy(f.Imports[i:], f.Imports[i+1:])\n\t\t\t\tf.Imports = f.Imports[:len(f.Imports)-1]\n\t\t\t\tcopy(delspecs[j:], delspecs[j+1:])\n\t\t\t\tdelspecs = delspecs[:len(delspecs)-1]\n\t\t\t\ti--\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\t// Delete comments from f.Comments.\n\tfor i := 0; i < len(f.Comments); i++ {\n\t\tcg := f.Comments[i]\n\t\tfor j, del := range delcomments {\n\t\t\tif cg == del {\n\t\t\t\tcopy(f.Comments[i:], f.Comments[i+1:])\n\t\t\t\tf.Comments = f.Comments[:len(f.Comments)-1]\n\t\t\t\tcopy(delcomments[j:], delcomments[j+1:])\n\t\t\t\tdelcomments = delcomments[:len(delcomments)-1]\n\t\t\t\ti--\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tif len(delspecs) > 0 {\n\t\tpanic(fmt.Sprintf(\"deleted specs from Decls but not Imports: %v\", delspecs))\n\t}\n\n\treturn\n}\n\n// RewriteImport rewrites any import of path oldPath to path newPath.\nfunc RewriteImport(fset *token.FileSet, f *ast.File, oldPath, newPath string) (rewrote bool) {\n\tfor _, imp := range f.Imports {\n\t\tif importPath(imp) == oldPath {\n\t\t\trewrote = true\n\t\t\t// record old End, because the default is to compute\n\t\t\t// it using the length of imp.Path.Value.\n\t\t\timp.EndPos = imp.End()\n\t\t\timp.Path.Value = strconv.Quote(newPath)\n\t\t}\n\t}\n\treturn\n}\n\n// UsesImport reports whether a given import is used.\nfunc UsesImport(f *ast.File, path string) (used bool) {\n\tspec := importSpec(f, path)\n\tif spec == nil {\n\t\treturn\n\t}\n\n\tname := spec.Name.String()\n\tswitch name {\n\tcase \"\":\n\t\t// If the package name is not explicitly specified,\n\t\t// make an educated guess. This is not guaranteed to be correct.\n\t\tlastSlash := strings.LastIndex(path, \"/\")\n\t\tif lastSlash == -1 {\n\t\t\tname = path\n\t\t} else {\n\t\t\tname = path[lastSlash+1:]\n\t\t}\n\tcase \"_\", \".\":\n\t\t// Not sure if this import is used - err on the side of caution.\n\t\treturn true\n\t}\n\n\tast.Walk(visitFn(func(n ast.Node) {\n\t\tsel, ok := n.(*ast.SelectorExpr)\n\t\tif ok && isTopName(sel.X, name) {\n\t\t\tused = true\n\t\t}\n\t}), f)\n\n\treturn\n}\n\ntype visitFn func(node ast.Node)\n\nfunc (fn visitFn) Visit(node ast.Node) ast.Visitor {\n\tfn(node)\n\treturn fn\n}\n\n// imports reports whether f has an import with the specified name and path.\nfunc imports(f *ast.File, name, path string) bool {\n\tfor _, s := range f.Imports {\n\t\tif importName(s) == name && importPath(s) == path {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// importSpec returns the import spec if f imports path,\n// or nil otherwise.\nfunc importSpec(f *ast.File, path string) *ast.ImportSpec {\n\tfor _, s := range f.Imports {\n\t\tif importPath(s) == path {\n\t\t\treturn s\n\t\t}\n\t}\n\treturn nil\n}\n\n// importName returns the name of s,\n// or \"\" if the import is not named.\nfunc importName(s *ast.ImportSpec) string {\n\tif s.Name == nil {\n\t\treturn \"\"\n\t}\n\treturn s.Name.Name\n}\n\n// importPath returns the unquoted import path of s,\n// or \"\" if the path is not properly quoted.\nfunc importPath(s *ast.ImportSpec) string {\n\tt, err := strconv.Unquote(s.Path.Value)\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\treturn t\n}\n\n// declImports reports whether gen contains an import of path.\nfunc declImports(gen *ast.GenDecl, path string) bool {\n\tif gen.Tok != token.IMPORT {\n\t\treturn false\n\t}\n\tfor _, spec := range gen.Specs {\n\t\timpspec := spec.(*ast.ImportSpec)\n\t\tif importPath(impspec) == path {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// matchLen returns the length of the longest path segment prefix shared by x and y.\nfunc matchLen(x, y string) int {\n\tn := 0\n\tfor i := 0; i < len(x) && i < len(y) && x[i] == y[i]; i++ {\n\t\tif x[i] == '/' {\n\t\t\tn++\n\t\t}\n\t}\n\treturn n\n}\n\n// isTopName returns true if n is a top-level unresolved identifier with the given name.\nfunc isTopName(n ast.Expr, name string) bool {\n\tid, ok := n.(*ast.Ident)\n\treturn ok && id.Name == name && id.Obj == nil\n}\n\n// Imports returns the file imports grouped by paragraph.\nfunc Imports(fset *token.FileSet, f *ast.File) [][]*ast.ImportSpec {\n\tvar groups [][]*ast.ImportSpec\n\n\tfor _, decl := range f.Decls {\n\t\tgenDecl, ok := decl.(*ast.GenDecl)\n\t\tif !ok || genDecl.Tok != token.IMPORT {\n\t\t\tbreak\n\t\t}\n\n\t\tgroup := []*ast.ImportSpec{}\n\n\t\tvar lastLine int\n\t\tfor _, spec := range genDecl.Specs {\n\t\t\timportSpec := spec.(*ast.ImportSpec)\n\t\t\tpos := importSpec.Path.ValuePos\n\t\t\tline := fset.Position(pos).Line\n\t\t\tif lastLine > 0 && pos > 0 && line-lastLine > 1 {\n\t\t\t\tgroups = append(groups, group)\n\t\t\t\tgroup = []*ast.ImportSpec{}\n\t\t\t}\n\t\t\tgroup = append(group, importSpec)\n\t\t\tlastLine = line\n\t\t}\n\t\tgroups = append(groups, group)\n\t}\n\n\treturn groups\n}\n" }, { "path": "vendor/golang.org/x/tools/go/ast/astutil/rewrite.go", "content": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage astutil\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\t\"reflect\"\n\t\"sort\"\n)\n\n// An ApplyFunc is invoked by Apply for each node n, even if n is nil,\n// before and/or after the node's children, using a Cursor describing\n// the current node and providing operations on it.\n//\n// The return value of ApplyFunc controls the syntax tree traversal.\n// See Apply for details.\ntype ApplyFunc func(*Cursor) bool\n\n// Apply traverses a syntax tree recursively, starting with root,\n// and calling pre and post for each node as described below.\n// Apply returns the syntax tree, possibly modified.\n//\n// If pre is not nil, it is called for each node before the node's\n// children are traversed (pre-order). If pre returns false, no\n// children are traversed, and post is not called for that node.\n//\n// If post is not nil, and a prior call of pre didn't return false,\n// post is called for each node after its children are traversed\n// (post-order). If post returns false, traversal is terminated and\n// Apply returns immediately.\n//\n// Only fields that refer to AST nodes are considered children;\n// i.e., token.Pos, Scopes, Objects, and fields of basic types\n// (strings, etc.) are ignored.\n//\n// Children are traversed in the order in which they appear in the\n// respective node's struct definition. A package's files are\n// traversed in the filenames' alphabetical order.\n//\nfunc Apply(root ast.Node, pre, post ApplyFunc) (result ast.Node) {\n\tparent := &struct{ ast.Node }{root}\n\tdefer func() {\n\t\tif r := recover(); r != nil && r != abort {\n\t\t\tpanic(r)\n\t\t}\n\t\tresult = parent.Node\n\t}()\n\ta := &application{pre: pre, post: post}\n\ta.apply(parent, \"Node\", nil, root)\n\treturn\n}\n\nvar abort = new(int) // singleton, to signal termination of Apply\n\n// A Cursor describes a node encountered during Apply.\n// Information about the node and its parent is available\n// from the Node, Parent, Name, and Index methods.\n//\n// If p is a variable of type and value of the current parent node\n// c.Parent(), and f is the field identifier with name c.Name(),\n// the following invariants hold:\n//\n// p.f == c.Node() if c.Index() < 0\n// p.f[c.Index()] == c.Node() if c.Index() >= 0\n//\n// The methods Replace, Delete, InsertBefore, and InsertAfter\n// can be used to change the AST without disrupting Apply.\ntype Cursor struct {\n\tparent ast.Node\n\tname string\n\titer *iterator // valid if non-nil\n\tnode ast.Node\n}\n\n// Node returns the current Node.\nfunc (c *Cursor) Node() ast.Node { return c.node }\n\n// Parent returns the parent of the current Node.\nfunc (c *Cursor) Parent() ast.Node { return c.parent }\n\n// Name returns the name of the parent Node field that contains the current Node.\n// If the parent is a *ast.Package and the current Node is a *ast.File, Name returns\n// the filename for the current Node.\nfunc (c *Cursor) Name() string { return c.name }\n\n// Index reports the index >= 0 of the current Node in the slice of Nodes that\n// contains it, or a value < 0 if the current Node is not part of a slice.\n// The index of the current node changes if InsertBefore is called while\n// processing the current node.\nfunc (c *Cursor) Index() int {\n\tif c.iter != nil {\n\t\treturn c.iter.index\n\t}\n\treturn -1\n}\n\n// field returns the current node's parent field value.\nfunc (c *Cursor) field() reflect.Value {\n\treturn reflect.Indirect(reflect.ValueOf(c.parent)).FieldByName(c.name)\n}\n\n// Replace replaces the current Node with n.\n// The replacement node is not walked by Apply.\nfunc (c *Cursor) Replace(n ast.Node) {\n\tif _, ok := c.node.(*ast.File); ok {\n\t\tfile, ok := n.(*ast.File)\n\t\tif !ok {\n\t\t\tpanic(\"attempt to replace *ast.File with non-*ast.File\")\n\t\t}\n\t\tc.parent.(*ast.Package).Files[c.name] = file\n\t\treturn\n\t}\n\n\tv := c.field()\n\tif i := c.Index(); i >= 0 {\n\t\tv = v.Index(i)\n\t}\n\tv.Set(reflect.ValueOf(n))\n}\n\n// Delete deletes the current Node from its containing slice.\n// If the current Node is not part of a slice, Delete panics.\n// As a special case, if the current node is a package file,\n// Delete removes it from the package's Files map.\nfunc (c *Cursor) Delete() {\n\tif _, ok := c.node.(*ast.File); ok {\n\t\tdelete(c.parent.(*ast.Package).Files, c.name)\n\t\treturn\n\t}\n\n\ti := c.Index()\n\tif i < 0 {\n\t\tpanic(\"Delete node not contained in slice\")\n\t}\n\tv := c.field()\n\tl := v.Len()\n\treflect.Copy(v.Slice(i, l), v.Slice(i+1, l))\n\tv.Index(l - 1).Set(reflect.Zero(v.Type().Elem()))\n\tv.SetLen(l - 1)\n\tc.iter.step--\n}\n\n// InsertAfter inserts n after the current Node in its containing slice.\n// If the current Node is not part of a slice, InsertAfter panics.\n// Apply does not walk n.\nfunc (c *Cursor) InsertAfter(n ast.Node) {\n\ti := c.Index()\n\tif i < 0 {\n\t\tpanic(\"InsertAfter node not contained in slice\")\n\t}\n\tv := c.field()\n\tv.Set(reflect.Append(v, reflect.Zero(v.Type().Elem())))\n\tl := v.Len()\n\treflect.Copy(v.Slice(i+2, l), v.Slice(i+1, l))\n\tv.Index(i + 1).Set(reflect.ValueOf(n))\n\tc.iter.step++\n}\n\n// InsertBefore inserts n before the current Node in its containing slice.\n// If the current Node is not part of a slice, InsertBefore panics.\n// Apply will not walk n.\nfunc (c *Cursor) InsertBefore(n ast.Node) {\n\ti := c.Index()\n\tif i < 0 {\n\t\tpanic(\"InsertBefore node not contained in slice\")\n\t}\n\tv := c.field()\n\tv.Set(reflect.Append(v, reflect.Zero(v.Type().Elem())))\n\tl := v.Len()\n\treflect.Copy(v.Slice(i+1, l), v.Slice(i, l))\n\tv.Index(i).Set(reflect.ValueOf(n))\n\tc.iter.index++\n}\n\n// application carries all the shared data so we can pass it around cheaply.\ntype application struct {\n\tpre, post ApplyFunc\n\tcursor Cursor\n\titer iterator\n}\n\nfunc (a *application) apply(parent ast.Node, name string, iter *iterator, n ast.Node) {\n\t// convert typed nil into untyped nil\n\tif v := reflect.ValueOf(n); v.Kind() == reflect.Ptr && v.IsNil() {\n\t\tn = nil\n\t}\n\n\t// avoid heap-allocating a new cursor for each apply call; reuse a.cursor instead\n\tsaved := a.cursor\n\ta.cursor.parent = parent\n\ta.cursor.name = name\n\ta.cursor.iter = iter\n\ta.cursor.node = n\n\n\tif a.pre != nil && !a.pre(&a.cursor) {\n\t\ta.cursor = saved\n\t\treturn\n\t}\n\n\t// walk children\n\t// (the order of the cases matches the order of the corresponding node types in go/ast)\n\tswitch n := n.(type) {\n\tcase nil:\n\t\t// nothing to do\n\n\t// Comments and fields\n\tcase *ast.Comment:\n\t\t// nothing to do\n\n\tcase *ast.CommentGroup:\n\t\tif n != nil {\n\t\t\ta.applyList(n, \"List\")\n\t\t}\n\n\tcase *ast.Field:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.applyList(n, \"Names\")\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.apply(n, \"Tag\", nil, n.Tag)\n\t\ta.apply(n, \"Comment\", nil, n.Comment)\n\n\tcase *ast.FieldList:\n\t\ta.applyList(n, \"List\")\n\n\t// Expressions\n\tcase *ast.BadExpr, *ast.Ident, *ast.BasicLit:\n\t\t// nothing to do\n\n\tcase *ast.Ellipsis:\n\t\ta.apply(n, \"Elt\", nil, n.Elt)\n\n\tcase *ast.FuncLit:\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\tcase *ast.CompositeLit:\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.applyList(n, \"Elts\")\n\n\tcase *ast.ParenExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\n\tcase *ast.SelectorExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Sel\", nil, n.Sel)\n\n\tcase *ast.IndexExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Index\", nil, n.Index)\n\n\tcase *ast.SliceExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Low\", nil, n.Low)\n\t\ta.apply(n, \"High\", nil, n.High)\n\t\ta.apply(n, \"Max\", nil, n.Max)\n\n\tcase *ast.TypeAssertExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\n\tcase *ast.CallExpr:\n\t\ta.apply(n, \"Fun\", nil, n.Fun)\n\t\ta.applyList(n, \"Args\")\n\n\tcase *ast.StarExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\n\tcase *ast.UnaryExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\n\tcase *ast.BinaryExpr:\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Y\", nil, n.Y)\n\n\tcase *ast.KeyValueExpr:\n\t\ta.apply(n, \"Key\", nil, n.Key)\n\t\ta.apply(n, \"Value\", nil, n.Value)\n\n\t// Types\n\tcase *ast.ArrayType:\n\t\ta.apply(n, \"Len\", nil, n.Len)\n\t\ta.apply(n, \"Elt\", nil, n.Elt)\n\n\tcase *ast.StructType:\n\t\ta.apply(n, \"Fields\", nil, n.Fields)\n\n\tcase *ast.FuncType:\n\t\ta.apply(n, \"Params\", nil, n.Params)\n\t\ta.apply(n, \"Results\", nil, n.Results)\n\n\tcase *ast.InterfaceType:\n\t\ta.apply(n, \"Methods\", nil, n.Methods)\n\n\tcase *ast.MapType:\n\t\ta.apply(n, \"Key\", nil, n.Key)\n\t\ta.apply(n, \"Value\", nil, n.Value)\n\n\tcase *ast.ChanType:\n\t\ta.apply(n, \"Value\", nil, n.Value)\n\n\t// Statements\n\tcase *ast.BadStmt:\n\t\t// nothing to do\n\n\tcase *ast.DeclStmt:\n\t\ta.apply(n, \"Decl\", nil, n.Decl)\n\n\tcase *ast.EmptyStmt:\n\t\t// nothing to do\n\n\tcase *ast.LabeledStmt:\n\t\ta.apply(n, \"Label\", nil, n.Label)\n\t\ta.apply(n, \"Stmt\", nil, n.Stmt)\n\n\tcase *ast.ExprStmt:\n\t\ta.apply(n, \"X\", nil, n.X)\n\n\tcase *ast.SendStmt:\n\t\ta.apply(n, \"Chan\", nil, n.Chan)\n\t\ta.apply(n, \"Value\", nil, n.Value)\n\n\tcase *ast.IncDecStmt:\n\t\ta.apply(n, \"X\", nil, n.X)\n\n\tcase *ast.AssignStmt:\n\t\ta.applyList(n, \"Lhs\")\n\t\ta.applyList(n, \"Rhs\")\n\n\tcase *ast.GoStmt:\n\t\ta.apply(n, \"Call\", nil, n.Call)\n\n\tcase *ast.DeferStmt:\n\t\ta.apply(n, \"Call\", nil, n.Call)\n\n\tcase *ast.ReturnStmt:\n\t\ta.applyList(n, \"Results\")\n\n\tcase *ast.BranchStmt:\n\t\ta.apply(n, \"Label\", nil, n.Label)\n\n\tcase *ast.BlockStmt:\n\t\ta.applyList(n, \"List\")\n\n\tcase *ast.IfStmt:\n\t\ta.apply(n, \"Init\", nil, n.Init)\n\t\ta.apply(n, \"Cond\", nil, n.Cond)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\t\ta.apply(n, \"Else\", nil, n.Else)\n\n\tcase *ast.CaseClause:\n\t\ta.applyList(n, \"List\")\n\t\ta.applyList(n, \"Body\")\n\n\tcase *ast.SwitchStmt:\n\t\ta.apply(n, \"Init\", nil, n.Init)\n\t\ta.apply(n, \"Tag\", nil, n.Tag)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\tcase *ast.TypeSwitchStmt:\n\t\ta.apply(n, \"Init\", nil, n.Init)\n\t\ta.apply(n, \"Assign\", nil, n.Assign)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\tcase *ast.CommClause:\n\t\ta.apply(n, \"Comm\", nil, n.Comm)\n\t\ta.applyList(n, \"Body\")\n\n\tcase *ast.SelectStmt:\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\tcase *ast.ForStmt:\n\t\ta.apply(n, \"Init\", nil, n.Init)\n\t\ta.apply(n, \"Cond\", nil, n.Cond)\n\t\ta.apply(n, \"Post\", nil, n.Post)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\tcase *ast.RangeStmt:\n\t\ta.apply(n, \"Key\", nil, n.Key)\n\t\ta.apply(n, \"Value\", nil, n.Value)\n\t\ta.apply(n, \"X\", nil, n.X)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\t// Declarations\n\tcase *ast.ImportSpec:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.apply(n, \"Name\", nil, n.Name)\n\t\ta.apply(n, \"Path\", nil, n.Path)\n\t\ta.apply(n, \"Comment\", nil, n.Comment)\n\n\tcase *ast.ValueSpec:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.applyList(n, \"Names\")\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.applyList(n, \"Values\")\n\t\ta.apply(n, \"Comment\", nil, n.Comment)\n\n\tcase *ast.TypeSpec:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.apply(n, \"Name\", nil, n.Name)\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.apply(n, \"Comment\", nil, n.Comment)\n\n\tcase *ast.BadDecl:\n\t\t// nothing to do\n\n\tcase *ast.GenDecl:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.applyList(n, \"Specs\")\n\n\tcase *ast.FuncDecl:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.apply(n, \"Recv\", nil, n.Recv)\n\t\ta.apply(n, \"Name\", nil, n.Name)\n\t\ta.apply(n, \"Type\", nil, n.Type)\n\t\ta.apply(n, \"Body\", nil, n.Body)\n\n\t// Files and packages\n\tcase *ast.File:\n\t\ta.apply(n, \"Doc\", nil, n.Doc)\n\t\ta.apply(n, \"Name\", nil, n.Name)\n\t\ta.applyList(n, \"Decls\")\n\t\t// Don't walk n.Comments; they have either been walked already if\n\t\t// they are Doc comments, or they can be easily walked explicitly.\n\n\tcase *ast.Package:\n\t\t// collect and sort names for reproducible behavior\n\t\tvar names []string\n\t\tfor name := range n.Files {\n\t\t\tnames = append(names, name)\n\t\t}\n\t\tsort.Strings(names)\n\t\tfor _, name := range names {\n\t\t\ta.apply(n, name, nil, n.Files[name])\n\t\t}\n\n\tdefault:\n\t\tpanic(fmt.Sprintf(\"Apply: unexpected node type %T\", n))\n\t}\n\n\tif a.post != nil && !a.post(&a.cursor) {\n\t\tpanic(abort)\n\t}\n\n\ta.cursor = saved\n}\n\n// An iterator controls iteration over a slice of nodes.\ntype iterator struct {\n\tindex, step int\n}\n\nfunc (a *application) applyList(parent ast.Node, name string) {\n\t// avoid heap-allocating a new iterator for each applyList call; reuse a.iter instead\n\tsaved := a.iter\n\ta.iter.index = 0\n\tfor {\n\t\t// must reload parent.name each time, since cursor modifications might change it\n\t\tv := reflect.Indirect(reflect.ValueOf(parent)).FieldByName(name)\n\t\tif a.iter.index >= v.Len() {\n\t\t\tbreak\n\t\t}\n\n\t\t// element x may be nil in a bad AST - be cautious\n\t\tvar x ast.Node\n\t\tif e := v.Index(a.iter.index); e.IsValid() {\n\t\t\tx = e.Interface().(ast.Node)\n\t\t}\n\n\t\ta.iter.step = 1\n\t\ta.apply(parent, name, &a.iter, x)\n\t\ta.iter.index += a.iter.step\n\t}\n\ta.iter = saved\n}\n" }, { "path": "vendor/golang.org/x/tools/go/ast/astutil/util.go", "content": "package astutil\n\nimport \"go/ast\"\n\n// Unparen returns e with any enclosing parentheses stripped.\nfunc Unparen(e ast.Expr) ast.Expr {\n\tfor {\n\t\tp, ok := e.(*ast.ParenExpr)\n\t\tif !ok {\n\t\t\treturn e\n\t\t}\n\t\te = p.X\n\t}\n}\n" }, { "path": "vendor/golang.org/x/tools/go/buildutil/allpackages.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package buildutil provides utilities related to the go/build\n// package in the standard library.\n//\n// All I/O is done via the build.Context file system interface, which must\n// be concurrency-safe.\npackage buildutil // import \"golang.org/x/tools/go/buildutil\"\n\nimport (\n\t\"go/build\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sort\"\n\t\"strings\"\n\t\"sync\"\n)\n\n// AllPackages returns the package path of each Go package in any source\n// directory of the specified build context (e.g. $GOROOT or an element\n// of $GOPATH). Errors are ignored. The results are sorted.\n// All package paths are canonical, and thus may contain \"/vendor/\".\n//\n// The result may include import paths for directories that contain no\n// *.go files, such as \"archive\" (in $GOROOT/src).\n//\n// All I/O is done via the build.Context file system interface,\n// which must be concurrency-safe.\n//\nfunc AllPackages(ctxt *build.Context) []string {\n\tvar list []string\n\tForEachPackage(ctxt, func(pkg string, _ error) {\n\t\tlist = append(list, pkg)\n\t})\n\tsort.Strings(list)\n\treturn list\n}\n\n// ForEachPackage calls the found function with the package path of\n// each Go package it finds in any source directory of the specified\n// build context (e.g. $GOROOT or an element of $GOPATH).\n// All package paths are canonical, and thus may contain \"/vendor/\".\n//\n// If the package directory exists but could not be read, the second\n// argument to the found function provides the error.\n//\n// All I/O is done via the build.Context file system interface,\n// which must be concurrency-safe.\n//\nfunc ForEachPackage(ctxt *build.Context, found func(importPath string, err error)) {\n\tch := make(chan item)\n\n\tvar wg sync.WaitGroup\n\tfor _, root := range ctxt.SrcDirs() {\n\t\troot := root\n\t\twg.Add(1)\n\t\tgo func() {\n\t\t\tallPackages(ctxt, root, ch)\n\t\t\twg.Done()\n\t\t}()\n\t}\n\tgo func() {\n\t\twg.Wait()\n\t\tclose(ch)\n\t}()\n\n\t// All calls to found occur in the caller's goroutine.\n\tfor i := range ch {\n\t\tfound(i.importPath, i.err)\n\t}\n}\n\ntype item struct {\n\timportPath string\n\terr error // (optional)\n}\n\n// We use a process-wide counting semaphore to limit\n// the number of parallel calls to ReadDir.\nvar ioLimit = make(chan bool, 20)\n\nfunc allPackages(ctxt *build.Context, root string, ch chan<- item) {\n\troot = filepath.Clean(root) + string(os.PathSeparator)\n\n\tvar wg sync.WaitGroup\n\n\tvar walkDir func(dir string)\n\twalkDir = func(dir string) {\n\t\t// Avoid .foo, _foo, and testdata directory trees.\n\t\tbase := filepath.Base(dir)\n\t\tif base == \"\" || base[0] == '.' || base[0] == '_' || base == \"testdata\" {\n\t\t\treturn\n\t\t}\n\n\t\tpkg := filepath.ToSlash(strings.TrimPrefix(dir, root))\n\n\t\t// Prune search if we encounter any of these import paths.\n\t\tswitch pkg {\n\t\tcase \"builtin\":\n\t\t\treturn\n\t\t}\n\n\t\tioLimit <- true\n\t\tfiles, err := ReadDir(ctxt, dir)\n\t\t<-ioLimit\n\t\tif pkg != \"\" || err != nil {\n\t\t\tch <- item{pkg, err}\n\t\t}\n\t\tfor _, fi := range files {\n\t\t\tfi := fi\n\t\t\tif fi.IsDir() {\n\t\t\t\twg.Add(1)\n\t\t\t\tgo func() {\n\t\t\t\t\twalkDir(filepath.Join(dir, fi.Name()))\n\t\t\t\t\twg.Done()\n\t\t\t\t}()\n\t\t\t}\n\t\t}\n\t}\n\n\twalkDir(root)\n\twg.Wait()\n}\n\n// ExpandPatterns returns the set of packages matched by patterns,\n// which may have the following forms:\n//\n//\t\tgolang.org/x/tools/cmd/guru # a single package\n//\t\tgolang.org/x/tools/... # all packages beneath dir\n//\t\t... # the entire workspace.\n//\n// Order is significant: a pattern preceded by '-' removes matching\n// packages from the set. For example, these patterns match all encoding\n// packages except encoding/xml:\n//\n// \tencoding/... -encoding/xml\n//\n// A trailing slash in a pattern is ignored. (Path components of Go\n// package names are separated by slash, not the platform's path separator.)\n//\nfunc ExpandPatterns(ctxt *build.Context, patterns []string) map[string]bool {\n\t// TODO(adonovan): support other features of 'go list':\n\t// - \"std\"/\"cmd\"/\"all\" meta-packages\n\t// - \"...\" not at the end of a pattern\n\t// - relative patterns using \"./\" or \"../\" prefix\n\n\tpkgs := make(map[string]bool)\n\tdoPkg := func(pkg string, neg bool) {\n\t\tif neg {\n\t\t\tdelete(pkgs, pkg)\n\t\t} else {\n\t\t\tpkgs[pkg] = true\n\t\t}\n\t}\n\n\t// Scan entire workspace if wildcards are present.\n\t// TODO(adonovan): opt: scan only the necessary subtrees of the workspace.\n\tvar all []string\n\tfor _, arg := range patterns {\n\t\tif strings.HasSuffix(arg, \"...\") {\n\t\t\tall = AllPackages(ctxt)\n\t\t\tbreak\n\t\t}\n\t}\n\n\tfor _, arg := range patterns {\n\t\tif arg == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tneg := arg[0] == '-'\n\t\tif neg {\n\t\t\targ = arg[1:]\n\t\t}\n\n\t\tif arg == \"...\" {\n\t\t\t// ... matches all packages\n\t\t\tfor _, pkg := range all {\n\t\t\t\tdoPkg(pkg, neg)\n\t\t\t}\n\t\t} else if dir := strings.TrimSuffix(arg, \"/...\"); dir != arg {\n\t\t\t// dir/... matches all packages beneath dir\n\t\t\tfor _, pkg := range all {\n\t\t\t\tif strings.HasPrefix(pkg, dir) &&\n\t\t\t\t\t(len(pkg) == len(dir) || pkg[len(dir)] == '/') {\n\t\t\t\t\tdoPkg(pkg, neg)\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t// single package\n\t\t\tdoPkg(strings.TrimSuffix(arg, \"/\"), neg)\n\t\t}\n\t}\n\n\treturn pkgs\n}\n" }, { "path": "vendor/golang.org/x/tools/go/buildutil/fakecontext.go", "content": "package buildutil\n\nimport (\n\t\"fmt\"\n\t\"go/build\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"sort\"\n\t\"strings\"\n\t\"time\"\n)\n\n// FakeContext returns a build.Context for the fake file tree specified\n// by pkgs, which maps package import paths to a mapping from file base\n// names to contents.\n//\n// The fake Context has a GOROOT of \"/go\" and no GOPATH, and overrides\n// the necessary file access methods to read from memory instead of the\n// real file system.\n//\n// Unlike a real file tree, the fake one has only two levels---packages\n// and files---so ReadDir(\"/go/src/\") returns all packages under\n// /go/src/ including, for instance, \"math\" and \"math/big\".\n// ReadDir(\"/go/src/math/big\") would return all the files in the\n// \"math/big\" package.\n//\nfunc FakeContext(pkgs map[string]map[string]string) *build.Context {\n\tclean := func(filename string) string {\n\t\tf := path.Clean(filepath.ToSlash(filename))\n\t\t// Removing \"/go/src\" while respecting segment\n\t\t// boundaries has this unfortunate corner case:\n\t\tif f == \"/go/src\" {\n\t\t\treturn \"\"\n\t\t}\n\t\treturn strings.TrimPrefix(f, \"/go/src/\")\n\t}\n\n\tctxt := build.Default // copy\n\tctxt.GOROOT = \"/go\"\n\tctxt.GOPATH = \"\"\n\tctxt.Compiler = \"gc\"\n\tctxt.IsDir = func(dir string) bool {\n\t\tdir = clean(dir)\n\t\tif dir == \"\" {\n\t\t\treturn true // needed by (*build.Context).SrcDirs\n\t\t}\n\t\treturn pkgs[dir] != nil\n\t}\n\tctxt.ReadDir = func(dir string) ([]os.FileInfo, error) {\n\t\tdir = clean(dir)\n\t\tvar fis []os.FileInfo\n\t\tif dir == \"\" {\n\t\t\t// enumerate packages\n\t\t\tfor importPath := range pkgs {\n\t\t\t\tfis = append(fis, fakeDirInfo(importPath))\n\t\t\t}\n\t\t} else {\n\t\t\t// enumerate files of package\n\t\t\tfor basename := range pkgs[dir] {\n\t\t\t\tfis = append(fis, fakeFileInfo(basename))\n\t\t\t}\n\t\t}\n\t\tsort.Sort(byName(fis))\n\t\treturn fis, nil\n\t}\n\tctxt.OpenFile = func(filename string) (io.ReadCloser, error) {\n\t\tfilename = clean(filename)\n\t\tdir, base := path.Split(filename)\n\t\tcontent, ok := pkgs[path.Clean(dir)][base]\n\t\tif !ok {\n\t\t\treturn nil, fmt.Errorf(\"file not found: %s\", filename)\n\t\t}\n\t\treturn ioutil.NopCloser(strings.NewReader(content)), nil\n\t}\n\tctxt.IsAbsPath = func(path string) bool {\n\t\tpath = filepath.ToSlash(path)\n\t\t// Don't rely on the default (filepath.Path) since on\n\t\t// Windows, it reports virtual paths as non-absolute.\n\t\treturn strings.HasPrefix(path, \"/\")\n\t}\n\treturn &ctxt\n}\n\ntype byName []os.FileInfo\n\nfunc (s byName) Len() int { return len(s) }\nfunc (s byName) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\nfunc (s byName) Less(i, j int) bool { return s[i].Name() < s[j].Name() }\n\ntype fakeFileInfo string\n\nfunc (fi fakeFileInfo) Name() string { return string(fi) }\nfunc (fakeFileInfo) Sys() interface{} { return nil }\nfunc (fakeFileInfo) ModTime() time.Time { return time.Time{} }\nfunc (fakeFileInfo) IsDir() bool { return false }\nfunc (fakeFileInfo) Size() int64 { return 0 }\nfunc (fakeFileInfo) Mode() os.FileMode { return 0644 }\n\ntype fakeDirInfo string\n\nfunc (fd fakeDirInfo) Name() string { return string(fd) }\nfunc (fakeDirInfo) Sys() interface{} { return nil }\nfunc (fakeDirInfo) ModTime() time.Time { return time.Time{} }\nfunc (fakeDirInfo) IsDir() bool { return true }\nfunc (fakeDirInfo) Size() int64 { return 0 }\nfunc (fakeDirInfo) Mode() os.FileMode { return 0755 }\n" }, { "path": "vendor/golang.org/x/tools/go/buildutil/overlay.go", "content": "// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage buildutil\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"go/build\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"path/filepath\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// OverlayContext overlays a build.Context with additional files from\n// a map. Files in the map take precedence over other files.\n//\n// In addition to plain string comparison, two file names are\n// considered equal if their base names match and their directory\n// components point at the same directory on the file system. That is,\n// symbolic links are followed for directories, but not files.\n//\n// A common use case for OverlayContext is to allow editors to pass in\n// a set of unsaved, modified files.\n//\n// Currently, only the Context.OpenFile function will respect the\n// overlay. This may change in the future.\nfunc OverlayContext(orig *build.Context, overlay map[string][]byte) *build.Context {\n\t// TODO(dominikh): Implement IsDir, HasSubdir and ReadDir\n\n\trc := func(data []byte) (io.ReadCloser, error) {\n\t\treturn ioutil.NopCloser(bytes.NewBuffer(data)), nil\n\t}\n\n\tcopy := *orig // make a copy\n\tctxt := ©\n\tctxt.OpenFile = func(path string) (io.ReadCloser, error) {\n\t\t// Fast path: names match exactly.\n\t\tif content, ok := overlay[path]; ok {\n\t\t\treturn rc(content)\n\t\t}\n\n\t\t// Slow path: check for same file under a different\n\t\t// alias, perhaps due to a symbolic link.\n\t\tfor filename, content := range overlay {\n\t\t\tif sameFile(path, filename) {\n\t\t\t\treturn rc(content)\n\t\t\t}\n\t\t}\n\n\t\treturn OpenFile(orig, path)\n\t}\n\treturn ctxt\n}\n\n// ParseOverlayArchive parses an archive containing Go files and their\n// contents. The result is intended to be used with OverlayContext.\n//\n//\n// Archive format\n//\n// The archive consists of a series of files. Each file consists of a\n// name, a decimal file size and the file contents, separated by\n// newlinews. No newline follows after the file contents.\nfunc ParseOverlayArchive(archive io.Reader) (map[string][]byte, error) {\n\toverlay := make(map[string][]byte)\n\tr := bufio.NewReader(archive)\n\tfor {\n\t\t// Read file name.\n\t\tfilename, err := r.ReadString('\\n')\n\t\tif err != nil {\n\t\t\tif err == io.EOF {\n\t\t\t\tbreak // OK\n\t\t\t}\n\t\t\treturn nil, fmt.Errorf(\"reading archive file name: %v\", err)\n\t\t}\n\t\tfilename = filepath.Clean(strings.TrimSpace(filename))\n\n\t\t// Read file size.\n\t\tsz, err := r.ReadString('\\n')\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"reading size of archive file %s: %v\", filename, err)\n\t\t}\n\t\tsz = strings.TrimSpace(sz)\n\t\tsize, err := strconv.ParseUint(sz, 10, 32)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"parsing size of archive file %s: %v\", filename, err)\n\t\t}\n\n\t\t// Read file content.\n\t\tcontent := make([]byte, size)\n\t\tif _, err := io.ReadFull(r, content); err != nil {\n\t\t\treturn nil, fmt.Errorf(\"reading archive file %s: %v\", filename, err)\n\t\t}\n\t\toverlay[filename] = content\n\t}\n\n\treturn overlay, nil\n}\n" }, { "path": "vendor/golang.org/x/tools/go/buildutil/tags.go", "content": "package buildutil\n\n// This logic was copied from stringsFlag from $GOROOT/src/cmd/go/build.go.\n\nimport \"fmt\"\n\nconst TagsFlagDoc = \"a list of `build tags` to consider satisfied during the build. \" +\n\t\"For more information about build tags, see the description of \" +\n\t\"build constraints in the documentation for the go/build package\"\n\n// TagsFlag is an implementation of the flag.Value and flag.Getter interfaces that parses\n// a flag value in the same manner as go build's -tags flag and\n// populates a []string slice.\n//\n// See $GOROOT/src/go/build/doc.go for description of build tags.\n// See $GOROOT/src/cmd/go/doc.go for description of 'go build -tags' flag.\n//\n// Example:\n// \tflag.Var((*buildutil.TagsFlag)(&build.Default.BuildTags), \"tags\", buildutil.TagsFlagDoc)\ntype TagsFlag []string\n\nfunc (v *TagsFlag) Set(s string) error {\n\tvar err error\n\t*v, err = splitQuotedFields(s)\n\tif *v == nil {\n\t\t*v = []string{}\n\t}\n\treturn err\n}\n\nfunc (v *TagsFlag) Get() interface{} { return *v }\n\nfunc splitQuotedFields(s string) ([]string, error) {\n\t// Split fields allowing '' or \"\" around elements.\n\t// Quotes further inside the string do not count.\n\tvar f []string\n\tfor len(s) > 0 {\n\t\tfor len(s) > 0 && isSpaceByte(s[0]) {\n\t\t\ts = s[1:]\n\t\t}\n\t\tif len(s) == 0 {\n\t\t\tbreak\n\t\t}\n\t\t// Accepted quoted string. No unescaping inside.\n\t\tif s[0] == '\"' || s[0] == '\\'' {\n\t\t\tquote := s[0]\n\t\t\ts = s[1:]\n\t\t\ti := 0\n\t\t\tfor i < len(s) && s[i] != quote {\n\t\t\t\ti++\n\t\t\t}\n\t\t\tif i >= len(s) {\n\t\t\t\treturn nil, fmt.Errorf(\"unterminated %c string\", quote)\n\t\t\t}\n\t\t\tf = append(f, s[:i])\n\t\t\ts = s[i+1:]\n\t\t\tcontinue\n\t\t}\n\t\ti := 0\n\t\tfor i < len(s) && !isSpaceByte(s[i]) {\n\t\t\ti++\n\t\t}\n\t\tf = append(f, s[:i])\n\t\ts = s[i:]\n\t}\n\treturn f, nil\n}\n\nfunc (v *TagsFlag) String() string {\n\treturn \"\"\n}\n\nfunc isSpaceByte(c byte) bool {\n\treturn c == ' ' || c == '\\t' || c == '\\n' || c == '\\r'\n}\n" }, { "path": "vendor/golang.org/x/tools/go/buildutil/util.go", "content": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage buildutil\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/build\"\n\t\"go/parser\"\n\t\"go/token\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"strings\"\n)\n\n// ParseFile behaves like parser.ParseFile,\n// but uses the build context's file system interface, if any.\n//\n// If file is not absolute (as defined by IsAbsPath), the (dir, file)\n// components are joined using JoinPath; dir must be absolute.\n//\n// The displayPath function, if provided, is used to transform the\n// filename that will be attached to the ASTs.\n//\n// TODO(adonovan): call this from go/loader.parseFiles when the tree thaws.\n//\nfunc ParseFile(fset *token.FileSet, ctxt *build.Context, displayPath func(string) string, dir string, file string, mode parser.Mode) (*ast.File, error) {\n\tif !IsAbsPath(ctxt, file) {\n\t\tfile = JoinPath(ctxt, dir, file)\n\t}\n\trd, err := OpenFile(ctxt, file)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer rd.Close() // ignore error\n\tif displayPath != nil {\n\t\tfile = displayPath(file)\n\t}\n\treturn parser.ParseFile(fset, file, rd, mode)\n}\n\n// ContainingPackage returns the package containing filename.\n//\n// If filename is not absolute, it is interpreted relative to working directory dir.\n// All I/O is via the build context's file system interface, if any.\n//\n// The '...Files []string' fields of the resulting build.Package are not\n// populated (build.FindOnly mode).\n//\nfunc ContainingPackage(ctxt *build.Context, dir, filename string) (*build.Package, error) {\n\tif !IsAbsPath(ctxt, filename) {\n\t\tfilename = JoinPath(ctxt, dir, filename)\n\t}\n\n\t// We must not assume the file tree uses\n\t// \"/\" always,\n\t// `\\` always,\n\t// or os.PathSeparator (which varies by platform),\n\t// but to make any progress, we are forced to assume that\n\t// paths will not use `\\` unless the PathSeparator\n\t// is also `\\`, thus we can rely on filepath.ToSlash for some sanity.\n\n\tdirSlash := path.Dir(filepath.ToSlash(filename)) + \"/\"\n\n\t// We assume that no source root (GOPATH[i] or GOROOT) contains any other.\n\tfor _, srcdir := range ctxt.SrcDirs() {\n\t\tsrcdirSlash := filepath.ToSlash(srcdir) + \"/\"\n\t\tif importPath, ok := HasSubdir(ctxt, srcdirSlash, dirSlash); ok {\n\t\t\treturn ctxt.Import(importPath, dir, build.FindOnly)\n\t\t}\n\t}\n\n\treturn nil, fmt.Errorf(\"can't find package containing %s\", filename)\n}\n\n// -- Effective methods of file system interface -------------------------\n\n// (go/build.Context defines these as methods, but does not export them.)\n\n// hasSubdir calls ctxt.HasSubdir (if not nil) or else uses\n// the local file system to answer the question.\nfunc HasSubdir(ctxt *build.Context, root, dir string) (rel string, ok bool) {\n\tif f := ctxt.HasSubdir; f != nil {\n\t\treturn f(root, dir)\n\t}\n\n\t// Try using paths we received.\n\tif rel, ok = hasSubdir(root, dir); ok {\n\t\treturn\n\t}\n\n\t// Try expanding symlinks and comparing\n\t// expanded against unexpanded and\n\t// expanded against expanded.\n\trootSym, _ := filepath.EvalSymlinks(root)\n\tdirSym, _ := filepath.EvalSymlinks(dir)\n\n\tif rel, ok = hasSubdir(rootSym, dir); ok {\n\t\treturn\n\t}\n\tif rel, ok = hasSubdir(root, dirSym); ok {\n\t\treturn\n\t}\n\treturn hasSubdir(rootSym, dirSym)\n}\n\nfunc hasSubdir(root, dir string) (rel string, ok bool) {\n\tconst sep = string(filepath.Separator)\n\troot = filepath.Clean(root)\n\tif !strings.HasSuffix(root, sep) {\n\t\troot += sep\n\t}\n\n\tdir = filepath.Clean(dir)\n\tif !strings.HasPrefix(dir, root) {\n\t\treturn \"\", false\n\t}\n\n\treturn filepath.ToSlash(dir[len(root):]), true\n}\n\n// FileExists returns true if the specified file exists,\n// using the build context's file system interface.\nfunc FileExists(ctxt *build.Context, path string) bool {\n\tif ctxt.OpenFile != nil {\n\t\tr, err := ctxt.OpenFile(path)\n\t\tif err != nil {\n\t\t\treturn false\n\t\t}\n\t\tr.Close() // ignore error\n\t\treturn true\n\t}\n\t_, err := os.Stat(path)\n\treturn err == nil\n}\n\n// OpenFile behaves like os.Open,\n// but uses the build context's file system interface, if any.\nfunc OpenFile(ctxt *build.Context, path string) (io.ReadCloser, error) {\n\tif ctxt.OpenFile != nil {\n\t\treturn ctxt.OpenFile(path)\n\t}\n\treturn os.Open(path)\n}\n\n// IsAbsPath behaves like filepath.IsAbs,\n// but uses the build context's file system interface, if any.\nfunc IsAbsPath(ctxt *build.Context, path string) bool {\n\tif ctxt.IsAbsPath != nil {\n\t\treturn ctxt.IsAbsPath(path)\n\t}\n\treturn filepath.IsAbs(path)\n}\n\n// JoinPath behaves like filepath.Join,\n// but uses the build context's file system interface, if any.\nfunc JoinPath(ctxt *build.Context, path ...string) string {\n\tif ctxt.JoinPath != nil {\n\t\treturn ctxt.JoinPath(path...)\n\t}\n\treturn filepath.Join(path...)\n}\n\n// IsDir behaves like os.Stat plus IsDir,\n// but uses the build context's file system interface, if any.\nfunc IsDir(ctxt *build.Context, path string) bool {\n\tif ctxt.IsDir != nil {\n\t\treturn ctxt.IsDir(path)\n\t}\n\tfi, err := os.Stat(path)\n\treturn err == nil && fi.IsDir()\n}\n\n// ReadDir behaves like ioutil.ReadDir,\n// but uses the build context's file system interface, if any.\nfunc ReadDir(ctxt *build.Context, path string) ([]os.FileInfo, error) {\n\tif ctxt.ReadDir != nil {\n\t\treturn ctxt.ReadDir(path)\n\t}\n\treturn ioutil.ReadDir(path)\n}\n\n// SplitPathList behaves like filepath.SplitList,\n// but uses the build context's file system interface, if any.\nfunc SplitPathList(ctxt *build.Context, s string) []string {\n\tif ctxt.SplitPathList != nil {\n\t\treturn ctxt.SplitPathList(s)\n\t}\n\treturn filepath.SplitList(s)\n}\n\n// sameFile returns true if x and y have the same basename and denote\n// the same file.\n//\nfunc sameFile(x, y string) bool {\n\tif path.Clean(x) == path.Clean(y) {\n\t\treturn true\n\t}\n\tif filepath.Base(x) == filepath.Base(y) { // (optimisation)\n\t\tif xi, err := os.Stat(x); err == nil {\n\t\t\tif yi, err := os.Stat(y); err == nil {\n\t\t\t\treturn os.SameFile(xi, yi)\n\t\t\t}\n\t\t}\n\t}\n\treturn false\n}\n" }, { "path": "vendor/golang.org/x/tools/go/internal/cgo/cgo.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cgo\n\n// This file handles cgo preprocessing of files containing `import \"C\"`.\n//\n// DESIGN\n//\n// The approach taken is to run the cgo processor on the package's\n// CgoFiles and parse the output, faking the filenames of the\n// resulting ASTs so that the synthetic file containing the C types is\n// called \"C\" (e.g. \"~/go/src/net/C\") and the preprocessed files\n// have their original names (e.g. \"~/go/src/net/cgo_unix.go\"),\n// not the names of the actual temporary files.\n//\n// The advantage of this approach is its fidelity to 'go build'. The\n// downside is that the token.Position.Offset for each AST node is\n// incorrect, being an offset within the temporary file. Line numbers\n// should still be correct because of the //line comments.\n//\n// The logic of this file is mostly plundered from the 'go build'\n// tool, which also invokes the cgo preprocessor.\n//\n//\n// REJECTED ALTERNATIVE\n//\n// An alternative approach that we explored is to extend go/types'\n// Importer mechanism to provide the identity of the importing package\n// so that each time `import \"C\"` appears it resolves to a different\n// synthetic package containing just the objects needed in that case.\n// The loader would invoke cgo but parse only the cgo_types.go file\n// defining the package-level objects, discarding the other files\n// resulting from preprocessing.\n//\n// The benefit of this approach would have been that source-level\n// syntax information would correspond exactly to the original cgo\n// file, with no preprocessing involved, making source tools like\n// godoc, guru, and eg happy. However, the approach was rejected\n// due to the additional complexity it would impose on go/types. (It\n// made for a beautiful demo, though.)\n//\n// cgo files, despite their *.go extension, are not legal Go source\n// files per the specification since they may refer to unexported\n// members of package \"C\" such as C.int. Also, a function such as\n// C.getpwent has in effect two types, one matching its C type and one\n// which additionally returns (errno C.int). The cgo preprocessor\n// uses name mangling to distinguish these two functions in the\n// processed code, but go/types would need to duplicate this logic in\n// its handling of function calls, analogous to the treatment of map\n// lookups in which y=m[k] and y,ok=m[k] are both legal.\n\nimport (\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/build\"\n\t\"go/parser\"\n\t\"go/token\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"os\"\n\t\"os/exec\"\n\t\"path/filepath\"\n\t\"regexp\"\n\t\"strings\"\n)\n\n// ProcessFiles invokes the cgo preprocessor on bp.CgoFiles, parses\n// the output and returns the resulting ASTs.\n//\nfunc ProcessFiles(bp *build.Package, fset *token.FileSet, DisplayPath func(path string) string, mode parser.Mode) ([]*ast.File, error) {\n\ttmpdir, err := ioutil.TempDir(\"\", strings.Replace(bp.ImportPath, \"/\", \"_\", -1)+\"_C\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer os.RemoveAll(tmpdir)\n\n\tpkgdir := bp.Dir\n\tif DisplayPath != nil {\n\t\tpkgdir = DisplayPath(pkgdir)\n\t}\n\n\tcgoFiles, cgoDisplayFiles, err := Run(bp, pkgdir, tmpdir, false)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tvar files []*ast.File\n\tfor i := range cgoFiles {\n\t\trd, err := os.Open(cgoFiles[i])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tdisplay := filepath.Join(bp.Dir, cgoDisplayFiles[i])\n\t\tf, err := parser.ParseFile(fset, display, rd, mode)\n\t\trd.Close()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tfiles = append(files, f)\n\t}\n\treturn files, nil\n}\n\nvar cgoRe = regexp.MustCompile(`[/\\\\:]`)\n\n// Run invokes the cgo preprocessor on bp.CgoFiles and returns two\n// lists of files: the resulting processed files (in temporary\n// directory tmpdir) and the corresponding names of the unprocessed files.\n//\n// Run is adapted from (*builder).cgo in\n// $GOROOT/src/cmd/go/build.go, but these features are unsupported:\n// Objective C, CGOPKGPATH, CGO_FLAGS.\n//\n// If useabs is set to true, absolute paths of the bp.CgoFiles will be passed in\n// to the cgo preprocessor. This in turn will set the // line comments\n// referring to those files to use absolute paths. This is needed for\n// go/packages using the legacy go list support so it is able to find\n// the original files.\nfunc Run(bp *build.Package, pkgdir, tmpdir string, useabs bool) (files, displayFiles []string, err error) {\n\tcgoCPPFLAGS, _, _, _ := cflags(bp, true)\n\t_, cgoexeCFLAGS, _, _ := cflags(bp, false)\n\n\tif len(bp.CgoPkgConfig) > 0 {\n\t\tpcCFLAGS, err := pkgConfigFlags(bp)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\t\tcgoCPPFLAGS = append(cgoCPPFLAGS, pcCFLAGS...)\n\t}\n\n\t// Allows including _cgo_export.h from .[ch] files in the package.\n\tcgoCPPFLAGS = append(cgoCPPFLAGS, \"-I\", tmpdir)\n\n\t// _cgo_gotypes.go (displayed \"C\") contains the type definitions.\n\tfiles = append(files, filepath.Join(tmpdir, \"_cgo_gotypes.go\"))\n\tdisplayFiles = append(displayFiles, \"C\")\n\tfor _, fn := range bp.CgoFiles {\n\t\t// \"foo.cgo1.go\" (displayed \"foo.go\") is the processed Go source.\n\t\tf := cgoRe.ReplaceAllString(fn[:len(fn)-len(\"go\")], \"_\")\n\t\tfiles = append(files, filepath.Join(tmpdir, f+\"cgo1.go\"))\n\t\tdisplayFiles = append(displayFiles, fn)\n\t}\n\n\tvar cgoflags []string\n\tif bp.Goroot && bp.ImportPath == \"runtime/cgo\" {\n\t\tcgoflags = append(cgoflags, \"-import_runtime_cgo=false\")\n\t}\n\tif bp.Goroot && bp.ImportPath == \"runtime/race\" || bp.ImportPath == \"runtime/cgo\" {\n\t\tcgoflags = append(cgoflags, \"-import_syscall=false\")\n\t}\n\n\tvar cgoFiles []string = bp.CgoFiles\n\tif useabs {\n\t\tcgoFiles = make([]string, len(bp.CgoFiles))\n\t\tfor i := range cgoFiles {\n\t\t\tcgoFiles[i] = filepath.Join(pkgdir, bp.CgoFiles[i])\n\t\t}\n\t}\n\n\targs := stringList(\n\t\t\"go\", \"tool\", \"cgo\", \"-objdir\", tmpdir, cgoflags, \"--\",\n\t\tcgoCPPFLAGS, cgoexeCFLAGS, cgoFiles,\n\t)\n\tif false {\n\t\tlog.Printf(\"Running cgo for package %q: %s (dir=%s)\", bp.ImportPath, args, pkgdir)\n\t}\n\tcmd := exec.Command(args[0], args[1:]...)\n\tcmd.Dir = pkgdir\n\tcmd.Stdout = os.Stderr\n\tcmd.Stderr = os.Stderr\n\tif err := cmd.Run(); err != nil {\n\t\treturn nil, nil, fmt.Errorf(\"cgo failed: %s: %s\", args, err)\n\t}\n\n\treturn files, displayFiles, nil\n}\n\n// -- unmodified from 'go build' ---------------------------------------\n\n// Return the flags to use when invoking the C or C++ compilers, or cgo.\nfunc cflags(p *build.Package, def bool) (cppflags, cflags, cxxflags, ldflags []string) {\n\tvar defaults string\n\tif def {\n\t\tdefaults = \"-g -O2\"\n\t}\n\n\tcppflags = stringList(envList(\"CGO_CPPFLAGS\", \"\"), p.CgoCPPFLAGS)\n\tcflags = stringList(envList(\"CGO_CFLAGS\", defaults), p.CgoCFLAGS)\n\tcxxflags = stringList(envList(\"CGO_CXXFLAGS\", defaults), p.CgoCXXFLAGS)\n\tldflags = stringList(envList(\"CGO_LDFLAGS\", defaults), p.CgoLDFLAGS)\n\treturn\n}\n\n// envList returns the value of the given environment variable broken\n// into fields, using the default value when the variable is empty.\nfunc envList(key, def string) []string {\n\tv := os.Getenv(key)\n\tif v == \"\" {\n\t\tv = def\n\t}\n\treturn strings.Fields(v)\n}\n\n// stringList's arguments should be a sequence of string or []string values.\n// stringList flattens them into a single []string.\nfunc stringList(args ...interface{}) []string {\n\tvar x []string\n\tfor _, arg := range args {\n\t\tswitch arg := arg.(type) {\n\t\tcase []string:\n\t\t\tx = append(x, arg...)\n\t\tcase string:\n\t\t\tx = append(x, arg)\n\t\tdefault:\n\t\t\tpanic(\"stringList: invalid argument\")\n\t\t}\n\t}\n\treturn x\n}\n" }, { "path": "vendor/golang.org/x/tools/go/internal/cgo/cgo_pkgconfig.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cgo\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"go/build\"\n\t\"os/exec\"\n\t\"strings\"\n)\n\n// pkgConfig runs pkg-config with the specified arguments and returns the flags it prints.\nfunc pkgConfig(mode string, pkgs []string) (flags []string, err error) {\n\tcmd := exec.Command(\"pkg-config\", append([]string{mode}, pkgs...)...)\n\tout, err := cmd.CombinedOutput()\n\tif err != nil {\n\t\ts := fmt.Sprintf(\"%s failed: %v\", strings.Join(cmd.Args, \" \"), err)\n\t\tif len(out) > 0 {\n\t\t\ts = fmt.Sprintf(\"%s: %s\", s, out)\n\t\t}\n\t\treturn nil, errors.New(s)\n\t}\n\tif len(out) > 0 {\n\t\tflags = strings.Fields(string(out))\n\t}\n\treturn\n}\n\n// pkgConfigFlags calls pkg-config if needed and returns the cflags\n// needed to build the package.\nfunc pkgConfigFlags(p *build.Package) (cflags []string, err error) {\n\tif len(p.CgoPkgConfig) == 0 {\n\t\treturn nil, nil\n\t}\n\treturn pkgConfig(\"--cflags\", p.CgoPkgConfig)\n}\n" }, { "path": "vendor/golang.org/x/tools/go/loader/doc.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package loader loads a complete Go program from source code, parsing\n// and type-checking the initial packages plus their transitive closure\n// of dependencies. The ASTs and the derived facts are retained for\n// later use.\n//\n// THIS INTERFACE IS EXPERIMENTAL AND IS LIKELY TO CHANGE.\n//\n// The package defines two primary types: Config, which specifies a\n// set of initial packages to load and various other options; and\n// Program, which is the result of successfully loading the packages\n// specified by a configuration.\n//\n// The configuration can be set directly, but *Config provides various\n// convenience methods to simplify the common cases, each of which can\n// be called any number of times. Finally, these are followed by a\n// call to Load() to actually load and type-check the program.\n//\n// var conf loader.Config\n//\n// // Use the command-line arguments to specify\n// // a set of initial packages to load from source.\n// // See FromArgsUsage for help.\n// rest, err := conf.FromArgs(os.Args[1:], wantTests)\n//\n// // Parse the specified files and create an ad hoc package with path \"foo\".\n// // All files must have the same 'package' declaration.\n// conf.CreateFromFilenames(\"foo\", \"foo.go\", \"bar.go\")\n//\n// // Create an ad hoc package with path \"foo\" from\n// // the specified already-parsed files.\n// // All ASTs must have the same 'package' declaration.\n// conf.CreateFromFiles(\"foo\", parsedFiles)\n//\n// // Add \"runtime\" to the set of packages to be loaded.\n// conf.Import(\"runtime\")\n//\n// // Adds \"fmt\" and \"fmt_test\" to the set of packages\n// // to be loaded. \"fmt\" will include *_test.go files.\n// conf.ImportWithTests(\"fmt\")\n//\n// // Finally, load all the packages specified by the configuration.\n// prog, err := conf.Load()\n//\n// See examples_test.go for examples of API usage.\n//\n//\n// CONCEPTS AND TERMINOLOGY\n//\n// The WORKSPACE is the set of packages accessible to the loader. The\n// workspace is defined by Config.Build, a *build.Context. The\n// default context treats subdirectories of $GOROOT and $GOPATH as\n// packages, but this behavior may be overridden.\n//\n// An AD HOC package is one specified as a set of source files on the\n// command line. In the simplest case, it may consist of a single file\n// such as $GOROOT/src/net/http/triv.go.\n//\n// EXTERNAL TEST packages are those comprised of a set of *_test.go\n// files all with the same 'package foo_test' declaration, all in the\n// same directory. (go/build.Package calls these files XTestFiles.)\n//\n// An IMPORTABLE package is one that can be referred to by some import\n// spec. Every importable package is uniquely identified by its\n// PACKAGE PATH or just PATH, a string such as \"fmt\", \"encoding/json\",\n// or \"cmd/vendor/golang.org/x/arch/x86/x86asm\". A package path\n// typically denotes a subdirectory of the workspace.\n//\n// An import declaration uses an IMPORT PATH to refer to a package.\n// Most import declarations use the package path as the import path.\n//\n// Due to VENDORING (https://golang.org/s/go15vendor), the\n// interpretation of an import path may depend on the directory in which\n// it appears. To resolve an import path to a package path, go/build\n// must search the enclosing directories for a subdirectory named\n// \"vendor\".\n//\n// ad hoc packages and external test packages are NON-IMPORTABLE. The\n// path of an ad hoc package is inferred from the package\n// declarations of its files and is therefore not a unique package key.\n// For example, Config.CreatePkgs may specify two initial ad hoc\n// packages, both with path \"main\".\n//\n// An AUGMENTED package is an importable package P plus all the\n// *_test.go files with same 'package foo' declaration as P.\n// (go/build.Package calls these files TestFiles.)\n//\n// The INITIAL packages are those specified in the configuration. A\n// DEPENDENCY is a package loaded to satisfy an import in an initial\n// package or another dependency.\n//\npackage loader\n\n// IMPLEMENTATION NOTES\n//\n// 'go test', in-package test files, and import cycles\n// ---------------------------------------------------\n//\n// An external test package may depend upon members of the augmented\n// package that are not in the unaugmented package, such as functions\n// that expose internals. (See bufio/export_test.go for an example.)\n// So, the loader must ensure that for each external test package\n// it loads, it also augments the corresponding non-test package.\n//\n// The import graph over n unaugmented packages must be acyclic; the\n// import graph over n-1 unaugmented packages plus one augmented\n// package must also be acyclic. ('go test' relies on this.) But the\n// import graph over n augmented packages may contain cycles.\n//\n// First, all the (unaugmented) non-test packages and their\n// dependencies are imported in the usual way; the loader reports an\n// error if it detects an import cycle.\n//\n// Then, each package P for which testing is desired is augmented by\n// the list P' of its in-package test files, by calling\n// (*types.Checker).Files. This arrangement ensures that P' may\n// reference definitions within P, but P may not reference definitions\n// within P'. Furthermore, P' may import any other package, including\n// ones that depend upon P, without an import cycle error.\n//\n// Consider two packages A and B, both of which have lists of\n// in-package test files we'll call A' and B', and which have the\n// following import graph edges:\n// B imports A\n// B' imports A\n// A' imports B\n// This last edge would be expected to create an error were it not\n// for the special type-checking discipline above.\n// Cycles of size greater than two are possible. For example:\n// compress/bzip2/bzip2_test.go (package bzip2) imports \"io/ioutil\"\n// io/ioutil/tempfile_test.go (package ioutil) imports \"regexp\"\n// regexp/exec_test.go (package regexp) imports \"compress/bzip2\"\n//\n//\n// Concurrency\n// -----------\n//\n// Let us define the import dependency graph as follows. Each node is a\n// list of files passed to (Checker).Files at once. Many of these lists\n// are the production code of an importable Go package, so those nodes\n// are labelled by the package's path. The remaining nodes are\n// ad hoc packages and lists of in-package *_test.go files that augment\n// an importable package; those nodes have no label.\n//\n// The edges of the graph represent import statements appearing within a\n// file. An edge connects a node (a list of files) to the node it\n// imports, which is importable and thus always labelled.\n//\n// Loading is controlled by this dependency graph.\n//\n// To reduce I/O latency, we start loading a package's dependencies\n// asynchronously as soon as we've parsed its files and enumerated its\n// imports (scanImports). This performs a preorder traversal of the\n// import dependency graph.\n//\n// To exploit hardware parallelism, we type-check unrelated packages in\n// parallel, where \"unrelated\" means not ordered by the partial order of\n// the import dependency graph.\n//\n// We use a concurrency-safe non-blocking cache (importer.imported) to\n// record the results of type-checking, whether success or failure. An\n// entry is created in this cache by startLoad the first time the\n// package is imported. The first goroutine to request an entry becomes\n// responsible for completing the task and broadcasting completion to\n// subsequent requestors, which block until then.\n//\n// Type checking occurs in (parallel) postorder: we cannot type-check a\n// set of files until we have loaded and type-checked all of their\n// immediate dependencies (and thus all of their transitive\n// dependencies). If the input were guaranteed free of import cycles,\n// this would be trivial: we could simply wait for completion of the\n// dependencies and then invoke the typechecker.\n//\n// But as we saw in the 'go test' section above, some cycles in the\n// import graph over packages are actually legal, so long as the\n// cycle-forming edge originates in the in-package test files that\n// augment the package. This explains why the nodes of the import\n// dependency graph are not packages, but lists of files: the unlabelled\n// nodes avoid the cycles. Consider packages A and B where B imports A\n// and A's in-package tests AT import B. The naively constructed import\n// graph over packages would contain a cycle (A+AT) --> B --> (A+AT) but\n// the graph over lists of files is AT --> B --> A, where AT is an\n// unlabelled node.\n//\n// Awaiting completion of the dependencies in a cyclic graph would\n// deadlock, so we must materialize the import dependency graph (as\n// importer.graph) and check whether each import edge forms a cycle. If\n// x imports y, and the graph already contains a path from y to x, then\n// there is an import cycle, in which case the processing of x must not\n// wait for the completion of processing of y.\n//\n// When the type-checker makes a callback (doImport) to the loader for a\n// given import edge, there are two possible cases. In the normal case,\n// the dependency has already been completely type-checked; doImport\n// does a cache lookup and returns it. In the cyclic case, the entry in\n// the cache is still necessarily incomplete, indicating a cycle. We\n// perform the cycle check again to obtain the error message, and return\n// the error.\n//\n// The result of using concurrency is about a 2.5x speedup for stdlib_test.\n\n// TODO(adonovan): overhaul the package documentation.\n" }, { "path": "vendor/golang.org/x/tools/go/loader/loader.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage loader\n\n// See doc.go for package documentation and implementation notes.\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/build\"\n\t\"go/parser\"\n\t\"go/token\"\n\t\"go/types\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sort\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n\n\t\"golang.org/x/tools/go/ast/astutil\"\n\t\"golang.org/x/tools/go/internal/cgo\"\n)\n\nvar ignoreVendor build.ImportMode\n\nconst trace = false // show timing info for type-checking\n\n// Config specifies the configuration for loading a whole program from\n// Go source code.\n// The zero value for Config is a ready-to-use default configuration.\ntype Config struct {\n\t// Fset is the file set for the parser to use when loading the\n\t// program. If nil, it may be lazily initialized by any\n\t// method of Config.\n\tFset *token.FileSet\n\n\t// ParserMode specifies the mode to be used by the parser when\n\t// loading source packages.\n\tParserMode parser.Mode\n\n\t// TypeChecker contains options relating to the type checker.\n\t//\n\t// The supplied IgnoreFuncBodies is not used; the effective\n\t// value comes from the TypeCheckFuncBodies func below.\n\t// The supplied Import function is not used either.\n\tTypeChecker types.Config\n\n\t// TypeCheckFuncBodies is a predicate over package paths.\n\t// A package for which the predicate is false will\n\t// have its package-level declarations type checked, but not\n\t// its function bodies; this can be used to quickly load\n\t// dependencies from source. If nil, all func bodies are type\n\t// checked.\n\tTypeCheckFuncBodies func(path string) bool\n\n\t// If Build is non-nil, it is used to locate source packages.\n\t// Otherwise &build.Default is used.\n\t//\n\t// By default, cgo is invoked to preprocess Go files that\n\t// import the fake package \"C\". This behaviour can be\n\t// disabled by setting CGO_ENABLED=0 in the environment prior\n\t// to startup, or by setting Build.CgoEnabled=false.\n\tBuild *build.Context\n\n\t// The current directory, used for resolving relative package\n\t// references such as \"./go/loader\". If empty, os.Getwd will be\n\t// used instead.\n\tCwd string\n\n\t// If DisplayPath is non-nil, it is used to transform each\n\t// file name obtained from Build.Import(). This can be used\n\t// to prevent a virtualized build.Config's file names from\n\t// leaking into the user interface.\n\tDisplayPath func(path string) string\n\n\t// If AllowErrors is true, Load will return a Program even\n\t// if some of the its packages contained I/O, parser or type\n\t// errors; such errors are accessible via PackageInfo.Errors. If\n\t// false, Load will fail if any package had an error.\n\tAllowErrors bool\n\n\t// CreatePkgs specifies a list of non-importable initial\n\t// packages to create. The resulting packages will appear in\n\t// the corresponding elements of the Program.Created slice.\n\tCreatePkgs []PkgSpec\n\n\t// ImportPkgs specifies a set of initial packages to load.\n\t// The map keys are package paths.\n\t//\n\t// The map value indicates whether to load tests. If true, Load\n\t// will add and type-check two lists of files to the package:\n\t// non-test files followed by in-package *_test.go files. In\n\t// addition, it will append the external test package (if any)\n\t// to Program.Created.\n\tImportPkgs map[string]bool\n\n\t// FindPackage is called during Load to create the build.Package\n\t// for a given import path from a given directory.\n\t// If FindPackage is nil, (*build.Context).Import is used.\n\t// A client may use this hook to adapt to a proprietary build\n\t// system that does not follow the \"go build\" layout\n\t// conventions, for example.\n\t//\n\t// It must be safe to call concurrently from multiple goroutines.\n\tFindPackage func(ctxt *build.Context, importPath, fromDir string, mode build.ImportMode) (*build.Package, error)\n\n\t// AfterTypeCheck is called immediately after a list of files\n\t// has been type-checked and appended to info.Files.\n\t//\n\t// This optional hook function is the earliest opportunity for\n\t// the client to observe the output of the type checker,\n\t// which may be useful to reduce analysis latency when loading\n\t// a large program.\n\t//\n\t// The function is permitted to modify info.Info, for instance\n\t// to clear data structures that are no longer needed, which can\n\t// dramatically reduce peak memory consumption.\n\t//\n\t// The function may be called twice for the same PackageInfo:\n\t// once for the files of the package and again for the\n\t// in-package test files.\n\t//\n\t// It must be safe to call concurrently from multiple goroutines.\n\tAfterTypeCheck func(info *PackageInfo, files []*ast.File)\n}\n\n// A PkgSpec specifies a non-importable package to be created by Load.\n// Files are processed first, but typically only one of Files and\n// Filenames is provided. The path needn't be globally unique.\n//\n// For vendoring purposes, the package's directory is the one that\n// contains the first file.\ntype PkgSpec struct {\n\tPath string // package path (\"\" => use package declaration)\n\tFiles []*ast.File // ASTs of already-parsed files\n\tFilenames []string // names of files to be parsed\n}\n\n// A Program is a Go program loaded from source as specified by a Config.\ntype Program struct {\n\tFset *token.FileSet // the file set for this program\n\n\t// Created[i] contains the initial package whose ASTs or\n\t// filenames were supplied by Config.CreatePkgs[i], followed by\n\t// the external test package, if any, of each package in\n\t// Config.ImportPkgs ordered by ImportPath.\n\t//\n\t// NOTE: these files must not import \"C\". Cgo preprocessing is\n\t// only performed on imported packages, not ad hoc packages.\n\t//\n\t// TODO(adonovan): we need to copy and adapt the logic of\n\t// goFilesPackage (from $GOROOT/src/cmd/go/build.go) and make\n\t// Config.Import and Config.Create methods return the same kind\n\t// of entity, essentially a build.Package.\n\t// Perhaps we can even reuse that type directly.\n\tCreated []*PackageInfo\n\n\t// Imported contains the initially imported packages,\n\t// as specified by Config.ImportPkgs.\n\tImported map[string]*PackageInfo\n\n\t// AllPackages contains the PackageInfo of every package\n\t// encountered by Load: all initial packages and all\n\t// dependencies, including incomplete ones.\n\tAllPackages map[*types.Package]*PackageInfo\n\n\t// importMap is the canonical mapping of package paths to\n\t// packages. It contains all Imported initial packages, but not\n\t// Created ones, and all imported dependencies.\n\timportMap map[string]*types.Package\n}\n\n// PackageInfo holds the ASTs and facts derived by the type-checker\n// for a single package.\n//\n// Not mutated once exposed via the API.\n//\ntype PackageInfo struct {\n\tPkg *types.Package\n\tImportable bool // true if 'import \"Pkg.Path()\"' would resolve to this\n\tTransitivelyErrorFree bool // true if Pkg and all its dependencies are free of errors\n\tFiles []*ast.File // syntax trees for the package's files\n\tErrors []error // non-nil if the package had errors\n\ttypes.Info // type-checker deductions.\n\tdir string // package directory\n\n\tchecker *types.Checker // transient type-checker state\n\terrorFunc func(error)\n}\n\nfunc (info *PackageInfo) String() string { return info.Pkg.Path() }\n\nfunc (info *PackageInfo) appendError(err error) {\n\tif info.errorFunc != nil {\n\t\tinfo.errorFunc(err)\n\t} else {\n\t\tfmt.Fprintln(os.Stderr, err)\n\t}\n\tinfo.Errors = append(info.Errors, err)\n}\n\nfunc (conf *Config) fset() *token.FileSet {\n\tif conf.Fset == nil {\n\t\tconf.Fset = token.NewFileSet()\n\t}\n\treturn conf.Fset\n}\n\n// ParseFile is a convenience function (intended for testing) that invokes\n// the parser using the Config's FileSet, which is initialized if nil.\n//\n// src specifies the parser input as a string, []byte, or io.Reader, and\n// filename is its apparent name. If src is nil, the contents of\n// filename are read from the file system.\n//\nfunc (conf *Config) ParseFile(filename string, src interface{}) (*ast.File, error) {\n\t// TODO(adonovan): use conf.build() etc like parseFiles does.\n\treturn parser.ParseFile(conf.fset(), filename, src, conf.ParserMode)\n}\n\n// FromArgsUsage is a partial usage message that applications calling\n// FromArgs may wish to include in their -help output.\nconst FromArgsUsage = `\n is a list of arguments denoting a set of initial packages.\nIt may take one of two forms:\n\n1. A list of *.go source files.\n\n All of the specified files are loaded, parsed and type-checked\n as a single package. All the files must belong to the same directory.\n\n2. A list of import paths, each denoting a package.\n\n The package's directory is found relative to the $GOROOT and\n $GOPATH using similar logic to 'go build', and the *.go files in\n that directory are loaded, parsed and type-checked as a single\n package.\n\n In addition, all *_test.go files in the directory are then loaded\n and parsed. Those files whose package declaration equals that of\n the non-*_test.go files are included in the primary package. Test\n files whose package declaration ends with \"_test\" are type-checked\n as another package, the 'external' test package, so that a single\n import path may denote two packages. (Whether this behaviour is\n enabled is tool-specific, and may depend on additional flags.)\n\nA '--' argument terminates the list of packages.\n`\n\n// FromArgs interprets args as a set of initial packages to load from\n// source and updates the configuration. It returns the list of\n// unconsumed arguments.\n//\n// It is intended for use in command-line interfaces that require a\n// set of initial packages to be specified; see FromArgsUsage message\n// for details.\n//\n// Only superficial errors are reported at this stage; errors dependent\n// on I/O are detected during Load.\n//\nfunc (conf *Config) FromArgs(args []string, xtest bool) ([]string, error) {\n\tvar rest []string\n\tfor i, arg := range args {\n\t\tif arg == \"--\" {\n\t\t\trest = args[i+1:]\n\t\t\targs = args[:i]\n\t\t\tbreak // consume \"--\" and return the remaining args\n\t\t}\n\t}\n\n\tif len(args) > 0 && strings.HasSuffix(args[0], \".go\") {\n\t\t// Assume args is a list of a *.go files\n\t\t// denoting a single ad hoc package.\n\t\tfor _, arg := range args {\n\t\t\tif !strings.HasSuffix(arg, \".go\") {\n\t\t\t\treturn nil, fmt.Errorf(\"named files must be .go files: %s\", arg)\n\t\t\t}\n\t\t}\n\t\tconf.CreateFromFilenames(\"\", args...)\n\t} else {\n\t\t// Assume args are directories each denoting a\n\t\t// package and (perhaps) an external test, iff xtest.\n\t\tfor _, arg := range args {\n\t\t\tif xtest {\n\t\t\t\tconf.ImportWithTests(arg)\n\t\t\t} else {\n\t\t\t\tconf.Import(arg)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn rest, nil\n}\n\n// CreateFromFilenames is a convenience function that adds\n// a conf.CreatePkgs entry to create a package of the specified *.go\n// files.\n//\nfunc (conf *Config) CreateFromFilenames(path string, filenames ...string) {\n\tconf.CreatePkgs = append(conf.CreatePkgs, PkgSpec{Path: path, Filenames: filenames})\n}\n\n// CreateFromFiles is a convenience function that adds a conf.CreatePkgs\n// entry to create package of the specified path and parsed files.\n//\nfunc (conf *Config) CreateFromFiles(path string, files ...*ast.File) {\n\tconf.CreatePkgs = append(conf.CreatePkgs, PkgSpec{Path: path, Files: files})\n}\n\n// ImportWithTests is a convenience function that adds path to\n// ImportPkgs, the set of initial source packages located relative to\n// $GOPATH. The package will be augmented by any *_test.go files in\n// its directory that contain a \"package x\" (not \"package x_test\")\n// declaration.\n//\n// In addition, if any *_test.go files contain a \"package x_test\"\n// declaration, an additional package comprising just those files will\n// be added to CreatePkgs.\n//\nfunc (conf *Config) ImportWithTests(path string) { conf.addImport(path, true) }\n\n// Import is a convenience function that adds path to ImportPkgs, the\n// set of initial packages that will be imported from source.\n//\nfunc (conf *Config) Import(path string) { conf.addImport(path, false) }\n\nfunc (conf *Config) addImport(path string, tests bool) {\n\tif path == \"C\" {\n\t\treturn // ignore; not a real package\n\t}\n\tif conf.ImportPkgs == nil {\n\t\tconf.ImportPkgs = make(map[string]bool)\n\t}\n\tconf.ImportPkgs[path] = conf.ImportPkgs[path] || tests\n}\n\n// PathEnclosingInterval returns the PackageInfo and ast.Node that\n// contain source interval [start, end), and all the node's ancestors\n// up to the AST root. It searches all ast.Files of all packages in prog.\n// exact is defined as for astutil.PathEnclosingInterval.\n//\n// The zero value is returned if not found.\n//\nfunc (prog *Program) PathEnclosingInterval(start, end token.Pos) (pkg *PackageInfo, path []ast.Node, exact bool) {\n\tfor _, info := range prog.AllPackages {\n\t\tfor _, f := range info.Files {\n\t\t\tif f.Pos() == token.NoPos {\n\t\t\t\t// This can happen if the parser saw\n\t\t\t\t// too many errors and bailed out.\n\t\t\t\t// (Use parser.AllErrors to prevent that.)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif !tokenFileContainsPos(prog.Fset.File(f.Pos()), start) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif path, exact := astutil.PathEnclosingInterval(f, start, end); path != nil {\n\t\t\t\treturn info, path, exact\n\t\t\t}\n\t\t}\n\t}\n\treturn nil, nil, false\n}\n\n// InitialPackages returns a new slice containing the set of initial\n// packages (Created + Imported) in unspecified order.\n//\nfunc (prog *Program) InitialPackages() []*PackageInfo {\n\tinfos := make([]*PackageInfo, 0, len(prog.Created)+len(prog.Imported))\n\tinfos = append(infos, prog.Created...)\n\tfor _, info := range prog.Imported {\n\t\tinfos = append(infos, info)\n\t}\n\treturn infos\n}\n\n// Package returns the ASTs and results of type checking for the\n// specified package.\nfunc (prog *Program) Package(path string) *PackageInfo {\n\tif info, ok := prog.AllPackages[prog.importMap[path]]; ok {\n\t\treturn info\n\t}\n\tfor _, info := range prog.Created {\n\t\tif path == info.Pkg.Path() {\n\t\t\treturn info\n\t\t}\n\t}\n\treturn nil\n}\n\n// ---------- Implementation ----------\n\n// importer holds the working state of the algorithm.\ntype importer struct {\n\tconf *Config // the client configuration\n\tstart time.Time // for logging\n\n\tprogMu sync.Mutex // guards prog\n\tprog *Program // the resulting program\n\n\t// findpkg is a memoization of FindPackage.\n\tfindpkgMu sync.Mutex // guards findpkg\n\tfindpkg map[findpkgKey]*findpkgValue\n\n\timportedMu sync.Mutex // guards imported\n\timported map[string]*importInfo // all imported packages (incl. failures) by import path\n\n\t// import dependency graph: graph[x][y] => x imports y\n\t//\n\t// Since non-importable packages cannot be cyclic, we ignore\n\t// their imports, thus we only need the subgraph over importable\n\t// packages. Nodes are identified by their import paths.\n\tgraphMu sync.Mutex\n\tgraph map[string]map[string]bool\n}\n\ntype findpkgKey struct {\n\timportPath string\n\tfromDir string\n\tmode build.ImportMode\n}\n\ntype findpkgValue struct {\n\tready chan struct{} // closed to broadcast readiness\n\tbp *build.Package\n\terr error\n}\n\n// importInfo tracks the success or failure of a single import.\n//\n// Upon completion, exactly one of info and err is non-nil:\n// info on successful creation of a package, err otherwise.\n// A successful package may still contain type errors.\n//\ntype importInfo struct {\n\tpath string // import path\n\tinfo *PackageInfo // results of typechecking (including errors)\n\tcomplete chan struct{} // closed to broadcast that info is set.\n}\n\n// awaitCompletion blocks until ii is complete,\n// i.e. the info field is safe to inspect.\nfunc (ii *importInfo) awaitCompletion() {\n\t<-ii.complete // wait for close\n}\n\n// Complete marks ii as complete.\n// Its info and err fields will not be subsequently updated.\nfunc (ii *importInfo) Complete(info *PackageInfo) {\n\tif info == nil {\n\t\tpanic(\"info == nil\")\n\t}\n\tii.info = info\n\tclose(ii.complete)\n}\n\ntype importError struct {\n\tpath string // import path\n\terr error // reason for failure to create a package\n}\n\n// Load creates the initial packages specified by conf.{Create,Import}Pkgs,\n// loading their dependencies packages as needed.\n//\n// On success, Load returns a Program containing a PackageInfo for\n// each package. On failure, it returns an error.\n//\n// If AllowErrors is true, Load will return a Program even if some\n// packages contained I/O, parser or type errors, or if dependencies\n// were missing. (Such errors are accessible via PackageInfo.Errors. If\n// false, Load will fail if any package had an error.\n//\n// It is an error if no packages were loaded.\n//\nfunc (conf *Config) Load() (*Program, error) {\n\t// Create a simple default error handler for parse/type errors.\n\tif conf.TypeChecker.Error == nil {\n\t\tconf.TypeChecker.Error = func(e error) { fmt.Fprintln(os.Stderr, e) }\n\t}\n\n\t// Set default working directory for relative package references.\n\tif conf.Cwd == \"\" {\n\t\tvar err error\n\t\tconf.Cwd, err = os.Getwd()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\t// Install default FindPackage hook using go/build logic.\n\tif conf.FindPackage == nil {\n\t\tconf.FindPackage = (*build.Context).Import\n\t}\n\n\tprog := &Program{\n\t\tFset: conf.fset(),\n\t\tImported: make(map[string]*PackageInfo),\n\t\timportMap: make(map[string]*types.Package),\n\t\tAllPackages: make(map[*types.Package]*PackageInfo),\n\t}\n\n\timp := importer{\n\t\tconf: conf,\n\t\tprog: prog,\n\t\tfindpkg: make(map[findpkgKey]*findpkgValue),\n\t\timported: make(map[string]*importInfo),\n\t\tstart: time.Now(),\n\t\tgraph: make(map[string]map[string]bool),\n\t}\n\n\t// -- loading proper (concurrent phase) --------------------------------\n\n\tvar errpkgs []string // packages that contained errors\n\n\t// Load the initially imported packages and their dependencies,\n\t// in parallel.\n\t// No vendor check on packages imported from the command line.\n\tinfos, importErrors := imp.importAll(\"\", conf.Cwd, conf.ImportPkgs, ignoreVendor)\n\tfor _, ie := range importErrors {\n\t\tconf.TypeChecker.Error(ie.err) // failed to create package\n\t\terrpkgs = append(errpkgs, ie.path)\n\t}\n\tfor _, info := range infos {\n\t\tprog.Imported[info.Pkg.Path()] = info\n\t}\n\n\t// Augment the designated initial packages by their tests.\n\t// Dependencies are loaded in parallel.\n\tvar xtestPkgs []*build.Package\n\tfor importPath, augment := range conf.ImportPkgs {\n\t\tif !augment {\n\t\t\tcontinue\n\t\t}\n\n\t\t// No vendor check on packages imported from command line.\n\t\tbp, err := imp.findPackage(importPath, conf.Cwd, ignoreVendor)\n\t\tif err != nil {\n\t\t\t// Package not found, or can't even parse package declaration.\n\t\t\t// Already reported by previous loop; ignore it.\n\t\t\tcontinue\n\t\t}\n\n\t\t// Needs external test package?\n\t\tif len(bp.XTestGoFiles) > 0 {\n\t\t\txtestPkgs = append(xtestPkgs, bp)\n\t\t}\n\n\t\t// Consult the cache using the canonical package path.\n\t\tpath := bp.ImportPath\n\t\timp.importedMu.Lock() // (unnecessary, we're sequential here)\n\t\tii, ok := imp.imported[path]\n\t\t// Paranoid checks added due to issue #11012.\n\t\tif !ok {\n\t\t\t// Unreachable.\n\t\t\t// The previous loop called importAll and thus\n\t\t\t// startLoad for each path in ImportPkgs, which\n\t\t\t// populates imp.imported[path] with a non-zero value.\n\t\t\tpanic(fmt.Sprintf(\"imported[%q] not found\", path))\n\t\t}\n\t\tif ii == nil {\n\t\t\t// Unreachable.\n\t\t\t// The ii values in this loop are the same as in\n\t\t\t// the previous loop, which enforced the invariant\n\t\t\t// that at least one of ii.err and ii.info is non-nil.\n\t\t\tpanic(fmt.Sprintf(\"imported[%q] == nil\", path))\n\t\t}\n\t\tif ii.info == nil {\n\t\t\t// Unreachable.\n\t\t\t// awaitCompletion has the postcondition\n\t\t\t// ii.info != nil.\n\t\t\tpanic(fmt.Sprintf(\"imported[%q].info = nil\", path))\n\t\t}\n\t\tinfo := ii.info\n\t\timp.importedMu.Unlock()\n\n\t\t// Parse the in-package test files.\n\t\tfiles, errs := imp.conf.parsePackageFiles(bp, 't')\n\t\tfor _, err := range errs {\n\t\t\tinfo.appendError(err)\n\t\t}\n\n\t\t// The test files augmenting package P cannot be imported,\n\t\t// but may import packages that import P,\n\t\t// so we must disable the cycle check.\n\t\timp.addFiles(info, files, false)\n\t}\n\n\tcreatePkg := func(path, dir string, files []*ast.File, errs []error) {\n\t\tinfo := imp.newPackageInfo(path, dir)\n\t\tfor _, err := range errs {\n\t\t\tinfo.appendError(err)\n\t\t}\n\n\t\t// Ad hoc packages are non-importable,\n\t\t// so no cycle check is needed.\n\t\t// addFiles loads dependencies in parallel.\n\t\timp.addFiles(info, files, false)\n\t\tprog.Created = append(prog.Created, info)\n\t}\n\n\t// Create packages specified by conf.CreatePkgs.\n\tfor _, cp := range conf.CreatePkgs {\n\t\tfiles, errs := parseFiles(conf.fset(), conf.build(), nil, conf.Cwd, cp.Filenames, conf.ParserMode)\n\t\tfiles = append(files, cp.Files...)\n\n\t\tpath := cp.Path\n\t\tif path == \"\" {\n\t\t\tif len(files) > 0 {\n\t\t\t\tpath = files[0].Name.Name\n\t\t\t} else {\n\t\t\t\tpath = \"(unnamed)\"\n\t\t\t}\n\t\t}\n\n\t\tdir := conf.Cwd\n\t\tif len(files) > 0 && files[0].Pos().IsValid() {\n\t\t\tdir = filepath.Dir(conf.fset().File(files[0].Pos()).Name())\n\t\t}\n\t\tcreatePkg(path, dir, files, errs)\n\t}\n\n\t// Create external test packages.\n\tsort.Sort(byImportPath(xtestPkgs))\n\tfor _, bp := range xtestPkgs {\n\t\tfiles, errs := imp.conf.parsePackageFiles(bp, 'x')\n\t\tcreatePkg(bp.ImportPath+\"_test\", bp.Dir, files, errs)\n\t}\n\n\t// -- finishing up (sequential) ----------------------------------------\n\n\tif len(prog.Imported)+len(prog.Created) == 0 {\n\t\treturn nil, errors.New(\"no initial packages were loaded\")\n\t}\n\n\t// Create infos for indirectly imported packages.\n\t// e.g. incomplete packages without syntax, loaded from export data.\n\tfor _, obj := range prog.importMap {\n\t\tinfo := prog.AllPackages[obj]\n\t\tif info == nil {\n\t\t\tprog.AllPackages[obj] = &PackageInfo{Pkg: obj, Importable: true}\n\t\t} else {\n\t\t\t// finished\n\t\t\tinfo.checker = nil\n\t\t\tinfo.errorFunc = nil\n\t\t}\n\t}\n\n\tif !conf.AllowErrors {\n\t\t// Report errors in indirectly imported packages.\n\t\tfor _, info := range prog.AllPackages {\n\t\t\tif len(info.Errors) > 0 {\n\t\t\t\terrpkgs = append(errpkgs, info.Pkg.Path())\n\t\t\t}\n\t\t}\n\t\tif errpkgs != nil {\n\t\t\tvar more string\n\t\t\tif len(errpkgs) > 3 {\n\t\t\t\tmore = fmt.Sprintf(\" and %d more\", len(errpkgs)-3)\n\t\t\t\terrpkgs = errpkgs[:3]\n\t\t\t}\n\t\t\treturn nil, fmt.Errorf(\"couldn't load packages due to errors: %s%s\",\n\t\t\t\tstrings.Join(errpkgs, \", \"), more)\n\t\t}\n\t}\n\n\tmarkErrorFreePackages(prog.AllPackages)\n\n\treturn prog, nil\n}\n\ntype byImportPath []*build.Package\n\nfunc (b byImportPath) Len() int { return len(b) }\nfunc (b byImportPath) Less(i, j int) bool { return b[i].ImportPath < b[j].ImportPath }\nfunc (b byImportPath) Swap(i, j int) { b[i], b[j] = b[j], b[i] }\n\n// markErrorFreePackages sets the TransitivelyErrorFree flag on all\n// applicable packages.\nfunc markErrorFreePackages(allPackages map[*types.Package]*PackageInfo) {\n\t// Build the transpose of the import graph.\n\timportedBy := make(map[*types.Package]map[*types.Package]bool)\n\tfor P := range allPackages {\n\t\tfor _, Q := range P.Imports() {\n\t\t\tclients, ok := importedBy[Q]\n\t\t\tif !ok {\n\t\t\t\tclients = make(map[*types.Package]bool)\n\t\t\t\timportedBy[Q] = clients\n\t\t\t}\n\t\t\tclients[P] = true\n\t\t}\n\t}\n\n\t// Find all packages reachable from some error package.\n\treachable := make(map[*types.Package]bool)\n\tvar visit func(*types.Package)\n\tvisit = func(p *types.Package) {\n\t\tif !reachable[p] {\n\t\t\treachable[p] = true\n\t\t\tfor q := range importedBy[p] {\n\t\t\t\tvisit(q)\n\t\t\t}\n\t\t}\n\t}\n\tfor _, info := range allPackages {\n\t\tif len(info.Errors) > 0 {\n\t\t\tvisit(info.Pkg)\n\t\t}\n\t}\n\n\t// Mark the others as \"transitively error-free\".\n\tfor _, info := range allPackages {\n\t\tif !reachable[info.Pkg] {\n\t\t\tinfo.TransitivelyErrorFree = true\n\t\t}\n\t}\n}\n\n// build returns the effective build context.\nfunc (conf *Config) build() *build.Context {\n\tif conf.Build != nil {\n\t\treturn conf.Build\n\t}\n\treturn &build.Default\n}\n\n// parsePackageFiles enumerates the files belonging to package path,\n// then loads, parses and returns them, plus a list of I/O or parse\n// errors that were encountered.\n//\n// 'which' indicates which files to include:\n// 'g': include non-test *.go source files (GoFiles + processed CgoFiles)\n// 't': include in-package *_test.go source files (TestGoFiles)\n// 'x': include external *_test.go source files. (XTestGoFiles)\n//\nfunc (conf *Config) parsePackageFiles(bp *build.Package, which rune) ([]*ast.File, []error) {\n\tif bp.ImportPath == \"unsafe\" {\n\t\treturn nil, nil\n\t}\n\tvar filenames []string\n\tswitch which {\n\tcase 'g':\n\t\tfilenames = bp.GoFiles\n\tcase 't':\n\t\tfilenames = bp.TestGoFiles\n\tcase 'x':\n\t\tfilenames = bp.XTestGoFiles\n\tdefault:\n\t\tpanic(which)\n\t}\n\n\tfiles, errs := parseFiles(conf.fset(), conf.build(), conf.DisplayPath, bp.Dir, filenames, conf.ParserMode)\n\n\t// Preprocess CgoFiles and parse the outputs (sequentially).\n\tif which == 'g' && bp.CgoFiles != nil {\n\t\tcgofiles, err := cgo.ProcessFiles(bp, conf.fset(), conf.DisplayPath, conf.ParserMode)\n\t\tif err != nil {\n\t\t\terrs = append(errs, err)\n\t\t} else {\n\t\t\tfiles = append(files, cgofiles...)\n\t\t}\n\t}\n\n\treturn files, errs\n}\n\n// doImport imports the package denoted by path.\n// It implements the types.Importer signature.\n//\n// It returns an error if a package could not be created\n// (e.g. go/build or parse error), but type errors are reported via\n// the types.Config.Error callback (the first of which is also saved\n// in the package's PackageInfo).\n//\n// Idempotent.\n//\nfunc (imp *importer) doImport(from *PackageInfo, to string) (*types.Package, error) {\n\tif to == \"C\" {\n\t\t// This should be unreachable, but ad hoc packages are\n\t\t// not currently subject to cgo preprocessing.\n\t\t// See https://golang.org/issue/11627.\n\t\treturn nil, fmt.Errorf(`the loader doesn't cgo-process ad hoc packages like %q; see Go issue 11627`,\n\t\t\tfrom.Pkg.Path())\n\t}\n\n\tbp, err := imp.findPackage(to, from.dir, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// The standard unsafe package is handled specially,\n\t// and has no PackageInfo.\n\tif bp.ImportPath == \"unsafe\" {\n\t\treturn types.Unsafe, nil\n\t}\n\n\t// Look for the package in the cache using its canonical path.\n\tpath := bp.ImportPath\n\timp.importedMu.Lock()\n\tii := imp.imported[path]\n\timp.importedMu.Unlock()\n\tif ii == nil {\n\t\tpanic(\"internal error: unexpected import: \" + path)\n\t}\n\tif ii.info != nil {\n\t\treturn ii.info.Pkg, nil\n\t}\n\n\t// Import of incomplete package: this indicates a cycle.\n\tfromPath := from.Pkg.Path()\n\tif cycle := imp.findPath(path, fromPath); cycle != nil {\n\t\tcycle = append([]string{fromPath}, cycle...)\n\t\treturn nil, fmt.Errorf(\"import cycle: %s\", strings.Join(cycle, \" -> \"))\n\t}\n\n\tpanic(\"internal error: import of incomplete (yet acyclic) package: \" + fromPath)\n}\n\n// findPackage locates the package denoted by the importPath in the\n// specified directory.\nfunc (imp *importer) findPackage(importPath, fromDir string, mode build.ImportMode) (*build.Package, error) {\n\t// We use a non-blocking duplicate-suppressing cache (gopl.io §9.7)\n\t// to avoid holding the lock around FindPackage.\n\tkey := findpkgKey{importPath, fromDir, mode}\n\timp.findpkgMu.Lock()\n\tv, ok := imp.findpkg[key]\n\tif ok {\n\t\t// cache hit\n\t\timp.findpkgMu.Unlock()\n\n\t\t<-v.ready // wait for entry to become ready\n\t} else {\n\t\t// Cache miss: this goroutine becomes responsible for\n\t\t// populating the map entry and broadcasting its readiness.\n\t\tv = &findpkgValue{ready: make(chan struct{})}\n\t\timp.findpkg[key] = v\n\t\timp.findpkgMu.Unlock()\n\n\t\tioLimit <- true\n\t\tv.bp, v.err = imp.conf.FindPackage(imp.conf.build(), importPath, fromDir, mode)\n\t\t<-ioLimit\n\n\t\tif _, ok := v.err.(*build.NoGoError); ok {\n\t\t\tv.err = nil // empty directory is not an error\n\t\t}\n\n\t\tclose(v.ready) // broadcast ready condition\n\t}\n\treturn v.bp, v.err\n}\n\n// importAll loads, parses, and type-checks the specified packages in\n// parallel and returns their completed importInfos in unspecified order.\n//\n// fromPath is the package path of the importing package, if it is\n// importable, \"\" otherwise. It is used for cycle detection.\n//\n// fromDir is the directory containing the import declaration that\n// caused these imports.\n//\nfunc (imp *importer) importAll(fromPath, fromDir string, imports map[string]bool, mode build.ImportMode) (infos []*PackageInfo, errors []importError) {\n\t// TODO(adonovan): opt: do the loop in parallel once\n\t// findPackage is non-blocking.\n\tvar pending []*importInfo\n\tfor importPath := range imports {\n\t\tbp, err := imp.findPackage(importPath, fromDir, mode)\n\t\tif err != nil {\n\t\t\terrors = append(errors, importError{\n\t\t\t\tpath: importPath,\n\t\t\t\terr: err,\n\t\t\t})\n\t\t\tcontinue\n\t\t}\n\t\tpending = append(pending, imp.startLoad(bp))\n\t}\n\n\tif fromPath != \"\" {\n\t\t// We're loading a set of imports.\n\t\t//\n\t\t// We must record graph edges from the importing package\n\t\t// to its dependencies, and check for cycles.\n\t\timp.graphMu.Lock()\n\t\tdeps, ok := imp.graph[fromPath]\n\t\tif !ok {\n\t\t\tdeps = make(map[string]bool)\n\t\t\timp.graph[fromPath] = deps\n\t\t}\n\t\tfor _, ii := range pending {\n\t\t\tdeps[ii.path] = true\n\t\t}\n\t\timp.graphMu.Unlock()\n\t}\n\n\tfor _, ii := range pending {\n\t\tif fromPath != \"\" {\n\t\t\tif cycle := imp.findPath(ii.path, fromPath); cycle != nil {\n\t\t\t\t// Cycle-forming import: we must not await its\n\t\t\t\t// completion since it would deadlock.\n\t\t\t\t//\n\t\t\t\t// We don't record the error in ii since\n\t\t\t\t// the error is really associated with the\n\t\t\t\t// cycle-forming edge, not the package itself.\n\t\t\t\t// (Also it would complicate the\n\t\t\t\t// invariants of importPath completion.)\n\t\t\t\tif trace {\n\t\t\t\t\tfmt.Fprintf(os.Stderr, \"import cycle: %q\\n\", cycle)\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\tii.awaitCompletion()\n\t\tinfos = append(infos, ii.info)\n\t}\n\n\treturn infos, errors\n}\n\n// findPath returns an arbitrary path from 'from' to 'to' in the import\n// graph, or nil if there was none.\nfunc (imp *importer) findPath(from, to string) []string {\n\timp.graphMu.Lock()\n\tdefer imp.graphMu.Unlock()\n\n\tseen := make(map[string]bool)\n\tvar search func(stack []string, importPath string) []string\n\tsearch = func(stack []string, importPath string) []string {\n\t\tif !seen[importPath] {\n\t\t\tseen[importPath] = true\n\t\t\tstack = append(stack, importPath)\n\t\t\tif importPath == to {\n\t\t\t\treturn stack\n\t\t\t}\n\t\t\tfor x := range imp.graph[importPath] {\n\t\t\t\tif p := search(stack, x); p != nil {\n\t\t\t\t\treturn p\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t}\n\treturn search(make([]string, 0, 20), from)\n}\n\n// startLoad initiates the loading, parsing and type-checking of the\n// specified package and its dependencies, if it has not already begun.\n//\n// It returns an importInfo, not necessarily in a completed state. The\n// caller must call awaitCompletion() before accessing its info field.\n//\n// startLoad is concurrency-safe and idempotent.\n//\nfunc (imp *importer) startLoad(bp *build.Package) *importInfo {\n\tpath := bp.ImportPath\n\timp.importedMu.Lock()\n\tii, ok := imp.imported[path]\n\tif !ok {\n\t\tii = &importInfo{path: path, complete: make(chan struct{})}\n\t\timp.imported[path] = ii\n\t\tgo func() {\n\t\t\tinfo := imp.load(bp)\n\t\t\tii.Complete(info)\n\t\t}()\n\t}\n\timp.importedMu.Unlock()\n\n\treturn ii\n}\n\n// load implements package loading by parsing Go source files\n// located by go/build.\nfunc (imp *importer) load(bp *build.Package) *PackageInfo {\n\tinfo := imp.newPackageInfo(bp.ImportPath, bp.Dir)\n\tinfo.Importable = true\n\tfiles, errs := imp.conf.parsePackageFiles(bp, 'g')\n\tfor _, err := range errs {\n\t\tinfo.appendError(err)\n\t}\n\n\timp.addFiles(info, files, true)\n\n\timp.progMu.Lock()\n\timp.prog.importMap[bp.ImportPath] = info.Pkg\n\timp.progMu.Unlock()\n\n\treturn info\n}\n\n// addFiles adds and type-checks the specified files to info, loading\n// their dependencies if needed. The order of files determines the\n// package initialization order. It may be called multiple times on the\n// same package. Errors are appended to the info.Errors field.\n//\n// cycleCheck determines whether the imports within files create\n// dependency edges that should be checked for potential cycles.\n//\nfunc (imp *importer) addFiles(info *PackageInfo, files []*ast.File, cycleCheck bool) {\n\t// Ensure the dependencies are loaded, in parallel.\n\tvar fromPath string\n\tif cycleCheck {\n\t\tfromPath = info.Pkg.Path()\n\t}\n\t// TODO(adonovan): opt: make the caller do scanImports.\n\t// Callers with a build.Package can skip it.\n\timp.importAll(fromPath, info.dir, scanImports(files), 0)\n\n\tif trace {\n\t\tfmt.Fprintf(os.Stderr, \"%s: start %q (%d)\\n\",\n\t\t\ttime.Since(imp.start), info.Pkg.Path(), len(files))\n\t}\n\n\t// Don't call checker.Files on Unsafe, even with zero files,\n\t// because it would mutate the package, which is a global.\n\tif info.Pkg == types.Unsafe {\n\t\tif len(files) > 0 {\n\t\t\tpanic(`\"unsafe\" package contains unexpected files`)\n\t\t}\n\t} else {\n\t\t// Ignore the returned (first) error since we\n\t\t// already collect them all in the PackageInfo.\n\t\tinfo.checker.Files(files)\n\t\tinfo.Files = append(info.Files, files...)\n\t}\n\n\tif imp.conf.AfterTypeCheck != nil {\n\t\timp.conf.AfterTypeCheck(info, files)\n\t}\n\n\tif trace {\n\t\tfmt.Fprintf(os.Stderr, \"%s: stop %q\\n\",\n\t\t\ttime.Since(imp.start), info.Pkg.Path())\n\t}\n}\n\nfunc (imp *importer) newPackageInfo(path, dir string) *PackageInfo {\n\tvar pkg *types.Package\n\tif path == \"unsafe\" {\n\t\tpkg = types.Unsafe\n\t} else {\n\t\tpkg = types.NewPackage(path, \"\")\n\t}\n\tinfo := &PackageInfo{\n\t\tPkg: pkg,\n\t\tInfo: types.Info{\n\t\t\tTypes: make(map[ast.Expr]types.TypeAndValue),\n\t\t\tDefs: make(map[*ast.Ident]types.Object),\n\t\t\tUses: make(map[*ast.Ident]types.Object),\n\t\t\tImplicits: make(map[ast.Node]types.Object),\n\t\t\tScopes: make(map[ast.Node]*types.Scope),\n\t\t\tSelections: make(map[*ast.SelectorExpr]*types.Selection),\n\t\t},\n\t\terrorFunc: imp.conf.TypeChecker.Error,\n\t\tdir: dir,\n\t}\n\n\t// Copy the types.Config so we can vary it across PackageInfos.\n\ttc := imp.conf.TypeChecker\n\ttc.IgnoreFuncBodies = false\n\tif f := imp.conf.TypeCheckFuncBodies; f != nil {\n\t\ttc.IgnoreFuncBodies = !f(path)\n\t}\n\ttc.Importer = closure{imp, info}\n\ttc.Error = info.appendError // appendError wraps the user's Error function\n\n\tinfo.checker = types.NewChecker(&tc, imp.conf.fset(), pkg, &info.Info)\n\timp.progMu.Lock()\n\timp.prog.AllPackages[pkg] = info\n\timp.progMu.Unlock()\n\treturn info\n}\n\ntype closure struct {\n\timp *importer\n\tinfo *PackageInfo\n}\n\nfunc (c closure) Import(to string) (*types.Package, error) { return c.imp.doImport(c.info, to) }\n" }, { "path": "vendor/golang.org/x/tools/go/loader/util.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage loader\n\nimport (\n\t\"go/ast\"\n\t\"go/build\"\n\t\"go/parser\"\n\t\"go/token\"\n\t\"io\"\n\t\"os\"\n\t\"strconv\"\n\t\"sync\"\n\n\t\"golang.org/x/tools/go/buildutil\"\n)\n\n// We use a counting semaphore to limit\n// the number of parallel I/O calls per process.\nvar ioLimit = make(chan bool, 10)\n\n// parseFiles parses the Go source files within directory dir and\n// returns the ASTs of the ones that could be at least partially parsed,\n// along with a list of I/O and parse errors encountered.\n//\n// I/O is done via ctxt, which may specify a virtual file system.\n// displayPath is used to transform the filenames attached to the ASTs.\n//\nfunc parseFiles(fset *token.FileSet, ctxt *build.Context, displayPath func(string) string, dir string, files []string, mode parser.Mode) ([]*ast.File, []error) {\n\tif displayPath == nil {\n\t\tdisplayPath = func(path string) string { return path }\n\t}\n\tvar wg sync.WaitGroup\n\tn := len(files)\n\tparsed := make([]*ast.File, n)\n\terrors := make([]error, n)\n\tfor i, file := range files {\n\t\tif !buildutil.IsAbsPath(ctxt, file) {\n\t\t\tfile = buildutil.JoinPath(ctxt, dir, file)\n\t\t}\n\t\twg.Add(1)\n\t\tgo func(i int, file string) {\n\t\t\tioLimit <- true // wait\n\t\t\tdefer func() {\n\t\t\t\twg.Done()\n\t\t\t\t<-ioLimit // signal\n\t\t\t}()\n\t\t\tvar rd io.ReadCloser\n\t\t\tvar err error\n\t\t\tif ctxt.OpenFile != nil {\n\t\t\t\trd, err = ctxt.OpenFile(file)\n\t\t\t} else {\n\t\t\t\trd, err = os.Open(file)\n\t\t\t}\n\t\t\tif err != nil {\n\t\t\t\terrors[i] = err // open failed\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// ParseFile may return both an AST and an error.\n\t\t\tparsed[i], errors[i] = parser.ParseFile(fset, displayPath(file), rd, mode)\n\t\t\trd.Close()\n\t\t}(i, file)\n\t}\n\twg.Wait()\n\n\t// Eliminate nils, preserving order.\n\tvar o int\n\tfor _, f := range parsed {\n\t\tif f != nil {\n\t\t\tparsed[o] = f\n\t\t\to++\n\t\t}\n\t}\n\tparsed = parsed[:o]\n\n\to = 0\n\tfor _, err := range errors {\n\t\tif err != nil {\n\t\t\terrors[o] = err\n\t\t\to++\n\t\t}\n\t}\n\terrors = errors[:o]\n\n\treturn parsed, errors\n}\n\n// scanImports returns the set of all import paths from all\n// import specs in the specified files.\nfunc scanImports(files []*ast.File) map[string]bool {\n\timports := make(map[string]bool)\n\tfor _, f := range files {\n\t\tfor _, decl := range f.Decls {\n\t\t\tif decl, ok := decl.(*ast.GenDecl); ok && decl.Tok == token.IMPORT {\n\t\t\t\tfor _, spec := range decl.Specs {\n\t\t\t\t\tspec := spec.(*ast.ImportSpec)\n\n\t\t\t\t\t// NB: do not assume the program is well-formed!\n\t\t\t\t\tpath, err := strconv.Unquote(spec.Path.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tcontinue // quietly ignore the error\n\t\t\t\t\t}\n\t\t\t\t\tif path == \"C\" {\n\t\t\t\t\t\tcontinue // skip pseudopackage\n\t\t\t\t\t}\n\t\t\t\t\timports[path] = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn imports\n}\n\n// ---------- Internal helpers ----------\n\n// TODO(adonovan): make this a method: func (*token.File) Contains(token.Pos)\nfunc tokenFileContainsPos(f *token.File, pos token.Pos) bool {\n\tp := int(pos)\n\tbase := f.Base()\n\treturn base <= p && p < base+f.Size()\n}\n" }, { "path": "vendor/google.golang.org/appengine/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/google.golang.org/appengine/cloudsql/cloudsql.go", "content": "// Copyright 2013 Google Inc. All rights reserved.\n// Use of this source code is governed by the Apache 2.0\n// license that can be found in the LICENSE file.\n\n/*\nPackage cloudsql exposes access to Google Cloud SQL databases.\n\nThis package does not work in App Engine \"flexible environment\".\n\nThis package is intended for MySQL drivers to make App Engine-specific\nconnections. Applications should use this package through database/sql:\nSelect a pure Go MySQL driver that supports this package, and use sql.Open\nwith protocol \"cloudsql\" and an address of the Cloud SQL instance.\n\nA Go MySQL driver that has been tested to work well with Cloud SQL\nis the go-sql-driver:\n\timport \"database/sql\"\n\timport _ \"github.com/go-sql-driver/mysql\"\n\n\tdb, err := sql.Open(\"mysql\", \"user@cloudsql(project-id:instance-name)/dbname\")\n\n\nAnother driver that works well with Cloud SQL is the mymysql driver:\n\timport \"database/sql\"\n\timport _ \"github.com/ziutek/mymysql/godrv\"\n\n\tdb, err := sql.Open(\"mymysql\", \"cloudsql:instance-name*dbname/user/password\")\n\n\nUsing either of these drivers, you can perform a standard SQL query.\nThis example assumes there is a table named 'users' with\ncolumns 'first_name' and 'last_name':\n\n\trows, err := db.Query(\"SELECT first_name, last_name FROM users\")\n\tif err != nil {\n\t\tlog.Errorf(ctx, \"db.Query: %v\", err)\n\t}\n\tdefer rows.Close()\n\n\tfor rows.Next() {\n\t\tvar firstName string\n\t\tvar lastName string\n\t\tif err := rows.Scan(&firstName, &lastName); err != nil {\n\t\t\tlog.Errorf(ctx, \"rows.Scan: %v\", err)\n\t\t\tcontinue\n\t\t}\n\t\tlog.Infof(ctx, \"First: %v - Last: %v\", firstName, lastName)\n\t}\n\tif err := rows.Err(); err != nil {\n\t\tlog.Errorf(ctx, \"Row error: %v\", err)\n\t}\n*/\npackage cloudsql\n\nimport (\n\t\"net\"\n)\n\n// Dial connects to the named Cloud SQL instance.\nfunc Dial(instance string) (net.Conn, error) {\n\treturn connect(instance)\n}\n" }, { "path": "vendor/google.golang.org/appengine/cloudsql/cloudsql_classic.go", "content": "// Copyright 2013 Google Inc. All rights reserved.\n// Use of this source code is governed by the Apache 2.0\n// license that can be found in the LICENSE file.\n\n// +build appengine\n\npackage cloudsql\n\nimport (\n\t\"net\"\n\n\t\"appengine/cloudsql\"\n)\n\nfunc connect(instance string) (net.Conn, error) {\n\treturn cloudsql.Dial(instance)\n}\n" }, { "path": "vendor/google.golang.org/appengine/cloudsql/cloudsql_vm.go", "content": "// Copyright 2013 Google Inc. All rights reserved.\n// Use of this source code is governed by the Apache 2.0\n// license that can be found in the LICENSE file.\n\n// +build !appengine\n\npackage cloudsql\n\nimport (\n\t\"errors\"\n\t\"net\"\n)\n\nfunc connect(instance string) (net.Conn, error) {\n\treturn nil, errors.New(`cloudsql: not supported in App Engine \"flexible environment\"`)\n}\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/.gitignore", "content": "# Compiled Object files, Static and Dynamic libs (Shared Objects)\n*.o\n*.a\n*.so\n\n# Folders\n_obj\n_test\n\n# Architecture specific extensions/prefixes\n*.[568vq]\n[568vq].out\n\n*.cgo1.go\n*.cgo2.c\n_cgo_defun.c\n_cgo_gotypes.go\n_cgo_export.*\n\n_testmain.go\n\n*.exe\n*.test\n*.prof\n*.test\n*.out\n*.txt\ncover.html\nREADME.html" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2015 Dean Karn\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/README.md", "content": "Package validator\n================\n[![Join the chat at https://gitter.im/bluesuncorp/validator](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/go-playground/validator?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n![Project status](https://img.shields.io/badge/version-8.18.2-green.svg)\n[![Build Status](https://semaphoreci.com/api/v1/projects/ec20115f-ef1b-4c7d-9393-cc76aba74eb4/530054/badge.svg)](https://semaphoreci.com/joeybloggs/validator)\n[![Coverage Status](https://coveralls.io/repos/go-playground/validator/badge.svg?branch=v8&service=github)](https://coveralls.io/github/go-playground/validator?branch=v8)\n[![Go Report Card](https://goreportcard.com/badge/github.com/go-playground/validator)](https://goreportcard.com/report/github.com/go-playground/validator)\n[![GoDoc](https://godoc.org/gopkg.in/go-playground/validator.v8?status.svg)](https://godoc.org/gopkg.in/go-playground/validator.v8)\n![License](https://img.shields.io/dub/l/vibe-d.svg)\n\nPackage validator implements value validations for structs and individual fields based on tags.\n\nIt has the following **unique** features:\n\n- Cross Field and Cross Struct validations by using validation tags or custom validators. \n- Slice, Array and Map diving, which allows any or all levels of a multidimensional field to be validated. \n- Handles type interface by determining it's underlying type prior to validation.\n- Handles custom field types such as sql driver Valuer see [Valuer](https://golang.org/src/database/sql/driver/types.go?s=1210:1293#L29)\n- Alias validation tags, which allows for mapping of several validations to a single tag for easier defining of validations on structs\n- Extraction of custom defined Field Name e.g. can specify to extract the JSON name while validating and have it available in the resulting FieldError\n\nInstallation\n------------\n\nUse go get.\n\n\tgo get gopkg.in/go-playground/validator.v8\n\nor to update\n\n\tgo get -u gopkg.in/go-playground/validator.v8\n\nThen import the validator package into your own code.\n\n\timport \"gopkg.in/go-playground/validator.v8\"\n\nError Return Value\n-------\n\nValidation functions return type error\n\nThey return type error to avoid the issue discussed in the following, where err is always != nil:\n\n* http://stackoverflow.com/a/29138676/3158232\n* https://github.com/go-playground/validator/issues/134\n\nvalidator only returns nil or ValidationErrors as type error; so in you code all you need to do\nis check if the error returned is not nil, and if it's not type cast it to type ValidationErrors\nlike so:\n\n```go\nerr := validate.Struct(mystruct)\nvalidationErrors := err.(validator.ValidationErrors)\n ```\n\nUsage and documentation\n------\n\nPlease see http://godoc.org/gopkg.in/go-playground/validator.v8 for detailed usage docs.\n\n##### Examples:\n\nStruct & Field validation\n```go\npackage main\n\nimport (\n\t\"fmt\"\n\n\t\"gopkg.in/go-playground/validator.v8\"\n)\n\n// User contains user information\ntype User struct {\n\tFirstName string `validate:\"required\"`\n\tLastName string `validate:\"required\"`\n\tAge uint8 `validate:\"gte=0,lte=130\"`\n\tEmail string `validate:\"required,email\"`\n\tFavouriteColor string `validate:\"hexcolor|rgb|rgba\"`\n\tAddresses []*Address `validate:\"required,dive,required\"` // a person can have a home and cottage...\n}\n\n// Address houses a users address information\ntype Address struct {\n\tStreet string `validate:\"required\"`\n\tCity string `validate:\"required\"`\n\tPlanet string `validate:\"required\"`\n\tPhone string `validate:\"required\"`\n}\n\nvar validate *validator.Validate\n\nfunc main() {\n\n\tconfig := &validator.Config{TagName: \"validate\"}\n\n\tvalidate = validator.New(config)\n\n\tvalidateStruct()\n\tvalidateField()\n}\n\nfunc validateStruct() {\n\n\taddress := &Address{\n\t\tStreet: \"Eavesdown Docks\",\n\t\tPlanet: \"Persphone\",\n\t\tPhone: \"none\",\n\t}\n\n\tuser := &User{\n\t\tFirstName: \"Badger\",\n\t\tLastName: \"Smith\",\n\t\tAge: 135,\n\t\tEmail: \"Badger.Smith@gmail.com\",\n\t\tFavouriteColor: \"#000\",\n\t\tAddresses: []*Address{address},\n\t}\n\n\t// returns nil or ValidationErrors ( map[string]*FieldError )\n\terrs := validate.Struct(user)\n\n\tif errs != nil {\n\n\t\tfmt.Println(errs) // output: Key: \"User.Age\" Error:Field validation for \"Age\" failed on the \"lte\" tag\n\t\t//\t Key: \"User.Addresses[0].City\" Error:Field validation for \"City\" failed on the \"required\" tag\n\t\terr := errs.(validator.ValidationErrors)[\"User.Addresses[0].City\"]\n\t\tfmt.Println(err.Field) // output: City\n\t\tfmt.Println(err.Tag) // output: required\n\t\tfmt.Println(err.Kind) // output: string\n\t\tfmt.Println(err.Type) // output: string\n\t\tfmt.Println(err.Param) // output:\n\t\tfmt.Println(err.Value) // output:\n\n\t\t// from here you can create your own error messages in whatever language you wish\n\t\treturn\n\t}\n\n\t// save user to database\n}\n\nfunc validateField() {\n\tmyEmail := \"joeybloggs.gmail.com\"\n\n\terrs := validate.Field(myEmail, \"required,email\")\n\n\tif errs != nil {\n\t\tfmt.Println(errs) // output: Key: \"\" Error:Field validation for \"\" failed on the \"email\" tag\n\t\treturn\n\t}\n\n\t// email ok, move on\n}\n```\n\nCustom Field Type\n```go\npackage main\n\nimport (\n\t\"database/sql\"\n\t\"database/sql/driver\"\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"gopkg.in/go-playground/validator.v8\"\n)\n\n// DbBackedUser User struct\ntype DbBackedUser struct {\n\tName sql.NullString `validate:\"required\"`\n\tAge sql.NullInt64 `validate:\"required\"`\n}\n\nfunc main() {\n\n\tconfig := &validator.Config{TagName: \"validate\"}\n\n\tvalidate := validator.New(config)\n\n\t// register all sql.Null* types to use the ValidateValuer CustomTypeFunc\n\tvalidate.RegisterCustomTypeFunc(ValidateValuer, sql.NullString{}, sql.NullInt64{}, sql.NullBool{}, sql.NullFloat64{})\n\n\tx := DbBackedUser{Name: sql.NullString{String: \"\", Valid: true}, Age: sql.NullInt64{Int64: 0, Valid: false}}\n\terrs := validate.Struct(x)\n\n\tif len(errs.(validator.ValidationErrors)) > 0 {\n\t\tfmt.Printf(\"Errs:\\n%+v\\n\", errs)\n\t}\n}\n\n// ValidateValuer implements validator.CustomTypeFunc\nfunc ValidateValuer(field reflect.Value) interface{} {\n\tif valuer, ok := field.Interface().(driver.Valuer); ok {\n\t\tval, err := valuer.Value()\n\t\tif err == nil {\n\t\t\treturn val\n\t\t}\n\t\t// handle the error how you want\n\t}\n\treturn nil\n}\n```\n\nStruct Level Validation\n```go\npackage main\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"gopkg.in/go-playground/validator.v8\"\n)\n\n// User contains user information\ntype User struct {\n\tFirstName string `json:\"fname\"`\n\tLastName string `json:\"lname\"`\n\tAge uint8 `validate:\"gte=0,lte=130\"`\n\tEmail string `validate:\"required,email\"`\n\tFavouriteColor string `validate:\"hexcolor|rgb|rgba\"`\n\tAddresses []*Address `validate:\"required,dive,required\"` // a person can have a home and cottage...\n}\n\n// Address houses a users address information\ntype Address struct {\n\tStreet string `validate:\"required\"`\n\tCity string `validate:\"required\"`\n\tPlanet string `validate:\"required\"`\n\tPhone string `validate:\"required\"`\n}\n\nvar validate *validator.Validate\n\nfunc main() {\n\n\tconfig := &validator.Config{TagName: \"validate\"}\n\n\tvalidate = validator.New(config)\n\tvalidate.RegisterStructValidation(UserStructLevelValidation, User{})\n\n\tvalidateStruct()\n}\n\n// UserStructLevelValidation contains custom struct level validations that don't always\n// make sense at the field validation level. For Example this function validates that either\n// FirstName or LastName exist; could have done that with a custom field validation but then\n// would have had to add it to both fields duplicating the logic + overhead, this way it's\n// only validated once.\n//\n// NOTE: you may ask why wouldn't I just do this outside of validator, because doing this way\n// hooks right into validator and you can combine with validation tags and still have a\n// common error output format.\nfunc UserStructLevelValidation(v *validator.Validate, structLevel *validator.StructLevel) {\n\n\tuser := structLevel.CurrentStruct.Interface().(User)\n\n\tif len(user.FirstName) == 0 && len(user.LastName) == 0 {\n\t\tstructLevel.ReportError(reflect.ValueOf(user.FirstName), \"FirstName\", \"fname\", \"fnameorlname\")\n\t\tstructLevel.ReportError(reflect.ValueOf(user.LastName), \"LastName\", \"lname\", \"fnameorlname\")\n\t}\n\n\t// plus can to more, even with different tag than \"fnameorlname\"\n}\n\nfunc validateStruct() {\n\n\taddress := &Address{\n\t\tStreet: \"Eavesdown Docks\",\n\t\tPlanet: \"Persphone\",\n\t\tPhone: \"none\",\n\t\tCity: \"Unknown\",\n\t}\n\n\tuser := &User{\n\t\tFirstName: \"\",\n\t\tLastName: \"\",\n\t\tAge: 45,\n\t\tEmail: \"Badger.Smith@gmail.com\",\n\t\tFavouriteColor: \"#000\",\n\t\tAddresses: []*Address{address},\n\t}\n\n\t// returns nil or ValidationErrors ( map[string]*FieldError )\n\terrs := validate.Struct(user)\n\n\tif errs != nil {\n\n\t\tfmt.Println(errs) // output: Key: 'User.LastName' Error:Field validation for 'LastName' failed on the 'fnameorlname' tag\n\t\t//\t Key: 'User.FirstName' Error:Field validation for 'FirstName' failed on the 'fnameorlname' tag\n\t\terr := errs.(validator.ValidationErrors)[\"User.FirstName\"]\n\t\tfmt.Println(err.Field) // output: FirstName\n\t\tfmt.Println(err.Tag) // output: fnameorlname\n\t\tfmt.Println(err.Kind) // output: string\n\t\tfmt.Println(err.Type) // output: string\n\t\tfmt.Println(err.Param) // output:\n\t\tfmt.Println(err.Value) // output:\n\n\t\t// from here you can create your own error messages in whatever language you wish\n\t\treturn\n\t}\n\n\t// save user to database\n}\n```\n\nBenchmarks\n------\n###### Run on MacBook Pro (Retina, 15-inch, Late 2013) 2.6 GHz Intel Core i7 16 GB 1600 MHz DDR3 using Go version go1.5.3 darwin/amd64\n```go\nPASS\nBenchmarkFieldSuccess-8 \t20000000\t 118 ns/op\t 0 B/op\t 0 allocs/op\nBenchmarkFieldFailure-8 \t 2000000\t 758 ns/op\t 432 B/op\t 4 allocs/op\nBenchmarkFieldDiveSuccess-8 \t 500000\t 2471 ns/op\t 464 B/op\t 28 allocs/op\nBenchmarkFieldDiveFailure-8 \t 500000\t 3172 ns/op\t 896 B/op\t 32 allocs/op\nBenchmarkFieldCustomTypeSuccess-8 \t 5000000\t 300 ns/op\t 32 B/op\t 2 allocs/op\nBenchmarkFieldCustomTypeFailure-8 \t 2000000\t 775 ns/op\t 432 B/op\t 4 allocs/op\nBenchmarkFieldOrTagSuccess-8 \t 1000000\t 1122 ns/op\t 4 B/op\t 1 allocs/op\nBenchmarkFieldOrTagFailure-8 \t 1000000\t 1167 ns/op\t 448 B/op\t 6 allocs/op\nBenchmarkStructLevelValidationSuccess-8 \t 3000000\t 548 ns/op\t 160 B/op\t 5 allocs/op\nBenchmarkStructLevelValidationFailure-8 \t 3000000\t 558 ns/op\t 160 B/op\t 5 allocs/op\nBenchmarkStructSimpleCustomTypeSuccess-8 \t 2000000\t 623 ns/op\t 36 B/op\t 3 allocs/op\nBenchmarkStructSimpleCustomTypeFailure-8 \t 1000000\t 1381 ns/op\t 640 B/op\t 9 allocs/op\nBenchmarkStructPartialSuccess-8 \t 1000000\t 1036 ns/op\t 272 B/op\t 9 allocs/op\nBenchmarkStructPartialFailure-8 \t 1000000\t 1734 ns/op\t 730 B/op\t 14 allocs/op\nBenchmarkStructExceptSuccess-8 \t 2000000\t 888 ns/op\t 250 B/op\t 7 allocs/op\nBenchmarkStructExceptFailure-8 \t 1000000\t 1036 ns/op\t 272 B/op\t 9 allocs/op\nBenchmarkStructSimpleCrossFieldSuccess-8 \t 2000000\t 773 ns/op\t 80 B/op\t 4 allocs/op\nBenchmarkStructSimpleCrossFieldFailure-8 \t 1000000\t 1487 ns/op\t 536 B/op\t 9 allocs/op\nBenchmarkStructSimpleCrossStructCrossFieldSuccess-8\t 1000000\t 1261 ns/op\t 112 B/op\t 7 allocs/op\nBenchmarkStructSimpleCrossStructCrossFieldFailure-8\t 1000000\t 2055 ns/op\t 576 B/op\t 12 allocs/op\nBenchmarkStructSimpleSuccess-8 \t 3000000\t 519 ns/op\t 4 B/op\t 1 allocs/op\nBenchmarkStructSimpleFailure-8 \t 1000000\t 1429 ns/op\t 640 B/op\t 9 allocs/op\nBenchmarkStructSimpleSuccessParallel-8 \t10000000\t 146 ns/op\t 4 B/op\t 1 allocs/op\nBenchmarkStructSimpleFailureParallel-8 \t 2000000\t 551 ns/op\t 640 B/op\t 9 allocs/op\nBenchmarkStructComplexSuccess-8 \t 500000\t 3269 ns/op\t 244 B/op\t 15 allocs/op\nBenchmarkStructComplexFailure-8 \t 200000\t 8436 ns/op\t 3609 B/op\t 60 allocs/op\nBenchmarkStructComplexSuccessParallel-8 \t 1000000\t 1024 ns/op\t 244 B/op\t 15 allocs/op\nBenchmarkStructComplexFailureParallel-8 \t 500000\t 3536 ns/op\t 3609 B/op\t 60 allocs/op\n```\n\nComplimentary Software\n----------------------\n\nHere is a list of software that compliments using this library either pre or post validation.\n\n* [form](https://github.com/go-playground/form) - Decodes url.Values into Go value(s) and Encodes Go value(s) into url.Values. Dual Array and Full map support.\n* [Conform](https://github.com/leebenson/conform) - Trims, sanitizes & scrubs data based on struct tags.\n\nHow to Contribute\n------\n\nThere will always be a development branch for each version i.e. `v1-development`. In order to contribute, \nplease make your pull requests against those branches.\n\nIf the changes being proposed or requested are breaking changes, please create an issue, for discussion\nor create a pull request against the highest development branch for example this package has a\nv1 and v1-development branch however, there will also be a v2-development branch even though v2 doesn't exist yet.\n\nI strongly encourage everyone whom creates a custom validation function to contribute them and\nhelp make this package even better.\n\nLicense\n------\nDistributed under MIT License, please see license file in code for more details.\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/baked_in.go", "content": "package validator\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"net/url\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode/utf8\"\n)\n\n// BakedInAliasValidators is a default mapping of a single validationstag that\n// defines a common or complex set of validation(s) to simplify\n// adding validation to structs. i.e. set key \"_ageok\" and the tags\n// are \"gt=0,lte=130\" or key \"_preferredname\" and tags \"omitempty,gt=0,lte=60\"\nvar bakedInAliasValidators = map[string]string{\n\t\"iscolor\": \"hexcolor|rgb|rgba|hsl|hsla\",\n}\n\n// BakedInValidators is the default map of ValidationFunc\n// you can add, remove or even replace items to suite your needs,\n// or even disregard and use your own map if so desired.\nvar bakedInValidators = map[string]Func{\n\t\"required\": HasValue,\n\t\"len\": HasLengthOf,\n\t\"min\": HasMinOf,\n\t\"max\": HasMaxOf,\n\t\"eq\": IsEq,\n\t\"ne\": IsNe,\n\t\"lt\": IsLt,\n\t\"lte\": IsLte,\n\t\"gt\": IsGt,\n\t\"gte\": IsGte,\n\t\"eqfield\": IsEqField,\n\t\"eqcsfield\": IsEqCrossStructField,\n\t\"necsfield\": IsNeCrossStructField,\n\t\"gtcsfield\": IsGtCrossStructField,\n\t\"gtecsfield\": IsGteCrossStructField,\n\t\"ltcsfield\": IsLtCrossStructField,\n\t\"ltecsfield\": IsLteCrossStructField,\n\t\"nefield\": IsNeField,\n\t\"gtefield\": IsGteField,\n\t\"gtfield\": IsGtField,\n\t\"ltefield\": IsLteField,\n\t\"ltfield\": IsLtField,\n\t\"alpha\": IsAlpha,\n\t\"alphanum\": IsAlphanum,\n\t\"numeric\": IsNumeric,\n\t\"number\": IsNumber,\n\t\"hexadecimal\": IsHexadecimal,\n\t\"hexcolor\": IsHEXColor,\n\t\"rgb\": IsRGB,\n\t\"rgba\": IsRGBA,\n\t\"hsl\": IsHSL,\n\t\"hsla\": IsHSLA,\n\t\"email\": IsEmail,\n\t\"url\": IsURL,\n\t\"uri\": IsURI,\n\t\"base64\": IsBase64,\n\t\"contains\": Contains,\n\t\"containsany\": ContainsAny,\n\t\"containsrune\": ContainsRune,\n\t\"excludes\": Excludes,\n\t\"excludesall\": ExcludesAll,\n\t\"excludesrune\": ExcludesRune,\n\t\"isbn\": IsISBN,\n\t\"isbn10\": IsISBN10,\n\t\"isbn13\": IsISBN13,\n\t\"uuid\": IsUUID,\n\t\"uuid3\": IsUUID3,\n\t\"uuid4\": IsUUID4,\n\t\"uuid5\": IsUUID5,\n\t\"ascii\": IsASCII,\n\t\"printascii\": IsPrintableASCII,\n\t\"multibyte\": HasMultiByteCharacter,\n\t\"datauri\": IsDataURI,\n\t\"latitude\": IsLatitude,\n\t\"longitude\": IsLongitude,\n\t\"ssn\": IsSSN,\n\t\"ipv4\": IsIPv4,\n\t\"ipv6\": IsIPv6,\n\t\"ip\": IsIP,\n\t\"cidrv4\": IsCIDRv4,\n\t\"cidrv6\": IsCIDRv6,\n\t\"cidr\": IsCIDR,\n\t\"tcp4_addr\": IsTCP4AddrResolvable,\n\t\"tcp6_addr\": IsTCP6AddrResolvable,\n\t\"tcp_addr\": IsTCPAddrResolvable,\n\t\"udp4_addr\": IsUDP4AddrResolvable,\n\t\"udp6_addr\": IsUDP6AddrResolvable,\n\t\"udp_addr\": IsUDPAddrResolvable,\n\t\"ip4_addr\": IsIP4AddrResolvable,\n\t\"ip6_addr\": IsIP6AddrResolvable,\n\t\"ip_addr\": IsIPAddrResolvable,\n\t\"unix_addr\": IsUnixAddrResolvable,\n\t\"mac\": IsMAC,\n}\n\n// IsMAC is the validation function for validating if the field's value is a valid MAC address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsMAC(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\t_, err := net.ParseMAC(field.String())\n\treturn err == nil\n}\n\n// IsCIDRv4 is the validation function for validating if the field's value is a valid v4 CIDR address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsCIDRv4(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tip, _, err := net.ParseCIDR(field.String())\n\n\treturn err == nil && ip.To4() != nil\n}\n\n// IsCIDRv6 is the validation function for validating if the field's value is a valid v6 CIDR address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsCIDRv6(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tip, _, err := net.ParseCIDR(field.String())\n\n\treturn err == nil && ip.To4() == nil\n}\n\n// IsCIDR is the validation function for validating if the field's value is a valid v4 or v6 CIDR address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsCIDR(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\t_, _, err := net.ParseCIDR(field.String())\n\n\treturn err == nil\n}\n\n// IsIPv4 is the validation function for validating if a value is a valid v4 IP address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIPv4(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tip := net.ParseIP(field.String())\n\n\treturn ip != nil && ip.To4() != nil\n}\n\n// IsIPv6 is the validation function for validating if the field's value is a valid v6 IP address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIPv6(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\tip := net.ParseIP(field.String())\n\n\treturn ip != nil && ip.To4() == nil\n}\n\n// IsIP is the validation function for validating if the field's value is a valid v4 or v6 IP address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIP(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tip := net.ParseIP(field.String())\n\n\treturn ip != nil\n}\n\n// IsSSN is the validation function for validating if the field's value is a valid SSN.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsSSN(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif field.Len() != 11 {\n\t\treturn false\n\t}\n\n\treturn sSNRegex.MatchString(field.String())\n}\n\n// IsLongitude is the validation function for validating if the field's value is a valid longitude coordinate.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLongitude(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn longitudeRegex.MatchString(field.String())\n}\n\n// IsLatitude is the validation function for validating if the field's value is a valid latitude coordinate.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLatitude(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn latitudeRegex.MatchString(field.String())\n}\n\n// IsDataURI is the validation function for validating if the field's value is a valid data URI.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsDataURI(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\turi := strings.SplitN(field.String(), \",\", 2)\n\n\tif len(uri) != 2 {\n\t\treturn false\n\t}\n\n\tif !dataURIRegex.MatchString(uri[0]) {\n\t\treturn false\n\t}\n\n\tfld := reflect.ValueOf(uri[1])\n\n\treturn IsBase64(v, topStruct, currentStructOrField, fld, fld.Type(), fld.Kind(), param)\n}\n\n// HasMultiByteCharacter is the validation function for validating if the field's value has a multi byte character.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc HasMultiByteCharacter(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif field.Len() == 0 {\n\t\treturn true\n\t}\n\n\treturn multibyteRegex.MatchString(field.String())\n}\n\n// IsPrintableASCII is the validation function for validating if the field's value is a valid printable ASCII character.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsPrintableASCII(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn printableASCIIRegex.MatchString(field.String())\n}\n\n// IsASCII is the validation function for validating if the field's value is a valid ASCII character.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsASCII(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn aSCIIRegex.MatchString(field.String())\n}\n\n// IsUUID5 is the validation function for validating if the field's value is a valid v5 UUID.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUUID5(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn uUID5Regex.MatchString(field.String())\n}\n\n// IsUUID4 is the validation function for validating if the field's value is a valid v4 UUID.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUUID4(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn uUID4Regex.MatchString(field.String())\n}\n\n// IsUUID3 is the validation function for validating if the field's value is a valid v3 UUID.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUUID3(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn uUID3Regex.MatchString(field.String())\n}\n\n// IsUUID is the validation function for validating if the field's value is a valid UUID of any version.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUUID(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn uUIDRegex.MatchString(field.String())\n}\n\n// IsISBN is the validation function for validating if the field's value is a valid v10 or v13 ISBN.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsISBN(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn IsISBN10(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) || IsISBN13(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// IsISBN13 is the validation function for validating if the field's value is a valid v13 ISBN.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsISBN13(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ts := strings.Replace(strings.Replace(field.String(), \"-\", \"\", 4), \" \", \"\", 4)\n\n\tif !iSBN13Regex.MatchString(s) {\n\t\treturn false\n\t}\n\n\tvar checksum int32\n\tvar i int32\n\n\tfactor := []int32{1, 3}\n\n\tfor i = 0; i < 12; i++ {\n\t\tchecksum += factor[i%2] * int32(s[i]-'0')\n\t}\n\n\treturn (int32(s[12]-'0'))-((10-(checksum%10))%10) == 0\n}\n\n// IsISBN10 is the validation function for validating if the field's value is a valid v10 ISBN.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsISBN10(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ts := strings.Replace(strings.Replace(field.String(), \"-\", \"\", 3), \" \", \"\", 3)\n\n\tif !iSBN10Regex.MatchString(s) {\n\t\treturn false\n\t}\n\n\tvar checksum int32\n\tvar i int32\n\n\tfor i = 0; i < 9; i++ {\n\t\tchecksum += (i + 1) * int32(s[i]-'0')\n\t}\n\n\tif s[9] == 'X' {\n\t\tchecksum += 10 * 10\n\t} else {\n\t\tchecksum += 10 * int32(s[9]-'0')\n\t}\n\n\treturn checksum%11 == 0\n}\n\n// ExcludesRune is the validation function for validating that the field's value does not contain the rune specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc ExcludesRune(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn !ContainsRune(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// ExcludesAll is the validation function for validating that the field's value does not contain any of the characters specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc ExcludesAll(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn !ContainsAny(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// Excludes is the validation function for validating that the field's value does not contain the text specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc Excludes(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn !Contains(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// ContainsRune is the validation function for validating that the field's value contains the rune specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc ContainsRune(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\tr, _ := utf8.DecodeRuneInString(param)\n\n\treturn strings.ContainsRune(field.String(), r)\n}\n\n// ContainsAny is the validation function for validating that the field's value contains any of the characters specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc ContainsAny(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn strings.ContainsAny(field.String(), param)\n}\n\n// Contains is the validation function for validating that the field's value contains the text specified within the param.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc Contains(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn strings.Contains(field.String(), param)\n}\n\n// IsNeField is the validation function for validating if the current field's value is not equal to the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsNeField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\n\tif !ok || currentKind != fieldKind {\n\t\treturn true\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() != currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() != currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() != currentField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) != int64(currentField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn true\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn !fieldTime.Equal(t)\n\t\t}\n\n\t}\n\n\t// default reflect.String:\n\treturn field.String() != currentField.String()\n}\n\n// IsNe is the validation function for validating that the field's value does not equal the provided param value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsNe(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn !IsEq(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// IsLteCrossStructField is the validation function for validating if the current field's value is less than or equal to the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLteCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, topKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || topKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() <= topField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() <= topField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() <= topField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) <= int64(topField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tfieldTime := field.Interface().(time.Time)\n\t\t\ttopTime := topField.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Before(topTime) || fieldTime.Equal(topTime)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn field.String() <= topField.String()\n}\n\n// IsLtCrossStructField is the validation function for validating if the current field's value is less than the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLtCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, topKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || topKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() < topField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() < topField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() < topField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) < int64(topField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tfieldTime := field.Interface().(time.Time)\n\t\t\ttopTime := topField.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Before(topTime)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn field.String() < topField.String()\n}\n\n// IsGteCrossStructField is the validation function for validating if the current field's value is greater than or equal to the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGteCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, topKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || topKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() >= topField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() >= topField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() >= topField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) >= int64(topField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tfieldTime := field.Interface().(time.Time)\n\t\t\ttopTime := topField.Interface().(time.Time)\n\n\t\t\treturn fieldTime.After(topTime) || fieldTime.Equal(topTime)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn field.String() >= topField.String()\n}\n\n// IsGtCrossStructField is the validation function for validating if the current field's value is greater than the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGtCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, topKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || topKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() > topField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() > topField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() > topField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) > int64(topField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tfieldTime := field.Interface().(time.Time)\n\t\t\ttopTime := topField.Interface().(time.Time)\n\n\t\t\treturn fieldTime.After(topTime)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn field.String() > topField.String()\n}\n\n// IsNeCrossStructField is the validation function for validating that the current field's value is not equal to the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsNeCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, currentKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn true\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn topField.Int() != field.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn topField.Uint() != field.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn topField.Float() != field.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(topField.Len()) != int64(field.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn true\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := field.Interface().(time.Time)\n\t\t\tfieldTime := topField.Interface().(time.Time)\n\n\t\t\treturn !fieldTime.Equal(t)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn topField.String() != field.String()\n}\n\n// IsEqCrossStructField is the validation function for validating that the current field's value is equal to the field, within a separate struct, specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsEqCrossStructField(v *Validate, topStruct reflect.Value, current reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\ttopField, topKind, ok := v.GetStructFieldOK(topStruct, param)\n\tif !ok || topKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn topField.Int() == field.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn topField.Uint() == field.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn topField.Float() == field.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(topField.Len()) == int64(field.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != topField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := field.Interface().(time.Time)\n\t\t\tfieldTime := topField.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Equal(t)\n\t\t}\n\t}\n\n\t// default reflect.String:\n\treturn topField.String() == field.String()\n}\n\n// IsEqField is the validation function for validating if the current field's value is equal to the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsEqField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn field.Int() == currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn field.Uint() == currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn field.Float() == currentField.Float()\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn int64(field.Len()) == int64(currentField.Len())\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Equal(t)\n\t\t}\n\n\t}\n\n\t// default reflect.String:\n\treturn field.String() == currentField.String()\n}\n\n// IsEq is the validation function for validating if the current field's value is equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsEq(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\treturn field.String() == param\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) == p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() == p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() == p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() == p\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// IsBase64 is the validation function for validating if the current field's value is a valid base 64.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsBase64(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn base64Regex.MatchString(field.String())\n}\n\n// IsURI is the validation function for validating if the current field's value is a valid URI.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsURI(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\n\t\ts := field.String()\n\n\t\t// checks needed as of Go 1.6 because of change https://github.com/golang/go/commit/617c93ce740c3c3cc28cdd1a0d712be183d0b328#diff-6c2d018290e298803c0c9419d8739885L195\n\t\t// emulate browser and strip the '#' suffix prior to validation. see issue-#237\n\t\tif i := strings.Index(s, \"#\"); i > -1 {\n\t\t\ts = s[:i]\n\t\t}\n\n\t\tif s == blank {\n\t\t\treturn false\n\t\t}\n\n\t\t_, err := url.ParseRequestURI(s)\n\n\t\treturn err == nil\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// IsURL is the validation function for validating if the current field's value is a valid URL.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsURL(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\n\t\tvar i int\n\t\ts := field.String()\n\n\t\t// checks needed as of Go 1.6 because of change https://github.com/golang/go/commit/617c93ce740c3c3cc28cdd1a0d712be183d0b328#diff-6c2d018290e298803c0c9419d8739885L195\n\t\t// emulate browser and strip the '#' suffix prior to validation. see issue-#237\n\t\tif i = strings.Index(s, \"#\"); i > -1 {\n\t\t\ts = s[:i]\n\t\t}\n\n\t\tif s == blank {\n\t\t\treturn false\n\t\t}\n\n\t\turl, err := url.ParseRequestURI(s)\n\n\t\tif err != nil || url.Scheme == blank {\n\t\t\treturn false\n\t\t}\n\n\t\treturn err == nil\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// IsEmail is the validation function for validating if the current field's value is a valid email address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsEmail(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn emailRegex.MatchString(field.String())\n}\n\n// IsHSLA is the validation function for validating if the current field's value is a valid HSLA color.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsHSLA(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn hslaRegex.MatchString(field.String())\n}\n\n// IsHSL is the validation function for validating if the current field's value is a valid HSL color.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsHSL(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn hslRegex.MatchString(field.String())\n}\n\n// IsRGBA is the validation function for validating if the current field's value is a valid RGBA color.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsRGBA(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn rgbaRegex.MatchString(field.String())\n}\n\n// IsRGB is the validation function for validating if the current field's value is a valid RGB color.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsRGB(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn rgbRegex.MatchString(field.String())\n}\n\n// IsHEXColor is the validation function for validating if the current field's value is a valid HEX color.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsHEXColor(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn hexcolorRegex.MatchString(field.String())\n}\n\n// IsHexadecimal is the validation function for validating if the current field's value is a valid hexadecimal.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsHexadecimal(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn hexadecimalRegex.MatchString(field.String())\n}\n\n// IsNumber is the validation function for validating if the current field's value is a valid number.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsNumber(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn numberRegex.MatchString(field.String())\n}\n\n// IsNumeric is the validation function for validating if the current field's value is a valid numeric value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsNumeric(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn numericRegex.MatchString(field.String())\n}\n\n// IsAlphanum is the validation function for validating if the current field's value is a valid alphanumeric value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsAlphanum(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn alphaNumericRegex.MatchString(field.String())\n}\n\n// IsAlpha is the validation function for validating if the current field's value is a valid alpha value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsAlpha(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn alphaRegex.MatchString(field.String())\n}\n\n// HasValue is the validation function for validating if the current field's value is not the default static value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc HasValue(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\tcase reflect.Slice, reflect.Map, reflect.Ptr, reflect.Interface, reflect.Chan, reflect.Func:\n\t\treturn !field.IsNil()\n\tdefault:\n\t\treturn field.IsValid() && field.Interface() != reflect.Zero(fieldType).Interface()\n\t}\n}\n\n// IsGteField is the validation function for validating if the current field's value is greater than or equal to the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGteField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\n\t\treturn field.Int() >= currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\n\t\treturn field.Uint() >= currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\n\t\treturn field.Float() >= currentField.Float()\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn fieldTime.After(t) || fieldTime.Equal(t)\n\t\t}\n\t}\n\n\t// default reflect.String\n\treturn len(field.String()) >= len(currentField.String())\n}\n\n// IsGtField is the validation function for validating if the current field's value is greater than the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGtField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\n\t\treturn field.Int() > currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\n\t\treturn field.Uint() > currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\n\t\treturn field.Float() > currentField.Float()\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn fieldTime.After(t)\n\t\t}\n\t}\n\n\t// default reflect.String\n\treturn len(field.String()) > len(currentField.String())\n}\n\n// IsGte is the validation function for validating if the current field's value is greater than or equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGte(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\tp := asInt(param)\n\n\t\treturn int64(utf8.RuneCountInString(field.String())) >= p\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) >= p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() >= p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() >= p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() >= p\n\n\tcase reflect.Struct:\n\n\t\tif fieldType == timeType || fieldType == timePtrType {\n\n\t\t\tnow := time.Now().UTC()\n\t\t\tt := field.Interface().(time.Time)\n\n\t\t\treturn t.After(now) || t.Equal(now)\n\t\t}\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// IsGt is the validation function for validating if the current field's value is greater than the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsGt(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\tp := asInt(param)\n\n\t\treturn int64(utf8.RuneCountInString(field.String())) > p\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) > p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() > p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() > p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() > p\n\tcase reflect.Struct:\n\n\t\tif fieldType == timeType || fieldType == timePtrType {\n\n\t\t\treturn field.Interface().(time.Time).After(time.Now().UTC())\n\t\t}\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// HasLengthOf is the validation function for validating if the current field's value is equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc HasLengthOf(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\tp := asInt(param)\n\n\t\treturn int64(utf8.RuneCountInString(field.String())) == p\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) == p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() == p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() == p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() == p\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// HasMinOf is the validation function for validating if the current field's value is greater than or equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc HasMinOf(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\treturn IsGte(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// IsLteField is the validation function for validating if the current field's value is less than or equal to the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLteField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\n\t\treturn field.Int() <= currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\n\t\treturn field.Uint() <= currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\n\t\treturn field.Float() <= currentField.Float()\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Before(t) || fieldTime.Equal(t)\n\t\t}\n\t}\n\n\t// default reflect.String\n\treturn len(field.String()) <= len(currentField.String())\n}\n\n// IsLtField is the validation function for validating if the current field's value is less than the field specified by the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLtField(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tcurrentField, currentKind, ok := v.GetStructFieldOK(currentStructOrField, param)\n\tif !ok || currentKind != fieldKind {\n\t\treturn false\n\t}\n\n\tswitch fieldKind {\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\n\t\treturn field.Int() < currentField.Int()\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\n\t\treturn field.Uint() < currentField.Uint()\n\n\tcase reflect.Float32, reflect.Float64:\n\n\t\treturn field.Float() < currentField.Float()\n\n\tcase reflect.Struct:\n\n\t\t// Not Same underlying type i.e. struct and time\n\t\tif fieldType != currentField.Type() {\n\t\t\treturn false\n\t\t}\n\n\t\tif fieldType == timeType {\n\n\t\t\tt := currentField.Interface().(time.Time)\n\t\t\tfieldTime := field.Interface().(time.Time)\n\n\t\t\treturn fieldTime.Before(t)\n\t\t}\n\t}\n\n\t// default reflect.String\n\treturn len(field.String()) < len(currentField.String())\n}\n\n// IsLte is the validation function for validating if the current field's value is less than or equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLte(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\tp := asInt(param)\n\n\t\treturn int64(utf8.RuneCountInString(field.String())) <= p\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) <= p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() <= p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() <= p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() <= p\n\n\tcase reflect.Struct:\n\n\t\tif fieldType == timeType || fieldType == timePtrType {\n\n\t\t\tnow := time.Now().UTC()\n\t\t\tt := field.Interface().(time.Time)\n\n\t\t\treturn t.Before(now) || t.Equal(now)\n\t\t}\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// IsLt is the validation function for validating if the current field's value is less than the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsLt(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tswitch fieldKind {\n\n\tcase reflect.String:\n\t\tp := asInt(param)\n\n\t\treturn int64(utf8.RuneCountInString(field.String())) < p\n\n\tcase reflect.Slice, reflect.Map, reflect.Array:\n\t\tp := asInt(param)\n\n\t\treturn int64(field.Len()) < p\n\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tp := asInt(param)\n\n\t\treturn field.Int() < p\n\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tp := asUint(param)\n\n\t\treturn field.Uint() < p\n\n\tcase reflect.Float32, reflect.Float64:\n\t\tp := asFloat(param)\n\n\t\treturn field.Float() < p\n\n\tcase reflect.Struct:\n\n\t\tif fieldType == timeType || fieldType == timePtrType {\n\n\t\t\treturn field.Interface().(time.Time).Before(time.Now().UTC())\n\t\t}\n\t}\n\n\tpanic(fmt.Sprintf(\"Bad field type %T\", field.Interface()))\n}\n\n// HasMaxOf is the validation function for validating if the current field's value is less than or equal to the param's value.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc HasMaxOf(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\treturn IsLte(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param)\n}\n\n// IsTCP4AddrResolvable is the validation function for validating if the field's value is a resolvable tcp4 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsTCP4AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP4Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveTCPAddr(\"tcp4\", field.String())\n\treturn err == nil\n}\n\n// IsTCP6AddrResolvable is the validation function for validating if the field's value is a resolvable tcp6 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsTCP6AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP6Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveTCPAddr(\"tcp6\", field.String())\n\treturn err == nil\n}\n\n// IsTCPAddrResolvable is the validation function for validating if the field's value is a resolvable tcp address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsTCPAddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP4Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) &&\n\t\t!isIP6Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveTCPAddr(\"tcp\", field.String())\n\treturn err == nil\n}\n\n// IsUDP4AddrResolvable is the validation function for validating if the field's value is a resolvable udp4 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUDP4AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP4Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveUDPAddr(\"udp4\", field.String())\n\treturn err == nil\n}\n\n// IsUDP6AddrResolvable is the validation function for validating if the field's value is a resolvable udp6 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUDP6AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP6Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveUDPAddr(\"udp6\", field.String())\n\treturn err == nil\n}\n\n// IsUDPAddrResolvable is the validation function for validating if the field's value is a resolvable udp address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUDPAddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !isIP4Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) &&\n\t\t!isIP6Addr(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveUDPAddr(\"udp\", field.String())\n\treturn err == nil\n}\n\n// IsIP4AddrResolvable is the validation function for validating if the field's value is a resolvable ip4 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIP4AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !IsIPv4(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveIPAddr(\"ip4\", field.String())\n\treturn err == nil\n}\n\n// IsIP6AddrResolvable is the validation function for validating if the field's value is a resolvable ip6 address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIP6AddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !IsIPv6(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveIPAddr(\"ip6\", field.String())\n\treturn err == nil\n}\n\n// IsIPAddrResolvable is the validation function for validating if the field's value is a resolvable ip address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsIPAddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\tif !IsIP(v, topStruct, currentStructOrField, field, fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\t_, err := net.ResolveIPAddr(\"ip\", field.String())\n\treturn err == nil\n}\n\n// IsUnixAddrResolvable is the validation function for validating if the field's value is a resolvable unix address.\n// NOTE: This is exposed for use within your own custom functions and not intended to be called directly.\nfunc IsUnixAddrResolvable(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\t_, err := net.ResolveUnixAddr(\"unix\", field.String())\n\treturn err == nil\n}\n\nfunc isIP4Addr(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\tval := field.String()\n\n\tif idx := strings.LastIndex(val, \":\"); idx != -1 {\n\t\tval = val[0:idx]\n\t}\n\n\tif !IsIPv4(v, topStruct, currentStructOrField, reflect.ValueOf(val), fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\treturn true\n}\n\nfunc isIP6Addr(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\tval := field.String()\n\n\tif idx := strings.LastIndex(val, \":\"); idx != -1 {\n\t\tif idx != 0 && val[idx-1:idx] == \"]\" {\n\t\t\tval = val[1 : idx-1]\n\t\t}\n\t}\n\n\tif !IsIPv6(v, topStruct, currentStructOrField, reflect.ValueOf(val), fieldType, fieldKind, param) {\n\t\treturn false\n\t}\n\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/cache.go", "content": "package validator\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n)\n\ntype tagType uint8\n\nconst (\n\ttypeDefault tagType = iota\n\ttypeOmitEmpty\n\ttypeNoStructLevel\n\ttypeStructOnly\n\ttypeDive\n\ttypeOr\n\ttypeExists\n)\n\ntype structCache struct {\n\tlock sync.Mutex\n\tm atomic.Value // map[reflect.Type]*cStruct\n}\n\nfunc (sc *structCache) Get(key reflect.Type) (c *cStruct, found bool) {\n\tc, found = sc.m.Load().(map[reflect.Type]*cStruct)[key]\n\treturn\n}\n\nfunc (sc *structCache) Set(key reflect.Type, value *cStruct) {\n\n\tm := sc.m.Load().(map[reflect.Type]*cStruct)\n\n\tnm := make(map[reflect.Type]*cStruct, len(m)+1)\n\tfor k, v := range m {\n\t\tnm[k] = v\n\t}\n\tnm[key] = value\n\tsc.m.Store(nm)\n}\n\ntype tagCache struct {\n\tlock sync.Mutex\n\tm atomic.Value // map[string]*cTag\n}\n\nfunc (tc *tagCache) Get(key string) (c *cTag, found bool) {\n\tc, found = tc.m.Load().(map[string]*cTag)[key]\n\treturn\n}\n\nfunc (tc *tagCache) Set(key string, value *cTag) {\n\n\tm := tc.m.Load().(map[string]*cTag)\n\n\tnm := make(map[string]*cTag, len(m)+1)\n\tfor k, v := range m {\n\t\tnm[k] = v\n\t}\n\tnm[key] = value\n\ttc.m.Store(nm)\n}\n\ntype cStruct struct {\n\tName string\n\tfields map[int]*cField\n\tfn StructLevelFunc\n}\n\ntype cField struct {\n\tIdx int\n\tName string\n\tAltName string\n\tcTags *cTag\n}\n\ntype cTag struct {\n\ttag string\n\taliasTag string\n\tactualAliasTag string\n\tparam string\n\thasAlias bool\n\ttypeof tagType\n\thasTag bool\n\tfn Func\n\tnext *cTag\n}\n\nfunc (v *Validate) extractStructCache(current reflect.Value, sName string) *cStruct {\n\n\tv.structCache.lock.Lock()\n\tdefer v.structCache.lock.Unlock() // leave as defer! because if inner panics, it will never get unlocked otherwise!\n\n\ttyp := current.Type()\n\n\t// could have been multiple trying to access, but once first is done this ensures struct\n\t// isn't parsed again.\n\tcs, ok := v.structCache.Get(typ)\n\tif ok {\n\t\treturn cs\n\t}\n\n\tcs = &cStruct{Name: sName, fields: make(map[int]*cField), fn: v.structLevelFuncs[typ]}\n\n\tnumFields := current.NumField()\n\n\tvar ctag *cTag\n\tvar fld reflect.StructField\n\tvar tag string\n\tvar customName string\n\n\tfor i := 0; i < numFields; i++ {\n\n\t\tfld = typ.Field(i)\n\n\t\tif !fld.Anonymous && fld.PkgPath != blank {\n\t\t\tcontinue\n\t\t}\n\n\t\ttag = fld.Tag.Get(v.tagName)\n\n\t\tif tag == skipValidationTag {\n\t\t\tcontinue\n\t\t}\n\n\t\tcustomName = fld.Name\n\n\t\tif v.fieldNameTag != blank {\n\n\t\t\tname := strings.SplitN(fld.Tag.Get(v.fieldNameTag), \",\", 2)[0]\n\n\t\t\t// dash check is for json \"-\" (aka skipValidationTag) means don't output in json\n\t\t\tif name != \"\" && name != skipValidationTag {\n\t\t\t\tcustomName = name\n\t\t\t}\n\t\t}\n\n\t\t// NOTE: cannot use shared tag cache, because tags may be equal, but things like alias may be different\n\t\t// and so only struct level caching can be used instead of combined with Field tag caching\n\n\t\tif len(tag) > 0 {\n\t\t\tctag, _ = v.parseFieldTagsRecursive(tag, fld.Name, blank, false)\n\t\t} else {\n\t\t\t// even if field doesn't have validations need cTag for traversing to potential inner/nested\n\t\t\t// elements of the field.\n\t\t\tctag = new(cTag)\n\t\t}\n\n\t\tcs.fields[i] = &cField{Idx: i, Name: fld.Name, AltName: customName, cTags: ctag}\n\t}\n\n\tv.structCache.Set(typ, cs)\n\n\treturn cs\n}\n\nfunc (v *Validate) parseFieldTagsRecursive(tag string, fieldName string, alias string, hasAlias bool) (firstCtag *cTag, current *cTag) {\n\n\tvar t string\n\tvar ok bool\n\tnoAlias := len(alias) == 0\n\ttags := strings.Split(tag, tagSeparator)\n\n\tfor i := 0; i < len(tags); i++ {\n\n\t\tt = tags[i]\n\n\t\tif noAlias {\n\t\t\talias = t\n\t\t}\n\n\t\tif v.hasAliasValidators {\n\t\t\t// check map for alias and process new tags, otherwise process as usual\n\t\t\tif tagsVal, found := v.aliasValidators[t]; found {\n\n\t\t\t\tif i == 0 {\n\t\t\t\t\tfirstCtag, current = v.parseFieldTagsRecursive(tagsVal, fieldName, t, true)\n\t\t\t\t} else {\n\t\t\t\t\tnext, curr := v.parseFieldTagsRecursive(tagsVal, fieldName, t, true)\n\t\t\t\t\tcurrent.next, current = next, curr\n\n\t\t\t\t}\n\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tif i == 0 {\n\t\t\tcurrent = &cTag{aliasTag: alias, hasAlias: hasAlias, hasTag: true}\n\t\t\tfirstCtag = current\n\t\t} else {\n\t\t\tcurrent.next = &cTag{aliasTag: alias, hasAlias: hasAlias, hasTag: true}\n\t\t\tcurrent = current.next\n\t\t}\n\n\t\tswitch t {\n\n\t\tcase diveTag:\n\t\t\tcurrent.typeof = typeDive\n\t\t\tcontinue\n\n\t\tcase omitempty:\n\t\t\tcurrent.typeof = typeOmitEmpty\n\t\t\tcontinue\n\n\t\tcase structOnlyTag:\n\t\t\tcurrent.typeof = typeStructOnly\n\t\t\tcontinue\n\n\t\tcase noStructLevelTag:\n\t\t\tcurrent.typeof = typeNoStructLevel\n\t\t\tcontinue\n\n\t\tcase existsTag:\n\t\t\tcurrent.typeof = typeExists\n\t\t\tcontinue\n\n\t\tdefault:\n\n\t\t\t// if a pipe character is needed within the param you must use the utf8Pipe representation \"0x7C\"\n\t\t\torVals := strings.Split(t, orSeparator)\n\n\t\t\tfor j := 0; j < len(orVals); j++ {\n\n\t\t\t\tvals := strings.SplitN(orVals[j], tagKeySeparator, 2)\n\n\t\t\t\tif noAlias {\n\t\t\t\t\talias = vals[0]\n\t\t\t\t\tcurrent.aliasTag = alias\n\t\t\t\t} else {\n\t\t\t\t\tcurrent.actualAliasTag = t\n\t\t\t\t}\n\n\t\t\t\tif j > 0 {\n\t\t\t\t\tcurrent.next = &cTag{aliasTag: alias, actualAliasTag: current.actualAliasTag, hasAlias: hasAlias, hasTag: true}\n\t\t\t\t\tcurrent = current.next\n\t\t\t\t}\n\n\t\t\t\tcurrent.tag = vals[0]\n\t\t\t\tif len(current.tag) == 0 {\n\t\t\t\t\tpanic(strings.TrimSpace(fmt.Sprintf(invalidValidation, fieldName)))\n\t\t\t\t}\n\n\t\t\t\tif current.fn, ok = v.validationFuncs[current.tag]; !ok {\n\t\t\t\t\tpanic(strings.TrimSpace(fmt.Sprintf(undefinedValidation, fieldName)))\n\t\t\t\t}\n\n\t\t\t\tif len(orVals) > 1 {\n\t\t\t\t\tcurrent.typeof = typeOr\n\t\t\t\t}\n\n\t\t\t\tif len(vals) > 1 {\n\t\t\t\t\tcurrent.param = strings.Replace(strings.Replace(vals[1], utf8HexComma, \",\", -1), utf8Pipe, \"|\", -1)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn\n}\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/doc.go", "content": "/*\nPackage validator implements value validations for structs and individual fields\nbased on tags.\n\nIt can also handle Cross-Field and Cross-Struct validation for nested structs\nand has the ability to dive into arrays and maps of any type.\n\nWhy not a better error message?\nBecause this library intends for you to handle your own error messages.\n\nWhy should I handle my own errors?\nMany reasons. We built an internationalized application and needed to know the\nfield, and what validation failed so we could provide a localized error.\n\n\tif fieldErr.Field == \"Name\" {\n\t\tswitch fieldErr.ErrorTag\n\t\tcase \"required\":\n\t\t\treturn \"Translated string based on field + error\"\n\t\tdefault:\n\t\treturn \"Translated string based on field\"\n\t}\n\n\nValidation Functions Return Type error\n\nDoing things this way is actually the way the standard library does, see the\nfile.Open method here:\n\n\thttps://golang.org/pkg/os/#Open.\n\nThe authors return type \"error\" to avoid the issue discussed in the following,\nwhere err is always != nil:\n\n\thttp://stackoverflow.com/a/29138676/3158232\n\thttps://github.com/go-playground/validator/issues/134\n\nValidator only returns nil or ValidationErrors as type error; so, in your code\nall you need to do is check if the error returned is not nil, and if it's not\ntype cast it to type ValidationErrors like so err.(validator.ValidationErrors).\n\nCustom Functions\n\nCustom functions can be added. Example:\n\n\t// Structure\n\tfunc customFunc(v *Validate, topStruct reflect.Value, currentStructOrField reflect.Value, field reflect.Value, fieldType reflect.Type, fieldKind reflect.Kind, param string) bool {\n\n\t\tif whatever {\n\t\t\treturn false\n\t\t}\n\n\t\treturn true\n\t}\n\n\tvalidate.RegisterValidation(\"custom tag name\", customFunc)\n\t// NOTES: using the same tag name as an existing function\n\t// will overwrite the existing one\n\nCross-Field Validation\n\nCross-Field Validation can be done via the following tags:\n\t- eqfield\n\t- nefield\n\t- gtfield\n\t- gtefield\n\t- ltfield\n\t- ltefield\n\t- eqcsfield\n\t- necsfield\n\t- gtcsfield\n\t- ftecsfield\n\t- ltcsfield\n\t- ltecsfield\n\nIf, however, some custom cross-field validation is required, it can be done\nusing a custom validation.\n\nWhy not just have cross-fields validation tags (i.e. only eqcsfield and not\neqfield)?\n\nThe reason is efficiency. If you want to check a field within the same struct\n\"eqfield\" only has to find the field on the same struct (1 level). But, if we\nused \"eqcsfield\" it could be multiple levels down. Example:\n\n\ttype Inner struct {\n\t\tStartDate time.Time\n\t}\n\n\ttype Outer struct {\n\t\tInnerStructField *Inner\n\t\tCreatedAt time.Time `validate:\"ltecsfield=InnerStructField.StartDate\"`\n\t}\n\n\tnow := time.Now()\n\n\tinner := &Inner{\n\t\tStartDate: now,\n\t}\n\n\touter := &Outer{\n\t\tInnerStructField: inner,\n\t\tCreatedAt: now,\n\t}\n\n\terrs := validate.Struct(outer)\n\n\t// NOTE: when calling validate.Struct(val) topStruct will be the top level struct passed\n\t// into the function\n\t// when calling validate.FieldWithValue(val, field, tag) val will be\n\t// whatever you pass, struct, field...\n\t// when calling validate.Field(field, tag) val will be nil\n\nMultiple Validators\n\nMultiple validators on a field will process in the order defined. Example:\n\n\ttype Test struct {\n\t\tField `validate:\"max=10,min=1\"`\n\t}\n\n\t// max will be checked then min\n\nBad Validator definitions are not handled by the library. Example:\n\n\ttype Test struct {\n\t\tField `validate:\"min=10,max=0\"`\n\t}\n\n\t// this definition of min max will never succeed\n\nUsing Validator Tags\n\nBaked In Cross-Field validation only compares fields on the same struct.\nIf Cross-Field + Cross-Struct validation is needed you should implement your\nown custom validator.\n\nComma (\",\") is the default separator of validation tags. If you wish to\nhave a comma included within the parameter (i.e. excludesall=,) you will need to\nuse the UTF-8 hex representation 0x2C, which is replaced in the code as a comma,\nso the above will become excludesall=0x2C.\n\n\ttype Test struct {\n\t\tField `validate:\"excludesall=,\"` // BAD! Do not include a comma.\n\t\tField `validate:\"excludesall=0x2C\"` // GOOD! Use the UTF-8 hex representation.\n\t}\n\nPipe (\"|\") is the default separator of validation tags. If you wish to\nhave a pipe included within the parameter i.e. excludesall=| you will need to\nuse the UTF-8 hex representation 0x7C, which is replaced in the code as a pipe,\nso the above will become excludesall=0x7C\n\n\ttype Test struct {\n\t\tField `validate:\"excludesall=|\"` // BAD! Do not include a a pipe!\n\t\tField `validate:\"excludesall=0x7C\"` // GOOD! Use the UTF-8 hex representation.\n\t}\n\n\nBaked In Validators and Tags\n\nHere is a list of the current built in validators:\n\n\nSkip Field\n\nTells the validation to skip this struct field; this is particularly\nhandy in ignoring embedded structs from being validated. (Usage: -)\n\tUsage: -\n\n\nOr Operator\n\nThis is the 'or' operator allowing multiple validators to be used and\naccepted. (Usage: rbg|rgba) <-- this would allow either rgb or rgba\ncolors to be accepted. This can also be combined with 'and' for example\n( Usage: omitempty,rgb|rgba)\n\n\tUsage: |\n\nStructOnly\n\nWhen a field that is a nested struct is encountered, and contains this flag\nany validation on the nested struct will be run, but none of the nested\nstruct fields will be validated. This is usefull if inside of you program\nyou know the struct will be valid, but need to verify it has been assigned.\nNOTE: only \"required\" and \"omitempty\" can be used on a struct itself.\n\n\tUsage: structonly\n\nNoStructLevel\n\nSame as structonly tag except that any struct level validations will not run.\n\n\tUsage: nostructlevel\n\nExists\n\nIs a special tag without a validation function attached. It is used when a field\nis a Pointer, Interface or Invalid and you wish to validate that it exists.\nExample: want to ensure a bool exists if you define the bool as a pointer and\nuse exists it will ensure there is a value; couldn't use required as it would\nfail when the bool was false. exists will fail is the value is a Pointer, Interface\nor Invalid and is nil.\n\n\tUsage: exists\n\nOmit Empty\n\nAllows conditional validation, for example if a field is not set with\na value (Determined by the \"required\" validator) then other validation\nsuch as min or max won't run, but if a value is set validation will run.\n\n\tUsage: omitempty\n\nDive\n\nThis tells the validator to dive into a slice, array or map and validate that\nlevel of the slice, array or map with the validation tags that follow.\nMultidimensional nesting is also supported, each level you wish to dive will\nrequire another dive tag.\n\n\tUsage: dive\n\nExample #1\n\n\t[][]string with validation tag \"gt=0,dive,len=1,dive,required\"\n\t// gt=0 will be applied to []\n\t// len=1 will be applied to []string\n\t// required will be applied to string\n\nExample #2\n\n\t[][]string with validation tag \"gt=0,dive,dive,required\"\n\t// gt=0 will be applied to []\n\t// []string will be spared validation\n\t// required will be applied to string\n\nRequired\n\nThis validates that the value is not the data types default zero value.\nFor numbers ensures value is not zero. For strings ensures value is\nnot \"\". For slices, maps, pointers, interfaces, channels and functions\nensures the value is not nil.\n\n\tUsage: required\n\nLength\n\nFor numbers, max will ensure that the value is\nequal to the parameter given. For strings, it checks that\nthe string length is exactly that number of characters. For slices,\narrays, and maps, validates the number of items.\n\n\tUsage: len=10\n\nMaximum\n\nFor numbers, max will ensure that the value is\nless than or equal to the parameter given. For strings, it checks\nthat the string length is at most that number of characters. For\nslices, arrays, and maps, validates the number of items.\n\n\tUsage: max=10\n\nMininum\n\nFor numbers, min will ensure that the value is\ngreater or equal to the parameter given. For strings, it checks that\nthe string length is at least that number of characters. For slices,\narrays, and maps, validates the number of items.\n\n\tUsage: min=10\n\nEquals\n\nFor strings & numbers, eq will ensure that the value is\nequal to the parameter given. For slices, arrays, and maps,\nvalidates the number of items.\n\n\tUsage: eq=10\n\nNot Equal\n\nFor strings & numbers, ne will ensure that the value is not\nequal to the parameter given. For slices, arrays, and maps,\nvalidates the number of items.\n\n\tUsage: ne=10\n\nGreater Than\n\nFor numbers, this will ensure that the value is greater than the\nparameter given. For strings, it checks that the string length\nis greater than that number of characters. For slices, arrays\nand maps it validates the number of items.\n\nExample #1\n\n\tUsage: gt=10\n\nExample #2 (time.Time)\n\nFor time.Time ensures the time value is greater than time.Now.UTC().\n\n\tUsage: gt\n\nGreater Than or Equal\n\nSame as 'min' above. Kept both to make terminology with 'len' easier.\n\n\nExample #1\n\n\tUsage: gte=10\n\nExample #2 (time.Time)\n\nFor time.Time ensures the time value is greater than or equal to time.Now.UTC().\n\n\tUsage: gte\n\nLess Than\n\nFor numbers, this will ensure that the value is less than the parameter given.\nFor strings, it checks that the string length is less than that number of\ncharacters. For slices, arrays, and maps it validates the number of items.\n\nExample #1\n\n\tUsage: lt=10\n\nExample #2 (time.Time)\nFor time.Time ensures the time value is less than time.Now.UTC().\n\n\tUsage: lt\n\nLess Than or Equal\n\nSame as 'max' above. Kept both to make terminology with 'len' easier.\n\nExample #1\n\n\tUsage: lte=10\n\nExample #2 (time.Time)\n\nFor time.Time ensures the time value is less than or equal to time.Now.UTC().\n\n\tUsage: lte\n\nField Equals Another Field\n\nThis will validate the field value against another fields value either within\na struct or passed in field.\n\nExample #1:\n\n\t// Validation on Password field using:\n\tUsage: eqfield=ConfirmPassword\n\nExample #2:\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(password, confirmpassword, \"eqfield\")\n\nField Equals Another Field (relative)\n\nThis does the same as eqfield except that it validates the field provided relative\nto the top level struct.\n\n\tUsage: eqcsfield=InnerStructField.Field)\n\nField Does Not Equal Another Field\n\nThis will validate the field value against another fields value either within\na struct or passed in field.\n\nExamples:\n\n\t// Confirm two colors are not the same:\n\t//\n\t// Validation on Color field:\n\tUsage: nefield=Color2\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(color1, color2, \"nefield\")\n\nField Does Not Equal Another Field (relative)\n\nThis does the same as nefield except that it validates the field provided\nrelative to the top level struct.\n\n\tUsage: necsfield=InnerStructField.Field\n\nField Greater Than Another Field\n\nOnly valid for Numbers and time.Time types, this will validate the field value\nagainst another fields value either within a struct or passed in field.\nusage examples are for validation of a Start and End date:\n\nExample #1:\n\n\t// Validation on End field using:\n\tvalidate.Struct Usage(gtfield=Start)\n\nExample #2:\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(start, end, \"gtfield\")\n\n\nField Greater Than Another Relative Field\n\nThis does the same as gtfield except that it validates the field provided\nrelative to the top level struct.\n\n\tUsage: gtcsfield=InnerStructField.Field\n\nField Greater Than or Equal To Another Field\n\nOnly valid for Numbers and time.Time types, this will validate the field value\nagainst another fields value either within a struct or passed in field.\nusage examples are for validation of a Start and End date:\n\nExample #1:\n\n\t// Validation on End field using:\n\tvalidate.Struct Usage(gtefield=Start)\n\nExample #2:\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(start, end, \"gtefield\")\n\nField Greater Than or Equal To Another Relative Field\n\nThis does the same as gtefield except that it validates the field provided relative\nto the top level struct.\n\n\tUsage: gtecsfield=InnerStructField.Field\n\nLess Than Another Field\n\nOnly valid for Numbers and time.Time types, this will validate the field value\nagainst another fields value either within a struct or passed in field.\nusage examples are for validation of a Start and End date:\n\nExample #1:\n\n\t// Validation on End field using:\n\tvalidate.Struct Usage(ltfield=Start)\n\nExample #2:\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(start, end, \"ltfield\")\n\nLess Than Another Relative Field\n\nThis does the same as ltfield except that it validates the field provided relative\nto the top level struct.\n\n\tUsage: ltcsfield=InnerStructField.Field\n\nLess Than or Equal To Another Field\n\nOnly valid for Numbers and time.Time types, this will validate the field value\nagainst another fields value either within a struct or passed in field.\nusage examples are for validation of a Start and End date:\n\nExample #1:\n\n\t// Validation on End field using:\n\tvalidate.Struct Usage(ltefield=Start)\n\nExample #2:\n\n\t// Validating by field:\n\tvalidate.FieldWithValue(start, end, \"ltefield\")\n\nLess Than or Equal To Another Relative Field\n\nThis does the same as ltefield except that it validates the field provided relative\nto the top level struct.\n\n\tUsage: ltecsfield=InnerStructField.Field\n\nAlpha Only\n\nThis validates that a string value contains alpha characters only\n\n\tUsage: alpha\n\nAlphanumeric\n\nThis validates that a string value contains alphanumeric characters only\n\n\tUsage: alphanum\n\nNumeric\n\nThis validates that a string value contains a basic numeric value.\nbasic excludes exponents etc...\n\n\tUsage: numeric\n\nHexadecimal String\n\nThis validates that a string value contains a valid hexadecimal.\n\n\tUsage: hexadecimal\n\nHexcolor String\n\nThis validates that a string value contains a valid hex color including\nhashtag (#)\n\n\t\tUsage: hexcolor\n\nRGB String\n\nThis validates that a string value contains a valid rgb color\n\n\tUsage: rgb\n\nRGBA String\n\nThis validates that a string value contains a valid rgba color\n\n\tUsage: rgba\n\nHSL String\n\nThis validates that a string value contains a valid hsl color\n\n\tUsage: hsl\n\nHSLA String\n\nThis validates that a string value contains a valid hsla color\n\n\tUsage: hsla\n\nE-mail String\n\nThis validates that a string value contains a valid email\nThis may not conform to all possibilities of any rfc standard, but neither\ndoes any email provider accept all posibilities.\n\n\tUsage: email\n\nURL String\n\nThis validates that a string value contains a valid url\nThis will accept any url the golang request uri accepts but must contain\na schema for example http:// or rtmp://\n\n\tUsage: url\n\nURI String\n\nThis validates that a string value contains a valid uri\nThis will accept any uri the golang request uri accepts\n\n\tUsage: uri\n\nBase64 String\n\nThis validates that a string value contains a valid base64 value.\nAlthough an empty string is valid base64 this will report an empty string\nas an error, if you wish to accept an empty string as valid you can use\nthis with the omitempty tag.\n\n\tUsage: base64\n\nContains\n\nThis validates that a string value contains the substring value.\n\n\tUsage: contains=@\n\nContains Any\n\nThis validates that a string value contains any Unicode code points\nin the substring value.\n\n\tUsage: containsany=!@#?\n\nContains Rune\n\nThis validates that a string value contains the supplied rune value.\n\n\tUsage: containsrune=@\n\nExcludes\n\nThis validates that a string value does not contain the substring value.\n\n\tUsage: excludes=@\n\nExcludes All\n\nThis validates that a string value does not contain any Unicode code\npoints in the substring value.\n\n\tUsage: excludesall=!@#?\n\nExcludes Rune\n\nThis validates that a string value does not contain the supplied rune value.\n\n\tUsage: excludesrune=@\n\nInternational Standard Book Number\n\nThis validates that a string value contains a valid isbn10 or isbn13 value.\n\n\tUsage: isbn\n\nInternational Standard Book Number 10\n\nThis validates that a string value contains a valid isbn10 value.\n\n\tUsage: isbn10\n\nInternational Standard Book Number 13\n\nThis validates that a string value contains a valid isbn13 value.\n\n\tUsage: isbn13\n\n\nUniversally Unique Identifier UUID\n\nThis validates that a string value contains a valid UUID.\n\n\tUsage: uuid\n\nUniversally Unique Identifier UUID v3\n\nThis validates that a string value contains a valid version 3 UUID.\n\n\tUsage: uuid3\n\nUniversally Unique Identifier UUID v4\n\nThis validates that a string value contains a valid version 4 UUID.\n\n\tUsage: uuid4\n\nUniversally Unique Identifier UUID v5\n\nThis validates that a string value contains a valid version 5 UUID.\n\n\tUsage: uuid5\n\nASCII\n\nThis validates that a string value contains only ASCII characters.\nNOTE: if the string is blank, this validates as true.\n\n\tUsage: ascii\n\nPrintable ASCII\n\nThis validates that a string value contains only printable ASCII characters.\nNOTE: if the string is blank, this validates as true.\n\n\tUsage: asciiprint\n\nMulti-Byte Characters\n\nThis validates that a string value contains one or more multibyte characters.\nNOTE: if the string is blank, this validates as true.\n\n\tUsage: multibyte\n\nData URL\n\nThis validates that a string value contains a valid DataURI.\nNOTE: this will also validate that the data portion is valid base64\n\n\tUsage: datauri\n\nLatitude\n\nThis validates that a string value contains a valid latitude.\n\n\tUsage: latitude\n\nLongitude\n\nThis validates that a string value contains a valid longitude.\n\n\tUsage: longitude\n\nSocial Security Number SSN\n\nThis validates that a string value contains a valid U.S. Social Security Number.\n\n\tUsage: ssn\n\nInternet Protocol Address IP\n\nThis validates that a string value contains a valid IP Adress.\n\n\tUsage: ip\n\nInternet Protocol Address IPv4\n\nThis validates that a string value contains a valid v4 IP Adress.\n\n\tUsage: ipv4\n\nInternet Protocol Address IPv6\n\nThis validates that a string value contains a valid v6 IP Adress.\n\n\tUsage: ipv6\n\nClassless Inter-Domain Routing CIDR\n\nThis validates that a string value contains a valid CIDR Adress.\n\n\tUsage: cidr\n\nClassless Inter-Domain Routing CIDRv4\n\nThis validates that a string value contains a valid v4 CIDR Adress.\n\n\tUsage: cidrv4\n\nClassless Inter-Domain Routing CIDRv6\n\nThis validates that a string value contains a valid v6 CIDR Adress.\n\n\tUsage: cidrv6\n\nTransmission Control Protocol Address TCP\n\nThis validates that a string value contains a valid resolvable TCP Adress.\n\n\tUsage: tcp_addr\n\nTransmission Control Protocol Address TCPv4\n\nThis validates that a string value contains a valid resolvable v4 TCP Adress.\n\n\tUsage: tcp4_addr\n\nTransmission Control Protocol Address TCPv6\n\nThis validates that a string value contains a valid resolvable v6 TCP Adress.\n\n\tUsage: tcp6_addr\n\nUser Datagram Protocol Address UDP\n\nThis validates that a string value contains a valid resolvable UDP Adress.\n\n\tUsage: udp_addr\n\nUser Datagram Protocol Address UDPv4\n\nThis validates that a string value contains a valid resolvable v4 UDP Adress.\n\n\tUsage: udp4_addr\n\nUser Datagram Protocol Address UDPv6\n\nThis validates that a string value contains a valid resolvable v6 UDP Adress.\n\n\tUsage: udp6_addr\n\nInternet Protocol Address IP\n\nThis validates that a string value contains a valid resolvable IP Adress.\n\n\tUsage: ip_addr\n\nInternet Protocol Address IPv4\n\nThis validates that a string value contains a valid resolvable v4 IP Adress.\n\n\tUsage: ip4_addr\n\nInternet Protocol Address IPv6\n\nThis validates that a string value contains a valid resolvable v6 IP Adress.\n\n\tUsage: ip6_addr\n\nUnix domain socket end point Address\n\nThis validates that a string value contains a valid Unix Adress.\n\n\tUsage: unix_addr\n\nMedia Access Control Address MAC\n\nThis validates that a string value contains a valid MAC Adress.\n\n\tUsage: mac\n\nNote: See Go's ParseMAC for accepted formats and types:\n\n\thttp://golang.org/src/net/mac.go?s=866:918#L29\n\nAlias Validators and Tags\n\nNOTE: When returning an error, the tag returned in \"FieldError\" will be\nthe alias tag unless the dive tag is part of the alias. Everything after the\ndive tag is not reported as the alias tag. Also, the \"ActualTag\" in the before\ncase will be the actual tag within the alias that failed.\n\nHere is a list of the current built in alias tags:\n\n\t\"iscolor\"\n\t\talias is \"hexcolor|rgb|rgba|hsl|hsla\" (Usage: iscolor)\n\nValidator notes:\n\n\tregex\n\t\ta regex validator won't be added because commas and = signs can be part\n\t\tof a regex which conflict with the validation definitions. Although\n\t\tworkarounds can be made, they take away from using pure regex's.\n\t\tFurthermore it's quick and dirty but the regex's become harder to\n\t\tmaintain and are not reusable, so it's as much a programming philosiphy\n\t\tas anything.\n\n\t\tIn place of this new validator functions should be created; a regex can\n\t\tbe used within the validator function and even be precompiled for better\n\t\tefficiency within regexes.go.\n\n\t\tAnd the best reason, you can submit a pull request and we can keep on\n\t\tadding to the validation library of this package!\n\nPanics\n\nThis package panics when bad input is provided, this is by design, bad code like\nthat should not make it to production.\n\n\ttype Test struct {\n\t\tTestField string `validate:\"nonexistantfunction=1\"`\n\t}\n\n\tt := &Test{\n\t\tTestField: \"Test\"\n\t}\n\n\tvalidate.Struct(t) // this will panic\n*/\npackage validator\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/regexes.go", "content": "package validator\n\nimport \"regexp\"\n\nconst (\n\talphaRegexString = \"^[a-zA-Z]+$\"\n\talphaNumericRegexString = \"^[a-zA-Z0-9]+$\"\n\tnumericRegexString = \"^[-+]?[0-9]+(?:\\\\.[0-9]+)?$\"\n\tnumberRegexString = \"^[0-9]+$\"\n\thexadecimalRegexString = \"^[0-9a-fA-F]+$\"\n\thexcolorRegexString = \"^#(?:[0-9a-fA-F]{3}|[0-9a-fA-F]{6})$\"\n\trgbRegexString = \"^rgb\\\\(\\\\s*(?:(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])|(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%)\\\\s*\\\\)$\"\n\trgbaRegexString = \"^rgba\\\\(\\\\s*(?:(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])|(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%\\\\s*,\\\\s*(?:0|[1-9]\\\\d?|1\\\\d\\\\d?|2[0-4]\\\\d|25[0-5])%)\\\\s*,\\\\s*(?:(?:0.[1-9]*)|[01])\\\\s*\\\\)$\"\n\thslRegexString = \"^hsl\\\\(\\\\s*(?:0|[1-9]\\\\d?|[12]\\\\d\\\\d|3[0-5]\\\\d|360)\\\\s*,\\\\s*(?:(?:0|[1-9]\\\\d?|100)%)\\\\s*,\\\\s*(?:(?:0|[1-9]\\\\d?|100)%)\\\\s*\\\\)$\"\n\thslaRegexString = \"^hsla\\\\(\\\\s*(?:0|[1-9]\\\\d?|[12]\\\\d\\\\d|3[0-5]\\\\d|360)\\\\s*,\\\\s*(?:(?:0|[1-9]\\\\d?|100)%)\\\\s*,\\\\s*(?:(?:0|[1-9]\\\\d?|100)%)\\\\s*,\\\\s*(?:(?:0.[1-9]*)|[01])\\\\s*\\\\)$\"\n\temailRegexString = \"^(?:(?:(?:(?:[a-zA-Z]|\\\\d|[!#\\\\$%&'\\\\*\\\\+\\\\-\\\\/=\\\\?\\\\^_`{\\\\|}~]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])+(?:\\\\.([a-zA-Z]|\\\\d|[!#\\\\$%&'\\\\*\\\\+\\\\-\\\\/=\\\\?\\\\^_`{\\\\|}~]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])+)*)|(?:(?:\\\\x22)(?:(?:(?:(?:\\\\x20|\\\\x09)*(?:\\\\x0d\\\\x0a))?(?:\\\\x20|\\\\x09)+)?(?:(?:[\\\\x01-\\\\x08\\\\x0b\\\\x0c\\\\x0e-\\\\x1f\\\\x7f]|\\\\x21|[\\\\x23-\\\\x5b]|[\\\\x5d-\\\\x7e]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])|(?:\\\\(?:[\\\\x01-\\\\x09\\\\x0b\\\\x0c\\\\x0d-\\\\x7f]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}]))))*(?:(?:(?:\\\\x20|\\\\x09)*(?:\\\\x0d\\\\x0a))?(\\\\x20|\\\\x09)+)?(?:\\\\x22)))@(?:(?:(?:[a-zA-Z]|\\\\d|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])|(?:(?:[a-zA-Z]|\\\\d|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])(?:[a-zA-Z]|\\\\d|-|\\\\.|_|~|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])*(?:[a-zA-Z]|\\\\d|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])))\\\\.)+(?:(?:[a-zA-Z]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])|(?:(?:[a-zA-Z]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])(?:[a-zA-Z]|\\\\d|-|\\\\.|_|~|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])*(?:[a-zA-Z]|[\\\\x{00A0}-\\\\x{D7FF}\\\\x{F900}-\\\\x{FDCF}\\\\x{FDF0}-\\\\x{FFEF}])))\\\\.?$\"\n\tbase64RegexString = \"^(?:[A-Za-z0-9+\\\\/]{4})*(?:[A-Za-z0-9+\\\\/]{2}==|[A-Za-z0-9+\\\\/]{3}=|[A-Za-z0-9+\\\\/]{4})$\"\n\tiSBN10RegexString = \"^(?:[0-9]{9}X|[0-9]{10})$\"\n\tiSBN13RegexString = \"^(?:(?:97(?:8|9))[0-9]{10})$\"\n\tuUID3RegexString = \"^[0-9a-f]{8}-[0-9a-f]{4}-3[0-9a-f]{3}-[0-9a-f]{4}-[0-9a-f]{12}$\"\n\tuUID4RegexString = \"^[0-9a-f]{8}-[0-9a-f]{4}-4[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}$\"\n\tuUID5RegexString = \"^[0-9a-f]{8}-[0-9a-f]{4}-5[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}$\"\n\tuUIDRegexString = \"^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$\"\n\taSCIIRegexString = \"^[\\x00-\\x7F]*$\"\n\tprintableASCIIRegexString = \"^[\\x20-\\x7E]*$\"\n\tmultibyteRegexString = \"[^\\x00-\\x7F]\"\n\tdataURIRegexString = \"^data:.+\\\\/(.+);base64$\"\n\tlatitudeRegexString = \"^[-+]?([1-8]?\\\\d(\\\\.\\\\d+)?|90(\\\\.0+)?)$\"\n\tlongitudeRegexString = \"^[-+]?(180(\\\\.0+)?|((1[0-7]\\\\d)|([1-9]?\\\\d))(\\\\.\\\\d+)?)$\"\n\tsSNRegexString = `^\\d{3}[- ]?\\d{2}[- ]?\\d{4}$`\n)\n\nvar (\n\talphaRegex = regexp.MustCompile(alphaRegexString)\n\talphaNumericRegex = regexp.MustCompile(alphaNumericRegexString)\n\tnumericRegex = regexp.MustCompile(numericRegexString)\n\tnumberRegex = regexp.MustCompile(numberRegexString)\n\thexadecimalRegex = regexp.MustCompile(hexadecimalRegexString)\n\thexcolorRegex = regexp.MustCompile(hexcolorRegexString)\n\trgbRegex = regexp.MustCompile(rgbRegexString)\n\trgbaRegex = regexp.MustCompile(rgbaRegexString)\n\thslRegex = regexp.MustCompile(hslRegexString)\n\thslaRegex = regexp.MustCompile(hslaRegexString)\n\temailRegex = regexp.MustCompile(emailRegexString)\n\tbase64Regex = regexp.MustCompile(base64RegexString)\n\tiSBN10Regex = regexp.MustCompile(iSBN10RegexString)\n\tiSBN13Regex = regexp.MustCompile(iSBN13RegexString)\n\tuUID3Regex = regexp.MustCompile(uUID3RegexString)\n\tuUID4Regex = regexp.MustCompile(uUID4RegexString)\n\tuUID5Regex = regexp.MustCompile(uUID5RegexString)\n\tuUIDRegex = regexp.MustCompile(uUIDRegexString)\n\taSCIIRegex = regexp.MustCompile(aSCIIRegexString)\n\tprintableASCIIRegex = regexp.MustCompile(printableASCIIRegexString)\n\tmultibyteRegex = regexp.MustCompile(multibyteRegexString)\n\tdataURIRegex = regexp.MustCompile(dataURIRegexString)\n\tlatitudeRegex = regexp.MustCompile(latitudeRegexString)\n\tlongitudeRegex = regexp.MustCompile(longitudeRegexString)\n\tsSNRegex = regexp.MustCompile(sSNRegexString)\n)\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/util.go", "content": "package validator\n\nimport (\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n)\n\nconst (\n\tblank = \"\"\n\tnamespaceSeparator = \".\"\n\tleftBracket = \"[\"\n\trightBracket = \"]\"\n\trestrictedTagChars = \".[],|=+()`~!@#$%^&*\\\\\\\"/?<>{}\"\n\trestrictedAliasErr = \"Alias '%s' either contains restricted characters or is the same as a restricted tag needed for normal operation\"\n\trestrictedTagErr = \"Tag '%s' either contains restricted characters or is the same as a restricted tag needed for normal operation\"\n)\n\nvar (\n\trestrictedTags = map[string]struct{}{\n\t\tdiveTag: {},\n\t\texistsTag: {},\n\t\tstructOnlyTag: {},\n\t\tomitempty: {},\n\t\tskipValidationTag: {},\n\t\tutf8HexComma: {},\n\t\tutf8Pipe: {},\n\t\tnoStructLevelTag: {},\n\t}\n)\n\n// ExtractType gets the actual underlying type of field value.\n// It will dive into pointers, customTypes and return you the\n// underlying value and it's kind.\n// it is exposed for use within you Custom Functions\nfunc (v *Validate) ExtractType(current reflect.Value) (reflect.Value, reflect.Kind) {\n\n\tval, k, _ := v.extractTypeInternal(current, false)\n\treturn val, k\n}\n\n// only exists to not break backward compatibility, needed to return the third param for a bug fix internally\nfunc (v *Validate) extractTypeInternal(current reflect.Value, nullable bool) (reflect.Value, reflect.Kind, bool) {\n\n\tswitch current.Kind() {\n\tcase reflect.Ptr:\n\n\t\tnullable = true\n\n\t\tif current.IsNil() {\n\t\t\treturn current, reflect.Ptr, nullable\n\t\t}\n\n\t\treturn v.extractTypeInternal(current.Elem(), nullable)\n\n\tcase reflect.Interface:\n\n\t\tnullable = true\n\n\t\tif current.IsNil() {\n\t\t\treturn current, reflect.Interface, nullable\n\t\t}\n\n\t\treturn v.extractTypeInternal(current.Elem(), nullable)\n\n\tcase reflect.Invalid:\n\t\treturn current, reflect.Invalid, nullable\n\n\tdefault:\n\n\t\tif v.hasCustomFuncs {\n\n\t\t\tif fn, ok := v.customTypeFuncs[current.Type()]; ok {\n\t\t\t\treturn v.extractTypeInternal(reflect.ValueOf(fn(current)), nullable)\n\t\t\t}\n\t\t}\n\n\t\treturn current, current.Kind(), nullable\n\t}\n}\n\n// GetStructFieldOK traverses a struct to retrieve a specific field denoted by the provided namespace and\n// returns the field, field kind and whether is was successful in retrieving the field at all.\n// NOTE: when not successful ok will be false, this can happen when a nested struct is nil and so the field\n// could not be retrieved because it didn't exist.\nfunc (v *Validate) GetStructFieldOK(current reflect.Value, namespace string) (reflect.Value, reflect.Kind, bool) {\n\n\tcurrent, kind := v.ExtractType(current)\n\n\tif kind == reflect.Invalid {\n\t\treturn current, kind, false\n\t}\n\n\tif namespace == blank {\n\t\treturn current, kind, true\n\t}\n\n\tswitch kind {\n\n\tcase reflect.Ptr, reflect.Interface:\n\n\t\treturn current, kind, false\n\n\tcase reflect.Struct:\n\n\t\ttyp := current.Type()\n\t\tfld := namespace\n\t\tns := namespace\n\n\t\tif typ != timeType && typ != timePtrType {\n\n\t\t\tidx := strings.Index(namespace, namespaceSeparator)\n\n\t\t\tif idx != -1 {\n\t\t\t\tfld = namespace[:idx]\n\t\t\t\tns = namespace[idx+1:]\n\t\t\t} else {\n\t\t\t\tns = blank\n\t\t\t}\n\n\t\t\tbracketIdx := strings.Index(fld, leftBracket)\n\t\t\tif bracketIdx != -1 {\n\t\t\t\tfld = fld[:bracketIdx]\n\n\t\t\t\tns = namespace[bracketIdx:]\n\t\t\t}\n\n\t\t\tcurrent = current.FieldByName(fld)\n\n\t\t\treturn v.GetStructFieldOK(current, ns)\n\t\t}\n\n\tcase reflect.Array, reflect.Slice:\n\t\tidx := strings.Index(namespace, leftBracket)\n\t\tidx2 := strings.Index(namespace, rightBracket)\n\n\t\tarrIdx, _ := strconv.Atoi(namespace[idx+1 : idx2])\n\n\t\tif arrIdx >= current.Len() {\n\t\t\treturn current, kind, false\n\t\t}\n\n\t\tstartIdx := idx2 + 1\n\n\t\tif startIdx < len(namespace) {\n\t\t\tif namespace[startIdx:startIdx+1] == namespaceSeparator {\n\t\t\t\tstartIdx++\n\t\t\t}\n\t\t}\n\n\t\treturn v.GetStructFieldOK(current.Index(arrIdx), namespace[startIdx:])\n\n\tcase reflect.Map:\n\t\tidx := strings.Index(namespace, leftBracket) + 1\n\t\tidx2 := strings.Index(namespace, rightBracket)\n\n\t\tendIdx := idx2\n\n\t\tif endIdx+1 < len(namespace) {\n\t\t\tif namespace[endIdx+1:endIdx+2] == namespaceSeparator {\n\t\t\t\tendIdx++\n\t\t\t}\n\t\t}\n\n\t\tkey := namespace[idx:idx2]\n\n\t\tswitch current.Type().Key().Kind() {\n\t\tcase reflect.Int:\n\t\t\ti, _ := strconv.Atoi(key)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(i)), namespace[endIdx+1:])\n\t\tcase reflect.Int8:\n\t\t\ti, _ := strconv.ParseInt(key, 10, 8)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(int8(i))), namespace[endIdx+1:])\n\t\tcase reflect.Int16:\n\t\t\ti, _ := strconv.ParseInt(key, 10, 16)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(int16(i))), namespace[endIdx+1:])\n\t\tcase reflect.Int32:\n\t\t\ti, _ := strconv.ParseInt(key, 10, 32)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(int32(i))), namespace[endIdx+1:])\n\t\tcase reflect.Int64:\n\t\t\ti, _ := strconv.ParseInt(key, 10, 64)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(i)), namespace[endIdx+1:])\n\t\tcase reflect.Uint:\n\t\t\ti, _ := strconv.ParseUint(key, 10, 0)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(uint(i))), namespace[endIdx+1:])\n\t\tcase reflect.Uint8:\n\t\t\ti, _ := strconv.ParseUint(key, 10, 8)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(uint8(i))), namespace[endIdx+1:])\n\t\tcase reflect.Uint16:\n\t\t\ti, _ := strconv.ParseUint(key, 10, 16)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(uint16(i))), namespace[endIdx+1:])\n\t\tcase reflect.Uint32:\n\t\t\ti, _ := strconv.ParseUint(key, 10, 32)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(uint32(i))), namespace[endIdx+1:])\n\t\tcase reflect.Uint64:\n\t\t\ti, _ := strconv.ParseUint(key, 10, 64)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(i)), namespace[endIdx+1:])\n\t\tcase reflect.Float32:\n\t\t\tf, _ := strconv.ParseFloat(key, 32)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(float32(f))), namespace[endIdx+1:])\n\t\tcase reflect.Float64:\n\t\t\tf, _ := strconv.ParseFloat(key, 64)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(f)), namespace[endIdx+1:])\n\t\tcase reflect.Bool:\n\t\t\tb, _ := strconv.ParseBool(key)\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(b)), namespace[endIdx+1:])\n\n\t\t// reflect.Type = string\n\t\tdefault:\n\t\t\treturn v.GetStructFieldOK(current.MapIndex(reflect.ValueOf(key)), namespace[endIdx+1:])\n\t\t}\n\t}\n\n\t// if got here there was more namespace, cannot go any deeper\n\tpanic(\"Invalid field namespace\")\n}\n\n// asInt returns the parameter as a int64\n// or panics if it can't convert\nfunc asInt(param string) int64 {\n\n\ti, err := strconv.ParseInt(param, 0, 64)\n\tpanicIf(err)\n\n\treturn i\n}\n\n// asUint returns the parameter as a uint64\n// or panics if it can't convert\nfunc asUint(param string) uint64 {\n\n\ti, err := strconv.ParseUint(param, 0, 64)\n\tpanicIf(err)\n\n\treturn i\n}\n\n// asFloat returns the parameter as a float64\n// or panics if it can't convert\nfunc asFloat(param string) float64 {\n\n\ti, err := strconv.ParseFloat(param, 64)\n\tpanicIf(err)\n\n\treturn i\n}\n\nfunc panicIf(err error) {\n\tif err != nil {\n\t\tpanic(err.Error())\n\t}\n}\n" }, { "path": "vendor/gopkg.in/go-playground/validator.v8/validator.go", "content": "/**\n * Package validator\n *\n * MISC:\n * - anonymous structs - they don't have names so expect the Struct name within StructErrors to be blank\n *\n */\n\npackage validator\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n)\n\nconst (\n\tutf8HexComma = \"0x2C\"\n\tutf8Pipe = \"0x7C\"\n\ttagSeparator = \",\"\n\torSeparator = \"|\"\n\ttagKeySeparator = \"=\"\n\tstructOnlyTag = \"structonly\"\n\tnoStructLevelTag = \"nostructlevel\"\n\tomitempty = \"omitempty\"\n\tskipValidationTag = \"-\"\n\tdiveTag = \"dive\"\n\texistsTag = \"exists\"\n\tfieldErrMsg = \"Key: '%s' Error:Field validation for '%s' failed on the '%s' tag\"\n\tarrayIndexFieldName = \"%s\" + leftBracket + \"%d\" + rightBracket\n\tmapIndexFieldName = \"%s\" + leftBracket + \"%v\" + rightBracket\n\tinvalidValidation = \"Invalid validation tag on field %s\"\n\tundefinedValidation = \"Undefined validation function on field %s\"\n\tvalidatorNotInitialized = \"Validator instance not initialized\"\n\tfieldNameRequired = \"Field Name Required\"\n\ttagRequired = \"Tag Required\"\n)\n\nvar (\n\ttimeType = reflect.TypeOf(time.Time{})\n\ttimePtrType = reflect.TypeOf(&time.Time{})\n\tdefaultCField = new(cField)\n)\n\n// StructLevel contains all of the information and helper methods\n// for reporting errors during struct level validation\ntype StructLevel struct {\n\tTopStruct reflect.Value\n\tCurrentStruct reflect.Value\n\terrPrefix string\n\tnsPrefix string\n\terrs ValidationErrors\n\tv *Validate\n}\n\n// ReportValidationErrors accepts the key relative to the top level struct and validatin errors.\n// Example: had a triple nested struct User, ContactInfo, Country and ran errs := validate.Struct(country)\n// from within a User struct level validation would call this method like so:\n// ReportValidationErrors(\"ContactInfo.\", errs)\n// NOTE: relativeKey can contain both the Field Relative and Custom name relative paths\n// i.e. ReportValidationErrors(\"ContactInfo.|cInfo\", errs) where cInfo represents say the JSON name of\n// the relative path; this will be split into 2 variables in the next valiator version.\nfunc (sl *StructLevel) ReportValidationErrors(relativeKey string, errs ValidationErrors) {\n\tfor _, e := range errs {\n\n\t\tidx := strings.Index(relativeKey, \"|\")\n\t\tvar rel string\n\t\tvar cRel string\n\n\t\tif idx != -1 {\n\t\t\trel = relativeKey[:idx]\n\t\t\tcRel = relativeKey[idx+1:]\n\t\t} else {\n\t\t\trel = relativeKey\n\t\t}\n\n\t\tkey := sl.errPrefix + rel + e.Field\n\n\t\te.FieldNamespace = key\n\t\te.NameNamespace = sl.nsPrefix + cRel + e.Name\n\n\t\tsl.errs[key] = e\n\t}\n}\n\n// ReportError reports an error just by passing the field and tag information\n// NOTE: tag can be an existing validation tag or just something you make up\n// and precess on the flip side it's up to you.\nfunc (sl *StructLevel) ReportError(field reflect.Value, fieldName string, customName string, tag string) {\n\n\tfield, kind := sl.v.ExtractType(field)\n\n\tif fieldName == blank {\n\t\tpanic(fieldNameRequired)\n\t}\n\n\tif customName == blank {\n\t\tcustomName = fieldName\n\t}\n\n\tif tag == blank {\n\t\tpanic(tagRequired)\n\t}\n\n\tns := sl.errPrefix + fieldName\n\n\tswitch kind {\n\tcase reflect.Invalid:\n\t\tsl.errs[ns] = &FieldError{\n\t\t\tFieldNamespace: ns,\n\t\t\tNameNamespace: sl.nsPrefix + customName,\n\t\t\tName: customName,\n\t\t\tField: fieldName,\n\t\t\tTag: tag,\n\t\t\tActualTag: tag,\n\t\t\tParam: blank,\n\t\t\tKind: kind,\n\t\t}\n\tdefault:\n\t\tsl.errs[ns] = &FieldError{\n\t\t\tFieldNamespace: ns,\n\t\t\tNameNamespace: sl.nsPrefix + customName,\n\t\t\tName: customName,\n\t\t\tField: fieldName,\n\t\t\tTag: tag,\n\t\t\tActualTag: tag,\n\t\t\tParam: blank,\n\t\t\tValue: field.Interface(),\n\t\t\tKind: kind,\n\t\t\tType: field.Type(),\n\t\t}\n\t}\n}\n\n// Validate contains the validator settings passed in using the Config struct\ntype Validate struct {\n\ttagName string\n\tfieldNameTag string\n\tvalidationFuncs map[string]Func\n\tstructLevelFuncs map[reflect.Type]StructLevelFunc\n\tcustomTypeFuncs map[reflect.Type]CustomTypeFunc\n\taliasValidators map[string]string\n\thasCustomFuncs bool\n\thasAliasValidators bool\n\thasStructLevelFuncs bool\n\ttagCache *tagCache\n\tstructCache *structCache\n\terrsPool *sync.Pool\n}\n\nfunc (v *Validate) initCheck() {\n\tif v == nil {\n\t\tpanic(validatorNotInitialized)\n\t}\n}\n\n// Config contains the options that a Validator instance will use.\n// It is passed to the New() function\ntype Config struct {\n\tTagName string\n\tFieldNameTag string\n}\n\n// CustomTypeFunc allows for overriding or adding custom field type handler functions\n// field = field value of the type to return a value to be validated\n// example Valuer from sql drive see https://golang.org/src/database/sql/driver/types.go?s=1210:1293#L29\ntype CustomTypeFunc func(field reflect.Value) interface{}\n\n// Func accepts all values needed for file and cross field validation\n// v = validator instance, needed but some built in functions for it's custom types\n// topStruct = top level struct when validating by struct otherwise nil\n// currentStruct = current level struct when validating by struct otherwise optional comparison value\n// field = field value for validation\n// param = parameter used in validation i.e. gt=0 param would be 0\ntype Func func(v *Validate, topStruct reflect.Value, currentStruct reflect.Value, field reflect.Value, fieldtype reflect.Type, fieldKind reflect.Kind, param string) bool\n\n// StructLevelFunc accepts all values needed for struct level validation\ntype StructLevelFunc func(v *Validate, structLevel *StructLevel)\n\n// ValidationErrors is a type of map[string]*FieldError\n// it exists to allow for multiple errors to be passed from this library\n// and yet still subscribe to the error interface\ntype ValidationErrors map[string]*FieldError\n\n// Error is intended for use in development + debugging and not intended to be a production error message.\n// It allows ValidationErrors to subscribe to the Error interface.\n// All information to create an error message specific to your application is contained within\n// the FieldError found within the ValidationErrors map\nfunc (ve ValidationErrors) Error() string {\n\n\tbuff := bytes.NewBufferString(blank)\n\n\tfor key, err := range ve {\n\t\tbuff.WriteString(fmt.Sprintf(fieldErrMsg, key, err.Field, err.Tag))\n\t\tbuff.WriteString(\"\\n\")\n\t}\n\n\treturn strings.TrimSpace(buff.String())\n}\n\n// FieldError contains a single field's validation error along\n// with other properties that may be needed for error message creation\ntype FieldError struct {\n\tFieldNamespace string\n\tNameNamespace string\n\tField string\n\tName string\n\tTag string\n\tActualTag string\n\tKind reflect.Kind\n\tType reflect.Type\n\tParam string\n\tValue interface{}\n}\n\n// New creates a new Validate instance for use.\nfunc New(config *Config) *Validate {\n\n\ttc := new(tagCache)\n\ttc.m.Store(make(map[string]*cTag))\n\n\tsc := new(structCache)\n\tsc.m.Store(make(map[reflect.Type]*cStruct))\n\n\tv := &Validate{\n\t\ttagName: config.TagName,\n\t\tfieldNameTag: config.FieldNameTag,\n\t\ttagCache: tc,\n\t\tstructCache: sc,\n\t\terrsPool: &sync.Pool{New: func() interface{} {\n\t\t\treturn ValidationErrors{}\n\t\t}}}\n\n\tif len(v.aliasValidators) == 0 {\n\t\t// must copy alias validators for separate validations to be used in each validator instance\n\t\tv.aliasValidators = map[string]string{}\n\t\tfor k, val := range bakedInAliasValidators {\n\t\t\tv.RegisterAliasValidation(k, val)\n\t\t}\n\t}\n\n\tif len(v.validationFuncs) == 0 {\n\t\t// must copy validators for separate validations to be used in each instance\n\t\tv.validationFuncs = map[string]Func{}\n\t\tfor k, val := range bakedInValidators {\n\t\t\tv.RegisterValidation(k, val)\n\t\t}\n\t}\n\n\treturn v\n}\n\n// RegisterStructValidation registers a StructLevelFunc against a number of types\n// NOTE: this method is not thread-safe it is intended that these all be registered prior to any validation\nfunc (v *Validate) RegisterStructValidation(fn StructLevelFunc, types ...interface{}) {\n\tv.initCheck()\n\n\tif v.structLevelFuncs == nil {\n\t\tv.structLevelFuncs = map[reflect.Type]StructLevelFunc{}\n\t}\n\n\tfor _, t := range types {\n\t\tv.structLevelFuncs[reflect.TypeOf(t)] = fn\n\t}\n\n\tv.hasStructLevelFuncs = true\n}\n\n// RegisterValidation adds a validation Func to a Validate's map of validators denoted by the key\n// NOTE: if the key already exists, the previous validation function will be replaced.\n// NOTE: this method is not thread-safe it is intended that these all be registered prior to any validation\nfunc (v *Validate) RegisterValidation(key string, fn Func) error {\n\tv.initCheck()\n\n\tif key == blank {\n\t\treturn errors.New(\"Function Key cannot be empty\")\n\t}\n\n\tif fn == nil {\n\t\treturn errors.New(\"Function cannot be empty\")\n\t}\n\n\t_, ok := restrictedTags[key]\n\n\tif ok || strings.ContainsAny(key, restrictedTagChars) {\n\t\tpanic(fmt.Sprintf(restrictedTagErr, key))\n\t}\n\n\tv.validationFuncs[key] = fn\n\n\treturn nil\n}\n\n// RegisterCustomTypeFunc registers a CustomTypeFunc against a number of types\n// NOTE: this method is not thread-safe it is intended that these all be registered prior to any validation\nfunc (v *Validate) RegisterCustomTypeFunc(fn CustomTypeFunc, types ...interface{}) {\n\tv.initCheck()\n\n\tif v.customTypeFuncs == nil {\n\t\tv.customTypeFuncs = map[reflect.Type]CustomTypeFunc{}\n\t}\n\n\tfor _, t := range types {\n\t\tv.customTypeFuncs[reflect.TypeOf(t)] = fn\n\t}\n\n\tv.hasCustomFuncs = true\n}\n\n// RegisterAliasValidation registers a mapping of a single validationstag that\n// defines a common or complex set of validation(s) to simplify adding validation\n// to structs. NOTE: when returning an error the tag returned in FieldError will be\n// the alias tag unless the dive tag is part of the alias; everything after the\n// dive tag is not reported as the alias tag. Also the ActualTag in the before case\n// will be the actual tag within the alias that failed.\n// NOTE: this method is not thread-safe it is intended that these all be registered prior to any validation\nfunc (v *Validate) RegisterAliasValidation(alias, tags string) {\n\tv.initCheck()\n\n\t_, ok := restrictedTags[alias]\n\n\tif ok || strings.ContainsAny(alias, restrictedTagChars) {\n\t\tpanic(fmt.Sprintf(restrictedAliasErr, alias))\n\t}\n\n\tv.aliasValidators[alias] = tags\n\tv.hasAliasValidators = true\n}\n\n// Field validates a single field using tag style validation and returns nil or ValidationErrors as type error.\n// You will need to assert the error if it's not nil i.e. err.(validator.ValidationErrors) to access the map of errors.\n// NOTE: it returns ValidationErrors instead of a single FieldError because this can also\n// validate Array, Slice and maps fields which may contain more than one error\nfunc (v *Validate) Field(field interface{}, tag string) error {\n\tv.initCheck()\n\n\tif len(tag) == 0 || tag == skipValidationTag {\n\t\treturn nil\n\t}\n\n\terrs := v.errsPool.Get().(ValidationErrors)\n\tfieldVal := reflect.ValueOf(field)\n\n\tctag, ok := v.tagCache.Get(tag)\n\tif !ok {\n\t\tv.tagCache.lock.Lock()\n\t\tdefer v.tagCache.lock.Unlock()\n\n\t\t// could have been multiple trying to access, but once first is done this ensures tag\n\t\t// isn't parsed again.\n\t\tctag, ok = v.tagCache.Get(tag)\n\t\tif !ok {\n\t\t\tctag, _ = v.parseFieldTagsRecursive(tag, blank, blank, false)\n\t\t\tv.tagCache.Set(tag, ctag)\n\t\t}\n\t}\n\n\tv.traverseField(fieldVal, fieldVal, fieldVal, blank, blank, errs, false, false, nil, nil, defaultCField, ctag)\n\n\tif len(errs) == 0 {\n\t\tv.errsPool.Put(errs)\n\t\treturn nil\n\t}\n\n\treturn errs\n}\n\n// FieldWithValue validates a single field, against another fields value using tag style validation and returns nil or ValidationErrors.\n// You will need to assert the error if it's not nil i.e. err.(validator.ValidationErrors) to access the map of errors.\n// NOTE: it returns ValidationErrors instead of a single FieldError because this can also\n// validate Array, Slice and maps fields which may contain more than one error\nfunc (v *Validate) FieldWithValue(val interface{}, field interface{}, tag string) error {\n\tv.initCheck()\n\n\tif len(tag) == 0 || tag == skipValidationTag {\n\t\treturn nil\n\t}\n\n\terrs := v.errsPool.Get().(ValidationErrors)\n\ttopVal := reflect.ValueOf(val)\n\n\tctag, ok := v.tagCache.Get(tag)\n\tif !ok {\n\t\tv.tagCache.lock.Lock()\n\t\tdefer v.tagCache.lock.Unlock()\n\n\t\t// could have been multiple trying to access, but once first is done this ensures tag\n\t\t// isn't parsed again.\n\t\tctag, ok = v.tagCache.Get(tag)\n\t\tif !ok {\n\t\t\tctag, _ = v.parseFieldTagsRecursive(tag, blank, blank, false)\n\t\t\tv.tagCache.Set(tag, ctag)\n\t\t}\n\t}\n\n\tv.traverseField(topVal, topVal, reflect.ValueOf(field), blank, blank, errs, false, false, nil, nil, defaultCField, ctag)\n\n\tif len(errs) == 0 {\n\t\tv.errsPool.Put(errs)\n\t\treturn nil\n\t}\n\n\treturn errs\n}\n\n// StructPartial validates the fields passed in only, ignoring all others.\n// Fields may be provided in a namespaced fashion relative to the struct provided\n// i.e. NestedStruct.Field or NestedArrayField[0].Struct.Name and returns nil or ValidationErrors as error\n// You will need to assert the error if it's not nil i.e. err.(validator.ValidationErrors) to access the map of errors.\nfunc (v *Validate) StructPartial(current interface{}, fields ...string) error {\n\tv.initCheck()\n\n\tsv, _ := v.ExtractType(reflect.ValueOf(current))\n\tname := sv.Type().Name()\n\tm := map[string]struct{}{}\n\n\tif fields != nil {\n\t\tfor _, k := range fields {\n\n\t\t\tflds := strings.Split(k, namespaceSeparator)\n\t\t\tif len(flds) > 0 {\n\n\t\t\t\tkey := name + namespaceSeparator\n\t\t\t\tfor _, s := range flds {\n\n\t\t\t\t\tidx := strings.Index(s, leftBracket)\n\n\t\t\t\t\tif idx != -1 {\n\t\t\t\t\t\tfor idx != -1 {\n\t\t\t\t\t\t\tkey += s[:idx]\n\t\t\t\t\t\t\tm[key] = struct{}{}\n\n\t\t\t\t\t\t\tidx2 := strings.Index(s, rightBracket)\n\t\t\t\t\t\t\tidx2++\n\t\t\t\t\t\t\tkey += s[idx:idx2]\n\t\t\t\t\t\t\tm[key] = struct{}{}\n\t\t\t\t\t\t\ts = s[idx2:]\n\t\t\t\t\t\t\tidx = strings.Index(s, leftBracket)\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\tkey += s\n\t\t\t\t\t\tm[key] = struct{}{}\n\t\t\t\t\t}\n\n\t\t\t\t\tkey += namespaceSeparator\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\terrs := v.errsPool.Get().(ValidationErrors)\n\n\tv.ensureValidStruct(sv, sv, sv, blank, blank, errs, true, len(m) != 0, false, m, false)\n\n\tif len(errs) == 0 {\n\t\tv.errsPool.Put(errs)\n\t\treturn nil\n\t}\n\n\treturn errs\n}\n\n// StructExcept validates all fields except the ones passed in.\n// Fields may be provided in a namespaced fashion relative to the struct provided\n// i.e. NestedStruct.Field or NestedArrayField[0].Struct.Name and returns nil or ValidationErrors as error\n// You will need to assert the error if it's not nil i.e. err.(validator.ValidationErrors) to access the map of errors.\nfunc (v *Validate) StructExcept(current interface{}, fields ...string) error {\n\tv.initCheck()\n\n\tsv, _ := v.ExtractType(reflect.ValueOf(current))\n\tname := sv.Type().Name()\n\tm := map[string]struct{}{}\n\n\tfor _, key := range fields {\n\t\tm[name+namespaceSeparator+key] = struct{}{}\n\t}\n\n\terrs := v.errsPool.Get().(ValidationErrors)\n\n\tv.ensureValidStruct(sv, sv, sv, blank, blank, errs, true, len(m) != 0, true, m, false)\n\n\tif len(errs) == 0 {\n\t\tv.errsPool.Put(errs)\n\t\treturn nil\n\t}\n\n\treturn errs\n}\n\n// Struct validates a structs exposed fields, and automatically validates nested structs, unless otherwise specified.\n// it returns nil or ValidationErrors as error.\n// You will need to assert the error if it's not nil i.e. err.(validator.ValidationErrors) to access the map of errors.\nfunc (v *Validate) Struct(current interface{}) error {\n\tv.initCheck()\n\n\terrs := v.errsPool.Get().(ValidationErrors)\n\tsv := reflect.ValueOf(current)\n\n\tv.ensureValidStruct(sv, sv, sv, blank, blank, errs, true, false, false, nil, false)\n\n\tif len(errs) == 0 {\n\t\tv.errsPool.Put(errs)\n\t\treturn nil\n\t}\n\n\treturn errs\n}\n\nfunc (v *Validate) ensureValidStruct(topStruct reflect.Value, currentStruct reflect.Value, current reflect.Value, errPrefix string, nsPrefix string, errs ValidationErrors, useStructName bool, partial bool, exclude bool, includeExclude map[string]struct{}, isStructOnly bool) {\n\n\tif current.Kind() == reflect.Ptr && !current.IsNil() {\n\t\tcurrent = current.Elem()\n\t}\n\n\tif current.Kind() != reflect.Struct && current.Kind() != reflect.Interface {\n\t\tpanic(\"value passed for validation is not a struct\")\n\t}\n\n\tv.tranverseStruct(topStruct, currentStruct, current, errPrefix, nsPrefix, errs, useStructName, partial, exclude, includeExclude, nil, nil)\n}\n\n// tranverseStruct traverses a structs fields and then passes them to be validated by traverseField\nfunc (v *Validate) tranverseStruct(topStruct reflect.Value, currentStruct reflect.Value, current reflect.Value, errPrefix string, nsPrefix string, errs ValidationErrors, useStructName bool, partial bool, exclude bool, includeExclude map[string]struct{}, cs *cStruct, ct *cTag) {\n\n\tvar ok bool\n\tfirst := len(nsPrefix) == 0\n\ttyp := current.Type()\n\n\tcs, ok = v.structCache.Get(typ)\n\tif !ok {\n\t\tcs = v.extractStructCache(current, typ.Name())\n\t}\n\n\tif useStructName {\n\t\terrPrefix += cs.Name + namespaceSeparator\n\n\t\tif len(v.fieldNameTag) != 0 {\n\t\t\tnsPrefix += cs.Name + namespaceSeparator\n\t\t}\n\t}\n\n\t// structonly tag present don't tranverseFields\n\t// but must still check and run below struct level validation\n\t// if present\n\tif first || ct == nil || ct.typeof != typeStructOnly {\n\n\t\tfor _, f := range cs.fields {\n\n\t\t\tif partial {\n\n\t\t\t\t_, ok = includeExclude[errPrefix+f.Name]\n\n\t\t\t\tif (ok && exclude) || (!ok && !exclude) {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tv.traverseField(topStruct, currentStruct, current.Field(f.Idx), errPrefix, nsPrefix, errs, partial, exclude, includeExclude, cs, f, f.cTags)\n\t\t}\n\t}\n\n\t// check if any struct level validations, after all field validations already checked.\n\tif cs.fn != nil {\n\t\tcs.fn(v, &StructLevel{v: v, TopStruct: topStruct, CurrentStruct: current, errPrefix: errPrefix, nsPrefix: nsPrefix, errs: errs})\n\t}\n}\n\n// traverseField validates any field, be it a struct or single field, ensures it's validity and passes it along to be validated via it's tag options\nfunc (v *Validate) traverseField(topStruct reflect.Value, currentStruct reflect.Value, current reflect.Value, errPrefix string, nsPrefix string, errs ValidationErrors, partial bool, exclude bool, includeExclude map[string]struct{}, cs *cStruct, cf *cField, ct *cTag) {\n\n\tcurrent, kind, nullable := v.extractTypeInternal(current, false)\n\tvar typ reflect.Type\n\n\tswitch kind {\n\tcase reflect.Ptr, reflect.Interface, reflect.Invalid:\n\n\t\tif ct == nil {\n\t\t\treturn\n\t\t}\n\n\t\tif ct.typeof == typeOmitEmpty {\n\t\t\treturn\n\t\t}\n\n\t\tif ct.hasTag {\n\n\t\t\tns := errPrefix + cf.Name\n\n\t\t\tif kind == reflect.Invalid {\n\t\t\t\terrs[ns] = &FieldError{\n\t\t\t\t\tFieldNamespace: ns,\n\t\t\t\t\tNameNamespace: nsPrefix + cf.AltName,\n\t\t\t\t\tName: cf.AltName,\n\t\t\t\t\tField: cf.Name,\n\t\t\t\t\tTag: ct.aliasTag,\n\t\t\t\t\tActualTag: ct.tag,\n\t\t\t\t\tParam: ct.param,\n\t\t\t\t\tKind: kind,\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\terrs[ns] = &FieldError{\n\t\t\t\tFieldNamespace: ns,\n\t\t\t\tNameNamespace: nsPrefix + cf.AltName,\n\t\t\t\tName: cf.AltName,\n\t\t\t\tField: cf.Name,\n\t\t\t\tTag: ct.aliasTag,\n\t\t\t\tActualTag: ct.tag,\n\t\t\t\tParam: ct.param,\n\t\t\t\tValue: current.Interface(),\n\t\t\t\tKind: kind,\n\t\t\t\tType: current.Type(),\n\t\t\t}\n\n\t\t\treturn\n\t\t}\n\n\tcase reflect.Struct:\n\t\ttyp = current.Type()\n\n\t\tif typ != timeType {\n\n\t\t\tif ct != nil {\n\t\t\t\tct = ct.next\n\t\t\t}\n\n\t\t\tif ct != nil && ct.typeof == typeNoStructLevel {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tv.tranverseStruct(topStruct, current, current, errPrefix+cf.Name+namespaceSeparator, nsPrefix+cf.AltName+namespaceSeparator, errs, false, partial, exclude, includeExclude, cs, ct)\n\t\t\treturn\n\t\t}\n\t}\n\n\tif !ct.hasTag {\n\t\treturn\n\t}\n\n\ttyp = current.Type()\n\nOUTER:\n\tfor {\n\t\tif ct == nil {\n\t\t\treturn\n\t\t}\n\n\t\tswitch ct.typeof {\n\n\t\tcase typeExists:\n\t\t\tct = ct.next\n\t\t\tcontinue\n\n\t\tcase typeOmitEmpty:\n\n\t\t\tif !nullable && !HasValue(v, topStruct, currentStruct, current, typ, kind, blank) {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tct = ct.next\n\t\t\tcontinue\n\n\t\tcase typeDive:\n\n\t\t\tct = ct.next\n\n\t\t\t// traverse slice or map here\n\t\t\t// or panic ;)\n\t\t\tswitch kind {\n\t\t\tcase reflect.Slice, reflect.Array:\n\n\t\t\t\tfor i := 0; i < current.Len(); i++ {\n\t\t\t\t\tv.traverseField(topStruct, currentStruct, current.Index(i), errPrefix, nsPrefix, errs, partial, exclude, includeExclude, cs, &cField{Name: fmt.Sprintf(arrayIndexFieldName, cf.Name, i), AltName: fmt.Sprintf(arrayIndexFieldName, cf.AltName, i)}, ct)\n\t\t\t\t}\n\n\t\t\tcase reflect.Map:\n\t\t\t\tfor _, key := range current.MapKeys() {\n\t\t\t\t\tv.traverseField(topStruct, currentStruct, current.MapIndex(key), errPrefix, nsPrefix, errs, partial, exclude, includeExclude, cs, &cField{Name: fmt.Sprintf(mapIndexFieldName, cf.Name, key.Interface()), AltName: fmt.Sprintf(mapIndexFieldName, cf.AltName, key.Interface())}, ct)\n\t\t\t\t}\n\n\t\t\tdefault:\n\t\t\t\t// throw error, if not a slice or map then should not have gotten here\n\t\t\t\t// bad dive tag\n\t\t\t\tpanic(\"dive error! can't dive on a non slice or map\")\n\t\t\t}\n\n\t\t\treturn\n\n\t\tcase typeOr:\n\n\t\t\terrTag := blank\n\n\t\t\tfor {\n\n\t\t\t\tif ct.fn(v, topStruct, currentStruct, current, typ, kind, ct.param) {\n\n\t\t\t\t\t// drain rest of the 'or' values, then continue or leave\n\t\t\t\t\tfor {\n\n\t\t\t\t\t\tct = ct.next\n\n\t\t\t\t\t\tif ct == nil {\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif ct.typeof != typeOr {\n\t\t\t\t\t\t\tcontinue OUTER\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\terrTag += orSeparator + ct.tag\n\n\t\t\t\tif ct.next == nil {\n\t\t\t\t\t// if we get here, no valid 'or' value and no more tags\n\n\t\t\t\t\tns := errPrefix + cf.Name\n\n\t\t\t\t\tif ct.hasAlias {\n\t\t\t\t\t\terrs[ns] = &FieldError{\n\t\t\t\t\t\t\tFieldNamespace: ns,\n\t\t\t\t\t\t\tNameNamespace: nsPrefix + cf.AltName,\n\t\t\t\t\t\t\tName: cf.AltName,\n\t\t\t\t\t\t\tField: cf.Name,\n\t\t\t\t\t\t\tTag: ct.aliasTag,\n\t\t\t\t\t\t\tActualTag: ct.actualAliasTag,\n\t\t\t\t\t\t\tValue: current.Interface(),\n\t\t\t\t\t\t\tType: typ,\n\t\t\t\t\t\t\tKind: kind,\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\terrs[errPrefix+cf.Name] = &FieldError{\n\t\t\t\t\t\t\tFieldNamespace: ns,\n\t\t\t\t\t\t\tNameNamespace: nsPrefix + cf.AltName,\n\t\t\t\t\t\t\tName: cf.AltName,\n\t\t\t\t\t\t\tField: cf.Name,\n\t\t\t\t\t\t\tTag: errTag[1:],\n\t\t\t\t\t\t\tActualTag: errTag[1:],\n\t\t\t\t\t\t\tValue: current.Interface(),\n\t\t\t\t\t\t\tType: typ,\n\t\t\t\t\t\t\tKind: kind,\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn\n\t\t\t\t}\n\n\t\t\t\tct = ct.next\n\t\t\t}\n\n\t\tdefault:\n\t\t\tif !ct.fn(v, topStruct, currentStruct, current, typ, kind, ct.param) {\n\n\t\t\t\tns := errPrefix + cf.Name\n\n\t\t\t\terrs[ns] = &FieldError{\n\t\t\t\t\tFieldNamespace: ns,\n\t\t\t\t\tNameNamespace: nsPrefix + cf.AltName,\n\t\t\t\t\tName: cf.AltName,\n\t\t\t\t\tField: cf.Name,\n\t\t\t\t\tTag: ct.aliasTag,\n\t\t\t\t\tActualTag: ct.tag,\n\t\t\t\t\tValue: current.Interface(),\n\t\t\t\t\tParam: ct.param,\n\t\t\t\t\tType: typ,\n\t\t\t\t\tKind: kind,\n\t\t\t\t}\n\n\t\t\t\treturn\n\n\t\t\t}\n\n\t\t\tct = ct.next\n\t\t}\n\t}\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/.travis.yml", "content": "language: go\n\ngo:\n - 1.4\n - 1.5\n - 1.6\n - 1.7\n - 1.8\n - 1.9\n - tip\n\ngo_import_path: gopkg.in/yaml.v2\n" }, { "path": "vendor/gopkg.in/yaml.v2/LICENSE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"{}\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright {yyyy} {name of copyright owner}\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/gopkg.in/yaml.v2/LICENSE.libyaml", "content": "The following files were ported to Go from C files of libyaml, and thus\nare still covered by their original copyright and license:\n\n apic.go\n emitterc.go\n parserc.go\n readerc.go\n scannerc.go\n writerc.go\n yamlh.go\n yamlprivateh.go\n\nCopyright (c) 2006 Kirill Simonov\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\nof the Software, and to permit persons to whom the Software is furnished to do\nso, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/gopkg.in/yaml.v2/NOTICE", "content": "Copyright 2011-2016 Canonical Ltd.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n" }, { "path": "vendor/gopkg.in/yaml.v2/README.md", "content": "# YAML support for the Go language\n\nIntroduction\n------------\n\nThe yaml package enables Go programs to comfortably encode and decode YAML\nvalues. It was developed within [Canonical](https://www.canonical.com) as\npart of the [juju](https://juju.ubuntu.com) project, and is based on a\npure Go port of the well-known [libyaml](http://pyyaml.org/wiki/LibYAML)\nC library to parse and generate YAML data quickly and reliably.\n\nCompatibility\n-------------\n\nThe yaml package supports most of YAML 1.1 and 1.2, including support for\nanchors, tags, map merging, etc. Multi-document unmarshalling is not yet\nimplemented, and base-60 floats from YAML 1.1 are purposefully not\nsupported since they're a poor design and are gone in YAML 1.2.\n\nInstallation and usage\n----------------------\n\nThe import path for the package is *gopkg.in/yaml.v2*.\n\nTo install it, run:\n\n go get gopkg.in/yaml.v2\n\nAPI documentation\n-----------------\n\nIf opened in a browser, the import path itself leads to the API documentation:\n\n * [https://gopkg.in/yaml.v2](https://gopkg.in/yaml.v2)\n\nAPI stability\n-------------\n\nThe package API for yaml v2 will remain stable as described in [gopkg.in](https://gopkg.in).\n\n\nLicense\n-------\n\nThe yaml package is licensed under the Apache License 2.0. Please see the LICENSE file for details.\n\n\nExample\n-------\n\n```Go\npackage main\n\nimport (\n \"fmt\"\n \"log\"\n\n \"gopkg.in/yaml.v2\"\n)\n\nvar data = `\na: Easy!\nb:\n c: 2\n d: [3, 4]\n`\n\n// Note: struct fields must be public in order for unmarshal to\n// correctly populate the data.\ntype T struct {\n A string\n B struct {\n RenamedC int `yaml:\"c\"`\n D []int `yaml:\",flow\"`\n }\n}\n\nfunc main() {\n t := T{}\n \n err := yaml.Unmarshal([]byte(data), &t)\n if err != nil {\n log.Fatalf(\"error: %v\", err)\n }\n fmt.Printf(\"--- t:\\n%v\\n\\n\", t)\n \n d, err := yaml.Marshal(&t)\n if err != nil {\n log.Fatalf(\"error: %v\", err)\n }\n fmt.Printf(\"--- t dump:\\n%s\\n\\n\", string(d))\n \n m := make(map[interface{}]interface{})\n \n err = yaml.Unmarshal([]byte(data), &m)\n if err != nil {\n log.Fatalf(\"error: %v\", err)\n }\n fmt.Printf(\"--- m:\\n%v\\n\\n\", m)\n \n d, err = yaml.Marshal(&m)\n if err != nil {\n log.Fatalf(\"error: %v\", err)\n }\n fmt.Printf(\"--- m dump:\\n%s\\n\\n\", string(d))\n}\n```\n\nThis example will generate the following output:\n\n```\n--- t:\n{Easy! {2 [3 4]}}\n\n--- t dump:\na: Easy!\nb:\n c: 2\n d: [3, 4]\n\n\n--- m:\nmap[a:Easy! b:map[c:2 d:[3 4]]]\n\n--- m dump:\na: Easy!\nb:\n c: 2\n d:\n - 3\n - 4\n```\n\n" }, { "path": "vendor/gopkg.in/yaml.v2/apic.go", "content": "package yaml\n\nimport (\n\t\"io\"\n)\n\nfunc yaml_insert_token(parser *yaml_parser_t, pos int, token *yaml_token_t) {\n\t//fmt.Println(\"yaml_insert_token\", \"pos:\", pos, \"typ:\", token.typ, \"head:\", parser.tokens_head, \"len:\", len(parser.tokens))\n\n\t// Check if we can move the queue at the beginning of the buffer.\n\tif parser.tokens_head > 0 && len(parser.tokens) == cap(parser.tokens) {\n\t\tif parser.tokens_head != len(parser.tokens) {\n\t\t\tcopy(parser.tokens, parser.tokens[parser.tokens_head:])\n\t\t}\n\t\tparser.tokens = parser.tokens[:len(parser.tokens)-parser.tokens_head]\n\t\tparser.tokens_head = 0\n\t}\n\tparser.tokens = append(parser.tokens, *token)\n\tif pos < 0 {\n\t\treturn\n\t}\n\tcopy(parser.tokens[parser.tokens_head+pos+1:], parser.tokens[parser.tokens_head+pos:])\n\tparser.tokens[parser.tokens_head+pos] = *token\n}\n\n// Create a new parser object.\nfunc yaml_parser_initialize(parser *yaml_parser_t) bool {\n\t*parser = yaml_parser_t{\n\t\traw_buffer: make([]byte, 0, input_raw_buffer_size),\n\t\tbuffer: make([]byte, 0, input_buffer_size),\n\t}\n\treturn true\n}\n\n// Destroy a parser object.\nfunc yaml_parser_delete(parser *yaml_parser_t) {\n\t*parser = yaml_parser_t{}\n}\n\n// String read handler.\nfunc yaml_string_read_handler(parser *yaml_parser_t, buffer []byte) (n int, err error) {\n\tif parser.input_pos == len(parser.input) {\n\t\treturn 0, io.EOF\n\t}\n\tn = copy(buffer, parser.input[parser.input_pos:])\n\tparser.input_pos += n\n\treturn n, nil\n}\n\n// Reader read handler.\nfunc yaml_reader_read_handler(parser *yaml_parser_t, buffer []byte) (n int, err error) {\n\treturn parser.input_reader.Read(buffer)\n}\n\n// Set a string input.\nfunc yaml_parser_set_input_string(parser *yaml_parser_t, input []byte) {\n\tif parser.read_handler != nil {\n\t\tpanic(\"must set the input source only once\")\n\t}\n\tparser.read_handler = yaml_string_read_handler\n\tparser.input = input\n\tparser.input_pos = 0\n}\n\n// Set a file input.\nfunc yaml_parser_set_input_reader(parser *yaml_parser_t, r io.Reader) {\n\tif parser.read_handler != nil {\n\t\tpanic(\"must set the input source only once\")\n\t}\n\tparser.read_handler = yaml_reader_read_handler\n\tparser.input_reader = r\n}\n\n// Set the source encoding.\nfunc yaml_parser_set_encoding(parser *yaml_parser_t, encoding yaml_encoding_t) {\n\tif parser.encoding != yaml_ANY_ENCODING {\n\t\tpanic(\"must set the encoding only once\")\n\t}\n\tparser.encoding = encoding\n}\n\n// Create a new emitter object.\nfunc yaml_emitter_initialize(emitter *yaml_emitter_t) {\n\t*emitter = yaml_emitter_t{\n\t\tbuffer: make([]byte, output_buffer_size),\n\t\traw_buffer: make([]byte, 0, output_raw_buffer_size),\n\t\tstates: make([]yaml_emitter_state_t, 0, initial_stack_size),\n\t\tevents: make([]yaml_event_t, 0, initial_queue_size),\n\t}\n}\n\n// Destroy an emitter object.\nfunc yaml_emitter_delete(emitter *yaml_emitter_t) {\n\t*emitter = yaml_emitter_t{}\n}\n\n// String write handler.\nfunc yaml_string_write_handler(emitter *yaml_emitter_t, buffer []byte) error {\n\t*emitter.output_buffer = append(*emitter.output_buffer, buffer...)\n\treturn nil\n}\n\n// yaml_writer_write_handler uses emitter.output_writer to write the\n// emitted text.\nfunc yaml_writer_write_handler(emitter *yaml_emitter_t, buffer []byte) error {\n\t_, err := emitter.output_writer.Write(buffer)\n\treturn err\n}\n\n// Set a string output.\nfunc yaml_emitter_set_output_string(emitter *yaml_emitter_t, output_buffer *[]byte) {\n\tif emitter.write_handler != nil {\n\t\tpanic(\"must set the output target only once\")\n\t}\n\temitter.write_handler = yaml_string_write_handler\n\temitter.output_buffer = output_buffer\n}\n\n// Set a file output.\nfunc yaml_emitter_set_output_writer(emitter *yaml_emitter_t, w io.Writer) {\n\tif emitter.write_handler != nil {\n\t\tpanic(\"must set the output target only once\")\n\t}\n\temitter.write_handler = yaml_writer_write_handler\n\temitter.output_writer = w\n}\n\n// Set the output encoding.\nfunc yaml_emitter_set_encoding(emitter *yaml_emitter_t, encoding yaml_encoding_t) {\n\tif emitter.encoding != yaml_ANY_ENCODING {\n\t\tpanic(\"must set the output encoding only once\")\n\t}\n\temitter.encoding = encoding\n}\n\n// Set the canonical output style.\nfunc yaml_emitter_set_canonical(emitter *yaml_emitter_t, canonical bool) {\n\temitter.canonical = canonical\n}\n\n//// Set the indentation increment.\nfunc yaml_emitter_set_indent(emitter *yaml_emitter_t, indent int) {\n\tif indent < 2 || indent > 9 {\n\t\tindent = 2\n\t}\n\temitter.best_indent = indent\n}\n\n// Set the preferred line width.\nfunc yaml_emitter_set_width(emitter *yaml_emitter_t, width int) {\n\tif width < 0 {\n\t\twidth = -1\n\t}\n\temitter.best_width = width\n}\n\n// Set if unescaped non-ASCII characters are allowed.\nfunc yaml_emitter_set_unicode(emitter *yaml_emitter_t, unicode bool) {\n\temitter.unicode = unicode\n}\n\n// Set the preferred line break character.\nfunc yaml_emitter_set_break(emitter *yaml_emitter_t, line_break yaml_break_t) {\n\temitter.line_break = line_break\n}\n\n///*\n// * Destroy a token object.\n// */\n//\n//YAML_DECLARE(void)\n//yaml_token_delete(yaml_token_t *token)\n//{\n// assert(token); // Non-NULL token object expected.\n//\n// switch (token.type)\n// {\n// case YAML_TAG_DIRECTIVE_TOKEN:\n// yaml_free(token.data.tag_directive.handle);\n// yaml_free(token.data.tag_directive.prefix);\n// break;\n//\n// case YAML_ALIAS_TOKEN:\n// yaml_free(token.data.alias.value);\n// break;\n//\n// case YAML_ANCHOR_TOKEN:\n// yaml_free(token.data.anchor.value);\n// break;\n//\n// case YAML_TAG_TOKEN:\n// yaml_free(token.data.tag.handle);\n// yaml_free(token.data.tag.suffix);\n// break;\n//\n// case YAML_SCALAR_TOKEN:\n// yaml_free(token.data.scalar.value);\n// break;\n//\n// default:\n// break;\n// }\n//\n// memset(token, 0, sizeof(yaml_token_t));\n//}\n//\n///*\n// * Check if a string is a valid UTF-8 sequence.\n// *\n// * Check 'reader.c' for more details on UTF-8 encoding.\n// */\n//\n//static int\n//yaml_check_utf8(yaml_char_t *start, size_t length)\n//{\n// yaml_char_t *end = start+length;\n// yaml_char_t *pointer = start;\n//\n// while (pointer < end) {\n// unsigned char octet;\n// unsigned int width;\n// unsigned int value;\n// size_t k;\n//\n// octet = pointer[0];\n// width = (octet & 0x80) == 0x00 ? 1 :\n// (octet & 0xE0) == 0xC0 ? 2 :\n// (octet & 0xF0) == 0xE0 ? 3 :\n// (octet & 0xF8) == 0xF0 ? 4 : 0;\n// value = (octet & 0x80) == 0x00 ? octet & 0x7F :\n// (octet & 0xE0) == 0xC0 ? octet & 0x1F :\n// (octet & 0xF0) == 0xE0 ? octet & 0x0F :\n// (octet & 0xF8) == 0xF0 ? octet & 0x07 : 0;\n// if (!width) return 0;\n// if (pointer+width > end) return 0;\n// for (k = 1; k < width; k ++) {\n// octet = pointer[k];\n// if ((octet & 0xC0) != 0x80) return 0;\n// value = (value << 6) + (octet & 0x3F);\n// }\n// if (!((width == 1) ||\n// (width == 2 && value >= 0x80) ||\n// (width == 3 && value >= 0x800) ||\n// (width == 4 && value >= 0x10000))) return 0;\n//\n// pointer += width;\n// }\n//\n// return 1;\n//}\n//\n\n// Create STREAM-START.\nfunc yaml_stream_start_event_initialize(event *yaml_event_t, encoding yaml_encoding_t) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_STREAM_START_EVENT,\n\t\tencoding: encoding,\n\t}\n}\n\n// Create STREAM-END.\nfunc yaml_stream_end_event_initialize(event *yaml_event_t) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_STREAM_END_EVENT,\n\t}\n}\n\n// Create DOCUMENT-START.\nfunc yaml_document_start_event_initialize(\n\tevent *yaml_event_t,\n\tversion_directive *yaml_version_directive_t,\n\ttag_directives []yaml_tag_directive_t,\n\timplicit bool,\n) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_DOCUMENT_START_EVENT,\n\t\tversion_directive: version_directive,\n\t\ttag_directives: tag_directives,\n\t\timplicit: implicit,\n\t}\n}\n\n// Create DOCUMENT-END.\nfunc yaml_document_end_event_initialize(event *yaml_event_t, implicit bool) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_DOCUMENT_END_EVENT,\n\t\timplicit: implicit,\n\t}\n}\n\n///*\n// * Create ALIAS.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_alias_event_initialize(event *yaml_event_t, anchor *yaml_char_t)\n//{\n// mark yaml_mark_t = { 0, 0, 0 }\n// anchor_copy *yaml_char_t = NULL\n//\n// assert(event) // Non-NULL event object is expected.\n// assert(anchor) // Non-NULL anchor is expected.\n//\n// if (!yaml_check_utf8(anchor, strlen((char *)anchor))) return 0\n//\n// anchor_copy = yaml_strdup(anchor)\n// if (!anchor_copy)\n// return 0\n//\n// ALIAS_EVENT_INIT(*event, anchor_copy, mark, mark)\n//\n// return 1\n//}\n\n// Create SCALAR.\nfunc yaml_scalar_event_initialize(event *yaml_event_t, anchor, tag, value []byte, plain_implicit, quoted_implicit bool, style yaml_scalar_style_t) bool {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SCALAR_EVENT,\n\t\tanchor: anchor,\n\t\ttag: tag,\n\t\tvalue: value,\n\t\timplicit: plain_implicit,\n\t\tquoted_implicit: quoted_implicit,\n\t\tstyle: yaml_style_t(style),\n\t}\n\treturn true\n}\n\n// Create SEQUENCE-START.\nfunc yaml_sequence_start_event_initialize(event *yaml_event_t, anchor, tag []byte, implicit bool, style yaml_sequence_style_t) bool {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SEQUENCE_START_EVENT,\n\t\tanchor: anchor,\n\t\ttag: tag,\n\t\timplicit: implicit,\n\t\tstyle: yaml_style_t(style),\n\t}\n\treturn true\n}\n\n// Create SEQUENCE-END.\nfunc yaml_sequence_end_event_initialize(event *yaml_event_t) bool {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SEQUENCE_END_EVENT,\n\t}\n\treturn true\n}\n\n// Create MAPPING-START.\nfunc yaml_mapping_start_event_initialize(event *yaml_event_t, anchor, tag []byte, implicit bool, style yaml_mapping_style_t) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_MAPPING_START_EVENT,\n\t\tanchor: anchor,\n\t\ttag: tag,\n\t\timplicit: implicit,\n\t\tstyle: yaml_style_t(style),\n\t}\n}\n\n// Create MAPPING-END.\nfunc yaml_mapping_end_event_initialize(event *yaml_event_t) {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_MAPPING_END_EVENT,\n\t}\n}\n\n// Destroy an event object.\nfunc yaml_event_delete(event *yaml_event_t) {\n\t*event = yaml_event_t{}\n}\n\n///*\n// * Create a document object.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_initialize(document *yaml_document_t,\n// version_directive *yaml_version_directive_t,\n// tag_directives_start *yaml_tag_directive_t,\n// tag_directives_end *yaml_tag_directive_t,\n// start_implicit int, end_implicit int)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n// struct {\n// start *yaml_node_t\n// end *yaml_node_t\n// top *yaml_node_t\n// } nodes = { NULL, NULL, NULL }\n// version_directive_copy *yaml_version_directive_t = NULL\n// struct {\n// start *yaml_tag_directive_t\n// end *yaml_tag_directive_t\n// top *yaml_tag_directive_t\n// } tag_directives_copy = { NULL, NULL, NULL }\n// value yaml_tag_directive_t = { NULL, NULL }\n// mark yaml_mark_t = { 0, 0, 0 }\n//\n// assert(document) // Non-NULL document object is expected.\n// assert((tag_directives_start && tag_directives_end) ||\n// (tag_directives_start == tag_directives_end))\n// // Valid tag directives are expected.\n//\n// if (!STACK_INIT(&context, nodes, INITIAL_STACK_SIZE)) goto error\n//\n// if (version_directive) {\n// version_directive_copy = yaml_malloc(sizeof(yaml_version_directive_t))\n// if (!version_directive_copy) goto error\n// version_directive_copy.major = version_directive.major\n// version_directive_copy.minor = version_directive.minor\n// }\n//\n// if (tag_directives_start != tag_directives_end) {\n// tag_directive *yaml_tag_directive_t\n// if (!STACK_INIT(&context, tag_directives_copy, INITIAL_STACK_SIZE))\n// goto error\n// for (tag_directive = tag_directives_start\n// tag_directive != tag_directives_end; tag_directive ++) {\n// assert(tag_directive.handle)\n// assert(tag_directive.prefix)\n// if (!yaml_check_utf8(tag_directive.handle,\n// strlen((char *)tag_directive.handle)))\n// goto error\n// if (!yaml_check_utf8(tag_directive.prefix,\n// strlen((char *)tag_directive.prefix)))\n// goto error\n// value.handle = yaml_strdup(tag_directive.handle)\n// value.prefix = yaml_strdup(tag_directive.prefix)\n// if (!value.handle || !value.prefix) goto error\n// if (!PUSH(&context, tag_directives_copy, value))\n// goto error\n// value.handle = NULL\n// value.prefix = NULL\n// }\n// }\n//\n// DOCUMENT_INIT(*document, nodes.start, nodes.end, version_directive_copy,\n// tag_directives_copy.start, tag_directives_copy.top,\n// start_implicit, end_implicit, mark, mark)\n//\n// return 1\n//\n//error:\n// STACK_DEL(&context, nodes)\n// yaml_free(version_directive_copy)\n// while (!STACK_EMPTY(&context, tag_directives_copy)) {\n// value yaml_tag_directive_t = POP(&context, tag_directives_copy)\n// yaml_free(value.handle)\n// yaml_free(value.prefix)\n// }\n// STACK_DEL(&context, tag_directives_copy)\n// yaml_free(value.handle)\n// yaml_free(value.prefix)\n//\n// return 0\n//}\n//\n///*\n// * Destroy a document object.\n// */\n//\n//YAML_DECLARE(void)\n//yaml_document_delete(document *yaml_document_t)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n// tag_directive *yaml_tag_directive_t\n//\n// context.error = YAML_NO_ERROR // Eliminate a compiler warning.\n//\n// assert(document) // Non-NULL document object is expected.\n//\n// while (!STACK_EMPTY(&context, document.nodes)) {\n// node yaml_node_t = POP(&context, document.nodes)\n// yaml_free(node.tag)\n// switch (node.type) {\n// case YAML_SCALAR_NODE:\n// yaml_free(node.data.scalar.value)\n// break\n// case YAML_SEQUENCE_NODE:\n// STACK_DEL(&context, node.data.sequence.items)\n// break\n// case YAML_MAPPING_NODE:\n// STACK_DEL(&context, node.data.mapping.pairs)\n// break\n// default:\n// assert(0) // Should not happen.\n// }\n// }\n// STACK_DEL(&context, document.nodes)\n//\n// yaml_free(document.version_directive)\n// for (tag_directive = document.tag_directives.start\n// tag_directive != document.tag_directives.end\n// tag_directive++) {\n// yaml_free(tag_directive.handle)\n// yaml_free(tag_directive.prefix)\n// }\n// yaml_free(document.tag_directives.start)\n//\n// memset(document, 0, sizeof(yaml_document_t))\n//}\n//\n///**\n// * Get a document node.\n// */\n//\n//YAML_DECLARE(yaml_node_t *)\n//yaml_document_get_node(document *yaml_document_t, index int)\n//{\n// assert(document) // Non-NULL document object is expected.\n//\n// if (index > 0 && document.nodes.start + index <= document.nodes.top) {\n// return document.nodes.start + index - 1\n// }\n// return NULL\n//}\n//\n///**\n// * Get the root object.\n// */\n//\n//YAML_DECLARE(yaml_node_t *)\n//yaml_document_get_root_node(document *yaml_document_t)\n//{\n// assert(document) // Non-NULL document object is expected.\n//\n// if (document.nodes.top != document.nodes.start) {\n// return document.nodes.start\n// }\n// return NULL\n//}\n//\n///*\n// * Add a scalar node to a document.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_add_scalar(document *yaml_document_t,\n// tag *yaml_char_t, value *yaml_char_t, length int,\n// style yaml_scalar_style_t)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n// mark yaml_mark_t = { 0, 0, 0 }\n// tag_copy *yaml_char_t = NULL\n// value_copy *yaml_char_t = NULL\n// node yaml_node_t\n//\n// assert(document) // Non-NULL document object is expected.\n// assert(value) // Non-NULL value is expected.\n//\n// if (!tag) {\n// tag = (yaml_char_t *)YAML_DEFAULT_SCALAR_TAG\n// }\n//\n// if (!yaml_check_utf8(tag, strlen((char *)tag))) goto error\n// tag_copy = yaml_strdup(tag)\n// if (!tag_copy) goto error\n//\n// if (length < 0) {\n// length = strlen((char *)value)\n// }\n//\n// if (!yaml_check_utf8(value, length)) goto error\n// value_copy = yaml_malloc(length+1)\n// if (!value_copy) goto error\n// memcpy(value_copy, value, length)\n// value_copy[length] = '\\0'\n//\n// SCALAR_NODE_INIT(node, tag_copy, value_copy, length, style, mark, mark)\n// if (!PUSH(&context, document.nodes, node)) goto error\n//\n// return document.nodes.top - document.nodes.start\n//\n//error:\n// yaml_free(tag_copy)\n// yaml_free(value_copy)\n//\n// return 0\n//}\n//\n///*\n// * Add a sequence node to a document.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_add_sequence(document *yaml_document_t,\n// tag *yaml_char_t, style yaml_sequence_style_t)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n// mark yaml_mark_t = { 0, 0, 0 }\n// tag_copy *yaml_char_t = NULL\n// struct {\n// start *yaml_node_item_t\n// end *yaml_node_item_t\n// top *yaml_node_item_t\n// } items = { NULL, NULL, NULL }\n// node yaml_node_t\n//\n// assert(document) // Non-NULL document object is expected.\n//\n// if (!tag) {\n// tag = (yaml_char_t *)YAML_DEFAULT_SEQUENCE_TAG\n// }\n//\n// if (!yaml_check_utf8(tag, strlen((char *)tag))) goto error\n// tag_copy = yaml_strdup(tag)\n// if (!tag_copy) goto error\n//\n// if (!STACK_INIT(&context, items, INITIAL_STACK_SIZE)) goto error\n//\n// SEQUENCE_NODE_INIT(node, tag_copy, items.start, items.end,\n// style, mark, mark)\n// if (!PUSH(&context, document.nodes, node)) goto error\n//\n// return document.nodes.top - document.nodes.start\n//\n//error:\n// STACK_DEL(&context, items)\n// yaml_free(tag_copy)\n//\n// return 0\n//}\n//\n///*\n// * Add a mapping node to a document.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_add_mapping(document *yaml_document_t,\n// tag *yaml_char_t, style yaml_mapping_style_t)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n// mark yaml_mark_t = { 0, 0, 0 }\n// tag_copy *yaml_char_t = NULL\n// struct {\n// start *yaml_node_pair_t\n// end *yaml_node_pair_t\n// top *yaml_node_pair_t\n// } pairs = { NULL, NULL, NULL }\n// node yaml_node_t\n//\n// assert(document) // Non-NULL document object is expected.\n//\n// if (!tag) {\n// tag = (yaml_char_t *)YAML_DEFAULT_MAPPING_TAG\n// }\n//\n// if (!yaml_check_utf8(tag, strlen((char *)tag))) goto error\n// tag_copy = yaml_strdup(tag)\n// if (!tag_copy) goto error\n//\n// if (!STACK_INIT(&context, pairs, INITIAL_STACK_SIZE)) goto error\n//\n// MAPPING_NODE_INIT(node, tag_copy, pairs.start, pairs.end,\n// style, mark, mark)\n// if (!PUSH(&context, document.nodes, node)) goto error\n//\n// return document.nodes.top - document.nodes.start\n//\n//error:\n// STACK_DEL(&context, pairs)\n// yaml_free(tag_copy)\n//\n// return 0\n//}\n//\n///*\n// * Append an item to a sequence node.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_append_sequence_item(document *yaml_document_t,\n// sequence int, item int)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n//\n// assert(document) // Non-NULL document is required.\n// assert(sequence > 0\n// && document.nodes.start + sequence <= document.nodes.top)\n// // Valid sequence id is required.\n// assert(document.nodes.start[sequence-1].type == YAML_SEQUENCE_NODE)\n// // A sequence node is required.\n// assert(item > 0 && document.nodes.start + item <= document.nodes.top)\n// // Valid item id is required.\n//\n// if (!PUSH(&context,\n// document.nodes.start[sequence-1].data.sequence.items, item))\n// return 0\n//\n// return 1\n//}\n//\n///*\n// * Append a pair of a key and a value to a mapping node.\n// */\n//\n//YAML_DECLARE(int)\n//yaml_document_append_mapping_pair(document *yaml_document_t,\n// mapping int, key int, value int)\n//{\n// struct {\n// error yaml_error_type_t\n// } context\n//\n// pair yaml_node_pair_t\n//\n// assert(document) // Non-NULL document is required.\n// assert(mapping > 0\n// && document.nodes.start + mapping <= document.nodes.top)\n// // Valid mapping id is required.\n// assert(document.nodes.start[mapping-1].type == YAML_MAPPING_NODE)\n// // A mapping node is required.\n// assert(key > 0 && document.nodes.start + key <= document.nodes.top)\n// // Valid key id is required.\n// assert(value > 0 && document.nodes.start + value <= document.nodes.top)\n// // Valid value id is required.\n//\n// pair.key = key\n// pair.value = value\n//\n// if (!PUSH(&context,\n// document.nodes.start[mapping-1].data.mapping.pairs, pair))\n// return 0\n//\n// return 1\n//}\n//\n//\n" }, { "path": "vendor/gopkg.in/yaml.v2/decode.go", "content": "package yaml\n\nimport (\n\t\"encoding\"\n\t\"encoding/base64\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"time\"\n)\n\nconst (\n\tdocumentNode = 1 << iota\n\tmappingNode\n\tsequenceNode\n\tscalarNode\n\taliasNode\n)\n\ntype node struct {\n\tkind int\n\tline, column int\n\ttag string\n\t// For an alias node, alias holds the resolved alias.\n\talias *node\n\tvalue string\n\timplicit bool\n\tchildren []*node\n\tanchors map[string]*node\n}\n\n// ----------------------------------------------------------------------------\n// Parser, produces a node tree out of a libyaml event stream.\n\ntype parser struct {\n\tparser yaml_parser_t\n\tevent yaml_event_t\n\tdoc *node\n\tdoneInit bool\n}\n\nfunc newParser(b []byte) *parser {\n\tp := parser{}\n\tif !yaml_parser_initialize(&p.parser) {\n\t\tpanic(\"failed to initialize YAML emitter\")\n\t}\n\tif len(b) == 0 {\n\t\tb = []byte{'\\n'}\n\t}\n\tyaml_parser_set_input_string(&p.parser, b)\n\treturn &p\n}\n\nfunc newParserFromReader(r io.Reader) *parser {\n\tp := parser{}\n\tif !yaml_parser_initialize(&p.parser) {\n\t\tpanic(\"failed to initialize YAML emitter\")\n\t}\n\tyaml_parser_set_input_reader(&p.parser, r)\n\treturn &p\n}\n\nfunc (p *parser) init() {\n\tif p.doneInit {\n\t\treturn\n\t}\n\tp.expect(yaml_STREAM_START_EVENT)\n\tp.doneInit = true\n}\n\nfunc (p *parser) destroy() {\n\tif p.event.typ != yaml_NO_EVENT {\n\t\tyaml_event_delete(&p.event)\n\t}\n\tyaml_parser_delete(&p.parser)\n}\n\n// expect consumes an event from the event stream and\n// checks that it's of the expected type.\nfunc (p *parser) expect(e yaml_event_type_t) {\n\tif p.event.typ == yaml_NO_EVENT {\n\t\tif !yaml_parser_parse(&p.parser, &p.event) {\n\t\t\tp.fail()\n\t\t}\n\t}\n\tif p.event.typ == yaml_STREAM_END_EVENT {\n\t\tfailf(\"attempted to go past the end of stream; corrupted value?\")\n\t}\n\tif p.event.typ != e {\n\t\tp.parser.problem = fmt.Sprintf(\"expected %s event but got %s\", e, p.event.typ)\n\t\tp.fail()\n\t}\n\tyaml_event_delete(&p.event)\n\tp.event.typ = yaml_NO_EVENT\n}\n\n// peek peeks at the next event in the event stream,\n// puts the results into p.event and returns the event type.\nfunc (p *parser) peek() yaml_event_type_t {\n\tif p.event.typ != yaml_NO_EVENT {\n\t\treturn p.event.typ\n\t}\n\tif !yaml_parser_parse(&p.parser, &p.event) {\n\t\tp.fail()\n\t}\n\treturn p.event.typ\n}\n\nfunc (p *parser) fail() {\n\tvar where string\n\tvar line int\n\tif p.parser.problem_mark.line != 0 {\n\t\tline = p.parser.problem_mark.line\n\t\t// Scanner errors don't iterate line before returning error\n\t\tif p.parser.error == yaml_SCANNER_ERROR {\n\t\t\tline++\n\t\t}\n\t} else if p.parser.context_mark.line != 0 {\n\t\tline = p.parser.context_mark.line\n\t}\n\tif line != 0 {\n\t\twhere = \"line \" + strconv.Itoa(line) + \": \"\n\t}\n\tvar msg string\n\tif len(p.parser.problem) > 0 {\n\t\tmsg = p.parser.problem\n\t} else {\n\t\tmsg = \"unknown problem parsing YAML content\"\n\t}\n\tfailf(\"%s%s\", where, msg)\n}\n\nfunc (p *parser) anchor(n *node, anchor []byte) {\n\tif anchor != nil {\n\t\tp.doc.anchors[string(anchor)] = n\n\t}\n}\n\nfunc (p *parser) parse() *node {\n\tp.init()\n\tswitch p.peek() {\n\tcase yaml_SCALAR_EVENT:\n\t\treturn p.scalar()\n\tcase yaml_ALIAS_EVENT:\n\t\treturn p.alias()\n\tcase yaml_MAPPING_START_EVENT:\n\t\treturn p.mapping()\n\tcase yaml_SEQUENCE_START_EVENT:\n\t\treturn p.sequence()\n\tcase yaml_DOCUMENT_START_EVENT:\n\t\treturn p.document()\n\tcase yaml_STREAM_END_EVENT:\n\t\t// Happens when attempting to decode an empty buffer.\n\t\treturn nil\n\tdefault:\n\t\tpanic(\"attempted to parse unknown event: \" + p.event.typ.String())\n\t}\n}\n\nfunc (p *parser) node(kind int) *node {\n\treturn &node{\n\t\tkind: kind,\n\t\tline: p.event.start_mark.line,\n\t\tcolumn: p.event.start_mark.column,\n\t}\n}\n\nfunc (p *parser) document() *node {\n\tn := p.node(documentNode)\n\tn.anchors = make(map[string]*node)\n\tp.doc = n\n\tp.expect(yaml_DOCUMENT_START_EVENT)\n\tn.children = append(n.children, p.parse())\n\tp.expect(yaml_DOCUMENT_END_EVENT)\n\treturn n\n}\n\nfunc (p *parser) alias() *node {\n\tn := p.node(aliasNode)\n\tn.value = string(p.event.anchor)\n\tn.alias = p.doc.anchors[n.value]\n\tif n.alias == nil {\n\t\tfailf(\"unknown anchor '%s' referenced\", n.value)\n\t}\n\tp.expect(yaml_ALIAS_EVENT)\n\treturn n\n}\n\nfunc (p *parser) scalar() *node {\n\tn := p.node(scalarNode)\n\tn.value = string(p.event.value)\n\tn.tag = string(p.event.tag)\n\tn.implicit = p.event.implicit\n\tp.anchor(n, p.event.anchor)\n\tp.expect(yaml_SCALAR_EVENT)\n\treturn n\n}\n\nfunc (p *parser) sequence() *node {\n\tn := p.node(sequenceNode)\n\tp.anchor(n, p.event.anchor)\n\tp.expect(yaml_SEQUENCE_START_EVENT)\n\tfor p.peek() != yaml_SEQUENCE_END_EVENT {\n\t\tn.children = append(n.children, p.parse())\n\t}\n\tp.expect(yaml_SEQUENCE_END_EVENT)\n\treturn n\n}\n\nfunc (p *parser) mapping() *node {\n\tn := p.node(mappingNode)\n\tp.anchor(n, p.event.anchor)\n\tp.expect(yaml_MAPPING_START_EVENT)\n\tfor p.peek() != yaml_MAPPING_END_EVENT {\n\t\tn.children = append(n.children, p.parse(), p.parse())\n\t}\n\tp.expect(yaml_MAPPING_END_EVENT)\n\treturn n\n}\n\n// ----------------------------------------------------------------------------\n// Decoder, unmarshals a node into a provided value.\n\ntype decoder struct {\n\tdoc *node\n\taliases map[*node]bool\n\tmapType reflect.Type\n\tterrors []string\n\tstrict bool\n}\n\nvar (\n\tmapItemType = reflect.TypeOf(MapItem{})\n\tdurationType = reflect.TypeOf(time.Duration(0))\n\tdefaultMapType = reflect.TypeOf(map[interface{}]interface{}{})\n\tifaceType = defaultMapType.Elem()\n\ttimeType = reflect.TypeOf(time.Time{})\n\tptrTimeType = reflect.TypeOf(&time.Time{})\n)\n\nfunc newDecoder(strict bool) *decoder {\n\td := &decoder{mapType: defaultMapType, strict: strict}\n\td.aliases = make(map[*node]bool)\n\treturn d\n}\n\nfunc (d *decoder) terror(n *node, tag string, out reflect.Value) {\n\tif n.tag != \"\" {\n\t\ttag = n.tag\n\t}\n\tvalue := n.value\n\tif tag != yaml_SEQ_TAG && tag != yaml_MAP_TAG {\n\t\tif len(value) > 10 {\n\t\t\tvalue = \" `\" + value[:7] + \"...`\"\n\t\t} else {\n\t\t\tvalue = \" `\" + value + \"`\"\n\t\t}\n\t}\n\td.terrors = append(d.terrors, fmt.Sprintf(\"line %d: cannot unmarshal %s%s into %s\", n.line+1, shortTag(tag), value, out.Type()))\n}\n\nfunc (d *decoder) callUnmarshaler(n *node, u Unmarshaler) (good bool) {\n\tterrlen := len(d.terrors)\n\terr := u.UnmarshalYAML(func(v interface{}) (err error) {\n\t\tdefer handleErr(&err)\n\t\td.unmarshal(n, reflect.ValueOf(v))\n\t\tif len(d.terrors) > terrlen {\n\t\t\tissues := d.terrors[terrlen:]\n\t\t\td.terrors = d.terrors[:terrlen]\n\t\t\treturn &TypeError{issues}\n\t\t}\n\t\treturn nil\n\t})\n\tif e, ok := err.(*TypeError); ok {\n\t\td.terrors = append(d.terrors, e.Errors...)\n\t\treturn false\n\t}\n\tif err != nil {\n\t\tfail(err)\n\t}\n\treturn true\n}\n\n// d.prepare initializes and dereferences pointers and calls UnmarshalYAML\n// if a value is found to implement it.\n// It returns the initialized and dereferenced out value, whether\n// unmarshalling was already done by UnmarshalYAML, and if so whether\n// its types unmarshalled appropriately.\n//\n// If n holds a null value, prepare returns before doing anything.\nfunc (d *decoder) prepare(n *node, out reflect.Value) (newout reflect.Value, unmarshaled, good bool) {\n\tif n.tag == yaml_NULL_TAG || n.kind == scalarNode && n.tag == \"\" && (n.value == \"null\" || n.value == \"~\" || n.value == \"\" && n.implicit) {\n\t\treturn out, false, false\n\t}\n\tagain := true\n\tfor again {\n\t\tagain = false\n\t\tif out.Kind() == reflect.Ptr {\n\t\t\tif out.IsNil() {\n\t\t\t\tout.Set(reflect.New(out.Type().Elem()))\n\t\t\t}\n\t\t\tout = out.Elem()\n\t\t\tagain = true\n\t\t}\n\t\tif out.CanAddr() {\n\t\t\tif u, ok := out.Addr().Interface().(Unmarshaler); ok {\n\t\t\t\tgood = d.callUnmarshaler(n, u)\n\t\t\t\treturn out, true, good\n\t\t\t}\n\t\t}\n\t}\n\treturn out, false, false\n}\n\nfunc (d *decoder) unmarshal(n *node, out reflect.Value) (good bool) {\n\tswitch n.kind {\n\tcase documentNode:\n\t\treturn d.document(n, out)\n\tcase aliasNode:\n\t\treturn d.alias(n, out)\n\t}\n\tout, unmarshaled, good := d.prepare(n, out)\n\tif unmarshaled {\n\t\treturn good\n\t}\n\tswitch n.kind {\n\tcase scalarNode:\n\t\tgood = d.scalar(n, out)\n\tcase mappingNode:\n\t\tgood = d.mapping(n, out)\n\tcase sequenceNode:\n\t\tgood = d.sequence(n, out)\n\tdefault:\n\t\tpanic(\"internal error: unknown node kind: \" + strconv.Itoa(n.kind))\n\t}\n\treturn good\n}\n\nfunc (d *decoder) document(n *node, out reflect.Value) (good bool) {\n\tif len(n.children) == 1 {\n\t\td.doc = n\n\t\td.unmarshal(n.children[0], out)\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (d *decoder) alias(n *node, out reflect.Value) (good bool) {\n\tif d.aliases[n] {\n\t\t// TODO this could actually be allowed in some circumstances.\n\t\tfailf(\"anchor '%s' value contains itself\", n.value)\n\t}\n\td.aliases[n] = true\n\tgood = d.unmarshal(n.alias, out)\n\tdelete(d.aliases, n)\n\treturn good\n}\n\nvar zeroValue reflect.Value\n\nfunc resetMap(out reflect.Value) {\n\tfor _, k := range out.MapKeys() {\n\t\tout.SetMapIndex(k, zeroValue)\n\t}\n}\n\nfunc (d *decoder) scalar(n *node, out reflect.Value) bool {\n\tvar tag string\n\tvar resolved interface{}\n\tif n.tag == \"\" && !n.implicit {\n\t\ttag = yaml_STR_TAG\n\t\tresolved = n.value\n\t} else {\n\t\ttag, resolved = resolve(n.tag, n.value)\n\t\tif tag == yaml_BINARY_TAG {\n\t\t\tdata, err := base64.StdEncoding.DecodeString(resolved.(string))\n\t\t\tif err != nil {\n\t\t\t\tfailf(\"!!binary value contains invalid base64 data\")\n\t\t\t}\n\t\t\tresolved = string(data)\n\t\t}\n\t}\n\tif resolved == nil {\n\t\tif out.Kind() == reflect.Map && !out.CanAddr() {\n\t\t\tresetMap(out)\n\t\t} else {\n\t\t\tout.Set(reflect.Zero(out.Type()))\n\t\t}\n\t\treturn true\n\t}\n\tif resolvedv := reflect.ValueOf(resolved); out.Type() == resolvedv.Type() {\n\t\t// We've resolved to exactly the type we want, so use that.\n\t\tout.Set(resolvedv)\n\t\treturn true\n\t}\n\t// Perhaps we can use the value as a TextUnmarshaler to\n\t// set its value.\n\tif out.CanAddr() {\n\t\tu, ok := out.Addr().Interface().(encoding.TextUnmarshaler)\n\t\tif ok {\n\t\t\tvar text []byte\n\t\t\tif tag == yaml_BINARY_TAG {\n\t\t\t\ttext = []byte(resolved.(string))\n\t\t\t} else {\n\t\t\t\t// We let any value be unmarshaled into TextUnmarshaler.\n\t\t\t\t// That might be more lax than we'd like, but the\n\t\t\t\t// TextUnmarshaler itself should bowl out any dubious values.\n\t\t\t\ttext = []byte(n.value)\n\t\t\t}\n\t\t\terr := u.UnmarshalText(text)\n\t\t\tif err != nil {\n\t\t\t\tfail(err)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t}\n\tswitch out.Kind() {\n\tcase reflect.String:\n\t\tif tag == yaml_BINARY_TAG {\n\t\t\tout.SetString(resolved.(string))\n\t\t\treturn true\n\t\t}\n\t\tif resolved != nil {\n\t\t\tout.SetString(n.value)\n\t\t\treturn true\n\t\t}\n\tcase reflect.Interface:\n\t\tif resolved == nil {\n\t\t\tout.Set(reflect.Zero(out.Type()))\n\t\t} else if tag == yaml_TIMESTAMP_TAG {\n\t\t\t// It looks like a timestamp but for backward compatibility\n\t\t\t// reasons we set it as a string, so that code that unmarshals\n\t\t\t// timestamp-like values into interface{} will continue to\n\t\t\t// see a string and not a time.Time.\n\t\t\t// TODO(v3) Drop this.\n\t\t\tout.Set(reflect.ValueOf(n.value))\n\t\t} else {\n\t\t\tout.Set(reflect.ValueOf(resolved))\n\t\t}\n\t\treturn true\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tswitch resolved := resolved.(type) {\n\t\tcase int:\n\t\t\tif !out.OverflowInt(int64(resolved)) {\n\t\t\t\tout.SetInt(int64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase int64:\n\t\t\tif !out.OverflowInt(resolved) {\n\t\t\t\tout.SetInt(resolved)\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase uint64:\n\t\t\tif resolved <= math.MaxInt64 && !out.OverflowInt(int64(resolved)) {\n\t\t\t\tout.SetInt(int64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase float64:\n\t\t\tif resolved <= math.MaxInt64 && !out.OverflowInt(int64(resolved)) {\n\t\t\t\tout.SetInt(int64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase string:\n\t\t\tif out.Type() == durationType {\n\t\t\t\td, err := time.ParseDuration(resolved)\n\t\t\t\tif err == nil {\n\t\t\t\t\tout.SetInt(int64(d))\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\tswitch resolved := resolved.(type) {\n\t\tcase int:\n\t\t\tif resolved >= 0 && !out.OverflowUint(uint64(resolved)) {\n\t\t\t\tout.SetUint(uint64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase int64:\n\t\t\tif resolved >= 0 && !out.OverflowUint(uint64(resolved)) {\n\t\t\t\tout.SetUint(uint64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase uint64:\n\t\t\tif !out.OverflowUint(uint64(resolved)) {\n\t\t\t\tout.SetUint(uint64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\tcase float64:\n\t\t\tif resolved <= math.MaxUint64 && !out.OverflowUint(uint64(resolved)) {\n\t\t\t\tout.SetUint(uint64(resolved))\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\tcase reflect.Bool:\n\t\tswitch resolved := resolved.(type) {\n\t\tcase bool:\n\t\t\tout.SetBool(resolved)\n\t\t\treturn true\n\t\t}\n\tcase reflect.Float32, reflect.Float64:\n\t\tswitch resolved := resolved.(type) {\n\t\tcase int:\n\t\t\tout.SetFloat(float64(resolved))\n\t\t\treturn true\n\t\tcase int64:\n\t\t\tout.SetFloat(float64(resolved))\n\t\t\treturn true\n\t\tcase uint64:\n\t\t\tout.SetFloat(float64(resolved))\n\t\t\treturn true\n\t\tcase float64:\n\t\t\tout.SetFloat(resolved)\n\t\t\treturn true\n\t\t}\n\tcase reflect.Struct:\n\t\tif resolvedv := reflect.ValueOf(resolved); out.Type() == resolvedv.Type() {\n\t\t\tout.Set(resolvedv)\n\t\t\treturn true\n\t\t}\n\tcase reflect.Ptr:\n\t\tif out.Type().Elem() == reflect.TypeOf(resolved) {\n\t\t\t// TODO DOes this make sense? When is out a Ptr except when decoding a nil value?\n\t\t\telem := reflect.New(out.Type().Elem())\n\t\t\telem.Elem().Set(reflect.ValueOf(resolved))\n\t\t\tout.Set(elem)\n\t\t\treturn true\n\t\t}\n\t}\n\td.terror(n, tag, out)\n\treturn false\n}\n\nfunc settableValueOf(i interface{}) reflect.Value {\n\tv := reflect.ValueOf(i)\n\tsv := reflect.New(v.Type()).Elem()\n\tsv.Set(v)\n\treturn sv\n}\n\nfunc (d *decoder) sequence(n *node, out reflect.Value) (good bool) {\n\tl := len(n.children)\n\n\tvar iface reflect.Value\n\tswitch out.Kind() {\n\tcase reflect.Slice:\n\t\tout.Set(reflect.MakeSlice(out.Type(), l, l))\n\tcase reflect.Array:\n\t\tif l != out.Len() {\n\t\t\tfailf(\"invalid array: want %d elements but got %d\", out.Len(), l)\n\t\t}\n\tcase reflect.Interface:\n\t\t// No type hints. Will have to use a generic sequence.\n\t\tiface = out\n\t\tout = settableValueOf(make([]interface{}, l))\n\tdefault:\n\t\td.terror(n, yaml_SEQ_TAG, out)\n\t\treturn false\n\t}\n\tet := out.Type().Elem()\n\n\tj := 0\n\tfor i := 0; i < l; i++ {\n\t\te := reflect.New(et).Elem()\n\t\tif ok := d.unmarshal(n.children[i], e); ok {\n\t\t\tout.Index(j).Set(e)\n\t\t\tj++\n\t\t}\n\t}\n\tif out.Kind() != reflect.Array {\n\t\tout.Set(out.Slice(0, j))\n\t}\n\tif iface.IsValid() {\n\t\tiface.Set(out)\n\t}\n\treturn true\n}\n\nfunc (d *decoder) mapping(n *node, out reflect.Value) (good bool) {\n\tswitch out.Kind() {\n\tcase reflect.Struct:\n\t\treturn d.mappingStruct(n, out)\n\tcase reflect.Slice:\n\t\treturn d.mappingSlice(n, out)\n\tcase reflect.Map:\n\t\t// okay\n\tcase reflect.Interface:\n\t\tif d.mapType.Kind() == reflect.Map {\n\t\t\tiface := out\n\t\t\tout = reflect.MakeMap(d.mapType)\n\t\t\tiface.Set(out)\n\t\t} else {\n\t\t\tslicev := reflect.New(d.mapType).Elem()\n\t\t\tif !d.mappingSlice(n, slicev) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tout.Set(slicev)\n\t\t\treturn true\n\t\t}\n\tdefault:\n\t\td.terror(n, yaml_MAP_TAG, out)\n\t\treturn false\n\t}\n\toutt := out.Type()\n\tkt := outt.Key()\n\tet := outt.Elem()\n\n\tmapType := d.mapType\n\tif outt.Key() == ifaceType && outt.Elem() == ifaceType {\n\t\td.mapType = outt\n\t}\n\n\tif out.IsNil() {\n\t\tout.Set(reflect.MakeMap(outt))\n\t}\n\tl := len(n.children)\n\tfor i := 0; i < l; i += 2 {\n\t\tif isMerge(n.children[i]) {\n\t\t\td.merge(n.children[i+1], out)\n\t\t\tcontinue\n\t\t}\n\t\tk := reflect.New(kt).Elem()\n\t\tif d.unmarshal(n.children[i], k) {\n\t\t\tkkind := k.Kind()\n\t\t\tif kkind == reflect.Interface {\n\t\t\t\tkkind = k.Elem().Kind()\n\t\t\t}\n\t\t\tif kkind == reflect.Map || kkind == reflect.Slice {\n\t\t\t\tfailf(\"invalid map key: %#v\", k.Interface())\n\t\t\t}\n\t\t\te := reflect.New(et).Elem()\n\t\t\tif d.unmarshal(n.children[i+1], e) {\n\t\t\t\td.setMapIndex(n.children[i+1], out, k, e)\n\t\t\t}\n\t\t}\n\t}\n\td.mapType = mapType\n\treturn true\n}\n\nfunc (d *decoder) setMapIndex(n *node, out, k, v reflect.Value) {\n\tif d.strict && out.MapIndex(k) != zeroValue {\n\t\td.terrors = append(d.terrors, fmt.Sprintf(\"line %d: key %#v already set in map\", n.line+1, k.Interface()))\n\t\treturn\n\t}\n\tout.SetMapIndex(k, v)\n}\n\nfunc (d *decoder) mappingSlice(n *node, out reflect.Value) (good bool) {\n\toutt := out.Type()\n\tif outt.Elem() != mapItemType {\n\t\td.terror(n, yaml_MAP_TAG, out)\n\t\treturn false\n\t}\n\n\tmapType := d.mapType\n\td.mapType = outt\n\n\tvar slice []MapItem\n\tvar l = len(n.children)\n\tfor i := 0; i < l; i += 2 {\n\t\tif isMerge(n.children[i]) {\n\t\t\td.merge(n.children[i+1], out)\n\t\t\tcontinue\n\t\t}\n\t\titem := MapItem{}\n\t\tk := reflect.ValueOf(&item.Key).Elem()\n\t\tif d.unmarshal(n.children[i], k) {\n\t\t\tv := reflect.ValueOf(&item.Value).Elem()\n\t\t\tif d.unmarshal(n.children[i+1], v) {\n\t\t\t\tslice = append(slice, item)\n\t\t\t}\n\t\t}\n\t}\n\tout.Set(reflect.ValueOf(slice))\n\td.mapType = mapType\n\treturn true\n}\n\nfunc (d *decoder) mappingStruct(n *node, out reflect.Value) (good bool) {\n\tsinfo, err := getStructInfo(out.Type())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tname := settableValueOf(\"\")\n\tl := len(n.children)\n\n\tvar inlineMap reflect.Value\n\tvar elemType reflect.Type\n\tif sinfo.InlineMap != -1 {\n\t\tinlineMap = out.Field(sinfo.InlineMap)\n\t\tinlineMap.Set(reflect.New(inlineMap.Type()).Elem())\n\t\telemType = inlineMap.Type().Elem()\n\t}\n\n\tvar doneFields []bool\n\tif d.strict {\n\t\tdoneFields = make([]bool, len(sinfo.FieldsList))\n\t}\n\tfor i := 0; i < l; i += 2 {\n\t\tni := n.children[i]\n\t\tif isMerge(ni) {\n\t\t\td.merge(n.children[i+1], out)\n\t\t\tcontinue\n\t\t}\n\t\tif !d.unmarshal(ni, name) {\n\t\t\tcontinue\n\t\t}\n\t\tif info, ok := sinfo.FieldsMap[name.String()]; ok {\n\t\t\tif d.strict {\n\t\t\t\tif doneFields[info.Id] {\n\t\t\t\t\td.terrors = append(d.terrors, fmt.Sprintf(\"line %d: field %s already set in type %s\", ni.line+1, name.String(), out.Type()))\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tdoneFields[info.Id] = true\n\t\t\t}\n\t\t\tvar field reflect.Value\n\t\t\tif info.Inline == nil {\n\t\t\t\tfield = out.Field(info.Num)\n\t\t\t} else {\n\t\t\t\tfield = out.FieldByIndex(info.Inline)\n\t\t\t}\n\t\t\td.unmarshal(n.children[i+1], field)\n\t\t} else if sinfo.InlineMap != -1 {\n\t\t\tif inlineMap.IsNil() {\n\t\t\t\tinlineMap.Set(reflect.MakeMap(inlineMap.Type()))\n\t\t\t}\n\t\t\tvalue := reflect.New(elemType).Elem()\n\t\t\td.unmarshal(n.children[i+1], value)\n\t\t\td.setMapIndex(n.children[i+1], inlineMap, name, value)\n\t\t} else if d.strict {\n\t\t\td.terrors = append(d.terrors, fmt.Sprintf(\"line %d: field %s not found in type %s\", ni.line+1, name.String(), out.Type()))\n\t\t}\n\t}\n\treturn true\n}\n\nfunc failWantMap() {\n\tfailf(\"map merge requires map or sequence of maps as the value\")\n}\n\nfunc (d *decoder) merge(n *node, out reflect.Value) {\n\tswitch n.kind {\n\tcase mappingNode:\n\t\td.unmarshal(n, out)\n\tcase aliasNode:\n\t\tan, ok := d.doc.anchors[n.value]\n\t\tif ok && an.kind != mappingNode {\n\t\t\tfailWantMap()\n\t\t}\n\t\td.unmarshal(n, out)\n\tcase sequenceNode:\n\t\t// Step backwards as earlier nodes take precedence.\n\t\tfor i := len(n.children) - 1; i >= 0; i-- {\n\t\t\tni := n.children[i]\n\t\t\tif ni.kind == aliasNode {\n\t\t\t\tan, ok := d.doc.anchors[ni.value]\n\t\t\t\tif ok && an.kind != mappingNode {\n\t\t\t\t\tfailWantMap()\n\t\t\t\t}\n\t\t\t} else if ni.kind != mappingNode {\n\t\t\t\tfailWantMap()\n\t\t\t}\n\t\t\td.unmarshal(ni, out)\n\t\t}\n\tdefault:\n\t\tfailWantMap()\n\t}\n}\n\nfunc isMerge(n *node) bool {\n\treturn n.kind == scalarNode && n.value == \"<<\" && (n.implicit == true || n.tag == yaml_MERGE_TAG)\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/emitterc.go", "content": "package yaml\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n)\n\n// Flush the buffer if needed.\nfunc flush(emitter *yaml_emitter_t) bool {\n\tif emitter.buffer_pos+5 >= len(emitter.buffer) {\n\t\treturn yaml_emitter_flush(emitter)\n\t}\n\treturn true\n}\n\n// Put a character to the output buffer.\nfunc put(emitter *yaml_emitter_t, value byte) bool {\n\tif emitter.buffer_pos+5 >= len(emitter.buffer) && !yaml_emitter_flush(emitter) {\n\t\treturn false\n\t}\n\temitter.buffer[emitter.buffer_pos] = value\n\temitter.buffer_pos++\n\temitter.column++\n\treturn true\n}\n\n// Put a line break to the output buffer.\nfunc put_break(emitter *yaml_emitter_t) bool {\n\tif emitter.buffer_pos+5 >= len(emitter.buffer) && !yaml_emitter_flush(emitter) {\n\t\treturn false\n\t}\n\tswitch emitter.line_break {\n\tcase yaml_CR_BREAK:\n\t\temitter.buffer[emitter.buffer_pos] = '\\r'\n\t\temitter.buffer_pos += 1\n\tcase yaml_LN_BREAK:\n\t\temitter.buffer[emitter.buffer_pos] = '\\n'\n\t\temitter.buffer_pos += 1\n\tcase yaml_CRLN_BREAK:\n\t\temitter.buffer[emitter.buffer_pos+0] = '\\r'\n\t\temitter.buffer[emitter.buffer_pos+1] = '\\n'\n\t\temitter.buffer_pos += 2\n\tdefault:\n\t\tpanic(\"unknown line break setting\")\n\t}\n\temitter.column = 0\n\temitter.line++\n\treturn true\n}\n\n// Copy a character from a string into buffer.\nfunc write(emitter *yaml_emitter_t, s []byte, i *int) bool {\n\tif emitter.buffer_pos+5 >= len(emitter.buffer) && !yaml_emitter_flush(emitter) {\n\t\treturn false\n\t}\n\tp := emitter.buffer_pos\n\tw := width(s[*i])\n\tswitch w {\n\tcase 4:\n\t\temitter.buffer[p+3] = s[*i+3]\n\t\tfallthrough\n\tcase 3:\n\t\temitter.buffer[p+2] = s[*i+2]\n\t\tfallthrough\n\tcase 2:\n\t\temitter.buffer[p+1] = s[*i+1]\n\t\tfallthrough\n\tcase 1:\n\t\temitter.buffer[p+0] = s[*i+0]\n\tdefault:\n\t\tpanic(\"unknown character width\")\n\t}\n\temitter.column++\n\temitter.buffer_pos += w\n\t*i += w\n\treturn true\n}\n\n// Write a whole string into buffer.\nfunc write_all(emitter *yaml_emitter_t, s []byte) bool {\n\tfor i := 0; i < len(s); {\n\t\tif !write(emitter, s, &i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// Copy a line break character from a string into buffer.\nfunc write_break(emitter *yaml_emitter_t, s []byte, i *int) bool {\n\tif s[*i] == '\\n' {\n\t\tif !put_break(emitter) {\n\t\t\treturn false\n\t\t}\n\t\t*i++\n\t} else {\n\t\tif !write(emitter, s, i) {\n\t\t\treturn false\n\t\t}\n\t\temitter.column = 0\n\t\temitter.line++\n\t}\n\treturn true\n}\n\n// Set an emitter error and return false.\nfunc yaml_emitter_set_emitter_error(emitter *yaml_emitter_t, problem string) bool {\n\temitter.error = yaml_EMITTER_ERROR\n\temitter.problem = problem\n\treturn false\n}\n\n// Emit an event.\nfunc yaml_emitter_emit(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\temitter.events = append(emitter.events, *event)\n\tfor !yaml_emitter_need_more_events(emitter) {\n\t\tevent := &emitter.events[emitter.events_head]\n\t\tif !yaml_emitter_analyze_event(emitter, event) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_state_machine(emitter, event) {\n\t\t\treturn false\n\t\t}\n\t\tyaml_event_delete(event)\n\t\temitter.events_head++\n\t}\n\treturn true\n}\n\n// Check if we need to accumulate more events before emitting.\n//\n// We accumulate extra\n// - 1 event for DOCUMENT-START\n// - 2 events for SEQUENCE-START\n// - 3 events for MAPPING-START\n//\nfunc yaml_emitter_need_more_events(emitter *yaml_emitter_t) bool {\n\tif emitter.events_head == len(emitter.events) {\n\t\treturn true\n\t}\n\tvar accumulate int\n\tswitch emitter.events[emitter.events_head].typ {\n\tcase yaml_DOCUMENT_START_EVENT:\n\t\taccumulate = 1\n\t\tbreak\n\tcase yaml_SEQUENCE_START_EVENT:\n\t\taccumulate = 2\n\t\tbreak\n\tcase yaml_MAPPING_START_EVENT:\n\t\taccumulate = 3\n\t\tbreak\n\tdefault:\n\t\treturn false\n\t}\n\tif len(emitter.events)-emitter.events_head > accumulate {\n\t\treturn false\n\t}\n\tvar level int\n\tfor i := emitter.events_head; i < len(emitter.events); i++ {\n\t\tswitch emitter.events[i].typ {\n\t\tcase yaml_STREAM_START_EVENT, yaml_DOCUMENT_START_EVENT, yaml_SEQUENCE_START_EVENT, yaml_MAPPING_START_EVENT:\n\t\t\tlevel++\n\t\tcase yaml_STREAM_END_EVENT, yaml_DOCUMENT_END_EVENT, yaml_SEQUENCE_END_EVENT, yaml_MAPPING_END_EVENT:\n\t\t\tlevel--\n\t\t}\n\t\tif level == 0 {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// Append a directive to the directives stack.\nfunc yaml_emitter_append_tag_directive(emitter *yaml_emitter_t, value *yaml_tag_directive_t, allow_duplicates bool) bool {\n\tfor i := 0; i < len(emitter.tag_directives); i++ {\n\t\tif bytes.Equal(value.handle, emitter.tag_directives[i].handle) {\n\t\t\tif allow_duplicates {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn yaml_emitter_set_emitter_error(emitter, \"duplicate %TAG directive\")\n\t\t}\n\t}\n\n\t// [Go] Do we actually need to copy this given garbage collection\n\t// and the lack of deallocating destructors?\n\ttag_copy := yaml_tag_directive_t{\n\t\thandle: make([]byte, len(value.handle)),\n\t\tprefix: make([]byte, len(value.prefix)),\n\t}\n\tcopy(tag_copy.handle, value.handle)\n\tcopy(tag_copy.prefix, value.prefix)\n\temitter.tag_directives = append(emitter.tag_directives, tag_copy)\n\treturn true\n}\n\n// Increase the indentation level.\nfunc yaml_emitter_increase_indent(emitter *yaml_emitter_t, flow, indentless bool) bool {\n\temitter.indents = append(emitter.indents, emitter.indent)\n\tif emitter.indent < 0 {\n\t\tif flow {\n\t\t\temitter.indent = emitter.best_indent\n\t\t} else {\n\t\t\temitter.indent = 0\n\t\t}\n\t} else if !indentless {\n\t\temitter.indent += emitter.best_indent\n\t}\n\treturn true\n}\n\n// State dispatcher.\nfunc yaml_emitter_state_machine(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tswitch emitter.state {\n\tdefault:\n\tcase yaml_EMIT_STREAM_START_STATE:\n\t\treturn yaml_emitter_emit_stream_start(emitter, event)\n\n\tcase yaml_EMIT_FIRST_DOCUMENT_START_STATE:\n\t\treturn yaml_emitter_emit_document_start(emitter, event, true)\n\n\tcase yaml_EMIT_DOCUMENT_START_STATE:\n\t\treturn yaml_emitter_emit_document_start(emitter, event, false)\n\n\tcase yaml_EMIT_DOCUMENT_CONTENT_STATE:\n\t\treturn yaml_emitter_emit_document_content(emitter, event)\n\n\tcase yaml_EMIT_DOCUMENT_END_STATE:\n\t\treturn yaml_emitter_emit_document_end(emitter, event)\n\n\tcase yaml_EMIT_FLOW_SEQUENCE_FIRST_ITEM_STATE:\n\t\treturn yaml_emitter_emit_flow_sequence_item(emitter, event, true)\n\n\tcase yaml_EMIT_FLOW_SEQUENCE_ITEM_STATE:\n\t\treturn yaml_emitter_emit_flow_sequence_item(emitter, event, false)\n\n\tcase yaml_EMIT_FLOW_MAPPING_FIRST_KEY_STATE:\n\t\treturn yaml_emitter_emit_flow_mapping_key(emitter, event, true)\n\n\tcase yaml_EMIT_FLOW_MAPPING_KEY_STATE:\n\t\treturn yaml_emitter_emit_flow_mapping_key(emitter, event, false)\n\n\tcase yaml_EMIT_FLOW_MAPPING_SIMPLE_VALUE_STATE:\n\t\treturn yaml_emitter_emit_flow_mapping_value(emitter, event, true)\n\n\tcase yaml_EMIT_FLOW_MAPPING_VALUE_STATE:\n\t\treturn yaml_emitter_emit_flow_mapping_value(emitter, event, false)\n\n\tcase yaml_EMIT_BLOCK_SEQUENCE_FIRST_ITEM_STATE:\n\t\treturn yaml_emitter_emit_block_sequence_item(emitter, event, true)\n\n\tcase yaml_EMIT_BLOCK_SEQUENCE_ITEM_STATE:\n\t\treturn yaml_emitter_emit_block_sequence_item(emitter, event, false)\n\n\tcase yaml_EMIT_BLOCK_MAPPING_FIRST_KEY_STATE:\n\t\treturn yaml_emitter_emit_block_mapping_key(emitter, event, true)\n\n\tcase yaml_EMIT_BLOCK_MAPPING_KEY_STATE:\n\t\treturn yaml_emitter_emit_block_mapping_key(emitter, event, false)\n\n\tcase yaml_EMIT_BLOCK_MAPPING_SIMPLE_VALUE_STATE:\n\t\treturn yaml_emitter_emit_block_mapping_value(emitter, event, true)\n\n\tcase yaml_EMIT_BLOCK_MAPPING_VALUE_STATE:\n\t\treturn yaml_emitter_emit_block_mapping_value(emitter, event, false)\n\n\tcase yaml_EMIT_END_STATE:\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"expected nothing after STREAM-END\")\n\t}\n\tpanic(\"invalid emitter state\")\n}\n\n// Expect STREAM-START.\nfunc yaml_emitter_emit_stream_start(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif event.typ != yaml_STREAM_START_EVENT {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"expected STREAM-START\")\n\t}\n\tif emitter.encoding == yaml_ANY_ENCODING {\n\t\temitter.encoding = event.encoding\n\t\tif emitter.encoding == yaml_ANY_ENCODING {\n\t\t\temitter.encoding = yaml_UTF8_ENCODING\n\t\t}\n\t}\n\tif emitter.best_indent < 2 || emitter.best_indent > 9 {\n\t\temitter.best_indent = 2\n\t}\n\tif emitter.best_width >= 0 && emitter.best_width <= emitter.best_indent*2 {\n\t\temitter.best_width = 80\n\t}\n\tif emitter.best_width < 0 {\n\t\temitter.best_width = 1<<31 - 1\n\t}\n\tif emitter.line_break == yaml_ANY_BREAK {\n\t\temitter.line_break = yaml_LN_BREAK\n\t}\n\n\temitter.indent = -1\n\temitter.line = 0\n\temitter.column = 0\n\temitter.whitespace = true\n\temitter.indention = true\n\n\tif emitter.encoding != yaml_UTF8_ENCODING {\n\t\tif !yaml_emitter_write_bom(emitter) {\n\t\t\treturn false\n\t\t}\n\t}\n\temitter.state = yaml_EMIT_FIRST_DOCUMENT_START_STATE\n\treturn true\n}\n\n// Expect DOCUMENT-START or STREAM-END.\nfunc yaml_emitter_emit_document_start(emitter *yaml_emitter_t, event *yaml_event_t, first bool) bool {\n\n\tif event.typ == yaml_DOCUMENT_START_EVENT {\n\n\t\tif event.version_directive != nil {\n\t\t\tif !yaml_emitter_analyze_version_directive(emitter, event.version_directive) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tfor i := 0; i < len(event.tag_directives); i++ {\n\t\t\ttag_directive := &event.tag_directives[i]\n\t\t\tif !yaml_emitter_analyze_tag_directive(emitter, tag_directive) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_append_tag_directive(emitter, tag_directive, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tfor i := 0; i < len(default_tag_directives); i++ {\n\t\t\ttag_directive := &default_tag_directives[i]\n\t\t\tif !yaml_emitter_append_tag_directive(emitter, tag_directive, true) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\timplicit := event.implicit\n\t\tif !first || emitter.canonical {\n\t\t\timplicit = false\n\t\t}\n\n\t\tif emitter.open_ended && (event.version_directive != nil || len(event.tag_directives) > 0) {\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"...\"), true, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tif event.version_directive != nil {\n\t\t\timplicit = false\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"%YAML\"), true, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"1.1\"), true, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tif len(event.tag_directives) > 0 {\n\t\t\timplicit = false\n\t\t\tfor i := 0; i < len(event.tag_directives); i++ {\n\t\t\t\ttag_directive := &event.tag_directives[i]\n\t\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"%TAG\"), true, false, false) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tif !yaml_emitter_write_tag_handle(emitter, tag_directive.handle) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tif !yaml_emitter_write_tag_content(emitter, tag_directive.prefix, true) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif yaml_emitter_check_empty_document(emitter) {\n\t\t\timplicit = false\n\t\t}\n\t\tif !implicit {\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"---\"), true, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif emitter.canonical {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\temitter.state = yaml_EMIT_DOCUMENT_CONTENT_STATE\n\t\treturn true\n\t}\n\n\tif event.typ == yaml_STREAM_END_EVENT {\n\t\tif emitter.open_ended {\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"...\"), true, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif !yaml_emitter_flush(emitter) {\n\t\t\treturn false\n\t\t}\n\t\temitter.state = yaml_EMIT_END_STATE\n\t\treturn true\n\t}\n\n\treturn yaml_emitter_set_emitter_error(emitter, \"expected DOCUMENT-START or STREAM-END\")\n}\n\n// Expect the root node.\nfunc yaml_emitter_emit_document_content(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\temitter.states = append(emitter.states, yaml_EMIT_DOCUMENT_END_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, true, false, false, false)\n}\n\n// Expect DOCUMENT-END.\nfunc yaml_emitter_emit_document_end(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif event.typ != yaml_DOCUMENT_END_EVENT {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"expected DOCUMENT-END\")\n\t}\n\tif !yaml_emitter_write_indent(emitter) {\n\t\treturn false\n\t}\n\tif !event.implicit {\n\t\t// [Go] Allocate the slice elsewhere.\n\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"...\"), true, false, false) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\treturn false\n\t\t}\n\t}\n\tif !yaml_emitter_flush(emitter) {\n\t\treturn false\n\t}\n\temitter.state = yaml_EMIT_DOCUMENT_START_STATE\n\temitter.tag_directives = emitter.tag_directives[:0]\n\treturn true\n}\n\n// Expect a flow item node.\nfunc yaml_emitter_emit_flow_sequence_item(emitter *yaml_emitter_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{'['}, true, true, false) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_increase_indent(emitter, true, false) {\n\t\t\treturn false\n\t\t}\n\t\temitter.flow_level++\n\t}\n\n\tif event.typ == yaml_SEQUENCE_END_EVENT {\n\t\temitter.flow_level--\n\t\temitter.indent = emitter.indents[len(emitter.indents)-1]\n\t\temitter.indents = emitter.indents[:len(emitter.indents)-1]\n\t\tif emitter.canonical && !first {\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte{','}, false, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{']'}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t\temitter.state = emitter.states[len(emitter.states)-1]\n\t\temitter.states = emitter.states[:len(emitter.states)-1]\n\n\t\treturn true\n\t}\n\n\tif !first {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{','}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif emitter.canonical || emitter.column > emitter.best_width {\n\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\treturn false\n\t\t}\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_FLOW_SEQUENCE_ITEM_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, true, false, false)\n}\n\n// Expect a flow key node.\nfunc yaml_emitter_emit_flow_mapping_key(emitter *yaml_emitter_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{'{'}, true, true, false) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_increase_indent(emitter, true, false) {\n\t\t\treturn false\n\t\t}\n\t\temitter.flow_level++\n\t}\n\n\tif event.typ == yaml_MAPPING_END_EVENT {\n\t\temitter.flow_level--\n\t\temitter.indent = emitter.indents[len(emitter.indents)-1]\n\t\temitter.indents = emitter.indents[:len(emitter.indents)-1]\n\t\tif emitter.canonical && !first {\n\t\t\tif !yaml_emitter_write_indicator(emitter, []byte{','}, false, false, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{'}'}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t\temitter.state = emitter.states[len(emitter.states)-1]\n\t\temitter.states = emitter.states[:len(emitter.states)-1]\n\t\treturn true\n\t}\n\n\tif !first {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{','}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\tif emitter.canonical || emitter.column > emitter.best_width {\n\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif !emitter.canonical && yaml_emitter_check_simple_key(emitter) {\n\t\temitter.states = append(emitter.states, yaml_EMIT_FLOW_MAPPING_SIMPLE_VALUE_STATE)\n\t\treturn yaml_emitter_emit_node(emitter, event, false, false, true, true)\n\t}\n\tif !yaml_emitter_write_indicator(emitter, []byte{'?'}, true, false, false) {\n\t\treturn false\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_FLOW_MAPPING_VALUE_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, false, true, false)\n}\n\n// Expect a flow value node.\nfunc yaml_emitter_emit_flow_mapping_value(emitter *yaml_emitter_t, event *yaml_event_t, simple bool) bool {\n\tif simple {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{':'}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t} else {\n\t\tif emitter.canonical || emitter.column > emitter.best_width {\n\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{':'}, true, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_FLOW_MAPPING_KEY_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, false, true, false)\n}\n\n// Expect a block item node.\nfunc yaml_emitter_emit_block_sequence_item(emitter *yaml_emitter_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\tif !yaml_emitter_increase_indent(emitter, false, emitter.mapping_context && !emitter.indention) {\n\t\t\treturn false\n\t\t}\n\t}\n\tif event.typ == yaml_SEQUENCE_END_EVENT {\n\t\temitter.indent = emitter.indents[len(emitter.indents)-1]\n\t\temitter.indents = emitter.indents[:len(emitter.indents)-1]\n\t\temitter.state = emitter.states[len(emitter.states)-1]\n\t\temitter.states = emitter.states[:len(emitter.states)-1]\n\t\treturn true\n\t}\n\tif !yaml_emitter_write_indent(emitter) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_write_indicator(emitter, []byte{'-'}, true, false, true) {\n\t\treturn false\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_BLOCK_SEQUENCE_ITEM_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, true, false, false)\n}\n\n// Expect a block key node.\nfunc yaml_emitter_emit_block_mapping_key(emitter *yaml_emitter_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\tif !yaml_emitter_increase_indent(emitter, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\tif event.typ == yaml_MAPPING_END_EVENT {\n\t\temitter.indent = emitter.indents[len(emitter.indents)-1]\n\t\temitter.indents = emitter.indents[:len(emitter.indents)-1]\n\t\temitter.state = emitter.states[len(emitter.states)-1]\n\t\temitter.states = emitter.states[:len(emitter.states)-1]\n\t\treturn true\n\t}\n\tif !yaml_emitter_write_indent(emitter) {\n\t\treturn false\n\t}\n\tif yaml_emitter_check_simple_key(emitter) {\n\t\temitter.states = append(emitter.states, yaml_EMIT_BLOCK_MAPPING_SIMPLE_VALUE_STATE)\n\t\treturn yaml_emitter_emit_node(emitter, event, false, false, true, true)\n\t}\n\tif !yaml_emitter_write_indicator(emitter, []byte{'?'}, true, false, true) {\n\t\treturn false\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_BLOCK_MAPPING_VALUE_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, false, true, false)\n}\n\n// Expect a block value node.\nfunc yaml_emitter_emit_block_mapping_value(emitter *yaml_emitter_t, event *yaml_event_t, simple bool) bool {\n\tif simple {\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{':'}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t} else {\n\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{':'}, true, false, true) {\n\t\t\treturn false\n\t\t}\n\t}\n\temitter.states = append(emitter.states, yaml_EMIT_BLOCK_MAPPING_KEY_STATE)\n\treturn yaml_emitter_emit_node(emitter, event, false, false, true, false)\n}\n\n// Expect a node.\nfunc yaml_emitter_emit_node(emitter *yaml_emitter_t, event *yaml_event_t,\n\troot bool, sequence bool, mapping bool, simple_key bool) bool {\n\n\temitter.root_context = root\n\temitter.sequence_context = sequence\n\temitter.mapping_context = mapping\n\temitter.simple_key_context = simple_key\n\n\tswitch event.typ {\n\tcase yaml_ALIAS_EVENT:\n\t\treturn yaml_emitter_emit_alias(emitter, event)\n\tcase yaml_SCALAR_EVENT:\n\t\treturn yaml_emitter_emit_scalar(emitter, event)\n\tcase yaml_SEQUENCE_START_EVENT:\n\t\treturn yaml_emitter_emit_sequence_start(emitter, event)\n\tcase yaml_MAPPING_START_EVENT:\n\t\treturn yaml_emitter_emit_mapping_start(emitter, event)\n\tdefault:\n\t\treturn yaml_emitter_set_emitter_error(emitter,\n\t\t\tfmt.Sprintf(\"expected SCALAR, SEQUENCE-START, MAPPING-START, or ALIAS, but got %v\", event.typ))\n\t}\n}\n\n// Expect ALIAS.\nfunc yaml_emitter_emit_alias(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif !yaml_emitter_process_anchor(emitter) {\n\t\treturn false\n\t}\n\temitter.state = emitter.states[len(emitter.states)-1]\n\temitter.states = emitter.states[:len(emitter.states)-1]\n\treturn true\n}\n\n// Expect SCALAR.\nfunc yaml_emitter_emit_scalar(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif !yaml_emitter_select_scalar_style(emitter, event) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_process_anchor(emitter) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_process_tag(emitter) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_increase_indent(emitter, true, false) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_process_scalar(emitter) {\n\t\treturn false\n\t}\n\temitter.indent = emitter.indents[len(emitter.indents)-1]\n\temitter.indents = emitter.indents[:len(emitter.indents)-1]\n\temitter.state = emitter.states[len(emitter.states)-1]\n\temitter.states = emitter.states[:len(emitter.states)-1]\n\treturn true\n}\n\n// Expect SEQUENCE-START.\nfunc yaml_emitter_emit_sequence_start(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif !yaml_emitter_process_anchor(emitter) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_process_tag(emitter) {\n\t\treturn false\n\t}\n\tif emitter.flow_level > 0 || emitter.canonical || event.sequence_style() == yaml_FLOW_SEQUENCE_STYLE ||\n\t\tyaml_emitter_check_empty_sequence(emitter) {\n\t\temitter.state = yaml_EMIT_FLOW_SEQUENCE_FIRST_ITEM_STATE\n\t} else {\n\t\temitter.state = yaml_EMIT_BLOCK_SEQUENCE_FIRST_ITEM_STATE\n\t}\n\treturn true\n}\n\n// Expect MAPPING-START.\nfunc yaml_emitter_emit_mapping_start(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\tif !yaml_emitter_process_anchor(emitter) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_process_tag(emitter) {\n\t\treturn false\n\t}\n\tif emitter.flow_level > 0 || emitter.canonical || event.mapping_style() == yaml_FLOW_MAPPING_STYLE ||\n\t\tyaml_emitter_check_empty_mapping(emitter) {\n\t\temitter.state = yaml_EMIT_FLOW_MAPPING_FIRST_KEY_STATE\n\t} else {\n\t\temitter.state = yaml_EMIT_BLOCK_MAPPING_FIRST_KEY_STATE\n\t}\n\treturn true\n}\n\n// Check if the document content is an empty scalar.\nfunc yaml_emitter_check_empty_document(emitter *yaml_emitter_t) bool {\n\treturn false // [Go] Huh?\n}\n\n// Check if the next events represent an empty sequence.\nfunc yaml_emitter_check_empty_sequence(emitter *yaml_emitter_t) bool {\n\tif len(emitter.events)-emitter.events_head < 2 {\n\t\treturn false\n\t}\n\treturn emitter.events[emitter.events_head].typ == yaml_SEQUENCE_START_EVENT &&\n\t\temitter.events[emitter.events_head+1].typ == yaml_SEQUENCE_END_EVENT\n}\n\n// Check if the next events represent an empty mapping.\nfunc yaml_emitter_check_empty_mapping(emitter *yaml_emitter_t) bool {\n\tif len(emitter.events)-emitter.events_head < 2 {\n\t\treturn false\n\t}\n\treturn emitter.events[emitter.events_head].typ == yaml_MAPPING_START_EVENT &&\n\t\temitter.events[emitter.events_head+1].typ == yaml_MAPPING_END_EVENT\n}\n\n// Check if the next node can be expressed as a simple key.\nfunc yaml_emitter_check_simple_key(emitter *yaml_emitter_t) bool {\n\tlength := 0\n\tswitch emitter.events[emitter.events_head].typ {\n\tcase yaml_ALIAS_EVENT:\n\t\tlength += len(emitter.anchor_data.anchor)\n\tcase yaml_SCALAR_EVENT:\n\t\tif emitter.scalar_data.multiline {\n\t\t\treturn false\n\t\t}\n\t\tlength += len(emitter.anchor_data.anchor) +\n\t\t\tlen(emitter.tag_data.handle) +\n\t\t\tlen(emitter.tag_data.suffix) +\n\t\t\tlen(emitter.scalar_data.value)\n\tcase yaml_SEQUENCE_START_EVENT:\n\t\tif !yaml_emitter_check_empty_sequence(emitter) {\n\t\t\treturn false\n\t\t}\n\t\tlength += len(emitter.anchor_data.anchor) +\n\t\t\tlen(emitter.tag_data.handle) +\n\t\t\tlen(emitter.tag_data.suffix)\n\tcase yaml_MAPPING_START_EVENT:\n\t\tif !yaml_emitter_check_empty_mapping(emitter) {\n\t\t\treturn false\n\t\t}\n\t\tlength += len(emitter.anchor_data.anchor) +\n\t\t\tlen(emitter.tag_data.handle) +\n\t\t\tlen(emitter.tag_data.suffix)\n\tdefault:\n\t\treturn false\n\t}\n\treturn length <= 128\n}\n\n// Determine an acceptable scalar style.\nfunc yaml_emitter_select_scalar_style(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\n\tno_tag := len(emitter.tag_data.handle) == 0 && len(emitter.tag_data.suffix) == 0\n\tif no_tag && !event.implicit && !event.quoted_implicit {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"neither tag nor implicit flags are specified\")\n\t}\n\n\tstyle := event.scalar_style()\n\tif style == yaml_ANY_SCALAR_STYLE {\n\t\tstyle = yaml_PLAIN_SCALAR_STYLE\n\t}\n\tif emitter.canonical {\n\t\tstyle = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t}\n\tif emitter.simple_key_context && emitter.scalar_data.multiline {\n\t\tstyle = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t}\n\n\tif style == yaml_PLAIN_SCALAR_STYLE {\n\t\tif emitter.flow_level > 0 && !emitter.scalar_data.flow_plain_allowed ||\n\t\t\temitter.flow_level == 0 && !emitter.scalar_data.block_plain_allowed {\n\t\t\tstyle = yaml_SINGLE_QUOTED_SCALAR_STYLE\n\t\t}\n\t\tif len(emitter.scalar_data.value) == 0 && (emitter.flow_level > 0 || emitter.simple_key_context) {\n\t\t\tstyle = yaml_SINGLE_QUOTED_SCALAR_STYLE\n\t\t}\n\t\tif no_tag && !event.implicit {\n\t\t\tstyle = yaml_SINGLE_QUOTED_SCALAR_STYLE\n\t\t}\n\t}\n\tif style == yaml_SINGLE_QUOTED_SCALAR_STYLE {\n\t\tif !emitter.scalar_data.single_quoted_allowed {\n\t\t\tstyle = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t\t}\n\t}\n\tif style == yaml_LITERAL_SCALAR_STYLE || style == yaml_FOLDED_SCALAR_STYLE {\n\t\tif !emitter.scalar_data.block_allowed || emitter.flow_level > 0 || emitter.simple_key_context {\n\t\t\tstyle = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t\t}\n\t}\n\n\tif no_tag && !event.quoted_implicit && style != yaml_PLAIN_SCALAR_STYLE {\n\t\temitter.tag_data.handle = []byte{'!'}\n\t}\n\temitter.scalar_data.style = style\n\treturn true\n}\n\n// Write an anchor.\nfunc yaml_emitter_process_anchor(emitter *yaml_emitter_t) bool {\n\tif emitter.anchor_data.anchor == nil {\n\t\treturn true\n\t}\n\tc := []byte{'&'}\n\tif emitter.anchor_data.alias {\n\t\tc[0] = '*'\n\t}\n\tif !yaml_emitter_write_indicator(emitter, c, true, false, false) {\n\t\treturn false\n\t}\n\treturn yaml_emitter_write_anchor(emitter, emitter.anchor_data.anchor)\n}\n\n// Write a tag.\nfunc yaml_emitter_process_tag(emitter *yaml_emitter_t) bool {\n\tif len(emitter.tag_data.handle) == 0 && len(emitter.tag_data.suffix) == 0 {\n\t\treturn true\n\t}\n\tif len(emitter.tag_data.handle) > 0 {\n\t\tif !yaml_emitter_write_tag_handle(emitter, emitter.tag_data.handle) {\n\t\t\treturn false\n\t\t}\n\t\tif len(emitter.tag_data.suffix) > 0 {\n\t\t\tif !yaml_emitter_write_tag_content(emitter, emitter.tag_data.suffix, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// [Go] Allocate these slices elsewhere.\n\t\tif !yaml_emitter_write_indicator(emitter, []byte(\"!<\"), true, false, false) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_write_tag_content(emitter, emitter.tag_data.suffix, false) {\n\t\t\treturn false\n\t\t}\n\t\tif !yaml_emitter_write_indicator(emitter, []byte{'>'}, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// Write a scalar.\nfunc yaml_emitter_process_scalar(emitter *yaml_emitter_t) bool {\n\tswitch emitter.scalar_data.style {\n\tcase yaml_PLAIN_SCALAR_STYLE:\n\t\treturn yaml_emitter_write_plain_scalar(emitter, emitter.scalar_data.value, !emitter.simple_key_context)\n\n\tcase yaml_SINGLE_QUOTED_SCALAR_STYLE:\n\t\treturn yaml_emitter_write_single_quoted_scalar(emitter, emitter.scalar_data.value, !emitter.simple_key_context)\n\n\tcase yaml_DOUBLE_QUOTED_SCALAR_STYLE:\n\t\treturn yaml_emitter_write_double_quoted_scalar(emitter, emitter.scalar_data.value, !emitter.simple_key_context)\n\n\tcase yaml_LITERAL_SCALAR_STYLE:\n\t\treturn yaml_emitter_write_literal_scalar(emitter, emitter.scalar_data.value)\n\n\tcase yaml_FOLDED_SCALAR_STYLE:\n\t\treturn yaml_emitter_write_folded_scalar(emitter, emitter.scalar_data.value)\n\t}\n\tpanic(\"unknown scalar style\")\n}\n\n// Check if a %YAML directive is valid.\nfunc yaml_emitter_analyze_version_directive(emitter *yaml_emitter_t, version_directive *yaml_version_directive_t) bool {\n\tif version_directive.major != 1 || version_directive.minor != 1 {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"incompatible %YAML directive\")\n\t}\n\treturn true\n}\n\n// Check if a %TAG directive is valid.\nfunc yaml_emitter_analyze_tag_directive(emitter *yaml_emitter_t, tag_directive *yaml_tag_directive_t) bool {\n\thandle := tag_directive.handle\n\tprefix := tag_directive.prefix\n\tif len(handle) == 0 {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag handle must not be empty\")\n\t}\n\tif handle[0] != '!' {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag handle must start with '!'\")\n\t}\n\tif handle[len(handle)-1] != '!' {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag handle must end with '!'\")\n\t}\n\tfor i := 1; i < len(handle)-1; i += width(handle[i]) {\n\t\tif !is_alpha(handle, i) {\n\t\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag handle must contain alphanumerical characters only\")\n\t\t}\n\t}\n\tif len(prefix) == 0 {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag prefix must not be empty\")\n\t}\n\treturn true\n}\n\n// Check if an anchor is valid.\nfunc yaml_emitter_analyze_anchor(emitter *yaml_emitter_t, anchor []byte, alias bool) bool {\n\tif len(anchor) == 0 {\n\t\tproblem := \"anchor value must not be empty\"\n\t\tif alias {\n\t\t\tproblem = \"alias value must not be empty\"\n\t\t}\n\t\treturn yaml_emitter_set_emitter_error(emitter, problem)\n\t}\n\tfor i := 0; i < len(anchor); i += width(anchor[i]) {\n\t\tif !is_alpha(anchor, i) {\n\t\t\tproblem := \"anchor value must contain alphanumerical characters only\"\n\t\t\tif alias {\n\t\t\t\tproblem = \"alias value must contain alphanumerical characters only\"\n\t\t\t}\n\t\t\treturn yaml_emitter_set_emitter_error(emitter, problem)\n\t\t}\n\t}\n\temitter.anchor_data.anchor = anchor\n\temitter.anchor_data.alias = alias\n\treturn true\n}\n\n// Check if a tag is valid.\nfunc yaml_emitter_analyze_tag(emitter *yaml_emitter_t, tag []byte) bool {\n\tif len(tag) == 0 {\n\t\treturn yaml_emitter_set_emitter_error(emitter, \"tag value must not be empty\")\n\t}\n\tfor i := 0; i < len(emitter.tag_directives); i++ {\n\t\ttag_directive := &emitter.tag_directives[i]\n\t\tif bytes.HasPrefix(tag, tag_directive.prefix) {\n\t\t\temitter.tag_data.handle = tag_directive.handle\n\t\t\temitter.tag_data.suffix = tag[len(tag_directive.prefix):]\n\t\t\treturn true\n\t\t}\n\t}\n\temitter.tag_data.suffix = tag\n\treturn true\n}\n\n// Check if a scalar is valid.\nfunc yaml_emitter_analyze_scalar(emitter *yaml_emitter_t, value []byte) bool {\n\tvar (\n\t\tblock_indicators = false\n\t\tflow_indicators = false\n\t\tline_breaks = false\n\t\tspecial_characters = false\n\n\t\tleading_space = false\n\t\tleading_break = false\n\t\ttrailing_space = false\n\t\ttrailing_break = false\n\t\tbreak_space = false\n\t\tspace_break = false\n\n\t\tpreceded_by_whitespace = false\n\t\tfollowed_by_whitespace = false\n\t\tprevious_space = false\n\t\tprevious_break = false\n\t)\n\n\temitter.scalar_data.value = value\n\n\tif len(value) == 0 {\n\t\temitter.scalar_data.multiline = false\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t\temitter.scalar_data.block_plain_allowed = true\n\t\temitter.scalar_data.single_quoted_allowed = true\n\t\temitter.scalar_data.block_allowed = false\n\t\treturn true\n\t}\n\n\tif len(value) >= 3 && ((value[0] == '-' && value[1] == '-' && value[2] == '-') || (value[0] == '.' && value[1] == '.' && value[2] == '.')) {\n\t\tblock_indicators = true\n\t\tflow_indicators = true\n\t}\n\n\tpreceded_by_whitespace = true\n\tfor i, w := 0, 0; i < len(value); i += w {\n\t\tw = width(value[i])\n\t\tfollowed_by_whitespace = i+w >= len(value) || is_blank(value, i+w)\n\n\t\tif i == 0 {\n\t\t\tswitch value[i] {\n\t\t\tcase '#', ',', '[', ']', '{', '}', '&', '*', '!', '|', '>', '\\'', '\"', '%', '@', '`':\n\t\t\t\tflow_indicators = true\n\t\t\t\tblock_indicators = true\n\t\t\tcase '?', ':':\n\t\t\t\tflow_indicators = true\n\t\t\t\tif followed_by_whitespace {\n\t\t\t\t\tblock_indicators = true\n\t\t\t\t}\n\t\t\tcase '-':\n\t\t\t\tif followed_by_whitespace {\n\t\t\t\t\tflow_indicators = true\n\t\t\t\t\tblock_indicators = true\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tswitch value[i] {\n\t\t\tcase ',', '?', '[', ']', '{', '}':\n\t\t\t\tflow_indicators = true\n\t\t\tcase ':':\n\t\t\t\tflow_indicators = true\n\t\t\t\tif followed_by_whitespace {\n\t\t\t\t\tblock_indicators = true\n\t\t\t\t}\n\t\t\tcase '#':\n\t\t\t\tif preceded_by_whitespace {\n\t\t\t\t\tflow_indicators = true\n\t\t\t\t\tblock_indicators = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif !is_printable(value, i) || !is_ascii(value, i) && !emitter.unicode {\n\t\t\tspecial_characters = true\n\t\t}\n\t\tif is_space(value, i) {\n\t\t\tif i == 0 {\n\t\t\t\tleading_space = true\n\t\t\t}\n\t\t\tif i+width(value[i]) == len(value) {\n\t\t\t\ttrailing_space = true\n\t\t\t}\n\t\t\tif previous_break {\n\t\t\t\tbreak_space = true\n\t\t\t}\n\t\t\tprevious_space = true\n\t\t\tprevious_break = false\n\t\t} else if is_break(value, i) {\n\t\t\tline_breaks = true\n\t\t\tif i == 0 {\n\t\t\t\tleading_break = true\n\t\t\t}\n\t\t\tif i+width(value[i]) == len(value) {\n\t\t\t\ttrailing_break = true\n\t\t\t}\n\t\t\tif previous_space {\n\t\t\t\tspace_break = true\n\t\t\t}\n\t\t\tprevious_space = false\n\t\t\tprevious_break = true\n\t\t} else {\n\t\t\tprevious_space = false\n\t\t\tprevious_break = false\n\t\t}\n\n\t\t// [Go]: Why 'z'? Couldn't be the end of the string as that's the loop condition.\n\t\tpreceded_by_whitespace = is_blankz(value, i)\n\t}\n\n\temitter.scalar_data.multiline = line_breaks\n\temitter.scalar_data.flow_plain_allowed = true\n\temitter.scalar_data.block_plain_allowed = true\n\temitter.scalar_data.single_quoted_allowed = true\n\temitter.scalar_data.block_allowed = true\n\n\tif leading_space || leading_break || trailing_space || trailing_break {\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t\temitter.scalar_data.block_plain_allowed = false\n\t}\n\tif trailing_space {\n\t\temitter.scalar_data.block_allowed = false\n\t}\n\tif break_space {\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t\temitter.scalar_data.block_plain_allowed = false\n\t\temitter.scalar_data.single_quoted_allowed = false\n\t}\n\tif space_break || special_characters {\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t\temitter.scalar_data.block_plain_allowed = false\n\t\temitter.scalar_data.single_quoted_allowed = false\n\t\temitter.scalar_data.block_allowed = false\n\t}\n\tif line_breaks {\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t\temitter.scalar_data.block_plain_allowed = false\n\t}\n\tif flow_indicators {\n\t\temitter.scalar_data.flow_plain_allowed = false\n\t}\n\tif block_indicators {\n\t\temitter.scalar_data.block_plain_allowed = false\n\t}\n\treturn true\n}\n\n// Check if the event data is valid.\nfunc yaml_emitter_analyze_event(emitter *yaml_emitter_t, event *yaml_event_t) bool {\n\n\temitter.anchor_data.anchor = nil\n\temitter.tag_data.handle = nil\n\temitter.tag_data.suffix = nil\n\temitter.scalar_data.value = nil\n\n\tswitch event.typ {\n\tcase yaml_ALIAS_EVENT:\n\t\tif !yaml_emitter_analyze_anchor(emitter, event.anchor, true) {\n\t\t\treturn false\n\t\t}\n\n\tcase yaml_SCALAR_EVENT:\n\t\tif len(event.anchor) > 0 {\n\t\t\tif !yaml_emitter_analyze_anchor(emitter, event.anchor, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif len(event.tag) > 0 && (emitter.canonical || (!event.implicit && !event.quoted_implicit)) {\n\t\t\tif !yaml_emitter_analyze_tag(emitter, event.tag) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif !yaml_emitter_analyze_scalar(emitter, event.value) {\n\t\t\treturn false\n\t\t}\n\n\tcase yaml_SEQUENCE_START_EVENT:\n\t\tif len(event.anchor) > 0 {\n\t\t\tif !yaml_emitter_analyze_anchor(emitter, event.anchor, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif len(event.tag) > 0 && (emitter.canonical || !event.implicit) {\n\t\t\tif !yaml_emitter_analyze_tag(emitter, event.tag) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\tcase yaml_MAPPING_START_EVENT:\n\t\tif len(event.anchor) > 0 {\n\t\t\tif !yaml_emitter_analyze_anchor(emitter, event.anchor, false) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif len(event.tag) > 0 && (emitter.canonical || !event.implicit) {\n\t\t\tif !yaml_emitter_analyze_tag(emitter, event.tag) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\treturn true\n}\n\n// Write the BOM character.\nfunc yaml_emitter_write_bom(emitter *yaml_emitter_t) bool {\n\tif !flush(emitter) {\n\t\treturn false\n\t}\n\tpos := emitter.buffer_pos\n\temitter.buffer[pos+0] = '\\xEF'\n\temitter.buffer[pos+1] = '\\xBB'\n\temitter.buffer[pos+2] = '\\xBF'\n\temitter.buffer_pos += 3\n\treturn true\n}\n\nfunc yaml_emitter_write_indent(emitter *yaml_emitter_t) bool {\n\tindent := emitter.indent\n\tif indent < 0 {\n\t\tindent = 0\n\t}\n\tif !emitter.indention || emitter.column > indent || (emitter.column == indent && !emitter.whitespace) {\n\t\tif !put_break(emitter) {\n\t\t\treturn false\n\t\t}\n\t}\n\tfor emitter.column < indent {\n\t\tif !put(emitter, ' ') {\n\t\t\treturn false\n\t\t}\n\t}\n\temitter.whitespace = true\n\temitter.indention = true\n\treturn true\n}\n\nfunc yaml_emitter_write_indicator(emitter *yaml_emitter_t, indicator []byte, need_whitespace, is_whitespace, is_indention bool) bool {\n\tif need_whitespace && !emitter.whitespace {\n\t\tif !put(emitter, ' ') {\n\t\t\treturn false\n\t\t}\n\t}\n\tif !write_all(emitter, indicator) {\n\t\treturn false\n\t}\n\temitter.whitespace = is_whitespace\n\temitter.indention = (emitter.indention && is_indention)\n\temitter.open_ended = false\n\treturn true\n}\n\nfunc yaml_emitter_write_anchor(emitter *yaml_emitter_t, value []byte) bool {\n\tif !write_all(emitter, value) {\n\t\treturn false\n\t}\n\temitter.whitespace = false\n\temitter.indention = false\n\treturn true\n}\n\nfunc yaml_emitter_write_tag_handle(emitter *yaml_emitter_t, value []byte) bool {\n\tif !emitter.whitespace {\n\t\tif !put(emitter, ' ') {\n\t\t\treturn false\n\t\t}\n\t}\n\tif !write_all(emitter, value) {\n\t\treturn false\n\t}\n\temitter.whitespace = false\n\temitter.indention = false\n\treturn true\n}\n\nfunc yaml_emitter_write_tag_content(emitter *yaml_emitter_t, value []byte, need_whitespace bool) bool {\n\tif need_whitespace && !emitter.whitespace {\n\t\tif !put(emitter, ' ') {\n\t\t\treturn false\n\t\t}\n\t}\n\tfor i := 0; i < len(value); {\n\t\tvar must_write bool\n\t\tswitch value[i] {\n\t\tcase ';', '/', '?', ':', '@', '&', '=', '+', '$', ',', '_', '.', '~', '*', '\\'', '(', ')', '[', ']':\n\t\t\tmust_write = true\n\t\tdefault:\n\t\t\tmust_write = is_alpha(value, i)\n\t\t}\n\t\tif must_write {\n\t\t\tif !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t} else {\n\t\t\tw := width(value[i])\n\t\t\tfor k := 0; k < w; k++ {\n\t\t\t\toctet := value[i]\n\t\t\t\ti++\n\t\t\t\tif !put(emitter, '%') {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\tc := octet >> 4\n\t\t\t\tif c < 10 {\n\t\t\t\t\tc += '0'\n\t\t\t\t} else {\n\t\t\t\t\tc += 'A' - 10\n\t\t\t\t}\n\t\t\t\tif !put(emitter, c) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\tc = octet & 0x0f\n\t\t\t\tif c < 10 {\n\t\t\t\t\tc += '0'\n\t\t\t\t} else {\n\t\t\t\t\tc += 'A' - 10\n\t\t\t\t}\n\t\t\t\tif !put(emitter, c) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\temitter.whitespace = false\n\temitter.indention = false\n\treturn true\n}\n\nfunc yaml_emitter_write_plain_scalar(emitter *yaml_emitter_t, value []byte, allow_breaks bool) bool {\n\tif !emitter.whitespace {\n\t\tif !put(emitter, ' ') {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tspaces := false\n\tbreaks := false\n\tfor i := 0; i < len(value); {\n\t\tif is_space(value, i) {\n\t\t\tif allow_breaks && !spaces && emitter.column > emitter.best_width && !is_space(value, i+1) {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\ti += width(value[i])\n\t\t\t} else {\n\t\t\t\tif !write(emitter, value, &i) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tspaces = true\n\t\t} else if is_break(value, i) {\n\t\t\tif !breaks && value[i] == '\\n' {\n\t\t\t\tif !put_break(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write_break(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = true\n\t\t\tbreaks = true\n\t\t} else {\n\t\t\tif breaks {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = false\n\t\t\tspaces = false\n\t\t\tbreaks = false\n\t\t}\n\t}\n\n\temitter.whitespace = false\n\temitter.indention = false\n\tif emitter.root_context {\n\t\temitter.open_ended = true\n\t}\n\n\treturn true\n}\n\nfunc yaml_emitter_write_single_quoted_scalar(emitter *yaml_emitter_t, value []byte, allow_breaks bool) bool {\n\n\tif !yaml_emitter_write_indicator(emitter, []byte{'\\''}, true, false, false) {\n\t\treturn false\n\t}\n\n\tspaces := false\n\tbreaks := false\n\tfor i := 0; i < len(value); {\n\t\tif is_space(value, i) {\n\t\t\tif allow_breaks && !spaces && emitter.column > emitter.best_width && i > 0 && i < len(value)-1 && !is_space(value, i+1) {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\ti += width(value[i])\n\t\t\t} else {\n\t\t\t\tif !write(emitter, value, &i) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tspaces = true\n\t\t} else if is_break(value, i) {\n\t\t\tif !breaks && value[i] == '\\n' {\n\t\t\t\tif !put_break(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write_break(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = true\n\t\t\tbreaks = true\n\t\t} else {\n\t\t\tif breaks {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif value[i] == '\\'' {\n\t\t\t\tif !put(emitter, '\\'') {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = false\n\t\t\tspaces = false\n\t\t\tbreaks = false\n\t\t}\n\t}\n\tif !yaml_emitter_write_indicator(emitter, []byte{'\\''}, false, false, false) {\n\t\treturn false\n\t}\n\temitter.whitespace = false\n\temitter.indention = false\n\treturn true\n}\n\nfunc yaml_emitter_write_double_quoted_scalar(emitter *yaml_emitter_t, value []byte, allow_breaks bool) bool {\n\tspaces := false\n\tif !yaml_emitter_write_indicator(emitter, []byte{'\"'}, true, false, false) {\n\t\treturn false\n\t}\n\n\tfor i := 0; i < len(value); {\n\t\tif !is_printable(value, i) || (!emitter.unicode && !is_ascii(value, i)) ||\n\t\t\tis_bom(value, i) || is_break(value, i) ||\n\t\t\tvalue[i] == '\"' || value[i] == '\\\\' {\n\n\t\t\toctet := value[i]\n\n\t\t\tvar w int\n\t\t\tvar v rune\n\t\t\tswitch {\n\t\t\tcase octet&0x80 == 0x00:\n\t\t\t\tw, v = 1, rune(octet&0x7F)\n\t\t\tcase octet&0xE0 == 0xC0:\n\t\t\t\tw, v = 2, rune(octet&0x1F)\n\t\t\tcase octet&0xF0 == 0xE0:\n\t\t\t\tw, v = 3, rune(octet&0x0F)\n\t\t\tcase octet&0xF8 == 0xF0:\n\t\t\t\tw, v = 4, rune(octet&0x07)\n\t\t\t}\n\t\t\tfor k := 1; k < w; k++ {\n\t\t\t\toctet = value[i+k]\n\t\t\t\tv = (v << 6) + (rune(octet) & 0x3F)\n\t\t\t}\n\t\t\ti += w\n\n\t\t\tif !put(emitter, '\\\\') {\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tvar ok bool\n\t\t\tswitch v {\n\t\t\tcase 0x00:\n\t\t\t\tok = put(emitter, '0')\n\t\t\tcase 0x07:\n\t\t\t\tok = put(emitter, 'a')\n\t\t\tcase 0x08:\n\t\t\t\tok = put(emitter, 'b')\n\t\t\tcase 0x09:\n\t\t\t\tok = put(emitter, 't')\n\t\t\tcase 0x0A:\n\t\t\t\tok = put(emitter, 'n')\n\t\t\tcase 0x0b:\n\t\t\t\tok = put(emitter, 'v')\n\t\t\tcase 0x0c:\n\t\t\t\tok = put(emitter, 'f')\n\t\t\tcase 0x0d:\n\t\t\t\tok = put(emitter, 'r')\n\t\t\tcase 0x1b:\n\t\t\t\tok = put(emitter, 'e')\n\t\t\tcase 0x22:\n\t\t\t\tok = put(emitter, '\"')\n\t\t\tcase 0x5c:\n\t\t\t\tok = put(emitter, '\\\\')\n\t\t\tcase 0x85:\n\t\t\t\tok = put(emitter, 'N')\n\t\t\tcase 0xA0:\n\t\t\t\tok = put(emitter, '_')\n\t\t\tcase 0x2028:\n\t\t\t\tok = put(emitter, 'L')\n\t\t\tcase 0x2029:\n\t\t\t\tok = put(emitter, 'P')\n\t\t\tdefault:\n\t\t\t\tif v <= 0xFF {\n\t\t\t\t\tok = put(emitter, 'x')\n\t\t\t\t\tw = 2\n\t\t\t\t} else if v <= 0xFFFF {\n\t\t\t\t\tok = put(emitter, 'u')\n\t\t\t\t\tw = 4\n\t\t\t\t} else {\n\t\t\t\t\tok = put(emitter, 'U')\n\t\t\t\t\tw = 8\n\t\t\t\t}\n\t\t\t\tfor k := (w - 1) * 4; ok && k >= 0; k -= 4 {\n\t\t\t\t\tdigit := byte((v >> uint(k)) & 0x0F)\n\t\t\t\t\tif digit < 10 {\n\t\t\t\t\t\tok = put(emitter, digit+'0')\n\t\t\t\t\t} else {\n\t\t\t\t\t\tok = put(emitter, digit+'A'-10)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !ok {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tspaces = false\n\t\t} else if is_space(value, i) {\n\t\t\tif allow_breaks && !spaces && emitter.column > emitter.best_width && i > 0 && i < len(value)-1 {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tif is_space(value, i+1) {\n\t\t\t\t\tif !put(emitter, '\\\\') {\n\t\t\t\t\t\treturn false\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ti += width(value[i])\n\t\t\t} else if !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tspaces = true\n\t\t} else {\n\t\t\tif !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tspaces = false\n\t\t}\n\t}\n\tif !yaml_emitter_write_indicator(emitter, []byte{'\"'}, false, false, false) {\n\t\treturn false\n\t}\n\temitter.whitespace = false\n\temitter.indention = false\n\treturn true\n}\n\nfunc yaml_emitter_write_block_scalar_hints(emitter *yaml_emitter_t, value []byte) bool {\n\tif is_space(value, 0) || is_break(value, 0) {\n\t\tindent_hint := []byte{'0' + byte(emitter.best_indent)}\n\t\tif !yaml_emitter_write_indicator(emitter, indent_hint, false, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\temitter.open_ended = false\n\n\tvar chomp_hint [1]byte\n\tif len(value) == 0 {\n\t\tchomp_hint[0] = '-'\n\t} else {\n\t\ti := len(value) - 1\n\t\tfor value[i]&0xC0 == 0x80 {\n\t\t\ti--\n\t\t}\n\t\tif !is_break(value, i) {\n\t\t\tchomp_hint[0] = '-'\n\t\t} else if i == 0 {\n\t\t\tchomp_hint[0] = '+'\n\t\t\temitter.open_ended = true\n\t\t} else {\n\t\t\ti--\n\t\t\tfor value[i]&0xC0 == 0x80 {\n\t\t\t\ti--\n\t\t\t}\n\t\t\tif is_break(value, i) {\n\t\t\t\tchomp_hint[0] = '+'\n\t\t\t\temitter.open_ended = true\n\t\t\t}\n\t\t}\n\t}\n\tif chomp_hint[0] != 0 {\n\t\tif !yaml_emitter_write_indicator(emitter, chomp_hint[:], false, false, false) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfunc yaml_emitter_write_literal_scalar(emitter *yaml_emitter_t, value []byte) bool {\n\tif !yaml_emitter_write_indicator(emitter, []byte{'|'}, true, false, false) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_write_block_scalar_hints(emitter, value) {\n\t\treturn false\n\t}\n\tif !put_break(emitter) {\n\t\treturn false\n\t}\n\temitter.indention = true\n\temitter.whitespace = true\n\tbreaks := true\n\tfor i := 0; i < len(value); {\n\t\tif is_break(value, i) {\n\t\t\tif !write_break(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = true\n\t\t\tbreaks = true\n\t\t} else {\n\t\t\tif breaks {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = false\n\t\t\tbreaks = false\n\t\t}\n\t}\n\n\treturn true\n}\n\nfunc yaml_emitter_write_folded_scalar(emitter *yaml_emitter_t, value []byte) bool {\n\tif !yaml_emitter_write_indicator(emitter, []byte{'>'}, true, false, false) {\n\t\treturn false\n\t}\n\tif !yaml_emitter_write_block_scalar_hints(emitter, value) {\n\t\treturn false\n\t}\n\n\tif !put_break(emitter) {\n\t\treturn false\n\t}\n\temitter.indention = true\n\temitter.whitespace = true\n\n\tbreaks := true\n\tleading_spaces := true\n\tfor i := 0; i < len(value); {\n\t\tif is_break(value, i) {\n\t\t\tif !breaks && !leading_spaces && value[i] == '\\n' {\n\t\t\t\tk := 0\n\t\t\t\tfor is_break(value, k) {\n\t\t\t\t\tk += width(value[k])\n\t\t\t\t}\n\t\t\t\tif !is_blankz(value, k) {\n\t\t\t\t\tif !put_break(emitter) {\n\t\t\t\t\t\treturn false\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !write_break(emitter, value, &i) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\temitter.indention = true\n\t\t\tbreaks = true\n\t\t} else {\n\t\t\tif breaks {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tleading_spaces = is_blank(value, i)\n\t\t\t}\n\t\t\tif !breaks && is_space(value, i) && !is_space(value, i+1) && emitter.column > emitter.best_width {\n\t\t\t\tif !yaml_emitter_write_indent(emitter) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\ti += width(value[i])\n\t\t\t} else {\n\t\t\t\tif !write(emitter, value, &i) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\temitter.indention = false\n\t\t\tbreaks = false\n\t\t}\n\t}\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/encode.go", "content": "package yaml\n\nimport (\n\t\"encoding\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n\t\"unicode/utf8\"\n)\n\n// jsonNumber is the interface of the encoding/json.Number datatype.\n// Repeating the interface here avoids a dependency on encoding/json, and also\n// supports other libraries like jsoniter, which use a similar datatype with\n// the same interface. Detecting this interface is useful when dealing with\n// structures containing json.Number, which is a string under the hood. The\n// encoder should prefer the use of Int64(), Float64() and string(), in that\n// order, when encoding this type.\ntype jsonNumber interface {\n\tFloat64() (float64, error)\n\tInt64() (int64, error)\n\tString() string\n}\n\ntype encoder struct {\n\temitter yaml_emitter_t\n\tevent yaml_event_t\n\tout []byte\n\tflow bool\n\t// doneInit holds whether the initial stream_start_event has been\n\t// emitted.\n\tdoneInit bool\n}\n\nfunc newEncoder() *encoder {\n\te := &encoder{}\n\tyaml_emitter_initialize(&e.emitter)\n\tyaml_emitter_set_output_string(&e.emitter, &e.out)\n\tyaml_emitter_set_unicode(&e.emitter, true)\n\treturn e\n}\n\nfunc newEncoderWithWriter(w io.Writer) *encoder {\n\te := &encoder{}\n\tyaml_emitter_initialize(&e.emitter)\n\tyaml_emitter_set_output_writer(&e.emitter, w)\n\tyaml_emitter_set_unicode(&e.emitter, true)\n\treturn e\n}\n\nfunc (e *encoder) init() {\n\tif e.doneInit {\n\t\treturn\n\t}\n\tyaml_stream_start_event_initialize(&e.event, yaml_UTF8_ENCODING)\n\te.emit()\n\te.doneInit = true\n}\n\nfunc (e *encoder) finish() {\n\te.emitter.open_ended = false\n\tyaml_stream_end_event_initialize(&e.event)\n\te.emit()\n}\n\nfunc (e *encoder) destroy() {\n\tyaml_emitter_delete(&e.emitter)\n}\n\nfunc (e *encoder) emit() {\n\t// This will internally delete the e.event value.\n\te.must(yaml_emitter_emit(&e.emitter, &e.event))\n}\n\nfunc (e *encoder) must(ok bool) {\n\tif !ok {\n\t\tmsg := e.emitter.problem\n\t\tif msg == \"\" {\n\t\t\tmsg = \"unknown problem generating YAML content\"\n\t\t}\n\t\tfailf(\"%s\", msg)\n\t}\n}\n\nfunc (e *encoder) marshalDoc(tag string, in reflect.Value) {\n\te.init()\n\tyaml_document_start_event_initialize(&e.event, nil, nil, true)\n\te.emit()\n\te.marshal(tag, in)\n\tyaml_document_end_event_initialize(&e.event, true)\n\te.emit()\n}\n\nfunc (e *encoder) marshal(tag string, in reflect.Value) {\n\tif !in.IsValid() || in.Kind() == reflect.Ptr && in.IsNil() {\n\t\te.nilv()\n\t\treturn\n\t}\n\tiface := in.Interface()\n\tswitch m := iface.(type) {\n\tcase jsonNumber:\n\t\tinteger, err := m.Int64()\n\t\tif err == nil {\n\t\t\t// In this case the json.Number is a valid int64\n\t\t\tin = reflect.ValueOf(integer)\n\t\t\tbreak\n\t\t}\n\t\tfloat, err := m.Float64()\n\t\tif err == nil {\n\t\t\t// In this case the json.Number is a valid float64\n\t\t\tin = reflect.ValueOf(float)\n\t\t\tbreak\n\t\t}\n\t\t// fallback case - no number could be obtained\n\t\tin = reflect.ValueOf(m.String())\n\tcase time.Time, *time.Time:\n\t\t// Although time.Time implements TextMarshaler,\n\t\t// we don't want to treat it as a string for YAML\n\t\t// purposes because YAML has special support for\n\t\t// timestamps.\n\tcase Marshaler:\n\t\tv, err := m.MarshalYAML()\n\t\tif err != nil {\n\t\t\tfail(err)\n\t\t}\n\t\tif v == nil {\n\t\t\te.nilv()\n\t\t\treturn\n\t\t}\n\t\tin = reflect.ValueOf(v)\n\tcase encoding.TextMarshaler:\n\t\ttext, err := m.MarshalText()\n\t\tif err != nil {\n\t\t\tfail(err)\n\t\t}\n\t\tin = reflect.ValueOf(string(text))\n\tcase nil:\n\t\te.nilv()\n\t\treturn\n\t}\n\tswitch in.Kind() {\n\tcase reflect.Interface:\n\t\te.marshal(tag, in.Elem())\n\tcase reflect.Map:\n\t\te.mapv(tag, in)\n\tcase reflect.Ptr:\n\t\tif in.Type() == ptrTimeType {\n\t\t\te.timev(tag, in.Elem())\n\t\t} else {\n\t\t\te.marshal(tag, in.Elem())\n\t\t}\n\tcase reflect.Struct:\n\t\tif in.Type() == timeType {\n\t\t\te.timev(tag, in)\n\t\t} else {\n\t\t\te.structv(tag, in)\n\t\t}\n\tcase reflect.Slice, reflect.Array:\n\t\tif in.Type().Elem() == mapItemType {\n\t\t\te.itemsv(tag, in)\n\t\t} else {\n\t\t\te.slicev(tag, in)\n\t\t}\n\tcase reflect.String:\n\t\te.stringv(tag, in)\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\tif in.Type() == durationType {\n\t\t\te.stringv(tag, reflect.ValueOf(iface.(time.Duration).String()))\n\t\t} else {\n\t\t\te.intv(tag, in)\n\t\t}\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\te.uintv(tag, in)\n\tcase reflect.Float32, reflect.Float64:\n\t\te.floatv(tag, in)\n\tcase reflect.Bool:\n\t\te.boolv(tag, in)\n\tdefault:\n\t\tpanic(\"cannot marshal type: \" + in.Type().String())\n\t}\n}\n\nfunc (e *encoder) mapv(tag string, in reflect.Value) {\n\te.mappingv(tag, func() {\n\t\tkeys := keyList(in.MapKeys())\n\t\tsort.Sort(keys)\n\t\tfor _, k := range keys {\n\t\t\te.marshal(\"\", k)\n\t\t\te.marshal(\"\", in.MapIndex(k))\n\t\t}\n\t})\n}\n\nfunc (e *encoder) itemsv(tag string, in reflect.Value) {\n\te.mappingv(tag, func() {\n\t\tslice := in.Convert(reflect.TypeOf([]MapItem{})).Interface().([]MapItem)\n\t\tfor _, item := range slice {\n\t\t\te.marshal(\"\", reflect.ValueOf(item.Key))\n\t\t\te.marshal(\"\", reflect.ValueOf(item.Value))\n\t\t}\n\t})\n}\n\nfunc (e *encoder) structv(tag string, in reflect.Value) {\n\tsinfo, err := getStructInfo(in.Type())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\te.mappingv(tag, func() {\n\t\tfor _, info := range sinfo.FieldsList {\n\t\t\tvar value reflect.Value\n\t\t\tif info.Inline == nil {\n\t\t\t\tvalue = in.Field(info.Num)\n\t\t\t} else {\n\t\t\t\tvalue = in.FieldByIndex(info.Inline)\n\t\t\t}\n\t\t\tif info.OmitEmpty && isZero(value) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\te.marshal(\"\", reflect.ValueOf(info.Key))\n\t\t\te.flow = info.Flow\n\t\t\te.marshal(\"\", value)\n\t\t}\n\t\tif sinfo.InlineMap >= 0 {\n\t\t\tm := in.Field(sinfo.InlineMap)\n\t\t\tif m.Len() > 0 {\n\t\t\t\te.flow = false\n\t\t\t\tkeys := keyList(m.MapKeys())\n\t\t\t\tsort.Sort(keys)\n\t\t\t\tfor _, k := range keys {\n\t\t\t\t\tif _, found := sinfo.FieldsMap[k.String()]; found {\n\t\t\t\t\t\tpanic(fmt.Sprintf(\"Can't have key %q in inlined map; conflicts with struct field\", k.String()))\n\t\t\t\t\t}\n\t\t\t\t\te.marshal(\"\", k)\n\t\t\t\t\te.flow = false\n\t\t\t\t\te.marshal(\"\", m.MapIndex(k))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t})\n}\n\nfunc (e *encoder) mappingv(tag string, f func()) {\n\timplicit := tag == \"\"\n\tstyle := yaml_BLOCK_MAPPING_STYLE\n\tif e.flow {\n\t\te.flow = false\n\t\tstyle = yaml_FLOW_MAPPING_STYLE\n\t}\n\tyaml_mapping_start_event_initialize(&e.event, nil, []byte(tag), implicit, style)\n\te.emit()\n\tf()\n\tyaml_mapping_end_event_initialize(&e.event)\n\te.emit()\n}\n\nfunc (e *encoder) slicev(tag string, in reflect.Value) {\n\timplicit := tag == \"\"\n\tstyle := yaml_BLOCK_SEQUENCE_STYLE\n\tif e.flow {\n\t\te.flow = false\n\t\tstyle = yaml_FLOW_SEQUENCE_STYLE\n\t}\n\te.must(yaml_sequence_start_event_initialize(&e.event, nil, []byte(tag), implicit, style))\n\te.emit()\n\tn := in.Len()\n\tfor i := 0; i < n; i++ {\n\t\te.marshal(\"\", in.Index(i))\n\t}\n\te.must(yaml_sequence_end_event_initialize(&e.event))\n\te.emit()\n}\n\n// isBase60 returns whether s is in base 60 notation as defined in YAML 1.1.\n//\n// The base 60 float notation in YAML 1.1 is a terrible idea and is unsupported\n// in YAML 1.2 and by this package, but these should be marshalled quoted for\n// the time being for compatibility with other parsers.\nfunc isBase60Float(s string) (result bool) {\n\t// Fast path.\n\tif s == \"\" {\n\t\treturn false\n\t}\n\tc := s[0]\n\tif !(c == '+' || c == '-' || c >= '0' && c <= '9') || strings.IndexByte(s, ':') < 0 {\n\t\treturn false\n\t}\n\t// Do the full match.\n\treturn base60float.MatchString(s)\n}\n\n// From http://yaml.org/type/float.html, except the regular expression there\n// is bogus. In practice parsers do not enforce the \"\\.[0-9_]*\" suffix.\nvar base60float = regexp.MustCompile(`^[-+]?[0-9][0-9_]*(?::[0-5]?[0-9])+(?:\\.[0-9_]*)?$`)\n\nfunc (e *encoder) stringv(tag string, in reflect.Value) {\n\tvar style yaml_scalar_style_t\n\ts := in.String()\n\tcanUsePlain := true\n\tswitch {\n\tcase !utf8.ValidString(s):\n\t\tif tag == yaml_BINARY_TAG {\n\t\t\tfailf(\"explicitly tagged !!binary data must be base64-encoded\")\n\t\t}\n\t\tif tag != \"\" {\n\t\t\tfailf(\"cannot marshal invalid UTF-8 data as %s\", shortTag(tag))\n\t\t}\n\t\t// It can't be encoded directly as YAML so use a binary tag\n\t\t// and encode it as base64.\n\t\ttag = yaml_BINARY_TAG\n\t\ts = encodeBase64(s)\n\tcase tag == \"\":\n\t\t// Check to see if it would resolve to a specific\n\t\t// tag when encoded unquoted. If it doesn't,\n\t\t// there's no need to quote it.\n\t\trtag, _ := resolve(\"\", s)\n\t\tcanUsePlain = rtag == yaml_STR_TAG && !isBase60Float(s)\n\t}\n\t// Note: it's possible for user code to emit invalid YAML\n\t// if they explicitly specify a tag and a string containing\n\t// text that's incompatible with that tag.\n\tswitch {\n\tcase strings.Contains(s, \"\\n\"):\n\t\tstyle = yaml_LITERAL_SCALAR_STYLE\n\tcase canUsePlain:\n\t\tstyle = yaml_PLAIN_SCALAR_STYLE\n\tdefault:\n\t\tstyle = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t}\n\te.emitScalar(s, \"\", tag, style)\n}\n\nfunc (e *encoder) boolv(tag string, in reflect.Value) {\n\tvar s string\n\tif in.Bool() {\n\t\ts = \"true\"\n\t} else {\n\t\ts = \"false\"\n\t}\n\te.emitScalar(s, \"\", tag, yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) intv(tag string, in reflect.Value) {\n\ts := strconv.FormatInt(in.Int(), 10)\n\te.emitScalar(s, \"\", tag, yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) uintv(tag string, in reflect.Value) {\n\ts := strconv.FormatUint(in.Uint(), 10)\n\te.emitScalar(s, \"\", tag, yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) timev(tag string, in reflect.Value) {\n\tt := in.Interface().(time.Time)\n\ts := t.Format(time.RFC3339Nano)\n\te.emitScalar(s, \"\", tag, yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) floatv(tag string, in reflect.Value) {\n\t// Issue #352: When formatting, use the precision of the underlying value\n\tprecision := 64\n\tif in.Kind() == reflect.Float32 {\n\t\tprecision = 32\n\t}\n\n\ts := strconv.FormatFloat(in.Float(), 'g', -1, precision)\n\tswitch s {\n\tcase \"+Inf\":\n\t\ts = \".inf\"\n\tcase \"-Inf\":\n\t\ts = \"-.inf\"\n\tcase \"NaN\":\n\t\ts = \".nan\"\n\t}\n\te.emitScalar(s, \"\", tag, yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) nilv() {\n\te.emitScalar(\"null\", \"\", \"\", yaml_PLAIN_SCALAR_STYLE)\n}\n\nfunc (e *encoder) emitScalar(value, anchor, tag string, style yaml_scalar_style_t) {\n\timplicit := tag == \"\"\n\te.must(yaml_scalar_event_initialize(&e.event, []byte(anchor), []byte(tag), []byte(value), implicit, implicit, style))\n\te.emit()\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/go.mod", "content": "module \"gopkg.in/yaml.v2\"\n\nrequire (\n\t\"gopkg.in/check.v1\" v0.0.0-20161208181325-20d25e280405\n)\n" }, { "path": "vendor/gopkg.in/yaml.v2/parserc.go", "content": "package yaml\n\nimport (\n\t\"bytes\"\n)\n\n// The parser implements the following grammar:\n//\n// stream ::= STREAM-START implicit_document? explicit_document* STREAM-END\n// implicit_document ::= block_node DOCUMENT-END*\n// explicit_document ::= DIRECTIVE* DOCUMENT-START block_node? DOCUMENT-END*\n// block_node_or_indentless_sequence ::=\n// ALIAS\n// | properties (block_content | indentless_block_sequence)?\n// | block_content\n// | indentless_block_sequence\n// block_node ::= ALIAS\n// | properties block_content?\n// | block_content\n// flow_node ::= ALIAS\n// | properties flow_content?\n// | flow_content\n// properties ::= TAG ANCHOR? | ANCHOR TAG?\n// block_content ::= block_collection | flow_collection | SCALAR\n// flow_content ::= flow_collection | SCALAR\n// block_collection ::= block_sequence | block_mapping\n// flow_collection ::= flow_sequence | flow_mapping\n// block_sequence ::= BLOCK-SEQUENCE-START (BLOCK-ENTRY block_node?)* BLOCK-END\n// indentless_sequence ::= (BLOCK-ENTRY block_node?)+\n// block_mapping ::= BLOCK-MAPPING_START\n// ((KEY block_node_or_indentless_sequence?)?\n// (VALUE block_node_or_indentless_sequence?)?)*\n// BLOCK-END\n// flow_sequence ::= FLOW-SEQUENCE-START\n// (flow_sequence_entry FLOW-ENTRY)*\n// flow_sequence_entry?\n// FLOW-SEQUENCE-END\n// flow_sequence_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// flow_mapping ::= FLOW-MAPPING-START\n// (flow_mapping_entry FLOW-ENTRY)*\n// flow_mapping_entry?\n// FLOW-MAPPING-END\n// flow_mapping_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n\n// Peek the next token in the token queue.\nfunc peek_token(parser *yaml_parser_t) *yaml_token_t {\n\tif parser.token_available || yaml_parser_fetch_more_tokens(parser) {\n\t\treturn &parser.tokens[parser.tokens_head]\n\t}\n\treturn nil\n}\n\n// Remove the next token from the queue (must be called after peek_token).\nfunc skip_token(parser *yaml_parser_t) {\n\tparser.token_available = false\n\tparser.tokens_parsed++\n\tparser.stream_end_produced = parser.tokens[parser.tokens_head].typ == yaml_STREAM_END_TOKEN\n\tparser.tokens_head++\n}\n\n// Get the next event.\nfunc yaml_parser_parse(parser *yaml_parser_t, event *yaml_event_t) bool {\n\t// Erase the event object.\n\t*event = yaml_event_t{}\n\n\t// No events after the end of the stream or error.\n\tif parser.stream_end_produced || parser.error != yaml_NO_ERROR || parser.state == yaml_PARSE_END_STATE {\n\t\treturn true\n\t}\n\n\t// Generate the next event.\n\treturn yaml_parser_state_machine(parser, event)\n}\n\n// Set parser error.\nfunc yaml_parser_set_parser_error(parser *yaml_parser_t, problem string, problem_mark yaml_mark_t) bool {\n\tparser.error = yaml_PARSER_ERROR\n\tparser.problem = problem\n\tparser.problem_mark = problem_mark\n\treturn false\n}\n\nfunc yaml_parser_set_parser_error_context(parser *yaml_parser_t, context string, context_mark yaml_mark_t, problem string, problem_mark yaml_mark_t) bool {\n\tparser.error = yaml_PARSER_ERROR\n\tparser.context = context\n\tparser.context_mark = context_mark\n\tparser.problem = problem\n\tparser.problem_mark = problem_mark\n\treturn false\n}\n\n// State dispatcher.\nfunc yaml_parser_state_machine(parser *yaml_parser_t, event *yaml_event_t) bool {\n\t//trace(\"yaml_parser_state_machine\", \"state:\", parser.state.String())\n\n\tswitch parser.state {\n\tcase yaml_PARSE_STREAM_START_STATE:\n\t\treturn yaml_parser_parse_stream_start(parser, event)\n\n\tcase yaml_PARSE_IMPLICIT_DOCUMENT_START_STATE:\n\t\treturn yaml_parser_parse_document_start(parser, event, true)\n\n\tcase yaml_PARSE_DOCUMENT_START_STATE:\n\t\treturn yaml_parser_parse_document_start(parser, event, false)\n\n\tcase yaml_PARSE_DOCUMENT_CONTENT_STATE:\n\t\treturn yaml_parser_parse_document_content(parser, event)\n\n\tcase yaml_PARSE_DOCUMENT_END_STATE:\n\t\treturn yaml_parser_parse_document_end(parser, event)\n\n\tcase yaml_PARSE_BLOCK_NODE_STATE:\n\t\treturn yaml_parser_parse_node(parser, event, true, false)\n\n\tcase yaml_PARSE_BLOCK_NODE_OR_INDENTLESS_SEQUENCE_STATE:\n\t\treturn yaml_parser_parse_node(parser, event, true, true)\n\n\tcase yaml_PARSE_FLOW_NODE_STATE:\n\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\n\tcase yaml_PARSE_BLOCK_SEQUENCE_FIRST_ENTRY_STATE:\n\t\treturn yaml_parser_parse_block_sequence_entry(parser, event, true)\n\n\tcase yaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE:\n\t\treturn yaml_parser_parse_block_sequence_entry(parser, event, false)\n\n\tcase yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE:\n\t\treturn yaml_parser_parse_indentless_sequence_entry(parser, event)\n\n\tcase yaml_PARSE_BLOCK_MAPPING_FIRST_KEY_STATE:\n\t\treturn yaml_parser_parse_block_mapping_key(parser, event, true)\n\n\tcase yaml_PARSE_BLOCK_MAPPING_KEY_STATE:\n\t\treturn yaml_parser_parse_block_mapping_key(parser, event, false)\n\n\tcase yaml_PARSE_BLOCK_MAPPING_VALUE_STATE:\n\t\treturn yaml_parser_parse_block_mapping_value(parser, event)\n\n\tcase yaml_PARSE_FLOW_SEQUENCE_FIRST_ENTRY_STATE:\n\t\treturn yaml_parser_parse_flow_sequence_entry(parser, event, true)\n\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE:\n\t\treturn yaml_parser_parse_flow_sequence_entry(parser, event, false)\n\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_KEY_STATE:\n\t\treturn yaml_parser_parse_flow_sequence_entry_mapping_key(parser, event)\n\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE:\n\t\treturn yaml_parser_parse_flow_sequence_entry_mapping_value(parser, event)\n\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE:\n\t\treturn yaml_parser_parse_flow_sequence_entry_mapping_end(parser, event)\n\n\tcase yaml_PARSE_FLOW_MAPPING_FIRST_KEY_STATE:\n\t\treturn yaml_parser_parse_flow_mapping_key(parser, event, true)\n\n\tcase yaml_PARSE_FLOW_MAPPING_KEY_STATE:\n\t\treturn yaml_parser_parse_flow_mapping_key(parser, event, false)\n\n\tcase yaml_PARSE_FLOW_MAPPING_VALUE_STATE:\n\t\treturn yaml_parser_parse_flow_mapping_value(parser, event, false)\n\n\tcase yaml_PARSE_FLOW_MAPPING_EMPTY_VALUE_STATE:\n\t\treturn yaml_parser_parse_flow_mapping_value(parser, event, true)\n\n\tdefault:\n\t\tpanic(\"invalid parser state\")\n\t}\n}\n\n// Parse the production:\n// stream ::= STREAM-START implicit_document? explicit_document* STREAM-END\n// ************\nfunc yaml_parser_parse_stream_start(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ != yaml_STREAM_START_TOKEN {\n\t\treturn yaml_parser_set_parser_error(parser, \"did not find expected \", token.start_mark)\n\t}\n\tparser.state = yaml_PARSE_IMPLICIT_DOCUMENT_START_STATE\n\t*event = yaml_event_t{\n\t\ttyp: yaml_STREAM_START_EVENT,\n\t\tstart_mark: token.start_mark,\n\t\tend_mark: token.end_mark,\n\t\tencoding: token.encoding,\n\t}\n\tskip_token(parser)\n\treturn true\n}\n\n// Parse the productions:\n// implicit_document ::= block_node DOCUMENT-END*\n// *\n// explicit_document ::= DIRECTIVE* DOCUMENT-START block_node? DOCUMENT-END*\n// *************************\nfunc yaml_parser_parse_document_start(parser *yaml_parser_t, event *yaml_event_t, implicit bool) bool {\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\t// Parse extra document end indicators.\n\tif !implicit {\n\t\tfor token.typ == yaml_DOCUMENT_END_TOKEN {\n\t\t\tskip_token(parser)\n\t\t\ttoken = peek_token(parser)\n\t\t\tif token == nil {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\n\tif implicit && token.typ != yaml_VERSION_DIRECTIVE_TOKEN &&\n\t\ttoken.typ != yaml_TAG_DIRECTIVE_TOKEN &&\n\t\ttoken.typ != yaml_DOCUMENT_START_TOKEN &&\n\t\ttoken.typ != yaml_STREAM_END_TOKEN {\n\t\t// Parse an implicit document.\n\t\tif !yaml_parser_process_directives(parser, nil, nil) {\n\t\t\treturn false\n\t\t}\n\t\tparser.states = append(parser.states, yaml_PARSE_DOCUMENT_END_STATE)\n\t\tparser.state = yaml_PARSE_BLOCK_NODE_STATE\n\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_DOCUMENT_START_EVENT,\n\t\t\tstart_mark: token.start_mark,\n\t\t\tend_mark: token.end_mark,\n\t\t}\n\n\t} else if token.typ != yaml_STREAM_END_TOKEN {\n\t\t// Parse an explicit document.\n\t\tvar version_directive *yaml_version_directive_t\n\t\tvar tag_directives []yaml_tag_directive_t\n\t\tstart_mark := token.start_mark\n\t\tif !yaml_parser_process_directives(parser, &version_directive, &tag_directives) {\n\t\t\treturn false\n\t\t}\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_DOCUMENT_START_TOKEN {\n\t\t\tyaml_parser_set_parser_error(parser,\n\t\t\t\t\"did not find expected \", token.start_mark)\n\t\t\treturn false\n\t\t}\n\t\tparser.states = append(parser.states, yaml_PARSE_DOCUMENT_END_STATE)\n\t\tparser.state = yaml_PARSE_DOCUMENT_CONTENT_STATE\n\t\tend_mark := token.end_mark\n\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_DOCUMENT_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tversion_directive: version_directive,\n\t\t\ttag_directives: tag_directives,\n\t\t\timplicit: false,\n\t\t}\n\t\tskip_token(parser)\n\n\t} else {\n\t\t// Parse the stream end.\n\t\tparser.state = yaml_PARSE_END_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_STREAM_END_EVENT,\n\t\t\tstart_mark: token.start_mark,\n\t\t\tend_mark: token.end_mark,\n\t\t}\n\t\tskip_token(parser)\n\t}\n\n\treturn true\n}\n\n// Parse the productions:\n// explicit_document ::= DIRECTIVE* DOCUMENT-START block_node? DOCUMENT-END*\n// ***********\n//\nfunc yaml_parser_parse_document_content(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ == yaml_VERSION_DIRECTIVE_TOKEN ||\n\t\ttoken.typ == yaml_TAG_DIRECTIVE_TOKEN ||\n\t\ttoken.typ == yaml_DOCUMENT_START_TOKEN ||\n\t\ttoken.typ == yaml_DOCUMENT_END_TOKEN ||\n\t\ttoken.typ == yaml_STREAM_END_TOKEN {\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\t\treturn yaml_parser_process_empty_scalar(parser, event,\n\t\t\ttoken.start_mark)\n\t}\n\treturn yaml_parser_parse_node(parser, event, true, false)\n}\n\n// Parse the productions:\n// implicit_document ::= block_node DOCUMENT-END*\n// *************\n// explicit_document ::= DIRECTIVE* DOCUMENT-START block_node? DOCUMENT-END*\n//\nfunc yaml_parser_parse_document_end(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tstart_mark := token.start_mark\n\tend_mark := token.start_mark\n\n\timplicit := true\n\tif token.typ == yaml_DOCUMENT_END_TOKEN {\n\t\tend_mark = token.end_mark\n\t\tskip_token(parser)\n\t\timplicit = false\n\t}\n\n\tparser.tag_directives = parser.tag_directives[:0]\n\n\tparser.state = yaml_PARSE_DOCUMENT_START_STATE\n\t*event = yaml_event_t{\n\t\ttyp: yaml_DOCUMENT_END_EVENT,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\timplicit: implicit,\n\t}\n\treturn true\n}\n\n// Parse the productions:\n// block_node_or_indentless_sequence ::=\n// ALIAS\n// *****\n// | properties (block_content | indentless_block_sequence)?\n// ********** *\n// | block_content | indentless_block_sequence\n// *\n// block_node ::= ALIAS\n// *****\n// | properties block_content?\n// ********** *\n// | block_content\n// *\n// flow_node ::= ALIAS\n// *****\n// | properties flow_content?\n// ********** *\n// | flow_content\n// *\n// properties ::= TAG ANCHOR? | ANCHOR TAG?\n// *************************\n// block_content ::= block_collection | flow_collection | SCALAR\n// ******\n// flow_content ::= flow_collection | SCALAR\n// ******\nfunc yaml_parser_parse_node(parser *yaml_parser_t, event *yaml_event_t, block, indentless_sequence bool) bool {\n\t//defer trace(\"yaml_parser_parse_node\", \"block:\", block, \"indentless_sequence:\", indentless_sequence)()\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tif token.typ == yaml_ALIAS_TOKEN {\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_ALIAS_EVENT,\n\t\t\tstart_mark: token.start_mark,\n\t\t\tend_mark: token.end_mark,\n\t\t\tanchor: token.value,\n\t\t}\n\t\tskip_token(parser)\n\t\treturn true\n\t}\n\n\tstart_mark := token.start_mark\n\tend_mark := token.start_mark\n\n\tvar tag_token bool\n\tvar tag_handle, tag_suffix, anchor []byte\n\tvar tag_mark yaml_mark_t\n\tif token.typ == yaml_ANCHOR_TOKEN {\n\t\tanchor = token.value\n\t\tstart_mark = token.start_mark\n\t\tend_mark = token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ == yaml_TAG_TOKEN {\n\t\t\ttag_token = true\n\t\t\ttag_handle = token.value\n\t\t\ttag_suffix = token.suffix\n\t\t\ttag_mark = token.start_mark\n\t\t\tend_mark = token.end_mark\n\t\t\tskip_token(parser)\n\t\t\ttoken = peek_token(parser)\n\t\t\tif token == nil {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t} else if token.typ == yaml_TAG_TOKEN {\n\t\ttag_token = true\n\t\ttag_handle = token.value\n\t\ttag_suffix = token.suffix\n\t\tstart_mark = token.start_mark\n\t\ttag_mark = token.start_mark\n\t\tend_mark = token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ == yaml_ANCHOR_TOKEN {\n\t\t\tanchor = token.value\n\t\t\tend_mark = token.end_mark\n\t\t\tskip_token(parser)\n\t\t\ttoken = peek_token(parser)\n\t\t\tif token == nil {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\n\tvar tag []byte\n\tif tag_token {\n\t\tif len(tag_handle) == 0 {\n\t\t\ttag = tag_suffix\n\t\t\ttag_suffix = nil\n\t\t} else {\n\t\t\tfor i := range parser.tag_directives {\n\t\t\t\tif bytes.Equal(parser.tag_directives[i].handle, tag_handle) {\n\t\t\t\t\ttag = append([]byte(nil), parser.tag_directives[i].prefix...)\n\t\t\t\t\ttag = append(tag, tag_suffix...)\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif len(tag) == 0 {\n\t\t\t\tyaml_parser_set_parser_error_context(parser,\n\t\t\t\t\t\"while parsing a node\", start_mark,\n\t\t\t\t\t\"found undefined tag handle\", tag_mark)\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\n\timplicit := len(tag) == 0\n\tif indentless_sequence && token.typ == yaml_BLOCK_ENTRY_TOKEN {\n\t\tend_mark = token.end_mark\n\t\tparser.state = yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SEQUENCE_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tstyle: yaml_style_t(yaml_BLOCK_SEQUENCE_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\tif token.typ == yaml_SCALAR_TOKEN {\n\t\tvar plain_implicit, quoted_implicit bool\n\t\tend_mark = token.end_mark\n\t\tif (len(tag) == 0 && token.style == yaml_PLAIN_SCALAR_STYLE) || (len(tag) == 1 && tag[0] == '!') {\n\t\t\tplain_implicit = true\n\t\t} else if len(tag) == 0 {\n\t\t\tquoted_implicit = true\n\t\t}\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SCALAR_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\tvalue: token.value,\n\t\t\timplicit: plain_implicit,\n\t\t\tquoted_implicit: quoted_implicit,\n\t\t\tstyle: yaml_style_t(token.style),\n\t\t}\n\t\tskip_token(parser)\n\t\treturn true\n\t}\n\tif token.typ == yaml_FLOW_SEQUENCE_START_TOKEN {\n\t\t// [Go] Some of the events below can be merged as they differ only on style.\n\t\tend_mark = token.end_mark\n\t\tparser.state = yaml_PARSE_FLOW_SEQUENCE_FIRST_ENTRY_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SEQUENCE_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tstyle: yaml_style_t(yaml_FLOW_SEQUENCE_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\tif token.typ == yaml_FLOW_MAPPING_START_TOKEN {\n\t\tend_mark = token.end_mark\n\t\tparser.state = yaml_PARSE_FLOW_MAPPING_FIRST_KEY_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_MAPPING_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tstyle: yaml_style_t(yaml_FLOW_MAPPING_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\tif block && token.typ == yaml_BLOCK_SEQUENCE_START_TOKEN {\n\t\tend_mark = token.end_mark\n\t\tparser.state = yaml_PARSE_BLOCK_SEQUENCE_FIRST_ENTRY_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SEQUENCE_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tstyle: yaml_style_t(yaml_BLOCK_SEQUENCE_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\tif block && token.typ == yaml_BLOCK_MAPPING_START_TOKEN {\n\t\tend_mark = token.end_mark\n\t\tparser.state = yaml_PARSE_BLOCK_MAPPING_FIRST_KEY_STATE\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_MAPPING_START_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tstyle: yaml_style_t(yaml_BLOCK_MAPPING_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\tif len(anchor) > 0 || len(tag) > 0 {\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SCALAR_EVENT,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tanchor: anchor,\n\t\t\ttag: tag,\n\t\t\timplicit: implicit,\n\t\t\tquoted_implicit: false,\n\t\t\tstyle: yaml_style_t(yaml_PLAIN_SCALAR_STYLE),\n\t\t}\n\t\treturn true\n\t}\n\n\tcontext := \"while parsing a flow node\"\n\tif block {\n\t\tcontext = \"while parsing a block node\"\n\t}\n\tyaml_parser_set_parser_error_context(parser, context, start_mark,\n\t\t\"did not find expected node content\", token.start_mark)\n\treturn false\n}\n\n// Parse the productions:\n// block_sequence ::= BLOCK-SEQUENCE-START (BLOCK-ENTRY block_node?)* BLOCK-END\n// ******************** *********** * *********\n//\nfunc yaml_parser_parse_block_sequence_entry(parser *yaml_parser_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\ttoken := peek_token(parser)\n\t\tparser.marks = append(parser.marks, token.start_mark)\n\t\tskip_token(parser)\n\t}\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tif token.typ == yaml_BLOCK_ENTRY_TOKEN {\n\t\tmark := token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_BLOCK_ENTRY_TOKEN && token.typ != yaml_BLOCK_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, true, false)\n\t\t} else {\n\t\t\tparser.state = yaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE\n\t\t\treturn yaml_parser_process_empty_scalar(parser, event, mark)\n\t\t}\n\t}\n\tif token.typ == yaml_BLOCK_END_TOKEN {\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\t\tparser.marks = parser.marks[:len(parser.marks)-1]\n\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_SEQUENCE_END_EVENT,\n\t\t\tstart_mark: token.start_mark,\n\t\t\tend_mark: token.end_mark,\n\t\t}\n\n\t\tskip_token(parser)\n\t\treturn true\n\t}\n\n\tcontext_mark := parser.marks[len(parser.marks)-1]\n\tparser.marks = parser.marks[:len(parser.marks)-1]\n\treturn yaml_parser_set_parser_error_context(parser,\n\t\t\"while parsing a block collection\", context_mark,\n\t\t\"did not find expected '-' indicator\", token.start_mark)\n}\n\n// Parse the productions:\n// indentless_sequence ::= (BLOCK-ENTRY block_node?)+\n// *********** *\nfunc yaml_parser_parse_indentless_sequence_entry(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tif token.typ == yaml_BLOCK_ENTRY_TOKEN {\n\t\tmark := token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_BLOCK_ENTRY_TOKEN &&\n\t\t\ttoken.typ != yaml_KEY_TOKEN &&\n\t\t\ttoken.typ != yaml_VALUE_TOKEN &&\n\t\t\ttoken.typ != yaml_BLOCK_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, true, false)\n\t\t}\n\t\tparser.state = yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE\n\t\treturn yaml_parser_process_empty_scalar(parser, event, mark)\n\t}\n\tparser.state = parser.states[len(parser.states)-1]\n\tparser.states = parser.states[:len(parser.states)-1]\n\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SEQUENCE_END_EVENT,\n\t\tstart_mark: token.start_mark,\n\t\tend_mark: token.start_mark, // [Go] Shouldn't this be token.end_mark?\n\t}\n\treturn true\n}\n\n// Parse the productions:\n// block_mapping ::= BLOCK-MAPPING_START\n// *******************\n// ((KEY block_node_or_indentless_sequence?)?\n// *** *\n// (VALUE block_node_or_indentless_sequence?)?)*\n//\n// BLOCK-END\n// *********\n//\nfunc yaml_parser_parse_block_mapping_key(parser *yaml_parser_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\ttoken := peek_token(parser)\n\t\tparser.marks = append(parser.marks, token.start_mark)\n\t\tskip_token(parser)\n\t}\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tif token.typ == yaml_KEY_TOKEN {\n\t\tmark := token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_KEY_TOKEN &&\n\t\t\ttoken.typ != yaml_VALUE_TOKEN &&\n\t\t\ttoken.typ != yaml_BLOCK_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_BLOCK_MAPPING_VALUE_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, true, true)\n\t\t} else {\n\t\t\tparser.state = yaml_PARSE_BLOCK_MAPPING_VALUE_STATE\n\t\t\treturn yaml_parser_process_empty_scalar(parser, event, mark)\n\t\t}\n\t} else if token.typ == yaml_BLOCK_END_TOKEN {\n\t\tparser.state = parser.states[len(parser.states)-1]\n\t\tparser.states = parser.states[:len(parser.states)-1]\n\t\tparser.marks = parser.marks[:len(parser.marks)-1]\n\t\t*event = yaml_event_t{\n\t\t\ttyp: yaml_MAPPING_END_EVENT,\n\t\t\tstart_mark: token.start_mark,\n\t\t\tend_mark: token.end_mark,\n\t\t}\n\t\tskip_token(parser)\n\t\treturn true\n\t}\n\n\tcontext_mark := parser.marks[len(parser.marks)-1]\n\tparser.marks = parser.marks[:len(parser.marks)-1]\n\treturn yaml_parser_set_parser_error_context(parser,\n\t\t\"while parsing a block mapping\", context_mark,\n\t\t\"did not find expected key\", token.start_mark)\n}\n\n// Parse the productions:\n// block_mapping ::= BLOCK-MAPPING_START\n//\n// ((KEY block_node_or_indentless_sequence?)?\n//\n// (VALUE block_node_or_indentless_sequence?)?)*\n// ***** *\n// BLOCK-END\n//\n//\nfunc yaml_parser_parse_block_mapping_value(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ == yaml_VALUE_TOKEN {\n\t\tmark := token.end_mark\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_KEY_TOKEN &&\n\t\t\ttoken.typ != yaml_VALUE_TOKEN &&\n\t\t\ttoken.typ != yaml_BLOCK_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_BLOCK_MAPPING_KEY_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, true, true)\n\t\t}\n\t\tparser.state = yaml_PARSE_BLOCK_MAPPING_KEY_STATE\n\t\treturn yaml_parser_process_empty_scalar(parser, event, mark)\n\t}\n\tparser.state = yaml_PARSE_BLOCK_MAPPING_KEY_STATE\n\treturn yaml_parser_process_empty_scalar(parser, event, token.start_mark)\n}\n\n// Parse the productions:\n// flow_sequence ::= FLOW-SEQUENCE-START\n// *******************\n// (flow_sequence_entry FLOW-ENTRY)*\n// * **********\n// flow_sequence_entry?\n// *\n// FLOW-SEQUENCE-END\n// *****************\n// flow_sequence_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// *\n//\nfunc yaml_parser_parse_flow_sequence_entry(parser *yaml_parser_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\ttoken := peek_token(parser)\n\t\tparser.marks = append(parser.marks, token.start_mark)\n\t\tskip_token(parser)\n\t}\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ != yaml_FLOW_SEQUENCE_END_TOKEN {\n\t\tif !first {\n\t\t\tif token.typ == yaml_FLOW_ENTRY_TOKEN {\n\t\t\t\tskip_token(parser)\n\t\t\t\ttoken = peek_token(parser)\n\t\t\t\tif token == nil {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcontext_mark := parser.marks[len(parser.marks)-1]\n\t\t\t\tparser.marks = parser.marks[:len(parser.marks)-1]\n\t\t\t\treturn yaml_parser_set_parser_error_context(parser,\n\t\t\t\t\t\"while parsing a flow sequence\", context_mark,\n\t\t\t\t\t\"did not find expected ',' or ']'\", token.start_mark)\n\t\t\t}\n\t\t}\n\n\t\tif token.typ == yaml_KEY_TOKEN {\n\t\t\tparser.state = yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_KEY_STATE\n\t\t\t*event = yaml_event_t{\n\t\t\t\ttyp: yaml_MAPPING_START_EVENT,\n\t\t\t\tstart_mark: token.start_mark,\n\t\t\t\tend_mark: token.end_mark,\n\t\t\t\timplicit: true,\n\t\t\t\tstyle: yaml_style_t(yaml_FLOW_MAPPING_STYLE),\n\t\t\t}\n\t\t\tskip_token(parser)\n\t\t\treturn true\n\t\t} else if token.typ != yaml_FLOW_SEQUENCE_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t\t}\n\t}\n\n\tparser.state = parser.states[len(parser.states)-1]\n\tparser.states = parser.states[:len(parser.states)-1]\n\tparser.marks = parser.marks[:len(parser.marks)-1]\n\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SEQUENCE_END_EVENT,\n\t\tstart_mark: token.start_mark,\n\t\tend_mark: token.end_mark,\n\t}\n\n\tskip_token(parser)\n\treturn true\n}\n\n//\n// Parse the productions:\n// flow_sequence_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// *** *\n//\nfunc yaml_parser_parse_flow_sequence_entry_mapping_key(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ != yaml_VALUE_TOKEN &&\n\t\ttoken.typ != yaml_FLOW_ENTRY_TOKEN &&\n\t\ttoken.typ != yaml_FLOW_SEQUENCE_END_TOKEN {\n\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE)\n\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t}\n\tmark := token.end_mark\n\tskip_token(parser)\n\tparser.state = yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE\n\treturn yaml_parser_process_empty_scalar(parser, event, mark)\n}\n\n// Parse the productions:\n// flow_sequence_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// ***** *\n//\nfunc yaml_parser_parse_flow_sequence_entry_mapping_value(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif token.typ == yaml_VALUE_TOKEN {\n\t\tskip_token(parser)\n\t\ttoken := peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_FLOW_ENTRY_TOKEN && token.typ != yaml_FLOW_SEQUENCE_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t\t}\n\t}\n\tparser.state = yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE\n\treturn yaml_parser_process_empty_scalar(parser, event, token.start_mark)\n}\n\n// Parse the productions:\n// flow_sequence_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// *\n//\nfunc yaml_parser_parse_flow_sequence_entry_mapping_end(parser *yaml_parser_t, event *yaml_event_t) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tparser.state = yaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE\n\t*event = yaml_event_t{\n\t\ttyp: yaml_MAPPING_END_EVENT,\n\t\tstart_mark: token.start_mark,\n\t\tend_mark: token.start_mark, // [Go] Shouldn't this be end_mark?\n\t}\n\treturn true\n}\n\n// Parse the productions:\n// flow_mapping ::= FLOW-MAPPING-START\n// ******************\n// (flow_mapping_entry FLOW-ENTRY)*\n// * **********\n// flow_mapping_entry?\n// ******************\n// FLOW-MAPPING-END\n// ****************\n// flow_mapping_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// * *** *\n//\nfunc yaml_parser_parse_flow_mapping_key(parser *yaml_parser_t, event *yaml_event_t, first bool) bool {\n\tif first {\n\t\ttoken := peek_token(parser)\n\t\tparser.marks = append(parser.marks, token.start_mark)\n\t\tskip_token(parser)\n\t}\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tif token.typ != yaml_FLOW_MAPPING_END_TOKEN {\n\t\tif !first {\n\t\t\tif token.typ == yaml_FLOW_ENTRY_TOKEN {\n\t\t\t\tskip_token(parser)\n\t\t\t\ttoken = peek_token(parser)\n\t\t\t\tif token == nil {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcontext_mark := parser.marks[len(parser.marks)-1]\n\t\t\t\tparser.marks = parser.marks[:len(parser.marks)-1]\n\t\t\t\treturn yaml_parser_set_parser_error_context(parser,\n\t\t\t\t\t\"while parsing a flow mapping\", context_mark,\n\t\t\t\t\t\"did not find expected ',' or '}'\", token.start_mark)\n\t\t\t}\n\t\t}\n\n\t\tif token.typ == yaml_KEY_TOKEN {\n\t\t\tskip_token(parser)\n\t\t\ttoken = peek_token(parser)\n\t\t\tif token == nil {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif token.typ != yaml_VALUE_TOKEN &&\n\t\t\t\ttoken.typ != yaml_FLOW_ENTRY_TOKEN &&\n\t\t\t\ttoken.typ != yaml_FLOW_MAPPING_END_TOKEN {\n\t\t\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_MAPPING_VALUE_STATE)\n\t\t\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t\t\t} else {\n\t\t\t\tparser.state = yaml_PARSE_FLOW_MAPPING_VALUE_STATE\n\t\t\t\treturn yaml_parser_process_empty_scalar(parser, event, token.start_mark)\n\t\t\t}\n\t\t} else if token.typ != yaml_FLOW_MAPPING_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_MAPPING_EMPTY_VALUE_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t\t}\n\t}\n\n\tparser.state = parser.states[len(parser.states)-1]\n\tparser.states = parser.states[:len(parser.states)-1]\n\tparser.marks = parser.marks[:len(parser.marks)-1]\n\t*event = yaml_event_t{\n\t\ttyp: yaml_MAPPING_END_EVENT,\n\t\tstart_mark: token.start_mark,\n\t\tend_mark: token.end_mark,\n\t}\n\tskip_token(parser)\n\treturn true\n}\n\n// Parse the productions:\n// flow_mapping_entry ::= flow_node | KEY flow_node? (VALUE flow_node?)?\n// * ***** *\n//\nfunc yaml_parser_parse_flow_mapping_value(parser *yaml_parser_t, event *yaml_event_t, empty bool) bool {\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\tif empty {\n\t\tparser.state = yaml_PARSE_FLOW_MAPPING_KEY_STATE\n\t\treturn yaml_parser_process_empty_scalar(parser, event, token.start_mark)\n\t}\n\tif token.typ == yaml_VALUE_TOKEN {\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t\tif token.typ != yaml_FLOW_ENTRY_TOKEN && token.typ != yaml_FLOW_MAPPING_END_TOKEN {\n\t\t\tparser.states = append(parser.states, yaml_PARSE_FLOW_MAPPING_KEY_STATE)\n\t\t\treturn yaml_parser_parse_node(parser, event, false, false)\n\t\t}\n\t}\n\tparser.state = yaml_PARSE_FLOW_MAPPING_KEY_STATE\n\treturn yaml_parser_process_empty_scalar(parser, event, token.start_mark)\n}\n\n// Generate an empty scalar event.\nfunc yaml_parser_process_empty_scalar(parser *yaml_parser_t, event *yaml_event_t, mark yaml_mark_t) bool {\n\t*event = yaml_event_t{\n\t\ttyp: yaml_SCALAR_EVENT,\n\t\tstart_mark: mark,\n\t\tend_mark: mark,\n\t\tvalue: nil, // Empty\n\t\timplicit: true,\n\t\tstyle: yaml_style_t(yaml_PLAIN_SCALAR_STYLE),\n\t}\n\treturn true\n}\n\nvar default_tag_directives = []yaml_tag_directive_t{\n\t{[]byte(\"!\"), []byte(\"!\")},\n\t{[]byte(\"!!\"), []byte(\"tag:yaml.org,2002:\")},\n}\n\n// Parse directives.\nfunc yaml_parser_process_directives(parser *yaml_parser_t,\n\tversion_directive_ref **yaml_version_directive_t,\n\ttag_directives_ref *[]yaml_tag_directive_t) bool {\n\n\tvar version_directive *yaml_version_directive_t\n\tvar tag_directives []yaml_tag_directive_t\n\n\ttoken := peek_token(parser)\n\tif token == nil {\n\t\treturn false\n\t}\n\n\tfor token.typ == yaml_VERSION_DIRECTIVE_TOKEN || token.typ == yaml_TAG_DIRECTIVE_TOKEN {\n\t\tif token.typ == yaml_VERSION_DIRECTIVE_TOKEN {\n\t\t\tif version_directive != nil {\n\t\t\t\tyaml_parser_set_parser_error(parser,\n\t\t\t\t\t\"found duplicate %YAML directive\", token.start_mark)\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tif token.major != 1 || token.minor != 1 {\n\t\t\t\tyaml_parser_set_parser_error(parser,\n\t\t\t\t\t\"found incompatible YAML document\", token.start_mark)\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tversion_directive = &yaml_version_directive_t{\n\t\t\t\tmajor: token.major,\n\t\t\t\tminor: token.minor,\n\t\t\t}\n\t\t} else if token.typ == yaml_TAG_DIRECTIVE_TOKEN {\n\t\t\tvalue := yaml_tag_directive_t{\n\t\t\t\thandle: token.value,\n\t\t\t\tprefix: token.prefix,\n\t\t\t}\n\t\t\tif !yaml_parser_append_tag_directive(parser, value, false, token.start_mark) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\ttag_directives = append(tag_directives, value)\n\t\t}\n\n\t\tskip_token(parser)\n\t\ttoken = peek_token(parser)\n\t\tif token == nil {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tfor i := range default_tag_directives {\n\t\tif !yaml_parser_append_tag_directive(parser, default_tag_directives[i], true, token.start_mark) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif version_directive_ref != nil {\n\t\t*version_directive_ref = version_directive\n\t}\n\tif tag_directives_ref != nil {\n\t\t*tag_directives_ref = tag_directives\n\t}\n\treturn true\n}\n\n// Append a tag directive to the directives stack.\nfunc yaml_parser_append_tag_directive(parser *yaml_parser_t, value yaml_tag_directive_t, allow_duplicates bool, mark yaml_mark_t) bool {\n\tfor i := range parser.tag_directives {\n\t\tif bytes.Equal(value.handle, parser.tag_directives[i].handle) {\n\t\t\tif allow_duplicates {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn yaml_parser_set_parser_error(parser, \"found duplicate %TAG directive\", mark)\n\t\t}\n\t}\n\n\t// [Go] I suspect the copy is unnecessary. This was likely done\n\t// because there was no way to track ownership of the data.\n\tvalue_copy := yaml_tag_directive_t{\n\t\thandle: make([]byte, len(value.handle)),\n\t\tprefix: make([]byte, len(value.prefix)),\n\t}\n\tcopy(value_copy.handle, value.handle)\n\tcopy(value_copy.prefix, value.prefix)\n\tparser.tag_directives = append(parser.tag_directives, value_copy)\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/readerc.go", "content": "package yaml\n\nimport (\n\t\"io\"\n)\n\n// Set the reader error and return 0.\nfunc yaml_parser_set_reader_error(parser *yaml_parser_t, problem string, offset int, value int) bool {\n\tparser.error = yaml_READER_ERROR\n\tparser.problem = problem\n\tparser.problem_offset = offset\n\tparser.problem_value = value\n\treturn false\n}\n\n// Byte order marks.\nconst (\n\tbom_UTF8 = \"\\xef\\xbb\\xbf\"\n\tbom_UTF16LE = \"\\xff\\xfe\"\n\tbom_UTF16BE = \"\\xfe\\xff\"\n)\n\n// Determine the input stream encoding by checking the BOM symbol. If no BOM is\n// found, the UTF-8 encoding is assumed. Return 1 on success, 0 on failure.\nfunc yaml_parser_determine_encoding(parser *yaml_parser_t) bool {\n\t// Ensure that we had enough bytes in the raw buffer.\n\tfor !parser.eof && len(parser.raw_buffer)-parser.raw_buffer_pos < 3 {\n\t\tif !yaml_parser_update_raw_buffer(parser) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Determine the encoding.\n\tbuf := parser.raw_buffer\n\tpos := parser.raw_buffer_pos\n\tavail := len(buf) - pos\n\tif avail >= 2 && buf[pos] == bom_UTF16LE[0] && buf[pos+1] == bom_UTF16LE[1] {\n\t\tparser.encoding = yaml_UTF16LE_ENCODING\n\t\tparser.raw_buffer_pos += 2\n\t\tparser.offset += 2\n\t} else if avail >= 2 && buf[pos] == bom_UTF16BE[0] && buf[pos+1] == bom_UTF16BE[1] {\n\t\tparser.encoding = yaml_UTF16BE_ENCODING\n\t\tparser.raw_buffer_pos += 2\n\t\tparser.offset += 2\n\t} else if avail >= 3 && buf[pos] == bom_UTF8[0] && buf[pos+1] == bom_UTF8[1] && buf[pos+2] == bom_UTF8[2] {\n\t\tparser.encoding = yaml_UTF8_ENCODING\n\t\tparser.raw_buffer_pos += 3\n\t\tparser.offset += 3\n\t} else {\n\t\tparser.encoding = yaml_UTF8_ENCODING\n\t}\n\treturn true\n}\n\n// Update the raw buffer.\nfunc yaml_parser_update_raw_buffer(parser *yaml_parser_t) bool {\n\tsize_read := 0\n\n\t// Return if the raw buffer is full.\n\tif parser.raw_buffer_pos == 0 && len(parser.raw_buffer) == cap(parser.raw_buffer) {\n\t\treturn true\n\t}\n\n\t// Return on EOF.\n\tif parser.eof {\n\t\treturn true\n\t}\n\n\t// Move the remaining bytes in the raw buffer to the beginning.\n\tif parser.raw_buffer_pos > 0 && parser.raw_buffer_pos < len(parser.raw_buffer) {\n\t\tcopy(parser.raw_buffer, parser.raw_buffer[parser.raw_buffer_pos:])\n\t}\n\tparser.raw_buffer = parser.raw_buffer[:len(parser.raw_buffer)-parser.raw_buffer_pos]\n\tparser.raw_buffer_pos = 0\n\n\t// Call the read handler to fill the buffer.\n\tsize_read, err := parser.read_handler(parser, parser.raw_buffer[len(parser.raw_buffer):cap(parser.raw_buffer)])\n\tparser.raw_buffer = parser.raw_buffer[:len(parser.raw_buffer)+size_read]\n\tif err == io.EOF {\n\t\tparser.eof = true\n\t} else if err != nil {\n\t\treturn yaml_parser_set_reader_error(parser, \"input error: \"+err.Error(), parser.offset, -1)\n\t}\n\treturn true\n}\n\n// Ensure that the buffer contains at least `length` characters.\n// Return true on success, false on failure.\n//\n// The length is supposed to be significantly less that the buffer size.\nfunc yaml_parser_update_buffer(parser *yaml_parser_t, length int) bool {\n\tif parser.read_handler == nil {\n\t\tpanic(\"read handler must be set\")\n\t}\n\n\t// [Go] This function was changed to guarantee the requested length size at EOF.\n\t// The fact we need to do this is pretty awful, but the description above implies\n\t// for that to be the case, and there are tests \n\n\t// If the EOF flag is set and the raw buffer is empty, do nothing.\n\tif parser.eof && parser.raw_buffer_pos == len(parser.raw_buffer) {\n\t\t// [Go] ACTUALLY! Read the documentation of this function above.\n\t\t// This is just broken. To return true, we need to have the\n\t\t// given length in the buffer. Not doing that means every single\n\t\t// check that calls this function to make sure the buffer has a\n\t\t// given length is Go) panicking; or C) accessing invalid memory.\n\t\t//return true\n\t}\n\n\t// Return if the buffer contains enough characters.\n\tif parser.unread >= length {\n\t\treturn true\n\t}\n\n\t// Determine the input encoding if it is not known yet.\n\tif parser.encoding == yaml_ANY_ENCODING {\n\t\tif !yaml_parser_determine_encoding(parser) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Move the unread characters to the beginning of the buffer.\n\tbuffer_len := len(parser.buffer)\n\tif parser.buffer_pos > 0 && parser.buffer_pos < buffer_len {\n\t\tcopy(parser.buffer, parser.buffer[parser.buffer_pos:])\n\t\tbuffer_len -= parser.buffer_pos\n\t\tparser.buffer_pos = 0\n\t} else if parser.buffer_pos == buffer_len {\n\t\tbuffer_len = 0\n\t\tparser.buffer_pos = 0\n\t}\n\n\t// Open the whole buffer for writing, and cut it before returning.\n\tparser.buffer = parser.buffer[:cap(parser.buffer)]\n\n\t// Fill the buffer until it has enough characters.\n\tfirst := true\n\tfor parser.unread < length {\n\n\t\t// Fill the raw buffer if necessary.\n\t\tif !first || parser.raw_buffer_pos == len(parser.raw_buffer) {\n\t\t\tif !yaml_parser_update_raw_buffer(parser) {\n\t\t\t\tparser.buffer = parser.buffer[:buffer_len]\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tfirst = false\n\n\t\t// Decode the raw buffer.\n\tinner:\n\t\tfor parser.raw_buffer_pos != len(parser.raw_buffer) {\n\t\t\tvar value rune\n\t\t\tvar width int\n\n\t\t\traw_unread := len(parser.raw_buffer) - parser.raw_buffer_pos\n\n\t\t\t// Decode the next character.\n\t\t\tswitch parser.encoding {\n\t\t\tcase yaml_UTF8_ENCODING:\n\t\t\t\t// Decode a UTF-8 character. Check RFC 3629\n\t\t\t\t// (http://www.ietf.org/rfc/rfc3629.txt) for more details.\n\t\t\t\t//\n\t\t\t\t// The following table (taken from the RFC) is used for\n\t\t\t\t// decoding.\n\t\t\t\t//\n\t\t\t\t// Char. number range | UTF-8 octet sequence\n\t\t\t\t// (hexadecimal) | (binary)\n\t\t\t\t// --------------------+------------------------------------\n\t\t\t\t// 0000 0000-0000 007F | 0xxxxxxx\n\t\t\t\t// 0000 0080-0000 07FF | 110xxxxx 10xxxxxx\n\t\t\t\t// 0000 0800-0000 FFFF | 1110xxxx 10xxxxxx 10xxxxxx\n\t\t\t\t// 0001 0000-0010 FFFF | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx\n\t\t\t\t//\n\t\t\t\t// Additionally, the characters in the range 0xD800-0xDFFF\n\t\t\t\t// are prohibited as they are reserved for use with UTF-16\n\t\t\t\t// surrogate pairs.\n\n\t\t\t\t// Determine the length of the UTF-8 sequence.\n\t\t\t\toctet := parser.raw_buffer[parser.raw_buffer_pos]\n\t\t\t\tswitch {\n\t\t\t\tcase octet&0x80 == 0x00:\n\t\t\t\t\twidth = 1\n\t\t\t\tcase octet&0xE0 == 0xC0:\n\t\t\t\t\twidth = 2\n\t\t\t\tcase octet&0xF0 == 0xE0:\n\t\t\t\t\twidth = 3\n\t\t\t\tcase octet&0xF8 == 0xF0:\n\t\t\t\t\twidth = 4\n\t\t\t\tdefault:\n\t\t\t\t\t// The leading octet is invalid.\n\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\"invalid leading UTF-8 octet\",\n\t\t\t\t\t\tparser.offset, int(octet))\n\t\t\t\t}\n\n\t\t\t\t// Check if the raw buffer contains an incomplete character.\n\t\t\t\tif width > raw_unread {\n\t\t\t\t\tif parser.eof {\n\t\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\t\"incomplete UTF-8 octet sequence\",\n\t\t\t\t\t\t\tparser.offset, -1)\n\t\t\t\t\t}\n\t\t\t\t\tbreak inner\n\t\t\t\t}\n\n\t\t\t\t// Decode the leading octet.\n\t\t\t\tswitch {\n\t\t\t\tcase octet&0x80 == 0x00:\n\t\t\t\t\tvalue = rune(octet & 0x7F)\n\t\t\t\tcase octet&0xE0 == 0xC0:\n\t\t\t\t\tvalue = rune(octet & 0x1F)\n\t\t\t\tcase octet&0xF0 == 0xE0:\n\t\t\t\t\tvalue = rune(octet & 0x0F)\n\t\t\t\tcase octet&0xF8 == 0xF0:\n\t\t\t\t\tvalue = rune(octet & 0x07)\n\t\t\t\tdefault:\n\t\t\t\t\tvalue = 0\n\t\t\t\t}\n\n\t\t\t\t// Check and decode the trailing octets.\n\t\t\t\tfor k := 1; k < width; k++ {\n\t\t\t\t\toctet = parser.raw_buffer[parser.raw_buffer_pos+k]\n\n\t\t\t\t\t// Check if the octet is valid.\n\t\t\t\t\tif (octet & 0xC0) != 0x80 {\n\t\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\t\"invalid trailing UTF-8 octet\",\n\t\t\t\t\t\t\tparser.offset+k, int(octet))\n\t\t\t\t\t}\n\n\t\t\t\t\t// Decode the octet.\n\t\t\t\t\tvalue = (value << 6) + rune(octet&0x3F)\n\t\t\t\t}\n\n\t\t\t\t// Check the length of the sequence against the value.\n\t\t\t\tswitch {\n\t\t\t\tcase width == 1:\n\t\t\t\tcase width == 2 && value >= 0x80:\n\t\t\t\tcase width == 3 && value >= 0x800:\n\t\t\t\tcase width == 4 && value >= 0x10000:\n\t\t\t\tdefault:\n\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\"invalid length of a UTF-8 sequence\",\n\t\t\t\t\t\tparser.offset, -1)\n\t\t\t\t}\n\n\t\t\t\t// Check the range of the value.\n\t\t\t\tif value >= 0xD800 && value <= 0xDFFF || value > 0x10FFFF {\n\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\"invalid Unicode character\",\n\t\t\t\t\t\tparser.offset, int(value))\n\t\t\t\t}\n\n\t\t\tcase yaml_UTF16LE_ENCODING, yaml_UTF16BE_ENCODING:\n\t\t\t\tvar low, high int\n\t\t\t\tif parser.encoding == yaml_UTF16LE_ENCODING {\n\t\t\t\t\tlow, high = 0, 1\n\t\t\t\t} else {\n\t\t\t\t\tlow, high = 1, 0\n\t\t\t\t}\n\n\t\t\t\t// The UTF-16 encoding is not as simple as one might\n\t\t\t\t// naively think. Check RFC 2781\n\t\t\t\t// (http://www.ietf.org/rfc/rfc2781.txt).\n\t\t\t\t//\n\t\t\t\t// Normally, two subsequent bytes describe a Unicode\n\t\t\t\t// character. However a special technique (called a\n\t\t\t\t// surrogate pair) is used for specifying character\n\t\t\t\t// values larger than 0xFFFF.\n\t\t\t\t//\n\t\t\t\t// A surrogate pair consists of two pseudo-characters:\n\t\t\t\t// high surrogate area (0xD800-0xDBFF)\n\t\t\t\t// low surrogate area (0xDC00-0xDFFF)\n\t\t\t\t//\n\t\t\t\t// The following formulas are used for decoding\n\t\t\t\t// and encoding characters using surrogate pairs:\n\t\t\t\t//\n\t\t\t\t// U = U' + 0x10000 (0x01 00 00 <= U <= 0x10 FF FF)\n\t\t\t\t// U' = yyyyyyyyyyxxxxxxxxxx (0 <= U' <= 0x0F FF FF)\n\t\t\t\t// W1 = 110110yyyyyyyyyy\n\t\t\t\t// W2 = 110111xxxxxxxxxx\n\t\t\t\t//\n\t\t\t\t// where U is the character value, W1 is the high surrogate\n\t\t\t\t// area, W2 is the low surrogate area.\n\n\t\t\t\t// Check for incomplete UTF-16 character.\n\t\t\t\tif raw_unread < 2 {\n\t\t\t\t\tif parser.eof {\n\t\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\t\"incomplete UTF-16 character\",\n\t\t\t\t\t\t\tparser.offset, -1)\n\t\t\t\t\t}\n\t\t\t\t\tbreak inner\n\t\t\t\t}\n\n\t\t\t\t// Get the character.\n\t\t\t\tvalue = rune(parser.raw_buffer[parser.raw_buffer_pos+low]) +\n\t\t\t\t\t(rune(parser.raw_buffer[parser.raw_buffer_pos+high]) << 8)\n\n\t\t\t\t// Check for unexpected low surrogate area.\n\t\t\t\tif value&0xFC00 == 0xDC00 {\n\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\"unexpected low surrogate area\",\n\t\t\t\t\t\tparser.offset, int(value))\n\t\t\t\t}\n\n\t\t\t\t// Check for a high surrogate area.\n\t\t\t\tif value&0xFC00 == 0xD800 {\n\t\t\t\t\twidth = 4\n\n\t\t\t\t\t// Check for incomplete surrogate pair.\n\t\t\t\t\tif raw_unread < 4 {\n\t\t\t\t\t\tif parser.eof {\n\t\t\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\t\t\"incomplete UTF-16 surrogate pair\",\n\t\t\t\t\t\t\t\tparser.offset, -1)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak inner\n\t\t\t\t\t}\n\n\t\t\t\t\t// Get the next character.\n\t\t\t\t\tvalue2 := rune(parser.raw_buffer[parser.raw_buffer_pos+low+2]) +\n\t\t\t\t\t\t(rune(parser.raw_buffer[parser.raw_buffer_pos+high+2]) << 8)\n\n\t\t\t\t\t// Check for a low surrogate area.\n\t\t\t\t\tif value2&0xFC00 != 0xDC00 {\n\t\t\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\t\t\"expected low surrogate area\",\n\t\t\t\t\t\t\tparser.offset+2, int(value2))\n\t\t\t\t\t}\n\n\t\t\t\t\t// Generate the value of the surrogate pair.\n\t\t\t\t\tvalue = 0x10000 + ((value & 0x3FF) << 10) + (value2 & 0x3FF)\n\t\t\t\t} else {\n\t\t\t\t\twidth = 2\n\t\t\t\t}\n\n\t\t\tdefault:\n\t\t\t\tpanic(\"impossible\")\n\t\t\t}\n\n\t\t\t// Check if the character is in the allowed range:\n\t\t\t// #x9 | #xA | #xD | [#x20-#x7E] (8 bit)\n\t\t\t// | #x85 | [#xA0-#xD7FF] | [#xE000-#xFFFD] (16 bit)\n\t\t\t// | [#x10000-#x10FFFF] (32 bit)\n\t\t\tswitch {\n\t\t\tcase value == 0x09:\n\t\t\tcase value == 0x0A:\n\t\t\tcase value == 0x0D:\n\t\t\tcase value >= 0x20 && value <= 0x7E:\n\t\t\tcase value == 0x85:\n\t\t\tcase value >= 0xA0 && value <= 0xD7FF:\n\t\t\tcase value >= 0xE000 && value <= 0xFFFD:\n\t\t\tcase value >= 0x10000 && value <= 0x10FFFF:\n\t\t\tdefault:\n\t\t\t\treturn yaml_parser_set_reader_error(parser,\n\t\t\t\t\t\"control characters are not allowed\",\n\t\t\t\t\tparser.offset, int(value))\n\t\t\t}\n\n\t\t\t// Move the raw pointers.\n\t\t\tparser.raw_buffer_pos += width\n\t\t\tparser.offset += width\n\n\t\t\t// Finally put the character into the buffer.\n\t\t\tif value <= 0x7F {\n\t\t\t\t// 0000 0000-0000 007F . 0xxxxxxx\n\t\t\t\tparser.buffer[buffer_len+0] = byte(value)\n\t\t\t\tbuffer_len += 1\n\t\t\t} else if value <= 0x7FF {\n\t\t\t\t// 0000 0080-0000 07FF . 110xxxxx 10xxxxxx\n\t\t\t\tparser.buffer[buffer_len+0] = byte(0xC0 + (value >> 6))\n\t\t\t\tparser.buffer[buffer_len+1] = byte(0x80 + (value & 0x3F))\n\t\t\t\tbuffer_len += 2\n\t\t\t} else if value <= 0xFFFF {\n\t\t\t\t// 0000 0800-0000 FFFF . 1110xxxx 10xxxxxx 10xxxxxx\n\t\t\t\tparser.buffer[buffer_len+0] = byte(0xE0 + (value >> 12))\n\t\t\t\tparser.buffer[buffer_len+1] = byte(0x80 + ((value >> 6) & 0x3F))\n\t\t\t\tparser.buffer[buffer_len+2] = byte(0x80 + (value & 0x3F))\n\t\t\t\tbuffer_len += 3\n\t\t\t} else {\n\t\t\t\t// 0001 0000-0010 FFFF . 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx\n\t\t\t\tparser.buffer[buffer_len+0] = byte(0xF0 + (value >> 18))\n\t\t\t\tparser.buffer[buffer_len+1] = byte(0x80 + ((value >> 12) & 0x3F))\n\t\t\t\tparser.buffer[buffer_len+2] = byte(0x80 + ((value >> 6) & 0x3F))\n\t\t\t\tparser.buffer[buffer_len+3] = byte(0x80 + (value & 0x3F))\n\t\t\t\tbuffer_len += 4\n\t\t\t}\n\n\t\t\tparser.unread++\n\t\t}\n\n\t\t// On EOF, put NUL into the buffer and return.\n\t\tif parser.eof {\n\t\t\tparser.buffer[buffer_len] = 0\n\t\t\tbuffer_len++\n\t\t\tparser.unread++\n\t\t\tbreak\n\t\t}\n\t}\n\t// [Go] Read the documentation of this function above. To return true,\n\t// we need to have the given length in the buffer. Not doing that means\n\t// every single check that calls this function to make sure the buffer\n\t// has a given length is Go) panicking; or C) accessing invalid memory.\n\t// This happens here due to the EOF above breaking early.\n\tfor buffer_len < length {\n\t\tparser.buffer[buffer_len] = 0\n\t\tbuffer_len++\n\t}\n\tparser.buffer = parser.buffer[:buffer_len]\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/resolve.go", "content": "package yaml\n\nimport (\n\t\"encoding/base64\"\n\t\"math\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\ntype resolveMapItem struct {\n\tvalue interface{}\n\ttag string\n}\n\nvar resolveTable = make([]byte, 256)\nvar resolveMap = make(map[string]resolveMapItem)\n\nfunc init() {\n\tt := resolveTable\n\tt[int('+')] = 'S' // Sign\n\tt[int('-')] = 'S'\n\tfor _, c := range \"0123456789\" {\n\t\tt[int(c)] = 'D' // Digit\n\t}\n\tfor _, c := range \"yYnNtTfFoO~\" {\n\t\tt[int(c)] = 'M' // In map\n\t}\n\tt[int('.')] = '.' // Float (potentially in map)\n\n\tvar resolveMapList = []struct {\n\t\tv interface{}\n\t\ttag string\n\t\tl []string\n\t}{\n\t\t{true, yaml_BOOL_TAG, []string{\"y\", \"Y\", \"yes\", \"Yes\", \"YES\"}},\n\t\t{true, yaml_BOOL_TAG, []string{\"true\", \"True\", \"TRUE\"}},\n\t\t{true, yaml_BOOL_TAG, []string{\"on\", \"On\", \"ON\"}},\n\t\t{false, yaml_BOOL_TAG, []string{\"n\", \"N\", \"no\", \"No\", \"NO\"}},\n\t\t{false, yaml_BOOL_TAG, []string{\"false\", \"False\", \"FALSE\"}},\n\t\t{false, yaml_BOOL_TAG, []string{\"off\", \"Off\", \"OFF\"}},\n\t\t{nil, yaml_NULL_TAG, []string{\"\", \"~\", \"null\", \"Null\", \"NULL\"}},\n\t\t{math.NaN(), yaml_FLOAT_TAG, []string{\".nan\", \".NaN\", \".NAN\"}},\n\t\t{math.Inf(+1), yaml_FLOAT_TAG, []string{\".inf\", \".Inf\", \".INF\"}},\n\t\t{math.Inf(+1), yaml_FLOAT_TAG, []string{\"+.inf\", \"+.Inf\", \"+.INF\"}},\n\t\t{math.Inf(-1), yaml_FLOAT_TAG, []string{\"-.inf\", \"-.Inf\", \"-.INF\"}},\n\t\t{\"<<\", yaml_MERGE_TAG, []string{\"<<\"}},\n\t}\n\n\tm := resolveMap\n\tfor _, item := range resolveMapList {\n\t\tfor _, s := range item.l {\n\t\t\tm[s] = resolveMapItem{item.v, item.tag}\n\t\t}\n\t}\n}\n\nconst longTagPrefix = \"tag:yaml.org,2002:\"\n\nfunc shortTag(tag string) string {\n\t// TODO This can easily be made faster and produce less garbage.\n\tif strings.HasPrefix(tag, longTagPrefix) {\n\t\treturn \"!!\" + tag[len(longTagPrefix):]\n\t}\n\treturn tag\n}\n\nfunc longTag(tag string) string {\n\tif strings.HasPrefix(tag, \"!!\") {\n\t\treturn longTagPrefix + tag[2:]\n\t}\n\treturn tag\n}\n\nfunc resolvableTag(tag string) bool {\n\tswitch tag {\n\tcase \"\", yaml_STR_TAG, yaml_BOOL_TAG, yaml_INT_TAG, yaml_FLOAT_TAG, yaml_NULL_TAG, yaml_TIMESTAMP_TAG:\n\t\treturn true\n\t}\n\treturn false\n}\n\nvar yamlStyleFloat = regexp.MustCompile(`^[-+]?[0-9]*\\.?[0-9]+([eE][-+][0-9]+)?$`)\n\nfunc resolve(tag string, in string) (rtag string, out interface{}) {\n\tif !resolvableTag(tag) {\n\t\treturn tag, in\n\t}\n\n\tdefer func() {\n\t\tswitch tag {\n\t\tcase \"\", rtag, yaml_STR_TAG, yaml_BINARY_TAG:\n\t\t\treturn\n\t\tcase yaml_FLOAT_TAG:\n\t\t\tif rtag == yaml_INT_TAG {\n\t\t\t\tswitch v := out.(type) {\n\t\t\t\tcase int64:\n\t\t\t\t\trtag = yaml_FLOAT_TAG\n\t\t\t\t\tout = float64(v)\n\t\t\t\t\treturn\n\t\t\t\tcase int:\n\t\t\t\t\trtag = yaml_FLOAT_TAG\n\t\t\t\t\tout = float64(v)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfailf(\"cannot decode %s `%s` as a %s\", shortTag(rtag), in, shortTag(tag))\n\t}()\n\n\t// Any data is accepted as a !!str or !!binary.\n\t// Otherwise, the prefix is enough of a hint about what it might be.\n\thint := byte('N')\n\tif in != \"\" {\n\t\thint = resolveTable[in[0]]\n\t}\n\tif hint != 0 && tag != yaml_STR_TAG && tag != yaml_BINARY_TAG {\n\t\t// Handle things we can lookup in a map.\n\t\tif item, ok := resolveMap[in]; ok {\n\t\t\treturn item.tag, item.value\n\t\t}\n\n\t\t// Base 60 floats are a bad idea, were dropped in YAML 1.2, and\n\t\t// are purposefully unsupported here. They're still quoted on\n\t\t// the way out for compatibility with other parser, though.\n\n\t\tswitch hint {\n\t\tcase 'M':\n\t\t\t// We've already checked the map above.\n\n\t\tcase '.':\n\t\t\t// Not in the map, so maybe a normal float.\n\t\t\tfloatv, err := strconv.ParseFloat(in, 64)\n\t\t\tif err == nil {\n\t\t\t\treturn yaml_FLOAT_TAG, floatv\n\t\t\t}\n\n\t\tcase 'D', 'S':\n\t\t\t// Int, float, or timestamp.\n\t\t\t// Only try values as a timestamp if the value is unquoted or there's an explicit\n\t\t\t// !!timestamp tag.\n\t\t\tif tag == \"\" || tag == yaml_TIMESTAMP_TAG {\n\t\t\t\tt, ok := parseTimestamp(in)\n\t\t\t\tif ok {\n\t\t\t\t\treturn yaml_TIMESTAMP_TAG, t\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tplain := strings.Replace(in, \"_\", \"\", -1)\n\t\t\tintv, err := strconv.ParseInt(plain, 0, 64)\n\t\t\tif err == nil {\n\t\t\t\tif intv == int64(int(intv)) {\n\t\t\t\t\treturn yaml_INT_TAG, int(intv)\n\t\t\t\t} else {\n\t\t\t\t\treturn yaml_INT_TAG, intv\n\t\t\t\t}\n\t\t\t}\n\t\t\tuintv, err := strconv.ParseUint(plain, 0, 64)\n\t\t\tif err == nil {\n\t\t\t\treturn yaml_INT_TAG, uintv\n\t\t\t}\n\t\t\tif yamlStyleFloat.MatchString(plain) {\n\t\t\t\tfloatv, err := strconv.ParseFloat(plain, 64)\n\t\t\t\tif err == nil {\n\t\t\t\t\treturn yaml_FLOAT_TAG, floatv\n\t\t\t\t}\n\t\t\t}\n\t\t\tif strings.HasPrefix(plain, \"0b\") {\n\t\t\t\tintv, err := strconv.ParseInt(plain[2:], 2, 64)\n\t\t\t\tif err == nil {\n\t\t\t\t\tif intv == int64(int(intv)) {\n\t\t\t\t\t\treturn yaml_INT_TAG, int(intv)\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn yaml_INT_TAG, intv\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tuintv, err := strconv.ParseUint(plain[2:], 2, 64)\n\t\t\t\tif err == nil {\n\t\t\t\t\treturn yaml_INT_TAG, uintv\n\t\t\t\t}\n\t\t\t} else if strings.HasPrefix(plain, \"-0b\") {\n\t\t\t\tintv, err := strconv.ParseInt(\"-\" + plain[3:], 2, 64)\n\t\t\t\tif err == nil {\n\t\t\t\t\tif true || intv == int64(int(intv)) {\n\t\t\t\t\t\treturn yaml_INT_TAG, int(intv)\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn yaml_INT_TAG, intv\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tpanic(\"resolveTable item not yet handled: \" + string(rune(hint)) + \" (with \" + in + \")\")\n\t\t}\n\t}\n\treturn yaml_STR_TAG, in\n}\n\n// encodeBase64 encodes s as base64 that is broken up into multiple lines\n// as appropriate for the resulting length.\nfunc encodeBase64(s string) string {\n\tconst lineLen = 70\n\tencLen := base64.StdEncoding.EncodedLen(len(s))\n\tlines := encLen/lineLen + 1\n\tbuf := make([]byte, encLen*2+lines)\n\tin := buf[0:encLen]\n\tout := buf[encLen:]\n\tbase64.StdEncoding.Encode(in, []byte(s))\n\tk := 0\n\tfor i := 0; i < len(in); i += lineLen {\n\t\tj := i + lineLen\n\t\tif j > len(in) {\n\t\t\tj = len(in)\n\t\t}\n\t\tk += copy(out[k:], in[i:j])\n\t\tif lines > 1 {\n\t\t\tout[k] = '\\n'\n\t\t\tk++\n\t\t}\n\t}\n\treturn string(out[:k])\n}\n\n// This is a subset of the formats allowed by the regular expression\n// defined at http://yaml.org/type/timestamp.html.\nvar allowedTimestampFormats = []string{\n\t\"2006-1-2T15:4:5.999999999Z07:00\", // RCF3339Nano with short date fields.\n\t\"2006-1-2t15:4:5.999999999Z07:00\", // RFC3339Nano with short date fields and lower-case \"t\".\n\t\"2006-1-2 15:4:5.999999999\", // space separated with no time zone\n\t\"2006-1-2\", // date only\n\t// Notable exception: time.Parse cannot handle: \"2001-12-14 21:59:43.10 -5\"\n\t// from the set of examples.\n}\n\n// parseTimestamp parses s as a timestamp string and\n// returns the timestamp and reports whether it succeeded.\n// Timestamp formats are defined at http://yaml.org/type/timestamp.html\nfunc parseTimestamp(s string) (time.Time, bool) {\n\t// TODO write code to check all the formats supported by\n\t// http://yaml.org/type/timestamp.html instead of using time.Parse.\n\n\t// Quick check: all date formats start with YYYY-.\n\ti := 0\n\tfor ; i < len(s); i++ {\n\t\tif c := s[i]; c < '0' || c > '9' {\n\t\t\tbreak\n\t\t}\n\t}\n\tif i != 4 || i == len(s) || s[i] != '-' {\n\t\treturn time.Time{}, false\n\t}\n\tfor _, format := range allowedTimestampFormats {\n\t\tif t, err := time.Parse(format, s); err == nil {\n\t\t\treturn t, true\n\t\t}\n\t}\n\treturn time.Time{}, false\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/scannerc.go", "content": "package yaml\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n)\n\n// Introduction\n// ************\n//\n// The following notes assume that you are familiar with the YAML specification\n// (http://yaml.org/spec/1.2/spec.html). We mostly follow it, although in\n// some cases we are less restrictive that it requires.\n//\n// The process of transforming a YAML stream into a sequence of events is\n// divided on two steps: Scanning and Parsing.\n//\n// The Scanner transforms the input stream into a sequence of tokens, while the\n// parser transform the sequence of tokens produced by the Scanner into a\n// sequence of parsing events.\n//\n// The Scanner is rather clever and complicated. The Parser, on the contrary,\n// is a straightforward implementation of a recursive-descendant parser (or,\n// LL(1) parser, as it is usually called).\n//\n// Actually there are two issues of Scanning that might be called \"clever\", the\n// rest is quite straightforward. The issues are \"block collection start\" and\n// \"simple keys\". Both issues are explained below in details.\n//\n// Here the Scanning step is explained and implemented. We start with the list\n// of all the tokens produced by the Scanner together with short descriptions.\n//\n// Now, tokens:\n//\n// STREAM-START(encoding) # The stream start.\n// STREAM-END # The stream end.\n// VERSION-DIRECTIVE(major,minor) # The '%YAML' directive.\n// TAG-DIRECTIVE(handle,prefix) # The '%TAG' directive.\n// DOCUMENT-START # '---'\n// DOCUMENT-END # '...'\n// BLOCK-SEQUENCE-START # Indentation increase denoting a block\n// BLOCK-MAPPING-START # sequence or a block mapping.\n// BLOCK-END # Indentation decrease.\n// FLOW-SEQUENCE-START # '['\n// FLOW-SEQUENCE-END # ']'\n// BLOCK-SEQUENCE-START # '{'\n// BLOCK-SEQUENCE-END # '}'\n// BLOCK-ENTRY # '-'\n// FLOW-ENTRY # ','\n// KEY # '?' or nothing (simple keys).\n// VALUE # ':'\n// ALIAS(anchor) # '*anchor'\n// ANCHOR(anchor) # '&anchor'\n// TAG(handle,suffix) # '!handle!suffix'\n// SCALAR(value,style) # A scalar.\n//\n// The following two tokens are \"virtual\" tokens denoting the beginning and the\n// end of the stream:\n//\n// STREAM-START(encoding)\n// STREAM-END\n//\n// We pass the information about the input stream encoding with the\n// STREAM-START token.\n//\n// The next two tokens are responsible for tags:\n//\n// VERSION-DIRECTIVE(major,minor)\n// TAG-DIRECTIVE(handle,prefix)\n//\n// Example:\n//\n// %YAML 1.1\n// %TAG ! !foo\n// %TAG !yaml! tag:yaml.org,2002:\n// ---\n//\n// The correspoding sequence of tokens:\n//\n// STREAM-START(utf-8)\n// VERSION-DIRECTIVE(1,1)\n// TAG-DIRECTIVE(\"!\",\"!foo\")\n// TAG-DIRECTIVE(\"!yaml\",\"tag:yaml.org,2002:\")\n// DOCUMENT-START\n// STREAM-END\n//\n// Note that the VERSION-DIRECTIVE and TAG-DIRECTIVE tokens occupy a whole\n// line.\n//\n// The document start and end indicators are represented by:\n//\n// DOCUMENT-START\n// DOCUMENT-END\n//\n// Note that if a YAML stream contains an implicit document (without '---'\n// and '...' indicators), no DOCUMENT-START and DOCUMENT-END tokens will be\n// produced.\n//\n// In the following examples, we present whole documents together with the\n// produced tokens.\n//\n// 1. An implicit document:\n//\n// 'a scalar'\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// SCALAR(\"a scalar\",single-quoted)\n// STREAM-END\n//\n// 2. An explicit document:\n//\n// ---\n// 'a scalar'\n// ...\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// DOCUMENT-START\n// SCALAR(\"a scalar\",single-quoted)\n// DOCUMENT-END\n// STREAM-END\n//\n// 3. Several documents in a stream:\n//\n// 'a scalar'\n// ---\n// 'another scalar'\n// ---\n// 'yet another scalar'\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// SCALAR(\"a scalar\",single-quoted)\n// DOCUMENT-START\n// SCALAR(\"another scalar\",single-quoted)\n// DOCUMENT-START\n// SCALAR(\"yet another scalar\",single-quoted)\n// STREAM-END\n//\n// We have already introduced the SCALAR token above. The following tokens are\n// used to describe aliases, anchors, tag, and scalars:\n//\n// ALIAS(anchor)\n// ANCHOR(anchor)\n// TAG(handle,suffix)\n// SCALAR(value,style)\n//\n// The following series of examples illustrate the usage of these tokens:\n//\n// 1. A recursive sequence:\n//\n// &A [ *A ]\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// ANCHOR(\"A\")\n// FLOW-SEQUENCE-START\n// ALIAS(\"A\")\n// FLOW-SEQUENCE-END\n// STREAM-END\n//\n// 2. A tagged scalar:\n//\n// !!float \"3.14\" # A good approximation.\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// TAG(\"!!\",\"float\")\n// SCALAR(\"3.14\",double-quoted)\n// STREAM-END\n//\n// 3. Various scalar styles:\n//\n// --- # Implicit empty plain scalars do not produce tokens.\n// --- a plain scalar\n// --- 'a single-quoted scalar'\n// --- \"a double-quoted scalar\"\n// --- |-\n// a literal scalar\n// --- >-\n// a folded\n// scalar\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// DOCUMENT-START\n// DOCUMENT-START\n// SCALAR(\"a plain scalar\",plain)\n// DOCUMENT-START\n// SCALAR(\"a single-quoted scalar\",single-quoted)\n// DOCUMENT-START\n// SCALAR(\"a double-quoted scalar\",double-quoted)\n// DOCUMENT-START\n// SCALAR(\"a literal scalar\",literal)\n// DOCUMENT-START\n// SCALAR(\"a folded scalar\",folded)\n// STREAM-END\n//\n// Now it's time to review collection-related tokens. We will start with\n// flow collections:\n//\n// FLOW-SEQUENCE-START\n// FLOW-SEQUENCE-END\n// FLOW-MAPPING-START\n// FLOW-MAPPING-END\n// FLOW-ENTRY\n// KEY\n// VALUE\n//\n// The tokens FLOW-SEQUENCE-START, FLOW-SEQUENCE-END, FLOW-MAPPING-START, and\n// FLOW-MAPPING-END represent the indicators '[', ']', '{', and '}'\n// correspondingly. FLOW-ENTRY represent the ',' indicator. Finally the\n// indicators '?' and ':', which are used for denoting mapping keys and values,\n// are represented by the KEY and VALUE tokens.\n//\n// The following examples show flow collections:\n//\n// 1. A flow sequence:\n//\n// [item 1, item 2, item 3]\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// FLOW-SEQUENCE-START\n// SCALAR(\"item 1\",plain)\n// FLOW-ENTRY\n// SCALAR(\"item 2\",plain)\n// FLOW-ENTRY\n// SCALAR(\"item 3\",plain)\n// FLOW-SEQUENCE-END\n// STREAM-END\n//\n// 2. A flow mapping:\n//\n// {\n// a simple key: a value, # Note that the KEY token is produced.\n// ? a complex key: another value,\n// }\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// FLOW-MAPPING-START\n// KEY\n// SCALAR(\"a simple key\",plain)\n// VALUE\n// SCALAR(\"a value\",plain)\n// FLOW-ENTRY\n// KEY\n// SCALAR(\"a complex key\",plain)\n// VALUE\n// SCALAR(\"another value\",plain)\n// FLOW-ENTRY\n// FLOW-MAPPING-END\n// STREAM-END\n//\n// A simple key is a key which is not denoted by the '?' indicator. Note that\n// the Scanner still produce the KEY token whenever it encounters a simple key.\n//\n// For scanning block collections, the following tokens are used (note that we\n// repeat KEY and VALUE here):\n//\n// BLOCK-SEQUENCE-START\n// BLOCK-MAPPING-START\n// BLOCK-END\n// BLOCK-ENTRY\n// KEY\n// VALUE\n//\n// The tokens BLOCK-SEQUENCE-START and BLOCK-MAPPING-START denote indentation\n// increase that precedes a block collection (cf. the INDENT token in Python).\n// The token BLOCK-END denote indentation decrease that ends a block collection\n// (cf. the DEDENT token in Python). However YAML has some syntax pecularities\n// that makes detections of these tokens more complex.\n//\n// The tokens BLOCK-ENTRY, KEY, and VALUE are used to represent the indicators\n// '-', '?', and ':' correspondingly.\n//\n// The following examples show how the tokens BLOCK-SEQUENCE-START,\n// BLOCK-MAPPING-START, and BLOCK-END are emitted by the Scanner:\n//\n// 1. Block sequences:\n//\n// - item 1\n// - item 2\n// -\n// - item 3.1\n// - item 3.2\n// -\n// key 1: value 1\n// key 2: value 2\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// SCALAR(\"item 1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 2\",plain)\n// BLOCK-ENTRY\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// SCALAR(\"item 3.1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 3.2\",plain)\n// BLOCK-END\n// BLOCK-ENTRY\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"key 1\",plain)\n// VALUE\n// SCALAR(\"value 1\",plain)\n// KEY\n// SCALAR(\"key 2\",plain)\n// VALUE\n// SCALAR(\"value 2\",plain)\n// BLOCK-END\n// BLOCK-END\n// STREAM-END\n//\n// 2. Block mappings:\n//\n// a simple key: a value # The KEY token is produced here.\n// ? a complex key\n// : another value\n// a mapping:\n// key 1: value 1\n// key 2: value 2\n// a sequence:\n// - item 1\n// - item 2\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"a simple key\",plain)\n// VALUE\n// SCALAR(\"a value\",plain)\n// KEY\n// SCALAR(\"a complex key\",plain)\n// VALUE\n// SCALAR(\"another value\",plain)\n// KEY\n// SCALAR(\"a mapping\",plain)\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"key 1\",plain)\n// VALUE\n// SCALAR(\"value 1\",plain)\n// KEY\n// SCALAR(\"key 2\",plain)\n// VALUE\n// SCALAR(\"value 2\",plain)\n// BLOCK-END\n// KEY\n// SCALAR(\"a sequence\",plain)\n// VALUE\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// SCALAR(\"item 1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 2\",plain)\n// BLOCK-END\n// BLOCK-END\n// STREAM-END\n//\n// YAML does not always require to start a new block collection from a new\n// line. If the current line contains only '-', '?', and ':' indicators, a new\n// block collection may start at the current line. The following examples\n// illustrate this case:\n//\n// 1. Collections in a sequence:\n//\n// - - item 1\n// - item 2\n// - key 1: value 1\n// key 2: value 2\n// - ? complex key\n// : complex value\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// SCALAR(\"item 1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 2\",plain)\n// BLOCK-END\n// BLOCK-ENTRY\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"key 1\",plain)\n// VALUE\n// SCALAR(\"value 1\",plain)\n// KEY\n// SCALAR(\"key 2\",plain)\n// VALUE\n// SCALAR(\"value 2\",plain)\n// BLOCK-END\n// BLOCK-ENTRY\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"complex key\")\n// VALUE\n// SCALAR(\"complex value\")\n// BLOCK-END\n// BLOCK-END\n// STREAM-END\n//\n// 2. Collections in a mapping:\n//\n// ? a sequence\n// : - item 1\n// - item 2\n// ? a mapping\n// : key 1: value 1\n// key 2: value 2\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"a sequence\",plain)\n// VALUE\n// BLOCK-SEQUENCE-START\n// BLOCK-ENTRY\n// SCALAR(\"item 1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 2\",plain)\n// BLOCK-END\n// KEY\n// SCALAR(\"a mapping\",plain)\n// VALUE\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"key 1\",plain)\n// VALUE\n// SCALAR(\"value 1\",plain)\n// KEY\n// SCALAR(\"key 2\",plain)\n// VALUE\n// SCALAR(\"value 2\",plain)\n// BLOCK-END\n// BLOCK-END\n// STREAM-END\n//\n// YAML also permits non-indented sequences if they are included into a block\n// mapping. In this case, the token BLOCK-SEQUENCE-START is not produced:\n//\n// key:\n// - item 1 # BLOCK-SEQUENCE-START is NOT produced here.\n// - item 2\n//\n// Tokens:\n//\n// STREAM-START(utf-8)\n// BLOCK-MAPPING-START\n// KEY\n// SCALAR(\"key\",plain)\n// VALUE\n// BLOCK-ENTRY\n// SCALAR(\"item 1\",plain)\n// BLOCK-ENTRY\n// SCALAR(\"item 2\",plain)\n// BLOCK-END\n//\n\n// Ensure that the buffer contains the required number of characters.\n// Return true on success, false on failure (reader error or memory error).\nfunc cache(parser *yaml_parser_t, length int) bool {\n\t// [Go] This was inlined: !cache(A, B) -> unread < B && !update(A, B)\n\treturn parser.unread >= length || yaml_parser_update_buffer(parser, length)\n}\n\n// Advance the buffer pointer.\nfunc skip(parser *yaml_parser_t) {\n\tparser.mark.index++\n\tparser.mark.column++\n\tparser.unread--\n\tparser.buffer_pos += width(parser.buffer[parser.buffer_pos])\n}\n\nfunc skip_line(parser *yaml_parser_t) {\n\tif is_crlf(parser.buffer, parser.buffer_pos) {\n\t\tparser.mark.index += 2\n\t\tparser.mark.column = 0\n\t\tparser.mark.line++\n\t\tparser.unread -= 2\n\t\tparser.buffer_pos += 2\n\t} else if is_break(parser.buffer, parser.buffer_pos) {\n\t\tparser.mark.index++\n\t\tparser.mark.column = 0\n\t\tparser.mark.line++\n\t\tparser.unread--\n\t\tparser.buffer_pos += width(parser.buffer[parser.buffer_pos])\n\t}\n}\n\n// Copy a character to a string buffer and advance pointers.\nfunc read(parser *yaml_parser_t, s []byte) []byte {\n\tw := width(parser.buffer[parser.buffer_pos])\n\tif w == 0 {\n\t\tpanic(\"invalid character sequence\")\n\t}\n\tif len(s) == 0 {\n\t\ts = make([]byte, 0, 32)\n\t}\n\tif w == 1 && len(s)+w <= cap(s) {\n\t\ts = s[:len(s)+1]\n\t\ts[len(s)-1] = parser.buffer[parser.buffer_pos]\n\t\tparser.buffer_pos++\n\t} else {\n\t\ts = append(s, parser.buffer[parser.buffer_pos:parser.buffer_pos+w]...)\n\t\tparser.buffer_pos += w\n\t}\n\tparser.mark.index++\n\tparser.mark.column++\n\tparser.unread--\n\treturn s\n}\n\n// Copy a line break character to a string buffer and advance pointers.\nfunc read_line(parser *yaml_parser_t, s []byte) []byte {\n\tbuf := parser.buffer\n\tpos := parser.buffer_pos\n\tswitch {\n\tcase buf[pos] == '\\r' && buf[pos+1] == '\\n':\n\t\t// CR LF . LF\n\t\ts = append(s, '\\n')\n\t\tparser.buffer_pos += 2\n\t\tparser.mark.index++\n\t\tparser.unread--\n\tcase buf[pos] == '\\r' || buf[pos] == '\\n':\n\t\t// CR|LF . LF\n\t\ts = append(s, '\\n')\n\t\tparser.buffer_pos += 1\n\tcase buf[pos] == '\\xC2' && buf[pos+1] == '\\x85':\n\t\t// NEL . LF\n\t\ts = append(s, '\\n')\n\t\tparser.buffer_pos += 2\n\tcase buf[pos] == '\\xE2' && buf[pos+1] == '\\x80' && (buf[pos+2] == '\\xA8' || buf[pos+2] == '\\xA9'):\n\t\t// LS|PS . LS|PS\n\t\ts = append(s, buf[parser.buffer_pos:pos+3]...)\n\t\tparser.buffer_pos += 3\n\tdefault:\n\t\treturn s\n\t}\n\tparser.mark.index++\n\tparser.mark.column = 0\n\tparser.mark.line++\n\tparser.unread--\n\treturn s\n}\n\n// Get the next token.\nfunc yaml_parser_scan(parser *yaml_parser_t, token *yaml_token_t) bool {\n\t// Erase the token object.\n\t*token = yaml_token_t{} // [Go] Is this necessary?\n\n\t// No tokens after STREAM-END or error.\n\tif parser.stream_end_produced || parser.error != yaml_NO_ERROR {\n\t\treturn true\n\t}\n\n\t// Ensure that the tokens queue contains enough tokens.\n\tif !parser.token_available {\n\t\tif !yaml_parser_fetch_more_tokens(parser) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Fetch the next token from the queue.\n\t*token = parser.tokens[parser.tokens_head]\n\tparser.tokens_head++\n\tparser.tokens_parsed++\n\tparser.token_available = false\n\n\tif token.typ == yaml_STREAM_END_TOKEN {\n\t\tparser.stream_end_produced = true\n\t}\n\treturn true\n}\n\n// Set the scanner error and return false.\nfunc yaml_parser_set_scanner_error(parser *yaml_parser_t, context string, context_mark yaml_mark_t, problem string) bool {\n\tparser.error = yaml_SCANNER_ERROR\n\tparser.context = context\n\tparser.context_mark = context_mark\n\tparser.problem = problem\n\tparser.problem_mark = parser.mark\n\treturn false\n}\n\nfunc yaml_parser_set_scanner_tag_error(parser *yaml_parser_t, directive bool, context_mark yaml_mark_t, problem string) bool {\n\tcontext := \"while parsing a tag\"\n\tif directive {\n\t\tcontext = \"while parsing a %TAG directive\"\n\t}\n\treturn yaml_parser_set_scanner_error(parser, context, context_mark, problem)\n}\n\nfunc trace(args ...interface{}) func() {\n\tpargs := append([]interface{}{\"+++\"}, args...)\n\tfmt.Println(pargs...)\n\tpargs = append([]interface{}{\"---\"}, args...)\n\treturn func() { fmt.Println(pargs...) }\n}\n\n// Ensure that the tokens queue contains at least one token which can be\n// returned to the Parser.\nfunc yaml_parser_fetch_more_tokens(parser *yaml_parser_t) bool {\n\t// While we need more tokens to fetch, do it.\n\tfor {\n\t\t// Check if we really need to fetch more tokens.\n\t\tneed_more_tokens := false\n\n\t\tif parser.tokens_head == len(parser.tokens) {\n\t\t\t// Queue is empty.\n\t\t\tneed_more_tokens = true\n\t\t} else {\n\t\t\t// Check if any potential simple key may occupy the head position.\n\t\t\tif !yaml_parser_stale_simple_keys(parser) {\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tfor i := range parser.simple_keys {\n\t\t\t\tsimple_key := &parser.simple_keys[i]\n\t\t\t\tif simple_key.possible && simple_key.token_number == parser.tokens_parsed {\n\t\t\t\t\tneed_more_tokens = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// We are finished.\n\t\tif !need_more_tokens {\n\t\t\tbreak\n\t\t}\n\t\t// Fetch the next token.\n\t\tif !yaml_parser_fetch_next_token(parser) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tparser.token_available = true\n\treturn true\n}\n\n// The dispatcher for token fetchers.\nfunc yaml_parser_fetch_next_token(parser *yaml_parser_t) bool {\n\t// Ensure that the buffer is initialized.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\t// Check if we just started scanning. Fetch STREAM-START then.\n\tif !parser.stream_start_produced {\n\t\treturn yaml_parser_fetch_stream_start(parser)\n\t}\n\n\t// Eat whitespaces and comments until we reach the next token.\n\tif !yaml_parser_scan_to_next_token(parser) {\n\t\treturn false\n\t}\n\n\t// Remove obsolete potential simple keys.\n\tif !yaml_parser_stale_simple_keys(parser) {\n\t\treturn false\n\t}\n\n\t// Check the indentation level against the current column.\n\tif !yaml_parser_unroll_indent(parser, parser.mark.column) {\n\t\treturn false\n\t}\n\n\t// Ensure that the buffer contains at least 4 characters. 4 is the length\n\t// of the longest indicators ('--- ' and '... ').\n\tif parser.unread < 4 && !yaml_parser_update_buffer(parser, 4) {\n\t\treturn false\n\t}\n\n\t// Is it the end of the stream?\n\tif is_z(parser.buffer, parser.buffer_pos) {\n\t\treturn yaml_parser_fetch_stream_end(parser)\n\t}\n\n\t// Is it a directive?\n\tif parser.mark.column == 0 && parser.buffer[parser.buffer_pos] == '%' {\n\t\treturn yaml_parser_fetch_directive(parser)\n\t}\n\n\tbuf := parser.buffer\n\tpos := parser.buffer_pos\n\n\t// Is it the document start indicator?\n\tif parser.mark.column == 0 && buf[pos] == '-' && buf[pos+1] == '-' && buf[pos+2] == '-' && is_blankz(buf, pos+3) {\n\t\treturn yaml_parser_fetch_document_indicator(parser, yaml_DOCUMENT_START_TOKEN)\n\t}\n\n\t// Is it the document end indicator?\n\tif parser.mark.column == 0 && buf[pos] == '.' && buf[pos+1] == '.' && buf[pos+2] == '.' && is_blankz(buf, pos+3) {\n\t\treturn yaml_parser_fetch_document_indicator(parser, yaml_DOCUMENT_END_TOKEN)\n\t}\n\n\t// Is it the flow sequence start indicator?\n\tif buf[pos] == '[' {\n\t\treturn yaml_parser_fetch_flow_collection_start(parser, yaml_FLOW_SEQUENCE_START_TOKEN)\n\t}\n\n\t// Is it the flow mapping start indicator?\n\tif parser.buffer[parser.buffer_pos] == '{' {\n\t\treturn yaml_parser_fetch_flow_collection_start(parser, yaml_FLOW_MAPPING_START_TOKEN)\n\t}\n\n\t// Is it the flow sequence end indicator?\n\tif parser.buffer[parser.buffer_pos] == ']' {\n\t\treturn yaml_parser_fetch_flow_collection_end(parser,\n\t\t\tyaml_FLOW_SEQUENCE_END_TOKEN)\n\t}\n\n\t// Is it the flow mapping end indicator?\n\tif parser.buffer[parser.buffer_pos] == '}' {\n\t\treturn yaml_parser_fetch_flow_collection_end(parser,\n\t\t\tyaml_FLOW_MAPPING_END_TOKEN)\n\t}\n\n\t// Is it the flow entry indicator?\n\tif parser.buffer[parser.buffer_pos] == ',' {\n\t\treturn yaml_parser_fetch_flow_entry(parser)\n\t}\n\n\t// Is it the block entry indicator?\n\tif parser.buffer[parser.buffer_pos] == '-' && is_blankz(parser.buffer, parser.buffer_pos+1) {\n\t\treturn yaml_parser_fetch_block_entry(parser)\n\t}\n\n\t// Is it the key indicator?\n\tif parser.buffer[parser.buffer_pos] == '?' && (parser.flow_level > 0 || is_blankz(parser.buffer, parser.buffer_pos+1)) {\n\t\treturn yaml_parser_fetch_key(parser)\n\t}\n\n\t// Is it the value indicator?\n\tif parser.buffer[parser.buffer_pos] == ':' && (parser.flow_level > 0 || is_blankz(parser.buffer, parser.buffer_pos+1)) {\n\t\treturn yaml_parser_fetch_value(parser)\n\t}\n\n\t// Is it an alias?\n\tif parser.buffer[parser.buffer_pos] == '*' {\n\t\treturn yaml_parser_fetch_anchor(parser, yaml_ALIAS_TOKEN)\n\t}\n\n\t// Is it an anchor?\n\tif parser.buffer[parser.buffer_pos] == '&' {\n\t\treturn yaml_parser_fetch_anchor(parser, yaml_ANCHOR_TOKEN)\n\t}\n\n\t// Is it a tag?\n\tif parser.buffer[parser.buffer_pos] == '!' {\n\t\treturn yaml_parser_fetch_tag(parser)\n\t}\n\n\t// Is it a literal scalar?\n\tif parser.buffer[parser.buffer_pos] == '|' && parser.flow_level == 0 {\n\t\treturn yaml_parser_fetch_block_scalar(parser, true)\n\t}\n\n\t// Is it a folded scalar?\n\tif parser.buffer[parser.buffer_pos] == '>' && parser.flow_level == 0 {\n\t\treturn yaml_parser_fetch_block_scalar(parser, false)\n\t}\n\n\t// Is it a single-quoted scalar?\n\tif parser.buffer[parser.buffer_pos] == '\\'' {\n\t\treturn yaml_parser_fetch_flow_scalar(parser, true)\n\t}\n\n\t// Is it a double-quoted scalar?\n\tif parser.buffer[parser.buffer_pos] == '\"' {\n\t\treturn yaml_parser_fetch_flow_scalar(parser, false)\n\t}\n\n\t// Is it a plain scalar?\n\t//\n\t// A plain scalar may start with any non-blank characters except\n\t//\n\t// '-', '?', ':', ',', '[', ']', '{', '}',\n\t// '#', '&', '*', '!', '|', '>', '\\'', '\\\"',\n\t// '%', '@', '`'.\n\t//\n\t// In the block context (and, for the '-' indicator, in the flow context\n\t// too), it may also start with the characters\n\t//\n\t// '-', '?', ':'\n\t//\n\t// if it is followed by a non-space character.\n\t//\n\t// The last rule is more restrictive than the specification requires.\n\t// [Go] Make this logic more reasonable.\n\t//switch parser.buffer[parser.buffer_pos] {\n\t//case '-', '?', ':', ',', '?', '-', ',', ':', ']', '[', '}', '{', '&', '#', '!', '*', '>', '|', '\"', '\\'', '@', '%', '-', '`':\n\t//}\n\tif !(is_blankz(parser.buffer, parser.buffer_pos) || parser.buffer[parser.buffer_pos] == '-' ||\n\t\tparser.buffer[parser.buffer_pos] == '?' || parser.buffer[parser.buffer_pos] == ':' ||\n\t\tparser.buffer[parser.buffer_pos] == ',' || parser.buffer[parser.buffer_pos] == '[' ||\n\t\tparser.buffer[parser.buffer_pos] == ']' || parser.buffer[parser.buffer_pos] == '{' ||\n\t\tparser.buffer[parser.buffer_pos] == '}' || parser.buffer[parser.buffer_pos] == '#' ||\n\t\tparser.buffer[parser.buffer_pos] == '&' || parser.buffer[parser.buffer_pos] == '*' ||\n\t\tparser.buffer[parser.buffer_pos] == '!' || parser.buffer[parser.buffer_pos] == '|' ||\n\t\tparser.buffer[parser.buffer_pos] == '>' || parser.buffer[parser.buffer_pos] == '\\'' ||\n\t\tparser.buffer[parser.buffer_pos] == '\"' || parser.buffer[parser.buffer_pos] == '%' ||\n\t\tparser.buffer[parser.buffer_pos] == '@' || parser.buffer[parser.buffer_pos] == '`') ||\n\t\t(parser.buffer[parser.buffer_pos] == '-' && !is_blank(parser.buffer, parser.buffer_pos+1)) ||\n\t\t(parser.flow_level == 0 &&\n\t\t\t(parser.buffer[parser.buffer_pos] == '?' || parser.buffer[parser.buffer_pos] == ':') &&\n\t\t\t!is_blankz(parser.buffer, parser.buffer_pos+1)) {\n\t\treturn yaml_parser_fetch_plain_scalar(parser)\n\t}\n\n\t// If we don't determine the token type so far, it is an error.\n\treturn yaml_parser_set_scanner_error(parser,\n\t\t\"while scanning for the next token\", parser.mark,\n\t\t\"found character that cannot start any token\")\n}\n\n// Check the list of potential simple keys and remove the positions that\n// cannot contain simple keys anymore.\nfunc yaml_parser_stale_simple_keys(parser *yaml_parser_t) bool {\n\t// Check for a potential simple key for each flow level.\n\tfor i := range parser.simple_keys {\n\t\tsimple_key := &parser.simple_keys[i]\n\n\t\t// The specification requires that a simple key\n\t\t//\n\t\t// - is limited to a single line,\n\t\t// - is shorter than 1024 characters.\n\t\tif simple_key.possible && (simple_key.mark.line < parser.mark.line || simple_key.mark.index+1024 < parser.mark.index) {\n\n\t\t\t// Check if the potential simple key to be removed is required.\n\t\t\tif simple_key.required {\n\t\t\t\treturn yaml_parser_set_scanner_error(parser,\n\t\t\t\t\t\"while scanning a simple key\", simple_key.mark,\n\t\t\t\t\t\"could not find expected ':'\")\n\t\t\t}\n\t\t\tsimple_key.possible = false\n\t\t}\n\t}\n\treturn true\n}\n\n// Check if a simple key may start at the current position and add it if\n// needed.\nfunc yaml_parser_save_simple_key(parser *yaml_parser_t) bool {\n\t// A simple key is required at the current position if the scanner is in\n\t// the block context and the current column coincides with the indentation\n\t// level.\n\n\trequired := parser.flow_level == 0 && parser.indent == parser.mark.column\n\n\t//\n\t// If the current position may start a simple key, save it.\n\t//\n\tif parser.simple_key_allowed {\n\t\tsimple_key := yaml_simple_key_t{\n\t\t\tpossible: true,\n\t\t\trequired: required,\n\t\t\ttoken_number: parser.tokens_parsed + (len(parser.tokens) - parser.tokens_head),\n\t\t}\n\t\tsimple_key.mark = parser.mark\n\n\t\tif !yaml_parser_remove_simple_key(parser) {\n\t\t\treturn false\n\t\t}\n\t\tparser.simple_keys[len(parser.simple_keys)-1] = simple_key\n\t}\n\treturn true\n}\n\n// Remove a potential simple key at the current flow level.\nfunc yaml_parser_remove_simple_key(parser *yaml_parser_t) bool {\n\ti := len(parser.simple_keys) - 1\n\tif parser.simple_keys[i].possible {\n\t\t// If the key is required, it is an error.\n\t\tif parser.simple_keys[i].required {\n\t\t\treturn yaml_parser_set_scanner_error(parser,\n\t\t\t\t\"while scanning a simple key\", parser.simple_keys[i].mark,\n\t\t\t\t\"could not find expected ':'\")\n\t\t}\n\t}\n\t// Remove the key from the stack.\n\tparser.simple_keys[i].possible = false\n\treturn true\n}\n\n// Increase the flow level and resize the simple key list if needed.\nfunc yaml_parser_increase_flow_level(parser *yaml_parser_t) bool {\n\t// Reset the simple key on the next level.\n\tparser.simple_keys = append(parser.simple_keys, yaml_simple_key_t{})\n\n\t// Increase the flow level.\n\tparser.flow_level++\n\treturn true\n}\n\n// Decrease the flow level.\nfunc yaml_parser_decrease_flow_level(parser *yaml_parser_t) bool {\n\tif parser.flow_level > 0 {\n\t\tparser.flow_level--\n\t\tparser.simple_keys = parser.simple_keys[:len(parser.simple_keys)-1]\n\t}\n\treturn true\n}\n\n// Push the current indentation level to the stack and set the new level\n// the current column is greater than the indentation level. In this case,\n// append or insert the specified token into the token queue.\nfunc yaml_parser_roll_indent(parser *yaml_parser_t, column, number int, typ yaml_token_type_t, mark yaml_mark_t) bool {\n\t// In the flow context, do nothing.\n\tif parser.flow_level > 0 {\n\t\treturn true\n\t}\n\n\tif parser.indent < column {\n\t\t// Push the current indentation level to the stack and set the new\n\t\t// indentation level.\n\t\tparser.indents = append(parser.indents, parser.indent)\n\t\tparser.indent = column\n\n\t\t// Create a token and insert it into the queue.\n\t\ttoken := yaml_token_t{\n\t\t\ttyp: typ,\n\t\t\tstart_mark: mark,\n\t\t\tend_mark: mark,\n\t\t}\n\t\tif number > -1 {\n\t\t\tnumber -= parser.tokens_parsed\n\t\t}\n\t\tyaml_insert_token(parser, number, &token)\n\t}\n\treturn true\n}\n\n// Pop indentation levels from the indents stack until the current level\n// becomes less or equal to the column. For each indentation level, append\n// the BLOCK-END token.\nfunc yaml_parser_unroll_indent(parser *yaml_parser_t, column int) bool {\n\t// In the flow context, do nothing.\n\tif parser.flow_level > 0 {\n\t\treturn true\n\t}\n\n\t// Loop through the indentation levels in the stack.\n\tfor parser.indent > column {\n\t\t// Create a token and append it to the queue.\n\t\ttoken := yaml_token_t{\n\t\t\ttyp: yaml_BLOCK_END_TOKEN,\n\t\t\tstart_mark: parser.mark,\n\t\t\tend_mark: parser.mark,\n\t\t}\n\t\tyaml_insert_token(parser, -1, &token)\n\n\t\t// Pop the indentation level.\n\t\tparser.indent = parser.indents[len(parser.indents)-1]\n\t\tparser.indents = parser.indents[:len(parser.indents)-1]\n\t}\n\treturn true\n}\n\n// Initialize the scanner and produce the STREAM-START token.\nfunc yaml_parser_fetch_stream_start(parser *yaml_parser_t) bool {\n\n\t// Set the initial indentation.\n\tparser.indent = -1\n\n\t// Initialize the simple key stack.\n\tparser.simple_keys = append(parser.simple_keys, yaml_simple_key_t{})\n\n\t// A simple key is allowed at the beginning of the stream.\n\tparser.simple_key_allowed = true\n\n\t// We have started.\n\tparser.stream_start_produced = true\n\n\t// Create the STREAM-START token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_STREAM_START_TOKEN,\n\t\tstart_mark: parser.mark,\n\t\tend_mark: parser.mark,\n\t\tencoding: parser.encoding,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the STREAM-END token and shut down the scanner.\nfunc yaml_parser_fetch_stream_end(parser *yaml_parser_t) bool {\n\n\t// Force new line.\n\tif parser.mark.column != 0 {\n\t\tparser.mark.column = 0\n\t\tparser.mark.line++\n\t}\n\n\t// Reset the indentation level.\n\tif !yaml_parser_unroll_indent(parser, -1) {\n\t\treturn false\n\t}\n\n\t// Reset simple keys.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\tparser.simple_key_allowed = false\n\n\t// Create the STREAM-END token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_STREAM_END_TOKEN,\n\t\tstart_mark: parser.mark,\n\t\tend_mark: parser.mark,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce a VERSION-DIRECTIVE or TAG-DIRECTIVE token.\nfunc yaml_parser_fetch_directive(parser *yaml_parser_t) bool {\n\t// Reset the indentation level.\n\tif !yaml_parser_unroll_indent(parser, -1) {\n\t\treturn false\n\t}\n\n\t// Reset simple keys.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\tparser.simple_key_allowed = false\n\n\t// Create the YAML-DIRECTIVE or TAG-DIRECTIVE token.\n\ttoken := yaml_token_t{}\n\tif !yaml_parser_scan_directive(parser, &token) {\n\t\treturn false\n\t}\n\t// Append the token to the queue.\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the DOCUMENT-START or DOCUMENT-END token.\nfunc yaml_parser_fetch_document_indicator(parser *yaml_parser_t, typ yaml_token_type_t) bool {\n\t// Reset the indentation level.\n\tif !yaml_parser_unroll_indent(parser, -1) {\n\t\treturn false\n\t}\n\n\t// Reset simple keys.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\tparser.simple_key_allowed = false\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\n\tskip(parser)\n\tskip(parser)\n\tskip(parser)\n\n\tend_mark := parser.mark\n\n\t// Create the DOCUMENT-START or DOCUMENT-END token.\n\ttoken := yaml_token_t{\n\t\ttyp: typ,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\t// Append the token to the queue.\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the FLOW-SEQUENCE-START or FLOW-MAPPING-START token.\nfunc yaml_parser_fetch_flow_collection_start(parser *yaml_parser_t, typ yaml_token_type_t) bool {\n\t// The indicators '[' and '{' may start a simple key.\n\tif !yaml_parser_save_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// Increase the flow level.\n\tif !yaml_parser_increase_flow_level(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key may follow the indicators '[' and '{'.\n\tparser.simple_key_allowed = true\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the FLOW-SEQUENCE-START of FLOW-MAPPING-START token.\n\ttoken := yaml_token_t{\n\t\ttyp: typ,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\t// Append the token to the queue.\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the FLOW-SEQUENCE-END or FLOW-MAPPING-END token.\nfunc yaml_parser_fetch_flow_collection_end(parser *yaml_parser_t, typ yaml_token_type_t) bool {\n\t// Reset any potential simple key on the current flow level.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// Decrease the flow level.\n\tif !yaml_parser_decrease_flow_level(parser) {\n\t\treturn false\n\t}\n\n\t// No simple keys after the indicators ']' and '}'.\n\tparser.simple_key_allowed = false\n\n\t// Consume the token.\n\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the FLOW-SEQUENCE-END of FLOW-MAPPING-END token.\n\ttoken := yaml_token_t{\n\t\ttyp: typ,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\t// Append the token to the queue.\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the FLOW-ENTRY token.\nfunc yaml_parser_fetch_flow_entry(parser *yaml_parser_t) bool {\n\t// Reset any potential simple keys on the current flow level.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// Simple keys are allowed after ','.\n\tparser.simple_key_allowed = true\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the FLOW-ENTRY token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_FLOW_ENTRY_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the BLOCK-ENTRY token.\nfunc yaml_parser_fetch_block_entry(parser *yaml_parser_t) bool {\n\t// Check if the scanner is in the block context.\n\tif parser.flow_level == 0 {\n\t\t// Check if we are allowed to start a new entry.\n\t\tif !parser.simple_key_allowed {\n\t\t\treturn yaml_parser_set_scanner_error(parser, \"\", parser.mark,\n\t\t\t\t\"block sequence entries are not allowed in this context\")\n\t\t}\n\t\t// Add the BLOCK-SEQUENCE-START token if needed.\n\t\tif !yaml_parser_roll_indent(parser, parser.mark.column, -1, yaml_BLOCK_SEQUENCE_START_TOKEN, parser.mark) {\n\t\t\treturn false\n\t\t}\n\t} else {\n\t\t// It is an error for the '-' indicator to occur in the flow context,\n\t\t// but we let the Parser detect and report about it because the Parser\n\t\t// is able to point to the context.\n\t}\n\n\t// Reset any potential simple keys on the current flow level.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// Simple keys are allowed after '-'.\n\tparser.simple_key_allowed = true\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the BLOCK-ENTRY token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_BLOCK_ENTRY_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the KEY token.\nfunc yaml_parser_fetch_key(parser *yaml_parser_t) bool {\n\n\t// In the block context, additional checks are required.\n\tif parser.flow_level == 0 {\n\t\t// Check if we are allowed to start a new key (not nessesary simple).\n\t\tif !parser.simple_key_allowed {\n\t\t\treturn yaml_parser_set_scanner_error(parser, \"\", parser.mark,\n\t\t\t\t\"mapping keys are not allowed in this context\")\n\t\t}\n\t\t// Add the BLOCK-MAPPING-START token if needed.\n\t\tif !yaml_parser_roll_indent(parser, parser.mark.column, -1, yaml_BLOCK_MAPPING_START_TOKEN, parser.mark) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Reset any potential simple keys on the current flow level.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// Simple keys are allowed after '?' in the block context.\n\tparser.simple_key_allowed = parser.flow_level == 0\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the KEY token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_KEY_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the VALUE token.\nfunc yaml_parser_fetch_value(parser *yaml_parser_t) bool {\n\n\tsimple_key := &parser.simple_keys[len(parser.simple_keys)-1]\n\n\t// Have we found a simple key?\n\tif simple_key.possible {\n\t\t// Create the KEY token and insert it into the queue.\n\t\ttoken := yaml_token_t{\n\t\t\ttyp: yaml_KEY_TOKEN,\n\t\t\tstart_mark: simple_key.mark,\n\t\t\tend_mark: simple_key.mark,\n\t\t}\n\t\tyaml_insert_token(parser, simple_key.token_number-parser.tokens_parsed, &token)\n\n\t\t// In the block context, we may need to add the BLOCK-MAPPING-START token.\n\t\tif !yaml_parser_roll_indent(parser, simple_key.mark.column,\n\t\t\tsimple_key.token_number,\n\t\t\tyaml_BLOCK_MAPPING_START_TOKEN, simple_key.mark) {\n\t\t\treturn false\n\t\t}\n\n\t\t// Remove the simple key.\n\t\tsimple_key.possible = false\n\n\t\t// A simple key cannot follow another simple key.\n\t\tparser.simple_key_allowed = false\n\n\t} else {\n\t\t// The ':' indicator follows a complex key.\n\n\t\t// In the block context, extra checks are required.\n\t\tif parser.flow_level == 0 {\n\n\t\t\t// Check if we are allowed to start a complex value.\n\t\t\tif !parser.simple_key_allowed {\n\t\t\t\treturn yaml_parser_set_scanner_error(parser, \"\", parser.mark,\n\t\t\t\t\t\"mapping values are not allowed in this context\")\n\t\t\t}\n\n\t\t\t// Add the BLOCK-MAPPING-START token if needed.\n\t\t\tif !yaml_parser_roll_indent(parser, parser.mark.column, -1, yaml_BLOCK_MAPPING_START_TOKEN, parser.mark) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Simple keys after ':' are allowed in the block context.\n\t\tparser.simple_key_allowed = parser.flow_level == 0\n\t}\n\n\t// Consume the token.\n\tstart_mark := parser.mark\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create the VALUE token and append it to the queue.\n\ttoken := yaml_token_t{\n\t\ttyp: yaml_VALUE_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the ALIAS or ANCHOR token.\nfunc yaml_parser_fetch_anchor(parser *yaml_parser_t, typ yaml_token_type_t) bool {\n\t// An anchor or an alias could be a simple key.\n\tif !yaml_parser_save_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key cannot follow an anchor or an alias.\n\tparser.simple_key_allowed = false\n\n\t// Create the ALIAS or ANCHOR token and append it to the queue.\n\tvar token yaml_token_t\n\tif !yaml_parser_scan_anchor(parser, &token, typ) {\n\t\treturn false\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the TAG token.\nfunc yaml_parser_fetch_tag(parser *yaml_parser_t) bool {\n\t// A tag could be a simple key.\n\tif !yaml_parser_save_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key cannot follow a tag.\n\tparser.simple_key_allowed = false\n\n\t// Create the TAG token and append it to the queue.\n\tvar token yaml_token_t\n\tif !yaml_parser_scan_tag(parser, &token) {\n\t\treturn false\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the SCALAR(...,literal) or SCALAR(...,folded) tokens.\nfunc yaml_parser_fetch_block_scalar(parser *yaml_parser_t, literal bool) bool {\n\t// Remove any potential simple keys.\n\tif !yaml_parser_remove_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key may follow a block scalar.\n\tparser.simple_key_allowed = true\n\n\t// Create the SCALAR token and append it to the queue.\n\tvar token yaml_token_t\n\tif !yaml_parser_scan_block_scalar(parser, &token, literal) {\n\t\treturn false\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the SCALAR(...,single-quoted) or SCALAR(...,double-quoted) tokens.\nfunc yaml_parser_fetch_flow_scalar(parser *yaml_parser_t, single bool) bool {\n\t// A plain scalar could be a simple key.\n\tif !yaml_parser_save_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key cannot follow a flow scalar.\n\tparser.simple_key_allowed = false\n\n\t// Create the SCALAR token and append it to the queue.\n\tvar token yaml_token_t\n\tif !yaml_parser_scan_flow_scalar(parser, &token, single) {\n\t\treturn false\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Produce the SCALAR(...,plain) token.\nfunc yaml_parser_fetch_plain_scalar(parser *yaml_parser_t) bool {\n\t// A plain scalar could be a simple key.\n\tif !yaml_parser_save_simple_key(parser) {\n\t\treturn false\n\t}\n\n\t// A simple key cannot follow a flow scalar.\n\tparser.simple_key_allowed = false\n\n\t// Create the SCALAR token and append it to the queue.\n\tvar token yaml_token_t\n\tif !yaml_parser_scan_plain_scalar(parser, &token) {\n\t\treturn false\n\t}\n\tyaml_insert_token(parser, -1, &token)\n\treturn true\n}\n\n// Eat whitespaces and comments until the next token is found.\nfunc yaml_parser_scan_to_next_token(parser *yaml_parser_t) bool {\n\n\t// Until the next token is not found.\n\tfor {\n\t\t// Allow the BOM mark to start a line.\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t\tif parser.mark.column == 0 && is_bom(parser.buffer, parser.buffer_pos) {\n\t\t\tskip(parser)\n\t\t}\n\n\t\t// Eat whitespaces.\n\t\t// Tabs are allowed:\n\t\t// - in the flow context\n\t\t// - in the block context, but not at the beginning of the line or\n\t\t// after '-', '?', or ':' (complex value).\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\n\t\tfor parser.buffer[parser.buffer_pos] == ' ' || ((parser.flow_level > 0 || !parser.simple_key_allowed) && parser.buffer[parser.buffer_pos] == '\\t') {\n\t\t\tskip(parser)\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Eat a comment until a line break.\n\t\tif parser.buffer[parser.buffer_pos] == '#' {\n\t\t\tfor !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\t\t\tskip(parser)\n\t\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// If it is a line break, eat it.\n\t\tif is_break(parser.buffer, parser.buffer_pos) {\n\t\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tskip_line(parser)\n\n\t\t\t// In the block context, a new line may start a simple key.\n\t\t\tif parser.flow_level == 0 {\n\t\t\t\tparser.simple_key_allowed = true\n\t\t\t}\n\t\t} else {\n\t\t\tbreak // We have found a token.\n\t\t}\n\t}\n\n\treturn true\n}\n\n// Scan a YAML-DIRECTIVE or TAG-DIRECTIVE token.\n//\n// Scope:\n// %YAML 1.1 # a comment \\n\n// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n// %TAG !yaml! tag:yaml.org,2002: \\n\n// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n//\nfunc yaml_parser_scan_directive(parser *yaml_parser_t, token *yaml_token_t) bool {\n\t// Eat '%'.\n\tstart_mark := parser.mark\n\tskip(parser)\n\n\t// Scan the directive name.\n\tvar name []byte\n\tif !yaml_parser_scan_directive_name(parser, start_mark, &name) {\n\t\treturn false\n\t}\n\n\t// Is it a YAML directive?\n\tif bytes.Equal(name, []byte(\"YAML\")) {\n\t\t// Scan the VERSION directive value.\n\t\tvar major, minor int8\n\t\tif !yaml_parser_scan_version_directive_value(parser, start_mark, &major, &minor) {\n\t\t\treturn false\n\t\t}\n\t\tend_mark := parser.mark\n\n\t\t// Create a VERSION-DIRECTIVE token.\n\t\t*token = yaml_token_t{\n\t\t\ttyp: yaml_VERSION_DIRECTIVE_TOKEN,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tmajor: major,\n\t\t\tminor: minor,\n\t\t}\n\n\t\t// Is it a TAG directive?\n\t} else if bytes.Equal(name, []byte(\"TAG\")) {\n\t\t// Scan the TAG directive value.\n\t\tvar handle, prefix []byte\n\t\tif !yaml_parser_scan_tag_directive_value(parser, start_mark, &handle, &prefix) {\n\t\t\treturn false\n\t\t}\n\t\tend_mark := parser.mark\n\n\t\t// Create a TAG-DIRECTIVE token.\n\t\t*token = yaml_token_t{\n\t\t\ttyp: yaml_TAG_DIRECTIVE_TOKEN,\n\t\t\tstart_mark: start_mark,\n\t\t\tend_mark: end_mark,\n\t\t\tvalue: handle,\n\t\t\tprefix: prefix,\n\t\t}\n\n\t\t// Unknown directive.\n\t} else {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a directive\",\n\t\t\tstart_mark, \"found unknown directive name\")\n\t\treturn false\n\t}\n\n\t// Eat the rest of the line including any comments.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\tfor is_blank(parser.buffer, parser.buffer_pos) {\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tif parser.buffer[parser.buffer_pos] == '#' {\n\t\tfor !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\t\tskip(parser)\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\n\t// Check if we are at the end of the line.\n\tif !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a directive\",\n\t\t\tstart_mark, \"did not find expected comment or line break\")\n\t\treturn false\n\t}\n\n\t// Eat a line break.\n\tif is_break(parser.buffer, parser.buffer_pos) {\n\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\treturn false\n\t\t}\n\t\tskip_line(parser)\n\t}\n\n\treturn true\n}\n\n// Scan the directive name.\n//\n// Scope:\n// %YAML 1.1 # a comment \\n\n// ^^^^\n// %TAG !yaml! tag:yaml.org,2002: \\n\n// ^^^\n//\nfunc yaml_parser_scan_directive_name(parser *yaml_parser_t, start_mark yaml_mark_t, name *[]byte) bool {\n\t// Consume the directive name.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\tvar s []byte\n\tfor is_alpha(parser.buffer, parser.buffer_pos) {\n\t\ts = read(parser, s)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Check if the name is empty.\n\tif len(s) == 0 {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a directive\",\n\t\t\tstart_mark, \"could not find expected directive name\")\n\t\treturn false\n\t}\n\n\t// Check for an blank character after the name.\n\tif !is_blankz(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a directive\",\n\t\t\tstart_mark, \"found unexpected non-alphabetical character\")\n\t\treturn false\n\t}\n\t*name = s\n\treturn true\n}\n\n// Scan the value of VERSION-DIRECTIVE.\n//\n// Scope:\n// %YAML 1.1 # a comment \\n\n// ^^^^^^\nfunc yaml_parser_scan_version_directive_value(parser *yaml_parser_t, start_mark yaml_mark_t, major, minor *int8) bool {\n\t// Eat whitespaces.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tfor is_blank(parser.buffer, parser.buffer_pos) {\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Consume the major version number.\n\tif !yaml_parser_scan_version_directive_number(parser, start_mark, major) {\n\t\treturn false\n\t}\n\n\t// Eat '.'.\n\tif parser.buffer[parser.buffer_pos] != '.' {\n\t\treturn yaml_parser_set_scanner_error(parser, \"while scanning a %YAML directive\",\n\t\t\tstart_mark, \"did not find expected digit or '.' character\")\n\t}\n\n\tskip(parser)\n\n\t// Consume the minor version number.\n\tif !yaml_parser_scan_version_directive_number(parser, start_mark, minor) {\n\t\treturn false\n\t}\n\treturn true\n}\n\nconst max_number_length = 2\n\n// Scan the version number of VERSION-DIRECTIVE.\n//\n// Scope:\n// %YAML 1.1 # a comment \\n\n// ^\n// %YAML 1.1 # a comment \\n\n// ^\nfunc yaml_parser_scan_version_directive_number(parser *yaml_parser_t, start_mark yaml_mark_t, number *int8) bool {\n\n\t// Repeat while the next character is digit.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tvar value, length int8\n\tfor is_digit(parser.buffer, parser.buffer_pos) {\n\t\t// Check if the number is too long.\n\t\tlength++\n\t\tif length > max_number_length {\n\t\t\treturn yaml_parser_set_scanner_error(parser, \"while scanning a %YAML directive\",\n\t\t\t\tstart_mark, \"found extremely long version number\")\n\t\t}\n\t\tvalue = value*10 + int8(as_digit(parser.buffer, parser.buffer_pos))\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Check if the number was present.\n\tif length == 0 {\n\t\treturn yaml_parser_set_scanner_error(parser, \"while scanning a %YAML directive\",\n\t\t\tstart_mark, \"did not find expected version number\")\n\t}\n\t*number = value\n\treturn true\n}\n\n// Scan the value of a TAG-DIRECTIVE token.\n//\n// Scope:\n// %TAG !yaml! tag:yaml.org,2002: \\n\n// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n//\nfunc yaml_parser_scan_tag_directive_value(parser *yaml_parser_t, start_mark yaml_mark_t, handle, prefix *[]byte) bool {\n\tvar handle_value, prefix_value []byte\n\n\t// Eat whitespaces.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\tfor is_blank(parser.buffer, parser.buffer_pos) {\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Scan a handle.\n\tif !yaml_parser_scan_tag_handle(parser, true, start_mark, &handle_value) {\n\t\treturn false\n\t}\n\n\t// Expect a whitespace.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tif !is_blank(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a %TAG directive\",\n\t\t\tstart_mark, \"did not find expected whitespace\")\n\t\treturn false\n\t}\n\n\t// Eat whitespaces.\n\tfor is_blank(parser.buffer, parser.buffer_pos) {\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Scan a prefix.\n\tif !yaml_parser_scan_tag_uri(parser, true, nil, start_mark, &prefix_value) {\n\t\treturn false\n\t}\n\n\t// Expect a whitespace or line break.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tif !is_blankz(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a %TAG directive\",\n\t\t\tstart_mark, \"did not find expected whitespace or line break\")\n\t\treturn false\n\t}\n\n\t*handle = handle_value\n\t*prefix = prefix_value\n\treturn true\n}\n\nfunc yaml_parser_scan_anchor(parser *yaml_parser_t, token *yaml_token_t, typ yaml_token_type_t) bool {\n\tvar s []byte\n\n\t// Eat the indicator character.\n\tstart_mark := parser.mark\n\tskip(parser)\n\n\t// Consume the value.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\tfor is_alpha(parser.buffer, parser.buffer_pos) {\n\t\ts = read(parser, s)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tend_mark := parser.mark\n\n\t/*\n\t * Check if length of the anchor is greater than 0 and it is followed by\n\t * a whitespace character or one of the indicators:\n\t *\n\t * '?', ':', ',', ']', '}', '%', '@', '`'.\n\t */\n\n\tif len(s) == 0 ||\n\t\t!(is_blankz(parser.buffer, parser.buffer_pos) || parser.buffer[parser.buffer_pos] == '?' ||\n\t\t\tparser.buffer[parser.buffer_pos] == ':' || parser.buffer[parser.buffer_pos] == ',' ||\n\t\t\tparser.buffer[parser.buffer_pos] == ']' || parser.buffer[parser.buffer_pos] == '}' ||\n\t\t\tparser.buffer[parser.buffer_pos] == '%' || parser.buffer[parser.buffer_pos] == '@' ||\n\t\t\tparser.buffer[parser.buffer_pos] == '`') {\n\t\tcontext := \"while scanning an alias\"\n\t\tif typ == yaml_ANCHOR_TOKEN {\n\t\t\tcontext = \"while scanning an anchor\"\n\t\t}\n\t\tyaml_parser_set_scanner_error(parser, context, start_mark,\n\t\t\t\"did not find expected alphabetic or numeric character\")\n\t\treturn false\n\t}\n\n\t// Create a token.\n\t*token = yaml_token_t{\n\t\ttyp: typ,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\tvalue: s,\n\t}\n\n\treturn true\n}\n\n/*\n * Scan a TAG token.\n */\n\nfunc yaml_parser_scan_tag(parser *yaml_parser_t, token *yaml_token_t) bool {\n\tvar handle, suffix []byte\n\n\tstart_mark := parser.mark\n\n\t// Check if the tag is in the canonical form.\n\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\treturn false\n\t}\n\n\tif parser.buffer[parser.buffer_pos+1] == '<' {\n\t\t// Keep the handle as ''\n\n\t\t// Eat '!<'\n\t\tskip(parser)\n\t\tskip(parser)\n\n\t\t// Consume the tag value.\n\t\tif !yaml_parser_scan_tag_uri(parser, false, nil, start_mark, &suffix) {\n\t\t\treturn false\n\t\t}\n\n\t\t// Check for '>' and eat it.\n\t\tif parser.buffer[parser.buffer_pos] != '>' {\n\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a tag\",\n\t\t\t\tstart_mark, \"did not find the expected '>'\")\n\t\t\treturn false\n\t\t}\n\n\t\tskip(parser)\n\t} else {\n\t\t// The tag has either the '!suffix' or the '!handle!suffix' form.\n\n\t\t// First, try to scan a handle.\n\t\tif !yaml_parser_scan_tag_handle(parser, false, start_mark, &handle) {\n\t\t\treturn false\n\t\t}\n\n\t\t// Check if it is, indeed, handle.\n\t\tif handle[0] == '!' && len(handle) > 1 && handle[len(handle)-1] == '!' {\n\t\t\t// Scan the suffix now.\n\t\t\tif !yaml_parser_scan_tag_uri(parser, false, nil, start_mark, &suffix) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t} else {\n\t\t\t// It wasn't a handle after all. Scan the rest of the tag.\n\t\t\tif !yaml_parser_scan_tag_uri(parser, false, handle, start_mark, &suffix) {\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\t// Set the handle to '!'.\n\t\t\thandle = []byte{'!'}\n\n\t\t\t// A special case: the '!' tag. Set the handle to '' and the\n\t\t\t// suffix to '!'.\n\t\t\tif len(suffix) == 0 {\n\t\t\t\thandle, suffix = suffix, handle\n\t\t\t}\n\t\t}\n\t}\n\n\t// Check the character which ends the tag.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tif !is_blankz(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a tag\",\n\t\t\tstart_mark, \"did not find expected whitespace or line break\")\n\t\treturn false\n\t}\n\n\tend_mark := parser.mark\n\n\t// Create a token.\n\t*token = yaml_token_t{\n\t\ttyp: yaml_TAG_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\tvalue: handle,\n\t\tsuffix: suffix,\n\t}\n\treturn true\n}\n\n// Scan a tag handle.\nfunc yaml_parser_scan_tag_handle(parser *yaml_parser_t, directive bool, start_mark yaml_mark_t, handle *[]byte) bool {\n\t// Check the initial '!' character.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tif parser.buffer[parser.buffer_pos] != '!' {\n\t\tyaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\tstart_mark, \"did not find expected '!'\")\n\t\treturn false\n\t}\n\n\tvar s []byte\n\n\t// Copy the '!' character.\n\ts = read(parser, s)\n\n\t// Copy all subsequent alphabetical and numerical characters.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tfor is_alpha(parser.buffer, parser.buffer_pos) {\n\t\ts = read(parser, s)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Check if the trailing character is '!' and copy it.\n\tif parser.buffer[parser.buffer_pos] == '!' {\n\t\ts = read(parser, s)\n\t} else {\n\t\t// It's either the '!' tag or not really a tag handle. If it's a %TAG\n\t\t// directive, it's an error. If it's a tag token, it must be a part of URI.\n\t\tif directive && string(s) != \"!\" {\n\t\t\tyaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\t\tstart_mark, \"did not find expected '!'\")\n\t\t\treturn false\n\t\t}\n\t}\n\n\t*handle = s\n\treturn true\n}\n\n// Scan a tag.\nfunc yaml_parser_scan_tag_uri(parser *yaml_parser_t, directive bool, head []byte, start_mark yaml_mark_t, uri *[]byte) bool {\n\t//size_t length = head ? strlen((char *)head) : 0\n\tvar s []byte\n\thasTag := len(head) > 0\n\n\t// Copy the head if needed.\n\t//\n\t// Note that we don't copy the leading '!' character.\n\tif len(head) > 1 {\n\t\ts = append(s, head[1:]...)\n\t}\n\n\t// Scan the tag.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\t// The set of characters that may appear in URI is as follows:\n\t//\n\t// '0'-'9', 'A'-'Z', 'a'-'z', '_', '-', ';', '/', '?', ':', '@', '&',\n\t// '=', '+', '$', ',', '.', '!', '~', '*', '\\'', '(', ')', '[', ']',\n\t// '%'.\n\t// [Go] Convert this into more reasonable logic.\n\tfor is_alpha(parser.buffer, parser.buffer_pos) || parser.buffer[parser.buffer_pos] == ';' ||\n\t\tparser.buffer[parser.buffer_pos] == '/' || parser.buffer[parser.buffer_pos] == '?' ||\n\t\tparser.buffer[parser.buffer_pos] == ':' || parser.buffer[parser.buffer_pos] == '@' ||\n\t\tparser.buffer[parser.buffer_pos] == '&' || parser.buffer[parser.buffer_pos] == '=' ||\n\t\tparser.buffer[parser.buffer_pos] == '+' || parser.buffer[parser.buffer_pos] == '$' ||\n\t\tparser.buffer[parser.buffer_pos] == ',' || parser.buffer[parser.buffer_pos] == '.' ||\n\t\tparser.buffer[parser.buffer_pos] == '!' || parser.buffer[parser.buffer_pos] == '~' ||\n\t\tparser.buffer[parser.buffer_pos] == '*' || parser.buffer[parser.buffer_pos] == '\\'' ||\n\t\tparser.buffer[parser.buffer_pos] == '(' || parser.buffer[parser.buffer_pos] == ')' ||\n\t\tparser.buffer[parser.buffer_pos] == '[' || parser.buffer[parser.buffer_pos] == ']' ||\n\t\tparser.buffer[parser.buffer_pos] == '%' {\n\t\t// Check if it is a URI-escape sequence.\n\t\tif parser.buffer[parser.buffer_pos] == '%' {\n\t\t\tif !yaml_parser_scan_uri_escapes(parser, directive, start_mark, &s) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t} else {\n\t\t\ts = read(parser, s)\n\t\t}\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t\thasTag = true\n\t}\n\n\tif !hasTag {\n\t\tyaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\tstart_mark, \"did not find expected tag URI\")\n\t\treturn false\n\t}\n\t*uri = s\n\treturn true\n}\n\n// Decode an URI-escape sequence corresponding to a single UTF-8 character.\nfunc yaml_parser_scan_uri_escapes(parser *yaml_parser_t, directive bool, start_mark yaml_mark_t, s *[]byte) bool {\n\n\t// Decode the required number of characters.\n\tw := 1024\n\tfor w > 0 {\n\t\t// Check for a URI-escaped octet.\n\t\tif parser.unread < 3 && !yaml_parser_update_buffer(parser, 3) {\n\t\t\treturn false\n\t\t}\n\n\t\tif !(parser.buffer[parser.buffer_pos] == '%' &&\n\t\t\tis_hex(parser.buffer, parser.buffer_pos+1) &&\n\t\t\tis_hex(parser.buffer, parser.buffer_pos+2)) {\n\t\t\treturn yaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\t\tstart_mark, \"did not find URI escaped octet\")\n\t\t}\n\n\t\t// Get the octet.\n\t\toctet := byte((as_hex(parser.buffer, parser.buffer_pos+1) << 4) + as_hex(parser.buffer, parser.buffer_pos+2))\n\n\t\t// If it is the leading octet, determine the length of the UTF-8 sequence.\n\t\tif w == 1024 {\n\t\t\tw = width(octet)\n\t\t\tif w == 0 {\n\t\t\t\treturn yaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\t\t\tstart_mark, \"found an incorrect leading UTF-8 octet\")\n\t\t\t}\n\t\t} else {\n\t\t\t// Check if the trailing octet is correct.\n\t\t\tif octet&0xC0 != 0x80 {\n\t\t\t\treturn yaml_parser_set_scanner_tag_error(parser, directive,\n\t\t\t\t\tstart_mark, \"found an incorrect trailing UTF-8 octet\")\n\t\t\t}\n\t\t}\n\n\t\t// Copy the octet and move the pointers.\n\t\t*s = append(*s, octet)\n\t\tskip(parser)\n\t\tskip(parser)\n\t\tskip(parser)\n\t\tw--\n\t}\n\treturn true\n}\n\n// Scan a block scalar.\nfunc yaml_parser_scan_block_scalar(parser *yaml_parser_t, token *yaml_token_t, literal bool) bool {\n\t// Eat the indicator '|' or '>'.\n\tstart_mark := parser.mark\n\tskip(parser)\n\n\t// Scan the additional block scalar indicators.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\n\t// Check for a chomping indicator.\n\tvar chomping, increment int\n\tif parser.buffer[parser.buffer_pos] == '+' || parser.buffer[parser.buffer_pos] == '-' {\n\t\t// Set the chomping method and eat the indicator.\n\t\tif parser.buffer[parser.buffer_pos] == '+' {\n\t\t\tchomping = +1\n\t\t} else {\n\t\t\tchomping = -1\n\t\t}\n\t\tskip(parser)\n\n\t\t// Check for an indentation indicator.\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t\tif is_digit(parser.buffer, parser.buffer_pos) {\n\t\t\t// Check that the indentation is greater than 0.\n\t\t\tif parser.buffer[parser.buffer_pos] == '0' {\n\t\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a block scalar\",\n\t\t\t\t\tstart_mark, \"found an indentation indicator equal to 0\")\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\t// Get the indentation level and eat the indicator.\n\t\t\tincrement = as_digit(parser.buffer, parser.buffer_pos)\n\t\t\tskip(parser)\n\t\t}\n\n\t} else if is_digit(parser.buffer, parser.buffer_pos) {\n\t\t// Do the same as above, but in the opposite order.\n\n\t\tif parser.buffer[parser.buffer_pos] == '0' {\n\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a block scalar\",\n\t\t\t\tstart_mark, \"found an indentation indicator equal to 0\")\n\t\t\treturn false\n\t\t}\n\t\tincrement = as_digit(parser.buffer, parser.buffer_pos)\n\t\tskip(parser)\n\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t\tif parser.buffer[parser.buffer_pos] == '+' || parser.buffer[parser.buffer_pos] == '-' {\n\t\t\tif parser.buffer[parser.buffer_pos] == '+' {\n\t\t\t\tchomping = +1\n\t\t\t} else {\n\t\t\t\tchomping = -1\n\t\t\t}\n\t\t\tskip(parser)\n\t\t}\n\t}\n\n\t// Eat whitespaces and comments to the end of the line.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tfor is_blank(parser.buffer, parser.buffer_pos) {\n\t\tskip(parser)\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t}\n\tif parser.buffer[parser.buffer_pos] == '#' {\n\t\tfor !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\t\tskip(parser)\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n\n\t// Check if we are at the end of the line.\n\tif !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\tyaml_parser_set_scanner_error(parser, \"while scanning a block scalar\",\n\t\t\tstart_mark, \"did not find expected comment or line break\")\n\t\treturn false\n\t}\n\n\t// Eat a line break.\n\tif is_break(parser.buffer, parser.buffer_pos) {\n\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\treturn false\n\t\t}\n\t\tskip_line(parser)\n\t}\n\n\tend_mark := parser.mark\n\n\t// Set the indentation level if it was specified.\n\tvar indent int\n\tif increment > 0 {\n\t\tif parser.indent >= 0 {\n\t\t\tindent = parser.indent + increment\n\t\t} else {\n\t\t\tindent = increment\n\t\t}\n\t}\n\n\t// Scan the leading line breaks and determine the indentation level if needed.\n\tvar s, leading_break, trailing_breaks []byte\n\tif !yaml_parser_scan_block_scalar_breaks(parser, &indent, &trailing_breaks, start_mark, &end_mark) {\n\t\treturn false\n\t}\n\n\t// Scan the block scalar content.\n\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\treturn false\n\t}\n\tvar leading_blank, trailing_blank bool\n\tfor parser.mark.column == indent && !is_z(parser.buffer, parser.buffer_pos) {\n\t\t// We are at the beginning of a non-empty line.\n\n\t\t// Is it a trailing whitespace?\n\t\ttrailing_blank = is_blank(parser.buffer, parser.buffer_pos)\n\n\t\t// Check if we need to fold the leading line break.\n\t\tif !literal && !leading_blank && !trailing_blank && len(leading_break) > 0 && leading_break[0] == '\\n' {\n\t\t\t// Do we need to join the lines by space?\n\t\t\tif len(trailing_breaks) == 0 {\n\t\t\t\ts = append(s, ' ')\n\t\t\t}\n\t\t} else {\n\t\t\ts = append(s, leading_break...)\n\t\t}\n\t\tleading_break = leading_break[:0]\n\n\t\t// Append the remaining line breaks.\n\t\ts = append(s, trailing_breaks...)\n\t\ttrailing_breaks = trailing_breaks[:0]\n\n\t\t// Is it a leading whitespace?\n\t\tleading_blank = is_blank(parser.buffer, parser.buffer_pos)\n\n\t\t// Consume the current line.\n\t\tfor !is_breakz(parser.buffer, parser.buffer_pos) {\n\t\t\ts = read(parser, s)\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Consume the line break.\n\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\treturn false\n\t\t}\n\n\t\tleading_break = read_line(parser, leading_break)\n\n\t\t// Eat the following indentation spaces and line breaks.\n\t\tif !yaml_parser_scan_block_scalar_breaks(parser, &indent, &trailing_breaks, start_mark, &end_mark) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// Chomp the tail.\n\tif chomping != -1 {\n\t\ts = append(s, leading_break...)\n\t}\n\tif chomping == 1 {\n\t\ts = append(s, trailing_breaks...)\n\t}\n\n\t// Create a token.\n\t*token = yaml_token_t{\n\t\ttyp: yaml_SCALAR_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\tvalue: s,\n\t\tstyle: yaml_LITERAL_SCALAR_STYLE,\n\t}\n\tif !literal {\n\t\ttoken.style = yaml_FOLDED_SCALAR_STYLE\n\t}\n\treturn true\n}\n\n// Scan indentation spaces and line breaks for a block scalar. Determine the\n// indentation level if needed.\nfunc yaml_parser_scan_block_scalar_breaks(parser *yaml_parser_t, indent *int, breaks *[]byte, start_mark yaml_mark_t, end_mark *yaml_mark_t) bool {\n\t*end_mark = parser.mark\n\n\t// Eat the indentation spaces and line breaks.\n\tmax_indent := 0\n\tfor {\n\t\t// Eat the indentation spaces.\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\t\tfor (*indent == 0 || parser.mark.column < *indent) && is_space(parser.buffer, parser.buffer_pos) {\n\t\t\tskip(parser)\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\tif parser.mark.column > max_indent {\n\t\t\tmax_indent = parser.mark.column\n\t\t}\n\n\t\t// Check for a tab character messing the indentation.\n\t\tif (*indent == 0 || parser.mark.column < *indent) && is_tab(parser.buffer, parser.buffer_pos) {\n\t\t\treturn yaml_parser_set_scanner_error(parser, \"while scanning a block scalar\",\n\t\t\t\tstart_mark, \"found a tab character where an indentation space is expected\")\n\t\t}\n\n\t\t// Have we found a non-empty line?\n\t\tif !is_break(parser.buffer, parser.buffer_pos) {\n\t\t\tbreak\n\t\t}\n\n\t\t// Consume the line break.\n\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\treturn false\n\t\t}\n\t\t// [Go] Should really be returning breaks instead.\n\t\t*breaks = read_line(parser, *breaks)\n\t\t*end_mark = parser.mark\n\t}\n\n\t// Determine the indentation level if needed.\n\tif *indent == 0 {\n\t\t*indent = max_indent\n\t\tif *indent < parser.indent+1 {\n\t\t\t*indent = parser.indent + 1\n\t\t}\n\t\tif *indent < 1 {\n\t\t\t*indent = 1\n\t\t}\n\t}\n\treturn true\n}\n\n// Scan a quoted scalar.\nfunc yaml_parser_scan_flow_scalar(parser *yaml_parser_t, token *yaml_token_t, single bool) bool {\n\t// Eat the left quote.\n\tstart_mark := parser.mark\n\tskip(parser)\n\n\t// Consume the content of the quoted scalar.\n\tvar s, leading_break, trailing_breaks, whitespaces []byte\n\tfor {\n\t\t// Check that there are no document indicators at the beginning of the line.\n\t\tif parser.unread < 4 && !yaml_parser_update_buffer(parser, 4) {\n\t\t\treturn false\n\t\t}\n\n\t\tif parser.mark.column == 0 &&\n\t\t\t((parser.buffer[parser.buffer_pos+0] == '-' &&\n\t\t\t\tparser.buffer[parser.buffer_pos+1] == '-' &&\n\t\t\t\tparser.buffer[parser.buffer_pos+2] == '-') ||\n\t\t\t\t(parser.buffer[parser.buffer_pos+0] == '.' &&\n\t\t\t\t\tparser.buffer[parser.buffer_pos+1] == '.' &&\n\t\t\t\t\tparser.buffer[parser.buffer_pos+2] == '.')) &&\n\t\t\tis_blankz(parser.buffer, parser.buffer_pos+3) {\n\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a quoted scalar\",\n\t\t\t\tstart_mark, \"found unexpected document indicator\")\n\t\t\treturn false\n\t\t}\n\n\t\t// Check for EOF.\n\t\tif is_z(parser.buffer, parser.buffer_pos) {\n\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a quoted scalar\",\n\t\t\t\tstart_mark, \"found unexpected end of stream\")\n\t\t\treturn false\n\t\t}\n\n\t\t// Consume non-blank characters.\n\t\tleading_blanks := false\n\t\tfor !is_blankz(parser.buffer, parser.buffer_pos) {\n\t\t\tif single && parser.buffer[parser.buffer_pos] == '\\'' && parser.buffer[parser.buffer_pos+1] == '\\'' {\n\t\t\t\t// Is is an escaped single quote.\n\t\t\t\ts = append(s, '\\'')\n\t\t\t\tskip(parser)\n\t\t\t\tskip(parser)\n\n\t\t\t} else if single && parser.buffer[parser.buffer_pos] == '\\'' {\n\t\t\t\t// It is a right single quote.\n\t\t\t\tbreak\n\t\t\t} else if !single && parser.buffer[parser.buffer_pos] == '\"' {\n\t\t\t\t// It is a right double quote.\n\t\t\t\tbreak\n\n\t\t\t} else if !single && parser.buffer[parser.buffer_pos] == '\\\\' && is_break(parser.buffer, parser.buffer_pos+1) {\n\t\t\t\t// It is an escaped line break.\n\t\t\t\tif parser.unread < 3 && !yaml_parser_update_buffer(parser, 3) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\tskip(parser)\n\t\t\t\tskip_line(parser)\n\t\t\t\tleading_blanks = true\n\t\t\t\tbreak\n\n\t\t\t} else if !single && parser.buffer[parser.buffer_pos] == '\\\\' {\n\t\t\t\t// It is an escape sequence.\n\t\t\t\tcode_length := 0\n\n\t\t\t\t// Check the escape character.\n\t\t\t\tswitch parser.buffer[parser.buffer_pos+1] {\n\t\t\t\tcase '0':\n\t\t\t\t\ts = append(s, 0)\n\t\t\t\tcase 'a':\n\t\t\t\t\ts = append(s, '\\x07')\n\t\t\t\tcase 'b':\n\t\t\t\t\ts = append(s, '\\x08')\n\t\t\t\tcase 't', '\\t':\n\t\t\t\t\ts = append(s, '\\x09')\n\t\t\t\tcase 'n':\n\t\t\t\t\ts = append(s, '\\x0A')\n\t\t\t\tcase 'v':\n\t\t\t\t\ts = append(s, '\\x0B')\n\t\t\t\tcase 'f':\n\t\t\t\t\ts = append(s, '\\x0C')\n\t\t\t\tcase 'r':\n\t\t\t\t\ts = append(s, '\\x0D')\n\t\t\t\tcase 'e':\n\t\t\t\t\ts = append(s, '\\x1B')\n\t\t\t\tcase ' ':\n\t\t\t\t\ts = append(s, '\\x20')\n\t\t\t\tcase '\"':\n\t\t\t\t\ts = append(s, '\"')\n\t\t\t\tcase '\\'':\n\t\t\t\t\ts = append(s, '\\'')\n\t\t\t\tcase '\\\\':\n\t\t\t\t\ts = append(s, '\\\\')\n\t\t\t\tcase 'N': // NEL (#x85)\n\t\t\t\t\ts = append(s, '\\xC2')\n\t\t\t\t\ts = append(s, '\\x85')\n\t\t\t\tcase '_': // #xA0\n\t\t\t\t\ts = append(s, '\\xC2')\n\t\t\t\t\ts = append(s, '\\xA0')\n\t\t\t\tcase 'L': // LS (#x2028)\n\t\t\t\t\ts = append(s, '\\xE2')\n\t\t\t\t\ts = append(s, '\\x80')\n\t\t\t\t\ts = append(s, '\\xA8')\n\t\t\t\tcase 'P': // PS (#x2029)\n\t\t\t\t\ts = append(s, '\\xE2')\n\t\t\t\t\ts = append(s, '\\x80')\n\t\t\t\t\ts = append(s, '\\xA9')\n\t\t\t\tcase 'x':\n\t\t\t\t\tcode_length = 2\n\t\t\t\tcase 'u':\n\t\t\t\t\tcode_length = 4\n\t\t\t\tcase 'U':\n\t\t\t\t\tcode_length = 8\n\t\t\t\tdefault:\n\t\t\t\t\tyaml_parser_set_scanner_error(parser, \"while parsing a quoted scalar\",\n\t\t\t\t\t\tstart_mark, \"found unknown escape character\")\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\tskip(parser)\n\t\t\t\tskip(parser)\n\n\t\t\t\t// Consume an arbitrary escape code.\n\t\t\t\tif code_length > 0 {\n\t\t\t\t\tvar value int\n\n\t\t\t\t\t// Scan the character value.\n\t\t\t\t\tif parser.unread < code_length && !yaml_parser_update_buffer(parser, code_length) {\n\t\t\t\t\t\treturn false\n\t\t\t\t\t}\n\t\t\t\t\tfor k := 0; k < code_length; k++ {\n\t\t\t\t\t\tif !is_hex(parser.buffer, parser.buffer_pos+k) {\n\t\t\t\t\t\t\tyaml_parser_set_scanner_error(parser, \"while parsing a quoted scalar\",\n\t\t\t\t\t\t\t\tstart_mark, \"did not find expected hexdecimal number\")\n\t\t\t\t\t\t\treturn false\n\t\t\t\t\t\t}\n\t\t\t\t\t\tvalue = (value << 4) + as_hex(parser.buffer, parser.buffer_pos+k)\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check the value and write the character.\n\t\t\t\t\tif (value >= 0xD800 && value <= 0xDFFF) || value > 0x10FFFF {\n\t\t\t\t\t\tyaml_parser_set_scanner_error(parser, \"while parsing a quoted scalar\",\n\t\t\t\t\t\t\tstart_mark, \"found invalid Unicode character escape code\")\n\t\t\t\t\t\treturn false\n\t\t\t\t\t}\n\t\t\t\t\tif value <= 0x7F {\n\t\t\t\t\t\ts = append(s, byte(value))\n\t\t\t\t\t} else if value <= 0x7FF {\n\t\t\t\t\t\ts = append(s, byte(0xC0+(value>>6)))\n\t\t\t\t\t\ts = append(s, byte(0x80+(value&0x3F)))\n\t\t\t\t\t} else if value <= 0xFFFF {\n\t\t\t\t\t\ts = append(s, byte(0xE0+(value>>12)))\n\t\t\t\t\t\ts = append(s, byte(0x80+((value>>6)&0x3F)))\n\t\t\t\t\t\ts = append(s, byte(0x80+(value&0x3F)))\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts = append(s, byte(0xF0+(value>>18)))\n\t\t\t\t\t\ts = append(s, byte(0x80+((value>>12)&0x3F)))\n\t\t\t\t\t\ts = append(s, byte(0x80+((value>>6)&0x3F)))\n\t\t\t\t\t\ts = append(s, byte(0x80+(value&0x3F)))\n\t\t\t\t\t}\n\n\t\t\t\t\t// Advance the pointer.\n\t\t\t\t\tfor k := 0; k < code_length; k++ {\n\t\t\t\t\t\tskip(parser)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// It is a non-escaped non-blank character.\n\t\t\t\ts = read(parser, s)\n\t\t\t}\n\t\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\n\t\t// Check if we are at the end of the scalar.\n\t\tif single {\n\t\t\tif parser.buffer[parser.buffer_pos] == '\\'' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t} else {\n\t\t\tif parser.buffer[parser.buffer_pos] == '\"' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\n\t\t// Consume blank characters.\n\t\tfor is_blank(parser.buffer, parser.buffer_pos) || is_break(parser.buffer, parser.buffer_pos) {\n\t\t\tif is_blank(parser.buffer, parser.buffer_pos) {\n\t\t\t\t// Consume a space or a tab character.\n\t\t\t\tif !leading_blanks {\n\t\t\t\t\twhitespaces = read(parser, whitespaces)\n\t\t\t\t} else {\n\t\t\t\t\tskip(parser)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\t// Check if it is a first line break.\n\t\t\t\tif !leading_blanks {\n\t\t\t\t\twhitespaces = whitespaces[:0]\n\t\t\t\t\tleading_break = read_line(parser, leading_break)\n\t\t\t\t\tleading_blanks = true\n\t\t\t\t} else {\n\t\t\t\t\ttrailing_breaks = read_line(parser, trailing_breaks)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Join the whitespaces or fold line breaks.\n\t\tif leading_blanks {\n\t\t\t// Do we need to fold line breaks?\n\t\t\tif len(leading_break) > 0 && leading_break[0] == '\\n' {\n\t\t\t\tif len(trailing_breaks) == 0 {\n\t\t\t\t\ts = append(s, ' ')\n\t\t\t\t} else {\n\t\t\t\t\ts = append(s, trailing_breaks...)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ts = append(s, leading_break...)\n\t\t\t\ts = append(s, trailing_breaks...)\n\t\t\t}\n\t\t\ttrailing_breaks = trailing_breaks[:0]\n\t\t\tleading_break = leading_break[:0]\n\t\t} else {\n\t\t\ts = append(s, whitespaces...)\n\t\t\twhitespaces = whitespaces[:0]\n\t\t}\n\t}\n\n\t// Eat the right quote.\n\tskip(parser)\n\tend_mark := parser.mark\n\n\t// Create a token.\n\t*token = yaml_token_t{\n\t\ttyp: yaml_SCALAR_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\tvalue: s,\n\t\tstyle: yaml_SINGLE_QUOTED_SCALAR_STYLE,\n\t}\n\tif !single {\n\t\ttoken.style = yaml_DOUBLE_QUOTED_SCALAR_STYLE\n\t}\n\treturn true\n}\n\n// Scan a plain scalar.\nfunc yaml_parser_scan_plain_scalar(parser *yaml_parser_t, token *yaml_token_t) bool {\n\n\tvar s, leading_break, trailing_breaks, whitespaces []byte\n\tvar leading_blanks bool\n\tvar indent = parser.indent + 1\n\n\tstart_mark := parser.mark\n\tend_mark := parser.mark\n\n\t// Consume the content of the plain scalar.\n\tfor {\n\t\t// Check for a document indicator.\n\t\tif parser.unread < 4 && !yaml_parser_update_buffer(parser, 4) {\n\t\t\treturn false\n\t\t}\n\t\tif parser.mark.column == 0 &&\n\t\t\t((parser.buffer[parser.buffer_pos+0] == '-' &&\n\t\t\t\tparser.buffer[parser.buffer_pos+1] == '-' &&\n\t\t\t\tparser.buffer[parser.buffer_pos+2] == '-') ||\n\t\t\t\t(parser.buffer[parser.buffer_pos+0] == '.' &&\n\t\t\t\t\tparser.buffer[parser.buffer_pos+1] == '.' &&\n\t\t\t\t\tparser.buffer[parser.buffer_pos+2] == '.')) &&\n\t\t\tis_blankz(parser.buffer, parser.buffer_pos+3) {\n\t\t\tbreak\n\t\t}\n\n\t\t// Check for a comment.\n\t\tif parser.buffer[parser.buffer_pos] == '#' {\n\t\t\tbreak\n\t\t}\n\n\t\t// Consume non-blank characters.\n\t\tfor !is_blankz(parser.buffer, parser.buffer_pos) {\n\n\t\t\t// Check for indicators that may end a plain scalar.\n\t\t\tif (parser.buffer[parser.buffer_pos] == ':' && is_blankz(parser.buffer, parser.buffer_pos+1)) ||\n\t\t\t\t(parser.flow_level > 0 &&\n\t\t\t\t\t(parser.buffer[parser.buffer_pos] == ',' ||\n\t\t\t\t\t\tparser.buffer[parser.buffer_pos] == '?' || parser.buffer[parser.buffer_pos] == '[' ||\n\t\t\t\t\t\tparser.buffer[parser.buffer_pos] == ']' || parser.buffer[parser.buffer_pos] == '{' ||\n\t\t\t\t\t\tparser.buffer[parser.buffer_pos] == '}')) {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\t// Check if we need to join whitespaces and breaks.\n\t\t\tif leading_blanks || len(whitespaces) > 0 {\n\t\t\t\tif leading_blanks {\n\t\t\t\t\t// Do we need to fold line breaks?\n\t\t\t\t\tif leading_break[0] == '\\n' {\n\t\t\t\t\t\tif len(trailing_breaks) == 0 {\n\t\t\t\t\t\t\ts = append(s, ' ')\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts = append(s, trailing_breaks...)\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts = append(s, leading_break...)\n\t\t\t\t\t\ts = append(s, trailing_breaks...)\n\t\t\t\t\t}\n\t\t\t\t\ttrailing_breaks = trailing_breaks[:0]\n\t\t\t\t\tleading_break = leading_break[:0]\n\t\t\t\t\tleading_blanks = false\n\t\t\t\t} else {\n\t\t\t\t\ts = append(s, whitespaces...)\n\t\t\t\t\twhitespaces = whitespaces[:0]\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Copy the character.\n\t\t\ts = read(parser, s)\n\n\t\t\tend_mark = parser.mark\n\t\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Is it the end?\n\t\tif !(is_blank(parser.buffer, parser.buffer_pos) || is_break(parser.buffer, parser.buffer_pos)) {\n\t\t\tbreak\n\t\t}\n\n\t\t// Consume blank characters.\n\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\treturn false\n\t\t}\n\n\t\tfor is_blank(parser.buffer, parser.buffer_pos) || is_break(parser.buffer, parser.buffer_pos) {\n\t\t\tif is_blank(parser.buffer, parser.buffer_pos) {\n\n\t\t\t\t// Check for tab characters that abuse indentation.\n\t\t\t\tif leading_blanks && parser.mark.column < indent && is_tab(parser.buffer, parser.buffer_pos) {\n\t\t\t\t\tyaml_parser_set_scanner_error(parser, \"while scanning a plain scalar\",\n\t\t\t\t\t\tstart_mark, \"found a tab character that violates indentation\")\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\t// Consume a space or a tab character.\n\t\t\t\tif !leading_blanks {\n\t\t\t\t\twhitespaces = read(parser, whitespaces)\n\t\t\t\t} else {\n\t\t\t\t\tskip(parser)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif parser.unread < 2 && !yaml_parser_update_buffer(parser, 2) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\n\t\t\t\t// Check if it is a first line break.\n\t\t\t\tif !leading_blanks {\n\t\t\t\t\twhitespaces = whitespaces[:0]\n\t\t\t\t\tleading_break = read_line(parser, leading_break)\n\t\t\t\t\tleading_blanks = true\n\t\t\t\t} else {\n\t\t\t\t\ttrailing_breaks = read_line(parser, trailing_breaks)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif parser.unread < 1 && !yaml_parser_update_buffer(parser, 1) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\t// Check indentation level.\n\t\tif parser.flow_level == 0 && parser.mark.column < indent {\n\t\t\tbreak\n\t\t}\n\t}\n\n\t// Create a token.\n\t*token = yaml_token_t{\n\t\ttyp: yaml_SCALAR_TOKEN,\n\t\tstart_mark: start_mark,\n\t\tend_mark: end_mark,\n\t\tvalue: s,\n\t\tstyle: yaml_PLAIN_SCALAR_STYLE,\n\t}\n\n\t// Note that we change the 'simple_key_allowed' flag.\n\tif leading_blanks {\n\t\tparser.simple_key_allowed = true\n\t}\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/sorter.go", "content": "package yaml\n\nimport (\n\t\"reflect\"\n\t\"unicode\"\n)\n\ntype keyList []reflect.Value\n\nfunc (l keyList) Len() int { return len(l) }\nfunc (l keyList) Swap(i, j int) { l[i], l[j] = l[j], l[i] }\nfunc (l keyList) Less(i, j int) bool {\n\ta := l[i]\n\tb := l[j]\n\tak := a.Kind()\n\tbk := b.Kind()\n\tfor (ak == reflect.Interface || ak == reflect.Ptr) && !a.IsNil() {\n\t\ta = a.Elem()\n\t\tak = a.Kind()\n\t}\n\tfor (bk == reflect.Interface || bk == reflect.Ptr) && !b.IsNil() {\n\t\tb = b.Elem()\n\t\tbk = b.Kind()\n\t}\n\taf, aok := keyFloat(a)\n\tbf, bok := keyFloat(b)\n\tif aok && bok {\n\t\tif af != bf {\n\t\t\treturn af < bf\n\t\t}\n\t\tif ak != bk {\n\t\t\treturn ak < bk\n\t\t}\n\t\treturn numLess(a, b)\n\t}\n\tif ak != reflect.String || bk != reflect.String {\n\t\treturn ak < bk\n\t}\n\tar, br := []rune(a.String()), []rune(b.String())\n\tfor i := 0; i < len(ar) && i < len(br); i++ {\n\t\tif ar[i] == br[i] {\n\t\t\tcontinue\n\t\t}\n\t\tal := unicode.IsLetter(ar[i])\n\t\tbl := unicode.IsLetter(br[i])\n\t\tif al && bl {\n\t\t\treturn ar[i] < br[i]\n\t\t}\n\t\tif al || bl {\n\t\t\treturn bl\n\t\t}\n\t\tvar ai, bi int\n\t\tvar an, bn int64\n\t\tif ar[i] == '0' || br[i] == '0' {\n\t\t\tfor j := i-1; j >= 0 && unicode.IsDigit(ar[j]); j-- {\n\t\t\t\tif ar[j] != '0' {\n\t\t\t\t\tan = 1\n\t\t\t\t\tbn = 1\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor ai = i; ai < len(ar) && unicode.IsDigit(ar[ai]); ai++ {\n\t\t\tan = an*10 + int64(ar[ai]-'0')\n\t\t}\n\t\tfor bi = i; bi < len(br) && unicode.IsDigit(br[bi]); bi++ {\n\t\t\tbn = bn*10 + int64(br[bi]-'0')\n\t\t}\n\t\tif an != bn {\n\t\t\treturn an < bn\n\t\t}\n\t\tif ai != bi {\n\t\t\treturn ai < bi\n\t\t}\n\t\treturn ar[i] < br[i]\n\t}\n\treturn len(ar) < len(br)\n}\n\n// keyFloat returns a float value for v if it is a number/bool\n// and whether it is a number/bool or not.\nfunc keyFloat(v reflect.Value) (f float64, ok bool) {\n\tswitch v.Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn float64(v.Int()), true\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float(), true\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn float64(v.Uint()), true\n\tcase reflect.Bool:\n\t\tif v.Bool() {\n\t\t\treturn 1, true\n\t\t}\n\t\treturn 0, true\n\t}\n\treturn 0, false\n}\n\n// numLess returns whether a < b.\n// a and b must necessarily have the same kind.\nfunc numLess(a, b reflect.Value) bool {\n\tswitch a.Kind() {\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn a.Int() < b.Int()\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn a.Float() < b.Float()\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn a.Uint() < b.Uint()\n\tcase reflect.Bool:\n\t\treturn !a.Bool() && b.Bool()\n\t}\n\tpanic(\"not a number\")\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/writerc.go", "content": "package yaml\n\n// Set the writer error and return false.\nfunc yaml_emitter_set_writer_error(emitter *yaml_emitter_t, problem string) bool {\n\temitter.error = yaml_WRITER_ERROR\n\temitter.problem = problem\n\treturn false\n}\n\n// Flush the output buffer.\nfunc yaml_emitter_flush(emitter *yaml_emitter_t) bool {\n\tif emitter.write_handler == nil {\n\t\tpanic(\"write handler not set\")\n\t}\n\n\t// Check if the buffer is empty.\n\tif emitter.buffer_pos == 0 {\n\t\treturn true\n\t}\n\n\tif err := emitter.write_handler(emitter, emitter.buffer[:emitter.buffer_pos]); err != nil {\n\t\treturn yaml_emitter_set_writer_error(emitter, \"write error: \"+err.Error())\n\t}\n\temitter.buffer_pos = 0\n\treturn true\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/yaml.go", "content": "// Package yaml implements YAML support for the Go language.\n//\n// Source code and other details for the project are available at GitHub:\n//\n// https://github.com/go-yaml/yaml\n//\npackage yaml\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"strings\"\n\t\"sync\"\n)\n\n// MapSlice encodes and decodes as a YAML map.\n// The order of keys is preserved when encoding and decoding.\ntype MapSlice []MapItem\n\n// MapItem is an item in a MapSlice.\ntype MapItem struct {\n\tKey, Value interface{}\n}\n\n// The Unmarshaler interface may be implemented by types to customize their\n// behavior when being unmarshaled from a YAML document. The UnmarshalYAML\n// method receives a function that may be called to unmarshal the original\n// YAML value into a field or variable. It is safe to call the unmarshal\n// function parameter more than once if necessary.\ntype Unmarshaler interface {\n\tUnmarshalYAML(unmarshal func(interface{}) error) error\n}\n\n// The Marshaler interface may be implemented by types to customize their\n// behavior when being marshaled into a YAML document. The returned value\n// is marshaled in place of the original value implementing Marshaler.\n//\n// If an error is returned by MarshalYAML, the marshaling procedure stops\n// and returns with the provided error.\ntype Marshaler interface {\n\tMarshalYAML() (interface{}, error)\n}\n\n// Unmarshal decodes the first document found within the in byte slice\n// and assigns decoded values into the out value.\n//\n// Maps and pointers (to a struct, string, int, etc) are accepted as out\n// values. If an internal pointer within a struct is not initialized,\n// the yaml package will initialize it if necessary for unmarshalling\n// the provided data. The out parameter must not be nil.\n//\n// The type of the decoded values should be compatible with the respective\n// values in out. If one or more values cannot be decoded due to a type\n// mismatches, decoding continues partially until the end of the YAML\n// content, and a *yaml.TypeError is returned with details for all\n// missed values.\n//\n// Struct fields are only unmarshalled if they are exported (have an\n// upper case first letter), and are unmarshalled using the field name\n// lowercased as the default key. Custom keys may be defined via the\n// \"yaml\" name in the field tag: the content preceding the first comma\n// is used as the key, and the following comma-separated options are\n// used to tweak the marshalling process (see Marshal).\n// Conflicting names result in a runtime error.\n//\n// For example:\n//\n// type T struct {\n// F int `yaml:\"a,omitempty\"`\n// B int\n// }\n// var t T\n// yaml.Unmarshal([]byte(\"a: 1\\nb: 2\"), &t)\n//\n// See the documentation of Marshal for the format of tags and a list of\n// supported tag options.\n//\nfunc Unmarshal(in []byte, out interface{}) (err error) {\n\treturn unmarshal(in, out, false)\n}\n\n// UnmarshalStrict is like Unmarshal except that any fields that are found\n// in the data that do not have corresponding struct members, or mapping\n// keys that are duplicates, will result in\n// an error.\nfunc UnmarshalStrict(in []byte, out interface{}) (err error) {\n\treturn unmarshal(in, out, true)\n}\n\n// A Decorder reads and decodes YAML values from an input stream.\ntype Decoder struct {\n\tstrict bool\n\tparser *parser\n}\n\n// NewDecoder returns a new decoder that reads from r.\n//\n// The decoder introduces its own buffering and may read\n// data from r beyond the YAML values requested.\nfunc NewDecoder(r io.Reader) *Decoder {\n\treturn &Decoder{\n\t\tparser: newParserFromReader(r),\n\t}\n}\n\n// SetStrict sets whether strict decoding behaviour is enabled when\n// decoding items in the data (see UnmarshalStrict). By default, decoding is not strict.\nfunc (dec *Decoder) SetStrict(strict bool) {\n\tdec.strict = strict\n}\n\n// Decode reads the next YAML-encoded value from its input\n// and stores it in the value pointed to by v.\n//\n// See the documentation for Unmarshal for details about the\n// conversion of YAML into a Go value.\nfunc (dec *Decoder) Decode(v interface{}) (err error) {\n\td := newDecoder(dec.strict)\n\tdefer handleErr(&err)\n\tnode := dec.parser.parse()\n\tif node == nil {\n\t\treturn io.EOF\n\t}\n\tout := reflect.ValueOf(v)\n\tif out.Kind() == reflect.Ptr && !out.IsNil() {\n\t\tout = out.Elem()\n\t}\n\td.unmarshal(node, out)\n\tif len(d.terrors) > 0 {\n\t\treturn &TypeError{d.terrors}\n\t}\n\treturn nil\n}\n\nfunc unmarshal(in []byte, out interface{}, strict bool) (err error) {\n\tdefer handleErr(&err)\n\td := newDecoder(strict)\n\tp := newParser(in)\n\tdefer p.destroy()\n\tnode := p.parse()\n\tif node != nil {\n\t\tv := reflect.ValueOf(out)\n\t\tif v.Kind() == reflect.Ptr && !v.IsNil() {\n\t\t\tv = v.Elem()\n\t\t}\n\t\td.unmarshal(node, v)\n\t}\n\tif len(d.terrors) > 0 {\n\t\treturn &TypeError{d.terrors}\n\t}\n\treturn nil\n}\n\n// Marshal serializes the value provided into a YAML document. The structure\n// of the generated document will reflect the structure of the value itself.\n// Maps and pointers (to struct, string, int, etc) are accepted as the in value.\n//\n// Struct fields are only marshalled if they are exported (have an upper case\n// first letter), and are marshalled using the field name lowercased as the\n// default key. Custom keys may be defined via the \"yaml\" name in the field\n// tag: the content preceding the first comma is used as the key, and the\n// following comma-separated options are used to tweak the marshalling process.\n// Conflicting names result in a runtime error.\n//\n// The field tag format accepted is:\n//\n// `(...) yaml:\"[][,[,]]\" (...)`\n//\n// The following flags are currently supported:\n//\n// omitempty Only include the field if it's not set to the zero\n// value for the type or to empty slices or maps.\n// Zero valued structs will be omitted if all their public\n// fields are zero, unless they implement an IsZero\n// method (see the IsZeroer interface type), in which\n// case the field will be included if that method returns true.\n//\n// flow Marshal using a flow style (useful for structs,\n// sequences and maps).\n//\n// inline Inline the field, which must be a struct or a map,\n// causing all of its fields or keys to be processed as if\n// they were part of the outer struct. For maps, keys must\n// not conflict with the yaml keys of other struct fields.\n//\n// In addition, if the key is \"-\", the field is ignored.\n//\n// For example:\n//\n// type T struct {\n// F int `yaml:\"a,omitempty\"`\n// B int\n// }\n// yaml.Marshal(&T{B: 2}) // Returns \"b: 2\\n\"\n// yaml.Marshal(&T{F: 1}} // Returns \"a: 1\\nb: 0\\n\"\n//\nfunc Marshal(in interface{}) (out []byte, err error) {\n\tdefer handleErr(&err)\n\te := newEncoder()\n\tdefer e.destroy()\n\te.marshalDoc(\"\", reflect.ValueOf(in))\n\te.finish()\n\tout = e.out\n\treturn\n}\n\n// An Encoder writes YAML values to an output stream.\ntype Encoder struct {\n\tencoder *encoder\n}\n\n// NewEncoder returns a new encoder that writes to w.\n// The Encoder should be closed after use to flush all data\n// to w.\nfunc NewEncoder(w io.Writer) *Encoder {\n\treturn &Encoder{\n\t\tencoder: newEncoderWithWriter(w),\n\t}\n}\n\n// Encode writes the YAML encoding of v to the stream.\n// If multiple items are encoded to the stream, the\n// second and subsequent document will be preceded\n// with a \"---\" document separator, but the first will not.\n//\n// See the documentation for Marshal for details about the conversion of Go\n// values to YAML.\nfunc (e *Encoder) Encode(v interface{}) (err error) {\n\tdefer handleErr(&err)\n\te.encoder.marshalDoc(\"\", reflect.ValueOf(v))\n\treturn nil\n}\n\n// Close closes the encoder by writing any remaining data.\n// It does not write a stream terminating string \"...\".\nfunc (e *Encoder) Close() (err error) {\n\tdefer handleErr(&err)\n\te.encoder.finish()\n\treturn nil\n}\n\nfunc handleErr(err *error) {\n\tif v := recover(); v != nil {\n\t\tif e, ok := v.(yamlError); ok {\n\t\t\t*err = e.err\n\t\t} else {\n\t\t\tpanic(v)\n\t\t}\n\t}\n}\n\ntype yamlError struct {\n\terr error\n}\n\nfunc fail(err error) {\n\tpanic(yamlError{err})\n}\n\nfunc failf(format string, args ...interface{}) {\n\tpanic(yamlError{fmt.Errorf(\"yaml: \"+format, args...)})\n}\n\n// A TypeError is returned by Unmarshal when one or more fields in\n// the YAML document cannot be properly decoded into the requested\n// types. When this error is returned, the value is still\n// unmarshaled partially.\ntype TypeError struct {\n\tErrors []string\n}\n\nfunc (e *TypeError) Error() string {\n\treturn fmt.Sprintf(\"yaml: unmarshal errors:\\n %s\", strings.Join(e.Errors, \"\\n \"))\n}\n\n// --------------------------------------------------------------------------\n// Maintain a mapping of keys to structure field indexes\n\n// The code in this section was copied from mgo/bson.\n\n// structInfo holds details for the serialization of fields of\n// a given struct.\ntype structInfo struct {\n\tFieldsMap map[string]fieldInfo\n\tFieldsList []fieldInfo\n\n\t// InlineMap is the number of the field in the struct that\n\t// contains an ,inline map, or -1 if there's none.\n\tInlineMap int\n}\n\ntype fieldInfo struct {\n\tKey string\n\tNum int\n\tOmitEmpty bool\n\tFlow bool\n\t// Id holds the unique field identifier, so we can cheaply\n\t// check for field duplicates without maintaining an extra map.\n\tId int\n\n\t// Inline holds the field index if the field is part of an inlined struct.\n\tInline []int\n}\n\nvar structMap = make(map[reflect.Type]*structInfo)\nvar fieldMapMutex sync.RWMutex\n\nfunc getStructInfo(st reflect.Type) (*structInfo, error) {\n\tfieldMapMutex.RLock()\n\tsinfo, found := structMap[st]\n\tfieldMapMutex.RUnlock()\n\tif found {\n\t\treturn sinfo, nil\n\t}\n\n\tn := st.NumField()\n\tfieldsMap := make(map[string]fieldInfo)\n\tfieldsList := make([]fieldInfo, 0, n)\n\tinlineMap := -1\n\tfor i := 0; i != n; i++ {\n\t\tfield := st.Field(i)\n\t\tif field.PkgPath != \"\" && !field.Anonymous {\n\t\t\tcontinue // Private field\n\t\t}\n\n\t\tinfo := fieldInfo{Num: i}\n\n\t\ttag := field.Tag.Get(\"yaml\")\n\t\tif tag == \"\" && strings.Index(string(field.Tag), \":\") < 0 {\n\t\t\ttag = string(field.Tag)\n\t\t}\n\t\tif tag == \"-\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tinline := false\n\t\tfields := strings.Split(tag, \",\")\n\t\tif len(fields) > 1 {\n\t\t\tfor _, flag := range fields[1:] {\n\t\t\t\tswitch flag {\n\t\t\t\tcase \"omitempty\":\n\t\t\t\t\tinfo.OmitEmpty = true\n\t\t\t\tcase \"flow\":\n\t\t\t\t\tinfo.Flow = true\n\t\t\t\tcase \"inline\":\n\t\t\t\t\tinline = true\n\t\t\t\tdefault:\n\t\t\t\t\treturn nil, errors.New(fmt.Sprintf(\"Unsupported flag %q in tag %q of type %s\", flag, tag, st))\n\t\t\t\t}\n\t\t\t}\n\t\t\ttag = fields[0]\n\t\t}\n\n\t\tif inline {\n\t\t\tswitch field.Type.Kind() {\n\t\t\tcase reflect.Map:\n\t\t\t\tif inlineMap >= 0 {\n\t\t\t\t\treturn nil, errors.New(\"Multiple ,inline maps in struct \" + st.String())\n\t\t\t\t}\n\t\t\t\tif field.Type.Key() != reflect.TypeOf(\"\") {\n\t\t\t\t\treturn nil, errors.New(\"Option ,inline needs a map with string keys in struct \" + st.String())\n\t\t\t\t}\n\t\t\t\tinlineMap = info.Num\n\t\t\tcase reflect.Struct:\n\t\t\t\tsinfo, err := getStructInfo(field.Type)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tfor _, finfo := range sinfo.FieldsList {\n\t\t\t\t\tif _, found := fieldsMap[finfo.Key]; found {\n\t\t\t\t\t\tmsg := \"Duplicated key '\" + finfo.Key + \"' in struct \" + st.String()\n\t\t\t\t\t\treturn nil, errors.New(msg)\n\t\t\t\t\t}\n\t\t\t\t\tif finfo.Inline == nil {\n\t\t\t\t\t\tfinfo.Inline = []int{i, finfo.Num}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfinfo.Inline = append([]int{i}, finfo.Inline...)\n\t\t\t\t\t}\n\t\t\t\t\tfinfo.Id = len(fieldsList)\n\t\t\t\t\tfieldsMap[finfo.Key] = finfo\n\t\t\t\t\tfieldsList = append(fieldsList, finfo)\n\t\t\t\t}\n\t\t\tdefault:\n\t\t\t\t//return nil, errors.New(\"Option ,inline needs a struct value or map field\")\n\t\t\t\treturn nil, errors.New(\"Option ,inline needs a struct value field\")\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tif tag != \"\" {\n\t\t\tinfo.Key = tag\n\t\t} else {\n\t\t\tinfo.Key = strings.ToLower(field.Name)\n\t\t}\n\n\t\tif _, found = fieldsMap[info.Key]; found {\n\t\t\tmsg := \"Duplicated key '\" + info.Key + \"' in struct \" + st.String()\n\t\t\treturn nil, errors.New(msg)\n\t\t}\n\n\t\tinfo.Id = len(fieldsList)\n\t\tfieldsList = append(fieldsList, info)\n\t\tfieldsMap[info.Key] = info\n\t}\n\n\tsinfo = &structInfo{\n\t\tFieldsMap: fieldsMap,\n\t\tFieldsList: fieldsList,\n\t\tInlineMap: inlineMap,\n\t}\n\n\tfieldMapMutex.Lock()\n\tstructMap[st] = sinfo\n\tfieldMapMutex.Unlock()\n\treturn sinfo, nil\n}\n\n// IsZeroer is used to check whether an object is zero to\n// determine whether it should be omitted when marshaling\n// with the omitempty flag. One notable implementation\n// is time.Time.\ntype IsZeroer interface {\n\tIsZero() bool\n}\n\nfunc isZero(v reflect.Value) bool {\n\tkind := v.Kind()\n\tif z, ok := v.Interface().(IsZeroer); ok {\n\t\tif (kind == reflect.Ptr || kind == reflect.Interface) && v.IsNil() {\n\t\t\treturn true\n\t\t}\n\t\treturn z.IsZero()\n\t}\n\tswitch kind {\n\tcase reflect.String:\n\t\treturn len(v.String()) == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\treturn v.IsNil()\n\tcase reflect.Slice:\n\t\treturn v.Len() == 0\n\tcase reflect.Map:\n\t\treturn v.Len() == 0\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:\n\t\treturn v.Uint() == 0\n\tcase reflect.Bool:\n\t\treturn !v.Bool()\n\tcase reflect.Struct:\n\t\tvt := v.Type()\n\t\tfor i := v.NumField() - 1; i >= 0; i-- {\n\t\t\tif vt.Field(i).PkgPath != \"\" {\n\t\t\t\tcontinue // Private field\n\t\t\t}\n\t\t\tif !isZero(v.Field(i)) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\treturn false\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/yamlh.go", "content": "package yaml\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\n// The version directive data.\ntype yaml_version_directive_t struct {\n\tmajor int8 // The major version number.\n\tminor int8 // The minor version number.\n}\n\n// The tag directive data.\ntype yaml_tag_directive_t struct {\n\thandle []byte // The tag handle.\n\tprefix []byte // The tag prefix.\n}\n\ntype yaml_encoding_t int\n\n// The stream encoding.\nconst (\n\t// Let the parser choose the encoding.\n\tyaml_ANY_ENCODING yaml_encoding_t = iota\n\n\tyaml_UTF8_ENCODING // The default UTF-8 encoding.\n\tyaml_UTF16LE_ENCODING // The UTF-16-LE encoding with BOM.\n\tyaml_UTF16BE_ENCODING // The UTF-16-BE encoding with BOM.\n)\n\ntype yaml_break_t int\n\n// Line break types.\nconst (\n\t// Let the parser choose the break type.\n\tyaml_ANY_BREAK yaml_break_t = iota\n\n\tyaml_CR_BREAK // Use CR for line breaks (Mac style).\n\tyaml_LN_BREAK // Use LN for line breaks (Unix style).\n\tyaml_CRLN_BREAK // Use CR LN for line breaks (DOS style).\n)\n\ntype yaml_error_type_t int\n\n// Many bad things could happen with the parser and emitter.\nconst (\n\t// No error is produced.\n\tyaml_NO_ERROR yaml_error_type_t = iota\n\n\tyaml_MEMORY_ERROR // Cannot allocate or reallocate a block of memory.\n\tyaml_READER_ERROR // Cannot read or decode the input stream.\n\tyaml_SCANNER_ERROR // Cannot scan the input stream.\n\tyaml_PARSER_ERROR // Cannot parse the input stream.\n\tyaml_COMPOSER_ERROR // Cannot compose a YAML document.\n\tyaml_WRITER_ERROR // Cannot write to the output stream.\n\tyaml_EMITTER_ERROR // Cannot emit a YAML stream.\n)\n\n// The pointer position.\ntype yaml_mark_t struct {\n\tindex int // The position index.\n\tline int // The position line.\n\tcolumn int // The position column.\n}\n\n// Node Styles\n\ntype yaml_style_t int8\n\ntype yaml_scalar_style_t yaml_style_t\n\n// Scalar styles.\nconst (\n\t// Let the emitter choose the style.\n\tyaml_ANY_SCALAR_STYLE yaml_scalar_style_t = iota\n\n\tyaml_PLAIN_SCALAR_STYLE // The plain scalar style.\n\tyaml_SINGLE_QUOTED_SCALAR_STYLE // The single-quoted scalar style.\n\tyaml_DOUBLE_QUOTED_SCALAR_STYLE // The double-quoted scalar style.\n\tyaml_LITERAL_SCALAR_STYLE // The literal scalar style.\n\tyaml_FOLDED_SCALAR_STYLE // The folded scalar style.\n)\n\ntype yaml_sequence_style_t yaml_style_t\n\n// Sequence styles.\nconst (\n\t// Let the emitter choose the style.\n\tyaml_ANY_SEQUENCE_STYLE yaml_sequence_style_t = iota\n\n\tyaml_BLOCK_SEQUENCE_STYLE // The block sequence style.\n\tyaml_FLOW_SEQUENCE_STYLE // The flow sequence style.\n)\n\ntype yaml_mapping_style_t yaml_style_t\n\n// Mapping styles.\nconst (\n\t// Let the emitter choose the style.\n\tyaml_ANY_MAPPING_STYLE yaml_mapping_style_t = iota\n\n\tyaml_BLOCK_MAPPING_STYLE // The block mapping style.\n\tyaml_FLOW_MAPPING_STYLE // The flow mapping style.\n)\n\n// Tokens\n\ntype yaml_token_type_t int\n\n// Token types.\nconst (\n\t// An empty token.\n\tyaml_NO_TOKEN yaml_token_type_t = iota\n\n\tyaml_STREAM_START_TOKEN // A STREAM-START token.\n\tyaml_STREAM_END_TOKEN // A STREAM-END token.\n\n\tyaml_VERSION_DIRECTIVE_TOKEN // A VERSION-DIRECTIVE token.\n\tyaml_TAG_DIRECTIVE_TOKEN // A TAG-DIRECTIVE token.\n\tyaml_DOCUMENT_START_TOKEN // A DOCUMENT-START token.\n\tyaml_DOCUMENT_END_TOKEN // A DOCUMENT-END token.\n\n\tyaml_BLOCK_SEQUENCE_START_TOKEN // A BLOCK-SEQUENCE-START token.\n\tyaml_BLOCK_MAPPING_START_TOKEN // A BLOCK-SEQUENCE-END token.\n\tyaml_BLOCK_END_TOKEN // A BLOCK-END token.\n\n\tyaml_FLOW_SEQUENCE_START_TOKEN // A FLOW-SEQUENCE-START token.\n\tyaml_FLOW_SEQUENCE_END_TOKEN // A FLOW-SEQUENCE-END token.\n\tyaml_FLOW_MAPPING_START_TOKEN // A FLOW-MAPPING-START token.\n\tyaml_FLOW_MAPPING_END_TOKEN // A FLOW-MAPPING-END token.\n\n\tyaml_BLOCK_ENTRY_TOKEN // A BLOCK-ENTRY token.\n\tyaml_FLOW_ENTRY_TOKEN // A FLOW-ENTRY token.\n\tyaml_KEY_TOKEN // A KEY token.\n\tyaml_VALUE_TOKEN // A VALUE token.\n\n\tyaml_ALIAS_TOKEN // An ALIAS token.\n\tyaml_ANCHOR_TOKEN // An ANCHOR token.\n\tyaml_TAG_TOKEN // A TAG token.\n\tyaml_SCALAR_TOKEN // A SCALAR token.\n)\n\nfunc (tt yaml_token_type_t) String() string {\n\tswitch tt {\n\tcase yaml_NO_TOKEN:\n\t\treturn \"yaml_NO_TOKEN\"\n\tcase yaml_STREAM_START_TOKEN:\n\t\treturn \"yaml_STREAM_START_TOKEN\"\n\tcase yaml_STREAM_END_TOKEN:\n\t\treturn \"yaml_STREAM_END_TOKEN\"\n\tcase yaml_VERSION_DIRECTIVE_TOKEN:\n\t\treturn \"yaml_VERSION_DIRECTIVE_TOKEN\"\n\tcase yaml_TAG_DIRECTIVE_TOKEN:\n\t\treturn \"yaml_TAG_DIRECTIVE_TOKEN\"\n\tcase yaml_DOCUMENT_START_TOKEN:\n\t\treturn \"yaml_DOCUMENT_START_TOKEN\"\n\tcase yaml_DOCUMENT_END_TOKEN:\n\t\treturn \"yaml_DOCUMENT_END_TOKEN\"\n\tcase yaml_BLOCK_SEQUENCE_START_TOKEN:\n\t\treturn \"yaml_BLOCK_SEQUENCE_START_TOKEN\"\n\tcase yaml_BLOCK_MAPPING_START_TOKEN:\n\t\treturn \"yaml_BLOCK_MAPPING_START_TOKEN\"\n\tcase yaml_BLOCK_END_TOKEN:\n\t\treturn \"yaml_BLOCK_END_TOKEN\"\n\tcase yaml_FLOW_SEQUENCE_START_TOKEN:\n\t\treturn \"yaml_FLOW_SEQUENCE_START_TOKEN\"\n\tcase yaml_FLOW_SEQUENCE_END_TOKEN:\n\t\treturn \"yaml_FLOW_SEQUENCE_END_TOKEN\"\n\tcase yaml_FLOW_MAPPING_START_TOKEN:\n\t\treturn \"yaml_FLOW_MAPPING_START_TOKEN\"\n\tcase yaml_FLOW_MAPPING_END_TOKEN:\n\t\treturn \"yaml_FLOW_MAPPING_END_TOKEN\"\n\tcase yaml_BLOCK_ENTRY_TOKEN:\n\t\treturn \"yaml_BLOCK_ENTRY_TOKEN\"\n\tcase yaml_FLOW_ENTRY_TOKEN:\n\t\treturn \"yaml_FLOW_ENTRY_TOKEN\"\n\tcase yaml_KEY_TOKEN:\n\t\treturn \"yaml_KEY_TOKEN\"\n\tcase yaml_VALUE_TOKEN:\n\t\treturn \"yaml_VALUE_TOKEN\"\n\tcase yaml_ALIAS_TOKEN:\n\t\treturn \"yaml_ALIAS_TOKEN\"\n\tcase yaml_ANCHOR_TOKEN:\n\t\treturn \"yaml_ANCHOR_TOKEN\"\n\tcase yaml_TAG_TOKEN:\n\t\treturn \"yaml_TAG_TOKEN\"\n\tcase yaml_SCALAR_TOKEN:\n\t\treturn \"yaml_SCALAR_TOKEN\"\n\t}\n\treturn \"\"\n}\n\n// The token structure.\ntype yaml_token_t struct {\n\t// The token type.\n\ttyp yaml_token_type_t\n\n\t// The start/end of the token.\n\tstart_mark, end_mark yaml_mark_t\n\n\t// The stream encoding (for yaml_STREAM_START_TOKEN).\n\tencoding yaml_encoding_t\n\n\t// The alias/anchor/scalar value or tag/tag directive handle\n\t// (for yaml_ALIAS_TOKEN, yaml_ANCHOR_TOKEN, yaml_SCALAR_TOKEN, yaml_TAG_TOKEN, yaml_TAG_DIRECTIVE_TOKEN).\n\tvalue []byte\n\n\t// The tag suffix (for yaml_TAG_TOKEN).\n\tsuffix []byte\n\n\t// The tag directive prefix (for yaml_TAG_DIRECTIVE_TOKEN).\n\tprefix []byte\n\n\t// The scalar style (for yaml_SCALAR_TOKEN).\n\tstyle yaml_scalar_style_t\n\n\t// The version directive major/minor (for yaml_VERSION_DIRECTIVE_TOKEN).\n\tmajor, minor int8\n}\n\n// Events\n\ntype yaml_event_type_t int8\n\n// Event types.\nconst (\n\t// An empty event.\n\tyaml_NO_EVENT yaml_event_type_t = iota\n\n\tyaml_STREAM_START_EVENT // A STREAM-START event.\n\tyaml_STREAM_END_EVENT // A STREAM-END event.\n\tyaml_DOCUMENT_START_EVENT // A DOCUMENT-START event.\n\tyaml_DOCUMENT_END_EVENT // A DOCUMENT-END event.\n\tyaml_ALIAS_EVENT // An ALIAS event.\n\tyaml_SCALAR_EVENT // A SCALAR event.\n\tyaml_SEQUENCE_START_EVENT // A SEQUENCE-START event.\n\tyaml_SEQUENCE_END_EVENT // A SEQUENCE-END event.\n\tyaml_MAPPING_START_EVENT // A MAPPING-START event.\n\tyaml_MAPPING_END_EVENT // A MAPPING-END event.\n)\n\nvar eventStrings = []string{\n\tyaml_NO_EVENT: \"none\",\n\tyaml_STREAM_START_EVENT: \"stream start\",\n\tyaml_STREAM_END_EVENT: \"stream end\",\n\tyaml_DOCUMENT_START_EVENT: \"document start\",\n\tyaml_DOCUMENT_END_EVENT: \"document end\",\n\tyaml_ALIAS_EVENT: \"alias\",\n\tyaml_SCALAR_EVENT: \"scalar\",\n\tyaml_SEQUENCE_START_EVENT: \"sequence start\",\n\tyaml_SEQUENCE_END_EVENT: \"sequence end\",\n\tyaml_MAPPING_START_EVENT: \"mapping start\",\n\tyaml_MAPPING_END_EVENT: \"mapping end\",\n}\n\nfunc (e yaml_event_type_t) String() string {\n\tif e < 0 || int(e) >= len(eventStrings) {\n\t\treturn fmt.Sprintf(\"unknown event %d\", e)\n\t}\n\treturn eventStrings[e]\n}\n\n// The event structure.\ntype yaml_event_t struct {\n\n\t// The event type.\n\ttyp yaml_event_type_t\n\n\t// The start and end of the event.\n\tstart_mark, end_mark yaml_mark_t\n\n\t// The document encoding (for yaml_STREAM_START_EVENT).\n\tencoding yaml_encoding_t\n\n\t// The version directive (for yaml_DOCUMENT_START_EVENT).\n\tversion_directive *yaml_version_directive_t\n\n\t// The list of tag directives (for yaml_DOCUMENT_START_EVENT).\n\ttag_directives []yaml_tag_directive_t\n\n\t// The anchor (for yaml_SCALAR_EVENT, yaml_SEQUENCE_START_EVENT, yaml_MAPPING_START_EVENT, yaml_ALIAS_EVENT).\n\tanchor []byte\n\n\t// The tag (for yaml_SCALAR_EVENT, yaml_SEQUENCE_START_EVENT, yaml_MAPPING_START_EVENT).\n\ttag []byte\n\n\t// The scalar value (for yaml_SCALAR_EVENT).\n\tvalue []byte\n\n\t// Is the document start/end indicator implicit, or the tag optional?\n\t// (for yaml_DOCUMENT_START_EVENT, yaml_DOCUMENT_END_EVENT, yaml_SEQUENCE_START_EVENT, yaml_MAPPING_START_EVENT, yaml_SCALAR_EVENT).\n\timplicit bool\n\n\t// Is the tag optional for any non-plain style? (for yaml_SCALAR_EVENT).\n\tquoted_implicit bool\n\n\t// The style (for yaml_SCALAR_EVENT, yaml_SEQUENCE_START_EVENT, yaml_MAPPING_START_EVENT).\n\tstyle yaml_style_t\n}\n\nfunc (e *yaml_event_t) scalar_style() yaml_scalar_style_t { return yaml_scalar_style_t(e.style) }\nfunc (e *yaml_event_t) sequence_style() yaml_sequence_style_t { return yaml_sequence_style_t(e.style) }\nfunc (e *yaml_event_t) mapping_style() yaml_mapping_style_t { return yaml_mapping_style_t(e.style) }\n\n// Nodes\n\nconst (\n\tyaml_NULL_TAG = \"tag:yaml.org,2002:null\" // The tag !!null with the only possible value: null.\n\tyaml_BOOL_TAG = \"tag:yaml.org,2002:bool\" // The tag !!bool with the values: true and false.\n\tyaml_STR_TAG = \"tag:yaml.org,2002:str\" // The tag !!str for string values.\n\tyaml_INT_TAG = \"tag:yaml.org,2002:int\" // The tag !!int for integer values.\n\tyaml_FLOAT_TAG = \"tag:yaml.org,2002:float\" // The tag !!float for float values.\n\tyaml_TIMESTAMP_TAG = \"tag:yaml.org,2002:timestamp\" // The tag !!timestamp for date and time values.\n\n\tyaml_SEQ_TAG = \"tag:yaml.org,2002:seq\" // The tag !!seq is used to denote sequences.\n\tyaml_MAP_TAG = \"tag:yaml.org,2002:map\" // The tag !!map is used to denote mapping.\n\n\t// Not in original libyaml.\n\tyaml_BINARY_TAG = \"tag:yaml.org,2002:binary\"\n\tyaml_MERGE_TAG = \"tag:yaml.org,2002:merge\"\n\n\tyaml_DEFAULT_SCALAR_TAG = yaml_STR_TAG // The default scalar tag is !!str.\n\tyaml_DEFAULT_SEQUENCE_TAG = yaml_SEQ_TAG // The default sequence tag is !!seq.\n\tyaml_DEFAULT_MAPPING_TAG = yaml_MAP_TAG // The default mapping tag is !!map.\n)\n\ntype yaml_node_type_t int\n\n// Node types.\nconst (\n\t// An empty node.\n\tyaml_NO_NODE yaml_node_type_t = iota\n\n\tyaml_SCALAR_NODE // A scalar node.\n\tyaml_SEQUENCE_NODE // A sequence node.\n\tyaml_MAPPING_NODE // A mapping node.\n)\n\n// An element of a sequence node.\ntype yaml_node_item_t int\n\n// An element of a mapping node.\ntype yaml_node_pair_t struct {\n\tkey int // The key of the element.\n\tvalue int // The value of the element.\n}\n\n// The node structure.\ntype yaml_node_t struct {\n\ttyp yaml_node_type_t // The node type.\n\ttag []byte // The node tag.\n\n\t// The node data.\n\n\t// The scalar parameters (for yaml_SCALAR_NODE).\n\tscalar struct {\n\t\tvalue []byte // The scalar value.\n\t\tlength int // The length of the scalar value.\n\t\tstyle yaml_scalar_style_t // The scalar style.\n\t}\n\n\t// The sequence parameters (for YAML_SEQUENCE_NODE).\n\tsequence struct {\n\t\titems_data []yaml_node_item_t // The stack of sequence items.\n\t\tstyle yaml_sequence_style_t // The sequence style.\n\t}\n\n\t// The mapping parameters (for yaml_MAPPING_NODE).\n\tmapping struct {\n\t\tpairs_data []yaml_node_pair_t // The stack of mapping pairs (key, value).\n\t\tpairs_start *yaml_node_pair_t // The beginning of the stack.\n\t\tpairs_end *yaml_node_pair_t // The end of the stack.\n\t\tpairs_top *yaml_node_pair_t // The top of the stack.\n\t\tstyle yaml_mapping_style_t // The mapping style.\n\t}\n\n\tstart_mark yaml_mark_t // The beginning of the node.\n\tend_mark yaml_mark_t // The end of the node.\n\n}\n\n// The document structure.\ntype yaml_document_t struct {\n\n\t// The document nodes.\n\tnodes []yaml_node_t\n\n\t// The version directive.\n\tversion_directive *yaml_version_directive_t\n\n\t// The list of tag directives.\n\ttag_directives_data []yaml_tag_directive_t\n\ttag_directives_start int // The beginning of the tag directives list.\n\ttag_directives_end int // The end of the tag directives list.\n\n\tstart_implicit int // Is the document start indicator implicit?\n\tend_implicit int // Is the document end indicator implicit?\n\n\t// The start/end of the document.\n\tstart_mark, end_mark yaml_mark_t\n}\n\n// The prototype of a read handler.\n//\n// The read handler is called when the parser needs to read more bytes from the\n// source. The handler should write not more than size bytes to the buffer.\n// The number of written bytes should be set to the size_read variable.\n//\n// [in,out] data A pointer to an application data specified by\n// yaml_parser_set_input().\n// [out] buffer The buffer to write the data from the source.\n// [in] size The size of the buffer.\n// [out] size_read The actual number of bytes read from the source.\n//\n// On success, the handler should return 1. If the handler failed,\n// the returned value should be 0. On EOF, the handler should set the\n// size_read to 0 and return 1.\ntype yaml_read_handler_t func(parser *yaml_parser_t, buffer []byte) (n int, err error)\n\n// This structure holds information about a potential simple key.\ntype yaml_simple_key_t struct {\n\tpossible bool // Is a simple key possible?\n\trequired bool // Is a simple key required?\n\ttoken_number int // The number of the token.\n\tmark yaml_mark_t // The position mark.\n}\n\n// The states of the parser.\ntype yaml_parser_state_t int\n\nconst (\n\tyaml_PARSE_STREAM_START_STATE yaml_parser_state_t = iota\n\n\tyaml_PARSE_IMPLICIT_DOCUMENT_START_STATE // Expect the beginning of an implicit document.\n\tyaml_PARSE_DOCUMENT_START_STATE // Expect DOCUMENT-START.\n\tyaml_PARSE_DOCUMENT_CONTENT_STATE // Expect the content of a document.\n\tyaml_PARSE_DOCUMENT_END_STATE // Expect DOCUMENT-END.\n\tyaml_PARSE_BLOCK_NODE_STATE // Expect a block node.\n\tyaml_PARSE_BLOCK_NODE_OR_INDENTLESS_SEQUENCE_STATE // Expect a block node or indentless sequence.\n\tyaml_PARSE_FLOW_NODE_STATE // Expect a flow node.\n\tyaml_PARSE_BLOCK_SEQUENCE_FIRST_ENTRY_STATE // Expect the first entry of a block sequence.\n\tyaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE // Expect an entry of a block sequence.\n\tyaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE // Expect an entry of an indentless sequence.\n\tyaml_PARSE_BLOCK_MAPPING_FIRST_KEY_STATE // Expect the first key of a block mapping.\n\tyaml_PARSE_BLOCK_MAPPING_KEY_STATE // Expect a block mapping key.\n\tyaml_PARSE_BLOCK_MAPPING_VALUE_STATE // Expect a block mapping value.\n\tyaml_PARSE_FLOW_SEQUENCE_FIRST_ENTRY_STATE // Expect the first entry of a flow sequence.\n\tyaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE // Expect an entry of a flow sequence.\n\tyaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_KEY_STATE // Expect a key of an ordered mapping.\n\tyaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE // Expect a value of an ordered mapping.\n\tyaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE // Expect the and of an ordered mapping entry.\n\tyaml_PARSE_FLOW_MAPPING_FIRST_KEY_STATE // Expect the first key of a flow mapping.\n\tyaml_PARSE_FLOW_MAPPING_KEY_STATE // Expect a key of a flow mapping.\n\tyaml_PARSE_FLOW_MAPPING_VALUE_STATE // Expect a value of a flow mapping.\n\tyaml_PARSE_FLOW_MAPPING_EMPTY_VALUE_STATE // Expect an empty value of a flow mapping.\n\tyaml_PARSE_END_STATE // Expect nothing.\n)\n\nfunc (ps yaml_parser_state_t) String() string {\n\tswitch ps {\n\tcase yaml_PARSE_STREAM_START_STATE:\n\t\treturn \"yaml_PARSE_STREAM_START_STATE\"\n\tcase yaml_PARSE_IMPLICIT_DOCUMENT_START_STATE:\n\t\treturn \"yaml_PARSE_IMPLICIT_DOCUMENT_START_STATE\"\n\tcase yaml_PARSE_DOCUMENT_START_STATE:\n\t\treturn \"yaml_PARSE_DOCUMENT_START_STATE\"\n\tcase yaml_PARSE_DOCUMENT_CONTENT_STATE:\n\t\treturn \"yaml_PARSE_DOCUMENT_CONTENT_STATE\"\n\tcase yaml_PARSE_DOCUMENT_END_STATE:\n\t\treturn \"yaml_PARSE_DOCUMENT_END_STATE\"\n\tcase yaml_PARSE_BLOCK_NODE_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_NODE_STATE\"\n\tcase yaml_PARSE_BLOCK_NODE_OR_INDENTLESS_SEQUENCE_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_NODE_OR_INDENTLESS_SEQUENCE_STATE\"\n\tcase yaml_PARSE_FLOW_NODE_STATE:\n\t\treturn \"yaml_PARSE_FLOW_NODE_STATE\"\n\tcase yaml_PARSE_BLOCK_SEQUENCE_FIRST_ENTRY_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_SEQUENCE_FIRST_ENTRY_STATE\"\n\tcase yaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_SEQUENCE_ENTRY_STATE\"\n\tcase yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE:\n\t\treturn \"yaml_PARSE_INDENTLESS_SEQUENCE_ENTRY_STATE\"\n\tcase yaml_PARSE_BLOCK_MAPPING_FIRST_KEY_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_MAPPING_FIRST_KEY_STATE\"\n\tcase yaml_PARSE_BLOCK_MAPPING_KEY_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_MAPPING_KEY_STATE\"\n\tcase yaml_PARSE_BLOCK_MAPPING_VALUE_STATE:\n\t\treturn \"yaml_PARSE_BLOCK_MAPPING_VALUE_STATE\"\n\tcase yaml_PARSE_FLOW_SEQUENCE_FIRST_ENTRY_STATE:\n\t\treturn \"yaml_PARSE_FLOW_SEQUENCE_FIRST_ENTRY_STATE\"\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE:\n\t\treturn \"yaml_PARSE_FLOW_SEQUENCE_ENTRY_STATE\"\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_KEY_STATE:\n\t\treturn \"yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_KEY_STATE\"\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE:\n\t\treturn \"yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_VALUE_STATE\"\n\tcase yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE:\n\t\treturn \"yaml_PARSE_FLOW_SEQUENCE_ENTRY_MAPPING_END_STATE\"\n\tcase yaml_PARSE_FLOW_MAPPING_FIRST_KEY_STATE:\n\t\treturn \"yaml_PARSE_FLOW_MAPPING_FIRST_KEY_STATE\"\n\tcase yaml_PARSE_FLOW_MAPPING_KEY_STATE:\n\t\treturn \"yaml_PARSE_FLOW_MAPPING_KEY_STATE\"\n\tcase yaml_PARSE_FLOW_MAPPING_VALUE_STATE:\n\t\treturn \"yaml_PARSE_FLOW_MAPPING_VALUE_STATE\"\n\tcase yaml_PARSE_FLOW_MAPPING_EMPTY_VALUE_STATE:\n\t\treturn \"yaml_PARSE_FLOW_MAPPING_EMPTY_VALUE_STATE\"\n\tcase yaml_PARSE_END_STATE:\n\t\treturn \"yaml_PARSE_END_STATE\"\n\t}\n\treturn \"\"\n}\n\n// This structure holds aliases data.\ntype yaml_alias_data_t struct {\n\tanchor []byte // The anchor.\n\tindex int // The node id.\n\tmark yaml_mark_t // The anchor mark.\n}\n\n// The parser structure.\n//\n// All members are internal. Manage the structure using the\n// yaml_parser_ family of functions.\ntype yaml_parser_t struct {\n\n\t// Error handling\n\n\terror yaml_error_type_t // Error type.\n\n\tproblem string // Error description.\n\n\t// The byte about which the problem occurred.\n\tproblem_offset int\n\tproblem_value int\n\tproblem_mark yaml_mark_t\n\n\t// The error context.\n\tcontext string\n\tcontext_mark yaml_mark_t\n\n\t// Reader stuff\n\n\tread_handler yaml_read_handler_t // Read handler.\n\n\tinput_reader io.Reader // File input data.\n\tinput []byte // String input data.\n\tinput_pos int\n\n\teof bool // EOF flag\n\n\tbuffer []byte // The working buffer.\n\tbuffer_pos int // The current position of the buffer.\n\n\tunread int // The number of unread characters in the buffer.\n\n\traw_buffer []byte // The raw buffer.\n\traw_buffer_pos int // The current position of the buffer.\n\n\tencoding yaml_encoding_t // The input encoding.\n\n\toffset int // The offset of the current position (in bytes).\n\tmark yaml_mark_t // The mark of the current position.\n\n\t// Scanner stuff\n\n\tstream_start_produced bool // Have we started to scan the input stream?\n\tstream_end_produced bool // Have we reached the end of the input stream?\n\n\tflow_level int // The number of unclosed '[' and '{' indicators.\n\n\ttokens []yaml_token_t // The tokens queue.\n\ttokens_head int // The head of the tokens queue.\n\ttokens_parsed int // The number of tokens fetched from the queue.\n\ttoken_available bool // Does the tokens queue contain a token ready for dequeueing.\n\n\tindent int // The current indentation level.\n\tindents []int // The indentation levels stack.\n\n\tsimple_key_allowed bool // May a simple key occur at the current position?\n\tsimple_keys []yaml_simple_key_t // The stack of simple keys.\n\n\t// Parser stuff\n\n\tstate yaml_parser_state_t // The current parser state.\n\tstates []yaml_parser_state_t // The parser states stack.\n\tmarks []yaml_mark_t // The stack of marks.\n\ttag_directives []yaml_tag_directive_t // The list of TAG directives.\n\n\t// Dumper stuff\n\n\taliases []yaml_alias_data_t // The alias data.\n\n\tdocument *yaml_document_t // The currently parsed document.\n}\n\n// Emitter Definitions\n\n// The prototype of a write handler.\n//\n// The write handler is called when the emitter needs to flush the accumulated\n// characters to the output. The handler should write @a size bytes of the\n// @a buffer to the output.\n//\n// @param[in,out] data A pointer to an application data specified by\n// yaml_emitter_set_output().\n// @param[in] buffer The buffer with bytes to be written.\n// @param[in] size The size of the buffer.\n//\n// @returns On success, the handler should return @c 1. If the handler failed,\n// the returned value should be @c 0.\n//\ntype yaml_write_handler_t func(emitter *yaml_emitter_t, buffer []byte) error\n\ntype yaml_emitter_state_t int\n\n// The emitter states.\nconst (\n\t// Expect STREAM-START.\n\tyaml_EMIT_STREAM_START_STATE yaml_emitter_state_t = iota\n\n\tyaml_EMIT_FIRST_DOCUMENT_START_STATE // Expect the first DOCUMENT-START or STREAM-END.\n\tyaml_EMIT_DOCUMENT_START_STATE // Expect DOCUMENT-START or STREAM-END.\n\tyaml_EMIT_DOCUMENT_CONTENT_STATE // Expect the content of a document.\n\tyaml_EMIT_DOCUMENT_END_STATE // Expect DOCUMENT-END.\n\tyaml_EMIT_FLOW_SEQUENCE_FIRST_ITEM_STATE // Expect the first item of a flow sequence.\n\tyaml_EMIT_FLOW_SEQUENCE_ITEM_STATE // Expect an item of a flow sequence.\n\tyaml_EMIT_FLOW_MAPPING_FIRST_KEY_STATE // Expect the first key of a flow mapping.\n\tyaml_EMIT_FLOW_MAPPING_KEY_STATE // Expect a key of a flow mapping.\n\tyaml_EMIT_FLOW_MAPPING_SIMPLE_VALUE_STATE // Expect a value for a simple key of a flow mapping.\n\tyaml_EMIT_FLOW_MAPPING_VALUE_STATE // Expect a value of a flow mapping.\n\tyaml_EMIT_BLOCK_SEQUENCE_FIRST_ITEM_STATE // Expect the first item of a block sequence.\n\tyaml_EMIT_BLOCK_SEQUENCE_ITEM_STATE // Expect an item of a block sequence.\n\tyaml_EMIT_BLOCK_MAPPING_FIRST_KEY_STATE // Expect the first key of a block mapping.\n\tyaml_EMIT_BLOCK_MAPPING_KEY_STATE // Expect the key of a block mapping.\n\tyaml_EMIT_BLOCK_MAPPING_SIMPLE_VALUE_STATE // Expect a value for a simple key of a block mapping.\n\tyaml_EMIT_BLOCK_MAPPING_VALUE_STATE // Expect a value of a block mapping.\n\tyaml_EMIT_END_STATE // Expect nothing.\n)\n\n// The emitter structure.\n//\n// All members are internal. Manage the structure using the @c yaml_emitter_\n// family of functions.\ntype yaml_emitter_t struct {\n\n\t// Error handling\n\n\terror yaml_error_type_t // Error type.\n\tproblem string // Error description.\n\n\t// Writer stuff\n\n\twrite_handler yaml_write_handler_t // Write handler.\n\n\toutput_buffer *[]byte // String output data.\n\toutput_writer io.Writer // File output data.\n\n\tbuffer []byte // The working buffer.\n\tbuffer_pos int // The current position of the buffer.\n\n\traw_buffer []byte // The raw buffer.\n\traw_buffer_pos int // The current position of the buffer.\n\n\tencoding yaml_encoding_t // The stream encoding.\n\n\t// Emitter stuff\n\n\tcanonical bool // If the output is in the canonical style?\n\tbest_indent int // The number of indentation spaces.\n\tbest_width int // The preferred width of the output lines.\n\tunicode bool // Allow unescaped non-ASCII characters?\n\tline_break yaml_break_t // The preferred line break.\n\n\tstate yaml_emitter_state_t // The current emitter state.\n\tstates []yaml_emitter_state_t // The stack of states.\n\n\tevents []yaml_event_t // The event queue.\n\tevents_head int // The head of the event queue.\n\n\tindents []int // The stack of indentation levels.\n\n\ttag_directives []yaml_tag_directive_t // The list of tag directives.\n\n\tindent int // The current indentation level.\n\n\tflow_level int // The current flow level.\n\n\troot_context bool // Is it the document root context?\n\tsequence_context bool // Is it a sequence context?\n\tmapping_context bool // Is it a mapping context?\n\tsimple_key_context bool // Is it a simple mapping key context?\n\n\tline int // The current line.\n\tcolumn int // The current column.\n\twhitespace bool // If the last character was a whitespace?\n\tindention bool // If the last character was an indentation character (' ', '-', '?', ':')?\n\topen_ended bool // If an explicit document end is required?\n\n\t// Anchor analysis.\n\tanchor_data struct {\n\t\tanchor []byte // The anchor value.\n\t\talias bool // Is it an alias?\n\t}\n\n\t// Tag analysis.\n\ttag_data struct {\n\t\thandle []byte // The tag handle.\n\t\tsuffix []byte // The tag suffix.\n\t}\n\n\t// Scalar analysis.\n\tscalar_data struct {\n\t\tvalue []byte // The scalar value.\n\t\tmultiline bool // Does the scalar contain line breaks?\n\t\tflow_plain_allowed bool // Can the scalar be expessed in the flow plain style?\n\t\tblock_plain_allowed bool // Can the scalar be expressed in the block plain style?\n\t\tsingle_quoted_allowed bool // Can the scalar be expressed in the single quoted style?\n\t\tblock_allowed bool // Can the scalar be expressed in the literal or folded styles?\n\t\tstyle yaml_scalar_style_t // The output style.\n\t}\n\n\t// Dumper stuff\n\n\topened bool // If the stream was already opened?\n\tclosed bool // If the stream was already closed?\n\n\t// The information associated with the document nodes.\n\tanchors *struct {\n\t\treferences int // The number of references.\n\t\tanchor int // The anchor id.\n\t\tserialized bool // If the node has been emitted?\n\t}\n\n\tlast_anchor_id int // The last assigned anchor id.\n\n\tdocument *yaml_document_t // The currently emitted document.\n}\n" }, { "path": "vendor/gopkg.in/yaml.v2/yamlprivateh.go", "content": "package yaml\n\nconst (\n\t// The size of the input raw buffer.\n\tinput_raw_buffer_size = 512\n\n\t// The size of the input buffer.\n\t// It should be possible to decode the whole raw buffer.\n\tinput_buffer_size = input_raw_buffer_size * 3\n\n\t// The size of the output buffer.\n\toutput_buffer_size = 128\n\n\t// The size of the output raw buffer.\n\t// It should be possible to encode the whole output buffer.\n\toutput_raw_buffer_size = (output_buffer_size*2 + 2)\n\n\t// The size of other stacks and queues.\n\tinitial_stack_size = 16\n\tinitial_queue_size = 16\n\tinitial_string_size = 16\n)\n\n// Check if the character at the specified position is an alphabetical\n// character, a digit, '_', or '-'.\nfunc is_alpha(b []byte, i int) bool {\n\treturn b[i] >= '0' && b[i] <= '9' || b[i] >= 'A' && b[i] <= 'Z' || b[i] >= 'a' && b[i] <= 'z' || b[i] == '_' || b[i] == '-'\n}\n\n// Check if the character at the specified position is a digit.\nfunc is_digit(b []byte, i int) bool {\n\treturn b[i] >= '0' && b[i] <= '9'\n}\n\n// Get the value of a digit.\nfunc as_digit(b []byte, i int) int {\n\treturn int(b[i]) - '0'\n}\n\n// Check if the character at the specified position is a hex-digit.\nfunc is_hex(b []byte, i int) bool {\n\treturn b[i] >= '0' && b[i] <= '9' || b[i] >= 'A' && b[i] <= 'F' || b[i] >= 'a' && b[i] <= 'f'\n}\n\n// Get the value of a hex-digit.\nfunc as_hex(b []byte, i int) int {\n\tbi := b[i]\n\tif bi >= 'A' && bi <= 'F' {\n\t\treturn int(bi) - 'A' + 10\n\t}\n\tif bi >= 'a' && bi <= 'f' {\n\t\treturn int(bi) - 'a' + 10\n\t}\n\treturn int(bi) - '0'\n}\n\n// Check if the character is ASCII.\nfunc is_ascii(b []byte, i int) bool {\n\treturn b[i] <= 0x7F\n}\n\n// Check if the character at the start of the buffer can be printed unescaped.\nfunc is_printable(b []byte, i int) bool {\n\treturn ((b[i] == 0x0A) || // . == #x0A\n\t\t(b[i] >= 0x20 && b[i] <= 0x7E) || // #x20 <= . <= #x7E\n\t\t(b[i] == 0xC2 && b[i+1] >= 0xA0) || // #0xA0 <= . <= #xD7FF\n\t\t(b[i] > 0xC2 && b[i] < 0xED) ||\n\t\t(b[i] == 0xED && b[i+1] < 0xA0) ||\n\t\t(b[i] == 0xEE) ||\n\t\t(b[i] == 0xEF && // #xE000 <= . <= #xFFFD\n\t\t\t!(b[i+1] == 0xBB && b[i+2] == 0xBF) && // && . != #xFEFF\n\t\t\t!(b[i+1] == 0xBF && (b[i+2] == 0xBE || b[i+2] == 0xBF))))\n}\n\n// Check if the character at the specified position is NUL.\nfunc is_z(b []byte, i int) bool {\n\treturn b[i] == 0x00\n}\n\n// Check if the beginning of the buffer is a BOM.\nfunc is_bom(b []byte, i int) bool {\n\treturn b[0] == 0xEF && b[1] == 0xBB && b[2] == 0xBF\n}\n\n// Check if the character at the specified position is space.\nfunc is_space(b []byte, i int) bool {\n\treturn b[i] == ' '\n}\n\n// Check if the character at the specified position is tab.\nfunc is_tab(b []byte, i int) bool {\n\treturn b[i] == '\\t'\n}\n\n// Check if the character at the specified position is blank (space or tab).\nfunc is_blank(b []byte, i int) bool {\n\t//return is_space(b, i) || is_tab(b, i)\n\treturn b[i] == ' ' || b[i] == '\\t'\n}\n\n// Check if the character at the specified position is a line break.\nfunc is_break(b []byte, i int) bool {\n\treturn (b[i] == '\\r' || // CR (#xD)\n\t\tb[i] == '\\n' || // LF (#xA)\n\t\tb[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9) // PS (#x2029)\n}\n\nfunc is_crlf(b []byte, i int) bool {\n\treturn b[i] == '\\r' && b[i+1] == '\\n'\n}\n\n// Check if the character is a line break or NUL.\nfunc is_breakz(b []byte, i int) bool {\n\t//return is_break(b, i) || is_z(b, i)\n\treturn ( // is_break:\n\tb[i] == '\\r' || // CR (#xD)\n\t\tb[i] == '\\n' || // LF (#xA)\n\t\tb[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)\n\t\t// is_z:\n\t\tb[i] == 0)\n}\n\n// Check if the character is a line break, space, or NUL.\nfunc is_spacez(b []byte, i int) bool {\n\t//return is_space(b, i) || is_breakz(b, i)\n\treturn ( // is_space:\n\tb[i] == ' ' ||\n\t\t// is_breakz:\n\t\tb[i] == '\\r' || // CR (#xD)\n\t\tb[i] == '\\n' || // LF (#xA)\n\t\tb[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)\n\t\tb[i] == 0)\n}\n\n// Check if the character is a line break, space, tab, or NUL.\nfunc is_blankz(b []byte, i int) bool {\n\t//return is_blank(b, i) || is_breakz(b, i)\n\treturn ( // is_blank:\n\tb[i] == ' ' || b[i] == '\\t' ||\n\t\t// is_breakz:\n\t\tb[i] == '\\r' || // CR (#xD)\n\t\tb[i] == '\\n' || // LF (#xA)\n\t\tb[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)\n\t\tb[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)\n\t\tb[i] == 0)\n}\n\n// Determine the width of the character.\nfunc width(b byte) int {\n\t// Don't replace these by a switch without first\n\t// confirming that it is being inlined.\n\tif b&0x80 == 0x00 {\n\t\treturn 1\n\t}\n\tif b&0xE0 == 0xC0 {\n\t\treturn 2\n\t}\n\tif b&0xF0 == 0xE0 {\n\t\treturn 3\n\t}\n\tif b&0xF8 == 0xF0 {\n\t\treturn 4\n\t}\n\treturn 0\n\n}\n" }, { "path": "vendor/modules.txt", "content": "# github.com/360EntSecGroup-Skylar/excelize v1.3.1-0.20180527032555-9e463b461434\ngithub.com/360EntSecGroup-Skylar/excelize\n# github.com/PuerkitoBio/purell v1.1.1-0.20180310210909-975f53781597\ngithub.com/PuerkitoBio/purell\n# github.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578\ngithub.com/PuerkitoBio/urlesc\n# github.com/alecthomas/template v0.0.0-20190718012654-fb15b899a751\ngithub.com/alecthomas/template\ngithub.com/alecthomas/template/parse\n# github.com/astaxie/beego v1.9.3-0.20171218111859-f16688817aa4\ngithub.com/astaxie/beego/validation\n# github.com/boombuler/barcode v1.0.1-0.20180315051053-3c06908149f7\ngithub.com/boombuler/barcode\ngithub.com/boombuler/barcode/qr\ngithub.com/boombuler/barcode/utils\n# github.com/dgrijalva/jwt-go v3.1.0+incompatible\ngithub.com/dgrijalva/jwt-go\n# github.com/gin-contrib/sse v0.1.0\ngithub.com/gin-contrib/sse\n# github.com/gin-gonic/gin v1.4.0\ngithub.com/gin-gonic/gin\ngithub.com/gin-gonic/gin/binding\ngithub.com/gin-gonic/gin/internal/json\ngithub.com/gin-gonic/gin/render\n# github.com/go-ini/ini v1.32.1-0.20180214101753-32e4be5f41bb\ngithub.com/go-ini/ini\n# github.com/go-openapi/jsonpointer v0.17.0\ngithub.com/go-openapi/jsonpointer\n# github.com/go-openapi/jsonreference v0.19.0\ngithub.com/go-openapi/jsonreference\n# github.com/go-openapi/spec v0.19.0\ngithub.com/go-openapi/spec\n# github.com/go-openapi/swag v0.17.0\ngithub.com/go-openapi/swag\n# github.com/go-sql-driver/mysql v1.4.1-0.20190510102335-877a9775f068\ngithub.com/go-sql-driver/mysql\n# github.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0\ngithub.com/golang/freetype\ngithub.com/golang/freetype/raster\ngithub.com/golang/freetype/truetype\n# github.com/golang/protobuf v1.3.1\ngithub.com/golang/protobuf/proto\n# github.com/gomodule/redigo v2.0.1-0.20180401191855-9352ab68be13+incompatible\ngithub.com/gomodule/redigo/internal\ngithub.com/gomodule/redigo/redis\n# github.com/jinzhu/gorm v0.0.0-20180213101209-6e1387b44c64\ngithub.com/jinzhu/gorm\ngithub.com/jinzhu/gorm/dialects/mysql\n# github.com/jinzhu/inflection v0.0.0-20170102125226-1c35d901db3d\ngithub.com/jinzhu/inflection\n# github.com/json-iterator/go v1.1.7\ngithub.com/json-iterator/go\n# github.com/mailru/easyjson v0.0.0-20180823135443-60711f1a8329\ngithub.com/mailru/easyjson/buffer\ngithub.com/mailru/easyjson/jlexer\ngithub.com/mailru/easyjson/jwriter\n# github.com/mattn/go-isatty v0.0.8\ngithub.com/mattn/go-isatty\n# github.com/modern-go/concurrent v0.0.0-20180306012644-bacd9c7ef1dd\ngithub.com/modern-go/concurrent\n# github.com/modern-go/reflect2 v1.0.1\ngithub.com/modern-go/reflect2\n# github.com/pkg/errors v0.8.1\ngithub.com/pkg/errors\n# github.com/swaggo/gin-swagger v1.2.0\ngithub.com/swaggo/gin-swagger\ngithub.com/swaggo/gin-swagger/swaggerFiles\n# github.com/swaggo/swag v1.5.1\ngithub.com/swaggo/swag\n# github.com/tealeg/xlsx v1.0.4-0.20180419195153-f36fa3be8893\ngithub.com/tealeg/xlsx\n# github.com/ugorji/go/codec v1.1.5-pre\ngithub.com/ugorji/go/codec\n# github.com/unknwon/com v1.0.1\ngithub.com/unknwon/com\n# golang.org/x/image v0.0.0-20180628062038-cc896f830ced\ngolang.org/x/image/font\ngolang.org/x/image/math/fixed\n# golang.org/x/net v0.0.0-20190611141213-3f473d35a33a\ngolang.org/x/net/context\ngolang.org/x/net/idna\ngolang.org/x/net/webdav\ngolang.org/x/net/webdav/internal/xml\n# golang.org/x/sys v0.0.0-20190921204832-2dccfee4fd3e\ngolang.org/x/sys/unix\n# golang.org/x/text v0.3.2\ngolang.org/x/text/secure/bidirule\ngolang.org/x/text/transform\ngolang.org/x/text/unicode/bidi\ngolang.org/x/text/unicode/norm\ngolang.org/x/text/width\n# golang.org/x/tools v0.0.0-20190611222205-d73e1c7e250b\ngolang.org/x/tools/go/ast/astutil\ngolang.org/x/tools/go/buildutil\ngolang.org/x/tools/go/internal/cgo\ngolang.org/x/tools/go/loader\n# google.golang.org/appengine v1.6.3\ngoogle.golang.org/appengine/cloudsql\n# gopkg.in/go-playground/validator.v8 v8.18.2\ngopkg.in/go-playground/validator.v8\n# gopkg.in/yaml.v2 v2.2.2\ngopkg.in/yaml.v2\n" } ]