Security News
GitHub Removes Malicious Pull Requests Targeting Open Source Repositories
GitHub removed 27 malicious pull requests attempting to inject harmful code across multiple open source repositories, in another round of low-effort attacks.
fs-tree-diff
Advanced tools
The fs-tree-diff npm package is used to efficiently compare and manage differences between two file system trees. It is particularly useful for tasks that involve synchronizing directories, detecting changes, and applying updates based on those changes.
Compare two directories
This feature allows you to compare two directories and generate a patch that represents the differences between them. The code sample demonstrates how to create two file system trees and calculate the patch.
const FSTree = require('fs-tree-diff');
const entriesA = FSTree.fromEntries([{ relativePath: 'file1.txt', mode: 0o100644, size: 123, mtime: new Date() }]);
const entriesB = FSTree.fromEntries([{ relativePath: 'file2.txt', mode: 0o100644, size: 456, mtime: new Date() }]);
const treeA = new FSTree({ entries: entriesA });
const treeB = new FSTree({ entries: entriesB });
const patch = treeA.calculatePatch(treeB);
console.log(patch);
Apply a patch to a directory
This feature allows you to apply a patch to a directory, effectively synchronizing it with another directory. The code sample demonstrates how to calculate a patch and then apply it to a file system tree.
const FSTree = require('fs-tree-diff');
const entriesA = FSTree.fromEntries([{ relativePath: 'file1.txt', mode: 0o100644, size: 123, mtime: new Date() }]);
const entriesB = FSTree.fromEntries([{ relativePath: 'file2.txt', mode: 0o100644, size: 456, mtime: new Date() }]);
const treeA = new FSTree({ entries: entriesA });
const treeB = new FSTree({ entries: entriesB });
const patch = treeA.calculatePatch(treeB);
FSTree.applyPatch(treeA, patch);
console.log(treeA.entries);
Generate entries from a directory
This feature allows you to generate entries from a directory, which can then be used to create a file system tree. The code sample demonstrates how to read a directory and generate entries for each file.
const FSTree = require('fs-tree-diff');
const fs = require('fs');
const path = require('path');
function generateEntries(dir) {
const entries = [];
fs.readdirSync(dir).forEach(file => {
const filePath = path.join(dir, file);
const stats = fs.statSync(filePath);
entries.push({ relativePath: file, mode: stats.mode, size: stats.size, mtime: stats.mtime });
});
return entries;
}
const entries = generateEntries('./my-directory');
console.log(entries);
The 'diff' package provides a way to compare text differences between two strings or files. While it focuses on text comparison, fs-tree-diff is more specialized in comparing file system trees and managing directory synchronization.
The 'rsync' package is a utility for efficiently transferring and synchronizing files across computer systems. It is more comprehensive and includes network transfer capabilities, whereas fs-tree-diff is focused on local file system tree comparisons.
The 'chokidar' package is a file watcher that tracks changes in the file system and triggers events. While it can detect changes, it does not provide the same level of detailed comparison and patching capabilities as fs-tree-diff.
FSTree provides the means to calculate a patch (set of operations) between one file system tree and another.
The possible operations are:
unlink
– remove the specified filermdir
– remove the specified foldermkdir
– create the specified foldercreate
– create the specified filechange
– update the specified file to reflect changesThe operations chosen aim to minimize the amount of IO required to apply a given patch.
For example, a naive rm -rf
of a directory tree is actually quite costly, as child directories
must be recursively traversed, entries stated.. etc, all to figure out what first must be deleted.
Since we patch from tree to tree, discovering new files is both wasteful and un-needed.
The operations will also be provided in a correct order, allowing us to safely
replay operations without having to first confirm the FS is as we expect. For
example, unlink
s for files will occur before a rmdir
of those files' parent
dir. Although the ordering will be safe, a specific order is not guaranteed.
A simple example:
const FSTree = require('fs-tree-diff');
const current = FSTree.fromPaths([
'a.js'
]);
const next = FSTree.fromPaths([
'b.js'
]);
current.calculatePatch(next) === [
['unlink', 'a.js', entryA],
['create', 'b.js', entryB]
];
A slightly more complicated example:
const FSTree = require('fs-tree-diff');
const current = FSTree.fromPaths([
'a.js',
'b/',
'b/f.js'
]);
const next = FSTree.fromPaths([
'b.js',
'b/',
'b/c/',
'b/c/d.js',
'b/e.js'
]);
current.calculatePatch(next) === [
['unlink', 'a.js', entryA],
['create', 'b.js', entryB],
['mkdir', 'b/c', entryBC],
['create', 'b/c/d.js', entryBCD],
['create', 'b/e.js', entryBE]
['unlink', 'b/f.js', entryBF],
]
Now, the above examples do not demonstrate change
operations. This is because
when providing only paths, we do not have sufficient information to check if
one entry is merely different from another with the same relativePath.
For this, FSTree supports more complex input structure. To demonstrate, we will use the walk-sync module, which provides higher fidelity input, allowing FSTree to also detect changes. (See also the documentation for walkSync.entries.)
const walkSync = require('walk-sync');
// path/to/root/foo.js
// path/to/root/bar.js
const current = new FSTree({
entries: walkSync.entries('path/to/root')
});
writeFileSync('path/to/root/foo.js', 'new content');
writeFileSync('path/to/root/baz.js', 'new file');
const next = new FSTree({
entries: walkSync.entries('path/to/root')
});
current.calculatePatch(next) === [
['change', 'foo.js', entryFoo], // mtime + size changed, so this input is stale and needs updating.
['create', 'baz.js', entryBaz] // new file, so we should create it
/* bar stays the same and is left inert*/
];
The entry objects provided depend on the operation. For rmdir
and unlink
operations, the current entry is provided. For mkdir
, change
and create
operations the new entry is provided.
The public API is:
FSTree.fromPaths
initialize a tree from an array of string paths.
FSTree.fromEntries
initialize a tree from an array of Entry
objects.
Each entry must have the following properties (but may have more):
relativePath
mode
size
mtime
FSTree.applyPatch(inputDir, outputDir, patch, delegate)
applies the given
patch from the input directory to the output directory. You can optionally
provide a delegate object to handle individual types of patch operations.
FSTree.prototype.calculatePatch(newTree, isEqual)
calculate a patch against
newTree
. Optionally specify a custom isEqual
(see Change Calculation).
FSTree.prototype.calculateAndApplyPatch(newTree, inputDir, outputDir, delegate)
does a calculatePatch
followed by applyPatch
.
FSTree.prototype.addEntries(entries, options)
adds entries to an
existing tree. Options are the same as for FSTree.fromEntries
.
Entries added with the same path will overwrite any existing entries.
FSTree.prototype.addPaths(paths, options)
adds paths to an
existing tree. Options are the same as for FSTree.fromPaths
.
If entries already exist for any of the paths added, those entries will
be updated.
Entry.fromStat(relativePath, stat)
creates an Entry
from a given path and
fs.Stats
object. It can
then be used with fromEntries
or addEntries
.
The trees returned from fromPaths
and fromEntries
are relative to some base
directory. calculatePatch
, applyPatch
and calculateAndApplyPatch
all
assume that the base directory has not changed.
FSTree.fromPaths
, FSTree.fromEntries
, FSTree.prototype.addPaths
,
and FSTree.prototype.addEntries
all validate their inputs. Inputs
must be sorted, path-unique (i.e. two entries with the same relativePath
but
different size
s would still be illegal input) and include intermediate
directories.
For example, the following input is invalid
FSTree.fromPaths([
// => missing a/ and a/b/
'a/b/c.js'
]);
To have FSTree sort and expand (include intermediate directories) for you, add
the option sortAndExpand
).
FStree.fromPaths([
'a/b/q/r/bar.js',
'a/b/c/d/foo.js',
], { sortAndExpand: true });
// The above is equivalent to
FSTree.fromPaths([
'a/',
'a/b/',
'a/b/c/',
'a/b/c/d/',
'a/b/c/d/foo.js',
'a/b/q/',
'a/b/q/r/',
'a/b/q/r/bar.js',
]);
FSTree.fromEntries
requires you to supply your own Entry
objects. Your
entry objects must contain the following properties:
relativePath
mode
size
mtime
They must also implement the following API:
isDirectory()
true
iff this entry is a directoryFSTree.fromEntries
composes well with the output of walkSync.entries
:
const walkSync = require('walk-sync');
// path/to/root/foo.js
// path/to/root/bar.js
const current = FSTree.fromEntries(walkSync.entries('path/to/root'));
When a prior entry has a relativePath
that matches that of a current entry, a
change operation is included if the new entry is different from the previous
entry. This is determined by calling isEqual
, the optional second argument
to calculatePatch
. If no isEqual
is provided, a default isEqual
is used.
The default isEqual
treats directories as always equal and files as different
if any of the following properties have changed.
mode
size
mtime
User specified isEqual
will often want to use the default isEqual
, so it is exported on FSTree
.
Example
const defaultIsEqual = FSTree.defaultIsEqual;
function isEqualCheckingMeta(a, b) {
return defaultIsEqual(a, b) && isMetaEqual(a, b);
}
function isMetaEqual(a, b) {
// ...
}
When you want to apply changes from one tree to another easily, you can use the
FSTree.applyPatch
method. For example, given:
const patch = oldInputTree.calculatePatch(newInputTree);
const inputDir = 'src';
const outputDir = 'dist';
FSTree.applyPatch(inputDir, outputDir, patch);
It will apply the patch changes to dist
while using src
as a reference for
non-destructive operations (mkdir
, create
, change
). If you want to calculate
and apply a patch without any intermediate operations, you can do:
const inputDir = 'src';
const outputDir = 'dist';
oldInputTree.calculateAndApplyPatch(newInputTree, inputDir, outputDir);
You can optionally provide a delegate object to handle applying specific types of operations:
let createCount = 0;
FSTree.applyPatch(inputDir, outputDir, patch, {
create: function(inputPath, outputPath, relativePath) {
createCount++;
copy(inputPath, outputPath);
}
});
The available delegate functions are the same as the supported operations:
unlink
, rmdir
, mkdir
, create
, and change
. Each delegate function
receives the reference inputPath
, the outputPath
, and relativePath
of the file
or directory for which to apply the operation.
FAQs
Backs out file tree changes
The npm package fs-tree-diff receives a total of 676,008 weekly downloads. As such, fs-tree-diff popularity was classified as popular.
We found that fs-tree-diff demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 4 open source maintainers collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
GitHub removed 27 malicious pull requests attempting to inject harmful code across multiple open source repositories, in another round of low-effort attacks.
Security News
RubyGems.org has added a new "maintainer" role that allows for publishing new versions of gems. This new permission type is aimed at improving security for gem owners and the service overall.
Security News
Node.js will be enforcing stricter semver-major PR policies a month before major releases to enhance stability and ensure reliable release candidates.