100+ results results for 'i++; source:GoogleCode' (278 ms)
252 Py_UNICODE *v = u; 253 while (*v != 0) { i++; v++; } 254 return i;tArrayIteratorSTL.cc http://casacore.googlecode.com/svn/trunk/ | C++ | 504 lines
60 iters++; 61 i++; 62 }sqWin32Security.c http://openqwaq.googlecode.com/svn/trunk/ | C | 345 lines
70 } 71 i++; 72 } 87 } 88 i++; 89 }x11_image.c https://code.google.com/p/jmupdf/ | C | 704 lines
189 DoRed | DoGreen | DoBlue; 190 i++; 191 }qcommandline.cpp https://code.google.com/p/phantomjs/ | C++ | 536 lines
297 else if (forward) 298 i++; 299 }string.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 406 lines
205 if (n==0) return 0; 206 if (s[0]=='-') i++; 207 while (i<n) { 211 val += (int) (s[i]-'0'); 212 i++; 213 } 284 if (n==0) return false; 285 if (s[i]=='+') i++; 286 if (s[i]=='-') i++; 296 if (n==0) return false; 297 if (s[i]=='+') i++; 298 if (s[i]=='-') i++; 303 if (s[i]=='.') { 304 i++; 305 if (i==n) return false;GetEODData.pl http://quantkit.googlecode.com/svn/ | Perl | 267 lines
93 } 94 $i++; 95 } 129 } 130 $i++; 131 } 164 } 165 $i++; 166 } 199 } 200 $i++; 201 } 231 } 232 $i++; 233 }grdiff.c http://archfs.googlecode.com/svn/trunk/ | C | 351 lines
216 gstrcpy(&revs[i], entry->d_name); 217 i++; 218 };modern_xptheme.cpp http://miranda-dev.googlecode.com/svn/trunk/ | C++ | 270 lines
181 else 182 i++; 183 }VCensor.cs http://pako.googlecode.com/svn/trunk/ | C# | 230 lines
115 { 116 i++; 117 @out.exe("gggggg"); 192 { 193 i++; 194 data += "\n" + pattern.Replace("{1}", i.ToString()).Replace("{2}", sqlite_datareader.GetString(1)).Replace("{3}", sqlite_datareader.GetString(2));RealtimeServer.hx http://caffeine-hx.googlecode.com/svn/trunk/ | Haxe | 291 lines
101 else 102 i++; 103 try { 135 } else 136 i++; 137 }farms_control.php http://scalr.googlecode.com/svn/ | PHP | 222 lines
96 $role = $db->GetOne("SELECT id FROM ami_roles WHERE name=? AND iscompleted='1' AND clientid='{$farminfo['clientid']}'", array($name)); 97 $i++; 98 }SoSubscriptionManager.m http://sope-appserver.googlecode.com/svn/trunk/ | Objective C | 280 lines
65 static int i = 1000; 66 i++; 67 return [NSString stringWithFormat:@"%i", i];install.php http://facturascripts.googlecode.com/svn/trunk/ | PHP | 484 lines
36 $columnas[$i]['defecto'] = $col->defecto; 37 $i++; 38 } 52 $restricciones[$i]['consulta'] = $col->consulta; 53 $i++; 54 }IRNR.java https://code.google.com/p/voteutil/ | Java | 334 lines
29 if ( argv[i].equals( "track" ) ) { 30 i++; 31 voterToTrack = Integer.parseInt( argv[i] ); 300 tallies[i] = (double[]) debugHistory.elementAt( i * 2 + 1 ); 301 i++; 302 }linux_evdev.c http://b207.googlecode.com/svn/trunk/ | C | 344 lines
317 } /* if */ 318 i++; 319 } /* while */strio.c http://cfstox.googlecode.com/svn/trunk/ | C | 582 lines
577 target++; 578 i++; 579 }GeneralAlgorithm.cs http://thoikhoabieu.googlecode.com/svn/ | C# | 320 lines
60 ls.MaCn = variable.Cl.MaCn; 61 i++; 62 }UrlPatternParser.java http://prettyfaces.googlecode.com/svn/trunk/ | Java | 225 lines
122 matcher.appendReplacement(result, parameters[i].toString()); 123 i++; 124 } 198 199 i++; 200 }UnicodeSemantics.cs http://sixpack-library.googlecode.com/svn/trunk/ | C# | 184 lines
105 // get the first "i" so that the lower bound is too much 106 while (i<validRangesLower.Length && validRangesLower[i]<value) i++; 107tre-match-parallel.c http://r4jvm.googlecode.com/svn/trunk/ | C | 502 lines
286 DPRINT(("assertion failed\n")); 287 trans_i++; 288 continue; 300 reach_next_i->tags[*tag_i] = pos; 301 tag_i++; 302 } 312 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; 313 reach_next_i++; 314 } 314 } 315 trans_i++; 316 } 392 reach_i->tags = tmp_iptr; 393 reach_next_i++; 394 }TSV2DataTable.cs http://tab2sql.googlecode.com/svn/trunk/ | C# | 308 lines
80 currentRow = i; 81 i++; 82 }data_cache.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 252 lines
182 int start= i; 183 while (i<n && cached[i] != '\n') i++; 184 string key= cached (start, i); 184 string key= cached (start, i); 185 i++; start= i; 186 while (i<n && (cached[i] != '\n' || 186 while (i<n && (cached[i] != '\n' || 187 !test (cached, i+1, "%-%-tm-cache-%-%"))) i++; 188 string im= cached (start, i); 188 string im= cached (start, i); 189 i++; 190 while (i<n && cached[i] != '\n') i++; 190 while (i<n && cached[i] != '\n') i++; 191 i++; 192 //cout << "key= " << key << "\n----------------------\n";proto.t http://perl5005.googlecode.com/svn/trunk/ | Perl | 459 lines
32 || (defined($p) != defined($c))); 33 printf "ok %d\n",$i++; 34} 51print "not " unless 0 == no_proto(); 52printf "ok %d\n",$i++; 53 54print "not " unless 1 == no_proto(5); 55printf "ok %d\n",$i++; 56 57print "not " unless 4 == &no_proto; 58printf "ok %d\n",$i++; 59 60print "not " unless 1 == no_proto +6; 61printf "ok %d\n",$i++; 62PanelGridRenderer.java http://primefaces.googlecode.com/svn/primefaces/trunk/ | Java | 318 lines
133 134 i++; 135 colMod = i % columns; 151 encodeRow(context, (Row) child, "gridcell", rowStyleClass, PanelGrid.CELL_CLASS); 152 i++; 153 } 236 237 i++; 238 colMod = i % columns;myudf.c http://hy-fluent.googlecode.com/svn/trunk/ | C | 319 lines
150 g_sgrid[i] = c0; 151 i++; 152 }ggg.cpp http://barcodegui.googlecode.com/svn/trunk/ | C++ | 312 lines
140 result+=3*code[i*2+1]+code[i*2]; 141 i++; 142 }AuditLiveTable.cs http://htmlconvertsql.googlecode.com/svn/trunk/ | C# | 287 lines
239 { 240 i++; 241 ProgressBarDelegate.DoSendPMessage(i);String.class.php http://thinkphp.googlecode.com/svn/trunk/ | PHP | 252 lines
72 while($bits > 1){ 73 $i++; 74 $b=ord($str[$i]);cmd.c http://bzzwolfmp.googlecode.com/svn/trunk/ | C | 714 lines
218 { 219 i++; 220 cmd_text.cursize -= i; 695 Com_Printf( "%s\n", cmd->name ); 696 i++; 697 }phase2.php http://skkucogpsylab.googlecode.com/svn/trunk/ | PHP | 325 lines
252 $advice2[$i]=$key; 253 $i++; 254 }fileman.c http://shell-simulator.googlecode.com/svn/trunk/ | C | 427 lines
112 while (line[i] && whitespace (line[i])) 113 i++; 114 word = line + i; 116 while (line[i] && !whitespace (line[i])) 117 i++; 118 131 while (whitespace (line[i])) 132 i++; 133DiscoCB.cs http://pako.googlecode.com/svn/trunk/ | C# | 182 lines
125 126 i++; 127 }auto_run_shell.php http://prohits.googlecode.com/svn/trunk/ | PHP | 332 lines
79 if($tmp_arg) $phpProcess_arr[$tmp_arr[1]][$tmp_arg] = $tmp_arr[$i]; 80 $i++; 81 }GSAutoFight.cpp http://mmo-resourse.googlecode.com/svn/ | C++ | 444 lines
214 215 m_dwStableHookReliveAI++; 216 } 274 } 275 m_dwTimerAI++; 276 SetStableTime(GetStableTime() - 1);KLubCmpl_Blocker.cpp http://mmo-resourse.googlecode.com/svn/ | C++ | 519 lines
22 { 23 i++; 24 continue; 256 UnitsList.RemoveHead(); 257 i++; 258 nLabelNum ++;DependencyHelper.cs http://bistro-framework.googlecode.com/svn/Bistro/trunk/ | C# | 218 lines
154 { 155 i++; 156 }*/IRV.java https://code.google.com/p/voteutil/ | Java | 403 lines
128 max = vote.rating[i]; 129 i++; 130 break; 131 } 132 i++; 133 } 186 tv[i] = ts; 187 i++; 188 } 208 mini = i; 209 i++; 210 break; 211 } 212 i++; 213 }DatastoreMappingManager.java http://datanucleus-appengine.googlecode.com/svn/trunk/ | Java | 304 lines
125 identifier = idFactory.newIdentifier(IdentifierType.COLUMN, fmd.getName() + "_" + i); 126 i++; 127 } 194 identifier = idFactory.newIdentifier(IdentifierType.COLUMN, fmd.getName() + "_" + i); 195 i++; 196 }paper1.aspx.cs http://jqbird.googlecode.com/svn/trunk/ | C# | 198 lines
91 sb.AppendFormat(" {0}</li>" + "\r\n", dt.Rows[i]["OptionName"]); 92 i++; 93 }Traffic.pm http://guanoo.googlecode.com/svn/trunk/ | Perl | 270 lines
168 { 169 $i++; # next event 170ARGB.as http://templelibrary.googlecode.com/svn/trunk/ | ActionScript | 213 lines
192 hex = hex.substr(i); 193 i++; 194 }StringUtil.java http://cyhjason.googlecode.com/svn/trunk/ | Java | 541 lines
234 break; 235 i++; 236 }fl_font_win32.cxx http://luafltk.googlecode.com/svn/trunk/ | C++ | 419 lines
209 fl_fontsize->width[r][i] = s.cx; 210 ii++; 211 } 410 } 411 i++; 412 }TWSETUP.C http://thai-writer.googlecode.com/svn/trunk/TW/ | C | 407 lines
287 else 288 i++; 289 break; 293 { 294 i++; 295 break;activity_list.tpl http://fubon-wcm.googlecode.com/svn/trunk/ | Smarty Template | 225 lines
154 push @sqlAry , $sql; 155 $i++; 156 }ArrayExtensions.as http://breaktrycatchrepo.googlecode.com/svn/trunk/ | ActionScript | 313 lines
242 shuffled[rnd] = item; 243 i++; 244 }DataObject.java http://jumpwisely.googlecode.com/svn/ | Java | 288 lines
258 } 259 i++; 260 }home.php http://ooxx.googlecode.com/svn/trunk/ | PHP | 282 lines
99 query_posts($args);if ( have_posts() ) : while ( have_posts() ) : the_post(); 100 if((in_category('27') && ($bc_key == 0)) || ($bc_i == 5)){$bc_key++;$bc_i++;continue;}else{$bc_i++;} 101 ?> 155 query_posts($args);if ( have_posts() ) : while ( have_posts() ) : the_post(); 156 if((in_category('27') && ($bc_key == 0)) || ($bc_i == 5)){$bc_key++;$bc_i++;continue;}else{$bc_i++;} 157 ?>il_xpm.c http://mmo-resourse.googlecode.com/svn/ | C | 584 lines
385 } 386 i++; // Skip the quotes. 387 400 } 401 i++; // Skip the 'c'. 402ogrili2datasource.cpp http://tcl-map.googlecode.com/svn/trunk/ | C++ | 313 lines
302 while (i < iLayer && layerIt != listLayer.end()) { 303 i++; 304 layerIt++;RunScript.java http://h2database.googlecode.com/svn/trunk/ | Java | 339 lines
121 StringBuilder buff = new StringBuilder(); 122 i++; 123 for (; i < args.length; i++) {list2csv.cs http://tab2sql.googlecode.com/svn/trunk/ | C# | 341 lines
78 } 79 i++; 80 } 92 } 93 i++; 94 } 120 121 i++; 122 } 277 } 278 i++; 279 } 294 295 i++; 296 }NNQuantizer.cpp http://miranda.googlecode.com/svn/trunk/ | C++ | 508 lines
179 else { 180 i++; 181 if (dist < 0) 412 413 i++; 414 if (i % delta == 0) {RoundService.java http://matoso.googlecode.com/svn/trunk/ | Java | 356 lines
346 if (isFilledWithTotal(round.getId())) 347 i++; 348 elseStrings.java http://bitcoinspinner.googlecode.com/svn/trunk/ | Java | 247 lines
137 138 i++; 139 }TopicAssocDep.java http://ontopia.googlecode.com/svn/trunk/ | Java | 399 lines
157 rolenames[i] = "null"; 158 i++; 159 }FormEnumViewer.cs http://cellengine.googlecode.com/svn/trunk/ | C# | 414 lines
120 121 i++; 122 }Stats.cs http://xe8tmw7c.googlecode.com/svn/ | C# | 316 lines
263 if (multi) 264 Kore.Datas.profil.PartyMulti++; 265 if (gagne)C4ClientConfiguration.java http://snova.googlecode.com/svn/trunk/ | Java | 585 lines
522 auth.toString()); 523 i++; 524 }UnmodifiableCollectionTests.java http://google-collections.googlecode.com/svn/trunk/ | Java | 416 lines
88 assertEquals("index " + i, expected, actual); 89 i++; 90 }splitReps.c http://dgpu-ep-htsr-a.googlecode.com/svn/trunk/ | C | 441 lines
427 if ( EdSmallerThanTwin ( i ) ) 428 { i++; } 429 }RemoteResource.as http://icog.googlecode.com/svn/trunk/ | ActionScript | 392 lines
139 140 i++; 141 }jcdctmgr.c http://gamekit.googlecode.com/svn/trunk/ | C | 388 lines
156 aanscalefactor[row] * aanscalefactor[col] * 8.0))); 157 i++; 158 }tap-gsm_astat.c http://cwoodruf-sfu-cmpt.googlecode.com/svn/trunk/ | C | 354 lines
162 163 i++; 164 } 179 180 i++; 181 } 196 197 i++; 198 } 213 214 i++; 215 } 230 231 i++; 232 }ConsultationResultsTag.java https://code.google.com/p/fsnet/ | Java | 273 lines
132 } 133 i++; 134 } 218//// } 219//// i++; 220//// }AbstractArgMultiple.java http://symja.googlecode.com/svn/trunk/ | Java | 262 lines
65 } 66 i++; 67 } 76 77 i++; 78 }remind.php http://decs.googlecode.com/svn/trunk/ | PHP | 311 lines
69 } elseif ($argv[$i] == "--userid") { 70 $i++; 71 $globals->userid = $argv[$i];l_memory.c http://bzzwolfmp.googlecode.com/svn/trunk/ | C | 447 lines
303#endif //MEMDEBUG 304 i++; 305 } //end forContainer.java http://phantom-labs-mc.googlecode.com/svn/trunk/ | Java | 424 lines
371 { 372 i++; 373 }SuppLoginSetup.php http://chronique.googlecode.com/svn/ | PHP | 300 lines
67 $ModulesAllowed .= $_POST[($FormVbl)] . ','; 68 $i++; 69 }frmThemCapNhatHangHangKhong.cs http://qtcs-1041358-1041376-1041378.googlecode.com/svn/trunk/ | C# | 301 lines
94 } 95 i++; 96 }Sftp.cs http://sshsync.googlecode.com/svn/trunk/ | C# | 475 lines
81 if(ii-s>0){ cmds.Add(Util.getString(buf, s, ii-s)); } 82 while(ii<i){if(buf[ii]!=' ')break; ii++;} 83 s=ii;mdown.cc.js http://mdown.googlecode.com/svn/trunk/ | JavaScript | 37 lines
2this.mdown=function(){var b,m,g,h;if(typeof b=="undefined")b={};if(typeof h=="undefined")h={};h.f=function(){};h.f.i=["js","Boot"];h.f.Ba=function(a){return a.split("&").join("&").split("<").join("<").split(">").join(">")};h.f.xb=function(a,c){var d=c!=k?c.fileName+":"+c.lineNumber+": ":"";d+=h.f.Ba(h.f.z(a,""))+"<br/>";var f=document.getElementById("haxe:trace");if(f==k)alert("No haxe:trace element defined\n"+d);else f.innerHTML+=d};h.f.sb=function(){var a=document.getElementById("haxe:trace");if(a!= 3k)a.innerHTML=""};h.f.ya=function(a,c){function d(){return c.apply(a,arguments)}if(c==k)return k;d.scope=a;d.method=c;return d};h.f.z=function(a,c){if(a==k)return"null";if(c.length>=5)return"<...>";var d=typeof a;if(d=="function"&&(a.i!=k||a.O!=k))d="object";switch(d){case "object":if(a instanceof Array){if(a.Z!=k){if(a.length==2)return a[0];d=a[0]+"(";c+="\t";for(var f=2,i=a.length;f<i;){var j=f++;d+=j!=2?","+h.f.z(a[j],c):h.f.z(a[j],c)}return d+")"}f=a.length;d="[";c+="\t";for(i=0;i<f;){j=i++;d+= 4(j>0?",":"")+h.f.z(a[j],c)}d+="]";return d}try{i=a.toString}catch(n){return"???"}if(i!=k&&i!=Object.toString){d=a.toString();if(d!="[object Object]")return d}i=k;d="{\n";c+="\t";f=a.hasOwnProperty!=k;for(i in a)if(!(f&&!a.hasOwnProperty(i)))if(!(i=="prototype"||i=="__class__"||i=="__super__"||i=="__interfaces__")){if(d.length!=2)d+=", \n";d+=c+i+" : "+h.f.z(a[i],c)}c=c.substring(1);d+="\n"+c+"}";return d;case "function":return"<function>";case "string":return a;default:return b.o(a)}};h.f.P=function(a,mdown.js http://mdown.googlecode.com/svn/trunk/ | JavaScript | 976 lines
183 } 184 i++; 185 }Structs.hx http://structs.googlecode.com/svn/trunk/ | Haxe | 769 lines
260 261 i++; 262 }File.pm https://code.google.com/p/lifos/ | Perl | 542 lines
100 else 101 { $i++; }; 102 }; 381 $pathDirectories[$i] = '..'; 382 $i++; 383 };rom.java https://code.google.com/p/lifos/ | Java | 447 lines
40 { 41 i++; 42 }LexLisp.cxx http://anotherclojurebox.googlecode.com/svn/trunk/ | C++ | 549 lines
210 if (ch == '|' && chNext == '#') { 211 i++; 212 chNext = styler.SafeGetCharAt(i + 1); 218 if (chNext == '\"' || chNext == '\'' || chNext == '\\') { 219 i++; 220 chNext = styler.SafeGetCharAt(i + 1); 390 if (chNext == '\"' || chNext == '\'' || chNext == '\\') { 391 i++; 392 chNext = styler.SafeGetCharAt(i + 1); 483 if (chNext == '\"' || chNext == '\'' || chNext == '\\') { 484 i++; 485 chNext = styler.SafeGetCharAt(i + 1);VenSeq.Back3.pl http://dawg-paws.googlecode.com/svn/trunk/ | Perl | 771 lines
208 print "The following files had no BLAST hits:\n"; 209 for (my $i++; $i<=$EmptyFileNum;$i++) 210 {batch_findltr.pl http://dawg-paws.googlecode.com/svn/trunk/ | Perl | 774 lines
183 $fl_params[$i][9] = $in_line[9] || "NULL"; # MAX E Value HMM 184 $i++; 185 } # End of if $num_in_line is 10batch_hmmer.pl http://dawg-paws.googlecode.com/svn/trunk/ | Perl | 764 lines
174 $bh_params[$i][2] = $in_line[2] || "NULL"; # HMMER suffix 175 $i++; 176batch_mask.pl http://dawg-paws.googlecode.com/svn/trunk/ | Perl | 1265 lines
281 282 $i++; 283 }batch_ltrfinder.pl http://dawg-paws.googlecode.com/svn/trunk/ | Perl | 1306 lines
185# $lf_params[$i][9] = $in_line[9] || "NULL"; # MAX E Value HMM 186 $i++; 187 } # End of if $num_in_line is 10FormatLabelControl.cs http://gluar.googlecode.com/svn/trunk/ | C# | 1329 lines
530 Elements.Add(cmd); 531 i++; 532 }DiscoverControl.cs http://gluar.googlecode.com/svn/trunk/ | C# | 713 lines
323 324 i++; 325Row.cs http://gluar.googlecode.com/svn/trunk/ | C# | 1126 lines
101 if (s.Scope != null && s.Scope.CauseIndent) 102 i++; 103SimpleTableModel.java http://jo-widgets.googlecode.com/svn/trunk/ | Java | 576 lines
467 cells[i] = cellBuilder().setText(cellText).build(); 468 i++; 469 }GeoNames.pm http://geo-geonames.googlecode.com/svn/trunk/ | Perl | 738 lines
233 } 234 $i++; 235 } 256 } 257 $i++; 258 } 263 } 264 $i++; 265 }dante.c http://nicola-bonelli-repo.googlecode.com/svn/ | C | 900 lines
105 { if (x[i]=='\n') x[i]=0; \ 106 i++; } \ 107} while (0) 113 { if (x[i]==' ') x[i]='.'; \ 114 i++; } \ 115} while (0)blocksort.c http://r4jvm.googlecode.com/svn/trunk/ | C | 1096 lines
522 ptr[j] = v; 523 i++; 524 536 ptr[j] = v; 537 i++; 538 550 ptr[j] = v; 551 i++; 552preferences.c http://r4jvm.googlecode.com/svn/trunk/ | C | 890 lines
61 if(strcmpi(*pos, col) == 0) return(i); 62 i++; pos++; 63 }g_cntrlify.c http://r4jvm.googlecode.com/svn/trunk/ | C | 815 lines
146 } 147 kanji++; 148 } 431 } 432 kanji++; 433 }texthook.cpp http://interactive-text-hooker.googlecode.com/svn/project/ | C++ | 680 lines
416 { 417 if (it->Address()) i++; 418 //it=hookman+i; 468 { 469 if (it->Address()) i++; 470 if (it==this) continue;protovis.js http://betastasis.googlecode.com/svn/trunk/ | JavaScript | 278 lines
4pv.parent=function(){return this.parent.index};pv.extend=function(b){function c(){}c.prototype=b.prototype||b;return new c}; 5try{eval("pv.parse = function(x) x;")}catch(e){pv.parse=function(b){for(var c=new RegExp("function\\s*(\\b\\w+)?\\s*\\([^)]*\\)\\s*","mg"),d,f,g=0,h="";d=c.exec(b);){d=d.index+d[0].length;if(b.charAt(d)!="{"){h+=b.substring(g,d)+"{return ";g=d;for(var i=0;i>=0&&d<b.length;d++){var j=b.charAt(d);switch(j){case '"':case "'":for(;++d<b.length&&(f=b.charAt(d))!=j;)f=="\\"&&d++;break;case "[":case "(":i++;break;case "]":case ")":i--;break;case ";":case ",":i==0&&i--;break}}h+=pv.parse(b.substring(g,--d))+ 6";}";g=d}c.lastIndex=d}h+=b.substring(g);return h}}pv.css=function(b,c){return window.getComputedStyle?window.getComputedStyle(b,null).getPropertyValue(c):b.currentStyle[c]};pv.error=function(b){typeof console=="undefined"?alert(b):console.error(b)};pv.listen=function(b,c,d){d=pv.listener(d);return b.addEventListener?b.addEventListener(c,d,false):b.attachEvent("on"+c,d)};pv.listener=function(b){return b.$listener||(b.$listener=function(c){try{pv.event=c;return b.call(this,c)}finally{delete pv.event}})};filequeue.php http://viet-group.googlecode.com/svn/trunk/ | PHP | 693 lines
236 $newfile2 = preg_replace( '/(.*)(\.[a-zA-Z]+)$/', '\1_' . $i . '\2', $newfile ); 237 $i++; 238 } 279 $newfile2 = preg_replace( '/(.*)(\.[a-zA-Z]+)$/', '\1_' . $i . '\2', $newfile ); 280 $i++; 281 }StringLib.java http://openwig.googlecode.com/svn/trunk/ | Java | 1503 lines
134 if (c == '%') { 135 i++; 136 BaseLib.luaAssert(i < len, "incomplete option to 'format'"); 166 } 167 i++; 168 BaseLib.luaAssert(i < len, "incomplete option to 'format'"); 175 width = 10 * width + (int) (c - '0'); 176 i++; 177 BaseLib.luaAssert(i < len, "incomplete option to 'format'"); 185 hasPrecision = true; 186 i++; 187 BaseLib.luaAssert(i < len, "incomplete option to 'format'"); 191 precision = 10 * precision + (int) (c - '0'); 192 i++; 193 BaseLib.luaAssert(i < len, "incomplete option to 'format'");bmpfile.c http://libbmp.googlecode.com/svn/trunk/ | C | 711 lines
148 bmp->colors[i].blue = 192; 149 i++; // 8 150 bmp->colors[i].red = 192; 152 bmp->colors[i].blue = 192; 153 i++; // 9 154 bmp->colors[i].red = 166; 162 bmp->colors[i].blue = 240; 163 i++; // 247 164 bmp->colors[i].red = 160; 166 bmp->colors[i].blue = 164; 167 i++; // 248 168 bmp->colors[i].red = 128; 170 bmp->colors[i].blue = 128; 171 i++; // 249 172 bmp->colors[i].red = 255;8puzzle.cpp http://ilove2d.googlecode.com/svn/trunk/ | C++ | 803 lines
629 630 i++; 631 }RawData.java https://code.google.com/p/ifcsoft/ | Java | 556 lines
241 sofar += data.get(i).length; 242 i++; 243 } 256 sofar += data.get(i).length; 257 i++; 258 }SOM.java https://code.google.com/p/ifcsoft/ | Java | 656 lines
178 channelsUsed[channelsUsedI] = i; 179 channelsUsedI++; 180 }FCSLoader.java https://code.google.com/p/ifcsoft/ | Java | 666 lines
112 for ( int shiftBy = 0; shiftBy < 32; shiftBy += 8 ) { 113 accum |= ( (long)( tmp[i] & 0xff ) ) << shiftBy; i++; 114 }linear.cpp http://car-aot.googlecode.com/svn/trunk/ | C++ | 2114 lines
292 I[sizeI] = i; 293 sizeI++; 294 } 507 QD[i] += (xi->value)*(xi->value); 508 xi++; 509 } 542 G[m] += w_i[alpha_index_i[m]]*(xi->value); 543 xi++; 544 } 617 w_i[d_ind[m]] += d_val[m]*xi->value; 618 xi++; 619 } 757 QD[i] += (xi->value)*(xi->value); 758 xi++; 759 }UCCategory.ascx http://lefter.googlecode.com/svn/trunk/ | ASP.NET | 509 lines
360 str += ">" + data[i].CategoryName + "</options>"; 361 i++; 362 }UCItem.ascx http://lefter.googlecode.com/svn/trunk/ | ASP.NET | 561 lines
251 str += ">" + data[i].CategoryName + "</option>"; 252 i++; 253 } 286 } 287 i++; 288 }CIMTool.cs http://seautils.googlecode.com/svn/trunk/ | C# | 573 lines
243 this.desc = this.desc + "\n" + vlsa[i] + " = " + vlma[i]; 244 i++; 245 }ComponentNamerFeature.cs http://lextudio.googlecode.com/svn/trunk/ | C# | 413 lines
167 168 i++; 169EditorAidFeature.cs http://lextudio.googlecode.com/svn/trunk/ | C# | 954 lines
76 } 77 i++; 78 }PrologTokenMarker.java http://tuprolog.googlecode.com/svn/2p/trunk/ | Java | 431 lines
156 { 157 i++; 158 addToken((i+1) - lastOffset,token);SVMNetworkPersistor.cs http://encog-cs.googlecode.com/svn/trunk/ | C# | 433 lines
317 } 318 i++; 319 }BasicFile.cs http://encog-cs.googlecode.com/svn/trunk/ | C# | 540 lines
418 _inputHeadings[i] = "field:" + i; 419 i++; 420 }WtCookie.c http://mod-wtcl.googlecode.com/svn/trunk/ | C | 926 lines
280 } else { 281 i++; 282 } 290 WtCookieSetDomain(cookie, objv[i + 1], interp); 291 i++; 292 } 300 WtCookieSetPath(cookie, objv[i + 1], interp); 301 i++; 302 } 321 } else { 322 i++; 323 }mathemagix_language.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 763 lines
243 if (is_number (s[i])) return; 244 if (postfix && s[i]=='.') i++; 245 while (i<N(s) && belongs_to_identifier (s[i])) i++; 255 if (is_number (s[i])) return; 256 if (postfix && s[i]=='.') i++; 257 while (i<N(s) && belongs_to_identifier (s[i])) { 258 if (s[i]=='$') is_markup= true; 259 i++; 260 } 301 if (is_number (s[i])) return; 302 while ((i<N(s)) && belongs_to_identifier (s[i])) i++; 303 string r= s (pos, i); 311 if (is_number (s[i])) return; 312 while ((i<N(s)) && belongs_to_identifier (s[i])) i++; 313 string r= s (pos, i);url.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 886 lines
102 int start= i, n= N(s); 103 while ((i<n) && (s[i] != sep) && (s[i] != '/')) i++; 104 url u= url_get_atom (s (start, i), type); 115 if (i == n) return url_none (); 116 while ((i<n) && (s[i] != sep)) i++; 117 url u= url_general (s (start, i), type);lazy_paragraph.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 579 lines
265 new_items_sp << items_sp [i]; 266 i++; j++; 267 return; 282 new_items_sp << items_sp [i]; 283 i++; 284 }tree_correct.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 929 lines
192 r << tree ("<assign>"); 193 i++; 194 }parsetex.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 960 lines
91 92 while ((i<n) && is_space (s[i])) i++; 93 while ((i<n) && no_error && 103 t << tuple ("\\nbsp"); 104 i++; 105 break; 108 case '\r': 109 while ((i<n) && ((s[i]==' ') || (s[i]=='\t') || (s[i]=='\r'))) i++; 110 if ((i<n) && (s[i]!='\n')) t << " "; 122 case '%': { 123 while ((i<n) && (s[i]!='\n')) i++; 124 if (i<n) i++; 357 while (i<n && (s[i] == ' ' || s[i] == '\n' || s[i] == '\t')) i++; 358 if (i<n && s[i] == '{') { i++; u= parse (s, i, "}"); i++; } 359 return tree (TUPLE, "\\href", ss, u);converter.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 674 lines
202 start= i= i+2; 203 while (i<n && input[i] != '>') i++; 204 r << encode_as_utf8 (from_hexadecimal (input (start, i))); 219 start= i= i+2; 220 while (i<n && input[i] != '>') i++; 221 r << encode_as_utf8 (from_hexadecimal (input (start, i))); 448 else { 449 i++; 450 unsigned int num = 0; 489 val += (int) (s[i]-'0'); 490 i++; 491 }analyze.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 1290 lines
212 } 213 i++; 214 } 424 int start= ++i; 425 while ((i<n) && (s[i]!='_')) i++; 426 r << (char) ((unsigned char) as_int (s (start, i))); 440 int start= ++i; 441 while ((i<n) && (s[i]!='>')) i++; 442 r << "&" << tm_to_xml_name (s (start, i)) << ";"; 458 else { 459 int start= i++; 460 while ((i<n) && (s[i]!='>')) i++; 488 int start= ++i; 489 while ((i<n) && (s[i]!=';')) i++; 490 string x= "<" * xml_name_to_tm (s (start, i)) * ">";tm_data.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 902 lines
477 } 478 else i++; 479 }edit_dynamic.cpp http://itexmacs.googlecode.com/svn/trunk/ | C++ | 646 lines
194 if ((!in_source ()) || drd->contains (as_string (L(t)))) { 195 if (forward) do i++; while ((i<=n) && (!drd->insert_point (L(t), i, n))); 196 else while ((i>=0) && (!drd->insert_point (L(t), i, n))) i--; 199 } 200 else if (forward) i++; 201 path q= path_up (p) * i; 283 if ((!in_source ()) || drd->contains (as_string (L(t)))) { 284 if (forward) do i++; while (i<=n && !drd->insert_point (L(t), i, n)); 285 else while (i>=0 && !drd->insert_point (L(t), i, n)) i--; 290 else { 291 if (forward) i++; 292 if (i<d || n<=d) return;pdfdev.c http://itexmacs.googlecode.com/svn/trunk/ | C | 2020 lines
162 f = 0; 163 i++; 164 }