From 7cad7b37eb81158b5956dbcf6bdc722b5ffa8f4f Mon Sep 17 00:00:00 2001
From: Leah Neukirchen <leah@vuxu.org>
Date: Wed, 8 Nov 2017 15:52:32 +0100
Subject: new option -B for breadth first search

We use two trees and add the newly found files to the other one,
then loop until no more files are found.

prune, -t, -L and -x work, depth needs a slight hack;
loop detection and -U doesn't work.
---
 lr.1 | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

(limited to 'lr.1')

diff --git a/lr.1 b/lr.1
index 63b8c34..8c13121 100644
--- a/lr.1
+++ b/lr.1
@@ -8,7 +8,7 @@
 .Nm
 .Op Fl 0 | Fl F | Fl l Oo Fl TA | Fl TC | Fl TM Oc | Fl S | Fl f Ar fmt
 .br
-.Op Fl D
+.Op Fl B | Fl D
 .Op Fl H | Fl L
 .Op Fl 1AGQXdhsx
 .Op Fl U | Fl o Ar ord
@@ -81,6 +81,11 @@ BSD
 .It Fl f Ar fmt
 Custom formatting, see
 .Sx FORMATTING .
+.It Fl B
+Use breadth first traversal.
+For each depth of the directory tree,
+files are sorted and printed,
+then the next depth is looked at.
 .It Fl D
 Use depth first traversal.
 .Ic prune
-- 
cgit 1.4.1