PageRenderTime 877ms queryFilters 0ms Sphinxql 233ms GetByIds 585ms meta 0ms repositoryFilters 6ms languageFilters 6ms sourceFilters 2ms

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

Source

Language

Repository

oauth.js https://github.com/javascript-forks/oauth-io.oauth-js.git | JavaScript | 1,186 lines
844      }
845      i++;
846    }
903      opad[i] = bkey[i] ^ 0x5C5C5C5C;
904      i++;
905    }
923      output += hex_tab.charAt((x >>> 4) & 0x0F) + hex_tab.charAt(x & 0x0F);
924      i++;
925    }
966      dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
967      i++;
968    }
979        }
980        i++;
981      }
cffparse.c https://github.com/hunslater/pdfium.git | C | 1,178 lines
805#undef CFF_FIELD
806#define CFF_FIELD( code, name, id, kind ) i++;
807#undef CFF_FIELD_DELTA
807#undef CFF_FIELD_DELTA
808#define CFF_FIELD_DELTA( code, name, max, id ) i++;
809#undef CFF_FIELD_CALLBACK
809#undef CFF_FIELD_CALLBACK
810#define CFF_FIELD_CALLBACK( code, name, id ) i++;
811
813
814    i++; /* { 0, 0, 0, 0, 0, 0, 0 } */
815
833          clazz[i].count_offset = 0;                   \
834          i++;
835
assign3.cpp https://github.com/ravikumarj/Alpha-beta-pruning.git | C++ | 1,590 lines
1258			temp=Pruned_MinValue(*it,0,-65535,65535);//pass Vertex number
1259			i++;
1260			}
1288                        temp=Pruned_MinValue(*it,1,-65535,65535);//pass Vertex number
1289                       i++; 
1290                        }
1440				source[j]=line[i];
1441				i++;
1442				j++;
1443			}
1444			i++;
1445			j=0;
1448				dest[j]=line[i];
1449				i++;
1450				j++;
merge.c https://github.com/R-Finance/xts.git | C | 1,239 lines
160      yp++;
161      if(right_join) i++;
162    } else
164      xp++;
165      if(left_join) i++;
166    } else
170      xp++;
171      i++;
172    } else
175      xp++;
176      if(left_join) i++;
177    } else
180      yp++;
181      if(right_join) i++;
182    } else
main.c https://github.com/eslopez92/Binary_Search_Tree.git | C | 368 lines
41        *(str + i) = temp_char;//assigns character to the string
42        i++;
43	}//end while
59    //    printf("%c",*(root->word + i));
60    //    i++;
61    //}
156          *(wrd->word + i) = *(str + char_index);
157          i++;
158          char_index++;//traversing through the string
163            *(wrd->word + i) = NULL;
164            i++;
165        }
200
201            i++;
202
DBAccess.cpp https://github.com/olympum/GoldenCheetah.git | C++ | 1,112 lines
690                summaryMetrics.setForSymbol(underscored.replace("_"," "), query.value(i+4).toDouble());
691                i++;
692            } else if (!context->specialFields.isMetric(field.name) && field.type < 3) {
694                summaryMetrics.setText(underscored.replace("_"," "), query.value(i+4).toString());
695                i++;
696            }
767                summaryMetrics.setForSymbol(underscored.replace("_"," "), query.value(i+4).toDouble());
768                i++;
769            } else if (!context->specialFields.isMetric(field.name) && (field.type < 3 || field.type == 7)) {
771                summaryMetrics.setText(underscored.replace("_"," "), query.value(i+4).toString());
772                i++;
773            }
815                summaryMetrics.setForSymbol(underscored.replace(" ","_"), query.value(i+3).toDouble());
816                i++;
817            } else if (!context->specialFields.isMetric(field.name) && (field.type < 3 || field.type == 7)) {
Graph.as https://github.com/Jonono2/metasploit-framework.git | ActionScript | 412 lines
50				array[i] = new Vector.<int>(1);
51				i++;
52			};
56				array[i] = new Vector.<int>(vector_size);
57				i++;
58			};
62				array[i].length = 0;
63				i++;
64			};
98					};
99					i++;
100				};
122				if (val == 0x90001B) break;
123				i++;
124			};
RowSpec.java https://github.com/haoyuan/hbase.git | Java | 409 lines
56    while (path.charAt(i) == '/') {
57      i++;
58    }
72        sb.append(c);
73        i++;
74      }
74      }
75      i++;
76      String row = startRow = sb.toString();
126          column.setLength(0);
127          i++;
128          continue;
130        column.append(c);
131        i++;
132      }
text_import.c https://github.com/svettom/gpac.git | C | 2,131 lines
203				else if ( (szLine[i] & 0xe0) == 0xc0) {
204					szLineConv[j] = szLine[i]; i++; j++;
205				}
207				else if ( (szLine[i] & 0xf0) == 0xe0) {
208					szLineConv[j] = szLine[i]; i++; j++;
209					szLineConv[j] = szLine[i]; i++; j++;
212				else if ( (szLine[i] & 0xf8) == 0xf0) {
213					szLineConv[j] = szLine[i]; i++; j++;
214					szLineConv[j] = szLine[i]; i++; j++;
214					szLineConv[j] = szLine[i]; i++; j++;
215					szLineConv[j] = szLine[i]; i++; j++;
216				} else {
578				j++;
579				i++;
580			}
text_import.c https://github.com/svettom/gpac-1.git | C | 1,713 lines
191				else if ( (szLine[i] & 0xe0) == 0xc0) {
192					szLineConv[j] = szLine[i]; i++; j++;
193				} 
195				else if ( (szLine[i] & 0xf0) == 0xe0) {
196					szLineConv[j] = szLine[i]; i++; j++;
197					szLineConv[j] = szLine[i]; i++; j++; 
200				else if ( (szLine[i] & 0xf8) == 0xf0) {
201					szLineConv[j] = szLine[i]; i++; j++;
202					szLineConv[j] = szLine[i]; i++; j++; 
202					szLineConv[j] = szLine[i]; i++; j++; 
203					szLineConv[j] = szLine[i]; i++; j++; 
204				} else {
549				j++;
550				i++;
551			}
gameswf_disasm.cpp https://github.com/qinxiaog/cocos2dx-swf.git | C++ | 866 lines
658					int	type = instruction_data[3 + i];
659					i++;
660					log_msg("\t\t");	// indent
667							log_msg("%c", instruction_data[3 + i]);
668							i++;
669						}
669						}
670						i++;
671						log_msg("\"\n");
699						int	reg = instruction_data[3 + i];
700						i++;
701						log_msg("reg[%d]\n", reg);
705						int	bool_val = instruction_data[3 + i];
706						i++;
707						log_msg("bool(%d)\n", bool_val);
disk_harmonic_map.js https://github.com/cfwen/extremal.git | JavaScript | 10,702 lines
745    if (type === 0) {
746      i++;
747      continue;
775    else if (t == 0 && !length) break;
776    i++;
777    if (length && i == length) break;
920    function parseNested() {
921      i++;
922      if (func[i] === 'K') i++; // ignore const
925        if (func[i] === 'S') { // substitution
926          i++;
927          var next = func.indexOf('_', i);
945      }
946      i++; // skip E
947      return parts;
plopt.c https://github.com/markangelo/PX4NuttX.git | C | 251 lines
81            } /* end if */
82          else i++;
83          break;
137              pptr[i]->arg2 = 0;
138              i++;
139            } /* end else if */
139            } /* end else if */
140          else i++;
141          break;
143       default     :
144         i++;
145         break;
181            } /* end if */
182          else i++;
183          break;
profiles.c https://github.com/pffy/Amaya-Editor.git | C | 998 lines
288            DeleteTable (ctxt->ProEntries[i].ProSubModule, FALSE);
289          i++;
290        }
319             strcmp (name, current->ProEntries[i].ProName))
320        i++;
321      found = (i < MAX_ENTRIES && current->ProEntries[i].ProName);
349      while (element[i] != PROFILE_END)
350        i++;
351      element[i] = EOS;
363      while (element[i] != DOCTYPE_END)
364        i++;
365      element[i] = EOS;
377      while (element[i] != MODULE_END)
378        i++;
379      element[i] = EOS;
Tokenizer.cpp https://github.com/Stoiss/jaMME.git | C++ | 2,869 lines
1448	{
1449		i++;
1450	}
1455		{
1456			i++;
1457		}
1474	{
1475		i++;
1476	}
1481		{
1482			i++;
1483		}
1558		}
1559		i++;
1560	}
vtkImageConnectivity.cxx https://github.com/lorensen/Slicer.git | C++ | 891 lines
333          inPtr0++;
334          i++;
335          }//for0
356              }
357            i++;
358            inPtr0++;
398          inPtr0++;
399          i++;
400          }//for0
493              }
494            i++;
495            }//for0
515              }
516            i++;
517            }//for0
encoder.c https://github.com/ecd/jiffy.git | C | 841 lines
268                esc_extra += 1;
269                i++;
270                continue;
273                    esc_extra += 5;
274                    i++;
275                    continue;
276                } else if(data[i] < 0x80) {
277                    i++;
278                    continue;
310                e->u[e->i++] = data[i];
311                i++;
312                continue;
315                e->p[e->i++] = 'b';
316                i++;
317                continue;
gpdtsolve.cpp https://github.com/mikelfer/shogun.git | C++ | 1,577 lines
484              }
485              i++;
486          }
564          }
565          i++;
566      }
578              }
579              i++;
580          }
590                  }
591                  i++;
592              }
1423          {
1424              while (a[i] < x) i++;
1425              while (a[j] > x) j--;
xml2json.js https://github.com/floviolleau/exchangecalendar.git | JavaScript | 954 lines
424		result = result + aParent[tcontent][i];
425		i++;
426	}
441		}
442		i++;
443	}
472			result.push(aParent[telements][i]);
473			i++;
474		}
520			}
521			i++;
522		}
549				result = result + aElement[tcontent][i];
550				i++;
551			}
LocalIntervalWikiRevisionETLReader.java https://github.com/giangbinhtran/Hedera.git | Java | 252 lines
68						if (b == START_ID[i]) {
69							i++;
70						} else i = 0;
80						if (b == END_ID[i]) {
81							i++;
82						} else i = 0;
106						if (curMatch > 0 && (i == 0 || parOrTs == 3 || curMatch == parOrTs)) {					
107							i++;			
108							parOrTs = curMatch;
123						if (b == END_TIMESTAMP[i]) {
124							i++;
125						} else i = 0;
145						if (b == END_PARENT_ID[i]) {
146							i++;
147						} else i = 0;
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21