f19a43fd5f
- CLI entry point with yargs parsing for speckl-compile <file> --output-dir --bom-format - TypeScript parser with AST types for all SpeckDL primitives - Generator for PROV-O JSON-LD provenance graphs - Generator for CycloneDX v1.6 BOMs - Generator for SPDX 3.0.1 BOMs - E2E test verifying RetryHandler.speck parsing and all output formats All tests pass.
34 lines
1.1 KiB
JavaScript
34 lines
1.1 KiB
JavaScript
// This alphabet uses `A-Za-z0-9_-` symbols.
|
|
// The order of characters is optimized for better gzip and brotli compression.
|
|
// References to the same file (works both for gzip and brotli):
|
|
// `'use`, `andom`, and `rict'`
|
|
// References to the brotli default dictionary:
|
|
// `-26T`, `1983`, `40px`, `75px`, `bush`, `jack`, `mind`, `very`, and `wolf`
|
|
let urlAlphabet =
|
|
'useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict'
|
|
|
|
let customAlphabet = (alphabet, defaultSize = 21) => {
|
|
return (size = defaultSize) => {
|
|
let id = ''
|
|
// A compact alternative for `for (var i = 0; i < step; i++)`.
|
|
let i = size | 0
|
|
while (i--) {
|
|
// `| 0` is more compact and faster than `Math.floor()`.
|
|
id += alphabet[(Math.random() * alphabet.length) | 0]
|
|
}
|
|
return id
|
|
}
|
|
}
|
|
|
|
let nanoid = (size = 21) => {
|
|
let id = ''
|
|
// A compact alternative for `for (var i = 0; i < step; i++)`.
|
|
let i = size | 0
|
|
while (i--) {
|
|
// `| 0` is more compact and faster than `Math.floor()`.
|
|
id += urlAlphabet[(Math.random() * 64) | 0]
|
|
}
|
|
return id
|
|
}
|
|
|
|
module.exports = { nanoid, customAlphabet }
|