Examples of using Recursive in English and their translations into Chinese
{-}
-
Political
-
Ecclesiastic
-
Programming
What is tail recursive?
That recursive nature is the infinite game.
You must write a recursive function.
The following two functions even and odd are mutually recursive.
I write it out as a recursive function.
People also translate
A recursive lock keeps track of how many times it was successfully acquired.
This is because mining has a recursive punishment system.
The--recursive(-r) option makes rsync copy all directories recursively.
The name Fiji is a recursive acronym, much like GNU.
Listing 15-4: The error we get when attempting to define a recursive enum.
(Note that this definition is recursive for annotation typed members.).
Recursive DNS: Clients typically do not make queries directly to authoritative DNS services.
If you want to keep state for a while and every now and then modify it,you write a recursive function.
I gave you a recursive method that removes any and all choice for the 1998 value.
CONFIRM for formative inference-based recursive modeling for continuous response variables.
Recursive DNS: Typically, clients do not make queries directly to authoritative DNS services.
CATFIRM for formative inference-based recursive modeling for categorical response variables.
Write a recursive function lookup(trie, key) that looks up a key in a trie, and returns the value it finds.
The recursion is bounded because in each recursive application either m decreases, or m remains the same and n decreases.
Recursive functions do not use any special syntax in Python, but they do require some effort to understand and create.
In addition to forwarding DNS requests and the recursive nature, you can also configure more than one server to be'authoritative' for a particular domain.
In a recursive query, the client expects the server to respond the full answer(i.e., to resolve a name to the IP address).
If the representation of object exposes a recursive entry, the recursive reference will be represented as<Recursion on typename with id=number>
The name is a recursive acronym for"GiNaC is Not a CAS"(Computer Algebra System).
As the algorithm is recursive, we can build Bezier curves of any order, that is: using 5, 6 or more control points.
A database is also recursive, meaning that you can go back to repeat a task on a particular record and modify or delete it.
I call this kind of data recursive data, which means that if the previous data is correct, then the current data must be correct.
How could you set up a recursive function so that a smart language/ compiler could evaluate the function and never run out of memory?
This process is called recursive resolution, because you have to go back and forth asking different servers what's basically the same question.
However, the set of primitive recursive functions does not include every possible total computable function- this can be seen with a variant of Cantor's diagonal argument.