similar to: Nested SEXP functions

for example /// getPointerUnionTypeNum - If the argument has type PT1* or PT2* return /// false or true respectively. template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT1 *P) { return 0; } template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT2 *P) { return 1; } template <typename PT1, typename PT2> static

I have the following (simple!?) problem which I am unable to find a relatively trivial solution to. If I have a dataframe, A 1 A 7 B 4 B 5 C 3 D 3 D 2 E 5 F 5 F 6 I would like to create a new data.frame in the form ID pt1 pt2 A 1 7 B 4 5 C 3 NA D 3 2 E 5 NA F 5 6 so that for each identifier, in this

When compiling trunk using gcc 4.1.2 on linux/ppc64, I now see a warning that I don't remember seeing previously: llvm[2]: Compiling InlineSpiller.cpp for Release+Asserts build /src/llvm-trunk-dev/include/llvm/ADT/PointerIntPair.h: In member function ‘const PointerTy* llvm::PointerIntPair<PointerTy, IntBits, IntType, PtrTraits>::getAddrOfPointer() const [with PointerTy = void*, unsigned

Hello LLVMdev, I’m using LLVM to do static analysis exclusively (without any code generation). To implement this analysis, I’m using multiple address spaces to disambiguate the purpose of the pointed memory. Since address spaces never alias in my model, I set on to implement an alias analysis pass that would exactly provide this information, as I’m seeing a couple of otherwise dead store that

On 3/13/13 1:21 PM, Daniel Berlin wrote: > On Wed, Mar 13, 2013 at 11:37 AM, Arnold Schwaighofer > <aschwaighofer at apple.com> wrote: >> On Mar 13, 2013, at 1:07 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: >> >>>> The program I gave was well typed :) >>> Hi, Daniel: >>> Thank you for sharing your insight. I didn't realized

> The program I gave was well typed :) Hi, Daniel: Thank you for sharing your insight. I didn't realized it is well-typed -- I'm basically a big nut of any std. I'd admit std/spec is one of the most boring material on this planet:-). So, if I understand correct, your point is: if a std call a type-casting (could be one which is in bad-taste:-), TBAA has to

Hi I want to sum over one of the dimensions of a n x k1 x k2 array in which each column is the product of the corresponding columns from two matrices with dimensions n x k1 and n x k2. I can see two approaches: a loop on k1 and a loop on k2. But I cannot figure a solution that avoids the loop? Is it possible? (I don't refer to apply or lapply etc either as they are just hidden loops so,

On Tue, Mar 12, 2013 at 11:59 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > I personally believe that in the context of type-based AA, correctness is a > subjective term:-). > > If the user smell something fishy, it is up to user to disable such opt, > there is no other > way around. TBAA is just to find the a sweet spot between precision & > safeness. Sorry,

On Wed, Mar 13, 2013 at 11:37 AM, Arnold Schwaighofer <aschwaighofer at apple.com> wrote: > > On Mar 13, 2013, at 1:07 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > >>> >>> The program I gave was well typed :) >> >> Hi, Daniel: >> Thank you for sharing your insight. I didn't realized it is well-typed -- I'm basically a big

I personally believe that in the context of type-based AA, correctness is a subjective term:-). If the user smell something fishy, it is up to user to disable such opt, there is no other way around. TBAA is just to find the a sweet spot between precision & safeness. Unfortunately, in the context of TBAA, precision & safeness usually come at each other's expense... It would be

Dear R-experts, I have 28 data points that I would like to fit with a non linear broken-stick -- with three fitted parameters. When I view trace -- and use the final values as lines on the graph of data -- it looks pretty good. Q1. Why am I getting singular convergeance? Q2. Can you suggest another approach that may prove more satisfying? I have read previous examples on nls and this sort of

Hi, ? I am trying to solve a problem related to Poincare circles ( for more info http://www.ms.uky.edu/~droyster/courses/spring08/math6118/Classnotes/Chapter09.pdf). In a nutshell i am trying to replicate the method in the above pdf section 9.2.1. that explains in broad terms how to draw the arc inside a circle that goes through 2 previously set points on the first circle. ? I think i came up

Hello Everyone, I am trying to create two modules in LLVM, where first module contains the definition of a function, gcd in this example and another module contains a call to this function. My example is based on the following tutorial, with a few changes. http://llvm.org/releases/2.6/docs/tutorial/JITTutorial2.html When I execute the verifier pass on my modules, it complains that the

I am plotting three Pearson Type IV distributions. It looks like I have to plot the distribution with the highest value of y and then use lines() to add the two distributions that are shorter / have lower max values of y. The following code figures out which distribution has the max y value, plots it first and then uses lines for the other two distributions with a series of three if statements.

Hello, The Xen community is working on a new virtualization mode (or maybe I should say an extension of HVM) to be able to run PV guests inside HVM containers without requiring a device-model (Qemu). One of the advantages of this new virtualization mode is that now it is much more easier to port guests to run under it (as compared to pure PV guests). Given that FreeBSD already supports

I''ve been mostly lurking here with an occasional nuby question for a few weeks now. It seems like Ruby and Rails and the many libraries and tools growing up around it are a remarkable toolset. Unfortunately I''m finding the whole enchilada a bit daunting. It seems that if one is to truly tap into the power of this thing and do a significant amount of developing, one needs

Hi r-devel, I am working on a R extension. I am writing the function in C++, and in my function it is required a R function object from the user. This R function object will be evaluated thousand of times in my C++ code. I generated the shared library and I loaded it on R. I did several experiments in order to compare the speed of my compiled code vs the speed of the equivalent interpreted code.

Hallo! I want to fit a function. The function is e.g.: y = c+m1*x if x<0, c+m2*x if x>=0 where m1, m2 and c is a parameter and x, y are variables of a data frame. I think using nls is appropriate. But I do not know, how to type this formula in nls. Can anybody help? (If there is a possibility to use a Heaviside-function this would be enough.) Karl

Content-Type: multipart/related; boundary="------------DB3A3FF1.D25D383D" --------------DB3A3FF1.D25D383D Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable <html> <body bgcolor=3D"#ffffff" text=3D"#000000"> <img src=3D"cid:891A9257=2E4479B8C9"> <br> We awaken in others the same

https://bugzilla.samba.org/show_bug.cgi?id=2628 wayned@samba.org changed: What |Removed |Added ---------------------------------------------------------------------------- Summary|hangs indefinitely (while |hangs indefinitely at start |listing files) |of phase 1 ------- Additional Comments From wayned@samba.org