PageRenderTime 512ms queryFilters 0ms Sphinxql 234ms GetByIds 243ms meta 0ms repositoryFilters 3ms languageFilters 1ms sourceFilters 2ms

829,250 results for 'i++;' (512 ms)

Source

Language

Repository

context.cpp https://bitbucket.org/jurgen_kluft/symphony | C++ | 600 lines
128		{
129			i++;
130			if(parseSlurpieServer(c,argv[i]))
135		{
136			i++;
137			c->destFileName = strdup(argv[i]);
142		{
143			i++;
144			c->maxNumOfNeighbors = atoi(argv[i]);
149		{
150			i++;
151			c->magicTime = atoi(argv[i]);
156		{
157			i++;
158			c->numberOfBlocks = atoi(argv[i]);
context.c https://bitbucket.org/jurgen_kluft/symphony | C | 585 lines
142    if((!strcmp(argv[i],"-s"))&&(i+1<argc)){
143      i++;
144      if(parseSlurpieServer(c,argv[i]))
148    if((!strcmp(argv[i],"-o"))&&(i+1<argc)){
149      i++;
150      c->destFileName = strdup(argv[i]);
154    if((!strcmp(argv[i],"-N"))&&(i+1<argc)){
155      i++;
156      c->maxNumOfNeighbors = atoi(argv[i]);
160    if((!strcmp(argv[i],"-m"))&&(i+1<argc)){
161      i++;
162      c->magicTime = atoi(argv[i]);
166    if((!strcmp(argv[i],"-n"))&&(i+1<argc)){
167      i++;
168      c->numberOfBlocks = atoi(argv[i]);
InitLocalsTests.cs https://bitbucket.org/JoelKunze/netduinogofirmware | C# | 284 lines
78                fRes &= name == "Int32";
79                i++;
80
84                fRes &= name.ToLower() == "default";
85                i++;
86
90                fRes &= name.ToLower() == "mscorlib";
91                i++;
92
96                fRes &= name == "TestObj";
97                i++;
98
103                fRes &= iface.Name == "IEmptyInterface";
104                i++;
105
nes.c https://bitbucket.org/bigxie/android-omap-tuna | C | 1,247 lines
833		}
834		i++;
835	}
859		}
860		i++;
861	}
879			}
880			i++;
881		}
896		}
897		i++;
898	}
917			}
918			i++;
919		}
txt2las.c https://bitbucket.org/olahlou/otb | C | 918 lines
412        {
413            i++;
414            parse_string = argv[i];
421
422            i++;
423            sscanf(argv[i], "%lf", &(xyz_scale[2]));
430        {
431            i++;
432            sscanf(argv[i], "%lf", &(xyz_scale[0]));
432            sscanf(argv[i], "%lf", &(xyz_scale[0]));
433            i++;
434            sscanf(argv[i], "%lf", &(xyz_scale[1]));
434            sscanf(argv[i], "%lf", &(xyz_scale[1]));
435            i++;
436            sscanf(argv[i], "%lf", &(xyz_scale[2]));
h264bsd_slice_header.c https://bitbucket.org/kejar31/android_frameworks_base | C | 1,512 lines
156    while (pSeqParamSet->maxFrameNum >> i)
157        i++;
158    i--;
187        while (pSeqParamSet->maxPicOrderCntLsb >> i)
188            i++;
189        i--;
532                            }
533            i++;
534        } while (command != 3);
694
695                i++;
696            } while (operation != 0);
827    while (maxFrameNum >> i)
828        i++;
829    i--;
nes.c https://bitbucket.org/kgp700/siyahkernel | C | 1,226 lines
814		}
815		i++;
816	}
840		}
841		i++;
842	}
860			}
861			i++;
862		}
877		}
878		i++;
879	}
898			}
899			i++;
900		}
armlet-simple.c https://github.com/kjk/noah-palm.git | C | 972 lines
112    while(str[i] != '\0')
113        i++;
114    return i;
124        dst[i] = (char) src[i];
125        i++;
126    }
137        dst[i] = src[j];
138        i++;
139        j++;
343    while( !IsTagInLine(pos1[i],pos1[i+1]) && pos1[i+1]!='\0')
344        i++;
345    len1 = i;
348    while( !IsTagInLine(pos2[i],pos2[i+1]) && pos2[i+1]!='\0')
349        i++;
350    len2 = i;
NetworkingClientComms.java https://github.com/societies/SOCIETIES-SCE-Services.git | Java | 898 lines
232			try {
233				i++;
234				Thread.sleep(WAIT_TIME_SECS);
276					try {
277						i++;
278						Thread.sleep(WAIT_TIME_SECS);
320					try {
321						i++;
322						Thread.sleep(WAIT_TIME_SECS);
364					try {
365						i++;
366						Thread.sleep(WAIT_TIME_SECS);
412					try {
413						i++;
414						Thread.sleep(WAIT_TIME_SECS);
indicateurs.c https://github.com/sylafrs/Dames.git | C | 341 lines
59                    possible = (plateau[sourceX+i][sourceY+i].pion == non);
60                    i++;
61                }
70                    possible = (plateau[sourceX+i][sourceY-i].pion == non);
71                    i++;
72                }
81                    possible = (plateau[sourceX-i][sourceY-i].pion == non);
82                    i++;
83                }
92                    possible = (plateau[sourceX-i][sourceY+i].pion == non);
93                    i++;
94                }
112                        possible = (plateau[sourceX+i][sourceY+i].pion == non);
113                        i++;
114                    }
jsdecoder.js https://github.com/jinbo51/DiscuzX.git | JavaScript | 1,149 lines
35            this.switch_c(c);
36            this.i++;
37        }
173        {
174            i++;
175            var c = this.s.charAt(i);
444
445        this.i++;
446
556            }
557            this.i++;
558        }
642        {
643            i++;
644            var c = this.s.charAt(i);
cvsps.c https://github.com/jamesblackburn/cvsps.git | C | 2,697 lines
643	    do_diff = 1;
644	    i++;
645	    continue;
749
750	    i++;
751	    continue;
756	    update_cache = 1;
757	    i++;
758	    continue;
764	    update_cache = 1;
765	    i++;
766	    continue;
794	    debuglvl = ~0;
795	    i++;
796	    continue;
parseSpec.js https://github.com/thebigredgeek/angular.js.git | JavaScript | 1,431 lines
28
29      i++;
30      expect(tokens[i].index).toEqual(4);
32
33      i++;
34      expect(tokens[i].index).toEqual(5);
36
37      i++;
38      expect(tokens[i].index).toEqual(7);
40
41      i++;
42      expect(tokens[i].index).toEqual(8);
44
45      i++;
46      expect(tokens[i].index).toEqual(9);
script.js https://bitbucket.org/Spuntagano/chess.git | JavaScript | 762 lines
208
209				i++;
210				while(Chess.tiles[i] != undefined && Chess.tiles[i][j] != undefined && Chess.tiles[i][j] == "empty"){
211					Chess.getTileHTML(i, j).addClass("move");
212					i++;
213				}
412
413				i++;
414				j++;
416					Chess.getTileHTML(i, j).addClass("move");
417					i++;
418					j++;
461					Chess.getTileHTML(i, j).addClass("move");
462					i++;
463					j--;
parseSpec.js https://github.com/myitcv/angular.js.git | JavaScript | 1,280 lines
28
29      i++;
30      expect(tokens[i].index).toEqual(4);
32
33      i++;
34      expect(tokens[i].index).toEqual(5);
36
37      i++;
38      expect(tokens[i].index).toEqual(7);
40
41      i++;
42      expect(tokens[i].index).toEqual(8);
44
45      i++;
46      expect(tokens[i].index).toEqual(9);
parseSpec.js https://github.com/agiza/angular.js.git | JavaScript | 1,174 lines
28
29      i++;
30      expect(tokens[i].index).toEqual(4);
32
33      i++;
34      expect(tokens[i].index).toEqual(5);
36
37      i++;
38      expect(tokens[i].index).toEqual(7);
40
41      i++;
42      expect(tokens[i].index).toEqual(8);
44
45      i++;
46      expect(tokens[i].index).toEqual(9);
pngdefry.c https://github.com/appurify/pngdefry.git | C | 1,515 lines
834		total_idat_size += pngChunks[i].length;
835		i++;
836	}
841			break;
842		i++;
843	}
906			total_idat_size += pngChunks[i].length;
907			i++;
908		}
1211		if (pngChunks[0].id == 0x43674249)	/* "CgBI" */
1212			i++;
1213		while (i < num_chunks && pngChunks[i].id != 0x49444154)	/* "IDAT" */
1223			fputc ( (pngChunks[i].crc32      ) & 0xff, write_file);
1224			i++;
1225		}
parseSpec.js https://github.com/thanushcst/angular.js.git | JavaScript | 1,184 lines
28
29      i++;
30      expect(tokens[i].index).toEqual(4);
32
33      i++;
34      expect(tokens[i].index).toEqual(5);
36
37      i++;
38      expect(tokens[i].index).toEqual(7);
40
41      i++;
42      expect(tokens[i].index).toEqual(8);
44
45      i++;
46      expect(tokens[i].index).toEqual(9);
PlayerEnumerable.cs https://github.com/EpicClowny/LegendCraft.git | C# | 688 lines
474                    player.Send( packet );
475                    i++;
476                }
495                    player.Send( packet );
496                    i++;
497                }
520                    player.Send( packet );
521                    i++;
522                }
543                    player.Send( packet );
544                    i++;
545                }
564                    player.Send( packet );
565                    i++;
566                }
D3D11PipelineStateViewer.cs https://github.com/tgAncel/renderdoc.git | C# | 2,139 lines
315                    }
316                    i++;
317                }
398
399                    i++;
400                }
461                    }
462                    i++;
463                }
480
481                    i++;
482                }
635
636                    i++;
637                }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21