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
signature.asc
Description: OpenPGP digital signature
