similar to: Unsupported expression in static initializer?

Hi, I use write.table() to write a file to an external xls file. the column names left-shift one position in output file. I check with col.names() row.names(), the file is fine. How to prevent the shifting? I71 I111 I304 I307 I305 I306 I114 I72 AFFX-BioB-5_at 6.66435 6.787807 5.335962 5.250163 6.47423 5.882104 5.965109 6.591687195 AFFX-BioB-M_at 6.163227 5.965427 4.665569 2.743531 6.097244

Dear all, Suppose I have a very long expression e. Lets assume, for simplicity, that it is e = expression(u1+u2+u3) Now I wish to replace u2 with x and u3 with 1. I.e. the 'new' expression, after replacement, should be: > e expression(u1+x+1) My question is how to do the replacement? I have tried using: > e = parse(text=gsub("u2","x",e)) > e =

Dear all, I am using the function 'D' in the 'stats' package to perform symbolic derivation. This works very well and it is much faster than e.g. Mathematica (at least for my purposes). First, I would like to thank the development team for this excellent function. However, I run into trouble in some cases, particularly when I am to do some operations on long expressions

Semi-OT? I just got a new SanDisk 8GB flash drive, and, as usual, it came with the U3 software (for Windoze) on a "CD" partition and considerably less than 8GB on the disk partition. I put it into my WinXP portable and told U3 to delete itself, but I still can't get at the old U3 part of the drive. I've tried WinXP's format command, disk management and CentOS's fdisk,

Dear all, I need to do a loop in R, but I am not sure the software is generating "n" times the variables I request differently. When I ask to print the last matrix created, I just can see the loop for n=1. To be more precise, supose I need to simulate 10 times one variable and I want to fit the 10 variables simulated in a matrix. I dont really know what I am doing wrong, but I just

Hello everybody! I’m trying to define the optimal number of surveys to detect the highest number of species within a monitoring season/session. To do this I want to run all the possible combinations between a set of samples and to calculate the total number of species for each combination of 2, 3, 4 …n samples events, so that at the end I will be able to define which is the lowest number of

Hello, I'm running samba v2.0.5a and I have some problems with settings users access rights to our Projects share. We have a projects share with project directories: \\XX\Projects\P1 ... P5 and 6 people : U1 ... U6 All users must have primary group "users". I need to set permissions for each Px directory and each Ux user. (For ex.: U1,U2 has rwx for P1/* U2,U3,U6 has

hello I have three users u1 ,u2 and u3 I have a share named "mrt" and it has two subfolder "mrt1" and "mrt2". what i have to do is that when u1 logs in mrt it should view all the contents inside mrt (including contents of its subfolderand all) and when u2 logs into mrt it should view mrt1 and restrict mrt2 and in same way when u3 logs into mrt ,it could access mrt2

Hi, Our department has detected a bug in the implementation of the Kinderman-Ramage generator for normal random variates in version 1.7.0, which can be seen from the below R session. (Consecutive calls for chisq.test(...) always gives p-values very close to 0.) We have already encountered this bug in version 1.6.2 The error is in file R-1.7.0/src/nmath/snorm.c Here is a patch for this file to

Dear All, I tried following for getting derivative of a polynomial in R i<- -10:10 x<-i*i*i+3*i*i+2 fun_spline<-splinefun(i,x) plot(x,type="l") lines(x,fx_spline(x, deriv=1), col='green') lines(x,fx_spline(x, deriv=2), col='green') Now when I plot 3*i*i + 6*i and 6*i + 6 the plot was not same for first deivative. where as the 2nd derivative was same Is this a

Just curious, haven't seen much discussion on this or anything in the news page. Is U3 being built yet ? Might we expect to see a test release sometime soon ? -- Beau Henderson JustManaged.com - Affordable Linux Administration & Security Services.

Hi Sanjay, thank you a lot for your answer. I understand that in your examples it is desirable that `foo` and `goo` are canonicalized to the same IR, i.e., something like `@goo`. However, I still have a few open questions, but please correct me in case I'm thinking in the wrong direction. > Am 21.07.2016 um 18:51 schrieb Sanjay Patel <spatel at rotateright.com>: > > I've

Hi all, I have a question regarding a transformation that is carried out in InstCombine, which has been introduced by r48715. It unfolds expressions of the form `zext(or(icmp, (icmp)))` to `or(zext(icmp), zext(icmp)))` to expose pairs of `zext(icmp)`. In a subsequent iteration these `zext(icmp)` pairs could then (possibly) be optimized by another optimization (which has already been there before

The latest ZFS patches for Solaris 10 are now available: 120011-14 - SunOS 5.10: kernel patch 120012-14 - SunOS 5.10_x86: kernel patch ZFS Pool Version available with patches = 4 These patches will provide access to all of the latest features and bug fixes: Features: PSARC 2006/288 zpool history PSARC 2006/308 zfs list sort option PSARC 2006/479 zfs receive -F PSARC 2006/486 ZFS canmount

On Tue, Jan 27, 2015 at 8:58 PM, Sanjoy Das <sanjoy at playingwithpointers.com> wrote: > > Ah, yes. You are right, we cannot always assume that %y would be zero in > > the second case. > > This wouldn't be the first time we've lost information that we could use > to > > optimize a program by transforming it. > > > > Do you think this result

On Tue, Jan 27, 2015 at 8:32 PM, Sanjoy Das <sanjoy at playingwithpointers.com> wrote: > > > > Correct me if I am wrong but we are talking about transforming: > > %maybe_poison = add nuw i32 %a, %b > > %x = zext i32 %maybe_poison to i64 > > %y = lshr i64 %x 32 > > > > To: > > %za = zext i32 %a to i64 > > %zb = zext i32 %b

My gut tells me that Hal is right, and we should prefer zexts as long as the select boils down to one instruction, but let me go against my intuition and try to list two reasons why we should prefer selects: * Folding operations into selects: it is trivial to transform f(select X, Const0, Const1) to select X, f(Const0), f(Const1), while doing that can be difficult for zexts. define

I don't know how things work at the moment, but it seems to me that you can do lots of sensible things, and avoid lots of silly things, if you keep track of four possible values for each bit: - undef (the default) - poison - known to be 0 - known to be 1 This makes both David's and Chandler's examples work nicely if you assume: - ZEXT makes all the new bits known 0 - SEXT makes all

I have another round of questions about IR select canonicalizations. For the purity of this quiz, please disregard prior knowledge of how this is handled by instcombine or how this is lowered by your favorite target...of course we'll fix it. :) Some answers in the links below if you do want to know. Which, if any, of these is canonical? 1. Is a zext simpler than a select? a. define i32

> I don't understand why you want to factor out the information, > exactly. It seems like what you need is a function like: > > unsigned getMinLeadingZeros(const SCEV *); > > then, if you want to get the non-extended expression, you can just > apply an appropriate truncation. I assume, however, that I'm missing > something. The problem is not about how to codegen