Displaying 8 results from an estimated 8 matches for "inifin".
Did you mean:
infin
2006 Jul 12
1
-Infinity for Doule type column
...hat stores a lot of Floats into MySQL database.
Simplified version of the program use the following form of class.
class Val < ActiveRecord::BASE
end
And Vals table contains one column:
num double
One of my data contains -Infinity for num and when I try to
Val.new
Val.num = <- Here goes -Inifinity
Val.save!
Then the program crashes:
"/usr/local/stow/ruby/lib/ruby/gems/1.8/gems/activerecord-1.14.3/lib/active_record/connection_adapters/abstract_adapter.rb:120:in
`log'': Mysql::Error: Unknown column ''Infinity'' in ''field list'': INSERT
INTO...
2003 Jun 27
2
nls question
I'm running into problems trying to use the nls function to fit the some
data. I'm invoking nls using
nls(s~k/(a+r)^b, start=list(k=1, a=13, b=0.59))
but I get errors indicating that the step has been reduced below the
minimum step size or an inifinity is generated in numericDeriv. I've
tried to use a variety of starting values for a, b, k but get similar
errors.
Is there anything I can do to get the a fit or is there an alternative
to the nls function?
--
Suchandra Thapa <s-thapa-11 at alumni.uchicago.edu>
2004 May 05
2
[LLVMdev] Plea for help
...try compiling and running this program:
>
>---
>#include <limits>
>#include <iostream>
>int main() {
> std::cerr << std::numeric_limits<float>::infinity() << "\n";
>}
>---
>
>
Sure thing. It prints "0". Calling that inifinity is somewhat
of a stretch, isn't it ?
What on earth is going on here?
Log:
----------
[finna at coplin11 debug]$ cat - > tst.cpp
#include <limits>
#include <iostream>
int main() {
std::cerr << std::numeric_limits<float>::infinity() << "\n";
}
[f...
2004 May 05
0
[LLVMdev] Plea for help
...t; >---
> >#include <limits>
> >#include <iostream>
> >int main() {
> > std::cerr << std::numeric_limits<float>::infinity() << "\n";
> >}
> >---
> >
> >
> Sure thing. It prints "0". Calling that inifinity is somewhat
> of a stretch, isn't it ?
Well I think that explains why the linscan allocator doesn't work for you!
:)
It looks like numeric_limits::infinity has had a line of problems:
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=5527
http://lists.suse.com/archive/suse-programming-e/2...
2004 May 04
0
[LLVMdev] Plea for help
On Tue, 4 May 2004, Finn S Andersen wrote:
> Chris wrote in a followup:
>
> > Can you send the output of 'llc -o - foo.bc -debug -print-machineinstrs'?
>
>
> Attached as "linscan". (But added the "-regalloc=linearscan" to provoke
> the error).
Yes, that's exactly what I meant... thanks for reading my mind! :)
It looks like this is where
2012 Oct 30
1
[LLVMdev] [RFC] Extend LLVM IR to express "fast-math" at a per-instruction level
On Oct 29, 2012, at 5:18 PM, Krzysztof Parzyszek <kparzysz at codeaurora.org> wrote:
> On 10/29/2012 6:34 PM, Michael Ilseman wrote:
> >
> > N: no NaNs - ignore the existence of NaNs when convenient
>
> Maybe distinguish between quiet and signaling NaNs?
>
>
> > NI - no infs AND no NaNs
> > x - x ==> 0
> > Inf > x ==> true
2004 May 04
4
[LLVMdev] Plea for help
OK, details:
I run RH8 (gcc 3.2.something), RH9 (gcc 3.2.2-5) and Fedora.
Problems are the same across all setups. Hardware is Athlon 1600+
and half a giga RAM. Runs fail with an assertion when the linear
scan allocator is enabled, but runs without problems otherwise.
On RH9 (the system I have access to while generating this email) I
have the following details:
> 1) The LLVM assembly
2003 Jun 27
1
R-help Digest, Vol 4, Issue 27 ( -Reply)
...amel at hepcat>
Content-Type: text/plain
I'm running into problems trying to use the nls function to fit the some
data. I'm invoking nls using
nls(s~k/(a+r)^b, start=list(k=1, a=13, b=0.59))
but I get errors indicating that the step has been reduced below the
minimum step size or an inifinity is generated in numericDeriv. I've
tried to use a variety of starting values for a, b, k but get similar
errors.
Is there anything I can do to get the a fit or is there an alternative
to the nls function?
--
Suchandra Thapa <s-thapa-11 at alumni.uchicago.edu>
-------------------...