search for: lambe

Hi, I am trying to make a sequence and am using a for loop for this. I want to start off with an initial value ie S[0]=0 then use the loop to create other values. This is what I have so far but I just keep getting error messages. #To calculate the culmulative sums: s<-rep(0,207) #as this is the length of the vector I know I will have s<-as.vector(s)

Reciban un cordial saludo. De manera muy comedida les pido ayuda con la función indicada abajo. La usan en un artículo de inventarios. No veo dónde estoy errado. Gracias de antemano. César Escalante C. > lamb<-50 > L<-1 > h.<-10 > p<-25 > K<-5 > integ<-function(y){integrate(function(x)ppois(x,lamb*L),0,y)$value} > G<-function(y){(h.+p)*integ(y) +

Hello, I hope I am doing this correctly, though I am not sure if a response will be posted somewhere or if I will get a direct response. I am trying to import a .txt table in my class on R and for some reason, the header gets altered and I can no longer read the data. No one in my class had this problem and the instructors were not sure how to fix it. Here is the text table: Kind

I wanted a sort of matrix product of an array and a matrix. As there does not seem to be any array multiplication apart from outer() I proceeded as follows: lambda <- array(0, c(n,m,d)) # stuff omitted # zed is an n by m matrix # # \lamb.star_{ik} lamb.star <- matrix(0, nrow=n, ncol=d) for (i in 1:n) { for (k in 1:d) { for (j in 1:m) { lamb.star[i,k] = lamb.star[i,k] +

Has there been any discussion of supporting the 'restrict' C99 keyword and C++ extension to boost alias analysis? My impression is that this would require modification of the LLVM IR. I couldn't find any discussion hits using the usual suspects for searches... -- Christopher Lamb christopher.lamb at gmail.com -------------- next part -------------- An HTML attachment was

I have some instructions that use a register as both an input and as the output. Is there a way to specify this constraint in the InstrInfo.td or will this have to be custom selected/lowered? Thanks -- Christopher Lamb christopher.lamb at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL:

On Apr 23, 2007, at 12:31 PM, Chris Lattner wrote: > On Mon, 23 Apr 2007, Christopher Lamb wrote: >> How can one let the back end know how to insert and extract >> elements of >> a vector through sub-register copies? I'm at a loss how to do this... > > You probably want to custom lower the insertelement/extractelement > operations for the cases you support.

Is anyone actively working on this currently? It's marked as unassigned in BZ. -- Christopher Lamb christopher.lamb at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20070329/1edd4502/attachment.html>

Might I suggest the following tool for setting-up/maintaining the Visual Studio project files. It makes setting them up with all the right build options and include paths much, much easier. =) http://sourceforge.net/projects/xpj -- Christopher Lamb christopher.lamb at gmail.com On Mar 28, 2007, at 3:06 AM, Morten Ofstad wrote: > Seung Jae Lee wrote: >> Is there any special reason

On Apr 21, 2007, at 6:12 PM, Reid Spencer wrote: > On Sat, 2007-04-21 at 18:07 -0500, Christopher Lamb wrote: >> I'm getting a regression after my fixes that's coming from >> getABIAlignment not finding an alignment to use for a <float x1> >> type, >> is this a bug? > > It could be. <float x 1> isn't a useful vector so it probably

Hi, I have used this command : resamples<-lapply(1:1000,function(i) sample(lambs,replace=F)) resamples2<-lapply(resamples,Cusum) to get a list of 1000 samples of my data. The function Cumsum is defined as follows: Cusum<-function(x){ SUM<-cumsum(x)-(1:length(x))*mean(x) min<-min(cumsum(x)-(1:length(x))*mean(x)) max<-max(cumsum(x)-(1:length(x))*mean(x)) diff<-max-min

On Mar 18, 2007, at 7:05 PM, Chris Lattner wrote: > On Sun, 18 Mar 2007, Christopher Lamb wrote: >>> LLVM can currently produce .o files directly in some limited cases, >>> or you >>> can go through an assembler, which is much more robust. Any help >>> improving the direct ELF writer would be appreciated. >> >> Which of the LLVM tools can

On Apr 23, 2007, at 1:17 PM, Christopher Lamb wrote: > > On Apr 23, 2007, at 12:31 PM, Chris Lattner wrote: > >> On Mon, 23 Apr 2007, Christopher Lamb wrote: >>> How can one let the back end know how to insert and extract >>> elements of >>> a vector through sub-register copies? I'm at a loss how to do >>> this... >> >> You

I don't want to drive this too off topic, but I should be clear that I wasn't suggesting that the LLVM project adopt XPJ as it's official config file format for Visual Studio. I have found it useful to use XPJ to generate the initial VS projects for a code base that doesn't already have VS projects. I also find it nice to be able to see all of the config options in a

On Mar 26, 2007, at 10:10 AM, Dan Gohman wrote: > On Mon, Mar 26, 2007 at 02:14:56AM -0500, Christopher Lamb wrote: >> >> >> On Mar 25, 2007, at 5:22 PM, Chris Lattner wrote: >> >>> On Sun, 25 Mar 2007, Christopher Lamb wrote: >>>> What about an approach not unlike how debugging information is >>>> handled? That >>>> is have

It's not clear it offers any real benefits. The project files already exist. To use this, I would have to throw them away and create new XML files by hand. I would have to maintain them by hand also, whereas the project files are maintainable from within Visual Studio, i.e. via an integrated GUI interface. And to comment on supporting other targets: No reason it can't be done,

I see in the x86 InstInfo.td the following for the INC instructions: def INC8r : I<0xFE, MRM0r, (ops GR8 :$dst, GR8 :$src), "inc{b} $dst", [(set GR8:$dst, (add GR8:$src, 1))]>; Which seem to have the same restriction that I'm trying to implement, but I don't understand how this ensures that $src and $dst are the same register. -- Christopher Lamb

On 9/21/07, Christopher Lamb <christopher.lamb at gmail.com> wrote: > ISel patterns are matched against DAGs before register allocation. So you > are correct that ISel patterns can't take into account register classes. The > register classes in the patterns are a selection constraint for the register > allocator if that instruction is chosen, not a constraint on choosing

What's the best way to get an SDNode through to DAG scheduling without getting mangled during Lowering/ISel? When should subregs be flattened to actual registers: AsmPrinter? Somewhere in LiveIntervals, during RegAlloc? Is there are common API used to turn vregs into physregs that could be changed to flatten any subregs in a central location? -- Christopher Lamb

Having read through the documentation and browsed the code what are the missing pieces, if any, required to implement a "native" LLVM backend that: * is able to produce loadable (ELF) object files with DWARF debugging information * handle inline assembly * perform linker all necessary linking fixups This assumes that there will be no native object file linking stage in the tool