similar to: 'Unexpected numeric constant'

Estimados amigos Estoy dibujando las funciones acf y pacf de una variable de una serie "zoo": > ls.str(pat="T0.5") T0.5 : 'zoo' series from 2017-11-08 23:00:00 to 2017-11-15 06:59:00   Data: num [1:9120, 1:3] 55 49.8 51 50.1 36.5 ...   Index:  POSIXct[1:9120], format: "2017-11-08 23:00:00" "2017-11-08 23:01:00" "2017-11-08

Hello R Freaks, I calculate the difference in days between two events with the following litte R expresseion: T1a <- strptime(T1,"%m/%d/%y %H:%M:%S"); T2a <- strptime(T2,"%m/%d/%y %H:%M:%S"); T1b <- as.Date(T1a); T2b <- as.Date(T2a); days <- T2b-T1b; time <- T2a - T1a; In the project I would like to calculate only working day. I the a possibility to count

I tried the following command to produce boxplot of diagonals in pairs function: > pairs(t1.5,diag.panel=boxplot) Error in pairs.default(t1.5, diag.panel = boxplot) : The panel function made a new plot The graphics device draws two graphs, one with a rectangle at (1,1) in 7x7 layout and the other with boxplot(t1.5$wind) at (1,2). pairs function help file has a similar example with

I would like to transform X/Y -> X*1/Y. Specifically, I would like to convert: define void @t1a(double %a, double %b, double %d) { entry: %div = fdiv fast double %a, %d %div1 = fdiv fast double %b, %d %call = tail call i32 @foo(double %div, double %div1) ret void } to: define void @t1b(double %a, double %b, double %d) { entry: %div = fdiv fast double 1.000000e+00, %d %mul = fmul

I did few transformation in Instruction *InstCombiner::visitFDiv() in an attempt to remove some divs. I may miss this case. If you need to implement this rule, it is better done in Instcombine than in DAG combine. Doing such xform early expose the redundancy of 1/y, which have positive impact to neighboring code, while DAG combine is bit blind. You should be very careful, reciprocal is very

Hi Chad, This is a great transform to do, but you’re right that it’s only safe under fast-math. This is particularly interesting when the original divisor is a constant so you can materialize the reciprocal at compile-time. You’re right that in either case, this optimization should only kick in when there is more than one divide instruction that will be changed to a mul. I don’t have a strong

On 08.08.2013, at 18:25, Chad Rosier <chad.rosier at gmail.com> wrote: > I would like to transform X/Y -> X*1/Y. Specifically, I would like to convert: > > define void @t1a(double %a, double %b, double %d) { > entry: > %div = fdiv fast double %a, %d > %div1 = fdiv fast double %b, %d > %call = tail call i32 @foo(double %div, double %div1) > ret void >

I remember why I didn't implement this rule in Instcombine. It add one instruction. So, this xform should be driven by a redundancy eliminator if you care code size. On 8/8/13 10:13 AM, Shuxin Yang wrote: > I did few transformation in Instruction *InstCombiner::visitFDiv() in > an attempt to remove some divs. > I may miss this case. If you need to implement this rule, it is >

https://bugzilla.samba.org/show_bug.cgi?id=8183 Summary: rsync 3.0.8 can't modify read-only directories created on the same run Product: rsync Version: 3.0.8 Platform: All OS/Version: All Status: NEW Severity: normal Priority: P5 Component: core AssignedTo: wayned at

On Nov 12, 2008, at 3:37 PM, David Greene wrote: >>> Unfortunately, calling FunctionType::refineAbstractType(opaque, void >>> (...)) >>> doesn't work because RefineAbstractType doesn't recurse down into >>> the >>> pointee types. >> >> What types are you starting out with? If you had the equivalent of: >> >> %t1 = type

On Wednesday 12 November 2008 17:29, Chris Lattner wrote: > In fact, I strongly suspect that RefineAbstractType doesn't work if > you give it something that isn't Opaque. I'd recommend only using it > on Opaque, not random abstract types. Ok. > Sure, LLVM is more general than C. In LLVM, you can have a pointer > that points to itself, for example: > > %t =

I believe we were under the impression that InstCombine, as a canonicalized/optimizer, should not increase code size but only reduce it. Minor aside, but you don't need all of fast-math for the IR, just the "arcp" flag, which allows for replacement of division with reciprocal-multiply. On Aug 8, 2013, at 10:21 AM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > I remember

On Aug 8, 2013, at 9:56 AM, Jim Grosbach <grosbach at apple.com> wrote: > Hi Chad, > > This is a great transform to do, but you’re right that it’s only safe under fast-math. This is particularly interesting when the original divisor is a constant so you can materialize the reciprocal at compile-time. You’re right that in either case, this optimization should only kick in when

Hi Listers, I can't seem to figure out why I loose precision when I try to import a comma delimited file using read.csv or read.table. The fields of interest are rounded to one decimal place. DataTimeStamp TerminalID Hours Minutes Latitude Longitude Status Temperature Battery BootTimes Current Google 1 2/11/2010 12:22:21 PM 4894551 12 0 45.0 -66.5 0 30

Seems incorrect but I forget the IEEE fp rules. What if both x and y are infinity? in that case x/y = NAN but you transformation will yield 0 as the result. On 08/08/2013 09:25 AM, Chad Rosier wrote: > I would like to transform X/Y -> X*1/Y. Specifically, I would like to > convert: > > define void @t1a(double %a, double %b, double %d) { > entry: > %div = fdiv fast

On Thu, Aug 8, 2013 at 1:56 PM, Mark Lacey <mark.lacey at apple.com> wrote: > > On Aug 8, 2013, at 9:56 AM, Jim Grosbach <grosbach at apple.com> wrote: > > Hi Chad, > > This is a great transform to do, but you’re right that it’s only safe > under fast-math. This is particularly interesting when the original divisor > is a constant so you can materialize the

On Wednesday 12 November 2008 18:58, Chris Lattner wrote: > On Nov 12, 2008, at 3:37 PM, David Greene wrote: > >>> Unfortunately, calling FunctionType::refineAbstractType(opaque, void > >>> (...)) > >>> doesn't work because RefineAbstractType doesn't recurse down into > >>> the > >>> pointee types. > >> > >>

Hi all, I'm trying to define and log-likelihood function to work with MLE. There will be parameters like mu_i, sigma_i, tau_i, ro_i, for i between 1 to 24. Instead of listing all the parameters, one by one in the function definition, is there a neat way to do it in R ? The example is as follows: ll<- function(mu1=-0.5,b=1.2,tau_1=0.5,sigma_1=0.5,ro_1=0.7) { if (tau1>0 &&

Buenas tardes, quedarme con las muestras de una BD (data) que están presentes en otra (datax), cuando se tiene una variable que nunca se repite (Key) es fácil: data <- subset(data,data$Key %in% datax$Key). Mi problema es cuando la exclusividad viene dada por dos variables. P.e., las coordenadas de un mapa: lon y lat. ¿Como puedo quedarme con las muestras de una df cuya lon y lat son iguales a

Hello everyone, I'm unable to read temperature Gigabyte H77-DH3H motherboard. Is that motherboard supported or am I doing it incorrectly? When trying to access hw.acpi.thermal everything appears to be ok, but it is not, the system always returns 27,8C and 29,8C which fooled me initially - the values never change. Here is output: [chinatsu]:/root# sysctl hw.acpi.thermal