This repo has been moved to Codeberg and may be out of date on GitHub.
Canonical repo: https://codeberg.org/maandree/bfind


NAME
	bfind - minimalistic find using breadth-first crawling

SYNOPSIS
	bfind [-0hsvx] [directory]

DESCRIPTION
	bfind is a minimalistic alternative to find(1) that is
	designed to be efficient that locating files. To
	accomplish this, bfind uses breadth-first crawling
	instead of depth-first crawling.

	bfind is only includes the bare minimum, a few options
	for restricting the crawlspace and an option to output
	visited files in a safe format rather than a human-friendly
	format. bfind will never include all features of find(1)
	because they are excessive and some other than makes not
	since to have in the program and can be outright dangerous.

OPTIONS
	-0
		Terminate lines with NUL rather than LF.

	-h
		Watch out for hardlinked directories.

	-s
		Visit symbolically linked directories, but
		never visit the same directory twice.

	-v
		No files starting with a dot will be listed.

	-x
		Do not restrict crawling to one mount point.

RATIONALE
	While bfind is not as fast as find(1) for large
	hierarchies, it will probably give your results faster
	if you are looking for a file (rather than listing files),
	because the file you are looking for is probably
	near the directory you are searching from.

SEE ALSO
	find(1), grep(1)