similar to: Map an Area to another

Begin forwarded message: > From: David Winsemius <dwinsemius at comcast.net> > Date: January 26, 2011 8:32:30 AM EST > To: Alaios <alaios at yahoo.com> > Subject: Re: [R] MAtrix addressing > > > On Jan 26, 2011, at 7:58 AM, Alaios wrote: > >> Unfortunately right now is convoluted... by I was trying to find >> some solution. >> Bring again

Hi R-mailing list I would have the following set-up below with a simplified data-frame. Through a loop which includes certain criteria for the densities I would like to plot the different density-distributions in the same plot. Of course I hope I don't do any mistakes with all the indexes of the dataframe. All I would like to have is the different densities in the same plot with a general

What should findInterval(x,vec,all.inside=TRUE) return when length(vec)<=1, so there are no inside intervals? R-3.3.0 gives a decreasing map of x->output when length(vec)==1 and -1's when length(vec)==0. Would '0' in all those cases be better? > findInterval(x=c(10, 11, 12), vec=11, all.inside=TRUE, rightmost.closed=FALSE, left.open=FALSE) [1] 1 0 0 >

>>>>> Gabor Grothendieck >>>>> on Mon, 16 Sep 2024 11:21:55 -0400 writes: > Suppose we have `dat` shown below and we want to find the the `y` value > corresponding to the last value in `x` equal to the corresponding component > of `seek` and we wish to return an output the same length as `seek` using > `findInterval` to perform the

I have just noticed that quite a few columns of a data frame that I am working on are numeric factors. For summary() purposes I want them to be vectors. I tried, for example > indx <- c(1:18,21:37,40,41) > i <- 0 > i <- i+1 > summary(as.vector(sflows1[indx[i]])) Length Class Mode min.pkt.sz 3000 factor numeric but this does not give the five-number

>>>>> brodie gaslam via R-devel >>>>> on Thu, 5 Mar 2020 22:18:33 +0000 (UTC) writes: > I've found over time that R documentation that comes off as terse at > first blush is usually revealed to be precise, concise, and complete > on close reading.? I'm sure this is also true of `?findInterval`, but > for whatever reason my

I've found over time that R documentation that comes off as terse at first blush is usually revealed to be precise, concise, and complete on close reading.? I'm sure this is also true of `?findInterval`, but for whatever reason my brain simply refuses to extract meaning from it. Part of the problem may be that we interact with the function via a compressed form of the bounds of the

Hello there, Could anybody please help on how to correctly use ggplot when printing irregural time series, by irregural here I mean for example the absence of some dates in the whole timespan of a dataset. To be more precise in the following example I generated some random data which spans the whole November up to now and dropped weekend days but for some reasons ggplot continues to plot the

Dear R Community, I hope you might be able to assist with a small problem creating a function. I am working with water-quality data sets that contain the concentration of many different elements in water samples. I need to assign quality-control flags to values that fall into various concentration ranges. Rather than a web of nested if statements, I am employing the findInterval function to

I have cobbled together the following logic. It works but is very slow. I'm sure that there must be a better r-specific way to implement this kind of thing, but have been unable to find/understand one. Any help would be appreciated. hh.sub <- households[c("HOUSEID","HHFAMINC")] for (indx in 1:length(hh.sub$HOUSEID)) { if ((hh.sub$HHFAMINC[indx] == '01')

Hi there: We have recently inherited a circa 1996 SGI Indy Colorbus Cyclone running on Irix. Our intention is to use this unit to drive our Canon CLC900 Scanner Copier and make it accessible to our Windows Network. At the moment, our Windows Network does not "see" the Cyclone & vice versa. I have read that installing some kind of Windows Samba client onto our windows

Suppose we have `dat` shown below and we want to find the the `y` value corresponding to the last value in `x` equal to the corresponding component of `seek` and we wish to return an output the same length as `seek` using `findInterval` to perform the search. This returns the correct result: dat <- data.frame(x = c(2, 2, 3, 4, 4, 4), y = c(37, 12, 19, 30, 6, 15), seek = 1:6)

Ok, so this might seem weird, but hang with me on this. I have two sites, Indy and Lafayette that each have their own Asterisk server. They each have their own outside PRI line. They are also trunked internally via and IAX tunnel over a private fiber line. I've recently been asked to have the calls incoming to Indy, forwarded to a group in Lafayette (only during the day, so can't be

I believe I have found the cause of the unexplained error (code ??) at main.c(line #). In the version I'm running 2.5.2 (obtained from the Free Software Foundation) the line number is 576. It appears the root cause is related to a race condition associated with the termination of child processes. If the signal handler for SIGCHILD is executed, as the result of a child termination, before the

Hola! I am programming a class (S3) "symarray" for storing the results of functions symmetric in its k arguments. Intended use is for association indices for more than two variables, for instance coresistivity against antibiotics. There is one programming problem I haven't solved, making an inverse of the index function indx() --- se code below. It could for instance return the

> Hello, > > Is this the fastest way to use indices from one matrix to reference rows > in another smaller matrix? I am dealing with very big data (lots of columns > and I have to do this lots of times). > > ######sample data ############## > vals = matrix(LETTERS[1:9], nrow=3,ncol=3) > colnames(vals) = c('col1','col2','col3') > rownames(vals)

I found a bug in one of the fourteen speed patches I posted, namely in patch-vec-subset. I've fixed this (I now see one does need to duplicate index vectors sometimes, though one can avoid it most of the time). I also split this patch in two, since it really has two different and independent parts. The patch-vec-subset patch now has only some straightforward (locally-checkable) speedups for

Looking at shash in unique.c, from R-2.10.1 I'm wondering if it makes sense to hash the pointer itself rather than the string it points to? In other words could the SEXP pointer be cast to unsigned int and the usual scatter be called on that as if it were integer? shash would look like a slightly modified version of ihash like this : static int shash(SEXP x, int indx, HashData *d) {

Folks: In answer to a query, Andy Liaw recently submitted some code to construct a block diagonal matrix. For what seemed a fairly straightforward task, the code seemed a little "overweight" to me (that's an American stock analyst's term, btw), so I came up with a slightly cleaner version (with help from Andy): bdiag<-function(...){ mlist<-list(...) ## handle case in

Hi guys, i'm not going to have time to work on this for a month or two, so i figured i'd post it. This patch 1. reworks the andersen's implementation to support field sensitivity (though field-sensitive constraints are not generated directly yet), and uses it to do indirect function call support. 2. Rewrites the solver to be state of the art in terms of speed. kimwitu++ used to take