Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
37 commits
Select commit Hold shift + click to select a range
0469745
chore: Improve grammar: `; otherwise,`
jsoref Sep 28, 2025
4038159
chore: fix gramar: an
jsoref Sep 28, 2025
a7f4b5c
chore: fix spelling: ancestors
jsoref Sep 28, 2025
3a6f89d
chore: fix spelling: and
jsoref Sep 28, 2025
1d0e7f2
chore: fix spelling: artificial
jsoref Sep 28, 2025
01b4f19
chore: fix spelling: assigned
jsoref Sep 28, 2025
58eb179
chore: fix spelling: case-insensitive
jsoref Sep 28, 2025
e60b475
chore: fix spelling: case-sensitive
jsoref Sep 28, 2025
00647e5
chore: fix spelling: conflict
jsoref Sep 28, 2025
fa78179
chore: fix spelling: create
jsoref Sep 28, 2025
bd922b6
fix: spelling: dependencies
jsoref Sep 26, 2025
1f4ce0a
chore: fix spelling: dependent
jsoref Sep 26, 2025
6bc2566
chore: fix spelling: does not
jsoref Sep 26, 2025
898824b
chore: fix spelling: doesn't
jsoref Sep 26, 2025
5c30ef2
chore: fix spelling: do not
jsoref Oct 1, 2025
b141c5d
chore: fix spelling: don't
jsoref Sep 28, 2025
e5ed017
chore: fix spelling: fall back
jsoref Sep 28, 2025
eed7e07
chore: fix spelling: global
jsoref Sep 28, 2025
475dcdd
chore: fix spelling: have
jsoref Sep 28, 2025
d053e84
chore: fix spelling: hidden
jsoref Sep 26, 2025
6535174
chore: fix spelling: hoisted
jsoref Sep 28, 2025
d6fd27d
chore: fix spelling: if
jsoref Sep 28, 2025
b89ca44
chore: fix gramar: into
jsoref Sep 29, 2025
b8d5d7e
fix: spelling: legacy
jsoref Sep 28, 2025
96c0db4
chore: fix spelling: metadata
jsoref Sep 28, 2025
35baf03
chore: fix spelling: miscellaneous
jsoref Sep 26, 2025
570aeed
chore: fix spelling: occurring
jsoref Sep 28, 2025
c08df39
chore: fix spelling: output
jsoref Sep 28, 2025
8c33f56
chore: fix spelling: overwritten
jsoref Sep 28, 2025
fd12fbc
chore: fix spelling: propagate
jsoref Sep 28, 2025
dade8f9
chore: fix spelling: racy
jsoref Sep 28, 2025
3c9af3c
chore: fix spelling: registry with
jsoref Sep 28, 2025
e7e96e6
chore: fix spelling: replacement
jsoref Sep 28, 2025
351b72a
chore: fix spelling: strategy
jsoref Sep 28, 2025
ac02077
chore: fix spelling: sugar
jsoref Sep 28, 2025
bbcbcb9
chore: fix spelling: suppress
jsoref Sep 28, 2025
9b34d43
chore: Improve gramar: that
jsoref Sep 28, 2025
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions workspaces/arborist/CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -172,7 +172,7 @@
* [`e290352`](https://github.com/npm/cli/commit/e290352c6b9fd3bc7fa4b8ea2cc2000fb20fdec7) [#7499](https://github.com/npm/cli/pull/7499) revert DepsQueue to re-sort on pop() (#7499) (@lukekarrys)
* [`56a27fa`](https://github.com/npm/cli/commit/56a27fa400f157fb9a56182900278c41efc6aba1) [#7494](https://github.com/npm/cli/pull/7494) avoid caching manifests as promises (@wraithgar)
* [`722c0fa`](https://github.com/npm/cli/commit/722c0faa387ae6e35886f08eefb238c03ae85db1) [#7463](https://github.com/npm/cli/pull/7463) limit packument cache size based on heap size (@wraithgar)
* [`effe910`](https://github.com/npm/cli/commit/effe9109d6bc7828bf916c4dee49b2a53c72f39d) [#7475](https://github.com/npm/cli/pull/7475) dont omit license from stored manifests (#7475) (@lukekarrys)
* [`effe910`](https://github.com/npm/cli/commit/effe9109d6bc7828bf916c4dee49b2a53c72f39d) [#7475](https://github.com/npm/cli/pull/7475) don't omit license from stored manifests (#7475) (@lukekarrys)

### Dependencies

Expand Down Expand Up @@ -213,7 +213,7 @@

### Features

* [`9123de4`](https://github.com/npm/cli/commit/9123de4d282bfd19ea17ad613f5a2acab0e0e162) [#7373](https://github.com/npm/cli/pull/7373) do all ouput over proc-log events (@lukekarrys)
* [`9123de4`](https://github.com/npm/cli/commit/9123de4d282bfd19ea17ad613f5a2acab0e0e162) [#7373](https://github.com/npm/cli/pull/7373) do all output over proc-log events (@lukekarrys)
* [`9622597`](https://github.com/npm/cli/commit/9622597399ec93224fddf90a9209a98dbcfd6b2f) [#7339](https://github.com/npm/cli/pull/7339) refactor terminal display (#7339) (@lukekarrys)

### Bug Fixes
Expand Down Expand Up @@ -801,7 +801,7 @@

### Bug Fixes

* **arborist:** dont skip adding advisories to audit based on name/range ([aa4a4da](https://github.com/npm/cli/commit/aa4a4da336a6ec1963394fdbd06acb173c842d26)), closes [#4681](https://github.com/npm/cli/issues/4681)
* **arborist:** don't skip adding advisories to audit based on name/range ([aa4a4da](https://github.com/npm/cli/commit/aa4a4da336a6ec1963394fdbd06acb173c842d26)), closes [#4681](https://github.com/npm/cli/issues/4681)
* **arborist:** when reloading an edge, also refresh overrides ([4d676e3](https://github.com/npm/cli/commit/4d676e31a68f081b8553eff4e79db1f29acf47e1))

### [5.0.5](https://github.com/npm/cli/compare/arborist-v5.0.4...arborist-v5.0.5) (2022-04-06)
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/bin/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ ${message && '\n' + message + '\n'}

Additionally:

* --loglevel=warn|--quiet will supppress the printing of package trees
* --loglevel=warn|--quiet will suppress the printing of package trees
* --logfile <file|bool> will output logs to a file
* --timing will show timing information
* Instead of 'npm install <pkg>', use 'arborist reify --add=<pkg>'.
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/docs/ideal-tree.md
Original file line number Diff line number Diff line change
Expand Up @@ -66,7 +66,7 @@ dependency can go without causing conflicts.

1. If edge is valid, and dep name is not on the update list, do not place
2. If the node is not a top node, and the dep is a peer dep, then the
starting TARGET is node.parent, otherwise it's node
starting TARGET is node.parent; otherwise, it's node
3. Do until CONFLICT:
1. CHECK if dep can be placed at TARGET
2. If not CONFLICT, set result in CAN PLACE
Expand Down
8 changes: 4 additions & 4 deletions workspaces/arborist/lib/arborist/build-ideal-tree.js
Original file line number Diff line number Diff line change
Expand Up @@ -1024,7 +1024,7 @@ This is a one-time fix-up, please be patient...
}

// pre-fetch any problem edges, since we'll need these soon
// if it fails at this point, though, dont' worry because it
// if it fails at this point, though, don't worry because it
// may well be an optional dep that has gone missing. it'll
// fail later anyway.
for (const e of this.#problemEdges(placed)) {
Expand Down Expand Up @@ -1080,7 +1080,7 @@ This is a one-time fix-up, please be patient...
? await this.#nodeFromSpec(edge.name, spec2, parent, secondEdge)
: null

// pick the second one if they're both happy with that, otherwise first
// pick the second one if they're both happy with that; otherwise, first
const node = second && edge.valid ? second : first
// ensure the one we want is the one that's placed
node.parent = parent
Expand Down Expand Up @@ -1287,7 +1287,7 @@ This is a one-time fix-up, please be patient...

// failed to load the spec, either because of enotarget or
// fetch failure of some other sort. save it so we can verify
// later that it's optional, otherwise the error is fatal.
// later that it's optional; otherwise, the error is fatal.
const n = new Node({
name,
parent,
Expand Down Expand Up @@ -1444,7 +1444,7 @@ This is a one-time fix-up, please be patient...
// - if a path under an existing node, then assign that as the fsParent,
// and add it to the _depsQueue
//
// call buildDepStep if anything was added to the queue, otherwise we're done
// call buildDepStep if anything was added to the queue; otherwise, we're done
#resolveLinks () {
for (const link of this.#linkNodes) {
this.#linkNodes.delete(link)
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/arborist/isolated-reifier.js
Original file line number Diff line number Diff line change
Expand Up @@ -140,7 +140,7 @@ module.exports = cls => class IsolatedReifier extends cls {

async assignCommonProperties (node, result) {
function validEdgesOut (node) {
return [...node.edgesOut.values()].filter(e => e.to && e.to.target && !(node.package.bundledDepenedencies || node.package.bundleDependencies || []).includes(e.to.name))
return [...node.edgesOut.values()].filter(e => e.to && e.to.target && !(node.package.bundledDependencies || node.package.bundleDependencies || []).includes(e.to.name))
}
const edges = validEdgesOut(node)
const optionalDeps = edges.filter(e => e.optional).map(e => e.to.target)
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/arborist/load-actual.js
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ module.exports = cls => class ActualLoader extends cls {
// We don't do fsParent as a magic getter/setter, because it'd be too costly
// to keep up to date along the walk.
// And, we know that it can ONLY be relevant when the node is a target of a
// link, otherwise it'd be in a node_modules folder, so take advantage of
// link; otherwise, it'd be in a node_modules folder, so take advantage of
// that to limit the scans later.
#topNodes = new Set()
#transplantFilter
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/arborist/load-virtual.js
Original file line number Diff line number Diff line change
Expand Up @@ -168,7 +168,7 @@ module.exports = cls => class VirtualLoader extends cls {
}
}

// separate out link metadatas, and create Node objects for nodes
// separate out link metadata, and create Node objects for nodes
#resolveNodes (s, root) {
const links = new Map()
const nodes = new Map([['', root]])
Expand Down
4 changes: 2 additions & 2 deletions workspaces/arborist/lib/arborist/reify.js
Original file line number Diff line number Diff line change
Expand Up @@ -1323,7 +1323,7 @@ module.exports = cls => class Reifier extends cls {
const alias = name !== pname
newSpec = alias ? `npm:${pname}@${range}` : range
} else if (req.hosted) {
// save the git+https url if it has auth, otherwise shortcut
// save the git+https url if it has auth; otherwise, shortcut
const h = req.hosted
const opt = { noCommittish: false }
if (h.https && h.auth) {
Expand Down Expand Up @@ -1392,7 +1392,7 @@ module.exports = cls => class Reifier extends cls {

// Returns true if any of the edges from this node has a semver
// range definition that is an exact match to the version installed
// e.g: should return true if for a given an installed version 1.0.0,
// e.g: should return true if for a given and installed version 1.0.0,
// range is either =1.0.0 or 1.0.0
const exactVersion = node => {
for (const edge of node.edgesIn) {
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/gather-dep-set.js
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ const gatherDepSet = (set, edgeFilter) => {
}
}

// now remove all nodes in the set that have a dependant outside the set
// now remove all nodes in the set that have a dependent outside the set
// if any change is made, then re-check
// continue until no changes made, or deps set evaporates fully.
let changed = true
Expand Down
8 changes: 4 additions & 4 deletions workspaces/arborist/lib/node.js
Original file line number Diff line number Diff line change
Expand Up @@ -248,7 +248,7 @@ class Node {
this.fsParent = fsParent || null

// see parent/root setters below.
// root is set to parent's root if we have a parent, otherwise if it's
// root is set to parent's root if we have a parent; otherwise, if it's
// null, then it's set to the node itself.
if (!parent && !fsParent) {
this.root = root || null
Expand Down Expand Up @@ -832,7 +832,7 @@ class Node {
edge.reload()
}
}
// reload all edgesOut where root doens't match, or is missing, since
// reload all edgesOut where root doesn't match, or is missing, since
// it might not be missing in the new tree
for (const edge of this.edgesOut.values()) {
if (!edge.to || edge.to.root !== root) {
Expand Down Expand Up @@ -1268,7 +1268,7 @@ class Node {
// with another by the same name (eg, to update or dedupe).
// This does a couple of walks out on the node_modules tree, recursing
// into child nodes. However, as setting the parent is typically done
// with nodes that don't have have many children, and (deduped) package
// with nodes that don't have many children, and (deduped) package
// trees tend to be broad rather than deep, it's not that bad.
// The only walk that starts from the parent rather than this node is
// limited by edge name.
Expand Down Expand Up @@ -1412,7 +1412,7 @@ class Node {
}

recalculateOutEdgesOverrides () {
// For each edge out propogate the new overrides through.
// For each edge out propagate the new overrides through.
for (const edge of this.edgesOut.values()) {
edge.reload(true)
if (edge.to) {
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/packument-cache.js
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ class PackumentCache extends LRUCache {
maxSize,
maxEntrySize,
sizeCalculation: (p) => {
// Don't cache if we dont know the size
// Don't cache if we don't know the size
// Some versions of pacote set this to `0`, newer versions set it to `null`
if (!p[sizeKey]) {
return maxEntrySize + 1
Expand Down
6 changes: 3 additions & 3 deletions workspaces/arborist/lib/place-dep.js
Original file line number Diff line number Diff line change
Expand Up @@ -203,7 +203,7 @@ class PlaceDep {
this.warnPeerConflict()
}

// if we get a KEEP in a update scenario, then we MAY have something
// if we get a KEEP in an update scenario, then we MAY have something
// already duplicating this unnecessarily! For example:
// ```
// root (dep: y@1)
Expand Down Expand Up @@ -317,7 +317,7 @@ class PlaceDep {
force: this.force,
installLinks: this.installLinks,
installStrategy: this.installStrategy,
legacyPeerDeps: this.legaycPeerDeps,
legacyPeerDeps: this.legacyPeerDeps,
preferDedupe: this.preferDedupe,
strictPeerDeps: this.strictPeerDeps,
updateNames: this.updateName,
Expand Down Expand Up @@ -421,7 +421,7 @@ class PlaceDep {
// prune all the nodes in a branch of the tree that can be safely removed
// This is only the most basic duplication detection; it finds if there
// is another satisfying node further up the tree, and if so, dedupes.
// Even in installStategy is nested, we do this amount of deduplication.
// Even if installStrategy is nested, we do this amount of deduplication.
pruneDedupable (node, descend = true) {
if (node.canDedupe(this.preferDedupe, this.explicitRequest)) {
// gather up all deps that have no valid edges in from outside
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/lib/query-selector-all.js
Original file line number Diff line number Diff line change
Expand Up @@ -785,7 +785,7 @@ const hasParent = (node, compareNodes) => {
compareNode = compareNode.target
}

// follows logical parent for link anscestors
// follows logical parent for link ancestors
if (node.isTop && (node.resolveParent === compareNode)) {
return true
}
Expand Down
4 changes: 2 additions & 2 deletions workspaces/arborist/lib/shrinkwrap.js
Original file line number Diff line number Diff line change
Expand Up @@ -431,7 +431,7 @@ class Shrinkwrap {
const [sw, lock, yarn] = await this.loadFiles
data = sw || lock || '{}'

// use shrinkwrap only for deps, otherwise prefer package-lock
// use shrinkwrap only for deps; otherwise, prefer package-lock
// and ignore npm-shrinkwrap if both are present.
// TODO: emit a warning here or something if both are present.
if (this.hiddenLockfile) {
Expand Down Expand Up @@ -978,7 +978,7 @@ class Shrinkwrap {

// npm v6 and before tracked 'from', meaning "the request that led
// to this package being installed". However, that's inherently
// racey and non-deterministic in a world where deps are deduped
// racy and non-deterministic in a world where deps are deduped
// ahead of fetch time. In order to maintain backwards compatibility
// with v6 in the lockfile, we do this trick where we pick a valid
// dep link out of the edgesIn set. Choose the edge with the fewest
Expand Down
2 changes: 1 addition & 1 deletion workspaces/arborist/scripts/benchmark/reify.js
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@ const suite = async (suite, { registry, cache }) => {

// do it one time so that we have it in the shared cache
// and benchmark the case where we don't have anything to do
// this doens't get pushed into promises, because we need it
// this doesn't get pushed into promises, because we need it
// before we do the other ones, so we can write the lockfile.
{
const path = resolve(dir, 'full')
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14562,7 +14562,7 @@ Object {
}
`

exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets dont warn > root tree 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets do not warn > root tree 1`] = `
ArboristNode {
"children": Map {
"@lukekarrys/workspace-peer-dep-infinite-loop-a" => ArboristNode {
Expand Down Expand Up @@ -14704,7 +14704,7 @@ ArboristNode {
}
`

exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets dont warn > root warnings 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets do not warn > root warnings 1`] = `
Object {
"code": "ERESOLVE",
"current": Object {
Expand Down Expand Up @@ -14878,7 +14878,7 @@ Object {
}
`

exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets dont warn > workspace tree 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets do not warn > workspace tree 1`] = `
ArboristNode {
"children": Map {
"@lukekarrys/workspace-peer-dep-infinite-loop-a" => ArboristNode {
Expand Down Expand Up @@ -15061,7 +15061,7 @@ ArboristNode {
}
`

exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets dont warn > workspace warnings 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP competing peerSets resolve in both root and workspace overlapping peerSets do not warn > workspace warnings 1`] = `
Object {
"code": "ERESOLVE",
"current": Object {
Expand Down Expand Up @@ -17883,7 +17883,7 @@ ArboristNode {
}
`

exports[`test/arborist/build-ideal-tree.js TAP dont get confused if root matches duped metadep > must match snapshot 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP do not get confused if root matches duped metadep > must match snapshot 1`] = `
ArboristNode {
"children": Map {
"test-root-matches-metadep" => ArboristNode {
Expand Down Expand Up @@ -97791,7 +97791,7 @@ ArboristNode {
}
`

exports[`test/arborist/build-ideal-tree.js TAP push conflicted peer deps deeper in to the tree to solve > must match snapshot 1`] = `
exports[`test/arborist/build-ideal-tree.js TAP push conflicted peer deps deeper into the tree to solve > must match snapshot 1`] = `
ArboristNode {
"children": Map {
"@isaacs/testing-peer-dep-conflict-chain-a" => ArboristNode {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -3906,23 +3906,23 @@ ArboristNode {
}
`

exports[`test/arborist/load-actual.js TAP load workspaces when loading from hidding lockfile > actual tree 1`] = `
exports[`test/arborist/load-actual.js TAP load workspaces when loading from hidden lockfile > actual tree 1`] = `
ArboristNode {
"children": Map {
"a" => ArboristLink {
"edgesIn": Set {
EdgeIn {
"from": "",
"name": "a",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/a",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/a",
"type": "workspace",
},
},
"isWorkspace": true,
"location": "node_modules/a",
"name": "a",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/node_modules/a",
"realpath": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/a",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/node_modules/a",
"realpath": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/a",
"resolved": "file:../packages/a",
"target": ArboristNode {
"location": "packages/a",
Expand All @@ -3934,15 +3934,15 @@ ArboristNode {
EdgeIn {
"from": "",
"name": "b",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/b",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/b",
"type": "workspace",
},
},
"isWorkspace": true,
"location": "node_modules/b",
"name": "b",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/node_modules/b",
"realpath": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/b",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/node_modules/b",
"realpath": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/b",
"resolved": "file:../packages/b",
"target": ArboristNode {
"location": "packages/b",
Expand All @@ -3953,13 +3953,13 @@ ArboristNode {
"edgesOut": Map {
"a" => EdgeOut {
"name": "a",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/a",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/a",
"to": "node_modules/a",
"type": "workspace",
},
"b" => EdgeOut {
"name": "b",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/b",
"spec": "file:{CWD}/test/arborist/tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/b",
"to": "node_modules/b",
"type": "workspace",
},
Expand All @@ -3969,21 +3969,21 @@ ArboristNode {
"isWorkspace": true,
"location": "packages/a",
"name": "a",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/a",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/a",
"version": "1.2.3",
},
ArboristNode {
"isWorkspace": true,
"location": "packages/b",
"name": "b",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile/packages/b",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile/packages/b",
"version": "1.2.3",
},
},
"isProjectRoot": true,
"location": "",
"name": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidding-lockfile",
"name": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile",
"path": "tap-testdir-load-actual-load-workspaces-when-loading-from-hidden-lockfile",
"workspaces": Map {
"a" => "packages/a",
"b" => "packages/b",
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
* Make sure to inspect the output below. Do not ignore changes!
*/
'use strict'
exports[`test/printable.js TAP broken links dont break the printing > must match snapshot 1`] = `
exports[`test/printable.js TAP broken links do not break the printing > must match snapshot 1`] = `
{
"children":Map{
"devnull" => ArboristLink{
Expand Down
Loading