search for: jogged

Hey has anyone seen a 1.6 cheatsheet around? Johnathan Snook did a nice 1.5 one but I''ve been working with 1.6 for a while and while I can use prototypejs.org, cheatsheets are handy for jogging memories.. I checked his blog, nothing there for 1.6. Gareth --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups

Hello, i mainly code in c/c++ on linux. I would like to know if I can generate code at runtime using llvm, like libgccjit -> https://gcc.gnu.org/onlinedocs/jit/ My needs are : create functions, conditions, loops at runtime. libgccjit does the job pretty well but I would like to test llvm too (licence issue). Is it possible ? Is there a resource that helps in that regard ? Kaleidoscope

Hello, I have an issue with the llvm optimizations. I need to create object codes. the -ON PURPOSE poor && useless- code : --------------------------------------------------- #include <stdio.h> #include <stdlib.h> int ci(int a){ return 23; } int flop(int a, char ** c){ a += 71; int b = 0; if (a == 56){ b = 69; b += ci(a); } puts("ok"); return a +

...if we had problems. I'm looking to do something similar for my CentOS boxes. Or better yet, see if someone has already done something similar. I've poked around google and sourceforge on and off for a couple of months but haven't found much. The discussion lately about 'hwinfo' jogged my memory. Anyone know of something like this? A template, even? An old project that hasn't been updated but could be brought up to date? Thanks for any suggestions. Dave

Perhaps > Inf*1i [1] NaN+Infi clarifies why it is *not* a bug. (Boy, did that jog some long dusty math memories :-) ) -- Bert On Thu, Sep 5, 2024 at 2:48?PM Duncan Murdoch <murdoch.duncan at gmail.com> wrote: > On 2024-09-05 4:23 p.m., Leo Mada via R-help wrote: > > Dear R Users, > > > > Is this desired behaviour? > > I presume it's a bug. > >

I am trying to add text at specific location on my graph. I know this can be done in R but I can't recollect. I was trying using locator() to identify the position and use identify() but I can get it to work. Can someone jog my memory? Thanks ../Murli [[alternative HTML version deleted]]

Dear R People: Hope you're having a nice Saturday. I'm trying to compile R-2.13.1 from source on Windows 7 (64 bit). I've been able to compile on a 32 bit without any problems. I changed my BINPREF64, WIN, DEFS_W64 in MkRules.local and did the usual stuff with the jpeg, etc. But things are jogging along and I get the following: Makefile.win:28: ../../../../etc/x64/Makeconf: No

...release (although, the > lss16 problem is present in both). > > About the lss16 issue, we all would welcome patches, really. Any > volunteers? > > @Barry, see http://www.syslinux.org/archives/2014-October/022734.html > Ady, Thanks very much for the information. My memory got jogged, and I recalled the Puppy developers trying 5.x and encountering problems, including the LSS16 one, and deciding to stay with 4.0x: http://murga-linux.com/puppy/viewtopic.php?t=85619&start=30 The reason that I am keen to move up to 6.0x is I want to support UEFI for Quirky Linux (and to pass...

Nitin Agarwal <nitin.agarwal@timesgroup.com> wrote: > Dear Mr. Rusty, > Thanks for the reply. The problem was sorted out by changing the uid option in > rsyncd.conf file to root. > We are facing two more problem now.... > 1) while transferring the files, sometimes the transfer breaks in between and gives > us the error message: "readerror: connection reset by

<div>Thanks James,</div><div>š</div><div>Kaleidoscope seems to differ in the sense that I cannot really understand how to create, say, a loop. It all looks like very complicated (<a

Dear Bert, These behave like real divisions/multiplications: complex(re=Inf, im = Inf) * 5 # Inf+Infi complex(re=-Inf, im = Inf) * 5 # -Inf+Infi The real division / multiplication should be faster and also is well behaved. I was expecting R to do the real division/multiplication on a complex number. Which R actually does for these very particular cases; but not when only Im(x) is Inf.

On Feb 8, 2013, at 4:20 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > On Feb 8, 2013, at 4:03 PM, Cameron Zwarich <zwarich at apple.com> wrote: > >> How much of the work is done here? I'd be happy to do the phi elimination part, since I basically did that for StrongPhiElimination (RIP). > > Any help would be appreciated. > > I did a bit of the

Once upon a time, Steven Tardy <sjt5atra at gmail.com> said: > The ?ICMP unreachable? should be a dead giveaway. . . You cut out the part of the email where the OP said that the UEFI system was ignoring the next-server part of the DHCP reply and trying to TFTP to the DHCP server instead of the TFTP server. Of course that got ICMP unreachable, but it isn't a firewall problem. To the

> complex(real = 0, imaginary = Inf) [1] 0+Infi > Inf*1i [1] NaN+Infi >> complex(real = 0, imaginary = Inf)/5 [1] NaN+Infi See the Note in ?complex for the explanation, I think. Duncan can correct if I'm wrong. -- Bert On Thu, Sep 5, 2024 at 3:20?PM Leo Mada <leo.mada at syonic.eu> wrote: > Dear Bert, > > These behave like real divisions/multiplications: >

Thanks but I've actually tried that too. Not sure I put it in [kdc] section though, I can try again. Den 21 sep. 2017 20:54 skrev "Andrew Bartlett" <abartlet at samba.org>: > On Thu, 2017-09-21 at 13:01 +0200, Peter L via samba wrote: > > Hi, > > I have a smartcard which is revoked in the Certificate Revocation List > > (CRL) but I can still login. Seams

I expect that atan(1i) = (0 + infinity i) and that atan(1i)/5 = (0 + infinity i)/5 = (0 + infinity i). Here's what I get in C: (0,1) = (0, 1) atan((0,1)) = (0, inf) atan((0,1))/5 = (0, inf) Note the difference between I*infinity = (0,1)*infinity = (0*infinity,1*infinity) = (NaN,infinity) and (0,infinity)/5 = (0/5,infinity/5) = (0,infinity). The former involves multiplying 0 by infinity, which

atan(1i) -> 0 + Inf i complex(1/5) -> 0.2 + 0i atan(1i) -> (0 + Inf i) * (0.2 + 0i) -> 0*0.2 + 0*0i + Inf i * 0.2 + Inf i * 0i infinity times zero is undefined -> 0 + 0i + Inf i + NaN * i^2 -> 0 + 0i + Inf i - NaN -> NaN + Inf i I am not sure how complex arithmetic could arrive at another answer. I advise against messing with infinities... use atan2() if you don't

On Feb 8, 2013, at 4:03 PM, Cameron Zwarich <zwarich at apple.com> wrote: > How much of the work is done here? I'd be happy to do the phi elimination part, since I basically did that for StrongPhiElimination (RIP). Any help would be appreciated. I did a bit of the easy stuff in 2-addr, it has a LIS = getAnalysisIfAvailable<LiveIntervals>() member that it sometimes updates. It

I seem to remember seeing somewhere (on this list/on the web -- don't remember) that there was some ``Snort-like'' software that was available under the BSD license. Unfortunately, I'm unable to find any information about such software. Was I dreaming, or can anybody else jog my memory? :) Kind regards, Devon H. O'Dell

Hi, guys. I'm new to all of this and need some help with a problem I've been banging my head against for a while. (Tried troubleshooting, checking logs, and lots of Googling for a few weeks now, but just keep hitting dead ends.) SYMPTOM: Missing file `/usr/lib/x86_64-linux-gnu/samba/vfs/glusterfs.so`, as evidenced by error messages like these: [2018/11/18 07:56:42.551587, 0]