search for: bijective

#See David Williams' book "Weighing the odds", p286 y <- c(1.21, 0.51, 0.14, 1.62, -0.8, 0.72, -1.71, 0.84, 0.02, -0.12) ybar <- mean(y) ylength <- length(y) ybarv <- rep(ybar, ylength) x <- 1:ylength plot(x,y,asp=1,xlab="position",ylab="ybar",type="n",ylim=c(-1,1)) segments(x[1], ybar, x[ylength], ybar) segments(x,ybarv,x,y)

...#39;s line binary table, which is generated with llvm-dwarfdump -debug-line. However, About one third of the whole functions' start line is not found in the mapping table. Thus, I can not get the start binary address. I know that the mapping between source locations and binary addresses is not bijective. I am using O1 optimization option. I know that some of the information might be lost legitimately because of optimization. But I don't think dwarf will miss so many functions' start addresses. Am I right? Any useful comments and suggestions are welcomed. Many Thanks Regards Muhui --------...

For three of the beta distribution functions in R the parameters defining the distribution are alpha, beta and 'ncp'. Pretty trivially, there is no bijection between these three and the mean and variance, but for the special case of ncp = 0, I think there is. Rather than just write it down, it's probably a good idea to see how to get it. Note that mu = alpha/(alpha+beta) s2 =

...keep growing, so that the next hunk > of bitcode added can have access to all the functions > defined so far? Yes. The JIT supports lazy compilation mode where it will generate thunks that only get compiled/linked when called - see JIT::getPointerToFunctionOrStub *. The above would solve a bijective requirement that earlier code may rely on functions defined in later code - if that is not necessary then the JIT should just work out of the box. * Note that the lazy compilation mode currently does not work well in a multithreaded environment. Cheers, James > -----Original Message----- &gt...

...hing in the next > couple days. Details, since this has implications for vector machine backends? I'm just not groking how moving isSplat to SDNode eliminates BUILD_VECTOR or deals with constant vector formation. I like the idea of a ShuffleVectorSDNode (moves things in the direction of a bijective ISD to SDNode mapping), but eliminating BuildVectorSDNode in its entirety doesn't deal with constant and variable vectors. -scooter -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090223/adc53b8e/attach...

On 7/1/14, 12:28 PM, Alp Toker wrote: > Specifically the problem I've been seeing is that people using the website are > unable to CC mailing list-based developers. As a result I don't get copied in on > responses to my review comments, and rarely get any kind of direct mail with > threading. You end up having to dig up historic responses in the mailing list > archive which

...method on SDNode that took an SDNode, checked if it was a build vector, and calculated whatever splat information you wanted. There's no need for BuildVectorSDNode for this particular functionality. > I like the idea of a ShuffleVectorSDNode (moves things in the > direction of a bijective ISD to SDNode mapping), but eliminating > BuildVectorSDNode in its entirety doesn't deal with constant and > variable vectors. LLVM has no variable shuffle instruction, so there's no variable vectors to deal with; moving the constants into the shuffle sdnode does address cons...

On Feb 23, 2009, at 1:46 PM, Chris Lattner wrote: > In my opinion, the proper direction for shuffles is: > > 1. Back out your patch. > 2. Move the functionality of "is splat" etc to method somewhere, e.g. > on SDNode. > 3. Introduce a new ShuffleVectorSDNode that only has two SDValue > operands (the two input vectors), but that also contains an array of > ints in

...en I try to find the corresponding binary address from the dwarf debug info. However, I noticed that the dwarf table might not always return me the answer and some of the source line and column number is not found inside dwarf table. The mapping between source locations and binary addresses is not bijective, especially so when the compiler performs any optimizations. To give an obvious example, when the compiler performs dead code elimination, the source locations of the dead code will not appear in the debug info for the resulting binary. Another common example is when two identical instructions with...

Hi James, > It depends on how your bitcode is loaded. It can be loaded either by llc, > which outputs pure ELF/Mach-O, in which case those function references get > turned into relocations that the linker (ld, Gold) applies. > > If you're loading bitcode via the JIT, it uses dlsym() to try and introspect > your runtime environment to find the symbol. Ah, that makes sense -

Hi I am using llvm-dwarfdump to dump the line table with -debug-line option. I compiled my program with -gdwarf-3. I first get the line number and source number for every instruction of the LLVM IR with metadata. Then I try to find the corresponding binary address from the dwarf debug info. However, I noticed that the dwarf table might not always return me the answer and some of the source line

...with llvm-dwarfdump -debug-line. >> >> However, About one third of the whole functions' start line is not found >> in the mapping table. Thus, I can not get the start binary address. I know >> that the mapping between source locations and binary addresses is not >> bijective. I am using O1 optimization option. I know that some of the >> information might be lost legitimately because of optimization. But I don't >> think dwarf will miss so many functions' start addresses. Am I right? Any >> useful comments and suggestions are welcomed. Many Tha...

Hi all, I have some rough code to sample consecutive integers with length according to a vector of lengths #sample space (representing positions) pos<-c(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20) #sample lengths lengths<-c(2,3,2) From these two vectors I need a vector of sampled positions. the sampling is without replacement, making things tough as the sampled integers need

I have data that ranges from 0.3 to 2 and I want to change the scale to be from 0 to 1. Can this be done in R? -- Thanks, Jim. [[alternative HTML version deleted]]

I've tracked down a problem I've been having with llvm code ensconced in shared libraries that priori to r139934, on OS X 10.7.1-10.7.2 worked fine. Since r139934, which involves a configure change (and configure.ac), resulting in the default clang compiler to be used when building clang, and llvm, it seems I can no longer deposit llvm code involving jit, and IR gen functionality into

Hello:I am trying to match the value 0.3 in the sequence seq(.2,.3). I get > 0.3 %in% seq(from=.2,to=.3) [1] FALSE Yet > 0.3 %in% c(.2,.3) [1] TRUE For arbitrary sequences, this "invisible .3" has been problematic. What is the best way to work around this? Thank you. Dan [[alternative HTML version deleted]]

Dear all, How does the effect() function in the effects package calculate effects and standard errors for glm quasipoisson models? I was using effect() to calculate the impact of increasing x to e + epsilon, and then finding the expected percent change. I thought that this effect (as a percentage) should be exp(beta*epsilon), where beta is the appropriate coefficient from the model, but

...per-text markings to make it explicit, then creating a bug will be unequivocal. But if you try to guess by the description, then we'll end up with a flood of bugs (been there, done that). Right now, "fixes PR" is our hyper-text marking, but it's only injective, you want something bijective. I can't think of anything that would have the same semantics whether you have a PR number or not. I actually see this as an attempt to overcome the problem that people don't create enough PRs, by forcing them to write more on the commit message. For me, this is trying to solve the wrong p...

...it makes no sense to look for it. That's one issue where I disagree and would argue for good O-O software design. At least my patch puts the functionality in a place where it's reasonable to expect it reside. I like the idea of a ShuffleVectorSDNode (moves things in the direction of a > bijective ISD to SDNode mapping), but eliminating BuildVectorSDNode in its > entirety doesn't deal with constant and variable vectors. > > > LLVM has no variable shuffle instruction, so there's no variable vectors to > deal with; moving the constants into the shuffle sdnode does addres...

Hi, On Mi, 2015-01-28 at 18:00 +0200, Michael S. Tsirkin wrote: > On Wed, Jan 28, 2015 at 11:34:02AM +0100, Hannes Frederic Sowa wrote: > > Hi, > > > > On Mi, 2015-01-28 at 11:46 +0200, Michael S. Tsirkin wrote: > > > On Wed, Jan 28, 2015 at 09:25:08AM +0100, Hannes Frederic Sowa wrote: > > > > Hello, > > > > > > > > On Di,