Because the for loop container can include other for loop containers , you can build nested loops and implement complex looping in packages 因?yàn)閒or循環(huán)容器可以包含其他for循環(huán)容器,所以可以在包中構(gòu)建嵌套循環(huán)和實(shí)現(xiàn)復(fù)雜循環(huán)。
For example , to nest one loop ( the nested loop ) within another loop ( the nesting loop ) ; to nest one subroutine ( the nested subroutine ) within another subroutine ( the nesting subroutine ) 例如,在一個(gè)循環(huán)中嵌入另一個(gè)循環(huán),在一個(gè)子程序中嵌入另一個(gè)子程序。
This method consists of two nested loops : the first loop iterate through all the registered types . the second loop iterates through all attributes for the current type 這個(gè)方法由兩個(gè)嵌套的循環(huán)組成:第一個(gè)循環(huán)遍歷所有注冊(cè)的類(lèi)型。第二個(gè)循環(huán)遍歷當(dāng)前類(lèi)型的所有特性。
If the query includes a join , the optimizer must determine the join plan hash , sort merge , or nested loop , and the order in which tables are evaluated or joined 如果該查詢(xún)包含了連接,那么優(yōu)化器就必須確定連接計(jì)劃( hash 、 sort merge或nested loop ) ,以及評(píng)估或連接表的次序。
Imperative python code for " print big products " nested loop procedural style for finding big products xs 1 , 2 , 3 , 4 ys 10 , 15 , 3 , 22 bigmuls . more stuff . . . for 既然我們已講到這,注意傳遞消息的opp風(fēng)格是如何處理的也非常有趣( smalltalk或self與此類(lèi)似,一些我使用的oop xbase變量也是如此) :
Join plan directives that force optimizer to use the designated join method to join tables in the query , either nested loop join , sort merge join , or dynamic hash join 連接計(jì)劃指示,強(qiáng)制優(yōu)化器使用指定的連接方法來(lái)連接查詢(xún)中的表,要么是嵌套循環(huán)連接、分類(lèi)合并連接,要么是動(dòng)態(tài)哈希連接。
But both are far less clear than the list comprehension style . with some programmer practice , list comprehensions can substitute for most uses of functional - style built - ins and also for many nested loops Txt2html的本地版本可以訪(fǎng)問(wèn)遠(yuǎn)程url ,就像訪(fǎng)問(wèn)本地文件一樣,但它還不能保證它自身是最新的!
This paper revealed an optimized strategy to search for systolic array transformations for nested loops , when the upper and lower bound of inner index was affine functions of there outer loop indexes 對(duì)于多重循環(huán)中,當(dāng)內(nèi)層迭代的上下界為外層迭代的仿射函數(shù)時(shí),介紹了搜索脈動(dòng)變換的一個(gè)優(yōu)化策略和相應(yīng)的自動(dòng)化算法。
This paper revealed an optimized strategy to search for systolic array transformations for nested loops , when the upper and lower bound of inner index was affine functions of there outer loop indexes 摘要對(duì)于多重循環(huán)中,當(dāng)內(nèi)層迭代的上下界為外層迭代的仿射函數(shù)時(shí),介紹了搜索脈動(dòng)變換的一個(gè)優(yōu)化策略和相應(yīng)的自動(dòng)化算法。
In addition , setting forceplan to on forces the use of a nested loop join unless other types of joins are required to construct a plan for the query , or they are requested with join hints or query hints 此外,在將forceplan設(shè)置為on的情況下,如果不需要其他類(lèi)型的聯(lián)接來(lái)構(gòu)造查詢(xún)計(jì)劃,或者使用聯(lián)接提示或查詢(xún)提示請(qǐng)求了其他聯(lián)接類(lèi)型,則會(huì)強(qiáng)制使用嵌套循環(huán)聯(lián)接。