PageRenderTime 764ms queryFilters 0ms Sphinxql 205ms GetByIds 98ms meta 0ms repositoryFilters 106ms languageFilters 172ms sourceFilters 84ms

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

Source

Language

Repository

regress-111557.js https://bitbucket.org/rbair/rbair-controls-8 | JavaScript | 10,961 lines
62	top.titles[i] =  "NDS Libraries for C";
63	i++;
64
66	top.titles[i] =  "NDS Backup Services";
67	i++;
68
70	top.titles[i] =  "Functions";
71	i++;
72
74	top.titles[i] =  "NDSBackupServerData";
75	i++;
76
78	top.titles[i] =  "NDSFreeNameList";
79	i++;
80
ReflectionTest2.java https://github.com/tisoft/xmlvm.git | Java | 354 lines
53        // getSuperClass:
54        i++;
55        result[i] = java.lang.Object.class.getSuperclass() == null;
56        description[i] = "java.lang.Object.class.getSuperclass() == null";
57        i++;
58        result[i] = int.class.getSuperclass() == null;
61        // getName, getSimpleName, getCanonicalName
62        i++;
63        result[i] = java.lang.Object.class.getName().equals("java.lang.Object");
64        description[i] = "java.lang.Object.class.getName().equals(\"java.lang.Object\")";
65        i++;
66        result[i] = java.lang.Object.class.getCanonicalName().equals("java.lang.Object");
67        description[i] = "java.lang.Object.class.getCanonicalName().equals(\"java.lang.Object\")";
68        i++;
69        result[i] = java.lang.Object.class.getSimpleName().equals("Object");
markdown.cpp https://github.com/ellert/doxygen.git | C++ | 2,456 lines
244                     data[i]!='\\' && data[i]!='@' &&
245                     data[i]!='\n') i++;
246    //printf("findEmphasisChar: data=[%s] i=%d c=%c\n",data,i,data[i]);
251    {
252      i++;
253      continue;
278      int snb=0;
279      while (i<size && data[i]=='`') snb++,i++;
280
286        if (snb==1 && data[i]=='\'') break; // ` ended by '
287        i++;
288      }
294      {
295        i++;
296        int l = endBlockName.length();
markdown.c https://github.com/jpsullivan/writeily.git | C | 2,885 lines
163		while (i < src->size && src->data[i] != '\\')
164			i++;
165
387	while (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))
388		i++;
389
398		*autolink = HOEDOWN_AUTOLINK_NORMAL;
399		i++;
400	}
413					break;
414			else i++;
415		}
423	/* looking for sometinhg looking like a tag end */
424	while (i < size && data[i] != '>') i++;
425	if (i >= size) return 0;
svg_attributes.c https://github.com/paulcbetts/yikes.git | C | 5,817 lines
714	u32 i = 0;
715	while ((d[i] != 0) && strchr(" ,;\r\n\t", d[i])) i++;
716	if (!d[i]) goto end;
716	if (!d[i]) goto end;
717	if (d[i] == '+') i++;
718	if (d[i] == '-') {
719		is_negative = 1;
720		i++;
721	}
723		_val = _val*10 + (d[i]-'0');
724		i++;
725	}
728		u32 nb_digit_after = 0;
729		i++;
730		while (d[i] >= '0' && d[i] <= '9' && d[i] != 0) {
history.diff https://github.com/zet/bombus.git | diff | 920 lines
629+        j++;
630+        i++;
631+        Translit_chars[i] = "B".toCharArray();
633+        j++;
634+        i++;
635+        Translit_chars[i] = "V".toCharArray();
637+        j++;
638+        i++;
639+        Translit_chars[i] = "G".toCharArray();
641+        j++;
642+        i++;
643+        Translit_chars[i] = "D".toCharArray();
645+        j++;
646+        i++;
647+        Translit_chars[i] = "E".toCharArray();
svg_attributes.c https://github.com/svettom/gpac.git | C | 6,455 lines
820    /* warning the comma and semicolumn should not be there when parsing a number in a path */
821	while ((d[i] != 0) && strchr(" ,;\r\n\t", d[i])) i++;
822
827    if (d[i] == '+') {
828        i++;
829    } else if (d[i] == '-') {
830		is_negative = 1;
831		i++;
832	}
842        nb_digit_before++;
843		i++;
844	}
846        has_fractional = 1;
847		i++;
848		while (d[i] >= '0' && d[i] <= '9' && d[i] != 0) {
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;
Transform.java https://bitbucket.org/dmwelch/phdxnat_pipeline | Java | 1,254 lines
162                        useAssociatedStylesheet = true;
163                        i++;
164                    } else if (option.equals("c")) {
168                        }
169                        i++;
170                    } else if (option.equals("cr")) {
170                    } else if (option.equals("cr")) {
171                        i++;
172                        if (value == null) {
182                                new Integer(Builder.LINKED_TREE));
183                        i++;
184                    } else if (option.equals("dt")) {
186                                new Integer(Builder.TINY_TREE));
187                        i++;
188                    } else if (option.equals("dtd")) {
Query.java https://bitbucket.org/dmwelch/phdxnat_pipeline | Java | 1,038 lines
330                    backup = "on".equals(value);
331                    i++;
332                } else if (option.equals("cr")) {                // collection resolver
332                } else if (option.equals("cr")) {                // collection resolver
333                    i++;
334                    if (value == null) {
347                    config.setTreeModel(Builder.LINKED_TREE);
348                    i++;
349                } else if (option.equals("dt")) {         // tiny tree (default)
350                    config.setTreeModel(Builder.TINY_TREE);
351                    i++;
352                } else if (option.equals("dtd")) {
356                    config.setValidation("on".equals(value));
357                    i++;
358                } else if (option.equals("e")) {          // explain
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++;
cki_ssleay.c https://github.com/secure-endpoints/kcacred.git | C | 1,013 lines
145	goto error;
146    i++;
147	
152	goto error;
153    i++;
154
159	goto error;
160    i++;
161	
166	goto error;
167    i++;
168	
178    label = NULL;
179    i++;
180	
lib557.c https://bitbucket.org/vlaznev/curl | C | 1,402 lines
127  i=1; us_test[i].num = 0xFFU; us_test[i].expected = "256";
128  i++; us_test[i].num = 0xF0U; us_test[i].expected = "240";
129  i++; us_test[i].num = 0x0FU; us_test[i].expected = "15";
130
131  i++; us_test[i].num = 0xE0U; us_test[i].expected = "224";
132  i++; us_test[i].num = 0x0EU; us_test[i].expected = "14";
133
134  i++; us_test[i].num = 0xC0U; us_test[i].expected = "192";
135  i++; us_test[i].num = 0x0CU; us_test[i].expected = "12";
136
137  i++; us_test[i].num = 0x01U; us_test[i].expected = "1";
138  i++; us_test[i].num = 0x00U; us_test[i].expected = "0";
144  i=1; us_test[i].num = 0xFFFFU; us_test[i].expected = "65535";
145  i++; us_test[i].num = 0xFF00U; us_test[i].expected = "65280";
146  i++; us_test[i].num = 0x00FFU; us_test[i].expected = "255";
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++;
mocha_test.js https://github.com/qiongocean/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++;
cmd_data.c https://github.com/svettom/gpac.git | C | 866 lines
451		}
452		i++;
453	}
467		if (strcmp(argv[i], "-a") == 0 || strcmp(argv[i], "-v") == 0 || strcmp(argv[i], "-av") == 0) {
468			i++;
469			if (i >= argc) {
492
493			i++;
494		} else if (strcmp(argv[i], "-af") == 0 || strcmp(argv[i], "-vf") == 0) {
494		} else if (strcmp(argv[i], "-af") == 0 || strcmp(argv[i], "-vf") == 0) {
495			i++;
496			if (i >= argc) {
519
520			i++;
521		} else if (strcmp(argv[i], "-pixf") == 0) {
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(
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21