递归地

• As with complex structures , you can recursively group activities and their interconnection flows into higher - level activities with clearly defined inputs and outputs
  由于其复杂的结构，你可以对活动递归地进行分组并对流进行连接以形成更高的层，这种层次清晰地定义了输入和输出。
• The basic approach used to build up these names is to create a string buffer and recursively get the operation name for the parent statistic , then add the name afterwards
  用于构建这些名字的基本方法是，创建一个字符串缓冲区并递归地得到父统计的操作名，然后在后面加上这个名字。
• To embed subrou tines or data in other subroutines or data at a different hierarchical level such that the different level of routines or data can be executed or accessed recur sively
  把子程序或数据嵌入不同层次的其它子程序或数据之中，使不同层次的子程序或数据可以被递归地执行或存取。
• When this is the case , your query should only return results within that container or within that container s sub - containers recursively , depending on your repository s search behavior
  在这种情况下，查询应该只返回此容器中的结果，或者递归地返回容器的子容器中的结果，这取决于存储库的搜索行为。
• For example , iteratively or recursively nulling elements of a collection where the collection object would otherwise be eligible for garbage collection actually adds overhead to a program rather than helping the garbage collector
  例如，迭代地或者递归地赋空集合内的元素使得这些集合中的对象能够满足垃圾收集的条件，实际上是增加了系统的开销而不是帮助垃圾收集。
• My performance and tuning tests were primarily focused around extracting an uncompressed kernel source tarball from a ram disk to the test filesystem , and then recursively copying the new source tree to a new directory on the same filesystem
  我的性能和调整测试主要是关于将ram磁盘中未压缩的内核源文件tar包（ tarball ）抽取到要测试的文件系统，然后递归地将新源文件树复制到同一文件系统中的一个新目录中。
• In queueing theory , the research on gi / g / l queue have been continued for decades of years . by the end of last century , the integral representation of its transient distribution of the queue length has been obtained . in this integral representation , the integrated term can be determined recursively by a system of kolmogorov differential equation
  在排队理论中，关于gi / g / 1排队系统的研究，延续了几十年，直至上个世纪末，方得到了它的瞬时队长分布的积分表示，在这个积分表示中，其被积项可以由一组柯尔莫洛夫偏微分方程递归地确定。
• 3 , 4 , 5 and ? 6 of this chapter deal respectively with the transient distribution of the queue length of these four queueing systems . such results are obtained as follows : under the condition of the interarrival times distributions and service times distributions of these queueing models which have density function , their transient distribution of the queue length can be represented as an integral , and the integrated term of this integral can be recursively obtained
  在这一章的夸3 、芬4 、县5和号6中，分别针对这四个排队模型，讨论了瞬时队长的分布，最终得到了以下的结果:在这几个模型的到达间隔分布和服务时间分布均具有密度函数的条件下，它们的瞬时队长分布可以表示为一个积分，该积分的被积项可以递归地求取。