search for: lasti

Displaying 9 results from an estimated 9 matches for "lasti".

Did you mean: last
2013 Nov 01
6
[LLVMdev] Vectorization of loops with conditional dereferencing
...is not allowed. One possibility, if we disallow for m[i] to have been munmaped or page protected in the middle, is to first collect the first and last index for which the condition is true, and then run the vector loop only on that portion. For the loop above, I mean something like: FirstI = -1, LastI = -1, I = 0; for (; I < N; ++I) if (r[i] > 0) { FirstI = I; break; } for (; I < N; ++I) { if (r[i] > 0) LastI = I; } [In this case, since the guard dominates all side-effect, we don't need to do anything outside that range, otherwise, we'd need to run the sca...
2001 Mar 12
2
Regressions with monotonicity constraints
This seems to be a recurrent topic, but I don't remember hearing a definitive answer. I also apologies for cross-posting. Say I have a numerical response variable and a bunch of multi-level factors I want to use for modeling. I don't expect factor interaction to be important so there will be no interactions in the model. All this would be a perfect job for ANOVA except for one additional
2013 Nov 01
0
[LLVMdev] Vectorization of loops with conditional dereferencing
...; > One possibility, if we disallow for m[i] to have been munmaped or page protected in the middle, is to first collect the first and last index for which the condition is true, and then run the vector loop only on that portion. For the loop above, I mean something like: > > FirstI = -1, LastI = -1, I = 0; > for (; I < N; ++I) > if (r[i] > 0) { > FirstI = I; > break; > } > > for (; I < N; ++I) { > if (r[i] > 0) > LastI = I; > } > > [In this case, since the guard dominates all side-effect, we don't need to do anything outsi...
2013 Nov 01
1
[LLVMdev] Vectorization of loops with conditional dereferencing
...o have been munmaped or > > page protected in the middle, is to first collect the first and > > last index for which the condition is true, and then run the > > vector loop only on that portion. For the loop above, I mean > > something like: > > > > FirstI = -1, LastI = -1, I = 0; > > for (; I < N; ++I) > > if (r[i] > 0) { > > FirstI = I; > > break; > > } > > > > for (; I < N; ++I) { > > if (r[i] > 0) > > LastI = I; > > } > > > > [In this case, since the guard domin...
2011 Aug 24
2
Append a value to a vector
...nd in active T and the last value in another vector call activeR has to be repeated. (at the bottom you can find the vectors) I have done this: activeT=round(as.numeric(activeT)) inactT= round(as.numeric(inactT)) lastV<-round(as.numeric(tail(lat,1))) lastA<-round(as.numeric(tail(activeT,1))) lastI<-round(as.numeric(tail(inactT,1))) if (lastV!=lastA){ append(lastV, activeT) lastR=tail(activeR,1) append(activeR,lastR) } lastR has been appended to activeR but not lastV to activeV I guess that this is related to the attributes of the vectors this is why I applied as.numeric at all the vec...
2013 Nov 14
0
[LLVMdev] Vectorization of loops with conditional dereferencing
On 1 November 2013 13:40, Hal Finkel <hfinkel at anl.gov> wrote: > Done = false; > FirstI = -1, LastI = -1; > while (!Done) { > for (I = FirstI+1; I < N; ++I) > if (r[i] > 0) { > FirstI = I; > break; > } > > for (; I < N && !page_bound(&m[i]) && ...; ++I) { > if (r[i] > 0) > LastI = I; > } > >...
2012 Nov 21
0
Question about VAR (Vector Autoregression) in differences.
Folks, I have been using the VAR {vars} program to find a fit for the following bi-variate time series (subset): bivariateTS<-structure(c(0.950415958293559, 0.96077848972081, 0.964348957109053, 0.967852884998915, 0.967773510751625, 0.970342843688257, 0.97613937178359, 0.980118627997436, 0.987059493773907, 0.99536830931504, 1.00622672085718, 1.01198013845981, 1.01866618122606,
2013 Nov 14
3
[LLVMdev] Vectorization of loops with conditional dereferencing
...ndling pragmas and we just need to add the clang-side support. Is anyone planning to work on this ? On Nov 14, 2013, at 2:18 AM, Renato Golin <renato.golin at linaro.org> wrote: > On 1 November 2013 13:40, Hal Finkel <hfinkel at anl.gov> wrote: > Done = false; > FirstI = -1, LastI = -1; > while (!Done) { > for (I = FirstI+1; I < N; ++I) > if (r[i] > 0) { > FirstI = I; > break; > } > > for (; I < N && !page_bound(&m[i]) && ...; ++I) { > if (r[i] > 0) > LastI = I; > } > &g...
2006 Aug 18
11
#<Errno::EMFILE: Too many open files
My application runs a backgrond process and after running for a while I get this error in my logs: #<Errno::EMFILE: Too many open files Lasty, the ONLY code I have that does anything with files is: File.open(image_path, "wb") do |file| file.puts file_content end Any idea what this means? -- Posted via http://www.ruby-forum.com/.