search for: recursers

Reading the body of function 'AnswerType' in bind.c, called from 'do_c' and 'do_unlist', I notice that EXPRSXP and VECSXP are handled identically in the recurse = TRUE case. A corollary is that c(recursive = TRUE) and unlist(recursive = TRUE) treat expression vectors like expression(a, b) as lists of symbols and calls. And since they treat symbols and calls as

Hi all, Does anyone have a comprehensive list of recursive-type objects in R? is.recursive defines them as by exclusion: "most types of objects are regarded as recursive, except for vector types, ?NULL? and symbols (as given by ?as.name?)." I think this that means recursive objects are: * lists * pairlists * calls * expressions Did I miss anything? Hadley -- Assistant

Hi, I''m getting errors while live migrating a pv guest. I''m running Xen 3.4.3 on CentOS 5.5, DRBD 8.3.8.1 and OCFS2 1.4.7-1. The two servers are identical. After live migrating the Debian lenny PV guest(2.6.26-2-686-bigmem), it crashes, It prints this on console [ 502.689357] BUG: recent printk recursion! [ 502.689357] BUG: recent printk recursion! [ 502.689357] BUG: recent

I ran into a problem recently trying to update a package which uses S4 methods using a recent beta of R. I think I can reproduce it with a simple example. I have package called `testpkg' in directory testpkg/. In the R/ subdirectory of testpkg/ I have a file called testpkg.R which contains the following two lines: setClass("testpkg", representation(pts = "list"))

Hi all, I have two prodction servers with FreeBSD 5.4 (all security patches are applied). They running some services like dns, ssh, http, ftp, etc. But I woukd like to encrypt some services for some hosts with ipsec when it is accessed. For example: - DNS resolution: not encrypted. - DNS replication master-slave: encrypted by ipsec. - Telnet: encrypted by ipsec for some hosts. Deny

On Wed, Oct 3, 2012 at 10:15 AM, Matthieu Moy <Matthieu.Moy at grenoble-inp.fr> wrote: > Preston Briggs <preston.briggs at gmail.com> writes: >> Think about costs asymptotically; that's what matters. Calls and >> returns require constant time, just like addition and multiplication. > > Constant time, but not necessarily constant memory. > > Deep recursion

Dr Murrell and others, It seems grid.ls() fails after any use of grid.remove(). It gives an infinite recursion error even in the simplest cases, and no matter what arguments are passed to grid.ls. > library(grid) > grid.newpage() > grid.lines(name="foo") > grid.ls() foo > grid.remove("foo") > grid.ls() Error: evaluation nested too deeply: infinite recursion

Hi David Blaikie and others who might be interested on this Thank you very much! #1. Then I'd like to know, to make Clang/LLVM optimize a recursion into an iteration, how a recursion has to be implemented with any compiler option? (if the language is C/C++) Clang uses recursions, especially it uses recursive decent and operator-precedence parser. #2. I wonder if this kind of recursion is

Hi list, I have a simple question about LLVM. I learned that we need to use iterations than recursions in C programming. That is because recursion is expensive. It can easily consume out all the stack given to a program. And the call/return consumes time much more. But I've read a sentence that nowadays compilers can optimize recursions in C or whatever languages not to consume heavy stack

Hello, While auditing the NMI/MCE paths, I have encountered some issues with recursive locking in Xen, discovered by the misuse of the console_lock intermittently as a regular lock and as a recursive lock. The comment in spinlock.h is unclear as to whether mixing recursive and non recursive calls on the same spinlock is valid. If the calls are genuinely not valid, then surely regular spinlocks

Hi, I'm working on a project that will generate RAM matrices at random. What I want to do is to be able to automatically identify if the model is non-recursive. For example, the following RAM matrix has a non-recursive loop (going from A to B to C to A): n.recursive <- data.frame(matrix(c("A", "B", 1, "B", "C", 1,

In another thread recursive snapshot creation was found atomic so that it is done quickly, and more important, all at once or nothing at all. Do you know if recursive destroying and renaming of snapshots are atomic too? Regards Henrik Heino

On Tue, Oct 2, 2012 at 11:44 PM, Journeyer J. Joh <oosaprogrammer at gmail.com> wrote: > Hi list, > > I have a simple question about LLVM. > > I learned that we need to use iterations than recursions in C programming. > That is because recursion is expensive. It can easily consume out all > the stack given to a program. And the call/return consumes time much > more.

Hi Hal, > As we had briefly mentioned on IRC, one way of forming this 'stack', and its associated 'cnt' variable, is to use dynamic stack allocation. I hadn't really reached a decision on the mechanics yet. However, your suggestion while it can work within the current abilities of the IR, has the disadvantage that it is using an extra stack slot for the link pointer. I

Hi, The other day on IRC myself, Chandler, Hal and Pablo discussed recursive inlining. I've pondered a bit since then, and thought I'd get some background on the list with the aim of stimulating discussion. Our goal is to inline recursive functions. We have several workloads with recursive calls, and inlining them to a certain degree can improve performance by up to 30%. Inlining

[..] drivers/video/fbdev/Kconfig:5:error: recursive dependency detected! For a resolution refer to Documentation/kbuild/kconfig-language.txt subsection "Kconfig recursive dependency limitations" drivers/video/fbdev/Kconfig:5: symbol FB is selected by DRM_KMS_FB_HELPER For a resolution refer to Documentation/kbuild/kconfig-language.txt subsection "Kconfig recursive dependency

> Only if the recursion is very deep. In practice, a recursive descent > parser isn't going to run out of stack space, nor will a quicksort or > binary-tree walker, The recursive-descent parser case has happened in practice: http://my.opera.com/hallvors/blog/2012/07/17/twitter-crashes-itself-with-commas?1 Also, I've seen some recursion-related PR's in Clang, although I think

We have NFS mounted drives. I first build an clang/llvm hosted compiler for Mips linux using the clang/llvm linux x86 compiler. Call this clang1. then in directory recurse on Mips host, I place this clang1 compiler and build clang2. then i rename recurse to recurse1 and create a new recurse directory. in recurse I copy clang2 from recurse1 to a recurse but name it clang1. then i build

See the code below. First, what are recursion limits in R. The function is stopping after 25 iterations for me. Is this general, or localized? Can recursion limits be changed? Second, which is generally more efficient, recursion or looping over a function? R 1.6.1 Windows 98 ----------------------------------------------------------- recurse<-function (n) { ifelse(n<50, {print(n);

Martin, Just a minor fix. Jie, Try the -r option (or the --recurse) option instead. It looks like the source changed to this: options.c: {"recurse", 'r', POPT_ARG_NONE, &recurse}, But the help is still at: options.c: rprintf(F," -r, --recursive recurse into directories\n"); eric Jie Gao wrote: > > rsync: --recursive: