search for: insidie

Hey folks, In a recent blog post, John Regehr pointed out that LLVM is currently optimizing away read-only functions containing infinite loops whose return values are never used. The culprit for the moment is the inliner, but the more insidious problem is that isTriviallyDeletable currently returns true for any read-only function whose value is not used. In order to prevent this from happening

I''m reasonably confident that the problem I''m having here is upstream. RHEL5: # yum repolist | grep puppet puppetlabs-deps Puppet Labs Dependencies El 5 - x86_64 45 puppetlabs-products Puppet Labs Products El 5 - x86_64 161 # yum clean all Loaded plugins: security Cleaning up Everything # yum repolist 2>&1 | grep puppet

Don't say I didn't warn you: http://digitaldaily.allthingsd.com/20100520/googles-royalty-free-webm-video-may-not-be-royalty-free-for-long Don't get me wrong, I'll be as ecstatic as any of you to see Theora and VP8 succeed, I just see the patent system as far more insidious than I think many of you do. Shayne

On May 1, 2010, at 11:07 AM, Owen Anderson wrote: > Hey folks, > > In a recent blog post, John Regehr pointed out that LLVM is currently optimizing away read-only functions containing infinite loops whose return values are never used. The culprit for the moment is the inliner, but the more insidious problem is that isTriviallyDeletable currently returns true for any read-only function

Hello! I am undertaking my first attempt at using compiled C code within R and have run into this lovely problem when I call my C code (using .C). The instruction at "0x10001d1b" referenced memory at "0x01fa2000". The memory could not be "written". Now this doesn't happen every time and furthermore I've tested the code in plain C and it all works

Patenting a mathematical formula is NOT creating a machine nor is it unique. For example. 2+2=4... apples + apples^2= given outcome. I want to patent this. It's stupid to patent something like that. The same is true for formula algorithms. Algorithms occur in nature. Thus should not be patented. Now, Volley G Mathison inventor of the Electropsychometer had a machine that he could patent. A

I''ve recently run into a really weird situation that I''m just not sure what''s going on here. I''m trying to write a route that will allow searches to be done via GET requests (generally a good idea since it''s just retrieving information, helps for links and SEO, etc.), and I have the route properly set up and can access it in development mode just fine,

> On 2014-Jul-15, at 09:38, David Blaikie <dblaikie at gmail.com> wrote: > > On Tue, Jul 15, 2014 at 9:31 AM, Duncan P. N. Exon Smith > <dexonsmith at apple.com> wrote: >> >>> On 2014-Jul-15, at 08:29, David Blaikie <dblaikie at gmail.com> wrote: >>> >>> Sounds pretty clearly buggy, and against the original design of the

> On 2014-Jul-15, at 10:05, David Blaikie <dblaikie at gmail.com> wrote: > > On Tue, Jul 15, 2014 at 9:43 AM, Duncan P. N. Exon Smith > <dexonsmith at apple.com> wrote: >> >>> On 2014-Jul-15, at 09:38, David Blaikie <dblaikie at gmail.com> wrote: >>> >>> On Tue, Jul 15, 2014 at 9:31 AM, Duncan P. N. Exon Smith >>>

I reproduce from memory my exhaustive look into this issue. RODBC uses the Microsoft ODBC DLL's developed by Microsoft. These DLL's perform an automatic determination of column type based on the contents of the first N rows of cells in each column, where N [0,16]. N may be set in the Windows system registry, and there are a few other things that may be set in the system registry which

Hi everyone! I think I stumbled over a bug in the latest R 2.9.2 patched for OS X: > R version 2.9.2 Patched (2009-09-24 r49861) > i386-apple-darwin9.8.0 When I try to sort latin1-encoded character vectors, R sometimes crashes with a segmentation fault. I'm running OS X 10.5.8 and have observed this behaviour both with the i386 and x86_64 builds, in the R.app GUI as well as on

Hi. samba 4.1.1.. User has unix rights for writing, but samba denies write access to him. On samba server: amistest at samba:~$ id uid=6603(amistest) gid=20(users-nis) groups=20(users-nis),2108(evis),2109(slp),2112(hernie),2126(poj),2133(hto),20000(users) -> user amistest is in "poj" group amistest at samba:~$ ls -ld ACLTEST drwxrwxr-x+ 2 hrubos vema 4096 Nov 27 11:05 ACLTEST

HI LIST CAN U HELP ME If there are multiple sip trunks with the same ITSP then an incoming call is arbitarily matched to the last peer with the same host IP address. This is not a serious problem because the DID is still correct but it does have many insidious effects due to the incorrect channel name Example register=myaccount1 at sip.myitsp.com/line1 register=myaccount2 at

Hi all, I''m new to rails and I''ve run in to a rather insidious bug. In development (with caching turned on in development.rb), my app successfully caches action "index" in controller "view": class ViewController < ApplicationController caches_page :index def index # do the stuff that index does end end I''ve got a sweeper

I am trying to build [R] v1.3.1 *locally* on a Sun Solaris 8 machine. One problem I am currently struggeling with is to make the command-line history function to work. I have installed GNU readline version 4.2 (latest version). Looking at the "config.log" file it seems that all readline related checks, e.g. "readline/history.h", passes (they did not before installing GNU

I got used to rsync's -v --progress option so much that I used it instead of rcp even to simply copy files across the network. I dont like software that doesnt talk to me! :-) I like the percentage bar that --progress gives! To my surprise, I found that, when dealing with 1GB+ files, rsync is 4-5 _times_ slower than rcp. Yes, I know that rsync is optimized for sending deltas to a file

Hi there, as part of a 2 x 2 contingency table analysis I would like to estimate conditional probabilities (success rates) in a Bernoulli experiment. In particular I want to test a null hypothesis p <= p0 versus the alternative hypothesis p > p0. As far as I understand the subject, there are UMPU tests for these types of hypotheses. Now I know about R's "binom.test" but the

On May 1, 2010, at 11:19 AM, Chris Lattner wrote: > > On May 1, 2010, at 11:07 AM, Owen Anderson wrote: > >> Hey folks, >> >> In a recent blog post, John Regehr pointed out that LLVM is currently optimizing away read-only functions containing infinite loops whose return values are never used. The culprit for the moment is the inliner, but the more insidious problem

No, since I'd like to test null: p <= p0 alternative: p > p0. and my understanding is that binom.test tests null: p = p0 (can only be a "simple" null hypothesis according to help(binom.test)) alternative: p > p0 (or p < p0 or p != p0). Thanks, Mirko. > -----Urspr?ngliche Nachricht----- > Von: Douglas Bates [mailto:bates at stat.wisc.edu] >

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Here goes the announcement of the 2.6.2-3 package for cygwin (available from cygwin's setup itself). If you wonder what "2.6.2-3" means, it's basically the third "cygwin package" that uses rsync-2.6.2 sources. This third attempt solves both the august security fix and the textmode bug that 2.6.2-2 had. follows the