PageRenderTime 118ms queryFilters 0ms Sphinxql 33ms app.CodeModel.GetByIds 18ms findMatchingLines 17ms GetByIds 35ms meta 0ms repositoryFilters 7ms languageFilters 2ms sourceFilters 5ms

237,415 results for 'i++;' (118 ms)

Source

Language

Repository

svg_attributes.c https://github.com/svettom/gpac-1.git | C | 6,444 lines
809    /* warning the comma and semicolumn should not be there when parsing a number in a path */
810	while ((d[i] != 0) && strchr(" ,;\r\n\t", d[i])) i++;
811
816    if (d[i] == '+') {
817        i++;
818    } else if (d[i] == '-') {
819		is_negative = 1;
820		i++;
821	}
831        nb_digit_before++;
832		i++;
833	}
835        has_fractional = 1;
836		i++;
837		while (d[i] >= '0' && d[i] <= '9' && d[i] != 0) {
InputFallThrough.java https://github.com/marschall/checkstyle.git | Java | 410 lines
9            case 1:
10                i++;
11                break;
12            case 2:
13                i++;
14            case 3: //fall through!!!
14            case 3: //fall through!!!
15                i++;
16                break;
35            case 11: {
36                i++;
37            }
71                try {
72                    i++;
73                    break;
StatisticsDlg.cpp https://github.com/acat/emule.git | C++ | 3,498 lines
813						stattree.SetItemText( down_scb[i] , cbuffer );
814						i++;
815
822						stattree.SetItemText( down_scb[i] , cbuffer );
823						i++;
824
831						stattree.SetItemText( down_scb[i] , cbuffer );
832						i++;
833
840						stattree.SetItemText( down_scb[i] , cbuffer );
841						i++;
842
849						stattree.SetItemText( down_scb[i] , cbuffer );
850						i++;
851
stat.xs https://github.com/gitpan/vms-stat.git | Unknown | 176 lines
113	    i = 0;
114	    sv_setpv(ST(i),"ai"); i++;
115	    ST(i) = ( fab.fab$v_ai ) ? &PL_sv_yes : &PL_sv_no; i++;
115	    ST(i) = ( fab.fab$v_ai ) ? &PL_sv_yes : &PL_sv_no; i++;
116	    sv_setpv(ST(i),"alq"); i++;
117	    sv_setiv(ST(i),fab.fab$l_alq); i++;
118            /* bdt skipped for now */
119	    /* sv_setpv(ST(i),"bdt"); i++; */
120	    sv_setpv(ST(i),"bi"); i++;
120	    sv_setpv(ST(i),"bi"); i++;
121	    ST(i) = ( fab.fab$v_bi ) ? &PL_sv_yes : &PL_sv_no; i++;
122	    sv_setpv(ST(i),"bks"); i++;
122	    sv_setpv(ST(i),"bks"); i++;
123	    sv_setiv(ST(i),fab.fab$b_bks); i++;
124	    sv_setpv(ST(i),"bls"); i++;
read_datasets.h https://github.com/lionelc/ANN-TrCL.git | C++ Header | 805 lines
70			tempchar[firstmark] = tempstr[i];
71			i++;
72			firstmark++;
83		{
84			i++;
85		}
89			tempchar[firstmark] = tempstr[i];
90			i++;
91			firstmark++;
101		{
102			i++;
103		}
107			tempchar[firstmark] = tempstr[i];
108			i++;
109			firstmark++;
gp.c https://gitlab.com/lima-ncc1988/lima-ncc1988.git | C | 859 lines
81	cmds[i].cmd = LIMA_PLBU_CMD_VIEWPORT_X;
82	i++;
83
85	cmds[i].cmd = LIMA_PLBU_CMD_VIEWPORT_W;
86	i++;
87
89	cmds[i].cmd = LIMA_PLBU_CMD_VIEWPORT_Y;
90	i++;
91
93	cmds[i].cmd = LIMA_PLBU_CMD_VIEWPORT_H;
94	i++;
95
154	cmds[i].cmd = LIMA_PLBU_CMD_PRIMITIVE_SETUP;
155	i++;
156
convert.c https://gitlab.com/ImageMagick/ImageMagick.git | C | 3,293 lines
631          {
632            i++;
633            if (i == (ssize_t) argc)
640          {
641            i++;
642            if (i == (ssize_t) argc)
649          {
650            i++;
651            if (i == (ssize_t) argc)
662              break;
663            i++;
664            if (i == (ssize_t) argc)
676              break;
677            i++;
678            if (i == (ssize_t) argc)
display.c https://gitlab.com/ImageMagick/ImageMagick.git | C | 1,881 lines
390        */
391        i++;
392        if (i == (ssize_t) argc)
659              break;
660            i++;
661            if (i == (ssize_t) argc)
675              break;
676            i++;
677            if (i == (ssize_t) argc)
695              break;
696            i++;
697            if (i == (ssize_t) argc)
705              break;
706            i++;
707            if (i == (ssize_t) argc)
Cheats.cpp https://bitbucket.org/ZachThibeau/vba-m | C++ | 2,899 lines
602    case GSA_8_BIT_SLIDE:
603      i++;
604      if(i < cheatsNumber) {
618    case GSA_16_BIT_SLIDE:
619      i++;
620      if(i < cheatsNumber) {
634    case GSA_32_BIT_SLIDE:
635      i++;
636      if(i < cheatsNumber) {
650    case GSA_8_BIT_GS_WRITE2:
651      i++;
652      if(i < cheatsNumber) {
658    case GSA_16_BIT_GS_WRITE2:
659      i++;
660      if(i < cheatsNumber) {
pass2.cc https://bitbucket.org/JaFojtik/wp2latex | C++ | 1,858 lines
643	    Helps[j] = Helps[i];
644	    i++;
645	    j++;
763	 Helps[i] = Helps[j];
764	 i++;
765	 j++;
815	 k++;
816	 i++;
817	 } 
861	Helps[i] = Helps[k];
862	i++; k++;
863	}    
868	 Helps[i] = Helps[j];
869	 i++;
870	 j++;
http_parse.c https://bitbucket.org/madeye/shadowsocks-android.git | C | 1,548 lines
123    int x, y;
124    while(buf[i] == ' ') i++;
125    if(buf[i] == '\n' || buf[i] == '\r') return -1;
126    x = i;
127    while(buf[i] > 32 && buf[i] < 127) i++;
128    y = i;
140
141    i++;
142    while(1) {
156        } else {
157            i++;
158        }
168        if(buf[i] == ' ' || buf[i] == '\t')
169            i++;
170        else  if(buf[i] == '(') {
TestVectorStringExpressions.java git://github.com/apache/hive.git | Java | 5,602 lines
360      Assert.assertTrue(vectorEqual(outV, i, blue, 0, expectedResultLen));
361      i++;
362      Assert.assertTrue(StringExpr.characterCount(redgreen, 0, redgreen.length) == 8);
365      Assert.assertTrue(vectorEqual(outV, i, redgreen, 0, expectedResultLen));
366      i++;
367      Assert.assertTrue(StringExpr.characterCount(ascii_sentence, 0, ascii_sentence.length) == 31);
370      Assert.assertTrue(vectorEqual(outV, i, ascii_sentence, 0, expectedResultLen));
371      i++;
372      Assert.assertTrue(StringExpr.characterCount(blanksLeft, 0, blanksLeft.length) == 5);
375      Assert.assertTrue(vectorEqual(outV, i, blanksLeft, 0, expectedResultLen));
376      i++;
377
385      Assert.assertTrue(vectorEqual(outV, i, sentenceBlankRanges, 0, expectedResultLen));
386      i++;
387      Assert.assertTrue(StringExpr.characterCount(sentenceBlankRanges, 0, sentenceBlankRangesLen - 3) == 16);
terminator.c https://github.com/rajatkhanduja/Dabblings-in-OpenGL.git | C | 1,735 lines
1325      shoulder2Subtract();
1326      i++;
1327    }
1330      shoulder2Add();
1331      i++;
1332    }
1335      shoulder1Subtract();
1336      i++;
1337    }
1340      shoulder1Add();
1341      i++;
1342    }
1345      shoulder3Add();
1346      i++;
1347    }
Sorollet-legacy.js https://github.com/ehsan/to_the_beat.git | JavaScript | 200 lines
15		// bpm, speed, num channels
16		player.setBPM(song[i]); i++;
17		// legacy // player.setSpeed(song[i]);
17		// legacy // player.setSpeed(song[i]);
18		i++;
19		var numVoices = song[i]; i++;
31		// Order list
32		var numOrders = song[i]; i++;
33
34		for(j = 0; j < numOrders; j++) {
35			player.orderList.push(song[i]); i++;
36		}
38		// Patterns
39		var numPatterns = song[i]; i++;
40
mocha_test.js https://github.com/zybjtu/node-webkit.git | JavaScript | 102 lines
46	// general
47	assert.notEqual(original[i], changed[i]); i++;
48	assert.notEqual(original[i], changed[i]); i++;
48	assert.notEqual(original[i], changed[i]); i++;
49	assert.notEqual(original[i], changed[i]); i++;
50	assert.notEqual(original[i], changed[i]); i++;
50	assert.notEqual(original[i], changed[i]); i++;
51	assert.equal((original[i] + 1) % 4, changed[i]); i++;
52	assert.notEqual(original[i], changed[i]); i++;
52	assert.notEqual(original[i], changed[i]); i++;
53	assert.notEqual(original[i], changed[i]); i++;
54	assert.notEqual(original[i], changed[i]); i++;
54	assert.notEqual(original[i], changed[i]); i++;
55	assert.notEqual(original[i], changed[i]); i++;
56	assert.notEqual(original[i], changed[i]); i++;
bg_saga.c https://github.com/Stoiss/jaMME.git | C | 1,509 lines
185		i_r++;
186		i++;
187	}
208				{
209					i++;
210				}
224					j++;
225					i++;
226				}
233					{
234						i++;
235					}
237					{
238						i++;
239					}
ScoreRuntime.cc https://github.com/nachiket/ScoreRuntime.git | C++ | 1,125 lines
199
200    i++;
201
319
320      i++;
321
326
327      i++;
328
333
334      i++;
335
340
341      i++;
342      if (TONY_GRAPH) {
MathTest.java https://github.com/tisoft/xmlvm.git | Java | 260 lines
33        // acos:
34        i++;
35        result[i] = Double.isNaN(Math.acos(Double.NaN));
36        description[i] = "acos(NaN) == NaN";
37        i++;
38        result[i] = Double.isNaN(Math.acos(1.1D));
39        description[i] = "acos(x) == NaN, for some x>1";
40        i++;
41        result[i] = Double.isNaN(Math.acos(-1.1D));
42        description[i] = "acos(x) == NaN, for some x<-1";
43        i++;
44        diff = Double.doubleToLongBits(
50        description[i] = "|cos(acos(x))-x|<= 1ulp, for some |x|<=1";
51        i++;
52        diff = Double.doubleToLongBits(
cki_objs.c https://github.com/secure-endpoints/kcacred.git | C | 1,398 lines
375    }
376    i++;
377	
490    }
491    i++;
492
500    }
501    i++;
502	
510    }
511    i++;
512
520    }
521    i++;
522
SensorsModule.cpp https://github.com/wdawson/nbites.git | C++ | 511 lines
44    }
45    i++;
46
53    }
54    i++;
55
62    }
63    i++;
64
70    }
71    i++;
72
78    }
79    i++;
80
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21