search for: _imaginary

...there are lots of algorithms out there and the majority of them have serious flaws) and woefully costly. It's not unfair to characterise implementing complex/real by conversion to complex and doing complex/complex as a beginner's bungle. There are good reasons why "double", "_Imaginary double", and "_Complex double" are distinct types in standard C (as they are in Ada), and the definition of multiplication in G.5.1 para 2 is *direct* (not via complex*complex). Now R has its own way of doing things, and if the judgement of the R maintainers is that keeping the &quo...

...ftExtensions.c Clang :: SemaCXX/unknown-type-name.cpp Clang :: SemaObjC/category-1.m Clang :: SemaObjC/super.m Clang :: SemaObjC/synth-provisional-ivars.m Clang :: SemaObjCXX/category-lookup.mm I looked at the first one, and for the strings "UndeclaredSoFar" and "_Imaginary" and a maxEditDistance of 5 (= the difference in their lengths, if that matters), the algorithm returns an edit distance of 2. One of the other tests (Parser/objc-quirks.m) is actually a crash. + // maxDistance (aka D) directly influences the width of the strip (2*D+1) + // we arbitrarily...

...unfair to characterise implementing complex/real > by conversion to complex and doing complex/complex as a > beginner's bungle. ouch! ... but still I tend to acknowledge your point, incl the "not unfair" .. > There are good reasons why "double", "_Imaginary double", and "_Complex double" > are distinct types in standard C (as they are in Ada), interesting. OTOH, I think standard C did not have strict standards about complex number storage etc in the mid 1990s when R was created. > and the definition of multiplication...

...menting complex/real > > by conversion to complex and doing complex/complex as a > > beginner's bungle. > > ouch! ... but still I tend to acknowledge your point, incl the "not unfair" .. > > > There are good reasons why "double", "_Imaginary double", and "_Complex double" > > are distinct types in standard C (as they are in Ada), > > interesting. OTOH, I think standard C did not have strict > standards about complex number storage etc in the mid 1990s > when R was created. > > > and th...

Hello Doug, *putting llvmdev in copy since they are concerned too* I've finally got around to finish a working implementation of the typical Levenshtein Distance with the diagonal optimization. I've tested it against the original llvm implementation and checked it on a set of ~18k by randomly generating a variation of each word and checking that both implementations would return the

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

...; functions. Thanks for considering this issue. Li Long -------------- next part -------------- >From C99 Rationale ================== 6.4.1 Keywords Several keywords were added in C89: const, enum, signed, void and volatile. New in C9X are the keywords inline, restrict, _Bool, _Complex and _Imaginary. Where possible, however, new features have been added by overloading existing keywords, as, for example, long double instead of extended. It is recognized that each added keyword will require some existing code that used it as an identifier to be rewritten. No meaningful programs are known to be q...