shell-dsl 0.0.36 → 0.0.38

package/dist/mjs/src/commands/tree/tree.mjs.map

@@ -2,9 +2,9 @@
   "version": 3,
   "sources": ["../../../../../src/commands/tree/tree.ts"],
   "sourcesContent": [
-    "import type { Command } from \"../../types.mjs\";\nimport { createFlagParser, type FlagDefinition } from \"../../utils/flag-parser.mjs\";\nimport { matchGlob } from \"../../utils/match-glob.mjs\";\n\ninterface TreeFlags {\n  all: boolean;\n  directoriesOnly: boolean;\n  maxDepth: number;\n  dirsfirst: boolean;\n  prune: boolean;\n  ignorePatterns: string[];\n}\n\nconst spec = {\n  name: \"tree\",\n  flags: [\n    { short: \"a\", long: \"all\" },\n    { short: \"d\" },\n    { short: \"L\", takesValue: true },\n    { short: \"I\", takesValue: true },\n    { long: \"dirsfirst\" },\n    { long: \"prune\" },\n  ] as FlagDefinition[],\n  usage: \"tree [-adI] [-L level] [-I pattern] [--dirsfirst] [--prune] [directory ...]\",\n};\n\nconst defaults: TreeFlags = {\n  all: false,\n  directoriesOnly: false,\n  maxDepth: Infinity,\n  dirsfirst: true,\n  prune: false,\n  ignorePatterns: [],\n};\n\ninterface HandlerResult {\n  error?: string;\n}\n\nlet handlerResult: HandlerResult = {};\n\nconst handler = (flags: TreeFlags, flag: FlagDefinition, value?: string) => {\n  if (flag.short === \"a\") flags.all = true;\n  if (flag.short === \"d\") flags.directoriesOnly = true;\n  if (flag.long === \"dirsfirst\") flags.dirsfirst = true;\n  if (flag.long === \"prune\") flags.prune = true;\n  if (flag.short === \"I\" && value) {\n    if (flags.ignorePatterns === defaults.ignorePatterns) {\n      flags.ignorePatterns = [];\n    }\n    flags.ignorePatterns.push(...value.split(\"|\"));\n  }\n  if (flag.short === \"L\" && value) {\n    const depth = parseInt(value, 10);\n    if (isNaN(depth) || !/^\\d+$/.test(value)) {\n      handlerResult.error = `tree: -L option requires a numeric argument\\nusage: ${spec.usage}\\n`;\n    } else {\n      flags.maxDepth = depth;\n    }\n  }\n};\n\nconst parser = createFlagParser(spec, defaults, handler);\n\nexport const tree: Command = async (ctx) => {\n  // Reset handler result for each invocation\n  handlerResult = {};\n\n  const result = parser.parse(ctx.args);\n\n  if (result.error) {\n    await parser.writeError(result.error, ctx.stderr);\n    return 1;\n  }\n\n  if (handlerResult.error) {\n    await ctx.stderr.writeText(handlerResult.error);\n    return 1;\n  }\n\n  const { all: showAll, directoriesOnly, maxDepth, prune, ignorePatterns } = result.flags;\n  const targetPath = result.args[0] ?? \".\";\n\n  // Validate maxDepth\n  if (maxDepth < 1) {\n    await ctx.stderr.writeText(\"tree: Invalid level, must be greater than 0\\n\");\n    return 1;\n  }\n\n  const resolvedPath = ctx.fs.resolve(ctx.cwd, targetPath);\n\n  // Check if path exists\n  let stat;\n  try {\n    stat = await ctx.fs.stat(resolvedPath);\n  } catch {\n    await ctx.stderr.writeText(`tree: ${targetPath}: No such file or directory\\n`);\n    return 1;\n  }\n\n  // If it's a file, just print the filename\n  if (stat.isFile()) {\n    await ctx.stdout.writeText(targetPath + \"\\n\\n0 directories, 1 file\\n\");\n    return 0;\n  }\n\n  let dirCount = 0;\n  let fileCount = 0;\n  const entriesCache = new Map<string, { name: string; path: string; isDir: boolean }[]>();\n  const visibleContentCache = new Map<string, boolean>();\n\n  // Print root\n  await ctx.stdout.writeText(targetPath + \"\\n\");\n\n  async function getEntries(path: string): Promise<{ name: string; path: string; isDir: boolean }[]> {\n    const cached = entriesCache.get(path);\n    if (cached) return cached;\n\n    let entries = await ctx.fs.readdir(path);\n\n    // Filter hidden files unless -a\n    if (!showAll) {\n      entries = entries.filter((e) => !e.startsWith(\".\"));\n    }\n\n    // Filter by -I ignore patterns\n    if (ignorePatterns.length > 0) {\n      entries = entries.filter((e) => !ignorePatterns.some((p) => matchGlob(p, e)));\n    }\n\n    // Sort entries\n    entries.sort();\n\n    const resolvedEntries: { name: string; path: string; isDir: boolean }[] = [];\n\n    for (const name of entries) {\n      const entryPath = ctx.fs.resolve(path, name);\n      try {\n        const entryStat = await ctx.fs.stat(entryPath);\n        resolvedEntries.push({ name, path: entryPath, isDir: entryStat.isDirectory() });\n      } catch {\n        // Skip entries we can't stat\n      }\n    }\n\n    entriesCache.set(path, resolvedEntries);\n    return resolvedEntries;\n  }\n\n  async function hasVisibleContent(path: string): Promise<boolean> {\n    const cached = visibleContentCache.get(path);\n    if (cached !== undefined) return cached;\n\n    const entries = await getEntries(path);\n\n    for (const entry of entries) {\n      if (!entry.isDir) {\n        visibleContentCache.set(path, true);\n        return true;\n      }\n\n      if (await hasVisibleContent(entry.path)) {\n        visibleContentCache.set(path, true);\n        return true;\n      }\n    }\n\n    visibleContentCache.set(path, false);\n    return false;\n  }\n\n  // Recursive function to build tree\n  async function printTree(path: string, prefix: string, depth: number): Promise<void> {\n    if (depth > maxDepth) return;\n\n    const entries = await getEntries(path);\n\n    // Separate dirs and files, dirs first\n    const dirEntries: { name: string; path: string; isDir: boolean }[] = [];\n    const fileEntries: { name: string; path: string; isDir: boolean }[] = [];\n\n    for (const entry of entries) {\n      if (entry.isDir) {\n        if (prune && !(await hasVisibleContent(entry.path))) {\n          continue;\n        }\n        dirEntries.push(entry);\n      } else {\n        fileEntries.push(entry);\n      }\n    }\n\n    // Combine: directories first, then files (unless directoriesOnly)\n    const sortedEntries = directoriesOnly\n      ? dirEntries\n      : [...dirEntries, ...fileEntries];\n\n    for (let i = 0; i < sortedEntries.length; i++) {\n      const entry = sortedEntries[i]!;\n      const isLast = i === sortedEntries.length - 1;\n      const connector = isLast ? \"└── \" : \"├── \";\n\n      await ctx.stdout.writeText(prefix + connector + entry.name + \"\\n\");\n\n      if (entry.isDir) {\n        dirCount++;\n        if (depth < maxDepth) {\n          const newPrefix = prefix + (isLast ? \"    \" : \"│   \");\n          await printTree(entry.path, newPrefix, depth + 1);\n        }\n      } else {\n        fileCount++;\n      }\n    }\n  }\n\n  await printTree(resolvedPath, \"\", 1);\n\n  // Print summary\n  const dirWord = dirCount === 1 ? \"directory\" : \"directories\";\n  const fileWord = fileCount === 1 ? \"file\" : \"files\";\n  await ctx.stdout.writeText(`\\n${dirCount} ${dirWord}, ${fileCount} ${fileWord}\\n`);\n\n  return 0;\n};\n"
+    "import type { Command } from \"../../types.mjs\";\nimport { createFlagParser, type FlagDefinition } from \"../../utils/flag-parser.mjs\";\nimport { matchGlob } from \"../../utils/match-glob.mjs\";\n\ninterface TreeFlags {\n  all: boolean;\n  directoriesOnly: boolean;\n  maxDepth: number;\n  dirsfirst: boolean;\n  prune: boolean;\n  noReport: boolean;\n  ignorePatterns: string[];\n}\n\nconst spec = {\n  name: \"tree\",\n  flags: [\n    { short: \"a\", long: \"all\" },\n    { short: \"d\" },\n    { short: \"L\", takesValue: true },\n    { short: \"I\", takesValue: true },\n    { long: \"dirsfirst\" },\n    { long: \"prune\" },\n    { long: \"noreport\" },\n  ] as FlagDefinition[],\n  usage: \"tree [-adI] [-L level] [-I pattern] [--dirsfirst] [--prune] [--noreport] [directory ...]\",\n};\n\nconst defaults: TreeFlags = {\n  all: false,\n  directoriesOnly: false,\n  maxDepth: Infinity,\n  dirsfirst: true,\n  prune: false,\n  noReport: false,\n  ignorePatterns: [],\n};\n\ninterface HandlerResult {\n  error?: string;\n}\n\nlet handlerResult: HandlerResult = {};\n\nconst handler = (flags: TreeFlags, flag: FlagDefinition, value?: string) => {\n  if (flag.short === \"a\") flags.all = true;\n  if (flag.short === \"d\") flags.directoriesOnly = true;\n  if (flag.long === \"dirsfirst\") flags.dirsfirst = true;\n  if (flag.long === \"prune\") flags.prune = true;\n  if (flag.long === \"noreport\") flags.noReport = true;\n  if (flag.short === \"I\" && value) {\n    if (flags.ignorePatterns === defaults.ignorePatterns) {\n      flags.ignorePatterns = [];\n    }\n    flags.ignorePatterns.push(...value.split(\"|\"));\n  }\n  if (flag.short === \"L\" && value) {\n    const depth = parseInt(value, 10);\n    if (isNaN(depth) || !/^\\d+$/.test(value)) {\n      handlerResult.error = `tree: -L option requires a numeric argument\\nusage: ${spec.usage}\\n`;\n    } else {\n      flags.maxDepth = depth;\n    }\n  }\n};\n\nconst parser = createFlagParser(spec, defaults, handler);\n\nexport const tree: Command = async (ctx) => {\n  // Reset handler result for each invocation\n  handlerResult = {};\n\n  const result = parser.parse(ctx.args);\n\n  if (result.error) {\n    await parser.writeError(result.error, ctx.stderr);\n    return 1;\n  }\n\n  if (handlerResult.error) {\n    await ctx.stderr.writeText(handlerResult.error);\n    return 1;\n  }\n\n  const { all: showAll, directoriesOnly, maxDepth, prune, noReport, ignorePatterns } = result.flags;\n  const targetPath = result.args[0] ?? \".\";\n\n  // Validate maxDepth\n  if (maxDepth < 1) {\n    await ctx.stderr.writeText(\"tree: Invalid level, must be greater than 0\\n\");\n    return 1;\n  }\n\n  const resolvedPath = ctx.fs.resolve(ctx.cwd, targetPath);\n\n  // Check if path exists\n  let stat;\n  try {\n    stat = await ctx.fs.stat(resolvedPath);\n  } catch {\n    await ctx.stderr.writeText(`tree: ${targetPath}: No such file or directory\\n`);\n    return 1;\n  }\n\n  // If it's a file, just print the filename\n  if (stat.isFile()) {\n    await ctx.stdout.writeText(noReport ? targetPath + \"\\n\" : targetPath + \"\\n\\n0 directories, 1 file\\n\");\n    return 0;\n  }\n\n  let dirCount = 0;\n  let fileCount = 0;\n  const entriesCache = new Map<string, { name: string; path: string; isDir: boolean }[]>();\n  const visibleContentCache = new Map<string, boolean>();\n\n  // Print root\n  await ctx.stdout.writeText(targetPath + \"\\n\");\n\n  async function getEntries(path: string): Promise<{ name: string; path: string; isDir: boolean }[]> {\n    const cached = entriesCache.get(path);\n    if (cached) return cached;\n\n    let entries = await ctx.fs.readdir(path);\n\n    // Filter hidden files unless -a\n    if (!showAll) {\n      entries = entries.filter((e) => !e.startsWith(\".\"));\n    }\n\n    // Filter by -I ignore patterns\n    if (ignorePatterns.length > 0) {\n      entries = entries.filter((e) => !ignorePatterns.some((p) => matchGlob(p, e)));\n    }\n\n    // Sort entries\n    entries.sort();\n\n    const resolvedEntries: { name: string; path: string; isDir: boolean }[] = [];\n\n    for (const name of entries) {\n      const entryPath = ctx.fs.resolve(path, name);\n      try {\n        const entryStat = await ctx.fs.stat(entryPath);\n        resolvedEntries.push({ name, path: entryPath, isDir: entryStat.isDirectory() });\n      } catch {\n        // Skip entries we can't stat\n      }\n    }\n\n    entriesCache.set(path, resolvedEntries);\n    return resolvedEntries;\n  }\n\n  async function hasVisibleContent(path: string): Promise<boolean> {\n    const cached = visibleContentCache.get(path);\n    if (cached !== undefined) return cached;\n\n    const entries = await getEntries(path);\n\n    for (const entry of entries) {\n      if (!entry.isDir) {\n        visibleContentCache.set(path, true);\n        return true;\n      }\n\n      if (await hasVisibleContent(entry.path)) {\n        visibleContentCache.set(path, true);\n        return true;\n      }\n    }\n\n    visibleContentCache.set(path, false);\n    return false;\n  }\n\n  // Recursive function to build tree\n  async function printTree(path: string, prefix: string, depth: number): Promise<void> {\n    if (depth > maxDepth) return;\n\n    const entries = await getEntries(path);\n\n    // Separate dirs and files, dirs first\n    const dirEntries: { name: string; path: string; isDir: boolean }[] = [];\n    const fileEntries: { name: string; path: string; isDir: boolean }[] = [];\n\n    for (const entry of entries) {\n      if (entry.isDir) {\n        if (prune && !(await hasVisibleContent(entry.path))) {\n          continue;\n        }\n        dirEntries.push(entry);\n      } else {\n        fileEntries.push(entry);\n      }\n    }\n\n    // Combine: directories first, then files (unless directoriesOnly)\n    const sortedEntries = directoriesOnly\n      ? dirEntries\n      : [...dirEntries, ...fileEntries];\n\n    for (let i = 0; i < sortedEntries.length; i++) {\n      const entry = sortedEntries[i]!;\n      const isLast = i === sortedEntries.length - 1;\n      const connector = isLast ? \"└── \" : \"├── \";\n\n      await ctx.stdout.writeText(prefix + connector + entry.name + \"\\n\");\n\n      if (entry.isDir) {\n        dirCount++;\n        if (depth < maxDepth) {\n          const newPrefix = prefix + (isLast ? \"    \" : \"│   \");\n          await printTree(entry.path, newPrefix, depth + 1);\n        }\n      } else {\n        fileCount++;\n      }\n    }\n  }\n\n  await printTree(resolvedPath, \"\", 1);\n\n  if (!noReport) {\n    // Print summary\n    const dirWord = dirCount === 1 ? \"directory\" : \"directories\";\n    const fileWord = fileCount === 1 ? \"file\" : \"files\";\n    await ctx.stdout.writeText(`\\n${dirCount} ${dirWord}, ${fileCount} ${fileWord}\\n`);\n  }\n\n  return 0;\n};\n"
   ],
-  "mappings": ";AACA;AACA;AAWA,IAAM,OAAO;AAAA,EACX,MAAM;AAAA,EACN,OAAO;AAAA,IACL,EAAE,OAAO,KAAK,MAAM,MAAM;AAAA,IAC1B,EAAE,OAAO,IAAI;AAAA,IACb,EAAE,OAAO,KAAK,YAAY,KAAK;AAAA,IAC/B,EAAE,OAAO,KAAK,YAAY,KAAK;AAAA,IAC/B,EAAE,MAAM,YAAY;AAAA,IACpB,EAAE,MAAM,QAAQ;AAAA,EAClB;AAAA,EACA,OAAO;AACT;AAEA,IAAM,WAAsB;AAAA,EAC1B,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,UAAU;AAAA,EACV,WAAW;AAAA,EACX,OAAO;AAAA,EACP,gBAAgB,CAAC;AACnB;AAMA,IAAI,gBAA+B,CAAC;AAEpC,IAAM,UAAU,CAAC,OAAkB,MAAsB,UAAmB;AAAA,EAC1E,IAAI,KAAK,UAAU;AAAA,IAAK,MAAM,MAAM;AAAA,EACpC,IAAI,KAAK,UAAU;AAAA,IAAK,MAAM,kBAAkB;AAAA,EAChD,IAAI,KAAK,SAAS;AAAA,IAAa,MAAM,YAAY;AAAA,EACjD,IAAI,KAAK,SAAS;AAAA,IAAS,MAAM,QAAQ;AAAA,EACzC,IAAI,KAAK,UAAU,OAAO,OAAO;AAAA,IAC/B,IAAI,MAAM,mBAAmB,SAAS,gBAAgB;AAAA,MACpD,MAAM,iBAAiB,CAAC;AAAA,IAC1B;AAAA,IACA,MAAM,eAAe,KAAK,GAAG,MAAM,MAAM,GAAG,CAAC;AAAA,EAC/C;AAAA,EACA,IAAI,KAAK,UAAU,OAAO,OAAO;AAAA,IAC/B,MAAM,QAAQ,SAAS,OAAO,EAAE;AAAA,IAChC,IAAI,MAAM,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,GAAG;AAAA,MACxC,cAAc,QAAQ;AAAA,SAAuD,KAAK;AAAA;AAAA,IACpF,EAAO;AAAA,MACL,MAAM,WAAW;AAAA;AAAA,EAErB;AAAA;AAGF,IAAM,SAAS,iBAAiB,MAAM,UAAU,OAAO;AAEhD,IAAM,OAAgB,OAAO,QAAQ;AAAA,EAE1C,gBAAgB,CAAC;AAAA,EAEjB,MAAM,SAAS,OAAO,MAAM,IAAI,IAAI;AAAA,EAEpC,IAAI,OAAO,OAAO;AAAA,IAChB,MAAM,OAAO,WAAW,OAAO,OAAO,IAAI,MAAM;AAAA,IAChD,OAAO;AAAA,EACT;AAAA,EAEA,IAAI,cAAc,OAAO;AAAA,IACvB,MAAM,IAAI,OAAO,UAAU,cAAc,KAAK;AAAA,IAC9C,OAAO;AAAA,EACT;AAAA,EAEA,QAAQ,KAAK,SAAS,iBAAiB,UAAU,OAAO,mBAAmB,OAAO;AAAA,EAClF,MAAM,aAAa,OAAO,KAAK,MAAM;AAAA,EAGrC,IAAI,WAAW,GAAG;AAAA,IAChB,MAAM,IAAI,OAAO,UAAU;AAAA,CAA+C;AAAA,IAC1E,OAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,IAAI,GAAG,QAAQ,IAAI,KAAK,UAAU;AAAA,EAGvD,IAAI;AAAA,EACJ,IAAI;AAAA,IACF,OAAO,MAAM,IAAI,GAAG,KAAK,YAAY;AAAA,IACrC,MAAM;AAAA,IACN,MAAM,IAAI,OAAO,UAAU,SAAS;AAAA,CAAyC;AAAA,IAC7E,OAAO;AAAA;AAAA,EAIT,IAAI,KAAK,OAAO,GAAG;AAAA,IACjB,MAAM,IAAI,OAAO,UAAU,aAAa;AAAA;AAAA;AAAA,CAA6B;AAAA,IACrE,OAAO;AAAA,EACT;AAAA,EAEA,IAAI,WAAW;AAAA,EACf,IAAI,YAAY;AAAA,EAChB,MAAM,eAAe,IAAI;AAAA,EACzB,MAAM,sBAAsB,IAAI;AAAA,EAGhC,MAAM,IAAI,OAAO,UAAU,aAAa;AAAA,CAAI;AAAA,EAE5C,eAAe,UAAU,CAAC,MAAyE;AAAA,IACjG,MAAM,SAAS,aAAa,IAAI,IAAI;AAAA,IACpC,IAAI;AAAA,MAAQ,OAAO;AAAA,IAEnB,IAAI,UAAU,MAAM,IAAI,GAAG,QAAQ,IAAI;AAAA,IAGvC,IAAI,CAAC,SAAS;AAAA,MACZ,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,IACpD;AAAA,IAGA,IAAI,eAAe,SAAS,GAAG;AAAA,MAC7B,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,eAAe,KAAK,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC;AAAA,IAC9E;AAAA,IAGA,QAAQ,KAAK;AAAA,IAEb,MAAM,kBAAoE,CAAC;AAAA,IAE3E,WAAW,QAAQ,SAAS;AAAA,MAC1B,MAAM,YAAY,IAAI,GAAG,QAAQ,MAAM,IAAI;AAAA,MAC3C,IAAI;AAAA,QACF,MAAM,YAAY,MAAM,IAAI,GAAG,KAAK,SAAS;AAAA,QAC7C,gBAAgB,KAAK,EAAE,MAAM,MAAM,WAAW,OAAO,UAAU,YAAY,EAAE,CAAC;AAAA,QAC9E,MAAM;AAAA,IAGV;AAAA,IAEA,aAAa,IAAI,MAAM,eAAe;AAAA,IACtC,OAAO;AAAA;AAAA,EAGT,eAAe,iBAAiB,CAAC,MAAgC;AAAA,IAC/D,MAAM,SAAS,oBAAoB,IAAI,IAAI;AAAA,IAC3C,IAAI,WAAW;AAAA,MAAW,OAAO;AAAA,IAEjC,MAAM,UAAU,MAAM,WAAW,IAAI;AAAA,IAErC,WAAW,SAAS,SAAS;AAAA,MAC3B,IAAI,CAAC,MAAM,OAAO;AAAA,QAChB,oBAAoB,IAAI,MAAM,IAAI;AAAA,QAClC,OAAO;AAAA,MACT;AAAA,MAEA,IAAI,MAAM,kBAAkB,MAAM,IAAI,GAAG;AAAA,QACvC,oBAAoB,IAAI,MAAM,IAAI;AAAA,QAClC,OAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,oBAAoB,IAAI,MAAM,KAAK;AAAA,IACnC,OAAO;AAAA;AAAA,EAIT,eAAe,SAAS,CAAC,MAAc,QAAgB,OAA8B;AAAA,IACnF,IAAI,QAAQ;AAAA,MAAU;AAAA,IAEtB,MAAM,UAAU,MAAM,WAAW,IAAI;AAAA,IAGrC,MAAM,aAA+D,CAAC;AAAA,IACtE,MAAM,cAAgE,CAAC;AAAA,IAEvE,WAAW,SAAS,SAAS;AAAA,MAC3B,IAAI,MAAM,OAAO;AAAA,QACf,IAAI,SAAS,CAAE,MAAM,kBAAkB,MAAM,IAAI,GAAI;AAAA,UACnD;AAAA,QACF;AAAA,QACA,WAAW,KAAK,KAAK;AAAA,MACvB,EAAO;AAAA,QACL,YAAY,KAAK,KAAK;AAAA;AAAA,IAE1B;AAAA,IAGA,MAAM,gBAAgB,kBAClB,aACA,CAAC,GAAG,YAAY,GAAG,WAAW;AAAA,IAElC,SAAS,IAAI,EAAG,IAAI,cAAc,QAAQ,KAAK;AAAA,MAC7C,MAAM,QAAQ,cAAc;AAAA,MAC5B,MAAM,SAAS,MAAM,cAAc,SAAS;AAAA,MAC5C,MAAM,YAAY,SAAS,SAAQ;AAAA,MAEnC,MAAM,IAAI,OAAO,UAAU,SAAS,YAAY,MAAM,OAAO;AAAA,CAAI;AAAA,MAEjE,IAAI,MAAM,OAAO;AAAA,QACf;AAAA,QACA,IAAI,QAAQ,UAAU;AAAA,UACpB,MAAM,YAAY,UAAU,SAAS,SAAS;AAAA,UAC9C,MAAM,UAAU,MAAM,MAAM,WAAW,QAAQ,CAAC;AAAA,QAClD;AAAA,MACF,EAAO;AAAA,QACL;AAAA;AAAA,IAEJ;AAAA;AAAA,EAGF,MAAM,UAAU,cAAc,IAAI,CAAC;AAAA,EAGnC,MAAM,UAAU,aAAa,IAAI,cAAc;AAAA,EAC/C,MAAM,WAAW,cAAc,IAAI,SAAS;AAAA,EAC5C,MAAM,IAAI,OAAO,UAAU;AAAA,EAAK,YAAY,YAAY,aAAa;AAAA,CAAY;AAAA,EAEjF,OAAO;AAAA;",
-  "debugId": "CEDB38313AEAA77264756E2164756E21",
+  "mappings": ";AACA;AACA;AAYA,IAAM,OAAO;AAAA,EACX,MAAM;AAAA,EACN,OAAO;AAAA,IACL,EAAE,OAAO,KAAK,MAAM,MAAM;AAAA,IAC1B,EAAE,OAAO,IAAI;AAAA,IACb,EAAE,OAAO,KAAK,YAAY,KAAK;AAAA,IAC/B,EAAE,OAAO,KAAK,YAAY,KAAK;AAAA,IAC/B,EAAE,MAAM,YAAY;AAAA,IACpB,EAAE,MAAM,QAAQ;AAAA,IAChB,EAAE,MAAM,WAAW;AAAA,EACrB;AAAA,EACA,OAAO;AACT;AAEA,IAAM,WAAsB;AAAA,EAC1B,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,UAAU;AAAA,EACV,WAAW;AAAA,EACX,OAAO;AAAA,EACP,UAAU;AAAA,EACV,gBAAgB,CAAC;AACnB;AAMA,IAAI,gBAA+B,CAAC;AAEpC,IAAM,UAAU,CAAC,OAAkB,MAAsB,UAAmB;AAAA,EAC1E,IAAI,KAAK,UAAU;AAAA,IAAK,MAAM,MAAM;AAAA,EACpC,IAAI,KAAK,UAAU;AAAA,IAAK,MAAM,kBAAkB;AAAA,EAChD,IAAI,KAAK,SAAS;AAAA,IAAa,MAAM,YAAY;AAAA,EACjD,IAAI,KAAK,SAAS;AAAA,IAAS,MAAM,QAAQ;AAAA,EACzC,IAAI,KAAK,SAAS;AAAA,IAAY,MAAM,WAAW;AAAA,EAC/C,IAAI,KAAK,UAAU,OAAO,OAAO;AAAA,IAC/B,IAAI,MAAM,mBAAmB,SAAS,gBAAgB;AAAA,MACpD,MAAM,iBAAiB,CAAC;AAAA,IAC1B;AAAA,IACA,MAAM,eAAe,KAAK,GAAG,MAAM,MAAM,GAAG,CAAC;AAAA,EAC/C;AAAA,EACA,IAAI,KAAK,UAAU,OAAO,OAAO;AAAA,IAC/B,MAAM,QAAQ,SAAS,OAAO,EAAE;AAAA,IAChC,IAAI,MAAM,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,GAAG;AAAA,MACxC,cAAc,QAAQ;AAAA,SAAuD,KAAK;AAAA;AAAA,IACpF,EAAO;AAAA,MACL,MAAM,WAAW;AAAA;AAAA,EAErB;AAAA;AAGF,IAAM,SAAS,iBAAiB,MAAM,UAAU,OAAO;AAEhD,IAAM,OAAgB,OAAO,QAAQ;AAAA,EAE1C,gBAAgB,CAAC;AAAA,EAEjB,MAAM,SAAS,OAAO,MAAM,IAAI,IAAI;AAAA,EAEpC,IAAI,OAAO,OAAO;AAAA,IAChB,MAAM,OAAO,WAAW,OAAO,OAAO,IAAI,MAAM;AAAA,IAChD,OAAO;AAAA,EACT;AAAA,EAEA,IAAI,cAAc,OAAO;AAAA,IACvB,MAAM,IAAI,OAAO,UAAU,cAAc,KAAK;AAAA,IAC9C,OAAO;AAAA,EACT;AAAA,EAEA,QAAQ,KAAK,SAAS,iBAAiB,UAAU,OAAO,UAAU,mBAAmB,OAAO;AAAA,EAC5F,MAAM,aAAa,OAAO,KAAK,MAAM;AAAA,EAGrC,IAAI,WAAW,GAAG;AAAA,IAChB,MAAM,IAAI,OAAO,UAAU;AAAA,CAA+C;AAAA,IAC1E,OAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,IAAI,GAAG,QAAQ,IAAI,KAAK,UAAU;AAAA,EAGvD,IAAI;AAAA,EACJ,IAAI;AAAA,IACF,OAAO,MAAM,IAAI,GAAG,KAAK,YAAY;AAAA,IACrC,MAAM;AAAA,IACN,MAAM,IAAI,OAAO,UAAU,SAAS;AAAA,CAAyC;AAAA,IAC7E,OAAO;AAAA;AAAA,EAIT,IAAI,KAAK,OAAO,GAAG;AAAA,IACjB,MAAM,IAAI,OAAO,UAAU,WAAW,aAAa;AAAA,IAAO,aAAa;AAAA;AAAA;AAAA,CAA6B;AAAA,IACpG,OAAO;AAAA,EACT;AAAA,EAEA,IAAI,WAAW;AAAA,EACf,IAAI,YAAY;AAAA,EAChB,MAAM,eAAe,IAAI;AAAA,EACzB,MAAM,sBAAsB,IAAI;AAAA,EAGhC,MAAM,IAAI,OAAO,UAAU,aAAa;AAAA,CAAI;AAAA,EAE5C,eAAe,UAAU,CAAC,MAAyE;AAAA,IACjG,MAAM,SAAS,aAAa,IAAI,IAAI;AAAA,IACpC,IAAI;AAAA,MAAQ,OAAO;AAAA,IAEnB,IAAI,UAAU,MAAM,IAAI,GAAG,QAAQ,IAAI;AAAA,IAGvC,IAAI,CAAC,SAAS;AAAA,MACZ,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,IACpD;AAAA,IAGA,IAAI,eAAe,SAAS,GAAG;AAAA,MAC7B,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,eAAe,KAAK,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC;AAAA,IAC9E;AAAA,IAGA,QAAQ,KAAK;AAAA,IAEb,MAAM,kBAAoE,CAAC;AAAA,IAE3E,WAAW,QAAQ,SAAS;AAAA,MAC1B,MAAM,YAAY,IAAI,GAAG,QAAQ,MAAM,IAAI;AAAA,MAC3C,IAAI;AAAA,QACF,MAAM,YAAY,MAAM,IAAI,GAAG,KAAK,SAAS;AAAA,QAC7C,gBAAgB,KAAK,EAAE,MAAM,MAAM,WAAW,OAAO,UAAU,YAAY,EAAE,CAAC;AAAA,QAC9E,MAAM;AAAA,IAGV;AAAA,IAEA,aAAa,IAAI,MAAM,eAAe;AAAA,IACtC,OAAO;AAAA;AAAA,EAGT,eAAe,iBAAiB,CAAC,MAAgC;AAAA,IAC/D,MAAM,SAAS,oBAAoB,IAAI,IAAI;AAAA,IAC3C,IAAI,WAAW;AAAA,MAAW,OAAO;AAAA,IAEjC,MAAM,UAAU,MAAM,WAAW,IAAI;AAAA,IAErC,WAAW,SAAS,SAAS;AAAA,MAC3B,IAAI,CAAC,MAAM,OAAO;AAAA,QAChB,oBAAoB,IAAI,MAAM,IAAI;AAAA,QAClC,OAAO;AAAA,MACT;AAAA,MAEA,IAAI,MAAM,kBAAkB,MAAM,IAAI,GAAG;AAAA,QACvC,oBAAoB,IAAI,MAAM,IAAI;AAAA,QAClC,OAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,oBAAoB,IAAI,MAAM,KAAK;AAAA,IACnC,OAAO;AAAA;AAAA,EAIT,eAAe,SAAS,CAAC,MAAc,QAAgB,OAA8B;AAAA,IACnF,IAAI,QAAQ;AAAA,MAAU;AAAA,IAEtB,MAAM,UAAU,MAAM,WAAW,IAAI;AAAA,IAGrC,MAAM,aAA+D,CAAC;AAAA,IACtE,MAAM,cAAgE,CAAC;AAAA,IAEvE,WAAW,SAAS,SAAS;AAAA,MAC3B,IAAI,MAAM,OAAO;AAAA,QACf,IAAI,SAAS,CAAE,MAAM,kBAAkB,MAAM,IAAI,GAAI;AAAA,UACnD;AAAA,QACF;AAAA,QACA,WAAW,KAAK,KAAK;AAAA,MACvB,EAAO;AAAA,QACL,YAAY,KAAK,KAAK;AAAA;AAAA,IAE1B;AAAA,IAGA,MAAM,gBAAgB,kBAClB,aACA,CAAC,GAAG,YAAY,GAAG,WAAW;AAAA,IAElC,SAAS,IAAI,EAAG,IAAI,cAAc,QAAQ,KAAK;AAAA,MAC7C,MAAM,QAAQ,cAAc;AAAA,MAC5B,MAAM,SAAS,MAAM,cAAc,SAAS;AAAA,MAC5C,MAAM,YAAY,SAAS,SAAQ;AAAA,MAEnC,MAAM,IAAI,OAAO,UAAU,SAAS,YAAY,MAAM,OAAO;AAAA,CAAI;AAAA,MAEjE,IAAI,MAAM,OAAO;AAAA,QACf;AAAA,QACA,IAAI,QAAQ,UAAU;AAAA,UACpB,MAAM,YAAY,UAAU,SAAS,SAAS;AAAA,UAC9C,MAAM,UAAU,MAAM,MAAM,WAAW,QAAQ,CAAC;AAAA,QAClD;AAAA,MACF,EAAO;AAAA,QACL;AAAA;AAAA,IAEJ;AAAA;AAAA,EAGF,MAAM,UAAU,cAAc,IAAI,CAAC;AAAA,EAEnC,IAAI,CAAC,UAAU;AAAA,IAEb,MAAM,UAAU,aAAa,IAAI,cAAc;AAAA,IAC/C,MAAM,WAAW,cAAc,IAAI,SAAS;AAAA,IAC5C,MAAM,IAAI,OAAO,UAAU;AAAA,EAAK,YAAY,YAAY,aAAa;AAAA,CAAY;AAAA,EACnF;AAAA,EAEA,OAAO;AAAA;",
+  "debugId": "F796F052BBAF936964756E2164756E21",
   "names": []
 }

package/dist/types/index.d.ts

@@ -1,3 +1,3 @@
 export * from "./src/index.ts";
 export { builtinCommands } from "./src/commands/index.ts";
-export { echo, cat, grep, wc, head, tail, sort, uniq, pwd, ls, mkdir, rm, test, bracket, trueCmd, falseCmd, touch, cp, mv, tee, tree, find, sed, awk, breakCmd, continueCmd, } from "./src/commands/index.ts";
+export { echo, cat, grep, wc, head, tail, sort, uniq, pwd, ls, mkdir, rm, test, bracket, trueCmd, falseCmd, touch, cp, mv, tee, tree, find, sed, awk, breakCmd, continueCmd, od, } from "./src/commands/index.ts";

package/dist/types/src/commands/index.d.ts

@@ -26,4 +26,5 @@ export { colon } from "./colon/colon.ts";
 export { cd } from "./cd/cd.ts";
 export { tr } from "./tr/tr.ts";
 export { cut } from "./cut/cut.ts";
+export { od } from "./od/od.ts";
 export declare const builtinCommands: Record<string, Command>;

package/dist/types/src/commands/od/od.d.ts

@@ -0,0 +1,2 @@
+import type { Command } from "../../types.ts";
+export declare const od: Command;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "shell-dsl",
-  "version": "0.0.36",
+  "version": "0.0.38",
   "description": "A sandboxed shell-style DSL for running scriptable command pipelines in-process without host OS access",
   "author": "ricsam <oss@ricsam.dev>",
   "license": "MIT",