Searched refs:once (Results 1 – 5 of 5) sorted by relevance
58 …As seen in the diagram, some elements are recalculated more than once. These operations are redund…63 … full recursion tree traversal and recalculation of values. Since all the nodes are traversed once,85 // Calculate nth value only once and store it in the buffer.
130 Often such an agglomeration is achieved by recursing serially once
163 static LONG once = 0; in print_call_stack() local164 if( !InterlockedExchange(&once, 1) ) in print_call_stack()
30 objects at once.76 objects at once. The ``limiter_node`` has a threshold of 3, and will
444 // Control flow gets here once both ChildTask and CallBackTask are executed