[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]


From: Eric Blake
Subject: Re:
Date: Fri, 15 Mar 2019 09:11:38 -0500
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:60.0) Gecko/20100101 Thunderbird/60.5.1

On 3/14/19 9:49 PM, Budi wrote:
> How do we make findutil search in ply by ply depth instead of binary
> search tree, ie. how to make it search on a ply depth thoroughly
> without getting inside any directory there before all par member is
> read and retrieved

I'm not exactly sure what your question is, but POSIX already requires
'find' to default to breadth-first traversal (find visits all files in
the current directory before descending to a subdirectory) so that the
-prune predicate works; but if the -depth predicate is supplied, then
'find' executes in depth-first traversal (subdirectories are visited
before files in the parent directory).

Eric Blake, Principal Software Engineer
Red Hat, Inc.           +1-919-301-3226
Virtualization:  qemu.org | libvirt.org

Attachment: signature.asc
Description: OpenPGP digital signature

reply via email to

[Prev in Thread] Current Thread [Next in Thread]