mrs-toolbox-cli 10.0.14 → 10.0.16

package/npm-cache/_cacache/content-v2/sha512/{4a/25/e356e06915cc5ee0cd81814201fc05127da9e8e8520fb0c8be38ef20e50435a1a300aa9a591f6df61b2a0495281e58ccb94e8ff47849aa55a5c23b39e51f → 21/dd/23b9b835a6836ca1cdb765b5cf2a9e528f0574d1ef3d956094dd1eaaf3f3fc919450ec0f4a96ceeb646f2ba0833be008c71da6e9d8dffa9efe6f65af1872}

@@ -3753,7 +3753,7 @@
   "dist-tags": {
     "latest": "2.0.2"
   },
-  "_rev": "1238-47fa9558957c5d84",
+  "_rev": "1404-e0ae50cfb88e8abc",
   "_id": "path-scurry",
   "readme": "# path-scurry\n\nExtremely high performant utility for building tools that read\nthe file system, minimizing filesystem and path string munging\noperations to the greatest degree possible.\n\n## Ugh, yet another file traversal thing on npm?\n\nYes. None of the existing ones gave me exactly what I wanted.\n\n## Well what is it you wanted?\n\nWhile working on [glob](http://npm.im/glob), I found that I\nneeded a module to very efficiently manage the traversal over a\nfolder tree, such that:\n\n1. No `readdir()` or `stat()` would ever be called on the same\n   file or directory more than one time.\n2. No `readdir()` calls would be made if we can be reasonably\n   sure that the path is not a directory. (Ie, a previous\n   `readdir()` or `stat()` covered the path, and\n   `ent.isDirectory()` is false.)\n3. `path.resolve()`, `dirname()`, `basename()`, and other\n   string-parsing/munging operations are be minimized. This means\n   it has to track \"provisional\" child nodes that may not exist\n   (and if we find that they _don't_ exist, store that\n   information as well, so we don't have to ever check again).\n4. The API is not limited to use as a stream/iterator/etc. There\n   are many cases where an API like node's `fs` is preferrable.\n5. It's more important to prevent excess syscalls than to be up\n   to date, but it should be smart enough to know what it\n   _doesn't_ know, and go get it seamlessly when requested.\n6. Do not blow up the JS heap allocation if operating on a\n   directory with a huge number of entries.\n7. Handle all the weird aspects of Windows paths, like UNC paths\n   and drive letters and wrongway slashes, so that the consumer\n   can return canonical platform-specific paths without having to\n   parse or join or do any error-prone string munging.\n\n## PERFORMANCE\n\nJavaScript people throw around the word \"blazing\" a lot. I hope\nthat this module doesn't blaze anyone. But it does go very fast,\nin the cases it's optimized for, if used properly.\n\nPathScurry provides ample opportunities to get extremely good\nperformance, as well as several options to trade performance for\nconvenience.\n\nBenchmarks can be run by executing `npm run bench`.\n\nAs is always the case, doing more means going slower, doing less\nmeans going faster, and there are trade offs between speed and\nmemory usage.\n\nPathScurry makes heavy use of [LRUCache](http://npm.im/lru-cache)\nto efficiently cache whatever it can, and `Path` objects remain\nin the graph for the lifetime of the walker, so repeated calls\nwith a single PathScurry object will be extremely fast. However,\nadding items to a cold cache means \"doing more\", so in those\ncases, we pay a price. Nothing is free, but every effort has been\nmade to reduce costs wherever possible.\n\nAlso, note that a \"cache as long as possible\" approach means that\nchanges to the filesystem may not be reflected in the results of\nrepeated PathScurry operations.\n\nFor resolving string paths, `PathScurry` ranges from 5-50 times\nfaster than `path.resolve` on repeated resolutions, but around\n100 to 1000 times _slower_ on the first resolution. If your\nprogram is spending a lot of time resolving the _same_ paths\nrepeatedly (like, thousands or millions of times), then this can\nbe beneficial. But both implementations are pretty fast, and\nspeeding up an infrequent operation from 4µs to 400ns is not\ngoing to move the needle on your app's performance.\n\nFor walking file system directory trees, a lot depends on how\noften a given PathScurry object will be used, and also on the\nwalk method used.\n\nWith default settings on a folder tree of 100,000 items,\nconsisting of around a 10-to-1 ratio of normal files to\ndirectories, PathScurry performs comparably to\n[@nodelib/fs.walk](http://npm.im/@nodelib/fs.walk), which is the\nfastest and most reliable file system walker I could find. As far\nas I can tell, it's almost impossible to go much faster in a\nNode.js program, just based on how fast you can push syscalls out\nto the fs thread pool.\n\nOn my machine, that is about 1000-1200 completed walks per second\nfor async or stream walks, and around 500-600 walks per second\nsynchronously.\n\nIn the warm cache state, PathScurry's performance increases\naround 4x for async `for await` iteration, 10-15x faster for\nstreams and synchronous `for of` iteration, and anywhere from 30x\nto 80x faster for the rest.\n\n```\n# walk 100,000 fs entries, 10/1 file/dir ratio\n# operations / ms\n New PathScurry object  |  Reuse PathScurry object\n     stream:  1112.589  |  13974.917\nsync stream:   492.718  |  15028.343\n async walk:  1095.648  |  32706.395\n  sync walk:   527.632  |  46129.772\n async iter:  1288.821  |   5045.510\n  sync iter:   498.496  |  17920.746\n```\n\nA hand-rolled walk calling `entry.readdir()` and recursing\nthrough the entries can benefit even more from caching, with\ngreater flexibility and without the overhead of streams or\ngenerators.\n\nThe cold cache state is still limited by the costs of file system\noperations, but with a warm cache, the only bottleneck is CPU\nspeed and VM optimizations. Of course, in that case, some care\nmust be taken to ensure that you don't lose performance as a\nresult of silly mistakes, like calling `readdir()` on entries\nthat you know are not directories.\n\n```\n# manual recursive iteration functions\n      cold cache  |  warm cache\nasync:  1164.901  |  17923.320\n   cb:  1101.127  |  40999.344\nzalgo:  1082.240  |  66689.936\n sync:   526.935  |  87097.591\n```\n\nIn this case, the speed improves by around 10-20x in the async\ncase, 40x in the case of using `entry.readdirCB` with protections\nagainst synchronous callbacks, and 50-100x with callback\ndeferrals disabled, and _several hundred times faster_ for\nsynchronous iteration.\n\nIf you can think of a case that is not covered in these\nbenchmarks, or an implementation that performs significantly\nbetter than PathScurry, please [let me\nknow](https://github.com/isaacs/path-scurry/issues).\n\n## USAGE\n\n```ts\n// hybrid module, load with either method\nimport { PathScurry, Path } from 'path-scurry'\n// or:\nconst { PathScurry, Path } = require('path-scurry')\n\n// very simple example, say we want to find and\n// delete all the .DS_Store files in a given path\n// note that the API is very similar to just a\n// naive walk with fs.readdir()\nimport { unlink } from 'fs/promises'\n\n// easy way, iterate over the directory and do the thing\nconst pw = new PathScurry(process.cwd())\nfor await (const entry of pw) {\n  if (entry.isFile() && entry.name === '.DS_Store') {\n    unlink(entry.fullpath())\n  }\n}\n\n// here it is as a manual recursive method\nconst walk = async (entry: Path) => {\n  const promises: Promise<any> = []\n  // readdir doesn't throw on non-directories, it just doesn't\n  // return any entries, to save stack trace costs.\n  // Items are returned in arbitrary unsorted order\n  for (const child of await pw.readdir(entry)) {\n    // each child is a Path object\n    if (child.name === '.DS_Store' && child.isFile()) {\n      // could also do pw.resolve(entry, child.name),\n      // just like fs.readdir walking, but .fullpath is\n      // a *slightly* more efficient shorthand.\n      promises.push(unlink(child.fullpath()))\n    } else if (child.isDirectory()) {\n      promises.push(walk(child))\n    }\n  }\n  return Promise.all(promises)\n}\n\nwalk(pw.cwd).then(() => {\n  console.log('all .DS_Store files removed')\n})\n\nconst pw2 = new PathScurry('/a/b/c') // pw2.cwd is the Path for /a/b/c\nconst relativeDir = pw2.cwd.resolve('../x') // Path entry for '/a/b/x'\nconst relative2 = pw2.cwd.resolve('/a/b/d/../x') // same path, same entry\nassert.equal(relativeDir, relative2)\n```\n\n## API\n\n[Full TypeDoc API](https://isaacs.github.io/path-scurry)\n\nThere are platform-specific classes exported, but for the most\npart, the default `PathScurry` and `Path` exports are what you\nmost likely need, unless you are testing behavior for other\nplatforms.\n\nIntended public API is documented here, but the full\ndocumentation does include internal types, which should not be\naccessed directly.\n\n### Interface `PathScurryOpts`\n\nThe type of the `options` argument passed to the `PathScurry`\nconstructor.\n\n- `nocase`: Boolean indicating that file names should be compared\n  case-insensitively. Defaults to `true` on darwin and win32\n  implementations, `false` elsewhere.\n\n  **Warning** Performing case-insensitive matching on a\n  case-sensitive filesystem will result in occasionally very\n  bizarre behavior. Performing case-sensitive matching on a\n  case-insensitive filesystem may negatively impact performance.\n\n- `childrenCacheSize`: Number of child entries to cache, in order\n  to speed up `resolve()` and `readdir()` calls. Defaults to\n  `16 * 1024` (ie, `16384`).\n\n  Setting it to a higher value will run the risk of JS heap\n  allocation errors on large directory trees. Setting it to `256`\n  or smaller will significantly reduce the construction time and\n  data consumption overhead, but with the downside of operations\n  being slower on large directory trees. Setting it to `0` will\n  mean that effectively no operations are cached, and this module\n  will be roughly the same speed as `fs` for file system\n  operations, and _much_ slower than `path.resolve()` for\n  repeated path resolution.\n\n- `fs` An object that will be used to override the default `fs`\n  methods. Any methods that are not overridden will use Node's\n  built-in implementations.\n\n  - lstatSync\n  - readdir (callback `withFileTypes` Dirent variant, used for\n    readdirCB and most walks)\n  - readdirSync\n  - readlinkSync\n  - realpathSync\n  - promises: Object containing the following async methods:\n    - lstat\n    - readdir (Dirent variant only)\n    - readlink\n    - realpath\n\n### Interface `WalkOptions`\n\nThe options object that may be passed to all walk methods.\n\n- `withFileTypes`: Boolean, default true. Indicates that `Path`\n  objects should be returned. Set to `false` to get string paths\n  instead.\n- `follow`: Boolean, default false. Attempt to read directory\n  entries from symbolic links. Otherwise, only actual directories\n  are traversed. Regardless of this setting, a given target path\n  will only ever be walked once, meaning that a symbolic link to\n  a previously traversed directory will never be followed.\n\n  Setting this imposes a slight performance penalty, because\n  `readlink` must be called on all symbolic links encountered, in\n  order to avoid infinite cycles.\n\n- `filter`: Function `(entry: Path) => boolean`. If provided,\n  will prevent the inclusion of any entry for which it returns a\n  falsey value. This will not prevent directories from being\n  traversed if they do not pass the filter, though it will\n  prevent the directories themselves from being included in the\n  results. By default, if no filter is provided, then all entries\n  are included in the results.\n- `walkFilter`: Function `(entry: Path) => boolean`. If provided,\n  will prevent the traversal of any directory (or in the case of\n  `follow:true` symbolic links to directories) for which the\n  function returns false. This will not prevent the directories\n  themselves from being included in the result set. Use `filter`\n  for that.\n\nNote that TypeScript return types will only be inferred properly\nfrom static analysis if the `withFileTypes` option is omitted, or\na constant `true` or `false` value.\n\n### Class `PathScurry`\n\nThe main interface. Defaults to an appropriate class based on the\ncurrent platform.\n\nUse `PathScurryWin32`, `PathScurryDarwin`, or `PathScurryPosix`\nif implementation-specific behavior is desired.\n\nAll walk methods may be called with a `WalkOptions` argument to\nwalk over the object's current working directory with the\nsupplied options.\n\n#### `async pw.walk(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nWalk the directory tree according to the options provided,\nresolving to an array of all entries found.\n\n#### `pw.walkSync(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nWalk the directory tree according to the options provided,\nreturning an array of all entries found.\n\n#### `pw.iterate(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nIterate over the directory asynchronously, for use with `for\nawait of`. This is also the default async iterator method.\n\n#### `pw.iterateSync(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nIterate over the directory synchronously, for use with `for of`.\nThis is also the default sync iterator method.\n\n#### `pw.stream(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nReturn a [Minipass](http://npm.im/minipass) stream that emits\neach entry or path string in the walk. Results are made available\nasynchronously.\n\n#### `pw.streamSync(entry?: string | Path | WalkOptions, opts?: WalkOptions)`\n\nReturn a [Minipass](http://npm.im/minipass) stream that emits\neach entry or path string in the walk. Results are made available\nsynchronously, meaning that the walk will complete in a single\ntick if the stream is fully consumed.\n\n#### `pw.cwd`\n\nPath object representing the current working directory for the\nPathScurry.\n\n#### `pw.chdir(path: string)`\n\nSet the new effective current working directory for the scurry\nobject, so that `path.relative()` and `path.relativePosix()`\nreturn values relative to the new cwd path.\n\n#### `pw.depth(path?: Path | string): number`\n\nReturn the depth of the specified path (or the PathScurry cwd)\nwithin the directory tree.\n\nRoot entries have a depth of `0`.\n\n#### `pw.resolve(...paths: string[])`\n\nCaching `path.resolve()`.\n\nSignificantly faster than `path.resolve()` if called repeatedly\nwith the same paths. Significantly slower otherwise, as it builds\nout the cached Path entries.\n\nTo get a `Path` object resolved from the `PathScurry`, use\n`pw.cwd.resolve(path)`. Note that `Path.resolve` only takes a\nsingle string argument, not multiple.\n\n#### `pw.resolvePosix(...paths: string[])`\n\nCaching `path.resolve()`, but always using posix style paths.\n\nThis is identical to `pw.resolve(...paths)` on posix systems (ie,\neverywhere except Windows).\n\nOn Windows, it returns the full absolute UNC path using `/`\nseparators. Ie, instead of `'C:\\\\foo\\\\bar`, it would return\n`//?/C:/foo/bar`.\n\n#### `pw.relative(path: string | Path): string`\n\nReturn the relative path from the PathWalker cwd to the supplied\npath string or entry.\n\nIf the nearest common ancestor is the root, then an absolute path\nis returned.\n\n#### `pw.relativePosix(path: string | Path): string`\n\nReturn the relative path from the PathWalker cwd to the supplied\npath string or entry, using `/` path separators.\n\nIf the nearest common ancestor is the root, then an absolute path\nis returned.\n\nOn posix platforms (ie, all platforms except Windows), this is\nidentical to `pw.relative(path)`.\n\nOn Windows systems, it returns the resulting string as a\n`/`-delimited path. If an absolute path is returned (because the\ntarget does not share a common ancestor with `pw.cwd`), then a\nfull absolute UNC path will be returned. Ie, instead of\n`'C:\\\\foo\\\\bar`, it would return `//?/C:/foo/bar`.\n\n#### `pw.basename(path: string | Path): string`\n\nReturn the basename of the provided string or Path.\n\n#### `pw.dirname(path: string | Path): string`\n\nReturn the parent directory of the supplied string or Path.\n\n#### `async pw.readdir(dir = pw.cwd, opts = { withFileTypes: true })`\n\nRead the directory and resolve to an array of strings if\n`withFileTypes` is explicitly set to `false` or Path objects\notherwise.\n\nCan be called as `pw.readdir({ withFileTypes: boolean })` as\nwell.\n\nReturns `[]` if no entries are found, or if any error occurs.\n\nNote that TypeScript return types will only be inferred properly\nfrom static analysis if the `withFileTypes` option is omitted, or\na constant `true` or `false` value.\n\n#### `pw.readdirSync(dir = pw.cwd, opts = { withFileTypes: true })`\n\nSynchronous `pw.readdir()`\n\n#### `async pw.readlink(link = pw.cwd, opts = { withFileTypes: false })`\n\nCall `fs.readlink` on the supplied string or Path object, and\nreturn the result.\n\nCan be called as `pw.readlink({ withFileTypes: boolean })` as\nwell.\n\nReturns `undefined` if any error occurs (for example, if the\nargument is not a symbolic link), or a `Path` object if\n`withFileTypes` is explicitly set to `true`, or a string\notherwise.\n\nNote that TypeScript return types will only be inferred properly\nfrom static analysis if the `withFileTypes` option is omitted, or\na constant `true` or `false` value.\n\n#### `pw.readlinkSync(link = pw.cwd, opts = { withFileTypes: false })`\n\nSynchronous `pw.readlink()`\n\n#### `async pw.lstat(entry = pw.cwd)`\n\nCall `fs.lstat` on the supplied string or Path object, and fill\nin as much information as possible, returning the updated `Path`\nobject.\n\nReturns `undefined` if the entry does not exist, or if any error\nis encountered.\n\nNote that some `Stats` data (such as `ino`, `dev`, and `mode`)\nwill not be supplied. For those things, you'll need to call\n`fs.lstat` yourself.\n\n#### `pw.lstatSync(entry = pw.cwd)`\n\nSynchronous `pw.lstat()`\n\n#### `pw.realpath(entry = pw.cwd, opts = { withFileTypes: false })`\n\nCall `fs.realpath` on the supplied string or Path object, and\nreturn the realpath if available.\n\nReturns `undefined` if any error occurs.\n\nMay be called as `pw.realpath({ withFileTypes: boolean })` to run\non `pw.cwd`.\n\n#### `pw.realpathSync(entry = pw.cwd, opts = { withFileTypes: false })`\n\nSynchronous `pw.realpath()`\n\n### Class `Path` implements [fs.Dirent](https://nodejs.org/docs/latest/api/fs.html#class-fsdirent)\n\nObject representing a given path on the filesystem, which may or\nmay not exist.\n\nNote that the actual class in use will be either `PathWin32` or\n`PathPosix`, depending on the implementation of `PathScurry` in\nuse. They differ in the separators used to split and join path\nstrings, and the handling of root paths.\n\nIn `PathPosix` implementations, paths are split and joined using\nthe `'/'` character, and `'/'` is the only root path ever in use.\n\nIn `PathWin32` implementations, paths are split using either\n`'/'` or `'\\\\'` and joined using `'\\\\'`, and multiple roots may\nbe in use based on the drives and UNC paths encountered. UNC\npaths such as `//?/C:/` that identify a drive letter, will be\ntreated as an alias for the same root entry as their associated\ndrive letter (in this case `'C:\\\\'`).\n\n#### `path.name`\n\nName of this file system entry.\n\n**Important**: _always_ test the path name against any test\nstring using the `isNamed` method, and not by directly comparing\nthis string. Otherwise, unicode path strings that the system sees\nas identical will not be properly treated as the same path,\nleading to incorrect behavior and possible security issues.\n\n#### `path.isNamed(name: string): boolean`\n\nReturn true if the path is a match for the given path name. This\nhandles case sensitivity and unicode normalization.\n\nNote: even on case-sensitive systems, it is **not** safe to test\nthe equality of the `.name` property to determine whether a given\npathname matches, due to unicode normalization mismatches.\n\nAlways use this method instead of testing the `path.name`\nproperty directly.\n\n#### `path.isCWD`\n\nSet to true if this `Path` object is the current working\ndirectory of the `PathScurry` collection that contains it.\n\n#### `path.getType()`\n\nReturns the type of the Path object, `'File'`, `'Directory'`,\netc.\n\n#### `path.isType(t: type)`\n\nReturns true if `is{t}()` returns true.\n\nFor example, `path.isType('Directory')` is equivalent to\n`path.isDirectory()`.\n\n#### `path.depth()`\n\nReturn the depth of the Path entry within the directory tree.\nRoot paths have a depth of `0`.\n\n#### `path.fullpath()`\n\nThe fully resolved path to the entry.\n\n#### `path.fullpathPosix()`\n\nThe fully resolved path to the entry, using `/` separators.\n\nOn posix systems, this is identical to `path.fullpath()`. On\nwindows, this will return a fully resolved absolute UNC path\nusing `/` separators. Eg, instead of `'C:\\\\foo\\\\bar'`, it will\nreturn `'//?/C:/foo/bar'`.\n\n#### `path.isFile()`, `path.isDirectory()`, etc.\n\nSame as the identical `fs.Dirent.isX()` methods.\n\n#### `path.isUnknown()`\n\nReturns true if the path's type is unknown. Always returns true\nwhen the path is known to not exist.\n\n#### `path.resolve(p: string)`\n\nReturn a `Path` object associated with the provided path string\nas resolved from the current Path object.\n\n#### `path.relative(): string`\n\nReturn the relative path from the PathWalker cwd to the supplied\npath string or entry.\n\nIf the nearest common ancestor is the root, then an absolute path\nis returned.\n\n#### `path.relativePosix(): string`\n\nReturn the relative path from the PathWalker cwd to the supplied\npath string or entry, using `/` path separators.\n\nIf the nearest common ancestor is the root, then an absolute path\nis returned.\n\nOn posix platforms (ie, all platforms except Windows), this is\nidentical to `pw.relative(path)`.\n\nOn Windows systems, it returns the resulting string as a\n`/`-delimited path. If an absolute path is returned (because the\ntarget does not share a common ancestor with `pw.cwd`), then a\nfull absolute UNC path will be returned. Ie, instead of\n`'C:\\\\foo\\\\bar`, it would return `//?/C:/foo/bar`.\n\n#### `async path.readdir()`\n\nReturn an array of `Path` objects found by reading the associated\npath entry.\n\nIf path is not a directory, or if any error occurs, returns `[]`,\nand marks all children as provisional and non-existent.\n\n#### `path.readdirSync()`\n\nSynchronous `path.readdir()`\n\n#### `async path.readlink()`\n\nReturn the `Path` object referenced by the `path` as a symbolic\nlink.\n\nIf the `path` is not a symbolic link, or any error occurs,\nreturns `undefined`.\n\n#### `path.readlinkSync()`\n\nSynchronous `path.readlink()`\n\n#### `async path.lstat()`\n\nCall `lstat` on the path object, and fill it in with details\ndetermined.\n\nIf path does not exist, or any other error occurs, returns\n`undefined`, and marks the path as \"unknown\" type.\n\n#### `path.lstatSync()`\n\nSynchronous `path.lstat()`\n\n#### `async path.realpath()`\n\nCall `realpath` on the path, and return a Path object\ncorresponding to the result, or `undefined` if any error occurs.\n\n#### `path.realpathSync()`\n\nSynchornous `path.realpath()`",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{64/04/2818fad0b42dea1eb364233ea682d49f4a7ac5c9e7bae3dfb5458eebb36f5e6e599cc9cd28046da2286c63a27e57f1e665a4586098ae3672c4aa6ba98291 → 24/4e/1a8e4dd9b100c5cb45a8ee6bd22929672e3a259569dcba36bfdbcd9a6365e27b8f93cafe74544d6338485aa78a27ab08c2e64b65e1c0427fd3d8e50cd9bf}

@@ -385,7 +385,7 @@
   "dist-tags": {
     "latest": "1.3.2"
   },
-  "_rev": "752-a51a5f1316e844fc",
+  "_rev": "892-5ba2f3ed28cebc71",
   "_id": "fast-fifo",
   "readme": "# fast-fifo\n\nA fast fifo implementation similar to the one powering nextTick in Node.js core\n\n```\nnpm install fast-fifo\n```\n\nUses a linked list of growing fixed sized arrays to implement the FIFO to avoid\nallocating a wrapper object for each item.\n\n## Usage\n\n``` js\nconst FIFO = require('fast-fifo')\n\nconst q = new FIFO()\n\nq.push('hello')\nq.push('world')\n\nq.shift() // returns hello\nq.shift() // returns world\n```\n\n## API\n\n#### `q = new FIFO()`\n\nCreate a new FIFO.\n\n#### `q.push(value)`\n\nPush a value to the FIFO. `value` can be anything other than undefined.\n\n#### `value = q.shift()`\n\nReturn the oldest value from the FIFO.\n\n#### `q.clear()`\n\nRemove all values from the FIFO.\n\n#### `bool = q.isEmpty()`\n\nReturns `true` if the FIFO is empty and false otherwise.\n\n#### `value = q.peek()`\n\nReturn the oldest value from the FIFO without shifting it out.\n\n#### `len = q.length`\n\nGet the number of entries remaining in the FIFO.\n\n## Benchmarks\n\nIncluded in bench.js is a simple benchmark that benchmarks this against a simple\nlinked list based FIFO.\n\nOn my machine the benchmark looks like this:\n\n```\nfifo bulk push and shift: 2881.508ms\nfifo individual push and shift: 3248.437ms\nfast-fifo bulk push and shift: 1606.972ms\nfast-fifo individual push and shift: 1328.064ms\nfifo bulk push and shift: 3266.902ms\nfifo individual push and shift: 3320.944ms\nfast-fifo bulk push and shift: 1858.307ms\nfast-fifo individual push and shift: 1516.983ms\n```\n\nYMMV\n\n## License\n\nMIT",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{29/58/5825e855c83fa8ed2d2ab5c3d4893d0e8219e4502830c1ac99b2b27ffbb2165d130eba53f88fdf8b8e77202e546baa3f951c0d6463f70e9a02c0485219f9 → 25/d3/778d07fed5c156900061f2147aa30d03afec2ec95023591d8476fab3830c591336c859b574d1730f31e735c6a652b1e2026e23fed8618bbb59d3fbd8abbf}

@@ -5384,12 +5384,117 @@
       },
       "_hasShrinkwrap": false,
       "contributors": []
+    },
+    "4.2.12": {
+      "name": "@smithy/middleware-stack",
+      "version": "4.2.12",
+      "description": "Provides a means for composing multiple middleware functions into a single handler",
+      "scripts": {
+        "build": "concurrently 'yarn:build:cjs' 'yarn:build:es' 'yarn:build:types && yarn build:types:downlevel'",
+        "build:cjs": "node ../../scripts/inline middleware-stack",
+        "build:es": "yarn g:tsc -p tsconfig.es.json",
+        "build:types": "yarn g:tsc -p tsconfig.types.json",
+        "build:types:downlevel": "premove dist-types/ts3.4 && downlevel-dts dist-types dist-types/ts3.4",
+        "stage-release": "premove .release && yarn pack && mkdir ./.release && tar zxvf ./package.tgz --directory ./.release && rm ./package.tgz",
+        "clean": "premove dist-cjs dist-es dist-types tsconfig.cjs.tsbuildinfo tsconfig.es.tsbuildinfo tsconfig.types.tsbuildinfo",
+        "lint": "eslint -c ../../.eslintrc.js \"src/**/*.ts\"",
+        "format": "prettier --config ../../prettier.config.js --ignore-path ../../.prettierignore --write \"**/*.{ts,md,json}\"",
+        "extract:docs": "api-extractor run --local",
+        "test": "yarn g:vitest run",
+        "test:watch": "yarn g:vitest watch"
+      },
+      "author": {
+        "name": "AWS SDK for JavaScript Team",
+        "url": "https://aws.amazon.com/javascript/"
+      },
+      "license": "Apache-2.0",
+      "sideEffects": false,
+      "main": "./dist-cjs/index.js",
+      "module": "./dist-es/index.js",
+      "types": "./dist-types/index.d.ts",
+      "dependencies": {
+        "@smithy/types": "^4.13.1",
+        "tslib": "^2.6.2"
+      },
+      "devDependencies": {
+        "concurrently": "7.0.0",
+        "downlevel-dts": "0.10.1",
+        "premove": "4.0.0",
+        "typedoc": "0.23.23"
+      },
+      "engines": {
+        "node": ">=18.0.0"
+      },
+      "typesVersions": {
+        "<4.5": {
+          "dist-types/*": [
+            "dist-types/ts3.4/*"
+          ]
+        }
+      },
+      "homepage": "https://github.com/smithy-lang/smithy-typescript/tree/main/packages/middleware-stack",
+      "repository": {
+        "type": "git",
+        "url": "git+https://github.com/smithy-lang/smithy-typescript.git",
+        "directory": "packages/middleware-stack"
+      },
+      "typedoc": {
+        "entryPoint": "src/index.ts"
+      },
+      "publishConfig": {
+        "directory": ".release/package"
+      },
+      "_id": "@smithy/middleware-stack@4.2.12",
+      "gitHead": "0bdca155aded1af3d3a12e2d537babdfde8f30ac",
+      "bugs": {
+        "url": "https://github.com/smithy-lang/smithy-typescript/issues"
+      },
+      "_nodeVersion": "18.20.8",
+      "_npmVersion": "10.8.2",
+      "dist": {
+        "integrity": "sha512-kruC5gRHwsCOuyCd4ouQxYjgRAym2uDlCvQ5acuMtRrcdfg7mFBg6blaxcJ09STpt3ziEkis6bhg1uwrWU7txw==",
+        "shasum": "96b43b2fab0d4a6723f813f76b72418b0fdb6ba0",
+        "tarball": "https://verdaccio.mrsdev.ru/@smithy%2fmiddleware-stack/-/middleware-stack-4.2.12.tgz",
+        "fileCount": 13,
+        "unpackedSize": 43079,
+        "signatures": [
+          {
+            "keyid": "SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U",
+            "sig": "MEUCIFRRDLiU/Qx/j2JWW2oqGVQCdyllPh69SqcwqJfUuudGAiEAnYrZsKKcvAZTbo2uJr/7bNcLet+g/XR6yCme9x8wyVs="
+          }
+        ]
+      },
+      "_npmUser": {
+        "name": "smithy-team",
+        "email": "aws-javascript-sdk-team+npm@amazon.com"
+      },
+      "directories": {},
+      "maintainers": [
+        {
+          "name": "trivikr-aws",
+          "email": "trivikr@amazon.com"
+        },
+        {
+          "name": "smithy-team",
+          "email": "aws-javascript-sdk-team+npm@amazon.com"
+        },
+        {
+          "name": "aws-sdk-bot",
+          "email": "aws-sdk-js-automation@amazon.com"
+        }
+      ],
+      "_npmOperationalInternal": {
+        "host": "s3://npm-registry-packages-npm-production",
+        "tmp": "tmp/middleware-stack_4.2.12_1773327521452_0.7863020721469016"
+      },
+      "_hasShrinkwrap": false,
+      "contributors": []
     }
   },
   "time": {
     "created": "2023-06-19T22:00:45.977Z",
     "1.0.0": "2023-06-19T22:00:46.398Z",
-    "modified": "2026-03-04T23:13:37.826Z",
+    "modified": "2026-03-12T14:58:41.792Z",
     "1.0.1": "2023-06-20T19:26:39.825Z",
     "1.0.2": "2023-07-06T16:24:43.841Z",
     "1.1.0": "2023-07-24T20:51:41.244Z",
@@ -5441,13 +5546,14 @@
     "4.2.8": "2026-01-13T18:33:29.892Z",
     "4.2.9": "2026-02-23T17:40:52.425Z",
     "4.2.10": "2026-02-24T20:04:23.726Z",
-    "4.2.11": "2026-03-04T23:13:37.689Z"
+    "4.2.11": "2026-03-04T23:13:37.689Z",
+    "4.2.12": "2026-03-12T14:58:41.618Z"
   },
   "users": {},
   "dist-tags": {
-    "latest": "4.2.11"
+    "latest": "4.2.12"
   },
-  "_rev": "237-67673e9b724be2e2",
+  "_rev": "276-db0255403af78428",
   "_id": "@smithy/middleware-stack",
   "readme": "# @smithy/middleware-stack\n\n[![NPM version](https://img.shields.io/npm/v/@smithy/middleware-stack/latest.svg)](https://www.npmjs.com/package/@smithy/middleware-stack)\n[![NPM downloads](https://img.shields.io/npm/dm/@smithy/middleware-stack.svg)](https://www.npmjs.com/package/@smithy/middleware-stack)\n\nThe package contains an implementation of middleware stack interface. Middleware\nstack is a structure storing middleware in specified order and resolve these\nmiddleware into a single handler.\n\nA middleware stack has five `Step`s, each of them represents a specific request life cycle:\n\n- **initialize**: The input is being prepared. Examples of typical initialization tasks include injecting default options computing derived parameters.\n\n- **serialize**: The input is complete and ready to be serialized. Examples of typical serialization tasks include input validation and building an HTTP request from user input.\n\n- **build**: The input has been serialized into an HTTP request, but that request may require further modification. Any request alterations will be applied to all retries. Examples of typical build tasks include injecting HTTP headers that describe a stable aspect of the request, such as `Content-Length` or a body checksum.\n\n- **finalizeRequest**: The request is being prepared to be sent over the wire. The request in this stage should already be semantically complete and should therefore only be altered to match the recipient's expectations. Examples of typical finalization tasks include request signing and injecting hop-by-hop headers.\n\n- **deserialize**: The response has arrived, the middleware here will deserialize the raw response object to structured response\n\n## Adding Middleware\n\nThere are two ways to add middleware to a middleware stack. They both add middleware to specified `Step` but they provide fine-grained location control differently.\n\n### Absolute Location\n\nYou can add middleware to specified step with:\n\n```javascript\nstack.add(middleware, {\n  step: \"finalizeRequest\",\n});\n```\n\nThis approach works for most cases. Sometimes you want your middleware to be executed in the front of the `Step`, you can set the `Priority` to `high`. Set the `Priority` to `low` then this middleware will be executed at the end of `Step`:\n\n```javascript\nstack.add(middleware, {\n  step: \"finalizeRequest\",\n  priority: \"high\",\n});\n```\n\nIf multiple middleware is added to same `step` with same `priority`, the order of them is determined by the order of adding them.\n\n### Relative Location\n\nIn some cases, you might want to execute your middleware before some other known middleware, then you can use `addRelativeTo()`:\n\n```javascript\nstack.add(middleware, {\n  step: \"finalizeRequest\",\n  name: \"myMiddleware\",\n});\nstack.addRelativeTo(anotherMiddleware, {\n  relation: \"before\", //or 'after'\n  toMiddleware: \"myMiddleware\",\n});\n```\n\n## Removing Middleware\n\nYou can remove middleware by name one at a time:\n\n```javascript\nstack.remove(\"Middleware1\");\n```\n\nIf you specify tags for middleware, you can remove multiple middleware at a time according to tag:\n\n```javascript\nstack.add(middleware, {\n  step: \"finalizeRequest\",\n  tags: [\"final\"],\n});\nstack.removeByTag(\"final\");\n```",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{44/93/581a697fb6685b1d76e34360a1b30cc854cfd61c030af31fea7e9a0758ec00f96f88056fb2db4007494a6f04fdc9faa64661c4258fce11a173bee542e4bf → 29/ae/265e1f6be34e9e6976713f2f20685ed2eb30993e20de3f4d86dfa71bdc135792dfcf596e3f99dfee05f0cc590b4776142a11e29ced3c988bde00db793f2e}

@@ -14908,10 +14908,141 @@
       },
       "_hasShrinkwrap": false,
       "contributors": []
+    },
+    "11.2.7": {
+      "name": "lru-cache",
+      "description": "A cache object that deletes the least-recently-used items.",
+      "version": "11.2.7",
+      "author": {
+        "name": "Isaac Z. Schlueter",
+        "email": "i@izs.me"
+      },
+      "keywords": [
+        "mru",
+        "lru",
+        "cache"
+      ],
+      "sideEffects": false,
+      "scripts": {
+        "build": "npm run prepare",
+        "prepare": "tshy && bash fixup.sh",
+        "pretest": "npm run prepare",
+        "presnap": "npm run prepare",
+        "test": "tap",
+        "snap": "tap",
+        "preversion": "npm test",
+        "postversion": "npm publish",
+        "prepublishOnly": "git push origin --follow-tags",
+        "format": "prettier --write .",
+        "typedoc": "typedoc --tsconfig ./.tshy/esm.json ./src/*.ts",
+        "benchmark-results-typedoc": "bash scripts/benchmark-results-typedoc.sh",
+        "prebenchmark": "npm run prepare",
+        "benchmark": "make -C benchmark",
+        "preprofile": "npm run prepare",
+        "profile": "make -C benchmark profile"
+      },
+      "main": "./dist/commonjs/index.min.js",
+      "types": "./dist/commonjs/index.d.ts",
+      "tshy": {
+        "exports": {
+          "./raw": "./src/index.ts",
+          ".": {
+            "import": {
+              "types": "./dist/esm/index.d.ts",
+              "default": "./dist/esm/index.min.js"
+            },
+            "require": {
+              "types": "./dist/commonjs/index.d.ts",
+              "default": "./dist/commonjs/index.min.js"
+            }
+          }
+        }
+      },
+      "repository": {
+        "type": "git",
+        "url": "git+ssh://git@github.com/isaacs/node-lru-cache.git"
+      },
+      "devDependencies": {
+        "@types/node": "^24.3.0",
+        "benchmark": "^2.1.4",
+        "esbuild": "^0.25.9",
+        "marked": "^4.2.12",
+        "mkdirp": "^3.0.1",
+        "prettier": "^3.6.2",
+        "tap": "^21.1.0",
+        "tshy": "^3.0.2",
+        "typedoc": "^0.28.12"
+      },
+      "license": "BlueOak-1.0.0",
+      "engines": {
+        "node": "20 || >=22"
+      },
+      "exports": {
+        "./raw": {
+          "import": {
+            "types": "./dist/esm/index.d.ts",
+            "default": "./dist/esm/index.js"
+          },
+          "require": {
+            "types": "./dist/commonjs/index.d.ts",
+            "default": "./dist/commonjs/index.js"
+          }
+        },
+        ".": {
+          "import": {
+            "types": "./dist/esm/index.d.ts",
+            "default": "./dist/esm/index.min.js"
+          },
+          "require": {
+            "types": "./dist/commonjs/index.d.ts",
+            "default": "./dist/commonjs/index.min.js"
+          }
+        }
+      },
+      "type": "module",
+      "module": "./dist/esm/index.min.js",
+      "gitHead": "e787b9f77770d696328dca3e964b85e7f8e8aac1",
+      "_id": "lru-cache@11.2.7",
+      "bugs": {
+        "url": "https://github.com/isaacs/node-lru-cache/issues"
+      },
+      "homepage": "https://github.com/isaacs/node-lru-cache#readme",
+      "_nodeVersion": "25.6.1",
+      "_npmVersion": "11.10.0",
+      "dist": {
+        "integrity": "sha512-aY/R+aEsRelme17KGQa/1ZSIpLpNYYrhcrepKTZgE+W3WM16YMCaPwOHLHsmopZHELU0Ojin1lPVxKR0MihncA==",
+        "shasum": "9127402617f34cd6767b96daee98c28e74458d35",
+        "tarball": "https://verdaccio.mrsdev.ru/lru-cache/-/lru-cache-11.2.7.tgz",
+        "fileCount": 17,
+        "unpackedSize": 844139,
+        "signatures": [
+          {
+            "keyid": "SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U",
+            "sig": "MEYCIQD0YaholA20n1SUgqI2PEXwX8npiumVCyYHgH6hqUuAcQIhAJdKyyx27fPfu89ayKe5n2IW0D7NquzPbT4VBS6/sZuR"
+          }
+        ]
+      },
+      "_npmUser": {
+        "name": "isaacs",
+        "email": "i@izs.me"
+      },
+      "directories": {},
+      "maintainers": [
+        {
+          "name": "isaacs",
+          "email": "i@izs.me"
+        }
+      ],
+      "_npmOperationalInternal": {
+        "host": "s3://npm-registry-packages-npm-production",
+        "tmp": "tmp/lru-cache_11.2.7_1773416661359_0.9919286446941677"
+      },
+      "_hasShrinkwrap": false,
+      "contributors": []
     }
   },
   "time": {
-    "modified": "2026-02-10T16:21:11.084Z",
+    "modified": "2026-03-13T15:44:21.641Z",
     "created": "2011-07-16T09:09:00.041Z",
     "1.0.1": "2011-07-16T09:09:00.041Z",
     "1.0.2": "2011-07-16T09:09:00.041Z",
@@ -15063,11 +15194,12 @@
     "11.2.3": "2025-11-30T23:09:53.647Z",
     "11.2.4": "2025-11-30T23:29:17.076Z",
     "11.2.5": "2026-01-26T00:23:31.313Z",
-    "11.2.6": "2026-02-10T16:21:10.947Z"
+    "11.2.6": "2026-02-10T16:21:10.947Z",
+    "11.2.7": "2026-03-13T15:44:21.508Z"
   },
   "users": {},
   "dist-tags": {
-    "latest": "11.2.6",
+    "latest": "11.2.7",
     "legacy": "4.1.5",
     "v7.2-backport": "7.2.3",
     "v7.1-backport": "7.1.3",
@@ -15079,7 +15211,7 @@
     "v7.4-backport": "7.4.5",
     "legacy-v10": "10.4.3"
   },
-  "_rev": "2814-05669c7bc4dcbfcd",
+  "_rev": "3020-74a8f79b629c888c",
   "_id": "lru-cache",
   "readme": "# lru-cache\n\nA cache object that deletes the least-recently-used items.\n\nSpecify a max number of the most recently used items that you\nwant to keep, and this cache will keep that many of the most\nrecently accessed items.\n\nThis is not primarily a TTL cache, and does not make strong TTL\nguarantees. There is no preemptive pruning of expired items by\ndefault, but you _may_ set a TTL on the cache or on a single\n`set`. If you do so, it will treat expired items as missing, and\ndelete them when fetched. If you are more interested in TTL\ncaching than LRU caching, check out\n[@isaacs/ttlcache](http://npm.im/@isaacs/ttlcache).\n\nAs of version 7, this is one of the most performant LRU\nimplementations available in JavaScript, and supports a wide\ndiversity of use cases. However, note that using some of the\nfeatures will necessarily impact performance, by causing the\ncache to have to do more work. See the \"Performance\" section\nbelow.\n\n## Installation\n\n```bash\nnpm install lru-cache --save\n```\n\n## Usage\n\n```js\n// hybrid module, either works\nimport { LRUCache } from 'lru-cache'\n// or:\nconst { LRUCache } = require('lru-cache')\n// or in minified form for web browsers:\nimport { LRUCache } from 'http://unpkg.com/lru-cache@9/dist/mjs/index.min.mjs'\n\n// At least one of 'max', 'ttl', or 'maxSize' is required, to prevent\n// unsafe unbounded storage.\n//\n// In most cases, it's best to specify a max for performance, so all\n// the required memory allocation is done up-front.\n//\n// All the other options are optional, see the sections below for\n// documentation on what each one does.  Most of them can be\n// overridden for specific items in get()/set()\nconst options = {\n  max: 500,\n\n  // for use with tracking overall storage size\n  maxSize: 5000,\n  sizeCalculation: (value, key) => {\n    return 1\n  },\n\n  // for use when you need to clean up something when objects\n  // are evicted from the cache\n  dispose: (value, key, reason) => {\n    freeFromMemoryOrWhatever(value)\n  },\n\n  // for use when you need to know that an item is being inserted\n  // note that this does NOT allow you to prevent the insertion,\n  // it just allows you to know about it.\n  onInsert: (value, key, reason) => {\n    logInsertionOrWhatever(key, value)\n  },\n\n  // how long to live in ms\n  ttl: 1000 * 60 * 5,\n\n  // return stale items before removing from cache?\n  allowStale: false,\n\n  updateAgeOnGet: false,\n  updateAgeOnHas: false,\n\n  // async method to use for cache.fetch(), for\n  // stale-while-revalidate type of behavior\n  fetchMethod: async (key, staleValue, { options, signal, context }) => {},\n}\n\nconst cache = new LRUCache(options)\n\ncache.set('key', 'value')\ncache.get('key') // \"value\"\n\n// non-string keys ARE fully supported\n// but note that it must be THE SAME object, not\n// just a JSON-equivalent object.\nvar someObject = { a: 1 }\ncache.set(someObject, 'a value')\n// Object keys are not toString()-ed\ncache.set('[object Object]', 'a different value')\nassert.equal(cache.get(someObject), 'a value')\n// A similar object with same keys/values won't work,\n// because it's a different object identity\nassert.equal(cache.get({ a: 1 }), undefined)\n\ncache.clear() // empty the cache\n```\n\nIf you put more stuff in the cache, then less recently used items\nwill fall out. That's what an LRU cache is.\n\nFor full description of the API and all options, please see [the\nLRUCache typedocs](https://isaacs.github.io/node-lru-cache/)\n\n## Storage Bounds Safety\n\nThis implementation aims to be as flexible as possible, within\nthe limits of safe memory consumption and optimal performance.\n\nAt initial object creation, storage is allocated for `max` items.\nIf `max` is set to zero, then some performance is lost, and item\ncount is unbounded. Either `maxSize` or `ttl` _must_ be set if\n`max` is not specified.\n\nIf `maxSize` is set, then this creates a safe limit on the\nmaximum storage consumed, but without the performance benefits of\npre-allocation. When `maxSize` is set, every item _must_ provide\na size, either via the `sizeCalculation` method provided to the\nconstructor, or via a `size` or `sizeCalculation` option provided\nto `cache.set()`. The size of every item _must_ be a positive\ninteger.\n\nIf neither `max` nor `maxSize` are set, then `ttl` tracking must\nbe enabled. Note that, even when tracking item `ttl`, items are\n_not_ preemptively deleted when they become stale, unless\n`ttlAutopurge` is enabled. Instead, they are only purged the\nnext time the key is requested. Thus, if `ttlAutopurge`, `max`,\nand `maxSize` are all not set, then the cache will potentially\ngrow unbounded.\n\nIn this case, a warning is printed to standard error. Future\nversions may require the use of `ttlAutopurge` if `max` and\n`maxSize` are not specified.\n\nIf you truly wish to use a cache that is bound _only_ by TTL\nexpiration, consider using a `Map` object, and calling\n`setTimeout` to delete entries when they expire. It will perform\nmuch better than an LRU cache.\n\nHere is an implementation you may use, under the same\n[license](./LICENSE) as this package:\n\n```js\n// a storage-unbounded ttl cache that is not an lru-cache\nconst cache = {\n  data: new Map(),\n  timers: new Map(),\n  set: (k, v, ttl) => {\n    if (cache.timers.has(k)) {\n      clearTimeout(cache.timers.get(k))\n    }\n    cache.timers.set(\n      k,\n      setTimeout(() => cache.delete(k), ttl),\n    )\n    cache.data.set(k, v)\n  },\n  get: k => cache.data.get(k),\n  has: k => cache.data.has(k),\n  delete: k => {\n    if (cache.timers.has(k)) {\n      clearTimeout(cache.timers.get(k))\n    }\n    cache.timers.delete(k)\n    return cache.data.delete(k)\n  },\n  clear: () => {\n    cache.data.clear()\n    for (const v of cache.timers.values()) {\n      clearTimeout(v)\n    }\n    cache.timers.clear()\n  },\n}\n```\n\nIf that isn't to your liking, check out\n[@isaacs/ttlcache](http://npm.im/@isaacs/ttlcache).\n\n## Storing Undefined Values\n\nThis cache never stores undefined values, as `undefined` is used\ninternally in a few places to indicate that a key is not in the\ncache.\n\nYou may call `cache.set(key, undefined)`, but this is just\nan alias for `cache.delete(key)`. Note that this has the effect\nthat `cache.has(key)` will return _false_ after setting it to\nundefined.\n\n```js\ncache.set(myKey, undefined)\ncache.has(myKey) // false!\n```\n\nIf you need to track `undefined` values, and still note that the\nkey is in the cache, an easy workaround is to use a sigil object\nof your own.\n\n```js\nimport { LRUCache } from 'lru-cache'\nconst undefinedValue = Symbol('undefined')\nconst cache = new LRUCache(...)\nconst mySet = (key, value) =>\n  cache.set(key, value === undefined ? undefinedValue : value)\nconst myGet = (key, value) => {\n  const v = cache.get(key)\n  return v === undefinedValue ? undefined : v\n}\n```\n\n## Performance\n\nAs of January 2022, version 7 of this library is one of the most\nperformant LRU cache implementations in JavaScript.\n\nBenchmarks can be extremely difficult to get right. In\nparticular, the performance of set/get/delete operations on\nobjects will vary _wildly_ depending on the type of key used. V8\nis highly optimized for objects with keys that are short strings,\nespecially integer numeric strings. Thus any benchmark which\ntests _solely_ using numbers as keys will tend to find that an\nobject-based approach performs the best.\n\nNote that coercing _anything_ to strings to use as object keys is\nunsafe, unless you can be 100% certain that no other type of\nvalue will be used. For example:\n\n```js\nconst myCache = {}\nconst set = (k, v) => (myCache[k] = v)\nconst get = k => myCache[k]\n\nset({}, 'please hang onto this for me')\nset('[object Object]', 'oopsie')\n```\n\nAlso beware of \"Just So\" stories regarding performance. Garbage\ncollection of large (especially: deep) object graphs can be\nincredibly costly, with several \"tipping points\" where it\nincreases exponentially. As a result, putting that off until\nlater can make it much worse, and less predictable. If a library\nperforms well, but only in a scenario where the object graph is\nkept shallow, then that won't help you if you are using large\nobjects as keys.\n\nIn general, when attempting to use a library to improve\nperformance (such as a cache like this one), it's best to choose\nan option that will perform well in the sorts of scenarios where\nyou'll actually use it.\n\nThis library is optimized for repeated gets and minimizing\neviction time, since that is the expected need of a LRU. Set\noperations are somewhat slower on average than a few other\noptions, in part because of that optimization. It is assumed\nthat you'll be caching some costly operation, ideally as rarely\nas possible, so optimizing set over get would be unwise.\n\nIf performance matters to you:\n\n1. If it's at all possible to use small integer values as keys,\n   and you can guarantee that no other types of values will be\n   used as keys, then do that, and use a cache such as\n   [lru-fast](https://npmjs.com/package/lru-fast), or\n   [mnemonist's\n   LRUCache](https://yomguithereal.github.io/mnemonist/lru-cache)\n   which uses an Object as its data store.\n\n2. Failing that, if at all possible, use short non-numeric\n   strings (ie, less than 256 characters) as your keys, and use\n   [mnemonist's\n   LRUCache](https://yomguithereal.github.io/mnemonist/lru-cache).\n\n3. If the types of your keys will be anything else, especially\n   long strings, strings that look like floats, objects, or some\n   mix of types, or if you aren't sure, then this library will\n   work well for you.\n\n   If you do not need the features that this library provides\n   (like asynchronous fetching, a variety of TTL staleness\n   options, and so on), then [mnemonist's\n   LRUMap](https://yomguithereal.github.io/mnemonist/lru-map) is\n   a very good option, and just slightly faster than this module\n   (since it does considerably less).\n\n4. Do not use a `dispose` function, size tracking, or especially\n   ttl behavior, unless absolutely needed. These features are\n   convenient, and necessary in some use cases, and every attempt\n   has been made to make the performance impact minimal, but it\n   isn't nothing.\n\n## Testing\n\nWhen writing tests that involve TTL-related functionality, note\nthat this module creates an internal reference to the global\n`performance` or `Date` objects at import time. If you import it\nstatically at the top level, those references cannot be mocked or\noverridden in your test environment.\n\nTo avoid this, dynamically import the package within your tests\nso that the references are captured after your mocks are applied.\nFor example:\n\n```ts\n// ❌ Not recommended\nimport { LRUCache } from 'lru-cache'\n// mocking timers, e.g. jest.useFakeTimers()\n\n// ✅ Recommended for TTL tests\n// mocking timers, e.g. jest.useFakeTimers()\nconst { LRUCache } = await import('lru-cache')\n```\n\nThis ensures that your mocked timers or time sources are\nrespected when testing TTL behavior.\n\nAdditionally, you can pass in a `perf` option when creating your\nLRUCache instance. This option accepts any object with a `now`\nmethod that returns a number.\n\nFor example, this would be a very bare-bones time-mocking system\nyou could use in your tests, without any particular test\nframework:\n\n```ts\nimport { LRUCache } from 'lru-cache'\n\nlet myClockTime = 0\n\nconst cache = new LRUCache<string>({\n  max: 10,\n  ttl: 1000,\n  perf: {\n    now: () => myClockTime,\n  },\n})\n\n// run tests, updating myClockTime as needed\n```\n\n## Breaking Changes in Version 7\n\nThis library changed to a different algorithm and internal data\nstructure in version 7, yielding significantly better\nperformance, albeit with some subtle changes as a result.\n\nIf you were relying on the internals of LRUCache in version 6 or\nbefore, it probably will not work in version 7 and above.\n\n## Breaking Changes in Version 8\n\n- The `fetchContext` option was renamed to `context`, and may no\n  longer be set on the cache instance itself.\n- Rewritten in TypeScript, so pretty much all the types moved\n  around a lot.\n- The AbortController/AbortSignal polyfill was removed. For this\n  reason, **Node version 16.14.0 or higher is now required**.\n- Internal properties were moved to actual private class\n  properties.\n- Keys and values must not be `null` or `undefined`.\n- Minified export available at `'lru-cache/min'`, for both CJS\n  and MJS builds.\n\n## Breaking Changes in Version 9\n\n- Named export only, no default export.\n- AbortController polyfill returned, albeit with a warning when\n  used.\n\n## Breaking Changes in Version 10\n\n- `cache.fetch()` return type is now `Promise<V | undefined>`\n  instead of `Promise<V | void>`. This is an irrelevant change\n  practically speaking, but can require changes for TypeScript\n  users.\n\nFor more info, see the [change log](CHANGELOG.md).",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{69/f4/2a91678eb891d05638662cf4b60074a10c1e1e25a7e7fabe1f01527eea35e7b4f57ffab04ee13233b990a283848761681e38fbec4d2bde356da75d6ee249 → 2a/25/84e3fe66a8425ab99b9a343c8163087132f00768025adfe0be7a196c5e47955b2899d77f2f852b4ede7666645f8538e74c5e34a0942a59ac527eb29d4d43}

@@ -1186,7 +1186,7 @@
   "dist-tags": {
     "latest": "0.11.10"
   },
-  "_rev": "871-b73647da030e4de1",
+  "_rev": "973-e3eb5b08d441aa3a",
   "_id": "process",
   "readme": "# process\n\n```require('process');``` just like any other module.\n\nWorks in node.js and browsers via the browser.js shim provided with the module.\n\n## browser implementation\n\nThe goal of this module is not to be a full-fledged alternative to the builtin process module. This module mostly exists to provide the nextTick functionality and little more. We keep this module lean because it will often be included by default by tools like browserify when it detects a module has used the `process` global.\n\nIt also exposes a \"browser\" member (i.e. `process.browser`) which is `true` in this implementation but `undefined` in node. This can be used in isomorphic code that adjusts it's behavior depending on which environment it's running in. \n\nIf you are looking to provide other process methods, I suggest you monkey patch them onto the process global in your app. A list of user created patches is below.\n\n* [hrtime](https://github.com/kumavis/browser-process-hrtime)\n* [stdout](https://github.com/kumavis/browser-stdout)\n\n## package manager notes\n\nIf you are writing a bundler to package modules for client side use, make sure you use the ```browser``` field hint in package.json.\n\nSee https://gist.github.com/4339901 for details.\n\nThe [browserify](https://github.com/substack/node-browserify) module will properly handle this field when bundling your files.",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{96/01/65081a9d4456512d9508e97e2f44e17c46bea7a2e2eb1a654efb6b9094b03cc079399242745640ccceb50b1972460f4948be13ee49258f078d02e9a7b433 → 2c/26/1861c84d79124750e7b6929ef716f712cff25accc2bcad698447eca190506391b96aa944e093b110c9c968ed62654b2d7f11352cce6fc34679e777cac2ad}

@@ -138,7 +138,7 @@
   "dist-tags": {
     "latest": "1.0.1"
   },
-  "_rev": "65-bed99537d2229467",
+  "_rev": "205-eddfd066208b41a0",
   "_id": "teex",
   "readme": "# teex\n\nTurn a readable stream into multiple readable [streamx streams](https://github.com/mafintosh/streamx).\n\n```\nnpm install teex\n```\n\n## Usage\n\n``` js\nconst tee = require('teex')\n\n// a, b are readable streams that are \"clones\"\n// of someReadableStream. both streams need to\n// be flowing, for someReadableStream to flow\n\nconst [a, b] = tee(someReadableStream)\n```\n\n## API\n\n#### `const streams = tee(s, [howMany])`\n\nSplit a readable stream into multiple streams.\nThe `howMany` argument indicates how many streams\nto split into and defaults to 2.\n\n## License\n\nMIT",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{ad/3a/094dc3a0b2aeb3655897130786dad23b0092e09541daca4244071acb318ce77d37e8e31f3eae21a58eeaab59b7bf0c8ab0cea282a84d9a71b3f62183fa8f → 2d/3d/399bdaca2e8bf323a5f91462fe087bf8f09b78f86c9239ebbb6398d35c20722c2eb2fdce273ea2eeb5c1d8df1e09af4db9b69764cd3170d7f693635945db}

@@ -226,7 +226,7 @@
   "dist-tags": {
     "latest": "1.0.1"
   },
-  "_rev": "1173-b08fb70d3fa73100",
+  "_rev": "1339-3dcd1eef0ac4a689",
   "_id": "package-json-from-dist",
   "readme": "# package-json-from-dist\n\nSometimes you want to load the `package.json` into your\nTypeScript program, and it's tempting to just `import\n'../package.json'`, since that seems to work.\n\nHowever, this requires `tsc` to make an entire copy of your\n`package.json` file into the `dist` folder, which is a problem if\nyou're using something like\n[tshy](https://github.com/isaacs/tshy), which uses the\n`package.json` file in dist for another purpose. Even when that\ndoes work, it's asking the module system to do a bunch of extra\nfs system calls, just to load a version number or something. (See\n[this issue](https://github.com/isaacs/tshy/issues/61).)\n\nThis module helps by just finding the package.json file\nappropriately, and reading and parsing it in the most normal\nfashion.\n\n## Caveats\n\nThis _only_ works if your code builds into a target folder called\n`dist`, which is in the root of the package. It also requires\nthat you do not have a folder named `node_modules` anywhere\nwithin your dev environment, or else it'll get the wrong answers\nthere. (But, at least, that'll be in dev, so you're pretty likely\nto notice.)\n\nIf you build to some other location, then you'll need a different\napproach. (Feel free to fork this module and make it your own, or\njust put the code right inline, there's not much of it.)\n\n## USAGE\n\n```js\n// src/index.ts\nimport {\n  findPackageJson,\n  loadPackageJson,\n} from 'package-json-from-dist'\n\nconst pj = findPackageJson(import.meta.url)\nconsole.log(`package.json found at ${pj}`)\n\nconst pkg = loadPackageJson(import.meta.url)\nconsole.log(`Hello from ${pkg.name}@${pkg.version}`)\n```\n\nIf your module is not directly in the `./src` folder, then you need\nto specify the path that you would expect to find the\n`package.json` when it's _not_ built to the `dist` folder.\n\n```js\n// src/components/something.ts\nimport {\n  findPackageJson,\n  loadPackageJson,\n} from 'package-json-from-dist'\n\nconst pj = findPackageJson(import.meta.url, '../../package.json')\nconsole.log(`package.json found at ${pj}`)\n\nconst pkg = loadPackageJson(import.meta.url, '../../package.json')\nconsole.log(`Hello from ${pkg.name}@${pkg.version}`)\n```\n\nWhen running from CommmonJS, use `__filename` instead of\n`import.meta.url`.\n\n```js\n// src/index.cts\nimport {\n  findPackageJson,\n  loadPackageJson,\n} from 'package-json-from-dist'\n\nconst pj = findPackageJson(__filename)\nconsole.log(`package.json found at ${pj}`)\n\nconst pkg = loadPackageJson(__filename)\nconsole.log(`Hello from ${pkg.name}@${pkg.version}`)\n```\n\nSince [tshy](https://github.com/isaacs/tshy) builds _both_\nCommonJS and ESM by default, you may find that you need a\nCommonJS override and some `//@ts-ignore` magic to make it work.\n\n`src/pkg.ts`:\n\n```js\nimport {\n  findPackageJson,\n  loadPackageJson,\n} from 'package-json-from-dist'\n//@ts-ignore\nexport const pkg = loadPackageJson(import.meta.url)\n//@ts-ignore\nexport const pj = findPackageJson(import.meta.url)\n```\n\n`src/pkg-cjs.cts`:\n\n```js\nimport {\n  findPackageJson,\n  loadPackageJson,\n} from 'package-json-from-dist'\nexport const pkg = loadPackageJson(__filename)\nexport const pj = findPackageJson(__filename)\n```",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{39/47/c4a0858ceaf39cbff72b77761370b36ce9051db0f915b35d711c318f2ed30562024a7c1c9f19914baa152be96c7be7a794febf0486f03c2f4bd1f0bf911e → 31/c0/8834420ab445c83bb50455ea316ffad80944323c89cd2e6b3d86cb3f9663e38891ba22871987d4221b5ac5a3395e6cfdb262e79f17a1b9adf7e4acdbd725}

@@ -6258,12 +6258,120 @@
       },
       "_hasShrinkwrap": false,
       "contributors": []
+    },
+    "4.2.12": {
+      "name": "@smithy/eventstream-codec",
+      "version": "4.2.12",
+      "scripts": {
+        "build": "concurrently 'yarn:build:cjs' 'yarn:build:es' 'yarn:build:types && yarn build:types:downlevel'",
+        "build:cjs": "node ../../scripts/inline eventstream-codec",
+        "build:es": "yarn g:tsc -p tsconfig.es.json",
+        "build:types": "yarn g:tsc -p tsconfig.types.json",
+        "build:types:downlevel": "premove dist-types/ts3.4 && downlevel-dts dist-types dist-types/ts3.4",
+        "stage-release": "premove .release && yarn pack && mkdir ./.release && tar zxvf ./package.tgz --directory ./.release && rm ./package.tgz",
+        "clean": "premove dist-cjs dist-es dist-types tsconfig.cjs.tsbuildinfo tsconfig.es.tsbuildinfo tsconfig.types.tsbuildinfo",
+        "lint": "eslint -c ../../.eslintrc.js \"src/**/*.ts\"",
+        "format": "prettier --config ../../prettier.config.js --ignore-path ../../.prettierignore --write \"**/*.{ts,md,json}\"",
+        "test": "yarn g:vitest run",
+        "test:watch": "yarn g:vitest watch"
+      },
+      "main": "./dist-cjs/index.js",
+      "module": "./dist-es/index.js",
+      "types": "./dist-types/index.d.ts",
+      "author": {
+        "name": "AWS SDK for JavaScript Team",
+        "url": "https://aws.amazon.com/javascript/"
+      },
+      "license": "Apache-2.0",
+      "sideEffects": false,
+      "dependencies": {
+        "@aws-crypto/crc32": "5.2.0",
+        "@smithy/types": "^4.13.1",
+        "@smithy/util-hex-encoding": "^4.2.2",
+        "tslib": "^2.6.2"
+      },
+      "devDependencies": {
+        "@smithy/util-utf8": "^4.2.2",
+        "@types/node": "^18.11.9",
+        "concurrently": "7.0.0",
+        "downlevel-dts": "0.10.1",
+        "premove": "4.0.0",
+        "typedoc": "0.23.23"
+      },
+      "typesVersions": {
+        "<4.5": {
+          "dist-types/*": [
+            "dist-types/ts3.4/*"
+          ]
+        }
+      },
+      "homepage": "https://github.com/smithy-lang/smithy-typescript/tree/main/packages/eventstream-codec",
+      "repository": {
+        "type": "git",
+        "url": "git+https://github.com/smithy-lang/smithy-typescript.git",
+        "directory": "packages/eventstream-codec"
+      },
+      "typedoc": {
+        "entryPoint": "src/index.ts"
+      },
+      "publishConfig": {
+        "directory": ".release/package"
+      },
+      "engines": {
+        "node": ">=18.0.0"
+      },
+      "_id": "@smithy/eventstream-codec@4.2.12",
+      "gitHead": "0bdca155aded1af3d3a12e2d537babdfde8f30ac",
+      "description": "[![NPM version](https://img.shields.io/npm/v/@smithy/eventstream-codec/latest.svg)](https://www.npmjs.com/package/@smithy/eventstream-codec) [![NPM downloads](https://img.shields.io/npm/dm/@smithy/eventstream-codec.svg)](https://www.npmjs.com/package/@smi",
+      "bugs": {
+        "url": "https://github.com/smithy-lang/smithy-typescript/issues"
+      },
+      "_nodeVersion": "18.20.8",
+      "_npmVersion": "10.8.2",
+      "dist": {
+        "integrity": "sha512-FE3bZdEl62ojmy8x4FHqxq2+BuOHlcxiH5vaZ6aqHJr3AIZzwF5jfx8dEiU/X0a8RboyNDjmXjlbr8AdEyLgiA==",
+        "shasum": "8cd62d08709344fb8b35fd17870fdf1435de61a3",
+        "tarball": "https://verdaccio.mrsdev.ru/@smithy%2feventstream-codec/-/eventstream-codec-4.2.12.tgz",
+        "fileCount": 40,
+        "unpackedSize": 63121,
+        "signatures": [
+          {
+            "keyid": "SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U",
+            "sig": "MEUCIQD35x7aDQEClWe+LGKH0TOx0zfphtnGdncqhDjCbtLTUQIgW8WZU03ZBURCkSmzmzkMfq+F2SftDEu4mikQ7u3X41Y="
+          }
+        ]
+      },
+      "_npmUser": {
+        "name": "smithy-team",
+        "email": "aws-javascript-sdk-team+npm@amazon.com"
+      },
+      "directories": {},
+      "maintainers": [
+        {
+          "name": "trivikr-aws",
+          "email": "trivikr@amazon.com"
+        },
+        {
+          "name": "smithy-team",
+          "email": "aws-javascript-sdk-team+npm@amazon.com"
+        },
+        {
+          "name": "aws-sdk-bot",
+          "email": "aws-sdk-js-automation@amazon.com"
+        }
+      ],
+      "_npmOperationalInternal": {
+        "host": "s3://npm-registry-packages-npm-production",
+        "tmp": "tmp/eventstream-codec_4.2.12_1773327516232_0.017722873565651165"
+      },
+      "_hasShrinkwrap": false,
+      "contributors": []
     }
   },
   "time": {
     "created": "2023-06-19T22:00:35.932Z",
     "1.0.0": "2023-06-19T22:00:36.261Z",
-    "modified": "2026-03-04T23:13:32.352Z",
+    "modified": "2026-03-12T14:58:36.574Z",
     "1.0.1": "2023-06-20T19:26:31.327Z",
     "1.0.2": "2023-07-06T16:24:34.304Z",
     "1.0.3": "2023-07-24T19:54:13.253Z",
@@ -6323,13 +6431,14 @@
     "4.2.8": "2026-01-13T18:33:25.399Z",
     "4.2.9": "2026-02-23T17:40:47.043Z",
     "4.2.10": "2026-02-24T20:04:18.628Z",
-    "4.2.11": "2026-03-04T23:13:32.196Z"
+    "4.2.11": "2026-03-04T23:13:32.196Z",
+    "4.2.12": "2026-03-12T14:58:36.387Z"
   },
   "users": {},
   "dist-tags": {
-    "latest": "4.2.11"
+    "latest": "4.2.12"
   },
-  "_rev": "237-2b1f0adf3408eb54",
+  "_rev": "276-74b5be3385c11565",
   "_id": "@smithy/eventstream-codec",
   "readme": "# @smithy/eventstream-codec\n\n[![NPM version](https://img.shields.io/npm/v/@smithy/eventstream-codec/latest.svg)](https://www.npmjs.com/package/@smithy/eventstream-codec)\n[![NPM downloads](https://img.shields.io/npm/dm/@smithy/eventstream-codec.svg)](https://www.npmjs.com/package/@smithy/eventstream-codec)",
   "_attachments": {}

package/npm-cache/_cacache/content-v2/sha512/{50/33/a57cb5030766a43020ab49e2810de773429fbceb095bc17f4991ecb6f93e71a53641fde83e81021814efa78cc691bf11c7149ebe1859fd7351ab5df04f95 → 32/f7/f74ca6dcde1b06152e1cc5c423252cf9cc4d21e3777f734cd898fc0137ce68bf05d52fe8bc1db3af3b009ae47889a796ad3aee5546e879eb46e4ae29ce4e}

@@ -13308,7 +13308,7 @@
     "legacy-v6": "6.2.3",
     "legacy-v3": "3.1.5"
   },
-  "_rev": "4543-ffda0115f816f4a7",
+  "_rev": "4803-2da3c1e1ab353e3c",
   "_id": "minimatch",
   "readme": "",
   "_attachments": {}