In addition, instead of using short names for tags and attributes like s and n, you can change them to size and name, respectively (see Listing 7).
此外，如果标签和属性不愿意使用短名字如s和n，可以分别将其修改为size和name(如图7所示)。
Listing 2's implementation runs in o (n) time. I won't prove this, but the running time of Listing 1's naive, recursive implementation is exponential in n.
清单2中的实现所需的时间比清单1短许多，清单2的运行时间为O (n)，而清单1中的递归实现的运行时间是n的指数。
Using the +n or -n parameter, where n is a number, you can rotate the stack left or right, as shown in Listing 5.
使用 +n或 -n参数，其中 n是一个数字，您可以向左或向右移动堆栈，如 清单5 所示。
Listing 2 shows an N-Triples equivalent to Listing 1.
清单2显示了与清单1等价的N -Triples。
N-Triples shows this in its notation for languages, as you can see in Listing 7, which is a conversion of Listing 6 to N-Triples.
N -Triples在其语言表示法中指出了这一点，就如您在清单7中看到的，这是清单6到N - Triples的转换。
Each cell has a state, which you can think of as an integer between 0 and n. Listing 1 shows how to declare a cellular automaton universe in Java code.
每个细胞都有一个状态，可以是0到n之间的任意整数。
One of the N-Triples in Listing 8 includes a data type designation.
清单8中的一个N - Triples包含数据类型指定。
You can also use the lsof command's -N option to list only files and directories that are in use on NFS-mounted devices, as shown in Listing 6.
也可以使用lsof命令的-N选项只列出挂载的NFS设备上正在使用的文件和目录，见 清单 6。
Thus, the script does not count 10 lines, it counts 10 iterations of the loop generated by the -n switch (see "perldoc perlrun" and Listing 2 for an example of that loop).
运算符在一个范围内迭代。因此，该脚本并不是数10个行，而是对- n开关生成的循环迭代10次(请参阅“perldocperlrun”和清单2，以获得该循环的示例)。
Thus, the script does not count 10 lines, it counts 10 iterations of the loop generated by the -n switch (see "perldoc perlrun" and Listing 2 for an example of that loop).
运算符在一个范围内迭代。因此，该脚本并不是数10个行，而是对- n开关生成的循环迭代10次(请参阅“perldocperlrun”和清单2，以获得该循环的示例)。
应用推荐