similar to: What is the most efficient way to assign to PARTS of obje cts in other frames/environments?

Can please someone familiar with the R internals explain on the following: PR#1434 from r-bugs clarifies that assign("a[1]", x, SomeOtherFrame) or assign("a$a", x, SomeOtherFrame) will NOT assign to an object 'a' in the other frame BUT create a new object called 'a[1]' resp. 'a$a'. This leads to the following question: what is the most

R allows you to dynamically extend a vector by assigning past the end. So if a has length 10, then assigning to a[11] creates also a[11] with value a2[11] NA. So a is now length 11, while a2 is still length 10. So the occurrence of a[11] has a different meaning on the assigned-to side than on the assigned-from side. E.g. >a <- rep(1,10) >b <- 11 >a2 <- a >a[b] <- a2[b]

I am using R 1.7.1 on Windows XP Pro. The 'overwrite=FALSE' argument appears to be ignored in file.copy(): > file.exists(c("file1.txt", "file2.txt")) [1] TRUE TRUE > file.copy(from="file2.txt", to="file1.txt", overwrite=FALSE) [1] TRUE > and sure enough, file1.txt has been overwritten. Rich Raubertas Biometrics Research, RY33-300 Merck

Hello everibody, i tried ti start the program, but i get an error like in the subject of this mail. How can i resolve it? I have: Ubuntu 9.10 massimo at ThinkCentre9636-71G:~$ wine --version wine-1.1.31 This is the console log: massimo at ThinkCentre9636-71G:~$ wine .wine/drive_c/Programmi/TARGET/Target.exe fixme:heap:HeapSetInformation (nil) 1 (nil) 0 fixme:win:RegisterDeviceNotificationA

Is plot(ts.object) equivalent to the S-Plus ts.plot ? -- ------------------------------------------------------------------------- Konstantinos E. Vorloou | Tel: +44 (0)191 374 1821 Department of Economics & Finance | Fax: +44 (0)191 374 7289 University of Durham, | email: K.E.Vorloou at durham.ac.uk 23/26 Old Elvet, | or : vorlow at rocketmail.com

Hello When modprobing tcrypt on a qemu virtual machine, I get the following trace in dmesg: skcipher: Test 1 failed (invalid result) on encryption for cts(virtio_crypto_aes_cbc) Regards Corentin Labbe

Hello, As the author of package cts, I hope somebody on this list can kindly help (perhaps off-list) to resolve the build/check issue with package cts for Mac. The error occurred on Mac machines only: http://cran.r-project.org/web/checks/check_results_cts.html. Here is the error message: At line 10 of file machine.f Fortran runtime error: Range error during floating point read The source

Hello! I tried to contact author of the package, but I got no reply. That is why I write it here. This might be useful for those who were using cts for spectral analysis of non-uniformly spaced data. In file spec.ls.R from cts_1.0-1.tar.gz lines 59-60 are written as pgram[k, i, j] <- 0.5 * ((sum(x[1:length(ti)]* cos(2 * pi * freq.temp[k] * (ti - tao))))^2/sum((cos(2 * pi * freq.temp[k] *

The following command, temp <- read.table("c:/rfr/r/test.txt") reads the text file "test.txt", which contains the following lines: 21437 21438 21419-2 21420-2 21421-2 21422-2 and produces the following result: > temp V1 1 21437+0i 2 21438+0i 3 0+0i 4 0+0i 5 0+0i 6 0+0i > These "numbers" are actually sample ID's, and I

Dear list, Utils::modifyList() drops NULL components in its second argument, instead of adding them to the first argument. Compare: > modifyList(x=list(A=1), val=list(B=2, C=3)) $A [1] 1 $B [1] 2 $C [1] 3 > modifyList(x=list(A=1), val=list(B=NULL, C=3)) $A [1] 1 $C [1] 3 To me this seems inconsistent with the documentation ("Elements in 'val' which are missing from

R 1.7.1 on Windows XP The "normal Q-Q plot" produced by plot.lm() mislabels points when the model is fitted using na.action=na.exclude. Example: x <- 1:50 y <- x + rnorm(50) y[c(5,10,15)] <- NA # insert some NA's y[40] <- 50 # add an outlier plot(lm(y ~ x, na.action=na.omit)) # outlier correctly labeled in all # four plots

I have members with usernames. In the event that a new member requests an already-existing username, I''d like to automatically "increment" a next-best string: johnny johnny1 johnny2 Knowing RoR, my gut tells me there''s some elegant, concise way to do this, but I can''t think of it. Any advice? -- Posted via http://www.ruby-forum.com/.

Hi guys, We are using syslinux (memdisk) and gpxe already for a while. Also got a working winpe boot method by means of pxe. Which basicly is a dd of an 'recovery partition' where winpe.wim is on. That method isn't really the most efficient way, cause its loaded into memory twice. We are going to do a major windows 7 deployment soon and i'm looking for the most efficient way of

Hi, What the most efficient way to get a file from a Windows HVM guest from dom0 when the guest is running? No need to change the file, just read it. Hu Shaolong _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

This was exactracted from a 8192x4 texture, with 32x4 tiles. 4 patterns appears, each 8x128 bytes long. these patterns are repeated, and one is always left out. So 123, 234, 134, 124. The repetetive cycle is therefore 4x3x8x128 = 12288 bytes long. I've included the color code ods file, which contains the normal -> actual position. I have no idea how this goes for larger tiles (is the

Hello, What is the most efficient way to update some content of document with new info gathered later after it's first indexed? For example I first index a lot of documents text (lets say it's mailbox), and after all documents are indexed I determine each document uniqued ID (which I wasn't able to determine on initial indexing) and I want update all documents with this ID. As I

I need to count the total number of instructions in a given module. The only way I found is using the obvious double iteration as seen below. Is there any more efficient way to achieve this ? I don't like the fact that simple calculation like that has performance of o(F*B) (# of functions * # of blocks per function) unsigned int calcSize(Module* mod) { unsigned int size = 0; for

Hi, Sometimes, you need to send requests to SIP phones either from Linux command line or from Asterisk dialplan. Which is the most efficient way to know a SIP phone IP address ? Today, I think I would use : asterisk -rx "sip show peer 692" | grep "Addr->IP" | awk '{print $3}' I'm wondering if anything more concise and efficient exists ? Regards --------------

Hi all, I use this command to see disk usage: du -cks * | sort -rn | while read size fname; do for unit in k M G T P E Z Y; do if [ $size -lt 1024 ]; then echo -e "${size}${unit}\t${fname}"; break; fi; size=$((size/1024)); done; done The data itself is around 200GB with lots of subdir and small files. The command takes for about 1 hour to finish. Is there a faster way to see the disk

Hi, I was wondering the what would be the (most efficient) way to generate a sequence of sequences, i mean: if I have 1,2 and 3. I'd like to generate a sequence of length N*3 (N ~ 1,000,000 or more) Where random permutations of the sequence 1,2,3 follow each other. i.e 1,2,3,1,3,2,3,2,1 /!\ The thing is that there should never be twice the same number of in the same sub-sequence,