search for: itr

Displaying 20 results from an estimated 192 matches for "itr".

Did you mean: it
2009 May 25
2
Looping through java hashmap from ruby through rjb
Greetings. I am trying to list all keys in a java.util.HashMap field. The Java code to do this looks like: # Collection c = hMap.values(); # # //obtain an Iterator for Collection # Iterator itr = c.iterator(); # # //iterate through HashMap values iterator # while(itr.hasNext()) System.out.println(itr.next()); So, I took a stab at the ruby version: # I have a java hashmap called fields that was created using iText thusly reader = pdfreader.new( "pdf_file.pdf" ) @form = rea...
2008 Mar 31
2
[01/17]PATCH Add API for allocating dynamic TR resouce. V8
Hi Xiantao, I general I think the code in this patch is fine. I have a couple of nit-picking comments: > + if (target_mask&0x1) { The formatting here isn't quite what most of the kernel does. It would be better if you added spaces so it's a little easier to read, ie: if (target_mask & 0x1) { > + p = &__per_cpu_idtrs[cpu][0][0]; > + for (i = IA64_TR_ALLOC_BASE;
2008 Mar 31
2
[01/17]PATCH Add API for allocating dynamic TR resouce. V8
Hi Xiantao, I general I think the code in this patch is fine. I have a couple of nit-picking comments: > + if (target_mask&0x1) { The formatting here isn't quite what most of the kernel does. It would be better if you added spaces so it's a little easier to read, ie: if (target_mask & 0x1) { > + p = &__per_cpu_idtrs[cpu][0][0]; > + for (i = IA64_TR_ALLOC_BASE;
2012 Apr 23
1
[LLVMdev] Problem about the type of Function's arguement in llvm
...:get(Type::getDoubleTy(Context), argslist, false); Function *fun= cast<Function> ( module->getOrInsertFunction("fun", funType)); BasicBlock * block = BasicBlock::Create(Context, "mainBlock", fun); IRBuilder<> builder(block); Function::arg_iterator itr = fun->arg_begin(); builder.CreateLoad(itr); Value *result = ConstantFP::get(Type::getDoubleTy(getGlobalContext()), 1.0); builder.CreateRet(result); vector<GenericValue> args; ExecutionEngine *e = EngineBuilder(module).create(); outs()<<*module<<&quot...
2015 Mar 31
2
[LLVMdev] Cast to SCEVAddRecExpr
Sorry typo in test case, Please ignore previous mail. Consider below case: for (j=1; j < itr; j++) { - - - - for (i=1; i < itr; i++) { { temp= var[i << 1]; - - - - - } } In the above example, we are unable to get "SCEVAddRecExpr" for "var[i << 1]" Its "SCEVAddRecExpr" is computable in *Outer Loop* I ex...
2019 Aug 14
9
[9.0.0 Release] Release Candidate 2 is here
Hello everyone, 9.0.0-rc2 was tagged yesterday from the release_90 branch at r368683. In the Git monorepo it's available as the llvmorg-9.0.0-rc2 tag. Source code and docs are available at https://prereleases.llvm.org/9.0.0/#rc2 Binaries will be added as they become available. The tag went in roughly one week behind schedule (see "Upcoming Releases" at https://llvm.org), but
2014 Nov 10
2
[LLVMdev] External names for LTO in gold plugin
...inary). In the past, I had a tiny patch that I hadn't submitted to LLVM: it was something like: Index: Internalize.cpp =================================================================== --- Internalize.cpp (revision 221403) +++ Internalize.cpp (working copy) @@ -87,6 +87,7 @@ itr != ExportList.end(); itr++) { ExternalNames.insert(*itr); } + ExternalNames.insert(APIList.begin(), APIList.end()); } This adds the contents of the -internalize-public-api-list flag to the set of external names for the internalize pass, even when there are already some names being passe...
2019 Jul 29
10
[9.0.0 Release] Release Candidate 1 is here
Hi everyone, 9.0.0-rc1 was just tagged from the release_90 branch at r367217 (tagged as llvmorg-9.0.0-rc1 in the Git monorepo). Source code and docs are available at https://prereleases.llvm.org/9.0.0/#rc1 Binaries will be added as they become available. Please file bug reports for any issues you find as blockers of https://llvm.org/PR42474 Release testers: please start your engines, run the
2015 Feb 26
6
[LLVMdev] RFC: Loop versioning for LICM
...al loop & versioned loop as a branch target of runtime check result. 5) Call LICM on aggressive alias versioned of loop(For now LICM is scheduled later and not directly called from LoopVersioning pass). Consider following test: 1 int foo(int * var1, int * var2, int * var3, unsigned itr) { 2 unsigned i = 0, j = 0; 3 for(; i < itr; i++) { 4 for(; j < itr; j++) { 5 var1[j] = itr + i; 6 var3[i] = var1[j] + var3[i]; 7 } 8 } 9 } At line #6 store to var3 can be moved out by LICM(promoteLoopAccessesToScalars...
2019 Sep 13
4
[9.0.0 Release] Release Candidate 5 is here
Hello everyone, 9.0.0-rc5 was just tagged from the release_90 branch at r371837. In the Git monorepo, it's tagged as llvmorg-9.0.0-rc5. Source code and docs are available at https://prereleases.llvm.org/9.0.0/#rc5 Binaries will be added as they become available. There is only a single change from rc4 to rc5. Once more, the hope is that this will be the last release candidate and that we can
2019 Dec 14
5
LLVM 9.0.1-rc3 has been tagged
Hi, I've just tagged LLVM 9.0.1-rc3. Testers can begin testing and uploading binaries. This will be the last release candidate unless there is a major problem. I'm planning to tag the final release on Dec 19. -Tom
2019 Sep 10
15
[9.0.0 Release] Release Candidate 4 is here
Hello again, 9.0.0-rc4 was just tagged from the release_90 branch at r371490. In the Git monorepo, it's tagged as llvmorg-9.0.0-rc4. Source code and docs are available at https://prereleases.llvm.org/9.0.0/#rc4 Binaries will be added as they become available. There are not a lot of changes from rc3 to rc4, and there are again no open release blockers, so I'm hoping this will be the last
2012 Dec 19
2
create stratified splits
Hi, I have a vector like: r <- runif(100) Now I would like to split r into 10 pieces (each with 10 elements) ? but the 'pieces' should be roughly similar with regard to mean and sd. what is an efficient way to do this in R? thanks!
2011 Oct 27
2
help with parallel processing code
...uning the combinations for (len in 1:dim(pc3)[1]) { prs = pc3[len,] ## new data mat samples <- mols[prs] mat <-data [,c(samples,'Self_T1D')] mat<-mat[complete.cases(mat),] ##### LDA ######### rows<- c(1:nrow(mat)) scores <- c() labels <-c() for (itr in 1:1000) { train <- sample(rows, length(rows)-1) label =0 ; if (mat$Self_T1D[-train] == "N") label = 1 #need the value for this line, should it be 'N' or 'Y' z <- lda(Self_T1D ~ ., mat, subset = train) score = predict(z, mat[-train, ])$pos[1] scores <- c(...
2019 Nov 23
5
LLVM 9.0.1-rc1 Release has been tagged
Hi, I've tagged the LLVM 9.0.1-rc1 release. Testers can begin testing and upload binaries. I've also updated the test-release.sh script to pull from GitHub instead of SVN, if you run into any issues with the new script, let me know. -Tom
2019 Dec 20
7
LLVM 9.0.1-final has been tagged
Hi, I've just tagged the 9.0.1-final release. Testers can begin uploading binaries. -Tom
2019 Aug 30
9
[9.0.0 Release] Release Candidate 3 is here
Hello everyone, 9.0.0-rc3 was tagged today from the release_90 branch at r370450. In the Git monorepo, it's tagged as llvmorg-9.0.0-rc3. Source code and docs are available at https://prereleases.llvm.org/9.0.0/#rc3 Binaries will be added as they become available. There are currently no open release blockers, which means if nothing new comes up, the final release could ship soon and this is
2019 Dec 07
6
LLVM 9.0.1-rc2 has been tagged
Hi, I've tagged LLVM 9.0.1-rc2. Testers can begin testing and uploading binaries. If all goes well, this will be the last -rc. -Tom
2012 Apr 22
0
[LLVMdev] Problem about the type of Function's arguement in llvm
hi On Sun, Apr 22, 2012 at 8:36 PM, Jianfei Hu <hujianfei258 at gmail.com> wrote: > in the  tutorial of official llvm doc, chapter 3, it deals with arguement of > function as follow: > > for (Function::arg_iterator AI = F->arg_begin(); Idx != Args.size(); >        ++AI, ++Idx) { >     AI->setName(Args[Idx]); > >     // NamedValues is map<string, Value*>
2013 Oct 31
0
[LLVMdev] Get Different Result for ScalarEvolution through ModulePass and FunctionPass
...t;, and a FunctionPass, "FP". Then I use this pass to print the scalar evolution information in two ways: 1.employ FP to process function directly 2.call MP, iterate on functions, then call FP on them sample code is that: *MP:* *bool runOnModule(Module &M)* *{* *for(Module::iterator itr = M.begin(); itr != M.end(); itr++)* *{* * FP &t = getAnalysis< FP >(*itr);* * (t.SE)->print(errs()); // SE represent for scalar evolution pass.* *}* *}* *FP:* *bool runOnFunction(Function &F)* *{* *SE = &getAnalysis<ScalarEvolution>();* *SE->print(...