search for: bijection

...multaneously set the plot region? The aspect ratio is one number and the plot region is given by four numbers (xleft, xright, yleft, yright). Logically, these 5 numbers are independent of each other and arbitrary, provided xleft<xright and yleft<yright. This should give a one-to-one bijection between 5-tuples and plots, determined up to a change of scale that is uniform in the x- and y-dirctions. My code above shows the (to me) obvious attempt, which fails. Thanks David

Hi I am using LLVM Pass combined with dwarf debug information to get all the function's start address. My steps are below: First, I write the function pass to get the start line of each function, which is finished. Then, based on the start line of every single function, I try to query the specific line from the dwarf's line binary table, which is generated with llvm-dwarfdump

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 = alpha*beta/((alpha+beta)^2*(alpha+beta+1)) = mu*(1-mu)/(alpha+beta+...

Hi, > Is it possible to keep adding bitcode incrementally to the > system, and JIT'ing it, and have the set of functions > defined in the system 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

On Mon, Feb 23, 2009 at 2:19 PM, Nate Begeman <natebegeman at me.com> wrote: > > 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

...tting pressured into reviewing a patch in some area). +1 I've found this frustrating, especially coupled with the fact that folks' email addresses, phab usernames, and svn usernames are not always obviously related to each other. It would be nice to enforce (or very strongly suggest) a bijection on phab usernames and svn usernames, and then display them in the tool as something like: `jsmith2 "John Smith" <john at smith.com>` (for some hypothetical developer). Regards, Jon > > Alp. > > > > On 01/07/2014 14:11, Manuel Klimek wrote: >> Alp noted t...

On Feb 23, 2009, at 2:49 PM, Scott Michel wrote: > On Mon, Feb 23, 2009 at 2:19 PM, Nate Begeman <natebegeman at me.com> > wrote: > > 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

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

> On May 22, 2018, at 8:06 AM, Muhui Jiang via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > 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

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

Hi Actually, No particular reason. I just think this might be a solution, then I use think kind of method. Querying the symbol table would be a good choice, but I prefer to use LLVM and dwarf information. I am sorry that I am not familiar with debug_info. But thanks to your suggestions. I would like to try to solve it with debug_info. It seems work according to your comments By the way, I am

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]]

...e now using static libs instead? Please note that the example is NOT directly registering a pass, in fact up till now, for this example, I've only be able to generate this pass registration conflict by having the main translation unit include llvm/ExecutionEngine/JIT.h. As doing the manual svn bijection effort to locate the commit was a slow process, I thought I would go to the list for help (I have real code which organizes its files with shared libraries), to short cut to a solution--finding out why a clang (platform dependent?), built clang/llvm manifests the issue would be another long effort....

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

On 17 May 2016 at 02:07, Quentin Colombet via llvm-dev <llvm-dev at lists.llvm.org> wrote: > Basically, the high-level status is: > 1. Commits should state when they are fixes. > 2. Bugs should be tracked in a PR. Yup. > None of these is a hard requirement but instead, best practices that we > should remind to the contributors. > For #1, I propose the attached patch for

On Mon, Feb 23, 2009 at 4:03 PM, Nate Begeman <natebegeman at me.com> wrote: > > It's basically as Chris said; there will be a ShuffleVectorSDNode, and > appropriate helper functions, node profile, and DAGCombiner support. > Fine. For vector shuffles. But again, what about vector constants, e.g., v4i32 <0, 1, 2, 3, 4>? BuildVectorSDNode is still a reasonable subclass

...e frag_id_hash for > devices. > > Now, user can set identical frag id hash for all devices > for a given VM. > > We can even expose this to guests: each guest would generate > the ID on boot and send it to host, host would set it > in sysfs. jhash_1word shouldn't be a bijection, so we are randomizing here and are increasing the probability of collisions. Instead of jhash_1word you would need to take a simple block cipher with the hash as key. Bye, Hannes