aboutsummaryrefslogtreecommitdiffstats
path: root/README
diff options
context:
space:
mode:
authorMattias Andrée <m@maandree.se>2026-02-22 13:07:10 +0100
committerMattias Andrée <m@maandree.se>2026-02-22 13:07:10 +0100
commite577f9bf50664f21c7fbbb77f894602348202282 (patch)
treed7e348e273e32f0a5dfedf4b5108c124a88580e5 /README
parentUpdate e-mail (diff)
downloadbfind-e577f9bf50664f21c7fbbb77f894602348202282.tar.gz
bfind-e577f9bf50664f21c7fbbb77f894602348202282.tar.bz2
bfind-e577f9bf50664f21c7fbbb77f894602348202282.tar.xz
misc fixesHEAD3.0.2master
Signed-off-by: Mattias Andrée <m@maandree.se>
Diffstat (limited to 'README')
-rw-r--r--README10
1 files changed, 5 insertions, 5 deletions
diff --git a/README b/README
index 759089a..7a4c7ea 100644
--- a/README
+++ b/README
@@ -6,16 +6,16 @@ SYNOPSIS
DESCRIPTION
bfind is a minimalistic alternative to find(1) that is
- designed to be efficient that locating files. To
+ designed to be efficient at 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
+ bfind includes only the bare minimum: a few options
+ for restricting the crawl space 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.
+ because they are excessive, and some of them do not make
+ sense to have in the program and can be outright dangerous.
OPTIONS
-0