similar to: (no subject)

Hi, I have included the oggvorbis encoding and playback stuff in the Linux-Mandrake distro back in August 2000. At that time I put the "nightly CVS" version, which worked just fine. Then on Mon Nov 27 I noticed some RPM's labelled "1.0beta3" on the website so I upgraded with these ones. Since then we have had some serious problems in encoding: approx 20% of the WAV

Hello out there! Nooby question: What''s the "Rails" way to work with tables of relatively static lookup data? Objectively (I''m thinking); I don''t want to hit the DB each time, so for each lookup table, initialize a globally available hash with lable/value pairs... Am I on the right track? How would you do this kind of thing in Rails? Thanks! --

Dear All, 1. why did the problem happen? 2. How to solve it? -- Best wishes, Zhijiang Wang -------------------------------------------- PHD Student Room 212, Science buliding, The International WIC Institute, College of Computer Science and Technology, Beijing University of Technology, Beijing, China.

Hi, to speed up computations in our RobASt family of packages, we use interpolation on a grid of precomputed values which we save together with the interpolating functions (results of splinefun essentially) in sysdata.rda in the R folder of our pkg. After adding grids for some more models, this file has grown considerably, even after application of tools::resaveRdaFiles. At the moment we are at

Hi, Clang is currently unable to constant fold calls to math.h functions such as logl(), expl() etc. The problem is that APFloat doesn't have these functions, so Clang is forced to rely on the host math library. Because long double isn't portable, we only ever query the host math library for double or float results. I can see three methods for allowing constant folding for types that

Hi Joerg, > IMO if constant folding of transcendental functions makes a significant difference for your program, you likely are doing something strange already. Alas it's not as simple as that. Currently, if you declare: std::uniform_real_distribution<float> x; LLVM emits two calls to logl() with constant arguments, a fdiv and a fptoui. Libc++'s implementation is consumed and

Hi, If you're interested, include/bits/random.tcc:3312 (std::generate_canonical()). I wish I could just point people at libc++, but that's outside of my control. As for fixing the library, that horse bolted some time ago. Cheers, James On Mon, 4 Apr 2016 at 18:50 Stephen Canon <scanon at apple.com> wrote: > That sounds like a library issue that qualifies as “somewhat

Hi, I am trying to figure a way to allocate a string SEXP so that gc() won't ever collect it. Here is a little bit of a background. Suppose I want to write a .Call-callable function that upon each call returns the same value, say mkChar("foo"): SEXP getFoo() { return mkChar("foo"); } The above implementation doesn't take advantage of the fact that

Ok folks, I wrote up the general high-level thoughts I have about stateful AA in a separate thread. But we need to sort out the completely and horribly broken aspects of GlobalsModRef today, and the practical steps forward. This email is totally about the practical stuff. Now, as to why I emailed this group of people and with this subject, the only pass pipeline that includes GlobalsModRef, is

Hello everyone, For the context of question, I have a small loop written in a custom front-end which can be fairly accurately expressed with the following C program: struct Array { double * data; long n; }; #define X 0 #define Y 1 #define Z 2 void f(struct Array * restrict d, struct Array * restrict out, const long n) { for (long i = 0;

Hello Rsync devs, We're investigating ways to provide large scale software updates for multi-gigabyte games, and have recently begun to explore whether rsync may fit the bill. In particular, the checksum-updating patch looks like it might be able to solve our biggest concerns about CPU load on the update server, since the actual content being served will change quite rarely. Would an

----- Original Message ----- > From: "Chris Lattner" <clattner at apple.com> > To: "Chandler Carruth" <chandlerc at gmail.com> > Cc: "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu>, "Hal Finkel" <hfinkel at anl.gov>, "Justin Bogner" > <mail at justinbogner.com>, "Duncan Exon Smith"

I would like to know whether there is a faster way to do the below operation (updating vec1). My objective is to update the elements of a vector (vec1), where a particular element i is dependent on the previous one. I need to do this on vectors that are 1 million or longer and need to repeat that process several hundred times. The for loop works but is slow. If there is a faster way, please let

Hi Chris, Thanks a lot for your answer! Chris Lattner wrote: >> 1. Why does X86 instruction set description provide different >> descriptions for the same instructions, which differ only in the size >> of operands? >> E.g. >> >> def MOV8rm : I<0x8A, MRMSrcMem, (ops GR8 :$dst, i8mem :$src), >> "mov{b} {$src, $dst|$dst, $src}",

I've been trying to run locfit on data with 6 inputs and 1 output in R. Whenever I make a prediction for the same exact data that the model was built on though, I get significant discrepancies between the fitted outputs of the prediction and the actual data. I have scaled the inputs, tweaked the alpha parameter, and played around with a lot of the other variables as well. Is their some kind

On Tue, Aug 17, 2010 at 7:09 AM, Jonas Maebe <jonas.maebe at elis.ugent.be>wrote: > > On ELF platforms (at least Linux and FreeBSD) and on Windows, both of > the following are labels (i.e., absolute addresses to be relocated by > the linker) as opposed to offsets relative to the relevant section's > start, even though the DWARF standard says they are offsets: > *

Dear all, If I load a package which creates reference classes whilst another such package is also loaded, I get a warning about masking of the ".requireCachedGenerics" variable. (FWIW, both packages are lazy-loaded.) Googling this variable name turned up only one previous discussion, which didn't immediately help, except to suggest that it may be related to my defining an S3 method

Dear R and S People: First, thank you to so many people for your help to my problem. Here is the solution: a <- 0.5*(outer(1:n3,1:n3,function(x,y,n2.){n2. - pmax(x,y)},n2.=n2)) I have one final pesky question, please: During my experiments, I tried the following: a <- 0.5*(outer(1:n3,1:n3,function(x,y,n2.=n2){n2. - pmax(x,y)})) Why doesn't this work please? thank you! Sincerely,

Hi, I have run into a test case on an out-of-tree target where PBQP fails to complete register allocation after "Attempting to spill already spilled value" (the triggered assert in InlineSpiller::spill(). First, the original LiveInterval is spilled. It is a load of a symbol into a narrow register class, i.e. a subset of the class of address registers. InlineSpiller decides to

This isn't purely a fast-math issue...ConstantFolding isn't using enable-unsafe-fp-math to decide whether to emit the '0'. It's just looking for the llvm intrinsic rather than a call to sqrt: %0 = call double @llvm.sqrt.f64(double -2.000000e+00) vs: %0 = call double @sqrt(double -2.000000e+00) #2 So how about a front-end fix: If the parameter is a negative constant,