Displaying 5 results from an estimated 5 matches for "1mio".
Did you mean:
1min
2005 Feb 25
2
Simulation Progress
Hi,
I've made a function that executes a monte-carlo simulation.
It always needs a lot of time until e.g. 1Mio simulation steps are done.
So I would like to know, how many percent of the work is already done.
In an Excel/VBA Solution I could easily implement a status bar or status
window.
How could an R-Solution look like?
Carsten
2011 Jul 23
2
analizing .txt file with R or an other program
Hello together
I have a .txt file with about 1Mio! rows.
Sometimes the rows are in the following order (whereas the number of rows
between the rows marked with an x differ):
...
*SBLINK R 5261507*x
5261439 516.4 364.3 9148.0 ... 816.0 -1133.0 48.4 MA.C.TB...BL.
5261441 516.4 364.0 9145.0 ... 799.0 -1135.0 48.7 MA.C.TB...B.....
2003 Aug 26
2
[LLVMdev] repeated recursion with "frozen" arguments
...s for a given instantiated object
>> of the classes where performance is critical, e.g. for classes
>> like valarray.
CL> Sure, but you still need the 'this' pointer, to know WHICH valarray you
CL> are talking about... ?
sure. But what if this `this' was set once for 1mio calls?
Today I have a lot heavy math function working with two spectra and
every time I have to think twice before making another member function
which is invoked in deeper stack frames.
In other words, just imagine the situation, when for a given object
really a lot of *its* members function are...
2003 Aug 26
0
[LLVMdev] repeated recursion with "frozen" arguments
...:)
I just mean you have an explicit stack data structure to store just the
elements the recursive call needs.
> CL> Sure, but you still need the 'this' pointer, to know WHICH valarray you
> CL> are talking about... ?
>
> sure. But what if this `this' was set once for 1mio calls?
> Today I have a lot heavy math function working with two spectra and
> every time I have to think twice before making another member function
> which is invoked in deeper stack frames.
varray's do not have any recursive function calls, and the methods tend to
be simple. For t...
2003 Aug 26
4
[LLVMdev] repeated recursion with "frozen" arguments
Hi llvm-devels,
there is a very simple using case concerning LLVM and I am wondering whether it might be optimized at LLVM layer:
//-----------
int rec_func(int x, int y) {
if(y<0) return x;
return y + rec_func(x, y-1); // should we really push x?
}
void main() {
rec_func(1, 1000);
rec_func(2, 2000);
}
//-----------
Guys, don't focus on a stupid mathematics beyond this function