search for: merging

With the ATI bug I was hitting earlier fixed, only my btrfs partition continues to show high cpu usage for some operations. Rsync, git pull, git checkout and svn up are typicall operations which trigger the high cpu usage. As an example, this perf report is from using git checkout to change to a new branch; the change needed to checkout 208 files out of about 1600 total files. du(1) reports

Well for a long time now my wine menu entry in gnome has been gone. Most threads I read all say to fine the <deleted> tag in .config/menus/applications.menu but mine doesn't have it.

So I needed to merge 17 .csv files, and did so by brute force, but I might need to do so again. Anyone have suggestions for a for loop that might do the below for me (where a:r are separate .csv files) ab<-merge(a,b,all=TRUE) cd<-merge(c,d,all=TRUE) ef<-merge(e,f,all=TRUE) gh<-merge(g,h,all=TRUE) ij<-merge(i,j,all=TRUE) kl<-merge(k,l,all=TRUE) no<-merge(m,n,all=TRUE)

...f > deleting the rest of the llvm monorepo. Granted, this may be a slim > benefit since it will be a fairly arbitrary revision of the llvm > monorepo, taken at the point of the initial push. > I'm suggesting to build the history the exact same way you are currently, and then simply merging it onto master with a single merge commit ("git merge --no-ff"), rather than "fast-forwarding" the entire set of commits. So this is not a benefit, it'd be the same either way. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.l...

Hello, I am attempting to merge 8 different data sets into a "grand merge" data set; all their variable names are common except for the the gas measured. However, when I did a quick stat summary comparison of merged data with unmerged data, it turned out that R mysteriously duplicated thousands of values in the merged set and I have no idea why. I've not had this problem with merge

Hi, all. Last week I posted some code for extracting subtrees of trees in hclust format. Petra Steiner quickly found an example for which the code breaks, and sent it to me. The problem seems to be that I had not considered the possibility of trees with unlabeled nodes. In the new version of f.make.subtree (below), I steal some code from plot.hclust to assign labels if there are none. That

...,prot[[10]],by.x=1,by.y=1,all=T) pro<-merge(pro,prot[[11]],by.x=1,by.y=1,all=T) I noticed that starting file #8, the merge become more and more slower that when it's file #11, the computer was stuck!? Originally I thought something wrong with the later files, but when I change the order of merging, the slow-down still happens at the 8th files to be merged. Can anyone suggest what's going on with merging? Thanks John -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: p1.txt URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20...

Matthias Braun via llvm-dev <llvm-dev at lists.llvm.org> writes: > - Even in the long term I would vote to stay with linear history, I > see little benefits in having "correct" origin information of a commit > that the merging model provides. We often revert entire feature merges when problem arise. It's much easier to do in a merging workflow because you have a single commit to revert. In the end I don't really care which model LLVM uses. I just want to provide as much working knowledge as I can based on exp...

Hello, My problem is that I would like to merge multiple files with a common column but merge accepts only two data.frames to merge. In the real situation, I have 26 different data.frames with a common column. I can of course use merge many times (see below) but what would be more sophisticated solution? For loop? Any ideas? DF1 <- data.frame(var1 = letters[1:5], a = rnorm(5)) DF2 <-

Hi, As part of the migration of LLVM's source code to github, we need to update our developer policy with instructions about how to interact with the new git repository. There are a lot of different topics we will need to discuss, but I would like to start by initiating a discussion about our merge commit policy. Should we: 1. Disallow merge commits and enforce a linear history by

Hello, everyone I have a piece of code that looks like this: mrets <- merge(mrets, BMM.SR=apply(mrets, 1, MyFunc, ret="BMM.AV120", stdev="BMM.SD120")) mrets <- merge(mrets, GM1.SR=apply(mrets, 1, MyFunc, ret="GM1.AV120", stdev="GM1.SD120")) mrets <- merge(mrets, IYC.SR=apply(mrets, 1, MyFunc, ret="IYC.AV120",

Hi everyone, I'm currently working on a new function merging optimization that is more general than the current LLVM function merging optimization that works only on identical functions. I would like to know if the community has any interest in having a more powerful function merging optimization. ---- More Details ---- Up until now, I have been focusing...

Hi All, I am looking into merging 3 data sets I know how to do that by merging data1 with data2 and then merging the result with data 3. I was wondering if it can be done all at once so I tried, M<-merge(data1,data2,data3, by=?ID?) It does not work! Any ideas? -- View this message in context: http://www.nabble.com/merging-...

Actually I have collected some pointer information in the form [ p -> a,c ]. Now suppose at some node I have information as [p->a,c]. Now i want to find a merge node above this node where this information is actually geting merged. So if I get a merge node above this, I can check in its predecessors if their out has only [p->a] or [p->c] and if not so then I will look for the next

Um texto embutido e sem conjunto de caracteres especificado associado... Nome: n?o dispon?vel Url: https://stat.ethz.ch/pipermail/r-help/attachments/20080208/bf7b4696/attachment.pl

I'd like to be able to cut dendrograms at a height I specify and then plot the resulting subtrees. I wanted to use the dendrogram object for this purpose because there doesn't seem to be a canned way to cut a hclust object and get a list of hclust objects, but there is a function (cut) that does that for dendrograms. The problem I'm having is that when I plot a dendrogram, I

I've downloaded the "data.table" package from CRAN and R-Forge and still can't utilize merge.data.table for faster merges. How do I make this function visible? > install.packages("data.table",repos="http://R-Forge.R-project.org") trying URL 'http://R-Forge.R-project.org/src/contrib/data.table_1.5.1.tar.gz' Content type 'application/x-gzip'

...gt; geting merged. > So if I get a merge node above this, I can check in its predecessors if > their out has only [p->a] or [p->c] and if not so then I will look for the > next merge node above this one, and so on. > Okay. If you're only interested in the intra-procedural merging of points-to information for SSA variables, then you simply need to climb up the def-use chain of the value of interest until you hit a phi-node. Once you hit a phi-node, then you know that information is getting merged from incoming values from different predecessor basic blocks. Look at ea...

Hello, I merged my test commit successfully. (./utils/release/merge.sh --proj llvm --rev 46043 -srcdir ../llvm/) ... D46043 as "Merging r46043" https://reviews.llvm.org/rL330799 But I have issues with other patch - https://reviews.llvm.org/D45418 I ran ./utils/release/merge.sh --proj llvm --rev 45418 -srcdir ../llvm/ # Updating tree Updating '.': At revision 330799. # Merging r45418 into llvm locally --- Merging (f...

...SNP4, SNP1$x, by.x = 'Marker', by.y = 'Marker', all = TRUE) Error in fix.by(by.y, y) : 'by' must specify valid column(s) I won't work either. Does anyone have any idea how to solve this. Regards, Johannes. -- View this message in context: http://www.nabble.com/Merging-data-frames%2C-or-one-column-vector-with-a-data-frame-filling-out-empty-rows-with-NA%27s-tp23171110p23171110.html Sent from the R help mailing list archive at Nabble.com.