blocks|key|1538823|text|如何按降序排序find的输出：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1538824|while+IFS=+read+-d+""+-r+f;+do
++++codesign+"$f"
done+<+<(find+"$directory"+-type+f+-print0+%7C+sort+-zr)|code-block|syntax|javascript|1538825|1538826|<(command+..)是一个进程替换，它通过redirect.|unordered-list-item|1538827|-print0，sort+-z和read+-d+""组合体将command的输出提供给while循环中的read命令，使用空字符作为文件分隔符。保护包含特殊字符(如空格.|1538828|)的文件名是有用的。|1538829|entityMap^0|7|4|0|0|0|0|D|0|0|7|8|7|G|A|U|7|17|5|1G|4|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Y|8|@]|D|@]|E|$]]|$1|L|3|M|5|N|7|Z|8|@$9|10|A|11|B|C]]|D|@]|E|$]]|$1|O|3|P|5|N|7|12|8|@$9|13|A|14|B|C]|$9|15|A|16|B|C]|$9|17|A|18|B|C]|$9|19|A|1A|B|C]|$9|1B|A|1C|B|C]|$9|1D|A|1E|B|C]]|D|@]|E|$]]|$1|Q|3|R|5|6|7|1F|8|@]|D|@]|E|$]]|$1|S|3|-4|5|6|7|1G|8|@]|D|@]|E|$]]]|T|$]]

How about sorting the output of <code>find</code> in descending order:
<pre><code>while IFS= read -d &quot;&quot; -r f; do
 codesign &quot;$f&quot;
done &lt; &lt;(find &quot;$directory&quot; -type f -print0 | sort -zr)
</code></pre>
<ul>
<li><code>&lt;(command ..)</code> is a process substitution which feeds the output
of the <code>command</code> to the <code>read</code> command in <code>while</code> loop via the redirect.</li>
<li><code>-print0</code>, <code>sort -z</code> and <code>read -d &quot;&quot;</code> combo uses a null character
as a file delimiter. It is useful to protect filenames which include
special characters such as whitespace.</li>
</ul>

blocks|key|1538839|text|我不知道find中是否有本机方式，但您可以将它的输出输送到一个循环中，并按您的意愿逐行处理它：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1538840|find+.+%7C+while+read+file;+do+echo+filename:+"$file";+done|code-block|syntax|javascript|1538841|在您的例子中，如果您很高兴只反转find的输出，那么您可以使用如下内容：|1538842|find+$directory+-type+f+%7C+tac+%7C+while+read+file;+do+codesign+"$file";+done|1538843|entityMap^0|4|4|0|0|G|4|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@$9|R|A|S|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|T|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|M|3|N|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|O|3|-4|5|6|7|Y|8|@]|D|@]|E|$]]]|P|$]]

I don't know if there is a native way in <code>find</code>, but you may pipe the output of it into a loop and process it line by line as you wish this way:
<pre><code>find . | while read file; do echo filename: &quot;$file&quot;; done
</code></pre>
In your case, if you are happy just reversing the output of <code>find</code>, you may go with something like:
<pre><code>find $directory -type f | tac | while read file; do codesign &quot;$file&quot;; done
</code></pre>

blocks|key|1000218|text|是的，只要使用-depth|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1000219|1000220|+-depth|blockquote|1000221|1000222|主目录将始终计算为true；它将导致目录层次结构的下降，以便在目录本身之前对目录中的所有条目进行操作。如果未指定-depth主目录，则目录中的所有条目都应在目录本身之后进行操作。如果指定了任何-depth主元，则它将应用于整个表达式，即使-depth主元通常不会被计算。|1000223|1000224|例如：|1000225|$+mkdir+-p+top/a/b/c/d/e/f/g/h
$+find+top+-print
top
top/a
top/a/b
top/a/b/c
top/a/b/c/d
top/a/b/c/d/e
top/a/b/c/d/e/f
top/a/b/c/d/e/f/g
top/a/b/c/d/e/f/g/h
$+find+top+-depth+-print
top/a/b/c/d/e/f/g/h
top/a/b/c/d/e/f/g
top/a/b/c/d/e/f
top/a/b/c/d/e
top/a/b/c/d
top/a/b/c
top/a/b
top/a
top|code-block|syntax|javascript|1000226|注意，在特定的级别上，排序仍然是任意的。|1000227|entityMap|0|LINK|mutability|MUTABLE|url|https://pubs.opengroup.org/onlinepubs/9699919799/utilities/find.html^0|7|6|7|6|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@$9|15|A|16|B|C]]|D|@$9|17|A|18|1|19]]|E|$]]|$1|F|3|-4|5|6|7|1A|8|@]|D|@]|E|$]]|$1|G|3|H|5|I|7|1B|8|@]|D|@]|E|$]]|$1|J|3|-4|5|6|7|1C|8|@]|D|@]|E|$]]|$1|K|3|L|5|6|7|1D|8|@]|D|@]|E|$]]|$1|M|3|-4|5|6|7|1E|8|@]|D|@]|E|$]]|$1|N|3|O|5|6|7|1F|8|@]|D|@]|E|$]]|$1|P|3|Q|5|R|7|1G|8|@]|D|@]|E|$S|T]]|$1|U|3|V|5|6|7|1H|8|@]|D|@]|E|$]]|$1|W|3|-4|5|6|7|1I|8|@]|D|@]|E|$]]]|X|$Y|$5|Z|10|11|E|$12|13]]]]

Yes, just use <a href="https://pubs.opengroup.org/onlinepubs/9699919799/utilities/find.html" rel="noreferrer"><code>-depth</code></a>:
<blockquote>
-depth
The primary shall always evaluate as true; it shall cause descent of the directory hierarchy to be done so that all entries in a directory are acted on before the directory itself. If a -depth primary is not specified, all entries in a directory shall be acted on after the directory itself. If any -depth primary is specified, it shall apply to the entire expression even if the -depth primary would not normally be evaluated.
</blockquote>
For example:
<pre><code>$ mkdir -p top/a/b/c/d/e/f/g/h
$ find top -print
top
top/a
top/a/b
top/a/b/c
top/a/b/c/d
top/a/b/c/d/e
top/a/b/c/d/e/f
top/a/b/c/d/e/f/g
top/a/b/c/d/e/f/g/h
$ find top -depth -print
top/a/b/c/d/e/f/g/h
top/a/b/c/d/e/f/g
top/a/b/c/d/e/f
top/a/b/c/d/e
top/a/b/c/d
top/a/b/c
top/a/b
top/a
top
</code></pre>
Note that at a particular level, ordering is still arbitrary.

blocks|key|1729572|text|使用find的-depth选项作为我的另一个答案，或者像其他一些简单的排序一样，只会确保目录的子目录在目录本身之前被处理，而不是首先处理最深的级别。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1729573|例如：|1729574|$+mkdir+-p+top/a/b/d/f/h+top/a/c/e/g
$+find+top+-depth+-print
top/a/c/e/g
top/a/c/e
top/a/c
top/a/b/d/f/h
top/a/b/d/f
top/a/b/d
top/a/b
top/a
top|code-block|syntax|javascript|1729575|对于要首先处理的总体最深级别，排序应该如下所示：|1729576|top/a/b/d/f/h
top/a/c/e/g
top/a/b/d/f
top/a/c/e
top/a/b/d
top/a/c
top/a/b
top/a
top|1729577|要确定这个顺序，必须知道整个列表，然后是级别数(即。(+/)对每条路径进行计数以启用排序。|1729578|一个简单的ish+Perl脚本(在本例中分配给一个shell函数)来执行这个顺序是：|1729579|$+dsort(){
++++perl+-ne+'
++++++++BEGIN+{+$/+=+"\0"+}+#+null-delimited+i/o

++++++++$fname[$.]+=+$_;
++++++++$depth[$.]+=+tr%7C/%7C%7C;

++++++++END+{
++++++++++++print
++++++++++++++++map+{+$fname[$_]+}
++++++++++++++++sort+{+$depth[$b]+<=>+$depth[$a]+}
++++++++++++++++keys+@fname+
++++++++}
++++'
}|1729580|然后：|1729581|$+find+top+-print0+%7C+dsort+%7C+xargs+-0+-I@+echo+@
top/a/b/d/f/h
top/a/c/e/g
top/a/b/d/f
top/a/c/e
top/a/b/d
top/a/c
top/a/b
top/a
top|1729582|entityMap^0|2|4|7|6|0|0|0|0|0|S|1|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@$9|13|A|14|B|C]|$9|15|A|16|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|17|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|18|8|@]|D|@]|E|$K|L]]|$1|M|3|N|5|6|7|19|8|@]|D|@]|E|$]]|$1|O|3|P|5|J|7|1A|8|@]|D|@]|E|$K|L]]|$1|Q|3|R|5|6|7|1B|8|@$9|1C|A|1D|B|C]]|D|@]|E|$]]|$1|S|3|T|5|6|7|1E|8|@]|D|@]|E|$]]|$1|U|3|V|5|J|7|1F|8|@]|D|@]|E|$K|L]]|$1|W|3|X|5|6|7|1G|8|@]|D|@]|E|$]]|$1|Y|3|Z|5|J|7|1H|8|@]|D|@]|E|$K|L]]|$1|10|3|-4|5|6|7|1I|8|@]|D|@]|E|$]]]|11|$]]

Using <code>find</code>'s <code>-depth</code> option as my other answer, or naive sort as some others, only ensures that sub-directories of a directory are processed before the directory itself, but not that the deepest level is processed first.
For example:
<pre><code>$ mkdir -p top/a/b/d/f/h top/a/c/e/g
$ find top -depth -print
top/a/c/e/g
top/a/c/e
top/a/c
top/a/b/d/f/h
top/a/b/d/f
top/a/b/d
top/a/b
top/a
top
</code></pre>
For overall deepest level to be processed first, the ordering should be something like:
<pre><code>top/a/b/d/f/h
top/a/c/e/g
top/a/b/d/f
top/a/c/e
top/a/b/d
top/a/c
top/a/b
top/a
top
</code></pre>
To determine this ordering, the entire list must be known, and then the number of levels (ie. <code>/</code>) of each path counted to enable ranking.
A simple-ish Perl script (assigned to a shell function for this example) to do this ordering is:
<pre><code>$ dsort(){
 perl -ne '
 BEGIN { $/ = &quot;\0&quot; } # null-delimited i/o

 $fname[$.] = $_;
 $depth[$.] = tr|/||;

 END {
 print
 map { $fname[$_] }
 sort { $depth[$b] &lt;=&gt; $depth[$a] }
 keys @fname 
 }
 '
}
</code></pre>
Then:
<pre><code>$ find top -print0 | dsort | xargs -0 -I@ echo @
top/a/b/d/f/h
top/a/c/e/g
top/a/b/d/f
top/a/c/e
top/a/b/d
top/a/c
top/a/b
top/a
top
</code></pre>

blocks|key|1538898|text|使用GNU实用程序和装饰排序-取消装饰模式(也称为Schwartzian转换)：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1538899|find+.+-type+f+-printf+'%25d+%25p\0'+%7C
++++sort+-znr++++++++++++++++++++%7C
++++sed+-z+'s/[0-9]*+//'+++++++++%7C
++++xargs+-0+-I@+echo+codesign+@|code-block|syntax|javascript|1538900|如果输出看起来正常，则删除echo。|offset|length|style|CODE|1538901|entityMap^0|0|0|D|4|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@$I|R|J|S|K|L]]|9|@]|A|$]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

Using GNU utilities, and decorate-sort-undecorate pattern (aka Schwartzian transform):
<pre><code>find . -type f -printf '%d %p\0' |
 sort -znr |
 sed -z 's/[0-9]* //' |
 xargs -0 -I@ echo codesign @
</code></pre>
Drop the <code>echo</code> if the output looks ok.

I am iterating over files like so:
<pre><code>find $directory -type f -exec codesign {} \; 
</code></pre>
Now the problem here is that files on a higher hierarchy are signed first.
Is there a way to iterate over a directory tree and handle the deepest files first?
So that
<pre><code>/My/path/to/app/bin
</code></pre>
is handled before
<pre><code>/My/path/mainbin
</code></pre>

Bash find: exec in reverse oder

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在迭代这样的文件：find $directory -type f -exec codesign {} \; 现在的问题是，高层次结构上的文件首先要签名。是否有一种方法可以在目录树上迭代并首先处理最深的文件？所以/My/path/to/app/bin以前处理过/My/path/mainbin

问Bash find: exec in reverse
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Bash find: exec in reverseEN