similar to: a==0 vs as.integer(a)==0 vs all.equal(a,0)

This is a seemingly simple problem - hopefully someone can help. Problem: we have two integers. We want (1) all the common factors, and (2) all the possible products of these factors. We know how to get (1), but can't figure out a general way to get (2). Example: 40 and 80 have these factors: c(1,2,2,2,5) and c(1,2,2,2,2,5). We can use match() to get the common factors c(1,2,2,2,5). What

Jacobi's theta functions crop up here and there in various branches of mathematics, such as unimodular and elliptic functions. They have Taylor expansions, but the powers increase as the square of n, as in 1 + z + z^4 + z^9 + z^16 + z^25 + . . . so they converge very quickly, provided |z|<1 The following toy function shows how I'm implementing these objects. I just add terms

I've just begun playing around with defining functions in R and I'm not really sure what's going on in the following situation. I've defined the following function: gcd <- function(x,y) { x <- as.integer(x); y <- as.integer(y) q <- as.integer(x / y) r <- x - q * y if (r==0) y else gcd(y,r) } As expected, it gives the following results: > gcd(3,2) [1] 1

Hello Everyone, I am trying to create two modules in LLVM, where first module contains the definition of a function, gcd in this example and another module contains a call to this function. My example is based on the following tutorial, with a few changes. http://llvm.org/releases/2.6/docs/tutorial/JITTutorial2.html When I execute the verifier pass on my modules, it complains that the

Hi, I tried this as well, using the following line to add function declaration to the caller module. Function::Create(FT, Function::ExternalLinkage, "gcd", mod); Where "FT" is the same as before. And the output produced by the PrintModulePass becomes: ; ModuleID = 'GCDMain' declare i32 @gcd(i32, i32) define i32 @main() { EntryBlock: %tmp = call i32 @gcd(i32

Dear R-xperts I have just written a little hypergeometric function, included below [the hypergeometric function crops up when solving a common type of ODE]. It works fine on single values of the primary argument z, but vectorizing it is getting confusing. The best I have come up with so far just tests for z being longer than 1 and if so, uses sapply() recursively. This is fine, except that it

On Wed, Aug 31, 2011 at 10:54 AM, Mian M. Hamayun <mian-muhammad.hamayun at imag.fr> wrote: > Hi, > > I tried this as well, using the following line to add function declaration > to the caller module. > > Function::Create(FT, Function::ExternalLinkage, "gcd", mod); > > Where "FT" is the same as before. And the output produced by the >

Hi I deal with long vectors almost all of whose elements are zero. Typically, the length will be ~5e7 with ~100 nonzero elements. I want to deal with these objects using a sort of sparse vector. The problem is that I want to be able to 'add' two such vectors. Toy problem follows. Suppose I have two such objects, 'a' and 'b': > a $index [1] 20 30 100000000

Hello Peter, Thanks to pointing out this interesting case. > Vivek, > I have an application where many of the leaf functions are > Hand-coded assembly language, because they use special IO instructions > That only the assembler knows about. These functions typically don't > Use any registers besides the incoming argument registers, IE they don't > Need to

> On Jan 10, 2017, at 2:31 AM, Chris Lattner <sabre at nondot.org> wrote: > > As others have pointed out, 37 does have some nice properties (by being prime), but we’ve also had it from the very early days. I wouldn’t say that it has been extremely well considered at all. > > -Chris Thanks for your reply. But I am not sure to understand the last sentence. Does it mean that

If this is posted elsewhere I cannot find it. I need to perform multiple integration where some of the variables are in the bounds of the other variables. I was trying to use R2Cuba function but cannot set the upper and lower bounds. My code so far is : int <- function(y){ u2 = y[1] z2 = y[2] u1 =y[3] z1 = y[4] ff <- u1*(z1-u1)*u2*(z2-u2)*exp(-0.027*(12-z2)) return(ff) }

Dear, I am looking at the Instructions defined in the XXXXInstrInfo.td where I can see a def record defined like below def ADD8rr : I8rr<0x0, (outs GR8:$dst), (ins GR8:$src, GR8:$src2), "add.b\t{$src2, $dst}", [(set GR8:$dst, (*add *GR8:$src, GR8:$src2)), (implicit SRW)]>; Now here I would like the to

Hi I have a little vector function that takes a vector A of strictly positive integers and outputs a matrix M each of whose columns is the vector, modified in a complicated combinatorical way. Now I want to generalize the function so that A can include zeroes. Given A, I want to strip out the zeroes, pass it to my function, and pad M with rows at positions corresponding to the zeroes

Hello, I'm trying to run a lagsarlm (maximum likelihood estimation of a spatial lag model) in the spdep library ; but R gives following error message: Error in solve.default(inf, tol = tol.solve) : system is computationally singular: reciprocal condition number = 4.20137e-12 I get the same message when I try to run de lagsarlm with a bigger data set (4333 regions). The command

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

Hello everyone I am trying to get one of my packages through R's QC. The package is clean for me under R-2.4.1, R-2.5.0, and R-devel, but Kurt gets > > * checking R code for possible problems ... WARNING > hypercube: no visible binding for global variable ?f? Function hypercube() [cut-&-pasted below] is intended to return an adjacency matrix for an n-dimensional

Hi [macOSX 10.4.6; R-2.3.0] I have encountered a difference in behaviour between R-2.2.1 and R-2.3.0 when performing a linear model. Transcript follows for R-2.3.0 (R-2.2.1 worked as expected). How to make R-2.3.0 perform as R-2.2.1 did? > dput(x) c(29.13, 29.88, 30.09, 29.99, 29.74, 29.64, 29.65, 29.7, 30.04, 29.89, 29.96, 29.65, 28.76, 28.41, 28.38, 29.55, 29.76, 29.75, 29.84,

Hi I have a little function that takes a vector v and an integer i. I want to manipulate v[-i] (to give v.new, say) and then put (unmanipulated) v[i] back into the appropriate place. For example, f <- function(v,i){ v.new <- v[-i]+10 return(c(v.new[1:(i-1)],v[i],v.new[i:length(v.new)])) } (my example is adding 10 to v[-i], but the real version is the solution of a complicated

A small number of columns in the data I need to work with are strings, the rest numbers. I'm using read_excel() from the readxl package to get the data ; right after it, the string columns are of type chr and the rest num. I'm tasked with finding out which columns are integers. From an advice, I tried saving the spreadsheet content into a CSV then loading that, which works like a charm ;

Hi How do I get the output from table() in matrix form? If I have R> table(c(1,1,1,1,2,20)) 1 2 20 4 1 1 I want [,1] [,2] [,3] [1,] 1 2 20 [2,] 4 1 1 The problem is that names(table) is a vector of characters and I need the numeric values. I am using R> rbind(as.integer(names(x)),x) I thought tabulate() might be better as it takes an