similar to: Sum of vector elements

Hi, A column of my df looks like A 10/20/30 40/20 60/10/10/5 80/10 I want to split it such that the last column has the last composition and if there are not enough the middle columns get the 0s. That way my df would look like A1 A2 A3 A4 10 20 0 30 40 0 0 20 60 10 10 5 80 0 0 10 How can I do that ?? [[alternative HTML version deleted]]

Ein eingebundener Text mit undefiniertem Zeichensatz wurde abgetrennt. Name: nicht verf?gbar URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20130513/fe848ce7/attachment.pl>

Hi, relist() is broken when the skeleton is a list with empty list elements: > x <- list(1:3, integer(0), 11:14) > relist(unlist(x), x) [[1]] [1] 1 2 3 [[2]] [1] 11 3 [[3]] [1] 11 12 13 14 Hard to believe that such a bug has been around for 6 years (i.e. since the introduction of relist()) without ever being noticed. Cheers, H. > sessionInfo() R

I have a vector of values X = seq(1:10) I want to get another vector V of with sample (with replacement) of X but with a constrain: V will have as much elements as those necessary to V sum exactly 10. If the N-th value of V make the sum greater than 10, it's is subtracted with the difference to achieve the constrain. I don't know how to achieve this. with a while?

Dear R-help list, Pls I have this problem. Suppose I have a matrix of size nxn say, generated as follows   z<-matrix(rnorm(n*n,0,1),nrow=n)   I want to write a function such that for i in 1:n, I will remove the rows and columns corresponding to i (so, will be left with n-1*n-1 submatrix in each cases). Now I need the sum of the determinant of each of this submatrices. As an example, if n=3, it

I have a problem receving calls via the ISDN line, using the followin components Asterisk 1.0.9 with asterisk@home chan_capi-cm-0.6 AVM Fritz card datalink protocol = point to multimode I can make calls out with no problems so the issue is only incoming calls. When I make the call from an external line to the ISDN line connected to asterisk, I get a busy signal after about 5 seconds. I have

Hi, Using S=1000 and simdata <- replicate(S, generate(3000)) #If you want both "m1" and "m0" #here the missing values are 0 res1<-sapply(seq_len(ncol(simdata.psm1)),function(i) {x1<-merge(simdata.psm0[,i],simdata.psm1[,i],all=TRUE); x1[is.na(x1)]<-0; x1}) res1[,997:1000] #????? [,1]???????? [,2]???????? [,3]???????? [,4]??????? #x1??? Numeric,3000 Numeric,3000

On Mon, May 23, 2016 at 12:43 PM Hal Finkel via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hi Chandler, > > Regardless of the canonical form we choose, we need code to match > non-canonical associated shuffle sequences and convert them into the > canonical form. We also need code to match the pattern where we > extractelement on all elements and sum them into this

Dear all, I have got a question for generating repeats of a vector's elements. Please don't hesitate to email me back and say that it is very easy although I can't find a method to solve it. If I have a n-vector b, whose elements are b[1], b[2], ..., b[n], how can I generate such a vector b[1], b[1], b[2], b[1], b[2], b[3], b[1], b[2], b[3], b[4], ......, b[1], b[2], ...,

I'm a little confused. Here is why. I was able to add a vector add instruction to my target without using any intrinsics and without adding any new instructions to LLVM. So here is my question: how come I managed to add a new vector instruction without adding an intrinsic and why in order to add this particular instruction (sum elements in a vector) I need to add an insrinsic? Another

Hi, In the example you showed: m1<- matrix(0,length(vec),max(vec)) 1*!upper.tri(m1) #or ?m1[!upper.tri(m1)] <-? rep(rep(1,length(vec)),vec) #But, in a case like below, perhaps: vec1<- c(3,4,5) ?m2<- matrix(0,length(vec1),max(vec1)) ?indx <- cbind(rep(seq_along(vec1),vec1),unlist(tapply(vec1,list(vec1),FUN=seq),use.names=FALSE)) m2[indx]<- 1 ?m2 #???? [,1] [,2] [,3] [,4] [,5]

Suyog, Thanks for the reply. Do you know if it is possible to add a new intrinsic without actually modifying core code (ISDOpcodes.h is an example of core code)? I'd like to add this intrinsic with as little code change as possible. On Fri, May 27, 2016 at 8:59 PM, suyog sarda <sardask01 at gmail.com> wrote: > Hi Rail, > > Below 2 revisions might be of your interest which

Hi, I got a small problem on how to define the vector index without manually inspect the vector. example: y=c(2,3,5,2,4,6,8,3,6,2,5) #I have ten set of this kind of vectors (with different values but same length) that I would also like to run the routine below #say; v=the first index in y where the value is larger than 4, in this case index 3, value 5 #what I would like to do is take y[1:v]

Dear R-help, I have been trying really hard to generate the following vector given the data (x) and parameter (alpha) efficiently. Let y be the output list, the aim is to produce the the following vector(y) with at least half the time used by the loop example below. y[1] = alpha * x[1] y[2] = alpha^2 * x[1] + alpha * x[2] y[3] = alpha^3 * x[1] + alpha^2 * x[2] + alpha * x[3] ..... below are

hi, please help me on this. I'm very new to R. I've been figuring out how to do this the whole day, and I could not get the correct R code. Suppose I have a dataframe called x and it consists of 10variables. >x h 1 h 2 h 3 h 4 h 5 h 6 h 7 h 8 h 9 1 0.38971928 0.62884802 0.32708216 0.093909834 0.57773251 0.41258918

Hi, I am sure this has come up before, but my searches of the archive didn't give any results (maybe I didn't use the right keywords, but if I use too many, the search times out). I have a vector of dimensions n, length is not fixed, eg n <- c(4,5,7) or n <- c(19,4,5,7) and a function f that takes a vector of indices, same length of n, and gives a scalar. I would like to fill

Hi Chandler, Regardless of the canonical form we choose, we need code to match non-canonical associated shuffle sequences and convert them into the canonical form. We also need code to match the pattern where we extractelement on all elements and sum them into this canonical form. This code needs to exist somewhere, so we need to decide whether it exists in the frontend or the backend. Having an

Hi all, I have a matrix with 10000 rows and 10 columns. The last columns contains another identifiers but the values are not uniques so that I want to generate another matrix with rows with unique values in the last column. If I did tmp<-unique(my_mat$col10) this will give me 8560 unique entries so the ideal matrix will be 8560X10 columns now then. I tried sub_mat<-my_mat[tmp,] but

Hi Shahid. Do you mind providing a concrete example of X86 code where an intrinsic was added (preferrable with filenames and line numbers)? I'm having difficulty tracking down the steps you provided. Any help is appreciated. On Mon, Apr 4, 2016 at 9:02 PM, Shahid, Asghar-ahmad < Asghar-ahmad.Shahid at amd.com> wrote: > Hi Rail, > > > > We had done this for generation

Hi all, I would like to have a function like this: split.vec.by.NA <- function(x) That takes a vector like this: x <- c(2,1,2,NA,1,1,2,NA,4,5,2,3) And returns a list of length of 3, each element of the list is the relevant segmented vector, like this: $`1` [1] 2 1 2 $`2` [1] 1 1 2 $`3` [1] 4 5 2 3 I found how to do it with a loop, but wondered if there is some smarter (vectorized) way