search for: pseudocoded

hi everyone, since about 10 days I've been working on an implementation of ogg vorbis *decoder* from scratch, and I've got a few constructive remarks about the specs and some questions. -------------------------- First a question: > 9.2.4. low_neighbor > > "low_neighbor(v,x)" finds the position n in vector [v] of the greatest > value scalar element for which

Greetings, I implemented a proof of concept of something I'm calling "error return traces" in my frontend (screenshot and explanation at this link): https://github.com/zig-lang/zig/pull/684 Now I'm trying to minimize the runtime size. Here's some example IR that I generate: define internal fastcc i16 @baz1(%StackTrace* nonnull) unnamed_addr #2 !dbg !69 { Entry: %1 =

I just finished my latest contribution, "Open Says Me". http://unspace.ca/discover/opensaysme/ Managing the browser experience using JavaScript, Ajax and a Cookie. It''s built on top of Rails, of course. Feedback is always appreciated! Pete

Just wondering why Event.stopObserving() doesn''t remove the itself from the Event.obervers array? Is there a reason for this? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Spinoffs" group. To post to this group, send email to

Dear R-helpers Are there any established R packages that include a C code generator -- that generates new C language files and compiles them? To be precise what I'm looking for is a process that takes text input in some format (it might be pseudocode, fragments of C code, etc) and creates a valid C language source file that can be compiled by R CMD COMPILE. Ideally the procedure should also

> > Which part? > > Well, my biggest problem is dealing with files. As you have mentioned > that fill_buffer() is obsolete, what has replaced it? ogg_sync_buffer() > didn't seem to be what I was looking for, as far as I can tell... am I > headed in completely the wrong direction? Ah, OK, I understand where you're headed now. The libvorbis API is different than

Hi group, suppose I have a date, say May 15 2004, and I want to now what date it is 23 days before that date. The way to calculate the new date should (...) take account of leap years :) In pseudocode: olddate <- "May 15 2004" newdate <- olddate-23 I looked around in POSIXct etc..., maybe I overlooked? Thanks, Maarten

Hey Folks, Could somebody show me how to loop through a list of dataframes? I want to be able to generically access their elements and do something with them. For instance, instead of this: df1<- data.frame(x=(1:5),y=(1:5)); df2<- data.frame(x=(1:5),y=(1:5)); df3<- data.frame(x=(1:5),y=(1:5)); plot(df1$x,df1$y); plot(df2$x,df2$y); plot(df3$x,df3$y); I would like to do something like:

Sorry folks but again I have failed in my understanding of how to do a very simple thing. I've read the various texts and searched the help archives but no positive result so far. I want to remove all the rows in a data frame where one of the variables has negative values. In approx Stata pseudocode: drop _all, if( x < 0 ) Please either point me to relevant sections of the docs or

Hi, While playing with quantile-quantile plots, I wrote up some code which plots something strangely different. Here's the pseudocode: testhist <- hist(sample_data) refhist <- hist(rnorm(n, mean=0,sd=1)) # for some large-ish n cumtest <- cumsum(testhist) cumref <- cumsum(refhist) plot(cumref,cumtest) This produces a straight line of slope 1 for a sample with the same

I'm interested in using @llvm.experimental.vector.reduce.smax/umax to implement runtime overflow checking for vectors. Here's an example checked addition, without vectors, and then I'll follow the example with what I would do for checked addition with vectors. Frontend code (zig): export fn entry() void { var a: i32 = 1; var b: i32 = 2; var x = a + b; } LLVM IR code:

The IR update to allow vector types was here: https://reviews.llvm.org/D57090 ...we didn't update the docs at that time because it was not clear what the backend would do with that, but that might've changed with some of the more recent patches. On Sat, Feb 9, 2019 at 1:42 AM Craig Topper via llvm-dev < llvm-dev at lists.llvm.org> wrote: > I don't think I understand your

Dear R Community, I'm trying to exploit the elegance of R by doing the following pseudocode routine without a WHILE or FOR loop in R: for i = 1 to length-1 for j = (i+1) to length print a[i], a[j] That is, I want i and j to be the indices of a half-matrix 1 2, 1 3, 1 4, ..., 1 length, 2 3, 2 4, ..., 2 length, 3 4, ..., 3 length 1. Can this be done with the 'whole

On 12/14/2017 10:18 PM, Leslie Zhai wrote: > Hi GCC and LLVM developers, > > I am learning Register Allocation algorithms and I am clear that: > > * Unlimited VirtReg (pseudo) -> limited or fixed or alias[1] PhysReg > (hard) > > * Memory (20 - 100 cycles) is expensive than Register (1 cycle), but > it has to spill code when PhysReg is unavailable > It might be

Hello... I would like to use R for 'pipelining' data among several programs. I'm wondering how I can use R to call another program, feed that program a set of parameters, and retrieve the output. E.g., I have an executable that, when opened, prompts the user to enter a set of parameters. The program then executes & prompts the user for the name of an output file. I need to

Hi, I am trying to find an elegant way to compute and store some frequently used matrices "on demand". The Matrix package already uses something like this for storing decompositions, but I don't know how to do it. The actual context is the following: A list has information about a basis of a B-spline space (nodes, order) and gridpoints at which the basis functions would be

Hello, I can't think of an explanation for this memory allocation behaviour and was hoping someone on the list could help out. Setup: ------ R version 2.8.1, 32-bit Ubuntu 9.04 Linux, Core 2 Duo with 3GB ram Description: ------------ Inside a for loop, I am passing a list to a function. The function accesses various members of the list. I understand that in this situation, the entire

Hi GCC and LLVM developers, I am learning Register Allocation algorithms and I am clear that: * Unlimited VirtReg (pseudo) -> limited or fixed or alias[1] PhysReg (hard) * Memory (20 - 100 cycles) is expensive than Register (1 cycle), but it has to spill code when PhysReg is unavailable * Folding spill code into instructions, handling register coallescing, splitting live ranges, doing

Hi, I was trying to draw some ROC curves (prediction of case/control status), but seem to be getting a somewhat jagged plot. Can I do something that would 'smooth' it somewhat? Most roc curves seem to have many incremental changes (in x and y directions), but my plot only has 4 or 5 steps even though there are 22 data points. Should I be doing something differently? How can I provide a

Hello! I am coming back to the below discussion again, regarding the LLVM support of Ruby dynamics. The initial problem description is as follow, to refresh your memory :) After that my questions come: -----------BEGIN Initial problem description--------------- Problem is though, that the Ruby compiler is integrated in the compilation of the program being executed, to be able to parse &