search for: largested

I only did a handful of the tests to demonstrate the point. If the patch approach is accepted then I'll do the remainder of the tests in v2. Rich.

--- tests/functions.sh.in | 17 ++++++++++++++++- tests/test-memory-largest.sh | 8 ++------ tests/test-partition1.sh | 22 ++++------------------ tests/test-partition2.sh | 6 +----- tests/test-pattern-largest.sh | 8 ++------ 5 files changed, 25 insertions(+), 36 deletions(-) diff --git a/tests/functions.sh.in b/tests/functions.sh.in index 35647f7..97afbbf 100644 ---

Hello list, I try to repack(tdbtool repack) my "dc=domain,dc=com.ldb" file: tdb> info Size of file/data: 3388084000/1050098055 Header offset/logical size: 0/3388084000 Number of records: 669737 Incompatible hash: no Active/supported feature flags: 0x00000000/0x00000001 Robust mutexes locking: no Smallest/average/largest keys: 12/57/242 Smallest/average/largest data: 72/1510/1235987

This assumes bashisms, but bash is required to run the tests. This is mostly simple refactoring. Except for the test-memory*.sh tests where nbdkit used to run in the foreground, but that seems to be a consequence of some left over debugging. --- tests/functions.sh.in | 35 ++++++++++++++++++++ tests/test-blocksize.sh | 23 +++---------- tests/test-cache.sh

I have a data frame with a couple million lines and want to retrieve the largest and second largest values in each row, along with the label of the column these values are in. For example row 1 strongest=-11072 secondstrongest=-11707 strongestantenna=value120 secondstrongantenna=value60 Below is the code I am using and a truncated data.frame. Retrieving the largest value was easy, but I have

Thanks: Eric Blake for the suggestion here: https://www.redhat.com/archives/libguestfs/2018-September/msg00069.html --- tests/functions.sh.in | 25 +++++++++++++++++++++++++ tests/test-blocksize.sh | 9 ++------- tests/test-cache.sh | 9 ++------- tests/test-cow.sh | 9 ++------- tests/test-data-7E.sh | 9

This assumes bashisms, but bash is required to run the tests. This is mostly refactoring. However the changes (simplifications) are quite substantial: - Since the new start_nbdkit helper function cleans up nbdkit on exit, most scripts no longer need to deal with the pid or kill the pid in the cleanup function. - As a result, cleanup functions are radically simpler, and often

I'm interested in large file system replication capability of rsync. Could some of you people who use it share how large their mirroring is? What would you say is the largest sized site being mirrored using rsync? Thanks! JP

v1 was here: https://www.redhat.com/archives/libguestfs/2018-September/msg00057.html v2: - Fix tab vs spaces in configure.ac. - To generate list of plugins, use printf instead of xargs. - Use 'source ./functions.sh' instead of 'source functions'. - functions.sh: Consistent quoting in foreach_plugin function. - functions.sh: Change the contract of start_nbdkit so it

--- tests/functions.sh.in | 17 ++++++++++++++++- tests/test-cache-max-size.sh | 18 +++--------------- tests/test-data-7E.sh | 8 ++------ tests/test-data-base64.sh | 12 ++++-------- tests/test-data-file.sh | 8 ++------ tests/test-data-raw.sh | 8 ++------ tests/test-eflags.sh | 13

Greetings Everybody: I generated a 1.2MB dta file based on the general social survey with Stata8 for linux. The file can be re-opened with Stata, but when I bring it into R, it says all the values are missing for most of the variables. This dataset is called "morgen.dta" and I dropped a copy online in case you are interested http://www.ku.edu/~pauljohn/R/morgen.dta looks like this

Combine much common code into tests/functions.sh. Patch 1: Preparation for patch 3. Patch 2: Fix a long-standing bug in how man pages links are generated. Patch 3: Common code for iterating a test function over every plugin. Patch 4: Common code for starting nbdkit in a test and waiting for the PID file to appear. This is the largest and most complex of the patches but is

v1 was here: https://www.redhat.com/archives/libguestfs/2019-January/thread.html#00198 For v2 I changed most existing prerequisite tests to use the new mechanism. I only changed simple tests. There are a few more complex tests that don't fit the “requires model” and those are not changed. I normalized qemu-io/qemu-img testing to always use the --version flag, where previously we used a mix

On 21/11/24 14:11, Dan Langille wrote: > On Wed, Nov 20, 2024, at 6:31 PM, Douglas Bagnall wrote: >> On 20/11/24 11:55, Dan Langille wrote: >> >>> Hope that helps. >> >> Not much unfortunately. >> >> Running this: >> >> net cache list >> >> will tell you what the cache thinks it contains. If it is filled with >> real

Hi, If I use the eigen() function to find the eigenvalues of a matrix, how can I find the eigenvector corresponding to the largest eigen value? Thanks! [[alternative HTML version deleted]]

Hi, I need to extract the second largest element from each row of a matrix. Below is my solution, but I think there should be a more efficient way to accomplish the same, or not? set.seed(1) a <- matrix(rnorm(9), 3 ,3) sec.large <- as.vector(apply(a, 1, order, decreasing=T)[2,]) ans <- sapply(1:length(sec.large), function(i) a[i, sec.large[i]]) ans Thanks in advance for your

Hello all, I was wondering if there is a function in R that only computes the eigenvector corresponding to the largest/smallest eigenvalue of an arbitrary real matrix. Thanks Minh -- Living on Earth may be expensive, but it includes an annual free trip around the Sun.

what is the largest file size limitation in ext3 ? Thank you

Hi One of my packages needs a look-up table of pre-calculated numbers in the data directory. I would like to have the matrix as large as possible. What is the largest size matrix that would be an acceptable datafile in an R package? [ The table is a square, upper triangular matrix consisting of logs of Stirling numbers calculated by Maple. As discussed on the List a few days ago (thanks

> a <- 0 ; for(i in (1:200000000)) a <- a + 1/i > b <- 0 ; for(i in (200000000:1)) b <- b + 1/i > c <- sum(1/(1:200000000)) > d <- sum(1/(200000000:1)) > order(c(a,b,c,d)) [1] 1 2 4 3 > b<c [1] TRUE > c==d [1] FALSE I'd expected b being the largest, since we sum up the smallest numbers first. Instead, c is the largest, which is