recursion

美 [r?'k?:?n] 　英 [r?'k?:?n]

• n.遞歸
• 網(wǎng)絡(luò)遞回；循環(huán)；遞推

英漢雙解

英漢解釋

n.	1. 【數(shù)】遞歸(式);遞推,循環(huán)

英英解釋

n.	1. the return of something, often repeatedly 2. the use of repeated steps, each based on the result of the one before, to define a function or calculate a number 3. a programming technique where a routine performs its task by delegating part of it to another instance of itself

例句

This code uses the concept of recursion to call the main function multiple times until the last directory has been traversed.

此代碼會利用遞歸概念多次調(diào)用主函數(shù)，直至處理完最后一個目錄為止。

And thus, the ability to understand pointers and recursion is directly correlated with the ability to be a great programmer.

因此，是否真正理解指針和遞歸，與是否是一個優(yōu)秀程序員直接相關(guān)。

Known as lambda calculus, it was designed to investigate the function definition and application, as well as the concept of recursion.

它被稱為lambda演算，用于研究函數(shù)定義與應(yīng)用程序以及遞歸概念。

Too many method calls is often indicative of a very deep or unbounded recursion.

過多的方法調(diào)用通常意味著存在非常深的遞歸或無限遞歸。

The last function you're going to create is going to take some recursion, where the true power of list processing using Lisp lies.

將要創(chuàng)建的最后一個函數(shù)要執(zhí)行一些遞歸操作，這是使用Lisp進(jìn)行列表處理的真正強(qiáng)大之處。

Recursion allows defining policies higher up in a domain and enforce them on all the component implementations and interactions within.

遞歸允許在域的更高層定義策略，然后將它們強(qiáng)制到內(nèi)部所有組件實現(xiàn)和交互。

Recursion is one of the familiar methods in algorithm design and analysis, and through this method many efficient algorithms can be found.

遞歸是算法設(shè)計中常用的方法之一，利用遞歸可以得到很多高效算法。

Likewise, when print_report_irecurses, there is nothing left that it does after the point of recursion.

同樣地，當(dāng)print_report_i再次被調(diào)用時，在遞歸點之后不再做任何事情。

Recursion relies on a stack-based approach to passing variables. Many small machines have no hardware support for a stack.

遞迴依靠一個基于堆疊的方法來傳遞變數(shù)。許多小系統(tǒng)沒有硬體支持的堆疊。

Recursion relies on a "virtual stack" that purportedly has no real memory constraints.

遞迴依賴于“虛擬堆疊”這看來已沒有真正的記憶體限制。

Induction and the related concept of recursion also provide means of counting.

歸納法以及與之相關(guān)的遞歸概念也可以提供計數(shù)的方法。

This could certainly prove useful for complex programs implementing a great deal of recursion or with complicated loop conditions.

它可以被用來證明極其復(fù)雜的，含有大量遞歸以及循環(huán)結(jié)構(gòu)的程序是否有效。

The processing of these lists using recursion and Lisp functions like car and cdr is the power of list processing using Lisp.

使用遞歸和諸如car和cdr之類的Lisp函數(shù)處理這些列表是使用Lisp處理列表的強(qiáng)大之處。

A common question when running queries is: "How does this element relate to the beginning of the recursion? "

運(yùn)行查詢時一個常見的問題是：“這個元素與遞歸的開始有怎樣的關(guān)系？”

Doing so would be a useful exercise, and a helpful lesson in runaway recursion.

這樣做將是十分有用的練習(xí)，并且對失控遞歸非常有用。

As a result, just trying to expand the structure directly leads to infinite recursion loops.

所以，只想直接展開結(jié)構(gòu)，可能會形成無限的遞歸循環(huán)。

A simple recursion formula can then be used to solve such a system.

一個簡單而又重復(fù)的公式能用來解這樣的方程組。

In the definition above, we've written the function with explicit recursion. We'll use the Y combinator to get rid of that!

在上面的定義中，我們編寫了一個顯式的遞歸程序。我們將使用Y組合子清除它。

In this paper, using recursion formula of the adjoint polynomial, we shall obtain adjoint polynomials of two graphs.

本文運(yùn)用伴隨多項式的遞歸公式，求出了兩類圖的伴隨多項式。

Finally, by means of the formulae of recursion and back-substitution presented in this paper the problem is worked out.

最后，按本文所述遞推回代公式進(jìn)行求解。實例表明，計算結(jié)果與實驗相符。

Results A recursion formula to the solutions of a class of linear ordinary differential equations with constant coefficients is given.

結(jié)果給出了求一類常系數(shù)非齊次線性微分方程的特解的遞推公式。

Recursion is actually a way of defining functions in which the function is applied inside its own definition.

遞歸實際上是定義一個調(diào)用自身的函數(shù)的方式。

Will use recursion to acquire the lock on each bucket and rehash the elements from each bucket into a new, larger hash table.

就使用遞歸獲取每個bucket上的鎖并重排每個bucket中的元素到一個新的、更大的hash表中。

Left-recursion is more efficient and, for large input sets, may be the only viable option.

向左遞歸更有效，而且對較大的輸入集來說，這可能是惟一可行的選擇。

The lengthy code snippet shown in Listing 6 uses a recursion technique inspired by the PHP open source community (see Resources).

清單6中這段長長的代碼片段采用了PHP開放源碼社區(qū)（請參閱參考資料）提出的遞歸技術(shù)。

In BNF , the only way to indicate a list of an arbitrary number of elements is through recursion .

在BNF表示法中，為了表示一串任意個數(shù)的元素，唯一的方法是通過遞歸來定義。

Remember that the concatenation using concat2 requires two strings, so a number will cause this function to break within the recursion.

記住，使用concat2進(jìn)行連接要求使用兩個字符串，因此數(shù)字將導(dǎo)致此函數(shù)在遞歸之間中斷。

Most call stack errors are related to one of these two recursion patterns.

大多數(shù)調(diào)用棧錯誤與這兩種模式之一有關(guān)。

Secondly, the least square method by recursion is carried on modeling for the disturbing force and moment of random sea.

其次，利用遞推最小二乘法對隨機(jī)海浪擾動力和擾動力矩進(jìn)行建模。

Gets the number of times the current thread has entered the lock in upgradeable mode, as an indication of recursion.

獲取一個值，該值指示當(dāng)前線程是否已進(jìn)入讀取模式的鎖定狀態(tài)。

Workflow is the core of the system, which used recursion method to accomplish its workflow execution.

工作流是系統(tǒng)的核心部分，采用遞歸方式實現(xiàn)了工作流的執(zhí)行過程；

condition of a kind of jump Vandermonde matrix through linear equations, and recursion formula and the expression of its inverse Matrix.

利用線性方程組給出了一類跳行范德蒙矩陣可逆的條件，并給出了逆矩陣的遞推公式和逆矩陣的顯式表示式。

Some recursion formulae of Bessel functions are derived from such practice problems as well.

并從該實際問題出發(fā)，推導(dǎo)出了一類貝塞爾函數(shù)的遞推公式。

Tree models partition space of variables imported in a recursion way, and their aim to maximize evaluation function about purity of sorts.

樹模型是以一種遞歸方式來劃分輸入變量的空間，目的是最大化關(guān)于類純度的評價函數(shù)。

Just like static detection of bad generic constructor calls, forbidding polymorphic recursion conflicts with incremental class compilation.

就象靜態(tài)檢測糟糕的泛型構(gòu)造函數(shù)調(diào)用一樣，禁止多態(tài)遞歸會與遞增式類編譯發(fā)生沖突。

Recursion means repetition in subelements, like the pattern of veins in a leaf.

遞歸手段重復(fù)子元素，如葉脈的排列。

Said of software that calls itself. Recursion should generally be avoided in an embedded system, since it frequently requires a large stack.

自己調(diào)用自己的程序的說法。遞歸一般在嵌入式系統(tǒng)中是不充許的，因為它常常占有大量的堆棧空間。

In functional languages, most tasks that are accomplished with loops in traditional languages are instead accomplished with recursion.

函數(shù)式編程中，傳統(tǒng)語言中用循環(huán)完成的多數(shù)任務(wù)都可以使用遞歸來完成。

It is possible to write pure SQL statements with complex recursion to do this.

這可以通過編寫帶有復(fù)雜遞歸的純SQL語句來實現(xiàn)。

Recursion permits you to explore possible routes through this graph.

使用遞歸，您可以通過此圖形查看可能的路線。