search for: contiguousness

>na.contiguous function (object, ...) UseMethod("na.contiguous") <environment: namespace:stats> this is what I get when I look for the source code for some functions- Is there a way to look at the source code? -- Let's not spend our time and resources thinking about things that are so little or so large that all they really do for us is puff us up and make us feel like

Hi All, I am interfacing to some C libraries (hdf5) and I have methods defined for '[', these methods do hyperslab selection, however, currently I am limiting slab selection to contiguous blocks, i.e., things defined like: i:(i+k). I don't do any contiguity checking at this point, I just grab the max and min of the range and them potentially do an in-memory subselection which is what

Hi. The description of na.contiguous says: "Find the longest consecutive stretch of non-missing values in a time series object. (In the event of a tie, the first such stretch.)" But this seems not to be the case if one of the tied longest stretches is at the start of the sequence/series. In the following example, there are three stretches of length 3, so I expect the result

All, I am attempting to select all of the contiguous elements of a matrix that meet some criterion. I.e., values that would be contained within an irregular area defined by a "contour" applied around point of interest. So, if I have a matrix x as follows: > x <- matrix(rnorm(25), nrow=5, ncol=5,

How does R do it, and should I ever be worried? I always remove columns by index, and it works exactly as I would naively expect - but HOW? The second illustration, which deletes non contiguous columns, represents what I do all the time and have some trepidation about because I don't know the mechanics (e.g. why doesn't the column formerly-known-as-4 become 3 after column 1 is dropped:

Hello, I would like to know if there is a function in an R library that allows to do cluster analysis under contiguity constraints ? Thank you very much for your answer ! Lise Bellanger -- Lise Bellanger, Universit? de Nantes D?partement de Math?matiques, Laboratoire Jean Leray UMR CNRS 6629 2, Rue de la Houssini?re BP 92208 - F-44322 Nantes Cedex 03 T?l. : (33|0) 2 51 12

op 11-11-13 16:31, Jerry Cooperstein schreef: > Hi: > > commit bd9c5a2016307164c419c5e24a46921c10e620a0 > > (drm/nouveau: require contiguous bo for framebuffer) > produces about 2000 lines of > > nouveau E[ DRM] framebuffer requires contiguous bo > > on system boot and more on shutdown, but I don't see other > negative effects. I tried deploying a trivial

Hi, all, I got machines running continuously for long time, but then the underlying ext3 file systems becomes quite heavily fragmented (94% non-contiguous). We just don't have a chance to shutdown the machines since they are always busy.. I tried the defrag 0.70 version comes with e2fsprog package and standalone 0.73 packages, but neither help me since the defrag tool can not handle ext3.

U-boot for the arndale board splits the memory in 8 contiguous banks and rewrites the memory node. So most of the memory is lost. As the frametable is only able to handle contiguous memory, use the first contiguous banks and warn if some of the memory banks are not used. Signed-off-by: Julien Grall <julien.grall@linaro.org> --- xen/arch/arm/setup.c | 23 +++++++++++++++++------ 1 file

op 11-11-13 17:05, Jerry Cooperstein schreef: > On 11/11/2013 09:57 AM, Maarten Lankhorst wrote: >> op 11-11-13 16:31, Jerry Cooperstein schreef: >>> Hi: >>> >>> commit bd9c5a2016307164c419c5e24a46921c10e620a0 >>> >>> (drm/nouveau: require contiguous bo for framebuffer) >>> produces about 2000 lines of >>> >>> nouveau

On 11/11/2013 09:57 AM, Maarten Lankhorst wrote: > op 11-11-13 16:31, Jerry Cooperstein schreef: >> Hi: >> >> commit bd9c5a2016307164c419c5e24a46921c10e620a0 >> >> (drm/nouveau: require contiguous bo for framebuffer) >> produces about 2000 lines of >> >> nouveau E[ DRM] framebuffer requires contiguous bo >> >> on system boot and

Hi Renato, No, I cannot, but in case it is, I want to take advantage of this. In case it is not, the instrumentation code will detect this at runtime and simply roll back to the original version. I will always keep an original version available, in addition to the ones I modify with Polly. However, initially I will speculate that it is allocated contiguously. Thanks, Alexandra

Hi, I have a 3 columns data and need to generate a vector of counts. These counts are the number of rows that are contiguous. It looks easy for manual counting, but to turn it algorithmic really split my head. For example, 11 (i.e. 18004 to 180014), 1 (i.e., 18017), 7 (i.e., 18060 to 18064) 18004 10314568 0.5205757 18005 10333837 0.5135572 18006 10566333 0.5111271 18007 10566624 0.8196611

Hello, I need help getting from data$HAVE to data$NEED (see below). This requires replacing every TRUE in data$HAVE with 4 TRUE(s) in data$NEED. Any ideas? It seems straight forward but I can't figure it out! Thanks in advance HAVE NEED 1 FALSE FALSE 2 FALSE FALSE 3 TRUE TRUE 4 FALSE TRUE 5 FALSE TRUE 6 FALSE TRUE

A) Resilver = Defrag. True/false? B) If I buy larger drives and resilver, does defrag happen? C) Does zfs send zfs receive mean it will defrag? -- This message posted from opensolaris.org

Hello, Given a vector I would like to rapidly identify duplicated non contiguous elements. Given for example c(1, 1, 2, 3, 2, 4, 5, 6, 4) I would like to get: FALSE FALSE TRUE FALSE TRUE TRUE FALSE FALSE TRUE In fact I need to check this on the columns of a matrix! I can do that of couse with loops but is there any function already available? Thanks

my reproducible example test<-structure(list(site = structure(c(1L, 1L, 1L, 1L, 1L, 1L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 2L, 3L, 3L, 3L, 3L, 3L, 3L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 4L, 5L), .Label = c("A", "B", "C", "D", "E"), class = "factor"),

Hi Konrad, The following patch causes fairly large packet loss when transmitting from dom0 to the physical network, at least with my tg3 hardware, but I assume it can impact anything which uses this interface. I suspect that the issue is that the compound pages allocated in this way are not backed by contiguous mfns and so things fall apart when the driver tries to do DMA. However I

When designing a filesystem, is fragmentation really an issue if access to the disk can be done using scatter-gather DMA techics ?

Andrew, can you please send this on to Linus and -stable ASAP? It's causing massive problems for our users. On Thu, Aug 12, 2010 at 04:50:59PM -0400, Jeff Moyer wrote: > Hi, > > commit c2c6ca4 (direct-io: do not merge logically non-contiguous > requests) introduced a bug whereby all O_DIRECT I/Os were submitted a > page at a time to the block layer. The problem is that the