similar to: round() and negative digits

Hi, So far as I can tell, the 'col.ticks' parameter for axis() only uses the first value provided. E.g.: plot(0:1,0:1, col.ticks=c('blue','red','green')) #all ticks are blue Just wondering if there's a different option in the basic plot commands that can handle multiple colors, and also whether ggplot and/or lattice allow for multiple tick colors.

Hi, While playing with quantile-quantile plots, I wrote up some code which plots something strangely different. Here's the pseudocode: testhist <- hist(sample_data) refhist <- hist(rnorm(n, mean=0,sd=1)) # for some large-ish n cumtest <- cumsum(testhist) cumref <- cumsum(refhist) plot(cumref,cumtest) This produces a straight line of slope 1 for a sample with the same

I followed a couple threads from the archives and from stackoverflow.com, and would like to know: just what is "..." ? What I mean by this is,for example, from the point of view of a user running a function in debug mode, is "..." an object, or does it exist in the current environment as some thingy? Maybe a better question to ask is: if I were to write some function

Hi all, I'd like to plot the Real and Imaginary parts of some f(z) as two different surfaces in wireframe (the row/column axes are the real and imag axes). I know I can do it by, roughly speaking, something like plotz <- expand.grid(x={range of Re(z)}, y={range of Im(z), groups=1:2) plotz$func<-c(Re(f(z),Im(f(z)) wireframe(func~x*y,data=plotz,groups=groups) But that seems like a

"Not that it really matters, but" Can someone explain how the row numbers get assigned in the following sequence? It looks like something funky happens when rbind() coerces 'bar' into a dataframe. In either sequence of rbind below, once you get past the first two rows, the row numbers count normally. Rgames> (foo<-data.frame(x=5,y=4,r=3)) x y r 1 5 4 3 Rgames>

This question attacked me as I was thinking about matrix value updates. I probably will never need to do this, but wanted to ask if there are efficient methods to perform the for-loop in the following sequence. %xymat<-matrix(rep(0,100) nr=10,nc=10) # empty matrix %x<-1:10 %y<-sample.int(10,10,rep=T) %for (j in 1:10) xymat[x[j],y[j]] <- some_function(x[j],y[j]) #to create either

I feel bad even asking, but: Rgames> data(OrchardSprays) Rgames> model<-lm(decrease~.,data=OrchardSprays) Rgames> model Call: lm(formula = decrease ~ ., data = OrchardSprays) Coefficients: (Intercept) rowpos colpos treatmentB treatmentC 22.705 -2.784 -1.234 3.000 20.625 treatmentD treatmentE treatmentF treatmentG treatmentH

Hi, Here is the next iteration of the patch. The only comment not addressed is this one: > It would be better to implement a target-independent check for > overflow for the "Legal" case (like how SADDO does). Hacker's > Delight > has some hints on how to do this. It's not easy for the signed case, > but is do-able. It can be lowered to a division + a branch,

I'm working on a Target that only uses the 5 lsbs of the shift amount. I only have 32 bit registers, no 64 bit, so 64 bit math is emulated, LLVM doing the transformations whenever I can get it to. I think I'm seeing a case where it ultimately looks like a standard multiword shift (from e.g. Hacker's Delight) is being inline expanded that assumes at least 6 bits of the shift is

Hi, A recent thread provided a (working) construct for lm: lm(as.matrix(freeny[ix]) ~., freeny[-ix]) Can someone explain what is meant by the formula in that expression, that is, what does "mymatrix~." do? I couldn't find any such example in the lm() or formula() help pages. thanks Carl

HI, Sorry Carl, I received your message in my spam folder. Sarah proposed me a good example of code. Thank you Momadou  ________________________________ De : Carl Witthoft [via R] <ml-node+s789695n4188375h96@n4.nabble.com> Envoyé le : Mardi 13 Décembre 2011 3h34 Objet : Re: Polygon Please read the posting guide and provide a (small) reproducible example of your data. The statement

Ignore the suggested fix in my earlier post. How about this? diff --git a/lib/Target/X86/X86ISelLowering.cpp b/lib/Target/X86/X86ISelLowering.cpp index 20c81c3..b8ebf42 100644 --- a/lib/Target/X86/X86ISelLowering.cpp +++ b/lib/Target/X86/X86ISelLowering.cpp @@ -1632,10 +1632,11 @@ X86TargetLowering::X86TargetLowering(const X86TargetMachine &TM, if (!Subtarget.is64Bit()) { // These

Dear fellow Wine users, It was to my recent delight that I found that EndNote 3 will work usably under Wine. However, it does seem to display a slightly odd problem when certain keys are pressed. In essence, the problem seems to be that certain keys, when pressed, generate two keystrokes. So for example, pressing RETURN moves down two lines, pressing BACKSPACE deletes two characters, pressing

Hacker's Delight or this web page are probably the best references for tricks like this: https://graphics.stanford.edu/~seander/bithacks.html#CopyIntegerSign John On 03/30/2018 03:58 AM, edA-qa mort-ora-y via llvm-dev wrote: > I'm looking for ways to do some basic operations without using branches. > > The key operation I want is a floored/round-to-negative-infinity integer

On Tue, Dec 9, 2008 at 6:11 AM, Zoltan Varga <vargaz at gmail.com> wrote: > Hi, > > Here is the next iteration of the patch. The only comment not > addressed is this one: > Thanks! It's looking good. >> It would be better to implement a target-independent check for >> overflow for the "Legal" case (like how SADDO does). Hacker's > Delight

In lib/CodeGen/SelectionDAG/TargetLowering.cpp there are some functions magic() and magicu() that support optimising division by a constant. I'd like to use these functions in an LLVM FunctionPass that I'm working on. The attached patch moves these functions out of TargetLowering.cpp and into the APInt class, so that I can reuse them in my pass. What do you think? It looks to me like

On Tue Jan 14, 2020 at 8:27 PM, Reid Kleckner wrote: > I don't think there's any technical reason for the current structure. Apparently [this](https://docs.microsoft.com/en-us/cpp/cpp/compiler-limits?view=vs-2019) is a thing. This results in the following delight happening on Visual Studio 2015: > fatal error C1091: compiler limit: string exceeds 65535 bytes in length So maybe

This is not the same as the recent thread on a waterfall graph. I'm thinking about the rolling FFT display used in acoustics and other spectrum analysis tasks. Here's an example of a very fancy 3-D waterfall display: http://www.ultimaserial.com/UltimaWaterfall.html I was just wondering if there are any simple hidden-line tools in R that I could use to draw simple waterfall displays.

I can get clang/llvm to emit a rotate instruction on x86-64 when compiling C by just using -Os and the rotate from Hacker's Delight i.e., ====== #include <stdlib.h> #include <stdint.h> uint32_t ror(uint32_t input, size_t rot_bits) { return (input >> rot_bits) | (input << ((sizeof(input) << 3) - rot_bits)); } ====== Then compile with (assuming you are on OS

Let's say I have, for some reason, a bunch of scalars (i.e. single-valued variables) and I want to merge them all into a single vector of values. Can someone recommend a better function, or simpler way, to do so than the following? Suppose my scalars' names are foo1, foo2, foo3, foo1high, foo2high, foo3lo2, etc. Then I can do: >ls(pat='foo')->thels