similar to: intro + specification remarks + some questions

Aloha Timo. I found a few odd things while playing with dovecot. At least one of them bugs me, but it might be a result of my own patches - I haven't testet it with mbox or maildir, yet. The details :) 1. * OK dovecot ready. A = (<return> Connection closed by foreign host. 2. * OK dovecot ready. A001 LOGIN xxxxxx xxxxxx A001 OK Logged in. A002 COPY 1 INBOX Connection closed by

Hi! While implementing a Vorbis I decoder, I have found a few errors in the specification. After making the following changes everything works as advertised, thank you! Errata: 1.) In section 7.2.2 Floor1 header decode (on a side not wouldn't 7.2.2.1 be the logical number here, looking at the overall structure of the document?), step 21 element element ([j] + [floor1_values]) should

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 =

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

emmanuel said: > Thanks again for the detailed comments. well, sir, you deserve them. and i must say that your responses are uniformly impressive, both individually and -- most especially -- in their aggregate. the only one of them that would still wrinkle my forehead is the thought of possibly limiting the program only to chrome. i believe that might be a decisive turn-off to too many

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

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

Just learning Rails.. So this is probably a noob question. My apologies. Could anyone please give me a quick summary/example on the usage of error_messages_for? I have two tables/models, Group and GroupMembers. Obviously, a Group has_many GroupMembers. I have a customized view which shows a list of GroupMembers followed by a field and a button which facilitates adding a member to the group by

Hello. I have an application that depends on a table/model (ModelInternationalization) that provides international translations in various languages for all the model/table and columns names as well as some other stuff (whether the column is visible on forms, dropdowns, lists, reports etc). I need to create a management interface for this translation stuff (the plaintext stuff, btw, will be

Hi, I have a function called fitMicroProtein which takes a value called form, this can be any integer from 0-38. In a larger function I'm making (it's called Newton), the first thing I want to do is construct a list of functions where form is already set. So in pseudocode fs[[1]](...) <- fitMicroProtein(form=0,...) fs[[2]](...) <- fitMicroProtein(form=1,...) . . . I've tried

All, In looking at `optim', it doesn't appear that it is possible to impose nonlinear constraints on Nelder- Mead. I am sufficiently motivated to try to code something in C from scratch and try to call it from R.... Does anyone have some good references to barrier and/or penalization methods for Nelder-Mead? I would ideally like some papers with pseudocode for method(s) that are in

Hi, I've added several pages of worked solutions for the book Ecological Detective by Hilborn and Mangel to the R-wiki. My hope is that this will be of use to others working through this book without access to a local expert. I am certainly not an expert, local or otherwise. I have posted solutions for chapters 3-6, which includes some really horrible direct translations of the pseudocode

Hi all, I want to optimize a function fn using optim. This function fn calls the .C function in it with a function name and arguments given to fn, i.e. something like this pseudocode: fn <- function(par, "some params for fn") {... .C("Cfunction", ...) ...} optim(par, fn, "some params for fn") In my case this doesn't work, but is it possible in general and I

Hello all, I'm trying to grasp a way to order a matrix by giving order() only a vector of the columns it can look to for sorting. The approach has to be generic such that I can feed order() a vector of variable length (ie varying # of columns to sort by). x<-rep(1,9) y<-c(1, 1, 2, 2, 2, 1, 2, 2, 2) z<-c(10, 11, 10, 13, 15,1000,1000, 1001,1002) results<-cbind(x,y,z) #pseudocode:

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