similar to: strverscmp, scandir, alphasort and versionsort

Add support for scandir() and alphasort() as defined in POSIX.1-2008. Signed-off-by: Mike Waychison <mikew at google.com> --- usr/include/dirent.h | 7 +++++ usr/klibc/Kbuild | 2 + usr/klibc/scandir.c | 76 ++++++++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 84 insertions(+), 1 deletions(-) create mode 100644 usr/klibc/scandir.c diff --git

Dear list, I have a vector of characters and a list of two named elements : i <- c("a","a","b","b","b","c","c","d") j <- list(j1 = c("a","c"), j2 = c("b","d")) I'm looking for a fast way to obtain a vector with names, as follows : [1] "j1" "j1"

This patchset applies to klibc mainline. This patchset introduces the ability to kinit to execute scripts or executable files present in in the initramfs before switching over to the root filesystem. It is implemented by first implementing scandir() and alphasort() as present in POSIX.1-2008 in klibc itself, and then using that as the basis for iterating and executing files via a run_scripts()

Hi, Having 3 dataframes with different row numbers, but equal column names (see below) I want to merge them by Var1 so I've tried: merge(j1,j2,j3,by="Var1") merge(j,j1,j2,by=names("Var1")) But always got the same message: Erro en fix.by(by.x, x) : 'by' must specify column(s) as numbers, names or logical What I'm doing wrong? Thanks, Antonio j1

I am hoping someone can help translate some WinBUGS code into R code. I would like to use R to create the C[] matrix required for a car.proper model in WinBUGS, but I am having a difficult time negotiating the coding. The C matrix provides normalized weights for each pair of spatial areas. So the WinBUGS example is as follows: # of the weight matrix with elements Cij. The first J1 elements

Hi, is there any way to keep a sub matrix dimension? exemple : i1<-1; i2<-1 j1<-2; j2<-3; ret <-matrix(1,4,4)[i1:i2,j1:j2] ; dim(ret) is NULL because the submatrix single col or single row is coerce to a vector automaticaly. How can i bypass this cast : submatrix->vector ??????? Thank you. --------------------------------- [[alternative HTML version

#I have a data set that looks like this. A bit more complicated actually with # three factor levels but these calculations need to be done on one factor at a #I then have a set of different rates that are applied #to it. #dataset cata <- c( 1,1,6,1,1,2) catb <- c( 1,2,3,4,5,6) doga <- c(3,5,3,6,4, 0) data1 <- data.frame(cata, catb, doga) rm(cata,catb,doga) data1 # start rates #

Dear R People: Here is an interesting question(I think) Suppose I want to calculate Centered Moving Averages; i.e. x[1] <- ( sum(y[1:12]) )/12 x[2] <- ( sum(y[2:13]) )/12 and so on. Of course, this is easily done through loops. However, I have been trying to do this more elegantly, but have failed. I have tried things like j1 <- 1:109 j2 <- 12:120 x[1:109] <- ( sum( y[j1:j2])

hello: I have 3 data.frame objects. First df object: Of dim (149,31). Columns 2:31 are marked as T1..T14 and N1..N16. Name T1 T2 N1 T3 N2 N3 N4 T4 mu1 10 10 9 10 9 9 8 10 mu2 11 11 9 11 9 9 9 11 ... muN 12 12 9 11 9 9 8 12 Second df object: of Dim (50000,31). Columns 2:31 are maked as T1...T14 and N1..N16.

Hello, This is the little basic program I used to test xattrs. First thing I did was something like this cd /mnt/btrfs-test for i in $(seq 0 100000); do touch file_$i; done and then run time ./xattr-test /mnt/btrfs 0 time ./xattr-test /mnt/btrfs 1 time ./xattr-test /mnt/btrfs 2 the 0 test creates 100 xattrs for every file in the directory. the 1 test just does a listxattr for every file in

Commit-ID: 686f1931b7dc102c32b59db638a3082d5c2251e5 Gitweb: http://git.kernel.org/?p=libs/klibc/klibc.git;a=commit;h=686f1931b7dc102c32b59db638a3082d5c2251e5 Author: maximilian attems <max at stro.at> AuthorDate: Mon, 10 Jun 2013 18:15:43 -0400 Committer: maximilian attems <max at stro.at> CommitDate: Wed, 21 Aug 2013 11:50:43 +0200 tests: Fix sscanf integer tests Drop the

Dear List: I have a data manipulation problem that I was unable to solve in R. I did it in SQL, and it may be that the solution in R is to do it in SQL, but I wondered if people could imagine a vector-based solution. Imagine a list A[i] of observers who observe some set of events B[j]. Each observer i may observe one or more events, and each event j may have been observed by one or more

Hi James/Chris, You guys have done this before, so I'm guessing you can help me understand what's going on. If my buildbot config is: jobs=2, nt_flags=['--cflag', '-mcpu=cortex-a15', '--use-perf', '--threads=1', '--build-threads=4'] It uses -j4 for build, -j2 for running the tests:

I recently wrote a function to compute functions over moving windows. (See below). It varies from your request by using the last N points rather than the last N/2 and next N/2 points, so you may have to modify it to get what you want. It will be in the next gregmisc package, which will go out in a month or so when the publication review process here finishes. (I hate red tape!) -Greg

1. "dump_video.c" got reverted back by 5 years into 2004: https://trac.xiph.org/browser/trunk/theora/examples/dump_video.c https://trac.xiph.org/log/trunk/theora/examples/dump_video.c 2. "png2theora.c" (subminor) https://trac.xiph.org/browser/trunk/theora/examples/png2theora.c 207 /* Must hold: yuv_w >= w */ 208 yuv_w = (w + 15) & ~15; 209 210 /* Must hold:

In one particular situation predict.coxph gives an error message. Namely: stratified data, predict='expected', new data, se=TRUE. I think I found the error but I'll leave that to you to decide. Thanks, Chris ######## CODE library(survival) set.seed(20121221) nn <- 10 # sample size in each group lambda0 <- 0.1 # event rate in group 0 lambda1 <- 0.2 # event rate in group 1

Hi. I''m newie using LARTC. I have some pc''s and one 512/192kbits conection. I do not want that one PC uses all the bandwidth available. I made this script to limit, but I need that the applications (web browsing, messenger with cam and audo , p2p, etc) in pc''s continue acceding normally Internet. Would work this script? what type of qdisc could be added to htb in

Hi all, This is covered by (struct-path aware) TBAA, but BasicAA disagrees. See the attached testcase, where it prevents us from removing the redundant load. For arbitrary GEPs, we can't decide based on constant indices (because of e.g., &A[0][1] and &A[1][0], with *A a one-element array). BasicAA has some logic to "try to distinguish something like &A[i][1] against

Hi Jonas, > here is a patch to add Thumb call relocation to the dynamic linker. I would be happy if you could commit it to the SVN. Thanks very much for working on this. It looks like a good starting-point, but there are a couple of issues with the patch at the moment. First, it only handles RelValue up to 22 bits (depending on how you count) in size. But on ARMv6T2 onwards the J1 and J2

?? > z <- array(1:24,dim=2:4) > all.equal(f(z,3),f2(z,3)) [1] "Attributes: < Component ?dim?: Mean relative difference: 0.4444444 >" [2] "Mean relative difference: 0.6109091" In fact, > dim(f(z,3)) [1] 2 3 4 > dim(f2(z,3)) [1] 3 4 2 Have I made some sort of stupid error here? Or have I misunderstood what was wanted? Cheers, Bert Bert Gunter