search for: i4

Hi friends, Please can anyone help me with an easier solution of doing the below mentioned work. Suppose i have a dataset like this:--- i1 i2 i3 i4 i5 1 7 13 1 2 2 8 14 2 2 3 9 15 3 3 4 10 16 4 4 5 11 17 5 5 6 12 18 6 7 *i1,i2,i3,i4,i5 are my items.I am able to find all possible pairs i.e Say this dataframe is "item_pairs" **i1,i2 **i1,i3 **i1,i4 i1,i5 **i2,i1 **i2,i3 i2,i4 i2,i5 **i3,i1 **i3,i2 **i3,i4 **i3,i5...

I am trying to multiply a 3D array of 4x4x4 by the 4 3D arrays of a 4D array with dimensions 4x4x4x4 (the last dimension being the one that I want to split by). (4x4x4 array) > hiaAry , , a1 i1 i2 i3 i4 h1 9.5936098 6.001040 0.08772 0.3138600 h2 1.2003500 1.454570 2.79248 0.0000000 h3 0.1346500 0.201220 0.39256 0.5464000 h4 0.0109000 0.012270 0.16417 0.2766900 , , a2 i1 i2 i3 i4 h1 195.08275 74.23508453 39.23165 14.89689 h2 1.80127 7.41649055 6.97972 2.77784 h...

...x matrix t1<-c(1:15) t2<-c(1:5)%x%matrix(1,3,1) t3<-matrix(1,3,1)%x%c(1:5) t4<-c(1:3)%x%matrix(1,5,1) comb<-cbind(t1,t2,t3,t4) nu<-rchisq(15,4) gam<-matrix(rchisq(75,df=5),15,5) undint<-function(u){ prob<-function(i) { i1<-comb[i,1] i2<-comb[i,2] i3<-comb[i,3] i4<-comb[i,4] val1<-gam[((i3-1)*2+1):(i3*2),i4] vc1<-matrix(12,length(val1),1)-matrix(u,length(val1),1)-val1 distr1<-prod(pchisq(vc1,df=2)) p10<-distr1*1/(exp(-nu[i1])*(1+gam[i2,i4]))*(1-plogis((u+log(gam[i3,i4])-log(1+gam[i2,i4])),0,1)) p10 } val<-c(1:15) q<-sapply(val,prob) }

...epresentation in LLVM is from http://llvm.org/docs/LangRef.html#t_integer and I could use some things cleared up. First, I guess that smaller integer sizes, say, i1 (boolean) are stuffed into a full word size for the cpu it is compiled on (so 8bits, or 32 bits or whatever). What if someone made an i4 and compiled it on 32/64 bit windows/nix/bsd on a standard x86 or x64 system, and they set the value to 15 (the max size of an unsigned i4), if it is still rounded up to the next nearest size when compiled (i8 or i32 or what-not), what if when that value has 15, but a 1 was added to it, it will be...

...5% from an array. I can do it in two steps but when I try it in one, it fails. Is there something simple missing from my syntax or are there other simple elegant way to accomplish this? Thanks J > i <-1:20 > i2 <- i[i<quantile(i,.75)] > i3 <- i[i>quantile(i,.25)] > i4 <- i[quantile(i,.25)< i > quantile(i,.75)] Error: unexpected '>' in "i4 <- i[quantile(i,.25)< i >" =============================== Dr. Jim Maas University of East Anglia

...n.type))->common.code) == VOID_TYPE) || isa<VectorType>(ConvertType(((exp)->common.type))) || Result->getType() == ConvertType(((exp)->common.type))) && "Value has wrong type!"' failed. At this point Result is "i8 1". ConvertType(TREE_TYPE(exp)) is i4. And the code generated for the basic block so far is: entry: %retval = alloca i32 ; <i32*> [#uses=0] %0 = alloca i4 ; <i4*> [#uses=1] %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] %...

Hi Renato, First, I appreciate your answer again. :) >> %Char = type { c3, c4, c3, c2 } >> %Short = type { s3, s4, s3, s2 } >> %Int = type { i3, i4, i3, i2 } > See, i is not for int (the C data type) but for every integer type on > any language/platform combination. Normally, booleans are i1 and char > i8, in ARM short is 16 and int is 32, and all of them use the 'i' > notation. I think you misunderstood our type notation....

Hi, > First, I guess that smaller integer sizes, say, i1 (boolean) are > stuffed into a full word size for the cpu it is compiled on (so 8bits, > or 32 bits or whatever). on x86-32, an i1 gets placed in an 8 bit register. > What if someone made an i4 and compiled it on 32/64 bit > windows/nix/bsd on a standard x86 or x64 system, and they set the > value to 15 (the max size of an unsigned i4), if it is still rounded > up to the next nearest size when compiled (i8 or i32 or what-not), The extra bits typically contain rubbish, but you ca...

In 1.4.43 I would see things from "core show channels" like DAHDI/18/xxxxx for line 18 in Asterisk 11 its DAHDI/i4/xxxx How do I get the line number back? Jerry

Hello, I have a problem with some variables in 1.8.6.0. I set on extension the following lines: exten => h, n, Set (CDR (LLP) = $ {CHANNEL (rtpqos, audio, local_lostpackets)}) ; lost packets by local end ** exten => h, n, Set (CDR (PCR) = $ {CHANNEL (rtpqos, audio, remote_lostpackets)}) ; lost packets by remote end exten => h, n, Set (CDR (ljitt) = $ {CHANNEL (rtpqos,

...et independent bitcode as following. 1 ; ModuleID = './temp2.c' 2 target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64" 3 target triple = "armv5-none-linux-gnueabi" 4 5 %0 = type { i3, i4, i3, i2 } 6 %struct.test = type <{ i3, i4, i3, i2 }> 7 8 @vm = global %0 { i3 1, i4 2, i3 3, i2 1 } ; <%0*> [#uses=1] 9 10 define arm_aapcscc i32 @main() nounwind { 11 entry: 12 %retval = alloca i32 ; <i32*> [#uses=1] 13 %a = alloc...

On 08/16/2013 02:42 AM, Star Tan wrote: > At 2013-08-16 12:44:02,"Tobias Grosser" <tobias at grosser.es> wrote: >> Hi, >> >> I tried to reproduce your findings, but could not do so. > > > Sorry, I did not put all code in my previous email because the code seems a little too long and complicated. > You can refer to the detailed C code and LLVM IR

...har b:4; char c:3; char d:2; }; struct testShort { short a:3; short b:4; short c:3; short d:2; }; struct testInt { int a:3; int b:4; int c:3; int d:2; }; In future, our IRs will be represented as following: %Char = type { c3, c4, c3, c2 } %Short = type { s3, s4, s3, s2 } %Int = type { i3, i4, i3, i2 } This was just concept and I didn't implement it yet. I usually try to modify original llvm system as less as possible, so I prefer adding new types to modifying original llvm types. I will report your opinion to my team members and we will discuss that. Thanks for your answer, Jin...

Hi Jin Gu Kang > 5 %0 = type { i3, i4, i3, i2 } each of the above struct fields occupies 1 byte. If you were hoping that an i3 field would occupy only 3 bits then I am sorry, it doesn't work that way. Ciao, Duncan.

Hi, Suppose I have a function define void @foo(i4 %a) { %ptr = alloca i4 store i4 %a, i4* %ptr ... } but in the following the function is used by a wrong signature, %f = bitcast void(i4)* @foo to void(i8)* call void %f (i8 17) then what is the value of %a when @foo is called, will the 255 be truncated into a value of i4, for example 1, li...

...memory error: cannot allocate vector of size 360.1 Mb. To overcome this, I am exploring option of using data.table package. But its not helping in term of memory as merge in data.table is fast but not memory efficient. Similar error is coming. My inputs are inp1 V1 V2 1 a i1 2 a i2 3 a i3 4 a i4 5 b i5 6 c i6 inp2 V1 V2 1 a x 2 b x 3 a y 4 c z I want merge(x=inp1, y=inp2, by.x="V1", by.y="V1") so the output V1 V2.x V2.y 1 a i1 x 2 a i1 y 3 a i2 x 4 a i2 y 5 a i3 x 6 a i3 y 7 a i4 x 8 a i4 y 9 b...

...am converting it to various shape. Hi Jin, No worries. I'm interested in the outcome, so I'm playing the devil's advocate to make sure your proposal is consistent with the rest of LLVM. > %Char = type { c3, c4, c3, c2 } > %Short = type { s3, s4, s3, s2 } > %Int = type { i3, i4, i3, i2 } Ah, this is precisely what the IR cannot do. :( See, i is not for int (the C data type) but for every integer type on any language/platform combination. Normally, booleans are i1 and char i8, in ARM short is 16 and int is 32, and all of them use the 'i' notation. So, i3, i4, i5...

...for.end32' in function 'main': Context: [cond.reload] -> { : cond.reload >= -2147483648 and cond.reload <= 2147483647 } p0: %cond.reload Statements { Stmt_for_body16 Domain := [cond.reload] -> { Stmt_for_body16[i0, i1, i2, i3, i4, i5] : i0 >= 0 and i0 <= -1 + cond.reload and i1 >= 0 and i1 <= -1 + cond.reload and i2 >= 0 and i2 <= -1 + cond.reload and i3 >= 0 and i3 <= -1 + cond.reload and i4 >= 0 and i4 <= -1 + cond.reload and i5 >= 0 and i5 <= -1 + cond.reload and cond.reload >= 1 };...

...rray((1/2)^n , c(rep(2,n))) then for any i not equal to j, and 1<=i,j<=n, B<-apply(a,c(i,j),sum) now B is a 2 by 2 matrix, I also define another costant 2 by 2 matrix G, How can I change the values of each elements of array A, according the rule that, for example, i=3,j=5, A[i1,i2,m,i4,l]<-A[i1,i2,m,i4,l]*G[m,l]/B[m,l] , where m,l=1,2 and i1,i2,i4=1,2 I can control this given any i and j, however, I must do the iteration for i in 1:(n-1) { for j in (i,n) {B<-apply(a,c(i,j),sum) here change the value of every elements of A according to my rule...

...zeroinitializer %sumsign = icmp slt <4 x i32> %tmp2, zeroinitializer %signsequal = icmp eq <4 x i1> %tmpsign, %tmp1sign %summismatch = icmp ne <4 x i1> %sumsign, %tmpsign %overflow = and <4 x i1> %signsequal, %summismatch %tmp5 = bitcast <4 x i1> %overflow to i4 %tmp6 = icmp ne i4 %tmp5, 0 br i1 %tmp6, label %OverflowFail, label %OverflowOk OverflowFail: ; preds = %Entry tail call fastcc void @panic() unreachable OverflowOk: ; preds = %Entry store <4 x i32> %tmp2, &...