similar to: [Bug 10552] New: Sender checksum calculation significantly slower with compression enabled

Displaying 20 results from an estimated 3000 matches similar to: "[Bug 10552] New: Sender checksum calculation significantly slower with compression enabled"

2007 Dec 01
1
rsync --delete problems
For some time I have been using rsync to backup data between different machines and my NAS drive. But within the last 2 days I have found out that rsync is not removing old files from destination - directories renamed or removed from source. In this example I want to sync files on my Debian Linux server to a NAS drive. NAS drive is mounted using smbmount. Using "-avhzn" dry-run it
2004 Aug 25
1
brlr function
Hi, I'm trying the brlr function in a penalized logistic regression function. However, I am not sure why I am encountering errors. I hope to seek your advice here. (output below) Thank you! Your help is truly appreciated. Min-Han #No error here, the glm seems to work fine >
2010 Feb 05
1
Strange "rownames"
I find one row in my large dataset. But when I use the "rownames" for the data on the 100,000 row, the result show nothing. I try it by the following example, it still likes that. > tst[rownames(tst)==100000,] [1] x y <0 rows> (or 0-length row.names) ############## > tst=data.frame(x=1:200000,y=200000:1) > tst[rownames(tst)==1,] x y 1 1 200000 >
2009 Apr 04
1
Rails 2.3.2 - template question
Simplest of template files, tst.rb, contains: PROJECT_NAME = File.basename(RAILS_ROOT) run ''echo '' + PROJECT_NAME Running command "rails tst -m ~/Rails_Tools/tst.rb" produces: create create app/controllers . . create log/development.log create log/test.log applying template: /Users/rick/RailsTools/tst.rb Anonymous modules
2007 Nov 23
1
complex conjugates roots from polyroot?
Hi, All: Is there a simple way to detect complex conjugates in the roots returned by 'polyroot'? The obvious comparison of each root with the complex conjugate of the next sometimes produces roundoff error, and I don't know how to bound its magnitude: (tst <- polyroot(c(1, -.6, .4))) tst[-1]-Conj(tst[-2]) [1] 3.108624e-15+2.22045e-16i
2010 Aug 16
1
WG: HOWTO samba4 centos5.5 named dnsupdate drbd simple failover
centOs5.5/samba4/named here is a short guide setting it up to work. First of all do not install the bind package coming with centos 5.5!! Install needs for samba yum install libacl* gnutls* readline* python* gdb* autoconf* Named installation: Here is a description on what to do: http://jason.roysdon.net/2009/10/16/building-bind-9-6-on-rhel5-centos5-for-d nssec-nsec3-support/ The steps, yum
2005 Feb 10
3
question about sorting POSIXt vector
Dear useRs, How come the first attempt to sort a POSIXt vector fails (Error: non-atomic type in greater), while the second succeeds? (Code inserted below.) The documentation says that POSIXt is used to allow operations such as subtraction, so I'd expect sorting to work. Is this perhaps an OS issue? (I run R 2.0.1 on Win xp.) Thank you, b. #------------code test <- c("2005-02-08
2010 Aug 09
2
HOWTO samba4 centos5.5 named dnsupdate drbd simple failover
centOs5.5/samba4/named here is a short guide setting it up to work. First of all do not install the bind package coming with centos 5.5!! Install needs for samba yum install libacl* gnutls* readline* python* gdb* autoconf* Named installation: Here is a description on what to do: http://jason.roysdon.net/2009/10/16/building-bind-9-6-on-rhel5-centos5-for-d nssec-nsec3-support/ The steps, yum
2005 Jan 26
4
apply for nested lists
Hi, I am working with lists whose terms are lists whose terms are lists. Although the real ones contain locuslink identifiers and GO annotations (I work with the Bioconductor GO) package, I have prepared an simplified example of what I have and what I would like to do with it: Imagine I have a list such as:
2003 Apr 04
2
Bug in %in% (match)
Hi, Am I hitting some limit in match? Consider the following example: > tst<-seq(100,125,by=.2)%in%seq(0,800,by=.1) > sum(tst) [1] 76 > seq(100,125,by=.2) [1] 100.0 100.2 100.4 100.6 100.8 101.0 101.2 101.4 101.6 101.8 102.0 102.2 [13] 102.4 102.6 102.8 103.0 103.2 103.4 103.6 103.8 104.0 104.2 104.4 104.6 [25] 104.8 105.0 105.2 105.4 105.6 105.8 106.0 106.2 106.4 106.6 106.8
2003 Apr 04
2
Bug in %in% (match)
Hi, Am I hitting some limit in match? Consider the following example: > tst<-seq(100,125,by=.2)%in%seq(0,800,by=.1) > sum(tst) [1] 76 > seq(100,125,by=.2) [1] 100.0 100.2 100.4 100.6 100.8 101.0 101.2 101.4 101.6 101.8 102.0 102.2 [13] 102.4 102.6 102.8 103.0 103.2 103.4 103.6 103.8 104.0 104.2 104.4 104.6 [25] 104.8 105.0 105.2 105.4 105.6 105.8 106.0 106.2 106.4 106.6 106.8
2010 Dec 04
2
Error in calcCurveGrob(x, x$debug) : End points must not be identical
Hi All... I haven?t found mention of this error anywhere. I'm trying to draw spline curves using grid graphics. Most of the time, I have no problems, but I have some data sets that give the error in the subject line. I'm not sure which end points are identical, but the end points passed to the function are definitely not identical. Any assistance appreciated! Bryan tst <-
1997 Oct 30
2
R-alpha: buglet in return(invisible()) [R 0.50 and 0.60]
Evaluate the following example to get the behavior : --- anybody: patch ? --- tst.i <- function(x) { if(missing(x)) return(invisible()) else if(!is.numeric(x)) stop("x must be numeric") ## else invisible((x+3)^2) } tst.i()#-- should NOT print anything !! print(mode(tst.i()))#--gives "NULL" both in S-plus 3.4 and R 0.60 tst.i(1)# nothing (ok in R and
2001 Mar 26
1
Problems with R CMD COMPILE within Makefile (PR#885)
Dear R-developpers This concerns a problem I posted about half a year ago on the R-help list and to which I got some answer by Duncan Temple Lang (see below), but the basic problem still continues. Even though I managed a workaround which is sufficient for me Martin Maechler asked me to send a toy example of the problem to R-bugs. So that's what I try here. The following Makefile will not
1998 Jan 22
1
R feature request: stop(..) should print its caller call
The following shows what I mean: tst<-function(x)in.tst(x); in.tst<-function(y)stop(paste("y is",y)); tst(pi) in R gives -------------------- Error: y is 3.141593 -------------------- in S-plus gives ---------------------------------------- > > Error in in.tst(x): y is 3.14159265358979 Dumped ^^^^^^^^^^^^ ---------------------------------------- For locating bugs /
2012 Nov 05
0
[LLVMdev] problem trying to write an LLVM register-allocation pass
Hi Susan, With your bitcode file I am now able to reproduce the issue you're seeing. It looks like this is a problem with the naive rewriting from virtregs to physregs. It appears that the subreg field of physreg operands is ignored post-register allocation. In your testcase %vreg11:sub32 is being rewritten to RBX:sub32, but the :sub32 part is being quietly dropped when the assembly is
2012 Nov 07
0
[LLVMdev] problem trying to write an LLVM register-allocation pass
Hi Susan, Sorry for the delayed response. Thanks for the test cases - I'm looking in to this now. - Lang. On Mon, Nov 5, 2012 at 2:58 PM, Susan Horwitz <horwitz at cs.wisc.edu> wrote: > Hi Lang, > > I looked more into one of the problems I'm now having, and I've attached 3 > files: > > Gcra.cpp is like your version except that for two specific vregs it uses
2010 Aug 04
2
discrete ECDF
Dear list; I just created a utility function that replicates what I have done in the past with Excel or OO.org by putting a formula of the form =sum($A1:A$1) in an upper-corner of a section and then doing a "fill" procedure by dragging the lower-rt corner down and to the right. When divided by the grand sum of the entries this function then calculates a 2D-discrete-ECDF. I
2012 Nov 04
3
[LLVMdev] problem trying to write an LLVM register-allocation pass
My tst.bc is attached. I had to use ssh to copy it from my office machine to my home laptop. In case that corrupts it, I also put a copy here: http://pages.cs.wisc.edu/~horwitz/LANG/tst.bc I created the file like this: clang -emit-llvm -O0 -c tst.c -o tst.bc opt -mem2reg tst.bc > tst.mem2reg mv tst.mem2reg tst.bc Susan On 11/4/2012 3:27 PM, Lang Hames wrote: > Hi Susan, >
2019 Nov 22
2
[ARM] Peephole optimization ( instructions tst + add )
Ok, thank you, I will implement it then. As far as I see this optimization should be done in AArch64LoadStoreOptimizer, is it right? From: Eli Friedman [mailto:efriedma at quicinc.com] Sent: Thursday, November 21, 2019 11:55 PM To: Kosov Pavel <kosov.pavel at huawei.com>; LLVM Dev <llvm-dev at lists.llvm.org> Subject: RE: [llvm-dev] [ARM] Peephole optimization ( instructions tst +