search for: bbcounts

...- seq(1,WavMaxNumCoef/2,1) vvCounts <- vector(length=WavMaxNumCoef/2) for(k in 1:(WavMaxNumCoef/2)) { vvCounts[k] <- length(which(vv[] == k)) } yyLab <- seq(1,length(t(vv)),2) bb <- read.table("16440-Length") bbLab <- seq(min(bb),max(bb),1) bb <- sort(t(bb)) bbCounts <- as.numeric(vector(length=(max(bb)-min(bb)+1))) for(k in 1:length(bbCounts)) { bbCounts[k] <- length(which(bb[] == (k +min(bb) -1))) } zzLab <- seq(1,max(bbCounts),1) # DEFINE LAYOUT x11(width=22,height=14) nf <- layout(matrix(c(1,3,2,4),2,2,byrow=TRUE), c(3,1), c(2,2),FALSE...

Most of codegen is already FP64-ready. There are a few edge-cases that I ran into, many of which can apply even to non-fp64-enabled programs (although the double-wide registers are not very common without fp64). I've yet to give this a full piglit run, but wanted to send these out in case someone wanted to comment. They do not depend on the preliminary core fp64 work. Ilia Mirkin (5):

I've recently implemented profile guided section layout in llvm + lld using the Call-Chain Clustering (C³) heuristic from https://research.fb.com/wp-content/uploads/2017/01/cgo2017-hfsort-final1.pdf . In the programs I've tested it on I've gotten from 0% to 5% performance improvement over standard PGO with zero cases of slowdowns and up to 15% reduction in ITLB misses. There are

Hi All, I've been having a little trouble with creating a loop that will run a a series of t.tests for inspection, Below is the code i've tried, and some checks i've looked at. I've used the get(paste()) idea as i was told previously that the use of the eval should try and be avoided. I've run a single syntax to check that my systax is correct and works without any problems