similar to: No subject

Full_Name: Ben Saville Version: 2.1 OS: Windows XP Submission from: (NULL) (152.2.94.145) I'm using the gsummary function to calculate a sum of V1 (column one) from my data 'mytest' by group (V2,or column 2). If V1 (the variable of interest) is all the same value (in this case all 2's), I do not get back the correct summation. If there is at least one difference in V1 (all

Could someone give me a hand with the format of the gsummary function? Basically, I have a large set of xyz coordinates generated by LiDAR data (>37 million points) and I am trying to derive various summary statistics on the z-coordinates by a grid cell. I wrote a function to do this by creating factors from the x- and y- coordinates and then using gsummary. However, I want the function to

Dear R-users, I am a newbie to this site and a relative new-comer to S/R, so please tread lightly, for you tread... There have been several posting relating to problems with augPred() from the nlme library. Here is a "fix" for one of these problems which may lie at the root of others. In my case the problem with augPred() lay in gsummary(), which augPred() uses, causing it to fail.

Need your expertise for the theoretical approach to deduce the p-values for the level, trend and seasonality parameters. I wonder if there's source code available. Thanks group. Kel

Hi: Thanks a lot to Deepayan Sarkar, author of lattice I think, who solved my first query. I am afraid that I have another one. I am plotting several mutipanels boxplots (with one conditioning variable) on one page. The x, y and conditioning variable are all continuous variables. The x and conditioning variables are transformed to shingles before being plotted. The plot looks nice but there

The LegalizeDAG.cpp file has this code in SelectionDAGLegalize::PromoteNode: case ISD::BSWAP: { unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits(); Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1); Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1); Tmp1 = DAG.getNode(ISD::SRL, dl, NVT, Tmp1, DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));

On Dec 22, 2009, at 2:38 PMPST, Bill Wendling wrote: > The LegalizeDAG.cpp file has this code in > SelectionDAGLegalize::PromoteNode: > > case ISD::BSWAP: { > unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits(); > Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1); > Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1); > Tmp1 = DAG.getNode(ISD::SRL, dl,

Hello! I am merging two datasets and I have encountered a problem with sort. Can someone please point me to my error. Here is the example. ## I have dataframes, first one with factor and second one with factor ## and integer > tmp1 <- data.frame(col1 = factor(c("A", "A", "C", "C", "0", "0"))) > tmp2 <- data.frame(col1 =

Dear all, The function f() below is a function of m1 and m2, both of which are matrices with 3 rows. The function works sequentially one row after another. So altogether there are three stages. I am trying to update the coding to write a generic function that will work for arbitrary k stages. I am hoping to get some suggestion and help. Thanks so much! Hanna ##x, y are two

Eli, Using the variables from the original IR, assuming tmp == tmp1 and assume the value is not nan ogt(tmp, tmp1) is !isnan(tmp) && !isnan(tmp1) && tmp > tmp1, or false ule(tmp, tmp1) is isnan(tmp) || isnan(tmp1) || tmp <= tmp1, or true So, this is invalid, or am I misunderstanding what ogt and ule stand for? Assuming this is valid, why convert comparison instructions

Some of the optimizations that the first DAG combine performs is counter productive for our 8-bit target. For example in: // I dropped the types because they are irrelevant. // Excuse me for changing the syntax... store %tmp1, %var %tmp2 = load %var %tmp4 = add %tmp3, %tmp2 Since load is the only user of var and since var has just be stored to, it assumes that %tmp1 is alive and it goes ahead

data: > tmp1 Date HrMn Temp Q.4 1 19450101 0900 -37.0 1 2 19450101 1000 -35.9 2 3 19450101 1100 -35.9 3 4 19450101 1200 -36.4 4 5 19450101 1300 -36.4 5 6 19450101 1400 -36.4 6 7 19450101 1500 -36.4 7 8 19450101 1600 -37.5 9 Accidentally, I did this (I meant to write Q.4 instead of Q here) > tmp1$Q[tmp1$Q!="1" & tmp1$Q!= "5"]<-NA I would

Using the Thumb-2 target we see that ORN ( a | ^b) and BIC (a & ^b) have similar patterns, as we would expect: defm t2BIC : T2I_bin_irs<"bic", BinOpFrag<(and node:$LHS, (not node: $RHS))>>; defm t2ORN : T2I_bin_irs<"orn", BinOpFrag<(or node:$LHS, (not node: $RHS))>>; Compiling the following three works as expected: %tmp1 = xor i32

On Mon, Nov 10, 2008 at 5:00 PM, Villmow, Micah <Micah.Villmow at amd.com> wrote: > Eli, > Using the variables from the original IR, > assuming tmp == tmp1 and assume the value is not nan > ogt(tmp, tmp1) is !isnan(tmp) && !isnan(tmp1) && tmp > tmp1, or false > ule(tmp, tmp1) is isnan(tmp) || isnan(tmp1) || tmp <= tmp1, or true Correct; in fact, ogt and

In LegalizeDAG.cpp, truncating stores are custom-lowered in line 1314-1317: 1314 case TargetLowering::Custom: 1315 ReplaceNode(SDValue(Node, 0), 1316 TLI.LowerOperation(SDValue(Node, 0), DAG)); 1317 break; Is there a reason it doesn't check whether the SDValue returned from TargetLowering::LowerOperation is null before it replaces the

Dear Daniel, Thank you for your email. According to your suggestion, I tried to use the shared memory filesystem for data exchange between the host machine and the container. The steps are as follows: 1) create an empty file in the host machine (/tmp1/file1). 2) run #chmod 777 /tmp1 and #chmod 777 /tmp1/file1. 3) expose /tmp1 to the container by configuring the container with the following XML

Dear, Thanks for your help. My question is the title can not completely show in the drawing area when the title is too long. So, I need to change the value of cex.main each time. Could you help me to control the title display area? Regrad, ken -----Original Message----- From: Patrick Connolly [mailto:p.connolly at hortresearch.co.nz] Sent: Wednesday, September 11, 2002 4:41 AM To: Ken

On Jun 25, 2009, at 4:38 PM, David Goodwin wrote: > Using the Thumb-2 target we see that ORN ( a | ^b) and BIC (a & ^b) > have similar patterns, as we would expect: > > defm t2BIC : T2I_bin_irs<"bic", BinOpFrag<(and node:$LHS, (not node: > $RHS))>>; > defm t2ORN : T2I_bin_irs<"orn", BinOpFrag<(or node:$LHS, (not node: >

On Jul 3, 2008, at 3:07 PM, Richard Osborne wrote: >> >> This seems to break the convention. It should be the responsibility >> of the caller to further legalize the results. >> >> Evan > That makes sense. In that case I believe > SelectionDAGLegalize::LegalizeSetCCOperands > should be legalizing the result. The description of this function > says

Evan Cheng wrote: > On Jul 3, 2008, at 3:07 PM, Richard Osborne wrote: > >>> This seems to break the convention. It should be the responsibility >>> of the caller to further legalize the results. >>> >>> Evan >>> >> That makes sense. In that case I believe >> SelectionDAGLegalize::LegalizeSetCCOperands >> should be