PageRenderTime 4550ms queryTime 636ms sortTime 983ms getByIdsTime 83ms findMatchingLines 24ms

100+ results results for 'i++' (4550 ms)

Not the results you expected?
CorrectionMarkerResolutionGenerator.java https://gitlab.com/essere.lab.public/qualitas.class-corpus | Java | 418 lines
                    
160			Hashtable<ICompilationUnit, List<IProblemLocation>> problemLocations= new Hashtable<ICompilationUnit, List<IProblemLocation>>();
                    
161			for (int i= 0; i < markers.length; i++) {
                    
162				IMarker marker= markers[i];
                    
185				result[i]= new MultiFixTarget(cu, locations.toArray(new IProblemLocation[locations.size()]));
                    
186				i++;
                    
187			}
                    
235
                    
236					for (int i= 0, size= fileMarkers.size(); i < size; i++) {
                    
237						IMarker marker= fileMarkers.get(i);
                    
267
                    
268			for (int i= 0; i < markers.length; i++) {
                    
269				IMarker marker= markers[i];
                    
346					IMarkerResolution[] resolutions= new IMarkerResolution[nProposals];
                    
347					for (int i= 0; i < nProposals; i++) {
                    
348						resolutions[i]= new CorrectionMarkerResolution(context.getCompilationUnit(), location.getOffset(), location.getLength(), proposals.get(i), marker);
                    
                
TopBarView.java https://gitlab.com/essere.lab.public/qualitas.class-corpus | Java | 433 lines
                    
119					Object[] views = topbarViews.toArray();
                    
120					for (int i = 0; i < views.length; i++) {
                    
121						try {
                    
151					topbarViews.clear();
                    
152					for (int i = 0; i < views.length; i++) {
                    
153						UISWTViewCore view = (UISWTViewCore) views[i];
                    
405		Control[] children = parent.getChildren();
                    
406		for (int i = 0; i < children.length; i++) {
                    
407			Control control = children[i];
                    
                
cvfacedetection.cpp https://gitlab.com/brian0218/rk3188_r-box_android4.2.2_sdk | C++ | 486 lines
                    
117    // find contours
                    
118    for (int l = iMinLevel, i = 0; l < iMaxLevel; l += iStep, i++)
                    
119    {
                    
309    
                    
310    for (int i = 0; i < m_seqRects->total; i++)
                    
311    {
                    
387
                    
388    for (int i = 0; i < m_seqRects->total; i++)
                    
389    {
                    
                
EC3TrackImpl.java https://gitlab.com/brian0218/rk3188_r-box_android4.2.2_sdk | Java | 436 lines
                    
314                    }
                    
315                    for (int i = 0; i < (mixdeflen + 2); i++) {
                    
316                        brb.readBits(8);
                    
332                        } else {
                    
333                            for (int i = 0; i < numberOfBlocksPerSyncFrame; i++) {
                    
334                                if (1 == brb.readBits(1)) {
                    
                
inode.c https://bitbucket.org/Neos/tf101-kernel2.git | C | 586 lines
                    
93	xor = ptr[0];
                    
94	for (i = 1; i < OMFS_XOR_COUNT; i++)
                    
95		xor ^= ptr[i];
                    
148	/* if mirroring writes, copy to next fsblock */
                    
149	for (i = 1; i < sbi->s_mirrors; i++) {
                    
150		bh2 = omfs_bread(inode->i_sb, inode->i_ino + i);
                    
                
mssql_driver.php https://gitlab.com/jLKisni/furandpaw-frontend | PHP | 518 lines
                    
336		$retval = array();
                    
337		for ($i = 0, $c = count($query); $i < $c; $i++)
                    
338		{
                    
465					? '("[^\"]+")' : '(\[[^\]]+\])';
                    
466				for ($i = 0, $c = count($this->qb_select); $i < $c; $i++)
                    
467				{
                    
                
BlockChain.java https://gitlab.com/Ltaimao/bitherj | Java | 356 lines
                    
88
                    
89            for (int i = 0; b != null && i < step; i++) {
                    
90                b = AbstractDb.blockProvider.getMainChainBlock(b.getBlockPrev());
                    
129        }
                    
130        for (int i = 0; i < blocks.size(); i++) {
                    
131            Block block = blocks.get(i);
                    
191//            Block b = block;
                    
192//            for (int i = 0; b != null && i < BitherjSettings.BLOCK_DIFFICULTY_INTERVAL; i++) {
                    
193//                b = DbHelper.blockProvider.getBlock(b.getBlockPrev());
                    
261                    Block cursor = first;
                    
262                    for (int i = 0; i < BitherjSettings.BLOCK_DIFFICULTY_INTERVAL - block.getBlockNo() + first.getBlockNo(); i++) {
                    
263                        if (cursor == null) {
                    
                
ecmult_impl.h https://gitlab.com/akomba/ether-bot-wallet | C Header | 389 lines
                    
58    zr[0] = d.z;
                    
59    for (i = 1; i < n; i++) {
                    
60        secp256k1_gej_add_ge_var(&prej[i], &prej[i-1], &d_ge, &zr[i]);
                    
105    /* Convert them to compact storage form. */
                    
106    for (i = 0; i < n; i++) {
                    
107        secp256k1_ge_to_storage(&pre[i], &prea[i]);
                    
170        g_128j = gj;
                    
171        for (i = 0; i < 128; i++) {
                    
172            secp256k1_gej_double_var(&g_128j, &g_128j, NULL);
                    
326#ifdef USE_ENDOMORPHISM
                    
327    for (i = 0; i < ECMULT_TABLE_SIZE(WINDOW_A); i++) {
                    
328        secp256k1_ge_mul_lambda(&pre_a_lam[i], &pre_a[i]);
                    
                
jazzdma.c https://gitlab.com/envieidoc/advancedtomato2 | C | 566 lines
                    
52
                    
53	for (i = 0; i < VDMA_PGTBL_ENTRIES; i++) {
                    
54		pgtbl[i].frame = paddr;
                    
141
                    
142	for (i = first; i < last; i++) {
                    
143		entry[i].frame = frame;
                    
158		printk("LADDR: ");
                    
159		for (i = first; i < last; i++)
                    
160			printk("%08x ", i << 12);
                    
161		printk("\nPADDR: ");
                    
162		for (i = first; i < last; i++)
                    
163			printk("%08x ", entry[i].frame);
                    
164		printk("\nOWNER: ");
                    
165		for (i = first; i < last; i++)
                    
166			printk("%08x ", entry[i].owner);
                    
                
spm-v2.c https://gitlab.com/jhalayashraj/nkernel | C | 542 lines
                    
236
                    
237	for (i = 0; i < num_spm_entry; i++) {
                    
238		__raw_writel(dev->reg_seq_entry_shadow[i],
                    
261
                    
262		for (i = (*offset % 4) ; i < 4; i++) {
                    
263			last_cmd = *(cmd++);
                    
293		int i;
                    
294		for (i = 0; i < MSM_SPM_REG_NR; i++)
                    
295			pr_info("%s: reg %02x = 0x%08x\n", __func__,
                    
476
                    
477	for (i = 0; i < MSM_SPM_REG_NR_INITIALIZE; i++)
                    
478		msm_spm_drv_flush_shadow(dev, i);
                    
503
                    
504	for (i = 0; i < ARRAY_SIZE(saw2_info); i++)
                    
505		if (dev->major == saw2_info[i].major &&
                    
                
options_user_settings.php https://gitlab.com/alexprowars/bitrix | PHP | 364 lines
                    
41$deactivateDays[] = GetMessage("SEC_OTP_NO_DAYS");
                    
42for($i=1; $i <= 10; $i++)
                    
43{
                    
                
color.c https://bitbucket.org/petsc/petsc.git | C | 375 lines
                    
38  PetscFunctionBegin;
                    
39  for (i=0; i<m; i++) c = PetscMax(c,ia[i+1]-ia[i]);
                    
40  *minc = c;
                    
97    ISColoringValue *s = (ISColoringValue*) coloring;
                    
98    for (i=0; i<n; i++) {
                    
99      s[i] = (ISColoringValue) (coloring[i]-1);
                    
114    ierr = PetscMalloc1(N_loc+1,&colors_loc);CHKERRQ(ierr);
                    
115    for (i=rstart; i<rend; i++) {
                    
116      colors_loc[i-rstart] = iscoloring_seq->colors[i];
                    
210    ISColoringValue *s = (ISColoringValue*) coloring;
                    
211    for (i=0; i<n; i++) s[i] = (ISColoringValue) (coloring[i]-1);
                    
212    ierr = MatColoringPatch(mat_seq,ncolors,n,s,iscoloring);CHKERRQ(ierr);
                    
225    ierr = PetscMalloc1(N_loc+1,&colors_loc);CHKERRQ(ierr);
                    
226    for (i=rstart; i<rend; i++) colors_loc[i-rstart] = iscoloring_seq->colors[i];
                    
227
                    
                
Util.java https://github.com/bibulous/SkyrackJbill2.2.git | Java | 346 lines
                    
228        StringBuffer hexData = new StringBuffer();
                    
229        for (int i=0; i < readBytes; i++) {
                    
230           hexData.append(hexLookupTable[0xff & string[i]]);
                    
236        byte retValue[] = new byte[string.length()/2];
                    
237        for (int i=0; i < retValue.length; i++) {
                    
238            String digit = string.substring(i * 2, (i *2) + 2);
                    
268        String field = "";
                    
269        for (int i = 0; i < line.length(); i++) {
                    
270            if (line.charAt(i) == '\"') {
                    
272                    field += '\"';
                    
273                    i++; // skip over quote escape
                    
274                } else {
                    
319        StringBuilder builder = new StringBuilder(escapeStringForCsvFormat(values.get(0), fieldSeparator));
                    
320        for (int i = 1; i < values.size(); i++) {
                    
321            //add separator for 'not last' element
                    
                
FontMetrics.java https://github.com/penberg/classpath.git | Java | 448 lines
                    
239    int endOffset = offset + len;
                    
240    for (int i = offset; i < endOffset; i++)
                    
241      total_width += charWidth(buf[i]);
                    
256    int total_width = 0;
                    
257    for (int i = offset; i < len; i++)
                    
258      total_width = charWidth((char) buf[i]);
                    
270    int[] result = new int[256];
                    
271    for (char i = 0; i < 256; i++)
                    
272      result[i] = charWidth(i);
                    
                
uap_txrx.c https://gitlab.com/openbar/rpi-linux | C | 437 lines
                    
79
                    
80	for (i = 0; i < MAX_NUM_TID; i++, priv->del_list_idx++) {
                    
81		if (priv->del_list_idx == MAX_NUM_TID)
                    
                
pci_irq.c https://gitlab.com/openbar/rpi-linux | C | 513 lines
                    
129
                    
130	for (i = 0; i < ARRAY_SIZE(prt_quirks); i++) {
                    
131		quirk = &prt_quirks[i];
                    
                
thunk.c https://gitlab.com/paelzer/qemu | C | 481 lines
                    
89
                    
90    for (i = 0; i < ARRAY_SIZE(se->field_offsets); i++) {
                    
91        offset = 0;
                    
230            s = src;
                    
231            for(i = 0;i < array_length; i++) {
                    
232                thunk_convert(d, s, type_ptr, to_host);
                    
259                s = src;
                    
260                for(i = 0;i < se->nb_fields; i++) {
                    
261                    field_types = thunk_convert(d + dst_offsets[i],
                    
381
                    
382            for (i = 0; i < array_length; i++) {
                    
383                if (i > 0 && !is_string) {
                    
417                qemu_log("{");
                    
418                for (i = 0; i < se->nb_fields; i++) {
                    
419                    if (i > 0) {
                    
                
test-branch-combine.cc https://gitlab.com/MichelZuniga/node | C++ | 462 lines
                    
362TEST(BranchCombineInt32CmpAllInputShapes_materialized) {
                    
363  for (size_t i = 0; i < arraysize(int32cmp_opcodes); i++) {
                    
364    CmpMaterializeBoolGen gen(int32cmp_opcodes[i], false);
                    
371TEST(BranchCombineInt32CmpAllInputShapes_inverted_materialized) {
                    
372  for (size_t i = 0; i < arraysize(int32cmp_opcodes); i++) {
                    
373    CmpMaterializeBoolGen gen(int32cmp_opcodes[i], true);
                    
380TEST(BranchCombineInt32CmpAllInputShapes_branch_true) {
                    
381  for (int i = 0; i < static_cast<int>(arraysize(int32cmp_opcodes)); i++) {
                    
382    CmpBranchGen gen(int32cmp_opcodes[i], false, false, 995 + i, -1011 - i);
                    
389TEST(BranchCombineInt32CmpAllInputShapes_branch_false) {
                    
390  for (int i = 0; i < static_cast<int>(arraysize(int32cmp_opcodes)); i++) {
                    
391    CmpBranchGen gen(int32cmp_opcodes[i], false, true, 795 + i, -2011 - i);
                    
398TEST(BranchCombineInt32CmpAllInputShapes_inverse_branch_true) {
                    
399  for (int i = 0; i < static_cast<int>(arraysize(int32cmp_opcodes)); i++) {
                    
400    CmpBranchGen gen(int32cmp_opcodes[i], true, false, 695 + i, -3011 - i);
                    
                
shellSurfaces.C https://gitlab.com/johnvarv/OpenFOAM-3.0.x | C | 464 lines
                    
271                    candidateDistSqr[candidateI] = sqr(distances[levelI]);
                    
272                    candidateI++;
                    
273                    break;
                    
325                candidateMap[candidateI] = pointI;
                    
326                candidateI++;
                    
327            }
                    
378        {
                    
379            shellI++;
                    
380        }
                    
409
                    
410            shellI++;
                    
411        }
                    
                
polyMeshIO.C https://gitlab.com/johnvarv/OpenFOAM-3.0.x | C | 511 lines
                    
310
                    
311        for (label czI = oldSize; czI < newPointZones.size(); czI++)
                    
312        {
                    
351
                    
352        for (label fzI = oldSize; fzI < newFaceZones.size(); fzI++)
                    
353        {
                    
388
                    
389        for (label czI = oldSize; czI < newCellZones.size(); czI++)
                    
390        {
                    
                
qcommandline.cpp https://gitlab.com/atkrad/phantomjs | C++ | 534 lines
                    
104  d->args.clear();
                    
105  for (int i = 0; i < argc; i++)
                    
106    d->args.append(QLatin1String(argv[i]));
                    
297    else if (forward)
                    
298      i++;
                    
299  }
                    
322  foreach (QString key, switchs) {
                    
323    for (int i = 0; i < switchsFound[key]; i++) {
                    
324      if (d->help && key == helpEntry.longName)
                    
                
jl2005bcd.c https://gitlab.com/kush/linux | C | 531 lines
                    
149			return retval;
                    
150		i++;
                    
151	}
                    
187	/* Now actually get the ID string */
                    
188	for (i = 0; i < 6; i++) {
                    
189		retval = jl2005c_read_reg(gspca_dev, regs_to_read[i]);
                    
217
                    
218	for (i = 0; i < ARRAY_SIZE(instruction); i++) {
                    
219		msleep(60);
                    
240
                    
241	for (i = 0; i < ARRAY_SIZE(instruction); i++) {
                    
242		msleep(60);
                    
263
                    
264	for (i = 0; i < ARRAY_SIZE(instruction); i++) {
                    
265		msleep(60);
                    
                
decode_test.go https://gitlab.com/rpi-romlinch/drone | Go | 648 lines
                    
631//	var err error
                    
632//	for i := 0; i < c.N; i++ {
                    
633//		var v map[string]interface{}
                    
644//	c.ResetTimer()
                    
645//	for i := 0; i < c.N; i++ {
                    
646//		yaml.Marshal(&v)
                    
                
d10v_sim.h https://bitbucket.org/codefirex/toolchain_gdb.git | C Header | 487 lines
                    
136      int i; \
                    
137      for (i = 0; i < SLOT_NR; i++) \
                    
138	{ \
                    
165      int i; \
                    
166      for (i = 0; i < SLOT_NR; i++) \
                    
167	{ \
                    
                
menu.php https://gitlab.com/edgarze188/sunrise | PHP | 269 lines
                    
58
                    
59		$submenu['edit.php'][$i++] = array( esc_attr( $tax->labels->menu_name ), $tax->cap->manage_terms, 'edit-tags.php?taxonomy=' . $tax->name );
                    
60	}
                    
70
                    
71		$submenu['upload.php'][$i++] = array( esc_attr( $tax->labels->menu_name ), $tax->cap->manage_terms, 'edit-tags.php?taxonomy=' . $tax->name . '&amp;post_type=attachment' );
                    
72	}
                    
89
                    
90		$submenu['edit.php?post_type=page'][$i++] = array( esc_attr( $tax->labels->menu_name ), $tax->cap->manage_terms, 'edit-tags.php?taxonomy=' . $tax->name . '&amp;post_type=page' );
                    
91	}
                    
140
                    
141		$submenu["edit.php?post_type=$ptype"][$i++] = array( esc_attr( $tax->labels->menu_name ), $tax->cap->manage_terms, "edit-tags.php?taxonomy=$tax->name&amp;post_type=$ptype" );
                    
142	}
                    
                
LexErrorList.cxx https://gitlab.com/cjeight/tortoisegit | C++ | 394 lines
                    
152		} state = stInitial;
                    
153		for (Sci_PositionU i = 0; i < lengthLine; i++) {
                    
154			char ch = lineBuffer[i];
                    
374
                    
375	for (Sci_PositionU i = startPos; i < startPos + length; i++) {
                    
376		lineBuffer[linePos++] = styler[i];
                    
                
SyncAdapter.java https://gitlab.com/kotaprabhakar/mutualapp | Java | 295 lines
                    
123            Log.d("SyncAdapter", "Friends: " + inputArray.toString());
                    
124            for(int i = 0; i < inputArray.length(); i++){
                    
125                JSONObject tempJSON = inputArray.getJSONObject(i);
                    
165
                    
166            for(int i = 0; i < inputArray.length(); i++){
                    
167                JSONObject tempJSON = inputArray.getJSONObject(i);
                    
208
                    
209            for(int i = 0; i < inputArray.length(); i++){
                    
210                JSONObject tempJSON = inputArray.getJSONObject(i);
                    
252
                    
253            for(int i = 0; i < inputArray.length(); i++){
                    
254                JSONObject tempJSON = inputArray.getJSONObject(i);
                    
                
mode-python.js https://bitbucket.org/berlotto/asciiblog.git | JavaScript | 397 lines
                    
60
                    
61        for (var i=startRow; i<= endRow; i++) {
                    
62            if (!re.test(doc.getLine(i))) {
                    
69            var deleteRange = new Range(0, 0, 0, 0);
                    
70            for (var i=startRow; i<= endRow; i++)
                    
71            {
                    
                
proc.c https://bitbucket.org/thelearninglabs/uclinux-distro-tll-public.git | C | 455 lines
                    
131  int i;
                    
132  for (i = 0; i < sensors_proc_chips_count; i++)
                    
133    if (sensors_match_chip(name, sensors_proc_chips[i].name))
                    
                
miscdtfm.cpp https://bitbucket.org/kennethendfinger/chromium.git | C++ | 378 lines
                    
119    logln("-------\t-------\t-------");
                    
120    for (int i = 0; i < 14/*dstring.length*/; i++)
                    
121    {
                    
                
X86CallingConv.cpp https://gitlab.com/williamwp/riscv-rv32x-llvm | C++ | 334 lines
                    
49  // Allocating the available registers.
                    
50  for (unsigned I = 0; I < RequiredGprsUponSplit; I++) {
                    
51
                    
                
selector.js https://gitlab.com/courses-online/Angular2 | JavaScript | 339 lines
                    
143        }
                    
144        for (var i = 0; i < cssSelectors.length; i++) {
                    
145            this._addSelectable(cssSelectors[i], callbackCtxt, listContext);
                    
168        if (classNames) {
                    
169            for (var i = 0; i < classNames.length; i++) {
                    
170                var isTerminal = attrs.length === 0 && i === classNames.length - 1;
                    
233        var attrs = cssSelector.attrs;
                    
234        for (var i = 0; i < this._listContexts.length; i++) {
                    
235            this._listContexts[i].alreadyMatched = false;
                    
240        if (classNames) {
                    
241            for (var i = 0; i < classNames.length; i++) {
                    
242                var className = classNames[i];
                    
285        var result = false;
                    
286        for (var i = 0; i < selectables.length; i++) {
                    
287            selectable = selectables[i];
                    
                
mmc-twl4030.c https://github.com/kingklick/kk-incredible-kernel.git | C | 524 lines
                    
54
                    
55	for (i = 0; i < ARRAY_SIZE(hsmmc); i++) {
                    
56		struct omap_mmc_platform_data *mmc;
                    
105	/* require at least main regulator */
                    
106	for (i = 0; i < ARRAY_SIZE(hsmmc); i++) {
                    
107		if (hsmmc[i].name == mmc->slots[0].name) {
                    
171	gpio_free(mmc->slots[0].switch_pin);
                    
172	for(i = 0; i < ARRAY_SIZE(hsmmc); i++) {
                    
173		regulator_put(hsmmc[i].vcc);
                    
287
                    
288	for (i = 1; i < ARRAY_SIZE(hsmmc); i++) {
                    
289		if (mmc == hsmmc[i].mmc) {
                    
358
                    
359	for (i = 1; i < ARRAY_SIZE(hsmmc); i++) {
                    
360		if (mmc == hsmmc[i].mmc) {
                    
                
truncate.c https://github.com/xdabravoteam/cm-kernel.git | C | 545 lines
                    
127	 */
                    
128	for (i = block1 ; i < block2; i++) {
                    
129		p = ufs_get_direct_data_ptr(uspi, ufsi, i);
                    
208	indirect_block = (DIRECT_BLOCK > offset) ? (DIRECT_BLOCK - offset) : 0;
                    
209	for (i = indirect_block; i < uspi->s_apb; i++) {
                    
210		ind = ubh_get_data_ptr(uspi, ind_ubh, i);
                    
233	}
                    
234	for (i = 0; i < uspi->s_apb; i++)
                    
235		if (!ufs_is_data_ptr_zero(uspi,
                    
288
                    
289	for (i = dindirect_block ; i < uspi->s_apb ; i++) {
                    
290		dind = ubh_get_data_ptr(uspi, dind_bh, i);
                    
297
                    
298	for (i = 0; i < uspi->s_apb; i++)
                    
299		if (!ufs_is_data_ptr_zero(uspi,
                    
                
bfad_debugfs.c https://gitlab.com/karrei/imx6-kernel | C | 550 lines
                    
314	spin_lock_irqsave(&bfad->bfad_lock, flags);
                    
315	for (i = 0; i < len; i++) {
                    
316		*regbuf = readl(reg_addr);
                    
503
                    
504		for (i = 0; i < ARRAY_SIZE(bfad_debugfs_files); i++) {
                    
505			file = &bfad_debugfs_files[i];
                    
530
                    
531	for (i = 0; i < ARRAY_SIZE(bfad_debugfs_files); i++) {
                    
532		if (bfad->bfad_dentry_files[i]) {
                    
                
main.c https://gitlab.com/karrei/imx6-kernel | C | 554 lines
                    
130
                    
131	for (i = 0; i < nvec; i++)
                    
132		table->msix_arr[i].entry = i;
                    
                
compound.c https://bitbucket.org/akristmann/custom_build.git | C | 489 lines
                    
133	num_crossings++;
                    
134    for (i = 1; i <= 3; i++) {
                    
135	old_sign = sign;
                    
155	num_crossings++;
                    
156    for (i = 1; i <= 3; i++) {
                    
157	old_sign = sign;
                    
255
                    
256    for (i = 0; i < 4; i++) {
                    
257	origpts[i] = pts[i];
                    
437		for (starti = endi; starti > 0; starti -= 3) {
                    
438		    for (i = 0; i < 4; i++)
                    
439			pts[i] = bez->list[starti - i];
                    
440		    if (splineIntersectf(pts, bb)) {
                    
441			for (i = 0; i < 4; i++)
                    
442			    bez->list[starti - i] = pts[i];
                    
                
constrained_majorization.c https://bitbucket.org/akristmann/custom_build.git | C | 496 lines
                    
93	if (graph[0].edists!=NULL) {
                    
94		for (i=0; i<n; i++) {
                    
95			for (j=1; j<graph[i].nedges; j++) {
                    
114			/* now copy the y-axis into the (dim-1)-axis */
                    
115			for (i=0; i<n; i++) {
                    
116				d_coords[dim-1][i] = d_coords[1][i];
                    
131			int stop;
                    
132			for (i=0; i<num_levels; i++) {
                    
133				displacement+=MAX((double)0,levels_gap-(y[ordering[levels[i]]]+displacement-y[ordering[levels[i]-1]]));
                    
193	length = n+n*(n-1)/2;
                    
194	for (i=0; i<length; i++) {
                    
195		if (Dij[i]>diameter) {
                    
203		double max=1;		
                    
204		for (i=0; i<dim; i++) {	
                    
205			for (j=0; j<n; j++) {
                    
                
sch_gred.c https://github.com/CyanogenMod/samsung-kernel-galaxys.git | C | 608 lines
                    
97	/* Really ugly O(n^2) but shouldn't be necessary too frequent. */
                    
98	for (i = 0; i < table->DPs; i++) {
                    
99		struct gred_sched_data *q = table->tab[i];
                    
181
                    
182		for (i = 0; i < t->DPs; i++) {
                    
183			if (t->tab[i] && t->tab[i]->prio < q->prio &&
                    
316
                    
317	for (i = 0; i < t->DPs; i++) {
                    
318		struct gred_sched_data *q = t->tab[i];
                    
368
                    
369	for (i = table->DPs; i < MAX_DPs; i++) {
                    
370		if (table->tab[i]) {
                    
515
                    
516	for (i = 0; i < MAX_DPs; i++) {
                    
517		struct gred_sched_data *q = table->tab[i];
                    
                
monreader.c https://github.com/CyanogenMod/samsung-kernel-galaxys.git | C | 530 lines
                    
92
                    
93	for (i = 0; i < 8; i++) {
                    
94		if (ascii_name[i] == '\0')
                    
97	};
                    
98	for (; i < 8; i++)
                    
99		ebcdic_name[i] = ' ';
                    
174
                    
175	for (i = 0; i < MON_MSGLIM; i++)
                    
176		if (monpriv->msg_array[i])
                    
188		return NULL;
                    
189	for (i = 0; i < MON_MSGLIM; i++) {
                    
190		monpriv->msg_array[i] = kzalloc(sizeof(struct mon_msg),
                    
355
                    
356	for (i = 0; i < MON_MSGLIM; i++)
                    
357		kfree(monpriv->msg_array[i]);
                    
                
LexLua.cxx https://github.com/LuaDist/scintilla.git | C++ | 453 lines
                    
157						if (i < 90)
                    
158							s[i++] = c;
                    
159						ln++;
                    
378
                    
379	for (unsigned int i = startPos; i < lengthDoc; i++) {
                    
380		char ch = chNext;
                    
                
gifdec.c https://gitlab.com/lenivyyluitel/hitagi | C | 530 lines
                    
109    if (bgcolor[0] || bgcolor[1] || bgcolor [2])
                    
110        for (i = 0; i < gif->width * gif->height; i++)
                    
111            memcpy(&gif->canvas[i*3], bgcolor, 3);
                    
384        str_len = entry.length;
                    
385        for (i = 0; i < str_len; i++) {
                    
386            p = frm_off + entry.length - 1;
                    
                
snic_disc.c https://gitlab.com/dieselnutjob/linux-next | C | 565 lines
                    
372
                    
373	for (i = 0; i < snic->disc.rtgt_cnt; i++) {
                    
374		tgt = snic_tgt_create(snic, &tgtid[i]);
                    
421
                    
422	for (i = 0; i < tgt_cnt; i++)
                    
423		SNIC_HOST_INFO(snic->shost,
                    
                
break-substitution.cc https://gitlab.com/aguai/lilypond | C++ | 534 lines
                    
112      SCM nv = scm_c_make_vector (len, SCM_UNDEFINED);
                    
113      for (int i = 0; i < len; i++)
                    
114        {
                    
164  Grob **ptr = array;
                    
165  for (vsize i = 0; i < old_grobs.size (); i++)
                    
166    {
                    
352
                    
353  for (vsize i = 0; i < grob_array->size (); i++)
                    
354    {
                    
373  vector<Slice> spanner_indices;
                    
374  for (int i = 0; i <= system_range.length (); i++)
                    
375    {
                    
385
                    
386  for (int i = 0; i < item_index; i++)
                    
387    {
                    
                
jsuri-1.1.1.js https://gitlab.com/yenny.prathivi/My-Wallet | JavaScript | 473 lines
                    
37
                    
38            for (i = 0; i < ps.length; i++) {
                    
39                p = ps[i];
                    
51            var s = '', i, param;
                    
52            for (i = 0; i < params.length; i++) {
                    
53                param = params[i];
                    
70            var param, i;
                    
71            for (i = 0; i < params.length; i++) {
                    
72                param = params[i];
                    
81            var arr = [], i, param;
                    
82            for (i = 0; i < params.length; i++) {
                    
83                param = params[i];
                    
96
                    
97            for (i = 0; i < params.length; i++) {
                    
98
                    
                
fsevents-handler.js https://gitlab.com/sogeta_albazi/books-and-movies | JavaScript | 412 lines
                    
137  var i = 0;
                    
138  while (!path.indexOf(root) && (path = sysPath.dirname(path)) !== root) i++;
                    
139  return i;
                    
                
pcm_misc.c https://gitlab.com/webhaikal/SenseiRN3 | C | 518 lines
                    
466	int i;
                    
467	for (i = 0; i < (int)snd_pcm_known_rates.count; i++) {
                    
468		if (runtime->hw.rates & (1 << i)) {
                    
494
                    
495	for (i = 0; i < snd_pcm_known_rates.count; i++)
                    
496		if (snd_pcm_known_rates.list[i] == rate)
                    
512
                    
513	for (i = 0; i < snd_pcm_known_rates.count; i++)
                    
514		if ((1u << i) == rate_bit)
                    
                
helpview.cpp https://github.com/goofoo/Helium.git | C++ | 491 lines
                    
92
                    
93    for( i=1; i<argc; i++ )
                    
94    {
                    
209
                    
210    for( i=0; i<bookCount; i++ )
                    
211    {
                    
                
_base.js https://github.com/schnuffel/learncards-web.git | JavaScript | 574 lines
                    
35}
                    
36for(var i=0,_6;_6=this._dicts[i];i++){
                    
37if(typeof _6[_4]!="undefined"){
                    
93_14=_14||999;
                    
94while(i++<_14&&(bit=_a.exec(this.contents))){
                    
95bit=bit[0];
                    
173var _2a=dojo.trim(tag).split(/\s+/g);
                    
174for(var i=0,_2b;_2b=_2a[i];i++){
                    
175dojo["require"](_2b);
                    
220},{render:function(_3a,_3b){
                    
221for(var i=0,l=this.contents.length;i<l;i++){
                    
222if(this.contents[i].resolve){
                    
249var pos,arg;
                    
250for(var i=0,has=[];i<arguments.length;i++){
                    
251has[i]=(typeof arguments[i]!="undefined"&&typeof arguments[i]=="string"&&arguments[i]);
                    
                
Util.java https://gitlab.com/hounge.mobile/apkinspector | Java | 461 lines
                    
46    long result = 1;
                    
47    for (long i = 1; i <= n_; i++)
                    
48      result *= i;
                    
78    int result = 1;
                    
79    for (int i = 1; i <= n_; i++)
                    
80      result *= i;
                    
103    s.append("[");
                    
104    for (int i = 0; i < ints_.length; i++) {
                    
105      if (i > 0)
                    
119    s.append(start);
                    
120    for (int i = 0; i < o.length; i++) {
                    
121      if (o[i] != null) {
                    
332
                    
333      for (int i = 0; i < fields.length; i++) {
                    
334        // Make this field accessible
                    
                
transport_data.cc https://gitlab.com/jonnialva90/iridium-browser | C++ | 336 lines
                    
80#endif
                    
81  for (size_t i = 0; i < num_handles; i++) {
                    
82    if (Dispatcher* dispatcher = (*dispatchers)[i].get()) {
                    
131  size_t current_offset = serialized_dispatcher_start_offset;
                    
132  for (size_t i = 0; i < num_handles; i++) {
                    
133    Dispatcher* dispatcher = (*dispatchers)[i].get();
                    
271      "Message contains invalid serialized dispatcher";
                    
272  for (size_t i = 0; i < num_handles; i++) {
                    
273    size_t offset = handle_table[i].offset;
                    
318          static_cast<const char*>(buffer) + sizeof(Header));
                    
319  for (size_t i = 0; i < num_handles; i++) {
                    
320    size_t offset = handle_table[i].offset;
                    
                
g450_pll.c https://github.com/mturquette/linux-omap.git | C | 538 lines
                    
218
                    
219			for (i = 0; i < 100; i++) {
                    
220				r += matroxfb_DAC_in(minfo, regidx) & 0x40;
                    
314	mnp_key &= G450_MNP_FREQBITS;
                    
315	for (i = 0; i < ci->valid; i++) {
                    
316		if (ci->data[i].mnp_key == mnp_key) {
                    
                
srat_64.c https://github.com/teknologist/HTC-Hero-Teknologist-Kernel.git | C | 522 lines
                    
50	int i;
                    
51	for (i = 0; i < num_node_memblks; i++) {
                    
52		struct bootnode *nd = &node_memblk_range[i];
                    
87	found_add_area = 0;
                    
88	for (i = 0; i < MAX_LOCAL_APIC; i++)
                    
89		apicid_to_node[i] = NUMA_NO_NODE;
                    
89		apicid_to_node[i] = NUMA_NO_NODE;
                    
90	for (i = 0; i < MAX_NUMNODES; i++)
                    
91		nodes_add[i].start = nodes[i].end = 0;
                    
329	node_clear(node, nodes_parsed);
                    
330	for (i = 0; i < MAX_LOCAL_APIC; i++) {
                    
331		if (apicid_to_node[i] == node)
                    
346	/* First clean up the node list */
                    
347	for (i = 0; i < MAX_NUMNODES; i++) {
                    
348		cutoff_node(i, start, end);
                    
                
MKSerial.c https://github.com/CorvusCorax/my_OpenPilot_mods.git | C | 559 lines
                    
153
                    
154	for (int i = 0; i < msg->nbPars; i++) {
                    
155		DEBUG_MSG("%02x ", msg->pars[i]);
                    
295					int i;
                    
296					for (i = 0; i < 4; i++) {
                    
297						checkVal += buf[i];
                    
                
postgresql-jdbc-unspec-string.patch https://github.com/commandprompt/PGSQLRPMS.git | Patch | 279 lines
                    
84     boolean hasUnresolvedTypes() {
                    
85         for (int i=0; i< paramTypes.length; i++) {
                    
86-            if (paramTypes[i] == Oid.INVALID)
                    
                
dominos-commandline-pizza.js https://gitlab.com/edelmaks/PizzaPI | JavaScript | 510 lines
                    
256            console.log('\n');
                    
257            for(var i=0; i<count; i++){
                    
258                var store=openStores[i];
                    
295    var items=items.split(',');
                    
296    for(var i=0; i<items.length; i++){
                    
297        //create a new product to add to the order
                    
                
vtkReflectionFilter.cxx https://github.com/dgobbi/VTK.git | C++ | 471 lines
                    
192    {
                    
193    for (i = 0; i < numPts; i++)
                    
194      {
                    
241
                    
242  for (i = 0; i < numPts; i++)
                    
243    {
                    
271    {
                    
272    for (i = 0; i < numCells; i++)
                    
273      {
                    
290  // Generate reflected cells.
                    
291  for (i = 0; i < numCells; i++)
                    
292    {
                    
                
loadsounds.cpp https://github.com/simX/d2x-xl.git | C++ | 495 lines
                    
125PrintLog ("unloading custom sounds\n");
                    
126for (i = 0; i < 2; i++)
                    
127	for (j = 0, dsP = gameData.pig.sound.sounds [i].Buffer (); j < MAX_SOUND_FILES; j++, dsP++)
                    
168nDataOffs = nHeaderOffs + nLoadedSounds * sizeof (tPIGSoundHeader);
                    
169for (i = b11K ? 0 : nLoadedSounds / 2; i < nLoadedSounds; i++) {
                    
170	cf.Seek ((long) (nHeaderOffs + i * sizeof (tPIGSoundHeader)), SEEK_SET);
                    
243	}
                    
244for (i = 0; i < nSounds; i++) {
                    
245	PIGSoundHeaderRead (&sndh, cf);
                    
280	return 1;
                    
281for (i = 0; i < MAX_SOUNDS; i++) {
                    
282	if ((AltSounds [gameStates.app.bD1Mission][i] < 255) && (Sounds [gameStates.app.bD1Mission][AltSounds [gameStates.app.bD1Mission][i]] == nSound))
                    
475{
                    
476for (int i = 0; i < int (sizeofa (addonSounds)); i++)
                    
477	LoadAddonSound (AddonSoundName (i));
                    
                
packet.go https://gitlab.com/zanderwong/lantern | Go | 539 lines
                    
183		}
                    
184		for i := 0; i < lengthBytes; i++ {
                    
185			length <<= 8
                    
                
hsr_framereg.c https://gitlab.com/buktemirlnk/mirrors | C | 502 lines
                    
160	now = jiffies;
                    
161	for (i = 0; i < HSR_PT_PORTS; i++)
                    
162		node->time_in[i] = now;
                    
162		node->time_in[i] = now;
                    
163	for (i = 0; i < HSR_PT_PORTS; i++)
                    
164		node->seq_out[i] = seq_out;
                    
240	ether_addr_copy(node_real->MacAddressB, eth_hdr(skb)->h_source);
                    
241	for (i = 0; i < HSR_PT_PORTS; i++) {
                    
242		if (!node_curr->time_in_stale[i] &&
                    
                
OrderablePartitioner.cs https://gitlab.com/0072016/0072016-corefx- | C# | 276 lines
                    
175            IEnumerator<TSource>[] partitions = new IEnumerator<TSource>[partitionCount];
                    
176            for (int i = 0; i < partitionCount; i++)
                    
177            {
                    
                
usbvision-i2c.c https://github.com/gnarlyc/desirec_2.6.29.git | C | 530 lines
                    
67	buf[0] = 0x00;
                    
68	for (i = 0; i <= retries; i++) {
                    
69		ret = (usbvision_i2c_write(usbvision, addr, buf, 1));
                    
91	usbvision = (struct usb_usbvision *)i2c_get_adapdata(i2c_adap);
                    
92	for (i = 0; i <= retries; i++) {
                    
93		ret = (usbvision_i2c_read(usbvision, addr, buf, 1));
                    
163
                    
164	for (i = 0; i < num; i++) {
                    
165		pmsg = &msgs[i];
                    
419	value[1] = ser_cont;
                    
420	for (i = 0; i < len; i++)
                    
421		value[i + 2] = buf[i];
                    
500		if (retval > 0) {
                    
501			for (i = 0; i < len; i++)
                    
502				buf[rdcount + i] = temp[i];
                    
                
Style.js https://github.com/joshuaoa/MapDev.git | JavaScript | 411 lines
                    
128    destroy: function() {
                    
129        for (var i=0, len=this.rules.length; i<len; i++) {
                    
130            this.rules[i].destroy();
                    
156        var appliedRules = false;
                    
157        for(var i=0, len=rules.length; i<len; i++) {
                    
158            rule = rules[i];
                    
174            appliedRules = true;
                    
175            for(var i=0, len=elseRules.length; i<len; i++) {
                    
176                this.applySymbolizer(elseRules[i], style, feature);
                    
287        var symbolizer, value;
                    
288        for (var i=0, len=rules.length; i<len; i++) {
                    
289            symbolizer = rules[i].symbolizer;
                    
364        var prefixes = OpenLayers.Style.SYMBOLIZER_PREFIXES;
                    
365        for (var i=0, len=prefixes.length; i<len; i++) {
                    
366            if (geometry.CLASS_NAME.indexOf(prefixes[i]) != -1) {
                    
                
FileUploadPlugin.java https://github.com/czarneckid/blojsom-sourceforge.git | Java | 282 lines
                    
143            _acceptedFileTypes = new HashMap(parsedListOfTypes.length);
                    
144            for (int i = 0; i < parsedListOfTypes.length; i++) {
                    
145                String type = parsedListOfTypes[i];
                    
248                File deletedFile;
                    
249                for (int i = 0; i < filesToDelete.length; i++) {
                    
250                    String fileToDelete = filesToDelete[i];
                    
269                resourceFilesMap = new HashMap(resourceFiles.length);
                    
270                for (int i = 0; i < resourceFiles.length; i++) {
                    
271                    File resourceFile = resourceFiles[i];
                    
                
rt5640_ioctl.c https://gitlab.com/T-Firefly/fireprime-kernel | C | 468 lines
                    
53
                    
54	for(i = 0; i <= EQ_REG_NUM; i++) {
                    
55		if(hweq_param[mode].reg[i])
                    
                
RadioGroup.js https://github.com/fjakobs/qooxdoo.git | JavaScript | 524 lines
                    
207
                    
208      for (var i = 0, l = arguments.length; i < l; i++) {
                    
209        item = arguments[i];
                    
319
                    
320      for (var i = 0; i < this.__items.length; i++) {
                    
321        item = this.__items[i];
                    
340    _applyInvalidMessage(value, old) {
                    
341      for (var i = 0; i < this.__items.length; i++) {
                    
342        this.__items[i].setInvalidMessage(value);
                    
347    _applyValid(value, old) {
                    
348      for (var i = 0; i < this.__items.length; i++) {
                    
349        this.__items[i].setValid(value);
                    
356      if (value == null) {
                    
357        for (var i = 0, l = items.length; i < l; i++) {
                    
358          items[i].resetEnabled();
                    
                
police.c https://github.com/huitebe/fuck_reuben.git | C | 612 lines
                    
79
                    
80	for (i = 0; i < MY_TAB_SIZE; i++) {
                    
81		p = tcf_police_ht[tcf_police_hash(i)];
                    
100			r->rta_len = skb->tail - (u8*)r;
                    
101			n_i++;
                    
102		}
                    
                
gobj.c https://github.com/ivanwyc/google-go.git | C | 732 lines
                    
152		n = a->sval;
                    
153		for(i=0; i<NSNAME; i++) {
                    
154			Bputc(b, *n);
                    
                
MeshGenerator.cs https://gitlab.com/Bezerra/rpg | C# | 394 lines
                    
97        EdgeCollider2D[] currentColliders = gameObject.GetComponents<EdgeCollider2D> ();
                    
98        for (int i = 0; i < currentColliders.Length; i++) {
                    
99            Destroy(currentColliders[i]);
                    
                
browser.js https://gitlab.com/gtekelis/modbus_project | JavaScript | 477 lines
                    
186    if (l === +l) {
                    
187        for (var i = 0; i < l; i++) {
                    
188            fn.call(ctx, obj[i], i, obj);
                    
233    var boundArgs = [];
                    
234    for (var i = 0; i < boundLength; i++) {
                    
235        boundArgs.push('$' + i);
                    
                
muselection_search.js https://gitlab.com/Daniel-Bessa/dev-vm | JavaScript | 325 lines
                    
275                            var listselected = ''
                    
276                            for (var i = 0; i < this.getView().byId("Tree").getSelectedItems().length; i++) {
                    
277                                listselected += this.getView().byId("Tree").getSelectedItems()[i].getBindingContext("Multiinput_1").getObject().text + ","
                    
                
emul_op.cpp https://github.com/amade/SheepShaver_oldstuff.git | C++ | 492 lines
                    
78				len &= 0x7fff;
                    
79				for (uint32 i=0; i<len; i++)
                    
80					XPRAM[((ofs + i) & 0xff) + 0x1300] = *adr++;
                    
81			} else {
                    
82				for (uint32 i=0; i<len; i++)
                    
83					*adr++ = XPRAM[((ofs + i) & 0xff) + 0x1300];
                    
242				int i;
                    
243				for (i=0; i<pstr[0]; i++)
                    
244					str[i] = pstr[i+1];
                    
                
common.c https://github.com/asankah/heimdal.git | C | 487 lines
                    
118
                    
119    for (i = 0; i < entry->keys.len; i++) {
                    
120	Key *key = &entry->keys.val[i];
                    
288    }
                    
289    for (i = 0; i < aliases->aliases.len; i++) {
                    
290	krb5_data akey;
                    
318
                    
319    for (i = 0; i < aliases->aliases.len; i++) {
                    
320	hdb_entry_alias entryalias;
                    
351
                    
352    for (i = 0; aliases && i < aliases->aliases.len; i++) {
                    
353	hdb_entry_alias alias;
                    
                
grid.custom.js https://github.com/solo123/sales.git | JavaScript | 437 lines
                    
14		var cM = $t.p.colModel;
                    
15		for ( var i =0;i<cM.length;i++ ) {
                    
16			if ( cM[i].name == colname ) {
                    
28					var cM = this.p.colModel;
                    
29					for ( var i =0;i<cM.length;i++ ) {
                    
30						if ( cM[i].name == colname ) {
                    
43			if ( !colname ) { colname = $t.p.sortname; }
                    
44			for ( var i=0;i<$t.p.colModel.length;i++ ) {
                    
45				if ( $t.p.colModel[i].index == colname || $t.p.colModel[i].name==colname ) {
                    
                
draw.h https://github.com/carlisia/RMagick_installation.git | C Header | 637 lines
                    
435		/* Output co-ordinate pairs: */
                    
436		for (i = 0; i < poly_line->count; i++)
                    
437		{	pt = fig_translate (API,poly_line->pt[poly_line->count-1-i]);
                    
496
                    
497			for (i = 0; i < poly_line->count; i++)
                    
498			{	pt = fig_translate (API,poly_line->pt[i]);
                    
534
                    
535			for (i = 0; i < poly_line->count; i++)
                    
536			{	pt = fig_translate (API,poly_line->pt[poly_line->count-1-i]);
                    
                
init.c https://bitbucket.org/mirror/linux.git | C | 461 lines
                    
109
                    
110	for (i = 0; i < MT7615_WTBL_SIZE; i++)
                    
111		mt7615_mac_wtbl_update(dev, i,
                    
249
                    
250	for (i = 0; i < sband->n_channels; i++) {
                    
251		struct ieee80211_channel *chan = &sband->channels[i];
                    
                
CronParser.php https://github.com/kiirti/Ushahidi_MHI.git | PHP | 429 lines
                    
105			$count = count($tmp1);
                    
106			for ($i=0;$i<$count;$i++){//Loop through each comma-separated value
                    
107				if (strstr($tmp1[$i],  "-")){ //If there's a range in this place, expand that too
                    
119			$range = explode("-", $str);
                    
120			for ($i=$range[0];$i<=$range[1];$i++){
                    
121				$ret[] = $i;
                    
139			$count = count($tmp1);
                    
140			for ($i=0;$i<$count;$i++){//Loop through each comma-separated value
                    
141				if (strstr($tmp1[$i],  "-")){ //If there's a range in this place, expand that too
                    
160			$range = explode("-", $str);
                    
161			for ($i=$start;$i<=$range[1];$i++){
                    
162				for ($n=1;$n<=$daysInMonth;$n++){
                    
378   			$this->debug("Days in ".$month.", ".$this->now[5].": ".$daysinmonth);
                    
379   			for($i = 1;$i<=$daysinmonth;$i++){
                    
380   				$days[] = $i;
                    
                
format.js.uncompressed.js https://github.com/cfxram/grails-dojo.git | JavaScript | 478 lines
                    
43			iTxt = "";
                    
44			for(i = 0; i < indentBy; i++){
                    
45				iTxt += " ";
                    
106			var i, txt = "";
                    
107			for(i = 0; i < indentDepth; i++){
                    
108				txt += iTxt;
                    
116			var i;
                    
117			for(i = 0; i < indentDepth; i++){
                    
118				content.push(iTxt);
                    
147			var _lines = txt.split("\n");
                    
148			for(i = 0; i < _lines.length; i++){
                    
149				_lines[i] = lang.trim(_lines[i]);
                    
167								// Couldn't find a split going back, so go forward.
                    
168								for(i = maxLine; (i < txt.length && txt.charAt(i) !== " "); i++){
                    
169									// Do nothing, we're just looking for a space to split at.
                    
                
ByteEncoding.cs https://github.com/grendello/mono.git | C# | 495 lines
                    
91			lock (normalization_bytes) {
                    
92				for (int i = 0; i < 0x100; i++)
                    
93					normalization_bytes [i] = (byte) i;
                    
                
lineprimitives.js http://demoasp.googlecode.com/svn/trunk/ | JavaScript | 397 lines
                    
344  // Generate the individual vertices in our vertex buffer.

                    
345  for (var i = 0; i <= subdivisions; i++) {

                    
346    var theta = 2 * Math.PI * i / subdivisions;

                    
353  // Connect the vertices by simple lines.

                    
354  for (var i = 0; i < subdivisions; i++) {

                    
355    vertexInfo.addLine(i, i+1);

                    
                
MetaDataHelper.java http://pride-toolsuite.googlecode.com/svn/ | Java | 342 lines
                    
124        if (targets != null) {
                    
125            for (int i = 0; i < targets.size(); i++) {
                    
126                String prefix = Constants.TARGET + " " + (i + 1) + " - ";
                    
189        if (proMethods != null) {
                    
190            for (int i = 0; i < proMethods.size(); i++) {
                    
191                String prefix = Constants.PROCESSING_METHOD + " " + (i + 1) + " - ";
                    
216        if (steps != null) {
                    
217            for (int i = 0; i < steps.size(); i++) {
                    
218                String prefix = Constants.PROTOCOL_STEP + " " + (i + 1) + " - ";
                    
                
l_struct.c http://bzzwolfmp.googlecode.com/svn/trunk/ | C | 508 lines
                    
68
                    
69	for ( i = 0; defs[i].name; i++ )
                    
70	{
                    
404	indent++;
                    
405	for ( i = 0; def->fields[i].name; i++ )
                    
406	{
                    
                
SimpleTextLayout.java git://github.com/metsci/glimpse.git | Java | 459 lines
                    
220
                    
221            for ( int i = lastBreakIdx; i < text.length( ) && breakAt == BreakIterator.DONE; i++ )
                    
222            {
                    
282        double prevMinX = 0;
                    
283        for ( int i = 1; i < breaks.size( ); i++ )
                    
284        {
                    
                
CharpterController.m http://read-book.googlecode.com/svn/trunk/ | Objective C | 394 lines
                    
91		i = (charpaterIndex - 1) * 22;
                    
92		for (i;  i < total; i++) {
                    
93			UIButton *button = [UIButton buttonWithType:UIButtonTypeCustom];
                    
136		i = (charpaterIndex - 1) * 15;
                    
137		for (i;  i < total; i++) {
                    
138			UIButton *button = [UIButton buttonWithType:UIButtonTypeCustom];
                    
                
DataParser.cs http://kidvn-lab.googlecode.com/svn/trunk/ | C# | 390 lines
                    
134
                    
135                for (int i = 0; i < elemAttribList.Count; i++)
                    
136                {
                    
167                XmlNodeList elemFilterList = elemRoot.GetElementsByTagName(XmlConst.DATA_FILTER);
                    
168                for (int i = 0; i < elemFilterList.Count; i++)
                    
169                {
                    
283
                    
284                for (int i = 0; i < this.parsedDataItems.Count; i++)
                    
285                {
                    
330                //outputData.Append(this.generateHeader(separator));
                    
331                for (int i = 0; i < strInputData.Length; i++)
                    
332                {
                    
                
resourceallocator.cc http://nebula3.googlecode.com/svn/trunk/ | C++ | 381 lines
                    
63    IndexT i;
                    
64    for (i = 0; i < this->lumps.Size(); i++)
                    
65    {
                    
194    IndexT i;
                    
195    for (i = 0; i < numLumps; i++)
                    
196    {
                    
207    SizeT numFreeBlocks = 0;
                    
208    for (i = 0; i < sortedLumpIndices.Size(); i++)
                    
209    {
                    
265    SizeT biggestFreeAreaBlocks = 0;
                    
266    for (i = 0; i < createFreeLumps.Size(); i++)
                    
267    {
                    
366            IndexT i;
                    
367            for (i = 0; i < numBlocksToMove; i++)
                    
368            {
                    
                
grmain.cpp git://pkgs.fedoraproject.org/torcs | C++ | 489 lines
                    
177    y = (int)(mouse->Y * grMouseRatioY);
                    
178    for (i = 0; i < GR_NB_MAX_SCREEN; i++) {
                    
179	if (grScreens[i]->isInScreen(x, y)) {
                    
253
                    
254	for (i = 0; i < GR_NB_MAX_SCREEN; i++) {
                    
255		grScreens[i]->initBoard ();
                    
333
                    
334    for (i = 0; i < GR_NB_MAX_SCREEN; i++) {
                    
335	grScreens[i]->update(s, grFps);
                    
369
                    
370	for (i = 0; i < s->_ncars; i++) {
                    
371		elt = s->cars[i];
                    
378	grNbScreen = 0;
                    
379	for (i = 0; i < s->_ncars; i++) {
                    
380		elt = s->cars[i];
                    
                
Level.cs https://hg01.codeplex.com/sml | C# | 444 lines
                    
116
                    
117                for (int i = 0; i < stream.Length; i++)
                    
118                {
                    
319
                    
320                for (int i = 0; i < Layers.Count; i++)
                    
321                {
                    
324
                    
325                for (int i = 0; i < Players.Count; i++)
                    
326                {
                    
383
                    
384            for (int i = 0; i < Layers.Count; i++)
                    
385            {
                    
388
                    
389            for (int i = 0; i < Players.Count; i++)
                    
390            {
                    
                
modsupport.c https://code.google.com/p/ironclad/ | C | 652 lines
                    
220	   refcounts on any 'N' arguments. */
                    
221	for (i = 0; i < n; i++) {
                    
222		PyObject *w = do_mkvalue(p_format, p_va, flags);
                    
252	Py_UNICODE *v = u;
                    
253	while (*v != 0) { i++; v++; }
                    
254	return i;
                    
269	   refcounts on any 'N' arguments. */
                    
270	for (i = 0; i < n; i++) {
                    
271		PyObject *w = do_mkvalue(p_format, p_va, flags);
                    
                
admin.js http://smartmobile.googlecode.com/svn/trunk/ | JavaScript | 417 lines
                    
28            	var c =  depTree.data.getChildren(p);
                    
29            	for(var i =0; i < c.getLength(); i++){
                    
30            		var pk = Number(c.get(i).pk);
                    
145	    				var wasQueuing1 = RPCManager.startQueue();
                    
146						for(var i = 0; i < data.length; i++){
                    
147							var d = data.get(i);
                    
                
AbstractManagerMethodDispatcher.java https://github.com/miquelrojascherto/bioclipse.core.git | Java | 343 lines
                    
213        //translate String -> IFile
                    
214        for ( int i = 0; i < arguments.length; i++ ) {
                    
215            if ( arguments[i] instanceof String &&
                    
299                      i < m.getParameterTypes().length; 
                    
300                      i++ ) {
                    
301                    Class<?> currentParam = m.getParameterTypes()[i];
                    
                
vtkMRMLStorableNode.cxx https://github.com/pieper/Slicer4.git | C++ | 489 lines
                    
95    const char *kwd, *val;
                    
96    for (int i=0; i < numc; i++ )
                    
97      {
                    
181  Superclass::UpdateReferenceID(oldID, newID);
                    
182  for (unsigned int i=0; i<this->StorageNodeIDs.size(); i++)
                    
183    {
                    
233  int ndnodes = node->GetNumberOfStorageNodes();
                    
234  for (int i=0; i<ndnodes; i++)
                    
235    {
                    
248  this->UserTagTable->PrintSelf(os, indent);
                    
249   for (unsigned int i=0; i<this->StorageNodeIDs.size(); i++)
                    
250    {
                    
266  vtkDebugMacro("UpdateScene: going through the storage node ids: " <<  this->StorageNodeIDs.size());
                    
267  for (unsigned int i=0; i < this->StorageNodeIDs.size(); i++)
                    
268    {
                    
                
GMList.cpp https://code.google.com/p/gogglesmm/ | C++ | 402 lines
                    
36  const FXStringList & keywords = GMPlayerManager::instance()->getPreferences().gui_sort_keywords;
                    
37  for (FXint i=0;i<keywords.no();i++){
                    
38    if (comparecase(t,keywords[i],keywords[i].length())==0) return true;
                    
172  y=pos_y;
                    
173  for(i=0; i<items.no(); i++){
                    
174    h=items[i]->getHeight(this);
                    
                
creole.js https://bitbucket.org/saibotd/bitbeaker/ | JavaScript | 371 lines
                    
122            var rule  = false;
                    
123            for (var i = 0; i < this.children.length; i++) {
                    
124                if (typeof matches[i] == 'undefined') {
                    
148            tail = tail.substring(chopped);
                    
149            for (var i = 0; i < this.children.length; i++) {
                    
150                if (matches[i]) {
                    
334
                    
335    for (var i = 1; i <= 6; i++) {
                    
336        g['h' + i] = { tag: 'h' + i, capture: 2,
                    
                
IndexTxAwareMultiValueGetTest.java http://orient.googlecode.com/svn/ | Java | 347 lines
                    
229
                    
230    for (int i = 0; i < 3; i++) {
                    
231      iteratorCluster.hasNext();
                    
                
ConnectionRoute.java git://github.com/levans/Open-Quark.git | Java | 389 lines
                    
279        int numPoints = points.size();
                    
280        for (int i = 1; i < numPoints; i++) {
                    
281            Point fromPoint = points.get(i - 1);
                    
                
cmpiOSBase_NetworkPortImplementsIPEndpoint.c git://pkgs.fedoraproject.org/sblim-cmpi-network | C | 406 lines
                    
135
                    
136  for (i = 0; i < 3; i++)
                    
137  {
                    
                
LeastSquaresTransform.cs https://SharpMap.svn.codeplex.com/svn | C# | 317 lines
                    
128            Coordinate meanOutput = new Coordinate(0, 0);
                    
129            for (int i = 0; i < inputs.Count; i++)
                    
130            {
                    
143            //B: matrix of calibrated values. Example of row in B: [x , y , -1]
                    
144            for (int i = 0; i < inputs.Count; i++)
                    
145            {
                    
162
                    
163            for (int i = 0; i < inputs.Count; i++)
                    
164            {
                    
196            //Restore values
                    
197            for (int i = 0; i < inputs.Count; i++)
                    
198            {
                    
206            double s0 = 0;
                    
207            for (int i = 0; i < inputs.Count; i++)
                    
208            {
                    
                
BatchRequests.as http://facebook-actionscript-api.googlecode.com/svn/trunk/ | ActionScript | 390 lines
                    
153			var columns:int = 3;//(stage.stageWidth - PADDING_SMALL - PADDING_SMALL) / (size + PADDING_SMALL);
                    
154			for (var i:int, numImages:int = 3; i < numImages; i++) {
                    
155				var img:Bitmap = new Bitmap(new BitmapData(size, size, false, Math.random()*0xffffff));
                    
257				uploadPhotosCompleteText.visible = false;
                    
258				for (var i:int, l:int = imagesList.length; i < l; i++) {
                    
259					//Add each photo to this batch.
                    
                
ccn__match_8c.html http://ccnx-trace-interest.googlecode.com/svn/trunk/ | HTML | 250 lines
                    
24  var sectionCounter=1;
                    
25  for(var i=0;i<divs.length-1;i++){
                    
26    if(divs[i].className=='dynheader'&&divs[i+1].className=='dynsection'){
                    
                
MainForm.cs http://hwr-aco-g3.googlecode.com/svn/trunk/ | C# | 358 lines
                    
186            int maxIterations = paramPanel.GetSimulationParams().iterations;
                    
187            for (int i = 1; i <= maxIterations; i++)
                    
188            {
                    
                
dictionary.c https://code.google.com/p/inla/ | C | 591 lines
                    
67	len = strlen(key);
                    
68	for (hash = 0, i = 0; i < len; i++) {
                    
69		hash += (unsigned) key[i];
                    
108
                    
109	for (i = 0; i < size; i++) {
                    
110		map_ii_set(&(d->iihash), i, 1);
                    
128		return;
                    
129	for (i = 0; i < d->size; i++) {
                    
130		if (d->key[i] != NULL)
                    
290			d->key = (char **) mem_double(d->key, (int) (d->size * sizeof(char *)));
                    
291			for (i = d->size; i < 2 * d->size; i++)
                    
292				map_ii_set(&(d->iihash), i, 1);
                    
306			 */
                    
307			for (i = 0; i < d->size; i++) {
                    
308				if (d->key[i] == NULL) {
                    
                
gui.c git://pkgs.fedoraproject.org/mfiler3 | C | 505 lines
                    
101        int i;
                    
102        for(i=0; i< len; i++) {
                    
103            if(cursor == i) {
                    
140            int i;
                    
141            for(i=0; i< len; i++) {
                    
142                if(toupper(key) == toupper(str[i][0])) {
                    
184    int i;
                    
185    for(i=0; i< len && i<maxx-1; i++) {
                    
186        mprintw("%c", string_c_str(gInputBoxInput)[i]);
                    
380    int i;
                    
381    for(i=0; i< gSelectStrLen; i++) {
                    
382        if(gSelectStrCursor == i) {
                    
436            int i;
                    
437            for(i=0; i< len; i++) {
                    
438                if(toupper(key) == toupper(str[i][0])) {
                    
                
PublisherConfirmsTests.cs git://github.com/mikehadlow/EasyNetQ.git | C# | 413 lines
                    
268
                    
269            for (ulong i = 0; i < 10; i++)
                    
270            {
                    
                
gutils.h https://github.com/prajnashi/glib.git | C Header | 430 lines
                    
363  for (data = *stack_p; data; data = data->next)
                    
364    i++;
                    
365
                    
                
MultiValueDoubleList.js https://github.com/apache/cocoon.git | JavaScript | 349 lines
                    
53                var alreadyInList = false;
                    
54                for (var i = 0; this.options.length > i && !alreadyInList; i++) {
                    
55                    if (this.options[i].value == value) {
                    
66                var alreadyInList = false;
                    
67                for (var i = 0; this.options.length > i && !alreadyInList; i++) {
                    
68                    if (this.options[i].value == value) {
                    
200            var newRightField = null;
                    
201            for (var i = 0; i < left.options.length; i++) {
                    
202                var o = left.options[i];
                    
208                }
                    
209            for (var i = 0; i < right.options.length; i++) {
                    
210                var o = right.options[i];
                    
243            }
                    
244            for(var i = 0; i < from.options.length; i++) {
                    
245                var o = from.options[i];
                    
                
SmartTypeCompletionOrderingTest.groovy git://github.com/JetBrains/intellij-community.git | Groovy | 384 lines
                    
51    imitateItemSelection(lookup, 3) //FooBean3
                    
52    for (int i = 0; i < StatisticsManager.OBLIVION_THRESHOLD; i++) {
                    
53      imitateItemSelection(lookup, 2) //Container
                    
61    assertPreferredItems 1, 'List', 'ArrayList', 'AbstractList', 'AbstractSequentialList'
                    
62    for (int i = 0; i < StatisticsManager.OBLIVION_THRESHOLD + 10; i++) {
                    
63      imitateItemSelection(lookup, 3) //AbstractSequentialList
                    
254    assertPreferredItems(0, "foo", "param", "this", "goo", "bar")
                    
255    for (int i = 0; i < StatisticsManager.OBLIVION_THRESHOLD; i++) {
                    
256      imitateItemSelection(lookup, 3) //goo
                    
                
BackgroundUploader.java http://moca.googlecode.com/svn/ | Java | 343 lines
                    
203		  Object[] queueList = queue.toArray();
                    
204		  for (int i = 0; i < queueList.length; i++) {
                    
205			  Uri test = (Uri) queueList[i];
                    
                
Transform.java git://pkgs.fedoraproject.org/xml-security | Java | 363 lines
                    
101        if (contextNodes != null) {
                    
102            for (int i = 0; i < contextNodes.getLength(); i++) {
                    
103                this._constructionElement.appendChild
                    
                
JackConnectionManager.h git://pkgs.fedoraproject.org/jack-audio-connection-kit | C Header | 496 lines
                    
57        {
                    
58            for (int i = 0; i < SIZE; i++)
                    
59                fTable[i] = EMPTY;
                    
64        {
                    
65            for (int i = 0; i < SIZE; i++) {
                    
66                if (fTable[i] == EMPTY) {
                    
76        {
                    
77            for (int i = 0; i < SIZE; i++) {
                    
78                if (fTable[i] == index) {
                    
107        {
                    
108            for (int i = 0; i < SIZE && fTable[i] != EMPTY; i++) {
                    
109                if (fTable[i] == index)
                    
177        {
                    
178            for (int i = 0; i < SIZE; i++) {
                    
179                fTable[index][i] = 0;
                    
                
ServiceHandlersWidgetDefaultingCommand.java git://pkgs.fedoraproject.org/eclipse-wtp-jeetools | Java | 377 lines
                    
124	          List wsDescriptions = webServices.getWebServiceDescriptions();
                    
125	          for (int i = 0; i < wsDescriptions.size() ; i++) {
                    
126	 
                    
188      Vector handlers = new Vector();
                    
189      for (int i=0;i<services.length;i++){
                    
190        
                    
213        List descriptions  = services.getWebServiceDescriptions();
                    
214        for (int i=0;i<descriptions.size();i++){
                    
215          WebServiceDescription wsd = (WebServiceDescription)descriptions.get(i);
                    
319    int num= 0;
                    
320    for (int i=0;i<wsddRes.length;i++){
                    
321    	if (wsddRes[i]!=null) {
                    
341  	  Iterator iter = initSel.iterator();
                    
342  	  for (int i=0;i<initSel.size();i++) {
                    
343  		  Object obj = iter.next();
                    
                
dahdi_transcode.c git://pkgs.fedoraproject.org/dahdi-tools | C | 487 lines
                    
198
                    
199	for (i = 0; i < tc->numchannels; i++) {
                    
200		chan = &tc->channels[i];
                    
                
BeanNodeTest.java git://pkgs.fedoraproject.org/netbeans-platform | Java | 378 lines
                    
87        // Will have just one prop, 'foo'. OK to also have 'name' but we ignore it if so.
                    
88        for (int i = 0; i < props.length; i++) {
                    
89            if (props[i].getName().equals("foo") && prop == null) {
                    
127        Node.Property prop = null;
                    
128        for (int i = 0; i < props.length; i++) {
                    
129            if (props[i].getName().equals("yaya") && prop == null) {
                    
158        int cnt = 0;
                    
159        for (int i = 0; i < arr.length; i++) {
                    
160            cnt += arr[i].getProperties ().length;
                    
                
mloader.c git://pkgs.fedoraproject.org/libmikmod | C | 621 lines
                    
115		/* translate IT linefeeds */
                    
116		for(i=0;i<len;i++)
                    
117			if(of.comment[i]=='\r') of.comment[i]='\n';
                    
146			for(i=linelen;(i>=0)&&(line[i]==' ');i--) line[i]=0;
                    
147			for(i=0;i<linelen;i++) if (!line[i]) break;
                    
148			total+=1+i;
                    
159			for(line=tempcomment,t=0;t<lines;t++,line+=linelen) {
                    
160				for(i=0;i<linelen;i++) if(!(storage[i]=line[i])) break;
                    
161				storage[i]=0; /* if (i==linelen) */
                    
                
Chart.java git://pkgs.fedoraproject.org/jhdf5 | Java | 418 lines
                    
148                xmin = xmax = xData[0];
                    
149                for (int i = 0; i < len; i++) {
                    
150                    if (xData[i] < xmin) {
                    
247        ymin = ymax = data[0][0];
                    
248        for (int i = 0; i < numberOfLines; i++) {
                    
249            for (int j = 0; j < numberOfPoints; j++) {
                    
298            boolean gtOne = (dx >= 1);
                    
299            for (int i = 0; i <= xnpoints; i++) {
                    
300                x = xmin + i * dx;
                    
319            }
                    
320            for (int i = 0; i <= ynpoints; i++) {
                    
321                yp = i * dh;
                    
344                // draw lines for selected spreadsheet columns
                    
345                for (int i = 0; i < numberOfLines; i++) {
                    
346                    if ((lineColors != null)
                    
                
RubyArrayTests.cs https://hg.codeplex.com/quartz | C# | 360 lines
                    
29        private IEnumerable<int> Enumerable(int count) {
                    
30            for (int i = 0; i < count; i++) {
                    
31                yield return i + 1;
                    
43            var dict = new Dictionary<object, object>();
                    
44            for (int i = 0; i < N; i++) {
                    
45                dict.Add(i, i);
                    
129                Assert(item.Equals(values[i]));
                    
130                i++;
                    
131            }
                    
155
                    
156            for (int i = 0; i < Utils.MinListSize; i++) {
                    
157                a.Add(i);
                    
162            Assert(a.Count == Utils.MinListSize + 1);
                    
163            for (int i = 0; i < a.Count; i++) {
                    
164                Assert((int)a[i] == i);
                    
                
WSDLReaderImpl.java git://pkgs.fedoraproject.org/eclipse-wtp-webservices | Java | 424 lines
                    
140        ImportHolder[] importsArray = (ImportHolder[])imports.toArray(new ImportHolder[imports.size()]);
                    
141        for(int i = 0; i < importsArray.length; i++)
                    
142        {
                    
                
x09.java https://plplot.svn.sourceforge.net/svnroot/plplot | Java | 437 lines
                    
97       
                    
98	for (i = 0; i < XPTS; i++) {
                    
99            xx = (double) (i - (XPTS / 2)) / (double) (XPTS / 2);
                    
109	
                    
110	for (i = 0; i < XPTS; i++) {
                    
111            for (j = 0; j < YPTS; j++) {
                    
234    // Perimeter
                    
235	for (i = 0; i < PERIMETERPTS; i++) {
                    
236            t = (2.*Math.PI/(PERIMETERPTS-1))*(double)i;
                    
243   
                    
244	for (i = 0; i < RPTS; i++) {
                    
245            r = i/(double)(RPTS-1);
                    
253
                    
254	for (i = 0; i < 10; i++) {
                    
255            lev[i] = 0.05 + 0.10*(double) i;
                    
                
nwkSpeedup.c https://bitbucket.org/alanmi/abc/ | C | 0 lines
                    
107    nCofs = (1 << Vec_PtrSize(vTimes));
                    
108    for ( i = 0; i < nCofs; i++ )
                    
109    {
                    
                
options.js https://bitbucket.org/qwebirc/qwebirc/ | JavaScript | 504 lines
                    
201     
                    
202    for(var i=0;i<value.length;i++) {
                    
203      var d = this.FE("div", this.parentObject);
                    
215  get: function() {
                    
216    for(var i=0;i<this.elements.length;i++) {
                    
217      var x = this.elements[i];
                    
269  setSavedValue: function(x) {
                    
270    for(var i=0;i<this.options.length;i++) {
                    
271      var y = this.options[i][1];
                    
382    var optList = this.optionObject.getOptionList();
                    
383    for(var i=0;i<optList.length;i++) {
                    
384      var x = optList[i];
                    
                
ATL_gemvT_4x16_1.c git://pkgs.fedoraproject.org/atlas | C | 427 lines
                    
216            #endif
                    
217            for (i=0; i != N; i++) y0 += A[i] * X[i];
                    
218            *Y++ = y0;
                    
                
csbutton.cpp https://crystal.svn.sourceforge.net/svnroot/crystal | C++ | 487 lines
                    
125        rvy = bound.Height () - 1;
                    
126        for (int i = 3; i < aw; i++, dx--)
                    
127        {
                    
                
csscrbar.cpp https://crystal.svn.sourceforge.net/svnroot/crystal | C++ | 459 lines
                    
61	int i;
                    
62    for (i = 0; i < 12; i++)
                    
63      sprarrows [i] = new csSimplePixmap (scrolltex, i * 9, 0, 9, 9);
                    
91	int i;
                    
92    for (i = 0; i < 12; i++)
                    
93    {
                    
                
CompositeDependencyHandler.cs https://hg01.codeplex.com/clientdependency | C# | 277 lines
                    
80            //result. To date, it can't be replicated in VS, but we'll leave it here for error handling support... can't hurt
                    
81            for (int i = 0; i < 5; i++)
                    
82            {
                    
                
 

Source

Language