search for: const1

...7,364.7510,368.8358,373.5498,377.2899,380.8858,385.9601 ,420.2834,438.3807,453.9618,473.7764,493.0898,513.0759,531.1967,549.5310 ,564.8920,584.8651,670.3014,674.2099,677.9492,680.5667,684.3941,688.2404 ,690.7223,693.3406,697.9022,700.6606) trans <- 13.38 trans2 <- 28.53 estCd <- 1975 estConst1 <- 0.00115689 estExch <- 0.00171680 Cb <- 330.1 Cmin <- 357 Ci <- 101000 R <- 0.001104768 A <- 16 V <- 8 rismod <- nls(seg_an ~ crv5(t, R, exch, trans, trans2, Cd, const1, Cmin, Cb, A, V, Ci, Cmin.new), start = list(Cd = estCd, const1 = estConst1, exch = estE...

Hi everybody, In Splus, the following works fine. foo1 <- function(x, const) x + const foo2 <- function(x, const) x * const const1 <- 1 const2 <- 2 foo <- substitute(function(x) { a <- foo1(x, const1) b <- foo2(a, const2) b }, list(const1=const1, const2=const2)) foo(1:3) In R, the code doesn't work, as foo is of mode "call", and as.function(foo) gives an error. I could add the argumen...

...var.b1<-vcov[2,2] cov.b0.b1<-vcov[1,2] alpha<-1-conf.level zalpha.2 <- -qnorm(alpha/2) gamma <- zalpha.2^2 * var.b1 / (b1^2) eta = family(obj)$linkfun(p) #based on calcs in V&R's dose.p EC50 <- (eta-b0)/b1 const1 <- (gamma/(1-gamma))*(EC50 + cov.b0.b1/var.b1) const2a <- var.b0 + 2*cov.b0.b1*EC50 + var.b1*EC50^2 - gamma*(var.b0 - cov.b0.b1^2/var.b1) const2 <- zalpha.2/( (1-gamma)*abs(b1) )*sqrt(const2a) LCL <- EC50 + const1 - const2 UCL &...

My gut tells me that Hal is right, and we should prefer zexts as long as the select boils down to one instruction, but let me go against my intuition and try to list two reasons why we should prefer selects: * Folding operations into selects: it is trivial to transform f(select X, Const0, Const1) to select X, f(Const0), f(Const1), while doing that can be difficult for zexts. define i32 @sel_1_or_0(i1 %a) { %b = select i1 %a, i32 1, i32 0 %k = add i32 %b, 50 ret i32 %k } ==> define i32 @sel_1_or_0(i1 %a) { %b = select i1 %a, i32 51, i32 50...

...3: in: _ZZN1N1fEiEs out: N::f(int)::string literal [#0] exp: N::f(int)::string literal FAIL at line 2748, style gnu-v3: in: _Z1fKPFiiE out: f(int (*)(int) const) exp: f(int (* const)(int)) FAIL at line 2752, style gnu-v3: in: _Z1fAszL_ZZNK1N1A1fEvE3foo_0E_i out: f(int[ sizeof(N::A::f()::foo [# ])const1]) exp: f(int[sizeof(N::A::f() const::foo)]) FAIL at line 2756, style gnu-v3: in: _Z1fA37_iPS_ out: f(int[37], int[37]*) exp: f(int[37], int (*) [37]) FAIL at line 2760, style gnu-v3: in: _Z1fM1AFivEPS0_ out: f(int (A::*)(), int ()()*) exp: f(int (A::*)(), int (*)()) FAIL at line 2764, style gnu-v...

I have another round of questions about IR select canonicalizations. For the purity of this quiz, please disregard prior knowledge of how this is handled by instcombine or how this is lowered by your favorite target...of course we'll fix it. :) Some answers in the links below if you do want to know. Which, if any, of these is canonical? 1. Is a zext simpler than a select? a. define i32

...he mailing lists, search for xml and robin dunn probably. The last post was not more than a month ago. All in all I really like your idea, I thought about something similar some way back. You could extend your Enum class to cover operations such as or''ing together some elements (like const1 | const2). Personally I''d like to see this approach here as standard swig behaviour. What do you (other language maintainers for example) think? -Matthias ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web ser...

...Es out: N::f(int)::string literal [#0] exp: N::f(int)::string literal FAIL at line 2748, style gnu-v3: in: _Z1fKPFiiE out: f(int (*)(int) const) exp: f(int (* const)(int)) FAIL at line 2752, style gnu-v3: in: _Z1fAszL_ZZNK1N1A1fEvE3foo_0E_i out: f(int[ sizeof(N::A::f()::foo [# ])const1]) exp: f(int[sizeof(N::A::f() const::foo)]) FAIL at line 2756, style gnu-v3: in: _Z1fA37_iPS_ out: f(int[37], int[37]*) exp: f(int[37], int (*) [37]) FAIL at line 2760, style gnu-v3: in: _Z1fM1AFivEPS0_ out: f(int (A::*)(), int ()()*) exp: f(int (A::*)(), int (*)()) FAIL at li...

...y) memset: * memset(s,c,0) -> noop * memset(s,c,n) -> store s, c (for n=1,2,4,8) pow, powf, powl: * pow(1.0,y) -> 1.0 * pow(x,0.0) -> 1.0 * pow(x,1.0) -> x * pow(x,-1.0) -> 1.0/x * pow(x,0.5) -> sqrt(x) * pow(cst1,cst2) -> const1**const2 * pow(exp(x),y) -> exp(x*y) * pow(sqrt(x),y) -> pow(x,y*0.5) * pow(pow(x,y),z)-> pow(x,y*z) puts: * puts("") -> fputc("\n",stdout) (how do we get "stdout"?) round, roundf, roundl: * round(cnst) -> cnst' signbit: * sig...

...ing literal [#0] > exp: N::f(int)::string literal > FAIL at line 2748, style gnu-v3: > in: _Z1fKPFiiE > out: f(int (*)(int) const) > exp: f(int (* const)(int)) > FAIL at line 2752, style gnu-v3: > in: _Z1fAszL_ZZNK1N1A1fEvE3foo_0E_i > out: f(int[ sizeof(N::A::f()::foo [# ])const1]) > exp: f(int[sizeof(N::A::f() const::foo)]) > FAIL at line 2756, style gnu-v3: > in: _Z1fA37_iPS_ > out: f(int[37], int[37]*) > exp: f(int[37], int (*) [37]) > FAIL at line 2760, style gnu-v3: > in: _Z1fM1AFivEPS0_ > out: f(int (A::*)(), int ()()*) > exp: f(int (A::*)...

...; FAIL at line 2748, style gnu-v3: > in: _Z1fKPFiiE > out: f(int (*)(int) const) > exp: f(int (* const)(int)) > FAIL at line 2752, style gnu-v3: > in: _Z1fAszL_ZZNK1N1A1fEvE3foo_0E_i > out: f(int[ sizeof(N::A::f()::foo [# ])const1]) > exp: f(int[sizeof(N::A::f() const::foo)]) > FAIL at line 2756, style gnu-v3: > in: _Z1fA37_iPS_ > out: f(int[37], int[37]*) > exp: f(int[37], int (*) [37]) > FAIL at line 2760, style gnu-v3: > in: _Z1fM1AFivEPS0_ &gt...

On Mon, Feb 23, 2009 at 12:12 AM, Aaron Gray < aaronngray.lists at googlemail.com> wrote: > On Sun, Feb 22, 2009 at 11:15 PM, Anton Korobeynikov < > anton at korobeynikov.info> wrote: > >> >> Actually its [configure-stage3-intl] where its hanging. >> >> This can easily be due to inline FP math in the stdlib headers. For >> example - I had to