similar to: Fortran (77) in R

Hi, I think I found the problem. It lies in my Fortran program. Is there a way, after a DO loop, to make sure it does NOT return anything? Cheers, Kevin On Mon, 15 Apr 2002, Ko-Kang Kevin Wang wrote: > Date: Mon, 15 Apr 2002 17:27:20 +1200 (NZST) > From: Ko-Kang Kevin Wang <kwan022 at stat1.stat.auckland.ac.nz> > To: R Help <r-help at stat.math.ethz.ch> > Subject:

Hello everybody, Could someone please send me a very simple example using Fortran from R? Say pass a value to an executable and get the result in R. Actually it seems it may be possible to call an *.f file ?? or I am wrong again? The manual is very terse on the subject. Thank you very much Stephen Elijah -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help

Dear all, I have an implementation of streams in R. The current implementation of delay() and force() is inspired from the LISP implementation found in Part VI "Languages for AI problem solving" of "Artificial Intelligence" by G. Luger. I have tested it with the Fibonacci example in the same book (see examples below). It works but I do run into a problem when I try to

Hi all, (thanks to Reid, who gave nice advice) the fibonacci function code works now. Please find attached file. but... the performance is adequate, say, for byte-code interpretation mode and not for optimized JITing. fibonacci function of 35 from attached file is more then 100 times slower then the following code compiled with "gcc -O2" : ----------- #include <iostream> int

Valery, That's pretty cute actually. Do you want this "brilliant" :) example in the cvs repository? I'd be happy to put it in. Reid. Valery A.Khamenya wrote: > Hi LLVMers, > > the example attached I have used to prove that JIT and some visible > optimizations are really invoked. > > Proved OK. I got 30% speed-up in comparison to gcc 3.3.3 >

When I compile my C fibonacci example fib.c with 'clang -O3 -c -emit-llvm -o fib-clang.bc fib.c&& llvm-dis fib-clang.bc' I get fib-clang.ll that has some degree of inlining in it. But when I get an equivalent to fib.c file fib.ll and run it through opt with the command 'llvm-as fib.ll&& opt -O3 fib.bc -o fib-opt.bc&& llvm-dis fib-opt.bc' resulting

On Tue, 17 Aug 2004, Reid Spencer wrote: > That's pretty cute actually. Do you want this "brilliant" :) example in the cvs > repository? I'd be happy to put it in. Here's an idea: how about we take the ModuleMaker, Valery's previous example, and this one and put them all in one "small examples" project? -Chris > Valery A.Khamenya wrote: > >

On second thought, the makefiles don't (easily) allow this do they? You can only build one program per directory. Were you suggesting that you wanted me to move the entire directories under a "small examples" directory? Reid. Chris Lattner wrote: > On Tue, 17 Aug 2004, Reid Spencer wrote: > > >>That's pretty cute actually. Do you want this

On Tue, 17 Aug 2004, Reid Spencer wrote: > On second thought, the makefiles don't (easily) allow this do they? You can > only build one program per directory. Were you suggesting that you wanted me to > move the entire directories under a "small examples" directory? You're right. The simples way to do this would be to have: projects/ SmallExamples/

On Sat, 14 Aug 2004, Valery A.Khamenya wrote: > (thanks to Reid, who gave nice advice) the fibonacci function code > works now. Please find attached file. > > but... the performance is adequate, say, for byte-code > interpretation mode and not for optimized JITing. > fibonacci function of 35 from attached file is more > then 100 times slower then the following code compiled

Hi, Is it possible to draw barplot with x-axis being shown? I looked up the help file and I couldn't seem to find it. For example, I tried to do x <- 1:9 p <- log10(1 + 1/x) barplot(p, xlab = "Digit d", ylab = "Probability", ylim = c(0, 0.35), axes = F, main = "Benford's Law Probability") axis(1, 1:9) axis(2, seq(0, 0.35, by = 0.05),

Hello, I recently noticed a performance issue of JIT execution vs native code of the following simple logic which computes the Fibonacci sequence: uint64_t fib(int n) { if (n <= 2) { return 1; } else { return fib(n-1) + fib(n-2); } } When compiled natively using clang++ with -O3, it took 0.17s to compute fib(40). However, when executing using LLJIT, fed with the IR output of "clang++

Hi, Is it possible to add a subtitle that appears directly below the main title? I tried the "sub" parameter, but it adds sub-title to the bottom of the plot. Cheers, Kevin ------------------------------------------------------------------------------ Ko-Kang Kevin Wang Postgraduate PGDipSci Student Department of Statistics University of Auckland New Zealand Homepage:

I've just completed(?) an R Guide for Windows users. It was extended from my "Compile R for Windows" that I put up a few months ago. To get it go to http://www.stat.auckland.ac.nz/~kwan022/rinfo.php Here is the table of contents: 1 Introduction 2 Installation 2.1 Installing R Base 2.2 Installing packages 3 Running R 3.1 Rgui 3.2 Rcmd 3.3 Rterm 4 Comile

Hola LLVMers, I'm getting a crash when using ConstantFP::get. I can repro it by adding one line to the Fibonacci example program: int main(int argc, char **argv) { int n = argc > 1 ? atol(argv[1]) : 24; // Create some module to put our function into it. Module *M = new Module("test"); // We are about to create the "fib" function: Function

Hi, Suppose I have a function: myfunc <- function(x, y) { ... } And within the function I want to print out the name of the x, y vectors. For example, if I do: > myfunc(foo, goo) [1] "foo" "goo" It shall return "foo", "goo" (with or without quotes is fine), where foo and goo are two vectors with numbers. I know this sounds strange, but I'd

Having tried out llvm I had to notice that the fibonacci example program hangs after short: > ./run fib 1 1 2 3 5 8 ^C For the next number it would be supposed to last twice as long as for 8. However it hangs forever instead. using llvm-2.5-0.pm.1.1.x86_64 Does not matter whether I compile it with gcc or interprete it with lli.

Hi, Say I want to do something like fitting 10 different sized trees with rpart() function. The only modification I need to do is to set 10 different cp's, which I have in a vector called foo. Can I do something like: for(i in 1:10) { rpart(y ~ ., cp = foo[i], data = mydata) } My problem is, I wish to save the 10 rpart objects into 10 different names, my.rpart1 ~ my.rpart10, for

Hi, Now suppose I have just one list called FOO, which has 25 objects, e.g.: [[1]] 1 2 3 4 5 [[2]] 6 7 8 9 10 . . . And I want to do something like: FRED <- data.frame(cbind(unlist(FOO[[1]]), unlist(FOO[[2]]), # ... for all 25 subsets )) Is it possible to do this, without doing unlist(FOO[[i]]) 25

Here's my translation of the Fibonacci example into OCaml: open Printf open Llvm let build_fib m = let fibf = define_function "fib" (function_type i32_type [| i32_type |]) m in let bb = builder_at_end (entry_block fibf) in let one = const_int i32_type 1 and two = const_int i32_type 2 in let argx = param fibf 0 in set_value_name "AnArg" argx; let