Download for Windows Premium
Publicidade
mutual recursion

Tradução de "mutual recursion" em chinês

Não foi possível encontrar esta entrada. Mostrando resultados aproximados. Verifique a ortografia ou proponha a adição deste termo ao dicionário.
互递归
This approach allows you to write mutual recursion: DoubleHello calls Hello, but Hello might call DoubleHello, too. Of course there must be a condition to terminate the recursion, to avoid a stack overflow. You can find this code, with some slight changes, in the DoubleH example.
上述方法可用来写递归调用:即DoubleHello 调用Hello,而Hello也可能调用DoubleHello。当然,必须设置条件终止这个递归,避免栈的溢出。上面的代码可以在例DoubleH 中找到,只是稍有改动。
Mutual recursion is very common in the functional programming style, and is often used for programs written in LISP, Scheme, ML, and similar languages.
互递归在函數程式語言风格中是常用的,如Lisp, Scheme, ML语言等。
In mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational objects, such as functions or data types, are defined in terms of each other.
互递归是数学与计算机科学中一种递归,指两个数学或计算机对象如函数或数据类型互相定义。
State machines within a single subroutine, where the state is determined by the current entry/exit point of the procedure; this can result in more readable code compared to use of goto, and may also be implemented via mutual recursion with tail calls.
协程之常见用例 [ 编辑 ] 协程有助于实现: 状态机 :在一个子例程里实现状态机,这里状态由该过程当前的出口/入口点确定;这可以产生可读性更高的代码。
Mutual recursion can also implement a finite-state machine, with one function for each state, and single recursion in changing state; this requires tail call optimization if the number of state changes is large or unbounded.
互递归也可以实现有限状态机,每个函数表示一个状态,这要求尾递归优化因为状态变迁可能是非常大或无限的。
Não foram achados resultados para esta acepção.
Assine o Premium para desbloquear milhões de exemplos de tradução, salvar e aprender vocabulário sem limites e usar o serviço sem anúncios.

Sinônimos e analogias para "mutual recursion" em inglês

Palavra e Expressão do Dia
Imagem do dia
tree stump: base of a tree left after cutting
Descubra o significado
Publicidade

Resultados: 5. Exatos: 5. Tempo de resposta: 15 ms.